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
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 bool scalar_mod_type _((OP *op, I32 type));
43 static OP *scalarboolean _((OP *op));
44 static OP *too_few_arguments _((OP *op, char* name));
45 static OP *too_many_arguments _((OP *op, char* name));
46 static void null _((OP* op));
47 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
48 CV* startcv, I32 cx_ix));
54 SV* tmpsv = sv_newmortal();
55 gv_efullname3(tmpsv, gv, Nullch);
56 return SvPV(tmpsv,na);
63 yyerror(form("Missing comma after first argument to %s function",
64 op_desc[op->op_type]));
69 too_few_arguments(op, name)
73 yyerror(form("Not enough arguments for %s", name));
78 too_many_arguments(op, name)
82 yyerror(form("Too many arguments for %s", name));
87 bad_type(n, t, name, kid)
93 yyerror(form("Type of arg %d to %s must be %s (not %s)",
94 (int)n, name, t, op_desc[kid->op_type]));
102 int type = op->op_type;
103 if (type != OP_AELEM && type != OP_HELEM) {
104 yyerror(form("Can't use subscript on %s", op_desc[type]));
105 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV)
106 warn("(Did you mean $ or @ instead of %c?)\n",
107 type == OP_ENTERSUB ? '&' : '%');
111 /* "register" allocation */
120 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
121 if (!isPRINT(name[1])) {
123 name[2] = toCTRL(name[1]);
126 croak("Can't use global %s in \"my\"",name);
128 if (AvFILL(comppad_name) >= 0) {
129 SV **svp = AvARRAY(comppad_name);
130 for (off = AvFILL(comppad_name); off > comppad_name_floor; off--) {
133 && SvIVX(sv) == 999999999 /* var is in open scope */
134 && strEQ(name, SvPVX(sv)))
136 warn("\"my\" variable %s masks earlier declaration in same scope", name);
141 off = pad_alloc(OP_PADSV, SVs_PADMY);
143 sv_upgrade(sv, SVt_PVNV);
145 av_store(comppad_name, off, sv);
146 SvNVX(sv) = (double)999999999;
147 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
148 if (!min_intro_pending)
149 min_intro_pending = off;
150 max_intro_pending = off;
152 av_store(comppad, off, (SV*)newAV());
153 else if (*name == '%')
154 av_store(comppad, off, (SV*)newHV());
155 SvPADMY_on(curpad[off]);
160 #ifndef CAN_PROTOTYPE
161 pad_findlex(name, newoff, seq, startcv, cx_ix)
168 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
175 register CONTEXT *cx;
178 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
179 AV *curlist = CvPADLIST(cv);
180 SV **svp = av_fetch(curlist, 0, FALSE);
183 if (!svp || *svp == &sv_undef)
186 svp = AvARRAY(curname);
187 for (off = AvFILL(curname); off > 0; off--) {
188 if ((sv = svp[off]) &&
191 seq > I_32(SvNVX(sv)) &&
192 strEQ(SvPVX(sv), name))
203 return 0; /* don't clone from inactive stack frame */
207 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
208 oldsv = *av_fetch(oldpad, off, TRUE);
209 if (!newoff) { /* Not a mere clone operation. */
210 SV *namesv = NEWSV(1103,0);
211 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
212 sv_upgrade(namesv, SVt_PVNV);
213 sv_setpv(namesv, name);
214 av_store(comppad_name, newoff, namesv);
215 SvNVX(namesv) = (double)curcop->cop_seq;
216 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
217 SvFAKE_on(namesv); /* A ref, not a real var */
218 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
219 /* "It's closures all the way down." */
223 oldsv = Nullsv; /* no need to keep ref */
228 bcv && bcv != cv && !CvCLONE(bcv);
229 bcv = CvOUTSIDE(bcv)) {
233 if (dowarn && !CvUNIQUE(cv))
235 "Variable \"%s\" may be unavailable",
242 else if (!CvUNIQUE(compcv)) {
243 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
244 warn("Variable \"%s\" will not stay shared", name);
247 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
253 /* Nothing in current lexical context--try eval's context, if any.
254 * This is necessary to let the perldb get at lexically scoped variables.
255 * XXX This will also probably interact badly with eval tree caching.
259 for (i = cx_ix; i >= 0; i--) {
261 switch (cx->cx_type) {
263 if (i == 0 && saweval) {
264 seq = cxstack[saweval].blk_oldcop->cop_seq;
265 return pad_findlex(name, newoff, seq, main_cv, 0);
269 switch (cx->blk_eval.old_op_type) {
274 /* require must have its own scope */
282 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
283 saweval = i; /* so we know where we were called from */
286 seq = cxstack[saweval].blk_oldcop->cop_seq;
287 return pad_findlex(name, newoff, seq, cv, i-1);
301 SV **svp = AvARRAY(comppad_name);
302 U32 seq = cop_seqmax;
304 /* The one we're looking for is probably just before comppad_name_fill. */
305 for (off = AvFILL(comppad_name); off > 0; off--) {
306 if ((sv = svp[off]) &&
310 seq > I_32(SvNVX(sv)))) &&
311 strEQ(SvPVX(sv), name))
314 return (PADOFFSET)off;
315 pendoff = off; /* this pending def. will override import */
319 /* See if it's in a nested scope */
320 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
322 /* If there is a pending local definition, this new alias must die */
324 SvIVX(AvARRAY(comppad_name)[off]) = seq;
336 SV **svp = AvARRAY(comppad_name);
338 if (min_intro_pending && fill < min_intro_pending) {
339 for (off = max_intro_pending; off >= min_intro_pending; off--) {
340 if ((sv = svp[off]) && sv != &sv_undef)
341 warn("%s never introduced", SvPVX(sv));
344 /* "Deintroduce" my variables that are leaving with this scope. */
345 for (off = AvFILL(comppad_name); off > fill; off--) {
346 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
347 SvIVX(sv) = cop_seqmax;
352 pad_alloc(optype,tmptype)
359 if (AvARRAY(comppad) != curpad)
360 croak("panic: pad_alloc");
361 if (pad_reset_pending)
363 if (tmptype & SVs_PADMY) {
365 sv = *av_fetch(comppad, AvFILL(comppad) + 1, TRUE);
366 } while (SvPADBUSY(sv)); /* need a fresh one */
367 retval = AvFILL(comppad);
370 SV **names = AvARRAY(comppad_name);
371 SSize_t names_fill = AvFILL(comppad_name);
374 * "foreach" index vars temporarily become aliases to non-"my"
375 * values. Thus we must skip, not just pad values that are
376 * marked as current pad values, but also those with names.
378 if (++padix <= names_fill &&
379 (sv = names[padix]) && sv != &sv_undef)
381 sv = *av_fetch(comppad, padix, TRUE);
382 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
387 SvFLAGS(sv) |= tmptype;
388 curpad = AvARRAY(comppad);
389 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad alloc %ld for %s\n", (long) retval, op_name[optype]));
390 return (PADOFFSET)retval;
394 #ifndef CAN_PROTOTYPE
399 #endif /* CAN_PROTOTYPE */
402 croak("panic: pad_sv po");
403 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad sv %lu\n", (unsigned long)po));
404 return curpad[po]; /* eventually we'll turn this into a macro */
408 #ifndef CAN_PROTOTYPE
412 pad_free(PADOFFSET po)
413 #endif /* CAN_PROTOTYPE */
417 if (AvARRAY(comppad) != curpad)
418 croak("panic: pad_free curpad");
420 croak("panic: pad_free po");
421 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad free %lu\n", (unsigned long)po));
422 if (curpad[po] && !SvIMMORTAL(curpad[po]))
423 SvPADTMP_off(curpad[po]);
429 #ifndef CAN_PROTOTYPE
433 pad_swipe(PADOFFSET po)
434 #endif /* CAN_PROTOTYPE */
436 if (AvARRAY(comppad) != curpad)
437 croak("panic: pad_swipe curpad");
439 croak("panic: pad_swipe po");
440 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad swipe %lu\n", (unsigned long)po));
441 SvPADTMP_off(curpad[po]);
442 curpad[po] = NEWSV(1107,0);
443 SvPADTMP_on(curpad[po]);
453 if (AvARRAY(comppad) != curpad)
454 croak("panic: pad_reset curpad");
455 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad reset\n"));
456 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
457 for (po = AvMAX(comppad); po > padix_floor; po--) {
458 if (curpad[po] && !SvIMMORTAL(curpad[po]))
459 SvPADTMP_off(curpad[po]);
463 pad_reset_pending = FALSE;
472 register OP *kid, *nextkid;
474 if (!op || op->op_seq == (U16)-1)
477 if (op->op_flags & OPf_KIDS) {
478 for (kid = cUNOP->op_first; kid; kid = nextkid) {
479 nextkid = kid->op_sibling; /* Get before next freeing kid */
484 switch (op->op_type) {
486 op->op_targ = 0; /* Was holding old type, if any. */
489 op->op_targ = 0; /* Was holding hints. */
492 if (!(op->op_flags & OPf_REF) || (check[op->op_type] != ck_ftst))
498 SvREFCNT_dec(cGVOP->op_gv);
502 Safefree(cCOP->cop_label);
503 SvREFCNT_dec(cCOP->cop_filegv);
506 SvREFCNT_dec(cSVOP->op_sv);
512 if (op->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
516 Safefree(cPVOP->op_pv);
519 op_free(cPMOP->op_pmreplroot);
523 pregfree(cPMOP->op_pmregexp);
524 SvREFCNT_dec(cPMOP->op_pmshort);
529 pad_free(op->op_targ);
538 if (op->op_type != OP_NULL && op->op_targ > 0)
539 pad_free(op->op_targ);
540 op->op_targ = op->op_type;
541 op->op_type = OP_NULL;
542 op->op_ppaddr = ppaddr[OP_NULL];
545 /* Contextualizers */
547 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
558 /* establish postfix order */
559 if (cUNOP->op_first) {
560 op->op_next = LINKLIST(cUNOP->op_first);
561 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling) {
563 kid->op_next = LINKLIST(kid->op_sibling);
579 if (op && op->op_flags & OPf_KIDS) {
580 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
591 op->op_type == OP_SASSIGN && cBINOP->op_first->op_type == OP_CONST) {
592 line_t oldline = curcop->cop_line;
594 if (copline != NOLINE)
595 curcop->cop_line = copline;
596 warn("Found = in conditional, should be ==");
597 curcop->cop_line = oldline;
608 /* assumes no premature commitment */
609 if (!op || (op->op_flags & OPf_WANT) || error_count
610 || op->op_type == OP_RETURN)
613 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
615 switch (op->op_type) {
617 if (op->op_private & OPpREPEAT_DOLIST)
618 null(((LISTOP*)cBINOP->op_first)->op_first);
619 scalar(cBINOP->op_first);
624 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
628 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
629 if (!kPMOP->op_pmreplroot)
630 deprecate("implicit split to @_");
637 if (op->op_flags & OPf_KIDS) {
638 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling)
644 kid = cLISTOP->op_first;
646 while (kid = kid->op_sibling) {
657 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
677 /* assumes no premature commitment */
678 if (!op || (op->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
679 || op->op_type == OP_RETURN)
682 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
684 switch (op->op_type) {
686 if (!(opargs[op->op_type] & OA_FOLDCONST))
690 if (op->op_flags & OPf_STACKED)
761 if (!(op->op_private & OPpLVAL_INTRO))
762 useless = op_desc[op->op_type];
769 if (!(op->op_private & OPpLVAL_INTRO) &&
770 (!op->op_sibling || op->op_sibling->op_type != OP_READLINE))
771 useless = "a variable";
776 curcop = ((COP*)op); /* for warning below */
782 useless = "a constant";
783 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
785 else if (SvPOK(sv)) {
786 if (strnEQ(SvPVX(sv), "di", 2) ||
787 strnEQ(SvPVX(sv), "ds", 2) ||
788 strnEQ(SvPVX(sv), "ig", 2))
792 null(op); /* don't execute a constant */
793 SvREFCNT_dec(sv); /* don't even remember it */
797 op->op_type = OP_PREINC; /* pre-increment is faster */
798 op->op_ppaddr = ppaddr[OP_PREINC];
802 op->op_type = OP_PREDEC; /* pre-decrement is faster */
803 op->op_ppaddr = ppaddr[OP_PREDEC];
809 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
814 if (op->op_targ == OP_NEXTSTATE || op->op_targ == OP_DBSTATE)
815 curcop = ((COP*)op); /* for warning below */
816 if (op->op_flags & OPf_STACKED)
822 if (!(op->op_flags & OPf_KIDS))
831 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
838 /* all requires must return a boolean value */
839 op->op_flags &= ~OPf_WANT;
842 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
843 if (!kPMOP->op_pmreplroot)
844 deprecate("implicit split to @_");
848 if (useless && dowarn)
849 warn("Useless use of %s in void context", useless);
858 if (op && op->op_flags & OPf_KIDS) {
859 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
871 /* assumes no premature commitment */
872 if (!op || (op->op_flags & OPf_WANT) || error_count
873 || op->op_type == OP_RETURN)
876 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
878 switch (op->op_type) {
881 list(cBINOP->op_first);
886 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
893 if (!(op->op_flags & OPf_KIDS))
895 if (!op->op_next && cUNOP->op_first->op_type == OP_FLOP) {
896 list(cBINOP->op_first);
897 return gen_constant_list(op);
904 kid = cLISTOP->op_first;
906 while (kid = kid->op_sibling) {
916 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
925 /* all requires must return a boolean value */
926 op->op_flags &= ~OPf_WANT;
939 if (op->op_type == OP_LINESEQ ||
940 op->op_type == OP_SCOPE ||
941 op->op_type == OP_LEAVE ||
942 op->op_type == OP_LEAVETRY)
944 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
945 if (kid->op_sibling) {
951 op->op_flags &= ~OPf_PARENS;
952 if (hints & HINT_BLOCK_SCOPE)
953 op->op_flags |= OPf_PARENS;
956 op = newOP(OP_STUB, 0);
966 if (op && op->op_flags & OPf_KIDS) {
967 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
983 if (!op || error_count)
986 switch (op->op_type) {
991 if (!(op->op_private & (OPpCONST_ARYBASE)))
993 if (eval_start && eval_start->op_type == OP_CONST) {
994 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
998 SAVEI32(compiling.cop_arybase);
999 compiling.cop_arybase = 0;
1001 else if (type == OP_REFGEN)
1004 croak("That use of $[ is unsupported");
1007 if (op->op_flags & OPf_PARENS)
1011 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1012 !(op->op_flags & OPf_STACKED)) {
1013 op->op_type = OP_RV2CV; /* entersub => rv2cv */
1014 op->op_ppaddr = ppaddr[OP_RV2CV];
1015 assert(cUNOP->op_first->op_type == OP_NULL);
1016 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
1022 /* grep, foreach, subcalls, refgen */
1023 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1025 yyerror(form("Can't modify %s in %s",
1026 op_desc[op->op_type],
1027 type ? op_desc[type] : "local"));
1041 case OP_RIGHT_SHIFT:
1050 if (!(op->op_flags & OPf_STACKED))
1056 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
1062 if (!type && cUNOP->op_first->op_type != OP_GV)
1063 croak("Can't localize through a reference");
1064 if (type == OP_REFGEN && op->op_flags & OPf_PARENS) {
1066 return op; /* Treat \(@foo) like ordinary list. */
1070 if (scalar_mod_type(op, type))
1072 ref(cUNOP->op_first, op->op_type);
1084 if (!type && cUNOP->op_first->op_type != OP_GV)
1085 croak("Can't localize through a reference");
1086 ref(cUNOP->op_first, op->op_type);
1098 if (type == OP_REFGEN && op->op_flags & OPf_PARENS)
1099 return op; /* Treat \(@foo) like ordinary list. */
1100 if (scalar_mod_type(op, type))
1106 croak("Can't localize lexical variable %s",
1107 SvPV(*av_fetch(comppad_name, op->op_targ, 4), na));
1114 if (type != OP_SASSIGN)
1120 pad_free(op->op_targ);
1121 op->op_targ = pad_alloc(op->op_type, SVs_PADMY);
1122 assert(SvTYPE(PAD_SV(op->op_targ)) == SVt_NULL);
1123 if (op->op_flags & OPf_KIDS)
1124 mod(cBINOP->op_first->op_sibling, type);
1129 ref(cBINOP->op_first, op->op_type);
1130 if (type == OP_ENTERSUB &&
1131 !(op->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1132 op->op_private |= OPpLVAL_DEFER;
1139 if (op->op_flags & OPf_KIDS)
1140 mod(cLISTOP->op_last, type);
1144 if (!(op->op_flags & OPf_KIDS))
1146 if (op->op_targ != OP_LIST) {
1147 mod(cBINOP->op_first, type);
1152 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1156 op->op_flags |= OPf_MOD;
1158 if (type == OP_AASSIGN || type == OP_SASSIGN)
1159 op->op_flags |= OPf_SPECIAL|OPf_REF;
1161 op->op_private |= OPpLVAL_INTRO;
1162 op->op_flags &= ~OPf_SPECIAL;
1164 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1165 op->op_flags |= OPf_REF;
1170 scalar_mod_type(op, type)
1176 if (op->op_type == OP_RV2GV)
1200 case OP_RIGHT_SHIFT:
1207 case OP_ANDASSIGN: /* may work later */
1208 case OP_ORASSIGN: /* may work later */
1221 if (op && op->op_flags & OPf_KIDS) {
1222 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1235 if (!op || error_count)
1238 switch (op->op_type) {
1240 if ((type == OP_DEFINED) &&
1241 !(op->op_flags & OPf_STACKED)) {
1242 op->op_type = OP_RV2CV; /* entersub => rv2cv */
1243 op->op_ppaddr = ppaddr[OP_RV2CV];
1244 assert(cUNOP->op_first->op_type == OP_NULL);
1245 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
1246 op->op_flags |= OPf_SPECIAL;
1251 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
1255 ref(cUNOP->op_first, op->op_type);
1258 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1259 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1260 : type == OP_RV2HV ? OPpDEREF_HV
1262 op->op_flags |= OPf_MOD;
1268 op->op_flags |= OPf_REF;
1271 ref(cUNOP->op_first, op->op_type);
1276 op->op_flags |= OPf_REF;
1281 if (!(op->op_flags & OPf_KIDS))
1283 ref(cBINOP->op_first, type);
1287 ref(cBINOP->op_first, op->op_type);
1288 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1289 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1290 : type == OP_RV2HV ? OPpDEREF_HV
1292 op->op_flags |= OPf_MOD;
1300 if (!(op->op_flags & OPf_KIDS))
1302 ref(cLISTOP->op_last, type);
1318 if (!op || error_count)
1322 if (type == OP_LIST) {
1323 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1326 else if (type != OP_PADSV &&
1329 type != OP_PUSHMARK)
1331 yyerror(form("Can't declare %s in my", op_desc[op->op_type]));
1334 op->op_flags |= OPf_MOD;
1335 op->op_private |= OPpLVAL_INTRO;
1344 o->op_flags |= OPf_PARENS;
1349 bind_match(type, left, right)
1357 (left->op_type == OP_RV2AV ||
1358 left->op_type == OP_RV2HV ||
1359 left->op_type == OP_PADAV ||
1360 left->op_type == OP_PADHV)) {
1361 char *desc = op_desc[(right->op_type == OP_SUBST ||
1362 right->op_type == OP_TRANS)
1363 ? right->op_type : OP_MATCH];
1364 char *sample = ((left->op_type == OP_RV2AV ||
1365 left->op_type == OP_PADAV)
1366 ? "@array" : "%hash");
1367 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1370 if (right->op_type == OP_MATCH ||
1371 right->op_type == OP_SUBST ||
1372 right->op_type == OP_TRANS) {
1373 right->op_flags |= OPf_STACKED;
1374 if (right->op_type != OP_MATCH)
1375 left = mod(left, right->op_type);
1376 if (right->op_type == OP_TRANS)
1377 op = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1379 op = prepend_elem(right->op_type, scalar(left), right);
1381 return newUNOP(OP_NOT, 0, scalar(op));
1385 return bind_match(type, left,
1386 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1395 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1396 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(op));
1404 if (o->op_flags & OPf_PARENS || perldb || tainting) {
1405 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1406 o->op_type = OP_LEAVE;
1407 o->op_ppaddr = ppaddr[OP_LEAVE];
1410 if (o->op_type == OP_LINESEQ) {
1412 o->op_type = OP_SCOPE;
1413 o->op_ppaddr = ppaddr[OP_SCOPE];
1414 kid = ((LISTOP*)o)->op_first;
1415 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1416 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1421 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1431 int retval = savestack_ix;
1432 SAVEI32(comppad_name_floor);
1434 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1435 comppad_name_floor = comppad_name_fill;
1437 comppad_name_floor = 0;
1439 SAVEI32(min_intro_pending);
1440 SAVEI32(max_intro_pending);
1441 min_intro_pending = 0;
1442 SAVEI32(comppad_name_fill);
1443 SAVEI32(padix_floor);
1444 padix_floor = padix;
1445 pad_reset_pending = FALSE;
1447 hints &= ~HINT_BLOCK_SCOPE;
1452 block_end(floor, seq)
1456 int needblockscope = hints & HINT_BLOCK_SCOPE;
1457 OP* retval = scalarseq(seq);
1459 pad_reset_pending = FALSE;
1461 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1462 pad_leavemy(comppad_name_fill);
1472 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), op);
1473 eval_start = linklist(eval_root);
1474 eval_root->op_next = 0;
1480 main_root = scope(sawparens(scalarvoid(op)));
1481 curcop = &compiling;
1482 main_start = LINKLIST(main_root);
1483 main_root->op_next = 0;
1487 /* Register with debugger */
1489 CV *cv = perl_get_cv("DB::postponed", FALSE);
1493 XPUSHs((SV*)compiling.cop_filegv);
1495 perl_call_sv((SV*)cv, G_DISCARD);
1506 if (o->op_flags & OPf_PARENS)
1510 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1512 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1513 if (*s == ';' || *s == '=')
1514 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1521 return mod(o, OP_NULL); /* a bit kludgey */
1528 if (o->op_type == OP_LIST) {
1529 o = convert(OP_JOIN, 0,
1530 prepend_elem(OP_LIST,
1531 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1542 I32 type = o->op_type;
1545 if (opargs[type] & OA_RETSCALAR)
1547 if (opargs[type] & OA_TARGET)
1548 o->op_targ = pad_alloc(type, SVs_PADTMP);
1550 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1551 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1553 if (!(opargs[type] & OA_FOLDCONST))
1557 goto nope; /* Don't try to run w/ errors */
1559 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1560 if (curop->op_type != OP_CONST &&
1561 curop->op_type != OP_LIST &&
1562 curop->op_type != OP_SCALAR &&
1563 curop->op_type != OP_NULL &&
1564 curop->op_type != OP_PUSHMARK) {
1569 curop = LINKLIST(o);
1574 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1575 pad_swipe(o->op_targ);
1576 else if (SvTEMP(sv)) { /* grab mortal temp? */
1577 (void)SvREFCNT_inc(sv);
1581 if (type == OP_RV2GV)
1582 return newGVOP(OP_GV, 0, (GV*)sv);
1584 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1586 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1591 SvIOK_off(sv); /* undo SvIV() damage */
1593 return newSVOP(OP_CONST, 0, sv);
1597 if (!(opargs[type] & OA_OTHERINT))
1600 if (!(hints & HINT_INTEGER)) {
1601 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1604 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1605 if (curop->op_type == OP_CONST) {
1606 if (SvIOK(((SVOP*)curop)->op_sv))
1610 if (opargs[curop->op_type] & OA_RETINTEGER)
1614 o->op_ppaddr = ppaddr[++(o->op_type)];
1621 gen_constant_list(o)
1625 I32 oldtmps_floor = tmps_floor;
1629 return o; /* Don't attempt to run with errors */
1631 op = curop = LINKLIST(o);
1637 tmps_floor = oldtmps_floor;
1639 o->op_type = OP_RV2AV;
1640 o->op_ppaddr = ppaddr[OP_RV2AV];
1641 curop = ((UNOP*)o)->op_first;
1642 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1649 convert(type, flags, op)
1657 if (!op || op->op_type != OP_LIST)
1658 op = newLISTOP(OP_LIST, 0, op, Nullop);
1660 op->op_flags &= ~OPf_WANT;
1662 if (!(opargs[type] & OA_MARK))
1663 null(cLISTOP->op_first);
1666 op->op_ppaddr = ppaddr[type];
1667 op->op_flags |= flags;
1669 op = CHECKOP(type, op);
1670 if (op->op_type != type)
1673 if (cLISTOP->op_children < 7) {
1674 /* XXX do we really need to do this if we're done appending?? */
1675 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1677 cLISTOP->op_last = last; /* in case check substituted last arg */
1680 return fold_constants(op);
1683 /* List constructors */
1686 append_elem(type, first, last)
1697 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1698 return newLISTOP(type, 0, first, last);
1700 if (first->op_flags & OPf_KIDS)
1701 ((LISTOP*)first)->op_last->op_sibling = last;
1703 first->op_flags |= OPf_KIDS;
1704 ((LISTOP*)first)->op_first = last;
1706 ((LISTOP*)first)->op_last = last;
1707 ((LISTOP*)first)->op_children++;
1712 append_list(type, first, last)
1723 if (first->op_type != type)
1724 return prepend_elem(type, (OP*)first, (OP*)last);
1726 if (last->op_type != type)
1727 return append_elem(type, (OP*)first, (OP*)last);
1729 first->op_last->op_sibling = last->op_first;
1730 first->op_last = last->op_last;
1731 first->op_children += last->op_children;
1732 if (first->op_children)
1733 last->op_flags |= OPf_KIDS;
1740 prepend_elem(type, first, last)
1751 if (last->op_type == type) {
1752 if (type == OP_LIST) { /* already a PUSHMARK there */
1753 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1754 ((LISTOP*)last)->op_first->op_sibling = first;
1757 if (!(last->op_flags & OPf_KIDS)) {
1758 ((LISTOP*)last)->op_last = first;
1759 last->op_flags |= OPf_KIDS;
1761 first->op_sibling = ((LISTOP*)last)->op_first;
1762 ((LISTOP*)last)->op_first = first;
1764 ((LISTOP*)last)->op_children++;
1768 return newLISTOP(type, 0, first, last);
1776 return newOP(OP_STUB, 0);
1783 if (!op || op->op_type != OP_LIST)
1784 op = newLISTOP(OP_LIST, 0, op, Nullop);
1790 newLISTOP(type, flags, first, last)
1798 Newz(1101, listop, 1, LISTOP);
1800 listop->op_type = type;
1801 listop->op_ppaddr = ppaddr[type];
1802 listop->op_children = (first != 0) + (last != 0);
1803 listop->op_flags = flags;
1807 else if (!first && last)
1810 first->op_sibling = last;
1811 listop->op_first = first;
1812 listop->op_last = last;
1813 if (type == OP_LIST) {
1815 pushop = newOP(OP_PUSHMARK, 0);
1816 pushop->op_sibling = first;
1817 listop->op_first = pushop;
1818 listop->op_flags |= OPf_KIDS;
1820 listop->op_last = pushop;
1822 else if (listop->op_children)
1823 listop->op_flags |= OPf_KIDS;
1834 Newz(1101, op, 1, OP);
1836 op->op_ppaddr = ppaddr[type];
1837 op->op_flags = flags;
1840 op->op_private = 0 + (flags >> 8);
1841 if (opargs[type] & OA_RETSCALAR)
1843 if (opargs[type] & OA_TARGET)
1844 op->op_targ = pad_alloc(type, SVs_PADTMP);
1845 return CHECKOP(type, op);
1849 newUNOP(type, flags, first)
1857 first = newOP(OP_STUB, 0);
1858 if (opargs[type] & OA_MARK)
1859 first = force_list(first);
1861 Newz(1101, unop, 1, UNOP);
1862 unop->op_type = type;
1863 unop->op_ppaddr = ppaddr[type];
1864 unop->op_first = first;
1865 unop->op_flags = flags | OPf_KIDS;
1866 unop->op_private = 1 | (flags >> 8);
1868 unop = (UNOP*) CHECKOP(type, unop);
1872 return fold_constants((OP *) unop);
1876 newBINOP(type, flags, first, last)
1883 Newz(1101, binop, 1, BINOP);
1886 first = newOP(OP_NULL, 0);
1888 binop->op_type = type;
1889 binop->op_ppaddr = ppaddr[type];
1890 binop->op_first = first;
1891 binop->op_flags = flags | OPf_KIDS;
1894 binop->op_private = 1 | (flags >> 8);
1897 binop->op_private = 2 | (flags >> 8);
1898 first->op_sibling = last;
1901 binop = (BINOP*)CHECKOP(type, binop);
1905 binop->op_last = last = binop->op_first->op_sibling;
1907 return fold_constants((OP *)binop);
1911 pmtrans(op, expr, repl)
1916 SV *tstr = ((SVOP*)expr)->op_sv;
1917 SV *rstr = ((SVOP*)repl)->op_sv;
1920 register U8 *t = (U8*)SvPV(tstr, tlen);
1921 register U8 *r = (U8*)SvPV(rstr, rlen);
1926 register short *tbl;
1928 tbl = (short*)cPVOP->op_pv;
1929 complement = op->op_private & OPpTRANS_COMPLEMENT;
1930 delete = op->op_private & OPpTRANS_DELETE;
1931 /* squash = op->op_private & OPpTRANS_SQUASH; */
1934 Zero(tbl, 256, short);
1935 for (i = 0; i < tlen; i++)
1937 for (i = 0, j = 0; i < 256; i++) {
1953 if (!rlen && !delete) {
1956 for (i = 0; i < 256; i++)
1958 for (i = 0, j = 0; i < tlen; i++,j++) {
1961 if (tbl[t[i]] == -1)
1967 if (tbl[t[i]] == -1)
1978 newPMOP(type, flags)
1984 Newz(1101, pmop, 1, PMOP);
1985 pmop->op_type = type;
1986 pmop->op_ppaddr = ppaddr[type];
1987 pmop->op_flags = flags;
1988 pmop->op_private = 0 | (flags >> 8);
1990 if (hints & HINT_LOCALE)
1991 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
1993 /* link into pm list */
1994 if (type != OP_TRANS && curstash) {
1995 pmop->op_pmnext = HvPMROOT(curstash);
1996 HvPMROOT(curstash) = pmop;
2003 pmruntime(op, expr, repl)
2011 if (op->op_type == OP_TRANS)
2012 return pmtrans(op, expr, repl);
2014 hints |= HINT_BLOCK_SCOPE;
2017 if (expr->op_type == OP_CONST) {
2019 SV *pat = ((SVOP*)expr)->op_sv;
2020 char *p = SvPV(pat, plen);
2021 if ((op->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2022 sv_setpvn(pat, "\\s+", 3);
2023 p = SvPV(pat, plen);
2024 pm->op_pmflags |= PMf_SKIPWHITE;
2026 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2027 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2028 pm->op_pmflags |= PMf_WHITE;
2033 if (pm->op_pmflags & PMf_KEEP)
2034 expr = newUNOP(OP_REGCMAYBE,0,expr);
2036 Newz(1101, rcop, 1, LOGOP);
2037 rcop->op_type = OP_REGCOMP;
2038 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2039 rcop->op_first = scalar(expr);
2040 rcop->op_flags |= OPf_KIDS;
2041 rcop->op_private = 1;
2042 rcop->op_other = op;
2044 /* establish postfix order */
2045 if (pm->op_pmflags & PMf_KEEP) {
2047 rcop->op_next = expr;
2048 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2051 rcop->op_next = LINKLIST(expr);
2052 expr->op_next = (OP*)rcop;
2055 prepend_elem(op->op_type, scalar((OP*)rcop), op);
2060 if (pm->op_pmflags & PMf_EVAL)
2062 else if (repl->op_type == OP_CONST)
2066 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2067 if (opargs[curop->op_type] & OA_DANGEROUS) {
2068 if (curop->op_type == OP_GV) {
2069 GV *gv = ((GVOP*)curop)->op_gv;
2070 if (strchr("&`'123456789+", *GvENAME(gv)))
2073 else if (curop->op_type == OP_RV2CV)
2075 else if (curop->op_type == OP_RV2SV ||
2076 curop->op_type == OP_RV2AV ||
2077 curop->op_type == OP_RV2HV ||
2078 curop->op_type == OP_RV2GV) {
2079 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2082 else if (curop->op_type == OP_PADSV ||
2083 curop->op_type == OP_PADAV ||
2084 curop->op_type == OP_PADHV ||
2085 curop->op_type == OP_PADANY) {
2094 if (curop == repl) {
2095 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2096 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2097 prepend_elem(op->op_type, scalar(repl), op);
2100 Newz(1101, rcop, 1, LOGOP);
2101 rcop->op_type = OP_SUBSTCONT;
2102 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2103 rcop->op_first = scalar(repl);
2104 rcop->op_flags |= OPf_KIDS;
2105 rcop->op_private = 1;
2106 rcop->op_other = op;
2108 /* establish postfix order */
2109 rcop->op_next = LINKLIST(repl);
2110 repl->op_next = (OP*)rcop;
2112 pm->op_pmreplroot = scalar((OP*)rcop);
2113 pm->op_pmreplstart = LINKLIST(rcop);
2122 newSVOP(type, flags, sv)
2128 Newz(1101, svop, 1, SVOP);
2129 svop->op_type = type;
2130 svop->op_ppaddr = ppaddr[type];
2132 svop->op_next = (OP*)svop;
2133 svop->op_flags = flags;
2134 if (opargs[type] & OA_RETSCALAR)
2136 if (opargs[type] & OA_TARGET)
2137 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2138 return CHECKOP(type, svop);
2142 newGVOP(type, flags, gv)
2148 Newz(1101, gvop, 1, GVOP);
2149 gvop->op_type = type;
2150 gvop->op_ppaddr = ppaddr[type];
2151 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2152 gvop->op_next = (OP*)gvop;
2153 gvop->op_flags = flags;
2154 if (opargs[type] & OA_RETSCALAR)
2156 if (opargs[type] & OA_TARGET)
2157 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2158 return CHECKOP(type, gvop);
2162 newPVOP(type, flags, pv)
2168 Newz(1101, pvop, 1, PVOP);
2169 pvop->op_type = type;
2170 pvop->op_ppaddr = ppaddr[type];
2172 pvop->op_next = (OP*)pvop;
2173 pvop->op_flags = flags;
2174 if (opargs[type] & OA_RETSCALAR)
2176 if (opargs[type] & OA_TARGET)
2177 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2178 return CHECKOP(type, pvop);
2187 save_hptr(&curstash);
2188 save_item(curstname);
2193 name = SvPV(sv, len);
2194 curstash = gv_stashpvn(name,len,TRUE);
2195 sv_setpvn(curstname, name, len);
2199 sv_setpv(curstname,"<none>");
2207 utilize(aver, floor, version, id, arg)
2220 if (id->op_type != OP_CONST)
2221 croak("Module name must be constant");
2225 if(version != Nullop) {
2226 SV *vesv = ((SVOP*)version)->op_sv;
2228 if (arg == Nullop && !SvNIOK(vesv)) {
2235 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2236 croak("Version number must be constant number");
2238 /* Make copy of id so we don't free it twice */
2239 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2241 /* Fake up a method call to VERSION */
2242 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2243 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2244 append_elem(OP_LIST,
2245 prepend_elem(OP_LIST, pack, list(version)),
2246 newUNOP(OP_METHOD, 0, meth)));
2250 /* Fake up an import/unimport */
2251 if (arg && arg->op_type == OP_STUB)
2252 imop = arg; /* no import on explicit () */
2253 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2254 imop = Nullop; /* use 5.0; */
2257 /* Make copy of id so we don't free it twice */
2258 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2259 meth = newSVOP(OP_CONST, 0,
2261 ? newSVpv("import", 6)
2262 : newSVpv("unimport", 8)
2264 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2265 append_elem(OP_LIST,
2266 prepend_elem(OP_LIST, pack, list(arg)),
2267 newUNOP(OP_METHOD, 0, meth)));
2270 /* Fake up a require */
2271 rqop = newUNOP(OP_REQUIRE, 0, id);
2273 /* Fake up the BEGIN {}, which does its thing immediately. */
2275 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2277 append_elem(OP_LINESEQ,
2278 append_elem(OP_LINESEQ,
2279 newSTATEOP(0, Nullch, rqop),
2280 newSTATEOP(0, Nullch, veop)),
2281 newSTATEOP(0, Nullch, imop) ));
2288 newSLICEOP(flags, subscript, listval)
2293 return newBINOP(OP_LSLICE, flags,
2294 list(force_list(subscript)),
2295 list(force_list(listval)) );
2305 if (op->op_type == OP_NULL && op->op_flags & OPf_KIDS)
2306 op = cUNOP->op_first;
2308 if (op->op_type == OP_COND_EXPR) {
2309 I32 t = list_assignment(cCONDOP->op_first->op_sibling);
2310 I32 f = list_assignment(cCONDOP->op_first->op_sibling->op_sibling);
2315 yyerror("Assignment to both a list and a scalar");
2319 if (op->op_type == OP_LIST || op->op_flags & OPf_PARENS ||
2320 op->op_type == OP_RV2AV || op->op_type == OP_RV2HV ||
2321 op->op_type == OP_ASLICE || op->op_type == OP_HSLICE)
2324 if (op->op_type == OP_PADAV || op->op_type == OP_PADHV)
2327 if (op->op_type == OP_RV2SV)
2334 newASSIGNOP(flags, left, optype, right)
2343 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2344 return newLOGOP(optype, 0,
2345 mod(scalar(left), optype),
2346 newUNOP(OP_SASSIGN, 0, scalar(right)));
2349 return newBINOP(optype, OPf_STACKED,
2350 mod(scalar(left), optype), scalar(right));
2354 if (list_assignment(left)) {
2356 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2357 left = mod(left, OP_AASSIGN);
2365 op = newBINOP(OP_AASSIGN, flags,
2366 list(force_list(right)),
2367 list(force_list(left)) );
2368 op->op_private = 0 | (flags >> 8);
2369 if (!(left->op_private & OPpLVAL_INTRO)) {
2370 static int generation = 100;
2374 for (curop = LINKLIST(op); curop != op; curop = LINKLIST(curop)) {
2375 if (opargs[curop->op_type] & OA_DANGEROUS) {
2376 if (curop->op_type == OP_GV) {
2377 GV *gv = ((GVOP*)curop)->op_gv;
2378 if (gv == defgv || SvCUR(gv) == generation)
2380 SvCUR(gv) = generation;
2382 else if (curop->op_type == OP_PADSV ||
2383 curop->op_type == OP_PADAV ||
2384 curop->op_type == OP_PADHV ||
2385 curop->op_type == OP_PADANY) {
2386 SV **svp = AvARRAY(comppad_name);
2387 SV *sv = svp[curop->op_targ];
2388 if (SvCUR(sv) == generation)
2390 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2392 else if (curop->op_type == OP_RV2CV)
2394 else if (curop->op_type == OP_RV2SV ||
2395 curop->op_type == OP_RV2AV ||
2396 curop->op_type == OP_RV2HV ||
2397 curop->op_type == OP_RV2GV) {
2398 if (lastop->op_type != OP_GV) /* funny deref? */
2407 op->op_private = OPpASSIGN_COMMON;
2409 if (right && right->op_type == OP_SPLIT) {
2411 if ((tmpop = ((LISTOP*)right)->op_first) &&
2412 tmpop->op_type == OP_PUSHRE)
2414 PMOP *pm = (PMOP*)tmpop;
2415 if (left->op_type == OP_RV2AV &&
2416 !(left->op_private & OPpLVAL_INTRO) &&
2417 !(op->op_private & OPpASSIGN_COMMON) )
2419 tmpop = ((UNOP*)left)->op_first;
2420 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2421 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2422 pm->op_pmflags |= PMf_ONCE;
2423 tmpop = ((UNOP*)op)->op_first; /* to list (nulled) */
2424 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2425 tmpop->op_sibling = Nullop; /* don't free split */
2426 right->op_next = tmpop->op_next; /* fix starting loc */
2427 op_free(op); /* blow off assign */
2428 right->op_flags &= ~OPf_WANT;
2429 /* "I don't know and I don't care." */
2434 if (modcount < 10000 &&
2435 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2437 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2439 sv_setiv(sv, modcount+1);
2447 right = newOP(OP_UNDEF, 0);
2448 if (right->op_type == OP_READLINE) {
2449 right->op_flags |= OPf_STACKED;
2450 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2453 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2454 op = newBINOP(OP_SASSIGN, flags,
2455 scalar(right), mod(scalar(left), OP_SASSIGN) );
2467 newSTATEOP(flags, label, op)
2472 U32 seq = intro_my();
2475 Newz(1101, cop, 1, COP);
2476 if (perldb && curcop->cop_line && curstash != debstash) {
2477 cop->op_type = OP_DBSTATE;
2478 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2481 cop->op_type = OP_NEXTSTATE;
2482 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2484 cop->op_flags = flags;
2485 cop->op_private = 0 | (flags >> 8);
2487 cop->op_private |= NATIVE_HINTS;
2489 cop->op_next = (OP*)cop;
2492 cop->cop_label = label;
2493 hints |= HINT_BLOCK_SCOPE;
2496 cop->cop_arybase = curcop->cop_arybase;
2498 if (copline == NOLINE)
2499 cop->cop_line = curcop->cop_line;
2501 cop->cop_line = copline;
2504 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2505 cop->cop_stash = curstash;
2507 if (perldb && curstash != debstash) {
2508 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2509 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2510 (void)SvIOK_on(*svp);
2512 SvSTASH(*svp) = (HV*)cop;
2516 return prepend_elem(OP_LINESEQ, (OP*)cop, op);
2519 /* "Introduce" my variables to visible status. */
2527 if (! min_intro_pending)
2530 svp = AvARRAY(comppad_name);
2531 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2532 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2533 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2534 SvNVX(sv) = (double)cop_seqmax;
2537 min_intro_pending = 0;
2538 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2539 return cop_seqmax++;
2543 newLOGOP(type, flags, first, other)
2552 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2553 return newBINOP(type, flags, scalar(first), scalar(other));
2555 scalarboolean(first);
2556 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2557 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2558 if (type == OP_AND || type == OP_OR) {
2564 first = cUNOP->op_first;
2566 first->op_next = op->op_next;
2567 cUNOP->op_first = Nullop;
2571 if (first->op_type == OP_CONST) {
2572 if (dowarn && (first->op_private & OPpCONST_BARE))
2573 warn("Probable precedence problem on %s", op_desc[type]);
2574 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2583 else if (first->op_type == OP_WANTARRAY) {
2589 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2590 OP *k1 = ((UNOP*)first)->op_first;
2591 OP *k2 = k1->op_sibling;
2593 switch (first->op_type)
2596 if (k2 && k2->op_type == OP_READLINE
2597 && (k2->op_flags & OPf_STACKED)
2598 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2599 warnop = k2->op_type;
2603 if (k1->op_type == OP_READDIR
2604 || k1->op_type == OP_GLOB
2605 || k1->op_type == OP_EACH)
2606 warnop = k1->op_type;
2610 line_t oldline = curcop->cop_line;
2611 curcop->cop_line = copline;
2612 warn("Value of %s%s can be \"0\"; test with defined()",
2614 ((warnop == OP_READLINE || warnop == OP_GLOB)
2615 ? " construct" : "() operator"));
2616 curcop->cop_line = oldline;
2623 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2624 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2626 Newz(1101, logop, 1, LOGOP);
2628 logop->op_type = type;
2629 logop->op_ppaddr = ppaddr[type];
2630 logop->op_first = first;
2631 logop->op_flags = flags | OPf_KIDS;
2632 logop->op_other = LINKLIST(other);
2633 logop->op_private = 1 | (flags >> 8);
2635 /* establish postfix order */
2636 logop->op_next = LINKLIST(first);
2637 first->op_next = (OP*)logop;
2638 first->op_sibling = other;
2640 op = newUNOP(OP_NULL, 0, (OP*)logop);
2641 other->op_next = op;
2647 newCONDOP(flags, first, trueop, falseop)
2657 return newLOGOP(OP_AND, 0, first, trueop);
2659 return newLOGOP(OP_OR, 0, first, falseop);
2661 scalarboolean(first);
2662 if (first->op_type == OP_CONST) {
2663 if (SvTRUE(((SVOP*)first)->op_sv)) {
2674 else if (first->op_type == OP_WANTARRAY) {
2678 Newz(1101, condop, 1, CONDOP);
2680 condop->op_type = OP_COND_EXPR;
2681 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2682 condop->op_first = first;
2683 condop->op_flags = flags | OPf_KIDS;
2684 condop->op_true = LINKLIST(trueop);
2685 condop->op_false = LINKLIST(falseop);
2686 condop->op_private = 1 | (flags >> 8);
2688 /* establish postfix order */
2689 condop->op_next = LINKLIST(first);
2690 first->op_next = (OP*)condop;
2692 first->op_sibling = trueop;
2693 trueop->op_sibling = falseop;
2694 op = newUNOP(OP_NULL, 0, (OP*)condop);
2696 trueop->op_next = op;
2697 falseop->op_next = op;
2703 newRANGE(flags, left, right)
2713 Newz(1101, condop, 1, CONDOP);
2715 condop->op_type = OP_RANGE;
2716 condop->op_ppaddr = ppaddr[OP_RANGE];
2717 condop->op_first = left;
2718 condop->op_flags = OPf_KIDS;
2719 condop->op_true = LINKLIST(left);
2720 condop->op_false = LINKLIST(right);
2721 condop->op_private = 1 | (flags >> 8);
2723 left->op_sibling = right;
2725 condop->op_next = (OP*)condop;
2726 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2727 flop = newUNOP(OP_FLOP, 0, flip);
2728 op = newUNOP(OP_NULL, 0, flop);
2731 left->op_next = flip;
2732 right->op_next = flop;
2734 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2735 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2736 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2737 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2739 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2740 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2743 if (!flip->op_private || !flop->op_private)
2744 linklist(op); /* blow off optimizer unless constant */
2750 newLOOPOP(flags, debuggable, expr, block)
2758 int once = block && block->op_flags & OPf_SPECIAL &&
2759 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2762 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2763 return block; /* do {} while 0 does once */
2764 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB) {
2765 expr = newUNOP(OP_DEFINED, 0,
2766 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2770 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2771 op = newLOGOP(OP_AND, 0, expr, listop);
2773 ((LISTOP*)listop)->op_last->op_next = LINKLIST(op);
2775 if (once && op != listop)
2776 op->op_next = ((LOGOP*)cUNOP->op_first)->op_other;
2779 op = newUNOP(OP_NULL, 0, op); /* or do {} while 1 loses outer block */
2781 op->op_flags |= flags;
2783 op->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2788 newWHILEOP(flags, debuggable, loop, expr, block, cont)
2802 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB)) {
2803 expr = newUNOP(OP_DEFINED, 0,
2804 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2808 block = newOP(OP_NULL, 0);
2811 next = LINKLIST(cont);
2813 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2815 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2816 redo = LINKLIST(listop);
2819 op = newLOGOP(OP_AND, 0, expr, scalar(listop));
2820 if (op == expr && op->op_type == OP_CONST && !SvTRUE(cSVOP->op_sv)) {
2821 op_free(expr); /* oops, it's a while (0) */
2823 return Nullop; /* (listop already freed by newLOGOP) */
2825 ((LISTOP*)listop)->op_last->op_next = condop =
2826 (op == listop ? redo : LINKLIST(op));
2834 Newz(1101,loop,1,LOOP);
2835 loop->op_type = OP_ENTERLOOP;
2836 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2837 loop->op_private = 0;
2838 loop->op_next = (OP*)loop;
2841 op = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, op);
2843 loop->op_redoop = redo;
2844 loop->op_lastop = op;
2847 loop->op_nextop = next;
2849 loop->op_nextop = op;
2851 op->op_flags |= flags;
2852 op->op_private |= (flags >> 8);
2857 #ifndef CAN_PROTOTYPE
2858 newFOROP(flags,label,forline,sv,expr,block,cont)
2867 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2868 #endif /* CAN_PROTOTYPE */
2876 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2877 sv->op_type = OP_RV2GV;
2878 sv->op_ppaddr = ppaddr[OP_RV2GV];
2880 else if (sv->op_type == OP_PADSV) { /* private variable */
2881 padoff = sv->op_targ;
2886 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2889 sv = newGVOP(OP_GV, 0, defgv);
2891 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2892 expr = scalar(ref(expr, OP_ITER));
2893 iterflags |= OPf_STACKED;
2895 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2896 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2898 assert(!loop->op_next);
2899 Renew(loop, 1, LOOP);
2900 loop->op_targ = padoff;
2901 return newSTATEOP(0, label, newWHILEOP(flags, 1, loop,
2902 newOP(OP_ITER, 0), block, cont));
2906 newLOOPEX(type, label)
2911 if (type != OP_GOTO || label->op_type == OP_CONST) {
2912 op = newPVOP(type, 0, savepv(
2913 label->op_type == OP_CONST
2914 ? SvPVx(((SVOP*)label)->op_sv, na)
2919 if (label->op_type == OP_ENTERSUB)
2920 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2921 op = newUNOP(type, OPf_STACKED, label);
2923 hints |= HINT_BLOCK_SCOPE;
2931 if (!CvXSUB(cv) && CvROOT(cv)) {
2933 croak("Can't undef active subroutine");
2940 op_free(CvROOT(cv));
2941 CvROOT(cv) = Nullop;
2944 SvPOK_off((SV*)cv); /* forget prototype */
2946 SvREFCNT_dec(CvGV(cv));
2948 SvREFCNT_dec(CvOUTSIDE(cv));
2949 CvOUTSIDE(cv) = Nullcv;
2950 if (CvPADLIST(cv)) {
2951 /* may be during global destruction */
2952 if (SvREFCNT(CvPADLIST(cv))) {
2953 I32 i = AvFILL(CvPADLIST(cv));
2955 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
2956 SV* sv = svp ? *svp : Nullsv;
2959 if (sv == (SV*)comppad_name)
2960 comppad_name = Nullav;
2961 else if (sv == (SV*)comppad) {
2963 curpad = Null(SV**);
2967 SvREFCNT_dec((SV*)CvPADLIST(cv));
2969 CvPADLIST(cv) = Nullav;
2973 #ifdef DEBUG_CLOSURES
2978 CV *outside = CvOUTSIDE(cv);
2979 AV* padlist = CvPADLIST(cv);
2986 PerlIO_printf(Perl_debug_log, "\tCV=0x%p (%s), OUTSIDE=0x%p (%s)\n",
2988 (CvANON(cv) ? "ANON"
2989 : (cv == main_cv) ? "MAIN"
2990 : CvUNIQUE(outside) ? "UNIQUE"
2991 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
2994 : CvANON(outside) ? "ANON"
2995 : (outside == main_cv) ? "MAIN"
2996 : CvUNIQUE(outside) ? "UNIQUE"
2997 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3002 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3003 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3004 pname = AvARRAY(pad_name);
3005 ppad = AvARRAY(pad);
3007 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
3008 if (SvPOK(pname[ix]))
3009 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%p (%s\"%s\" %ld-%ld)\n",
3011 SvFAKE(pname[ix]) ? "FAKE " : "",
3013 (long)I_32(SvNVX(pname[ix])),
3014 (long)SvIVX(pname[ix]));
3017 #endif /* DEBUG_CLOSURES */
3020 cv_clone2(proto, outside)
3026 AV* protopadlist = CvPADLIST(proto);
3027 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3028 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3029 SV** pname = AvARRAY(protopad_name);
3030 SV** ppad = AvARRAY(protopad);
3031 I32 fname = AvFILL(protopad_name);
3032 I32 fpad = AvFILL(protopad);
3036 assert(!CvUNIQUE(proto));
3041 SAVESPTR(comppad_name);
3044 cv = compcv = (CV*)NEWSV(1104,0);
3045 sv_upgrade((SV *)cv, SvTYPE(proto));
3050 CvFILEGV(cv) = CvFILEGV(proto);
3051 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3052 CvSTASH(cv) = CvSTASH(proto);
3053 CvROOT(cv) = CvROOT(proto);
3054 CvSTART(cv) = CvSTART(proto);
3056 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3059 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3061 comppad_name = newAV();
3062 for (ix = fname; ix >= 0; ix--)
3063 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3067 comppadlist = newAV();
3068 AvREAL_off(comppadlist);
3069 av_store(comppadlist, 0, (SV*)comppad_name);
3070 av_store(comppadlist, 1, (SV*)comppad);
3071 CvPADLIST(cv) = comppadlist;
3072 av_fill(comppad, AvFILL(protopad));
3073 curpad = AvARRAY(comppad);
3075 av = newAV(); /* will be @_ */
3077 av_store(comppad, 0, (SV*)av);
3078 AvFLAGS(av) = AVf_REIFY;
3080 for (ix = fpad; ix > 0; ix--) {
3081 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3082 if (namesv && namesv != &sv_undef) {
3083 char *name = SvPVX(namesv); /* XXX */
3084 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3085 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3086 CvOUTSIDE(cv), cxstack_ix);
3088 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3090 croak("panic: cv_clone: %s", name);
3092 else { /* our own lexical */
3095 /* anon code -- we'll come back for it */
3096 sv = SvREFCNT_inc(ppad[ix]);
3098 else if (*name == '@')
3100 else if (*name == '%')
3110 SV* sv = NEWSV(0,0);
3116 /* Now that vars are all in place, clone nested closures. */
3118 for (ix = fpad; ix > 0; ix--) {
3119 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3121 && namesv != &sv_undef
3122 && !(SvFLAGS(namesv) & SVf_FAKE)
3123 && *SvPVX(namesv) == '&'
3124 && CvCLONE(ppad[ix]))
3126 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3127 SvREFCNT_dec(ppad[ix]);
3130 curpad[ix] = (SV*)kid;
3134 #ifdef DEBUG_CLOSURES
3135 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3137 PerlIO_printf(Perl_debug_log, " from:\n");
3139 PerlIO_printf(Perl_debug_log, " to:\n");
3151 return cv_clone2(proto, CvOUTSIDE(proto));
3155 cv_ckproto(cv, gv, p)
3160 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3161 SV* msg = sv_newmortal();
3165 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3166 sv_setpv(msg, "Prototype mismatch:");
3168 sv_catpvf(msg, " sub %_", name);
3170 sv_catpvf(msg, " (%s)", SvPVX(cv));
3171 sv_catpv(msg, " vs ");
3173 sv_catpvf(msg, "(%s)", p);
3175 sv_catpv(msg, "none");
3187 if (!cv || !SvPOK(cv) || SvCUR(cv))
3191 for (o = CvSTART(cv); o; o = o->op_next) {
3192 OPCODE type = o->op_type;
3194 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3196 if (type == OP_LEAVESUB || type == OP_RETURN)
3200 if (type == OP_CONST)
3201 sv = ((SVOP*)o)->op_sv;
3202 else if (type == OP_PADSV) {
3203 AV* pad = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3204 sv = pad ? AvARRAY(pad)[o->op_targ] : Nullsv;
3205 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3217 newSUB(floor,op,proto,block)
3223 char *name = op ? SvPVx(cSVOP->op_sv, na) : Nullch;
3224 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3225 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3234 if (!name || GvCVGEN(gv))
3236 else if (cv = GvCV(gv)) {
3237 cv_ckproto(cv, gv, ps);
3238 /* already defined (or promised)? */
3239 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3242 /* just a "sub foo;" when &foo is already defined */
3246 /* ahem, death to those who redefine active sort subs */
3247 if (curstack == sortstack && sortcop == CvSTART(cv))
3248 croak("Can't redefine active sort subroutine %s", name);
3249 const_sv = cv_const_sv(cv);
3250 if (const_sv || dowarn) {
3251 line_t oldline = curcop->cop_line;
3252 curcop->cop_line = copline;
3253 warn(const_sv ? "Constant subroutine %s redefined"
3254 : "Subroutine %s redefined", name);
3255 curcop->cop_line = oldline;
3261 if (cv) { /* must reuse cv if autoloaded */
3263 CvFLAGS(cv) = CvFLAGS(compcv);
3264 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3265 CvOUTSIDE(compcv) = 0;
3266 CvPADLIST(cv) = CvPADLIST(compcv);
3267 CvPADLIST(compcv) = 0;
3268 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3269 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3270 SvREFCNT_dec(compcv);
3280 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3281 CvFILEGV(cv) = curcop->cop_filegv;
3282 CvSTASH(cv) = curstash;
3285 sv_setpv((SV*)cv, ps);
3291 char *s = strrchr(name, ':');
3293 if (strEQ(s, "BEGIN")) {
3295 "BEGIN not safe after errors--compilation aborted";
3299 /* force display of errors found but not reported */
3300 sv_catpv(GvSV(errgv), not_safe);
3301 croak("%s", SvPVx(GvSV(errgv), na));
3312 if (AvFILL(comppad_name) < AvFILL(comppad))
3313 av_store(comppad_name, AvFILL(comppad), Nullsv);
3316 SV **namep = AvARRAY(comppad_name);
3317 for (ix = AvFILL(comppad); ix > 0; ix--) {
3320 if (SvIMMORTAL(curpad[ix]))
3323 * The only things that a clonable function needs in its
3324 * pad are references to outer lexicals and anonymous subs.
3325 * The rest are created anew during cloning.
3327 if (!((namesv = namep[ix]) != Nullsv &&
3328 namesv != &sv_undef &&
3330 *SvPVX(namesv) == '&')))
3332 SvREFCNT_dec(curpad[ix]);
3333 curpad[ix] = Nullsv;
3338 AV *av = newAV(); /* Will be @_ */
3340 av_store(comppad, 0, (SV*)av);
3341 AvFLAGS(av) = AVf_REIFY;
3343 for (ix = AvFILL(comppad); ix > 0; ix--) {
3344 if (SvIMMORTAL(curpad[ix]))
3346 if (!SvPADMY(curpad[ix]))
3347 SvPADTMP_on(curpad[ix]);
3351 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3352 CvSTART(cv) = LINKLIST(CvROOT(cv));
3353 CvROOT(cv)->op_next = 0;
3359 if (perldb && curstash != debstash) {
3360 SV *sv = NEWSV(0,0);
3361 SV *tmpstr = sv_newmortal();
3362 static GV *db_postponed;
3366 sv_setpvf(sv, "%_:%ld-%ld",
3367 GvSV(curcop->cop_filegv),
3368 (long)subline, (long)curcop->cop_line);
3369 gv_efullname3(tmpstr, gv, Nullch);
3370 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3371 if (!db_postponed) {
3372 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3374 hv = GvHVn(db_postponed);
3375 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3376 && (cv = GvCV(db_postponed))) {
3381 perl_call_sv((SV*)cv, G_DISCARD);
3385 if ((s = strrchr(name,':')))
3389 if (strEQ(s, "BEGIN")) {
3390 I32 oldscope = scopestack_ix;
3392 SAVESPTR(compiling.cop_filegv);
3393 SAVEI16(compiling.cop_line);
3400 DEBUG_x( dump_sub(gv) );
3401 av_push(beginav, (SV *)cv);
3403 call_list(oldscope, beginav);
3405 curcop = &compiling;
3408 else if (strEQ(s, "END") && !error_count) {
3411 av_unshift(endav, 1);
3412 av_store(endav, 0, (SV *)cv);
3425 newXSUB(name, ix, subaddr, filename)
3431 CV* cv = newXS(name, (void(*)())subaddr, filename);
3433 CvXSUBANY(cv).any_i32 = ix;
3439 newXS(name, subaddr, filename)
3441 void (*subaddr) _((CV*));
3444 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3447 if (cv = (name ? GvCV(gv) : Nullcv)) {
3449 /* just a cached method */
3453 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3454 /* already defined (or promised) */
3456 line_t oldline = curcop->cop_line;
3457 curcop->cop_line = copline;
3458 warn("Subroutine %s redefined",name);
3459 curcop->cop_line = oldline;
3466 if (cv) /* must reuse cv if autoloaded */
3469 cv = (CV*)NEWSV(1105,0);
3470 sv_upgrade((SV *)cv, SVt_PVCV);
3477 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3478 CvFILEGV(cv) = gv_fetchfile(filename);
3479 CvXSUB(cv) = subaddr;
3482 char *s = strrchr(name,':');
3487 if (strEQ(s, "BEGIN")) {
3490 av_push(beginav, (SV *)cv);
3493 else if (strEQ(s, "END")) {
3496 av_unshift(endav, 1);
3497 av_store(endav, 0, (SV *)cv);
3508 newFORM(floor,op,block)
3519 name = SvPVx(cSVOP->op_sv, na);
3522 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3524 if (cv = GvFORM(gv)) {
3526 line_t oldline = curcop->cop_line;
3528 curcop->cop_line = copline;
3529 warn("Format %s redefined",name);
3530 curcop->cop_line = oldline;
3536 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3537 CvFILEGV(cv) = curcop->cop_filegv;
3539 for (ix = AvFILL(comppad); ix > 0; ix--) {
3540 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3541 SvPADTMP_on(curpad[ix]);
3544 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3545 CvSTART(cv) = LINKLIST(CvROOT(cv));
3546 CvROOT(cv)->op_next = 0;
3557 return newUNOP(OP_REFGEN, 0,
3558 mod(list(convert(OP_ANONLIST, 0, op)), OP_REFGEN));
3565 return newUNOP(OP_REFGEN, 0,
3566 mod(list(convert(OP_ANONHASH, 0, op)), OP_REFGEN));
3570 newANONSUB(floor, proto, block)
3575 return newUNOP(OP_REFGEN, 0,
3576 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3583 switch (o->op_type) {
3585 o->op_type = OP_PADAV;
3586 o->op_ppaddr = ppaddr[OP_PADAV];
3587 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3590 o->op_type = OP_RV2AV;
3591 o->op_ppaddr = ppaddr[OP_RV2AV];
3596 warn("oops: oopsAV");
3606 switch (o->op_type) {
3609 o->op_type = OP_PADHV;
3610 o->op_ppaddr = ppaddr[OP_PADHV];
3611 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3615 o->op_type = OP_RV2HV;
3616 o->op_ppaddr = ppaddr[OP_RV2HV];
3621 warn("oops: oopsHV");
3631 if (o->op_type == OP_PADANY) {
3632 o->op_type = OP_PADAV;
3633 o->op_ppaddr = ppaddr[OP_PADAV];
3636 return newUNOP(OP_RV2AV, 0, scalar(o));
3644 if (type == OP_MAPSTART)
3645 return newUNOP(OP_NULL, 0, o);
3646 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3653 if (o->op_type == OP_PADANY) {
3654 o->op_type = OP_PADHV;
3655 o->op_ppaddr = ppaddr[OP_PADHV];
3658 return newUNOP(OP_RV2HV, 0, scalar(o));
3665 croak("NOT IMPL LINE %d",__LINE__);
3675 return newUNOP(OP_RV2CV, flags, scalar(o));
3682 if (o->op_type == OP_PADANY) {
3683 o->op_type = OP_PADSV;
3684 o->op_ppaddr = ppaddr[OP_PADSV];
3687 return newUNOP(OP_RV2SV, 0, scalar(o));
3690 /* Check routines. */
3699 name = NEWSV(1106,0);
3700 sv_upgrade(name, SVt_PVNV);
3701 sv_setpvn(name, "&", 1);
3704 ix = pad_alloc(op->op_type, SVs_PADMY);
3705 av_store(comppad_name, ix, name);
3706 av_store(comppad, ix, cSVOP->op_sv);
3707 SvPADMY_on(cSVOP->op_sv);
3708 cSVOP->op_sv = Nullsv;
3709 cSVOP->op_targ = ix;
3717 op->op_private = hints;
3725 if (cUNOP->op_first->op_type == OP_CONCAT)
3726 op->op_flags |= OPf_STACKED;
3734 if (op->op_flags & OPf_KIDS) {
3737 OPCODE type = op->op_type;
3738 op = modkids(ck_fun(op), type);
3739 kid = cUNOP->op_first;
3740 newop = kUNOP->op_first->op_sibling;
3742 (newop->op_sibling ||
3743 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3744 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3745 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3749 op_free(kUNOP->op_first);
3750 kUNOP->op_first = newop;
3752 op->op_ppaddr = ppaddr[++op->op_type];
3762 if (op->op_flags & OPf_KIDS) {
3763 OP *kid = cUNOP->op_first;
3764 if (kid->op_type == OP_HSLICE)
3765 op->op_private |= OPpSLICE;
3766 else if (kid->op_type != OP_HELEM)
3767 croak("%s argument is not a HASH element or slice",
3768 op_desc[op->op_type]);
3778 I32 type = op->op_type;
3780 if (op->op_flags & OPf_KIDS) {
3781 if (cLISTOP->op_first->op_type == OP_STUB) {
3783 op = newUNOP(type, OPf_SPECIAL,
3784 newGVOP(OP_GV, 0, gv_fetchpv("main'ARGV", TRUE, SVt_PVAV)));
3795 hints |= HINT_BLOCK_SCOPE;
3796 if (op->op_flags & OPf_KIDS) {
3797 SVOP *kid = (SVOP*)cUNOP->op_first;
3800 op->op_flags &= ~OPf_KIDS;
3803 else if (kid->op_type == OP_LINESEQ) {
3806 kid->op_next = op->op_next;
3807 cUNOP->op_first = 0;
3810 Newz(1101, enter, 1, LOGOP);
3811 enter->op_type = OP_ENTERTRY;
3812 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3813 enter->op_private = 0;
3815 /* establish postfix order */
3816 enter->op_next = (OP*)enter;
3818 op = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3819 op->op_type = OP_LEAVETRY;
3820 op->op_ppaddr = ppaddr[OP_LEAVETRY];
3821 enter->op_other = op;
3827 op = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3829 op->op_targ = (PADOFFSET)hints;
3838 if (op->op_flags & OPf_STACKED) {
3840 kid = cUNOP->op_first->op_sibling;
3841 if (kid->op_type == OP_RV2GV)
3854 if (op->op_flags & OPf_KIDS) {
3855 OP *kid = cUNOP->op_first;
3856 if (kid->op_type != OP_HELEM)
3857 croak("%s argument is not a HASH element", op_desc[op->op_type]);
3867 o = fold_constants(o);
3868 if (o->op_type == OP_CONST)
3877 SVOP *kid = (SVOP*)cUNOP->op_first;
3879 op->op_private |= (hints & HINT_STRICT_REFS);
3880 if (kid->op_type == OP_CONST) {
3885 name = SvPV(kid->op_sv, na);
3886 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3887 char *badthing = Nullch;
3888 switch (op->op_type) {
3890 badthing = "a SCALAR";
3893 badthing = "an ARRAY";
3896 badthing = "a HASH";
3901 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3904 kid->op_type = OP_GV;
3905 iscv = (op->op_type == OP_RV2CV) * 2;
3906 for (gv = 0; !gv; iscv++) {
3908 * This is a little tricky. We only want to add the symbol if we
3909 * didn't add it in the lexer. Otherwise we get duplicate strict
3910 * warnings. But if we didn't add it in the lexer, we must at
3911 * least pretend like we wanted to add it even if it existed before,
3912 * or we get possible typo warnings. OPpCONST_ENTERED says
3913 * whether the lexer already added THIS instance of this symbol.
3915 gv = gv_fetchpv(name,
3916 iscv | !(kid->op_private & OPpCONST_ENTERED),
3919 : op->op_type == OP_RV2SV
3921 : op->op_type == OP_RV2AV
3923 : op->op_type == OP_RV2HV
3927 SvREFCNT_dec(kid->op_sv);
3928 kid->op_sv = SvREFCNT_inc(gv);
3937 I32 type = op->op_type;
3939 if (op->op_flags & OPf_REF)
3942 if (op->op_flags & OPf_KIDS) {
3943 SVOP *kid = (SVOP*)cUNOP->op_first;
3945 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3946 OP *newop = newGVOP(type, OPf_REF,
3947 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
3954 if (type == OP_FTTTY)
3955 return newGVOP(type, OPf_REF, gv_fetchpv("main'STDIN", TRUE,
3958 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3971 int type = op->op_type;
3972 register I32 oa = opargs[type] >> OASHIFT;
3974 if (op->op_flags & OPf_STACKED) {
3975 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
3978 return no_fh_allowed(op);
3981 if (op->op_flags & OPf_KIDS) {
3982 tokid = &cLISTOP->op_first;
3983 kid = cLISTOP->op_first;
3984 if (kid->op_type == OP_PUSHMARK ||
3985 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
3987 tokid = &kid->op_sibling;
3988 kid = kid->op_sibling;
3990 if (!kid && opargs[type] & OA_DEFGV)
3991 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
3995 sibl = kid->op_sibling;
4009 if (kid->op_type == OP_CONST &&
4010 (kid->op_private & OPpCONST_BARE)) {
4011 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4012 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4013 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4015 warn("Array @%s missing the @ in argument %ld of %s()",
4016 name, (long)numargs, op_desc[type]);
4019 kid->op_sibling = sibl;
4022 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4023 bad_type(numargs, "array", op_desc[op->op_type], kid);
4027 if (kid->op_type == OP_CONST &&
4028 (kid->op_private & OPpCONST_BARE)) {
4029 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4030 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4031 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4033 warn("Hash %%%s missing the %% in argument %ld of %s()",
4034 name, (long)numargs, op_desc[type]);
4037 kid->op_sibling = sibl;
4040 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4041 bad_type(numargs, "hash", op_desc[op->op_type], kid);
4046 OP *newop = newUNOP(OP_NULL, 0, kid);
4047 kid->op_sibling = 0;
4049 newop->op_next = newop;
4051 kid->op_sibling = sibl;
4056 if (kid->op_type != OP_GV) {
4057 if (kid->op_type == OP_CONST &&
4058 (kid->op_private & OPpCONST_BARE)) {
4059 OP *newop = newGVOP(OP_GV, 0,
4060 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4066 kid->op_sibling = 0;
4067 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4069 kid->op_sibling = sibl;
4075 mod(scalar(kid), type);
4079 tokid = &kid->op_sibling;
4080 kid = kid->op_sibling;
4082 op->op_private |= numargs;
4084 return too_many_arguments(op,op_desc[op->op_type]);
4087 else if (opargs[type] & OA_DEFGV) {
4089 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4093 while (oa & OA_OPTIONAL)
4095 if (oa && oa != OA_LIST)
4096 return too_few_arguments(op,op_desc[op->op_type]);
4105 GV *gv = gv_fetchpv("glob", FALSE, SVt_PVCV);
4107 if (gv && GvIMPORTED_CV(gv)) {
4108 static int glob_index;
4110 append_elem(OP_GLOB, op,
4111 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4112 op->op_type = OP_LIST;
4113 op->op_ppaddr = ppaddr[OP_LIST];
4114 ((LISTOP*)op)->op_first->op_type = OP_PUSHMARK;
4115 ((LISTOP*)op)->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4116 op = newUNOP(OP_ENTERSUB, OPf_STACKED,
4117 append_elem(OP_LIST, op,
4118 scalar(newUNOP(OP_RV2CV, 0,
4119 newGVOP(OP_GV, 0, gv)))));
4122 if ((op->op_flags & OPf_KIDS) && !cLISTOP->op_first->op_sibling)
4123 append_elem(OP_GLOB, op, newSVREF(newGVOP(OP_GV, 0, defgv)));
4124 gv = newGVgen("main");
4126 append_elem(OP_GLOB, op, newGVOP(OP_GV, 0, gv));
4137 OPCODE type = op->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4139 op->op_ppaddr = ppaddr[OP_GREPSTART];
4140 Newz(1101, gwop, 1, LOGOP);
4142 if (op->op_flags & OPf_STACKED) {
4145 kid = cLISTOP->op_first->op_sibling;
4146 for (k = cLISTOP->op_first->op_sibling->op_next; k; k = k->op_next) {
4149 kid->op_next = (OP*)gwop;
4150 op->op_flags &= ~OPf_STACKED;
4152 kid = cLISTOP->op_first->op_sibling;
4153 if (type == OP_MAPWHILE)
4160 kid = cLISTOP->op_first->op_sibling;
4161 if (kid->op_type != OP_NULL)
4162 croak("panic: ck_grep");
4163 kid = kUNOP->op_first;
4165 gwop->op_type = type;
4166 gwop->op_ppaddr = ppaddr[type];
4167 gwop->op_first = listkids(op);
4168 gwop->op_flags |= OPf_KIDS;
4169 gwop->op_private = 1;
4170 gwop->op_other = LINKLIST(kid);
4171 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4172 kid->op_next = (OP*)gwop;
4174 kid = cLISTOP->op_first->op_sibling;
4175 if (!kid || !kid->op_sibling)
4176 return too_few_arguments(op,op_desc[op->op_type]);
4177 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4178 mod(kid, OP_GREPSTART);
4187 if (op->op_flags & OPf_KIDS) {
4188 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4189 if (kid && kid->op_type == OP_CONST)
4190 fbm_compile(((SVOP*)kid)->op_sv);
4199 /* XXX length optimization goes here */
4207 OPCODE type = op->op_type;
4208 return modkids(ck_fun(op), type);
4215 OPCODE type = op->op_type;
4216 return refkids(ck_fun(op), type);
4225 kid = cLISTOP->op_first;
4227 op = force_list(op);
4228 kid = cLISTOP->op_first;
4230 if (kid->op_type == OP_PUSHMARK)
4231 kid = kid->op_sibling;
4232 if (kid && op->op_flags & OPf_STACKED)
4233 kid = kid->op_sibling;
4234 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4235 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4236 op->op_flags |= OPf_STACKED; /* make it a filehandle */
4237 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4238 cLISTOP->op_first->op_sibling = kid;
4239 cLISTOP->op_last = kid;
4240 kid = kid->op_sibling;
4245 append_elem(op->op_type, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4251 if (hints & HINT_LOCALE)
4252 op->op_private |= OPpLOCALE;
4266 if (hints & HINT_LOCALE)
4267 op->op_private |= OPpLOCALE;
4279 if (hints & HINT_LOCALE)
4280 op->op_private |= OPpLOCALE;
4290 op->op_private |= OPpRUNTIME;
4305 if (cBINOP->op_first->op_flags & OPf_PARENS) {
4306 op->op_private |= OPpREPEAT_DOLIST;
4307 cBINOP->op_first = force_list(cBINOP->op_first);
4318 if (op->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4319 SVOP *kid = (SVOP*)cUNOP->op_first;
4321 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4323 for (s = SvPVX(kid->op_sv); *s; s++) {
4324 if (*s == ':' && s[1] == ':') {
4326 Move(s+2, s+1, strlen(s+2)+1, char);
4327 --SvCUR(kid->op_sv);
4330 sv_catpvn(kid->op_sv, ".pm", 3);
4340 croak("NOT IMPL LINE %d",__LINE__);
4350 if (op->op_flags & OPf_KIDS) {
4351 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4352 if (kid && kid->op_sibling) {
4353 op->op_type = OP_SSELECT;
4354 op->op_ppaddr = ppaddr[OP_SSELECT];
4356 return fold_constants(op);
4360 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4361 if (kid && kid->op_type == OP_RV2GV)
4362 kid->op_private &= ~HINT_STRICT_REFS;
4370 I32 type = op->op_type;
4372 if (!(op->op_flags & OPf_KIDS)) {
4374 return newUNOP(type, 0,
4375 scalar(newUNOP(OP_RV2AV, 0,
4376 scalar(newGVOP(OP_GV, 0, subline
4378 : gv_fetchpv("ARGV", TRUE, SVt_PVAV) )))));
4380 return scalar(modkids(ck_fun(op), type));
4389 if (hints & HINT_LOCALE)
4390 op->op_private |= OPpLOCALE;
4393 if (op->op_flags & OPf_STACKED) {
4394 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4396 kid = kUNOP->op_first; /* get past rv2gv */
4398 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4400 if (kid->op_type == OP_SCOPE) {
4404 else if (kid->op_type == OP_LEAVE) {
4405 if (op->op_type == OP_SORT) {
4406 null(kid); /* wipe out leave */
4409 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4410 if (k->op_next == kid)
4415 kid->op_next = 0; /* just disconnect the leave */
4416 k = kLISTOP->op_first;
4420 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4421 null(kid); /* wipe out rv2gv */
4422 if (op->op_type == OP_SORT)
4426 op->op_flags |= OPf_SPECIAL;
4440 if (op->op_flags & OPf_STACKED)
4441 return no_fh_allowed(op);
4443 kid = cLISTOP->op_first;
4444 if (kid->op_type != OP_NULL)
4445 croak("panic: ck_split");
4446 kid = kid->op_sibling;
4447 op_free(cLISTOP->op_first);
4448 cLISTOP->op_first = kid;
4450 cLISTOP->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4451 cLISTOP->op_last = kid; /* There was only one element previously */
4454 if (kid->op_type != OP_MATCH) {
4455 OP *sibl = kid->op_sibling;
4456 kid->op_sibling = 0;
4457 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4458 if (cLISTOP->op_first == cLISTOP->op_last)
4459 cLISTOP->op_last = kid;
4460 cLISTOP->op_first = kid;
4461 kid->op_sibling = sibl;
4464 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4465 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4469 kid->op_type = OP_PUSHRE;
4470 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4473 if (!kid->op_sibling)
4474 append_elem(OP_SPLIT, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4476 kid = kid->op_sibling;
4479 if (!kid->op_sibling)
4480 append_elem(OP_SPLIT, op, newSVOP(OP_CONST, 0, newSViv(0)));
4482 kid = kid->op_sibling;
4485 if (kid->op_sibling)
4486 return too_many_arguments(op,op_desc[op->op_type]);
4495 OP *prev = ((cUNOP->op_first->op_sibling)
4496 ? cUNOP : ((UNOP*)cUNOP->op_first))->op_first;
4497 OP *o = prev->op_sibling;
4505 for (cvop = o; cvop->op_sibling; cvop = cvop->op_sibling) ;
4506 if (cvop->op_type == OP_RV2CV) {
4508 op->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4509 null(cvop); /* disable rv2cv */
4510 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4511 if (tmpop->op_type == OP_GV) {
4512 cv = GvCVu(tmpop->op_sv);
4513 if (cv && SvPOK(cv) && !(op->op_private & OPpENTERSUB_AMPER)) {
4514 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4515 proto = SvPV((SV*)cv, na);
4519 op->op_private |= (hints & HINT_STRICT_REFS);
4520 if (perldb && curstash != debstash)
4521 op->op_private |= OPpENTERSUB_DB;
4526 return too_many_arguments(op, gv_ename(namegv));
4544 if (o->op_type != OP_REFGEN && o->op_type != OP_UNDEF)
4545 bad_type(arg, "block", gv_ename(namegv), o);
4550 if (o->op_type == OP_RV2GV)
4554 o = newUNOP(OP_RV2GV, 0, kid);
4555 o->op_sibling = kid->op_sibling;
4556 kid->op_sibling = 0;
4557 prev->op_sibling = o;
4565 if (o->op_type != OP_RV2GV)
4566 bad_type(arg, "symbol", gv_ename(namegv), o);
4569 if (o->op_type != OP_RV2CV)
4570 bad_type(arg, "sub", gv_ename(namegv), o);
4573 if (o->op_type != OP_RV2SV && o->op_type != OP_PADSV)
4574 bad_type(arg, "scalar", gv_ename(namegv), o);
4577 if (o->op_type != OP_RV2AV && o->op_type != OP_PADAV)
4578 bad_type(arg, "array", gv_ename(namegv), o);
4581 if (o->op_type != OP_RV2HV && o->op_type != OP_PADHV)
4582 bad_type(arg, "hash", gv_ename(namegv), o);
4586 o = newUNOP(OP_REFGEN, 0, kid);
4587 o->op_sibling = kid->op_sibling;
4588 kid->op_sibling = 0;
4589 prev->op_sibling = o;
4600 croak("Malformed prototype for %s: %s",
4601 gv_ename(namegv), SvPV((SV*)cv, na));
4606 mod(o, OP_ENTERSUB);
4610 if (proto && !optional && *proto == '$')
4611 return too_few_arguments(op, gv_ename(namegv));
4619 SvREADONLY_on(cSVOP->op_sv);
4627 if (op->op_flags & OPf_KIDS) {
4628 SVOP *kid = (SVOP*)cUNOP->op_first;
4630 if (kid->op_type == OP_NULL)
4631 kid = (SVOP*)kid->op_sibling;
4633 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4634 op->op_flags |= OPf_SPECIAL;
4639 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4645 register OP* oldop = 0;
4646 if (!o || o->op_seq)
4651 for (; o; o = o->op_next) {
4657 switch (o->op_type) {
4660 curcop = ((COP*)o); /* for warnings */
4661 o->op_seq = op_seqmax++;
4672 if (o->op_next->op_type == OP_STRINGIFY)
4674 o->op_seq = op_seqmax++;
4677 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4678 o->op_seq = op_seqmax++;
4679 break; /* Scalar stub must produce undef. List stub is noop */
4683 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4684 curcop = ((COP*)op);
4690 if (oldop && o->op_next) {
4691 oldop->op_next = o->op_next;
4694 o->op_seq = op_seqmax++;
4698 if (o->op_next->op_type == OP_RV2SV) {
4699 if (!(o->op_next->op_private & OPpDEREF)) {
4701 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4702 o->op_next = o->op_next->op_next;
4703 o->op_type = OP_GVSV;
4704 o->op_ppaddr = ppaddr[OP_GVSV];
4707 else if (o->op_next->op_type == OP_RV2AV) {
4708 OP* pop = o->op_next->op_next;
4710 if (pop->op_type == OP_CONST &&
4711 (op = pop->op_next) &&
4712 pop->op_next->op_type == OP_AELEM &&
4713 !(pop->op_next->op_private &
4714 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4715 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4719 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4723 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4724 o->op_next = pop->op_next->op_next;
4725 o->op_type = OP_AELEMFAST;
4726 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4727 o->op_private = (U8)i;
4728 GvAVn(((GVOP*)o)->op_gv);
4731 o->op_seq = op_seqmax++;
4738 o->op_seq = op_seqmax++;
4739 peep(cLOGOP->op_other);
4743 o->op_seq = op_seqmax++;
4744 peep(cCONDOP->op_true);
4745 peep(cCONDOP->op_false);
4749 o->op_seq = op_seqmax++;
4750 peep(cLOOP->op_redoop);
4751 peep(cLOOP->op_nextop);
4752 peep(cLOOP->op_lastop);
4757 o->op_seq = op_seqmax++;
4758 peep(cPMOP->op_pmreplstart);
4762 o->op_seq = op_seqmax++;
4763 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4764 if (o->op_next->op_sibling &&
4765 o->op_next->op_sibling->op_type != OP_DIE) {
4766 line_t oldline = curcop->cop_line;
4768 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4769 warn("Statement unlikely to be reached");
4770 warn("(Maybe you meant system() when you said exec()?)\n");
4771 curcop->cop_line = oldline;
4776 o->op_seq = op_seqmax++;