3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
21 #define USE_OP_MASK /* Turned on by default in 5.002beta1h */
25 * In the following definition, the ", (OP *) op" is just to make the compiler
26 * think the expression is of the right type: croak actually does a Siglongjmp.
28 #define CHECKOP(type,op) \
29 ((op_mask && op_mask[type]) \
30 ? ( op_free((OP*)op), \
31 croak("%s trapped by operation mask", op_desc[type]), \
33 : (*check[type])((OP*)op))
35 #define CHECKOP(type,op) (*check[type])(op)
36 #endif /* USE_OP_MASK */
38 static I32 list_assignment _((OP *op));
39 static OP *bad_type _((I32 n, char *t, char *name, OP *kid));
40 static OP *modkids _((OP *op, I32 type));
41 static OP *no_fh_allowed _((OP *op));
42 static bool scalar_mod_type _((OP *op, I32 type));
43 static OP *scalarboolean _((OP *op));
44 static OP *too_few_arguments _((OP *op, char* name));
45 static OP *too_many_arguments _((OP *op, char* name));
46 static void null _((OP* op));
47 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
48 CV* startcv, I32 cx_ix));
54 SV* tmpsv = sv_newmortal();
55 gv_efullname3(tmpsv, gv, Nullch);
56 return SvPV(tmpsv,na);
63 yyerror(form("Missing comma after first argument to %s function",
64 op_desc[op->op_type]));
69 too_few_arguments(op, name)
73 yyerror(form("Not enough arguments for %s", name));
78 too_many_arguments(op, name)
82 yyerror(form("Too many arguments for %s", name));
87 bad_type(n, t, name, kid)
93 yyerror(form("Type of arg %d to %s must be %s (not %s)",
94 (int)n, name, t, op_desc[kid->op_type]));
102 int type = op->op_type;
103 if (type != OP_AELEM && type != OP_HELEM) {
104 yyerror(form("Can't use subscript on %s", op_desc[type]));
105 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV)
106 warn("(Did you mean $ or @ instead of %c?)\n",
107 type == OP_ENTERSUB ? '&' : '%');
111 /* "register" allocation */
120 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
121 if (!isPRINT(name[1])) {
123 name[2] = toCTRL(name[1]);
126 croak("Can't use global %s in \"my\"",name);
128 if (AvFILL(comppad_name) >= 0) {
129 SV **svp = AvARRAY(comppad_name);
130 for (off = AvFILL(comppad_name); off > comppad_name_floor; off--) {
133 && SvIVX(sv) == 999999999 /* var is in open scope */
134 && strEQ(name, SvPVX(sv)))
136 warn("\"my\" variable %s masks earlier declaration in same scope", name);
141 off = pad_alloc(OP_PADSV, SVs_PADMY);
143 sv_upgrade(sv, SVt_PVNV);
145 av_store(comppad_name, off, sv);
146 SvNVX(sv) = (double)999999999;
147 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
148 if (!min_intro_pending)
149 min_intro_pending = off;
150 max_intro_pending = off;
152 av_store(comppad, off, (SV*)newAV());
153 else if (*name == '%')
154 av_store(comppad, off, (SV*)newHV());
155 SvPADMY_on(curpad[off]);
160 #ifndef CAN_PROTOTYPE
161 pad_findlex(name, newoff, seq, startcv, cx_ix)
168 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
175 register CONTEXT *cx;
178 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
179 AV *curlist = CvPADLIST(cv);
180 SV **svp = av_fetch(curlist, 0, FALSE);
183 if (!svp || *svp == &sv_undef)
186 svp = AvARRAY(curname);
187 for (off = AvFILL(curname); off > 0; off--) {
188 if ((sv = svp[off]) &&
191 seq > I_32(SvNVX(sv)) &&
192 strEQ(SvPVX(sv), name))
203 return 0; /* don't clone from inactive stack frame */
207 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
208 oldsv = *av_fetch(oldpad, off, TRUE);
209 if (!newoff) { /* Not a mere clone operation. */
210 SV *namesv = NEWSV(1103,0);
211 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
212 sv_upgrade(namesv, SVt_PVNV);
213 sv_setpv(namesv, name);
214 av_store(comppad_name, newoff, namesv);
215 SvNVX(namesv) = (double)curcop->cop_seq;
216 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
217 SvFAKE_on(namesv); /* A ref, not a real var */
218 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
219 /* "It's closures all the way down." */
223 oldsv = Nullsv; /* no need to keep ref */
228 bcv && bcv != cv && !CvCLONE(bcv);
229 bcv = CvOUTSIDE(bcv)) {
233 if (dowarn && !CvUNIQUE(cv))
235 "Variable \"%s\" may be unavailable",
242 else if (!CvUNIQUE(compcv)) {
243 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
244 warn("Variable \"%s\" will not stay shared", name);
247 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
253 /* Nothing in current lexical context--try eval's context, if any.
254 * This is necessary to let the perldb get at lexically scoped variables.
255 * XXX This will also probably interact badly with eval tree caching.
259 for (i = cx_ix; i >= 0; i--) {
261 switch (cx->cx_type) {
263 if (i == 0 && saweval) {
264 seq = cxstack[saweval].blk_oldcop->cop_seq;
265 return pad_findlex(name, newoff, seq, main_cv, 0);
269 switch (cx->blk_eval.old_op_type) {
274 /* require must have its own scope */
282 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
283 saweval = i; /* so we know where we were called from */
286 seq = cxstack[saweval].blk_oldcop->cop_seq;
287 return pad_findlex(name, newoff, seq, cv, i-1);
301 SV **svp = AvARRAY(comppad_name);
302 U32 seq = cop_seqmax;
304 /* The one we're looking for is probably just before comppad_name_fill. */
305 for (off = AvFILL(comppad_name); off > 0; off--) {
306 if ((sv = svp[off]) &&
310 seq > I_32(SvNVX(sv)))) &&
311 strEQ(SvPVX(sv), name))
314 return (PADOFFSET)off;
315 pendoff = off; /* this pending def. will override import */
319 /* See if it's in a nested scope */
320 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
322 /* If there is a pending local definition, this new alias must die */
324 SvIVX(AvARRAY(comppad_name)[off]) = seq;
336 SV **svp = AvARRAY(comppad_name);
338 if (min_intro_pending && fill < min_intro_pending) {
339 for (off = max_intro_pending; off >= min_intro_pending; off--) {
340 if ((sv = svp[off]) && sv != &sv_undef)
341 warn("%s never introduced", SvPVX(sv));
344 /* "Deintroduce" my variables that are leaving with this scope. */
345 for (off = AvFILL(comppad_name); off > fill; off--) {
346 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
347 SvIVX(sv) = cop_seqmax;
352 pad_alloc(optype,tmptype)
359 if (AvARRAY(comppad) != curpad)
360 croak("panic: pad_alloc");
361 if (pad_reset_pending)
363 if (tmptype & SVs_PADMY) {
365 sv = *av_fetch(comppad, AvFILL(comppad) + 1, TRUE);
366 } while (SvPADBUSY(sv)); /* need a fresh one */
367 retval = AvFILL(comppad);
370 SV **names = AvARRAY(comppad_name);
371 SSize_t names_fill = AvFILL(comppad_name);
374 * "foreach" index vars temporarily become aliases to non-"my"
375 * values. Thus we must skip, not just pad values that are
376 * marked as current pad values, but also those with names.
378 if (++padix <= names_fill &&
379 (sv = names[padix]) && sv != &sv_undef)
381 sv = *av_fetch(comppad, padix, TRUE);
382 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
387 SvFLAGS(sv) |= tmptype;
388 curpad = AvARRAY(comppad);
389 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad alloc %ld for %s\n", (long) retval, op_name[optype]));
390 return (PADOFFSET)retval;
394 #ifndef CAN_PROTOTYPE
399 #endif /* CAN_PROTOTYPE */
402 croak("panic: pad_sv po");
403 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad sv %lu\n", (unsigned long)po));
404 return curpad[po]; /* eventually we'll turn this into a macro */
408 #ifndef CAN_PROTOTYPE
412 pad_free(PADOFFSET po)
413 #endif /* CAN_PROTOTYPE */
417 if (AvARRAY(comppad) != curpad)
418 croak("panic: pad_free curpad");
420 croak("panic: pad_free po");
421 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad free %lu\n", (unsigned long)po));
422 if (curpad[po] && !SvIMMORTAL(curpad[po]))
423 SvPADTMP_off(curpad[po]);
429 #ifndef CAN_PROTOTYPE
433 pad_swipe(PADOFFSET po)
434 #endif /* CAN_PROTOTYPE */
436 if (AvARRAY(comppad) != curpad)
437 croak("panic: pad_swipe curpad");
439 croak("panic: pad_swipe po");
440 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad swipe %lu\n", (unsigned long)po));
441 SvPADTMP_off(curpad[po]);
442 curpad[po] = NEWSV(1107,0);
443 SvPADTMP_on(curpad[po]);
453 if (AvARRAY(comppad) != curpad)
454 croak("panic: pad_reset curpad");
455 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad reset\n"));
456 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
457 for (po = AvMAX(comppad); po > padix_floor; po--) {
458 if (curpad[po] && !SvIMMORTAL(curpad[po]))
459 SvPADTMP_off(curpad[po]);
463 pad_reset_pending = FALSE;
472 register OP *kid, *nextkid;
474 if (!op || op->op_seq == (U16)-1)
477 if (op->op_flags & OPf_KIDS) {
478 for (kid = cUNOP->op_first; kid; kid = nextkid) {
479 nextkid = kid->op_sibling; /* Get before next freeing kid */
484 switch (op->op_type) {
486 op->op_targ = 0; /* Was holding old type, if any. */
489 op->op_targ = 0; /* Was holding hints. */
492 if (!(op->op_flags & OPf_REF) || (check[op->op_type] != ck_ftst))
498 SvREFCNT_dec(cGVOP->op_gv);
502 Safefree(cCOP->cop_label);
503 SvREFCNT_dec(cCOP->cop_filegv);
506 SvREFCNT_dec(cSVOP->op_sv);
512 if (op->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
516 Safefree(cPVOP->op_pv);
519 op_free(cPMOP->op_pmreplroot);
523 pregfree(cPMOP->op_pmregexp);
524 SvREFCNT_dec(cPMOP->op_pmshort);
529 pad_free(op->op_targ);
538 if (op->op_type != OP_NULL && op->op_targ > 0)
539 pad_free(op->op_targ);
540 op->op_targ = op->op_type;
541 op->op_type = OP_NULL;
542 op->op_ppaddr = ppaddr[OP_NULL];
545 /* Contextualizers */
547 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
558 /* establish postfix order */
559 if (cUNOP->op_first) {
560 op->op_next = LINKLIST(cUNOP->op_first);
561 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling) {
563 kid->op_next = LINKLIST(kid->op_sibling);
579 if (op && op->op_flags & OPf_KIDS) {
580 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
591 op->op_type == OP_SASSIGN && cBINOP->op_first->op_type == OP_CONST) {
592 line_t oldline = curcop->cop_line;
594 if (copline != NOLINE)
595 curcop->cop_line = copline;
596 warn("Found = in conditional, should be ==");
597 curcop->cop_line = oldline;
608 /* assumes no premature commitment */
609 if (!op || (op->op_flags & OPf_WANT) || error_count
610 || op->op_type == OP_RETURN)
613 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
615 switch (op->op_type) {
617 if (op->op_private & OPpREPEAT_DOLIST)
618 null(((LISTOP*)cBINOP->op_first)->op_first);
619 scalar(cBINOP->op_first);
624 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
628 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
629 if (!kPMOP->op_pmreplroot)
630 deprecate("implicit split to @_");
637 if (op->op_flags & OPf_KIDS) {
638 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling)
644 kid = cLISTOP->op_first;
646 while (kid = kid->op_sibling) {
657 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
677 /* assumes no premature commitment */
678 if (!op || (op->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
679 || op->op_type == OP_RETURN)
682 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
684 switch (op->op_type) {
686 if (!(opargs[op->op_type] & OA_FOLDCONST))
690 if (op->op_flags & OPf_STACKED)
761 if (!(op->op_private & OPpLVAL_INTRO))
762 useless = op_desc[op->op_type];
769 if (!(op->op_private & OPpLVAL_INTRO) &&
770 (!op->op_sibling || op->op_sibling->op_type != OP_READLINE))
771 useless = "a variable";
776 curcop = ((COP*)op); /* for warning below */
782 useless = "a constant";
783 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
785 else if (SvPOK(sv)) {
786 if (strnEQ(SvPVX(sv), "di", 2) ||
787 strnEQ(SvPVX(sv), "ds", 2) ||
788 strnEQ(SvPVX(sv), "ig", 2))
792 null(op); /* don't execute a constant */
793 SvREFCNT_dec(sv); /* don't even remember it */
797 op->op_type = OP_PREINC; /* pre-increment is faster */
798 op->op_ppaddr = ppaddr[OP_PREINC];
802 op->op_type = OP_PREDEC; /* pre-decrement is faster */
803 op->op_ppaddr = ppaddr[OP_PREDEC];
809 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
814 if (op->op_targ == OP_NEXTSTATE || op->op_targ == OP_DBSTATE)
815 curcop = ((COP*)op); /* for warning below */
816 if (op->op_flags & OPf_STACKED)
822 if (!(op->op_flags & OPf_KIDS))
831 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
835 /* since all requires must return a value, they're never void */
836 op->op_flags &= ~OPf_WANT;
839 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
840 if (!kPMOP->op_pmreplroot)
841 deprecate("implicit split to @_");
845 if (useless && dowarn)
846 warn("Useless use of %s in void context", useless);
855 if (op && op->op_flags & OPf_KIDS) {
856 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
868 /* assumes no premature commitment */
869 if (!op || (op->op_flags & OPf_WANT) || error_count
870 || op->op_type == OP_RETURN)
873 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
875 switch (op->op_type) {
878 list(cBINOP->op_first);
883 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
890 if (!(op->op_flags & OPf_KIDS))
892 if (!op->op_next && cUNOP->op_first->op_type == OP_FLOP) {
893 list(cBINOP->op_first);
894 return gen_constant_list(op);
901 kid = cLISTOP->op_first;
903 while (kid = kid->op_sibling) {
913 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
932 if (op->op_type == OP_LINESEQ ||
933 op->op_type == OP_SCOPE ||
934 op->op_type == OP_LEAVE ||
935 op->op_type == OP_LEAVETRY)
937 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
938 if (kid->op_sibling) {
944 op->op_flags &= ~OPf_PARENS;
945 if (hints & HINT_BLOCK_SCOPE)
946 op->op_flags |= OPf_PARENS;
949 op = newOP(OP_STUB, 0);
959 if (op && op->op_flags & OPf_KIDS) {
960 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
976 if (!op || error_count)
979 switch (op->op_type) {
983 if (!(op->op_private & (OPpCONST_ARYBASE)))
985 if (eval_start && eval_start->op_type == OP_CONST) {
986 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
990 SAVEI32(compiling.cop_arybase);
991 compiling.cop_arybase = 0;
993 else if (type == OP_REFGEN)
996 croak("That use of $[ is unsupported");
999 if (op->op_flags & OPf_PARENS)
1003 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1004 !(op->op_flags & OPf_STACKED)) {
1005 op->op_type = OP_RV2CV; /* entersub => rv2cv */
1006 op->op_ppaddr = ppaddr[OP_RV2CV];
1007 assert(cUNOP->op_first->op_type == OP_NULL);
1008 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
1014 /* grep, foreach, subcalls, refgen */
1015 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1017 yyerror(form("Can't modify %s in %s",
1018 op_desc[op->op_type],
1019 type ? op_desc[type] : "local"));
1033 case OP_RIGHT_SHIFT:
1042 if (!(op->op_flags & OPf_STACKED))
1048 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
1054 if (type == OP_REFGEN && op->op_flags & OPf_PARENS) {
1056 return op; /* Treat \(@foo) like ordinary list. */
1060 if (scalar_mod_type(op, type))
1062 ref(cUNOP->op_first, op->op_type);
1074 if (!type && cUNOP->op_first->op_type != OP_GV)
1075 croak("Can't localize a reference");
1076 ref(cUNOP->op_first, op->op_type);
1088 if (type == OP_REFGEN && op->op_flags & OPf_PARENS)
1089 return op; /* Treat \(@foo) like ordinary list. */
1090 if (scalar_mod_type(op, type))
1096 croak("Can't localize lexical variable %s",
1097 SvPV(*av_fetch(comppad_name, op->op_targ, 4), na));
1104 if (type != OP_SASSIGN)
1110 pad_free(op->op_targ);
1111 op->op_targ = pad_alloc(op->op_type, SVs_PADMY);
1112 assert(SvTYPE(PAD_SV(op->op_targ)) == SVt_NULL);
1113 if (op->op_flags & OPf_KIDS)
1114 mod(cBINOP->op_first->op_sibling, type);
1119 ref(cBINOP->op_first, op->op_type);
1120 if (type == OP_ENTERSUB &&
1121 !(op->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1122 op->op_private |= OPpLVAL_DEFER;
1129 if (op->op_flags & OPf_KIDS)
1130 mod(cLISTOP->op_last, type);
1134 if (!(op->op_flags & OPf_KIDS))
1136 if (op->op_targ != OP_LIST) {
1137 mod(cBINOP->op_first, type);
1142 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1146 op->op_flags |= OPf_MOD;
1148 if (type == OP_AASSIGN || type == OP_SASSIGN)
1149 op->op_flags |= OPf_SPECIAL|OPf_REF;
1151 op->op_private |= OPpLVAL_INTRO;
1152 op->op_flags &= ~OPf_SPECIAL;
1154 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1155 op->op_flags |= OPf_REF;
1160 scalar_mod_type(op, type)
1166 if (op->op_type == OP_RV2GV)
1190 case OP_RIGHT_SHIFT:
1197 case OP_ANDASSIGN: /* may work later */
1198 case OP_ORASSIGN: /* may work later */
1211 if (op && op->op_flags & OPf_KIDS) {
1212 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1225 if (!op || error_count)
1228 switch (op->op_type) {
1230 if ((type == OP_DEFINED) &&
1231 !(op->op_flags & OPf_STACKED)) {
1232 op->op_type = OP_RV2CV; /* entersub => rv2cv */
1233 op->op_ppaddr = ppaddr[OP_RV2CV];
1234 assert(cUNOP->op_first->op_type == OP_NULL);
1235 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
1236 op->op_flags |= OPf_SPECIAL;
1241 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
1245 ref(cUNOP->op_first, op->op_type);
1248 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1249 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1250 : type == OP_RV2HV ? OPpDEREF_HV
1252 op->op_flags |= OPf_MOD;
1258 op->op_flags |= OPf_REF;
1261 ref(cUNOP->op_first, op->op_type);
1266 op->op_flags |= OPf_REF;
1271 if (!(op->op_flags & OPf_KIDS))
1273 ref(cBINOP->op_first, type);
1277 ref(cBINOP->op_first, op->op_type);
1278 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1279 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1280 : type == OP_RV2HV ? OPpDEREF_HV
1282 op->op_flags |= OPf_MOD;
1290 if (!(op->op_flags & OPf_KIDS))
1292 ref(cLISTOP->op_last, type);
1308 if (!op || error_count)
1312 if (type == OP_LIST) {
1313 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1316 else if (type != OP_PADSV &&
1319 type != OP_PUSHMARK)
1321 yyerror(form("Can't declare %s in my", op_desc[op->op_type]));
1324 op->op_flags |= OPf_MOD;
1325 op->op_private |= OPpLVAL_INTRO;
1334 o->op_flags |= OPf_PARENS;
1339 bind_match(type, left, right)
1347 (left->op_type == OP_RV2AV ||
1348 left->op_type == OP_RV2HV ||
1349 left->op_type == OP_PADAV ||
1350 left->op_type == OP_PADHV)) {
1351 char *desc = op_desc[(right->op_type == OP_SUBST ||
1352 right->op_type == OP_TRANS)
1353 ? right->op_type : OP_MATCH];
1354 char *sample = ((left->op_type == OP_RV2AV ||
1355 left->op_type == OP_PADAV)
1356 ? "@array" : "%hash");
1357 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1360 if (right->op_type == OP_MATCH ||
1361 right->op_type == OP_SUBST ||
1362 right->op_type == OP_TRANS) {
1363 right->op_flags |= OPf_STACKED;
1364 if (right->op_type != OP_MATCH)
1365 left = mod(left, right->op_type);
1366 if (right->op_type == OP_TRANS)
1367 op = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1369 op = prepend_elem(right->op_type, scalar(left), right);
1371 return newUNOP(OP_NOT, 0, scalar(op));
1375 return bind_match(type, left,
1376 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1385 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1386 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(op));
1394 if (o->op_flags & OPf_PARENS || perldb || tainting) {
1395 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1396 o->op_type = OP_LEAVE;
1397 o->op_ppaddr = ppaddr[OP_LEAVE];
1400 if (o->op_type == OP_LINESEQ) {
1402 o->op_type = OP_SCOPE;
1403 o->op_ppaddr = ppaddr[OP_SCOPE];
1404 kid = ((LISTOP*)o)->op_first;
1405 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1406 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1411 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1421 int retval = savestack_ix;
1422 SAVEI32(comppad_name_floor);
1424 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1425 comppad_name_floor = comppad_name_fill;
1427 comppad_name_floor = 0;
1429 SAVEI32(min_intro_pending);
1430 SAVEI32(max_intro_pending);
1431 min_intro_pending = 0;
1432 SAVEI32(comppad_name_fill);
1433 SAVEI32(padix_floor);
1434 padix_floor = padix;
1435 pad_reset_pending = FALSE;
1437 hints &= ~HINT_BLOCK_SCOPE;
1442 block_end(floor, seq)
1446 int needblockscope = hints & HINT_BLOCK_SCOPE;
1447 OP* retval = scalarseq(seq);
1449 pad_reset_pending = FALSE;
1451 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1452 pad_leavemy(comppad_name_fill);
1462 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), op);
1463 eval_start = linklist(eval_root);
1464 eval_root->op_next = 0;
1470 main_root = scope(sawparens(scalarvoid(op)));
1471 curcop = &compiling;
1472 main_start = LINKLIST(main_root);
1473 main_root->op_next = 0;
1477 /* Register with debugger */
1479 CV *cv = perl_get_cv("DB::postponed", FALSE);
1483 XPUSHs((SV*)compiling.cop_filegv);
1485 perl_call_sv((SV*)cv, G_DISCARD);
1496 if (o->op_flags & OPf_PARENS)
1500 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1502 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1503 if (*s == ';' || *s == '=')
1504 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1511 return mod(o, OP_NULL); /* a bit kludgey */
1518 if (o->op_type == OP_LIST) {
1519 o = convert(OP_JOIN, 0,
1520 prepend_elem(OP_LIST,
1521 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1532 I32 type = o->op_type;
1535 if (opargs[type] & OA_RETSCALAR)
1537 if (opargs[type] & OA_TARGET)
1538 o->op_targ = pad_alloc(type, SVs_PADTMP);
1540 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1541 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1543 if (!(opargs[type] & OA_FOLDCONST))
1547 goto nope; /* Don't try to run w/ errors */
1549 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1550 if (curop->op_type != OP_CONST &&
1551 curop->op_type != OP_LIST &&
1552 curop->op_type != OP_SCALAR &&
1553 curop->op_type != OP_NULL &&
1554 curop->op_type != OP_PUSHMARK) {
1559 curop = LINKLIST(o);
1564 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1565 pad_swipe(o->op_targ);
1566 else if (SvTEMP(sv)) { /* grab mortal temp? */
1567 (void)SvREFCNT_inc(sv);
1571 if (type == OP_RV2GV)
1572 return newGVOP(OP_GV, 0, (GV*)sv);
1574 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1576 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1581 SvIOK_off(sv); /* undo SvIV() damage */
1583 return newSVOP(OP_CONST, 0, sv);
1587 if (!(opargs[type] & OA_OTHERINT))
1590 if (!(hints & HINT_INTEGER)) {
1591 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1594 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1595 if (curop->op_type == OP_CONST) {
1596 if (SvIOK(((SVOP*)curop)->op_sv))
1600 if (opargs[curop->op_type] & OA_RETINTEGER)
1604 o->op_ppaddr = ppaddr[++(o->op_type)];
1611 gen_constant_list(o)
1615 I32 oldtmps_floor = tmps_floor;
1619 return o; /* Don't attempt to run with errors */
1621 op = curop = LINKLIST(o);
1627 tmps_floor = oldtmps_floor;
1629 o->op_type = OP_RV2AV;
1630 o->op_ppaddr = ppaddr[OP_RV2AV];
1631 curop = ((UNOP*)o)->op_first;
1632 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1639 convert(type, flags, op)
1647 if (!op || op->op_type != OP_LIST)
1648 op = newLISTOP(OP_LIST, 0, op, Nullop);
1650 op->op_flags &= ~OPf_WANT;
1652 if (!(opargs[type] & OA_MARK))
1653 null(cLISTOP->op_first);
1656 op->op_ppaddr = ppaddr[type];
1657 op->op_flags |= flags;
1659 op = CHECKOP(type, op);
1660 if (op->op_type != type)
1663 if (cLISTOP->op_children < 7) {
1664 /* XXX do we really need to do this if we're done appending?? */
1665 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1667 cLISTOP->op_last = last; /* in case check substituted last arg */
1670 return fold_constants(op);
1673 /* List constructors */
1676 append_elem(type, first, last)
1687 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1688 return newLISTOP(type, 0, first, last);
1690 if (first->op_flags & OPf_KIDS)
1691 ((LISTOP*)first)->op_last->op_sibling = last;
1693 first->op_flags |= OPf_KIDS;
1694 ((LISTOP*)first)->op_first = last;
1696 ((LISTOP*)first)->op_last = last;
1697 ((LISTOP*)first)->op_children++;
1702 append_list(type, first, last)
1713 if (first->op_type != type)
1714 return prepend_elem(type, (OP*)first, (OP*)last);
1716 if (last->op_type != type)
1717 return append_elem(type, (OP*)first, (OP*)last);
1719 first->op_last->op_sibling = last->op_first;
1720 first->op_last = last->op_last;
1721 first->op_children += last->op_children;
1722 if (first->op_children)
1723 last->op_flags |= OPf_KIDS;
1730 prepend_elem(type, first, last)
1741 if (last->op_type == type) {
1742 if (type == OP_LIST) { /* already a PUSHMARK there */
1743 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1744 ((LISTOP*)last)->op_first->op_sibling = first;
1747 if (!(last->op_flags & OPf_KIDS)) {
1748 ((LISTOP*)last)->op_last = first;
1749 last->op_flags |= OPf_KIDS;
1751 first->op_sibling = ((LISTOP*)last)->op_first;
1752 ((LISTOP*)last)->op_first = first;
1754 ((LISTOP*)last)->op_children++;
1758 return newLISTOP(type, 0, first, last);
1766 return newOP(OP_STUB, 0);
1773 if (!op || op->op_type != OP_LIST)
1774 op = newLISTOP(OP_LIST, 0, op, Nullop);
1780 newLISTOP(type, flags, first, last)
1788 Newz(1101, listop, 1, LISTOP);
1790 listop->op_type = type;
1791 listop->op_ppaddr = ppaddr[type];
1792 listop->op_children = (first != 0) + (last != 0);
1793 listop->op_flags = flags;
1797 else if (!first && last)
1800 first->op_sibling = last;
1801 listop->op_first = first;
1802 listop->op_last = last;
1803 if (type == OP_LIST) {
1805 pushop = newOP(OP_PUSHMARK, 0);
1806 pushop->op_sibling = first;
1807 listop->op_first = pushop;
1808 listop->op_flags |= OPf_KIDS;
1810 listop->op_last = pushop;
1812 else if (listop->op_children)
1813 listop->op_flags |= OPf_KIDS;
1824 Newz(1101, op, 1, OP);
1826 op->op_ppaddr = ppaddr[type];
1827 op->op_flags = flags;
1830 op->op_private = 0 + (flags >> 8);
1831 if (opargs[type] & OA_RETSCALAR)
1833 if (opargs[type] & OA_TARGET)
1834 op->op_targ = pad_alloc(type, SVs_PADTMP);
1835 return CHECKOP(type, op);
1839 newUNOP(type, flags, first)
1847 first = newOP(OP_STUB, 0);
1848 if (opargs[type] & OA_MARK)
1849 first = force_list(first);
1851 Newz(1101, unop, 1, UNOP);
1852 unop->op_type = type;
1853 unop->op_ppaddr = ppaddr[type];
1854 unop->op_first = first;
1855 unop->op_flags = flags | OPf_KIDS;
1856 unop->op_private = 1 | (flags >> 8);
1858 unop = (UNOP*) CHECKOP(type, unop);
1862 return fold_constants((OP *) unop);
1866 newBINOP(type, flags, first, last)
1873 Newz(1101, binop, 1, BINOP);
1876 first = newOP(OP_NULL, 0);
1878 binop->op_type = type;
1879 binop->op_ppaddr = ppaddr[type];
1880 binop->op_first = first;
1881 binop->op_flags = flags | OPf_KIDS;
1884 binop->op_private = 1 | (flags >> 8);
1887 binop->op_private = 2 | (flags >> 8);
1888 first->op_sibling = last;
1891 binop = (BINOP*)CHECKOP(type, binop);
1895 binop->op_last = last = binop->op_first->op_sibling;
1897 return fold_constants((OP *)binop);
1901 pmtrans(op, expr, repl)
1906 SV *tstr = ((SVOP*)expr)->op_sv;
1907 SV *rstr = ((SVOP*)repl)->op_sv;
1910 register U8 *t = (U8*)SvPV(tstr, tlen);
1911 register U8 *r = (U8*)SvPV(rstr, rlen);
1916 register short *tbl;
1918 tbl = (short*)cPVOP->op_pv;
1919 complement = op->op_private & OPpTRANS_COMPLEMENT;
1920 delete = op->op_private & OPpTRANS_DELETE;
1921 /* squash = op->op_private & OPpTRANS_SQUASH; */
1924 Zero(tbl, 256, short);
1925 for (i = 0; i < tlen; i++)
1927 for (i = 0, j = 0; i < 256; i++) {
1943 if (!rlen && !delete) {
1946 for (i = 0; i < 256; i++)
1948 for (i = 0, j = 0; i < tlen; i++,j++) {
1951 if (tbl[t[i]] == -1)
1957 if (tbl[t[i]] == -1)
1968 newPMOP(type, flags)
1974 Newz(1101, pmop, 1, PMOP);
1975 pmop->op_type = type;
1976 pmop->op_ppaddr = ppaddr[type];
1977 pmop->op_flags = flags;
1978 pmop->op_private = 0 | (flags >> 8);
1980 if (hints & HINT_LOCALE)
1981 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
1983 /* link into pm list */
1984 if (type != OP_TRANS && curstash) {
1985 pmop->op_pmnext = HvPMROOT(curstash);
1986 HvPMROOT(curstash) = pmop;
1993 pmruntime(op, expr, repl)
2001 if (op->op_type == OP_TRANS)
2002 return pmtrans(op, expr, repl);
2006 if (expr->op_type == OP_CONST) {
2008 SV *pat = ((SVOP*)expr)->op_sv;
2009 char *p = SvPV(pat, plen);
2010 if ((op->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2011 sv_setpvn(pat, "\\s+", 3);
2012 p = SvPV(pat, plen);
2013 pm->op_pmflags |= PMf_SKIPWHITE;
2015 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2016 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2017 pm->op_pmflags |= PMf_WHITE;
2022 if (pm->op_pmflags & PMf_KEEP)
2023 expr = newUNOP(OP_REGCMAYBE,0,expr);
2025 Newz(1101, rcop, 1, LOGOP);
2026 rcop->op_type = OP_REGCOMP;
2027 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2028 rcop->op_first = scalar(expr);
2029 rcop->op_flags |= OPf_KIDS;
2030 rcop->op_private = 1;
2031 rcop->op_other = op;
2033 /* establish postfix order */
2034 if (pm->op_pmflags & PMf_KEEP) {
2036 rcop->op_next = expr;
2037 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2040 rcop->op_next = LINKLIST(expr);
2041 expr->op_next = (OP*)rcop;
2044 prepend_elem(op->op_type, scalar((OP*)rcop), op);
2049 if (pm->op_pmflags & PMf_EVAL)
2051 else if (repl->op_type == OP_CONST)
2055 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2056 if (opargs[curop->op_type] & OA_DANGEROUS) {
2057 if (curop->op_type == OP_GV) {
2058 GV *gv = ((GVOP*)curop)->op_gv;
2059 if (strchr("&`'123456789+", *GvENAME(gv)))
2062 else if (curop->op_type == OP_RV2CV)
2064 else if (curop->op_type == OP_RV2SV ||
2065 curop->op_type == OP_RV2AV ||
2066 curop->op_type == OP_RV2HV ||
2067 curop->op_type == OP_RV2GV) {
2068 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2071 else if (curop->op_type == OP_PADSV ||
2072 curop->op_type == OP_PADAV ||
2073 curop->op_type == OP_PADHV ||
2074 curop->op_type == OP_PADANY) {
2083 if (curop == repl) {
2084 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2085 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2086 prepend_elem(op->op_type, scalar(repl), op);
2089 Newz(1101, rcop, 1, LOGOP);
2090 rcop->op_type = OP_SUBSTCONT;
2091 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2092 rcop->op_first = scalar(repl);
2093 rcop->op_flags |= OPf_KIDS;
2094 rcop->op_private = 1;
2095 rcop->op_other = op;
2097 /* establish postfix order */
2098 rcop->op_next = LINKLIST(repl);
2099 repl->op_next = (OP*)rcop;
2101 pm->op_pmreplroot = scalar((OP*)rcop);
2102 pm->op_pmreplstart = LINKLIST(rcop);
2111 newSVOP(type, flags, sv)
2117 Newz(1101, svop, 1, SVOP);
2118 svop->op_type = type;
2119 svop->op_ppaddr = ppaddr[type];
2121 svop->op_next = (OP*)svop;
2122 svop->op_flags = flags;
2123 if (opargs[type] & OA_RETSCALAR)
2125 if (opargs[type] & OA_TARGET)
2126 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2127 return CHECKOP(type, svop);
2131 newGVOP(type, flags, gv)
2137 Newz(1101, gvop, 1, GVOP);
2138 gvop->op_type = type;
2139 gvop->op_ppaddr = ppaddr[type];
2140 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2141 gvop->op_next = (OP*)gvop;
2142 gvop->op_flags = flags;
2143 if (opargs[type] & OA_RETSCALAR)
2145 if (opargs[type] & OA_TARGET)
2146 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2147 return CHECKOP(type, gvop);
2151 newPVOP(type, flags, pv)
2157 Newz(1101, pvop, 1, PVOP);
2158 pvop->op_type = type;
2159 pvop->op_ppaddr = ppaddr[type];
2161 pvop->op_next = (OP*)pvop;
2162 pvop->op_flags = flags;
2163 if (opargs[type] & OA_RETSCALAR)
2165 if (opargs[type] & OA_TARGET)
2166 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2167 return CHECKOP(type, pvop);
2176 save_hptr(&curstash);
2177 save_item(curstname);
2182 name = SvPV(sv, len);
2183 curstash = gv_stashpvn(name,len,TRUE);
2184 sv_setpvn(curstname, name, len);
2188 sv_setpv(curstname,"<none>");
2196 utilize(aver, floor, version, id, arg)
2209 if (id->op_type != OP_CONST)
2210 croak("Module name must be constant");
2214 if(version != Nullop) {
2215 SV *vesv = ((SVOP*)version)->op_sv;
2217 if (arg == Nullop && !SvNIOK(vesv)) {
2224 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2225 croak("Version number must be constant number");
2227 /* Make copy of id so we don't free it twice */
2228 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2230 /* Fake up a method call to VERSION */
2231 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2232 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2233 append_elem(OP_LIST,
2234 prepend_elem(OP_LIST, pack, list(version)),
2235 newUNOP(OP_METHOD, 0, meth)));
2239 /* Fake up an import/unimport */
2240 if (arg && arg->op_type == OP_STUB)
2241 imop = arg; /* no import on explicit () */
2242 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2243 imop = Nullop; /* use 5.0; */
2246 /* Make copy of id so we don't free it twice */
2247 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2248 meth = newSVOP(OP_CONST, 0,
2250 ? newSVpv("import", 6)
2251 : newSVpv("unimport", 8)
2253 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2254 append_elem(OP_LIST,
2255 prepend_elem(OP_LIST, pack, list(arg)),
2256 newUNOP(OP_METHOD, 0, meth)));
2259 /* Fake up a require */
2260 rqop = newUNOP(OP_REQUIRE, 0, id);
2262 /* Fake up the BEGIN {}, which does its thing immediately. */
2264 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2266 append_elem(OP_LINESEQ,
2267 append_elem(OP_LINESEQ,
2268 newSTATEOP(0, Nullch, rqop),
2269 newSTATEOP(0, Nullch, veop)),
2270 newSTATEOP(0, Nullch, imop) ));
2277 newSLICEOP(flags, subscript, listval)
2282 return newBINOP(OP_LSLICE, flags,
2283 list(force_list(subscript)),
2284 list(force_list(listval)) );
2294 if (op->op_type == OP_NULL && op->op_flags & OPf_KIDS)
2295 op = cUNOP->op_first;
2297 if (op->op_type == OP_COND_EXPR) {
2298 I32 t = list_assignment(cCONDOP->op_first->op_sibling);
2299 I32 f = list_assignment(cCONDOP->op_first->op_sibling->op_sibling);
2304 yyerror("Assignment to both a list and a scalar");
2308 if (op->op_type == OP_LIST || op->op_flags & OPf_PARENS ||
2309 op->op_type == OP_RV2AV || op->op_type == OP_RV2HV ||
2310 op->op_type == OP_ASLICE || op->op_type == OP_HSLICE)
2313 if (op->op_type == OP_PADAV || op->op_type == OP_PADHV)
2316 if (op->op_type == OP_RV2SV)
2323 newASSIGNOP(flags, left, optype, right)
2332 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2333 return newLOGOP(optype, 0,
2334 mod(scalar(left), optype),
2335 newUNOP(OP_SASSIGN, 0, scalar(right)));
2338 return newBINOP(optype, OPf_STACKED,
2339 mod(scalar(left), optype), scalar(right));
2343 if (list_assignment(left)) {
2345 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2346 left = mod(left, OP_AASSIGN);
2354 op = newBINOP(OP_AASSIGN, flags,
2355 list(force_list(right)),
2356 list(force_list(left)) );
2357 op->op_private = 0 | (flags >> 8);
2358 if (!(left->op_private & OPpLVAL_INTRO)) {
2359 static int generation = 100;
2363 for (curop = LINKLIST(op); curop != op; curop = LINKLIST(curop)) {
2364 if (opargs[curop->op_type] & OA_DANGEROUS) {
2365 if (curop->op_type == OP_GV) {
2366 GV *gv = ((GVOP*)curop)->op_gv;
2367 if (gv == defgv || SvCUR(gv) == generation)
2369 SvCUR(gv) = generation;
2371 else if (curop->op_type == OP_PADSV ||
2372 curop->op_type == OP_PADAV ||
2373 curop->op_type == OP_PADHV ||
2374 curop->op_type == OP_PADANY) {
2375 SV **svp = AvARRAY(comppad_name);
2376 SV *sv = svp[curop->op_targ];
2377 if (SvCUR(sv) == generation)
2379 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2381 else if (curop->op_type == OP_RV2CV)
2383 else if (curop->op_type == OP_RV2SV ||
2384 curop->op_type == OP_RV2AV ||
2385 curop->op_type == OP_RV2HV ||
2386 curop->op_type == OP_RV2GV) {
2387 if (lastop->op_type != OP_GV) /* funny deref? */
2396 op->op_private = OPpASSIGN_COMMON;
2398 if (right && right->op_type == OP_SPLIT) {
2400 if ((tmpop = ((LISTOP*)right)->op_first) &&
2401 tmpop->op_type == OP_PUSHRE)
2403 PMOP *pm = (PMOP*)tmpop;
2404 if (left->op_type == OP_RV2AV &&
2405 !(left->op_private & OPpLVAL_INTRO) &&
2406 !(op->op_private & OPpASSIGN_COMMON) )
2408 tmpop = ((UNOP*)left)->op_first;
2409 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2410 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2411 pm->op_pmflags |= PMf_ONCE;
2412 tmpop = ((UNOP*)op)->op_first; /* to list (nulled) */
2413 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2414 tmpop->op_sibling = Nullop; /* don't free split */
2415 right->op_next = tmpop->op_next; /* fix starting loc */
2416 op_free(op); /* blow off assign */
2417 right->op_flags &= ~OPf_WANT;
2418 /* "I don't know and I don't care." */
2423 if (modcount < 10000 &&
2424 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2426 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2428 sv_setiv(sv, modcount+1);
2436 right = newOP(OP_UNDEF, 0);
2437 if (right->op_type == OP_READLINE) {
2438 right->op_flags |= OPf_STACKED;
2439 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2442 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2443 op = newBINOP(OP_SASSIGN, flags,
2444 scalar(right), mod(scalar(left), OP_SASSIGN) );
2456 newSTATEOP(flags, label, op)
2461 U32 seq = intro_my();
2464 Newz(1101, cop, 1, COP);
2465 if (perldb && curcop->cop_line && curstash != debstash) {
2466 cop->op_type = OP_DBSTATE;
2467 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2470 cop->op_type = OP_NEXTSTATE;
2471 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2473 cop->op_flags = flags;
2474 cop->op_private = 0 | (flags >> 8);
2476 cop->op_private |= NATIVE_HINTS;
2478 cop->op_next = (OP*)cop;
2481 cop->cop_label = label;
2482 hints |= HINT_BLOCK_SCOPE;
2485 cop->cop_arybase = curcop->cop_arybase;
2487 if (copline == NOLINE)
2488 cop->cop_line = curcop->cop_line;
2490 cop->cop_line = copline;
2493 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2494 cop->cop_stash = curstash;
2496 if (perldb && curstash != debstash) {
2497 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2498 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2499 (void)SvIOK_on(*svp);
2501 SvSTASH(*svp) = (HV*)cop;
2505 return prepend_elem(OP_LINESEQ, (OP*)cop, op);
2508 /* "Introduce" my variables to visible status. */
2516 if (! min_intro_pending)
2519 svp = AvARRAY(comppad_name);
2520 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2521 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2522 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2523 SvNVX(sv) = (double)cop_seqmax;
2526 min_intro_pending = 0;
2527 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2528 return cop_seqmax++;
2532 newLOGOP(type, flags, first, other)
2541 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2542 return newBINOP(type, flags, scalar(first), scalar(other));
2544 scalarboolean(first);
2545 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2546 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2547 if (type == OP_AND || type == OP_OR) {
2553 first = cUNOP->op_first;
2555 first->op_next = op->op_next;
2556 cUNOP->op_first = Nullop;
2560 if (first->op_type == OP_CONST) {
2561 if (dowarn && (first->op_private & OPpCONST_BARE))
2562 warn("Probable precedence problem on %s", op_desc[type]);
2563 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2572 else if (first->op_type == OP_WANTARRAY) {
2578 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2579 OP *k1 = ((UNOP*)first)->op_first;
2580 OP *k2 = k1->op_sibling;
2582 switch (first->op_type)
2585 if (k2 && k2->op_type == OP_READLINE
2586 && (k2->op_flags & OPf_STACKED)
2587 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2588 warnop = k2->op_type;
2592 if (k1->op_type == OP_READDIR
2593 || k1->op_type == OP_GLOB
2594 || k1->op_type == OP_EACH)
2595 warnop = k1->op_type;
2599 line_t oldline = curcop->cop_line;
2600 curcop->cop_line = copline;
2601 warn("Value of %s%s can be \"0\"; test with defined()",
2603 ((warnop == OP_READLINE || warnop == OP_GLOB)
2604 ? " construct" : "() operator"));
2605 curcop->cop_line = oldline;
2612 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2613 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2615 Newz(1101, logop, 1, LOGOP);
2617 logop->op_type = type;
2618 logop->op_ppaddr = ppaddr[type];
2619 logop->op_first = first;
2620 logop->op_flags = flags | OPf_KIDS;
2621 logop->op_other = LINKLIST(other);
2622 logop->op_private = 1 | (flags >> 8);
2624 /* establish postfix order */
2625 logop->op_next = LINKLIST(first);
2626 first->op_next = (OP*)logop;
2627 first->op_sibling = other;
2629 op = newUNOP(OP_NULL, 0, (OP*)logop);
2630 other->op_next = op;
2636 newCONDOP(flags, first, trueop, falseop)
2646 return newLOGOP(OP_AND, 0, first, trueop);
2648 return newLOGOP(OP_OR, 0, first, falseop);
2650 scalarboolean(first);
2651 if (first->op_type == OP_CONST) {
2652 if (SvTRUE(((SVOP*)first)->op_sv)) {
2663 else if (first->op_type == OP_WANTARRAY) {
2667 Newz(1101, condop, 1, CONDOP);
2669 condop->op_type = OP_COND_EXPR;
2670 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2671 condop->op_first = first;
2672 condop->op_flags = flags | OPf_KIDS;
2673 condop->op_true = LINKLIST(trueop);
2674 condop->op_false = LINKLIST(falseop);
2675 condop->op_private = 1 | (flags >> 8);
2677 /* establish postfix order */
2678 condop->op_next = LINKLIST(first);
2679 first->op_next = (OP*)condop;
2681 first->op_sibling = trueop;
2682 trueop->op_sibling = falseop;
2683 op = newUNOP(OP_NULL, 0, (OP*)condop);
2685 trueop->op_next = op;
2686 falseop->op_next = op;
2692 newRANGE(flags, left, right)
2702 Newz(1101, condop, 1, CONDOP);
2704 condop->op_type = OP_RANGE;
2705 condop->op_ppaddr = ppaddr[OP_RANGE];
2706 condop->op_first = left;
2707 condop->op_flags = OPf_KIDS;
2708 condop->op_true = LINKLIST(left);
2709 condop->op_false = LINKLIST(right);
2710 condop->op_private = 1 | (flags >> 8);
2712 left->op_sibling = right;
2714 condop->op_next = (OP*)condop;
2715 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2716 flop = newUNOP(OP_FLOP, 0, flip);
2717 op = newUNOP(OP_NULL, 0, flop);
2720 left->op_next = flip;
2721 right->op_next = flop;
2723 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2724 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2725 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2726 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2728 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2729 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2732 if (!flip->op_private || !flop->op_private)
2733 linklist(op); /* blow off optimizer unless constant */
2739 newLOOPOP(flags, debuggable, expr, block)
2747 int once = block && block->op_flags & OPf_SPECIAL &&
2748 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2751 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2752 return block; /* do {} while 0 does once */
2753 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB) {
2754 expr = newUNOP(OP_DEFINED, 0,
2755 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2759 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2760 op = newLOGOP(OP_AND, 0, expr, listop);
2762 ((LISTOP*)listop)->op_last->op_next = LINKLIST(op);
2764 if (once && op != listop)
2765 op->op_next = ((LOGOP*)cUNOP->op_first)->op_other;
2768 op = newUNOP(OP_NULL, 0, op); /* or do {} while 1 loses outer block */
2770 op->op_flags |= flags;
2772 op->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2777 newWHILEOP(flags, debuggable, loop, expr, block, cont)
2791 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB)) {
2792 expr = newUNOP(OP_DEFINED, 0,
2793 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2797 block = newOP(OP_NULL, 0);
2800 next = LINKLIST(cont);
2802 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2804 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2805 redo = LINKLIST(listop);
2808 op = newLOGOP(OP_AND, 0, expr, scalar(listop));
2809 if (op == expr && op->op_type == OP_CONST && !SvTRUE(cSVOP->op_sv)) {
2810 op_free(expr); /* oops, it's a while (0) */
2812 return Nullop; /* (listop already freed by newLOGOP) */
2814 ((LISTOP*)listop)->op_last->op_next = condop =
2815 (op == listop ? redo : LINKLIST(op));
2823 Newz(1101,loop,1,LOOP);
2824 loop->op_type = OP_ENTERLOOP;
2825 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2826 loop->op_private = 0;
2827 loop->op_next = (OP*)loop;
2830 op = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, op);
2832 loop->op_redoop = redo;
2833 loop->op_lastop = op;
2836 loop->op_nextop = next;
2838 loop->op_nextop = op;
2840 op->op_flags |= flags;
2841 op->op_private |= (flags >> 8);
2846 #ifndef CAN_PROTOTYPE
2847 newFOROP(flags,label,forline,sv,expr,block,cont)
2856 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2857 #endif /* CAN_PROTOTYPE */
2865 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2866 sv->op_type = OP_RV2GV;
2867 sv->op_ppaddr = ppaddr[OP_RV2GV];
2869 else if (sv->op_type == OP_PADSV) { /* private variable */
2870 padoff = sv->op_targ;
2875 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2878 sv = newGVOP(OP_GV, 0, defgv);
2880 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2881 expr = scalar(ref(expr, OP_ITER));
2882 iterflags |= OPf_STACKED;
2884 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2885 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2887 assert(!loop->op_next);
2888 Renew(loop, 1, LOOP);
2889 loop->op_targ = padoff;
2890 return newSTATEOP(0, label, newWHILEOP(flags, 1, loop,
2891 newOP(OP_ITER, 0), block, cont));
2895 newLOOPEX(type, label)
2900 if (type != OP_GOTO || label->op_type == OP_CONST) {
2901 op = newPVOP(type, 0, savepv(
2902 label->op_type == OP_CONST
2903 ? SvPVx(((SVOP*)label)->op_sv, na)
2908 if (label->op_type == OP_ENTERSUB)
2909 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2910 op = newUNOP(type, OPf_STACKED, label);
2912 hints |= HINT_BLOCK_SCOPE;
2920 if (!CvXSUB(cv) && CvROOT(cv)) {
2922 croak("Can't undef active subroutine");
2929 op_free(CvROOT(cv));
2930 CvROOT(cv) = Nullop;
2933 SvPOK_off((SV*)cv); /* forget prototype */
2935 SvREFCNT_dec(CvGV(cv));
2937 SvREFCNT_dec(CvOUTSIDE(cv));
2938 CvOUTSIDE(cv) = Nullcv;
2939 if (CvPADLIST(cv)) {
2940 /* may be during global destruction */
2941 if (SvREFCNT(CvPADLIST(cv))) {
2942 I32 i = AvFILL(CvPADLIST(cv));
2944 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
2945 SV* sv = svp ? *svp : Nullsv;
2948 if (sv == (SV*)comppad_name)
2949 comppad_name = Nullav;
2950 else if (sv == (SV*)comppad) {
2952 curpad = Null(SV**);
2956 SvREFCNT_dec((SV*)CvPADLIST(cv));
2958 CvPADLIST(cv) = Nullav;
2962 #ifdef DEBUG_CLOSURES
2967 CV *outside = CvOUTSIDE(cv);
2968 AV* padlist = CvPADLIST(cv);
2975 PerlIO_printf(Perl_debug_log, "\tCV=0x%p (%s), OUTSIDE=0x%p (%s)\n",
2977 (CvANON(cv) ? "ANON"
2978 : (cv == main_cv) ? "MAIN"
2979 : CvUNIQUE(outside) ? "UNIQUE"
2980 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
2983 : CvANON(outside) ? "ANON"
2984 : (outside == main_cv) ? "MAIN"
2985 : CvUNIQUE(outside) ? "UNIQUE"
2986 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
2991 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
2992 pad = (AV*)*av_fetch(padlist, 1, FALSE);
2993 pname = AvARRAY(pad_name);
2994 ppad = AvARRAY(pad);
2996 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
2997 if (SvPOK(pname[ix]))
2998 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%p (%s\"%s\" %ld-%ld)\n",
3000 SvFAKE(pname[ix]) ? "FAKE " : "",
3002 (long)I_32(SvNVX(pname[ix])),
3003 (long)SvIVX(pname[ix]));
3006 #endif /* DEBUG_CLOSURES */
3009 cv_clone2(proto, outside)
3015 AV* protopadlist = CvPADLIST(proto);
3016 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3017 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3018 SV** pname = AvARRAY(protopad_name);
3019 SV** ppad = AvARRAY(protopad);
3020 I32 fname = AvFILL(protopad_name);
3021 I32 fpad = AvFILL(protopad);
3025 assert(!CvUNIQUE(proto));
3030 SAVESPTR(comppad_name);
3033 cv = compcv = (CV*)NEWSV(1104,0);
3034 sv_upgrade((SV *)cv, SvTYPE(proto));
3039 CvFILEGV(cv) = CvFILEGV(proto);
3040 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3041 CvSTASH(cv) = CvSTASH(proto);
3042 CvROOT(cv) = CvROOT(proto);
3043 CvSTART(cv) = CvSTART(proto);
3045 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3048 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3050 comppad_name = newAV();
3051 for (ix = fname; ix >= 0; ix--)
3052 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3056 comppadlist = newAV();
3057 AvREAL_off(comppadlist);
3058 av_store(comppadlist, 0, (SV*)comppad_name);
3059 av_store(comppadlist, 1, (SV*)comppad);
3060 CvPADLIST(cv) = comppadlist;
3061 av_fill(comppad, AvFILL(protopad));
3062 curpad = AvARRAY(comppad);
3064 av = newAV(); /* will be @_ */
3066 av_store(comppad, 0, (SV*)av);
3067 AvFLAGS(av) = AVf_REIFY;
3069 for (ix = fpad; ix > 0; ix--) {
3070 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3071 if (namesv && namesv != &sv_undef) {
3072 char *name = SvPVX(namesv); /* XXX */
3073 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3074 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3075 CvOUTSIDE(cv), cxstack_ix);
3077 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3079 croak("panic: cv_clone: %s", name);
3081 else { /* our own lexical */
3084 /* anon code -- we'll come back for it */
3085 sv = SvREFCNT_inc(ppad[ix]);
3087 else if (*name == '@')
3089 else if (*name == '%')
3099 SV* sv = NEWSV(0,0);
3105 /* Now that vars are all in place, clone nested closures. */
3107 for (ix = fpad; ix > 0; ix--) {
3108 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3110 && namesv != &sv_undef
3111 && !(SvFLAGS(namesv) & SVf_FAKE)
3112 && *SvPVX(namesv) == '&'
3113 && CvCLONE(ppad[ix]))
3115 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3116 SvREFCNT_dec(ppad[ix]);
3119 curpad[ix] = (SV*)kid;
3123 #ifdef DEBUG_CLOSURES
3124 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3126 PerlIO_printf(Perl_debug_log, " from:\n");
3128 PerlIO_printf(Perl_debug_log, " to:\n");
3140 return cv_clone2(proto, CvOUTSIDE(proto));
3144 cv_ckproto(cv, gv, p)
3149 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3150 SV* msg = sv_newmortal();
3154 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3155 sv_setpv(msg, "Prototype mismatch:");
3157 sv_catpvf(msg, " sub %_", name);
3159 sv_catpvf(msg, " (%s)", SvPVX(cv));
3160 sv_catpv(msg, " vs ");
3162 sv_catpvf(msg, "(%s)", p);
3164 sv_catpv(msg, "none");
3176 if (!cv || !SvPOK(cv) || SvCUR(cv))
3180 for (o = CvSTART(cv); o; o = o->op_next) {
3181 OPCODE type = o->op_type;
3183 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3185 if (type == OP_LEAVESUB || type == OP_RETURN)
3189 if (type == OP_CONST)
3190 sv = ((SVOP*)o)->op_sv;
3191 else if (type == OP_PADSV) {
3192 AV* pad = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3193 sv = pad ? AvARRAY(pad)[o->op_targ] : Nullsv;
3194 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3206 newSUB(floor,op,proto,block)
3212 char *name = op ? SvPVx(cSVOP->op_sv, na) : Nullch;
3213 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3214 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3223 if (!name || GvCVGEN(gv))
3225 else if (cv = GvCV(gv)) {
3226 cv_ckproto(cv, gv, ps);
3227 /* already defined (or promised)? */
3228 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3231 /* just a "sub foo;" when &foo is already defined */
3235 /* ahem, death to those who redefine active sort subs */
3236 if (curstack == sortstack && sortcop == CvSTART(cv))
3237 croak("Can't redefine active sort subroutine %s", name);
3238 const_sv = cv_const_sv(cv);
3239 if (const_sv || dowarn) {
3240 line_t oldline = curcop->cop_line;
3241 curcop->cop_line = copline;
3242 warn(const_sv ? "Constant subroutine %s redefined"
3243 : "Subroutine %s redefined", name);
3244 curcop->cop_line = oldline;
3250 if (cv) { /* must reuse cv if autoloaded */
3252 CvFLAGS(cv) = CvFLAGS(compcv);
3253 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3254 CvOUTSIDE(compcv) = 0;
3255 CvPADLIST(cv) = CvPADLIST(compcv);
3256 CvPADLIST(compcv) = 0;
3257 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3258 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3259 SvREFCNT_dec(compcv);
3269 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3270 CvFILEGV(cv) = curcop->cop_filegv;
3271 CvSTASH(cv) = curstash;
3274 sv_setpv((SV*)cv, ps);
3280 char *s = strrchr(name, ':');
3282 if (strEQ(s, "BEGIN")) {
3284 "BEGIN not safe after errors--compilation aborted";
3288 /* force display of errors found but not reported */
3289 sv_catpv(GvSV(errgv), not_safe);
3290 croak("%s", SvPVx(GvSV(errgv), na));
3301 if (AvFILL(comppad_name) < AvFILL(comppad))
3302 av_store(comppad_name, AvFILL(comppad), Nullsv);
3305 SV **namep = AvARRAY(comppad_name);
3306 for (ix = AvFILL(comppad); ix > 0; ix--) {
3309 if (SvIMMORTAL(curpad[ix]))
3312 * The only things that a clonable function needs in its
3313 * pad are references to outer lexicals and anonymous subs.
3314 * The rest are created anew during cloning.
3316 if (!((namesv = namep[ix]) != Nullsv &&
3317 namesv != &sv_undef &&
3319 *SvPVX(namesv) == '&')))
3321 SvREFCNT_dec(curpad[ix]);
3322 curpad[ix] = Nullsv;
3327 AV *av = newAV(); /* Will be @_ */
3329 av_store(comppad, 0, (SV*)av);
3330 AvFLAGS(av) = AVf_REIFY;
3332 for (ix = AvFILL(comppad); ix > 0; ix--) {
3333 if (SvIMMORTAL(curpad[ix]))
3335 if (!SvPADMY(curpad[ix]))
3336 SvPADTMP_on(curpad[ix]);
3340 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3341 CvSTART(cv) = LINKLIST(CvROOT(cv));
3342 CvROOT(cv)->op_next = 0;
3348 if (perldb && curstash != debstash) {
3349 SV *sv = NEWSV(0,0);
3350 SV *tmpstr = sv_newmortal();
3351 static GV *db_postponed;
3355 sv_setpvf(sv, "%_:%ld-%ld",
3356 GvSV(curcop->cop_filegv),
3357 (long)subline, (long)curcop->cop_line);
3358 gv_efullname3(tmpstr, gv, Nullch);
3359 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3360 if (!db_postponed) {
3361 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3363 hv = GvHVn(db_postponed);
3364 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3365 && (cv = GvCV(db_postponed))) {
3370 perl_call_sv((SV*)cv, G_DISCARD);
3374 if ((s = strrchr(name,':')))
3378 if (strEQ(s, "BEGIN")) {
3379 I32 oldscope = scopestack_ix;
3381 SAVESPTR(compiling.cop_filegv);
3382 SAVEI16(compiling.cop_line);
3389 DEBUG_x( dump_sub(gv) );
3390 av_push(beginav, (SV *)cv);
3392 call_list(oldscope, beginav);
3394 curcop = &compiling;
3397 else if (strEQ(s, "END") && !error_count) {
3400 av_unshift(endav, 1);
3401 av_store(endav, 0, (SV *)cv);
3414 newXSUB(name, ix, subaddr, filename)
3420 CV* cv = newXS(name, (void(*)())subaddr, filename);
3422 CvXSUBANY(cv).any_i32 = ix;
3428 newXS(name, subaddr, filename)
3430 void (*subaddr) _((CV*));
3433 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3436 if (cv = (name ? GvCV(gv) : Nullcv)) {
3438 /* just a cached method */
3442 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3443 /* already defined (or promised) */
3445 line_t oldline = curcop->cop_line;
3446 curcop->cop_line = copline;
3447 warn("Subroutine %s redefined",name);
3448 curcop->cop_line = oldline;
3455 if (cv) /* must reuse cv if autoloaded */
3458 cv = (CV*)NEWSV(1105,0);
3459 sv_upgrade((SV *)cv, SVt_PVCV);
3466 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3467 CvFILEGV(cv) = gv_fetchfile(filename);
3468 CvXSUB(cv) = subaddr;
3471 char *s = strrchr(name,':');
3476 if (strEQ(s, "BEGIN")) {
3479 av_push(beginav, (SV *)cv);
3482 else if (strEQ(s, "END")) {
3485 av_unshift(endav, 1);
3486 av_store(endav, 0, (SV *)cv);
3497 newFORM(floor,op,block)
3508 name = SvPVx(cSVOP->op_sv, na);
3511 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3513 if (cv = GvFORM(gv)) {
3515 line_t oldline = curcop->cop_line;
3517 curcop->cop_line = copline;
3518 warn("Format %s redefined",name);
3519 curcop->cop_line = oldline;
3525 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3526 CvFILEGV(cv) = curcop->cop_filegv;
3528 for (ix = AvFILL(comppad); ix > 0; ix--) {
3529 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3530 SvPADTMP_on(curpad[ix]);
3533 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3534 CvSTART(cv) = LINKLIST(CvROOT(cv));
3535 CvROOT(cv)->op_next = 0;
3546 return newUNOP(OP_REFGEN, 0,
3547 mod(list(convert(OP_ANONLIST, 0, op)), OP_REFGEN));
3554 return newUNOP(OP_REFGEN, 0,
3555 mod(list(convert(OP_ANONHASH, 0, op)), OP_REFGEN));
3559 newANONSUB(floor, proto, block)
3564 return newUNOP(OP_REFGEN, 0,
3565 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3572 switch (o->op_type) {
3574 o->op_type = OP_PADAV;
3575 o->op_ppaddr = ppaddr[OP_PADAV];
3576 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3579 o->op_type = OP_RV2AV;
3580 o->op_ppaddr = ppaddr[OP_RV2AV];
3585 warn("oops: oopsAV");
3595 switch (o->op_type) {
3598 o->op_type = OP_PADHV;
3599 o->op_ppaddr = ppaddr[OP_PADHV];
3600 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3604 o->op_type = OP_RV2HV;
3605 o->op_ppaddr = ppaddr[OP_RV2HV];
3610 warn("oops: oopsHV");
3620 if (o->op_type == OP_PADANY) {
3621 o->op_type = OP_PADAV;
3622 o->op_ppaddr = ppaddr[OP_PADAV];
3625 return newUNOP(OP_RV2AV, 0, scalar(o));
3633 if (type == OP_MAPSTART)
3634 return newUNOP(OP_NULL, 0, o);
3635 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3642 if (o->op_type == OP_PADANY) {
3643 o->op_type = OP_PADHV;
3644 o->op_ppaddr = ppaddr[OP_PADHV];
3647 return newUNOP(OP_RV2HV, 0, scalar(o));
3654 croak("NOT IMPL LINE %d",__LINE__);
3664 return newUNOP(OP_RV2CV, flags, scalar(o));
3671 if (o->op_type == OP_PADANY) {
3672 o->op_type = OP_PADSV;
3673 o->op_ppaddr = ppaddr[OP_PADSV];
3676 return newUNOP(OP_RV2SV, 0, scalar(o));
3679 /* Check routines. */
3688 name = NEWSV(1106,0);
3689 sv_upgrade(name, SVt_PVNV);
3690 sv_setpvn(name, "&", 1);
3693 ix = pad_alloc(op->op_type, SVs_PADMY);
3694 av_store(comppad_name, ix, name);
3695 av_store(comppad, ix, cSVOP->op_sv);
3696 SvPADMY_on(cSVOP->op_sv);
3697 cSVOP->op_sv = Nullsv;
3698 cSVOP->op_targ = ix;
3706 op->op_private = hints;
3714 if (cUNOP->op_first->op_type == OP_CONCAT)
3715 op->op_flags |= OPf_STACKED;
3723 if (op->op_flags & OPf_KIDS) {
3726 OPCODE type = op->op_type;
3727 op = modkids(ck_fun(op), type);
3728 kid = cUNOP->op_first;
3729 newop = kUNOP->op_first->op_sibling;
3731 (newop->op_sibling ||
3732 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3733 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3734 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3738 op_free(kUNOP->op_first);
3739 kUNOP->op_first = newop;
3741 op->op_ppaddr = ppaddr[++op->op_type];
3751 if (op->op_flags & OPf_KIDS) {
3752 OP *kid = cUNOP->op_first;
3753 if (kid->op_type == OP_HSLICE)
3754 op->op_private |= OPpSLICE;
3755 else if (kid->op_type != OP_HELEM)
3756 croak("%s argument is not a HASH element or slice",
3757 op_desc[op->op_type]);
3767 I32 type = op->op_type;
3769 if (op->op_flags & OPf_KIDS) {
3770 if (cLISTOP->op_first->op_type == OP_STUB) {
3772 op = newUNOP(type, OPf_SPECIAL,
3773 newGVOP(OP_GV, 0, gv_fetchpv("main'ARGV", TRUE, SVt_PVAV)));
3784 hints |= HINT_BLOCK_SCOPE;
3785 if (op->op_flags & OPf_KIDS) {
3786 SVOP *kid = (SVOP*)cUNOP->op_first;
3789 op->op_flags &= ~OPf_KIDS;
3792 else if (kid->op_type == OP_LINESEQ) {
3795 kid->op_next = op->op_next;
3796 cUNOP->op_first = 0;
3799 Newz(1101, enter, 1, LOGOP);
3800 enter->op_type = OP_ENTERTRY;
3801 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3802 enter->op_private = 0;
3804 /* establish postfix order */
3805 enter->op_next = (OP*)enter;
3807 op = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3808 op->op_type = OP_LEAVETRY;
3809 op->op_ppaddr = ppaddr[OP_LEAVETRY];
3810 enter->op_other = op;
3816 op = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3818 op->op_targ = (PADOFFSET)hints;
3827 if (op->op_flags & OPf_STACKED) {
3829 kid = cUNOP->op_first->op_sibling;
3830 if (kid->op_type == OP_RV2GV)
3843 if (op->op_flags & OPf_KIDS) {
3844 OP *kid = cUNOP->op_first;
3845 if (kid->op_type != OP_HELEM)
3846 croak("%s argument is not a HASH element", op_desc[op->op_type]);
3856 o = fold_constants(o);
3857 if (o->op_type == OP_CONST)
3866 SVOP *kid = (SVOP*)cUNOP->op_first;
3868 op->op_private |= (hints & HINT_STRICT_REFS);
3869 if (kid->op_type == OP_CONST) {
3874 name = SvPV(kid->op_sv, na);
3875 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3876 char *badthing = Nullch;
3877 switch (op->op_type) {
3879 badthing = "a SCALAR";
3882 badthing = "an ARRAY";
3885 badthing = "a HASH";
3890 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3893 kid->op_type = OP_GV;
3894 iscv = (op->op_type == OP_RV2CV) * 2;
3895 for (gv = 0; !gv; iscv++) {
3897 * This is a little tricky. We only want to add the symbol if we
3898 * didn't add it in the lexer. Otherwise we get duplicate strict
3899 * warnings. But if we didn't add it in the lexer, we must at
3900 * least pretend like we wanted to add it even if it existed before,
3901 * or we get possible typo warnings. OPpCONST_ENTERED says
3902 * whether the lexer already added THIS instance of this symbol.
3904 gv = gv_fetchpv(name,
3905 iscv | !(kid->op_private & OPpCONST_ENTERED),
3908 : op->op_type == OP_RV2SV
3910 : op->op_type == OP_RV2AV
3912 : op->op_type == OP_RV2HV
3916 SvREFCNT_dec(kid->op_sv);
3917 kid->op_sv = SvREFCNT_inc(gv);
3926 I32 type = op->op_type;
3928 if (op->op_flags & OPf_REF)
3931 if (op->op_flags & OPf_KIDS) {
3932 SVOP *kid = (SVOP*)cUNOP->op_first;
3934 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3935 OP *newop = newGVOP(type, OPf_REF,
3936 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
3943 if (type == OP_FTTTY)
3944 return newGVOP(type, OPf_REF, gv_fetchpv("main'STDIN", TRUE,
3947 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3960 int type = op->op_type;
3961 register I32 oa = opargs[type] >> OASHIFT;
3963 if (op->op_flags & OPf_STACKED) {
3964 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
3967 return no_fh_allowed(op);
3970 if (op->op_flags & OPf_KIDS) {
3971 tokid = &cLISTOP->op_first;
3972 kid = cLISTOP->op_first;
3973 if (kid->op_type == OP_PUSHMARK ||
3974 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
3976 tokid = &kid->op_sibling;
3977 kid = kid->op_sibling;
3979 if (!kid && opargs[type] & OA_DEFGV)
3980 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
3984 sibl = kid->op_sibling;
3998 if (kid->op_type == OP_CONST &&
3999 (kid->op_private & OPpCONST_BARE)) {
4000 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4001 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4002 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4004 warn("Array @%s missing the @ in argument %ld of %s()",
4005 name, (long)numargs, op_desc[type]);
4008 kid->op_sibling = sibl;
4011 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4012 bad_type(numargs, "array", op_desc[op->op_type], kid);
4016 if (kid->op_type == OP_CONST &&
4017 (kid->op_private & OPpCONST_BARE)) {
4018 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4019 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4020 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4022 warn("Hash %%%s missing the %% in argument %ld of %s()",
4023 name, (long)numargs, op_desc[type]);
4026 kid->op_sibling = sibl;
4029 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4030 bad_type(numargs, "hash", op_desc[op->op_type], kid);
4035 OP *newop = newUNOP(OP_NULL, 0, kid);
4036 kid->op_sibling = 0;
4038 newop->op_next = newop;
4040 kid->op_sibling = sibl;
4045 if (kid->op_type != OP_GV) {
4046 if (kid->op_type == OP_CONST &&
4047 (kid->op_private & OPpCONST_BARE)) {
4048 OP *newop = newGVOP(OP_GV, 0,
4049 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4055 kid->op_sibling = 0;
4056 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4058 kid->op_sibling = sibl;
4064 mod(scalar(kid), type);
4068 tokid = &kid->op_sibling;
4069 kid = kid->op_sibling;
4071 op->op_private |= numargs;
4073 return too_many_arguments(op,op_desc[op->op_type]);
4076 else if (opargs[type] & OA_DEFGV) {
4078 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4082 while (oa & OA_OPTIONAL)
4084 if (oa && oa != OA_LIST)
4085 return too_few_arguments(op,op_desc[op->op_type]);
4094 GV *gv = gv_fetchpv("glob", FALSE, SVt_PVCV);
4096 if (gv && GvIMPORTED_CV(gv)) {
4097 static int glob_index;
4099 append_elem(OP_GLOB, op,
4100 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4101 op->op_type = OP_LIST;
4102 op->op_ppaddr = ppaddr[OP_LIST];
4103 ((LISTOP*)op)->op_first->op_type = OP_PUSHMARK;
4104 ((LISTOP*)op)->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4105 op = newUNOP(OP_ENTERSUB, OPf_STACKED,
4106 append_elem(OP_LIST, op,
4107 scalar(newUNOP(OP_RV2CV, 0,
4108 newGVOP(OP_GV, 0, gv)))));
4111 if ((op->op_flags & OPf_KIDS) && !cLISTOP->op_first->op_sibling)
4112 append_elem(OP_GLOB, op, newSVREF(newGVOP(OP_GV, 0, defgv)));
4113 gv = newGVgen("main");
4115 append_elem(OP_GLOB, op, newGVOP(OP_GV, 0, gv));
4126 OPCODE type = op->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4128 op->op_ppaddr = ppaddr[OP_GREPSTART];
4129 Newz(1101, gwop, 1, LOGOP);
4131 if (op->op_flags & OPf_STACKED) {
4134 kid = cLISTOP->op_first->op_sibling;
4135 for (k = cLISTOP->op_first->op_sibling->op_next; k; k = k->op_next) {
4138 kid->op_next = (OP*)gwop;
4139 op->op_flags &= ~OPf_STACKED;
4141 kid = cLISTOP->op_first->op_sibling;
4142 if (type == OP_MAPWHILE)
4149 kid = cLISTOP->op_first->op_sibling;
4150 if (kid->op_type != OP_NULL)
4151 croak("panic: ck_grep");
4152 kid = kUNOP->op_first;
4154 gwop->op_type = type;
4155 gwop->op_ppaddr = ppaddr[type];
4156 gwop->op_first = listkids(op);
4157 gwop->op_flags |= OPf_KIDS;
4158 gwop->op_private = 1;
4159 gwop->op_other = LINKLIST(kid);
4160 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4161 kid->op_next = (OP*)gwop;
4163 kid = cLISTOP->op_first->op_sibling;
4164 if (!kid || !kid->op_sibling)
4165 return too_few_arguments(op,op_desc[op->op_type]);
4166 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4167 mod(kid, OP_GREPSTART);
4176 if (op->op_flags & OPf_KIDS) {
4177 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4178 if (kid && kid->op_type == OP_CONST)
4179 fbm_compile(((SVOP*)kid)->op_sv);
4188 /* XXX length optimization goes here */
4196 OPCODE type = op->op_type;
4197 return modkids(ck_fun(op), type);
4204 OPCODE type = op->op_type;
4205 return refkids(ck_fun(op), type);
4214 kid = cLISTOP->op_first;
4216 op = force_list(op);
4217 kid = cLISTOP->op_first;
4219 if (kid->op_type == OP_PUSHMARK)
4220 kid = kid->op_sibling;
4221 if (kid && op->op_flags & OPf_STACKED)
4222 kid = kid->op_sibling;
4223 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4224 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4225 op->op_flags |= OPf_STACKED; /* make it a filehandle */
4226 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4227 cLISTOP->op_first->op_sibling = kid;
4228 cLISTOP->op_last = kid;
4229 kid = kid->op_sibling;
4234 append_elem(op->op_type, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4240 if (hints & HINT_LOCALE)
4241 op->op_private |= OPpLOCALE;
4255 if (hints & HINT_LOCALE)
4256 op->op_private |= OPpLOCALE;
4268 if (hints & HINT_LOCALE)
4269 op->op_private |= OPpLOCALE;
4279 cPMOP->op_pmflags |= PMf_RUNTIME;
4280 cPMOP->op_pmpermflags |= PMf_RUNTIME;
4295 if (cBINOP->op_first->op_flags & OPf_PARENS) {
4296 op->op_private |= OPpREPEAT_DOLIST;
4297 cBINOP->op_first = force_list(cBINOP->op_first);
4308 if (op->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4309 SVOP *kid = (SVOP*)cUNOP->op_first;
4311 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4313 for (s = SvPVX(kid->op_sv); *s; s++) {
4314 if (*s == ':' && s[1] == ':') {
4316 Move(s+2, s+1, strlen(s+2)+1, char);
4317 --SvCUR(kid->op_sv);
4320 sv_catpvn(kid->op_sv, ".pm", 3);
4330 croak("NOT IMPL LINE %d",__LINE__);
4340 if (op->op_flags & OPf_KIDS) {
4341 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4342 if (kid && kid->op_sibling) {
4343 op->op_type = OP_SSELECT;
4344 op->op_ppaddr = ppaddr[OP_SSELECT];
4346 return fold_constants(op);
4350 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4351 if (kid && kid->op_type == OP_RV2GV)
4352 kid->op_private &= ~HINT_STRICT_REFS;
4360 I32 type = op->op_type;
4362 if (!(op->op_flags & OPf_KIDS)) {
4364 return newUNOP(type, 0,
4365 scalar(newUNOP(OP_RV2AV, 0,
4366 scalar(newGVOP(OP_GV, 0, subline
4368 : gv_fetchpv("ARGV", TRUE, SVt_PVAV) )))));
4370 return scalar(modkids(ck_fun(op), type));
4379 if (hints & HINT_LOCALE)
4380 op->op_private |= OPpLOCALE;
4383 if (op->op_flags & OPf_STACKED) {
4384 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4386 kid = kUNOP->op_first; /* get past rv2gv */
4388 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4390 if (kid->op_type == OP_SCOPE) {
4394 else if (kid->op_type == OP_LEAVE) {
4395 if (op->op_type == OP_SORT) {
4396 null(kid); /* wipe out leave */
4399 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4400 if (k->op_next == kid)
4405 kid->op_next = 0; /* just disconnect the leave */
4406 k = kLISTOP->op_first;
4410 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4411 null(kid); /* wipe out rv2gv */
4412 if (op->op_type == OP_SORT)
4416 op->op_flags |= OPf_SPECIAL;
4430 if (op->op_flags & OPf_STACKED)
4431 return no_fh_allowed(op);
4433 kid = cLISTOP->op_first;
4434 if (kid->op_type != OP_NULL)
4435 croak("panic: ck_split");
4436 kid = kid->op_sibling;
4437 op_free(cLISTOP->op_first);
4438 cLISTOP->op_first = kid;
4440 cLISTOP->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4441 cLISTOP->op_last = kid; /* There was only one element previously */
4444 if (kid->op_type != OP_MATCH) {
4445 OP *sibl = kid->op_sibling;
4446 kid->op_sibling = 0;
4447 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4448 if (cLISTOP->op_first == cLISTOP->op_last)
4449 cLISTOP->op_last = kid;
4450 cLISTOP->op_first = kid;
4451 kid->op_sibling = sibl;
4454 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4455 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4459 kid->op_type = OP_PUSHRE;
4460 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4463 if (!kid->op_sibling)
4464 append_elem(OP_SPLIT, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4466 kid = kid->op_sibling;
4469 if (!kid->op_sibling)
4470 append_elem(OP_SPLIT, op, newSVOP(OP_CONST, 0, newSViv(0)));
4472 kid = kid->op_sibling;
4475 if (kid->op_sibling)
4476 return too_many_arguments(op,op_desc[op->op_type]);
4485 OP *prev = ((cUNOP->op_first->op_sibling)
4486 ? cUNOP : ((UNOP*)cUNOP->op_first))->op_first;
4487 OP *o = prev->op_sibling;
4495 for (cvop = o; cvop->op_sibling; cvop = cvop->op_sibling) ;
4496 if (cvop->op_type == OP_RV2CV) {
4498 op->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4499 null(cvop); /* disable rv2cv */
4500 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4501 if (tmpop->op_type == OP_GV) {
4502 cv = GvCVu(tmpop->op_sv);
4503 if (cv && SvPOK(cv) && !(op->op_private & OPpENTERSUB_AMPER)) {
4504 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4505 proto = SvPV((SV*)cv, na);
4509 op->op_private |= (hints & HINT_STRICT_REFS);
4510 if (perldb && curstash != debstash)
4511 op->op_private |= OPpENTERSUB_DB;
4516 return too_many_arguments(op, gv_ename(namegv));
4534 if (o->op_type != OP_REFGEN && o->op_type != OP_UNDEF)
4535 bad_type(arg, "block", gv_ename(namegv), o);
4540 if (o->op_type == OP_RV2GV)
4544 o = newUNOP(OP_RV2GV, 0, kid);
4545 o->op_sibling = kid->op_sibling;
4546 kid->op_sibling = 0;
4547 prev->op_sibling = o;
4555 if (o->op_type != OP_RV2GV)
4556 bad_type(arg, "symbol", gv_ename(namegv), o);
4559 if (o->op_type != OP_RV2CV)
4560 bad_type(arg, "sub", gv_ename(namegv), o);
4563 if (o->op_type != OP_RV2SV && o->op_type != OP_PADSV)
4564 bad_type(arg, "scalar", gv_ename(namegv), o);
4567 if (o->op_type != OP_RV2AV && o->op_type != OP_PADAV)
4568 bad_type(arg, "array", gv_ename(namegv), o);
4571 if (o->op_type != OP_RV2HV && o->op_type != OP_PADHV)
4572 bad_type(arg, "hash", gv_ename(namegv), o);
4576 o = newUNOP(OP_REFGEN, 0, kid);
4577 o->op_sibling = kid->op_sibling;
4578 kid->op_sibling = 0;
4579 prev->op_sibling = o;
4590 croak("Malformed prototype for %s: %s",
4591 gv_ename(namegv), SvPV((SV*)cv, na));
4596 mod(o, OP_ENTERSUB);
4600 if (proto && !optional && *proto == '$')
4601 return too_few_arguments(op, gv_ename(namegv));
4609 SvREADONLY_on(cSVOP->op_sv);
4617 if (op->op_flags & OPf_KIDS) {
4618 SVOP *kid = (SVOP*)cUNOP->op_first;
4620 if (kid->op_type == OP_NULL)
4621 kid = (SVOP*)kid->op_sibling;
4623 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4624 op->op_flags |= OPf_SPECIAL;
4629 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4635 register OP* oldop = 0;
4636 if (!o || o->op_seq)
4641 for (; o; o = o->op_next) {
4647 switch (o->op_type) {
4650 curcop = ((COP*)o); /* for warnings */
4651 o->op_seq = op_seqmax++;
4662 if (o->op_next->op_type == OP_STRINGIFY)
4664 o->op_seq = op_seqmax++;
4667 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4668 o->op_seq = op_seqmax++;
4669 break; /* Scalar stub must produce undef. List stub is noop */
4673 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4674 curcop = ((COP*)op);
4680 if (oldop && o->op_next) {
4681 oldop->op_next = o->op_next;
4684 o->op_seq = op_seqmax++;
4688 if (o->op_next->op_type == OP_RV2SV) {
4689 if (!(o->op_next->op_private & OPpDEREF)) {
4691 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4692 o->op_next = o->op_next->op_next;
4693 o->op_type = OP_GVSV;
4694 o->op_ppaddr = ppaddr[OP_GVSV];
4697 else if (o->op_next->op_type == OP_RV2AV) {
4698 OP* pop = o->op_next->op_next;
4700 if (pop->op_type == OP_CONST &&
4701 (op = pop->op_next) &&
4702 pop->op_next->op_type == OP_AELEM &&
4703 !(pop->op_next->op_private &
4704 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4705 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4709 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4713 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4714 o->op_next = pop->op_next->op_next;
4715 o->op_type = OP_AELEMFAST;
4716 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4717 o->op_private = (U8)i;
4718 GvAVn(((GVOP*)o)->op_gv);
4721 o->op_seq = op_seqmax++;
4728 o->op_seq = op_seqmax++;
4729 peep(cLOGOP->op_other);
4733 o->op_seq = op_seqmax++;
4734 peep(cCONDOP->op_true);
4735 peep(cCONDOP->op_false);
4739 o->op_seq = op_seqmax++;
4740 peep(cLOOP->op_redoop);
4741 peep(cLOOP->op_nextop);
4742 peep(cLOOP->op_lastop);
4747 o->op_seq = op_seqmax++;
4748 peep(cPMOP->op_pmreplstart);
4752 o->op_seq = op_seqmax++;
4753 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4754 if (o->op_next->op_sibling &&
4755 o->op_next->op_sibling->op_type != OP_DIE) {
4756 line_t oldline = curcop->cop_line;
4758 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4759 warn("Statement unlikely to be reached");
4760 warn("(Maybe you meant system() when you said exec()?)\n");
4761 curcop->cop_line = oldline;
4766 o->op_seq = op_seqmax++;