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, CvGV(cv), Nullch);
56 return SvPV(tmpsv,na);
63 sprintf(tokenbuf,"Missing comma after first argument to %s function",
64 op_desc[op->op_type]);
70 too_few_arguments(op, name)
74 sprintf(tokenbuf,"Not enough arguments for %s", name);
80 too_many_arguments(op, name)
84 sprintf(tokenbuf,"Too many arguments for %s", name);
90 bad_type(n, t, name, kid)
96 sprintf(tokenbuf, "Type of arg %d to %s must be %s (not %s)",
97 (int) n, name, t, op_desc[kid->op_type]);
106 int type = op->op_type;
107 if (type != OP_AELEM && type != OP_HELEM) {
108 sprintf(tokenbuf, "Can't use subscript on %s", op_desc[type]);
110 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV)
111 warn("(Did you mean $ or @ instead of %c?)\n",
112 type == OP_ENTERSUB ? '&' : '%');
116 /* "register" allocation */
125 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
126 if (!isPRINT(name[1]))
127 sprintf(name+1, "^%c", toCTRL(name[1])); /* XXX tokenbuf, really */
128 croak("Can't use global %s in \"my\"",name);
130 if (AvFILL(comppad_name) >= 0) {
131 SV **svp = AvARRAY(comppad_name);
132 for (off = AvFILL(comppad_name); off > comppad_name_floor; off--) {
135 && SvIVX(sv) == 999999999 /* var is in open scope */
136 && strEQ(name, SvPVX(sv)))
138 warn("\"my\" variable %s masks earlier declaration in same scope", name);
143 off = pad_alloc(OP_PADSV, SVs_PADMY);
145 sv_upgrade(sv, SVt_PVNV);
147 av_store(comppad_name, off, sv);
148 SvNVX(sv) = (double)999999999;
149 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
150 if (!min_intro_pending)
151 min_intro_pending = off;
152 max_intro_pending = off;
154 av_store(comppad, off, (SV*)newAV());
155 else if (*name == '%')
156 av_store(comppad, off, (SV*)newHV());
157 SvPADMY_on(curpad[off]);
162 #ifndef CAN_PROTOTYPE
163 pad_findlex(name, newoff, seq, startcv, cx_ix)
170 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
177 register CONTEXT *cx;
180 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
181 AV *curlist = CvPADLIST(cv);
182 SV **svp = av_fetch(curlist, 0, FALSE);
185 if (!svp || *svp == &sv_undef)
188 svp = AvARRAY(curname);
189 for (off = AvFILL(curname); off > 0; off--) {
190 if ((sv = svp[off]) &&
193 seq > I_32(SvNVX(sv)) &&
194 strEQ(SvPVX(sv), name))
205 return 0; /* don't clone from inactive stack frame */
209 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
210 oldsv = *av_fetch(oldpad, off, TRUE);
211 if (!newoff) { /* Not a mere clone operation. */
212 SV *namesv = NEWSV(1103,0);
213 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
214 sv_upgrade(namesv, SVt_PVNV);
215 sv_setpv(namesv, name);
216 av_store(comppad_name, newoff, namesv);
217 SvNVX(namesv) = (double)curcop->cop_seq;
218 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
219 SvFAKE_on(namesv); /* A ref, not a real var */
220 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
221 /* "It's closures all the way down." */
225 oldsv = Nullsv; /* no need to keep ref */
230 bcv && bcv != cv && !CvCLONE(bcv);
231 bcv = CvOUTSIDE(bcv)) {
235 if (dowarn && !CvUNIQUE(cv))
237 "Variable \"%s\" may be unavailable",
244 else if (!CvUNIQUE(compcv)) {
245 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
246 warn("Variable \"%s\" will not stay shared", name);
249 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
255 /* Nothing in current lexical context--try eval's context, if any.
256 * This is necessary to let the perldb get at lexically scoped variables.
257 * XXX This will also probably interact badly with eval tree caching.
261 for (i = cx_ix; i >= 0; i--) {
263 switch (cx->cx_type) {
265 if (i == 0 && saweval) {
266 seq = cxstack[saweval].blk_oldcop->cop_seq;
267 return pad_findlex(name, newoff, seq, main_cv, 0);
271 switch (cx->blk_eval.old_op_type) {
276 /* require must have its own scope */
284 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
285 saweval = i; /* so we know where we were called from */
288 seq = cxstack[saweval].blk_oldcop->cop_seq;
289 return pad_findlex(name, newoff, seq, cv, i-1);
303 SV **svp = AvARRAY(comppad_name);
304 U32 seq = cop_seqmax;
306 /* The one we're looking for is probably just before comppad_name_fill. */
307 for (off = AvFILL(comppad_name); off > 0; off--) {
308 if ((sv = svp[off]) &&
312 seq > I_32(SvNVX(sv)))) &&
313 strEQ(SvPVX(sv), name))
316 return (PADOFFSET)off;
317 pendoff = off; /* this pending def. will override import */
321 /* See if it's in a nested scope */
322 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
324 /* If there is a pending local definition, this new alias must die */
326 SvIVX(AvARRAY(comppad_name)[off]) = seq;
338 SV **svp = AvARRAY(comppad_name);
340 if (min_intro_pending && fill < min_intro_pending) {
341 for (off = max_intro_pending; off >= min_intro_pending; off--) {
342 if ((sv = svp[off]) && sv != &sv_undef)
343 warn("%s never introduced", SvPVX(sv));
346 /* "Deintroduce" my variables that are leaving with this scope. */
347 for (off = AvFILL(comppad_name); off > fill; off--) {
348 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
349 SvIVX(sv) = cop_seqmax;
354 pad_alloc(optype,tmptype)
361 if (AvARRAY(comppad) != curpad)
362 croak("panic: pad_alloc");
363 if (pad_reset_pending)
365 if (tmptype & SVs_PADMY) {
367 sv = *av_fetch(comppad, AvFILL(comppad) + 1, TRUE);
368 } while (SvPADBUSY(sv)); /* need a fresh one */
369 retval = AvFILL(comppad);
372 SV **names = AvARRAY(comppad_name);
373 SSize_t names_fill = AvFILL(comppad_name);
376 * "foreach" index vars temporarily become aliases to non-"my"
377 * values. Thus we must skip, not just pad values that are
378 * marked as current pad values, but also those with names.
380 if (++padix <= names_fill &&
381 (sv = names[padix]) && sv != &sv_undef)
383 sv = *av_fetch(comppad, padix, TRUE);
384 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
389 SvFLAGS(sv) |= tmptype;
390 curpad = AvARRAY(comppad);
391 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad alloc %ld for %s\n", (long) retval, op_name[optype]));
392 return (PADOFFSET)retval;
396 #ifndef CAN_PROTOTYPE
401 #endif /* CAN_PROTOTYPE */
404 croak("panic: pad_sv po");
405 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad sv %lu\n", (unsigned long)po));
406 return curpad[po]; /* eventually we'll turn this into a macro */
410 #ifndef CAN_PROTOTYPE
414 pad_free(PADOFFSET po)
415 #endif /* CAN_PROTOTYPE */
419 if (AvARRAY(comppad) != curpad)
420 croak("panic: pad_free curpad");
422 croak("panic: pad_free po");
423 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad free %lu\n", (unsigned long)po));
424 if (curpad[po] && !SvIMMORTAL(curpad[po]))
425 SvPADTMP_off(curpad[po]);
431 #ifndef CAN_PROTOTYPE
435 pad_swipe(PADOFFSET po)
436 #endif /* CAN_PROTOTYPE */
438 if (AvARRAY(comppad) != curpad)
439 croak("panic: pad_swipe curpad");
441 croak("panic: pad_swipe po");
442 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad swipe %lu\n", (unsigned long)po));
443 SvPADTMP_off(curpad[po]);
444 curpad[po] = NEWSV(1107,0);
445 SvPADTMP_on(curpad[po]);
455 if (AvARRAY(comppad) != curpad)
456 croak("panic: pad_reset curpad");
457 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad reset\n"));
458 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
459 for (po = AvMAX(comppad); po > padix_floor; po--) {
460 if (curpad[po] && !SvIMMORTAL(curpad[po]))
461 SvPADTMP_off(curpad[po]);
465 pad_reset_pending = FALSE;
474 register OP *kid, *nextkid;
476 if (!op || op->op_seq == (U16)-1)
479 if (op->op_flags & OPf_KIDS) {
480 for (kid = cUNOP->op_first; kid; kid = nextkid) {
481 nextkid = kid->op_sibling; /* Get before next freeing kid */
486 switch (op->op_type) {
488 op->op_targ = 0; /* Was holding old type, if any. */
491 op->op_targ = 0; /* Was holding hints. */
494 if (!(op->op_flags & OPf_REF) || (check[op->op_type] != ck_ftst))
500 SvREFCNT_dec(cGVOP->op_gv);
504 Safefree(cCOP->cop_label);
505 SvREFCNT_dec(cCOP->cop_filegv);
508 SvREFCNT_dec(cSVOP->op_sv);
514 if (op->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
518 Safefree(cPVOP->op_pv);
521 op_free(cPMOP->op_pmreplroot);
525 pregfree(cPMOP->op_pmregexp);
526 SvREFCNT_dec(cPMOP->op_pmshort);
531 pad_free(op->op_targ);
540 if (op->op_type != OP_NULL && op->op_targ > 0)
541 pad_free(op->op_targ);
542 op->op_targ = op->op_type;
543 op->op_type = OP_NULL;
544 op->op_ppaddr = ppaddr[OP_NULL];
547 /* Contextualizers */
549 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
560 /* establish postfix order */
561 if (cUNOP->op_first) {
562 op->op_next = LINKLIST(cUNOP->op_first);
563 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling) {
565 kid->op_next = LINKLIST(kid->op_sibling);
581 if (op && op->op_flags & OPf_KIDS) {
582 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
593 op->op_type == OP_SASSIGN && cBINOP->op_first->op_type == OP_CONST) {
594 line_t oldline = curcop->cop_line;
596 if (copline != NOLINE)
597 curcop->cop_line = copline;
598 warn("Found = in conditional, should be ==");
599 curcop->cop_line = oldline;
610 /* assumes no premature commitment */
611 if (!op || (op->op_flags & OPf_WANT) || error_count
612 || op->op_type == OP_RETURN)
615 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
617 switch (op->op_type) {
619 if (op->op_private & OPpREPEAT_DOLIST)
620 null(((LISTOP*)cBINOP->op_first)->op_first);
621 scalar(cBINOP->op_first);
626 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
630 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
631 if (!kPMOP->op_pmreplroot)
632 deprecate("implicit split to @_");
639 if (op->op_flags & OPf_KIDS) {
640 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling)
646 kid = cLISTOP->op_first;
648 while (kid = kid->op_sibling) {
659 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
679 /* assumes no premature commitment */
680 if (!op || (op->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
681 || op->op_type == OP_RETURN)
684 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
686 switch (op->op_type) {
688 if (!(opargs[op->op_type] & OA_FOLDCONST))
692 if (op->op_flags & OPf_STACKED)
763 if (!(op->op_private & OPpLVAL_INTRO))
764 useless = op_desc[op->op_type];
771 if (!(op->op_private & OPpLVAL_INTRO) &&
772 (!op->op_sibling || op->op_sibling->op_type != OP_READLINE))
773 useless = "a variable";
778 curcop = ((COP*)op); /* for warning below */
784 useless = "a constant";
785 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
787 else if (SvPOK(sv)) {
788 if (strnEQ(SvPVX(sv), "di", 2) ||
789 strnEQ(SvPVX(sv), "ds", 2) ||
790 strnEQ(SvPVX(sv), "ig", 2))
794 null(op); /* don't execute a constant */
795 SvREFCNT_dec(sv); /* don't even remember it */
799 op->op_type = OP_PREINC; /* pre-increment is faster */
800 op->op_ppaddr = ppaddr[OP_PREINC];
804 op->op_type = OP_PREDEC; /* pre-decrement is faster */
805 op->op_ppaddr = ppaddr[OP_PREDEC];
811 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
816 if (op->op_targ == OP_NEXTSTATE || op->op_targ == OP_DBSTATE)
817 curcop = ((COP*)op); /* for warning below */
818 if (op->op_flags & OPf_STACKED)
824 if (!(op->op_flags & OPf_KIDS))
833 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
837 /* since all requires must return a value, they're never void */
838 op->op_flags &= ~OPf_WANT;
841 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
842 if (!kPMOP->op_pmreplroot)
843 deprecate("implicit split to @_");
847 if (useless && dowarn)
848 warn("Useless use of %s in void context", useless);
857 if (op && op->op_flags & OPf_KIDS) {
858 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
870 /* assumes no premature commitment */
871 if (!op || (op->op_flags & OPf_WANT) || error_count
872 || op->op_type == OP_RETURN)
875 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
877 switch (op->op_type) {
880 list(cBINOP->op_first);
885 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
892 if (!(op->op_flags & OPf_KIDS))
894 if (!op->op_next && cUNOP->op_first->op_type == OP_FLOP) {
895 list(cBINOP->op_first);
896 return gen_constant_list(op);
903 kid = cLISTOP->op_first;
905 while (kid = kid->op_sibling) {
915 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
934 if (op->op_type == OP_LINESEQ ||
935 op->op_type == OP_SCOPE ||
936 op->op_type == OP_LEAVE ||
937 op->op_type == OP_LEAVETRY)
939 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
940 if (kid->op_sibling) {
946 op->op_flags &= ~OPf_PARENS;
947 if (hints & HINT_BLOCK_SCOPE)
948 op->op_flags |= OPf_PARENS;
951 op = newOP(OP_STUB, 0);
961 if (op && op->op_flags & OPf_KIDS) {
962 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
978 if (!op || error_count)
981 switch (op->op_type) {
985 if (!(op->op_private & (OPpCONST_ARYBASE)))
987 if (eval_start && eval_start->op_type == OP_CONST) {
988 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
992 SAVEI32(compiling.cop_arybase);
993 compiling.cop_arybase = 0;
995 else if (type == OP_REFGEN)
998 croak("That use of $[ is unsupported");
1001 if (op->op_flags & OPf_PARENS)
1005 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1006 !(op->op_flags & OPf_STACKED)) {
1007 op->op_type = OP_RV2CV; /* entersub => rv2cv */
1008 op->op_ppaddr = ppaddr[OP_RV2CV];
1009 assert(cUNOP->op_first->op_type == OP_NULL);
1010 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
1016 /* grep, foreach, subcalls, refgen */
1017 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1019 sprintf(tokenbuf, "Can't modify %s in %s",
1020 op_desc[op->op_type],
1021 type ? op_desc[type] : "local");
1036 case OP_RIGHT_SHIFT:
1045 if (!(op->op_flags & OPf_STACKED))
1051 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
1057 if (type == OP_REFGEN && op->op_flags & OPf_PARENS) {
1059 return op; /* Treat \(@foo) like ordinary list. */
1063 if (scalar_mod_type(op, type))
1065 ref(cUNOP->op_first, op->op_type);
1077 if (!type && cUNOP->op_first->op_type != OP_GV)
1078 croak("Can't localize a reference");
1079 ref(cUNOP->op_first, op->op_type);
1091 if (type == OP_REFGEN && op->op_flags & OPf_PARENS)
1092 return op; /* Treat \(@foo) like ordinary list. */
1093 if (scalar_mod_type(op, type))
1099 croak("Can't localize lexical variable %s",
1100 SvPV(*av_fetch(comppad_name, op->op_targ, 4), na));
1107 if (type != OP_SASSIGN)
1113 pad_free(op->op_targ);
1114 op->op_targ = pad_alloc(op->op_type, SVs_PADMY);
1115 assert(SvTYPE(PAD_SV(op->op_targ)) == SVt_NULL);
1116 if (op->op_flags & OPf_KIDS)
1117 mod(cBINOP->op_first->op_sibling, type);
1122 ref(cBINOP->op_first, op->op_type);
1123 if (type == OP_ENTERSUB &&
1124 !(op->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1125 op->op_private |= OPpLVAL_DEFER;
1132 if (op->op_flags & OPf_KIDS)
1133 mod(cLISTOP->op_last, type);
1137 if (!(op->op_flags & OPf_KIDS))
1139 if (op->op_targ != OP_LIST) {
1140 mod(cBINOP->op_first, type);
1145 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1149 op->op_flags |= OPf_MOD;
1151 if (type == OP_AASSIGN || type == OP_SASSIGN)
1152 op->op_flags |= OPf_SPECIAL|OPf_REF;
1154 op->op_private |= OPpLVAL_INTRO;
1155 op->op_flags &= ~OPf_SPECIAL;
1157 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1158 op->op_flags |= OPf_REF;
1163 scalar_mod_type(op, type)
1169 if (op->op_type == OP_RV2GV)
1193 case OP_RIGHT_SHIFT:
1200 case OP_ANDASSIGN: /* may work later */
1201 case OP_ORASSIGN: /* may work later */
1214 if (op && op->op_flags & OPf_KIDS) {
1215 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1228 if (!op || error_count)
1231 switch (op->op_type) {
1233 if ((type == OP_DEFINED) &&
1234 !(op->op_flags & OPf_STACKED)) {
1235 op->op_type = OP_RV2CV; /* entersub => rv2cv */
1236 op->op_ppaddr = ppaddr[OP_RV2CV];
1237 assert(cUNOP->op_first->op_type == OP_NULL);
1238 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
1239 op->op_flags |= OPf_SPECIAL;
1244 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
1248 ref(cUNOP->op_first, op->op_type);
1251 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1252 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1253 : type == OP_RV2HV ? OPpDEREF_HV
1255 op->op_flags |= OPf_MOD;
1261 op->op_flags |= OPf_REF;
1264 ref(cUNOP->op_first, op->op_type);
1269 op->op_flags |= OPf_REF;
1274 if (!(op->op_flags & OPf_KIDS))
1276 ref(cBINOP->op_first, type);
1280 ref(cBINOP->op_first, op->op_type);
1281 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1282 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1283 : type == OP_RV2HV ? OPpDEREF_HV
1285 op->op_flags |= OPf_MOD;
1293 if (!(op->op_flags & OPf_KIDS))
1295 ref(cLISTOP->op_last, type);
1311 if (!op || error_count)
1315 if (type == OP_LIST) {
1316 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1319 else if (type != OP_PADSV &&
1322 type != OP_PUSHMARK)
1324 sprintf(tokenbuf, "Can't declare %s in my", op_desc[op->op_type]);
1328 op->op_flags |= OPf_MOD;
1329 op->op_private |= OPpLVAL_INTRO;
1338 o->op_flags |= OPf_PARENS;
1343 bind_match(type, left, right)
1351 (left->op_type == OP_RV2AV ||
1352 left->op_type == OP_RV2HV ||
1353 left->op_type == OP_PADAV ||
1354 left->op_type == OP_PADHV)) {
1355 char *desc = op_desc[(right->op_type == OP_SUBST ||
1356 right->op_type == OP_TRANS)
1357 ? right->op_type : OP_MATCH];
1358 char *sample = ((left->op_type == OP_RV2AV ||
1359 left->op_type == OP_PADAV)
1360 ? "@array" : "%hash");
1361 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1364 if (right->op_type == OP_MATCH ||
1365 right->op_type == OP_SUBST ||
1366 right->op_type == OP_TRANS) {
1367 right->op_flags |= OPf_STACKED;
1368 if (right->op_type != OP_MATCH)
1369 left = mod(left, right->op_type);
1370 if (right->op_type == OP_TRANS)
1371 op = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1373 op = prepend_elem(right->op_type, scalar(left), right);
1375 return newUNOP(OP_NOT, 0, scalar(op));
1379 return bind_match(type, left,
1380 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1389 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1390 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(op));
1398 if (o->op_flags & OPf_PARENS || perldb || tainting) {
1399 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1400 o->op_type = OP_LEAVE;
1401 o->op_ppaddr = ppaddr[OP_LEAVE];
1404 if (o->op_type == OP_LINESEQ) {
1406 o->op_type = OP_SCOPE;
1407 o->op_ppaddr = ppaddr[OP_SCOPE];
1408 kid = ((LISTOP*)o)->op_first;
1409 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1410 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1415 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1425 int retval = savestack_ix;
1426 SAVEI32(comppad_name_floor);
1428 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1429 comppad_name_floor = comppad_name_fill;
1431 comppad_name_floor = 0;
1433 SAVEI32(min_intro_pending);
1434 SAVEI32(max_intro_pending);
1435 min_intro_pending = 0;
1436 SAVEI32(comppad_name_fill);
1437 SAVEI32(padix_floor);
1438 padix_floor = padix;
1439 pad_reset_pending = FALSE;
1441 hints &= ~HINT_BLOCK_SCOPE;
1446 block_end(floor, seq)
1450 int needblockscope = hints & HINT_BLOCK_SCOPE;
1451 OP* retval = scalarseq(seq);
1453 pad_reset_pending = FALSE;
1455 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1456 pad_leavemy(comppad_name_fill);
1466 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), op);
1467 eval_start = linklist(eval_root);
1468 eval_root->op_next = 0;
1474 main_root = scope(sawparens(scalarvoid(op)));
1475 curcop = &compiling;
1476 main_start = LINKLIST(main_root);
1477 main_root->op_next = 0;
1481 /* Register with debugger */
1483 CV *cv = perl_get_cv("DB::postponed", FALSE);
1487 XPUSHs((SV*)compiling.cop_filegv);
1489 perl_call_sv((SV*)cv, G_DISCARD);
1500 if (o->op_flags & OPf_PARENS)
1504 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1506 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1507 if (*s == ';' || *s == '=')
1508 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1515 return mod(o, OP_NULL); /* a bit kludgey */
1522 if (o->op_type == OP_LIST) {
1523 o = convert(OP_JOIN, 0,
1524 prepend_elem(OP_LIST,
1525 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1536 I32 type = o->op_type;
1539 if (opargs[type] & OA_RETSCALAR)
1541 if (opargs[type] & OA_TARGET)
1542 o->op_targ = pad_alloc(type, SVs_PADTMP);
1544 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1545 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1547 if (!(opargs[type] & OA_FOLDCONST))
1551 goto nope; /* Don't try to run w/ errors */
1553 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1554 if (curop->op_type != OP_CONST &&
1555 curop->op_type != OP_LIST &&
1556 curop->op_type != OP_SCALAR &&
1557 curop->op_type != OP_NULL &&
1558 curop->op_type != OP_PUSHMARK) {
1563 curop = LINKLIST(o);
1568 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1569 pad_swipe(o->op_targ);
1570 else if (SvTEMP(sv)) { /* grab mortal temp? */
1571 (void)SvREFCNT_inc(sv);
1575 if (type == OP_RV2GV)
1576 return newGVOP(OP_GV, 0, (GV*)sv);
1578 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1580 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1585 SvIOK_off(sv); /* undo SvIV() damage */
1587 return newSVOP(OP_CONST, 0, sv);
1591 if (!(opargs[type] & OA_OTHERINT))
1594 if (!(hints & HINT_INTEGER)) {
1595 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1598 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1599 if (curop->op_type == OP_CONST) {
1600 if (SvIOK(((SVOP*)curop)->op_sv))
1604 if (opargs[curop->op_type] & OA_RETINTEGER)
1608 o->op_ppaddr = ppaddr[++(o->op_type)];
1615 gen_constant_list(o)
1619 I32 oldtmps_floor = tmps_floor;
1623 return o; /* Don't attempt to run with errors */
1625 op = curop = LINKLIST(o);
1631 tmps_floor = oldtmps_floor;
1633 o->op_type = OP_RV2AV;
1634 o->op_ppaddr = ppaddr[OP_RV2AV];
1635 curop = ((UNOP*)o)->op_first;
1636 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1643 convert(type, flags, op)
1651 if (!op || op->op_type != OP_LIST)
1652 op = newLISTOP(OP_LIST, 0, op, Nullop);
1654 op->op_flags &= ~OPf_WANT;
1656 if (!(opargs[type] & OA_MARK))
1657 null(cLISTOP->op_first);
1660 op->op_ppaddr = ppaddr[type];
1661 op->op_flags |= flags;
1663 op = CHECKOP(type, op);
1664 if (op->op_type != type)
1667 if (cLISTOP->op_children < 7) {
1668 /* XXX do we really need to do this if we're done appending?? */
1669 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1671 cLISTOP->op_last = last; /* in case check substituted last arg */
1674 return fold_constants(op);
1677 /* List constructors */
1680 append_elem(type, first, last)
1691 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1692 return newLISTOP(type, 0, first, last);
1694 if (first->op_flags & OPf_KIDS)
1695 ((LISTOP*)first)->op_last->op_sibling = last;
1697 first->op_flags |= OPf_KIDS;
1698 ((LISTOP*)first)->op_first = last;
1700 ((LISTOP*)first)->op_last = last;
1701 ((LISTOP*)first)->op_children++;
1706 append_list(type, first, last)
1717 if (first->op_type != type)
1718 return prepend_elem(type, (OP*)first, (OP*)last);
1720 if (last->op_type != type)
1721 return append_elem(type, (OP*)first, (OP*)last);
1723 first->op_last->op_sibling = last->op_first;
1724 first->op_last = last->op_last;
1725 first->op_children += last->op_children;
1726 if (first->op_children)
1727 last->op_flags |= OPf_KIDS;
1734 prepend_elem(type, first, last)
1745 if (last->op_type == type) {
1746 if (type == OP_LIST) { /* already a PUSHMARK there */
1747 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1748 ((LISTOP*)last)->op_first->op_sibling = first;
1751 if (!(last->op_flags & OPf_KIDS)) {
1752 ((LISTOP*)last)->op_last = first;
1753 last->op_flags |= OPf_KIDS;
1755 first->op_sibling = ((LISTOP*)last)->op_first;
1756 ((LISTOP*)last)->op_first = first;
1758 ((LISTOP*)last)->op_children++;
1762 return newLISTOP(type, 0, first, last);
1770 return newOP(OP_STUB, 0);
1777 if (!op || op->op_type != OP_LIST)
1778 op = newLISTOP(OP_LIST, 0, op, Nullop);
1784 newLISTOP(type, flags, first, last)
1792 Newz(1101, listop, 1, LISTOP);
1794 listop->op_type = type;
1795 listop->op_ppaddr = ppaddr[type];
1796 listop->op_children = (first != 0) + (last != 0);
1797 listop->op_flags = flags;
1801 else if (!first && last)
1804 first->op_sibling = last;
1805 listop->op_first = first;
1806 listop->op_last = last;
1807 if (type == OP_LIST) {
1809 pushop = newOP(OP_PUSHMARK, 0);
1810 pushop->op_sibling = first;
1811 listop->op_first = pushop;
1812 listop->op_flags |= OPf_KIDS;
1814 listop->op_last = pushop;
1816 else if (listop->op_children)
1817 listop->op_flags |= OPf_KIDS;
1828 Newz(1101, op, 1, OP);
1830 op->op_ppaddr = ppaddr[type];
1831 op->op_flags = flags;
1834 op->op_private = 0 + (flags >> 8);
1835 if (opargs[type] & OA_RETSCALAR)
1837 if (opargs[type] & OA_TARGET)
1838 op->op_targ = pad_alloc(type, SVs_PADTMP);
1839 return CHECKOP(type, op);
1843 newUNOP(type, flags, first)
1851 first = newOP(OP_STUB, 0);
1852 if (opargs[type] & OA_MARK)
1853 first = force_list(first);
1855 Newz(1101, unop, 1, UNOP);
1856 unop->op_type = type;
1857 unop->op_ppaddr = ppaddr[type];
1858 unop->op_first = first;
1859 unop->op_flags = flags | OPf_KIDS;
1860 unop->op_private = 1 | (flags >> 8);
1862 unop = (UNOP*) CHECKOP(type, unop);
1866 return fold_constants((OP *) unop);
1870 newBINOP(type, flags, first, last)
1877 Newz(1101, binop, 1, BINOP);
1880 first = newOP(OP_NULL, 0);
1882 binop->op_type = type;
1883 binop->op_ppaddr = ppaddr[type];
1884 binop->op_first = first;
1885 binop->op_flags = flags | OPf_KIDS;
1888 binop->op_private = 1 | (flags >> 8);
1891 binop->op_private = 2 | (flags >> 8);
1892 first->op_sibling = last;
1895 binop = (BINOP*)CHECKOP(type, binop);
1899 binop->op_last = last = binop->op_first->op_sibling;
1901 return fold_constants((OP *)binop);
1905 pmtrans(op, expr, repl)
1910 SV *tstr = ((SVOP*)expr)->op_sv;
1911 SV *rstr = ((SVOP*)repl)->op_sv;
1914 register U8 *t = (U8*)SvPV(tstr, tlen);
1915 register U8 *r = (U8*)SvPV(rstr, rlen);
1920 register short *tbl;
1922 tbl = (short*)cPVOP->op_pv;
1923 complement = op->op_private & OPpTRANS_COMPLEMENT;
1924 delete = op->op_private & OPpTRANS_DELETE;
1925 /* squash = op->op_private & OPpTRANS_SQUASH; */
1928 Zero(tbl, 256, short);
1929 for (i = 0; i < tlen; i++)
1931 for (i = 0, j = 0; i < 256; i++) {
1947 if (!rlen && !delete) {
1950 for (i = 0; i < 256; i++)
1952 for (i = 0, j = 0; i < tlen; i++,j++) {
1955 if (tbl[t[i]] == -1)
1961 if (tbl[t[i]] == -1)
1972 newPMOP(type, flags)
1978 Newz(1101, pmop, 1, PMOP);
1979 pmop->op_type = type;
1980 pmop->op_ppaddr = ppaddr[type];
1981 pmop->op_flags = flags;
1982 pmop->op_private = 0 | (flags >> 8);
1984 if (hints & HINT_LOCALE)
1985 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
1987 /* link into pm list */
1988 if (type != OP_TRANS && curstash) {
1989 pmop->op_pmnext = HvPMROOT(curstash);
1990 HvPMROOT(curstash) = pmop;
1997 pmruntime(op, expr, repl)
2005 if (op->op_type == OP_TRANS)
2006 return pmtrans(op, expr, repl);
2010 if (expr->op_type == OP_CONST) {
2012 SV *pat = ((SVOP*)expr)->op_sv;
2013 char *p = SvPV(pat, plen);
2014 if ((op->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2015 sv_setpvn(pat, "\\s+", 3);
2016 p = SvPV(pat, plen);
2017 pm->op_pmflags |= PMf_SKIPWHITE;
2019 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2020 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2021 pm->op_pmflags |= PMf_WHITE;
2026 if (pm->op_pmflags & PMf_KEEP)
2027 expr = newUNOP(OP_REGCMAYBE,0,expr);
2029 Newz(1101, rcop, 1, LOGOP);
2030 rcop->op_type = OP_REGCOMP;
2031 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2032 rcop->op_first = scalar(expr);
2033 rcop->op_flags |= OPf_KIDS;
2034 rcop->op_private = 1;
2035 rcop->op_other = op;
2037 /* establish postfix order */
2038 if (pm->op_pmflags & PMf_KEEP) {
2040 rcop->op_next = expr;
2041 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2044 rcop->op_next = LINKLIST(expr);
2045 expr->op_next = (OP*)rcop;
2048 prepend_elem(op->op_type, scalar((OP*)rcop), op);
2053 if (pm->op_pmflags & PMf_EVAL)
2055 else if (repl->op_type == OP_CONST)
2059 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2060 if (opargs[curop->op_type] & OA_DANGEROUS) {
2061 if (curop->op_type == OP_GV) {
2062 GV *gv = ((GVOP*)curop)->op_gv;
2063 if (strchr("&`'123456789+", *GvENAME(gv)))
2066 else if (curop->op_type == OP_RV2CV)
2068 else if (curop->op_type == OP_RV2SV ||
2069 curop->op_type == OP_RV2AV ||
2070 curop->op_type == OP_RV2HV ||
2071 curop->op_type == OP_RV2GV) {
2072 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2075 else if (curop->op_type == OP_PADSV ||
2076 curop->op_type == OP_PADAV ||
2077 curop->op_type == OP_PADHV ||
2078 curop->op_type == OP_PADANY) {
2087 if (curop == repl) {
2088 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2089 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2090 prepend_elem(op->op_type, scalar(repl), op);
2093 Newz(1101, rcop, 1, LOGOP);
2094 rcop->op_type = OP_SUBSTCONT;
2095 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2096 rcop->op_first = scalar(repl);
2097 rcop->op_flags |= OPf_KIDS;
2098 rcop->op_private = 1;
2099 rcop->op_other = op;
2101 /* establish postfix order */
2102 rcop->op_next = LINKLIST(repl);
2103 repl->op_next = (OP*)rcop;
2105 pm->op_pmreplroot = scalar((OP*)rcop);
2106 pm->op_pmreplstart = LINKLIST(rcop);
2115 newSVOP(type, flags, sv)
2121 Newz(1101, svop, 1, SVOP);
2122 svop->op_type = type;
2123 svop->op_ppaddr = ppaddr[type];
2125 svop->op_next = (OP*)svop;
2126 svop->op_flags = flags;
2127 if (opargs[type] & OA_RETSCALAR)
2129 if (opargs[type] & OA_TARGET)
2130 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2131 return CHECKOP(type, svop);
2135 newGVOP(type, flags, gv)
2141 Newz(1101, gvop, 1, GVOP);
2142 gvop->op_type = type;
2143 gvop->op_ppaddr = ppaddr[type];
2144 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2145 gvop->op_next = (OP*)gvop;
2146 gvop->op_flags = flags;
2147 if (opargs[type] & OA_RETSCALAR)
2149 if (opargs[type] & OA_TARGET)
2150 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2151 return CHECKOP(type, gvop);
2155 newPVOP(type, flags, pv)
2161 Newz(1101, pvop, 1, PVOP);
2162 pvop->op_type = type;
2163 pvop->op_ppaddr = ppaddr[type];
2165 pvop->op_next = (OP*)pvop;
2166 pvop->op_flags = flags;
2167 if (opargs[type] & OA_RETSCALAR)
2169 if (opargs[type] & OA_TARGET)
2170 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2171 return CHECKOP(type, pvop);
2180 save_hptr(&curstash);
2181 save_item(curstname);
2186 name = SvPV(sv, len);
2187 curstash = gv_stashpvn(name,len,TRUE);
2188 sv_setpvn(curstname, name, len);
2192 sv_setpv(curstname,"<none>");
2200 utilize(aver, floor, version, id, arg)
2213 if (id->op_type != OP_CONST)
2214 croak("Module name must be constant");
2218 if(version != Nullop) {
2219 SV *vesv = ((SVOP*)version)->op_sv;
2221 if (arg == Nullop && !SvNIOK(vesv)) {
2228 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2229 croak("Version number must be constant number");
2231 /* Make copy of id so we don't free it twice */
2232 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2234 /* Fake up a method call to VERSION */
2235 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2236 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2237 append_elem(OP_LIST,
2238 prepend_elem(OP_LIST, pack, list(version)),
2239 newUNOP(OP_METHOD, 0, meth)));
2243 /* Fake up an import/unimport */
2244 if (arg && arg->op_type == OP_STUB)
2245 imop = arg; /* no import on explicit () */
2246 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2247 imop = Nullop; /* use 5.0; */
2250 /* Make copy of id so we don't free it twice */
2251 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2252 meth = newSVOP(OP_CONST, 0,
2254 ? newSVpv("import", 6)
2255 : newSVpv("unimport", 8)
2257 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2258 append_elem(OP_LIST,
2259 prepend_elem(OP_LIST, pack, list(arg)),
2260 newUNOP(OP_METHOD, 0, meth)));
2263 /* Fake up a require */
2264 rqop = newUNOP(OP_REQUIRE, 0, id);
2266 /* Fake up the BEGIN {}, which does its thing immediately. */
2268 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2270 append_elem(OP_LINESEQ,
2271 append_elem(OP_LINESEQ,
2272 newSTATEOP(0, Nullch, rqop),
2273 newSTATEOP(0, Nullch, veop)),
2274 newSTATEOP(0, Nullch, imop) ));
2281 newSLICEOP(flags, subscript, listval)
2286 return newBINOP(OP_LSLICE, flags,
2287 list(force_list(subscript)),
2288 list(force_list(listval)) );
2298 if (op->op_type == OP_NULL && op->op_flags & OPf_KIDS)
2299 op = cUNOP->op_first;
2301 if (op->op_type == OP_COND_EXPR) {
2302 I32 t = list_assignment(cCONDOP->op_first->op_sibling);
2303 I32 f = list_assignment(cCONDOP->op_first->op_sibling->op_sibling);
2308 yyerror("Assignment to both a list and a scalar");
2312 if (op->op_type == OP_LIST || op->op_flags & OPf_PARENS ||
2313 op->op_type == OP_RV2AV || op->op_type == OP_RV2HV ||
2314 op->op_type == OP_ASLICE || op->op_type == OP_HSLICE)
2317 if (op->op_type == OP_PADAV || op->op_type == OP_PADHV)
2320 if (op->op_type == OP_RV2SV)
2327 newASSIGNOP(flags, left, optype, right)
2336 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2337 return newLOGOP(optype, 0,
2338 mod(scalar(left), optype),
2339 newUNOP(OP_SASSIGN, 0, scalar(right)));
2342 return newBINOP(optype, OPf_STACKED,
2343 mod(scalar(left), optype), scalar(right));
2347 if (list_assignment(left)) {
2349 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2350 left = mod(left, OP_AASSIGN);
2358 op = newBINOP(OP_AASSIGN, flags,
2359 list(force_list(right)),
2360 list(force_list(left)) );
2361 op->op_private = 0 | (flags >> 8);
2362 if (!(left->op_private & OPpLVAL_INTRO)) {
2363 static int generation = 100;
2367 for (curop = LINKLIST(op); curop != op; curop = LINKLIST(curop)) {
2368 if (opargs[curop->op_type] & OA_DANGEROUS) {
2369 if (curop->op_type == OP_GV) {
2370 GV *gv = ((GVOP*)curop)->op_gv;
2371 if (gv == defgv || SvCUR(gv) == generation)
2373 SvCUR(gv) = generation;
2375 else if (curop->op_type == OP_PADSV ||
2376 curop->op_type == OP_PADAV ||
2377 curop->op_type == OP_PADHV ||
2378 curop->op_type == OP_PADANY) {
2379 SV **svp = AvARRAY(comppad_name);
2380 SV *sv = svp[curop->op_targ];
2381 if (SvCUR(sv) == generation)
2383 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2385 else if (curop->op_type == OP_RV2CV)
2387 else if (curop->op_type == OP_RV2SV ||
2388 curop->op_type == OP_RV2AV ||
2389 curop->op_type == OP_RV2HV ||
2390 curop->op_type == OP_RV2GV) {
2391 if (lastop->op_type != OP_GV) /* funny deref? */
2400 op->op_private = OPpASSIGN_COMMON;
2402 if (right && right->op_type == OP_SPLIT) {
2404 if ((tmpop = ((LISTOP*)right)->op_first) &&
2405 tmpop->op_type == OP_PUSHRE)
2407 PMOP *pm = (PMOP*)tmpop;
2408 if (left->op_type == OP_RV2AV &&
2409 !(left->op_private & OPpLVAL_INTRO) &&
2410 !(op->op_private & OPpASSIGN_COMMON) )
2412 tmpop = ((UNOP*)left)->op_first;
2413 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2414 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2415 pm->op_pmflags |= PMf_ONCE;
2416 tmpop = ((UNOP*)op)->op_first; /* to list (nulled) */
2417 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2418 tmpop->op_sibling = Nullop; /* don't free split */
2419 right->op_next = tmpop->op_next; /* fix starting loc */
2420 op_free(op); /* blow off assign */
2421 right->op_flags &= ~OPf_WANT;
2422 /* "I don't know and I don't care." */
2427 if (modcount < 10000 &&
2428 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2430 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2432 sv_setiv(sv, modcount+1);
2440 right = newOP(OP_UNDEF, 0);
2441 if (right->op_type == OP_READLINE) {
2442 right->op_flags |= OPf_STACKED;
2443 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2446 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2447 op = newBINOP(OP_SASSIGN, flags,
2448 scalar(right), mod(scalar(left), OP_SASSIGN) );
2460 newSTATEOP(flags, label, op)
2465 U32 seq = intro_my();
2468 Newz(1101, cop, 1, COP);
2469 if (perldb && curcop->cop_line && curstash != debstash) {
2470 cop->op_type = OP_DBSTATE;
2471 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2474 cop->op_type = OP_NEXTSTATE;
2475 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2477 cop->op_flags = flags;
2478 cop->op_private = 0 | (flags >> 8);
2480 cop->op_private |= NATIVE_HINTS;
2482 cop->op_next = (OP*)cop;
2485 cop->cop_label = label;
2486 hints |= HINT_BLOCK_SCOPE;
2489 cop->cop_arybase = curcop->cop_arybase;
2491 if (copline == NOLINE)
2492 cop->cop_line = curcop->cop_line;
2494 cop->cop_line = copline;
2497 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2498 cop->cop_stash = curstash;
2500 if (perldb && curstash != debstash) {
2501 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2502 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2503 (void)SvIOK_on(*svp);
2505 SvSTASH(*svp) = (HV*)cop;
2509 return prepend_elem(OP_LINESEQ, (OP*)cop, op);
2512 /* "Introduce" my variables to visible status. */
2520 if (! min_intro_pending)
2523 svp = AvARRAY(comppad_name);
2524 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2525 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2526 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2527 SvNVX(sv) = (double)cop_seqmax;
2530 min_intro_pending = 0;
2531 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2532 return cop_seqmax++;
2536 newLOGOP(type, flags, first, other)
2545 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2546 return newBINOP(type, flags, scalar(first), scalar(other));
2548 scalarboolean(first);
2549 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2550 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2551 if (type == OP_AND || type == OP_OR) {
2557 first = cUNOP->op_first;
2559 first->op_next = op->op_next;
2560 cUNOP->op_first = Nullop;
2564 if (first->op_type == OP_CONST) {
2565 if (dowarn && (first->op_private & OPpCONST_BARE))
2566 warn("Probable precedence problem on %s", op_desc[type]);
2567 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2576 else if (first->op_type == OP_WANTARRAY) {
2582 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2583 OP *k1 = ((UNOP*)first)->op_first;
2584 OP *k2 = k1->op_sibling;
2586 switch (first->op_type)
2589 if (k2 && k2->op_type == OP_READLINE
2590 && (k2->op_flags & OPf_STACKED)
2591 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2592 warnop = k2->op_type;
2596 if (k1->op_type == OP_READDIR
2597 || k1->op_type == OP_GLOB
2598 || k1->op_type == OP_EACH)
2599 warnop = k1->op_type;
2603 line_t oldline = curcop->cop_line;
2604 curcop->cop_line = copline;
2605 warn("Value of %s%s can be \"0\"; test with defined()",
2607 ((warnop == OP_READLINE || warnop == OP_GLOB)
2608 ? " construct" : "() operator"));
2609 curcop->cop_line = oldline;
2616 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2617 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2619 Newz(1101, logop, 1, LOGOP);
2621 logop->op_type = type;
2622 logop->op_ppaddr = ppaddr[type];
2623 logop->op_first = first;
2624 logop->op_flags = flags | OPf_KIDS;
2625 logop->op_other = LINKLIST(other);
2626 logop->op_private = 1 | (flags >> 8);
2628 /* establish postfix order */
2629 logop->op_next = LINKLIST(first);
2630 first->op_next = (OP*)logop;
2631 first->op_sibling = other;
2633 op = newUNOP(OP_NULL, 0, (OP*)logop);
2634 other->op_next = op;
2640 newCONDOP(flags, first, trueop, falseop)
2650 return newLOGOP(OP_AND, 0, first, trueop);
2652 return newLOGOP(OP_OR, 0, first, falseop);
2654 scalarboolean(first);
2655 if (first->op_type == OP_CONST) {
2656 if (SvTRUE(((SVOP*)first)->op_sv)) {
2667 else if (first->op_type == OP_WANTARRAY) {
2671 Newz(1101, condop, 1, CONDOP);
2673 condop->op_type = OP_COND_EXPR;
2674 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2675 condop->op_first = first;
2676 condop->op_flags = flags | OPf_KIDS;
2677 condop->op_true = LINKLIST(trueop);
2678 condop->op_false = LINKLIST(falseop);
2679 condop->op_private = 1 | (flags >> 8);
2681 /* establish postfix order */
2682 condop->op_next = LINKLIST(first);
2683 first->op_next = (OP*)condop;
2685 first->op_sibling = trueop;
2686 trueop->op_sibling = falseop;
2687 op = newUNOP(OP_NULL, 0, (OP*)condop);
2689 trueop->op_next = op;
2690 falseop->op_next = op;
2696 newRANGE(flags, left, right)
2706 Newz(1101, condop, 1, CONDOP);
2708 condop->op_type = OP_RANGE;
2709 condop->op_ppaddr = ppaddr[OP_RANGE];
2710 condop->op_first = left;
2711 condop->op_flags = OPf_KIDS;
2712 condop->op_true = LINKLIST(left);
2713 condop->op_false = LINKLIST(right);
2714 condop->op_private = 1 | (flags >> 8);
2716 left->op_sibling = right;
2718 condop->op_next = (OP*)condop;
2719 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2720 flop = newUNOP(OP_FLOP, 0, flip);
2721 op = newUNOP(OP_NULL, 0, flop);
2724 left->op_next = flip;
2725 right->op_next = flop;
2727 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2728 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2729 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2730 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2732 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2733 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2736 if (!flip->op_private || !flop->op_private)
2737 linklist(op); /* blow off optimizer unless constant */
2743 newLOOPOP(flags, debuggable, expr, block)
2751 int once = block && block->op_flags & OPf_SPECIAL &&
2752 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2755 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2756 return block; /* do {} while 0 does once */
2757 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB) {
2758 expr = newUNOP(OP_DEFINED, 0,
2759 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2763 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2764 op = newLOGOP(OP_AND, 0, expr, listop);
2766 ((LISTOP*)listop)->op_last->op_next = LINKLIST(op);
2768 if (once && op != listop)
2769 op->op_next = ((LOGOP*)cUNOP->op_first)->op_other;
2772 op = newUNOP(OP_NULL, 0, op); /* or do {} while 1 loses outer block */
2774 op->op_flags |= flags;
2776 op->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2781 newWHILEOP(flags, debuggable, loop, expr, block, cont)
2795 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB)) {
2796 expr = newUNOP(OP_DEFINED, 0,
2797 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2801 block = newOP(OP_NULL, 0);
2804 next = LINKLIST(cont);
2806 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2808 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2809 redo = LINKLIST(listop);
2812 op = newLOGOP(OP_AND, 0, expr, scalar(listop));
2813 if (op == expr && op->op_type == OP_CONST && !SvTRUE(cSVOP->op_sv)) {
2814 op_free(expr); /* oops, it's a while (0) */
2816 return Nullop; /* (listop already freed by newLOGOP) */
2818 ((LISTOP*)listop)->op_last->op_next = condop =
2819 (op == listop ? redo : LINKLIST(op));
2827 Newz(1101,loop,1,LOOP);
2828 loop->op_type = OP_ENTERLOOP;
2829 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2830 loop->op_private = 0;
2831 loop->op_next = (OP*)loop;
2834 op = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, op);
2836 loop->op_redoop = redo;
2837 loop->op_lastop = op;
2840 loop->op_nextop = next;
2842 loop->op_nextop = op;
2844 op->op_flags |= flags;
2845 op->op_private |= (flags >> 8);
2850 #ifndef CAN_PROTOTYPE
2851 newFOROP(flags,label,forline,sv,expr,block,cont)
2860 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2861 #endif /* CAN_PROTOTYPE */
2869 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2870 sv->op_type = OP_RV2GV;
2871 sv->op_ppaddr = ppaddr[OP_RV2GV];
2873 else if (sv->op_type == OP_PADSV) { /* private variable */
2874 padoff = sv->op_targ;
2879 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2882 sv = newGVOP(OP_GV, 0, defgv);
2884 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2885 expr = scalar(ref(expr, OP_ITER));
2886 iterflags |= OPf_STACKED;
2888 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2889 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2891 assert(!loop->op_next);
2892 Renew(loop, 1, LOOP);
2893 loop->op_targ = padoff;
2894 return newSTATEOP(0, label, newWHILEOP(flags, 1, loop,
2895 newOP(OP_ITER, 0), block, cont));
2899 newLOOPEX(type, label)
2904 if (type != OP_GOTO || label->op_type == OP_CONST) {
2905 op = newPVOP(type, 0, savepv(
2906 label->op_type == OP_CONST
2907 ? SvPVx(((SVOP*)label)->op_sv, na)
2912 if (label->op_type == OP_ENTERSUB)
2913 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2914 op = newUNOP(type, OPf_STACKED, label);
2916 hints |= HINT_BLOCK_SCOPE;
2924 if (!CvXSUB(cv) && CvROOT(cv)) {
2926 croak("Can't undef active subroutine");
2933 op_free(CvROOT(cv));
2934 CvROOT(cv) = Nullop;
2938 SvREFCNT_dec(CvGV(cv));
2940 SvREFCNT_dec(CvOUTSIDE(cv));
2941 CvOUTSIDE(cv) = Nullcv;
2942 if (CvPADLIST(cv)) {
2943 /* may be during global destruction */
2944 if (SvREFCNT(CvPADLIST(cv))) {
2945 I32 i = AvFILL(CvPADLIST(cv));
2947 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
2951 SvREFCNT_dec((SV*)CvPADLIST(cv));
2953 CvPADLIST(cv) = Nullav;
2957 #ifdef DEBUG_CLOSURES
2962 CV *outside = CvOUTSIDE(cv);
2963 AV* padlist = CvPADLIST(cv);
2970 PerlIO_printf(Perl_debug_log, "\tCV=0x%p (%s), OUTSIDE=0x%p (%s)\n",
2972 (CvANON(cv) ? "ANON"
2973 : (cv == main_cv) ? "MAIN"
2974 : CvUNIQUE(outside) ? "UNIQUE"
2975 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
2978 : CvANON(outside) ? "ANON"
2979 : (outside == main_cv) ? "MAIN"
2980 : CvUNIQUE(outside) ? "UNIQUE"
2981 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
2986 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
2987 pad = (AV*)*av_fetch(padlist, 1, FALSE);
2988 pname = AvARRAY(pad_name);
2989 ppad = AvARRAY(pad);
2991 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
2992 if (SvPOK(pname[ix]))
2993 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%p (%s\"%s\" %ld-%ld)\n",
2995 SvFAKE(pname[ix]) ? "FAKE " : "",
2997 (long)I_32(SvNVX(pname[ix])),
2998 (long)SvIVX(pname[ix]));
3001 #endif /* DEBUG_CLOSURES */
3004 cv_clone2(proto, outside)
3010 AV* protopadlist = CvPADLIST(proto);
3011 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3012 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3013 SV** pname = AvARRAY(protopad_name);
3014 SV** ppad = AvARRAY(protopad);
3015 I32 fname = AvFILL(protopad_name);
3016 I32 fpad = AvFILL(protopad);
3020 assert(!CvUNIQUE(proto));
3027 cv = compcv = (CV*)NEWSV(1104,0);
3028 sv_upgrade((SV *)cv, SvTYPE(proto));
3033 CvFILEGV(cv) = CvFILEGV(proto);
3034 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3035 CvSTASH(cv) = CvSTASH(proto);
3036 CvROOT(cv) = CvROOT(proto);
3037 CvSTART(cv) = CvSTART(proto);
3039 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3042 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3046 comppadlist = newAV();
3047 AvREAL_off(comppadlist);
3048 av_store(comppadlist, 0, SvREFCNT_inc((SV*)protopad_name));
3049 av_store(comppadlist, 1, (SV*)comppad);
3050 CvPADLIST(cv) = comppadlist;
3051 av_fill(comppad, AvFILL(protopad));
3052 curpad = AvARRAY(comppad);
3054 av = newAV(); /* will be @_ */
3056 av_store(comppad, 0, (SV*)av);
3057 AvFLAGS(av) = AVf_REIFY;
3059 for (ix = fpad; ix > 0; ix--) {
3060 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3061 if (namesv && namesv != &sv_undef) {
3062 char *name = SvPVX(namesv); /* XXX */
3063 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3064 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3065 CvOUTSIDE(cv), cxstack_ix);
3067 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3069 croak("panic: cv_clone: %s", name);
3071 else { /* our own lexical */
3074 /* anon code -- we'll come back for it */
3075 sv = SvREFCNT_inc(ppad[ix]);
3077 else if (*name == '@')
3079 else if (*name == '%')
3089 SV* sv = NEWSV(0,0);
3095 /* Now that vars are all in place, clone nested closures. */
3097 for (ix = fpad; ix > 0; ix--) {
3098 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3100 && namesv != &sv_undef
3101 && !(SvFLAGS(namesv) & SVf_FAKE)
3102 && *SvPVX(namesv) == '&'
3103 && CvCLONE(ppad[ix]))
3105 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3106 SvREFCNT_dec(ppad[ix]);
3109 curpad[ix] = (SV*)kid;
3113 #ifdef DEBUG_CLOSURES
3114 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3116 PerlIO_printf(Perl_debug_log, " from:\n");
3118 PerlIO_printf(Perl_debug_log, " to:\n");
3130 return cv_clone2(proto, CvOUTSIDE(proto));
3134 cv_ckproto(cv, gv, p)
3139 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3144 gv_efullname3(name = NEWSV(606, 40), gv, Nullch);
3145 New(607, buf, ((name ? SvCUR(name) : 0)
3146 + (SvPOK(cv) ? SvCUR(cv) : 0)
3147 + (p ? strlen(p) : 0)
3149 strcpy(buf, "Prototype mismatch:");
3151 sprintf(buf + strlen(buf), " sub %s", SvPVX(name));
3155 sprintf(buf + strlen(buf), " (%s)", SvPVX(cv));
3156 strcat(buf, " vs ");
3157 sprintf(buf + strlen(buf), p ? "(%s)" : "none", p);
3170 if (!cv || !SvPOK(cv) || SvCUR(cv))
3174 for (o = CvSTART(cv); o; o = o->op_next) {
3175 OPCODE type = o->op_type;
3177 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3179 if (type == OP_LEAVESUB || type == OP_RETURN)
3183 if (type == OP_CONST)
3184 sv = ((SVOP*)o)->op_sv;
3185 else if (type == OP_PADSV) {
3186 AV* pad = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3187 sv = pad ? AvARRAY(pad)[o->op_targ] : Nullsv;
3188 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3200 newSUB(floor,op,proto,block)
3206 char *name = op ? SvPVx(cSVOP->op_sv, na) : Nullch;
3207 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3208 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3217 if (!name || GvCVGEN(gv))
3219 else if (cv = GvCV(gv)) {
3220 cv_ckproto(cv, gv, ps);
3221 /* already defined (or promised)? */
3222 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3225 /* just a "sub foo;" when &foo is already defined */
3229 const_sv = cv_const_sv(cv);
3230 if (const_sv || dowarn) {
3231 line_t oldline = curcop->cop_line;
3232 curcop->cop_line = copline;
3233 warn(const_sv ? "Constant subroutine %s redefined"
3234 : "Subroutine %s redefined", name);
3235 curcop->cop_line = oldline;
3241 if (cv) { /* must reuse cv if autoloaded */
3243 CvFLAGS(cv) = CvFLAGS(compcv);
3244 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3245 CvOUTSIDE(compcv) = 0;
3246 CvPADLIST(cv) = CvPADLIST(compcv);
3247 CvPADLIST(compcv) = 0;
3248 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3249 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3250 SvREFCNT_dec(compcv);
3260 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3261 CvFILEGV(cv) = curcop->cop_filegv;
3262 CvSTASH(cv) = curstash;
3265 sv_setpv((SV*)cv, ps);
3271 char *s = strrchr(name, ':');
3273 if (strEQ(s, "BEGIN")) {
3275 "BEGIN not safe after errors--compilation aborted";
3279 /* force display of errors found but not reported */
3280 sv_catpv(GvSV(errgv), not_safe);
3281 croak("%s", SvPVx(GvSV(errgv), na));
3292 if (AvFILL(comppad_name) < AvFILL(comppad))
3293 av_store(comppad_name, AvFILL(comppad), Nullsv);
3296 SV **namep = AvARRAY(comppad_name);
3297 for (ix = AvFILL(comppad); ix > 0; ix--) {
3300 if (SvIMMORTAL(curpad[ix]))
3303 * The only things that a clonable function needs in its
3304 * pad are references to outer lexicals and anonymous subs.
3305 * The rest are created anew during cloning.
3307 if (!((namesv = namep[ix]) != Nullsv &&
3308 namesv != &sv_undef &&
3310 *SvPVX(namesv) == '&')))
3312 SvREFCNT_dec(curpad[ix]);
3313 curpad[ix] = Nullsv;
3318 AV *av = newAV(); /* Will be @_ */
3320 av_store(comppad, 0, (SV*)av);
3321 AvFLAGS(av) = AVf_REIFY;
3323 for (ix = AvFILL(comppad); ix > 0; ix--) {
3324 if (SvIMMORTAL(curpad[ix]))
3326 if (!SvPADMY(curpad[ix]))
3327 SvPADTMP_on(curpad[ix]);
3331 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3332 CvSTART(cv) = LINKLIST(CvROOT(cv));
3333 CvROOT(cv)->op_next = 0;
3339 if (perldb && curstash != debstash) {
3341 SV *tmpstr = sv_newmortal();
3342 static GV *db_postponed;
3346 sprintf(buf, "%s:%ld",
3347 SvPVX(GvSV(curcop->cop_filegv)), (long)subline);
3348 sv = newSVpv(buf,0);
3350 sprintf(buf,"%ld",(long)curcop->cop_line);
3352 gv_efullname3(tmpstr, gv, Nullch);
3353 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3354 if (!db_postponed) {
3355 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3357 hv = GvHVn(db_postponed);
3358 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3359 && (cv = GvCV(db_postponed))) {
3364 perl_call_sv((SV*)cv, G_DISCARD);
3368 if ((s = strrchr(name,':')))
3372 if (strEQ(s, "BEGIN")) {
3373 I32 oldscope = scopestack_ix;
3375 SAVESPTR(compiling.cop_filegv);
3376 SAVEI16(compiling.cop_line);
3383 DEBUG_x( dump_sub(gv) );
3384 av_push(beginav, (SV *)cv);
3386 call_list(oldscope, beginav);
3388 curcop = &compiling;
3391 else if (strEQ(s, "END") && !error_count) {
3394 av_unshift(endav, 1);
3395 av_store(endav, 0, (SV *)cv);
3408 newXSUB(name, ix, subaddr, filename)
3414 CV* cv = newXS(name, (void(*)())subaddr, filename);
3416 CvXSUBANY(cv).any_i32 = ix;
3422 newXS(name, subaddr, filename)
3424 void (*subaddr) _((CV*));
3427 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3430 if (cv = (name ? GvCV(gv) : Nullcv)) {
3432 /* just a cached method */
3436 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3437 /* already defined (or promised) */
3439 line_t oldline = curcop->cop_line;
3440 curcop->cop_line = copline;
3441 warn("Subroutine %s redefined",name);
3442 curcop->cop_line = oldline;
3449 if (cv) /* must reuse cv if autoloaded */
3452 cv = (CV*)NEWSV(1105,0);
3453 sv_upgrade((SV *)cv, SVt_PVCV);
3460 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3461 CvFILEGV(cv) = gv_fetchfile(filename);
3462 CvXSUB(cv) = subaddr;
3465 char *s = strrchr(name,':');
3470 if (strEQ(s, "BEGIN")) {
3473 av_push(beginav, (SV *)cv);
3476 else if (strEQ(s, "END")) {
3479 av_unshift(endav, 1);
3480 av_store(endav, 0, (SV *)cv);
3491 newFORM(floor,op,block)
3502 name = SvPVx(cSVOP->op_sv, na);
3505 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3507 if (cv = GvFORM(gv)) {
3509 line_t oldline = curcop->cop_line;
3511 curcop->cop_line = copline;
3512 warn("Format %s redefined",name);
3513 curcop->cop_line = oldline;
3519 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3520 CvFILEGV(cv) = curcop->cop_filegv;
3522 for (ix = AvFILL(comppad); ix > 0; ix--) {
3523 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3524 SvPADTMP_on(curpad[ix]);
3527 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3528 CvSTART(cv) = LINKLIST(CvROOT(cv));
3529 CvROOT(cv)->op_next = 0;
3540 return newUNOP(OP_REFGEN, 0,
3541 mod(list(convert(OP_ANONLIST, 0, op)), OP_REFGEN));
3548 return newUNOP(OP_REFGEN, 0,
3549 mod(list(convert(OP_ANONHASH, 0, op)), OP_REFGEN));
3553 newANONSUB(floor, proto, block)
3558 return newUNOP(OP_REFGEN, 0,
3559 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3566 switch (o->op_type) {
3568 o->op_type = OP_PADAV;
3569 o->op_ppaddr = ppaddr[OP_PADAV];
3570 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3573 o->op_type = OP_RV2AV;
3574 o->op_ppaddr = ppaddr[OP_RV2AV];
3579 warn("oops: oopsAV");
3589 switch (o->op_type) {
3592 o->op_type = OP_PADHV;
3593 o->op_ppaddr = ppaddr[OP_PADHV];
3594 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3598 o->op_type = OP_RV2HV;
3599 o->op_ppaddr = ppaddr[OP_RV2HV];
3604 warn("oops: oopsHV");
3614 if (o->op_type == OP_PADANY) {
3615 o->op_type = OP_PADAV;
3616 o->op_ppaddr = ppaddr[OP_PADAV];
3619 return newUNOP(OP_RV2AV, 0, scalar(o));
3627 if (type == OP_MAPSTART)
3628 return newUNOP(OP_NULL, 0, o);
3629 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3636 if (o->op_type == OP_PADANY) {
3637 o->op_type = OP_PADHV;
3638 o->op_ppaddr = ppaddr[OP_PADHV];
3641 return newUNOP(OP_RV2HV, 0, scalar(o));
3648 croak("NOT IMPL LINE %d",__LINE__);
3658 return newUNOP(OP_RV2CV, flags, scalar(o));
3665 if (o->op_type == OP_PADANY) {
3666 o->op_type = OP_PADSV;
3667 o->op_ppaddr = ppaddr[OP_PADSV];
3670 return newUNOP(OP_RV2SV, 0, scalar(o));
3673 /* Check routines. */
3682 name = NEWSV(1106,0);
3683 sv_upgrade(name, SVt_PVNV);
3684 sv_setpvn(name, "&", 1);
3687 ix = pad_alloc(op->op_type, SVs_PADMY);
3688 av_store(comppad_name, ix, name);
3689 av_store(comppad, ix, cSVOP->op_sv);
3690 SvPADMY_on(cSVOP->op_sv);
3691 cSVOP->op_sv = Nullsv;
3692 cSVOP->op_targ = ix;
3700 op->op_private = hints;
3708 if (cUNOP->op_first->op_type == OP_CONCAT)
3709 op->op_flags |= OPf_STACKED;
3717 if (op->op_flags & OPf_KIDS) {
3720 OPCODE type = op->op_type;
3721 op = modkids(ck_fun(op), type);
3722 kid = cUNOP->op_first;
3723 newop = kUNOP->op_first->op_sibling;
3725 (newop->op_sibling ||
3726 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3727 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3728 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3732 op_free(kUNOP->op_first);
3733 kUNOP->op_first = newop;
3735 op->op_ppaddr = ppaddr[++op->op_type];
3745 if (op->op_flags & OPf_KIDS) {
3746 OP *kid = cUNOP->op_first;
3747 if (kid->op_type == OP_HSLICE)
3748 op->op_private |= OPpSLICE;
3749 else if (kid->op_type != OP_HELEM)
3750 croak("%s argument is not a HASH element or slice",
3751 op_desc[op->op_type]);
3761 I32 type = op->op_type;
3763 if (op->op_flags & OPf_KIDS) {
3764 if (cLISTOP->op_first->op_type == OP_STUB) {
3766 op = newUNOP(type, OPf_SPECIAL,
3767 newGVOP(OP_GV, 0, gv_fetchpv("main'ARGV", TRUE, SVt_PVAV)));
3778 hints |= HINT_BLOCK_SCOPE;
3779 if (op->op_flags & OPf_KIDS) {
3780 SVOP *kid = (SVOP*)cUNOP->op_first;
3783 op->op_flags &= ~OPf_KIDS;
3786 else if (kid->op_type == OP_LINESEQ) {
3789 kid->op_next = op->op_next;
3790 cUNOP->op_first = 0;
3793 Newz(1101, enter, 1, LOGOP);
3794 enter->op_type = OP_ENTERTRY;
3795 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3796 enter->op_private = 0;
3798 /* establish postfix order */
3799 enter->op_next = (OP*)enter;
3801 op = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3802 op->op_type = OP_LEAVETRY;
3803 op->op_ppaddr = ppaddr[OP_LEAVETRY];
3804 enter->op_other = op;
3810 op = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3812 op->op_targ = (PADOFFSET)hints;
3821 if (op->op_flags & OPf_STACKED) {
3823 kid = cUNOP->op_first->op_sibling;
3824 if (kid->op_type == OP_RV2GV)
3837 if (op->op_flags & OPf_KIDS) {
3838 OP *kid = cUNOP->op_first;
3839 if (kid->op_type != OP_HELEM)
3840 croak("%s argument is not a HASH element", op_desc[op->op_type]);
3850 o = fold_constants(o);
3851 if (o->op_type == OP_CONST)
3860 SVOP *kid = (SVOP*)cUNOP->op_first;
3862 op->op_private |= (hints & HINT_STRICT_REFS);
3863 if (kid->op_type == OP_CONST) {
3868 name = SvPV(kid->op_sv, na);
3869 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3870 char *badthing = Nullch;
3871 switch (op->op_type) {
3873 badthing = "a SCALAR";
3876 badthing = "an ARRAY";
3879 badthing = "a HASH";
3884 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3887 kid->op_type = OP_GV;
3888 iscv = (op->op_type == OP_RV2CV) * 2;
3889 for (gv = 0; !gv; iscv++) {
3891 * This is a little tricky. We only want to add the symbol if we
3892 * didn't add it in the lexer. Otherwise we get duplicate strict
3893 * warnings. But if we didn't add it in the lexer, we must at
3894 * least pretend like we wanted to add it even if it existed before,
3895 * or we get possible typo warnings. OPpCONST_ENTERED says
3896 * whether the lexer already added THIS instance of this symbol.
3898 gv = gv_fetchpv(name,
3899 iscv | !(kid->op_private & OPpCONST_ENTERED),
3902 : op->op_type == OP_RV2SV
3904 : op->op_type == OP_RV2AV
3906 : op->op_type == OP_RV2HV
3910 SvREFCNT_dec(kid->op_sv);
3911 kid->op_sv = SvREFCNT_inc(gv);
3920 I32 type = op->op_type;
3922 if (op->op_flags & OPf_REF)
3925 if (op->op_flags & OPf_KIDS) {
3926 SVOP *kid = (SVOP*)cUNOP->op_first;
3928 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3929 OP *newop = newGVOP(type, OPf_REF,
3930 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
3937 if (type == OP_FTTTY)
3938 return newGVOP(type, OPf_REF, gv_fetchpv("main'STDIN", TRUE,
3941 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3954 int type = op->op_type;
3955 register I32 oa = opargs[type] >> OASHIFT;
3957 if (op->op_flags & OPf_STACKED) {
3958 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
3961 return no_fh_allowed(op);
3964 if (op->op_flags & OPf_KIDS) {
3965 tokid = &cLISTOP->op_first;
3966 kid = cLISTOP->op_first;
3967 if (kid->op_type == OP_PUSHMARK ||
3968 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
3970 tokid = &kid->op_sibling;
3971 kid = kid->op_sibling;
3973 if (!kid && opargs[type] & OA_DEFGV)
3974 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
3978 sibl = kid->op_sibling;
3992 if (kid->op_type == OP_CONST &&
3993 (kid->op_private & OPpCONST_BARE)) {
3994 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
3995 OP *newop = newAVREF(newGVOP(OP_GV, 0,
3996 gv_fetchpv(name, TRUE, SVt_PVAV) ));
3998 warn("Array @%s missing the @ in argument %ld of %s()",
3999 name, (long)numargs, op_desc[type]);
4002 kid->op_sibling = sibl;
4005 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4006 bad_type(numargs, "array", op_desc[op->op_type], kid);
4010 if (kid->op_type == OP_CONST &&
4011 (kid->op_private & OPpCONST_BARE)) {
4012 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4013 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4014 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4016 warn("Hash %%%s missing the %% in argument %ld of %s()",
4017 name, (long)numargs, op_desc[type]);
4020 kid->op_sibling = sibl;
4023 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4024 bad_type(numargs, "hash", op_desc[op->op_type], kid);
4029 OP *newop = newUNOP(OP_NULL, 0, kid);
4030 kid->op_sibling = 0;
4032 newop->op_next = newop;
4034 kid->op_sibling = sibl;
4039 if (kid->op_type != OP_GV) {
4040 if (kid->op_type == OP_CONST &&
4041 (kid->op_private & OPpCONST_BARE)) {
4042 OP *newop = newGVOP(OP_GV, 0,
4043 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4049 kid->op_sibling = 0;
4050 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4052 kid->op_sibling = sibl;
4058 mod(scalar(kid), type);
4062 tokid = &kid->op_sibling;
4063 kid = kid->op_sibling;
4065 op->op_private |= numargs;
4067 return too_many_arguments(op,op_desc[op->op_type]);
4070 else if (opargs[type] & OA_DEFGV) {
4072 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4076 while (oa & OA_OPTIONAL)
4078 if (oa && oa != OA_LIST)
4079 return too_few_arguments(op,op_desc[op->op_type]);
4088 GV *gv = gv_fetchpv("glob", FALSE, SVt_PVCV);
4090 if (gv && GvIMPORTED_CV(gv)) {
4091 op->op_type = OP_LIST;
4092 op->op_ppaddr = ppaddr[OP_LIST];
4093 op = newUNOP(OP_ENTERSUB, OPf_STACKED,
4094 append_elem(OP_LIST, op,
4095 scalar(newUNOP(OP_RV2CV, 0,
4096 newGVOP(OP_GV, 0, gv)))));
4099 if ((op->op_flags & OPf_KIDS) && !cLISTOP->op_first->op_sibling)
4100 append_elem(OP_GLOB, op, newSVREF(newGVOP(OP_GV, 0, defgv)));
4101 gv = newGVgen("main");
4103 append_elem(OP_GLOB, op, newGVOP(OP_GV, 0, gv));
4114 OPCODE type = op->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4116 op->op_ppaddr = ppaddr[OP_GREPSTART];
4117 Newz(1101, gwop, 1, LOGOP);
4119 if (op->op_flags & OPf_STACKED) {
4122 kid = cLISTOP->op_first->op_sibling;
4123 for (k = cLISTOP->op_first->op_sibling->op_next; k; k = k->op_next) {
4126 kid->op_next = (OP*)gwop;
4127 op->op_flags &= ~OPf_STACKED;
4129 kid = cLISTOP->op_first->op_sibling;
4130 if (type == OP_MAPWHILE)
4137 kid = cLISTOP->op_first->op_sibling;
4138 if (kid->op_type != OP_NULL)
4139 croak("panic: ck_grep");
4140 kid = kUNOP->op_first;
4142 gwop->op_type = type;
4143 gwop->op_ppaddr = ppaddr[type];
4144 gwop->op_first = listkids(op);
4145 gwop->op_flags |= OPf_KIDS;
4146 gwop->op_private = 1;
4147 gwop->op_other = LINKLIST(kid);
4148 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4149 kid->op_next = (OP*)gwop;
4151 kid = cLISTOP->op_first->op_sibling;
4152 if (!kid || !kid->op_sibling)
4153 return too_few_arguments(op,op_desc[op->op_type]);
4154 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4155 mod(kid, OP_GREPSTART);
4164 if (op->op_flags & OPf_KIDS) {
4165 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4166 if (kid && kid->op_type == OP_CONST)
4167 fbm_compile(((SVOP*)kid)->op_sv);
4176 /* XXX length optimization goes here */
4184 OPCODE type = op->op_type;
4185 return modkids(ck_fun(op), type);
4192 OPCODE type = op->op_type;
4193 return refkids(ck_fun(op), type);
4202 kid = cLISTOP->op_first;
4204 op = force_list(op);
4205 kid = cLISTOP->op_first;
4207 if (kid->op_type == OP_PUSHMARK)
4208 kid = kid->op_sibling;
4209 if (kid && op->op_flags & OPf_STACKED)
4210 kid = kid->op_sibling;
4211 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4212 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4213 op->op_flags |= OPf_STACKED; /* make it a filehandle */
4214 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4215 cLISTOP->op_first->op_sibling = kid;
4216 cLISTOP->op_last = kid;
4217 kid = kid->op_sibling;
4222 append_elem(op->op_type, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4228 if (hints & HINT_LOCALE)
4229 op->op_private |= OPpLOCALE;
4243 if (hints & HINT_LOCALE)
4244 op->op_private |= OPpLOCALE;
4256 if (hints & HINT_LOCALE)
4257 op->op_private |= OPpLOCALE;
4267 cPMOP->op_pmflags |= PMf_RUNTIME;
4268 cPMOP->op_pmpermflags |= PMf_RUNTIME;
4283 if (cBINOP->op_first->op_flags & OPf_PARENS) {
4284 op->op_private |= OPpREPEAT_DOLIST;
4285 cBINOP->op_first = force_list(cBINOP->op_first);
4296 if (op->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4297 SVOP *kid = (SVOP*)cUNOP->op_first;
4299 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4301 for (s = SvPVX(kid->op_sv); *s; s++) {
4302 if (*s == ':' && s[1] == ':') {
4304 Move(s+2, s+1, strlen(s+2)+1, char);
4305 --SvCUR(kid->op_sv);
4308 sv_catpvn(kid->op_sv, ".pm", 3);
4318 croak("NOT IMPL LINE %d",__LINE__);
4328 if (op->op_flags & OPf_KIDS) {
4329 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4330 if (kid && kid->op_sibling) {
4331 op->op_type = OP_SSELECT;
4332 op->op_ppaddr = ppaddr[OP_SSELECT];
4334 return fold_constants(op);
4338 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4339 if (kid && kid->op_type == OP_RV2GV)
4340 kid->op_private &= ~HINT_STRICT_REFS;
4348 I32 type = op->op_type;
4350 if (!(op->op_flags & OPf_KIDS)) {
4352 return newUNOP(type, 0,
4353 scalar(newUNOP(OP_RV2AV, 0,
4354 scalar(newGVOP(OP_GV, 0, subline
4356 : gv_fetchpv("ARGV", TRUE, SVt_PVAV) )))));
4358 return scalar(modkids(ck_fun(op), type));
4367 if (hints & HINT_LOCALE)
4368 op->op_private |= OPpLOCALE;
4371 if (op->op_flags & OPf_STACKED) {
4372 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4374 kid = kUNOP->op_first; /* get past rv2gv */
4376 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4378 if (kid->op_type == OP_SCOPE) {
4382 else if (kid->op_type == OP_LEAVE) {
4383 if (op->op_type == OP_SORT) {
4384 null(kid); /* wipe out leave */
4387 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4388 if (k->op_next == kid)
4393 kid->op_next = 0; /* just disconnect the leave */
4394 k = kLISTOP->op_first;
4398 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4399 null(kid); /* wipe out rv2gv */
4400 if (op->op_type == OP_SORT)
4404 op->op_flags |= OPf_SPECIAL;
4418 if (op->op_flags & OPf_STACKED)
4419 return no_fh_allowed(op);
4421 kid = cLISTOP->op_first;
4422 if (kid->op_type != OP_NULL)
4423 croak("panic: ck_split");
4424 kid = kid->op_sibling;
4425 op_free(cLISTOP->op_first);
4426 cLISTOP->op_first = kid;
4428 cLISTOP->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4429 cLISTOP->op_last = kid; /* There was only one element previously */
4432 if (kid->op_type != OP_MATCH) {
4433 OP *sibl = kid->op_sibling;
4434 kid->op_sibling = 0;
4435 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4436 if (cLISTOP->op_first == cLISTOP->op_last)
4437 cLISTOP->op_last = kid;
4438 cLISTOP->op_first = kid;
4439 kid->op_sibling = sibl;
4442 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4443 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4447 kid->op_type = OP_PUSHRE;
4448 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4451 if (!kid->op_sibling)
4452 append_elem(OP_SPLIT, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4454 kid = kid->op_sibling;
4457 if (!kid->op_sibling)
4458 append_elem(OP_SPLIT, op, newSVOP(OP_CONST, 0, newSViv(0)));
4460 kid = kid->op_sibling;
4463 if (kid->op_sibling)
4464 return too_many_arguments(op,op_desc[op->op_type]);
4473 OP *prev = ((cUNOP->op_first->op_sibling)
4474 ? cUNOP : ((UNOP*)cUNOP->op_first))->op_first;
4475 OP *o = prev->op_sibling;
4482 for (cvop = o; cvop->op_sibling; cvop = cvop->op_sibling) ;
4483 if (cvop->op_type == OP_RV2CV) {
4485 op->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4486 null(cvop); /* disable rv2cv */
4487 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4488 if (tmpop->op_type == OP_GV) {
4489 cv = GvCVu(tmpop->op_sv);
4490 if (cv && SvPOK(cv) && !(op->op_private & OPpENTERSUB_AMPER))
4491 proto = SvPV((SV*)cv,na);
4494 op->op_private |= (hints & HINT_STRICT_REFS);
4495 if (perldb && curstash != debstash)
4496 op->op_private |= OPpENTERSUB_DB;
4501 return too_many_arguments(op, CvNAME(cv));
4519 if (o->op_type != OP_REFGEN && o->op_type != OP_UNDEF)
4520 bad_type(arg, "block", CvNAME(cv), o);
4525 if (o->op_type == OP_RV2GV)
4529 o = newUNOP(OP_RV2GV, 0, kid);
4530 o->op_sibling = kid->op_sibling;
4531 kid->op_sibling = 0;
4532 prev->op_sibling = o;
4540 if (o->op_type != OP_RV2GV)
4541 bad_type(arg, "symbol", CvNAME(cv), o);
4544 if (o->op_type != OP_RV2CV)
4545 bad_type(arg, "sub", CvNAME(cv), o);
4548 if (o->op_type != OP_RV2SV && o->op_type != OP_PADSV)
4549 bad_type(arg, "scalar", CvNAME(cv), o);
4552 if (o->op_type != OP_RV2AV && o->op_type != OP_PADAV)
4553 bad_type(arg, "array", CvNAME(cv), o);
4556 if (o->op_type != OP_RV2HV && o->op_type != OP_PADHV)
4557 bad_type(arg, "hash", CvNAME(cv), o);
4561 o = newUNOP(OP_REFGEN, 0, kid);
4562 o->op_sibling = kid->op_sibling;
4563 kid->op_sibling = 0;
4564 prev->op_sibling = o;
4575 croak("Malformed prototype for %s: %s",
4576 CvNAME(cv),SvPV((SV*)cv,na));
4581 mod(o, OP_ENTERSUB);
4585 if (proto && !optional && *proto == '$')
4586 return too_few_arguments(op, CvNAME(cv));
4594 SvREADONLY_on(cSVOP->op_sv);
4602 if (op->op_flags & OPf_KIDS) {
4603 SVOP *kid = (SVOP*)cUNOP->op_first;
4605 if (kid->op_type == OP_NULL)
4606 kid = (SVOP*)kid->op_sibling;
4608 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4609 op->op_flags |= OPf_SPECIAL;
4614 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4620 register OP* oldop = 0;
4621 if (!o || o->op_seq)
4626 for (; o; o = o->op_next) {
4632 switch (o->op_type) {
4635 curcop = ((COP*)o); /* for warnings */
4636 o->op_seq = op_seqmax++;
4647 if (o->op_next->op_type == OP_STRINGIFY)
4649 o->op_seq = op_seqmax++;
4652 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4653 o->op_seq = op_seqmax++;
4654 break; /* Scalar stub must produce undef. List stub is noop */
4658 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4659 curcop = ((COP*)op);
4665 if (oldop && o->op_next) {
4666 oldop->op_next = o->op_next;
4669 o->op_seq = op_seqmax++;
4673 if (o->op_next->op_type == OP_RV2SV) {
4674 if (!(o->op_next->op_private & OPpDEREF)) {
4676 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4677 o->op_next = o->op_next->op_next;
4678 o->op_type = OP_GVSV;
4679 o->op_ppaddr = ppaddr[OP_GVSV];
4682 else if (o->op_next->op_type == OP_RV2AV) {
4683 OP* pop = o->op_next->op_next;
4685 if (pop->op_type == OP_CONST &&
4686 (op = pop->op_next) &&
4687 pop->op_next->op_type == OP_AELEM &&
4688 !(pop->op_next->op_private &
4689 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4690 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4694 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4698 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4699 o->op_next = pop->op_next->op_next;
4700 o->op_type = OP_AELEMFAST;
4701 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4702 o->op_private = (U8)i;
4703 GvAVn(((GVOP*)o)->op_gv);
4706 o->op_seq = op_seqmax++;
4713 o->op_seq = op_seqmax++;
4714 peep(cLOGOP->op_other);
4718 o->op_seq = op_seqmax++;
4719 peep(cCONDOP->op_true);
4720 peep(cCONDOP->op_false);
4724 o->op_seq = op_seqmax++;
4725 peep(cLOOP->op_redoop);
4726 peep(cLOOP->op_nextop);
4727 peep(cLOOP->op_lastop);
4732 o->op_seq = op_seqmax++;
4733 peep(cPMOP->op_pmreplstart);
4737 o->op_seq = op_seqmax++;
4738 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4739 if (o->op_next->op_sibling &&
4740 o->op_next->op_sibling->op_type != OP_DIE) {
4741 line_t oldline = curcop->cop_line;
4743 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4744 warn("Statement unlikely to be reached");
4745 warn("(Maybe you meant system() when you said exec()?)\n");
4746 curcop->cop_line = oldline;
4751 o->op_seq = op_seqmax++;