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);
147 croak("Can't declare class for non-scalar %s in \"my\"",name);
149 (void)SvUPGRADE(sv, SVt_PVMG);
150 SvSTASH(sv) = (HV*)SvREFCNT_inc(in_my_stash);
153 av_store(comppad_name, off, sv);
154 SvNVX(sv) = (double)999999999;
155 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
156 if (!min_intro_pending)
157 min_intro_pending = off;
158 max_intro_pending = off;
160 av_store(comppad, off, (SV*)newAV());
161 else if (*name == '%')
162 av_store(comppad, off, (SV*)newHV());
163 SvPADMY_on(curpad[off]);
168 #ifndef CAN_PROTOTYPE
169 pad_findlex(name, newoff, seq, startcv, cx_ix)
176 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
183 register CONTEXT *cx;
186 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
187 AV *curlist = CvPADLIST(cv);
188 SV **svp = av_fetch(curlist, 0, FALSE);
191 if (!svp || *svp == &sv_undef)
194 svp = AvARRAY(curname);
195 for (off = AvFILL(curname); off > 0; off--) {
196 if ((sv = svp[off]) &&
199 seq > I_32(SvNVX(sv)) &&
200 strEQ(SvPVX(sv), name))
211 return 0; /* don't clone from inactive stack frame */
215 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
216 oldsv = *av_fetch(oldpad, off, TRUE);
217 if (!newoff) { /* Not a mere clone operation. */
218 SV *namesv = NEWSV(1103,0);
219 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
220 sv_upgrade(namesv, SVt_PVNV);
221 sv_setpv(namesv, name);
222 av_store(comppad_name, newoff, namesv);
223 SvNVX(namesv) = (double)curcop->cop_seq;
224 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
225 SvFAKE_on(namesv); /* A ref, not a real var */
226 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
227 /* "It's closures all the way down." */
231 oldsv = Nullsv; /* no need to keep ref */
236 bcv && bcv != cv && !CvCLONE(bcv);
237 bcv = CvOUTSIDE(bcv)) {
241 if (dowarn && !CvUNIQUE(cv))
243 "Variable \"%s\" may be unavailable",
250 else if (!CvUNIQUE(compcv)) {
251 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
252 warn("Variable \"%s\" will not stay shared", name);
255 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
261 /* Nothing in current lexical context--try eval's context, if any.
262 * This is necessary to let the perldb get at lexically scoped variables.
263 * XXX This will also probably interact badly with eval tree caching.
267 for (i = cx_ix; i >= 0; i--) {
269 switch (cx->cx_type) {
271 if (i == 0 && saweval) {
272 seq = cxstack[saweval].blk_oldcop->cop_seq;
273 return pad_findlex(name, newoff, seq, main_cv, 0);
277 switch (cx->blk_eval.old_op_type) {
282 /* require must have its own scope */
290 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
291 saweval = i; /* so we know where we were called from */
294 seq = cxstack[saweval].blk_oldcop->cop_seq;
295 return pad_findlex(name, newoff, seq, cv, i-1);
309 SV **svp = AvARRAY(comppad_name);
310 U32 seq = cop_seqmax;
312 /* The one we're looking for is probably just before comppad_name_fill. */
313 for (off = AvFILL(comppad_name); off > 0; off--) {
314 if ((sv = svp[off]) &&
318 seq > I_32(SvNVX(sv)))) &&
319 strEQ(SvPVX(sv), name))
322 return (PADOFFSET)off;
323 pendoff = off; /* this pending def. will override import */
327 /* See if it's in a nested scope */
328 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
330 /* If there is a pending local definition, this new alias must die */
332 SvIVX(AvARRAY(comppad_name)[off]) = seq;
344 SV **svp = AvARRAY(comppad_name);
346 if (min_intro_pending && fill < min_intro_pending) {
347 for (off = max_intro_pending; off >= min_intro_pending; off--) {
348 if ((sv = svp[off]) && sv != &sv_undef)
349 warn("%s never introduced", SvPVX(sv));
352 /* "Deintroduce" my variables that are leaving with this scope. */
353 for (off = AvFILL(comppad_name); off > fill; off--) {
354 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
355 SvIVX(sv) = cop_seqmax;
360 pad_alloc(optype,tmptype)
367 if (AvARRAY(comppad) != curpad)
368 croak("panic: pad_alloc");
369 if (pad_reset_pending)
371 if (tmptype & SVs_PADMY) {
373 sv = *av_fetch(comppad, AvFILL(comppad) + 1, TRUE);
374 } while (SvPADBUSY(sv)); /* need a fresh one */
375 retval = AvFILL(comppad);
378 SV **names = AvARRAY(comppad_name);
379 SSize_t names_fill = AvFILL(comppad_name);
382 * "foreach" index vars temporarily become aliases to non-"my"
383 * values. Thus we must skip, not just pad values that are
384 * marked as current pad values, but also those with names.
386 if (++padix <= names_fill &&
387 (sv = names[padix]) && sv != &sv_undef)
389 sv = *av_fetch(comppad, padix, TRUE);
390 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
395 SvFLAGS(sv) |= tmptype;
396 curpad = AvARRAY(comppad);
397 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad alloc %ld for %s\n", (long) retval, op_name[optype]));
398 return (PADOFFSET)retval;
402 #ifndef CAN_PROTOTYPE
407 #endif /* CAN_PROTOTYPE */
410 croak("panic: pad_sv po");
411 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad sv %lu\n", (unsigned long)po));
412 return curpad[po]; /* eventually we'll turn this into a macro */
416 #ifndef CAN_PROTOTYPE
420 pad_free(PADOFFSET po)
421 #endif /* CAN_PROTOTYPE */
425 if (AvARRAY(comppad) != curpad)
426 croak("panic: pad_free curpad");
428 croak("panic: pad_free po");
429 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad free %lu\n", (unsigned long)po));
430 if (curpad[po] && !SvIMMORTAL(curpad[po]))
431 SvPADTMP_off(curpad[po]);
437 #ifndef CAN_PROTOTYPE
441 pad_swipe(PADOFFSET po)
442 #endif /* CAN_PROTOTYPE */
444 if (AvARRAY(comppad) != curpad)
445 croak("panic: pad_swipe curpad");
447 croak("panic: pad_swipe po");
448 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad swipe %lu\n", (unsigned long)po));
449 SvPADTMP_off(curpad[po]);
450 curpad[po] = NEWSV(1107,0);
451 SvPADTMP_on(curpad[po]);
461 if (AvARRAY(comppad) != curpad)
462 croak("panic: pad_reset curpad");
463 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad reset\n"));
464 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
465 for (po = AvMAX(comppad); po > padix_floor; po--) {
466 if (curpad[po] && !SvIMMORTAL(curpad[po]))
467 SvPADTMP_off(curpad[po]);
471 pad_reset_pending = FALSE;
480 register OP *kid, *nextkid;
482 if (!op || op->op_seq == (U16)-1)
485 if (op->op_flags & OPf_KIDS) {
486 for (kid = cUNOP->op_first; kid; kid = nextkid) {
487 nextkid = kid->op_sibling; /* Get before next freeing kid */
492 switch (op->op_type) {
494 op->op_targ = 0; /* Was holding old type, if any. */
497 op->op_targ = 0; /* Was holding hints. */
500 if (!(op->op_flags & OPf_REF) || (check[op->op_type] != ck_ftst))
506 SvREFCNT_dec(cGVOP->op_gv);
510 Safefree(cCOP->cop_label);
511 SvREFCNT_dec(cCOP->cop_filegv);
514 SvREFCNT_dec(cSVOP->op_sv);
520 if (op->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
524 Safefree(cPVOP->op_pv);
527 op_free(cPMOP->op_pmreplroot);
531 pregfree(cPMOP->op_pmregexp);
532 SvREFCNT_dec(cPMOP->op_pmshort);
537 pad_free(op->op_targ);
546 if (op->op_type != OP_NULL && op->op_targ > 0)
547 pad_free(op->op_targ);
548 op->op_targ = op->op_type;
549 op->op_type = OP_NULL;
550 op->op_ppaddr = ppaddr[OP_NULL];
553 /* Contextualizers */
555 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
566 /* establish postfix order */
567 if (cUNOP->op_first) {
568 op->op_next = LINKLIST(cUNOP->op_first);
569 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling) {
571 kid->op_next = LINKLIST(kid->op_sibling);
587 if (op && op->op_flags & OPf_KIDS) {
588 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
599 op->op_type == OP_SASSIGN && cBINOP->op_first->op_type == OP_CONST) {
600 line_t oldline = curcop->cop_line;
602 if (copline != NOLINE)
603 curcop->cop_line = copline;
604 warn("Found = in conditional, should be ==");
605 curcop->cop_line = oldline;
616 /* assumes no premature commitment */
617 if (!op || (op->op_flags & OPf_WANT) || error_count
618 || op->op_type == OP_RETURN)
621 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
623 switch (op->op_type) {
625 if (op->op_private & OPpREPEAT_DOLIST)
626 null(((LISTOP*)cBINOP->op_first)->op_first);
627 scalar(cBINOP->op_first);
632 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
636 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
637 if (!kPMOP->op_pmreplroot)
638 deprecate("implicit split to @_");
645 if (op->op_flags & OPf_KIDS) {
646 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling)
652 kid = cLISTOP->op_first;
654 while (kid = kid->op_sibling) {
665 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
685 /* assumes no premature commitment */
686 if (!op || (op->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
687 || op->op_type == OP_RETURN)
690 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
692 switch (op->op_type) {
694 if (!(opargs[op->op_type] & OA_FOLDCONST))
698 if (op->op_flags & OPf_STACKED)
769 if (!(op->op_private & OPpLVAL_INTRO))
770 useless = op_desc[op->op_type];
777 if (!(op->op_private & OPpLVAL_INTRO) &&
778 (!op->op_sibling || op->op_sibling->op_type != OP_READLINE))
779 useless = "a variable";
784 curcop = ((COP*)op); /* for warning below */
790 useless = "a constant";
791 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
793 else if (SvPOK(sv)) {
794 if (strnEQ(SvPVX(sv), "di", 2) ||
795 strnEQ(SvPVX(sv), "ds", 2) ||
796 strnEQ(SvPVX(sv), "ig", 2))
800 null(op); /* don't execute a constant */
801 SvREFCNT_dec(sv); /* don't even remember it */
805 op->op_type = OP_PREINC; /* pre-increment is faster */
806 op->op_ppaddr = ppaddr[OP_PREINC];
810 op->op_type = OP_PREDEC; /* pre-decrement is faster */
811 op->op_ppaddr = ppaddr[OP_PREDEC];
817 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
822 if (op->op_targ == OP_NEXTSTATE || op->op_targ == OP_DBSTATE)
823 curcop = ((COP*)op); /* for warning below */
824 if (op->op_flags & OPf_STACKED)
830 if (!(op->op_flags & OPf_KIDS))
839 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
846 /* all requires must return a boolean value */
847 op->op_flags &= ~OPf_WANT;
850 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
851 if (!kPMOP->op_pmreplroot)
852 deprecate("implicit split to @_");
856 if (useless && dowarn)
857 warn("Useless use of %s in void context", useless);
866 if (op && op->op_flags & OPf_KIDS) {
867 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
879 /* assumes no premature commitment */
880 if (!op || (op->op_flags & OPf_WANT) || error_count
881 || op->op_type == OP_RETURN)
884 op->op_flags = (op->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
886 switch (op->op_type) {
889 list(cBINOP->op_first);
894 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
901 if (!(op->op_flags & OPf_KIDS))
903 if (!op->op_next && cUNOP->op_first->op_type == OP_FLOP) {
904 list(cBINOP->op_first);
905 return gen_constant_list(op);
912 kid = cLISTOP->op_first;
914 while (kid = kid->op_sibling) {
924 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
933 /* all requires must return a boolean value */
934 op->op_flags &= ~OPf_WANT;
947 if (op->op_type == OP_LINESEQ ||
948 op->op_type == OP_SCOPE ||
949 op->op_type == OP_LEAVE ||
950 op->op_type == OP_LEAVETRY)
952 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
953 if (kid->op_sibling) {
959 op->op_flags &= ~OPf_PARENS;
960 if (hints & HINT_BLOCK_SCOPE)
961 op->op_flags |= OPf_PARENS;
964 op = newOP(OP_STUB, 0);
974 if (op && op->op_flags & OPf_KIDS) {
975 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
991 if (!op || error_count)
994 switch (op->op_type) {
998 if (!(op->op_private & (OPpCONST_ARYBASE)))
1000 if (eval_start && eval_start->op_type == OP_CONST) {
1001 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1005 SAVEI32(compiling.cop_arybase);
1006 compiling.cop_arybase = 0;
1008 else if (type == OP_REFGEN)
1011 croak("That use of $[ is unsupported");
1014 if (op->op_flags & OPf_PARENS)
1018 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1019 !(op->op_flags & OPf_STACKED)) {
1020 op->op_type = OP_RV2CV; /* entersub => rv2cv */
1021 op->op_ppaddr = ppaddr[OP_RV2CV];
1022 assert(cUNOP->op_first->op_type == OP_NULL);
1023 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
1029 /* grep, foreach, subcalls, refgen */
1030 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1032 yyerror(form("Can't modify %s in %s",
1033 op_desc[op->op_type],
1034 type ? op_desc[type] : "local"));
1048 case OP_RIGHT_SHIFT:
1057 if (!(op->op_flags & OPf_STACKED))
1063 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
1069 if (type == OP_REFGEN && op->op_flags & OPf_PARENS) {
1071 return op; /* Treat \(@foo) like ordinary list. */
1075 if (scalar_mod_type(op, type))
1077 ref(cUNOP->op_first, op->op_type);
1089 if (!type && cUNOP->op_first->op_type != OP_GV)
1090 croak("Can't localize a reference");
1091 ref(cUNOP->op_first, op->op_type);
1103 if (type == OP_REFGEN && op->op_flags & OPf_PARENS)
1104 return op; /* Treat \(@foo) like ordinary list. */
1105 if (scalar_mod_type(op, type))
1111 croak("Can't localize lexical variable %s",
1112 SvPV(*av_fetch(comppad_name, op->op_targ, 4), na));
1119 if (type != OP_SASSIGN)
1125 pad_free(op->op_targ);
1126 op->op_targ = pad_alloc(op->op_type, SVs_PADMY);
1127 assert(SvTYPE(PAD_SV(op->op_targ)) == SVt_NULL);
1128 if (op->op_flags & OPf_KIDS)
1129 mod(cBINOP->op_first->op_sibling, type);
1134 ref(cBINOP->op_first, op->op_type);
1135 if (type == OP_ENTERSUB &&
1136 !(op->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1137 op->op_private |= OPpLVAL_DEFER;
1144 if (op->op_flags & OPf_KIDS)
1145 mod(cLISTOP->op_last, type);
1149 if (!(op->op_flags & OPf_KIDS))
1151 if (op->op_targ != OP_LIST) {
1152 mod(cBINOP->op_first, type);
1157 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1161 op->op_flags |= OPf_MOD;
1163 if (type == OP_AASSIGN || type == OP_SASSIGN)
1164 op->op_flags |= OPf_SPECIAL|OPf_REF;
1166 op->op_private |= OPpLVAL_INTRO;
1167 op->op_flags &= ~OPf_SPECIAL;
1169 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1170 op->op_flags |= OPf_REF;
1175 scalar_mod_type(op, type)
1181 if (op->op_type == OP_RV2GV)
1205 case OP_RIGHT_SHIFT:
1212 case OP_ANDASSIGN: /* may work later */
1213 case OP_ORASSIGN: /* may work later */
1226 if (op && op->op_flags & OPf_KIDS) {
1227 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1240 if (!op || error_count)
1243 switch (op->op_type) {
1245 if ((type == OP_DEFINED) &&
1246 !(op->op_flags & OPf_STACKED)) {
1247 op->op_type = OP_RV2CV; /* entersub => rv2cv */
1248 op->op_ppaddr = ppaddr[OP_RV2CV];
1249 assert(cUNOP->op_first->op_type == OP_NULL);
1250 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
1251 op->op_flags |= OPf_SPECIAL;
1256 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
1260 ref(cUNOP->op_first, op->op_type);
1263 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1264 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1265 : type == OP_RV2HV ? OPpDEREF_HV
1267 op->op_flags |= OPf_MOD;
1273 op->op_flags |= OPf_REF;
1276 ref(cUNOP->op_first, op->op_type);
1281 op->op_flags |= OPf_REF;
1286 if (!(op->op_flags & OPf_KIDS))
1288 ref(cBINOP->op_first, type);
1292 ref(cBINOP->op_first, op->op_type);
1293 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1294 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1295 : type == OP_RV2HV ? OPpDEREF_HV
1297 op->op_flags |= OPf_MOD;
1305 if (!(op->op_flags & OPf_KIDS))
1307 ref(cLISTOP->op_last, type);
1323 if (!op || error_count)
1327 if (type == OP_LIST) {
1328 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1331 else if (type != OP_PADSV &&
1334 type != OP_PUSHMARK)
1336 yyerror(form("Can't declare %s in my", op_desc[op->op_type]));
1339 op->op_flags |= OPf_MOD;
1340 op->op_private |= OPpLVAL_INTRO;
1349 o->op_flags |= OPf_PARENS;
1354 bind_match(type, left, right)
1362 (left->op_type == OP_RV2AV ||
1363 left->op_type == OP_RV2HV ||
1364 left->op_type == OP_PADAV ||
1365 left->op_type == OP_PADHV)) {
1366 char *desc = op_desc[(right->op_type == OP_SUBST ||
1367 right->op_type == OP_TRANS)
1368 ? right->op_type : OP_MATCH];
1369 char *sample = ((left->op_type == OP_RV2AV ||
1370 left->op_type == OP_PADAV)
1371 ? "@array" : "%hash");
1372 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1375 if (right->op_type == OP_MATCH ||
1376 right->op_type == OP_SUBST ||
1377 right->op_type == OP_TRANS) {
1378 right->op_flags |= OPf_STACKED;
1379 if (right->op_type != OP_MATCH)
1380 left = mod(left, right->op_type);
1381 if (right->op_type == OP_TRANS)
1382 op = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1384 op = prepend_elem(right->op_type, scalar(left), right);
1386 return newUNOP(OP_NOT, 0, scalar(op));
1390 return bind_match(type, left,
1391 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1400 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1401 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(op));
1409 if (o->op_flags & OPf_PARENS || perldb || tainting) {
1410 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1411 o->op_type = OP_LEAVE;
1412 o->op_ppaddr = ppaddr[OP_LEAVE];
1415 if (o->op_type == OP_LINESEQ) {
1417 o->op_type = OP_SCOPE;
1418 o->op_ppaddr = ppaddr[OP_SCOPE];
1419 kid = ((LISTOP*)o)->op_first;
1420 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1421 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1426 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1436 int retval = savestack_ix;
1437 SAVEI32(comppad_name_floor);
1439 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1440 comppad_name_floor = comppad_name_fill;
1442 comppad_name_floor = 0;
1444 SAVEI32(min_intro_pending);
1445 SAVEI32(max_intro_pending);
1446 min_intro_pending = 0;
1447 SAVEI32(comppad_name_fill);
1448 SAVEI32(padix_floor);
1449 padix_floor = padix;
1450 pad_reset_pending = FALSE;
1452 hints &= ~HINT_BLOCK_SCOPE;
1457 block_end(floor, seq)
1461 int needblockscope = hints & HINT_BLOCK_SCOPE;
1462 OP* retval = scalarseq(seq);
1464 pad_reset_pending = FALSE;
1466 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1467 pad_leavemy(comppad_name_fill);
1477 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), op);
1478 eval_start = linklist(eval_root);
1479 eval_root->op_next = 0;
1485 main_root = scope(sawparens(scalarvoid(op)));
1486 curcop = &compiling;
1487 main_start = LINKLIST(main_root);
1488 main_root->op_next = 0;
1492 /* Register with debugger */
1494 CV *cv = perl_get_cv("DB::postponed", FALSE);
1498 XPUSHs((SV*)compiling.cop_filegv);
1500 perl_call_sv((SV*)cv, G_DISCARD);
1511 if (o->op_flags & OPf_PARENS)
1515 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1517 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1518 if (*s == ';' || *s == '=')
1519 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1523 in_my_stash = Nullhv;
1527 return mod(o, OP_NULL); /* a bit kludgey */
1534 if (o->op_type == OP_LIST) {
1535 o = convert(OP_JOIN, 0,
1536 prepend_elem(OP_LIST,
1537 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1548 I32 type = o->op_type;
1551 if (opargs[type] & OA_RETSCALAR)
1553 if (opargs[type] & OA_TARGET)
1554 o->op_targ = pad_alloc(type, SVs_PADTMP);
1556 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1557 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1559 if (!(opargs[type] & OA_FOLDCONST))
1563 goto nope; /* Don't try to run w/ errors */
1565 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1566 if (curop->op_type != OP_CONST &&
1567 curop->op_type != OP_LIST &&
1568 curop->op_type != OP_SCALAR &&
1569 curop->op_type != OP_NULL &&
1570 curop->op_type != OP_PUSHMARK) {
1575 curop = LINKLIST(o);
1580 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1581 pad_swipe(o->op_targ);
1582 else if (SvTEMP(sv)) { /* grab mortal temp? */
1583 (void)SvREFCNT_inc(sv);
1587 if (type == OP_RV2GV)
1588 return newGVOP(OP_GV, 0, (GV*)sv);
1590 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1592 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1597 SvIOK_off(sv); /* undo SvIV() damage */
1599 return newSVOP(OP_CONST, 0, sv);
1603 if (!(opargs[type] & OA_OTHERINT))
1606 if (!(hints & HINT_INTEGER)) {
1607 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1610 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1611 if (curop->op_type == OP_CONST) {
1612 if (SvIOK(((SVOP*)curop)->op_sv))
1616 if (opargs[curop->op_type] & OA_RETINTEGER)
1620 o->op_ppaddr = ppaddr[++(o->op_type)];
1627 gen_constant_list(o)
1631 I32 oldtmps_floor = tmps_floor;
1635 return o; /* Don't attempt to run with errors */
1637 op = curop = LINKLIST(o);
1643 tmps_floor = oldtmps_floor;
1645 o->op_type = OP_RV2AV;
1646 o->op_ppaddr = ppaddr[OP_RV2AV];
1647 curop = ((UNOP*)o)->op_first;
1648 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1655 convert(type, flags, op)
1663 if (!op || op->op_type != OP_LIST)
1664 op = newLISTOP(OP_LIST, 0, op, Nullop);
1666 op->op_flags &= ~OPf_WANT;
1668 if (!(opargs[type] & OA_MARK))
1669 null(cLISTOP->op_first);
1672 op->op_ppaddr = ppaddr[type];
1673 op->op_flags |= flags;
1675 op = CHECKOP(type, op);
1676 if (op->op_type != type)
1679 if (cLISTOP->op_children < 7) {
1680 /* XXX do we really need to do this if we're done appending?? */
1681 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1683 cLISTOP->op_last = last; /* in case check substituted last arg */
1686 return fold_constants(op);
1689 /* List constructors */
1692 append_elem(type, first, last)
1703 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1704 return newLISTOP(type, 0, first, last);
1706 if (first->op_flags & OPf_KIDS)
1707 ((LISTOP*)first)->op_last->op_sibling = last;
1709 first->op_flags |= OPf_KIDS;
1710 ((LISTOP*)first)->op_first = last;
1712 ((LISTOP*)first)->op_last = last;
1713 ((LISTOP*)first)->op_children++;
1718 append_list(type, first, last)
1729 if (first->op_type != type)
1730 return prepend_elem(type, (OP*)first, (OP*)last);
1732 if (last->op_type != type)
1733 return append_elem(type, (OP*)first, (OP*)last);
1735 first->op_last->op_sibling = last->op_first;
1736 first->op_last = last->op_last;
1737 first->op_children += last->op_children;
1738 if (first->op_children)
1739 last->op_flags |= OPf_KIDS;
1746 prepend_elem(type, first, last)
1757 if (last->op_type == type) {
1758 if (type == OP_LIST) { /* already a PUSHMARK there */
1759 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1760 ((LISTOP*)last)->op_first->op_sibling = first;
1763 if (!(last->op_flags & OPf_KIDS)) {
1764 ((LISTOP*)last)->op_last = first;
1765 last->op_flags |= OPf_KIDS;
1767 first->op_sibling = ((LISTOP*)last)->op_first;
1768 ((LISTOP*)last)->op_first = first;
1770 ((LISTOP*)last)->op_children++;
1774 return newLISTOP(type, 0, first, last);
1782 return newOP(OP_STUB, 0);
1789 if (!op || op->op_type != OP_LIST)
1790 op = newLISTOP(OP_LIST, 0, op, Nullop);
1796 newLISTOP(type, flags, first, last)
1804 Newz(1101, listop, 1, LISTOP);
1806 listop->op_type = type;
1807 listop->op_ppaddr = ppaddr[type];
1808 listop->op_children = (first != 0) + (last != 0);
1809 listop->op_flags = flags;
1813 else if (!first && last)
1816 first->op_sibling = last;
1817 listop->op_first = first;
1818 listop->op_last = last;
1819 if (type == OP_LIST) {
1821 pushop = newOP(OP_PUSHMARK, 0);
1822 pushop->op_sibling = first;
1823 listop->op_first = pushop;
1824 listop->op_flags |= OPf_KIDS;
1826 listop->op_last = pushop;
1828 else if (listop->op_children)
1829 listop->op_flags |= OPf_KIDS;
1840 Newz(1101, op, 1, OP);
1842 op->op_ppaddr = ppaddr[type];
1843 op->op_flags = flags;
1846 op->op_private = 0 + (flags >> 8);
1847 if (opargs[type] & OA_RETSCALAR)
1849 if (opargs[type] & OA_TARGET)
1850 op->op_targ = pad_alloc(type, SVs_PADTMP);
1851 return CHECKOP(type, op);
1855 newUNOP(type, flags, first)
1863 first = newOP(OP_STUB, 0);
1864 if (opargs[type] & OA_MARK)
1865 first = force_list(first);
1867 Newz(1101, unop, 1, UNOP);
1868 unop->op_type = type;
1869 unop->op_ppaddr = ppaddr[type];
1870 unop->op_first = first;
1871 unop->op_flags = flags | OPf_KIDS;
1872 unop->op_private = 1 | (flags >> 8);
1874 unop = (UNOP*) CHECKOP(type, unop);
1878 return fold_constants((OP *) unop);
1882 newBINOP(type, flags, first, last)
1889 Newz(1101, binop, 1, BINOP);
1892 first = newOP(OP_NULL, 0);
1894 binop->op_type = type;
1895 binop->op_ppaddr = ppaddr[type];
1896 binop->op_first = first;
1897 binop->op_flags = flags | OPf_KIDS;
1900 binop->op_private = 1 | (flags >> 8);
1903 binop->op_private = 2 | (flags >> 8);
1904 first->op_sibling = last;
1907 binop = (BINOP*)CHECKOP(type, binop);
1911 binop->op_last = last = binop->op_first->op_sibling;
1913 return fold_constants((OP *)binop);
1917 pmtrans(op, expr, repl)
1922 SV *tstr = ((SVOP*)expr)->op_sv;
1923 SV *rstr = ((SVOP*)repl)->op_sv;
1926 register U8 *t = (U8*)SvPV(tstr, tlen);
1927 register U8 *r = (U8*)SvPV(rstr, rlen);
1932 register short *tbl;
1934 tbl = (short*)cPVOP->op_pv;
1935 complement = op->op_private & OPpTRANS_COMPLEMENT;
1936 delete = op->op_private & OPpTRANS_DELETE;
1937 /* squash = op->op_private & OPpTRANS_SQUASH; */
1940 Zero(tbl, 256, short);
1941 for (i = 0; i < tlen; i++)
1943 for (i = 0, j = 0; i < 256; i++) {
1959 if (!rlen && !delete) {
1962 for (i = 0; i < 256; i++)
1964 for (i = 0, j = 0; i < tlen; i++,j++) {
1967 if (tbl[t[i]] == -1)
1973 if (tbl[t[i]] == -1)
1984 newPMOP(type, flags)
1990 Newz(1101, pmop, 1, PMOP);
1991 pmop->op_type = type;
1992 pmop->op_ppaddr = ppaddr[type];
1993 pmop->op_flags = flags;
1994 pmop->op_private = 0 | (flags >> 8);
1996 if (hints & HINT_LOCALE)
1997 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
1999 /* link into pm list */
2000 if (type != OP_TRANS && curstash) {
2001 pmop->op_pmnext = HvPMROOT(curstash);
2002 HvPMROOT(curstash) = pmop;
2009 pmruntime(op, expr, repl)
2017 if (op->op_type == OP_TRANS)
2018 return pmtrans(op, expr, repl);
2022 if (expr->op_type == OP_CONST) {
2024 SV *pat = ((SVOP*)expr)->op_sv;
2025 char *p = SvPV(pat, plen);
2026 if ((op->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2027 sv_setpvn(pat, "\\s+", 3);
2028 p = SvPV(pat, plen);
2029 pm->op_pmflags |= PMf_SKIPWHITE;
2031 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2032 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2033 pm->op_pmflags |= PMf_WHITE;
2038 if (pm->op_pmflags & PMf_KEEP)
2039 expr = newUNOP(OP_REGCMAYBE,0,expr);
2041 Newz(1101, rcop, 1, LOGOP);
2042 rcop->op_type = OP_REGCOMP;
2043 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2044 rcop->op_first = scalar(expr);
2045 rcop->op_flags |= OPf_KIDS;
2046 rcop->op_private = 1;
2047 rcop->op_other = op;
2049 /* establish postfix order */
2050 if (pm->op_pmflags & PMf_KEEP) {
2052 rcop->op_next = expr;
2053 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2056 rcop->op_next = LINKLIST(expr);
2057 expr->op_next = (OP*)rcop;
2060 prepend_elem(op->op_type, scalar((OP*)rcop), op);
2065 if (pm->op_pmflags & PMf_EVAL)
2067 else if (repl->op_type == OP_CONST)
2071 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2072 if (opargs[curop->op_type] & OA_DANGEROUS) {
2073 if (curop->op_type == OP_GV) {
2074 GV *gv = ((GVOP*)curop)->op_gv;
2075 if (strchr("&`'123456789+", *GvENAME(gv)))
2078 else if (curop->op_type == OP_RV2CV)
2080 else if (curop->op_type == OP_RV2SV ||
2081 curop->op_type == OP_RV2AV ||
2082 curop->op_type == OP_RV2HV ||
2083 curop->op_type == OP_RV2GV) {
2084 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2087 else if (curop->op_type == OP_PADSV ||
2088 curop->op_type == OP_PADAV ||
2089 curop->op_type == OP_PADHV ||
2090 curop->op_type == OP_PADANY) {
2099 if (curop == repl) {
2100 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2101 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2102 prepend_elem(op->op_type, scalar(repl), op);
2105 Newz(1101, rcop, 1, LOGOP);
2106 rcop->op_type = OP_SUBSTCONT;
2107 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2108 rcop->op_first = scalar(repl);
2109 rcop->op_flags |= OPf_KIDS;
2110 rcop->op_private = 1;
2111 rcop->op_other = op;
2113 /* establish postfix order */
2114 rcop->op_next = LINKLIST(repl);
2115 repl->op_next = (OP*)rcop;
2117 pm->op_pmreplroot = scalar((OP*)rcop);
2118 pm->op_pmreplstart = LINKLIST(rcop);
2127 newSVOP(type, flags, sv)
2133 Newz(1101, svop, 1, SVOP);
2134 svop->op_type = type;
2135 svop->op_ppaddr = ppaddr[type];
2137 svop->op_next = (OP*)svop;
2138 svop->op_flags = flags;
2139 if (opargs[type] & OA_RETSCALAR)
2141 if (opargs[type] & OA_TARGET)
2142 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2143 return CHECKOP(type, svop);
2147 newGVOP(type, flags, gv)
2153 Newz(1101, gvop, 1, GVOP);
2154 gvop->op_type = type;
2155 gvop->op_ppaddr = ppaddr[type];
2156 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2157 gvop->op_next = (OP*)gvop;
2158 gvop->op_flags = flags;
2159 if (opargs[type] & OA_RETSCALAR)
2161 if (opargs[type] & OA_TARGET)
2162 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2163 return CHECKOP(type, gvop);
2167 newPVOP(type, flags, pv)
2173 Newz(1101, pvop, 1, PVOP);
2174 pvop->op_type = type;
2175 pvop->op_ppaddr = ppaddr[type];
2177 pvop->op_next = (OP*)pvop;
2178 pvop->op_flags = flags;
2179 if (opargs[type] & OA_RETSCALAR)
2181 if (opargs[type] & OA_TARGET)
2182 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2183 return CHECKOP(type, pvop);
2192 save_hptr(&curstash);
2193 save_item(curstname);
2198 name = SvPV(sv, len);
2199 curstash = gv_stashpvn(name,len,TRUE);
2200 sv_setpvn(curstname, name, len);
2204 sv_setpv(curstname,"<none>");
2212 utilize(aver, floor, version, id, arg)
2225 if (id->op_type != OP_CONST)
2226 croak("Module name must be constant");
2230 if(version != Nullop) {
2231 SV *vesv = ((SVOP*)version)->op_sv;
2233 if (arg == Nullop && !SvNIOK(vesv)) {
2240 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2241 croak("Version number must be constant number");
2243 /* Make copy of id so we don't free it twice */
2244 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2246 /* Fake up a method call to VERSION */
2247 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2248 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2249 append_elem(OP_LIST,
2250 prepend_elem(OP_LIST, pack, list(version)),
2251 newUNOP(OP_METHOD, 0, meth)));
2255 /* Fake up an import/unimport */
2256 if (arg && arg->op_type == OP_STUB)
2257 imop = arg; /* no import on explicit () */
2258 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2259 imop = Nullop; /* use 5.0; */
2262 /* Make copy of id so we don't free it twice */
2263 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2264 meth = newSVOP(OP_CONST, 0,
2266 ? newSVpv("import", 6)
2267 : newSVpv("unimport", 8)
2269 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2270 append_elem(OP_LIST,
2271 prepend_elem(OP_LIST, pack, list(arg)),
2272 newUNOP(OP_METHOD, 0, meth)));
2275 /* Fake up a require */
2276 rqop = newUNOP(OP_REQUIRE, 0, id);
2278 /* Fake up the BEGIN {}, which does its thing immediately. */
2280 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2282 append_elem(OP_LINESEQ,
2283 append_elem(OP_LINESEQ,
2284 newSTATEOP(0, Nullch, rqop),
2285 newSTATEOP(0, Nullch, veop)),
2286 newSTATEOP(0, Nullch, imop) ));
2293 newSLICEOP(flags, subscript, listval)
2298 return newBINOP(OP_LSLICE, flags,
2299 list(force_list(subscript)),
2300 list(force_list(listval)) );
2310 if (op->op_type == OP_NULL && op->op_flags & OPf_KIDS)
2311 op = cUNOP->op_first;
2313 if (op->op_type == OP_COND_EXPR) {
2314 I32 t = list_assignment(cCONDOP->op_first->op_sibling);
2315 I32 f = list_assignment(cCONDOP->op_first->op_sibling->op_sibling);
2320 yyerror("Assignment to both a list and a scalar");
2324 if (op->op_type == OP_LIST || op->op_flags & OPf_PARENS ||
2325 op->op_type == OP_RV2AV || op->op_type == OP_RV2HV ||
2326 op->op_type == OP_ASLICE || op->op_type == OP_HSLICE)
2329 if (op->op_type == OP_PADAV || op->op_type == OP_PADHV)
2332 if (op->op_type == OP_RV2SV)
2339 newASSIGNOP(flags, left, optype, right)
2348 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2349 return newLOGOP(optype, 0,
2350 mod(scalar(left), optype),
2351 newUNOP(OP_SASSIGN, 0, scalar(right)));
2354 return newBINOP(optype, OPf_STACKED,
2355 mod(scalar(left), optype), scalar(right));
2359 if (list_assignment(left)) {
2361 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2362 left = mod(left, OP_AASSIGN);
2370 op = newBINOP(OP_AASSIGN, flags,
2371 list(force_list(right)),
2372 list(force_list(left)) );
2373 op->op_private = 0 | (flags >> 8);
2374 if (!(left->op_private & OPpLVAL_INTRO)) {
2375 static int generation = 100;
2379 for (curop = LINKLIST(op); curop != op; curop = LINKLIST(curop)) {
2380 if (opargs[curop->op_type] & OA_DANGEROUS) {
2381 if (curop->op_type == OP_GV) {
2382 GV *gv = ((GVOP*)curop)->op_gv;
2383 if (gv == defgv || SvCUR(gv) == generation)
2385 SvCUR(gv) = generation;
2387 else if (curop->op_type == OP_PADSV ||
2388 curop->op_type == OP_PADAV ||
2389 curop->op_type == OP_PADHV ||
2390 curop->op_type == OP_PADANY) {
2391 SV **svp = AvARRAY(comppad_name);
2392 SV *sv = svp[curop->op_targ];
2393 if (SvCUR(sv) == generation)
2395 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2397 else if (curop->op_type == OP_RV2CV)
2399 else if (curop->op_type == OP_RV2SV ||
2400 curop->op_type == OP_RV2AV ||
2401 curop->op_type == OP_RV2HV ||
2402 curop->op_type == OP_RV2GV) {
2403 if (lastop->op_type != OP_GV) /* funny deref? */
2412 op->op_private = OPpASSIGN_COMMON;
2414 if (right && right->op_type == OP_SPLIT) {
2416 if ((tmpop = ((LISTOP*)right)->op_first) &&
2417 tmpop->op_type == OP_PUSHRE)
2419 PMOP *pm = (PMOP*)tmpop;
2420 if (left->op_type == OP_RV2AV &&
2421 !(left->op_private & OPpLVAL_INTRO) &&
2422 !(op->op_private & OPpASSIGN_COMMON) )
2424 tmpop = ((UNOP*)left)->op_first;
2425 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2426 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2427 pm->op_pmflags |= PMf_ONCE;
2428 tmpop = ((UNOP*)op)->op_first; /* to list (nulled) */
2429 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2430 tmpop->op_sibling = Nullop; /* don't free split */
2431 right->op_next = tmpop->op_next; /* fix starting loc */
2432 op_free(op); /* blow off assign */
2433 right->op_flags &= ~OPf_WANT;
2434 /* "I don't know and I don't care." */
2439 if (modcount < 10000 &&
2440 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2442 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2444 sv_setiv(sv, modcount+1);
2452 right = newOP(OP_UNDEF, 0);
2453 if (right->op_type == OP_READLINE) {
2454 right->op_flags |= OPf_STACKED;
2455 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2458 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2459 op = newBINOP(OP_SASSIGN, flags,
2460 scalar(right), mod(scalar(left), OP_SASSIGN) );
2472 newSTATEOP(flags, label, op)
2477 U32 seq = intro_my();
2480 Newz(1101, cop, 1, COP);
2481 if (perldb && curcop->cop_line && curstash != debstash) {
2482 cop->op_type = OP_DBSTATE;
2483 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2486 cop->op_type = OP_NEXTSTATE;
2487 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2489 cop->op_flags = flags;
2490 cop->op_private = 0 | (flags >> 8);
2492 cop->op_private |= NATIVE_HINTS;
2494 cop->op_next = (OP*)cop;
2497 cop->cop_label = label;
2498 hints |= HINT_BLOCK_SCOPE;
2501 cop->cop_arybase = curcop->cop_arybase;
2503 if (copline == NOLINE)
2504 cop->cop_line = curcop->cop_line;
2506 cop->cop_line = copline;
2509 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2510 cop->cop_stash = curstash;
2512 if (perldb && curstash != debstash) {
2513 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2514 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2515 (void)SvIOK_on(*svp);
2517 SvSTASH(*svp) = (HV*)cop;
2521 return prepend_elem(OP_LINESEQ, (OP*)cop, op);
2524 /* "Introduce" my variables to visible status. */
2532 if (! min_intro_pending)
2535 svp = AvARRAY(comppad_name);
2536 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2537 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2538 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2539 SvNVX(sv) = (double)cop_seqmax;
2542 min_intro_pending = 0;
2543 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2544 return cop_seqmax++;
2548 newLOGOP(type, flags, first, other)
2557 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2558 return newBINOP(type, flags, scalar(first), scalar(other));
2560 scalarboolean(first);
2561 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2562 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2563 if (type == OP_AND || type == OP_OR) {
2569 first = cUNOP->op_first;
2571 first->op_next = op->op_next;
2572 cUNOP->op_first = Nullop;
2576 if (first->op_type == OP_CONST) {
2577 if (dowarn && (first->op_private & OPpCONST_BARE))
2578 warn("Probable precedence problem on %s", op_desc[type]);
2579 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2588 else if (first->op_type == OP_WANTARRAY) {
2594 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2595 OP *k1 = ((UNOP*)first)->op_first;
2596 OP *k2 = k1->op_sibling;
2598 switch (first->op_type)
2601 if (k2 && k2->op_type == OP_READLINE
2602 && (k2->op_flags & OPf_STACKED)
2603 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2604 warnop = k2->op_type;
2608 if (k1->op_type == OP_READDIR
2609 || k1->op_type == OP_GLOB
2610 || k1->op_type == OP_EACH)
2611 warnop = k1->op_type;
2615 line_t oldline = curcop->cop_line;
2616 curcop->cop_line = copline;
2617 warn("Value of %s%s can be \"0\"; test with defined()",
2619 ((warnop == OP_READLINE || warnop == OP_GLOB)
2620 ? " construct" : "() operator"));
2621 curcop->cop_line = oldline;
2628 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2629 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2631 Newz(1101, logop, 1, LOGOP);
2633 logop->op_type = type;
2634 logop->op_ppaddr = ppaddr[type];
2635 logop->op_first = first;
2636 logop->op_flags = flags | OPf_KIDS;
2637 logop->op_other = LINKLIST(other);
2638 logop->op_private = 1 | (flags >> 8);
2640 /* establish postfix order */
2641 logop->op_next = LINKLIST(first);
2642 first->op_next = (OP*)logop;
2643 first->op_sibling = other;
2645 op = newUNOP(OP_NULL, 0, (OP*)logop);
2646 other->op_next = op;
2652 newCONDOP(flags, first, trueop, falseop)
2662 return newLOGOP(OP_AND, 0, first, trueop);
2664 return newLOGOP(OP_OR, 0, first, falseop);
2666 scalarboolean(first);
2667 if (first->op_type == OP_CONST) {
2668 if (SvTRUE(((SVOP*)first)->op_sv)) {
2679 else if (first->op_type == OP_WANTARRAY) {
2683 Newz(1101, condop, 1, CONDOP);
2685 condop->op_type = OP_COND_EXPR;
2686 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2687 condop->op_first = first;
2688 condop->op_flags = flags | OPf_KIDS;
2689 condop->op_true = LINKLIST(trueop);
2690 condop->op_false = LINKLIST(falseop);
2691 condop->op_private = 1 | (flags >> 8);
2693 /* establish postfix order */
2694 condop->op_next = LINKLIST(first);
2695 first->op_next = (OP*)condop;
2697 first->op_sibling = trueop;
2698 trueop->op_sibling = falseop;
2699 op = newUNOP(OP_NULL, 0, (OP*)condop);
2701 trueop->op_next = op;
2702 falseop->op_next = op;
2708 newRANGE(flags, left, right)
2718 Newz(1101, condop, 1, CONDOP);
2720 condop->op_type = OP_RANGE;
2721 condop->op_ppaddr = ppaddr[OP_RANGE];
2722 condop->op_first = left;
2723 condop->op_flags = OPf_KIDS;
2724 condop->op_true = LINKLIST(left);
2725 condop->op_false = LINKLIST(right);
2726 condop->op_private = 1 | (flags >> 8);
2728 left->op_sibling = right;
2730 condop->op_next = (OP*)condop;
2731 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2732 flop = newUNOP(OP_FLOP, 0, flip);
2733 op = newUNOP(OP_NULL, 0, flop);
2736 left->op_next = flip;
2737 right->op_next = flop;
2739 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2740 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2741 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2742 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2744 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2745 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2748 if (!flip->op_private || !flop->op_private)
2749 linklist(op); /* blow off optimizer unless constant */
2755 newLOOPOP(flags, debuggable, expr, block)
2763 int once = block && block->op_flags & OPf_SPECIAL &&
2764 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2767 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2768 return block; /* do {} while 0 does once */
2769 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB) {
2770 expr = newUNOP(OP_DEFINED, 0,
2771 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2775 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2776 op = newLOGOP(OP_AND, 0, expr, listop);
2778 ((LISTOP*)listop)->op_last->op_next = LINKLIST(op);
2780 if (once && op != listop)
2781 op->op_next = ((LOGOP*)cUNOP->op_first)->op_other;
2784 op = newUNOP(OP_NULL, 0, op); /* or do {} while 1 loses outer block */
2786 op->op_flags |= flags;
2788 op->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2793 newWHILEOP(flags, debuggable, loop, expr, block, cont)
2807 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB)) {
2808 expr = newUNOP(OP_DEFINED, 0,
2809 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2813 block = newOP(OP_NULL, 0);
2816 next = LINKLIST(cont);
2818 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2820 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2821 redo = LINKLIST(listop);
2824 op = newLOGOP(OP_AND, 0, expr, scalar(listop));
2825 if (op == expr && op->op_type == OP_CONST && !SvTRUE(cSVOP->op_sv)) {
2826 op_free(expr); /* oops, it's a while (0) */
2828 return Nullop; /* (listop already freed by newLOGOP) */
2830 ((LISTOP*)listop)->op_last->op_next = condop =
2831 (op == listop ? redo : LINKLIST(op));
2839 Newz(1101,loop,1,LOOP);
2840 loop->op_type = OP_ENTERLOOP;
2841 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2842 loop->op_private = 0;
2843 loop->op_next = (OP*)loop;
2846 op = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, op);
2848 loop->op_redoop = redo;
2849 loop->op_lastop = op;
2852 loop->op_nextop = next;
2854 loop->op_nextop = op;
2856 op->op_flags |= flags;
2857 op->op_private |= (flags >> 8);
2862 #ifndef CAN_PROTOTYPE
2863 newFOROP(flags,label,forline,sv,expr,block,cont)
2872 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2873 #endif /* CAN_PROTOTYPE */
2881 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2882 sv->op_type = OP_RV2GV;
2883 sv->op_ppaddr = ppaddr[OP_RV2GV];
2885 else if (sv->op_type == OP_PADSV) { /* private variable */
2886 padoff = sv->op_targ;
2891 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2894 sv = newGVOP(OP_GV, 0, defgv);
2896 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2897 expr = scalar(ref(expr, OP_ITER));
2898 iterflags |= OPf_STACKED;
2900 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2901 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2903 assert(!loop->op_next);
2904 Renew(loop, 1, LOOP);
2905 loop->op_targ = padoff;
2906 return newSTATEOP(0, label, newWHILEOP(flags, 1, loop,
2907 newOP(OP_ITER, 0), block, cont));
2911 newLOOPEX(type, label)
2916 if (type != OP_GOTO || label->op_type == OP_CONST) {
2917 op = newPVOP(type, 0, savepv(
2918 label->op_type == OP_CONST
2919 ? SvPVx(((SVOP*)label)->op_sv, na)
2924 if (label->op_type == OP_ENTERSUB)
2925 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2926 op = newUNOP(type, OPf_STACKED, label);
2928 hints |= HINT_BLOCK_SCOPE;
2936 if (!CvXSUB(cv) && CvROOT(cv)) {
2938 croak("Can't undef active subroutine");
2945 op_free(CvROOT(cv));
2946 CvROOT(cv) = Nullop;
2949 SvPOK_off((SV*)cv); /* forget prototype */
2951 SvREFCNT_dec(CvGV(cv));
2953 SvREFCNT_dec(CvOUTSIDE(cv));
2954 CvOUTSIDE(cv) = Nullcv;
2955 if (CvPADLIST(cv)) {
2956 /* may be during global destruction */
2957 if (SvREFCNT(CvPADLIST(cv))) {
2958 I32 i = AvFILL(CvPADLIST(cv));
2960 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
2961 SV* sv = svp ? *svp : Nullsv;
2964 if (sv == (SV*)comppad_name)
2965 comppad_name = Nullav;
2966 else if (sv == (SV*)comppad) {
2968 curpad = Null(SV**);
2972 SvREFCNT_dec((SV*)CvPADLIST(cv));
2974 CvPADLIST(cv) = Nullav;
2978 #ifdef DEBUG_CLOSURES
2983 CV *outside = CvOUTSIDE(cv);
2984 AV* padlist = CvPADLIST(cv);
2991 PerlIO_printf(Perl_debug_log, "\tCV=0x%p (%s), OUTSIDE=0x%p (%s)\n",
2993 (CvANON(cv) ? "ANON"
2994 : (cv == main_cv) ? "MAIN"
2995 : CvUNIQUE(outside) ? "UNIQUE"
2996 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
2999 : CvANON(outside) ? "ANON"
3000 : (outside == main_cv) ? "MAIN"
3001 : CvUNIQUE(outside) ? "UNIQUE"
3002 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3007 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3008 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3009 pname = AvARRAY(pad_name);
3010 ppad = AvARRAY(pad);
3012 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
3013 if (SvPOK(pname[ix]))
3014 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%p (%s\"%s\" %ld-%ld)\n",
3016 SvFAKE(pname[ix]) ? "FAKE " : "",
3018 (long)I_32(SvNVX(pname[ix])),
3019 (long)SvIVX(pname[ix]));
3022 #endif /* DEBUG_CLOSURES */
3025 cv_clone2(proto, outside)
3031 AV* protopadlist = CvPADLIST(proto);
3032 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3033 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3034 SV** pname = AvARRAY(protopad_name);
3035 SV** ppad = AvARRAY(protopad);
3036 I32 fname = AvFILL(protopad_name);
3037 I32 fpad = AvFILL(protopad);
3041 assert(!CvUNIQUE(proto));
3046 SAVESPTR(comppad_name);
3049 cv = compcv = (CV*)NEWSV(1104,0);
3050 sv_upgrade((SV *)cv, SvTYPE(proto));
3055 CvFILEGV(cv) = CvFILEGV(proto);
3056 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3057 CvSTASH(cv) = CvSTASH(proto);
3058 CvROOT(cv) = CvROOT(proto);
3059 CvSTART(cv) = CvSTART(proto);
3061 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3064 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3066 comppad_name = newAV();
3067 for (ix = fname; ix >= 0; ix--)
3068 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3072 comppadlist = newAV();
3073 AvREAL_off(comppadlist);
3074 av_store(comppadlist, 0, (SV*)comppad_name);
3075 av_store(comppadlist, 1, (SV*)comppad);
3076 CvPADLIST(cv) = comppadlist;
3077 av_fill(comppad, AvFILL(protopad));
3078 curpad = AvARRAY(comppad);
3080 av = newAV(); /* will be @_ */
3082 av_store(comppad, 0, (SV*)av);
3083 AvFLAGS(av) = AVf_REIFY;
3085 for (ix = fpad; ix > 0; ix--) {
3086 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3087 if (namesv && namesv != &sv_undef) {
3088 char *name = SvPVX(namesv); /* XXX */
3089 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3090 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3091 CvOUTSIDE(cv), cxstack_ix);
3093 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3095 croak("panic: cv_clone: %s", name);
3097 else { /* our own lexical */
3100 /* anon code -- we'll come back for it */
3101 sv = SvREFCNT_inc(ppad[ix]);
3103 else if (*name == '@')
3105 else if (*name == '%')
3115 SV* sv = NEWSV(0,0);
3121 /* Now that vars are all in place, clone nested closures. */
3123 for (ix = fpad; ix > 0; ix--) {
3124 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3126 && namesv != &sv_undef
3127 && !(SvFLAGS(namesv) & SVf_FAKE)
3128 && *SvPVX(namesv) == '&'
3129 && CvCLONE(ppad[ix]))
3131 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3132 SvREFCNT_dec(ppad[ix]);
3135 curpad[ix] = (SV*)kid;
3139 #ifdef DEBUG_CLOSURES
3140 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3142 PerlIO_printf(Perl_debug_log, " from:\n");
3144 PerlIO_printf(Perl_debug_log, " to:\n");
3156 return cv_clone2(proto, CvOUTSIDE(proto));
3160 cv_ckproto(cv, gv, p)
3165 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3166 SV* msg = sv_newmortal();
3170 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3171 sv_setpv(msg, "Prototype mismatch:");
3173 sv_catpvf(msg, " sub %_", name);
3175 sv_catpvf(msg, " (%s)", SvPVX(cv));
3176 sv_catpv(msg, " vs ");
3178 sv_catpvf(msg, "(%s)", p);
3180 sv_catpv(msg, "none");
3192 if (!cv || !SvPOK(cv) || SvCUR(cv))
3196 for (o = CvSTART(cv); o; o = o->op_next) {
3197 OPCODE type = o->op_type;
3199 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3201 if (type == OP_LEAVESUB || type == OP_RETURN)
3205 if (type == OP_CONST)
3206 sv = ((SVOP*)o)->op_sv;
3207 else if (type == OP_PADSV) {
3208 AV* pad = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3209 sv = pad ? AvARRAY(pad)[o->op_targ] : Nullsv;
3210 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3222 newSUB(floor,op,proto,block)
3228 char *name = op ? SvPVx(cSVOP->op_sv, na) : Nullch;
3229 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3230 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3239 if (!name || GvCVGEN(gv))
3241 else if (cv = GvCV(gv)) {
3242 cv_ckproto(cv, gv, ps);
3243 /* already defined (or promised)? */
3244 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3247 /* just a "sub foo;" when &foo is already defined */
3251 /* ahem, death to those who redefine active sort subs */
3252 if (curstack == sortstack && sortcop == CvSTART(cv))
3253 croak("Can't redefine active sort subroutine %s", name);
3254 const_sv = cv_const_sv(cv);
3255 if (const_sv || dowarn) {
3256 line_t oldline = curcop->cop_line;
3257 curcop->cop_line = copline;
3258 warn(const_sv ? "Constant subroutine %s redefined"
3259 : "Subroutine %s redefined", name);
3260 curcop->cop_line = oldline;
3266 if (cv) { /* must reuse cv if autoloaded */
3268 CvFLAGS(cv) = CvFLAGS(compcv);
3269 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3270 CvOUTSIDE(compcv) = 0;
3271 CvPADLIST(cv) = CvPADLIST(compcv);
3272 CvPADLIST(compcv) = 0;
3273 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3274 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3275 SvREFCNT_dec(compcv);
3285 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3286 CvFILEGV(cv) = curcop->cop_filegv;
3287 CvSTASH(cv) = curstash;
3290 sv_setpv((SV*)cv, ps);
3296 char *s = strrchr(name, ':');
3298 if (strEQ(s, "BEGIN")) {
3300 "BEGIN not safe after errors--compilation aborted";
3304 /* force display of errors found but not reported */
3305 sv_catpv(GvSV(errgv), not_safe);
3306 croak("%s", SvPVx(GvSV(errgv), na));
3317 if (AvFILL(comppad_name) < AvFILL(comppad))
3318 av_store(comppad_name, AvFILL(comppad), Nullsv);
3321 SV **namep = AvARRAY(comppad_name);
3322 for (ix = AvFILL(comppad); ix > 0; ix--) {
3325 if (SvIMMORTAL(curpad[ix]))
3328 * The only things that a clonable function needs in its
3329 * pad are references to outer lexicals and anonymous subs.
3330 * The rest are created anew during cloning.
3332 if (!((namesv = namep[ix]) != Nullsv &&
3333 namesv != &sv_undef &&
3335 *SvPVX(namesv) == '&')))
3337 SvREFCNT_dec(curpad[ix]);
3338 curpad[ix] = Nullsv;
3343 AV *av = newAV(); /* Will be @_ */
3345 av_store(comppad, 0, (SV*)av);
3346 AvFLAGS(av) = AVf_REIFY;
3348 for (ix = AvFILL(comppad); ix > 0; ix--) {
3349 if (SvIMMORTAL(curpad[ix]))
3351 if (!SvPADMY(curpad[ix]))
3352 SvPADTMP_on(curpad[ix]);
3356 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3357 CvSTART(cv) = LINKLIST(CvROOT(cv));
3358 CvROOT(cv)->op_next = 0;
3364 if (perldb && curstash != debstash) {
3365 SV *sv = NEWSV(0,0);
3366 SV *tmpstr = sv_newmortal();
3367 static GV *db_postponed;
3371 sv_setpvf(sv, "%_:%ld-%ld",
3372 GvSV(curcop->cop_filegv),
3373 (long)subline, (long)curcop->cop_line);
3374 gv_efullname3(tmpstr, gv, Nullch);
3375 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3376 if (!db_postponed) {
3377 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3379 hv = GvHVn(db_postponed);
3380 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3381 && (cv = GvCV(db_postponed))) {
3386 perl_call_sv((SV*)cv, G_DISCARD);
3390 if ((s = strrchr(name,':')))
3394 if (strEQ(s, "BEGIN")) {
3395 I32 oldscope = scopestack_ix;
3397 SAVESPTR(compiling.cop_filegv);
3398 SAVEI16(compiling.cop_line);
3405 DEBUG_x( dump_sub(gv) );
3406 av_push(beginav, (SV *)cv);
3408 call_list(oldscope, beginav);
3410 curcop = &compiling;
3413 else if (strEQ(s, "END") && !error_count) {
3416 av_unshift(endav, 1);
3417 av_store(endav, 0, (SV *)cv);
3420 else if (strEQ(s, "RESTART") && !error_count) {
3422 restartav = newAV();
3423 av_push(restartav, SvREFCNT_inc(cv));
3435 newXSUB(name, ix, subaddr, filename)
3441 CV* cv = newXS(name, (void(*)())subaddr, filename);
3443 CvXSUBANY(cv).any_i32 = ix;
3449 newXS(name, subaddr, filename)
3451 void (*subaddr) _((CV*));
3454 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3457 if (cv = (name ? GvCV(gv) : Nullcv)) {
3459 /* just a cached method */
3463 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3464 /* already defined (or promised) */
3466 line_t oldline = curcop->cop_line;
3467 curcop->cop_line = copline;
3468 warn("Subroutine %s redefined",name);
3469 curcop->cop_line = oldline;
3476 if (cv) /* must reuse cv if autoloaded */
3479 cv = (CV*)NEWSV(1105,0);
3480 sv_upgrade((SV *)cv, SVt_PVCV);
3487 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3488 CvFILEGV(cv) = gv_fetchfile(filename);
3489 CvXSUB(cv) = subaddr;
3492 char *s = strrchr(name,':');
3497 if (strEQ(s, "BEGIN")) {
3500 av_push(beginav, (SV *)cv);
3503 else if (strEQ(s, "END")) {
3506 av_unshift(endav, 1);
3507 av_store(endav, 0, (SV *)cv);
3510 else if (strEQ(s, "RESTART")) {
3512 restartav = newAV();
3513 av_push(restartav, (SV *)cv);
3523 newFORM(floor,op,block)
3534 name = SvPVx(cSVOP->op_sv, na);
3537 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3539 if (cv = GvFORM(gv)) {
3541 line_t oldline = curcop->cop_line;
3543 curcop->cop_line = copline;
3544 warn("Format %s redefined",name);
3545 curcop->cop_line = oldline;
3551 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3552 CvFILEGV(cv) = curcop->cop_filegv;
3554 for (ix = AvFILL(comppad); ix > 0; ix--) {
3555 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3556 SvPADTMP_on(curpad[ix]);
3559 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3560 CvSTART(cv) = LINKLIST(CvROOT(cv));
3561 CvROOT(cv)->op_next = 0;
3572 return newUNOP(OP_REFGEN, 0,
3573 mod(list(convert(OP_ANONLIST, 0, op)), OP_REFGEN));
3580 return newUNOP(OP_REFGEN, 0,
3581 mod(list(convert(OP_ANONHASH, 0, op)), OP_REFGEN));
3585 newANONSUB(floor, proto, block)
3590 return newUNOP(OP_REFGEN, 0,
3591 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3598 switch (o->op_type) {
3600 o->op_type = OP_PADAV;
3601 o->op_ppaddr = ppaddr[OP_PADAV];
3602 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3605 o->op_type = OP_RV2AV;
3606 o->op_ppaddr = ppaddr[OP_RV2AV];
3611 warn("oops: oopsAV");
3621 switch (o->op_type) {
3624 o->op_type = OP_PADHV;
3625 o->op_ppaddr = ppaddr[OP_PADHV];
3626 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3630 o->op_type = OP_RV2HV;
3631 o->op_ppaddr = ppaddr[OP_RV2HV];
3636 warn("oops: oopsHV");
3646 if (o->op_type == OP_PADANY) {
3647 o->op_type = OP_PADAV;
3648 o->op_ppaddr = ppaddr[OP_PADAV];
3651 return newUNOP(OP_RV2AV, 0, scalar(o));
3659 if (type == OP_MAPSTART)
3660 return newUNOP(OP_NULL, 0, o);
3661 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3668 if (o->op_type == OP_PADANY) {
3669 o->op_type = OP_PADHV;
3670 o->op_ppaddr = ppaddr[OP_PADHV];
3673 return newUNOP(OP_RV2HV, 0, scalar(o));
3680 croak("NOT IMPL LINE %d",__LINE__);
3690 return newUNOP(OP_RV2CV, flags, scalar(o));
3697 if (o->op_type == OP_PADANY) {
3698 o->op_type = OP_PADSV;
3699 o->op_ppaddr = ppaddr[OP_PADSV];
3702 return newUNOP(OP_RV2SV, 0, scalar(o));
3705 /* Check routines. */
3714 name = NEWSV(1106,0);
3715 sv_upgrade(name, SVt_PVNV);
3716 sv_setpvn(name, "&", 1);
3719 ix = pad_alloc(op->op_type, SVs_PADMY);
3720 av_store(comppad_name, ix, name);
3721 av_store(comppad, ix, cSVOP->op_sv);
3722 SvPADMY_on(cSVOP->op_sv);
3723 cSVOP->op_sv = Nullsv;
3724 cSVOP->op_targ = ix;
3732 op->op_private = hints;
3740 if (cUNOP->op_first->op_type == OP_CONCAT)
3741 op->op_flags |= OPf_STACKED;
3749 if (op->op_flags & OPf_KIDS) {
3752 OPCODE type = op->op_type;
3753 op = modkids(ck_fun(op), type);
3754 kid = cUNOP->op_first;
3755 newop = kUNOP->op_first->op_sibling;
3757 (newop->op_sibling ||
3758 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3759 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3760 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3764 op_free(kUNOP->op_first);
3765 kUNOP->op_first = newop;
3767 op->op_ppaddr = ppaddr[++op->op_type];
3777 if (op->op_flags & OPf_KIDS) {
3778 OP *kid = cUNOP->op_first;
3779 if (kid->op_type == OP_HSLICE)
3780 op->op_private |= OPpSLICE;
3781 else if (kid->op_type != OP_HELEM)
3782 croak("%s argument is not a HASH element or slice",
3783 op_desc[op->op_type]);
3793 I32 type = op->op_type;
3795 if (op->op_flags & OPf_KIDS) {
3796 if (cLISTOP->op_first->op_type == OP_STUB) {
3798 op = newUNOP(type, OPf_SPECIAL,
3799 newGVOP(OP_GV, 0, gv_fetchpv("main'ARGV", TRUE, SVt_PVAV)));
3810 hints |= HINT_BLOCK_SCOPE;
3811 if (op->op_flags & OPf_KIDS) {
3812 SVOP *kid = (SVOP*)cUNOP->op_first;
3815 op->op_flags &= ~OPf_KIDS;
3818 else if (kid->op_type == OP_LINESEQ) {
3821 kid->op_next = op->op_next;
3822 cUNOP->op_first = 0;
3825 Newz(1101, enter, 1, LOGOP);
3826 enter->op_type = OP_ENTERTRY;
3827 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3828 enter->op_private = 0;
3830 /* establish postfix order */
3831 enter->op_next = (OP*)enter;
3833 op = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3834 op->op_type = OP_LEAVETRY;
3835 op->op_ppaddr = ppaddr[OP_LEAVETRY];
3836 enter->op_other = op;
3842 op = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3844 op->op_targ = (PADOFFSET)hints;
3853 if (op->op_flags & OPf_STACKED) {
3855 kid = cUNOP->op_first->op_sibling;
3856 if (kid->op_type == OP_RV2GV)
3869 if (op->op_flags & OPf_KIDS) {
3870 OP *kid = cUNOP->op_first;
3871 if (kid->op_type != OP_HELEM)
3872 croak("%s argument is not a HASH element", op_desc[op->op_type]);
3882 o = fold_constants(o);
3883 if (o->op_type == OP_CONST)
3892 SVOP *kid = (SVOP*)cUNOP->op_first;
3894 op->op_private |= (hints & HINT_STRICT_REFS);
3895 if (kid->op_type == OP_CONST) {
3900 name = SvPV(kid->op_sv, na);
3901 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3902 char *badthing = Nullch;
3903 switch (op->op_type) {
3905 badthing = "a SCALAR";
3908 badthing = "an ARRAY";
3911 badthing = "a HASH";
3916 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3919 kid->op_type = OP_GV;
3920 iscv = (op->op_type == OP_RV2CV) * 2;
3921 for (gv = 0; !gv; iscv++) {
3923 * This is a little tricky. We only want to add the symbol if we
3924 * didn't add it in the lexer. Otherwise we get duplicate strict
3925 * warnings. But if we didn't add it in the lexer, we must at
3926 * least pretend like we wanted to add it even if it existed before,
3927 * or we get possible typo warnings. OPpCONST_ENTERED says
3928 * whether the lexer already added THIS instance of this symbol.
3930 gv = gv_fetchpv(name,
3931 iscv | !(kid->op_private & OPpCONST_ENTERED),
3934 : op->op_type == OP_RV2SV
3936 : op->op_type == OP_RV2AV
3938 : op->op_type == OP_RV2HV
3942 SvREFCNT_dec(kid->op_sv);
3943 kid->op_sv = SvREFCNT_inc(gv);
3952 I32 type = op->op_type;
3954 if (op->op_flags & OPf_REF)
3957 if (op->op_flags & OPf_KIDS) {
3958 SVOP *kid = (SVOP*)cUNOP->op_first;
3960 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3961 OP *newop = newGVOP(type, OPf_REF,
3962 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
3969 if (type == OP_FTTTY)
3970 return newGVOP(type, OPf_REF, gv_fetchpv("main'STDIN", TRUE,
3973 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3986 int type = op->op_type;
3987 register I32 oa = opargs[type] >> OASHIFT;
3989 if (op->op_flags & OPf_STACKED) {
3990 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
3993 return no_fh_allowed(op);
3996 if (op->op_flags & OPf_KIDS) {
3997 tokid = &cLISTOP->op_first;
3998 kid = cLISTOP->op_first;
3999 if (kid->op_type == OP_PUSHMARK ||
4000 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4002 tokid = &kid->op_sibling;
4003 kid = kid->op_sibling;
4005 if (!kid && opargs[type] & OA_DEFGV)
4006 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
4010 sibl = kid->op_sibling;
4024 if (kid->op_type == OP_CONST &&
4025 (kid->op_private & OPpCONST_BARE)) {
4026 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4027 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4028 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4030 warn("Array @%s missing the @ in argument %ld of %s()",
4031 name, (long)numargs, op_desc[type]);
4034 kid->op_sibling = sibl;
4037 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4038 bad_type(numargs, "array", op_desc[op->op_type], kid);
4042 if (kid->op_type == OP_CONST &&
4043 (kid->op_private & OPpCONST_BARE)) {
4044 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4045 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4046 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4048 warn("Hash %%%s missing the %% in argument %ld of %s()",
4049 name, (long)numargs, op_desc[type]);
4052 kid->op_sibling = sibl;
4055 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4056 bad_type(numargs, "hash", op_desc[op->op_type], kid);
4061 OP *newop = newUNOP(OP_NULL, 0, kid);
4062 kid->op_sibling = 0;
4064 newop->op_next = newop;
4066 kid->op_sibling = sibl;
4071 if (kid->op_type != OP_GV) {
4072 if (kid->op_type == OP_CONST &&
4073 (kid->op_private & OPpCONST_BARE)) {
4074 OP *newop = newGVOP(OP_GV, 0,
4075 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4081 kid->op_sibling = 0;
4082 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4084 kid->op_sibling = sibl;
4090 mod(scalar(kid), type);
4094 tokid = &kid->op_sibling;
4095 kid = kid->op_sibling;
4097 op->op_private |= numargs;
4099 return too_many_arguments(op,op_desc[op->op_type]);
4102 else if (opargs[type] & OA_DEFGV) {
4104 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4108 while (oa & OA_OPTIONAL)
4110 if (oa && oa != OA_LIST)
4111 return too_few_arguments(op,op_desc[op->op_type]);
4120 GV *gv = gv_fetchpv("glob", FALSE, SVt_PVCV);
4122 if (gv && GvIMPORTED_CV(gv)) {
4123 static int glob_index;
4125 append_elem(OP_GLOB, op,
4126 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4127 op->op_type = OP_LIST;
4128 op->op_ppaddr = ppaddr[OP_LIST];
4129 ((LISTOP*)op)->op_first->op_type = OP_PUSHMARK;
4130 ((LISTOP*)op)->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4131 op = newUNOP(OP_ENTERSUB, OPf_STACKED,
4132 append_elem(OP_LIST, op,
4133 scalar(newUNOP(OP_RV2CV, 0,
4134 newGVOP(OP_GV, 0, gv)))));
4137 if ((op->op_flags & OPf_KIDS) && !cLISTOP->op_first->op_sibling)
4138 append_elem(OP_GLOB, op, newSVREF(newGVOP(OP_GV, 0, defgv)));
4139 gv = newGVgen("main");
4141 append_elem(OP_GLOB, op, newGVOP(OP_GV, 0, gv));
4152 OPCODE type = op->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4154 op->op_ppaddr = ppaddr[OP_GREPSTART];
4155 Newz(1101, gwop, 1, LOGOP);
4157 if (op->op_flags & OPf_STACKED) {
4160 kid = cLISTOP->op_first->op_sibling;
4161 for (k = cLISTOP->op_first->op_sibling->op_next; k; k = k->op_next) {
4164 kid->op_next = (OP*)gwop;
4165 op->op_flags &= ~OPf_STACKED;
4167 kid = cLISTOP->op_first->op_sibling;
4168 if (type == OP_MAPWHILE)
4175 kid = cLISTOP->op_first->op_sibling;
4176 if (kid->op_type != OP_NULL)
4177 croak("panic: ck_grep");
4178 kid = kUNOP->op_first;
4180 gwop->op_type = type;
4181 gwop->op_ppaddr = ppaddr[type];
4182 gwop->op_first = listkids(op);
4183 gwop->op_flags |= OPf_KIDS;
4184 gwop->op_private = 1;
4185 gwop->op_other = LINKLIST(kid);
4186 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4187 kid->op_next = (OP*)gwop;
4189 kid = cLISTOP->op_first->op_sibling;
4190 if (!kid || !kid->op_sibling)
4191 return too_few_arguments(op,op_desc[op->op_type]);
4192 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4193 mod(kid, OP_GREPSTART);
4202 if (op->op_flags & OPf_KIDS) {
4203 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4204 if (kid && kid->op_type == OP_CONST)
4205 fbm_compile(((SVOP*)kid)->op_sv);
4214 /* XXX length optimization goes here */
4222 OPCODE type = op->op_type;
4223 return modkids(ck_fun(op), type);
4230 OPCODE type = op->op_type;
4231 return refkids(ck_fun(op), type);
4240 kid = cLISTOP->op_first;
4242 op = force_list(op);
4243 kid = cLISTOP->op_first;
4245 if (kid->op_type == OP_PUSHMARK)
4246 kid = kid->op_sibling;
4247 if (kid && op->op_flags & OPf_STACKED)
4248 kid = kid->op_sibling;
4249 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4250 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4251 op->op_flags |= OPf_STACKED; /* make it a filehandle */
4252 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4253 cLISTOP->op_first->op_sibling = kid;
4254 cLISTOP->op_last = kid;
4255 kid = kid->op_sibling;
4260 append_elem(op->op_type, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4266 if (hints & HINT_LOCALE)
4267 op->op_private |= OPpLOCALE;
4281 if (hints & HINT_LOCALE)
4282 op->op_private |= OPpLOCALE;
4294 if (hints & HINT_LOCALE)
4295 op->op_private |= OPpLOCALE;
4305 op->op_private |= OPpRUNTIME;
4320 if (cBINOP->op_first->op_flags & OPf_PARENS) {
4321 op->op_private |= OPpREPEAT_DOLIST;
4322 cBINOP->op_first = force_list(cBINOP->op_first);
4333 if (op->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4334 SVOP *kid = (SVOP*)cUNOP->op_first;
4336 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4338 for (s = SvPVX(kid->op_sv); *s; s++) {
4339 if (*s == ':' && s[1] == ':') {
4341 Move(s+2, s+1, strlen(s+2)+1, char);
4342 --SvCUR(kid->op_sv);
4345 sv_catpvn(kid->op_sv, ".pm", 3);
4355 croak("NOT IMPL LINE %d",__LINE__);
4365 if (op->op_flags & OPf_KIDS) {
4366 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4367 if (kid && kid->op_sibling) {
4368 op->op_type = OP_SSELECT;
4369 op->op_ppaddr = ppaddr[OP_SSELECT];
4371 return fold_constants(op);
4375 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4376 if (kid && kid->op_type == OP_RV2GV)
4377 kid->op_private &= ~HINT_STRICT_REFS;
4385 I32 type = op->op_type;
4387 if (!(op->op_flags & OPf_KIDS)) {
4389 return newUNOP(type, 0,
4390 scalar(newUNOP(OP_RV2AV, 0,
4391 scalar(newGVOP(OP_GV, 0, subline
4393 : gv_fetchpv("ARGV", TRUE, SVt_PVAV) )))));
4395 return scalar(modkids(ck_fun(op), type));
4404 if (hints & HINT_LOCALE)
4405 op->op_private |= OPpLOCALE;
4408 if (op->op_flags & OPf_STACKED) {
4409 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4411 kid = kUNOP->op_first; /* get past rv2gv */
4413 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4415 if (kid->op_type == OP_SCOPE) {
4419 else if (kid->op_type == OP_LEAVE) {
4420 if (op->op_type == OP_SORT) {
4421 null(kid); /* wipe out leave */
4424 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4425 if (k->op_next == kid)
4430 kid->op_next = 0; /* just disconnect the leave */
4431 k = kLISTOP->op_first;
4435 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
4436 null(kid); /* wipe out rv2gv */
4437 if (op->op_type == OP_SORT)
4441 op->op_flags |= OPf_SPECIAL;
4455 if (op->op_flags & OPf_STACKED)
4456 return no_fh_allowed(op);
4458 kid = cLISTOP->op_first;
4459 if (kid->op_type != OP_NULL)
4460 croak("panic: ck_split");
4461 kid = kid->op_sibling;
4462 op_free(cLISTOP->op_first);
4463 cLISTOP->op_first = kid;
4465 cLISTOP->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4466 cLISTOP->op_last = kid; /* There was only one element previously */
4469 if (kid->op_type != OP_MATCH) {
4470 OP *sibl = kid->op_sibling;
4471 kid->op_sibling = 0;
4472 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4473 if (cLISTOP->op_first == cLISTOP->op_last)
4474 cLISTOP->op_last = kid;
4475 cLISTOP->op_first = kid;
4476 kid->op_sibling = sibl;
4479 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4480 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4484 kid->op_type = OP_PUSHRE;
4485 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4488 if (!kid->op_sibling)
4489 append_elem(OP_SPLIT, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4491 kid = kid->op_sibling;
4494 if (!kid->op_sibling)
4495 append_elem(OP_SPLIT, op, newSVOP(OP_CONST, 0, newSViv(0)));
4497 kid = kid->op_sibling;
4500 if (kid->op_sibling)
4501 return too_many_arguments(op,op_desc[op->op_type]);
4510 OP *prev = ((cUNOP->op_first->op_sibling)
4511 ? cUNOP : ((UNOP*)cUNOP->op_first))->op_first;
4512 OP *o = prev->op_sibling;
4520 for (cvop = o; cvop->op_sibling; cvop = cvop->op_sibling) ;
4521 if (cvop->op_type == OP_RV2CV) {
4523 op->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4524 null(cvop); /* disable rv2cv */
4525 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4526 if (tmpop->op_type == OP_GV) {
4527 cv = GvCVu(tmpop->op_sv);
4528 if (cv && SvPOK(cv) && !(op->op_private & OPpENTERSUB_AMPER)) {
4529 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4530 proto = SvPV((SV*)cv, na);
4534 op->op_private |= (hints & HINT_STRICT_REFS);
4535 if (perldb && curstash != debstash)
4536 op->op_private |= OPpENTERSUB_DB;
4541 return too_many_arguments(op, gv_ename(namegv));
4559 if (o->op_type != OP_REFGEN && o->op_type != OP_UNDEF)
4560 bad_type(arg, "block", gv_ename(namegv), o);
4565 if (o->op_type == OP_RV2GV)
4569 o = newUNOP(OP_RV2GV, 0, kid);
4570 o->op_sibling = kid->op_sibling;
4571 kid->op_sibling = 0;
4572 prev->op_sibling = o;
4580 if (o->op_type != OP_RV2GV)
4581 bad_type(arg, "symbol", gv_ename(namegv), o);
4584 if (o->op_type != OP_RV2CV)
4585 bad_type(arg, "sub", gv_ename(namegv), o);
4588 if (o->op_type != OP_RV2SV && o->op_type != OP_PADSV)
4589 bad_type(arg, "scalar", gv_ename(namegv), o);
4592 if (o->op_type != OP_RV2AV && o->op_type != OP_PADAV)
4593 bad_type(arg, "array", gv_ename(namegv), o);
4596 if (o->op_type != OP_RV2HV && o->op_type != OP_PADHV)
4597 bad_type(arg, "hash", gv_ename(namegv), o);
4601 o = newUNOP(OP_REFGEN, 0, kid);
4602 o->op_sibling = kid->op_sibling;
4603 kid->op_sibling = 0;
4604 prev->op_sibling = o;
4615 croak("Malformed prototype for %s: %s",
4616 gv_ename(namegv), SvPV((SV*)cv, na));
4621 mod(o, OP_ENTERSUB);
4625 if (proto && !optional && *proto == '$')
4626 return too_few_arguments(op, gv_ename(namegv));
4634 SvREADONLY_on(cSVOP->op_sv);
4642 if (op->op_flags & OPf_KIDS) {
4643 SVOP *kid = (SVOP*)cUNOP->op_first;
4645 if (kid->op_type == OP_NULL)
4646 kid = (SVOP*)kid->op_sibling;
4648 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4649 op->op_flags |= OPf_SPECIAL;
4654 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4660 register OP* oldop = 0;
4661 if (!o || o->op_seq)
4666 for (; o; o = o->op_next) {
4672 switch (o->op_type) {
4675 curcop = ((COP*)o); /* for warnings */
4676 o->op_seq = op_seqmax++;
4687 if (o->op_next->op_type == OP_STRINGIFY)
4689 o->op_seq = op_seqmax++;
4692 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4693 o->op_seq = op_seqmax++;
4694 break; /* Scalar stub must produce undef. List stub is noop */
4698 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4699 curcop = ((COP*)op);
4705 if (oldop && o->op_next) {
4706 oldop->op_next = o->op_next;
4709 o->op_seq = op_seqmax++;
4713 if (o->op_next->op_type == OP_RV2SV) {
4714 if (!(o->op_next->op_private & OPpDEREF)) {
4716 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4717 o->op_next = o->op_next->op_next;
4718 o->op_type = OP_GVSV;
4719 o->op_ppaddr = ppaddr[OP_GVSV];
4722 else if (o->op_next->op_type == OP_RV2AV) {
4723 OP* pop = o->op_next->op_next;
4725 if (pop->op_type == OP_CONST &&
4726 (op = pop->op_next) &&
4727 pop->op_next->op_type == OP_AELEM &&
4728 !(pop->op_next->op_private &
4729 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4730 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4734 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4738 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4739 o->op_next = pop->op_next->op_next;
4740 o->op_type = OP_AELEMFAST;
4741 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4742 o->op_private = (U8)i;
4743 GvAVn(((GVOP*)o)->op_gv);
4746 o->op_seq = op_seqmax++;
4753 o->op_seq = op_seqmax++;
4754 peep(cLOGOP->op_other);
4758 o->op_seq = op_seqmax++;
4759 peep(cCONDOP->op_true);
4760 peep(cCONDOP->op_false);
4764 o->op_seq = op_seqmax++;
4765 peep(cLOOP->op_redoop);
4766 peep(cLOOP->op_nextop);
4767 peep(cLOOP->op_lastop);
4772 o->op_seq = op_seqmax++;
4773 peep(cPMOP->op_pmreplstart);
4777 o->op_seq = op_seqmax++;
4778 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4779 if (o->op_next->op_sibling &&
4780 o->op_next->op_sibling->op_type != OP_DIE) {
4781 line_t oldline = curcop->cop_line;
4783 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4784 warn("Statement unlikely to be reached");
4785 warn("(Maybe you meant system() when you said exec()?)\n");
4786 curcop->cop_line = oldline;
4800 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4801 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4803 rop = (UNOP*)((BINOP*)o)->op_first;
4804 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4806 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4807 if (!SvOBJECT(lexname))
4809 fields = hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4810 if (!fields || !GvHV(*fields))
4812 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4813 key = SvPV(*svp, keylen);
4814 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4816 croak("No such field \"%s\" in variable %s of type %s",
4817 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4819 ind = SvIV(*indsvp);
4821 croak("Bad index while coercing array into hash");
4822 rop->op_type = OP_RV2AV;
4823 rop->op_ppaddr = ppaddr[OP_RV2AV];
4824 o->op_type = OP_AELEM;
4825 o->op_ppaddr = ppaddr[OP_AELEM];
4827 *svp = newSViv(ind);
4832 o->op_seq = op_seqmax++;