3 * Copyright (c) 1991-1994, 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
21 #define USE_OP_MASK /* Turned on by default in 5.002beta1h */
25 * In the following definition, the ", (OP *) op" is just to make the compiler
26 * think the expression is of the right type: croak actually does a Siglongjmp.
28 #define CHECKOP(type,op) \
29 ((op_mask && op_mask[type]) \
30 ? ( op_free((OP*)op), \
31 croak("%s trapped by operation mask", op_desc[type]), \
33 : (*check[type])((OP*)op))
35 #define CHECKOP(type,op) (*check[type])(op)
36 #endif /* USE_OP_MASK */
38 static I32 list_assignment _((OP *op));
39 static OP *bad_type _((I32 n, char *t, char *name, OP *kid));
40 static OP *modkids _((OP *op, I32 type));
41 static OP *no_fh_allowed _((OP *op));
42 static OP *scalarboolean _((OP *op));
43 static OP *too_few_arguments _((OP *op, char* name));
44 static OP *too_many_arguments _((OP *op, char* name));
45 static void null _((OP* op));
46 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
47 CV* startcv, I32 cx_ix));
53 SV* tmpsv = sv_newmortal();
54 gv_efullname3(tmpsv, CvGV(cv), Nullch);
55 return SvPV(tmpsv,na);
62 sprintf(tokenbuf,"Missing comma after first argument to %s function",
63 op_desc[op->op_type]);
69 too_few_arguments(op, name)
73 sprintf(tokenbuf,"Not enough arguments for %s", name);
79 too_many_arguments(op, name)
83 sprintf(tokenbuf,"Too many arguments for %s", name);
89 bad_type(n, t, name, kid)
95 sprintf(tokenbuf, "Type of arg %d to %s must be %s (not %s)",
96 (int) n, name, t, op_desc[kid->op_type]);
105 int type = op->op_type;
106 if (type != OP_AELEM && type != OP_HELEM) {
107 sprintf(tokenbuf, "Can't use subscript on %s", op_desc[type]);
109 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV)
110 warn("(Did you mean $ or @ instead of %c?)\n",
111 type == OP_ENTERSUB ? '&' : '%');
115 /* "register" allocation */
124 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
125 if (!isPRINT(name[1]))
126 sprintf(name+1, "^%c", toCTRL(name[1])); /* XXX tokenbuf, really */
127 croak("Can't use global %s in \"my\"",name);
129 if (AvFILL(comppad_name) >= 0) {
130 SV **svp = AvARRAY(comppad_name);
131 for (off = AvFILL(comppad_name); off > comppad_name_floor; off--) {
134 && SvIVX(sv) == 999999999 /* var is in open scope */
135 && strEQ(name, SvPVX(sv)))
137 warn("\"my\" variable %s masks earlier declaration in same scope", name);
142 off = pad_alloc(OP_PADSV, SVs_PADMY);
144 sv_upgrade(sv, SVt_PVNV);
146 av_store(comppad_name, off, sv);
147 SvNVX(sv) = (double)999999999;
148 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
149 if (!min_intro_pending)
150 min_intro_pending = off;
151 max_intro_pending = off;
153 av_store(comppad, off, (SV*)newAV());
154 else if (*name == '%')
155 av_store(comppad, off, (SV*)newHV());
156 SvPADMY_on(curpad[off]);
161 #ifndef CAN_PROTOTYPE
162 pad_findlex(name, newoff, seq, startcv, cx_ix)
169 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
176 register CONTEXT *cx;
179 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
180 AV *curlist = CvPADLIST(cv);
181 SV **svp = av_fetch(curlist, 0, FALSE);
184 if (!svp || *svp == &sv_undef)
187 svp = AvARRAY(curname);
188 for (off = AvFILL(curname); off > 0; off--) {
189 if ((sv = svp[off]) &&
193 seq > I_32(SvNVX(sv)) &&
194 strEQ(SvPVX(sv), name))
203 return 0; /* don't clone from inactive stack frame */
206 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
207 oldsv = *av_fetch(oldpad, off, TRUE);
208 if (!newoff) { /* Not a mere clone operation. */
209 SV *sv = NEWSV(1103,0);
210 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
211 sv_upgrade(sv, SVt_PVNV);
213 av_store(comppad_name, newoff, sv);
214 SvNVX(sv) = (double)curcop->cop_seq;
215 SvIVX(sv) = 999999999; /* A ref, intro immediately */
216 SvFAKE_on(sv); /* A ref, not a real var */
217 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
218 /* "It's closures all the way down." */
223 bcv && bcv != cv && !CvCLONE(bcv);
224 bcv = CvOUTSIDE(bcv)) {
228 if (dowarn && !CvUNIQUE(cv))
230 "Variable \"%s\" may be unavailable",
237 else if (!CvUNIQUE(compcv)) {
238 if (dowarn && !CvUNIQUE(cv))
239 warn("Variable \"%s\" will not stay shared", name);
242 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
248 /* Nothing in current lexical context--try eval's context, if any.
249 * This is necessary to let the perldb get at lexically scoped variables.
250 * XXX This will also probably interact badly with eval tree caching.
254 for (i = cx_ix; i >= 0; i--) {
256 switch (cx->cx_type) {
258 if (i == 0 && saweval) {
259 seq = cxstack[saweval].blk_oldcop->cop_seq;
260 return pad_findlex(name, newoff, seq, main_cv, 0);
264 switch (cx->blk_eval.old_op_type) {
269 /* require must have its own scope */
277 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
278 saweval = i; /* so we know where we were called from */
281 seq = cxstack[saweval].blk_oldcop->cop_seq;
282 return pad_findlex(name, newoff, seq, cv, i-1);
295 SV **svp = AvARRAY(comppad_name);
296 U32 seq = cop_seqmax;
298 /* The one we're looking for is probably just before comppad_name_fill. */
299 for (off = AvFILL(comppad_name); off > 0; off--) {
300 if ((sv = svp[off]) &&
303 seq > I_32(SvNVX(sv)) &&
304 strEQ(SvPVX(sv), name))
306 return (PADOFFSET)off;
310 /* See if it's in a nested scope */
311 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
323 SV **svp = AvARRAY(comppad_name);
325 if (min_intro_pending && fill < min_intro_pending) {
326 for (off = max_intro_pending; off >= min_intro_pending; off--) {
327 if ((sv = svp[off]) && sv != &sv_undef)
328 warn("%s never introduced", SvPVX(sv));
331 /* "Deintroduce" my variables that are leaving with this scope. */
332 for (off = AvFILL(comppad_name); off > fill; off--) {
333 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
334 SvIVX(sv) = cop_seqmax;
339 pad_alloc(optype,tmptype)
346 if (AvARRAY(comppad) != curpad)
347 croak("panic: pad_alloc");
348 if (pad_reset_pending)
350 if (tmptype & SVs_PADMY) {
352 sv = *av_fetch(comppad, AvFILL(comppad) + 1, TRUE);
353 } while (SvPADBUSY(sv)); /* need a fresh one */
354 retval = AvFILL(comppad);
357 SV **names = AvARRAY(comppad_name);
358 SSize_t names_fill = AvFILL(comppad_name);
361 * "foreach" index vars temporarily become aliases to non-"my"
362 * values. Thus we must skip, not just pad values that are
363 * marked as current pad values, but also those with names.
365 if (++padix <= names_fill &&
366 (sv = names[padix]) && sv != &sv_undef)
368 sv = *av_fetch(comppad, padix, TRUE);
369 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
374 SvFLAGS(sv) |= tmptype;
375 curpad = AvARRAY(comppad);
376 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad alloc %ld for %s\n", (long) retval, op_name[optype]));
377 return (PADOFFSET)retval;
381 #ifndef CAN_PROTOTYPE
386 #endif /* CAN_PROTOTYPE */
389 croak("panic: pad_sv po");
390 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad sv %d\n", po));
391 return curpad[po]; /* eventually we'll turn this into a macro */
395 #ifndef CAN_PROTOTYPE
399 pad_free(PADOFFSET po)
400 #endif /* CAN_PROTOTYPE */
404 if (AvARRAY(comppad) != curpad)
405 croak("panic: pad_free curpad");
407 croak("panic: pad_free po");
408 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad free %d\n", po));
409 if (curpad[po] && curpad[po] != &sv_undef)
410 SvPADTMP_off(curpad[po]);
416 #ifndef CAN_PROTOTYPE
420 pad_swipe(PADOFFSET po)
421 #endif /* CAN_PROTOTYPE */
423 if (AvARRAY(comppad) != curpad)
424 croak("panic: pad_swipe curpad");
426 croak("panic: pad_swipe po");
427 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad swipe %d\n", po));
428 SvPADTMP_off(curpad[po]);
429 curpad[po] = NEWSV(1107,0);
430 SvPADTMP_on(curpad[po]);
440 if (AvARRAY(comppad) != curpad)
441 croak("panic: pad_reset curpad");
442 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad reset\n"));
443 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
444 for (po = AvMAX(comppad); po > padix_floor; po--) {
445 if (curpad[po] && curpad[po] != &sv_undef)
446 SvPADTMP_off(curpad[po]);
450 pad_reset_pending = FALSE;
459 register OP *kid, *nextkid;
461 if (!op || op->op_seq == (U16)-1)
464 if (op->op_flags & OPf_KIDS) {
465 for (kid = cUNOP->op_first; kid; kid = nextkid) {
466 nextkid = kid->op_sibling; /* Get before next freeing kid */
471 switch (op->op_type) {
473 op->op_targ = 0; /* Was holding old type, if any. */
476 op->op_targ = 0; /* Was holding hints. */
479 if (!(op->op_flags & OPf_REF) || (check[op->op_type] != ck_ftst))
485 SvREFCNT_dec(cGVOP->op_gv);
489 Safefree(cCOP->cop_label);
490 SvREFCNT_dec(cCOP->cop_filegv);
493 SvREFCNT_dec(cSVOP->op_sv);
499 if (op->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
503 Safefree(cPVOP->op_pv);
506 op_free(cPMOP->op_pmreplroot);
510 pregfree(cPMOP->op_pmregexp);
511 SvREFCNT_dec(cPMOP->op_pmshort);
516 pad_free(op->op_targ);
525 if (op->op_type != OP_NULL && op->op_targ > 0)
526 pad_free(op->op_targ);
527 op->op_targ = op->op_type;
528 op->op_type = OP_NULL;
529 op->op_ppaddr = ppaddr[OP_NULL];
532 /* Contextualizers */
534 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
545 /* establish postfix order */
546 if (cUNOP->op_first) {
547 op->op_next = LINKLIST(cUNOP->op_first);
548 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling) {
550 kid->op_next = LINKLIST(kid->op_sibling);
566 if (op && op->op_flags & OPf_KIDS) {
567 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
578 op->op_type == OP_SASSIGN && cBINOP->op_first->op_type == OP_CONST) {
579 line_t oldline = curcop->cop_line;
581 if (copline != NOLINE)
582 curcop->cop_line = copline;
583 warn("Found = in conditional, should be ==");
584 curcop->cop_line = oldline;
595 /* assumes no premature commitment */
596 if (!op || (op->op_flags & OPf_KNOW) || op->op_type == OP_RETURN
600 op->op_flags &= ~OPf_LIST;
601 op->op_flags |= OPf_KNOW;
603 switch (op->op_type) {
605 if (op->op_private & OPpREPEAT_DOLIST)
606 null(((LISTOP*)cBINOP->op_first)->op_first);
607 scalar(cBINOP->op_first);
612 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
616 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
617 if (!kPMOP->op_pmreplroot)
618 deprecate("implicit split to @_");
625 if (op->op_flags & OPf_KIDS) {
626 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling)
632 scalar(cLISTOP->op_first);
637 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
657 if (!op || error_count)
659 if (op->op_flags & OPf_LIST)
662 op->op_flags |= OPf_KNOW;
664 switch (op->op_type) {
666 if (!(opargs[op->op_type] & OA_FOLDCONST))
670 if (op->op_flags & OPf_STACKED)
743 if (!(op->op_private & OPpLVAL_INTRO))
744 useless = op_desc[op->op_type];
751 if (!(op->op_private & OPpLVAL_INTRO) &&
752 (!op->op_sibling || op->op_sibling->op_type != OP_READLINE))
753 useless = "a variable";
758 curcop = ((COP*)op); /* for warning below */
764 useless = "a constant";
765 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
767 else if (SvPOK(sv)) {
768 if (strnEQ(SvPVX(sv), "di", 2) ||
769 strnEQ(SvPVX(sv), "ds", 2) ||
770 strnEQ(SvPVX(sv), "ig", 2))
774 null(op); /* don't execute a constant */
775 SvREFCNT_dec(sv); /* don't even remember it */
779 op->op_type = OP_PREINC; /* pre-increment is faster */
780 op->op_ppaddr = ppaddr[OP_PREINC];
784 op->op_type = OP_PREDEC; /* pre-decrement is faster */
785 op->op_ppaddr = ppaddr[OP_PREDEC];
791 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
795 if (op->op_targ == OP_NEXTSTATE || op->op_targ == OP_DBSTATE)
796 curcop = ((COP*)op); /* for warning below */
797 if (op->op_flags & OPf_STACKED)
802 if (!(op->op_flags & OPf_KIDS))
808 op->op_private |= OPpLEAVE_VOID;
811 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
815 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
816 if (!kPMOP->op_pmreplroot)
817 deprecate("implicit split to @_");
821 op->op_private |= OPpLEAVE_VOID;
824 if (useless && dowarn)
825 warn("Useless use of %s in void context", useless);
834 if (op && op->op_flags & OPf_KIDS) {
835 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
847 /* assumes no premature commitment */
848 if (!op || (op->op_flags & OPf_KNOW) || op->op_type == OP_RETURN
852 op->op_flags |= (OPf_KNOW | OPf_LIST);
854 switch (op->op_type) {
857 list(cBINOP->op_first);
862 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
869 if (!(op->op_flags & OPf_KIDS))
871 if (!op->op_next && cUNOP->op_first->op_type == OP_FLOP) {
872 list(cBINOP->op_first);
873 return gen_constant_list(op);
880 list(cLISTOP->op_first);
884 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
903 if (op->op_type == OP_LINESEQ ||
904 op->op_type == OP_SCOPE ||
905 op->op_type == OP_LEAVE ||
906 op->op_type == OP_LEAVETRY)
908 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
909 if (kid->op_sibling) {
915 op->op_flags &= ~OPf_PARENS;
916 if (hints & HINT_BLOCK_SCOPE)
917 op->op_flags |= OPf_PARENS;
920 op = newOP(OP_STUB, 0);
930 if (op && op->op_flags & OPf_KIDS) {
931 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
947 if (!op || error_count)
950 switch (op->op_type) {
952 if (!(op->op_private & (OPpCONST_ARYBASE)))
954 if (eval_start && eval_start->op_type == OP_CONST) {
955 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
959 SAVEI32(compiling.cop_arybase);
960 compiling.cop_arybase = 0;
962 else if (type == OP_REFGEN)
965 croak("That use of $[ is unsupported");
968 if (op->op_flags & OPf_PARENS)
972 if ((type == OP_UNDEF || type == OP_REFGEN) &&
973 !(op->op_flags & OPf_STACKED)) {
974 op->op_type = OP_RV2CV; /* entersub => rv2cv */
975 op->op_ppaddr = ppaddr[OP_RV2CV];
976 assert(cUNOP->op_first->op_type == OP_NULL);
977 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
983 /* grep, foreach, subcalls, refgen */
984 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
986 sprintf(tokenbuf, "Can't modify %s in %s",
987 op_desc[op->op_type],
988 type ? op_desc[type] : "local");
1003 case OP_RIGHT_SHIFT:
1012 if (!(op->op_flags & OPf_STACKED))
1018 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
1024 if (type == OP_REFGEN && op->op_flags & OPf_PARENS) {
1026 return op; /* Treat \(@foo) like ordinary list. */
1030 ref(cUNOP->op_first, op->op_type);
1042 if (!type && cUNOP->op_first->op_type != OP_GV)
1043 croak("Can't localize a reference");
1044 ref(cUNOP->op_first, op->op_type);
1057 if (type == OP_REFGEN && op->op_flags & OPf_PARENS)
1058 return op; /* Treat \(@foo) like ordinary list. */
1063 croak("Can't localize lexical variable %s",
1064 SvPV(*av_fetch(comppad_name, op->op_targ, 4), na));
1071 if (type != OP_SASSIGN)
1077 pad_free(op->op_targ);
1078 op->op_targ = pad_alloc(op->op_type, SVs_PADMY);
1079 assert(SvTYPE(PAD_SV(op->op_targ)) == SVt_NULL);
1080 if (op->op_flags & OPf_KIDS)
1081 mod(cBINOP->op_first->op_sibling, type);
1086 ref(cBINOP->op_first, op->op_type);
1093 if (op->op_flags & OPf_KIDS)
1094 mod(cLISTOP->op_last, type);
1098 if (!(op->op_flags & OPf_KIDS))
1100 if (op->op_targ != OP_LIST) {
1101 mod(cBINOP->op_first, type);
1106 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1110 op->op_flags |= OPf_MOD;
1112 if (type == OP_AASSIGN || type == OP_SASSIGN)
1113 op->op_flags |= OPf_SPECIAL|OPf_REF;
1115 op->op_private |= OPpLVAL_INTRO;
1116 op->op_flags &= ~OPf_SPECIAL;
1118 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1119 op->op_flags |= OPf_REF;
1129 if (op && op->op_flags & OPf_KIDS) {
1130 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1143 if (!op || error_count)
1146 switch (op->op_type) {
1148 if ((type == OP_DEFINED) &&
1149 !(op->op_flags & OPf_STACKED)) {
1150 op->op_type = OP_RV2CV; /* entersub => rv2cv */
1151 op->op_ppaddr = ppaddr[OP_RV2CV];
1152 assert(cUNOP->op_first->op_type == OP_NULL);
1153 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
1154 op->op_flags |= OPf_SPECIAL;
1159 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
1163 ref(cUNOP->op_first, op->op_type);
1166 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1167 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1168 : type == OP_RV2HV ? OPpDEREF_HV
1170 op->op_flags |= OPf_MOD;
1176 op->op_flags |= OPf_REF;
1179 ref(cUNOP->op_first, op->op_type);
1184 op->op_flags |= OPf_REF;
1189 if (!(op->op_flags & OPf_KIDS))
1191 ref(cBINOP->op_first, type);
1195 ref(cBINOP->op_first, op->op_type);
1196 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1197 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1198 : type == OP_RV2HV ? OPpDEREF_HV
1200 op->op_flags |= OPf_MOD;
1208 if (!(op->op_flags & OPf_KIDS))
1210 ref(cLISTOP->op_last, type);
1226 if (!op || error_count)
1230 if (type == OP_LIST) {
1231 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1234 else if (type != OP_PADSV &&
1237 type != OP_PUSHMARK)
1239 sprintf(tokenbuf, "Can't declare %s in my", op_desc[op->op_type]);
1243 op->op_flags |= OPf_MOD;
1244 op->op_private |= OPpLVAL_INTRO;
1253 o->op_flags |= OPf_PARENS;
1258 bind_match(type, left, right)
1265 if (right->op_type == OP_MATCH ||
1266 right->op_type == OP_SUBST ||
1267 right->op_type == OP_TRANS) {
1268 right->op_flags |= OPf_STACKED;
1269 if (right->op_type != OP_MATCH)
1270 left = mod(left, right->op_type);
1271 if (right->op_type == OP_TRANS)
1272 op = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1274 op = prepend_elem(right->op_type, scalar(left), right);
1276 return newUNOP(OP_NOT, 0, scalar(op));
1280 return bind_match(type, left,
1281 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1290 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1291 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(op));
1299 if (o->op_flags & OPf_PARENS || perldb || tainting) {
1300 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1301 o->op_type = OP_LEAVE;
1302 o->op_ppaddr = ppaddr[OP_LEAVE];
1305 if (o->op_type == OP_LINESEQ) {
1307 o->op_type = OP_SCOPE;
1308 o->op_ppaddr = ppaddr[OP_SCOPE];
1309 kid = ((LISTOP*)o)->op_first;
1310 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1311 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1316 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1326 int retval = savestack_ix;
1327 SAVEI32(comppad_name_floor);
1329 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1330 comppad_name_floor = comppad_name_fill;
1332 comppad_name_floor = 0;
1334 SAVEI32(min_intro_pending);
1335 SAVEI32(max_intro_pending);
1336 min_intro_pending = 0;
1337 SAVEI32(comppad_name_fill);
1338 SAVEI32(padix_floor);
1339 padix_floor = padix;
1340 pad_reset_pending = FALSE;
1342 hints &= ~HINT_BLOCK_SCOPE;
1347 block_end(floor, seq)
1351 int needblockscope = hints & HINT_BLOCK_SCOPE;
1352 OP* retval = scalarseq(seq);
1354 pad_reset_pending = FALSE;
1356 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1357 pad_leavemy(comppad_name_fill);
1367 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), op);
1368 eval_start = linklist(eval_root);
1369 eval_root->op_next = 0;
1375 main_root = scope(sawparens(scalarvoid(op)));
1376 curcop = &compiling;
1377 main_start = LINKLIST(main_root);
1378 main_root->op_next = 0;
1382 /* Register with debugger */
1384 CV *cv = perl_get_cv("DB::postponed", FALSE);
1388 XPUSHs((SV*)compiling.cop_filegv);
1390 perl_call_sv((SV*)cv, G_DISCARD);
1401 if (o->op_flags & OPf_PARENS)
1405 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1407 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1408 if (*s == ';' || *s == '=')
1409 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1416 return mod(o, OP_NULL); /* a bit kludgey */
1423 if (o->op_type == OP_LIST) {
1424 o = convert(OP_JOIN, 0,
1425 prepend_elem(OP_LIST,
1426 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1437 I32 type = o->op_type;
1440 if (opargs[type] & OA_RETSCALAR)
1442 if (opargs[type] & OA_TARGET)
1443 o->op_targ = pad_alloc(type, SVs_PADTMP);
1445 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1446 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1448 if (!(opargs[type] & OA_FOLDCONST))
1452 goto nope; /* Don't try to run w/ errors */
1454 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1455 if (curop->op_type != OP_CONST &&
1456 curop->op_type != OP_LIST &&
1457 curop->op_type != OP_SCALAR &&
1458 curop->op_type != OP_NULL &&
1459 curop->op_type != OP_PUSHMARK) {
1464 curop = LINKLIST(o);
1469 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1470 pad_swipe(o->op_targ);
1471 else if (SvTEMP(sv)) { /* grab mortal temp? */
1472 (void)SvREFCNT_inc(sv);
1476 if (type == OP_RV2GV)
1477 return newGVOP(OP_GV, 0, (GV*)sv);
1479 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1481 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1486 SvIOK_off(sv); /* undo SvIV() damage */
1488 return newSVOP(OP_CONST, 0, sv);
1492 if (!(opargs[type] & OA_OTHERINT))
1495 if (!(hints & HINT_INTEGER)) {
1496 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1499 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1500 if (curop->op_type == OP_CONST) {
1501 if (SvIOK(((SVOP*)curop)->op_sv))
1505 if (opargs[curop->op_type] & OA_RETINTEGER)
1509 o->op_ppaddr = ppaddr[++(o->op_type)];
1516 gen_constant_list(o)
1520 I32 oldtmps_floor = tmps_floor;
1524 return o; /* Don't attempt to run with errors */
1526 op = curop = LINKLIST(o);
1532 tmps_floor = oldtmps_floor;
1534 o->op_type = OP_RV2AV;
1535 o->op_ppaddr = ppaddr[OP_RV2AV];
1536 curop = ((UNOP*)o)->op_first;
1537 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1544 convert(type, flags, op)
1552 if (!op || op->op_type != OP_LIST)
1553 op = newLISTOP(OP_LIST, 0, op, Nullop);
1555 op->op_flags &= ~(OPf_KNOW|OPf_LIST);
1557 if (!(opargs[type] & OA_MARK))
1558 null(cLISTOP->op_first);
1561 op->op_ppaddr = ppaddr[type];
1562 op->op_flags |= flags;
1564 op = CHECKOP(type, op);
1565 if (op->op_type != type)
1568 if (cLISTOP->op_children < 7) {
1569 /* XXX do we really need to do this if we're done appending?? */
1570 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1572 cLISTOP->op_last = last; /* in case check substituted last arg */
1575 return fold_constants(op);
1578 /* List constructors */
1581 append_elem(type, first, last)
1592 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1593 return newLISTOP(type, 0, first, last);
1595 if (first->op_flags & OPf_KIDS)
1596 ((LISTOP*)first)->op_last->op_sibling = last;
1598 first->op_flags |= OPf_KIDS;
1599 ((LISTOP*)first)->op_first = last;
1601 ((LISTOP*)first)->op_last = last;
1602 ((LISTOP*)first)->op_children++;
1607 append_list(type, first, last)
1618 if (first->op_type != type)
1619 return prepend_elem(type, (OP*)first, (OP*)last);
1621 if (last->op_type != type)
1622 return append_elem(type, (OP*)first, (OP*)last);
1624 first->op_last->op_sibling = last->op_first;
1625 first->op_last = last->op_last;
1626 first->op_children += last->op_children;
1627 if (first->op_children)
1628 last->op_flags |= OPf_KIDS;
1635 prepend_elem(type, first, last)
1646 if (last->op_type == type) {
1647 if (type == OP_LIST) { /* already a PUSHMARK there */
1648 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1649 ((LISTOP*)last)->op_first->op_sibling = first;
1652 if (!(last->op_flags & OPf_KIDS)) {
1653 ((LISTOP*)last)->op_last = first;
1654 last->op_flags |= OPf_KIDS;
1656 first->op_sibling = ((LISTOP*)last)->op_first;
1657 ((LISTOP*)last)->op_first = first;
1659 ((LISTOP*)last)->op_children++;
1663 return newLISTOP(type, 0, first, last);
1671 return newOP(OP_STUB, 0);
1678 if (!op || op->op_type != OP_LIST)
1679 op = newLISTOP(OP_LIST, 0, op, Nullop);
1685 newLISTOP(type, flags, first, last)
1693 Newz(1101, listop, 1, LISTOP);
1695 listop->op_type = type;
1696 listop->op_ppaddr = ppaddr[type];
1697 listop->op_children = (first != 0) + (last != 0);
1698 listop->op_flags = flags;
1702 else if (!first && last)
1705 first->op_sibling = last;
1706 listop->op_first = first;
1707 listop->op_last = last;
1708 if (type == OP_LIST) {
1710 pushop = newOP(OP_PUSHMARK, 0);
1711 pushop->op_sibling = first;
1712 listop->op_first = pushop;
1713 listop->op_flags |= OPf_KIDS;
1715 listop->op_last = pushop;
1717 else if (listop->op_children)
1718 listop->op_flags |= OPf_KIDS;
1729 Newz(1101, op, 1, OP);
1731 op->op_ppaddr = ppaddr[type];
1732 op->op_flags = flags;
1735 op->op_private = 0 + (flags >> 8);
1736 if (opargs[type] & OA_RETSCALAR)
1738 if (opargs[type] & OA_TARGET)
1739 op->op_targ = pad_alloc(type, SVs_PADTMP);
1740 return CHECKOP(type, op);
1744 newUNOP(type, flags, first)
1752 first = newOP(OP_STUB, 0);
1753 if (opargs[type] & OA_MARK)
1754 first = force_list(first);
1756 Newz(1101, unop, 1, UNOP);
1757 unop->op_type = type;
1758 unop->op_ppaddr = ppaddr[type];
1759 unop->op_first = first;
1760 unop->op_flags = flags | OPf_KIDS;
1761 unop->op_private = 1 | (flags >> 8);
1763 unop = (UNOP*) CHECKOP(type, unop);
1767 return fold_constants((OP *) unop);
1771 newBINOP(type, flags, first, last)
1778 Newz(1101, binop, 1, BINOP);
1781 first = newOP(OP_NULL, 0);
1783 binop->op_type = type;
1784 binop->op_ppaddr = ppaddr[type];
1785 binop->op_first = first;
1786 binop->op_flags = flags | OPf_KIDS;
1789 binop->op_private = 1 | (flags >> 8);
1792 binop->op_private = 2 | (flags >> 8);
1793 first->op_sibling = last;
1796 binop = (BINOP*)CHECKOP(type, binop);
1800 binop->op_last = last = binop->op_first->op_sibling;
1802 return fold_constants((OP *)binop);
1806 pmtrans(op, expr, repl)
1811 SV *tstr = ((SVOP*)expr)->op_sv;
1812 SV *rstr = ((SVOP*)repl)->op_sv;
1815 register U8 *t = (U8*)SvPV(tstr, tlen);
1816 register U8 *r = (U8*)SvPV(rstr, rlen);
1821 register short *tbl;
1823 tbl = (short*)cPVOP->op_pv;
1824 complement = op->op_private & OPpTRANS_COMPLEMENT;
1825 delete = op->op_private & OPpTRANS_DELETE;
1826 /* squash = op->op_private & OPpTRANS_SQUASH; */
1829 Zero(tbl, 256, short);
1830 for (i = 0; i < tlen; i++)
1832 for (i = 0, j = 0; i < 256; i++) {
1848 if (!rlen && !delete) {
1851 for (i = 0; i < 256; i++)
1853 for (i = 0, j = 0; i < tlen; i++,j++) {
1856 if (tbl[t[i]] == -1)
1862 if (tbl[t[i]] == -1)
1873 newPMOP(type, flags)
1879 Newz(1101, pmop, 1, PMOP);
1880 pmop->op_type = type;
1881 pmop->op_ppaddr = ppaddr[type];
1882 pmop->op_flags = flags;
1883 pmop->op_private = 0 | (flags >> 8);
1885 if (hints & HINT_LOCALE)
1886 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
1888 /* link into pm list */
1889 if (type != OP_TRANS && curstash) {
1890 pmop->op_pmnext = HvPMROOT(curstash);
1891 HvPMROOT(curstash) = pmop;
1898 pmruntime(op, expr, repl)
1906 if (op->op_type == OP_TRANS)
1907 return pmtrans(op, expr, repl);
1911 if (expr->op_type == OP_CONST) {
1913 SV *pat = ((SVOP*)expr)->op_sv;
1914 char *p = SvPV(pat, plen);
1915 if ((op->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
1916 sv_setpvn(pat, "\\s+", 3);
1917 p = SvPV(pat, plen);
1918 pm->op_pmflags |= PMf_SKIPWHITE;
1920 pm->op_pmregexp = pregcomp(p, p + plen, pm);
1921 if (strEQ("\\s+", pm->op_pmregexp->precomp))
1922 pm->op_pmflags |= PMf_WHITE;
1927 if (pm->op_pmflags & PMf_KEEP)
1928 expr = newUNOP(OP_REGCMAYBE,0,expr);
1930 Newz(1101, rcop, 1, LOGOP);
1931 rcop->op_type = OP_REGCOMP;
1932 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
1933 rcop->op_first = scalar(expr);
1934 rcop->op_flags |= OPf_KIDS;
1935 rcop->op_private = 1;
1936 rcop->op_other = op;
1938 /* establish postfix order */
1939 if (pm->op_pmflags & PMf_KEEP) {
1941 rcop->op_next = expr;
1942 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
1945 rcop->op_next = LINKLIST(expr);
1946 expr->op_next = (OP*)rcop;
1949 prepend_elem(op->op_type, scalar((OP*)rcop), op);
1954 if (pm->op_pmflags & PMf_EVAL)
1956 else if (repl->op_type == OP_CONST)
1960 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
1961 if (opargs[curop->op_type] & OA_DANGEROUS) {
1962 if (curop->op_type == OP_GV) {
1963 GV *gv = ((GVOP*)curop)->op_gv;
1964 if (strchr("&`'123456789+", *GvENAME(gv)))
1967 else if (curop->op_type == OP_RV2CV)
1969 else if (curop->op_type == OP_RV2SV ||
1970 curop->op_type == OP_RV2AV ||
1971 curop->op_type == OP_RV2HV ||
1972 curop->op_type == OP_RV2GV) {
1973 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
1976 else if (curop->op_type == OP_PADSV ||
1977 curop->op_type == OP_PADAV ||
1978 curop->op_type == OP_PADHV ||
1979 curop->op_type == OP_PADANY) {
1988 if (curop == repl) {
1989 pm->op_pmflags |= PMf_CONST; /* const for long enough */
1990 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
1991 prepend_elem(op->op_type, scalar(repl), op);
1994 Newz(1101, rcop, 1, LOGOP);
1995 rcop->op_type = OP_SUBSTCONT;
1996 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
1997 rcop->op_first = scalar(repl);
1998 rcop->op_flags |= OPf_KIDS;
1999 rcop->op_private = 1;
2000 rcop->op_other = op;
2002 /* establish postfix order */
2003 rcop->op_next = LINKLIST(repl);
2004 repl->op_next = (OP*)rcop;
2006 pm->op_pmreplroot = scalar((OP*)rcop);
2007 pm->op_pmreplstart = LINKLIST(rcop);
2016 newSVOP(type, flags, sv)
2022 Newz(1101, svop, 1, SVOP);
2023 svop->op_type = type;
2024 svop->op_ppaddr = ppaddr[type];
2026 svop->op_next = (OP*)svop;
2027 svop->op_flags = flags;
2028 if (opargs[type] & OA_RETSCALAR)
2030 if (opargs[type] & OA_TARGET)
2031 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2032 return CHECKOP(type, svop);
2036 newGVOP(type, flags, gv)
2042 Newz(1101, gvop, 1, GVOP);
2043 gvop->op_type = type;
2044 gvop->op_ppaddr = ppaddr[type];
2045 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2046 gvop->op_next = (OP*)gvop;
2047 gvop->op_flags = flags;
2048 if (opargs[type] & OA_RETSCALAR)
2050 if (opargs[type] & OA_TARGET)
2051 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2052 return CHECKOP(type, gvop);
2056 newPVOP(type, flags, pv)
2062 Newz(1101, pvop, 1, PVOP);
2063 pvop->op_type = type;
2064 pvop->op_ppaddr = ppaddr[type];
2066 pvop->op_next = (OP*)pvop;
2067 pvop->op_flags = flags;
2068 if (opargs[type] & OA_RETSCALAR)
2070 if (opargs[type] & OA_TARGET)
2071 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2072 return CHECKOP(type, pvop);
2081 save_hptr(&curstash);
2082 save_item(curstname);
2087 name = SvPV(sv, len);
2088 curstash = gv_stashpvn(name,len,TRUE);
2089 sv_setpvn(curstname, name, len);
2093 sv_setpv(curstname,"<none>");
2101 utilize(aver, floor, version, id, arg)
2114 if (id->op_type != OP_CONST)
2115 croak("Module name must be constant");
2119 if(version != Nullop) {
2120 SV *vesv = ((SVOP*)version)->op_sv;
2122 if (arg == Nullop && !SvNIOK(vesv)) {
2129 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2130 croak("Version number must be constant number");
2132 /* Make copy of id so we don't free it twice */
2133 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2135 /* Fake up a method call to VERSION */
2136 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2137 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2138 append_elem(OP_LIST,
2139 prepend_elem(OP_LIST, pack, list(version)),
2140 newUNOP(OP_METHOD, 0, meth)));
2144 /* Fake up an import/unimport */
2145 if (arg && arg->op_type == OP_STUB)
2146 imop = arg; /* no import on explicit () */
2147 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2148 imop = Nullop; /* use 5.0; */
2151 /* Make copy of id so we don't free it twice */
2152 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2153 meth = newSVOP(OP_CONST, 0,
2155 ? newSVpv("import", 6)
2156 : newSVpv("unimport", 8)
2158 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2159 append_elem(OP_LIST,
2160 prepend_elem(OP_LIST, pack, list(arg)),
2161 newUNOP(OP_METHOD, 0, meth)));
2164 /* Fake up a require */
2165 rqop = newUNOP(OP_REQUIRE, 0, id);
2167 /* Fake up the BEGIN {}, which does its thing immediately. */
2169 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2171 append_elem(OP_LINESEQ,
2172 append_elem(OP_LINESEQ,
2173 newSTATEOP(0, Nullch, rqop),
2174 newSTATEOP(0, Nullch, veop)),
2175 newSTATEOP(0, Nullch, imop) ));
2182 newSLICEOP(flags, subscript, listval)
2187 return newBINOP(OP_LSLICE, flags,
2188 list(force_list(subscript)),
2189 list(force_list(listval)) );
2199 if (op->op_type == OP_NULL && op->op_flags & OPf_KIDS)
2200 op = cUNOP->op_first;
2202 if (op->op_type == OP_COND_EXPR) {
2203 I32 t = list_assignment(cCONDOP->op_first->op_sibling);
2204 I32 f = list_assignment(cCONDOP->op_first->op_sibling->op_sibling);
2209 yyerror("Assignment to both a list and a scalar");
2213 if (op->op_type == OP_LIST || op->op_flags & OPf_PARENS ||
2214 op->op_type == OP_RV2AV || op->op_type == OP_RV2HV ||
2215 op->op_type == OP_ASLICE || op->op_type == OP_HSLICE)
2218 if (op->op_type == OP_PADAV || op->op_type == OP_PADHV)
2221 if (op->op_type == OP_RV2SV)
2228 newASSIGNOP(flags, left, optype, right)
2237 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2238 return newLOGOP(optype, 0,
2239 mod(scalar(left), optype),
2240 newUNOP(OP_SASSIGN, 0, scalar(right)));
2243 return newBINOP(optype, OPf_STACKED,
2244 mod(scalar(left), optype), scalar(right));
2248 if (list_assignment(left)) {
2250 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2251 left = mod(left, OP_AASSIGN);
2259 op = newBINOP(OP_AASSIGN, flags,
2260 list(force_list(right)),
2261 list(force_list(left)) );
2262 op->op_private = 0 | (flags >> 8);
2263 if (!(left->op_private & OPpLVAL_INTRO)) {
2264 static int generation = 100;
2268 for (curop = LINKLIST(op); curop != op; curop = LINKLIST(curop)) {
2269 if (opargs[curop->op_type] & OA_DANGEROUS) {
2270 if (curop->op_type == OP_GV) {
2271 GV *gv = ((GVOP*)curop)->op_gv;
2272 if (gv == defgv || SvCUR(gv) == generation)
2274 SvCUR(gv) = generation;
2276 else if (curop->op_type == OP_PADSV ||
2277 curop->op_type == OP_PADAV ||
2278 curop->op_type == OP_PADHV ||
2279 curop->op_type == OP_PADANY) {
2280 SV **svp = AvARRAY(comppad_name);
2281 SV *sv = svp[curop->op_targ];
2282 if (SvCUR(sv) == generation)
2284 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2286 else if (curop->op_type == OP_RV2CV)
2288 else if (curop->op_type == OP_RV2SV ||
2289 curop->op_type == OP_RV2AV ||
2290 curop->op_type == OP_RV2HV ||
2291 curop->op_type == OP_RV2GV) {
2292 if (lastop->op_type != OP_GV) /* funny deref? */
2301 op->op_private = OPpASSIGN_COMMON;
2303 if (right && right->op_type == OP_SPLIT) {
2305 if ((tmpop = ((LISTOP*)right)->op_first) &&
2306 tmpop->op_type == OP_PUSHRE)
2308 PMOP *pm = (PMOP*)tmpop;
2309 if (left->op_type == OP_RV2AV &&
2310 !(left->op_private & OPpLVAL_INTRO) &&
2311 !(op->op_private & OPpASSIGN_COMMON) )
2313 tmpop = ((UNOP*)left)->op_first;
2314 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2315 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2316 pm->op_pmflags |= PMf_ONCE;
2317 tmpop = ((UNOP*)op)->op_first; /* to list (nulled) */
2318 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2319 tmpop->op_sibling = Nullop; /* don't free split */
2320 right->op_next = tmpop->op_next; /* fix starting loc */
2321 op_free(op); /* blow off assign */
2322 right->op_flags &= ~(OPf_KNOW|OPf_LIST);
2323 /* "I don't know and I don't care." */
2328 if (modcount < 10000 &&
2329 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2331 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2333 sv_setiv(sv, modcount+1);
2341 right = newOP(OP_UNDEF, 0);
2342 if (right->op_type == OP_READLINE) {
2343 right->op_flags |= OPf_STACKED;
2344 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2347 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2348 op = newBINOP(OP_SASSIGN, flags,
2349 scalar(right), mod(scalar(left), OP_SASSIGN) );
2361 newSTATEOP(flags, label, op)
2366 U32 seq = intro_my();
2369 Newz(1101, cop, 1, COP);
2370 if (perldb && curcop->cop_line && curstash != debstash) {
2371 cop->op_type = OP_DBSTATE;
2372 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2375 cop->op_type = OP_NEXTSTATE;
2376 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2378 cop->op_flags = flags;
2379 cop->op_private = 0 | (flags >> 8);
2380 cop->op_next = (OP*)cop;
2383 cop->cop_label = label;
2384 hints |= HINT_BLOCK_SCOPE;
2387 cop->cop_arybase = curcop->cop_arybase;
2389 if (copline == NOLINE)
2390 cop->cop_line = curcop->cop_line;
2392 cop->cop_line = copline;
2395 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2396 cop->cop_stash = curstash;
2398 if (perldb && curstash != debstash) {
2399 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2400 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2401 (void)SvIOK_on(*svp);
2403 SvSTASH(*svp) = (HV*)cop;
2407 return prepend_elem(OP_LINESEQ, (OP*)cop, op);
2410 /* "Introduce" my variables to visible status. */
2418 if (! min_intro_pending)
2421 svp = AvARRAY(comppad_name);
2422 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2423 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2424 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2425 SvNVX(sv) = (double)cop_seqmax;
2428 min_intro_pending = 0;
2429 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2430 return cop_seqmax++;
2434 newLOGOP(type, flags, first, other)
2443 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2444 return newBINOP(type, flags, scalar(first), scalar(other));
2446 scalarboolean(first);
2447 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2448 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2449 if (type == OP_AND || type == OP_OR) {
2455 first = cUNOP->op_first;
2457 first->op_next = op->op_next;
2458 cUNOP->op_first = Nullop;
2462 if (first->op_type == OP_CONST) {
2463 if (dowarn && (first->op_private & OPpCONST_BARE))
2464 warn("Probable precedence problem on %s", op_desc[type]);
2465 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2474 else if (first->op_type == OP_WANTARRAY) {
2480 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2481 OP *k1 = ((UNOP*)first)->op_first;
2482 OP *k2 = k1->op_sibling;
2484 switch (first->op_type)
2487 if (k2 && k2->op_type == OP_READLINE
2488 && (k2->op_flags & OPf_STACKED)
2489 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2490 warnop = k2->op_type;
2494 if (k1->op_type == OP_READDIR || k1->op_type == OP_GLOB)
2495 warnop = k1->op_type;
2499 line_t oldline = curcop->cop_line;
2500 curcop->cop_line = copline;
2501 warn("Value of %s construct can be \"0\"; test with defined()",
2503 curcop->cop_line = oldline;
2510 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2511 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2513 Newz(1101, logop, 1, LOGOP);
2515 logop->op_type = type;
2516 logop->op_ppaddr = ppaddr[type];
2517 logop->op_first = first;
2518 logop->op_flags = flags | OPf_KIDS;
2519 logop->op_other = LINKLIST(other);
2520 logop->op_private = 1 | (flags >> 8);
2522 /* establish postfix order */
2523 logop->op_next = LINKLIST(first);
2524 first->op_next = (OP*)logop;
2525 first->op_sibling = other;
2527 op = newUNOP(OP_NULL, 0, (OP*)logop);
2528 other->op_next = op;
2534 newCONDOP(flags, first, trueop, falseop)
2544 return newLOGOP(OP_AND, 0, first, trueop);
2546 return newLOGOP(OP_OR, 0, first, falseop);
2548 scalarboolean(first);
2549 if (first->op_type == OP_CONST) {
2550 if (SvTRUE(((SVOP*)first)->op_sv)) {
2561 else if (first->op_type == OP_WANTARRAY) {
2565 Newz(1101, condop, 1, CONDOP);
2567 condop->op_type = OP_COND_EXPR;
2568 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2569 condop->op_first = first;
2570 condop->op_flags = flags | OPf_KIDS;
2571 condop->op_true = LINKLIST(trueop);
2572 condop->op_false = LINKLIST(falseop);
2573 condop->op_private = 1 | (flags >> 8);
2575 /* establish postfix order */
2576 condop->op_next = LINKLIST(first);
2577 first->op_next = (OP*)condop;
2579 first->op_sibling = trueop;
2580 trueop->op_sibling = falseop;
2581 op = newUNOP(OP_NULL, 0, (OP*)condop);
2583 trueop->op_next = op;
2584 falseop->op_next = op;
2590 newRANGE(flags, left, right)
2600 Newz(1101, condop, 1, CONDOP);
2602 condop->op_type = OP_RANGE;
2603 condop->op_ppaddr = ppaddr[OP_RANGE];
2604 condop->op_first = left;
2605 condop->op_flags = OPf_KIDS;
2606 condop->op_true = LINKLIST(left);
2607 condop->op_false = LINKLIST(right);
2608 condop->op_private = 1 | (flags >> 8);
2610 left->op_sibling = right;
2612 condop->op_next = (OP*)condop;
2613 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2614 flop = newUNOP(OP_FLOP, 0, flip);
2615 op = newUNOP(OP_NULL, 0, flop);
2618 left->op_next = flip;
2619 right->op_next = flop;
2621 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2622 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2623 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2624 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2626 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2627 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2630 if (!flip->op_private || !flop->op_private)
2631 linklist(op); /* blow off optimizer unless constant */
2637 newLOOPOP(flags, debuggable, expr, block)
2645 int once = block && block->op_flags & OPf_SPECIAL &&
2646 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2649 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2650 return block; /* do {} while 0 does once */
2651 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB) {
2652 expr = newUNOP(OP_DEFINED, 0,
2653 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2657 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2658 op = newLOGOP(OP_AND, 0, expr, listop);
2660 ((LISTOP*)listop)->op_last->op_next = LINKLIST(op);
2662 if (once && op != listop)
2663 op->op_next = ((LOGOP*)cUNOP->op_first)->op_other;
2666 op = newUNOP(OP_NULL, 0, op); /* or do {} while 1 loses outer block */
2668 op->op_flags |= flags;
2670 op->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2675 newWHILEOP(flags, debuggable, loop, expr, block, cont)
2689 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB)) {
2690 expr = newUNOP(OP_DEFINED, 0,
2691 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2695 block = newOP(OP_NULL, 0);
2698 next = LINKLIST(cont);
2700 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2702 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2703 redo = LINKLIST(listop);
2706 op = newLOGOP(OP_AND, 0, expr, scalar(listop));
2707 if (op == expr && op->op_type == OP_CONST && !SvTRUE(cSVOP->op_sv)) {
2708 op_free(expr); /* oops, it's a while (0) */
2710 return Nullop; /* (listop already freed by newLOGOP) */
2712 ((LISTOP*)listop)->op_last->op_next = condop =
2713 (op == listop ? redo : LINKLIST(op));
2721 Newz(1101,loop,1,LOOP);
2722 loop->op_type = OP_ENTERLOOP;
2723 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2724 loop->op_private = 0;
2725 loop->op_next = (OP*)loop;
2728 op = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, op);
2730 loop->op_redoop = redo;
2731 loop->op_lastop = op;
2734 loop->op_nextop = next;
2736 loop->op_nextop = op;
2738 op->op_flags |= flags;
2739 op->op_private |= (flags >> 8);
2744 #ifndef CAN_PROTOTYPE
2745 newFOROP(flags,label,forline,sv,expr,block,cont)
2754 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2755 #endif /* CAN_PROTOTYPE */
2763 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2764 sv->op_type = OP_RV2GV;
2765 sv->op_ppaddr = ppaddr[OP_RV2GV];
2767 else if (sv->op_type == OP_PADSV) { /* private variable */
2768 padoff = sv->op_targ;
2773 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2776 sv = newGVOP(OP_GV, 0, defgv);
2778 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2779 expr = scalar(ref(expr, OP_ITER));
2780 iterflags |= OPf_STACKED;
2782 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2783 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2785 assert(!loop->op_next);
2786 Renew(loop, 1, LOOP);
2787 loop->op_targ = padoff;
2788 return newSTATEOP(0, label, newWHILEOP(flags, 1, loop,
2789 newOP(OP_ITER, 0), block, cont));
2793 newLOOPEX(type, label)
2798 if (type != OP_GOTO || label->op_type == OP_CONST) {
2799 op = newPVOP(type, 0, savepv(
2800 label->op_type == OP_CONST
2801 ? SvPVx(((SVOP*)label)->op_sv, na)
2806 if (label->op_type == OP_ENTERSUB)
2807 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2808 op = newUNOP(type, OPf_STACKED, label);
2810 hints |= HINT_BLOCK_SCOPE;
2818 if (!CvXSUB(cv) && CvROOT(cv)) {
2820 croak("Can't undef active subroutine");
2827 op_free(CvROOT(cv));
2828 CvROOT(cv) = Nullop;
2832 SvREFCNT_dec(CvGV(cv));
2834 SvREFCNT_dec(CvOUTSIDE(cv));
2835 CvOUTSIDE(cv) = Nullcv;
2836 if (CvPADLIST(cv)) {
2837 /* may be during global destruction */
2838 if (SvREFCNT(CvPADLIST(cv))) {
2839 I32 i = AvFILL(CvPADLIST(cv));
2841 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
2845 SvREFCNT_dec((SV*)CvPADLIST(cv));
2847 CvPADLIST(cv) = Nullav;
2851 #ifdef DEBUG_CLOSURES
2856 CV *outside = CvOUTSIDE(cv);
2857 AV* padlist = CvPADLIST(cv);
2864 PerlIO_printf(Perl_debug_log, "\tCV=0x%p (%s), OUTSIDE=0x%p (%s)\n",
2866 (CvANON(cv) ? "ANON"
2867 : (cv == main_cv) ? "MAIN"
2868 : CvUNIQUE(outside) ? "UNIQUE"
2869 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
2872 : CvANON(outside) ? "ANON"
2873 : (outside == main_cv) ? "MAIN"
2874 : CvUNIQUE(outside) ? "UNIQUE"
2875 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
2880 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
2881 pad = (AV*)*av_fetch(padlist, 1, FALSE);
2882 pname = AvARRAY(pad_name);
2883 ppad = AvARRAY(pad);
2885 for (ix = 1; ix <= AvFILL(pad); ix++) {
2886 if (SvPOK(pname[ix]))
2887 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%p (%s\"%s\" %ld-%ld)\n",
2889 SvFAKE(pname[ix]) ? "FAKE " : "",
2891 (long)I_32(SvNVX(pname[ix])),
2892 (long)SvIVX(pname[ix]));
2895 #endif /* DEBUG_CLOSURES */
2898 cv_clone2(proto, outside)
2904 AV* protopadlist = CvPADLIST(proto);
2905 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
2906 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
2907 SV** pname = AvARRAY(protopad_name);
2908 SV** ppad = AvARRAY(protopad);
2912 assert(!CvUNIQUE(proto));
2919 cv = compcv = (CV*)NEWSV(1104,0);
2920 sv_upgrade((SV *)cv, SvTYPE(proto));
2925 CvFILEGV(cv) = CvFILEGV(proto);
2926 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
2927 CvSTASH(cv) = CvSTASH(proto);
2928 CvROOT(cv) = CvROOT(proto);
2929 CvSTART(cv) = CvSTART(proto);
2931 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
2935 comppadlist = newAV();
2936 AvREAL_off(comppadlist);
2937 av_store(comppadlist, 0, SvREFCNT_inc((SV*)protopad_name));
2938 av_store(comppadlist, 1, (SV*)comppad);
2939 CvPADLIST(cv) = comppadlist;
2940 av_fill(comppad, AvFILL(protopad));
2941 curpad = AvARRAY(comppad);
2943 av = newAV(); /* will be @_ */
2945 av_store(comppad, 0, (SV*)av);
2946 AvFLAGS(av) = AVf_REIFY;
2948 for (ix = AvFILL(protopad); ix > 0; ix--) {
2950 if (pname[ix] != &sv_undef) {
2951 char *name = SvPVX(pname[ix]); /* XXX */
2952 if (SvFLAGS(pname[ix]) & SVf_FAKE) { /* lexical from outside? */
2953 I32 off = pad_findlex(name, ix, SvIVX(pname[ix]),
2954 CvOUTSIDE(cv), cxstack_ix);
2956 curpad[ix] = SvREFCNT_inc(ppad[ix]);
2958 croak("panic: cv_clone: %s", name);
2960 else { /* our own lexical */
2962 /* anon code -- we'll come back for it */
2963 sv = SvREFCNT_inc(ppad[ix]);
2965 else if (*name == '@')
2967 else if (*name == '%')
2983 /* Now that vars are all in place, clone nested closures. */
2985 for (ix = AvFILL(protopad); ix > 0; ix--) {
2986 if (pname[ix] != &sv_undef
2987 && !(SvFLAGS(pname[ix]) & SVf_FAKE)
2988 && *SvPVX(pname[ix]) == '&'
2989 && CvCLONE(ppad[ix]))
2991 CV *kid = cv_clone2((CV*)ppad[ix], cv);
2992 SvREFCNT_dec(ppad[ix]);
2995 curpad[ix] = (SV*)kid;
2999 #ifdef DEBUG_CLOSURES
3000 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3002 PerlIO_printf(Perl_debug_log, " from:\n");
3004 PerlIO_printf(Perl_debug_log, " to:\n");
3016 return cv_clone2(proto, CvOUTSIDE(proto));
3026 if(cv && SvPOK(cv) && !SvCUR(cv)) {
3027 for (o = CvSTART(cv); o; o = o->op_next) {
3028 OPCODE type = o->op_type;
3030 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3032 if (type == OP_LEAVESUB || type == OP_RETURN)
3034 if (type != OP_CONST || sv)
3037 sv = ((SVOP*)o)->op_sv;
3044 newSUB(floor,op,proto,block)
3050 char *name = op ? SvPVx(cSVOP->op_sv, na) : Nullch;
3051 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3058 if (cv = (name ? GvCV(gv) : Nullcv)) {
3060 /* just a cached method */
3064 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3065 /* already defined (or promised) */
3067 SV* const_sv = cv_const_sv(cv);
3068 char *p = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3070 if((!proto != !SvPOK(cv)) || (p && strNE(SvPV((SV*)cv,na), p))) {
3071 warn("Prototype mismatch: (%s) vs (%s)",
3072 SvPOK(cv) ? SvPV((SV*)cv,na) : "none",
3075 if (const_sv || dowarn) {
3076 line_t oldline = curcop->cop_line;
3077 curcop->cop_line = copline;
3078 warn(const_sv ? "Constant subroutine %s redefined"
3079 : "Subroutine %s redefined",name);
3080 curcop->cop_line = oldline;
3086 if (cv) { /* must reuse cv if autoloaded */
3088 CvFLAGS(cv) = CvFLAGS(compcv);
3089 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3090 CvOUTSIDE(compcv) = 0;
3091 CvPADLIST(cv) = CvPADLIST(compcv);
3092 CvPADLIST(compcv) = 0;
3093 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3094 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3095 SvREFCNT_dec(compcv);
3105 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3106 CvFILEGV(cv) = curcop->cop_filegv;
3107 CvSTASH(cv) = curstash;
3110 char *p = SvPVx(((SVOP*)proto)->op_sv, na);
3111 sv_setpv((SV*)cv, p);
3125 av = newAV(); /* Will be @_ */
3127 av_store(comppad, 0, (SV*)av);
3128 AvFLAGS(av) = AVf_REIFY;
3130 for (ix = AvFILL(comppad); ix > 0; ix--) {
3131 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3132 SvPADTMP_on(curpad[ix]);
3135 if (AvFILL(comppad_name) < AvFILL(comppad))
3136 av_store(comppad_name, AvFILL(comppad), Nullsv);
3138 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3139 CvSTART(cv) = LINKLIST(CvROOT(cv));
3140 CvROOT(cv)->op_next = 0;
3146 if (perldb && curstash != debstash) {
3148 SV *tmpstr = sv_newmortal();
3149 static GV *db_postponed;
3153 sprintf(buf, "%s:%ld",
3154 SvPVX(GvSV(curcop->cop_filegv)), (long)subline);
3155 sv = newSVpv(buf,0);
3157 sprintf(buf,"%ld",(long)curcop->cop_line);
3159 gv_efullname3(tmpstr, gv, Nullch);
3160 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3161 if (!db_postponed) {
3162 db_postponed = gv_fetchpv("DB::postponed", TRUE, SVt_PVHV);
3164 hv = GvHVn(db_postponed);
3165 if (HvFILL(hv) >= 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3166 && (cv = GvCV(db_postponed))) {
3171 perl_call_sv((SV*)cv, G_DISCARD);
3175 if ((s = strrchr(name,':')))
3179 if (strEQ(s, "BEGIN") && !error_count) {
3181 SAVESPTR(compiling.cop_filegv);
3182 SAVEI16(compiling.cop_line);
3189 DEBUG_x( dump_sub(gv) );
3190 av_push(beginav, (SV *)cv);
3194 curcop = &compiling;
3197 else if (strEQ(s, "END") && !error_count) {
3200 av_unshift(endav, 1);
3201 av_store(endav, 0, (SV *)cv);
3213 newXSUB(name, ix, subaddr, filename)
3219 CV* cv = newXS(name, (void(*)())subaddr, filename);
3221 CvXSUBANY(cv).any_i32 = ix;
3227 newXS(name, subaddr, filename)
3229 void (*subaddr) _((CV*));
3232 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3235 if (cv = (name ? GvCV(gv) : Nullcv)) {
3237 /* just a cached method */
3241 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3242 /* already defined (or promised) */
3244 line_t oldline = curcop->cop_line;
3245 curcop->cop_line = copline;
3246 warn("Subroutine %s redefined",name);
3247 curcop->cop_line = oldline;
3254 if (cv) /* must reuse cv if autoloaded */
3257 cv = (CV*)NEWSV(1105,0);
3258 sv_upgrade((SV *)cv, SVt_PVCV);
3265 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3266 CvFILEGV(cv) = gv_fetchfile(filename);
3267 CvXSUB(cv) = subaddr;
3270 char *s = strrchr(name,':');
3275 if (strEQ(s, "BEGIN")) {
3278 av_push(beginav, (SV *)cv);
3281 else if (strEQ(s, "END")) {
3284 av_unshift(endav, 1);
3285 av_store(endav, 0, (SV *)cv);
3296 newFORM(floor,op,block)
3307 name = SvPVx(cSVOP->op_sv, na);
3310 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3312 if (cv = GvFORM(gv)) {
3314 line_t oldline = curcop->cop_line;
3316 curcop->cop_line = copline;
3317 warn("Format %s redefined",name);
3318 curcop->cop_line = oldline;
3324 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3325 CvFILEGV(cv) = curcop->cop_filegv;
3327 for (ix = AvFILL(comppad); ix > 0; ix--) {
3328 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3329 SvPADTMP_on(curpad[ix]);
3332 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3333 CvSTART(cv) = LINKLIST(CvROOT(cv));
3334 CvROOT(cv)->op_next = 0;
3345 return newUNOP(OP_REFGEN, 0,
3346 mod(list(convert(OP_ANONLIST, 0, op)), OP_REFGEN));
3353 return newUNOP(OP_REFGEN, 0,
3354 mod(list(convert(OP_ANONHASH, 0, op)), OP_REFGEN));
3358 newANONSUB(floor, proto, block)
3363 return newUNOP(OP_REFGEN, 0,
3364 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3371 switch (o->op_type) {
3373 o->op_type = OP_PADAV;
3374 o->op_ppaddr = ppaddr[OP_PADAV];
3375 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3378 o->op_type = OP_RV2AV;
3379 o->op_ppaddr = ppaddr[OP_RV2AV];
3384 warn("oops: oopsAV");
3394 switch (o->op_type) {
3397 o->op_type = OP_PADHV;
3398 o->op_ppaddr = ppaddr[OP_PADHV];
3399 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3403 o->op_type = OP_RV2HV;
3404 o->op_ppaddr = ppaddr[OP_RV2HV];
3409 warn("oops: oopsHV");
3419 if (o->op_type == OP_PADANY) {
3420 o->op_type = OP_PADAV;
3421 o->op_ppaddr = ppaddr[OP_PADAV];
3424 return newUNOP(OP_RV2AV, 0, scalar(o));
3432 if (type == OP_MAPSTART)
3433 return newUNOP(OP_NULL, 0, o);
3434 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3441 if (o->op_type == OP_PADANY) {
3442 o->op_type = OP_PADHV;
3443 o->op_ppaddr = ppaddr[OP_PADHV];
3446 return newUNOP(OP_RV2HV, 0, scalar(o));
3453 croak("NOT IMPL LINE %d",__LINE__);
3463 return newUNOP(OP_RV2CV, flags, scalar(o));
3470 if (o->op_type == OP_PADANY) {
3471 o->op_type = OP_PADSV;
3472 o->op_ppaddr = ppaddr[OP_PADSV];
3475 return newUNOP(OP_RV2SV, 0, scalar(o));
3478 /* Check routines. */
3487 name = NEWSV(1106,0);
3488 sv_upgrade(name, SVt_PVNV);
3489 sv_setpvn(name, "&", 1);
3492 ix = pad_alloc(op->op_type, SVs_PADMY);
3493 av_store(comppad_name, ix, name);
3494 av_store(comppad, ix, cSVOP->op_sv);
3495 SvPADMY_on(cSVOP->op_sv);
3496 cSVOP->op_sv = Nullsv;
3497 cSVOP->op_targ = ix;
3505 op->op_private = hints;
3513 if (cUNOP->op_first->op_type == OP_CONCAT)
3514 op->op_flags |= OPf_STACKED;
3522 if (op->op_flags & OPf_KIDS) {
3525 OPCODE type = op->op_type;
3526 op = modkids(ck_fun(op), type);
3527 kid = cUNOP->op_first;
3528 newop = kUNOP->op_first->op_sibling;
3530 (newop->op_sibling ||
3531 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3532 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3533 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3537 op_free(kUNOP->op_first);
3538 kUNOP->op_first = newop;
3540 op->op_ppaddr = ppaddr[++op->op_type];
3550 if (op->op_flags & OPf_KIDS) {
3551 OP *kid = cUNOP->op_first;
3552 if (kid->op_type == OP_HSLICE)
3553 op->op_private |= OPpSLICE;
3554 else if (kid->op_type != OP_HELEM)
3555 croak("%s argument is not a HASH element or slice",
3556 op_desc[op->op_type]);
3566 I32 type = op->op_type;
3568 if (op->op_flags & OPf_KIDS) {
3569 if (cLISTOP->op_first->op_type == OP_STUB) {
3571 op = newUNOP(type, OPf_SPECIAL,
3572 newGVOP(OP_GV, 0, gv_fetchpv("main'ARGV", TRUE, SVt_PVAV)));
3583 hints |= HINT_BLOCK_SCOPE;
3584 if (op->op_flags & OPf_KIDS) {
3585 SVOP *kid = (SVOP*)cUNOP->op_first;
3588 op->op_flags &= ~OPf_KIDS;
3591 else if (kid->op_type == OP_LINESEQ) {
3594 kid->op_next = op->op_next;
3595 cUNOP->op_first = 0;
3598 Newz(1101, enter, 1, LOGOP);
3599 enter->op_type = OP_ENTERTRY;
3600 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3601 enter->op_private = 0;
3603 /* establish postfix order */
3604 enter->op_next = (OP*)enter;
3606 op = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3607 op->op_type = OP_LEAVETRY;
3608 op->op_ppaddr = ppaddr[OP_LEAVETRY];
3609 enter->op_other = op;
3615 op = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3617 op->op_targ = (PADOFFSET)hints;
3626 if (op->op_flags & OPf_STACKED) {
3628 kid = cUNOP->op_first->op_sibling;
3629 if (kid->op_type == OP_RV2GV)
3642 if (op->op_flags & OPf_KIDS) {
3643 OP *kid = cUNOP->op_first;
3644 if (kid->op_type != OP_HELEM)
3645 croak("%s argument is not a HASH element", op_desc[op->op_type]);
3655 o = fold_constants(o);
3656 if (o->op_type == OP_CONST)
3665 SVOP *kid = (SVOP*)cUNOP->op_first;
3667 op->op_private |= (hints & HINT_STRICT_REFS);
3668 if (kid->op_type == OP_CONST) {
3673 name = SvPV(kid->op_sv, na);
3674 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3675 char *badthing = Nullch;
3676 switch (op->op_type) {
3678 badthing = "a SCALAR";
3681 badthing = "an ARRAY";
3684 badthing = "a HASH";
3689 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3692 kid->op_type = OP_GV;
3693 iscv = (op->op_type == OP_RV2CV) * 2;
3694 for (gv = 0; !gv; iscv++) {
3696 * This is a little tricky. We only want to add the symbol if we
3697 * didn't add it in the lexer. Otherwise we get duplicate strict
3698 * warnings. But if we didn't add it in the lexer, we must at
3699 * least pretend like we wanted to add it even if it existed before,
3700 * or we get possible typo warnings. OPpCONST_ENTERED says
3701 * whether the lexer already added THIS instance of this symbol.
3703 gv = gv_fetchpv(name,
3704 iscv | !(kid->op_private & OPpCONST_ENTERED),
3707 : op->op_type == OP_RV2SV
3709 : op->op_type == OP_RV2AV
3711 : op->op_type == OP_RV2HV
3715 SvREFCNT_dec(kid->op_sv);
3716 kid->op_sv = SvREFCNT_inc(gv);
3725 I32 type = op->op_type;
3727 if (op->op_flags & OPf_REF)
3730 if (op->op_flags & OPf_KIDS) {
3731 SVOP *kid = (SVOP*)cUNOP->op_first;
3733 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3734 OP *newop = newGVOP(type, OPf_REF,
3735 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
3742 if (type == OP_FTTTY)
3743 return newGVOP(type, OPf_REF, gv_fetchpv("main'STDIN", TRUE,
3746 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3759 int type = op->op_type;
3760 register I32 oa = opargs[type] >> OASHIFT;
3762 if (op->op_flags & OPf_STACKED) {
3763 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
3766 return no_fh_allowed(op);
3769 if (op->op_flags & OPf_KIDS) {
3770 tokid = &cLISTOP->op_first;
3771 kid = cLISTOP->op_first;
3772 if (kid->op_type == OP_PUSHMARK ||
3773 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
3775 tokid = &kid->op_sibling;
3776 kid = kid->op_sibling;
3778 if (!kid && opargs[type] & OA_DEFGV)
3779 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
3783 sibl = kid->op_sibling;
3797 if (kid->op_type == OP_CONST &&
3798 (kid->op_private & OPpCONST_BARE)) {
3799 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
3800 OP *newop = newAVREF(newGVOP(OP_GV, 0,
3801 gv_fetchpv(name, TRUE, SVt_PVAV) ));
3803 warn("Array @%s missing the @ in argument %d of %s()",
3804 name, numargs, op_desc[type]);
3807 kid->op_sibling = sibl;
3810 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
3811 bad_type(numargs, "array", op_desc[op->op_type], kid);
3815 if (kid->op_type == OP_CONST &&
3816 (kid->op_private & OPpCONST_BARE)) {
3817 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
3818 OP *newop = newHVREF(newGVOP(OP_GV, 0,
3819 gv_fetchpv(name, TRUE, SVt_PVHV) ));
3821 warn("Hash %%%s missing the %% in argument %d of %s()",
3822 name, numargs, op_desc[type]);
3825 kid->op_sibling = sibl;
3828 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
3829 bad_type(numargs, "hash", op_desc[op->op_type], kid);
3834 OP *newop = newUNOP(OP_NULL, 0, kid);
3835 kid->op_sibling = 0;
3837 newop->op_next = newop;
3839 kid->op_sibling = sibl;
3844 if (kid->op_type != OP_GV) {
3845 if (kid->op_type == OP_CONST &&
3846 (kid->op_private & OPpCONST_BARE)) {
3847 OP *newop = newGVOP(OP_GV, 0,
3848 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
3854 kid->op_sibling = 0;
3855 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
3857 kid->op_sibling = sibl;
3863 mod(scalar(kid), type);
3867 tokid = &kid->op_sibling;
3868 kid = kid->op_sibling;
3870 op->op_private |= numargs;
3872 return too_many_arguments(op,op_desc[op->op_type]);
3875 else if (opargs[type] & OA_DEFGV) {
3877 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3881 while (oa & OA_OPTIONAL)
3883 if (oa && oa != OA_LIST)
3884 return too_few_arguments(op,op_desc[op->op_type]);
3893 GV *gv = gv_fetchpv("glob", FALSE, SVt_PVCV);
3895 if (gv && GvIMPORTED_CV(gv)) {
3896 op->op_type = OP_LIST;
3897 op->op_ppaddr = ppaddr[OP_LIST];
3898 op = newUNOP(OP_ENTERSUB, OPf_STACKED,
3899 append_elem(OP_LIST, op,
3900 scalar(newUNOP(OP_RV2CV, 0,
3901 newGVOP(OP_GV, 0, gv)))));
3904 if ((op->op_flags & OPf_KIDS) && !cLISTOP->op_first->op_sibling)
3905 append_elem(OP_GLOB, op, newSVREF(newGVOP(OP_GV, 0, defgv)));
3906 gv = newGVgen("main");
3908 append_elem(OP_GLOB, op, newGVOP(OP_GV, 0, gv));
3919 OPCODE type = op->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
3921 op->op_ppaddr = ppaddr[OP_GREPSTART];
3922 Newz(1101, gwop, 1, LOGOP);
3924 if (op->op_flags & OPf_STACKED) {
3927 kid = cLISTOP->op_first->op_sibling;
3928 for (k = cLISTOP->op_first->op_sibling->op_next; k; k = k->op_next) {
3931 kid->op_next = (OP*)gwop;
3932 op->op_flags &= ~OPf_STACKED;
3934 kid = cLISTOP->op_first->op_sibling;
3935 if (type == OP_MAPWHILE)
3942 kid = cLISTOP->op_first->op_sibling;
3943 if (kid->op_type != OP_NULL)
3944 croak("panic: ck_grep");
3945 kid = kUNOP->op_first;
3947 gwop->op_type = type;
3948 gwop->op_ppaddr = ppaddr[type];
3949 gwop->op_first = listkids(op);
3950 gwop->op_flags |= OPf_KIDS;
3951 gwop->op_private = 1;
3952 gwop->op_other = LINKLIST(kid);
3953 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
3954 kid->op_next = (OP*)gwop;
3956 kid = cLISTOP->op_first->op_sibling;
3957 if (!kid || !kid->op_sibling)
3958 return too_few_arguments(op,op_desc[op->op_type]);
3959 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
3960 mod(kid, OP_GREPSTART);
3969 if (op->op_flags & OPf_KIDS) {
3970 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3971 if (kid && kid->op_type == OP_CONST)
3972 fbm_compile(((SVOP*)kid)->op_sv);
3981 /* XXX length optimization goes here */
3989 OPCODE type = op->op_type;
3990 return modkids(ck_fun(op), type);
3997 OPCODE type = op->op_type;
3998 return refkids(ck_fun(op), type);
4007 kid = cLISTOP->op_first;
4009 op = force_list(op);
4010 kid = cLISTOP->op_first;
4012 if (kid->op_type == OP_PUSHMARK)
4013 kid = kid->op_sibling;
4014 if (kid && op->op_flags & OPf_STACKED)
4015 kid = kid->op_sibling;
4016 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4017 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4018 op->op_flags |= OPf_STACKED; /* make it a filehandle */
4019 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4020 cLISTOP->op_first->op_sibling = kid;
4021 cLISTOP->op_last = kid;
4022 kid = kid->op_sibling;
4027 append_elem(op->op_type, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4033 if (hints & HINT_LOCALE)
4034 op->op_private |= OPpLOCALE;
4048 if (hints & HINT_LOCALE)
4049 op->op_private |= OPpLOCALE;
4061 if (hints & HINT_LOCALE)
4062 op->op_private |= OPpLOCALE;
4072 cPMOP->op_pmflags |= PMf_RUNTIME;
4073 cPMOP->op_pmpermflags |= PMf_RUNTIME;
4088 if (cBINOP->op_first->op_flags & OPf_PARENS) {
4089 op->op_private |= OPpREPEAT_DOLIST;
4090 cBINOP->op_first = force_list(cBINOP->op_first);
4101 if (op->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4102 SVOP *kid = (SVOP*)cUNOP->op_first;
4104 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4106 for (s = SvPVX(kid->op_sv); *s; s++) {
4107 if (*s == ':' && s[1] == ':') {
4109 Move(s+2, s+1, strlen(s+2)+1, char);
4110 --SvCUR(kid->op_sv);
4113 sv_catpvn(kid->op_sv, ".pm", 3);
4123 croak("NOT IMPL LINE %d",__LINE__);
4133 if (op->op_flags & OPf_KIDS) {
4134 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4135 if (kid && kid->op_sibling) {
4136 op->op_type = OP_SSELECT;
4137 op->op_ppaddr = ppaddr[OP_SSELECT];
4139 return fold_constants(op);
4143 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4144 if (kid && kid->op_type == OP_RV2GV)
4145 kid->op_private &= ~HINT_STRICT_REFS;
4153 I32 type = op->op_type;
4155 if (!(op->op_flags & OPf_KIDS)) {
4157 return newUNOP(type, 0,
4158 scalar(newUNOP(OP_RV2AV, 0,
4159 scalar(newGVOP(OP_GV, 0, subline
4161 : gv_fetchpv("ARGV", TRUE, SVt_PVAV) )))));
4163 return scalar(modkids(ck_fun(op), type));
4172 if (hints & HINT_LOCALE)
4173 op->op_private |= OPpLOCALE;
4176 if (op->op_flags & OPf_STACKED) {
4177 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4179 kid = kUNOP->op_first; /* get past rv2gv */
4181 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4183 if (kid->op_type == OP_SCOPE) {
4187 else if (kid->op_type == OP_LEAVE) {
4188 if (op->op_type == OP_SORT) {
4189 null(kid); /* wipe out leave */
4192 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4193 if (k->op_next == kid)
4198 kid->op_next = 0; /* just disconnect the leave */
4199 k = kLISTOP->op_first;
4203 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4204 null(kid); /* wipe out rv2gv */
4205 if (op->op_type == OP_SORT)
4209 op->op_flags |= OPf_SPECIAL;
4223 if (op->op_flags & OPf_STACKED)
4224 return no_fh_allowed(op);
4226 kid = cLISTOP->op_first;
4227 if (kid->op_type != OP_NULL)
4228 croak("panic: ck_split");
4229 kid = kid->op_sibling;
4230 op_free(cLISTOP->op_first);
4231 cLISTOP->op_first = kid;
4233 cLISTOP->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4234 cLISTOP->op_last = kid; /* There was only one element previously */
4237 if (kid->op_type != OP_MATCH) {
4238 OP *sibl = kid->op_sibling;
4239 kid->op_sibling = 0;
4240 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4241 if (cLISTOP->op_first == cLISTOP->op_last)
4242 cLISTOP->op_last = kid;
4243 cLISTOP->op_first = kid;
4244 kid->op_sibling = sibl;
4247 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4248 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4252 kid->op_type = OP_PUSHRE;
4253 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4256 if (!kid->op_sibling)
4257 append_elem(OP_SPLIT, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4259 kid = kid->op_sibling;
4262 if (!kid->op_sibling)
4263 append_elem(OP_SPLIT, op, newSVOP(OP_CONST, 0, newSViv(0)));
4265 kid = kid->op_sibling;
4268 if (kid->op_sibling)
4269 return too_many_arguments(op,op_desc[op->op_type]);
4278 OP *prev = ((cUNOP->op_first->op_sibling)
4279 ? cUNOP : ((UNOP*)cUNOP->op_first))->op_first;
4280 OP *o = prev->op_sibling;
4287 for (cvop = o; cvop->op_sibling; cvop = cvop->op_sibling) ;
4288 if (cvop->op_type == OP_RV2CV) {
4290 op->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4291 null(cvop); /* disable rv2cv */
4292 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4293 if (tmpop->op_type == OP_GV) {
4294 cv = GvCVu(tmpop->op_sv);
4295 if (cv && SvPOK(cv) && !(op->op_private & OPpENTERSUB_AMPER))
4296 proto = SvPV((SV*)cv,na);
4299 op->op_private |= (hints & HINT_STRICT_REFS);
4300 if (perldb && curstash != debstash)
4301 op->op_private |= OPpENTERSUB_DB;
4306 return too_many_arguments(op, CvNAME(cv));
4324 if (o->op_type != OP_REFGEN && o->op_type != OP_UNDEF)
4325 bad_type(arg, "block", CvNAME(cv), o);
4330 if (o->op_type == OP_RV2GV)
4334 o = newUNOP(OP_RV2GV, 0, kid);
4335 o->op_sibling = kid->op_sibling;
4336 kid->op_sibling = 0;
4337 prev->op_sibling = o;
4345 if (o->op_type != OP_RV2GV)
4346 bad_type(arg, "symbol", CvNAME(cv), o);
4349 if (o->op_type != OP_RV2CV)
4350 bad_type(arg, "sub", CvNAME(cv), o);
4353 if (o->op_type != OP_RV2SV && o->op_type != OP_PADSV)
4354 bad_type(arg, "scalar", CvNAME(cv), o);
4357 if (o->op_type != OP_RV2AV && o->op_type != OP_PADAV)
4358 bad_type(arg, "array", CvNAME(cv), o);
4361 if (o->op_type != OP_RV2HV && o->op_type != OP_PADHV)
4362 bad_type(arg, "hash", CvNAME(cv), o);
4366 o = newUNOP(OP_REFGEN, 0, kid);
4367 o->op_sibling = kid->op_sibling;
4368 kid->op_sibling = 0;
4369 prev->op_sibling = o;
4380 croak("Malformed prototype for %s: %s",
4381 CvNAME(cv),SvPV((SV*)cv,na));
4386 mod(o, OP_ENTERSUB);
4390 if (proto && !optional && *proto == '$')
4391 return too_few_arguments(op, CvNAME(cv));
4399 SvREADONLY_on(cSVOP->op_sv);
4407 if (op->op_flags & OPf_KIDS) {
4408 SVOP *kid = (SVOP*)cUNOP->op_first;
4410 if (kid->op_type == OP_NULL)
4411 kid = (SVOP*)kid->op_sibling;
4413 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4414 op->op_flags |= OPf_SPECIAL;
4419 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4425 register OP* oldop = 0;
4426 if (!o || o->op_seq)
4431 for (; o; o = o->op_next) {
4437 switch (o->op_type) {
4440 curcop = ((COP*)o); /* for warnings */
4441 o->op_seq = op_seqmax++;
4452 if (o->op_next->op_type == OP_STRINGIFY)
4454 o->op_seq = op_seqmax++;
4457 if ((o->op_flags & (OPf_KNOW|OPf_LIST)) != (OPf_KNOW|OPf_LIST)) {
4458 o->op_seq = op_seqmax++;
4459 break; /* Scalar stub must produce undef. List stub is noop */
4463 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4464 curcop = ((COP*)op);
4470 if (oldop && o->op_next) {
4471 oldop->op_next = o->op_next;
4474 o->op_seq = op_seqmax++;
4478 if (o->op_next->op_type == OP_RV2SV) {
4479 if (!(o->op_next->op_private & OPpDEREF)) {
4481 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4482 o->op_next = o->op_next->op_next;
4483 o->op_type = OP_GVSV;
4484 o->op_ppaddr = ppaddr[OP_GVSV];
4487 else if (o->op_next->op_type == OP_RV2AV) {
4488 OP* pop = o->op_next->op_next;
4490 if (pop->op_type == OP_CONST &&
4491 (op = pop->op_next) &&
4492 pop->op_next->op_type == OP_AELEM &&
4493 !(pop->op_next->op_private & (OPpDEREF|OPpLVAL_INTRO)) &&
4494 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4498 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4502 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4503 o->op_next = pop->op_next->op_next;
4504 o->op_type = OP_AELEMFAST;
4505 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4506 o->op_private = (U8)i;
4507 GvAVn(((GVOP*)o)->op_gv);
4510 o->op_seq = op_seqmax++;
4517 o->op_seq = op_seqmax++;
4518 peep(cLOGOP->op_other);
4522 o->op_seq = op_seqmax++;
4523 peep(cCONDOP->op_true);
4524 peep(cCONDOP->op_false);
4528 o->op_seq = op_seqmax++;
4529 peep(cLOOP->op_redoop);
4530 peep(cLOOP->op_nextop);
4531 peep(cLOOP->op_lastop);
4536 o->op_seq = op_seqmax++;
4537 peep(cPMOP->op_pmreplstart);
4541 o->op_seq = op_seqmax++;
4542 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4543 if (o->op_next->op_sibling &&
4544 o->op_next->op_sibling->op_type != OP_DIE) {
4545 line_t oldline = curcop->cop_line;
4547 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4548 warn("Statement unlikely to be reached");
4549 warn("(Maybe you meant system() when you said exec()?)\n");
4550 curcop->cop_line = oldline;
4555 o->op_seq = op_seqmax++;