3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
21 #define USE_OP_MASK /* Turned on by default in 5.002beta1h */
25 * In the following definition, the ", (OP *) op" is just to make the compiler
26 * think the expression is of the right type: croak actually does a Siglongjmp.
28 #define CHECKOP(type,op) \
29 ((op_mask && op_mask[type]) \
30 ? ( op_free((OP*)op), \
31 croak("%s trapped by operation mask", op_desc[type]), \
33 : (*check[type])((OP*)op))
35 #define CHECKOP(type,op) (*check[type])(op)
36 #endif /* USE_OP_MASK */
38 static I32 list_assignment _((OP *op));
39 static OP *bad_type _((I32 n, char *t, char *name, OP *kid));
40 static OP *modkids _((OP *op, I32 type));
41 static OP *no_fh_allowed _((OP *op));
42 static bool scalar_mod_type _((OP *op, I32 type));
43 static OP *scalarboolean _((OP *op));
44 static OP *too_few_arguments _((OP *op, char* name));
45 static OP *too_many_arguments _((OP *op, char* name));
46 static void null _((OP* op));
47 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
48 CV* startcv, I32 cx_ix));
54 SV* tmpsv = sv_newmortal();
55 gv_efullname3(tmpsv, gv, Nullch);
56 return SvPV(tmpsv,na);
63 yyerror(form("Missing comma after first argument to %s function",
64 op_desc[op->op_type]));
69 too_few_arguments(op, name)
73 yyerror(form("Not enough arguments for %s", name));
78 too_many_arguments(op, name)
82 yyerror(form("Too many arguments for %s", name));
87 bad_type(n, t, name, kid)
93 yyerror(form("Type of arg %d to %s must be %s (not %s)",
94 (int)n, name, t, op_desc[kid->op_type]));
102 int type = op->op_type;
103 if (type != OP_AELEM && type != OP_HELEM) {
104 yyerror(form("Can't use subscript on %s", op_desc[type]));
105 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV)
106 warn("(Did you mean $ or @ instead of %c?)\n",
107 type == OP_ENTERSUB ? '&' : '%');
111 /* "register" allocation */
120 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
121 if (!isPRINT(name[1])) {
123 name[2] = toCTRL(name[1]);
126 croak("Can't use global %s in \"my\"",name);
128 if (AvFILL(comppad_name) >= 0) {
129 SV **svp = AvARRAY(comppad_name);
130 for (off = AvFILL(comppad_name); off > comppad_name_floor; off--) {
133 && SvIVX(sv) == 999999999 /* var is in open scope */
134 && strEQ(name, SvPVX(sv)))
136 warn("\"my\" variable %s masks earlier declaration in same scope", name);
141 off = pad_alloc(OP_PADSV, SVs_PADMY);
143 sv_upgrade(sv, SVt_PVNV);
145 av_store(comppad_name, off, sv);
146 SvNVX(sv) = (double)999999999;
147 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
148 if (!min_intro_pending)
149 min_intro_pending = off;
150 max_intro_pending = off;
152 av_store(comppad, off, (SV*)newAV());
153 else if (*name == '%')
154 av_store(comppad, off, (SV*)newHV());
155 SvPADMY_on(curpad[off]);
160 #ifndef CAN_PROTOTYPE
161 pad_findlex(name, newoff, seq, startcv, cx_ix)
168 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
175 register CONTEXT *cx;
178 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
179 AV *curlist = CvPADLIST(cv);
180 SV **svp = av_fetch(curlist, 0, FALSE);
183 if (!svp || *svp == &sv_undef)
186 svp = AvARRAY(curname);
187 for (off = AvFILL(curname); off > 0; off--) {
188 if ((sv = svp[off]) &&
191 seq > I_32(SvNVX(sv)) &&
192 strEQ(SvPVX(sv), name))
203 return 0; /* don't clone from inactive stack frame */
207 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
208 oldsv = *av_fetch(oldpad, off, TRUE);
209 if (!newoff) { /* Not a mere clone operation. */
210 SV *namesv = NEWSV(1103,0);
211 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
212 sv_upgrade(namesv, SVt_PVNV);
213 sv_setpv(namesv, name);
214 av_store(comppad_name, newoff, namesv);
215 SvNVX(namesv) = (double)curcop->cop_seq;
216 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
217 SvFAKE_on(namesv); /* A ref, not a real var */
218 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
219 /* "It's closures all the way down." */
223 oldsv = Nullsv; /* no need to keep ref */
228 bcv && bcv != cv && !CvCLONE(bcv);
229 bcv = CvOUTSIDE(bcv)) {
233 if (dowarn && !CvUNIQUE(cv))
235 "Variable \"%s\" may be unavailable",
242 else if (!CvUNIQUE(compcv)) {
243 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
244 warn("Variable \"%s\" will not stay shared", name);
247 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
253 /* Nothing in current lexical context--try eval's context, if any.
254 * This is necessary to let the perldb get at lexically scoped variables.
255 * XXX This will also probably interact badly with eval tree caching.
259 for (i = cx_ix; i >= 0; i--) {
261 switch (cx->cx_type) {
263 if (i == 0 && saweval) {
264 seq = cxstack[saweval].blk_oldcop->cop_seq;
265 return pad_findlex(name, newoff, seq, main_cv, 0);
269 switch (cx->blk_eval.old_op_type) {
274 /* require must have its own scope */
282 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
283 saweval = i; /* so we know where we were called from */
286 seq = cxstack[saweval].blk_oldcop->cop_seq;
287 return pad_findlex(name, newoff, seq, cv, i-1);
301 SV **svp = AvARRAY(comppad_name);
302 U32 seq = cop_seqmax;
304 /* The one we're looking for is probably just before comppad_name_fill. */
305 for (off = AvFILL(comppad_name); off > 0; off--) {
306 if ((sv = svp[off]) &&
310 seq > I_32(SvNVX(sv)))) &&
311 strEQ(SvPVX(sv), name))
314 return (PADOFFSET)off;
315 pendoff = off; /* this pending def. will override import */
319 /* See if it's in a nested scope */
320 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
322 /* If there is a pending local definition, this new alias must die */
324 SvIVX(AvARRAY(comppad_name)[off]) = seq;
336 SV **svp = AvARRAY(comppad_name);
338 if (min_intro_pending && fill < min_intro_pending) {
339 for (off = max_intro_pending; off >= min_intro_pending; off--) {
340 if ((sv = svp[off]) && sv != &sv_undef)
341 warn("%s never introduced", SvPVX(sv));
344 /* "Deintroduce" my variables that are leaving with this scope. */
345 for (off = AvFILL(comppad_name); off > fill; off--) {
346 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
347 SvIVX(sv) = cop_seqmax;
352 pad_alloc(optype,tmptype)
359 if (AvARRAY(comppad) != curpad)
360 croak("panic: pad_alloc");
361 if (pad_reset_pending)
363 if (tmptype & SVs_PADMY) {
365 sv = *av_fetch(comppad, AvFILL(comppad) + 1, TRUE);
366 } while (SvPADBUSY(sv)); /* need a fresh one */
367 retval = AvFILL(comppad);
370 SV **names = AvARRAY(comppad_name);
371 SSize_t names_fill = AvFILL(comppad_name);
374 * "foreach" index vars temporarily become aliases to non-"my"
375 * values. Thus we must skip, not just pad values that are
376 * marked as current pad values, but also those with names.
378 if (++padix <= names_fill &&
379 (sv = names[padix]) && sv != &sv_undef)
381 sv = *av_fetch(comppad, padix, TRUE);
382 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
387 SvFLAGS(sv) |= tmptype;
388 curpad = AvARRAY(comppad);
389 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad alloc %ld for %s\n", (long) retval, op_name[optype]));
390 return (PADOFFSET)retval;
394 #ifndef CAN_PROTOTYPE
399 #endif /* CAN_PROTOTYPE */
402 croak("panic: pad_sv po");
403 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad sv %lu\n", (unsigned long)po));
404 return curpad[po]; /* eventually we'll turn this into a macro */
408 #ifndef CAN_PROTOTYPE
412 pad_free(PADOFFSET po)
413 #endif /* CAN_PROTOTYPE */
417 if (AvARRAY(comppad) != curpad)
418 croak("panic: pad_free curpad");
420 croak("panic: pad_free po");
421 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad free %lu\n", (unsigned long)po));
422 if (curpad[po] && !SvIMMORTAL(curpad[po]))
423 SvPADTMP_off(curpad[po]);
429 #ifndef CAN_PROTOTYPE
433 pad_swipe(PADOFFSET po)
434 #endif /* CAN_PROTOTYPE */
436 if (AvARRAY(comppad) != curpad)
437 croak("panic: pad_swipe curpad");
439 croak("panic: pad_swipe po");
440 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad swipe %lu\n", (unsigned long)po));
441 SvPADTMP_off(curpad[po]);
442 curpad[po] = NEWSV(1107,0);
443 SvPADTMP_on(curpad[po]);
453 if (AvARRAY(comppad) != curpad)
454 croak("panic: pad_reset curpad");
455 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad reset\n"));
456 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
457 for (po = AvMAX(comppad); po > padix_floor; po--) {
458 if (curpad[po] && !SvIMMORTAL(curpad[po]))
459 SvPADTMP_off(curpad[po]);
463 pad_reset_pending = FALSE;
472 register OP *kid, *nextkid;
474 if (!op || op->op_seq == (U16)-1)
477 if (op->op_flags & OPf_KIDS) {
478 for (kid = cUNOP->op_first; kid; kid = nextkid) {
479 nextkid = kid->op_sibling; /* Get before next freeing kid */
484 switch (op->op_type) {
486 op->op_targ = 0; /* Was holding old type, if any. */
489 op->op_targ = 0; /* Was holding hints. */
492 if (!(op->op_flags & OPf_REF) || (check[op->op_type] != ck_ftst))
498 SvREFCNT_dec(cGVOP->op_gv);
502 Safefree(cCOP->cop_label);
503 SvREFCNT_dec(cCOP->cop_filegv);
506 SvREFCNT_dec(cSVOP->op_sv);
512 if (op->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
516 Safefree(cPVOP->op_pv);
519 op_free(cPMOP->op_pmreplroot);
523 pregfree(cPMOP->op_pmregexp);
524 SvREFCNT_dec(cPMOP->op_pmshort);
529 pad_free(op->op_targ);
538 if (op->op_type != OP_NULL && op->op_targ > 0)
539 pad_free(op->op_targ);
540 op->op_targ = op->op_type;
541 op->op_type = OP_NULL;
542 op->op_ppaddr = ppaddr[OP_NULL];
545 /* Contextualizers */
547 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
558 /* establish postfix order */
559 if (cUNOP->op_first) {
560 op->op_next = LINKLIST(cUNOP->op_first);
561 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling) {
563 kid->op_next = LINKLIST(kid->op_sibling);
579 if (op && op->op_flags & OPf_KIDS) {
580 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
591 op->op_type == OP_SASSIGN && cBINOP->op_first->op_type == OP_CONST) {
592 line_t oldline = curcop->cop_line;
594 if (copline != NOLINE)
595 curcop->cop_line = copline;
596 warn("Found = in conditional, should be ==");
597 curcop->cop_line = oldline;
608 /* assumes no premature commitment */
609 if (!op || (op->op_flags & OPf_WANT) || error_count
610 || op->op_type == OP_RETURN)
613 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
615 switch (op->op_type) {
617 if (op->op_private & OPpREPEAT_DOLIST)
618 null(((LISTOP*)cBINOP->op_first)->op_first);
619 scalar(cBINOP->op_first);
624 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
628 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
629 if (!kPMOP->op_pmreplroot)
630 deprecate("implicit split to @_");
637 if (op->op_flags & OPf_KIDS) {
638 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling)
644 kid = cLISTOP->op_first;
646 while (kid = kid->op_sibling) {
657 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
677 /* assumes no premature commitment */
678 if (!op || (op->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
679 || op->op_type == OP_RETURN)
682 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
684 switch (op->op_type) {
686 if (!(opargs[op->op_type] & OA_FOLDCONST))
690 if (op->op_flags & OPf_STACKED)
761 if (!(op->op_private & OPpLVAL_INTRO))
762 useless = op_desc[op->op_type];
769 if (!(op->op_private & OPpLVAL_INTRO) &&
770 (!op->op_sibling || op->op_sibling->op_type != OP_READLINE))
771 useless = "a variable";
776 curcop = ((COP*)op); /* for warning below */
782 useless = "a constant";
783 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
785 else if (SvPOK(sv)) {
786 if (strnEQ(SvPVX(sv), "di", 2) ||
787 strnEQ(SvPVX(sv), "ds", 2) ||
788 strnEQ(SvPVX(sv), "ig", 2))
792 null(op); /* don't execute a constant */
793 SvREFCNT_dec(sv); /* don't even remember it */
797 op->op_type = OP_PREINC; /* pre-increment is faster */
798 op->op_ppaddr = ppaddr[OP_PREINC];
802 op->op_type = OP_PREDEC; /* pre-decrement is faster */
803 op->op_ppaddr = ppaddr[OP_PREDEC];
809 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
814 if (op->op_targ == OP_NEXTSTATE || op->op_targ == OP_DBSTATE)
815 curcop = ((COP*)op); /* for warning below */
816 if (op->op_flags & OPf_STACKED)
822 if (!(op->op_flags & OPf_KIDS))
831 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
838 /* all requires must return a boolean value */
839 op->op_flags &= ~OPf_WANT;
842 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
843 if (!kPMOP->op_pmreplroot)
844 deprecate("implicit split to @_");
848 if (useless && dowarn)
849 warn("Useless use of %s in void context", useless);
858 if (op && op->op_flags & OPf_KIDS) {
859 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
871 /* assumes no premature commitment */
872 if (!op || (op->op_flags & OPf_WANT) || error_count
873 || op->op_type == OP_RETURN)
876 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
878 switch (op->op_type) {
881 list(cBINOP->op_first);
886 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
893 if (!(op->op_flags & OPf_KIDS))
895 if (!op->op_next && cUNOP->op_first->op_type == OP_FLOP) {
896 list(cBINOP->op_first);
897 return gen_constant_list(op);
904 kid = cLISTOP->op_first;
906 while (kid = kid->op_sibling) {
916 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
925 /* all requires must return a boolean value */
926 op->op_flags &= ~OPf_WANT;
939 if (op->op_type == OP_LINESEQ ||
940 op->op_type == OP_SCOPE ||
941 op->op_type == OP_LEAVE ||
942 op->op_type == OP_LEAVETRY)
944 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
945 if (kid->op_sibling) {
951 op->op_flags &= ~OPf_PARENS;
952 if (hints & HINT_BLOCK_SCOPE)
953 op->op_flags |= OPf_PARENS;
956 op = newOP(OP_STUB, 0);
966 if (op && op->op_flags & OPf_KIDS) {
967 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
983 if (!op || error_count)
986 switch (op->op_type) {
991 if (!(op->op_private & (OPpCONST_ARYBASE)))
993 if (eval_start && eval_start->op_type == OP_CONST) {
994 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
998 SAVEI32(compiling.cop_arybase);
999 compiling.cop_arybase = 0;
1001 else if (type == OP_REFGEN)
1004 croak("That use of $[ is unsupported");
1007 if (op->op_flags & OPf_PARENS)
1011 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1012 !(op->op_flags & OPf_STACKED)) {
1013 op->op_type = OP_RV2CV; /* entersub => rv2cv */
1014 op->op_ppaddr = ppaddr[OP_RV2CV];
1015 assert(cUNOP->op_first->op_type == OP_NULL);
1016 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
1022 /* grep, foreach, subcalls, refgen */
1023 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1025 yyerror(form("Can't modify %s in %s",
1026 op_desc[op->op_type],
1027 type ? op_desc[type] : "local"));
1041 case OP_RIGHT_SHIFT:
1050 if (!(op->op_flags & OPf_STACKED))
1056 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
1062 if (type == OP_REFGEN && op->op_flags & OPf_PARENS) {
1064 return op; /* Treat \(@foo) like ordinary list. */
1068 if (scalar_mod_type(op, type))
1070 ref(cUNOP->op_first, op->op_type);
1082 if (!type && cUNOP->op_first->op_type != OP_GV)
1083 croak("Can't localize a reference");
1084 ref(cUNOP->op_first, op->op_type);
1096 if (type == OP_REFGEN && op->op_flags & OPf_PARENS)
1097 return op; /* Treat \(@foo) like ordinary list. */
1098 if (scalar_mod_type(op, type))
1104 croak("Can't localize lexical variable %s",
1105 SvPV(*av_fetch(comppad_name, op->op_targ, 4), na));
1112 if (type != OP_SASSIGN)
1118 pad_free(op->op_targ);
1119 op->op_targ = pad_alloc(op->op_type, SVs_PADMY);
1120 assert(SvTYPE(PAD_SV(op->op_targ)) == SVt_NULL);
1121 if (op->op_flags & OPf_KIDS)
1122 mod(cBINOP->op_first->op_sibling, type);
1127 ref(cBINOP->op_first, op->op_type);
1128 if (type == OP_ENTERSUB &&
1129 !(op->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1130 op->op_private |= OPpLVAL_DEFER;
1137 if (op->op_flags & OPf_KIDS)
1138 mod(cLISTOP->op_last, type);
1142 if (!(op->op_flags & OPf_KIDS))
1144 if (op->op_targ != OP_LIST) {
1145 mod(cBINOP->op_first, type);
1150 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1154 op->op_flags |= OPf_MOD;
1156 if (type == OP_AASSIGN || type == OP_SASSIGN)
1157 op->op_flags |= OPf_SPECIAL|OPf_REF;
1159 op->op_private |= OPpLVAL_INTRO;
1160 op->op_flags &= ~OPf_SPECIAL;
1162 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1163 op->op_flags |= OPf_REF;
1168 scalar_mod_type(op, type)
1174 if (op->op_type == OP_RV2GV)
1198 case OP_RIGHT_SHIFT:
1205 case OP_ANDASSIGN: /* may work later */
1206 case OP_ORASSIGN: /* may work later */
1219 if (op && op->op_flags & OPf_KIDS) {
1220 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1233 if (!op || error_count)
1236 switch (op->op_type) {
1238 if ((type == OP_DEFINED) &&
1239 !(op->op_flags & OPf_STACKED)) {
1240 op->op_type = OP_RV2CV; /* entersub => rv2cv */
1241 op->op_ppaddr = ppaddr[OP_RV2CV];
1242 assert(cUNOP->op_first->op_type == OP_NULL);
1243 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
1244 op->op_flags |= OPf_SPECIAL;
1249 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
1253 ref(cUNOP->op_first, op->op_type);
1256 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1257 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1258 : type == OP_RV2HV ? OPpDEREF_HV
1260 op->op_flags |= OPf_MOD;
1266 op->op_flags |= OPf_REF;
1269 ref(cUNOP->op_first, op->op_type);
1274 op->op_flags |= OPf_REF;
1279 if (!(op->op_flags & OPf_KIDS))
1281 ref(cBINOP->op_first, type);
1285 ref(cBINOP->op_first, op->op_type);
1286 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1287 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1288 : type == OP_RV2HV ? OPpDEREF_HV
1290 op->op_flags |= OPf_MOD;
1298 if (!(op->op_flags & OPf_KIDS))
1300 ref(cLISTOP->op_last, type);
1316 if (!op || error_count)
1320 if (type == OP_LIST) {
1321 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1324 else if (type != OP_PADSV &&
1327 type != OP_PUSHMARK)
1329 yyerror(form("Can't declare %s in my", op_desc[op->op_type]));
1332 op->op_flags |= OPf_MOD;
1333 op->op_private |= OPpLVAL_INTRO;
1342 o->op_flags |= OPf_PARENS;
1347 bind_match(type, left, right)
1355 (left->op_type == OP_RV2AV ||
1356 left->op_type == OP_RV2HV ||
1357 left->op_type == OP_PADAV ||
1358 left->op_type == OP_PADHV)) {
1359 char *desc = op_desc[(right->op_type == OP_SUBST ||
1360 right->op_type == OP_TRANS)
1361 ? right->op_type : OP_MATCH];
1362 char *sample = ((left->op_type == OP_RV2AV ||
1363 left->op_type == OP_PADAV)
1364 ? "@array" : "%hash");
1365 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1368 if (right->op_type == OP_MATCH ||
1369 right->op_type == OP_SUBST ||
1370 right->op_type == OP_TRANS) {
1371 right->op_flags |= OPf_STACKED;
1372 if (right->op_type != OP_MATCH)
1373 left = mod(left, right->op_type);
1374 if (right->op_type == OP_TRANS)
1375 op = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1377 op = prepend_elem(right->op_type, scalar(left), right);
1379 return newUNOP(OP_NOT, 0, scalar(op));
1383 return bind_match(type, left,
1384 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1393 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1394 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(op));
1402 if (o->op_flags & OPf_PARENS || perldb || tainting) {
1403 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1404 o->op_type = OP_LEAVE;
1405 o->op_ppaddr = ppaddr[OP_LEAVE];
1408 if (o->op_type == OP_LINESEQ) {
1410 o->op_type = OP_SCOPE;
1411 o->op_ppaddr = ppaddr[OP_SCOPE];
1412 kid = ((LISTOP*)o)->op_first;
1413 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1414 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1419 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1429 int retval = savestack_ix;
1430 SAVEI32(comppad_name_floor);
1432 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1433 comppad_name_floor = comppad_name_fill;
1435 comppad_name_floor = 0;
1437 SAVEI32(min_intro_pending);
1438 SAVEI32(max_intro_pending);
1439 min_intro_pending = 0;
1440 SAVEI32(comppad_name_fill);
1441 SAVEI32(padix_floor);
1442 padix_floor = padix;
1443 pad_reset_pending = FALSE;
1445 hints &= ~HINT_BLOCK_SCOPE;
1450 block_end(floor, seq)
1454 int needblockscope = hints & HINT_BLOCK_SCOPE;
1455 OP* retval = scalarseq(seq);
1457 pad_reset_pending = FALSE;
1459 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1460 pad_leavemy(comppad_name_fill);
1470 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), op);
1471 eval_start = linklist(eval_root);
1472 eval_root->op_next = 0;
1478 main_root = scope(sawparens(scalarvoid(op)));
1479 curcop = &compiling;
1480 main_start = LINKLIST(main_root);
1481 main_root->op_next = 0;
1485 /* Register with debugger */
1487 CV *cv = perl_get_cv("DB::postponed", FALSE);
1491 XPUSHs((SV*)compiling.cop_filegv);
1493 perl_call_sv((SV*)cv, G_DISCARD);
1504 if (o->op_flags & OPf_PARENS)
1508 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1510 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1511 if (*s == ';' || *s == '=')
1512 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1519 return mod(o, OP_NULL); /* a bit kludgey */
1526 if (o->op_type == OP_LIST) {
1527 o = convert(OP_JOIN, 0,
1528 prepend_elem(OP_LIST,
1529 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1540 I32 type = o->op_type;
1543 if (opargs[type] & OA_RETSCALAR)
1545 if (opargs[type] & OA_TARGET)
1546 o->op_targ = pad_alloc(type, SVs_PADTMP);
1548 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1549 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1551 if (!(opargs[type] & OA_FOLDCONST))
1555 goto nope; /* Don't try to run w/ errors */
1557 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1558 if (curop->op_type != OP_CONST &&
1559 curop->op_type != OP_LIST &&
1560 curop->op_type != OP_SCALAR &&
1561 curop->op_type != OP_NULL &&
1562 curop->op_type != OP_PUSHMARK) {
1567 curop = LINKLIST(o);
1572 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1573 pad_swipe(o->op_targ);
1574 else if (SvTEMP(sv)) { /* grab mortal temp? */
1575 (void)SvREFCNT_inc(sv);
1579 if (type == OP_RV2GV)
1580 return newGVOP(OP_GV, 0, (GV*)sv);
1582 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1584 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1589 SvIOK_off(sv); /* undo SvIV() damage */
1591 return newSVOP(OP_CONST, 0, sv);
1595 if (!(opargs[type] & OA_OTHERINT))
1598 if (!(hints & HINT_INTEGER)) {
1599 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1602 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1603 if (curop->op_type == OP_CONST) {
1604 if (SvIOK(((SVOP*)curop)->op_sv))
1608 if (opargs[curop->op_type] & OA_RETINTEGER)
1612 o->op_ppaddr = ppaddr[++(o->op_type)];
1619 gen_constant_list(o)
1623 I32 oldtmps_floor = tmps_floor;
1627 return o; /* Don't attempt to run with errors */
1629 op = curop = LINKLIST(o);
1635 tmps_floor = oldtmps_floor;
1637 o->op_type = OP_RV2AV;
1638 o->op_ppaddr = ppaddr[OP_RV2AV];
1639 curop = ((UNOP*)o)->op_first;
1640 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1647 convert(type, flags, op)
1655 if (!op || op->op_type != OP_LIST)
1656 op = newLISTOP(OP_LIST, 0, op, Nullop);
1658 op->op_flags &= ~OPf_WANT;
1660 if (!(opargs[type] & OA_MARK))
1661 null(cLISTOP->op_first);
1664 op->op_ppaddr = ppaddr[type];
1665 op->op_flags |= flags;
1667 op = CHECKOP(type, op);
1668 if (op->op_type != type)
1671 if (cLISTOP->op_children < 7) {
1672 /* XXX do we really need to do this if we're done appending?? */
1673 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1675 cLISTOP->op_last = last; /* in case check substituted last arg */
1678 return fold_constants(op);
1681 /* List constructors */
1684 append_elem(type, first, last)
1695 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1696 return newLISTOP(type, 0, first, last);
1698 if (first->op_flags & OPf_KIDS)
1699 ((LISTOP*)first)->op_last->op_sibling = last;
1701 first->op_flags |= OPf_KIDS;
1702 ((LISTOP*)first)->op_first = last;
1704 ((LISTOP*)first)->op_last = last;
1705 ((LISTOP*)first)->op_children++;
1710 append_list(type, first, last)
1721 if (first->op_type != type)
1722 return prepend_elem(type, (OP*)first, (OP*)last);
1724 if (last->op_type != type)
1725 return append_elem(type, (OP*)first, (OP*)last);
1727 first->op_last->op_sibling = last->op_first;
1728 first->op_last = last->op_last;
1729 first->op_children += last->op_children;
1730 if (first->op_children)
1731 last->op_flags |= OPf_KIDS;
1738 prepend_elem(type, first, last)
1749 if (last->op_type == type) {
1750 if (type == OP_LIST) { /* already a PUSHMARK there */
1751 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1752 ((LISTOP*)last)->op_first->op_sibling = first;
1755 if (!(last->op_flags & OPf_KIDS)) {
1756 ((LISTOP*)last)->op_last = first;
1757 last->op_flags |= OPf_KIDS;
1759 first->op_sibling = ((LISTOP*)last)->op_first;
1760 ((LISTOP*)last)->op_first = first;
1762 ((LISTOP*)last)->op_children++;
1766 return newLISTOP(type, 0, first, last);
1774 return newOP(OP_STUB, 0);
1781 if (!op || op->op_type != OP_LIST)
1782 op = newLISTOP(OP_LIST, 0, op, Nullop);
1788 newLISTOP(type, flags, first, last)
1796 Newz(1101, listop, 1, LISTOP);
1798 listop->op_type = type;
1799 listop->op_ppaddr = ppaddr[type];
1800 listop->op_children = (first != 0) + (last != 0);
1801 listop->op_flags = flags;
1805 else if (!first && last)
1808 first->op_sibling = last;
1809 listop->op_first = first;
1810 listop->op_last = last;
1811 if (type == OP_LIST) {
1813 pushop = newOP(OP_PUSHMARK, 0);
1814 pushop->op_sibling = first;
1815 listop->op_first = pushop;
1816 listop->op_flags |= OPf_KIDS;
1818 listop->op_last = pushop;
1820 else if (listop->op_children)
1821 listop->op_flags |= OPf_KIDS;
1832 Newz(1101, op, 1, OP);
1834 op->op_ppaddr = ppaddr[type];
1835 op->op_flags = flags;
1838 op->op_private = 0 + (flags >> 8);
1839 if (opargs[type] & OA_RETSCALAR)
1841 if (opargs[type] & OA_TARGET)
1842 op->op_targ = pad_alloc(type, SVs_PADTMP);
1843 return CHECKOP(type, op);
1847 newUNOP(type, flags, first)
1855 first = newOP(OP_STUB, 0);
1856 if (opargs[type] & OA_MARK)
1857 first = force_list(first);
1859 Newz(1101, unop, 1, UNOP);
1860 unop->op_type = type;
1861 unop->op_ppaddr = ppaddr[type];
1862 unop->op_first = first;
1863 unop->op_flags = flags | OPf_KIDS;
1864 unop->op_private = 1 | (flags >> 8);
1866 unop = (UNOP*) CHECKOP(type, unop);
1870 return fold_constants((OP *) unop);
1874 newBINOP(type, flags, first, last)
1881 Newz(1101, binop, 1, BINOP);
1884 first = newOP(OP_NULL, 0);
1886 binop->op_type = type;
1887 binop->op_ppaddr = ppaddr[type];
1888 binop->op_first = first;
1889 binop->op_flags = flags | OPf_KIDS;
1892 binop->op_private = 1 | (flags >> 8);
1895 binop->op_private = 2 | (flags >> 8);
1896 first->op_sibling = last;
1899 binop = (BINOP*)CHECKOP(type, binop);
1903 binop->op_last = last = binop->op_first->op_sibling;
1905 return fold_constants((OP *)binop);
1909 pmtrans(op, expr, repl)
1914 SV *tstr = ((SVOP*)expr)->op_sv;
1915 SV *rstr = ((SVOP*)repl)->op_sv;
1918 register U8 *t = (U8*)SvPV(tstr, tlen);
1919 register U8 *r = (U8*)SvPV(rstr, rlen);
1924 register short *tbl;
1926 tbl = (short*)cPVOP->op_pv;
1927 complement = op->op_private & OPpTRANS_COMPLEMENT;
1928 delete = op->op_private & OPpTRANS_DELETE;
1929 /* squash = op->op_private & OPpTRANS_SQUASH; */
1932 Zero(tbl, 256, short);
1933 for (i = 0; i < tlen; i++)
1935 for (i = 0, j = 0; i < 256; i++) {
1951 if (!rlen && !delete) {
1954 for (i = 0; i < 256; i++)
1956 for (i = 0, j = 0; i < tlen; i++,j++) {
1959 if (tbl[t[i]] == -1)
1965 if (tbl[t[i]] == -1)
1976 newPMOP(type, flags)
1982 Newz(1101, pmop, 1, PMOP);
1983 pmop->op_type = type;
1984 pmop->op_ppaddr = ppaddr[type];
1985 pmop->op_flags = flags;
1986 pmop->op_private = 0 | (flags >> 8);
1988 if (hints & HINT_LOCALE)
1989 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
1991 /* link into pm list */
1992 if (type != OP_TRANS && curstash) {
1993 pmop->op_pmnext = HvPMROOT(curstash);
1994 HvPMROOT(curstash) = pmop;
2001 pmruntime(op, expr, repl)
2009 if (op->op_type == OP_TRANS)
2010 return pmtrans(op, expr, repl);
2012 hints |= HINT_BLOCK_SCOPE;
2015 if (expr->op_type == OP_CONST) {
2017 SV *pat = ((SVOP*)expr)->op_sv;
2018 char *p = SvPV(pat, plen);
2019 if ((op->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2020 sv_setpvn(pat, "\\s+", 3);
2021 p = SvPV(pat, plen);
2022 pm->op_pmflags |= PMf_SKIPWHITE;
2024 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2025 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2026 pm->op_pmflags |= PMf_WHITE;
2031 if (pm->op_pmflags & PMf_KEEP)
2032 expr = newUNOP(OP_REGCMAYBE,0,expr);
2034 Newz(1101, rcop, 1, LOGOP);
2035 rcop->op_type = OP_REGCOMP;
2036 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2037 rcop->op_first = scalar(expr);
2038 rcop->op_flags |= OPf_KIDS;
2039 rcop->op_private = 1;
2040 rcop->op_other = op;
2042 /* establish postfix order */
2043 if (pm->op_pmflags & PMf_KEEP) {
2045 rcop->op_next = expr;
2046 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2049 rcop->op_next = LINKLIST(expr);
2050 expr->op_next = (OP*)rcop;
2053 prepend_elem(op->op_type, scalar((OP*)rcop), op);
2058 if (pm->op_pmflags & PMf_EVAL)
2060 else if (repl->op_type == OP_CONST)
2064 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2065 if (opargs[curop->op_type] & OA_DANGEROUS) {
2066 if (curop->op_type == OP_GV) {
2067 GV *gv = ((GVOP*)curop)->op_gv;
2068 if (strchr("&`'123456789+", *GvENAME(gv)))
2071 else if (curop->op_type == OP_RV2CV)
2073 else if (curop->op_type == OP_RV2SV ||
2074 curop->op_type == OP_RV2AV ||
2075 curop->op_type == OP_RV2HV ||
2076 curop->op_type == OP_RV2GV) {
2077 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2080 else if (curop->op_type == OP_PADSV ||
2081 curop->op_type == OP_PADAV ||
2082 curop->op_type == OP_PADHV ||
2083 curop->op_type == OP_PADANY) {
2092 if (curop == repl) {
2093 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2094 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2095 prepend_elem(op->op_type, scalar(repl), op);
2098 Newz(1101, rcop, 1, LOGOP);
2099 rcop->op_type = OP_SUBSTCONT;
2100 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2101 rcop->op_first = scalar(repl);
2102 rcop->op_flags |= OPf_KIDS;
2103 rcop->op_private = 1;
2104 rcop->op_other = op;
2106 /* establish postfix order */
2107 rcop->op_next = LINKLIST(repl);
2108 repl->op_next = (OP*)rcop;
2110 pm->op_pmreplroot = scalar((OP*)rcop);
2111 pm->op_pmreplstart = LINKLIST(rcop);
2120 newSVOP(type, flags, sv)
2126 Newz(1101, svop, 1, SVOP);
2127 svop->op_type = type;
2128 svop->op_ppaddr = ppaddr[type];
2130 svop->op_next = (OP*)svop;
2131 svop->op_flags = flags;
2132 if (opargs[type] & OA_RETSCALAR)
2134 if (opargs[type] & OA_TARGET)
2135 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2136 return CHECKOP(type, svop);
2140 newGVOP(type, flags, gv)
2146 Newz(1101, gvop, 1, GVOP);
2147 gvop->op_type = type;
2148 gvop->op_ppaddr = ppaddr[type];
2149 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2150 gvop->op_next = (OP*)gvop;
2151 gvop->op_flags = flags;
2152 if (opargs[type] & OA_RETSCALAR)
2154 if (opargs[type] & OA_TARGET)
2155 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2156 return CHECKOP(type, gvop);
2160 newPVOP(type, flags, pv)
2166 Newz(1101, pvop, 1, PVOP);
2167 pvop->op_type = type;
2168 pvop->op_ppaddr = ppaddr[type];
2170 pvop->op_next = (OP*)pvop;
2171 pvop->op_flags = flags;
2172 if (opargs[type] & OA_RETSCALAR)
2174 if (opargs[type] & OA_TARGET)
2175 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2176 return CHECKOP(type, pvop);
2185 save_hptr(&curstash);
2186 save_item(curstname);
2191 name = SvPV(sv, len);
2192 curstash = gv_stashpvn(name,len,TRUE);
2193 sv_setpvn(curstname, name, len);
2197 sv_setpv(curstname,"<none>");
2205 utilize(aver, floor, version, id, arg)
2218 if (id->op_type != OP_CONST)
2219 croak("Module name must be constant");
2223 if(version != Nullop) {
2224 SV *vesv = ((SVOP*)version)->op_sv;
2226 if (arg == Nullop && !SvNIOK(vesv)) {
2233 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2234 croak("Version number must be constant number");
2236 /* Make copy of id so we don't free it twice */
2237 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2239 /* Fake up a method call to VERSION */
2240 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2241 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2242 append_elem(OP_LIST,
2243 prepend_elem(OP_LIST, pack, list(version)),
2244 newUNOP(OP_METHOD, 0, meth)));
2248 /* Fake up an import/unimport */
2249 if (arg && arg->op_type == OP_STUB)
2250 imop = arg; /* no import on explicit () */
2251 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2252 imop = Nullop; /* use 5.0; */
2255 /* Make copy of id so we don't free it twice */
2256 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2257 meth = newSVOP(OP_CONST, 0,
2259 ? newSVpv("import", 6)
2260 : newSVpv("unimport", 8)
2262 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2263 append_elem(OP_LIST,
2264 prepend_elem(OP_LIST, pack, list(arg)),
2265 newUNOP(OP_METHOD, 0, meth)));
2268 /* Fake up a require */
2269 rqop = newUNOP(OP_REQUIRE, 0, id);
2271 /* Fake up the BEGIN {}, which does its thing immediately. */
2273 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2275 append_elem(OP_LINESEQ,
2276 append_elem(OP_LINESEQ,
2277 newSTATEOP(0, Nullch, rqop),
2278 newSTATEOP(0, Nullch, veop)),
2279 newSTATEOP(0, Nullch, imop) ));
2286 newSLICEOP(flags, subscript, listval)
2291 return newBINOP(OP_LSLICE, flags,
2292 list(force_list(subscript)),
2293 list(force_list(listval)) );
2303 if (op->op_type == OP_NULL && op->op_flags & OPf_KIDS)
2304 op = cUNOP->op_first;
2306 if (op->op_type == OP_COND_EXPR) {
2307 I32 t = list_assignment(cCONDOP->op_first->op_sibling);
2308 I32 f = list_assignment(cCONDOP->op_first->op_sibling->op_sibling);
2313 yyerror("Assignment to both a list and a scalar");
2317 if (op->op_type == OP_LIST || op->op_flags & OPf_PARENS ||
2318 op->op_type == OP_RV2AV || op->op_type == OP_RV2HV ||
2319 op->op_type == OP_ASLICE || op->op_type == OP_HSLICE)
2322 if (op->op_type == OP_PADAV || op->op_type == OP_PADHV)
2325 if (op->op_type == OP_RV2SV)
2332 newASSIGNOP(flags, left, optype, right)
2341 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2342 return newLOGOP(optype, 0,
2343 mod(scalar(left), optype),
2344 newUNOP(OP_SASSIGN, 0, scalar(right)));
2347 return newBINOP(optype, OPf_STACKED,
2348 mod(scalar(left), optype), scalar(right));
2352 if (list_assignment(left)) {
2354 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2355 left = mod(left, OP_AASSIGN);
2363 op = newBINOP(OP_AASSIGN, flags,
2364 list(force_list(right)),
2365 list(force_list(left)) );
2366 op->op_private = 0 | (flags >> 8);
2367 if (!(left->op_private & OPpLVAL_INTRO)) {
2368 static int generation = 100;
2372 for (curop = LINKLIST(op); curop != op; curop = LINKLIST(curop)) {
2373 if (opargs[curop->op_type] & OA_DANGEROUS) {
2374 if (curop->op_type == OP_GV) {
2375 GV *gv = ((GVOP*)curop)->op_gv;
2376 if (gv == defgv || SvCUR(gv) == generation)
2378 SvCUR(gv) = generation;
2380 else if (curop->op_type == OP_PADSV ||
2381 curop->op_type == OP_PADAV ||
2382 curop->op_type == OP_PADHV ||
2383 curop->op_type == OP_PADANY) {
2384 SV **svp = AvARRAY(comppad_name);
2385 SV *sv = svp[curop->op_targ];
2386 if (SvCUR(sv) == generation)
2388 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2390 else if (curop->op_type == OP_RV2CV)
2392 else if (curop->op_type == OP_RV2SV ||
2393 curop->op_type == OP_RV2AV ||
2394 curop->op_type == OP_RV2HV ||
2395 curop->op_type == OP_RV2GV) {
2396 if (lastop->op_type != OP_GV) /* funny deref? */
2405 op->op_private = OPpASSIGN_COMMON;
2407 if (right && right->op_type == OP_SPLIT) {
2409 if ((tmpop = ((LISTOP*)right)->op_first) &&
2410 tmpop->op_type == OP_PUSHRE)
2412 PMOP *pm = (PMOP*)tmpop;
2413 if (left->op_type == OP_RV2AV &&
2414 !(left->op_private & OPpLVAL_INTRO) &&
2415 !(op->op_private & OPpASSIGN_COMMON) )
2417 tmpop = ((UNOP*)left)->op_first;
2418 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2419 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2420 pm->op_pmflags |= PMf_ONCE;
2421 tmpop = ((UNOP*)op)->op_first; /* to list (nulled) */
2422 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2423 tmpop->op_sibling = Nullop; /* don't free split */
2424 right->op_next = tmpop->op_next; /* fix starting loc */
2425 op_free(op); /* blow off assign */
2426 right->op_flags &= ~OPf_WANT;
2427 /* "I don't know and I don't care." */
2432 if (modcount < 10000 &&
2433 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2435 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2437 sv_setiv(sv, modcount+1);
2445 right = newOP(OP_UNDEF, 0);
2446 if (right->op_type == OP_READLINE) {
2447 right->op_flags |= OPf_STACKED;
2448 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2451 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2452 op = newBINOP(OP_SASSIGN, flags,
2453 scalar(right), mod(scalar(left), OP_SASSIGN) );
2465 newSTATEOP(flags, label, op)
2470 U32 seq = intro_my();
2473 Newz(1101, cop, 1, COP);
2474 if (perldb && curcop->cop_line && curstash != debstash) {
2475 cop->op_type = OP_DBSTATE;
2476 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2479 cop->op_type = OP_NEXTSTATE;
2480 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2482 cop->op_flags = flags;
2483 cop->op_private = 0 | (flags >> 8);
2485 cop->op_private |= NATIVE_HINTS;
2487 cop->op_next = (OP*)cop;
2490 cop->cop_label = label;
2491 hints |= HINT_BLOCK_SCOPE;
2494 cop->cop_arybase = curcop->cop_arybase;
2496 if (copline == NOLINE)
2497 cop->cop_line = curcop->cop_line;
2499 cop->cop_line = copline;
2502 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2503 cop->cop_stash = curstash;
2505 if (perldb && curstash != debstash) {
2506 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2507 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2508 (void)SvIOK_on(*svp);
2510 SvSTASH(*svp) = (HV*)cop;
2514 return prepend_elem(OP_LINESEQ, (OP*)cop, op);
2517 /* "Introduce" my variables to visible status. */
2525 if (! min_intro_pending)
2528 svp = AvARRAY(comppad_name);
2529 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2530 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2531 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2532 SvNVX(sv) = (double)cop_seqmax;
2535 min_intro_pending = 0;
2536 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2537 return cop_seqmax++;
2541 newLOGOP(type, flags, first, other)
2550 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2551 return newBINOP(type, flags, scalar(first), scalar(other));
2553 scalarboolean(first);
2554 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2555 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2556 if (type == OP_AND || type == OP_OR) {
2562 first = cUNOP->op_first;
2564 first->op_next = op->op_next;
2565 cUNOP->op_first = Nullop;
2569 if (first->op_type == OP_CONST) {
2570 if (dowarn && (first->op_private & OPpCONST_BARE))
2571 warn("Probable precedence problem on %s", op_desc[type]);
2572 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2581 else if (first->op_type == OP_WANTARRAY) {
2587 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2588 OP *k1 = ((UNOP*)first)->op_first;
2589 OP *k2 = k1->op_sibling;
2591 switch (first->op_type)
2594 if (k2 && k2->op_type == OP_READLINE
2595 && (k2->op_flags & OPf_STACKED)
2596 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2597 warnop = k2->op_type;
2601 if (k1->op_type == OP_READDIR
2602 || k1->op_type == OP_GLOB
2603 || k1->op_type == OP_EACH)
2604 warnop = k1->op_type;
2608 line_t oldline = curcop->cop_line;
2609 curcop->cop_line = copline;
2610 warn("Value of %s%s can be \"0\"; test with defined()",
2612 ((warnop == OP_READLINE || warnop == OP_GLOB)
2613 ? " construct" : "() operator"));
2614 curcop->cop_line = oldline;
2621 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2622 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2624 Newz(1101, logop, 1, LOGOP);
2626 logop->op_type = type;
2627 logop->op_ppaddr = ppaddr[type];
2628 logop->op_first = first;
2629 logop->op_flags = flags | OPf_KIDS;
2630 logop->op_other = LINKLIST(other);
2631 logop->op_private = 1 | (flags >> 8);
2633 /* establish postfix order */
2634 logop->op_next = LINKLIST(first);
2635 first->op_next = (OP*)logop;
2636 first->op_sibling = other;
2638 op = newUNOP(OP_NULL, 0, (OP*)logop);
2639 other->op_next = op;
2645 newCONDOP(flags, first, trueop, falseop)
2655 return newLOGOP(OP_AND, 0, first, trueop);
2657 return newLOGOP(OP_OR, 0, first, falseop);
2659 scalarboolean(first);
2660 if (first->op_type == OP_CONST) {
2661 if (SvTRUE(((SVOP*)first)->op_sv)) {
2672 else if (first->op_type == OP_WANTARRAY) {
2676 Newz(1101, condop, 1, CONDOP);
2678 condop->op_type = OP_COND_EXPR;
2679 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2680 condop->op_first = first;
2681 condop->op_flags = flags | OPf_KIDS;
2682 condop->op_true = LINKLIST(trueop);
2683 condop->op_false = LINKLIST(falseop);
2684 condop->op_private = 1 | (flags >> 8);
2686 /* establish postfix order */
2687 condop->op_next = LINKLIST(first);
2688 first->op_next = (OP*)condop;
2690 first->op_sibling = trueop;
2691 trueop->op_sibling = falseop;
2692 op = newUNOP(OP_NULL, 0, (OP*)condop);
2694 trueop->op_next = op;
2695 falseop->op_next = op;
2701 newRANGE(flags, left, right)
2711 Newz(1101, condop, 1, CONDOP);
2713 condop->op_type = OP_RANGE;
2714 condop->op_ppaddr = ppaddr[OP_RANGE];
2715 condop->op_first = left;
2716 condop->op_flags = OPf_KIDS;
2717 condop->op_true = LINKLIST(left);
2718 condop->op_false = LINKLIST(right);
2719 condop->op_private = 1 | (flags >> 8);
2721 left->op_sibling = right;
2723 condop->op_next = (OP*)condop;
2724 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2725 flop = newUNOP(OP_FLOP, 0, flip);
2726 op = newUNOP(OP_NULL, 0, flop);
2729 left->op_next = flip;
2730 right->op_next = flop;
2732 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2733 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2734 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2735 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2737 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2738 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2741 if (!flip->op_private || !flop->op_private)
2742 linklist(op); /* blow off optimizer unless constant */
2748 newLOOPOP(flags, debuggable, expr, block)
2756 int once = block && block->op_flags & OPf_SPECIAL &&
2757 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2760 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2761 return block; /* do {} while 0 does once */
2762 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB) {
2763 expr = newUNOP(OP_DEFINED, 0,
2764 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2768 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2769 op = newLOGOP(OP_AND, 0, expr, listop);
2771 ((LISTOP*)listop)->op_last->op_next = LINKLIST(op);
2773 if (once && op != listop)
2774 op->op_next = ((LOGOP*)cUNOP->op_first)->op_other;
2777 op = newUNOP(OP_NULL, 0, op); /* or do {} while 1 loses outer block */
2779 op->op_flags |= flags;
2781 op->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2786 newWHILEOP(flags, debuggable, loop, expr, block, cont)
2800 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB)) {
2801 expr = newUNOP(OP_DEFINED, 0,
2802 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2806 block = newOP(OP_NULL, 0);
2809 next = LINKLIST(cont);
2811 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2813 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2814 redo = LINKLIST(listop);
2817 op = newLOGOP(OP_AND, 0, expr, scalar(listop));
2818 if (op == expr && op->op_type == OP_CONST && !SvTRUE(cSVOP->op_sv)) {
2819 op_free(expr); /* oops, it's a while (0) */
2821 return Nullop; /* (listop already freed by newLOGOP) */
2823 ((LISTOP*)listop)->op_last->op_next = condop =
2824 (op == listop ? redo : LINKLIST(op));
2832 Newz(1101,loop,1,LOOP);
2833 loop->op_type = OP_ENTERLOOP;
2834 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2835 loop->op_private = 0;
2836 loop->op_next = (OP*)loop;
2839 op = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, op);
2841 loop->op_redoop = redo;
2842 loop->op_lastop = op;
2845 loop->op_nextop = next;
2847 loop->op_nextop = op;
2849 op->op_flags |= flags;
2850 op->op_private |= (flags >> 8);
2855 #ifndef CAN_PROTOTYPE
2856 newFOROP(flags,label,forline,sv,expr,block,cont)
2865 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2866 #endif /* CAN_PROTOTYPE */
2874 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2875 sv->op_type = OP_RV2GV;
2876 sv->op_ppaddr = ppaddr[OP_RV2GV];
2878 else if (sv->op_type == OP_PADSV) { /* private variable */
2879 padoff = sv->op_targ;
2884 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2887 sv = newGVOP(OP_GV, 0, defgv);
2889 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2890 expr = scalar(ref(expr, OP_ITER));
2891 iterflags |= OPf_STACKED;
2893 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2894 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2896 assert(!loop->op_next);
2897 Renew(loop, 1, LOOP);
2898 loop->op_targ = padoff;
2899 return newSTATEOP(0, label, newWHILEOP(flags, 1, loop,
2900 newOP(OP_ITER, 0), block, cont));
2904 newLOOPEX(type, label)
2909 if (type != OP_GOTO || label->op_type == OP_CONST) {
2910 op = newPVOP(type, 0, savepv(
2911 label->op_type == OP_CONST
2912 ? SvPVx(((SVOP*)label)->op_sv, na)
2917 if (label->op_type == OP_ENTERSUB)
2918 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2919 op = newUNOP(type, OPf_STACKED, label);
2921 hints |= HINT_BLOCK_SCOPE;
2929 if (!CvXSUB(cv) && CvROOT(cv)) {
2931 croak("Can't undef active subroutine");
2938 op_free(CvROOT(cv));
2939 CvROOT(cv) = Nullop;
2942 SvPOK_off((SV*)cv); /* forget prototype */
2944 SvREFCNT_dec(CvGV(cv));
2946 SvREFCNT_dec(CvOUTSIDE(cv));
2947 CvOUTSIDE(cv) = Nullcv;
2948 if (CvPADLIST(cv)) {
2949 /* may be during global destruction */
2950 if (SvREFCNT(CvPADLIST(cv))) {
2951 I32 i = AvFILL(CvPADLIST(cv));
2953 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
2954 SV* sv = svp ? *svp : Nullsv;
2957 if (sv == (SV*)comppad_name)
2958 comppad_name = Nullav;
2959 else if (sv == (SV*)comppad) {
2961 curpad = Null(SV**);
2965 SvREFCNT_dec((SV*)CvPADLIST(cv));
2967 CvPADLIST(cv) = Nullav;
2971 #ifdef DEBUG_CLOSURES
2976 CV *outside = CvOUTSIDE(cv);
2977 AV* padlist = CvPADLIST(cv);
2984 PerlIO_printf(Perl_debug_log, "\tCV=0x%p (%s), OUTSIDE=0x%p (%s)\n",
2986 (CvANON(cv) ? "ANON"
2987 : (cv == main_cv) ? "MAIN"
2988 : CvUNIQUE(outside) ? "UNIQUE"
2989 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
2992 : CvANON(outside) ? "ANON"
2993 : (outside == main_cv) ? "MAIN"
2994 : CvUNIQUE(outside) ? "UNIQUE"
2995 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3000 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3001 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3002 pname = AvARRAY(pad_name);
3003 ppad = AvARRAY(pad);
3005 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
3006 if (SvPOK(pname[ix]))
3007 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%p (%s\"%s\" %ld-%ld)\n",
3009 SvFAKE(pname[ix]) ? "FAKE " : "",
3011 (long)I_32(SvNVX(pname[ix])),
3012 (long)SvIVX(pname[ix]));
3015 #endif /* DEBUG_CLOSURES */
3018 cv_clone2(proto, outside)
3024 AV* protopadlist = CvPADLIST(proto);
3025 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3026 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3027 SV** pname = AvARRAY(protopad_name);
3028 SV** ppad = AvARRAY(protopad);
3029 I32 fname = AvFILL(protopad_name);
3030 I32 fpad = AvFILL(protopad);
3034 assert(!CvUNIQUE(proto));
3039 SAVESPTR(comppad_name);
3042 cv = compcv = (CV*)NEWSV(1104,0);
3043 sv_upgrade((SV *)cv, SvTYPE(proto));
3048 CvFILEGV(cv) = CvFILEGV(proto);
3049 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3050 CvSTASH(cv) = CvSTASH(proto);
3051 CvROOT(cv) = CvROOT(proto);
3052 CvSTART(cv) = CvSTART(proto);
3054 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3057 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3059 comppad_name = newAV();
3060 for (ix = fname; ix >= 0; ix--)
3061 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3065 comppadlist = newAV();
3066 AvREAL_off(comppadlist);
3067 av_store(comppadlist, 0, (SV*)comppad_name);
3068 av_store(comppadlist, 1, (SV*)comppad);
3069 CvPADLIST(cv) = comppadlist;
3070 av_fill(comppad, AvFILL(protopad));
3071 curpad = AvARRAY(comppad);
3073 av = newAV(); /* will be @_ */
3075 av_store(comppad, 0, (SV*)av);
3076 AvFLAGS(av) = AVf_REIFY;
3078 for (ix = fpad; ix > 0; ix--) {
3079 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3080 if (namesv && namesv != &sv_undef) {
3081 char *name = SvPVX(namesv); /* XXX */
3082 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3083 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3084 CvOUTSIDE(cv), cxstack_ix);
3086 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3088 croak("panic: cv_clone: %s", name);
3090 else { /* our own lexical */
3093 /* anon code -- we'll come back for it */
3094 sv = SvREFCNT_inc(ppad[ix]);
3096 else if (*name == '@')
3098 else if (*name == '%')
3108 SV* sv = NEWSV(0,0);
3114 /* Now that vars are all in place, clone nested closures. */
3116 for (ix = fpad; ix > 0; ix--) {
3117 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3119 && namesv != &sv_undef
3120 && !(SvFLAGS(namesv) & SVf_FAKE)
3121 && *SvPVX(namesv) == '&'
3122 && CvCLONE(ppad[ix]))
3124 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3125 SvREFCNT_dec(ppad[ix]);
3128 curpad[ix] = (SV*)kid;
3132 #ifdef DEBUG_CLOSURES
3133 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3135 PerlIO_printf(Perl_debug_log, " from:\n");
3137 PerlIO_printf(Perl_debug_log, " to:\n");
3149 return cv_clone2(proto, CvOUTSIDE(proto));
3153 cv_ckproto(cv, gv, p)
3158 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3159 SV* msg = sv_newmortal();
3163 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3164 sv_setpv(msg, "Prototype mismatch:");
3166 sv_catpvf(msg, " sub %_", name);
3168 sv_catpvf(msg, " (%s)", SvPVX(cv));
3169 sv_catpv(msg, " vs ");
3171 sv_catpvf(msg, "(%s)", p);
3173 sv_catpv(msg, "none");
3185 if (!cv || !SvPOK(cv) || SvCUR(cv))
3189 for (o = CvSTART(cv); o; o = o->op_next) {
3190 OPCODE type = o->op_type;
3192 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3194 if (type == OP_LEAVESUB || type == OP_RETURN)
3198 if (type == OP_CONST)
3199 sv = ((SVOP*)o)->op_sv;
3200 else if (type == OP_PADSV) {
3201 AV* pad = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3202 sv = pad ? AvARRAY(pad)[o->op_targ] : Nullsv;
3203 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3215 newSUB(floor,op,proto,block)
3221 char *name = op ? SvPVx(cSVOP->op_sv, na) : Nullch;
3222 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3223 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3232 if (!name || GvCVGEN(gv))
3234 else if (cv = GvCV(gv)) {
3235 cv_ckproto(cv, gv, ps);
3236 /* already defined (or promised)? */
3237 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3240 /* just a "sub foo;" when &foo is already defined */
3244 /* ahem, death to those who redefine active sort subs */
3245 if (curstack == sortstack && sortcop == CvSTART(cv))
3246 croak("Can't redefine active sort subroutine %s", name);
3247 const_sv = cv_const_sv(cv);
3248 if (const_sv || dowarn) {
3249 line_t oldline = curcop->cop_line;
3250 curcop->cop_line = copline;
3251 warn(const_sv ? "Constant subroutine %s redefined"
3252 : "Subroutine %s redefined", name);
3253 curcop->cop_line = oldline;
3259 if (cv) { /* must reuse cv if autoloaded */
3261 CvFLAGS(cv) = CvFLAGS(compcv);
3262 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3263 CvOUTSIDE(compcv) = 0;
3264 CvPADLIST(cv) = CvPADLIST(compcv);
3265 CvPADLIST(compcv) = 0;
3266 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3267 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3268 SvREFCNT_dec(compcv);
3278 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3279 CvFILEGV(cv) = curcop->cop_filegv;
3280 CvSTASH(cv) = curstash;
3283 sv_setpv((SV*)cv, ps);
3289 char *s = strrchr(name, ':');
3291 if (strEQ(s, "BEGIN")) {
3293 "BEGIN not safe after errors--compilation aborted";
3297 /* force display of errors found but not reported */
3298 sv_catpv(GvSV(errgv), not_safe);
3299 croak("%s", SvPVx(GvSV(errgv), na));
3310 if (AvFILL(comppad_name) < AvFILL(comppad))
3311 av_store(comppad_name, AvFILL(comppad), Nullsv);
3314 SV **namep = AvARRAY(comppad_name);
3315 for (ix = AvFILL(comppad); ix > 0; ix--) {
3318 if (SvIMMORTAL(curpad[ix]))
3321 * The only things that a clonable function needs in its
3322 * pad are references to outer lexicals and anonymous subs.
3323 * The rest are created anew during cloning.
3325 if (!((namesv = namep[ix]) != Nullsv &&
3326 namesv != &sv_undef &&
3328 *SvPVX(namesv) == '&')))
3330 SvREFCNT_dec(curpad[ix]);
3331 curpad[ix] = Nullsv;
3336 AV *av = newAV(); /* Will be @_ */
3338 av_store(comppad, 0, (SV*)av);
3339 AvFLAGS(av) = AVf_REIFY;
3341 for (ix = AvFILL(comppad); ix > 0; ix--) {
3342 if (SvIMMORTAL(curpad[ix]))
3344 if (!SvPADMY(curpad[ix]))
3345 SvPADTMP_on(curpad[ix]);
3349 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3350 CvSTART(cv) = LINKLIST(CvROOT(cv));
3351 CvROOT(cv)->op_next = 0;
3357 if (perldb && curstash != debstash) {
3358 SV *sv = NEWSV(0,0);
3359 SV *tmpstr = sv_newmortal();
3360 static GV *db_postponed;
3364 sv_setpvf(sv, "%_:%ld-%ld",
3365 GvSV(curcop->cop_filegv),
3366 (long)subline, (long)curcop->cop_line);
3367 gv_efullname3(tmpstr, gv, Nullch);
3368 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3369 if (!db_postponed) {
3370 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3372 hv = GvHVn(db_postponed);
3373 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3374 && (cv = GvCV(db_postponed))) {
3379 perl_call_sv((SV*)cv, G_DISCARD);
3383 if ((s = strrchr(name,':')))
3387 if (strEQ(s, "BEGIN")) {
3388 I32 oldscope = scopestack_ix;
3390 SAVESPTR(compiling.cop_filegv);
3391 SAVEI16(compiling.cop_line);
3398 DEBUG_x( dump_sub(gv) );
3399 av_push(beginav, (SV *)cv);
3401 call_list(oldscope, beginav);
3403 curcop = &compiling;
3406 else if (strEQ(s, "END") && !error_count) {
3409 av_unshift(endav, 1);
3410 av_store(endav, 0, (SV *)cv);
3423 newXSUB(name, ix, subaddr, filename)
3429 CV* cv = newXS(name, (void(*)())subaddr, filename);
3431 CvXSUBANY(cv).any_i32 = ix;
3437 newXS(name, subaddr, filename)
3439 void (*subaddr) _((CV*));
3442 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3445 if (cv = (name ? GvCV(gv) : Nullcv)) {
3447 /* just a cached method */
3451 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3452 /* already defined (or promised) */
3454 line_t oldline = curcop->cop_line;
3455 curcop->cop_line = copline;
3456 warn("Subroutine %s redefined",name);
3457 curcop->cop_line = oldline;
3464 if (cv) /* must reuse cv if autoloaded */
3467 cv = (CV*)NEWSV(1105,0);
3468 sv_upgrade((SV *)cv, SVt_PVCV);
3475 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3476 CvFILEGV(cv) = gv_fetchfile(filename);
3477 CvXSUB(cv) = subaddr;
3480 char *s = strrchr(name,':');
3485 if (strEQ(s, "BEGIN")) {
3488 av_push(beginav, (SV *)cv);
3491 else if (strEQ(s, "END")) {
3494 av_unshift(endav, 1);
3495 av_store(endav, 0, (SV *)cv);
3506 newFORM(floor,op,block)
3517 name = SvPVx(cSVOP->op_sv, na);
3520 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3522 if (cv = GvFORM(gv)) {
3524 line_t oldline = curcop->cop_line;
3526 curcop->cop_line = copline;
3527 warn("Format %s redefined",name);
3528 curcop->cop_line = oldline;
3534 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3535 CvFILEGV(cv) = curcop->cop_filegv;
3537 for (ix = AvFILL(comppad); ix > 0; ix--) {
3538 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3539 SvPADTMP_on(curpad[ix]);
3542 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3543 CvSTART(cv) = LINKLIST(CvROOT(cv));
3544 CvROOT(cv)->op_next = 0;
3555 return newUNOP(OP_REFGEN, 0,
3556 mod(list(convert(OP_ANONLIST, 0, op)), OP_REFGEN));
3563 return newUNOP(OP_REFGEN, 0,
3564 mod(list(convert(OP_ANONHASH, 0, op)), OP_REFGEN));
3568 newANONSUB(floor, proto, block)
3573 return newUNOP(OP_REFGEN, 0,
3574 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3581 switch (o->op_type) {
3583 o->op_type = OP_PADAV;
3584 o->op_ppaddr = ppaddr[OP_PADAV];
3585 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3588 o->op_type = OP_RV2AV;
3589 o->op_ppaddr = ppaddr[OP_RV2AV];
3594 warn("oops: oopsAV");
3604 switch (o->op_type) {
3607 o->op_type = OP_PADHV;
3608 o->op_ppaddr = ppaddr[OP_PADHV];
3609 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3613 o->op_type = OP_RV2HV;
3614 o->op_ppaddr = ppaddr[OP_RV2HV];
3619 warn("oops: oopsHV");
3629 if (o->op_type == OP_PADANY) {
3630 o->op_type = OP_PADAV;
3631 o->op_ppaddr = ppaddr[OP_PADAV];
3634 return newUNOP(OP_RV2AV, 0, scalar(o));
3642 if (type == OP_MAPSTART)
3643 return newUNOP(OP_NULL, 0, o);
3644 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3651 if (o->op_type == OP_PADANY) {
3652 o->op_type = OP_PADHV;
3653 o->op_ppaddr = ppaddr[OP_PADHV];
3656 return newUNOP(OP_RV2HV, 0, scalar(o));
3663 croak("NOT IMPL LINE %d",__LINE__);
3673 return newUNOP(OP_RV2CV, flags, scalar(o));
3680 if (o->op_type == OP_PADANY) {
3681 o->op_type = OP_PADSV;
3682 o->op_ppaddr = ppaddr[OP_PADSV];
3685 return newUNOP(OP_RV2SV, 0, scalar(o));
3688 /* Check routines. */
3697 name = NEWSV(1106,0);
3698 sv_upgrade(name, SVt_PVNV);
3699 sv_setpvn(name, "&", 1);
3702 ix = pad_alloc(op->op_type, SVs_PADMY);
3703 av_store(comppad_name, ix, name);
3704 av_store(comppad, ix, cSVOP->op_sv);
3705 SvPADMY_on(cSVOP->op_sv);
3706 cSVOP->op_sv = Nullsv;
3707 cSVOP->op_targ = ix;
3715 op->op_private = hints;
3723 if (cUNOP->op_first->op_type == OP_CONCAT)
3724 op->op_flags |= OPf_STACKED;
3732 if (op->op_flags & OPf_KIDS) {
3735 OPCODE type = op->op_type;
3736 op = modkids(ck_fun(op), type);
3737 kid = cUNOP->op_first;
3738 newop = kUNOP->op_first->op_sibling;
3740 (newop->op_sibling ||
3741 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3742 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3743 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3747 op_free(kUNOP->op_first);
3748 kUNOP->op_first = newop;
3750 op->op_ppaddr = ppaddr[++op->op_type];
3760 if (op->op_flags & OPf_KIDS) {
3761 OP *kid = cUNOP->op_first;
3762 if (kid->op_type == OP_HSLICE)
3763 op->op_private |= OPpSLICE;
3764 else if (kid->op_type != OP_HELEM)
3765 croak("%s argument is not a HASH element or slice",
3766 op_desc[op->op_type]);
3776 I32 type = op->op_type;
3778 if (op->op_flags & OPf_KIDS) {
3779 if (cLISTOP->op_first->op_type == OP_STUB) {
3781 op = newUNOP(type, OPf_SPECIAL,
3782 newGVOP(OP_GV, 0, gv_fetchpv("main'ARGV", TRUE, SVt_PVAV)));
3793 hints |= HINT_BLOCK_SCOPE;
3794 if (op->op_flags & OPf_KIDS) {
3795 SVOP *kid = (SVOP*)cUNOP->op_first;
3798 op->op_flags &= ~OPf_KIDS;
3801 else if (kid->op_type == OP_LINESEQ) {
3804 kid->op_next = op->op_next;
3805 cUNOP->op_first = 0;
3808 Newz(1101, enter, 1, LOGOP);
3809 enter->op_type = OP_ENTERTRY;
3810 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3811 enter->op_private = 0;
3813 /* establish postfix order */
3814 enter->op_next = (OP*)enter;
3816 op = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3817 op->op_type = OP_LEAVETRY;
3818 op->op_ppaddr = ppaddr[OP_LEAVETRY];
3819 enter->op_other = op;
3825 op = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3827 op->op_targ = (PADOFFSET)hints;
3836 if (op->op_flags & OPf_STACKED) {
3838 kid = cUNOP->op_first->op_sibling;
3839 if (kid->op_type == OP_RV2GV)
3852 if (op->op_flags & OPf_KIDS) {
3853 OP *kid = cUNOP->op_first;
3854 if (kid->op_type != OP_HELEM)
3855 croak("%s argument is not a HASH element", op_desc[op->op_type]);
3865 o = fold_constants(o);
3866 if (o->op_type == OP_CONST)
3875 SVOP *kid = (SVOP*)cUNOP->op_first;
3877 op->op_private |= (hints & HINT_STRICT_REFS);
3878 if (kid->op_type == OP_CONST) {
3883 name = SvPV(kid->op_sv, na);
3884 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3885 char *badthing = Nullch;
3886 switch (op->op_type) {
3888 badthing = "a SCALAR";
3891 badthing = "an ARRAY";
3894 badthing = "a HASH";
3899 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3902 kid->op_type = OP_GV;
3903 iscv = (op->op_type == OP_RV2CV) * 2;
3904 for (gv = 0; !gv; iscv++) {
3906 * This is a little tricky. We only want to add the symbol if we
3907 * didn't add it in the lexer. Otherwise we get duplicate strict
3908 * warnings. But if we didn't add it in the lexer, we must at
3909 * least pretend like we wanted to add it even if it existed before,
3910 * or we get possible typo warnings. OPpCONST_ENTERED says
3911 * whether the lexer already added THIS instance of this symbol.
3913 gv = gv_fetchpv(name,
3914 iscv | !(kid->op_private & OPpCONST_ENTERED),
3917 : op->op_type == OP_RV2SV
3919 : op->op_type == OP_RV2AV
3921 : op->op_type == OP_RV2HV
3925 SvREFCNT_dec(kid->op_sv);
3926 kid->op_sv = SvREFCNT_inc(gv);
3935 I32 type = op->op_type;
3937 if (op->op_flags & OPf_REF)
3940 if (op->op_flags & OPf_KIDS) {
3941 SVOP *kid = (SVOP*)cUNOP->op_first;
3943 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3944 OP *newop = newGVOP(type, OPf_REF,
3945 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
3952 if (type == OP_FTTTY)
3953 return newGVOP(type, OPf_REF, gv_fetchpv("main'STDIN", TRUE,
3956 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3969 int type = op->op_type;
3970 register I32 oa = opargs[type] >> OASHIFT;
3972 if (op->op_flags & OPf_STACKED) {
3973 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
3976 return no_fh_allowed(op);
3979 if (op->op_flags & OPf_KIDS) {
3980 tokid = &cLISTOP->op_first;
3981 kid = cLISTOP->op_first;
3982 if (kid->op_type == OP_PUSHMARK ||
3983 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
3985 tokid = &kid->op_sibling;
3986 kid = kid->op_sibling;
3988 if (!kid && opargs[type] & OA_DEFGV)
3989 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
3993 sibl = kid->op_sibling;
4007 if (kid->op_type == OP_CONST &&
4008 (kid->op_private & OPpCONST_BARE)) {
4009 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4010 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4011 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4013 warn("Array @%s missing the @ in argument %ld of %s()",
4014 name, (long)numargs, op_desc[type]);
4017 kid->op_sibling = sibl;
4020 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4021 bad_type(numargs, "array", op_desc[op->op_type], kid);
4025 if (kid->op_type == OP_CONST &&
4026 (kid->op_private & OPpCONST_BARE)) {
4027 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4028 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4029 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4031 warn("Hash %%%s missing the %% in argument %ld of %s()",
4032 name, (long)numargs, op_desc[type]);
4035 kid->op_sibling = sibl;
4038 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4039 bad_type(numargs, "hash", op_desc[op->op_type], kid);
4044 OP *newop = newUNOP(OP_NULL, 0, kid);
4045 kid->op_sibling = 0;
4047 newop->op_next = newop;
4049 kid->op_sibling = sibl;
4054 if (kid->op_type != OP_GV) {
4055 if (kid->op_type == OP_CONST &&
4056 (kid->op_private & OPpCONST_BARE)) {
4057 OP *newop = newGVOP(OP_GV, 0,
4058 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4064 kid->op_sibling = 0;
4065 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4067 kid->op_sibling = sibl;
4073 mod(scalar(kid), type);
4077 tokid = &kid->op_sibling;
4078 kid = kid->op_sibling;
4080 op->op_private |= numargs;
4082 return too_many_arguments(op,op_desc[op->op_type]);
4085 else if (opargs[type] & OA_DEFGV) {
4087 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4091 while (oa & OA_OPTIONAL)
4093 if (oa && oa != OA_LIST)
4094 return too_few_arguments(op,op_desc[op->op_type]);
4103 GV *gv = gv_fetchpv("glob", FALSE, SVt_PVCV);
4105 if (gv && GvIMPORTED_CV(gv)) {
4106 static int glob_index;
4108 append_elem(OP_GLOB, op,
4109 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4110 op->op_type = OP_LIST;
4111 op->op_ppaddr = ppaddr[OP_LIST];
4112 ((LISTOP*)op)->op_first->op_type = OP_PUSHMARK;
4113 ((LISTOP*)op)->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4114 op = newUNOP(OP_ENTERSUB, OPf_STACKED,
4115 append_elem(OP_LIST, op,
4116 scalar(newUNOP(OP_RV2CV, 0,
4117 newGVOP(OP_GV, 0, gv)))));
4120 if ((op->op_flags & OPf_KIDS) && !cLISTOP->op_first->op_sibling)
4121 append_elem(OP_GLOB, op, newSVREF(newGVOP(OP_GV, 0, defgv)));
4122 gv = newGVgen("main");
4124 append_elem(OP_GLOB, op, newGVOP(OP_GV, 0, gv));
4135 OPCODE type = op->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4137 op->op_ppaddr = ppaddr[OP_GREPSTART];
4138 Newz(1101, gwop, 1, LOGOP);
4140 if (op->op_flags & OPf_STACKED) {
4143 kid = cLISTOP->op_first->op_sibling;
4144 for (k = cLISTOP->op_first->op_sibling->op_next; k; k = k->op_next) {
4147 kid->op_next = (OP*)gwop;
4148 op->op_flags &= ~OPf_STACKED;
4150 kid = cLISTOP->op_first->op_sibling;
4151 if (type == OP_MAPWHILE)
4158 kid = cLISTOP->op_first->op_sibling;
4159 if (kid->op_type != OP_NULL)
4160 croak("panic: ck_grep");
4161 kid = kUNOP->op_first;
4163 gwop->op_type = type;
4164 gwop->op_ppaddr = ppaddr[type];
4165 gwop->op_first = listkids(op);
4166 gwop->op_flags |= OPf_KIDS;
4167 gwop->op_private = 1;
4168 gwop->op_other = LINKLIST(kid);
4169 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4170 kid->op_next = (OP*)gwop;
4172 kid = cLISTOP->op_first->op_sibling;
4173 if (!kid || !kid->op_sibling)
4174 return too_few_arguments(op,op_desc[op->op_type]);
4175 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4176 mod(kid, OP_GREPSTART);
4185 if (op->op_flags & OPf_KIDS) {
4186 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4187 if (kid && kid->op_type == OP_CONST)
4188 fbm_compile(((SVOP*)kid)->op_sv);
4197 /* XXX length optimization goes here */
4205 OPCODE type = op->op_type;
4206 return modkids(ck_fun(op), type);
4213 OPCODE type = op->op_type;
4214 return refkids(ck_fun(op), type);
4223 kid = cLISTOP->op_first;
4225 op = force_list(op);
4226 kid = cLISTOP->op_first;
4228 if (kid->op_type == OP_PUSHMARK)
4229 kid = kid->op_sibling;
4230 if (kid && op->op_flags & OPf_STACKED)
4231 kid = kid->op_sibling;
4232 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4233 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4234 op->op_flags |= OPf_STACKED; /* make it a filehandle */
4235 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4236 cLISTOP->op_first->op_sibling = kid;
4237 cLISTOP->op_last = kid;
4238 kid = kid->op_sibling;
4243 append_elem(op->op_type, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4249 if (hints & HINT_LOCALE)
4250 op->op_private |= OPpLOCALE;
4264 if (hints & HINT_LOCALE)
4265 op->op_private |= OPpLOCALE;
4277 if (hints & HINT_LOCALE)
4278 op->op_private |= OPpLOCALE;
4288 op->op_private |= OPpRUNTIME;
4303 if (cBINOP->op_first->op_flags & OPf_PARENS) {
4304 op->op_private |= OPpREPEAT_DOLIST;
4305 cBINOP->op_first = force_list(cBINOP->op_first);
4316 if (op->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4317 SVOP *kid = (SVOP*)cUNOP->op_first;
4319 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4321 for (s = SvPVX(kid->op_sv); *s; s++) {
4322 if (*s == ':' && s[1] == ':') {
4324 Move(s+2, s+1, strlen(s+2)+1, char);
4325 --SvCUR(kid->op_sv);
4328 sv_catpvn(kid->op_sv, ".pm", 3);
4338 croak("NOT IMPL LINE %d",__LINE__);
4348 if (op->op_flags & OPf_KIDS) {
4349 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4350 if (kid && kid->op_sibling) {
4351 op->op_type = OP_SSELECT;
4352 op->op_ppaddr = ppaddr[OP_SSELECT];
4354 return fold_constants(op);
4358 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4359 if (kid && kid->op_type == OP_RV2GV)
4360 kid->op_private &= ~HINT_STRICT_REFS;
4368 I32 type = op->op_type;
4370 if (!(op->op_flags & OPf_KIDS)) {
4372 return newUNOP(type, 0,
4373 scalar(newUNOP(OP_RV2AV, 0,
4374 scalar(newGVOP(OP_GV, 0, subline
4376 : gv_fetchpv("ARGV", TRUE, SVt_PVAV) )))));
4378 return scalar(modkids(ck_fun(op), type));
4387 if (hints & HINT_LOCALE)
4388 op->op_private |= OPpLOCALE;
4391 if (op->op_flags & OPf_STACKED) {
4392 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4394 kid = kUNOP->op_first; /* get past rv2gv */
4396 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4398 if (kid->op_type == OP_SCOPE) {
4402 else if (kid->op_type == OP_LEAVE) {
4403 if (op->op_type == OP_SORT) {
4404 null(kid); /* wipe out leave */
4407 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4408 if (k->op_next == kid)
4413 kid->op_next = 0; /* just disconnect the leave */
4414 k = kLISTOP->op_first;
4418 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4419 null(kid); /* wipe out rv2gv */
4420 if (op->op_type == OP_SORT)
4424 op->op_flags |= OPf_SPECIAL;
4438 if (op->op_flags & OPf_STACKED)
4439 return no_fh_allowed(op);
4441 kid = cLISTOP->op_first;
4442 if (kid->op_type != OP_NULL)
4443 croak("panic: ck_split");
4444 kid = kid->op_sibling;
4445 op_free(cLISTOP->op_first);
4446 cLISTOP->op_first = kid;
4448 cLISTOP->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4449 cLISTOP->op_last = kid; /* There was only one element previously */
4452 if (kid->op_type != OP_MATCH) {
4453 OP *sibl = kid->op_sibling;
4454 kid->op_sibling = 0;
4455 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4456 if (cLISTOP->op_first == cLISTOP->op_last)
4457 cLISTOP->op_last = kid;
4458 cLISTOP->op_first = kid;
4459 kid->op_sibling = sibl;
4462 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4463 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4467 kid->op_type = OP_PUSHRE;
4468 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4471 if (!kid->op_sibling)
4472 append_elem(OP_SPLIT, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4474 kid = kid->op_sibling;
4477 if (!kid->op_sibling)
4478 append_elem(OP_SPLIT, op, newSVOP(OP_CONST, 0, newSViv(0)));
4480 kid = kid->op_sibling;
4483 if (kid->op_sibling)
4484 return too_many_arguments(op,op_desc[op->op_type]);
4493 OP *prev = ((cUNOP->op_first->op_sibling)
4494 ? cUNOP : ((UNOP*)cUNOP->op_first))->op_first;
4495 OP *o = prev->op_sibling;
4503 for (cvop = o; cvop->op_sibling; cvop = cvop->op_sibling) ;
4504 if (cvop->op_type == OP_RV2CV) {
4506 op->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4507 null(cvop); /* disable rv2cv */
4508 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4509 if (tmpop->op_type == OP_GV) {
4510 cv = GvCVu(tmpop->op_sv);
4511 if (cv && SvPOK(cv) && !(op->op_private & OPpENTERSUB_AMPER)) {
4512 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4513 proto = SvPV((SV*)cv, na);
4517 op->op_private |= (hints & HINT_STRICT_REFS);
4518 if (perldb && curstash != debstash)
4519 op->op_private |= OPpENTERSUB_DB;
4524 return too_many_arguments(op, gv_ename(namegv));
4542 if (o->op_type != OP_REFGEN && o->op_type != OP_UNDEF)
4543 bad_type(arg, "block", gv_ename(namegv), o);
4548 if (o->op_type == OP_RV2GV)
4552 o = newUNOP(OP_RV2GV, 0, kid);
4553 o->op_sibling = kid->op_sibling;
4554 kid->op_sibling = 0;
4555 prev->op_sibling = o;
4563 if (o->op_type != OP_RV2GV)
4564 bad_type(arg, "symbol", gv_ename(namegv), o);
4567 if (o->op_type != OP_RV2CV)
4568 bad_type(arg, "sub", gv_ename(namegv), o);
4571 if (o->op_type != OP_RV2SV && o->op_type != OP_PADSV)
4572 bad_type(arg, "scalar", gv_ename(namegv), o);
4575 if (o->op_type != OP_RV2AV && o->op_type != OP_PADAV)
4576 bad_type(arg, "array", gv_ename(namegv), o);
4579 if (o->op_type != OP_RV2HV && o->op_type != OP_PADHV)
4580 bad_type(arg, "hash", gv_ename(namegv), o);
4584 o = newUNOP(OP_REFGEN, 0, kid);
4585 o->op_sibling = kid->op_sibling;
4586 kid->op_sibling = 0;
4587 prev->op_sibling = o;
4598 croak("Malformed prototype for %s: %s",
4599 gv_ename(namegv), SvPV((SV*)cv, na));
4604 mod(o, OP_ENTERSUB);
4608 if (proto && !optional && *proto == '$')
4609 return too_few_arguments(op, gv_ename(namegv));
4617 SvREADONLY_on(cSVOP->op_sv);
4625 if (op->op_flags & OPf_KIDS) {
4626 SVOP *kid = (SVOP*)cUNOP->op_first;
4628 if (kid->op_type == OP_NULL)
4629 kid = (SVOP*)kid->op_sibling;
4631 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4632 op->op_flags |= OPf_SPECIAL;
4637 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4643 register OP* oldop = 0;
4644 if (!o || o->op_seq)
4649 for (; o; o = o->op_next) {
4655 switch (o->op_type) {
4658 curcop = ((COP*)o); /* for warnings */
4659 o->op_seq = op_seqmax++;
4670 if (o->op_next->op_type == OP_STRINGIFY)
4672 o->op_seq = op_seqmax++;
4675 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4676 o->op_seq = op_seqmax++;
4677 break; /* Scalar stub must produce undef. List stub is noop */
4681 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4682 curcop = ((COP*)op);
4688 if (oldop && o->op_next) {
4689 oldop->op_next = o->op_next;
4692 o->op_seq = op_seqmax++;
4696 if (o->op_next->op_type == OP_RV2SV) {
4697 if (!(o->op_next->op_private & OPpDEREF)) {
4699 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4700 o->op_next = o->op_next->op_next;
4701 o->op_type = OP_GVSV;
4702 o->op_ppaddr = ppaddr[OP_GVSV];
4705 else if (o->op_next->op_type == OP_RV2AV) {
4706 OP* pop = o->op_next->op_next;
4708 if (pop->op_type == OP_CONST &&
4709 (op = pop->op_next) &&
4710 pop->op_next->op_type == OP_AELEM &&
4711 !(pop->op_next->op_private &
4712 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4713 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4717 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4721 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4722 o->op_next = pop->op_next->op_next;
4723 o->op_type = OP_AELEMFAST;
4724 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4725 o->op_private = (U8)i;
4726 GvAVn(((GVOP*)o)->op_gv);
4729 o->op_seq = op_seqmax++;
4736 o->op_seq = op_seqmax++;
4737 peep(cLOGOP->op_other);
4741 o->op_seq = op_seqmax++;
4742 peep(cCONDOP->op_true);
4743 peep(cCONDOP->op_false);
4747 o->op_seq = op_seqmax++;
4748 peep(cLOOP->op_redoop);
4749 peep(cLOOP->op_nextop);
4750 peep(cLOOP->op_lastop);
4755 o->op_seq = op_seqmax++;
4756 peep(cPMOP->op_pmreplstart);
4760 o->op_seq = op_seqmax++;
4761 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4762 if (o->op_next->op_sibling &&
4763 o->op_next->op_sibling->op_type != OP_DIE) {
4764 line_t oldline = curcop->cop_line;
4766 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4767 warn("Statement unlikely to be reached");
4768 warn("(Maybe you meant system() when you said exec()?)\n");
4769 curcop->cop_line = oldline;
4774 o->op_seq = op_seqmax++;