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 (dowarn && 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_NOOPT || 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))
1562 if (o->op_private & OPpLOCALE)
1567 goto nope; /* Don't try to run w/ errors */
1569 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1570 if (curop->op_type != OP_CONST &&
1571 curop->op_type != OP_LIST &&
1572 curop->op_type != OP_SCALAR &&
1573 curop->op_type != OP_NULL &&
1574 curop->op_type != OP_PUSHMARK) {
1579 curop = LINKLIST(o);
1584 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1585 pad_swipe(o->op_targ);
1586 else if (SvTEMP(sv)) { /* grab mortal temp? */
1587 (void)SvREFCNT_inc(sv);
1591 if (type == OP_RV2GV)
1592 return newGVOP(OP_GV, 0, (GV*)sv);
1594 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1596 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1601 SvIOK_off(sv); /* undo SvIV() damage */
1603 return newSVOP(OP_CONST, 0, sv);
1607 if (!(opargs[type] & OA_OTHERINT))
1610 if (!(hints & HINT_INTEGER)) {
1611 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1614 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1615 if (curop->op_type == OP_CONST) {
1616 if (SvIOK(((SVOP*)curop)->op_sv))
1620 if (opargs[curop->op_type] & OA_RETINTEGER)
1624 o->op_ppaddr = ppaddr[++(o->op_type)];
1631 gen_constant_list(o)
1635 I32 oldtmps_floor = tmps_floor;
1639 return o; /* Don't attempt to run with errors */
1641 op = curop = LINKLIST(o);
1647 tmps_floor = oldtmps_floor;
1649 o->op_type = OP_RV2AV;
1650 o->op_ppaddr = ppaddr[OP_RV2AV];
1651 curop = ((UNOP*)o)->op_first;
1652 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1659 convert(type, flags, op)
1667 if (!op || op->op_type != OP_LIST)
1668 op = newLISTOP(OP_LIST, 0, op, Nullop);
1670 op->op_flags &= ~OPf_WANT;
1672 if (!(opargs[type] & OA_MARK))
1673 null(cLISTOP->op_first);
1676 op->op_ppaddr = ppaddr[type];
1677 op->op_flags |= flags;
1679 op = CHECKOP(type, op);
1680 if (op->op_type != type)
1683 if (cLISTOP->op_children < 7) {
1684 /* XXX do we really need to do this if we're done appending?? */
1685 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1687 cLISTOP->op_last = last; /* in case check substituted last arg */
1690 return fold_constants(op);
1693 /* List constructors */
1696 append_elem(type, first, last)
1707 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1708 return newLISTOP(type, 0, first, last);
1710 if (first->op_flags & OPf_KIDS)
1711 ((LISTOP*)first)->op_last->op_sibling = last;
1713 first->op_flags |= OPf_KIDS;
1714 ((LISTOP*)first)->op_first = last;
1716 ((LISTOP*)first)->op_last = last;
1717 ((LISTOP*)first)->op_children++;
1722 append_list(type, first, last)
1733 if (first->op_type != type)
1734 return prepend_elem(type, (OP*)first, (OP*)last);
1736 if (last->op_type != type)
1737 return append_elem(type, (OP*)first, (OP*)last);
1739 first->op_last->op_sibling = last->op_first;
1740 first->op_last = last->op_last;
1741 first->op_children += last->op_children;
1742 if (first->op_children)
1743 last->op_flags |= OPf_KIDS;
1750 prepend_elem(type, first, last)
1761 if (last->op_type == type) {
1762 if (type == OP_LIST) { /* already a PUSHMARK there */
1763 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1764 ((LISTOP*)last)->op_first->op_sibling = first;
1767 if (!(last->op_flags & OPf_KIDS)) {
1768 ((LISTOP*)last)->op_last = first;
1769 last->op_flags |= OPf_KIDS;
1771 first->op_sibling = ((LISTOP*)last)->op_first;
1772 ((LISTOP*)last)->op_first = first;
1774 ((LISTOP*)last)->op_children++;
1778 return newLISTOP(type, 0, first, last);
1786 return newOP(OP_STUB, 0);
1793 if (!op || op->op_type != OP_LIST)
1794 op = newLISTOP(OP_LIST, 0, op, Nullop);
1800 newLISTOP(type, flags, first, last)
1808 Newz(1101, listop, 1, LISTOP);
1810 listop->op_type = type;
1811 listop->op_ppaddr = ppaddr[type];
1812 listop->op_children = (first != 0) + (last != 0);
1813 listop->op_flags = flags;
1817 else if (!first && last)
1820 first->op_sibling = last;
1821 listop->op_first = first;
1822 listop->op_last = last;
1823 if (type == OP_LIST) {
1825 pushop = newOP(OP_PUSHMARK, 0);
1826 pushop->op_sibling = first;
1827 listop->op_first = pushop;
1828 listop->op_flags |= OPf_KIDS;
1830 listop->op_last = pushop;
1832 else if (listop->op_children)
1833 listop->op_flags |= OPf_KIDS;
1844 Newz(1101, op, 1, OP);
1846 op->op_ppaddr = ppaddr[type];
1847 op->op_flags = flags;
1850 op->op_private = 0 + (flags >> 8);
1851 if (opargs[type] & OA_RETSCALAR)
1853 if (opargs[type] & OA_TARGET)
1854 op->op_targ = pad_alloc(type, SVs_PADTMP);
1855 return CHECKOP(type, op);
1859 newUNOP(type, flags, first)
1867 first = newOP(OP_STUB, 0);
1868 if (opargs[type] & OA_MARK)
1869 first = force_list(first);
1871 Newz(1101, unop, 1, UNOP);
1872 unop->op_type = type;
1873 unop->op_ppaddr = ppaddr[type];
1874 unop->op_first = first;
1875 unop->op_flags = flags | OPf_KIDS;
1876 unop->op_private = 1 | (flags >> 8);
1878 unop = (UNOP*) CHECKOP(type, unop);
1882 return fold_constants((OP *) unop);
1886 newBINOP(type, flags, first, last)
1893 Newz(1101, binop, 1, BINOP);
1896 first = newOP(OP_NULL, 0);
1898 binop->op_type = type;
1899 binop->op_ppaddr = ppaddr[type];
1900 binop->op_first = first;
1901 binop->op_flags = flags | OPf_KIDS;
1904 binop->op_private = 1 | (flags >> 8);
1907 binop->op_private = 2 | (flags >> 8);
1908 first->op_sibling = last;
1911 binop = (BINOP*)CHECKOP(type, binop);
1915 binop->op_last = last = binop->op_first->op_sibling;
1917 return fold_constants((OP *)binop);
1921 pmtrans(op, expr, repl)
1926 SV *tstr = ((SVOP*)expr)->op_sv;
1927 SV *rstr = ((SVOP*)repl)->op_sv;
1930 register U8 *t = (U8*)SvPV(tstr, tlen);
1931 register U8 *r = (U8*)SvPV(rstr, rlen);
1936 register short *tbl;
1938 tbl = (short*)cPVOP->op_pv;
1939 complement = op->op_private & OPpTRANS_COMPLEMENT;
1940 delete = op->op_private & OPpTRANS_DELETE;
1941 /* squash = op->op_private & OPpTRANS_SQUASH; */
1944 Zero(tbl, 256, short);
1945 for (i = 0; i < tlen; i++)
1947 for (i = 0, j = 0; i < 256; i++) {
1963 if (!rlen && !delete) {
1966 for (i = 0; i < 256; i++)
1968 for (i = 0, j = 0; i < tlen; i++,j++) {
1971 if (tbl[t[i]] == -1)
1977 if (tbl[t[i]] == -1)
1988 newPMOP(type, flags)
1994 Newz(1101, pmop, 1, PMOP);
1995 pmop->op_type = type;
1996 pmop->op_ppaddr = ppaddr[type];
1997 pmop->op_flags = flags;
1998 pmop->op_private = 0 | (flags >> 8);
2000 if (hints & HINT_LOCALE)
2001 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2003 /* link into pm list */
2004 if (type != OP_TRANS && curstash) {
2005 pmop->op_pmnext = HvPMROOT(curstash);
2006 HvPMROOT(curstash) = pmop;
2013 pmruntime(op, expr, repl)
2021 if (op->op_type == OP_TRANS)
2022 return pmtrans(op, expr, repl);
2024 hints |= HINT_BLOCK_SCOPE;
2027 if (expr->op_type == OP_CONST) {
2029 SV *pat = ((SVOP*)expr)->op_sv;
2030 char *p = SvPV(pat, plen);
2031 if ((op->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2032 sv_setpvn(pat, "\\s+", 3);
2033 p = SvPV(pat, plen);
2034 pm->op_pmflags |= PMf_SKIPWHITE;
2036 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2037 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2038 pm->op_pmflags |= PMf_WHITE;
2043 if (pm->op_pmflags & PMf_KEEP)
2044 expr = newUNOP(OP_REGCMAYBE,0,expr);
2046 Newz(1101, rcop, 1, LOGOP);
2047 rcop->op_type = OP_REGCOMP;
2048 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2049 rcop->op_first = scalar(expr);
2050 rcop->op_flags |= OPf_KIDS;
2051 rcop->op_private = 1;
2052 rcop->op_other = op;
2054 /* establish postfix order */
2055 if (pm->op_pmflags & PMf_KEEP) {
2057 rcop->op_next = expr;
2058 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2061 rcop->op_next = LINKLIST(expr);
2062 expr->op_next = (OP*)rcop;
2065 prepend_elem(op->op_type, scalar((OP*)rcop), op);
2070 if (pm->op_pmflags & PMf_EVAL)
2072 else if (repl->op_type == OP_CONST)
2076 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2077 if (opargs[curop->op_type] & OA_DANGEROUS) {
2078 if (curop->op_type == OP_GV) {
2079 GV *gv = ((GVOP*)curop)->op_gv;
2080 if (strchr("&`'123456789+", *GvENAME(gv)))
2083 else if (curop->op_type == OP_RV2CV)
2085 else if (curop->op_type == OP_RV2SV ||
2086 curop->op_type == OP_RV2AV ||
2087 curop->op_type == OP_RV2HV ||
2088 curop->op_type == OP_RV2GV) {
2089 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2092 else if (curop->op_type == OP_PADSV ||
2093 curop->op_type == OP_PADAV ||
2094 curop->op_type == OP_PADHV ||
2095 curop->op_type == OP_PADANY) {
2104 if (curop == repl) {
2105 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2106 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2107 prepend_elem(op->op_type, scalar(repl), op);
2110 Newz(1101, rcop, 1, LOGOP);
2111 rcop->op_type = OP_SUBSTCONT;
2112 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2113 rcop->op_first = scalar(repl);
2114 rcop->op_flags |= OPf_KIDS;
2115 rcop->op_private = 1;
2116 rcop->op_other = op;
2118 /* establish postfix order */
2119 rcop->op_next = LINKLIST(repl);
2120 repl->op_next = (OP*)rcop;
2122 pm->op_pmreplroot = scalar((OP*)rcop);
2123 pm->op_pmreplstart = LINKLIST(rcop);
2132 newSVOP(type, flags, sv)
2138 Newz(1101, svop, 1, SVOP);
2139 svop->op_type = type;
2140 svop->op_ppaddr = ppaddr[type];
2142 svop->op_next = (OP*)svop;
2143 svop->op_flags = flags;
2144 if (opargs[type] & OA_RETSCALAR)
2146 if (opargs[type] & OA_TARGET)
2147 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2148 return CHECKOP(type, svop);
2152 newGVOP(type, flags, gv)
2158 Newz(1101, gvop, 1, GVOP);
2159 gvop->op_type = type;
2160 gvop->op_ppaddr = ppaddr[type];
2161 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2162 gvop->op_next = (OP*)gvop;
2163 gvop->op_flags = flags;
2164 if (opargs[type] & OA_RETSCALAR)
2166 if (opargs[type] & OA_TARGET)
2167 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2168 return CHECKOP(type, gvop);
2172 newPVOP(type, flags, pv)
2178 Newz(1101, pvop, 1, PVOP);
2179 pvop->op_type = type;
2180 pvop->op_ppaddr = ppaddr[type];
2182 pvop->op_next = (OP*)pvop;
2183 pvop->op_flags = flags;
2184 if (opargs[type] & OA_RETSCALAR)
2186 if (opargs[type] & OA_TARGET)
2187 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2188 return CHECKOP(type, pvop);
2197 save_hptr(&curstash);
2198 save_item(curstname);
2203 name = SvPV(sv, len);
2204 curstash = gv_stashpvn(name,len,TRUE);
2205 sv_setpvn(curstname, name, len);
2209 sv_setpv(curstname,"<none>");
2217 utilize(aver, floor, version, id, arg)
2230 if (id->op_type != OP_CONST)
2231 croak("Module name must be constant");
2235 if(version != Nullop) {
2236 SV *vesv = ((SVOP*)version)->op_sv;
2238 if (arg == Nullop && !SvNIOK(vesv)) {
2245 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2246 croak("Version number must be constant number");
2248 /* Make copy of id so we don't free it twice */
2249 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2251 /* Fake up a method call to VERSION */
2252 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2253 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2254 append_elem(OP_LIST,
2255 prepend_elem(OP_LIST, pack, list(version)),
2256 newUNOP(OP_METHOD, 0, meth)));
2260 /* Fake up an import/unimport */
2261 if (arg && arg->op_type == OP_STUB)
2262 imop = arg; /* no import on explicit () */
2263 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2264 imop = Nullop; /* use 5.0; */
2267 /* Make copy of id so we don't free it twice */
2268 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2269 meth = newSVOP(OP_CONST, 0,
2271 ? newSVpv("import", 6)
2272 : newSVpv("unimport", 8)
2274 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2275 append_elem(OP_LIST,
2276 prepend_elem(OP_LIST, pack, list(arg)),
2277 newUNOP(OP_METHOD, 0, meth)));
2280 /* Fake up a require */
2281 rqop = newUNOP(OP_REQUIRE, 0, id);
2283 /* Fake up the BEGIN {}, which does its thing immediately. */
2285 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2287 append_elem(OP_LINESEQ,
2288 append_elem(OP_LINESEQ,
2289 newSTATEOP(0, Nullch, rqop),
2290 newSTATEOP(0, Nullch, veop)),
2291 newSTATEOP(0, Nullch, imop) ));
2298 newSLICEOP(flags, subscript, listval)
2303 return newBINOP(OP_LSLICE, flags,
2304 list(force_list(subscript)),
2305 list(force_list(listval)) );
2315 if (op->op_type == OP_NULL && op->op_flags & OPf_KIDS)
2316 op = cUNOP->op_first;
2318 if (op->op_type == OP_COND_EXPR) {
2319 I32 t = list_assignment(cCONDOP->op_first->op_sibling);
2320 I32 f = list_assignment(cCONDOP->op_first->op_sibling->op_sibling);
2325 yyerror("Assignment to both a list and a scalar");
2329 if (op->op_type == OP_LIST || op->op_flags & OPf_PARENS ||
2330 op->op_type == OP_RV2AV || op->op_type == OP_RV2HV ||
2331 op->op_type == OP_ASLICE || op->op_type == OP_HSLICE)
2334 if (op->op_type == OP_PADAV || op->op_type == OP_PADHV)
2337 if (op->op_type == OP_RV2SV)
2344 newASSIGNOP(flags, left, optype, right)
2353 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2354 return newLOGOP(optype, 0,
2355 mod(scalar(left), optype),
2356 newUNOP(OP_SASSIGN, 0, scalar(right)));
2359 return newBINOP(optype, OPf_STACKED,
2360 mod(scalar(left), optype), scalar(right));
2364 if (list_assignment(left)) {
2366 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2367 left = mod(left, OP_AASSIGN);
2375 op = newBINOP(OP_AASSIGN, flags,
2376 list(force_list(right)),
2377 list(force_list(left)) );
2378 op->op_private = 0 | (flags >> 8);
2379 if (!(left->op_private & OPpLVAL_INTRO)) {
2380 static int generation = 100;
2384 for (curop = LINKLIST(op); curop != op; curop = LINKLIST(curop)) {
2385 if (opargs[curop->op_type] & OA_DANGEROUS) {
2386 if (curop->op_type == OP_GV) {
2387 GV *gv = ((GVOP*)curop)->op_gv;
2388 if (gv == defgv || SvCUR(gv) == generation)
2390 SvCUR(gv) = generation;
2392 else if (curop->op_type == OP_PADSV ||
2393 curop->op_type == OP_PADAV ||
2394 curop->op_type == OP_PADHV ||
2395 curop->op_type == OP_PADANY) {
2396 SV **svp = AvARRAY(comppad_name);
2397 SV *sv = svp[curop->op_targ];
2398 if (SvCUR(sv) == generation)
2400 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2402 else if (curop->op_type == OP_RV2CV)
2404 else if (curop->op_type == OP_RV2SV ||
2405 curop->op_type == OP_RV2AV ||
2406 curop->op_type == OP_RV2HV ||
2407 curop->op_type == OP_RV2GV) {
2408 if (lastop->op_type != OP_GV) /* funny deref? */
2417 op->op_private = OPpASSIGN_COMMON;
2419 if (right && right->op_type == OP_SPLIT) {
2421 if ((tmpop = ((LISTOP*)right)->op_first) &&
2422 tmpop->op_type == OP_PUSHRE)
2424 PMOP *pm = (PMOP*)tmpop;
2425 if (left->op_type == OP_RV2AV &&
2426 !(left->op_private & OPpLVAL_INTRO) &&
2427 !(op->op_private & OPpASSIGN_COMMON) )
2429 tmpop = ((UNOP*)left)->op_first;
2430 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2431 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2432 pm->op_pmflags |= PMf_ONCE;
2433 tmpop = ((UNOP*)op)->op_first; /* to list (nulled) */
2434 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2435 tmpop->op_sibling = Nullop; /* don't free split */
2436 right->op_next = tmpop->op_next; /* fix starting loc */
2437 op_free(op); /* blow off assign */
2438 right->op_flags &= ~OPf_WANT;
2439 /* "I don't know and I don't care." */
2444 if (modcount < 10000 &&
2445 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2447 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2449 sv_setiv(sv, modcount+1);
2457 right = newOP(OP_UNDEF, 0);
2458 if (right->op_type == OP_READLINE) {
2459 right->op_flags |= OPf_STACKED;
2460 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2463 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2464 op = newBINOP(OP_SASSIGN, flags,
2465 scalar(right), mod(scalar(left), OP_SASSIGN) );
2477 newSTATEOP(flags, label, op)
2482 U32 seq = intro_my();
2485 Newz(1101, cop, 1, COP);
2486 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2487 cop->op_type = OP_DBSTATE;
2488 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2491 cop->op_type = OP_NEXTSTATE;
2492 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2494 cop->op_flags = flags;
2495 cop->op_private = 0 | (flags >> 8);
2497 cop->op_private |= NATIVE_HINTS;
2499 cop->op_next = (OP*)cop;
2502 cop->cop_label = label;
2503 hints |= HINT_BLOCK_SCOPE;
2506 cop->cop_arybase = curcop->cop_arybase;
2508 if (copline == NOLINE)
2509 cop->cop_line = curcop->cop_line;
2511 cop->cop_line = copline;
2514 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2515 cop->cop_stash = curstash;
2517 if (PERLDB_LINE && curstash != debstash) {
2518 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2519 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2520 (void)SvIOK_on(*svp);
2522 SvSTASH(*svp) = (HV*)cop;
2526 return prepend_elem(OP_LINESEQ, (OP*)cop, op);
2529 /* "Introduce" my variables to visible status. */
2537 if (! min_intro_pending)
2540 svp = AvARRAY(comppad_name);
2541 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2542 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2543 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2544 SvNVX(sv) = (double)cop_seqmax;
2547 min_intro_pending = 0;
2548 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2549 return cop_seqmax++;
2553 newLOGOP(type, flags, first, other)
2562 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2563 return newBINOP(type, flags, scalar(first), scalar(other));
2565 scalarboolean(first);
2566 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2567 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2568 if (type == OP_AND || type == OP_OR) {
2574 first = cUNOP->op_first;
2576 first->op_next = op->op_next;
2577 cUNOP->op_first = Nullop;
2581 if (first->op_type == OP_CONST) {
2582 if (dowarn && (first->op_private & OPpCONST_BARE))
2583 warn("Probable precedence problem on %s", op_desc[type]);
2584 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2593 else if (first->op_type == OP_WANTARRAY) {
2599 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2600 OP *k1 = ((UNOP*)first)->op_first;
2601 OP *k2 = k1->op_sibling;
2603 switch (first->op_type)
2606 if (k2 && k2->op_type == OP_READLINE
2607 && (k2->op_flags & OPf_STACKED)
2608 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2609 warnop = k2->op_type;
2613 if (k1->op_type == OP_READDIR
2614 || k1->op_type == OP_GLOB
2615 || k1->op_type == OP_EACH)
2616 warnop = k1->op_type;
2620 line_t oldline = curcop->cop_line;
2621 curcop->cop_line = copline;
2622 warn("Value of %s%s can be \"0\"; test with defined()",
2624 ((warnop == OP_READLINE || warnop == OP_GLOB)
2625 ? " construct" : "() operator"));
2626 curcop->cop_line = oldline;
2633 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2634 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2636 Newz(1101, logop, 1, LOGOP);
2638 logop->op_type = type;
2639 logop->op_ppaddr = ppaddr[type];
2640 logop->op_first = first;
2641 logop->op_flags = flags | OPf_KIDS;
2642 logop->op_other = LINKLIST(other);
2643 logop->op_private = 1 | (flags >> 8);
2645 /* establish postfix order */
2646 logop->op_next = LINKLIST(first);
2647 first->op_next = (OP*)logop;
2648 first->op_sibling = other;
2650 op = newUNOP(OP_NULL, 0, (OP*)logop);
2651 other->op_next = op;
2657 newCONDOP(flags, first, trueop, falseop)
2667 return newLOGOP(OP_AND, 0, first, trueop);
2669 return newLOGOP(OP_OR, 0, first, falseop);
2671 scalarboolean(first);
2672 if (first->op_type == OP_CONST) {
2673 if (SvTRUE(((SVOP*)first)->op_sv)) {
2684 else if (first->op_type == OP_WANTARRAY) {
2688 Newz(1101, condop, 1, CONDOP);
2690 condop->op_type = OP_COND_EXPR;
2691 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2692 condop->op_first = first;
2693 condop->op_flags = flags | OPf_KIDS;
2694 condop->op_true = LINKLIST(trueop);
2695 condop->op_false = LINKLIST(falseop);
2696 condop->op_private = 1 | (flags >> 8);
2698 /* establish postfix order */
2699 condop->op_next = LINKLIST(first);
2700 first->op_next = (OP*)condop;
2702 first->op_sibling = trueop;
2703 trueop->op_sibling = falseop;
2704 op = newUNOP(OP_NULL, 0, (OP*)condop);
2706 trueop->op_next = op;
2707 falseop->op_next = op;
2713 newRANGE(flags, left, right)
2723 Newz(1101, condop, 1, CONDOP);
2725 condop->op_type = OP_RANGE;
2726 condop->op_ppaddr = ppaddr[OP_RANGE];
2727 condop->op_first = left;
2728 condop->op_flags = OPf_KIDS;
2729 condop->op_true = LINKLIST(left);
2730 condop->op_false = LINKLIST(right);
2731 condop->op_private = 1 | (flags >> 8);
2733 left->op_sibling = right;
2735 condop->op_next = (OP*)condop;
2736 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2737 flop = newUNOP(OP_FLOP, 0, flip);
2738 op = newUNOP(OP_NULL, 0, flop);
2741 left->op_next = flip;
2742 right->op_next = flop;
2744 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2745 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2746 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2747 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2749 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2750 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2753 if (!flip->op_private || !flop->op_private)
2754 linklist(op); /* blow off optimizer unless constant */
2760 newLOOPOP(flags, debuggable, expr, block)
2768 int once = block && block->op_flags & OPf_SPECIAL &&
2769 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2772 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2773 return block; /* do {} while 0 does once */
2774 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2775 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2776 expr = newUNOP(OP_DEFINED, 0,
2777 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2781 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2782 op = newLOGOP(OP_AND, 0, expr, listop);
2784 ((LISTOP*)listop)->op_last->op_next = LINKLIST(op);
2786 if (once && op != listop)
2787 op->op_next = ((LOGOP*)cUNOP->op_first)->op_other;
2790 op = newUNOP(OP_NULL, 0, op); /* or do {} while 1 loses outer block */
2792 op->op_flags |= flags;
2794 op->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2799 newWHILEOP(flags, debuggable, loop, whileline, expr, block, cont)
2814 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2815 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2816 expr = newUNOP(OP_DEFINED, 0,
2817 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2821 block = newOP(OP_NULL, 0);
2824 next = LINKLIST(cont);
2826 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2827 if ((line_t)whileline != NOLINE) {
2828 copline = whileline;
2829 cont = append_elem(OP_LINESEQ, cont,
2830 newSTATEOP(0, Nullch, Nullop));
2834 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2835 redo = LINKLIST(listop);
2838 op = newLOGOP(OP_AND, 0, expr, scalar(listop));
2839 if (op == expr && op->op_type == OP_CONST && !SvTRUE(cSVOP->op_sv)) {
2840 op_free(expr); /* oops, it's a while (0) */
2842 return Nullop; /* (listop already freed by newLOGOP) */
2844 ((LISTOP*)listop)->op_last->op_next = condop =
2845 (op == listop ? redo : LINKLIST(op));
2853 Newz(1101,loop,1,LOOP);
2854 loop->op_type = OP_ENTERLOOP;
2855 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2856 loop->op_private = 0;
2857 loop->op_next = (OP*)loop;
2860 op = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, op);
2862 loop->op_redoop = redo;
2863 loop->op_lastop = op;
2866 loop->op_nextop = next;
2868 loop->op_nextop = op;
2870 op->op_flags |= flags;
2871 op->op_private |= (flags >> 8);
2876 #ifndef CAN_PROTOTYPE
2877 newFOROP(flags,label,forline,sv,expr,block,cont)
2886 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2887 #endif /* CAN_PROTOTYPE */
2895 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2896 sv->op_type = OP_RV2GV;
2897 sv->op_ppaddr = ppaddr[OP_RV2GV];
2899 else if (sv->op_type == OP_PADSV) { /* private variable */
2900 padoff = sv->op_targ;
2905 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2908 sv = newGVOP(OP_GV, 0, defgv);
2910 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2911 expr = scalar(ref(expr, OP_ITER));
2912 iterflags |= OPf_STACKED;
2914 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2915 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2917 assert(!loop->op_next);
2918 Renew(loop, 1, LOOP);
2919 loop->op_targ = padoff;
2920 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
2922 return newSTATEOP(0, label, wop);
2926 newLOOPEX(type, label)
2931 if (type != OP_GOTO || label->op_type == OP_CONST) {
2932 op = newPVOP(type, 0, savepv(
2933 label->op_type == OP_CONST
2934 ? SvPVx(((SVOP*)label)->op_sv, na)
2939 if (label->op_type == OP_ENTERSUB)
2940 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2941 op = newUNOP(type, OPf_STACKED, label);
2943 hints |= HINT_BLOCK_SCOPE;
2951 if (!CvXSUB(cv) && CvROOT(cv)) {
2953 croak("Can't undef active subroutine");
2960 op_free(CvROOT(cv));
2961 CvROOT(cv) = Nullop;
2964 SvPOK_off((SV*)cv); /* forget prototype */
2966 SvREFCNT_dec(CvGV(cv));
2968 SvREFCNT_dec(CvOUTSIDE(cv));
2969 CvOUTSIDE(cv) = Nullcv;
2970 if (CvPADLIST(cv)) {
2971 /* may be during global destruction */
2972 if (SvREFCNT(CvPADLIST(cv))) {
2973 I32 i = AvFILL(CvPADLIST(cv));
2975 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
2976 SV* sv = svp ? *svp : Nullsv;
2979 if (sv == (SV*)comppad_name)
2980 comppad_name = Nullav;
2981 else if (sv == (SV*)comppad) {
2983 curpad = Null(SV**);
2987 SvREFCNT_dec((SV*)CvPADLIST(cv));
2989 CvPADLIST(cv) = Nullav;
2993 #ifdef DEBUG_CLOSURES
2998 CV *outside = CvOUTSIDE(cv);
2999 AV* padlist = CvPADLIST(cv);
3006 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3008 (CvANON(cv) ? "ANON"
3009 : (cv == main_cv) ? "MAIN"
3010 : CvUNIQUE(outside) ? "UNIQUE"
3011 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3014 : CvANON(outside) ? "ANON"
3015 : (outside == main_cv) ? "MAIN"
3016 : CvUNIQUE(outside) ? "UNIQUE"
3017 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3022 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3023 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3024 pname = AvARRAY(pad_name);
3025 ppad = AvARRAY(pad);
3027 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
3028 if (SvPOK(pname[ix]))
3029 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3031 SvFAKE(pname[ix]) ? "FAKE " : "",
3033 (long)I_32(SvNVX(pname[ix])),
3034 (long)SvIVX(pname[ix]));
3037 #endif /* DEBUG_CLOSURES */
3040 cv_clone2(proto, outside)
3046 AV* protopadlist = CvPADLIST(proto);
3047 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3048 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3049 SV** pname = AvARRAY(protopad_name);
3050 SV** ppad = AvARRAY(protopad);
3051 I32 fname = AvFILL(protopad_name);
3052 I32 fpad = AvFILL(protopad);
3056 assert(!CvUNIQUE(proto));
3061 SAVESPTR(comppad_name);
3064 cv = compcv = (CV*)NEWSV(1104,0);
3065 sv_upgrade((SV *)cv, SvTYPE(proto));
3070 CvFILEGV(cv) = CvFILEGV(proto);
3071 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3072 CvSTASH(cv) = CvSTASH(proto);
3073 CvROOT(cv) = CvROOT(proto);
3074 CvSTART(cv) = CvSTART(proto);
3076 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3079 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3081 comppad_name = newAV();
3082 for (ix = fname; ix >= 0; ix--)
3083 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3087 comppadlist = newAV();
3088 AvREAL_off(comppadlist);
3089 av_store(comppadlist, 0, (SV*)comppad_name);
3090 av_store(comppadlist, 1, (SV*)comppad);
3091 CvPADLIST(cv) = comppadlist;
3092 av_fill(comppad, AvFILL(protopad));
3093 curpad = AvARRAY(comppad);
3095 av = newAV(); /* will be @_ */
3097 av_store(comppad, 0, (SV*)av);
3098 AvFLAGS(av) = AVf_REIFY;
3100 for (ix = fpad; ix > 0; ix--) {
3101 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3102 if (namesv && namesv != &sv_undef) {
3103 char *name = SvPVX(namesv); /* XXX */
3104 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3105 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3106 CvOUTSIDE(cv), cxstack_ix);
3108 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3110 croak("panic: cv_clone: %s", name);
3112 else { /* our own lexical */
3115 /* anon code -- we'll come back for it */
3116 sv = SvREFCNT_inc(ppad[ix]);
3118 else if (*name == '@')
3120 else if (*name == '%')
3130 SV* sv = NEWSV(0,0);
3136 /* Now that vars are all in place, clone nested closures. */
3138 for (ix = fpad; ix > 0; ix--) {
3139 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3141 && namesv != &sv_undef
3142 && !(SvFLAGS(namesv) & SVf_FAKE)
3143 && *SvPVX(namesv) == '&'
3144 && CvCLONE(ppad[ix]))
3146 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3147 SvREFCNT_dec(ppad[ix]);
3150 curpad[ix] = (SV*)kid;
3154 #ifdef DEBUG_CLOSURES
3155 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3157 PerlIO_printf(Perl_debug_log, " from:\n");
3159 PerlIO_printf(Perl_debug_log, " to:\n");
3171 return cv_clone2(proto, CvOUTSIDE(proto));
3175 cv_ckproto(cv, gv, p)
3180 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3181 SV* msg = sv_newmortal();
3185 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3186 sv_setpv(msg, "Prototype mismatch:");
3188 sv_catpvf(msg, " sub %_", name);
3190 sv_catpvf(msg, " (%s)", SvPVX(cv));
3191 sv_catpv(msg, " vs ");
3193 sv_catpvf(msg, "(%s)", p);
3195 sv_catpv(msg, "none");
3207 if (!cv || !SvPOK(cv) || SvCUR(cv))
3211 for (o = CvSTART(cv); o; o = o->op_next) {
3212 OPCODE type = o->op_type;
3214 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3216 if (type == OP_LEAVESUB || type == OP_RETURN)
3220 if (type == OP_CONST)
3221 sv = ((SVOP*)o)->op_sv;
3222 else if (type == OP_PADSV) {
3223 AV* pad = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3224 sv = pad ? AvARRAY(pad)[o->op_targ] : Nullsv;
3225 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3237 newSUB(floor,op,proto,block)
3243 char *name = op ? SvPVx(cSVOP->op_sv, na) : Nullch;
3244 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3245 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3254 if (!name || GvCVGEN(gv))
3256 else if (cv = GvCV(gv)) {
3257 cv_ckproto(cv, gv, ps);
3258 /* already defined (or promised)? */
3259 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3262 /* just a "sub foo;" when &foo is already defined */
3266 /* ahem, death to those who redefine active sort subs */
3267 if (curstack == sortstack && sortcop == CvSTART(cv))
3268 croak("Can't redefine active sort subroutine %s", name);
3269 const_sv = cv_const_sv(cv);
3270 if (const_sv || dowarn) {
3271 line_t oldline = curcop->cop_line;
3272 curcop->cop_line = copline;
3273 warn(const_sv ? "Constant subroutine %s redefined"
3274 : "Subroutine %s redefined", name);
3275 curcop->cop_line = oldline;
3281 if (cv) { /* must reuse cv if autoloaded */
3283 CvFLAGS(cv) = CvFLAGS(compcv);
3284 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3285 CvOUTSIDE(compcv) = 0;
3286 CvPADLIST(cv) = CvPADLIST(compcv);
3287 CvPADLIST(compcv) = 0;
3288 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3289 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3290 SvREFCNT_dec(compcv);
3300 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3301 CvFILEGV(cv) = curcop->cop_filegv;
3302 CvSTASH(cv) = curstash;
3305 sv_setpv((SV*)cv, ps);
3311 char *s = strrchr(name, ':');
3313 if (strEQ(s, "BEGIN")) {
3315 "BEGIN not safe after errors--compilation aborted";
3319 /* force display of errors found but not reported */
3320 sv_catpv(GvSV(errgv), not_safe);
3321 croak("%s", SvPVx(GvSV(errgv), na));
3332 if (AvFILL(comppad_name) < AvFILL(comppad))
3333 av_store(comppad_name, AvFILL(comppad), Nullsv);
3336 SV **namep = AvARRAY(comppad_name);
3337 for (ix = AvFILL(comppad); ix > 0; ix--) {
3340 if (SvIMMORTAL(curpad[ix]))
3343 * The only things that a clonable function needs in its
3344 * pad are references to outer lexicals and anonymous subs.
3345 * The rest are created anew during cloning.
3347 if (!((namesv = namep[ix]) != Nullsv &&
3348 namesv != &sv_undef &&
3350 *SvPVX(namesv) == '&')))
3352 SvREFCNT_dec(curpad[ix]);
3353 curpad[ix] = Nullsv;
3358 AV *av = newAV(); /* Will be @_ */
3360 av_store(comppad, 0, (SV*)av);
3361 AvFLAGS(av) = AVf_REIFY;
3363 for (ix = AvFILL(comppad); ix > 0; ix--) {
3364 if (SvIMMORTAL(curpad[ix]))
3366 if (!SvPADMY(curpad[ix]))
3367 SvPADTMP_on(curpad[ix]);
3371 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3372 CvSTART(cv) = LINKLIST(CvROOT(cv));
3373 CvROOT(cv)->op_next = 0;
3379 if (PERLDB_SUBLINE && curstash != debstash) {
3380 SV *sv = NEWSV(0,0);
3381 SV *tmpstr = sv_newmortal();
3382 static GV *db_postponed;
3386 sv_setpvf(sv, "%_:%ld-%ld",
3387 GvSV(curcop->cop_filegv),
3388 (long)subline, (long)curcop->cop_line);
3389 gv_efullname3(tmpstr, gv, Nullch);
3390 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3391 if (!db_postponed) {
3392 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3394 hv = GvHVn(db_postponed);
3395 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3396 && (cv = GvCV(db_postponed))) {
3401 perl_call_sv((SV*)cv, G_DISCARD);
3405 if ((s = strrchr(name,':')))
3409 if (strEQ(s, "BEGIN")) {
3410 I32 oldscope = scopestack_ix;
3412 SAVESPTR(compiling.cop_filegv);
3413 SAVEI16(compiling.cop_line);
3420 DEBUG_x( dump_sub(gv) );
3421 av_push(beginav, (SV *)cv);
3423 call_list(oldscope, beginav);
3425 curcop = &compiling;
3428 else if (strEQ(s, "END") && !error_count) {
3431 av_unshift(endav, 1);
3432 av_store(endav, 0, (SV *)cv);
3445 newXSUB(name, ix, subaddr, filename)
3451 CV* cv = newXS(name, (void(*)())subaddr, filename);
3453 CvXSUBANY(cv).any_i32 = ix;
3459 newXS(name, subaddr, filename)
3461 void (*subaddr) _((CV*));
3464 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3467 if (cv = (name ? GvCV(gv) : Nullcv)) {
3469 /* just a cached method */
3473 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3474 /* already defined (or promised) */
3476 line_t oldline = curcop->cop_line;
3477 curcop->cop_line = copline;
3478 warn("Subroutine %s redefined",name);
3479 curcop->cop_line = oldline;
3486 if (cv) /* must reuse cv if autoloaded */
3489 cv = (CV*)NEWSV(1105,0);
3490 sv_upgrade((SV *)cv, SVt_PVCV);
3497 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3498 CvFILEGV(cv) = gv_fetchfile(filename);
3499 CvXSUB(cv) = subaddr;
3502 char *s = strrchr(name,':');
3507 if (strEQ(s, "BEGIN")) {
3510 av_push(beginav, (SV *)cv);
3513 else if (strEQ(s, "END")) {
3516 av_unshift(endav, 1);
3517 av_store(endav, 0, (SV *)cv);
3528 newFORM(floor,op,block)
3539 name = SvPVx(cSVOP->op_sv, na);
3542 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3544 if (cv = GvFORM(gv)) {
3546 line_t oldline = curcop->cop_line;
3548 curcop->cop_line = copline;
3549 warn("Format %s redefined",name);
3550 curcop->cop_line = oldline;
3556 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3557 CvFILEGV(cv) = curcop->cop_filegv;
3559 for (ix = AvFILL(comppad); ix > 0; ix--) {
3560 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3561 SvPADTMP_on(curpad[ix]);
3564 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3565 CvSTART(cv) = LINKLIST(CvROOT(cv));
3566 CvROOT(cv)->op_next = 0;
3577 return newUNOP(OP_REFGEN, 0,
3578 mod(list(convert(OP_ANONLIST, 0, op)), OP_REFGEN));
3585 return newUNOP(OP_REFGEN, 0,
3586 mod(list(convert(OP_ANONHASH, 0, op)), OP_REFGEN));
3590 newANONSUB(floor, proto, block)
3595 return newUNOP(OP_REFGEN, 0,
3596 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3603 switch (o->op_type) {
3605 o->op_type = OP_PADAV;
3606 o->op_ppaddr = ppaddr[OP_PADAV];
3607 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3610 o->op_type = OP_RV2AV;
3611 o->op_ppaddr = ppaddr[OP_RV2AV];
3616 warn("oops: oopsAV");
3626 switch (o->op_type) {
3629 o->op_type = OP_PADHV;
3630 o->op_ppaddr = ppaddr[OP_PADHV];
3631 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3635 o->op_type = OP_RV2HV;
3636 o->op_ppaddr = ppaddr[OP_RV2HV];
3641 warn("oops: oopsHV");
3651 if (o->op_type == OP_PADANY) {
3652 o->op_type = OP_PADAV;
3653 o->op_ppaddr = ppaddr[OP_PADAV];
3656 return newUNOP(OP_RV2AV, 0, scalar(o));
3664 if (type == OP_MAPSTART)
3665 return newUNOP(OP_NULL, 0, o);
3666 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3673 if (o->op_type == OP_PADANY) {
3674 o->op_type = OP_PADHV;
3675 o->op_ppaddr = ppaddr[OP_PADHV];
3678 return newUNOP(OP_RV2HV, 0, scalar(o));
3685 croak("NOT IMPL LINE %d",__LINE__);
3695 return newUNOP(OP_RV2CV, flags, scalar(o));
3702 if (o->op_type == OP_PADANY) {
3703 o->op_type = OP_PADSV;
3704 o->op_ppaddr = ppaddr[OP_PADSV];
3707 return newUNOP(OP_RV2SV, 0, scalar(o));
3710 /* Check routines. */
3719 name = NEWSV(1106,0);
3720 sv_upgrade(name, SVt_PVNV);
3721 sv_setpvn(name, "&", 1);
3724 ix = pad_alloc(op->op_type, SVs_PADMY);
3725 av_store(comppad_name, ix, name);
3726 av_store(comppad, ix, cSVOP->op_sv);
3727 SvPADMY_on(cSVOP->op_sv);
3728 cSVOP->op_sv = Nullsv;
3729 cSVOP->op_targ = ix;
3737 op->op_private = hints;
3745 if (cUNOP->op_first->op_type == OP_CONCAT)
3746 op->op_flags |= OPf_STACKED;
3754 if (op->op_flags & OPf_KIDS) {
3757 OPCODE type = op->op_type;
3758 op = modkids(ck_fun(op), type);
3759 kid = cUNOP->op_first;
3760 newop = kUNOP->op_first->op_sibling;
3762 (newop->op_sibling ||
3763 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3764 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3765 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3769 op_free(kUNOP->op_first);
3770 kUNOP->op_first = newop;
3772 op->op_ppaddr = ppaddr[++op->op_type];
3782 if (op->op_flags & OPf_KIDS) {
3783 OP *kid = cUNOP->op_first;
3784 if (kid->op_type == OP_HSLICE)
3785 op->op_private |= OPpSLICE;
3786 else if (kid->op_type != OP_HELEM)
3787 croak("%s argument is not a HASH element or slice",
3788 op_desc[op->op_type]);
3798 I32 type = op->op_type;
3800 if (op->op_flags & OPf_KIDS) {
3801 if (cLISTOP->op_first->op_type == OP_STUB) {
3803 op = newUNOP(type, OPf_SPECIAL,
3804 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3815 hints |= HINT_BLOCK_SCOPE;
3816 if (op->op_flags & OPf_KIDS) {
3817 SVOP *kid = (SVOP*)cUNOP->op_first;
3820 op->op_flags &= ~OPf_KIDS;
3823 else if (kid->op_type == OP_LINESEQ) {
3826 kid->op_next = op->op_next;
3827 cUNOP->op_first = 0;
3830 Newz(1101, enter, 1, LOGOP);
3831 enter->op_type = OP_ENTERTRY;
3832 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3833 enter->op_private = 0;
3835 /* establish postfix order */
3836 enter->op_next = (OP*)enter;
3838 op = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3839 op->op_type = OP_LEAVETRY;
3840 op->op_ppaddr = ppaddr[OP_LEAVETRY];
3841 enter->op_other = op;
3847 op = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3849 op->op_targ = (PADOFFSET)hints;
3858 if (op->op_flags & OPf_STACKED) {
3860 kid = cUNOP->op_first->op_sibling;
3861 if (kid->op_type == OP_RV2GV)
3874 if (op->op_flags & OPf_KIDS) {
3875 OP *kid = cUNOP->op_first;
3876 if (kid->op_type != OP_HELEM)
3877 croak("%s argument is not a HASH element", op_desc[op->op_type]);
3887 o = fold_constants(o);
3888 if (o->op_type == OP_CONST)
3897 SVOP *kid = (SVOP*)cUNOP->op_first;
3899 op->op_private |= (hints & HINT_STRICT_REFS);
3900 if (kid->op_type == OP_CONST) {
3905 name = SvPV(kid->op_sv, na);
3906 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3907 char *badthing = Nullch;
3908 switch (op->op_type) {
3910 badthing = "a SCALAR";
3913 badthing = "an ARRAY";
3916 badthing = "a HASH";
3921 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3924 kid->op_type = OP_GV;
3925 iscv = (op->op_type == OP_RV2CV) * 2;
3926 for (gv = 0; !gv; iscv++) {
3928 * This is a little tricky. We only want to add the symbol if we
3929 * didn't add it in the lexer. Otherwise we get duplicate strict
3930 * warnings. But if we didn't add it in the lexer, we must at
3931 * least pretend like we wanted to add it even if it existed before,
3932 * or we get possible typo warnings. OPpCONST_ENTERED says
3933 * whether the lexer already added THIS instance of this symbol.
3935 gv = gv_fetchpv(name,
3936 iscv | !(kid->op_private & OPpCONST_ENTERED),
3939 : op->op_type == OP_RV2SV
3941 : op->op_type == OP_RV2AV
3943 : op->op_type == OP_RV2HV
3947 SvREFCNT_dec(kid->op_sv);
3948 kid->op_sv = SvREFCNT_inc(gv);
3957 I32 type = op->op_type;
3959 if (op->op_flags & OPf_REF)
3962 if (op->op_flags & OPf_KIDS) {
3963 SVOP *kid = (SVOP*)cUNOP->op_first;
3965 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3966 OP *newop = newGVOP(type, OPf_REF,
3967 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
3974 if (type == OP_FTTTY)
3975 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
3978 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3991 int type = op->op_type;
3992 register I32 oa = opargs[type] >> OASHIFT;
3994 if (op->op_flags & OPf_STACKED) {
3995 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
3998 return no_fh_allowed(op);
4001 if (op->op_flags & OPf_KIDS) {
4002 tokid = &cLISTOP->op_first;
4003 kid = cLISTOP->op_first;
4004 if (kid->op_type == OP_PUSHMARK ||
4005 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4007 tokid = &kid->op_sibling;
4008 kid = kid->op_sibling;
4010 if (!kid && opargs[type] & OA_DEFGV)
4011 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
4015 sibl = kid->op_sibling;
4029 if (kid->op_type == OP_CONST &&
4030 (kid->op_private & OPpCONST_BARE)) {
4031 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4032 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4033 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4035 warn("Array @%s missing the @ in argument %ld of %s()",
4036 name, (long)numargs, op_desc[type]);
4039 kid->op_sibling = sibl;
4042 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4043 bad_type(numargs, "array", op_desc[op->op_type], kid);
4047 if (kid->op_type == OP_CONST &&
4048 (kid->op_private & OPpCONST_BARE)) {
4049 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4050 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4051 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4053 warn("Hash %%%s missing the %% in argument %ld of %s()",
4054 name, (long)numargs, op_desc[type]);
4057 kid->op_sibling = sibl;
4060 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4061 bad_type(numargs, "hash", op_desc[op->op_type], kid);
4066 OP *newop = newUNOP(OP_NULL, 0, kid);
4067 kid->op_sibling = 0;
4069 newop->op_next = newop;
4071 kid->op_sibling = sibl;
4076 if (kid->op_type != OP_GV) {
4077 if (kid->op_type == OP_CONST &&
4078 (kid->op_private & OPpCONST_BARE)) {
4079 OP *newop = newGVOP(OP_GV, 0,
4080 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4086 kid->op_sibling = 0;
4087 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4089 kid->op_sibling = sibl;
4095 mod(scalar(kid), type);
4099 tokid = &kid->op_sibling;
4100 kid = kid->op_sibling;
4102 op->op_private |= numargs;
4104 return too_many_arguments(op,op_desc[op->op_type]);
4107 else if (opargs[type] & OA_DEFGV) {
4109 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4113 while (oa & OA_OPTIONAL)
4115 if (oa && oa != OA_LIST)
4116 return too_few_arguments(op,op_desc[op->op_type]);
4127 if ((op->op_flags & OPf_KIDS) && !cLISTOP->op_first->op_sibling)
4128 append_elem(OP_GLOB, op, newSVREF(newGVOP(OP_GV, 0, defgv)));
4130 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4131 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4133 if (gv && GvIMPORTED_CV(gv)) {
4134 static int glob_index;
4136 append_elem(OP_GLOB, op,
4137 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4138 op->op_type = OP_LIST;
4139 op->op_ppaddr = ppaddr[OP_LIST];
4140 ((LISTOP*)op)->op_first->op_type = OP_PUSHMARK;
4141 ((LISTOP*)op)->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4142 op = newUNOP(OP_ENTERSUB, OPf_STACKED,
4143 append_elem(OP_LIST, op,
4144 scalar(newUNOP(OP_RV2CV, 0,
4145 newGVOP(OP_GV, 0, gv)))));
4146 op = newUNOP(OP_NULL, 0, ck_subr(op));
4147 op->op_targ = OP_GLOB; /* hint at what it used to be */
4150 gv = newGVgen("main");
4152 append_elem(OP_GLOB, op, newGVOP(OP_GV, 0, gv));
4163 OPCODE type = op->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4165 op->op_ppaddr = ppaddr[OP_GREPSTART];
4166 Newz(1101, gwop, 1, LOGOP);
4168 if (op->op_flags & OPf_STACKED) {
4171 kid = cLISTOP->op_first->op_sibling;
4172 for (k = cLISTOP->op_first->op_sibling->op_next; k; k = k->op_next) {
4175 kid->op_next = (OP*)gwop;
4176 op->op_flags &= ~OPf_STACKED;
4178 kid = cLISTOP->op_first->op_sibling;
4179 if (type == OP_MAPWHILE)
4186 kid = cLISTOP->op_first->op_sibling;
4187 if (kid->op_type != OP_NULL)
4188 croak("panic: ck_grep");
4189 kid = kUNOP->op_first;
4191 gwop->op_type = type;
4192 gwop->op_ppaddr = ppaddr[type];
4193 gwop->op_first = listkids(op);
4194 gwop->op_flags |= OPf_KIDS;
4195 gwop->op_private = 1;
4196 gwop->op_other = LINKLIST(kid);
4197 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4198 kid->op_next = (OP*)gwop;
4200 kid = cLISTOP->op_first->op_sibling;
4201 if (!kid || !kid->op_sibling)
4202 return too_few_arguments(op,op_desc[op->op_type]);
4203 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4204 mod(kid, OP_GREPSTART);
4213 if (op->op_flags & OPf_KIDS) {
4214 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4215 if (kid && kid->op_type == OP_CONST)
4216 fbm_compile(((SVOP*)kid)->op_sv);
4225 /* XXX length optimization goes here */
4233 OPCODE type = op->op_type;
4234 return modkids(ck_fun(op), type);
4241 OPCODE type = op->op_type;
4242 return refkids(ck_fun(op), type);
4251 kid = cLISTOP->op_first;
4253 op = force_list(op);
4254 kid = cLISTOP->op_first;
4256 if (kid->op_type == OP_PUSHMARK)
4257 kid = kid->op_sibling;
4258 if (kid && op->op_flags & OPf_STACKED)
4259 kid = kid->op_sibling;
4260 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4261 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4262 op->op_flags |= OPf_STACKED; /* make it a filehandle */
4263 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4264 cLISTOP->op_first->op_sibling = kid;
4265 cLISTOP->op_last = kid;
4266 kid = kid->op_sibling;
4271 append_elem(op->op_type, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4277 if (hints & HINT_LOCALE)
4278 op->op_private |= OPpLOCALE;
4292 if (hints & HINT_LOCALE)
4293 op->op_private |= OPpLOCALE;
4305 if (hints & HINT_LOCALE)
4306 op->op_private |= OPpLOCALE;
4316 op->op_private |= OPpRUNTIME;
4331 if (cBINOP->op_first->op_flags & OPf_PARENS) {
4332 op->op_private |= OPpREPEAT_DOLIST;
4333 cBINOP->op_first = force_list(cBINOP->op_first);
4344 if (op->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4345 SVOP *kid = (SVOP*)cUNOP->op_first;
4347 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4349 for (s = SvPVX(kid->op_sv); *s; s++) {
4350 if (*s == ':' && s[1] == ':') {
4352 Move(s+2, s+1, strlen(s+2)+1, char);
4353 --SvCUR(kid->op_sv);
4356 sv_catpvn(kid->op_sv, ".pm", 3);
4366 croak("NOT IMPL LINE %d",__LINE__);
4376 if (op->op_flags & OPf_KIDS) {
4377 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4378 if (kid && kid->op_sibling) {
4379 op->op_type = OP_SSELECT;
4380 op->op_ppaddr = ppaddr[OP_SSELECT];
4382 return fold_constants(op);
4386 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4387 if (kid && kid->op_type == OP_RV2GV)
4388 kid->op_private &= ~HINT_STRICT_REFS;
4396 I32 type = op->op_type;
4398 if (!(op->op_flags & OPf_KIDS)) {
4400 return newUNOP(type, 0,
4401 scalar(newUNOP(OP_RV2AV, 0,
4402 scalar(newGVOP(OP_GV, 0, subline
4404 : gv_fetchpv("ARGV", TRUE, SVt_PVAV) )))));
4406 return scalar(modkids(ck_fun(op), type));
4415 if (hints & HINT_LOCALE)
4416 op->op_private |= OPpLOCALE;
4419 if (op->op_flags & OPf_STACKED) {
4420 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4422 kid = kUNOP->op_first; /* get past rv2gv */
4424 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4426 if (kid->op_type == OP_SCOPE) {
4430 else if (kid->op_type == OP_LEAVE) {
4431 if (op->op_type == OP_SORT) {
4432 null(kid); /* wipe out leave */
4435 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4436 if (k->op_next == kid)
4441 kid->op_next = 0; /* just disconnect the leave */
4442 k = kLISTOP->op_first;
4446 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4447 null(kid); /* wipe out rv2gv */
4448 if (op->op_type == OP_SORT)
4452 op->op_flags |= OPf_SPECIAL;
4466 if (op->op_flags & OPf_STACKED)
4467 return no_fh_allowed(op);
4469 kid = cLISTOP->op_first;
4470 if (kid->op_type != OP_NULL)
4471 croak("panic: ck_split");
4472 kid = kid->op_sibling;
4473 op_free(cLISTOP->op_first);
4474 cLISTOP->op_first = kid;
4476 cLISTOP->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4477 cLISTOP->op_last = kid; /* There was only one element previously */
4480 if (kid->op_type != OP_MATCH) {
4481 OP *sibl = kid->op_sibling;
4482 kid->op_sibling = 0;
4483 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4484 if (cLISTOP->op_first == cLISTOP->op_last)
4485 cLISTOP->op_last = kid;
4486 cLISTOP->op_first = kid;
4487 kid->op_sibling = sibl;
4490 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4491 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4495 kid->op_type = OP_PUSHRE;
4496 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4499 if (!kid->op_sibling)
4500 append_elem(OP_SPLIT, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4502 kid = kid->op_sibling;
4505 if (!kid->op_sibling)
4506 append_elem(OP_SPLIT, op, newSVOP(OP_CONST, 0, newSViv(0)));
4508 kid = kid->op_sibling;
4511 if (kid->op_sibling)
4512 return too_many_arguments(op,op_desc[op->op_type]);
4521 OP *prev = ((cUNOP->op_first->op_sibling)
4522 ? cUNOP : ((UNOP*)cUNOP->op_first))->op_first;
4523 OP *o = prev->op_sibling;
4531 for (cvop = o; cvop->op_sibling; cvop = cvop->op_sibling) ;
4532 if (cvop->op_type == OP_RV2CV) {
4534 op->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4535 null(cvop); /* disable rv2cv */
4536 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4537 if (tmpop->op_type == OP_GV) {
4538 cv = GvCVu(tmpop->op_sv);
4539 if (cv && SvPOK(cv) && !(op->op_private & OPpENTERSUB_AMPER)) {
4540 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4541 proto = SvPV((SV*)cv, na);
4545 op->op_private |= (hints & HINT_STRICT_REFS);
4546 if (PERLDB_SUB && curstash != debstash)
4547 op->op_private |= OPpENTERSUB_DB;
4552 return too_many_arguments(op, gv_ename(namegv));
4570 if (o->op_type != OP_REFGEN && o->op_type != OP_UNDEF)
4571 bad_type(arg, "block", gv_ename(namegv), o);
4576 if (o->op_type == OP_RV2GV)
4580 o = newUNOP(OP_RV2GV, 0, kid);
4581 o->op_sibling = kid->op_sibling;
4582 kid->op_sibling = 0;
4583 prev->op_sibling = o;
4591 if (o->op_type != OP_RV2GV)
4592 bad_type(arg, "symbol", gv_ename(namegv), o);
4595 if (o->op_type != OP_RV2CV)
4596 bad_type(arg, "sub", gv_ename(namegv), o);
4599 if (o->op_type != OP_RV2SV && o->op_type != OP_PADSV)
4600 bad_type(arg, "scalar", gv_ename(namegv), o);
4603 if (o->op_type != OP_RV2AV && o->op_type != OP_PADAV)
4604 bad_type(arg, "array", gv_ename(namegv), o);
4607 if (o->op_type != OP_RV2HV && o->op_type != OP_PADHV)
4608 bad_type(arg, "hash", gv_ename(namegv), o);
4612 o = newUNOP(OP_REFGEN, 0, kid);
4613 o->op_sibling = kid->op_sibling;
4614 kid->op_sibling = 0;
4615 prev->op_sibling = o;
4626 croak("Malformed prototype for %s: %s",
4627 gv_ename(namegv), SvPV((SV*)cv, na));
4632 mod(o, OP_ENTERSUB);
4636 if (proto && !optional &&
4637 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4638 return too_few_arguments(op, gv_ename(namegv));
4646 SvREADONLY_on(cSVOP->op_sv);
4654 if (op->op_flags & OPf_KIDS) {
4655 SVOP *kid = (SVOP*)cUNOP->op_first;
4657 if (kid->op_type == OP_NULL)
4658 kid = (SVOP*)kid->op_sibling;
4660 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4661 op->op_flags |= OPf_SPECIAL;
4666 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4672 register OP* oldop = 0;
4673 if (!o || o->op_seq)
4678 for (; o; o = o->op_next) {
4684 switch (o->op_type) {
4687 curcop = ((COP*)o); /* for warnings */
4688 o->op_seq = op_seqmax++;
4699 if (o->op_next->op_type == OP_STRINGIFY)
4701 o->op_seq = op_seqmax++;
4704 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4705 o->op_seq = op_seqmax++;
4706 break; /* Scalar stub must produce undef. List stub is noop */
4710 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4711 curcop = ((COP*)op);
4717 if (oldop && o->op_next) {
4718 oldop->op_next = o->op_next;
4721 o->op_seq = op_seqmax++;
4725 if (o->op_next->op_type == OP_RV2SV) {
4726 if (!(o->op_next->op_private & OPpDEREF)) {
4728 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4729 o->op_next = o->op_next->op_next;
4730 o->op_type = OP_GVSV;
4731 o->op_ppaddr = ppaddr[OP_GVSV];
4734 else if (o->op_next->op_type == OP_RV2AV) {
4735 OP* pop = o->op_next->op_next;
4737 if (pop->op_type == OP_CONST &&
4738 (op = pop->op_next) &&
4739 pop->op_next->op_type == OP_AELEM &&
4740 !(pop->op_next->op_private &
4741 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4742 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4746 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4750 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4751 o->op_next = pop->op_next->op_next;
4752 o->op_type = OP_AELEMFAST;
4753 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4754 o->op_private = (U8)i;
4755 GvAVn(((GVOP*)o)->op_gv);
4758 o->op_seq = op_seqmax++;
4765 o->op_seq = op_seqmax++;
4766 peep(cLOGOP->op_other);
4770 o->op_seq = op_seqmax++;
4771 peep(cCONDOP->op_true);
4772 peep(cCONDOP->op_false);
4776 o->op_seq = op_seqmax++;
4777 peep(cLOOP->op_redoop);
4778 peep(cLOOP->op_nextop);
4779 peep(cLOOP->op_lastop);
4784 o->op_seq = op_seqmax++;
4785 peep(cPMOP->op_pmreplstart);
4789 o->op_seq = op_seqmax++;
4790 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4791 if (o->op_next->op_sibling &&
4792 o->op_next->op_sibling->op_type != OP_DIE) {
4793 line_t oldline = curcop->cop_line;
4795 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4796 warn("Statement unlikely to be reached");
4797 warn("(Maybe you meant system() when you said exec()?)\n");
4798 curcop->cop_line = oldline;
4803 o->op_seq = op_seqmax++;