3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
22 #define CHECKCALL this->*check
24 #define CHECKCALL *check
28 * In the following definition, the ", Nullop" is just to make the compiler
29 * think the expression is of the right type: croak actually does a Siglongjmp.
31 #define CHECKOP(type,o) \
32 ((PL_op_mask && PL_op_mask[type]) \
33 ? ( op_free((OP*)o), \
34 croak("%s trapped by operation mask", op_desc[type]), \
36 : (CHECKCALL[type])((OP*)o))
38 static bool scalar_mod_type _((OP *o, I32 type));
40 static I32 list_assignment _((OP *o));
41 static void bad_type _((I32 n, char *t, char *name, OP *kid));
42 static OP *modkids _((OP *o, I32 type));
43 static OP *no_fh_allowed _((OP *o));
44 static OP *scalarboolean _((OP *o));
45 static OP *too_few_arguments _((OP *o, char* name));
46 static OP *too_many_arguments _((OP *o, char* name));
47 static void null _((OP* o));
48 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
49 CV* startcv, I32 cx_ix));
50 static OP *newDEFSVOP _((void));
51 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
57 SV* tmpsv = sv_newmortal();
58 gv_efullname3(tmpsv, gv, Nullch);
59 return SvPV(tmpsv,PL_na);
65 yyerror(form("Missing comma after first argument to %s function",
66 op_desc[o->op_type]));
71 too_few_arguments(OP *o, char *name)
73 yyerror(form("Not enough arguments for %s", name));
78 too_many_arguments(OP *o, char *name)
80 yyerror(form("Too many arguments for %s", name));
85 bad_type(I32 n, char *t, char *name, OP *kid)
87 yyerror(form("Type of arg %d to %s must be %s (not %s)",
88 (int)n, name, t, op_desc[kid->op_type]));
94 int type = o->op_type;
95 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
96 yyerror(form("Can't use subscript on %s", op_desc[type]));
97 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
100 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
101 type == OP_ENTERSUB ? '&' : '%'));
105 sv_catsv(GvSV(PL_errgv), msg);
107 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
112 /* "register" allocation */
115 pad_allocmy(char *name)
121 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
122 if (!isPRINT(name[1])) {
124 name[2] = toCTRL(name[1]);
127 croak("Can't use global %s in \"my\"",name);
129 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
130 SV **svp = AvARRAY(PL_comppad_name);
131 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
133 && sv != &PL_sv_undef
134 && SvIVX(sv) == 999999999 /* var is in open scope */
135 && strEQ(name, SvPVX(sv)))
138 "\"my\" variable %s masks earlier declaration in same scope",
144 off = pad_alloc(OP_PADSV, SVs_PADMY);
146 sv_upgrade(sv, SVt_PVNV);
148 if (PL_in_my_stash) {
150 croak("Can't declare class for non-scalar %s in \"my\"",name);
152 (void)SvUPGRADE(sv, SVt_PVMG);
153 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
156 av_store(PL_comppad_name, off, sv);
157 SvNVX(sv) = (double)999999999;
158 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
159 if (!PL_min_intro_pending)
160 PL_min_intro_pending = off;
161 PL_max_intro_pending = off;
163 av_store(PL_comppad, off, (SV*)newAV());
164 else if (*name == '%')
165 av_store(PL_comppad, off, (SV*)newHV());
166 SvPADMY_on(PL_curpad[off]);
171 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
178 register PERL_CONTEXT *cx;
181 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
182 AV *curlist = CvPADLIST(cv);
183 SV **svp = av_fetch(curlist, 0, FALSE);
186 if (!svp || *svp == &PL_sv_undef)
189 svp = AvARRAY(curname);
190 for (off = AvFILLp(curname); off > 0; off--) {
191 if ((sv = svp[off]) &&
192 sv != &PL_sv_undef &&
194 seq > I_32(SvNVX(sv)) &&
195 strEQ(SvPVX(sv), name))
206 return 0; /* don't clone from inactive stack frame */
210 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
211 oldsv = *av_fetch(oldpad, off, TRUE);
212 if (!newoff) { /* Not a mere clone operation. */
213 SV *namesv = NEWSV(1103,0);
214 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
215 sv_upgrade(namesv, SVt_PVNV);
216 sv_setpv(namesv, name);
217 av_store(PL_comppad_name, newoff, namesv);
218 SvNVX(namesv) = (double)PL_curcop->cop_seq;
219 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
220 SvFAKE_on(namesv); /* A ref, not a real var */
221 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
222 /* "It's closures all the way down." */
223 CvCLONE_on(PL_compcv);
225 if (CvANON(PL_compcv))
226 oldsv = Nullsv; /* no need to keep ref */
231 bcv && bcv != cv && !CvCLONE(bcv);
232 bcv = CvOUTSIDE(bcv)) {
236 if (ckWARN(WARN_CLOSURE) && !CvUNIQUE(cv))
238 "Variable \"%s\" may be unavailable",
245 else if (!CvUNIQUE(PL_compcv)) {
246 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
248 "Variable \"%s\" will not stay shared", name);
251 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
257 /* Nothing in current lexical context--try eval's context, if any.
258 * This is necessary to let the perldb get at lexically scoped variables.
259 * XXX This will also probably interact badly with eval tree caching.
263 for (i = cx_ix; i >= 0; i--) {
265 switch (cx->cx_type) {
267 if (i == 0 && saweval) {
268 seq = cxstack[saweval].blk_oldcop->cop_seq;
269 return pad_findlex(name, newoff, seq, PL_main_cv, 0);
273 switch (cx->blk_eval.old_op_type) {
278 /* require must have its own scope */
286 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
287 saweval = i; /* so we know where we were called from */
290 seq = cxstack[saweval].blk_oldcop->cop_seq;
291 return pad_findlex(name, newoff, seq, cv, i-1);
299 pad_findmy(char *name)
305 SV **svp = AvARRAY(PL_comppad_name);
306 U32 seq = PL_cop_seqmax;
310 * Special case to get lexical (and hence per-thread) @_.
311 * XXX I need to find out how to tell at parse-time whether use
312 * of @_ should refer to a lexical (from a sub) or defgv (global
313 * scope and maybe weird sub-ish things like formats). See
314 * startsub in perly.y. It's possible that @_ could be lexical
315 * (at least from subs) even in non-threaded perl.
317 if (strEQ(name, "@_"))
318 return 0; /* success. (NOT_IN_PAD indicates failure) */
319 #endif /* USE_THREADS */
321 /* The one we're looking for is probably just before comppad_name_fill. */
322 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
323 if ((sv = svp[off]) &&
324 sv != &PL_sv_undef &&
327 seq > I_32(SvNVX(sv)))) &&
328 strEQ(SvPVX(sv), name))
331 return (PADOFFSET)off;
332 pendoff = off; /* this pending def. will override import */
336 /* See if it's in a nested scope */
337 off = pad_findlex(name, 0, seq, CvOUTSIDE(PL_compcv), cxstack_ix);
339 /* If there is a pending local definition, this new alias must die */
341 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
342 return off; /* pad_findlex returns 0 for failure...*/
344 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
348 pad_leavemy(I32 fill)
351 SV **svp = AvARRAY(PL_comppad_name);
353 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
354 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
355 if ((sv = svp[off]) && sv != &PL_sv_undef)
356 warn("%s never introduced", SvPVX(sv));
359 /* "Deintroduce" my variables that are leaving with this scope. */
360 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
361 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == 999999999)
362 SvIVX(sv) = PL_cop_seqmax;
367 pad_alloc(I32 optype, U32 tmptype)
373 if (AvARRAY(PL_comppad) != PL_curpad)
374 croak("panic: pad_alloc");
375 if (PL_pad_reset_pending)
377 if (tmptype & SVs_PADMY) {
379 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
380 } while (SvPADBUSY(sv)); /* need a fresh one */
381 retval = AvFILLp(PL_comppad);
384 SV **names = AvARRAY(PL_comppad_name);
385 SSize_t names_fill = AvFILLp(PL_comppad_name);
388 * "foreach" index vars temporarily become aliases to non-"my"
389 * values. Thus we must skip, not just pad values that are
390 * marked as current pad values, but also those with names.
392 if (++PL_padix <= names_fill &&
393 (sv = names[PL_padix]) && sv != &PL_sv_undef)
395 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
396 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
401 SvFLAGS(sv) |= tmptype;
402 PL_curpad = AvARRAY(PL_comppad);
404 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
405 (unsigned long) thr, (unsigned long) PL_curpad,
406 (long) retval, op_name[optype]));
408 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
409 (unsigned long) PL_curpad,
410 (long) retval, op_name[optype]));
411 #endif /* USE_THREADS */
412 return (PADOFFSET)retval;
420 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
421 (unsigned long) thr, (unsigned long) PL_curpad, po));
424 croak("panic: pad_sv po");
425 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
426 (unsigned long) PL_curpad, po));
427 #endif /* USE_THREADS */
428 return PL_curpad[po]; /* eventually we'll turn this into a macro */
432 pad_free(PADOFFSET po)
437 if (AvARRAY(PL_comppad) != PL_curpad)
438 croak("panic: pad_free curpad");
440 croak("panic: pad_free po");
442 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
443 (unsigned long) thr, (unsigned long) PL_curpad, po));
445 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
446 (unsigned long) PL_curpad, po));
447 #endif /* USE_THREADS */
448 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
449 SvPADTMP_off(PL_curpad[po]);
450 if ((I32)po < PL_padix)
455 pad_swipe(PADOFFSET po)
458 if (AvARRAY(PL_comppad) != PL_curpad)
459 croak("panic: pad_swipe curpad");
461 croak("panic: pad_swipe po");
463 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
464 (unsigned long) thr, (unsigned long) PL_curpad, po));
466 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
467 (unsigned long) PL_curpad, po));
468 #endif /* USE_THREADS */
469 SvPADTMP_off(PL_curpad[po]);
470 PL_curpad[po] = NEWSV(1107,0);
471 SvPADTMP_on(PL_curpad[po]);
472 if ((I32)po < PL_padix)
476 /* XXX pad_reset() is currently disabled because it results in serious bugs.
477 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
478 * on the stack by OPs that use them, there are several ways to get an alias
479 * to a shared TARG. Such an alias will change randomly and unpredictably.
480 * We avoid doing this until we can think of a Better Way.
485 #ifdef USE_BROKEN_PAD_RESET
489 if (AvARRAY(PL_comppad) != PL_curpad)
490 croak("panic: pad_reset curpad");
492 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
493 (unsigned long) thr, (unsigned long) PL_curpad));
495 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
496 (unsigned long) PL_curpad));
497 #endif /* USE_THREADS */
498 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
499 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
500 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
501 SvPADTMP_off(PL_curpad[po]);
503 PL_padix = PL_padix_floor;
506 PL_pad_reset_pending = FALSE;
510 /* find_threadsv is not reentrant */
512 find_threadsv(char *name)
518 /* We currently only handle names of a single character */
519 p = strchr(PL_threadsv_names, *name);
522 key = p - PL_threadsv_names;
523 svp = av_fetch(thr->threadsv, key, FALSE);
525 SV *sv = NEWSV(0, 0);
526 av_store(thr->threadsv, key, sv);
527 thr->threadsvp = AvARRAY(thr->threadsv);
529 * Some magic variables used to be automagically initialised
530 * in gv_fetchpv. Those which are now per-thread magicals get
531 * initialised here instead.
537 sv_setpv(sv, "\034");
538 sv_magic(sv, 0, 0, name, 1);
543 PL_sawampersand = TRUE;
547 /* XXX %! tied to Errno.pm needs to be added here.
548 * See gv_fetchpv(). */
552 sv_magic(sv, 0, 0, name, 1);
554 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
555 "find_threadsv: new SV %p for $%s%c\n",
556 sv, (*name < 32) ? "^" : "",
557 (*name < 32) ? toCTRL(*name) : *name));
561 #endif /* USE_THREADS */
568 register OP *kid, *nextkid;
570 if (!o || o->op_seq == (U16)-1)
573 if (o->op_flags & OPf_KIDS) {
574 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
575 nextkid = kid->op_sibling; /* Get before next freeing kid */
580 switch (o->op_type) {
582 o->op_targ = 0; /* Was holding old type, if any. */
585 o->op_targ = 0; /* Was holding hints. */
589 if (!(o->op_flags & OPf_SPECIAL))
593 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
595 #endif /* USE_THREADS */
597 if (!(o->op_flags & OPf_REF)
598 || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
604 SvREFCNT_dec(cGVOPo->op_gv);
608 Safefree(cCOPo->cop_label);
609 SvREFCNT_dec(cCOPo->cop_filegv);
610 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
611 SvREFCNT_dec(cCOPo->cop_warnings);
614 SvREFCNT_dec(cSVOPo->op_sv);
620 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
624 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
625 SvREFCNT_dec(cSVOPo->op_sv);
627 Safefree(cPVOPo->op_pv);
630 op_free(cPMOPo->op_pmreplroot);
635 ReREFCNT_dec(cPMOPo->op_pmregexp);
640 pad_free(o->op_targ);
648 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
649 pad_free(o->op_targ);
650 o->op_targ = o->op_type;
651 o->op_type = OP_NULL;
652 o->op_ppaddr = ppaddr[OP_NULL];
655 /* Contextualizers */
657 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
667 /* establish postfix order */
668 if (cUNOPo->op_first) {
669 o->op_next = LINKLIST(cUNOPo->op_first);
670 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
672 kid->op_next = LINKLIST(kid->op_sibling);
687 if (o && o->op_flags & OPf_KIDS) {
688 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
697 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
699 if (ckWARN(WARN_SYNTAX)) {
700 line_t oldline = PL_curcop->cop_line;
702 if (PL_copline != NOLINE)
703 PL_curcop->cop_line = PL_copline;
704 warner(WARN_SYNTAX, "Found = in conditional, should be ==");
705 PL_curcop->cop_line = oldline;
716 /* assumes no premature commitment */
717 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
718 || o->op_type == OP_RETURN)
721 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
723 switch (o->op_type) {
725 if (o->op_private & OPpREPEAT_DOLIST)
726 null(((LISTOP*)cBINOPo->op_first)->op_first);
727 scalar(cBINOPo->op_first);
732 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
736 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
737 if (!kPMOP->op_pmreplroot)
738 deprecate("implicit split to @_");
746 if (o->op_flags & OPf_KIDS) {
747 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
753 kid = cLISTOPo->op_first;
755 while (kid = kid->op_sibling) {
761 WITH_THR(PL_curcop = &PL_compiling);
766 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
772 WITH_THR(PL_curcop = &PL_compiling);
785 /* assumes no premature commitment */
786 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || PL_error_count
787 || o->op_type == OP_RETURN)
790 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
792 switch (o->op_type) {
794 if (!(opargs[o->op_type] & OA_FOLDCONST))
798 if (o->op_flags & OPf_STACKED)
802 if (o->op_private == 4)
873 if (!(o->op_private & OPpLVAL_INTRO))
874 useless = op_desc[o->op_type];
881 if (!(o->op_private & OPpLVAL_INTRO) &&
882 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
883 useless = "a variable";
888 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
895 if (ckWARN(WARN_VOID)) {
896 useless = "a constant";
897 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
899 else if (SvPOK(sv)) {
900 if (strnEQ(SvPVX(sv), "di", 2) ||
901 strnEQ(SvPVX(sv), "ds", 2) ||
902 strnEQ(SvPVX(sv), "ig", 2))
907 null(o); /* don't execute a constant */
908 SvREFCNT_dec(sv); /* don't even remember it */
912 o->op_type = OP_PREINC; /* pre-increment is faster */
913 o->op_ppaddr = ppaddr[OP_PREINC];
917 o->op_type = OP_PREDEC; /* pre-decrement is faster */
918 o->op_ppaddr = ppaddr[OP_PREDEC];
924 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
929 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
930 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
931 if (o->op_flags & OPf_STACKED)
937 if (!(o->op_flags & OPf_KIDS))
946 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
953 /* all requires must return a boolean value */
954 o->op_flags &= ~OPf_WANT;
957 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
958 if (!kPMOP->op_pmreplroot)
959 deprecate("implicit split to @_");
965 if (ckWARN(WARN_VOID))
966 warner(WARN_VOID, "Useless use of %s in void context", useless);
975 if (o && o->op_flags & OPf_KIDS) {
976 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
987 /* assumes no premature commitment */
988 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
989 || o->op_type == OP_RETURN)
992 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
994 switch (o->op_type) {
997 list(cBINOPo->op_first);
1002 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1010 if (!(o->op_flags & OPf_KIDS))
1012 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1013 list(cBINOPo->op_first);
1014 return gen_constant_list(o);
1021 kid = cLISTOPo->op_first;
1023 while (kid = kid->op_sibling) {
1024 if (kid->op_sibling)
1029 WITH_THR(PL_curcop = &PL_compiling);
1033 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1034 if (kid->op_sibling)
1039 WITH_THR(PL_curcop = &PL_compiling);
1042 /* all requires must return a boolean value */
1043 o->op_flags &= ~OPf_WANT;
1055 if (o->op_type == OP_LINESEQ ||
1056 o->op_type == OP_SCOPE ||
1057 o->op_type == OP_LEAVE ||
1058 o->op_type == OP_LEAVETRY)
1061 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1062 if (kid->op_sibling) {
1066 PL_curcop = &PL_compiling;
1068 o->op_flags &= ~OPf_PARENS;
1069 if (PL_hints & HINT_BLOCK_SCOPE)
1070 o->op_flags |= OPf_PARENS;
1073 o = newOP(OP_STUB, 0);
1078 modkids(OP *o, I32 type)
1081 if (o && o->op_flags & OPf_KIDS) {
1082 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1089 mod(OP *o, I32 type)
1095 if (!o || PL_error_count)
1098 switch (o->op_type) {
1103 if (!(o->op_private & (OPpCONST_ARYBASE)))
1105 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1106 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1110 SAVEI32(PL_compiling.cop_arybase);
1111 PL_compiling.cop_arybase = 0;
1113 else if (type == OP_REFGEN)
1116 croak("That use of $[ is unsupported");
1119 if (o->op_flags & OPf_PARENS)
1123 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1124 !(o->op_flags & OPf_STACKED)) {
1125 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1126 o->op_ppaddr = ppaddr[OP_RV2CV];
1127 assert(cUNOPo->op_first->op_type == OP_NULL);
1128 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1134 /* grep, foreach, subcalls, refgen */
1135 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1137 yyerror(form("Can't modify %s in %s",
1138 op_desc[o->op_type],
1139 type ? op_desc[type] : "local"));
1153 case OP_RIGHT_SHIFT:
1162 if (!(o->op_flags & OPf_STACKED))
1168 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1174 if (!type && cUNOPo->op_first->op_type != OP_GV)
1175 croak("Can't localize through a reference");
1176 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1177 PL_modcount = 10000;
1178 return o; /* Treat \(@foo) like ordinary list. */
1182 if (scalar_mod_type(o, type))
1184 ref(cUNOPo->op_first, o->op_type);
1193 PL_modcount = 10000;
1196 if (!type && cUNOPo->op_first->op_type != OP_GV)
1197 croak("Can't localize through a reference");
1198 ref(cUNOPo->op_first, o->op_type);
1202 PL_hints |= HINT_BLOCK_SCOPE;
1210 PL_modcount = 10000;
1211 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1212 return o; /* Treat \(@foo) like ordinary list. */
1213 if (scalar_mod_type(o, type))
1219 croak("Can't localize lexical variable %s",
1220 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), PL_na));
1225 PL_modcount++; /* XXX ??? */
1227 #endif /* USE_THREADS */
1233 if (type != OP_SASSIGN)
1237 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1243 pad_free(o->op_targ);
1244 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1245 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1246 if (o->op_flags & OPf_KIDS)
1247 mod(cBINOPo->op_first->op_sibling, type);
1252 ref(cBINOPo->op_first, o->op_type);
1253 if (type == OP_ENTERSUB &&
1254 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1255 o->op_private |= OPpLVAL_DEFER;
1262 if (o->op_flags & OPf_KIDS)
1263 mod(cLISTOPo->op_last, type);
1267 if (!(o->op_flags & OPf_KIDS))
1269 if (o->op_targ != OP_LIST) {
1270 mod(cBINOPo->op_first, type);
1275 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1279 o->op_flags |= OPf_MOD;
1281 if (type == OP_AASSIGN || type == OP_SASSIGN)
1282 o->op_flags |= OPf_SPECIAL|OPf_REF;
1284 o->op_private |= OPpLVAL_INTRO;
1285 o->op_flags &= ~OPf_SPECIAL;
1286 PL_hints |= HINT_BLOCK_SCOPE;
1288 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1289 o->op_flags |= OPf_REF;
1294 scalar_mod_type(OP *o, I32 type)
1298 if (o->op_type == OP_RV2GV)
1322 case OP_RIGHT_SHIFT:
1332 case OP_ANDASSIGN: /* may work later */
1333 case OP_ORASSIGN: /* may work later */
1341 refkids(OP *o, I32 type)
1344 if (o && o->op_flags & OPf_KIDS) {
1345 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1352 ref(OP *o, I32 type)
1356 if (!o || PL_error_count)
1359 switch (o->op_type) {
1361 if ((type == OP_DEFINED || type == OP_LOCK) &&
1362 !(o->op_flags & OPf_STACKED)) {
1363 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1364 o->op_ppaddr = ppaddr[OP_RV2CV];
1365 assert(cUNOPo->op_first->op_type == OP_NULL);
1366 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1367 o->op_flags |= OPf_SPECIAL;
1372 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1376 ref(cUNOPo->op_first, o->op_type);
1379 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1380 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1381 : type == OP_RV2HV ? OPpDEREF_HV
1383 o->op_flags |= OPf_MOD;
1388 o->op_flags |= OPf_MOD; /* XXX ??? */
1393 o->op_flags |= OPf_REF;
1396 ref(cUNOPo->op_first, o->op_type);
1401 o->op_flags |= OPf_REF;
1406 if (!(o->op_flags & OPf_KIDS))
1408 ref(cBINOPo->op_first, type);
1412 ref(cBINOPo->op_first, o->op_type);
1413 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1414 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1415 : type == OP_RV2HV ? OPpDEREF_HV
1417 o->op_flags |= OPf_MOD;
1425 if (!(o->op_flags & OPf_KIDS))
1427 ref(cLISTOPo->op_last, type);
1442 if (!o || PL_error_count)
1446 if (type == OP_LIST) {
1447 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1449 } else if (type == OP_UNDEF) {
1451 } else if (type != OP_PADSV &&
1454 type != OP_PUSHMARK)
1456 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1459 o->op_flags |= OPf_MOD;
1460 o->op_private |= OPpLVAL_INTRO;
1468 o->op_flags |= OPf_PARENS;
1473 bind_match(I32 type, OP *left, OP *right)
1478 if (ckWARN(WARN_UNSAFE) &&
1479 (left->op_type == OP_RV2AV ||
1480 left->op_type == OP_RV2HV ||
1481 left->op_type == OP_PADAV ||
1482 left->op_type == OP_PADHV)) {
1483 char *desc = op_desc[(right->op_type == OP_SUBST ||
1484 right->op_type == OP_TRANS)
1485 ? right->op_type : OP_MATCH];
1486 char *sample = ((left->op_type == OP_RV2AV ||
1487 left->op_type == OP_PADAV)
1488 ? "@array" : "%hash");
1490 "Applying %s to %s will act on scalar(%s)",
1491 desc, sample, sample);
1494 if (right->op_type == OP_MATCH ||
1495 right->op_type == OP_SUBST ||
1496 right->op_type == OP_TRANS) {
1497 right->op_flags |= OPf_STACKED;
1498 if (right->op_type != OP_MATCH)
1499 left = mod(left, right->op_type);
1500 if (right->op_type == OP_TRANS)
1501 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1503 o = prepend_elem(right->op_type, scalar(left), right);
1505 return newUNOP(OP_NOT, 0, scalar(o));
1509 return bind_match(type, left,
1510 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1518 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1519 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1526 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1527 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1528 o->op_type = OP_LEAVE;
1529 o->op_ppaddr = ppaddr[OP_LEAVE];
1532 if (o->op_type == OP_LINESEQ) {
1534 o->op_type = OP_SCOPE;
1535 o->op_ppaddr = ppaddr[OP_SCOPE];
1536 kid = ((LISTOP*)o)->op_first;
1537 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1538 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1543 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1553 SAVESPTR(GvHV(PL_hintgv));
1554 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1555 SAVEFREESV(GvHV(PL_hintgv));
1559 block_start(int full)
1562 int retval = PL_savestack_ix;
1564 SAVEI32(PL_comppad_name_floor);
1566 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1567 PL_comppad_name_floor = PL_comppad_name_fill;
1569 PL_comppad_name_floor = 0;
1571 SAVEI32(PL_min_intro_pending);
1572 SAVEI32(PL_max_intro_pending);
1573 PL_min_intro_pending = 0;
1574 SAVEI32(PL_comppad_name_fill);
1575 SAVEI32(PL_padix_floor);
1576 PL_padix_floor = PL_padix;
1577 PL_pad_reset_pending = FALSE;
1579 PL_hints &= ~HINT_BLOCK_SCOPE;
1580 SAVEPPTR(compiling.cop_warnings);
1581 if (PL_compiling.cop_warnings != WARN_ALL &&
1582 PL_compiling.cop_warnings != WARN_NONE) {
1583 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1584 SAVEFREESV(PL_compiling.cop_warnings) ;
1592 block_end(I32 floor, OP *seq)
1595 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1596 OP* retval = scalarseq(seq);
1598 PL_pad_reset_pending = FALSE;
1599 compiling.op_private = PL_hints;
1601 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1602 pad_leavemy(PL_comppad_name_fill);
1611 OP *o = newOP(OP_THREADSV, 0);
1612 o->op_targ = find_threadsv("_");
1615 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1616 #endif /* USE_THREADS */
1624 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1625 PL_eval_start = linklist(PL_eval_root);
1626 PL_eval_root->op_next = 0;
1627 peep(PL_eval_start);
1632 PL_main_root = scope(sawparens(scalarvoid(o)));
1633 PL_curcop = &PL_compiling;
1634 PL_main_start = LINKLIST(PL_main_root);
1635 PL_main_root->op_next = 0;
1636 peep(PL_main_start);
1639 /* Register with debugger */
1641 CV *cv = perl_get_cv("DB::postponed", FALSE);
1645 XPUSHs((SV*)PL_compiling.cop_filegv);
1647 perl_call_sv((SV*)cv, G_DISCARD);
1654 localize(OP *o, I32 lex)
1656 if (o->op_flags & OPf_PARENS)
1660 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1662 for (s = PL_bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1663 if (*s == ';' || *s == '=')
1664 warner(WARN_PARENTHESIS, "Parens missing around \"%s\" list",
1665 lex ? "my" : "local");
1669 PL_in_my_stash = Nullhv;
1673 return mod(o, OP_NULL); /* a bit kludgey */
1679 if (o->op_type == OP_LIST) {
1682 o2 = newOP(OP_THREADSV, 0);
1683 o2->op_targ = find_threadsv(";");
1685 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1686 #endif /* USE_THREADS */
1687 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1693 fold_constants(register OP *o)
1697 I32 type = o->op_type;
1700 if (opargs[type] & OA_RETSCALAR)
1702 if (opargs[type] & OA_TARGET)
1703 o->op_targ = pad_alloc(type, SVs_PADTMP);
1705 if ((opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1706 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1708 if (!(opargs[type] & OA_FOLDCONST))
1723 if (o->op_private & OPpLOCALE)
1728 goto nope; /* Don't try to run w/ errors */
1730 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1731 if (curop->op_type != OP_CONST &&
1732 curop->op_type != OP_LIST &&
1733 curop->op_type != OP_SCALAR &&
1734 curop->op_type != OP_NULL &&
1735 curop->op_type != OP_PUSHMARK) {
1740 curop = LINKLIST(o);
1744 sv = *(PL_stack_sp--);
1745 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1746 pad_swipe(o->op_targ);
1747 else if (SvTEMP(sv)) { /* grab mortal temp? */
1748 (void)SvREFCNT_inc(sv);
1752 if (type == OP_RV2GV)
1753 return newGVOP(OP_GV, 0, (GV*)sv);
1755 /* try to smush double to int, but don't smush -2.0 to -2 */
1756 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1760 if ((double)iv == SvNV(sv)) {
1765 SvIOK_off(sv); /* undo SvIV() damage */
1767 return newSVOP(OP_CONST, 0, sv);
1771 if (!(opargs[type] & OA_OTHERINT))
1774 if (!(PL_hints & HINT_INTEGER)) {
1775 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1778 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1779 if (curop->op_type == OP_CONST) {
1780 if (SvIOK(((SVOP*)curop)->op_sv))
1784 if (opargs[curop->op_type] & OA_RETINTEGER)
1788 o->op_ppaddr = ppaddr[++(o->op_type)];
1795 gen_constant_list(register OP *o)
1799 I32 oldtmps_floor = PL_tmps_floor;
1803 return o; /* Don't attempt to run with errors */
1805 PL_op = curop = LINKLIST(o);
1811 PL_tmps_floor = oldtmps_floor;
1813 o->op_type = OP_RV2AV;
1814 o->op_ppaddr = ppaddr[OP_RV2AV];
1815 curop = ((UNOP*)o)->op_first;
1816 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1823 convert(I32 type, I32 flags, OP *o)
1828 if (!o || o->op_type != OP_LIST)
1829 o = newLISTOP(OP_LIST, 0, o, Nullop);
1831 o->op_flags &= ~OPf_WANT;
1833 if (!(opargs[type] & OA_MARK))
1834 null(cLISTOPo->op_first);
1837 o->op_ppaddr = ppaddr[type];
1838 o->op_flags |= flags;
1840 o = CHECKOP(type, o);
1841 if (o->op_type != type)
1844 if (cLISTOPo->op_children < 7) {
1845 /* XXX do we really need to do this if we're done appending?? */
1846 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1848 cLISTOPo->op_last = last; /* in case check substituted last arg */
1851 return fold_constants(o);
1854 /* List constructors */
1857 append_elem(I32 type, OP *first, OP *last)
1865 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1866 return newLISTOP(type, 0, first, last);
1868 if (first->op_flags & OPf_KIDS)
1869 ((LISTOP*)first)->op_last->op_sibling = last;
1871 first->op_flags |= OPf_KIDS;
1872 ((LISTOP*)first)->op_first = last;
1874 ((LISTOP*)first)->op_last = last;
1875 ((LISTOP*)first)->op_children++;
1880 append_list(I32 type, LISTOP *first, LISTOP *last)
1888 if (first->op_type != type)
1889 return prepend_elem(type, (OP*)first, (OP*)last);
1891 if (last->op_type != type)
1892 return append_elem(type, (OP*)first, (OP*)last);
1894 first->op_last->op_sibling = last->op_first;
1895 first->op_last = last->op_last;
1896 first->op_children += last->op_children;
1897 if (first->op_children)
1898 last->op_flags |= OPf_KIDS;
1905 prepend_elem(I32 type, OP *first, OP *last)
1913 if (last->op_type == type) {
1914 if (type == OP_LIST) { /* already a PUSHMARK there */
1915 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1916 ((LISTOP*)last)->op_first->op_sibling = first;
1919 if (!(last->op_flags & OPf_KIDS)) {
1920 ((LISTOP*)last)->op_last = first;
1921 last->op_flags |= OPf_KIDS;
1923 first->op_sibling = ((LISTOP*)last)->op_first;
1924 ((LISTOP*)last)->op_first = first;
1926 ((LISTOP*)last)->op_children++;
1930 return newLISTOP(type, 0, first, last);
1938 return newOP(OP_STUB, 0);
1944 if (!o || o->op_type != OP_LIST)
1945 o = newLISTOP(OP_LIST, 0, o, Nullop);
1951 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1955 Newz(1101, listop, 1, LISTOP);
1957 listop->op_type = type;
1958 listop->op_ppaddr = ppaddr[type];
1959 listop->op_children = (first != 0) + (last != 0);
1960 listop->op_flags = flags;
1964 else if (!first && last)
1967 first->op_sibling = last;
1968 listop->op_first = first;
1969 listop->op_last = last;
1970 if (type == OP_LIST) {
1972 pushop = newOP(OP_PUSHMARK, 0);
1973 pushop->op_sibling = first;
1974 listop->op_first = pushop;
1975 listop->op_flags |= OPf_KIDS;
1977 listop->op_last = pushop;
1979 else if (listop->op_children)
1980 listop->op_flags |= OPf_KIDS;
1986 newOP(I32 type, I32 flags)
1989 Newz(1101, o, 1, OP);
1991 o->op_ppaddr = ppaddr[type];
1992 o->op_flags = flags;
1995 o->op_private = 0 + (flags >> 8);
1996 if (opargs[type] & OA_RETSCALAR)
1998 if (opargs[type] & OA_TARGET)
1999 o->op_targ = pad_alloc(type, SVs_PADTMP);
2000 return CHECKOP(type, o);
2004 newUNOP(I32 type, I32 flags, OP *first)
2009 first = newOP(OP_STUB, 0);
2010 if (opargs[type] & OA_MARK)
2011 first = force_list(first);
2013 Newz(1101, unop, 1, UNOP);
2014 unop->op_type = type;
2015 unop->op_ppaddr = ppaddr[type];
2016 unop->op_first = first;
2017 unop->op_flags = flags | OPf_KIDS;
2018 unop->op_private = 1 | (flags >> 8);
2019 unop = (UNOP*) CHECKOP(type, unop);
2023 return fold_constants((OP *) unop);
2027 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2030 Newz(1101, binop, 1, BINOP);
2033 first = newOP(OP_NULL, 0);
2035 binop->op_type = type;
2036 binop->op_ppaddr = ppaddr[type];
2037 binop->op_first = first;
2038 binop->op_flags = flags | OPf_KIDS;
2041 binop->op_private = 1 | (flags >> 8);
2044 binop->op_private = 2 | (flags >> 8);
2045 first->op_sibling = last;
2048 binop = (BINOP*)CHECKOP(type, binop);
2052 binop->op_last = last = binop->op_first->op_sibling;
2054 return fold_constants((OP *)binop);
2058 utf8compare(const void *a, const void *b)
2061 for (i = 0; i < 10; i++) {
2062 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2064 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2071 pmtrans(OP *o, OP *expr, OP *repl)
2073 SV *tstr = ((SVOP*)expr)->op_sv;
2074 SV *rstr = ((SVOP*)repl)->op_sv;
2077 register U8 *t = (U8*)SvPV(tstr, tlen);
2078 register U8 *r = (U8*)SvPV(rstr, rlen);
2084 register short *tbl;
2086 complement = o->op_private & OPpTRANS_COMPLEMENT;
2087 del = o->op_private & OPpTRANS_DELETE;
2088 squash = o->op_private & OPpTRANS_SQUASH;
2090 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2091 SV* listsv = newSVpv("# comment\n",0);
2093 U8* tend = t + tlen;
2094 U8* rend = r + rlen;
2110 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2111 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2117 New(1109, cp, tlen, U8*);
2119 transv = newSVpv("",0);
2128 qsort(cp, i, sizeof(U8*), utf8compare);
2129 for (j = 0; j < i; j++) {
2131 UV val = utf8_to_uv(s, &ulen);
2133 diff = val - nextmin;
2135 t = uv_to_utf8(tmpbuf,nextmin);
2136 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2138 t = uv_to_utf8(tmpbuf, val - 1);
2139 sv_catpvn(transv, "\377", 1);
2140 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2144 val = utf8_to_uv(s+1, &ulen);
2148 t = uv_to_utf8(tmpbuf,nextmin);
2149 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2150 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2151 sv_catpvn(transv, "\377", 1);
2152 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2153 t = (U8*)SvPVX(transv);
2154 tlen = SvCUR(transv);
2157 else if (!rlen && !del) {
2158 r = t; rlen = tlen; rend = tend;
2161 if (to_utf && from_utf) { /* only counting characters */
2162 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2163 o->op_private |= OPpTRANS_IDENTICAL;
2165 else { /* straight latin-1 translation */
2166 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2167 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2168 o->op_private |= OPpTRANS_IDENTICAL;
2172 while (t < tend || tfirst <= tlast) {
2173 /* see if we need more "t" chars */
2174 if (tfirst > tlast) {
2175 tfirst = (I32)utf8_to_uv(t, &ulen);
2177 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2178 tlast = (I32)utf8_to_uv(++t, &ulen);
2185 /* now see if we need more "r" chars */
2186 if (rfirst > rlast) {
2188 rfirst = (I32)utf8_to_uv(r, &ulen);
2190 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2191 rlast = (I32)utf8_to_uv(++r, &ulen);
2200 rfirst = rlast = 0xffffffff;
2204 /* now see which range will peter our first, if either. */
2205 tdiff = tlast - tfirst;
2206 rdiff = rlast - rfirst;
2213 if (rfirst == 0xffffffff) {
2214 diff = tdiff; /* oops, pretend rdiff is infinite */
2216 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2218 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2222 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2224 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2226 if (rfirst + diff > max)
2227 max = rfirst + diff;
2232 else if (rfirst <= 0x800)
2233 grows |= (tfirst < 0x80);
2234 else if (rfirst <= 0x10000)
2235 grows |= (tfirst < 0x800);
2236 else if (rfirst <= 0x200000)
2237 grows |= (tfirst < 0x10000);
2238 else if (rfirst <= 0x4000000)
2239 grows |= (tfirst < 0x200000);
2240 else if (rfirst <= 0x80000000)
2241 grows |= (tfirst < 0x4000000);
2253 else if (max > 0xff)
2258 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2259 SvREFCNT_dec(listsv);
2261 SvREFCNT_dec(transv);
2263 if (!del && havefinal)
2264 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2266 if (grows && to_utf)
2267 o->op_private |= OPpTRANS_GROWS;
2274 tbl = (short*)cPVOPo->op_pv;
2276 Zero(tbl, 256, short);
2277 for (i = 0; i < tlen; i++)
2279 for (i = 0, j = 0; i < 256; i++) {
2295 if (!rlen && !del) {
2298 o->op_private |= OPpTRANS_IDENTICAL;
2300 for (i = 0; i < 256; i++)
2302 for (i = 0, j = 0; i < tlen; i++,j++) {
2305 if (tbl[t[i]] == -1)
2311 if (tbl[t[i]] == -1)
2322 newPMOP(I32 type, I32 flags)
2327 Newz(1101, pmop, 1, PMOP);
2328 pmop->op_type = type;
2329 pmop->op_ppaddr = ppaddr[type];
2330 pmop->op_flags = flags;
2331 pmop->op_private = 0 | (flags >> 8);
2333 if (PL_hints & HINT_RE_TAINT)
2334 pmop->op_pmpermflags |= PMf_RETAINT;
2335 if (PL_hints & HINT_LOCALE)
2336 pmop->op_pmpermflags |= PMf_LOCALE;
2337 pmop->op_pmflags = pmop->op_pmpermflags;
2339 /* link into pm list */
2340 if (type != OP_TRANS && PL_curstash) {
2341 pmop->op_pmnext = HvPMROOT(PL_curstash);
2342 HvPMROOT(PL_curstash) = pmop;
2349 pmruntime(OP *o, OP *expr, OP *repl)
2354 I32 repl_has_vars = 0;
2356 if (o->op_type == OP_TRANS)
2357 return pmtrans(o, expr, repl);
2359 PL_hints |= HINT_BLOCK_SCOPE;
2362 if (expr->op_type == OP_CONST) {
2364 SV *pat = ((SVOP*)expr)->op_sv;
2365 char *p = SvPV(pat, plen);
2366 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2367 sv_setpvn(pat, "\\s+", 3);
2368 p = SvPV(pat, plen);
2369 pm->op_pmflags |= PMf_SKIPWHITE;
2371 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2372 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2373 pm->op_pmflags |= PMf_WHITE;
2377 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2378 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2380 : OP_REGCMAYBE),0,expr);
2382 Newz(1101, rcop, 1, LOGOP);
2383 rcop->op_type = OP_REGCOMP;
2384 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2385 rcop->op_first = scalar(expr);
2386 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2387 ? (OPf_SPECIAL | OPf_KIDS)
2389 rcop->op_private = 1;
2392 /* establish postfix order */
2393 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2395 rcop->op_next = expr;
2396 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2399 rcop->op_next = LINKLIST(expr);
2400 expr->op_next = (OP*)rcop;
2403 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2408 if (pm->op_pmflags & PMf_EVAL)
2411 else if (repl->op_type == OP_THREADSV
2412 && strchr("&`'123456789+",
2413 PL_threadsv_names[repl->op_targ]))
2417 #endif /* USE_THREADS */
2418 else if (repl->op_type == OP_CONST)
2422 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2423 if (opargs[curop->op_type] & OA_DANGEROUS) {
2425 if (curop->op_type == OP_THREADSV) {
2427 if (strchr("&`'123456789+", curop->op_private))
2431 if (curop->op_type == OP_GV) {
2432 GV *gv = ((GVOP*)curop)->op_gv;
2434 if (strchr("&`'123456789+", *GvENAME(gv)))
2437 #endif /* USE_THREADS */
2438 else if (curop->op_type == OP_RV2CV)
2440 else if (curop->op_type == OP_RV2SV ||
2441 curop->op_type == OP_RV2AV ||
2442 curop->op_type == OP_RV2HV ||
2443 curop->op_type == OP_RV2GV) {
2444 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2447 else if (curop->op_type == OP_PADSV ||
2448 curop->op_type == OP_PADAV ||
2449 curop->op_type == OP_PADHV ||
2450 curop->op_type == OP_PADANY) {
2453 else if (curop->op_type == OP_PUSHRE)
2454 ; /* Okay here, dangerous in newASSIGNOP */
2463 && (!pm->op_pmregexp
2464 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2465 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2466 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2467 prepend_elem(o->op_type, scalar(repl), o);
2470 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2471 pm->op_pmflags |= PMf_MAYBE_CONST;
2472 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2474 Newz(1101, rcop, 1, LOGOP);
2475 rcop->op_type = OP_SUBSTCONT;
2476 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2477 rcop->op_first = scalar(repl);
2478 rcop->op_flags |= OPf_KIDS;
2479 rcop->op_private = 1;
2482 /* establish postfix order */
2483 rcop->op_next = LINKLIST(repl);
2484 repl->op_next = (OP*)rcop;
2486 pm->op_pmreplroot = scalar((OP*)rcop);
2487 pm->op_pmreplstart = LINKLIST(rcop);
2496 newSVOP(I32 type, I32 flags, SV *sv)
2499 Newz(1101, svop, 1, SVOP);
2500 svop->op_type = type;
2501 svop->op_ppaddr = ppaddr[type];
2503 svop->op_next = (OP*)svop;
2504 svop->op_flags = flags;
2505 if (opargs[type] & OA_RETSCALAR)
2507 if (opargs[type] & OA_TARGET)
2508 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2509 return CHECKOP(type, svop);
2513 newGVOP(I32 type, I32 flags, GV *gv)
2517 Newz(1101, gvop, 1, GVOP);
2518 gvop->op_type = type;
2519 gvop->op_ppaddr = ppaddr[type];
2520 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2521 gvop->op_next = (OP*)gvop;
2522 gvop->op_flags = flags;
2523 if (opargs[type] & OA_RETSCALAR)
2525 if (opargs[type] & OA_TARGET)
2526 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2527 return CHECKOP(type, gvop);
2531 newPVOP(I32 type, I32 flags, char *pv)
2534 Newz(1101, pvop, 1, PVOP);
2535 pvop->op_type = type;
2536 pvop->op_ppaddr = ppaddr[type];
2538 pvop->op_next = (OP*)pvop;
2539 pvop->op_flags = flags;
2540 if (opargs[type] & OA_RETSCALAR)
2542 if (opargs[type] & OA_TARGET)
2543 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2544 return CHECKOP(type, pvop);
2553 save_hptr(&PL_curstash);
2554 save_item(PL_curstname);
2559 name = SvPV(sv, len);
2560 PL_curstash = gv_stashpvn(name,len,TRUE);
2561 sv_setpvn(PL_curstname, name, len);
2565 sv_setpv(PL_curstname,"<none>");
2566 PL_curstash = Nullhv;
2568 PL_copline = NOLINE;
2573 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2581 if (id->op_type != OP_CONST)
2582 croak("Module name must be constant");
2586 if(version != Nullop) {
2587 SV *vesv = ((SVOP*)version)->op_sv;
2589 if (arg == Nullop && !SvNIOK(vesv)) {
2596 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2597 croak("Version number must be constant number");
2599 /* Make copy of id so we don't free it twice */
2600 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2602 /* Fake up a method call to VERSION */
2603 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2604 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2605 append_elem(OP_LIST,
2606 prepend_elem(OP_LIST, pack, list(version)),
2607 newUNOP(OP_METHOD, 0, meth)));
2611 /* Fake up an import/unimport */
2612 if (arg && arg->op_type == OP_STUB)
2613 imop = arg; /* no import on explicit () */
2614 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2615 imop = Nullop; /* use 5.0; */
2618 /* Make copy of id so we don't free it twice */
2619 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2620 meth = newSVOP(OP_CONST, 0,
2622 ? newSVpv("import", 6)
2623 : newSVpv("unimport", 8)
2625 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2626 append_elem(OP_LIST,
2627 prepend_elem(OP_LIST, pack, list(arg)),
2628 newUNOP(OP_METHOD, 0, meth)));
2631 /* Fake up a require */
2632 rqop = newUNOP(OP_REQUIRE, 0, id);
2634 /* Fake up the BEGIN {}, which does its thing immediately. */
2636 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2638 append_elem(OP_LINESEQ,
2639 append_elem(OP_LINESEQ,
2640 newSTATEOP(0, Nullch, rqop),
2641 newSTATEOP(0, Nullch, veop)),
2642 newSTATEOP(0, Nullch, imop) ));
2644 PL_copline = NOLINE;
2649 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2651 return newBINOP(OP_LSLICE, flags,
2652 list(force_list(subscript)),
2653 list(force_list(listval)) );
2657 list_assignment(register OP *o)
2662 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2663 o = cUNOPo->op_first;
2665 if (o->op_type == OP_COND_EXPR) {
2666 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2667 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2672 yyerror("Assignment to both a list and a scalar");
2676 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2677 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2678 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2681 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2684 if (o->op_type == OP_RV2SV)
2691 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2696 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2697 return newLOGOP(optype, 0,
2698 mod(scalar(left), optype),
2699 newUNOP(OP_SASSIGN, 0, scalar(right)));
2702 return newBINOP(optype, OPf_STACKED,
2703 mod(scalar(left), optype), scalar(right));
2707 if (list_assignment(left)) {
2710 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2711 left = mod(left, OP_AASSIGN);
2719 o = newBINOP(OP_AASSIGN, flags,
2720 list(force_list(right)),
2721 list(force_list(left)) );
2722 o->op_private = 0 | (flags >> 8);
2723 if (!(left->op_private & OPpLVAL_INTRO)) {
2727 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2728 if (opargs[curop->op_type] & OA_DANGEROUS) {
2729 if (curop->op_type == OP_GV) {
2730 GV *gv = ((GVOP*)curop)->op_gv;
2731 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2733 SvCUR(gv) = PL_generation;
2735 else if (curop->op_type == OP_PADSV ||
2736 curop->op_type == OP_PADAV ||
2737 curop->op_type == OP_PADHV ||
2738 curop->op_type == OP_PADANY) {
2739 SV **svp = AvARRAY(PL_comppad_name);
2740 SV *sv = svp[curop->op_targ];
2741 if (SvCUR(sv) == PL_generation)
2743 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2745 else if (curop->op_type == OP_RV2CV)
2747 else if (curop->op_type == OP_RV2SV ||
2748 curop->op_type == OP_RV2AV ||
2749 curop->op_type == OP_RV2HV ||
2750 curop->op_type == OP_RV2GV) {
2751 if (lastop->op_type != OP_GV) /* funny deref? */
2754 else if (curop->op_type == OP_PUSHRE) {
2755 if (((PMOP*)curop)->op_pmreplroot) {
2756 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2757 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2759 SvCUR(gv) = PL_generation;
2768 o->op_private = OPpASSIGN_COMMON;
2770 if (right && right->op_type == OP_SPLIT) {
2772 if ((tmpop = ((LISTOP*)right)->op_first) &&
2773 tmpop->op_type == OP_PUSHRE)
2775 PMOP *pm = (PMOP*)tmpop;
2776 if (left->op_type == OP_RV2AV &&
2777 !(left->op_private & OPpLVAL_INTRO) &&
2778 !(o->op_private & OPpASSIGN_COMMON) )
2780 tmpop = ((UNOP*)left)->op_first;
2781 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2782 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2783 pm->op_pmflags |= PMf_ONCE;
2784 tmpop = cUNOPo->op_first; /* to list (nulled) */
2785 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2786 tmpop->op_sibling = Nullop; /* don't free split */
2787 right->op_next = tmpop->op_next; /* fix starting loc */
2788 op_free(o); /* blow off assign */
2789 right->op_flags &= ~OPf_WANT;
2790 /* "I don't know and I don't care." */
2795 if (PL_modcount < 10000 &&
2796 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2798 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2800 sv_setiv(sv, PL_modcount+1);
2808 right = newOP(OP_UNDEF, 0);
2809 if (right->op_type == OP_READLINE) {
2810 right->op_flags |= OPf_STACKED;
2811 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2814 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2815 o = newBINOP(OP_SASSIGN, flags,
2816 scalar(right), mod(scalar(left), OP_SASSIGN) );
2828 newSTATEOP(I32 flags, char *label, OP *o)
2831 U32 seq = intro_my();
2834 Newz(1101, cop, 1, COP);
2835 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2836 cop->op_type = OP_DBSTATE;
2837 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2840 cop->op_type = OP_NEXTSTATE;
2841 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2843 cop->op_flags = flags;
2844 cop->op_private = (PL_hints & HINT_UTF8);
2846 cop->op_private |= NATIVE_HINTS;
2848 compiling.op_private = cop->op_private;
2849 cop->op_next = (OP*)cop;
2852 cop->cop_label = label;
2853 PL_hints |= HINT_BLOCK_SCOPE;
2856 cop->cop_arybase = PL_curcop->cop_arybase;
2857 if (PL_curcop->cop_warnings == WARN_NONE
2858 || PL_curcop->cop_warnings == WARN_ALL)
2859 cop->cop_warnings = PL_curcop->cop_warnings ;
2861 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
2864 if (PL_copline == NOLINE)
2865 cop->cop_line = PL_curcop->cop_line;
2867 cop->cop_line = PL_copline;
2868 PL_copline = NOLINE;
2870 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2871 cop->cop_stash = PL_curstash;
2873 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2874 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2875 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2876 (void)SvIOK_on(*svp);
2878 SvSTASH(*svp) = (HV*)cop;
2882 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2885 /* "Introduce" my variables to visible status. */
2893 if (! PL_min_intro_pending)
2894 return PL_cop_seqmax;
2896 svp = AvARRAY(PL_comppad_name);
2897 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2898 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2899 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2900 SvNVX(sv) = (double)PL_cop_seqmax;
2903 PL_min_intro_pending = 0;
2904 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2905 return PL_cop_seqmax++;
2909 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2911 return new_logop(type, flags, &first, &other);
2915 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2920 OP *first = *firstp;
2921 OP *other = *otherp;
2923 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2924 return newBINOP(type, flags, scalar(first), scalar(other));
2926 scalarboolean(first);
2927 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2928 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2929 if (type == OP_AND || type == OP_OR) {
2935 first = *firstp = cUNOPo->op_first;
2937 first->op_next = o->op_next;
2938 cUNOPo->op_first = Nullop;
2942 if (first->op_type == OP_CONST) {
2943 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
2944 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
2946 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2957 else if (first->op_type == OP_WANTARRAY) {
2963 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
2964 OP *k1 = ((UNOP*)first)->op_first;
2965 OP *k2 = k1->op_sibling;
2967 switch (first->op_type)
2970 if (k2 && k2->op_type == OP_READLINE
2971 && (k2->op_flags & OPf_STACKED)
2972 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2973 warnop = k2->op_type;
2977 if (k1->op_type == OP_READDIR
2978 || k1->op_type == OP_GLOB
2979 || k1->op_type == OP_EACH)
2980 warnop = k1->op_type;
2984 line_t oldline = PL_curcop->cop_line;
2985 PL_curcop->cop_line = PL_copline;
2987 "Value of %s%s can be \"0\"; test with defined()",
2989 ((warnop == OP_READLINE || warnop == OP_GLOB)
2990 ? " construct" : "() operator"));
2991 PL_curcop->cop_line = oldline;
2998 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2999 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3001 Newz(1101, logop, 1, LOGOP);
3003 logop->op_type = type;
3004 logop->op_ppaddr = ppaddr[type];
3005 logop->op_first = first;
3006 logop->op_flags = flags | OPf_KIDS;
3007 logop->op_other = LINKLIST(other);
3008 logop->op_private = 1 | (flags >> 8);
3010 /* establish postfix order */
3011 logop->op_next = LINKLIST(first);
3012 first->op_next = (OP*)logop;
3013 first->op_sibling = other;
3015 o = newUNOP(OP_NULL, 0, (OP*)logop);
3022 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3029 return newLOGOP(OP_AND, 0, first, trueop);
3031 return newLOGOP(OP_OR, 0, first, falseop);
3033 scalarboolean(first);
3034 if (first->op_type == OP_CONST) {
3035 if (SvTRUE(((SVOP*)first)->op_sv)) {
3046 else if (first->op_type == OP_WANTARRAY) {
3050 Newz(1101, condop, 1, CONDOP);
3052 condop->op_type = OP_COND_EXPR;
3053 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
3054 condop->op_first = first;
3055 condop->op_flags = flags | OPf_KIDS;
3056 condop->op_true = LINKLIST(trueop);
3057 condop->op_false = LINKLIST(falseop);
3058 condop->op_private = 1 | (flags >> 8);
3060 /* establish postfix order */
3061 condop->op_next = LINKLIST(first);
3062 first->op_next = (OP*)condop;
3064 first->op_sibling = trueop;
3065 trueop->op_sibling = falseop;
3066 o = newUNOP(OP_NULL, 0, (OP*)condop);
3068 trueop->op_next = o;
3069 falseop->op_next = o;
3075 newRANGE(I32 flags, OP *left, OP *right)
3083 Newz(1101, condop, 1, CONDOP);
3085 condop->op_type = OP_RANGE;
3086 condop->op_ppaddr = ppaddr[OP_RANGE];
3087 condop->op_first = left;
3088 condop->op_flags = OPf_KIDS;
3089 condop->op_true = LINKLIST(left);
3090 condop->op_false = LINKLIST(right);
3091 condop->op_private = 1 | (flags >> 8);
3093 left->op_sibling = right;
3095 condop->op_next = (OP*)condop;
3096 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3097 flop = newUNOP(OP_FLOP, 0, flip);
3098 o = newUNOP(OP_NULL, 0, flop);
3101 left->op_next = flip;
3102 right->op_next = flop;
3104 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3105 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3106 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3107 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3109 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3110 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3113 if (!flip->op_private || !flop->op_private)
3114 linklist(o); /* blow off optimizer unless constant */
3120 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3125 int once = block && block->op_flags & OPf_SPECIAL &&
3126 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3129 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3130 return block; /* do {} while 0 does once */
3131 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3132 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3133 expr = newUNOP(OP_DEFINED, 0,
3134 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3135 } else if (expr->op_flags & OPf_KIDS) {
3136 OP *k1 = ((UNOP*)expr)->op_first;
3137 OP *k2 = (k1) ? k1->op_sibling : NULL;
3138 switch (expr->op_type) {
3140 if (k2 && k2->op_type == OP_READLINE
3141 && (k2->op_flags & OPf_STACKED)
3142 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3143 expr = newUNOP(OP_DEFINED, 0, expr);
3147 if (k1->op_type == OP_READDIR
3148 || k1->op_type == OP_GLOB
3149 || k1->op_type == OP_EACH)
3150 expr = newUNOP(OP_DEFINED, 0, expr);
3156 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3157 o = new_logop(OP_AND, 0, &expr, &listop);
3160 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3162 if (once && o != listop)
3163 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3166 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3168 o->op_flags |= flags;
3170 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3175 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3184 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3185 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3186 expr = newUNOP(OP_DEFINED, 0,
3187 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3188 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3189 OP *k1 = ((UNOP*)expr)->op_first;
3190 OP *k2 = (k1) ? k1->op_sibling : NULL;
3191 switch (expr->op_type) {
3193 if (k2 && k2->op_type == OP_READLINE
3194 && (k2->op_flags & OPf_STACKED)
3195 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3196 expr = newUNOP(OP_DEFINED, 0, expr);
3200 if (k1->op_type == OP_READDIR
3201 || k1->op_type == OP_GLOB
3202 || k1->op_type == OP_EACH)
3203 expr = newUNOP(OP_DEFINED, 0, expr);
3209 block = newOP(OP_NULL, 0);
3212 next = LINKLIST(cont);
3214 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3215 if ((line_t)whileline != NOLINE) {
3216 PL_copline = whileline;
3217 cont = append_elem(OP_LINESEQ, cont,
3218 newSTATEOP(0, Nullch, Nullop));
3222 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3223 redo = LINKLIST(listop);
3226 PL_copline = whileline;
3228 o = new_logop(OP_AND, 0, &expr, &listop);
3229 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3230 op_free(expr); /* oops, it's a while (0) */
3232 return Nullop; /* listop already freed by new_logop */
3235 ((LISTOP*)listop)->op_last->op_next = condop =
3236 (o == listop ? redo : LINKLIST(o));
3244 Newz(1101,loop,1,LOOP);
3245 loop->op_type = OP_ENTERLOOP;
3246 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
3247 loop->op_private = 0;
3248 loop->op_next = (OP*)loop;
3251 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3253 loop->op_redoop = redo;
3254 loop->op_lastop = o;
3257 loop->op_nextop = next;
3259 loop->op_nextop = o;
3261 o->op_flags |= flags;
3262 o->op_private |= (flags >> 8);
3267 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3275 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3276 sv->op_type = OP_RV2GV;
3277 sv->op_ppaddr = ppaddr[OP_RV2GV];
3279 else if (sv->op_type == OP_PADSV) { /* private variable */
3280 padoff = sv->op_targ;
3284 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3285 padoff = sv->op_targ;
3286 iterflags |= OPf_SPECIAL;
3291 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3295 padoff = find_threadsv("_");
3296 iterflags |= OPf_SPECIAL;
3298 sv = newGVOP(OP_GV, 0, PL_defgv);
3301 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3302 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3303 iterflags |= OPf_STACKED;
3305 else if (expr->op_type == OP_NULL &&
3306 (expr->op_flags & OPf_KIDS) &&
3307 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3309 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3310 * set the STACKED flag to indicate that these values are to be
3311 * treated as min/max values by 'pp_iterinit'.
3313 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3314 CONDOP* range = (CONDOP*) flip->op_first;
3315 OP* left = range->op_first;
3316 OP* right = left->op_sibling;
3319 range->op_flags &= ~OPf_KIDS;
3320 range->op_first = Nullop;
3322 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3323 listop->op_first->op_next = range->op_true;
3324 left->op_next = range->op_false;
3325 right->op_next = (OP*)listop;
3326 listop->op_next = listop->op_first;
3329 expr = (OP*)(listop);
3331 iterflags |= OPf_STACKED;
3334 expr = mod(force_list(expr), OP_GREPSTART);
3338 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3339 append_elem(OP_LIST, expr, scalar(sv))));
3340 assert(!loop->op_next);
3341 Renew(loop, 1, LOOP);
3342 loop->op_targ = padoff;
3343 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3344 PL_copline = forline;
3345 return newSTATEOP(0, label, wop);
3349 newLOOPEX(I32 type, OP *label)
3353 if (type != OP_GOTO || label->op_type == OP_CONST) {
3354 /* "last()" means "last" */
3355 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3356 o = newOP(type, OPf_SPECIAL);
3358 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3359 ? SvPVx(((SVOP*)label)->op_sv, PL_na)
3365 if (label->op_type == OP_ENTERSUB)
3366 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3367 o = newUNOP(type, OPf_STACKED, label);
3369 PL_hints |= HINT_BLOCK_SCOPE;
3379 MUTEX_DESTROY(CvMUTEXP(cv));
3380 Safefree(CvMUTEXP(cv));
3383 #endif /* USE_THREADS */
3385 if (!CvXSUB(cv) && CvROOT(cv)) {
3387 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3388 croak("Can't undef active subroutine");
3391 croak("Can't undef active subroutine");
3392 #endif /* USE_THREADS */
3395 SAVESPTR(PL_curpad);
3399 op_free(CvROOT(cv));
3400 CvROOT(cv) = Nullop;
3403 SvPOK_off((SV*)cv); /* forget prototype */
3405 SvREFCNT_dec(CvGV(cv));
3407 SvREFCNT_dec(CvOUTSIDE(cv));
3408 CvOUTSIDE(cv) = Nullcv;
3409 if (CvPADLIST(cv)) {
3410 /* may be during global destruction */
3411 if (SvREFCNT(CvPADLIST(cv))) {
3412 I32 i = AvFILLp(CvPADLIST(cv));
3414 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3415 SV* sv = svp ? *svp : Nullsv;
3418 if (sv == (SV*)PL_comppad_name)
3419 PL_comppad_name = Nullav;
3420 else if (sv == (SV*)PL_comppad) {
3421 PL_comppad = Nullav;
3422 PL_curpad = Null(SV**);
3426 SvREFCNT_dec((SV*)CvPADLIST(cv));
3428 CvPADLIST(cv) = Nullav;
3432 #ifdef DEBUG_CLOSURES
3437 CV *outside = CvOUTSIDE(cv);
3438 AV* padlist = CvPADLIST(cv);
3445 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3447 (CvANON(cv) ? "ANON"
3448 : (cv == PL_main_cv) ? "MAIN"
3449 : CvUNIQUE(outside) ? "UNIQUE"
3450 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3453 : CvANON(outside) ? "ANON"
3454 : (outside == PL_main_cv) ? "MAIN"
3455 : CvUNIQUE(outside) ? "UNIQUE"
3456 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3461 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3462 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3463 pname = AvARRAY(pad_name);
3464 ppad = AvARRAY(pad);
3466 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3467 if (SvPOK(pname[ix]))
3468 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3470 SvFAKE(pname[ix]) ? "FAKE " : "",
3472 (long)I_32(SvNVX(pname[ix])),
3473 (long)SvIVX(pname[ix]));
3476 #endif /* DEBUG_CLOSURES */
3479 cv_clone2(CV *proto, CV *outside)
3484 AV* protopadlist = CvPADLIST(proto);
3485 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3486 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3487 SV** pname = AvARRAY(protopad_name);
3488 SV** ppad = AvARRAY(protopad);
3489 I32 fname = AvFILLp(protopad_name);
3490 I32 fpad = AvFILLp(protopad);
3494 assert(!CvUNIQUE(proto));
3497 SAVESPTR(PL_curpad);
3498 SAVESPTR(PL_comppad);
3499 SAVESPTR(PL_comppad_name);
3500 SAVESPTR(PL_compcv);
3502 cv = PL_compcv = (CV*)NEWSV(1104,0);
3503 sv_upgrade((SV *)cv, SvTYPE(proto));
3509 New(666, CvMUTEXP(cv), 1, perl_mutex);
3510 MUTEX_INIT(CvMUTEXP(cv));
3512 #endif /* USE_THREADS */
3513 CvFILEGV(cv) = CvFILEGV(proto);
3514 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3515 CvSTASH(cv) = CvSTASH(proto);
3516 CvROOT(cv) = CvROOT(proto);
3517 CvSTART(cv) = CvSTART(proto);
3519 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3522 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3524 PL_comppad_name = newAV();
3525 for (ix = fname; ix >= 0; ix--)
3526 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3528 PL_comppad = newAV();
3530 comppadlist = newAV();
3531 AvREAL_off(comppadlist);
3532 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3533 av_store(comppadlist, 1, (SV*)PL_comppad);
3534 CvPADLIST(cv) = comppadlist;
3535 av_fill(PL_comppad, AvFILLp(protopad));
3536 PL_curpad = AvARRAY(PL_comppad);
3538 av = newAV(); /* will be @_ */
3540 av_store(PL_comppad, 0, (SV*)av);
3541 AvFLAGS(av) = AVf_REIFY;
3543 for (ix = fpad; ix > 0; ix--) {
3544 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3545 if (namesv && namesv != &PL_sv_undef) {
3546 char *name = SvPVX(namesv); /* XXX */
3547 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3548 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3549 CvOUTSIDE(cv), cxstack_ix);
3551 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3553 croak("panic: cv_clone: %s", name);
3555 else { /* our own lexical */
3558 /* anon code -- we'll come back for it */
3559 sv = SvREFCNT_inc(ppad[ix]);
3561 else if (*name == '@')
3563 else if (*name == '%')
3573 SV* sv = NEWSV(0,0);
3579 /* Now that vars are all in place, clone nested closures. */
3581 for (ix = fpad; ix > 0; ix--) {
3582 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3584 && namesv != &PL_sv_undef
3585 && !(SvFLAGS(namesv) & SVf_FAKE)
3586 && *SvPVX(namesv) == '&'
3587 && CvCLONE(ppad[ix]))
3589 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3590 SvREFCNT_dec(ppad[ix]);
3593 PL_curpad[ix] = (SV*)kid;
3597 #ifdef DEBUG_CLOSURES
3598 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3600 PerlIO_printf(Perl_debug_log, " from:\n");
3602 PerlIO_printf(Perl_debug_log, " to:\n");
3613 return cv_clone2(proto, CvOUTSIDE(proto));
3617 cv_ckproto(CV *cv, GV *gv, char *p)
3619 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3620 SV* msg = sv_newmortal();
3624 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3625 sv_setpv(msg, "Prototype mismatch:");
3627 sv_catpvf(msg, " sub %_", name);
3629 sv_catpvf(msg, " (%s)", SvPVX(cv));
3630 sv_catpv(msg, " vs ");
3632 sv_catpvf(msg, "(%s)", p);
3634 sv_catpv(msg, "none");
3642 if (!cv || !SvPOK(cv) || SvCUR(cv))
3644 return op_const_sv(CvSTART(cv), cv);
3648 op_const_sv(OP *o, CV *cv)
3655 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3656 o = cLISTOPo->op_first->op_sibling;
3658 for (; o; o = o->op_next) {
3659 OPCODE type = o->op_type;
3661 if(sv && o->op_next == o)
3663 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3665 if (type == OP_LEAVESUB || type == OP_RETURN)
3669 if (type == OP_CONST)
3671 else if (type == OP_PADSV && cv) {
3672 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3673 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3674 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3686 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3689 char *name = o ? SvPVx(cSVOPo->op_sv, PL_na) : Nullch;
3690 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3691 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3692 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, PL_na) : Nullch;
3701 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3702 maximum a prototype before. */
3703 if (SvTYPE(gv) > SVt_NULL) {
3704 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3705 warn("Runaway prototype");
3706 cv_ckproto((CV*)gv, NULL, ps);
3709 sv_setpv((SV*)gv, ps);
3711 sv_setiv((SV*)gv, -1);
3712 SvREFCNT_dec(PL_compcv);
3713 cv = PL_compcv = NULL;
3714 PL_sub_generation++;
3718 if (!name || GvCVGEN(gv))
3720 else if (cv = GvCV(gv)) {
3721 cv_ckproto(cv, gv, ps);
3722 /* already defined (or promised)? */
3723 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3725 bool const_changed = TRUE;
3727 /* just a "sub foo;" when &foo is already defined */
3728 SAVEFREESV(PL_compcv);
3731 /* ahem, death to those who redefine active sort subs */
3732 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3733 croak("Can't redefine active sort subroutine %s", name);
3734 if(const_sv = cv_const_sv(cv))
3735 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3736 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3737 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3738 && HvNAME(GvSTASH(CvGV(cv)))
3739 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3741 line_t oldline = PL_curcop->cop_line;
3742 PL_curcop->cop_line = PL_copline;
3743 warner(WARN_REDEFINE,
3744 const_sv ? "Constant subroutine %s redefined"
3745 : "Subroutine %s redefined", name);
3746 PL_curcop->cop_line = oldline;
3752 if (cv) { /* must reuse cv if autoloaded */
3754 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3755 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3756 CvOUTSIDE(PL_compcv) = 0;
3757 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3758 CvPADLIST(PL_compcv) = 0;
3759 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3760 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3761 SvREFCNT_dec(PL_compcv);
3768 PL_sub_generation++;
3771 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3772 CvFILEGV(cv) = PL_curcop->cop_filegv;
3773 CvSTASH(cv) = PL_curstash;
3777 New(666, CvMUTEXP(cv), 1, perl_mutex);
3778 MUTEX_INIT(CvMUTEXP(cv));
3779 #endif /* USE_THREADS */
3782 sv_setpv((SV*)cv, ps);
3784 if (PL_error_count) {
3788 char *s = strrchr(name, ':');
3790 if (strEQ(s, "BEGIN")) {
3792 "BEGIN not safe after errors--compilation aborted";
3796 /* force display of errors found but not reported */
3797 sv_catpv(ERRSV, not_safe);
3798 croak("%s", SvPVx(ERRSV, PL_na));
3805 PL_copline = NOLINE;
3810 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3811 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3814 SV **namep = AvARRAY(PL_comppad_name);
3815 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3818 if (SvIMMORTAL(PL_curpad[ix]))
3821 * The only things that a clonable function needs in its
3822 * pad are references to outer lexicals and anonymous subs.
3823 * The rest are created anew during cloning.
3825 if (!((namesv = namep[ix]) != Nullsv &&
3826 namesv != &PL_sv_undef &&
3828 *SvPVX(namesv) == '&')))
3830 SvREFCNT_dec(PL_curpad[ix]);
3831 PL_curpad[ix] = Nullsv;
3836 AV *av = newAV(); /* Will be @_ */
3838 av_store(PL_comppad, 0, (SV*)av);
3839 AvFLAGS(av) = AVf_REIFY;
3841 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3842 if (SvIMMORTAL(PL_curpad[ix]))
3844 if (!SvPADMY(PL_curpad[ix]))
3845 SvPADTMP_on(PL_curpad[ix]);
3849 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3850 CvSTART(cv) = LINKLIST(CvROOT(cv));
3851 CvROOT(cv)->op_next = 0;
3857 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3858 SV *sv = NEWSV(0,0);
3859 SV *tmpstr = sv_newmortal();
3860 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3864 sv_setpvf(sv, "%_:%ld-%ld",
3865 GvSV(PL_curcop->cop_filegv),
3866 (long)PL_subline, (long)PL_curcop->cop_line);
3867 gv_efullname3(tmpstr, gv, Nullch);
3868 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3869 hv = GvHVn(db_postponed);
3870 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3871 && (cv = GvCV(db_postponed))) {
3876 perl_call_sv((SV*)cv, G_DISCARD);
3880 if ((s = strrchr(name,':')))
3884 if (strEQ(s, "BEGIN")) {
3885 I32 oldscope = PL_scopestack_ix;
3887 SAVESPTR(PL_compiling.cop_filegv);
3888 SAVEI16(PL_compiling.cop_line);
3890 sv_setsv(PL_rs, PL_nrs);
3893 PL_beginav = newAV();
3894 DEBUG_x( dump_sub(gv) );
3895 av_push(PL_beginav, (SV *)cv);
3897 call_list(oldscope, PL_beginav);
3899 PL_curcop = &PL_compiling;
3900 PL_compiling.op_private = PL_hints;
3903 else if (strEQ(s, "END") && !PL_error_count) {
3906 av_unshift(PL_endav, 1);
3907 av_store(PL_endav, 0, (SV *)cv);
3910 else if (strEQ(s, "INIT") && !PL_error_count) {
3912 PL_initav = newAV();
3913 av_push(PL_initav, SvREFCNT_inc(cv));
3919 PL_copline = NOLINE;
3925 newCONSTSUB(HV *stash, char *name, SV *sv)
3928 U32 oldhints = PL_hints;
3929 HV *old_cop_stash = PL_curcop->cop_stash;
3930 HV *old_curstash = PL_curstash;
3931 line_t oldline = PL_curcop->cop_line;
3932 PL_curcop->cop_line = PL_copline;
3934 PL_hints &= ~HINT_BLOCK_SCOPE;
3936 PL_curstash = PL_curcop->cop_stash = stash;
3939 start_subparse(FALSE, 0),
3940 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3941 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
3942 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3945 PL_hints = oldhints;
3946 PL_curcop->cop_stash = old_cop_stash;
3947 PL_curstash = old_curstash;
3948 PL_curcop->cop_line = oldline;
3952 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3955 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3958 if (cv = (name ? GvCV(gv) : Nullcv)) {
3960 /* just a cached method */
3964 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3965 /* already defined (or promised) */
3966 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
3967 && HvNAME(GvSTASH(CvGV(cv)))
3968 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3969 line_t oldline = PL_curcop->cop_line;
3970 PL_curcop->cop_line = PL_copline;
3971 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
3972 PL_curcop->cop_line = oldline;
3979 if (cv) /* must reuse cv if autoloaded */
3982 cv = (CV*)NEWSV(1105,0);
3983 sv_upgrade((SV *)cv, SVt_PVCV);
3987 PL_sub_generation++;
3990 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3992 New(666, CvMUTEXP(cv), 1, perl_mutex);
3993 MUTEX_INIT(CvMUTEXP(cv));
3995 #endif /* USE_THREADS */
3996 CvFILEGV(cv) = gv_fetchfile(filename);
3997 CvXSUB(cv) = subaddr;
4000 char *s = strrchr(name,':');
4005 if (strEQ(s, "BEGIN")) {
4007 PL_beginav = newAV();
4008 av_push(PL_beginav, (SV *)cv);
4011 else if (strEQ(s, "END")) {
4014 av_unshift(PL_endav, 1);
4015 av_store(PL_endav, 0, (SV *)cv);
4018 else if (strEQ(s, "INIT")) {
4020 PL_initav = newAV();
4021 av_push(PL_initav, (SV *)cv);
4032 newFORM(I32 floor, OP *o, OP *block)
4041 name = SvPVx(cSVOPo->op_sv, PL_na);
4044 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4046 if (cv = GvFORM(gv)) {
4047 if (ckWARN(WARN_REDEFINE)) {
4048 line_t oldline = PL_curcop->cop_line;
4050 PL_curcop->cop_line = PL_copline;
4051 warner(WARN_REDEFINE, "Format %s redefined",name);
4052 PL_curcop->cop_line = oldline;
4058 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4059 CvFILEGV(cv) = PL_curcop->cop_filegv;
4061 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4062 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4063 SvPADTMP_on(PL_curpad[ix]);
4066 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4067 CvSTART(cv) = LINKLIST(CvROOT(cv));
4068 CvROOT(cv)->op_next = 0;
4071 PL_copline = NOLINE;
4078 return newUNOP(OP_REFGEN, 0,
4079 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4085 return newUNOP(OP_REFGEN, 0,
4086 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4090 newANONSUB(I32 floor, OP *proto, OP *block)
4092 return newUNOP(OP_REFGEN, 0,
4093 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4099 switch (o->op_type) {
4101 o->op_type = OP_PADAV;
4102 o->op_ppaddr = ppaddr[OP_PADAV];
4103 return ref(o, OP_RV2AV);
4106 o->op_type = OP_RV2AV;
4107 o->op_ppaddr = ppaddr[OP_RV2AV];
4112 warn("oops: oopsAV");
4121 switch (o->op_type) {
4124 o->op_type = OP_PADHV;
4125 o->op_ppaddr = ppaddr[OP_PADHV];
4126 return ref(o, OP_RV2HV);
4130 o->op_type = OP_RV2HV;
4131 o->op_ppaddr = ppaddr[OP_RV2HV];
4136 warn("oops: oopsHV");
4145 if (o->op_type == OP_PADANY) {
4146 o->op_type = OP_PADAV;
4147 o->op_ppaddr = ppaddr[OP_PADAV];
4150 return newUNOP(OP_RV2AV, 0, scalar(o));
4154 newGVREF(I32 type, OP *o)
4156 if (type == OP_MAPSTART)
4157 return newUNOP(OP_NULL, 0, o);
4158 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4164 if (o->op_type == OP_PADANY) {
4165 o->op_type = OP_PADHV;
4166 o->op_ppaddr = ppaddr[OP_PADHV];
4169 return newUNOP(OP_RV2HV, 0, scalar(o));
4175 croak("NOT IMPL LINE %d",__LINE__);
4181 newCVREF(I32 flags, OP *o)
4183 return newUNOP(OP_RV2CV, flags, scalar(o));
4189 if (o->op_type == OP_PADANY) {
4190 o->op_type = OP_PADSV;
4191 o->op_ppaddr = ppaddr[OP_PADSV];
4194 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4195 o->op_flags |= OPpDONE_SVREF;
4198 return newUNOP(OP_RV2SV, 0, scalar(o));
4201 /* Check routines. */
4209 name = NEWSV(1106,0);
4210 sv_upgrade(name, SVt_PVNV);
4211 sv_setpvn(name, "&", 1);
4214 ix = pad_alloc(o->op_type, SVs_PADMY);
4215 av_store(PL_comppad_name, ix, name);
4216 av_store(PL_comppad, ix, cSVOPo->op_sv);
4217 SvPADMY_on(cSVOPo->op_sv);
4218 cSVOPo->op_sv = Nullsv;
4219 cSVOPo->op_targ = ix;
4226 o->op_private = PL_hints;
4233 if (cUNOPo->op_first->op_type == OP_CONCAT)
4234 o->op_flags |= OPf_STACKED;
4241 if (o->op_flags & OPf_KIDS) {
4244 OPCODE type = o->op_type;
4245 o = modkids(ck_fun(o), type);
4246 kid = cUNOPo->op_first;
4247 newop = kUNOP->op_first->op_sibling;
4249 (newop->op_sibling ||
4250 !(opargs[newop->op_type] & OA_RETSCALAR) ||
4251 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4252 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4256 op_free(kUNOP->op_first);
4257 kUNOP->op_first = newop;
4259 o->op_ppaddr = ppaddr[++o->op_type];
4268 if (o->op_flags & OPf_KIDS) {
4269 OP *kid = cUNOPo->op_first;
4270 if (kid->op_type == OP_HSLICE)
4271 o->op_private |= OPpSLICE;
4272 else if (kid->op_type != OP_HELEM)
4273 croak("%s argument is not a HASH element or slice",
4274 op_desc[o->op_type]);
4283 I32 type = o->op_type;
4285 if (o->op_flags & OPf_KIDS) {
4286 if (cLISTOPo->op_first->op_type == OP_STUB) {
4288 o = newUNOP(type, OPf_SPECIAL,
4289 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4299 PL_hints |= HINT_BLOCK_SCOPE;
4300 if (o->op_flags & OPf_KIDS) {
4301 SVOP *kid = (SVOP*)cUNOPo->op_first;
4304 o->op_flags &= ~OPf_KIDS;
4307 else if (kid->op_type == OP_LINESEQ) {
4310 kid->op_next = o->op_next;
4311 cUNOPo->op_first = 0;
4314 Newz(1101, enter, 1, LOGOP);
4315 enter->op_type = OP_ENTERTRY;
4316 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4317 enter->op_private = 0;
4319 /* establish postfix order */
4320 enter->op_next = (OP*)enter;
4322 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4323 o->op_type = OP_LEAVETRY;
4324 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4325 enter->op_other = o;
4333 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4335 o->op_targ = (PADOFFSET)PL_hints;
4343 if (o->op_flags & OPf_STACKED) {
4345 kid = cUNOPo->op_first->op_sibling;
4346 if (kid->op_type == OP_RV2GV)
4358 if (o->op_flags & OPf_KIDS) {
4359 OP *kid = cUNOPo->op_first;
4360 if (kid->op_type != OP_HELEM)
4361 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4368 ck_gvconst(register OP *o)
4370 o = fold_constants(o);
4371 if (o->op_type == OP_CONST)
4377 ck_rvconst(register OP *o)
4380 SVOP *kid = (SVOP*)cUNOPo->op_first;
4382 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4383 if (kid->op_type == OP_CONST) {
4388 name = SvPV(kid->op_sv, PL_na);
4389 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4390 char *badthing = Nullch;
4391 switch (o->op_type) {
4393 badthing = "a SCALAR";
4396 badthing = "an ARRAY";
4399 badthing = "a HASH";
4404 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4408 * This is a little tricky. We only want to add the symbol if we
4409 * didn't add it in the lexer. Otherwise we get duplicate strict
4410 * warnings. But if we didn't add it in the lexer, we must at
4411 * least pretend like we wanted to add it even if it existed before,
4412 * or we get possible typo warnings. OPpCONST_ENTERED says
4413 * whether the lexer already added THIS instance of this symbol.
4415 iscv = (o->op_type == OP_RV2CV) * 2;
4417 gv = gv_fetchpv(name,
4418 iscv | !(kid->op_private & OPpCONST_ENTERED),
4421 : o->op_type == OP_RV2SV
4423 : o->op_type == OP_RV2AV
4425 : o->op_type == OP_RV2HV
4428 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4430 kid->op_type = OP_GV;
4431 SvREFCNT_dec(kid->op_sv);
4432 kid->op_sv = SvREFCNT_inc(gv);
4442 I32 type = o->op_type;
4444 if (o->op_flags & OPf_REF)
4447 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4448 SVOP *kid = (SVOP*)cUNOPo->op_first;
4450 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4451 OP *newop = newGVOP(type, OPf_REF,
4452 gv_fetchpv(SvPVx(kid->op_sv, PL_na), TRUE, SVt_PVIO));
4459 if (type == OP_FTTTY)
4460 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4463 return newUNOP(type, 0, newDEFSVOP());
4476 int type = o->op_type;
4477 register I32 oa = opargs[type] >> OASHIFT;
4479 if (o->op_flags & OPf_STACKED) {
4480 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4483 return no_fh_allowed(o);
4486 if (o->op_flags & OPf_KIDS) {
4487 tokid = &cLISTOPo->op_first;
4488 kid = cLISTOPo->op_first;
4489 if (kid->op_type == OP_PUSHMARK ||
4490 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4492 tokid = &kid->op_sibling;
4493 kid = kid->op_sibling;
4495 if (!kid && opargs[type] & OA_DEFGV)
4496 *tokid = kid = newDEFSVOP();
4500 sibl = kid->op_sibling;
4514 if (kid->op_type == OP_CONST &&
4515 (kid->op_private & OPpCONST_BARE)) {
4516 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4517 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4518 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4519 if (ckWARN(WARN_SYNTAX))
4521 "Array @%s missing the @ in argument %ld of %s()",
4522 name, (long)numargs, op_desc[type]);
4525 kid->op_sibling = sibl;
4528 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4529 bad_type(numargs, "array", op_desc[o->op_type], kid);
4533 if (kid->op_type == OP_CONST &&
4534 (kid->op_private & OPpCONST_BARE)) {
4535 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4536 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4537 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4538 if (ckWARN(WARN_SYNTAX))
4540 "Hash %%%s missing the %% in argument %ld of %s()",
4541 name, (long)numargs, op_desc[type]);
4544 kid->op_sibling = sibl;
4547 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4548 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4553 OP *newop = newUNOP(OP_NULL, 0, kid);
4554 kid->op_sibling = 0;
4556 newop->op_next = newop;
4558 kid->op_sibling = sibl;
4563 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4564 if (kid->op_type == OP_CONST &&
4565 (kid->op_private & OPpCONST_BARE)) {
4566 OP *newop = newGVOP(OP_GV, 0,
4567 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, PL_na), TRUE,
4573 kid->op_sibling = 0;
4574 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4576 kid->op_sibling = sibl;
4582 mod(scalar(kid), type);
4586 tokid = &kid->op_sibling;
4587 kid = kid->op_sibling;
4589 o->op_private |= numargs;
4591 return too_many_arguments(o,op_desc[o->op_type]);
4594 else if (opargs[type] & OA_DEFGV) {
4596 return newUNOP(type, 0, newDEFSVOP());
4600 while (oa & OA_OPTIONAL)
4602 if (oa && oa != OA_LIST)
4603 return too_few_arguments(o,op_desc[o->op_type]);
4613 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4614 append_elem(OP_GLOB, o, newDEFSVOP());
4616 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4617 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4619 if (gv && GvIMPORTED_CV(gv)) {
4620 static int glob_index;
4622 append_elem(OP_GLOB, o,
4623 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4624 o->op_type = OP_LIST;
4625 o->op_ppaddr = ppaddr[OP_LIST];
4626 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4627 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4628 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4629 append_elem(OP_LIST, o,
4630 scalar(newUNOP(OP_RV2CV, 0,
4631 newGVOP(OP_GV, 0, gv)))));
4632 o = newUNOP(OP_NULL, 0, ck_subr(o));
4633 o->op_targ = OP_GLOB; /* hint at what it used to be */
4636 gv = newGVgen("main");
4638 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4648 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4650 o->op_ppaddr = ppaddr[OP_GREPSTART];
4651 Newz(1101, gwop, 1, LOGOP);
4653 if (o->op_flags & OPf_STACKED) {
4656 kid = cLISTOPo->op_first->op_sibling;
4657 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4660 kid->op_next = (OP*)gwop;
4661 o->op_flags &= ~OPf_STACKED;
4663 kid = cLISTOPo->op_first->op_sibling;
4664 if (type == OP_MAPWHILE)
4671 kid = cLISTOPo->op_first->op_sibling;
4672 if (kid->op_type != OP_NULL)
4673 croak("panic: ck_grep");
4674 kid = kUNOP->op_first;
4676 gwop->op_type = type;
4677 gwop->op_ppaddr = ppaddr[type];
4678 gwop->op_first = listkids(o);
4679 gwop->op_flags |= OPf_KIDS;
4680 gwop->op_private = 1;
4681 gwop->op_other = LINKLIST(kid);
4682 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4683 kid->op_next = (OP*)gwop;
4685 kid = cLISTOPo->op_first->op_sibling;
4686 if (!kid || !kid->op_sibling)
4687 return too_few_arguments(o,op_desc[o->op_type]);
4688 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4689 mod(kid, OP_GREPSTART);
4697 if (o->op_flags & OPf_KIDS) {
4698 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4700 kid = kid->op_sibling; /* get past "big" */
4701 if (kid && kid->op_type == OP_CONST)
4702 fbm_compile(((SVOP*)kid)->op_sv, 0);
4708 ck_lengthconst(OP *o)
4710 /* XXX length optimization goes here */
4717 OPCODE type = o->op_type;
4718 return modkids(ck_fun(o), type);
4724 OPCODE type = o->op_type;
4725 return refkids(ck_fun(o), type);
4733 kid = cLISTOPo->op_first;
4736 kid = cLISTOPo->op_first;
4738 if (kid->op_type == OP_PUSHMARK)
4739 kid = kid->op_sibling;
4740 if (kid && o->op_flags & OPf_STACKED)
4741 kid = kid->op_sibling;
4742 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4743 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4744 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4745 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4746 cLISTOPo->op_first->op_sibling = kid;
4747 cLISTOPo->op_last = kid;
4748 kid = kid->op_sibling;
4753 append_elem(o->op_type, o, newDEFSVOP());
4759 if (PL_hints & HINT_LOCALE)
4760 o->op_private |= OPpLOCALE;
4767 ck_fun_locale(OP *o)
4773 if (PL_hints & HINT_LOCALE)
4774 o->op_private |= OPpLOCALE;
4785 if (PL_hints & HINT_LOCALE)
4786 o->op_private |= OPpLOCALE;
4795 o->op_private |= OPpRUNTIME;
4808 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4809 o->op_private |= OPpREPEAT_DOLIST;
4810 cBINOPo->op_first = force_list(cBINOPo->op_first);
4820 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4821 SVOP *kid = (SVOP*)cUNOPo->op_first;
4823 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4825 for (s = SvPVX(kid->op_sv); *s; s++) {
4826 if (*s == ':' && s[1] == ':') {
4828 Move(s+2, s+1, strlen(s+2)+1, char);
4829 --SvCUR(kid->op_sv);
4832 sv_catpvn(kid->op_sv, ".pm", 3);
4841 croak("NOT IMPL LINE %d",__LINE__);
4850 if (o->op_flags & OPf_KIDS) {
4851 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4852 if (kid && kid->op_sibling) {
4853 o->op_type = OP_SSELECT;
4854 o->op_ppaddr = ppaddr[OP_SSELECT];
4856 return fold_constants(o);
4860 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4861 if (kid && kid->op_type == OP_RV2GV)
4862 kid->op_private &= ~HINT_STRICT_REFS;
4869 I32 type = o->op_type;
4871 if (!(o->op_flags & OPf_KIDS)) {
4876 if (!CvUNIQUE(PL_compcv)) {
4877 argop = newOP(OP_PADAV, OPf_REF);
4878 argop->op_targ = 0; /* PL_curpad[0] is @_ */
4881 argop = newUNOP(OP_RV2AV, 0,
4882 scalar(newGVOP(OP_GV, 0,
4883 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4886 argop = newUNOP(OP_RV2AV, 0,
4887 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
4888 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4889 #endif /* USE_THREADS */
4890 return newUNOP(type, 0, scalar(argop));
4892 return scalar(modkids(ck_fun(o), type));
4900 if (PL_hints & HINT_LOCALE)
4901 o->op_private |= OPpLOCALE;
4904 if (o->op_flags & OPf_STACKED) {
4905 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4907 kid = kUNOP->op_first; /* get past rv2gv */
4909 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4911 if (kid->op_type == OP_SCOPE) {
4915 else if (kid->op_type == OP_LEAVE) {
4916 if (o->op_type == OP_SORT) {
4917 null(kid); /* wipe out leave */
4920 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4921 if (k->op_next == kid)
4926 kid->op_next = 0; /* just disconnect the leave */
4927 k = kLISTOP->op_first;
4931 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4932 null(kid); /* wipe out rv2gv */
4933 if (o->op_type == OP_SORT)
4937 o->op_flags |= OPf_SPECIAL;
4949 if (o->op_flags & OPf_STACKED)
4950 return no_fh_allowed(o);
4952 kid = cLISTOPo->op_first;
4953 if (kid->op_type != OP_NULL)
4954 croak("panic: ck_split");
4955 kid = kid->op_sibling;
4956 op_free(cLISTOPo->op_first);
4957 cLISTOPo->op_first = kid;
4959 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4960 cLISTOPo->op_last = kid; /* There was only one element previously */
4963 if (kid->op_type != OP_MATCH) {
4964 OP *sibl = kid->op_sibling;
4965 kid->op_sibling = 0;
4966 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4967 if (cLISTOPo->op_first == cLISTOPo->op_last)
4968 cLISTOPo->op_last = kid;
4969 cLISTOPo->op_first = kid;
4970 kid->op_sibling = sibl;
4973 kid->op_type = OP_PUSHRE;
4974 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4977 if (!kid->op_sibling)
4978 append_elem(OP_SPLIT, o, newDEFSVOP());
4980 kid = kid->op_sibling;
4983 if (!kid->op_sibling)
4984 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4986 kid = kid->op_sibling;
4989 if (kid->op_sibling)
4990 return too_many_arguments(o,op_desc[o->op_type]);
4999 OP *prev = ((cUNOPo->op_first->op_sibling)
5000 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5001 OP *o2 = prev->op_sibling;
5009 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5010 if (cvop->op_type == OP_RV2CV) {
5012 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5013 null(cvop); /* disable rv2cv */
5014 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5015 if (tmpop->op_type == OP_GV) {
5016 cv = GvCVu(tmpop->op_sv);
5017 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5018 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5019 proto = SvPV((SV*)cv, PL_na);
5023 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5024 if (PERLDB_SUB && PL_curstash != PL_debstash)
5025 o->op_private |= OPpENTERSUB_DB;
5026 while (o2 != cvop) {
5030 return too_many_arguments(o, gv_ename(namegv));
5048 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5049 bad_type(arg, "block", gv_ename(namegv), o2);
5054 if (o2->op_type == OP_RV2GV)
5058 OP* sib = kid->op_sibling;
5059 kid->op_sibling = 0;
5060 o2 = newUNOP(OP_RV2GV, 0, kid);
5061 o2->op_sibling = sib;
5062 prev->op_sibling = o2;
5070 if (o2->op_type != OP_RV2GV)
5071 bad_type(arg, "symbol", gv_ename(namegv), o2);
5074 if (o2->op_type != OP_RV2CV)
5075 bad_type(arg, "sub", gv_ename(namegv), o2);
5078 if (o2->op_type != OP_RV2SV
5079 && o2->op_type != OP_PADSV
5080 && o2->op_type != OP_THREADSV)
5082 bad_type(arg, "scalar", gv_ename(namegv), o2);
5086 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5087 bad_type(arg, "array", gv_ename(namegv), o2);
5090 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5091 bad_type(arg, "hash", gv_ename(namegv), o2);
5095 OP* sib = kid->op_sibling;
5096 kid->op_sibling = 0;
5097 o2 = newUNOP(OP_REFGEN, 0, kid);
5098 o2->op_sibling = sib;
5099 prev->op_sibling = o2;
5110 croak("Malformed prototype for %s: %s",
5111 gv_ename(namegv), SvPV((SV*)cv, PL_na));
5116 mod(o2, OP_ENTERSUB);
5118 o2 = o2->op_sibling;
5120 if (proto && !optional &&
5121 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5122 return too_few_arguments(o, gv_ename(namegv));
5129 SvREADONLY_on(cSVOPo->op_sv);
5136 if (o->op_flags & OPf_KIDS) {
5137 SVOP *kid = (SVOP*)cUNOPo->op_first;
5139 if (kid->op_type == OP_NULL)
5140 kid = (SVOP*)kid->op_sibling;
5142 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5143 o->op_flags |= OPf_SPECIAL;
5148 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5151 peep(register OP *o)
5154 register OP* oldop = 0;
5155 if (!o || o->op_seq)
5159 SAVESPTR(PL_curcop);
5160 for (; o; o = o->op_next) {
5166 switch (o->op_type) {
5169 PL_curcop = ((COP*)o); /* for warnings */
5170 o->op_seq = PL_op_seqmax++;
5181 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5183 o->op_seq = PL_op_seqmax++;
5186 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5187 o->op_seq = PL_op_seqmax++;
5188 break; /* Scalar stub must produce undef. List stub is noop */
5192 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5193 PL_curcop = ((COP*)o);
5199 if (oldop && o->op_next) {
5200 oldop->op_next = o->op_next;
5203 o->op_seq = PL_op_seqmax++;
5207 if (o->op_next->op_type == OP_RV2SV) {
5208 if (!(o->op_next->op_private & OPpDEREF)) {
5210 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5211 o->op_next = o->op_next->op_next;
5212 o->op_type = OP_GVSV;
5213 o->op_ppaddr = ppaddr[OP_GVSV];
5216 else if (o->op_next->op_type == OP_RV2AV) {
5217 OP* pop = o->op_next->op_next;
5219 if (pop->op_type == OP_CONST &&
5220 (PL_op = pop->op_next) &&
5221 pop->op_next->op_type == OP_AELEM &&
5222 !(pop->op_next->op_private &
5223 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5224 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5228 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5232 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5233 o->op_next = pop->op_next->op_next;
5234 o->op_type = OP_AELEMFAST;
5235 o->op_ppaddr = ppaddr[OP_AELEMFAST];
5236 o->op_private = (U8)i;
5237 GvAVn(((GVOP*)o)->op_gv);
5240 o->op_seq = PL_op_seqmax++;
5247 o->op_seq = PL_op_seqmax++;
5248 while (cLOGOP->op_other->op_type == OP_NULL)
5249 cLOGOP->op_other = cLOGOP->op_other->op_next;
5250 peep(cLOGOP->op_other);
5254 o->op_seq = PL_op_seqmax++;
5255 peep(cCONDOP->op_true);
5256 peep(cCONDOP->op_false);
5260 o->op_seq = PL_op_seqmax++;
5261 peep(cLOOP->op_redoop);
5262 peep(cLOOP->op_nextop);
5263 peep(cLOOP->op_lastop);
5269 o->op_seq = PL_op_seqmax++;
5270 peep(cPMOP->op_pmreplstart);
5274 o->op_seq = PL_op_seqmax++;
5275 if (ckWARN(WARN_SYNTAX) && o->op_next
5276 && o->op_next->op_type == OP_NEXTSTATE) {
5277 if (o->op_next->op_sibling &&
5278 o->op_next->op_sibling->op_type != OP_EXIT &&
5279 o->op_next->op_sibling->op_type != OP_WARN &&
5280 o->op_next->op_sibling->op_type != OP_DIE) {
5281 line_t oldline = PL_curcop->cop_line;
5283 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5284 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5285 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5286 PL_curcop->cop_line = oldline;
5300 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5301 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5303 rop = (UNOP*)((BINOP*)o)->op_first;
5304 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5306 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5307 if (!SvOBJECT(lexname))
5309 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5310 if (!fields || !GvHV(*fields))
5312 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5313 key = SvPV(*svp, keylen);
5314 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5316 croak("No such field \"%s\" in variable %s of type %s",
5317 key, SvPV(lexname, PL_na), HvNAME(SvSTASH(lexname)));
5319 ind = SvIV(*indsvp);
5321 croak("Bad index while coercing array into hash");
5322 rop->op_type = OP_RV2AV;
5323 rop->op_ppaddr = ppaddr[OP_RV2AV];
5324 o->op_type = OP_AELEM;
5325 o->op_ppaddr = ppaddr[OP_AELEM];
5327 *svp = newSViv(ind);
5332 o->op_seq = PL_op_seqmax++;