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
22 * In the following definition, the ", Nullop" is just to make the compiler
23 * think the expression is of the right type: croak actually does a Siglongjmp.
25 #define CHECKOP(type,o) \
26 ((op_mask && op_mask[type]) \
27 ? ( op_free((OP*)o), \
28 croak("%s trapped by operation mask", op_desc[type]), \
30 : (*check[type])((OP*)o))
32 static I32 list_assignment _((OP *o));
33 static void bad_type _((I32 n, char *t, char *name, OP *kid));
34 static OP *modkids _((OP *o, I32 type));
35 static OP *no_fh_allowed _((OP *o));
36 static bool scalar_mod_type _((OP *o, I32 type));
37 static OP *scalarboolean _((OP *o));
38 static OP *too_few_arguments _((OP *o, char* name));
39 static OP *too_many_arguments _((OP *o, char* name));
40 static void null _((OP* o));
41 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
42 CV* startcv, I32 cx_ix));
48 SV* tmpsv = sv_newmortal();
49 gv_efullname3(tmpsv, gv, Nullch);
50 return SvPV(tmpsv,na);
57 yyerror(form("Missing comma after first argument to %s function",
58 op_desc[o->op_type]));
63 too_few_arguments(o, name)
67 yyerror(form("Not enough arguments for %s", name));
72 too_many_arguments(o, name)
76 yyerror(form("Too many arguments for %s", name));
81 bad_type(n, t, name, kid)
87 yyerror(form("Type of arg %d to %s must be %s (not %s)",
88 (int)n, name, t, op_desc[kid->op_type]));
95 int type = o->op_type;
96 if (type != OP_AELEM && type != OP_HELEM) {
97 yyerror(form("Can't use subscript on %s", op_desc[type]));
98 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV)
99 warn("(Did you mean $ or @ instead of %c?)\n",
100 type == OP_ENTERSUB ? '&' : '%');
104 /* "register" allocation */
114 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
115 if (!isPRINT(name[1])) {
117 name[2] = toCTRL(name[1]);
120 croak("Can't use global %s in \"my\"",name);
122 if (AvFILL(comppad_name) >= 0) {
123 SV **svp = AvARRAY(comppad_name);
124 for (off = AvFILL(comppad_name); off > comppad_name_floor; off--) {
127 && SvIVX(sv) == 999999999 /* var is in open scope */
128 && strEQ(name, SvPVX(sv)))
130 warn("\"my\" variable %s masks earlier declaration in same scope", name);
135 off = pad_alloc(OP_PADSV, SVs_PADMY);
137 sv_upgrade(sv, SVt_PVNV);
141 croak("Can't declare class for non-scalar %s in \"my\"",name);
143 (void)SvUPGRADE(sv, SVt_PVMG);
144 SvSTASH(sv) = (HV*)SvREFCNT_inc(in_my_stash);
147 av_store(comppad_name, off, sv);
148 SvNVX(sv) = (double)999999999;
149 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
150 if (!min_intro_pending)
151 min_intro_pending = off;
152 max_intro_pending = off;
154 av_store(comppad, off, (SV*)newAV());
155 else if (*name == '%')
156 av_store(comppad, off, (SV*)newHV());
157 SvPADMY_on(curpad[off]);
162 #ifndef CAN_PROTOTYPE
163 pad_findlex(name, newoff, seq, startcv, cx_ix)
170 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
178 register CONTEXT *cx;
181 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
182 AV *curlist = CvPADLIST(cv);
183 SV **svp = av_fetch(curlist, 0, FALSE);
186 if (!svp || *svp == &sv_undef)
189 svp = AvARRAY(curname);
190 for (off = AvFILL(curname); off > 0; off--) {
191 if ((sv = svp[off]) &&
194 seq > I_32(SvNVX(sv)) &&
195 strEQ(SvPVX(sv), name))
206 return 0; /* don't clone from inactive stack frame */
210 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
211 oldsv = *av_fetch(oldpad, off, TRUE);
212 if (!newoff) { /* Not a mere clone operation. */
213 SV *namesv = NEWSV(1103,0);
214 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
215 sv_upgrade(namesv, SVt_PVNV);
216 sv_setpv(namesv, name);
217 av_store(comppad_name, newoff, namesv);
218 SvNVX(namesv) = (double)curcop->cop_seq;
219 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
220 SvFAKE_on(namesv); /* A ref, not a real var */
221 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
222 /* "It's closures all the way down." */
226 oldsv = Nullsv; /* no need to keep ref */
231 bcv && bcv != cv && !CvCLONE(bcv);
232 bcv = CvOUTSIDE(bcv)) {
236 if (dowarn && !CvUNIQUE(cv))
238 "Variable \"%s\" may be unavailable",
245 else if (!CvUNIQUE(compcv)) {
246 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
247 warn("Variable \"%s\" will not stay shared", name);
250 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
256 /* Nothing in current lexical context--try eval's context, if any.
257 * This is necessary to let the perldb get at lexically scoped variables.
258 * XXX This will also probably interact badly with eval tree caching.
262 for (i = cx_ix; i >= 0; i--) {
264 switch (cx->cx_type) {
266 if (i == 0 && saweval) {
267 seq = cxstack[saweval].blk_oldcop->cop_seq;
268 return pad_findlex(name, newoff, seq, main_cv, 0);
272 switch (cx->blk_eval.old_op_type) {
277 /* require must have its own scope */
285 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
286 saweval = i; /* so we know where we were called from */
289 seq = cxstack[saweval].blk_oldcop->cop_seq;
290 return pad_findlex(name, newoff, seq, cv, i-1);
305 SV **svp = AvARRAY(comppad_name);
306 U32 seq = cop_seqmax;
310 * Special case to get lexical (and hence per-thread) @_.
311 * XXX I need to find out how to tell at parse-time whether use
312 * of @_ should refer to a lexical (from a sub) or defgv (global
313 * scope and maybe weird sub-ish things like formats). See
314 * startsub in perly.y. It's possible that @_ could be lexical
315 * (at least from subs) even in non-threaded perl.
317 if (strEQ(name, "@_"))
318 return 0; /* success. (NOT_IN_PAD indicates failure) */
319 #endif /* USE_THREADS */
321 /* The one we're looking for is probably just before comppad_name_fill. */
322 for (off = AvFILL(comppad_name); off > 0; off--) {
323 if ((sv = svp[off]) &&
327 seq > I_32(SvNVX(sv)))) &&
328 strEQ(SvPVX(sv), name))
331 return (PADOFFSET)off;
332 pendoff = off; /* this pending def. will override import */
336 /* See if it's in a nested scope */
337 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
339 /* If there is a pending local definition, this new alias must die */
341 SvIVX(AvARRAY(comppad_name)[off]) = seq;
342 return off; /* pad_findlex returns 0 for failure...*/
344 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
352 SV **svp = AvARRAY(comppad_name);
354 if (min_intro_pending && fill < min_intro_pending) {
355 for (off = max_intro_pending; off >= min_intro_pending; off--) {
356 if ((sv = svp[off]) && sv != &sv_undef)
357 warn("%s never introduced", SvPVX(sv));
360 /* "Deintroduce" my variables that are leaving with this scope. */
361 for (off = AvFILL(comppad_name); off > fill; off--) {
362 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
363 SvIVX(sv) = cop_seqmax;
368 pad_alloc(optype,tmptype)
376 if (AvARRAY(comppad) != curpad)
377 croak("panic: pad_alloc");
378 if (pad_reset_pending)
380 if (tmptype & SVs_PADMY) {
382 sv = *av_fetch(comppad, AvFILL(comppad) + 1, TRUE);
383 } while (SvPADBUSY(sv)); /* need a fresh one */
384 retval = AvFILL(comppad);
387 SV **names = AvARRAY(comppad_name);
388 SSize_t names_fill = AvFILL(comppad_name);
391 * "foreach" index vars temporarily become aliases to non-"my"
392 * values. Thus we must skip, not just pad values that are
393 * marked as current pad values, but also those with names.
395 if (++padix <= names_fill &&
396 (sv = names[padix]) && sv != &sv_undef)
398 sv = *av_fetch(comppad, padix, TRUE);
399 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
404 SvFLAGS(sv) |= tmptype;
405 curpad = AvARRAY(comppad);
407 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
408 (unsigned long) thr, (unsigned long) curpad,
409 (long) retval, op_name[optype]));
411 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad alloc %ld for %s\n",
412 (long) retval, op_name[optype]));
413 #endif /* USE_THREADS */
414 return (PADOFFSET)retval;
418 #ifndef CAN_PROTOTYPE
423 #endif /* CAN_PROTOTYPE */
427 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
428 (unsigned long) thr, (unsigned long) curpad, po));
431 croak("panic: pad_sv po");
432 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad sv %d\n", po));
433 #endif /* USE_THREADS */
434 return curpad[po]; /* eventually we'll turn this into a macro */
438 #ifndef CAN_PROTOTYPE
442 pad_free(PADOFFSET po)
443 #endif /* CAN_PROTOTYPE */
448 if (AvARRAY(comppad) != curpad)
449 croak("panic: pad_free curpad");
451 croak("panic: pad_free po");
453 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
454 (unsigned long) thr, (unsigned long) curpad, po));
456 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad free %d\n", po));
457 #endif /* USE_THREADS */
458 if (curpad[po] && curpad[po] != &sv_undef)
459 SvPADTMP_off(curpad[po]);
465 #ifndef CAN_PROTOTYPE
469 pad_swipe(PADOFFSET po)
470 #endif /* CAN_PROTOTYPE */
473 if (AvARRAY(comppad) != curpad)
474 croak("panic: pad_swipe curpad");
476 croak("panic: pad_swipe po");
478 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
479 (unsigned long) thr, (unsigned long) curpad, po));
481 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad swipe %d\n", po));
482 #endif /* USE_THREADS */
483 SvPADTMP_off(curpad[po]);
484 curpad[po] = NEWSV(1107,0);
485 SvPADTMP_on(curpad[po]);
496 if (AvARRAY(comppad) != curpad)
497 croak("panic: pad_reset curpad");
499 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
500 (unsigned long) thr, (unsigned long) curpad));
502 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad reset\n"));
503 #endif /* USE_THREADS */
504 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
505 for (po = AvMAX(comppad); po > padix_floor; po--) {
506 if (curpad[po] && !SvIMMORTAL(curpad[po]))
507 SvPADTMP_off(curpad[po]);
511 pad_reset_pending = FALSE;
520 register OP *kid, *nextkid;
522 if (!o || o->op_seq == (U16)-1)
525 if (o->op_flags & OPf_KIDS) {
526 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
527 nextkid = kid->op_sibling; /* Get before next freeing kid */
532 switch (o->op_type) {
534 o->op_targ = 0; /* Was holding old type, if any. */
537 o->op_targ = 0; /* Was holding hints. */
540 if (!(o->op_flags & OPf_REF) || (check[o->op_type] != ck_ftst))
546 SvREFCNT_dec(cGVOPo->op_gv);
550 Safefree(cCOPo->cop_label);
551 SvREFCNT_dec(cCOPo->cop_filegv);
554 SvREFCNT_dec(cSVOPo->op_sv);
560 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
564 Safefree(cPVOPo->op_pv);
567 op_free(cPMOPo->op_pmreplroot);
571 pregfree(cPMOPo->op_pmregexp);
572 SvREFCNT_dec(cPMOPo->op_pmshort);
577 pad_free(o->op_targ);
586 if (o->op_type != OP_NULL && o->op_targ > 0)
587 pad_free(o->op_targ);
588 o->op_targ = o->op_type;
589 o->op_type = OP_NULL;
590 o->op_ppaddr = ppaddr[OP_NULL];
593 /* Contextualizers */
595 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
606 /* establish postfix order */
607 if (cUNOPo->op_first) {
608 o->op_next = LINKLIST(cUNOPo->op_first);
609 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
611 kid->op_next = LINKLIST(kid->op_sibling);
627 if (o && o->op_flags & OPf_KIDS) {
628 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
639 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
640 line_t oldline = curcop->cop_line;
642 if (copline != NOLINE)
643 curcop->cop_line = copline;
644 warn("Found = in conditional, should be ==");
645 curcop->cop_line = oldline;
656 /* assumes no premature commitment */
657 if (!o || (o->op_flags & OPf_WANT) || error_count
658 || o->op_type == OP_RETURN)
661 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
663 switch (o->op_type) {
665 if (o->op_private & OPpREPEAT_DOLIST)
666 null(((LISTOP*)cBINOPo->op_first)->op_first);
667 scalar(cBINOPo->op_first);
672 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
676 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
677 if (!kPMOP->op_pmreplroot)
678 deprecate("implicit split to @_");
685 if (o->op_flags & OPf_KIDS) {
686 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
692 kid = cLISTOPo->op_first;
694 while (kid = kid->op_sibling) {
705 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
725 /* assumes no premature commitment */
726 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
727 || o->op_type == OP_RETURN)
730 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
732 switch (o->op_type) {
734 if (!(opargs[o->op_type] & OA_FOLDCONST))
738 if (o->op_flags & OPf_STACKED)
809 if (!(o->op_private & OPpLVAL_INTRO))
810 useless = op_desc[o->op_type];
817 if (!(o->op_private & OPpLVAL_INTRO) &&
818 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
819 useless = "a variable";
824 curcop = ((COP*)o); /* for warning below */
830 useless = "a constant";
831 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
833 else if (SvPOK(sv)) {
834 if (strnEQ(SvPVX(sv), "di", 2) ||
835 strnEQ(SvPVX(sv), "ds", 2) ||
836 strnEQ(SvPVX(sv), "ig", 2))
840 null(o); /* don't execute a constant */
841 SvREFCNT_dec(sv); /* don't even remember it */
845 o->op_type = OP_PREINC; /* pre-increment is faster */
846 o->op_ppaddr = ppaddr[OP_PREINC];
850 o->op_type = OP_PREDEC; /* pre-decrement is faster */
851 o->op_ppaddr = ppaddr[OP_PREDEC];
857 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
862 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
863 curcop = ((COP*)o); /* for warning below */
864 if (o->op_flags & OPf_STACKED)
870 if (!(o->op_flags & OPf_KIDS))
879 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
886 /* all requires must return a boolean value */
887 o->op_flags &= ~OPf_WANT;
890 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
891 if (!kPMOP->op_pmreplroot)
892 deprecate("implicit split to @_");
896 if (useless && dowarn)
897 warn("Useless use of %s in void context", useless);
906 if (o && o->op_flags & OPf_KIDS) {
907 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
919 /* assumes no premature commitment */
920 if (!o || (o->op_flags & OPf_WANT) || error_count
921 || o->op_type == OP_RETURN)
924 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
926 switch (o->op_type) {
929 list(cBINOPo->op_first);
934 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
941 if (!(o->op_flags & OPf_KIDS))
943 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
944 list(cBINOPo->op_first);
945 return gen_constant_list(o);
952 kid = cLISTOPo->op_first;
954 while (kid = kid->op_sibling) {
964 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
973 /* all requires must return a boolean value */
974 o->op_flags &= ~OPf_WANT;
987 if (o->op_type == OP_LINESEQ ||
988 o->op_type == OP_SCOPE ||
989 o->op_type == OP_LEAVE ||
990 o->op_type == OP_LEAVETRY)
992 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
993 if (kid->op_sibling) {
999 o->op_flags &= ~OPf_PARENS;
1000 if (hints & HINT_BLOCK_SCOPE)
1001 o->op_flags |= OPf_PARENS;
1004 o = newOP(OP_STUB, 0);
1014 if (o && o->op_flags & OPf_KIDS) {
1015 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1021 static I32 modcount;
1032 if (!o || error_count)
1035 switch (o->op_type) {
1039 if (!(o->op_private & (OPpCONST_ARYBASE)))
1041 if (eval_start && eval_start->op_type == OP_CONST) {
1042 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1046 SAVEI32(compiling.cop_arybase);
1047 compiling.cop_arybase = 0;
1049 else if (type == OP_REFGEN)
1052 croak("That use of $[ is unsupported");
1055 if (o->op_flags & OPf_PARENS)
1059 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1060 !(o->op_flags & OPf_STACKED)) {
1061 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1062 o->op_ppaddr = ppaddr[OP_RV2CV];
1063 assert(cUNOPo->op_first->op_type == OP_NULL);
1064 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1070 /* grep, foreach, subcalls, refgen */
1071 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1073 yyerror(form("Can't modify %s in %s",
1074 op_desc[o->op_type],
1075 type ? op_desc[type] : "local"));
1089 case OP_RIGHT_SHIFT:
1098 if (!(o->op_flags & OPf_STACKED))
1104 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1110 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1112 return o; /* Treat \(@foo) like ordinary list. */
1116 if (scalar_mod_type(o, type))
1118 ref(cUNOPo->op_first, o->op_type);
1130 if (!type && cUNOPo->op_first->op_type != OP_GV)
1131 croak("Can't localize a reference");
1132 ref(cUNOPo->op_first, o->op_type);
1144 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1145 return o; /* Treat \(@foo) like ordinary list. */
1146 if (scalar_mod_type(o, type))
1152 croak("Can't localize lexical variable %s",
1153 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1160 if (type != OP_SASSIGN)
1166 pad_free(o->op_targ);
1167 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1168 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1169 if (o->op_flags & OPf_KIDS)
1170 mod(cBINOPo->op_first->op_sibling, type);
1175 ref(cBINOPo->op_first, o->op_type);
1176 if (type == OP_ENTERSUB &&
1177 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1178 o->op_private |= OPpLVAL_DEFER;
1185 if (o->op_flags & OPf_KIDS)
1186 mod(cLISTOPo->op_last, type);
1190 if (!(o->op_flags & OPf_KIDS))
1192 if (o->op_targ != OP_LIST) {
1193 mod(cBINOPo->op_first, type);
1198 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1202 o->op_flags |= OPf_MOD;
1204 if (type == OP_AASSIGN || type == OP_SASSIGN)
1205 o->op_flags |= OPf_SPECIAL|OPf_REF;
1207 o->op_private |= OPpLVAL_INTRO;
1208 o->op_flags &= ~OPf_SPECIAL;
1210 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1211 o->op_flags |= OPf_REF;
1216 scalar_mod_type(o, type)
1222 if (o->op_type == OP_RV2GV)
1246 case OP_RIGHT_SHIFT:
1253 case OP_ANDASSIGN: /* may work later */
1254 case OP_ORASSIGN: /* may work later */
1267 if (o && o->op_flags & OPf_KIDS) {
1268 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1281 if (!o || error_count)
1284 switch (o->op_type) {
1286 if ((type == OP_DEFINED) &&
1287 !(o->op_flags & OPf_STACKED)) {
1288 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1289 o->op_ppaddr = ppaddr[OP_RV2CV];
1290 assert(cUNOPo->op_first->op_type == OP_NULL);
1291 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1292 o->op_flags |= OPf_SPECIAL;
1297 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1301 ref(cUNOPo->op_first, o->op_type);
1304 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1305 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1306 : type == OP_RV2HV ? OPpDEREF_HV
1308 o->op_flags |= OPf_MOD;
1314 o->op_flags |= OPf_REF;
1317 ref(cUNOPo->op_first, o->op_type);
1322 o->op_flags |= OPf_REF;
1327 if (!(o->op_flags & OPf_KIDS))
1329 ref(cBINOPo->op_first, type);
1333 ref(cBINOPo->op_first, o->op_type);
1334 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1335 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1336 : type == OP_RV2HV ? OPpDEREF_HV
1338 o->op_flags |= OPf_MOD;
1346 if (!(o->op_flags & OPf_KIDS))
1348 ref(cLISTOPo->op_last, type);
1364 if (!o || error_count)
1368 if (type == OP_LIST) {
1369 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1372 else if (type != OP_PADSV &&
1375 type != OP_PUSHMARK)
1377 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1380 o->op_flags |= OPf_MOD;
1381 o->op_private |= OPpLVAL_INTRO;
1390 o->op_flags |= OPf_PARENS;
1395 bind_match(type, left, right)
1403 (left->op_type == OP_RV2AV ||
1404 left->op_type == OP_RV2HV ||
1405 left->op_type == OP_PADAV ||
1406 left->op_type == OP_PADHV)) {
1407 char *desc = op_desc[(right->op_type == OP_SUBST ||
1408 right->op_type == OP_TRANS)
1409 ? right->op_type : OP_MATCH];
1410 char *sample = ((left->op_type == OP_RV2AV ||
1411 left->op_type == OP_PADAV)
1412 ? "@array" : "%hash");
1413 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1416 if (right->op_type == OP_MATCH ||
1417 right->op_type == OP_SUBST ||
1418 right->op_type == OP_TRANS) {
1419 right->op_flags |= OPf_STACKED;
1420 if (right->op_type != OP_MATCH)
1421 left = mod(left, right->op_type);
1422 if (right->op_type == OP_TRANS)
1423 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1425 o = prepend_elem(right->op_type, scalar(left), right);
1427 return newUNOP(OP_NOT, 0, scalar(o));
1431 return bind_match(type, left,
1432 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1441 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1442 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1450 if (o->op_flags & OPf_PARENS || perldb || tainting) {
1451 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1452 o->op_type = OP_LEAVE;
1453 o->op_ppaddr = ppaddr[OP_LEAVE];
1456 if (o->op_type == OP_LINESEQ) {
1458 o->op_type = OP_SCOPE;
1459 o->op_ppaddr = ppaddr[OP_SCOPE];
1460 kid = ((LISTOP*)o)->op_first;
1461 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1462 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1467 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1478 int retval = savestack_ix;
1479 SAVEI32(comppad_name_floor);
1481 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1482 comppad_name_floor = comppad_name_fill;
1484 comppad_name_floor = 0;
1486 SAVEI32(min_intro_pending);
1487 SAVEI32(max_intro_pending);
1488 min_intro_pending = 0;
1489 SAVEI32(comppad_name_fill);
1490 SAVEI32(padix_floor);
1491 padix_floor = padix;
1492 pad_reset_pending = FALSE;
1494 hints &= ~HINT_BLOCK_SCOPE;
1499 block_end(floor, seq)
1504 int needblockscope = hints & HINT_BLOCK_SCOPE;
1505 OP* retval = scalarseq(seq);
1507 pad_reset_pending = FALSE;
1509 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1510 pad_leavemy(comppad_name_fill);
1521 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1522 eval_start = linklist(eval_root);
1523 eval_root->op_next = 0;
1529 main_root = scope(sawparens(scalarvoid(o)));
1530 curcop = &compiling;
1531 main_start = LINKLIST(main_root);
1532 main_root->op_next = 0;
1536 /* Register with debugger */
1538 CV *cv = perl_get_cv("DB::postponed", FALSE);
1542 XPUSHs((SV*)compiling.cop_filegv);
1544 perl_call_sv((SV*)cv, G_DISCARD);
1555 if (o->op_flags & OPf_PARENS)
1559 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1561 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1562 if (*s == ';' || *s == '=')
1563 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1567 in_my_stash = Nullhv;
1571 return mod(o, OP_NULL); /* a bit kludgey */
1578 if (o->op_type == OP_LIST) {
1579 o = convert(OP_JOIN, 0,
1580 prepend_elem(OP_LIST,
1581 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1593 I32 type = o->op_type;
1596 if (opargs[type] & OA_RETSCALAR)
1598 if (opargs[type] & OA_TARGET)
1599 o->op_targ = pad_alloc(type, SVs_PADTMP);
1601 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1602 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1604 if (!(opargs[type] & OA_FOLDCONST))
1608 goto nope; /* Don't try to run w/ errors */
1610 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1611 if (curop->op_type != OP_CONST &&
1612 curop->op_type != OP_LIST &&
1613 curop->op_type != OP_SCALAR &&
1614 curop->op_type != OP_NULL &&
1615 curop->op_type != OP_PUSHMARK) {
1620 curop = LINKLIST(o);
1625 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1626 pad_swipe(o->op_targ);
1627 else if (SvTEMP(sv)) { /* grab mortal temp? */
1628 (void)SvREFCNT_inc(sv);
1632 if (type == OP_RV2GV)
1633 return newGVOP(OP_GV, 0, (GV*)sv);
1635 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1637 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1642 SvIOK_off(sv); /* undo SvIV() damage */
1644 return newSVOP(OP_CONST, 0, sv);
1648 if (!(opargs[type] & OA_OTHERINT))
1651 if (!(hints & HINT_INTEGER)) {
1652 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1655 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1656 if (curop->op_type == OP_CONST) {
1657 if (SvIOK(((SVOP*)curop)->op_sv))
1661 if (opargs[curop->op_type] & OA_RETINTEGER)
1665 o->op_ppaddr = ppaddr[++(o->op_type)];
1672 gen_constant_list(o)
1677 I32 oldtmps_floor = tmps_floor;
1681 return o; /* Don't attempt to run with errors */
1683 op = curop = LINKLIST(o);
1689 tmps_floor = oldtmps_floor;
1691 o->op_type = OP_RV2AV;
1692 o->op_ppaddr = ppaddr[OP_RV2AV];
1693 curop = ((UNOP*)o)->op_first;
1694 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1701 convert(type, flags, o)
1709 if (!o || o->op_type != OP_LIST)
1710 o = newLISTOP(OP_LIST, 0, o, Nullop);
1712 o->op_flags &= ~OPf_WANT;
1714 if (!(opargs[type] & OA_MARK))
1715 null(cLISTOPo->op_first);
1718 o->op_ppaddr = ppaddr[type];
1719 o->op_flags |= flags;
1721 o = CHECKOP(type, o);
1722 if (o->op_type != type)
1725 if (cLISTOPo->op_children < 7) {
1726 /* XXX do we really need to do this if we're done appending?? */
1727 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1729 cLISTOPo->op_last = last; /* in case check substituted last arg */
1732 return fold_constants(o);
1735 /* List constructors */
1738 append_elem(type, first, last)
1749 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1750 return newLISTOP(type, 0, first, last);
1752 if (first->op_flags & OPf_KIDS)
1753 ((LISTOP*)first)->op_last->op_sibling = last;
1755 first->op_flags |= OPf_KIDS;
1756 ((LISTOP*)first)->op_first = last;
1758 ((LISTOP*)first)->op_last = last;
1759 ((LISTOP*)first)->op_children++;
1764 append_list(type, first, last)
1775 if (first->op_type != type)
1776 return prepend_elem(type, (OP*)first, (OP*)last);
1778 if (last->op_type != type)
1779 return append_elem(type, (OP*)first, (OP*)last);
1781 first->op_last->op_sibling = last->op_first;
1782 first->op_last = last->op_last;
1783 first->op_children += last->op_children;
1784 if (first->op_children)
1785 last->op_flags |= OPf_KIDS;
1792 prepend_elem(type, first, last)
1803 if (last->op_type == type) {
1804 if (type == OP_LIST) { /* already a PUSHMARK there */
1805 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1806 ((LISTOP*)last)->op_first->op_sibling = first;
1809 if (!(last->op_flags & OPf_KIDS)) {
1810 ((LISTOP*)last)->op_last = first;
1811 last->op_flags |= OPf_KIDS;
1813 first->op_sibling = ((LISTOP*)last)->op_first;
1814 ((LISTOP*)last)->op_first = first;
1816 ((LISTOP*)last)->op_children++;
1820 return newLISTOP(type, 0, first, last);
1828 return newOP(OP_STUB, 0);
1835 if (!o || o->op_type != OP_LIST)
1836 o = newLISTOP(OP_LIST, 0, o, Nullop);
1842 newLISTOP(type, flags, first, last)
1850 Newz(1101, listop, 1, LISTOP);
1852 listop->op_type = type;
1853 listop->op_ppaddr = ppaddr[type];
1854 listop->op_children = (first != 0) + (last != 0);
1855 listop->op_flags = flags;
1859 else if (!first && last)
1862 first->op_sibling = last;
1863 listop->op_first = first;
1864 listop->op_last = last;
1865 if (type == OP_LIST) {
1867 pushop = newOP(OP_PUSHMARK, 0);
1868 pushop->op_sibling = first;
1869 listop->op_first = pushop;
1870 listop->op_flags |= OPf_KIDS;
1872 listop->op_last = pushop;
1874 else if (listop->op_children)
1875 listop->op_flags |= OPf_KIDS;
1886 Newz(1101, o, 1, OP);
1888 o->op_ppaddr = ppaddr[type];
1889 o->op_flags = flags;
1892 o->op_private = 0 + (flags >> 8);
1893 if (opargs[type] & OA_RETSCALAR)
1895 if (opargs[type] & OA_TARGET)
1896 o->op_targ = pad_alloc(type, SVs_PADTMP);
1897 return CHECKOP(type, o);
1901 newUNOP(type, flags, first)
1909 first = newOP(OP_STUB, 0);
1910 if (opargs[type] & OA_MARK)
1911 first = force_list(first);
1913 Newz(1101, unop, 1, UNOP);
1914 unop->op_type = type;
1915 unop->op_ppaddr = ppaddr[type];
1916 unop->op_first = first;
1917 unop->op_flags = flags | OPf_KIDS;
1918 unop->op_private = 1 | (flags >> 8);
1920 unop = (UNOP*) CHECKOP(type, unop);
1924 return fold_constants((OP *) unop);
1928 newBINOP(type, flags, first, last)
1935 Newz(1101, binop, 1, BINOP);
1938 first = newOP(OP_NULL, 0);
1940 binop->op_type = type;
1941 binop->op_ppaddr = ppaddr[type];
1942 binop->op_first = first;
1943 binop->op_flags = flags | OPf_KIDS;
1946 binop->op_private = 1 | (flags >> 8);
1949 binop->op_private = 2 | (flags >> 8);
1950 first->op_sibling = last;
1953 binop = (BINOP*)CHECKOP(type, binop);
1957 binop->op_last = last = binop->op_first->op_sibling;
1959 return fold_constants((OP *)binop);
1963 pmtrans(o, expr, repl)
1968 SV *tstr = ((SVOP*)expr)->op_sv;
1969 SV *rstr = ((SVOP*)repl)->op_sv;
1972 register U8 *t = (U8*)SvPV(tstr, tlen);
1973 register U8 *r = (U8*)SvPV(rstr, rlen);
1978 register short *tbl;
1980 tbl = (short*)cPVOPo->op_pv;
1981 complement = o->op_private & OPpTRANS_COMPLEMENT;
1982 delete = o->op_private & OPpTRANS_DELETE;
1983 /* squash = o->op_private & OPpTRANS_SQUASH; */
1986 Zero(tbl, 256, short);
1987 for (i = 0; i < tlen; i++)
1989 for (i = 0, j = 0; i < 256; i++) {
2005 if (!rlen && !delete) {
2008 for (i = 0; i < 256; i++)
2010 for (i = 0, j = 0; i < tlen; i++,j++) {
2013 if (tbl[t[i]] == -1)
2019 if (tbl[t[i]] == -1)
2030 newPMOP(type, flags)
2037 Newz(1101, pmop, 1, PMOP);
2038 pmop->op_type = type;
2039 pmop->op_ppaddr = ppaddr[type];
2040 pmop->op_flags = flags;
2041 pmop->op_private = 0 | (flags >> 8);
2043 if (hints & HINT_LOCALE)
2044 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2046 /* link into pm list */
2047 if (type != OP_TRANS && curstash) {
2048 pmop->op_pmnext = HvPMROOT(curstash);
2049 HvPMROOT(curstash) = pmop;
2056 pmruntime(o, expr, repl)
2064 if (o->op_type == OP_TRANS)
2065 return pmtrans(o, expr, repl);
2069 if (expr->op_type == OP_CONST) {
2071 SV *pat = ((SVOP*)expr)->op_sv;
2072 char *p = SvPV(pat, plen);
2073 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2074 sv_setpvn(pat, "\\s+", 3);
2075 p = SvPV(pat, plen);
2076 pm->op_pmflags |= PMf_SKIPWHITE;
2078 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2079 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2080 pm->op_pmflags |= PMf_WHITE;
2085 if (pm->op_pmflags & PMf_KEEP)
2086 expr = newUNOP(OP_REGCMAYBE,0,expr);
2088 Newz(1101, rcop, 1, LOGOP);
2089 rcop->op_type = OP_REGCOMP;
2090 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2091 rcop->op_first = scalar(expr);
2092 rcop->op_flags |= OPf_KIDS;
2093 rcop->op_private = 1;
2096 /* establish postfix order */
2097 if (pm->op_pmflags & PMf_KEEP) {
2099 rcop->op_next = expr;
2100 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2103 rcop->op_next = LINKLIST(expr);
2104 expr->op_next = (OP*)rcop;
2107 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2112 if (pm->op_pmflags & PMf_EVAL)
2114 else if (repl->op_type == OP_CONST)
2118 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2119 if (opargs[curop->op_type] & OA_DANGEROUS) {
2120 if (curop->op_type == OP_GV) {
2121 GV *gv = ((GVOP*)curop)->op_gv;
2122 if (strchr("&`'123456789+", *GvENAME(gv)))
2125 else if (curop->op_type == OP_RV2CV)
2127 else if (curop->op_type == OP_RV2SV ||
2128 curop->op_type == OP_RV2AV ||
2129 curop->op_type == OP_RV2HV ||
2130 curop->op_type == OP_RV2GV) {
2131 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2134 else if (curop->op_type == OP_PADSV ||
2135 curop->op_type == OP_PADAV ||
2136 curop->op_type == OP_PADHV ||
2137 curop->op_type == OP_PADANY) {
2146 if (curop == repl) {
2147 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2148 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2149 prepend_elem(o->op_type, scalar(repl), o);
2152 Newz(1101, rcop, 1, LOGOP);
2153 rcop->op_type = OP_SUBSTCONT;
2154 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2155 rcop->op_first = scalar(repl);
2156 rcop->op_flags |= OPf_KIDS;
2157 rcop->op_private = 1;
2160 /* establish postfix order */
2161 rcop->op_next = LINKLIST(repl);
2162 repl->op_next = (OP*)rcop;
2164 pm->op_pmreplroot = scalar((OP*)rcop);
2165 pm->op_pmreplstart = LINKLIST(rcop);
2174 newSVOP(type, flags, sv)
2180 Newz(1101, svop, 1, SVOP);
2181 svop->op_type = type;
2182 svop->op_ppaddr = ppaddr[type];
2184 svop->op_next = (OP*)svop;
2185 svop->op_flags = flags;
2186 if (opargs[type] & OA_RETSCALAR)
2188 if (opargs[type] & OA_TARGET)
2189 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2190 return CHECKOP(type, svop);
2194 newGVOP(type, flags, gv)
2201 Newz(1101, gvop, 1, GVOP);
2202 gvop->op_type = type;
2203 gvop->op_ppaddr = ppaddr[type];
2204 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2205 gvop->op_next = (OP*)gvop;
2206 gvop->op_flags = flags;
2207 if (opargs[type] & OA_RETSCALAR)
2209 if (opargs[type] & OA_TARGET)
2210 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2211 return CHECKOP(type, gvop);
2215 newPVOP(type, flags, pv)
2221 Newz(1101, pvop, 1, PVOP);
2222 pvop->op_type = type;
2223 pvop->op_ppaddr = ppaddr[type];
2225 pvop->op_next = (OP*)pvop;
2226 pvop->op_flags = flags;
2227 if (opargs[type] & OA_RETSCALAR)
2229 if (opargs[type] & OA_TARGET)
2230 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2231 return CHECKOP(type, pvop);
2241 save_hptr(&curstash);
2242 save_item(curstname);
2247 name = SvPV(sv, len);
2248 curstash = gv_stashpvn(name,len,TRUE);
2249 sv_setpvn(curstname, name, len);
2253 sv_setpv(curstname,"<none>");
2261 utilize(aver, floor, version, id, arg)
2274 if (id->op_type != OP_CONST)
2275 croak("Module name must be constant");
2279 if(version != Nullop) {
2280 SV *vesv = ((SVOP*)version)->op_sv;
2282 if (arg == Nullop && !SvNIOK(vesv)) {
2289 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2290 croak("Version number must be constant number");
2292 /* Make copy of id so we don't free it twice */
2293 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2295 /* Fake up a method call to VERSION */
2296 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2297 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2298 append_elem(OP_LIST,
2299 prepend_elem(OP_LIST, pack, list(version)),
2300 newUNOP(OP_METHOD, 0, meth)));
2304 /* Fake up an import/unimport */
2305 if (arg && arg->op_type == OP_STUB)
2306 imop = arg; /* no import on explicit () */
2307 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2308 imop = Nullop; /* use 5.0; */
2311 /* Make copy of id so we don't free it twice */
2312 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2313 meth = newSVOP(OP_CONST, 0,
2315 ? newSVpv("import", 6)
2316 : newSVpv("unimport", 8)
2318 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2319 append_elem(OP_LIST,
2320 prepend_elem(OP_LIST, pack, list(arg)),
2321 newUNOP(OP_METHOD, 0, meth)));
2324 /* Fake up a require */
2325 rqop = newUNOP(OP_REQUIRE, 0, id);
2327 /* Fake up the BEGIN {}, which does its thing immediately. */
2329 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2331 append_elem(OP_LINESEQ,
2332 append_elem(OP_LINESEQ,
2333 newSTATEOP(0, Nullch, rqop),
2334 newSTATEOP(0, Nullch, veop)),
2335 newSTATEOP(0, Nullch, imop) ));
2342 newSLICEOP(flags, subscript, listval)
2347 return newBINOP(OP_LSLICE, flags,
2348 list(force_list(subscript)),
2349 list(force_list(listval)) );
2359 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2360 o = cUNOPo->op_first;
2362 if (o->op_type == OP_COND_EXPR) {
2363 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2364 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2369 yyerror("Assignment to both a list and a scalar");
2373 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2374 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2375 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2378 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2381 if (o->op_type == OP_RV2SV)
2388 newASSIGNOP(flags, left, optype, right)
2397 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2398 return newLOGOP(optype, 0,
2399 mod(scalar(left), optype),
2400 newUNOP(OP_SASSIGN, 0, scalar(right)));
2403 return newBINOP(optype, OPf_STACKED,
2404 mod(scalar(left), optype), scalar(right));
2408 if (list_assignment(left)) {
2410 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2411 left = mod(left, OP_AASSIGN);
2419 o = newBINOP(OP_AASSIGN, flags,
2420 list(force_list(right)),
2421 list(force_list(left)) );
2422 o->op_private = 0 | (flags >> 8);
2423 if (!(left->op_private & OPpLVAL_INTRO)) {
2424 static int generation = 100;
2428 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2429 if (opargs[curop->op_type] & OA_DANGEROUS) {
2430 if (curop->op_type == OP_GV) {
2431 GV *gv = ((GVOP*)curop)->op_gv;
2432 if (gv == defgv || SvCUR(gv) == generation)
2434 SvCUR(gv) = generation;
2436 else if (curop->op_type == OP_PADSV ||
2437 curop->op_type == OP_PADAV ||
2438 curop->op_type == OP_PADHV ||
2439 curop->op_type == OP_PADANY) {
2440 SV **svp = AvARRAY(comppad_name);
2441 SV *sv = svp[curop->op_targ];
2442 if (SvCUR(sv) == generation)
2444 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2446 else if (curop->op_type == OP_RV2CV)
2448 else if (curop->op_type == OP_RV2SV ||
2449 curop->op_type == OP_RV2AV ||
2450 curop->op_type == OP_RV2HV ||
2451 curop->op_type == OP_RV2GV) {
2452 if (lastop->op_type != OP_GV) /* funny deref? */
2461 o->op_private = OPpASSIGN_COMMON;
2463 if (right && right->op_type == OP_SPLIT) {
2465 if ((tmpop = ((LISTOP*)right)->op_first) &&
2466 tmpop->op_type == OP_PUSHRE)
2468 PMOP *pm = (PMOP*)tmpop;
2469 if (left->op_type == OP_RV2AV &&
2470 !(left->op_private & OPpLVAL_INTRO) &&
2471 !(o->op_private & OPpASSIGN_COMMON) )
2473 tmpop = ((UNOP*)left)->op_first;
2474 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2475 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2476 pm->op_pmflags |= PMf_ONCE;
2477 tmpop = cUNOPo->op_first; /* to list (nulled) */
2478 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2479 tmpop->op_sibling = Nullop; /* don't free split */
2480 right->op_next = tmpop->op_next; /* fix starting loc */
2481 op_free(o); /* blow off assign */
2482 right->op_flags &= ~OPf_WANT;
2483 /* "I don't know and I don't care." */
2488 if (modcount < 10000 &&
2489 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2491 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2493 sv_setiv(sv, modcount+1);
2501 right = newOP(OP_UNDEF, 0);
2502 if (right->op_type == OP_READLINE) {
2503 right->op_flags |= OPf_STACKED;
2504 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2507 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2508 o = newBINOP(OP_SASSIGN, flags,
2509 scalar(right), mod(scalar(left), OP_SASSIGN) );
2521 newSTATEOP(flags, label, o)
2527 U32 seq = intro_my();
2530 Newz(1101, cop, 1, COP);
2531 if (perldb && curcop->cop_line && curstash != debstash) {
2532 cop->op_type = OP_DBSTATE;
2533 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2536 cop->op_type = OP_NEXTSTATE;
2537 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2539 cop->op_flags = flags;
2540 cop->op_private = 0 | (flags >> 8);
2542 cop->op_private |= NATIVE_HINTS;
2544 cop->op_next = (OP*)cop;
2547 cop->cop_label = label;
2548 hints |= HINT_BLOCK_SCOPE;
2551 cop->cop_arybase = curcop->cop_arybase;
2553 if (copline == NOLINE)
2554 cop->cop_line = curcop->cop_line;
2556 cop->cop_line = copline;
2559 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2560 cop->cop_stash = curstash;
2562 if (perldb && curstash != debstash) {
2563 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2564 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2565 (void)SvIOK_on(*svp);
2567 SvSTASH(*svp) = (HV*)cop;
2571 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2574 /* "Introduce" my variables to visible status. */
2582 if (! min_intro_pending)
2585 svp = AvARRAY(comppad_name);
2586 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2587 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2588 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2589 SvNVX(sv) = (double)cop_seqmax;
2592 min_intro_pending = 0;
2593 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2594 return cop_seqmax++;
2598 newLOGOP(type, flags, first, other)
2608 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2609 return newBINOP(type, flags, scalar(first), scalar(other));
2611 scalarboolean(first);
2612 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2613 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2614 if (type == OP_AND || type == OP_OR) {
2620 first = cUNOPo->op_first;
2622 first->op_next = o->op_next;
2623 cUNOPo->op_first = Nullop;
2627 if (first->op_type == OP_CONST) {
2628 if (dowarn && (first->op_private & OPpCONST_BARE))
2629 warn("Probable precedence problem on %s", op_desc[type]);
2630 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2639 else if (first->op_type == OP_WANTARRAY) {
2645 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2646 OP *k1 = ((UNOP*)first)->op_first;
2647 OP *k2 = k1->op_sibling;
2649 switch (first->op_type)
2652 if (k2 && k2->op_type == OP_READLINE
2653 && (k2->op_flags & OPf_STACKED)
2654 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2655 warnop = k2->op_type;
2659 if (k1->op_type == OP_READDIR
2660 || k1->op_type == OP_GLOB
2661 || k1->op_type == OP_EACH)
2662 warnop = k1->op_type;
2666 line_t oldline = curcop->cop_line;
2667 curcop->cop_line = copline;
2668 warn("Value of %s%s can be \"0\"; test with defined()",
2670 ((warnop == OP_READLINE || warnop == OP_GLOB)
2671 ? " construct" : "() operator"));
2672 curcop->cop_line = oldline;
2679 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2680 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2682 Newz(1101, logop, 1, LOGOP);
2684 logop->op_type = type;
2685 logop->op_ppaddr = ppaddr[type];
2686 logop->op_first = first;
2687 logop->op_flags = flags | OPf_KIDS;
2688 logop->op_other = LINKLIST(other);
2689 logop->op_private = 1 | (flags >> 8);
2691 /* establish postfix order */
2692 logop->op_next = LINKLIST(first);
2693 first->op_next = (OP*)logop;
2694 first->op_sibling = other;
2696 o = newUNOP(OP_NULL, 0, (OP*)logop);
2703 newCONDOP(flags, first, trueop, falseop)
2714 return newLOGOP(OP_AND, 0, first, trueop);
2716 return newLOGOP(OP_OR, 0, first, falseop);
2718 scalarboolean(first);
2719 if (first->op_type == OP_CONST) {
2720 if (SvTRUE(((SVOP*)first)->op_sv)) {
2731 else if (first->op_type == OP_WANTARRAY) {
2735 Newz(1101, condop, 1, CONDOP);
2737 condop->op_type = OP_COND_EXPR;
2738 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2739 condop->op_first = first;
2740 condop->op_flags = flags | OPf_KIDS;
2741 condop->op_true = LINKLIST(trueop);
2742 condop->op_false = LINKLIST(falseop);
2743 condop->op_private = 1 | (flags >> 8);
2745 /* establish postfix order */
2746 condop->op_next = LINKLIST(first);
2747 first->op_next = (OP*)condop;
2749 first->op_sibling = trueop;
2750 trueop->op_sibling = falseop;
2751 o = newUNOP(OP_NULL, 0, (OP*)condop);
2753 trueop->op_next = o;
2754 falseop->op_next = o;
2760 newRANGE(flags, left, right)
2771 Newz(1101, condop, 1, CONDOP);
2773 condop->op_type = OP_RANGE;
2774 condop->op_ppaddr = ppaddr[OP_RANGE];
2775 condop->op_first = left;
2776 condop->op_flags = OPf_KIDS;
2777 condop->op_true = LINKLIST(left);
2778 condop->op_false = LINKLIST(right);
2779 condop->op_private = 1 | (flags >> 8);
2781 left->op_sibling = right;
2783 condop->op_next = (OP*)condop;
2784 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2785 flop = newUNOP(OP_FLOP, 0, flip);
2786 o = newUNOP(OP_NULL, 0, flop);
2789 left->op_next = flip;
2790 right->op_next = flop;
2792 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2793 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2794 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2795 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2797 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2798 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2801 if (!flip->op_private || !flop->op_private)
2802 linklist(o); /* blow off optimizer unless constant */
2808 newLOOPOP(flags, debuggable, expr, block)
2817 int once = block && block->op_flags & OPf_SPECIAL &&
2818 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2821 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2822 return block; /* do {} while 0 does once */
2823 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB) {
2824 expr = newUNOP(OP_DEFINED, 0,
2825 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2829 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2830 o = newLOGOP(OP_AND, 0, expr, listop);
2832 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2834 if (once && o != listop)
2835 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2838 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2840 o->op_flags |= flags;
2842 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2847 newWHILEOP(flags, debuggable, loop, expr, block, cont)
2862 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB)) {
2863 expr = newUNOP(OP_DEFINED, 0,
2864 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2868 block = newOP(OP_NULL, 0);
2871 next = LINKLIST(cont);
2873 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2875 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2876 redo = LINKLIST(listop);
2879 o = newLOGOP(OP_AND, 0, expr, scalar(listop));
2880 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2881 op_free(expr); /* oops, it's a while (0) */
2883 return Nullop; /* (listop already freed by newLOGOP) */
2885 ((LISTOP*)listop)->op_last->op_next = condop =
2886 (o == listop ? redo : LINKLIST(o));
2894 Newz(1101,loop,1,LOOP);
2895 loop->op_type = OP_ENTERLOOP;
2896 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2897 loop->op_private = 0;
2898 loop->op_next = (OP*)loop;
2901 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2903 loop->op_redoop = redo;
2904 loop->op_lastop = o;
2907 loop->op_nextop = next;
2909 loop->op_nextop = o;
2911 o->op_flags |= flags;
2912 o->op_private |= (flags >> 8);
2917 #ifndef CAN_PROTOTYPE
2918 newFOROP(flags,label,forline,sv,expr,block,cont)
2927 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2928 #endif /* CAN_PROTOTYPE */
2936 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2937 sv->op_type = OP_RV2GV;
2938 sv->op_ppaddr = ppaddr[OP_RV2GV];
2940 else if (sv->op_type == OP_PADSV) { /* private variable */
2941 padoff = sv->op_targ;
2946 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2949 sv = newGVOP(OP_GV, 0, defgv);
2951 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2952 expr = scalar(ref(expr, OP_ITER));
2953 iterflags |= OPf_STACKED;
2955 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2956 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2958 assert(!loop->op_next);
2959 Renew(loop, 1, LOOP);
2960 loop->op_targ = padoff;
2961 return newSTATEOP(0, label, newWHILEOP(flags, 1, loop,
2962 newOP(OP_ITER, 0), block, cont));
2966 newLOOPEX(type, label)
2972 if (type != OP_GOTO || label->op_type == OP_CONST) {
2973 o = newPVOP(type, 0, savepv(
2974 label->op_type == OP_CONST
2975 ? SvPVx(((SVOP*)label)->op_sv, na)
2980 if (label->op_type == OP_ENTERSUB)
2981 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2982 o = newUNOP(type, OPf_STACKED, label);
2984 hints |= HINT_BLOCK_SCOPE;
2995 MUTEX_DESTROY(CvMUTEXP(cv));
2996 Safefree(CvMUTEXP(cv));
3000 COND_DESTROY(CvCONDP(cv));
3001 Safefree(CvCONDP(cv));
3004 #endif /* USE_THREADS */
3006 if (!CvXSUB(cv) && CvROOT(cv)) {
3008 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3009 croak("Can't undef active subroutine");
3012 croak("Can't undef active subroutine");
3013 #endif /* USE_THREADS */
3020 op_free(CvROOT(cv));
3021 CvROOT(cv) = Nullop;
3024 SvPOK_off((SV*)cv); /* forget prototype */
3026 SvREFCNT_dec(CvGV(cv));
3028 SvREFCNT_dec(CvOUTSIDE(cv));
3029 CvOUTSIDE(cv) = Nullcv;
3030 if (CvPADLIST(cv)) {
3031 /* may be during global destruction */
3032 if (SvREFCNT(CvPADLIST(cv))) {
3033 I32 i = AvFILL(CvPADLIST(cv));
3035 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3036 SV* sv = svp ? *svp : Nullsv;
3039 if (sv == (SV*)comppad_name)
3040 comppad_name = Nullav;
3041 else if (sv == (SV*)comppad) {
3043 curpad = Null(SV**);
3047 SvREFCNT_dec((SV*)CvPADLIST(cv));
3049 CvPADLIST(cv) = Nullav;
3053 #ifdef DEBUG_CLOSURES
3058 CV *outside = CvOUTSIDE(cv);
3059 AV* padlist = CvPADLIST(cv);
3066 PerlIO_printf(Perl_debug_log, "\tCV=0x%p (%s), OUTSIDE=0x%p (%s)\n",
3068 (CvANON(cv) ? "ANON"
3069 : (cv == main_cv) ? "MAIN"
3070 : CvUNIQUE(outside) ? "UNIQUE"
3071 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3074 : CvANON(outside) ? "ANON"
3075 : (outside == main_cv) ? "MAIN"
3076 : CvUNIQUE(outside) ? "UNIQUE"
3077 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3082 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3083 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3084 pname = AvARRAY(pad_name);
3085 ppad = AvARRAY(pad);
3087 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
3088 if (SvPOK(pname[ix]))
3089 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%p (%s\"%s\" %ld-%ld)\n",
3091 SvFAKE(pname[ix]) ? "FAKE " : "",
3093 (long)I_32(SvNVX(pname[ix])),
3094 (long)SvIVX(pname[ix]));
3097 #endif /* DEBUG_CLOSURES */
3100 cv_clone2(proto, outside)
3107 AV* protopadlist = CvPADLIST(proto);
3108 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3109 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3110 SV** pname = AvARRAY(protopad_name);
3111 SV** ppad = AvARRAY(protopad);
3112 I32 fname = AvFILL(protopad_name);
3113 I32 fpad = AvFILL(protopad);
3117 assert(!CvUNIQUE(proto));
3122 SAVESPTR(comppad_name);
3125 cv = compcv = (CV*)NEWSV(1104,0);
3126 sv_upgrade((SV *)cv, SvTYPE(proto));
3132 New(666, CvMUTEXP(cv), 1, pthread_mutex_t);
3133 MUTEX_INIT(CvMUTEXP(cv));
3134 New(666, CvCONDP(cv), 1, pthread_cond_t);
3135 COND_INIT(CvCONDP(cv));
3137 #endif /* USE_THREADS */
3138 CvFILEGV(cv) = CvFILEGV(proto);
3139 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3140 CvSTASH(cv) = CvSTASH(proto);
3141 CvROOT(cv) = CvROOT(proto);
3142 CvSTART(cv) = CvSTART(proto);
3144 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3147 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3149 comppad_name = newAV();
3150 for (ix = fname; ix >= 0; ix--)
3151 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3155 comppadlist = newAV();
3156 AvREAL_off(comppadlist);
3157 av_store(comppadlist, 0, (SV*)comppad_name);
3158 av_store(comppadlist, 1, (SV*)comppad);
3159 CvPADLIST(cv) = comppadlist;
3160 av_fill(comppad, AvFILL(protopad));
3161 curpad = AvARRAY(comppad);
3163 av = newAV(); /* will be @_ */
3165 av_store(comppad, 0, (SV*)av);
3166 AvFLAGS(av) = AVf_REIFY;
3168 for (ix = fpad; ix > 0; ix--) {
3169 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3170 if (namesv && namesv != &sv_undef) {
3171 char *name = SvPVX(namesv); /* XXX */
3172 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3173 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3174 CvOUTSIDE(cv), cxstack_ix);
3176 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3178 croak("panic: cv_clone: %s", name);
3180 else { /* our own lexical */
3183 /* anon code -- we'll come back for it */
3184 sv = SvREFCNT_inc(ppad[ix]);
3186 else if (*name == '@')
3188 else if (*name == '%')
3198 SV* sv = NEWSV(0,0);
3204 /* Now that vars are all in place, clone nested closures. */
3206 for (ix = fpad; ix > 0; ix--) {
3207 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3209 && namesv != &sv_undef
3210 && !(SvFLAGS(namesv) & SVf_FAKE)
3211 && *SvPVX(namesv) == '&'
3212 && CvCLONE(ppad[ix]))
3214 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3215 SvREFCNT_dec(ppad[ix]);
3218 curpad[ix] = (SV*)kid;
3222 #ifdef DEBUG_CLOSURES
3223 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3225 PerlIO_printf(Perl_debug_log, " from:\n");
3227 PerlIO_printf(Perl_debug_log, " to:\n");
3239 return cv_clone2(proto, CvOUTSIDE(proto));
3243 cv_ckproto(cv, gv, p)
3248 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3249 SV* msg = sv_newmortal();
3253 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3254 sv_setpv(msg, "Prototype mismatch:");
3256 sv_catpvf(msg, " sub %_", name);
3258 sv_catpvf(msg, " (%s)", SvPVX(cv));
3259 sv_catpv(msg, " vs ");
3261 sv_catpvf(msg, "(%s)", p);
3263 sv_catpv(msg, "none");
3275 if (!cv || !SvPOK(cv) || SvCUR(cv))
3279 for (o = CvSTART(cv); o; o = o->op_next) {
3280 OPCODE type = o->op_type;
3282 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3284 if (type == OP_LEAVESUB || type == OP_RETURN)
3288 if (type == OP_CONST)
3290 else if (type == OP_PADSV) {
3291 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3292 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3293 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3305 newSUB(floor,o,proto,block)
3312 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3313 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3314 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3323 if (!name || GvCVGEN(gv))
3325 else if (cv = GvCV(gv)) {
3326 cv_ckproto(cv, gv, ps);
3327 /* already defined (or promised)? */
3328 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3331 /* just a "sub foo;" when &foo is already defined */
3335 /* ahem, death to those who redefine active sort subs */
3336 if (curstack == sortstack && sortcop == CvSTART(cv))
3337 croak("Can't redefine active sort subroutine %s", name);
3338 const_sv = cv_const_sv(cv);
3339 if (const_sv || dowarn) {
3340 line_t oldline = curcop->cop_line;
3341 curcop->cop_line = copline;
3342 warn(const_sv ? "Constant subroutine %s redefined"
3343 : "Subroutine %s redefined", name);
3344 curcop->cop_line = oldline;
3350 if (cv) { /* must reuse cv if autoloaded */
3352 CvFLAGS(cv) = CvFLAGS(compcv);
3353 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3354 CvOUTSIDE(compcv) = 0;
3355 CvPADLIST(cv) = CvPADLIST(compcv);
3356 CvPADLIST(compcv) = 0;
3357 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3358 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3359 SvREFCNT_dec(compcv);
3369 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3370 CvFILEGV(cv) = curcop->cop_filegv;
3371 CvSTASH(cv) = curstash;
3374 New(666, CvMUTEXP(cv), 1, pthread_mutex_t);
3375 MUTEX_INIT(CvMUTEXP(cv));
3376 New(666, CvCONDP(cv), 1, pthread_cond_t);
3377 COND_INIT(CvCONDP(cv));
3378 #endif /* USE_THREADS */
3381 sv_setpv((SV*)cv, ps);
3387 char *s = strrchr(name, ':');
3389 if (strEQ(s, "BEGIN")) {
3391 "BEGIN not safe after errors--compilation aborted";
3395 /* force display of errors found but not reported */
3396 sv_catpv(GvSV(errgv), not_safe);
3397 croak("%s", SvPVx(GvSV(errgv), na));
3408 if (AvFILL(comppad_name) < AvFILL(comppad))
3409 av_store(comppad_name, AvFILL(comppad), Nullsv);
3412 SV **namep = AvARRAY(comppad_name);
3413 for (ix = AvFILL(comppad); ix > 0; ix--) {
3416 if (SvIMMORTAL(curpad[ix]))
3419 * The only things that a clonable function needs in its
3420 * pad are references to outer lexicals and anonymous subs.
3421 * The rest are created anew during cloning.
3423 if (!((namesv = namep[ix]) != Nullsv &&
3424 namesv != &sv_undef &&
3426 *SvPVX(namesv) == '&')))
3428 SvREFCNT_dec(curpad[ix]);
3429 curpad[ix] = Nullsv;
3434 AV *av = newAV(); /* Will be @_ */
3436 av_store(comppad, 0, (SV*)av);
3437 AvFLAGS(av) = AVf_REIFY;
3439 for (ix = AvFILL(comppad); ix > 0; ix--) {
3440 if (SvIMMORTAL(curpad[ix]))
3442 if (!SvPADMY(curpad[ix]))
3443 SvPADTMP_on(curpad[ix]);
3447 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3448 CvSTART(cv) = LINKLIST(CvROOT(cv));
3449 CvROOT(cv)->op_next = 0;
3455 if (perldb && curstash != debstash) {
3456 SV *sv = NEWSV(0,0);
3457 SV *tmpstr = sv_newmortal();
3458 static GV *db_postponed;
3462 sv_setpvf(sv, "%_:%ld-%ld",
3463 GvSV(curcop->cop_filegv),
3464 (long)subline, (long)curcop->cop_line);
3465 gv_efullname3(tmpstr, gv, Nullch);
3466 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3467 if (!db_postponed) {
3468 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3470 hv = GvHVn(db_postponed);
3471 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3472 && (cv = GvCV(db_postponed))) {
3477 perl_call_sv((SV*)cv, G_DISCARD);
3481 if ((s = strrchr(name,':')))
3485 if (strEQ(s, "BEGIN")) {
3486 I32 oldscope = scopestack_ix;
3488 SAVESPTR(compiling.cop_filegv);
3489 SAVEI16(compiling.cop_line);
3496 DEBUG_x( dump_sub(gv) );
3497 av_push(beginav, (SV *)cv);
3499 call_list(oldscope, beginav);
3501 curcop = &compiling;
3504 else if (strEQ(s, "END") && !error_count) {
3507 av_unshift(endav, 1);
3508 av_store(endav, 0, (SV *)cv);
3511 else if (strEQ(s, "RESTART") && !error_count) {
3513 restartav = newAV();
3514 av_push(restartav, SvREFCNT_inc(cv));
3526 newXSUB(name, ix, subaddr, filename)
3532 CV* cv = newXS(name, (void(*)())subaddr, filename);
3534 CvXSUBANY(cv).any_i32 = ix;
3540 newXS(name, subaddr, filename)
3542 void (*subaddr) _((CV*));
3546 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3549 if (cv = (name ? GvCV(gv) : Nullcv)) {
3551 /* just a cached method */
3555 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3556 /* already defined (or promised) */
3558 line_t oldline = curcop->cop_line;
3559 curcop->cop_line = copline;
3560 warn("Subroutine %s redefined",name);
3561 curcop->cop_line = oldline;
3568 if (cv) /* must reuse cv if autoloaded */
3571 cv = (CV*)NEWSV(1105,0);
3572 sv_upgrade((SV *)cv, SVt_PVCV);
3579 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3581 New(666, CvMUTEXP(cv), 1, pthread_mutex_t);
3582 MUTEX_INIT(CvMUTEXP(cv));
3583 New(666, CvCONDP(cv), 1, pthread_cond_t);
3584 COND_INIT(CvCONDP(cv));
3586 #endif /* USE_THREADS */
3587 CvFILEGV(cv) = gv_fetchfile(filename);
3588 CvXSUB(cv) = subaddr;
3591 char *s = strrchr(name,':');
3596 if (strEQ(s, "BEGIN")) {
3599 av_push(beginav, (SV *)cv);
3602 else if (strEQ(s, "END")) {
3605 av_unshift(endav, 1);
3606 av_store(endav, 0, (SV *)cv);
3609 else if (strEQ(s, "RESTART")) {
3611 restartav = newAV();
3612 av_push(restartav, (SV *)cv);
3622 newFORM(floor,o,block)
3634 name = SvPVx(cSVOPo->op_sv, na);
3637 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3639 if (cv = GvFORM(gv)) {
3641 line_t oldline = curcop->cop_line;
3643 curcop->cop_line = copline;
3644 warn("Format %s redefined",name);
3645 curcop->cop_line = oldline;
3651 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3652 CvFILEGV(cv) = curcop->cop_filegv;
3654 for (ix = AvFILL(comppad); ix > 0; ix--) {
3655 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3656 SvPADTMP_on(curpad[ix]);
3659 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3660 CvSTART(cv) = LINKLIST(CvROOT(cv));
3661 CvROOT(cv)->op_next = 0;
3672 return newUNOP(OP_REFGEN, 0,
3673 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3680 return newUNOP(OP_REFGEN, 0,
3681 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3685 newANONSUB(floor, proto, block)
3690 return newUNOP(OP_REFGEN, 0,
3691 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3698 switch (o->op_type) {
3700 o->op_type = OP_PADAV;
3701 o->op_ppaddr = ppaddr[OP_PADAV];
3702 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3705 o->op_type = OP_RV2AV;
3706 o->op_ppaddr = ppaddr[OP_RV2AV];
3711 warn("oops: oopsAV");
3721 switch (o->op_type) {
3724 o->op_type = OP_PADHV;
3725 o->op_ppaddr = ppaddr[OP_PADHV];
3726 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3730 o->op_type = OP_RV2HV;
3731 o->op_ppaddr = ppaddr[OP_RV2HV];
3736 warn("oops: oopsHV");
3746 if (o->op_type == OP_PADANY) {
3747 o->op_type = OP_PADAV;
3748 o->op_ppaddr = ppaddr[OP_PADAV];
3751 return newUNOP(OP_RV2AV, 0, scalar(o));
3759 if (type == OP_MAPSTART)
3760 return newUNOP(OP_NULL, 0, o);
3761 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3768 if (o->op_type == OP_PADANY) {
3769 o->op_type = OP_PADHV;
3770 o->op_ppaddr = ppaddr[OP_PADHV];
3773 return newUNOP(OP_RV2HV, 0, scalar(o));
3780 croak("NOT IMPL LINE %d",__LINE__);
3790 return newUNOP(OP_RV2CV, flags, scalar(o));
3797 if (o->op_type == OP_PADANY) {
3798 o->op_type = OP_PADSV;
3799 o->op_ppaddr = ppaddr[OP_PADSV];
3802 return newUNOP(OP_RV2SV, 0, scalar(o));
3805 /* Check routines. */
3814 name = NEWSV(1106,0);
3815 sv_upgrade(name, SVt_PVNV);
3816 sv_setpvn(name, "&", 1);
3819 ix = pad_alloc(o->op_type, SVs_PADMY);
3820 av_store(comppad_name, ix, name);
3821 av_store(comppad, ix, cSVOPo->op_sv);
3822 SvPADMY_on(cSVOPo->op_sv);
3823 cSVOPo->op_sv = Nullsv;
3824 cSVOPo->op_targ = ix;
3832 o->op_private = hints;
3840 if (cUNOPo->op_first->op_type == OP_CONCAT)
3841 o->op_flags |= OPf_STACKED;
3849 if (o->op_flags & OPf_KIDS) {
3852 OPCODE type = o->op_type;
3853 o = modkids(ck_fun(o), type);
3854 kid = cUNOPo->op_first;
3855 newop = kUNOP->op_first->op_sibling;
3857 (newop->op_sibling ||
3858 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3859 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3860 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3864 op_free(kUNOP->op_first);
3865 kUNOP->op_first = newop;
3867 o->op_ppaddr = ppaddr[++o->op_type];
3877 if (o->op_flags & OPf_KIDS) {
3878 OP *kid = cUNOPo->op_first;
3879 if (kid->op_type == OP_HSLICE)
3880 o->op_private |= OPpSLICE;
3881 else if (kid->op_type != OP_HELEM)
3882 croak("%s argument is not a HASH element or slice",
3883 op_desc[o->op_type]);
3893 I32 type = o->op_type;
3895 if (o->op_flags & OPf_KIDS) {
3896 if (cLISTOPo->op_first->op_type == OP_STUB) {
3898 o = newUNOP(type, OPf_SPECIAL,
3899 newGVOP(OP_GV, 0, gv_fetchpv("main'ARGV", TRUE, SVt_PVAV)));
3910 hints |= HINT_BLOCK_SCOPE;
3911 if (o->op_flags & OPf_KIDS) {
3912 SVOP *kid = (SVOP*)cUNOPo->op_first;
3915 o->op_flags &= ~OPf_KIDS;
3918 else if (kid->op_type == OP_LINESEQ) {
3921 kid->op_next = o->op_next;
3922 cUNOPo->op_first = 0;
3925 Newz(1101, enter, 1, LOGOP);
3926 enter->op_type = OP_ENTERTRY;
3927 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3928 enter->op_private = 0;
3930 /* establish postfix order */
3931 enter->op_next = (OP*)enter;
3933 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3934 o->op_type = OP_LEAVETRY;
3935 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3936 enter->op_other = o;
3942 o = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3944 o->op_targ = (PADOFFSET)hints;
3953 if (o->op_flags & OPf_STACKED) {
3955 kid = cUNOPo->op_first->op_sibling;
3956 if (kid->op_type == OP_RV2GV)
3969 if (o->op_flags & OPf_KIDS) {
3970 OP *kid = cUNOPo->op_first;
3971 if (kid->op_type != OP_HELEM)
3972 croak("%s argument is not a HASH element", op_desc[o->op_type]);
3982 o = fold_constants(o);
3983 if (o->op_type == OP_CONST)
3993 SVOP *kid = (SVOP*)cUNOPo->op_first;
3995 o->op_private |= (hints & HINT_STRICT_REFS);
3996 if (kid->op_type == OP_CONST) {
4001 name = SvPV(kid->op_sv, na);
4002 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4003 char *badthing = Nullch;
4004 switch (o->op_type) {
4006 badthing = "a SCALAR";
4009 badthing = "an ARRAY";
4012 badthing = "a HASH";
4017 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4020 kid->op_type = OP_GV;
4021 iscv = (o->op_type == OP_RV2CV) * 2;
4022 for (gv = 0; !gv; iscv++) {
4024 * This is a little tricky. We only want to add the symbol if we
4025 * didn't add it in the lexer. Otherwise we get duplicate strict
4026 * warnings. But if we didn't add it in the lexer, we must at
4027 * least pretend like we wanted to add it even if it existed before,
4028 * or we get possible typo warnings. OPpCONST_ENTERED says
4029 * whether the lexer already added THIS instance of this symbol.
4031 gv = gv_fetchpv(name,
4032 iscv | !(kid->op_private & OPpCONST_ENTERED),
4035 : o->op_type == OP_RV2SV
4037 : o->op_type == OP_RV2AV
4039 : o->op_type == OP_RV2HV
4043 SvREFCNT_dec(kid->op_sv);
4044 kid->op_sv = SvREFCNT_inc(gv);
4054 I32 type = o->op_type;
4056 if (o->op_flags & OPf_REF)
4059 if (o->op_flags & OPf_KIDS) {
4060 SVOP *kid = (SVOP*)cUNOPo->op_first;
4062 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4063 OP *newop = newGVOP(type, OPf_REF,
4064 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4071 if (type == OP_FTTTY)
4072 return newGVOP(type, OPf_REF, gv_fetchpv("main'STDIN", TRUE,
4075 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4089 int type = o->op_type;
4090 register I32 oa = opargs[type] >> OASHIFT;
4092 if (o->op_flags & OPf_STACKED) {
4093 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4096 return no_fh_allowed(o);
4099 if (o->op_flags & OPf_KIDS) {
4100 tokid = &cLISTOPo->op_first;
4101 kid = cLISTOPo->op_first;
4102 if (kid->op_type == OP_PUSHMARK ||
4103 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4105 tokid = &kid->op_sibling;
4106 kid = kid->op_sibling;
4108 if (!kid && opargs[type] & OA_DEFGV)
4109 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
4113 sibl = kid->op_sibling;
4127 if (kid->op_type == OP_CONST &&
4128 (kid->op_private & OPpCONST_BARE)) {
4129 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4130 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4131 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4133 warn("Array @%s missing the @ in argument %ld of %s()",
4134 name, (long)numargs, op_desc[type]);
4137 kid->op_sibling = sibl;
4140 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4141 bad_type(numargs, "array", op_desc[o->op_type], kid);
4145 if (kid->op_type == OP_CONST &&
4146 (kid->op_private & OPpCONST_BARE)) {
4147 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4148 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4149 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4151 warn("Hash %%%s missing the %% in argument %ld of %s()",
4152 name, (long)numargs, op_desc[type]);
4155 kid->op_sibling = sibl;
4158 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4159 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4164 OP *newop = newUNOP(OP_NULL, 0, kid);
4165 kid->op_sibling = 0;
4167 newop->op_next = newop;
4169 kid->op_sibling = sibl;
4174 if (kid->op_type != OP_GV) {
4175 if (kid->op_type == OP_CONST &&
4176 (kid->op_private & OPpCONST_BARE)) {
4177 OP *newop = newGVOP(OP_GV, 0,
4178 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4184 kid->op_sibling = 0;
4185 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4187 kid->op_sibling = sibl;
4193 mod(scalar(kid), type);
4197 tokid = &kid->op_sibling;
4198 kid = kid->op_sibling;
4200 o->op_private |= numargs;
4202 return too_many_arguments(o,op_desc[o->op_type]);
4205 else if (opargs[type] & OA_DEFGV) {
4207 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4211 while (oa & OA_OPTIONAL)
4213 if (oa && oa != OA_LIST)
4214 return too_few_arguments(o,op_desc[o->op_type]);
4223 GV *gv = gv_fetchpv("glob", FALSE, SVt_PVCV);
4225 if (gv && GvIMPORTED_CV(gv)) {
4226 static int glob_index;
4228 append_elem(OP_GLOB, o,
4229 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4230 o->op_type = OP_LIST;
4231 o->op_ppaddr = ppaddr[OP_LIST];
4232 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4233 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4234 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4235 append_elem(OP_LIST, o,
4236 scalar(newUNOP(OP_RV2CV, 0,
4237 newGVOP(OP_GV, 0, gv)))));
4240 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4241 append_elem(OP_GLOB, o, newSVREF(newGVOP(OP_GV, 0, defgv)));
4242 gv = newGVgen("main");
4244 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4255 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4257 o->op_ppaddr = ppaddr[OP_GREPSTART];
4258 Newz(1101, gwop, 1, LOGOP);
4260 if (o->op_flags & OPf_STACKED) {
4263 kid = cLISTOPo->op_first->op_sibling;
4264 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4267 kid->op_next = (OP*)gwop;
4268 o->op_flags &= ~OPf_STACKED;
4270 kid = cLISTOPo->op_first->op_sibling;
4271 if (type == OP_MAPWHILE)
4278 kid = cLISTOPo->op_first->op_sibling;
4279 if (kid->op_type != OP_NULL)
4280 croak("panic: ck_grep");
4281 kid = kUNOP->op_first;
4283 gwop->op_type = type;
4284 gwop->op_ppaddr = ppaddr[type];
4285 gwop->op_first = listkids(o);
4286 gwop->op_flags |= OPf_KIDS;
4287 gwop->op_private = 1;
4288 gwop->op_other = LINKLIST(kid);
4289 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4290 kid->op_next = (OP*)gwop;
4292 kid = cLISTOPo->op_first->op_sibling;
4293 if (!kid || !kid->op_sibling)
4294 return too_few_arguments(o,op_desc[o->op_type]);
4295 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4296 mod(kid, OP_GREPSTART);
4305 if (o->op_flags & OPf_KIDS) {
4306 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4307 if (kid && kid->op_type == OP_CONST)
4308 fbm_compile(((SVOP*)kid)->op_sv);
4317 /* XXX length optimization goes here */
4325 OPCODE type = o->op_type;
4326 return modkids(ck_fun(o), type);
4333 OPCODE type = o->op_type;
4334 return refkids(ck_fun(o), type);
4343 kid = cLISTOPo->op_first;
4346 kid = cLISTOPo->op_first;
4348 if (kid->op_type == OP_PUSHMARK)
4349 kid = kid->op_sibling;
4350 if (kid && o->op_flags & OPf_STACKED)
4351 kid = kid->op_sibling;
4352 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4353 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4354 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4355 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4356 cLISTOPo->op_first->op_sibling = kid;
4357 cLISTOPo->op_last = kid;
4358 kid = kid->op_sibling;
4363 append_elem(o->op_type, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4369 if (hints & HINT_LOCALE)
4370 o->op_private |= OPpLOCALE;
4384 if (hints & HINT_LOCALE)
4385 o->op_private |= OPpLOCALE;
4397 if (hints & HINT_LOCALE)
4398 o->op_private |= OPpLOCALE;
4408 o->op_private |= OPpRUNTIME;
4423 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4424 o->op_private |= OPpREPEAT_DOLIST;
4425 cBINOPo->op_first = force_list(cBINOPo->op_first);
4436 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4437 SVOP *kid = (SVOP*)cUNOPo->op_first;
4439 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4441 for (s = SvPVX(kid->op_sv); *s; s++) {
4442 if (*s == ':' && s[1] == ':') {
4444 Move(s+2, s+1, strlen(s+2)+1, char);
4445 --SvCUR(kid->op_sv);
4448 sv_catpvn(kid->op_sv, ".pm", 3);
4458 croak("NOT IMPL LINE %d",__LINE__);
4468 if (o->op_flags & OPf_KIDS) {
4469 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4470 if (kid && kid->op_sibling) {
4471 o->op_type = OP_SSELECT;
4472 o->op_ppaddr = ppaddr[OP_SSELECT];
4474 return fold_constants(o);
4478 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4479 if (kid && kid->op_type == OP_RV2GV)
4480 kid->op_private &= ~HINT_STRICT_REFS;
4488 I32 type = o->op_type;
4490 if (!(o->op_flags & OPf_KIDS)) {
4492 return newUNOP(type, 0,
4493 scalar(newUNOP(OP_RV2AV, 0,
4494 scalar(newGVOP(OP_GV, 0, subline
4496 : gv_fetchpv("ARGV", TRUE, SVt_PVAV) )))));
4498 return scalar(modkids(ck_fun(o), type));
4507 if (hints & HINT_LOCALE)
4508 o->op_private |= OPpLOCALE;
4511 if (o->op_flags & OPf_STACKED) {
4512 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4514 kid = kUNOP->op_first; /* get past rv2gv */
4516 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4518 if (kid->op_type == OP_SCOPE) {
4522 else if (kid->op_type == OP_LEAVE) {
4523 if (o->op_type == OP_SORT) {
4524 null(kid); /* wipe out leave */
4527 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4528 if (k->op_next == kid)
4533 kid->op_next = 0; /* just disconnect the leave */
4534 k = kLISTOP->op_first;
4538 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4539 null(kid); /* wipe out rv2gv */
4540 if (o->op_type == OP_SORT)
4544 o->op_flags |= OPf_SPECIAL;
4558 if (o->op_flags & OPf_STACKED)
4559 return no_fh_allowed(o);
4561 kid = cLISTOPo->op_first;
4562 if (kid->op_type != OP_NULL)
4563 croak("panic: ck_split");
4564 kid = kid->op_sibling;
4565 op_free(cLISTOPo->op_first);
4566 cLISTOPo->op_first = kid;
4568 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4569 cLISTOPo->op_last = kid; /* There was only one element previously */
4572 if (kid->op_type != OP_MATCH) {
4573 OP *sibl = kid->op_sibling;
4574 kid->op_sibling = 0;
4575 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4576 if (cLISTOPo->op_first == cLISTOPo->op_last)
4577 cLISTOPo->op_last = kid;
4578 cLISTOPo->op_first = kid;
4579 kid->op_sibling = sibl;
4582 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4583 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4587 kid->op_type = OP_PUSHRE;
4588 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4591 if (!kid->op_sibling)
4592 append_elem(OP_SPLIT, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4594 kid = kid->op_sibling;
4597 if (!kid->op_sibling)
4598 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4600 kid = kid->op_sibling;
4603 if (kid->op_sibling)
4604 return too_many_arguments(o,op_desc[o->op_type]);
4614 OP *prev = ((cUNOPo->op_first->op_sibling)
4615 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4616 OP *o2 = prev->op_sibling;
4624 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4625 if (cvop->op_type == OP_RV2CV) {
4627 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4628 null(cvop); /* disable rv2cv */
4629 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4630 if (tmpop->op_type == OP_GV) {
4631 cv = GvCVu(tmpop->op_sv);
4632 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4633 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4634 proto = SvPV((SV*)cv, na);
4638 o->op_private |= (hints & HINT_STRICT_REFS);
4639 if (perldb && curstash != debstash)
4640 o->op_private |= OPpENTERSUB_DB;
4641 while (o2 != cvop) {
4645 return too_many_arguments(o, gv_ename(namegv));
4663 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4664 bad_type(arg, "block", gv_ename(namegv), o2);
4669 if (o2->op_type == OP_RV2GV)
4673 o2 = newUNOP(OP_RV2GV, 0, kid);
4674 o2->op_sibling = kid->op_sibling;
4675 kid->op_sibling = 0;
4676 prev->op_sibling = o;
4684 if (o2->op_type != OP_RV2GV)
4685 bad_type(arg, "symbol", gv_ename(namegv), o2);
4688 if (o2->op_type != OP_RV2CV)
4689 bad_type(arg, "sub", gv_ename(namegv), o2);
4692 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4693 bad_type(arg, "scalar", gv_ename(namegv), o2);
4696 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4697 bad_type(arg, "array", gv_ename(namegv), o2);
4700 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4701 bad_type(arg, "hash", gv_ename(namegv), o2);
4705 o2 = newUNOP(OP_REFGEN, 0, kid);
4706 o2->op_sibling = kid->op_sibling;
4707 kid->op_sibling = 0;
4708 prev->op_sibling = o2;
4719 croak("Malformed prototype for %s: %s",
4720 gv_ename(namegv), SvPV((SV*)cv, na));
4725 mod(o2, OP_ENTERSUB);
4727 o2 = o2->op_sibling;
4729 if (proto && !optional && *proto == '$')
4730 return too_few_arguments(o, gv_ename(namegv));
4738 SvREADONLY_on(cSVOPo->op_sv);
4746 if (o->op_flags & OPf_KIDS) {
4747 SVOP *kid = (SVOP*)cUNOPo->op_first;
4749 if (kid->op_type == OP_NULL)
4750 kid = (SVOP*)kid->op_sibling;
4752 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4753 o->op_flags |= OPf_SPECIAL;
4758 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4765 register OP* oldop = 0;
4766 if (!o || o->op_seq)
4771 for (; o; o = o->op_next) {
4777 switch (o->op_type) {
4780 curcop = ((COP*)o); /* for warnings */
4781 o->op_seq = op_seqmax++;
4792 if (o->op_next->op_type == OP_STRINGIFY)
4794 o->op_seq = op_seqmax++;
4797 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4798 o->op_seq = op_seqmax++;
4799 break; /* Scalar stub must produce undef. List stub is noop */
4803 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4804 curcop = ((COP*)op);
4810 if (oldop && o->op_next) {
4811 oldop->op_next = o->op_next;
4814 o->op_seq = op_seqmax++;
4818 if (o->op_next->op_type == OP_RV2SV) {
4819 if (!(o->op_next->op_private & OPpDEREF)) {
4821 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4822 o->op_next = o->op_next->op_next;
4823 o->op_type = OP_GVSV;
4824 o->op_ppaddr = ppaddr[OP_GVSV];
4827 else if (o->op_next->op_type == OP_RV2AV) {
4828 OP* pop = o->op_next->op_next;
4830 if (pop->op_type == OP_CONST &&
4831 (op = pop->op_next) &&
4832 pop->op_next->op_type == OP_AELEM &&
4833 !(pop->op_next->op_private &
4834 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4835 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4839 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4843 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4844 o->op_next = pop->op_next->op_next;
4845 o->op_type = OP_AELEMFAST;
4846 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4847 o->op_private = (U8)i;
4848 GvAVn(((GVOP*)o)->op_gv);
4851 o->op_seq = op_seqmax++;
4858 o->op_seq = op_seqmax++;
4859 peep(cLOGOP->op_other);
4863 o->op_seq = op_seqmax++;
4864 peep(cCONDOP->op_true);
4865 peep(cCONDOP->op_false);
4869 o->op_seq = op_seqmax++;
4870 peep(cLOOP->op_redoop);
4871 peep(cLOOP->op_nextop);
4872 peep(cLOOP->op_lastop);
4877 o->op_seq = op_seqmax++;
4878 peep(cPMOP->op_pmreplstart);
4882 o->op_seq = op_seqmax++;
4883 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4884 if (o->op_next->op_sibling &&
4885 o->op_next->op_sibling->op_type != OP_DIE) {
4886 line_t oldline = curcop->cop_line;
4888 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4889 warn("Statement unlikely to be reached");
4890 warn("(Maybe you meant system() when you said exec()?)\n");
4891 curcop->cop_line = oldline;
4905 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4906 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4908 rop = (UNOP*)((BINOP*)o)->op_first;
4909 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4911 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4912 if (!SvOBJECT(lexname))
4914 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4915 if (!fields || !GvHV(*fields))
4917 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4918 key = SvPV(*svp, keylen);
4919 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4921 croak("No such field \"%s\" in variable %s of type %s",
4922 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4924 ind = SvIV(*indsvp);
4926 croak("Bad index while coercing array into hash");
4927 rop->op_type = OP_RV2AV;
4928 rop->op_ppaddr = ppaddr[OP_RV2AV];
4929 o->op_type = OP_AELEM;
4930 o->op_ppaddr = ppaddr[OP_AELEM];
4932 *svp = newSViv(ind);
4937 o->op_seq = op_seqmax++;