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) {
641 line_t oldline = curcop->cop_line;
643 if (copline != NOLINE)
644 curcop->cop_line = copline;
645 warn("Found = in conditional, should be ==");
646 curcop->cop_line = oldline;
657 /* assumes no premature commitment */
658 if (!o || (o->op_flags & OPf_WANT) || error_count
659 || o->op_type == OP_RETURN)
662 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
664 switch (o->op_type) {
666 if (o->op_private & OPpREPEAT_DOLIST)
667 null(((LISTOP*)cBINOPo->op_first)->op_first);
668 scalar(cBINOPo->op_first);
673 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
677 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
678 if (!kPMOP->op_pmreplroot)
679 deprecate("implicit split to @_");
686 if (o->op_flags & OPf_KIDS) {
687 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
693 kid = cLISTOPo->op_first;
695 while (kid = kid->op_sibling) {
701 WITH_THR(curcop = &compiling);
706 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
712 WITH_THR(curcop = &compiling);
726 /* assumes no premature commitment */
727 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
728 || o->op_type == OP_RETURN)
731 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
733 switch (o->op_type) {
735 if (!(opargs[o->op_type] & OA_FOLDCONST))
739 if (o->op_flags & OPf_STACKED)
810 if (!(o->op_private & OPpLVAL_INTRO))
811 useless = op_desc[o->op_type];
818 if (!(o->op_private & OPpLVAL_INTRO) &&
819 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
820 useless = "a variable";
825 WITH_THR(curcop = ((COP*)o)); /* for warning below */
831 useless = "a constant";
832 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
834 else if (SvPOK(sv)) {
835 if (strnEQ(SvPVX(sv), "di", 2) ||
836 strnEQ(SvPVX(sv), "ds", 2) ||
837 strnEQ(SvPVX(sv), "ig", 2))
841 null(o); /* don't execute a constant */
842 SvREFCNT_dec(sv); /* don't even remember it */
846 o->op_type = OP_PREINC; /* pre-increment is faster */
847 o->op_ppaddr = ppaddr[OP_PREINC];
851 o->op_type = OP_PREDEC; /* pre-decrement is faster */
852 o->op_ppaddr = ppaddr[OP_PREDEC];
858 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
863 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
864 WITH_THR(curcop = ((COP*)o)); /* for warning below */
865 if (o->op_flags & OPf_STACKED)
871 if (!(o->op_flags & OPf_KIDS))
880 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
887 /* all requires must return a boolean value */
888 o->op_flags &= ~OPf_WANT;
891 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
892 if (!kPMOP->op_pmreplroot)
893 deprecate("implicit split to @_");
897 if (useless && dowarn)
898 warn("Useless use of %s in void context", useless);
907 if (o && o->op_flags & OPf_KIDS) {
908 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
920 /* assumes no premature commitment */
921 if (!o || (o->op_flags & OPf_WANT) || error_count
922 || o->op_type == OP_RETURN)
925 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
927 switch (o->op_type) {
930 list(cBINOPo->op_first);
935 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
942 if (!(o->op_flags & OPf_KIDS))
944 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
945 list(cBINOPo->op_first);
946 return gen_constant_list(o);
953 kid = cLISTOPo->op_first;
955 while (kid = kid->op_sibling) {
961 WITH_THR(curcop = &compiling);
965 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
971 WITH_THR(curcop = &compiling);
974 /* all requires must return a boolean value */
975 o->op_flags &= ~OPf_WANT;
988 if (o->op_type == OP_LINESEQ ||
989 o->op_type == OP_SCOPE ||
990 o->op_type == OP_LEAVE ||
991 o->op_type == OP_LEAVETRY)
994 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
995 if (kid->op_sibling) {
1001 o->op_flags &= ~OPf_PARENS;
1002 if (hints & HINT_BLOCK_SCOPE)
1003 o->op_flags |= OPf_PARENS;
1006 o = newOP(OP_STUB, 0);
1016 if (o && o->op_flags & OPf_KIDS) {
1017 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1023 static I32 modcount;
1034 if (!o || error_count)
1037 switch (o->op_type) {
1041 if (!(o->op_private & (OPpCONST_ARYBASE)))
1043 if (eval_start && eval_start->op_type == OP_CONST) {
1044 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1048 SAVEI32(compiling.cop_arybase);
1049 compiling.cop_arybase = 0;
1051 else if (type == OP_REFGEN)
1054 croak("That use of $[ is unsupported");
1057 if (o->op_flags & OPf_PARENS)
1061 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1062 !(o->op_flags & OPf_STACKED)) {
1063 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1064 o->op_ppaddr = ppaddr[OP_RV2CV];
1065 assert(cUNOPo->op_first->op_type == OP_NULL);
1066 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1072 /* grep, foreach, subcalls, refgen */
1073 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1075 yyerror(form("Can't modify %s in %s",
1076 op_desc[o->op_type],
1077 type ? op_desc[type] : "local"));
1091 case OP_RIGHT_SHIFT:
1100 if (!(o->op_flags & OPf_STACKED))
1106 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1112 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1114 return o; /* Treat \(@foo) like ordinary list. */
1118 if (scalar_mod_type(o, type))
1120 ref(cUNOPo->op_first, o->op_type);
1132 if (!type && cUNOPo->op_first->op_type != OP_GV)
1133 croak("Can't localize a reference");
1134 ref(cUNOPo->op_first, o->op_type);
1146 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1147 return o; /* Treat \(@foo) like ordinary list. */
1148 if (scalar_mod_type(o, type))
1154 croak("Can't localize lexical variable %s",
1155 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1162 if (type != OP_SASSIGN)
1168 pad_free(o->op_targ);
1169 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1170 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1171 if (o->op_flags & OPf_KIDS)
1172 mod(cBINOPo->op_first->op_sibling, type);
1177 ref(cBINOPo->op_first, o->op_type);
1178 if (type == OP_ENTERSUB &&
1179 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1180 o->op_private |= OPpLVAL_DEFER;
1187 if (o->op_flags & OPf_KIDS)
1188 mod(cLISTOPo->op_last, type);
1192 if (!(o->op_flags & OPf_KIDS))
1194 if (o->op_targ != OP_LIST) {
1195 mod(cBINOPo->op_first, type);
1200 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1204 o->op_flags |= OPf_MOD;
1206 if (type == OP_AASSIGN || type == OP_SASSIGN)
1207 o->op_flags |= OPf_SPECIAL|OPf_REF;
1209 o->op_private |= OPpLVAL_INTRO;
1210 o->op_flags &= ~OPf_SPECIAL;
1212 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1213 o->op_flags |= OPf_REF;
1218 scalar_mod_type(o, type)
1224 if (o->op_type == OP_RV2GV)
1248 case OP_RIGHT_SHIFT:
1255 case OP_ANDASSIGN: /* may work later */
1256 case OP_ORASSIGN: /* may work later */
1269 if (o && o->op_flags & OPf_KIDS) {
1270 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1283 if (!o || error_count)
1286 switch (o->op_type) {
1288 if ((type == OP_DEFINED) &&
1289 !(o->op_flags & OPf_STACKED)) {
1290 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1291 o->op_ppaddr = ppaddr[OP_RV2CV];
1292 assert(cUNOPo->op_first->op_type == OP_NULL);
1293 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1294 o->op_flags |= OPf_SPECIAL;
1299 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1303 ref(cUNOPo->op_first, o->op_type);
1306 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1307 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1308 : type == OP_RV2HV ? OPpDEREF_HV
1310 o->op_flags |= OPf_MOD;
1316 o->op_flags |= OPf_REF;
1319 ref(cUNOPo->op_first, o->op_type);
1324 o->op_flags |= OPf_REF;
1329 if (!(o->op_flags & OPf_KIDS))
1331 ref(cBINOPo->op_first, type);
1335 ref(cBINOPo->op_first, o->op_type);
1336 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1337 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1338 : type == OP_RV2HV ? OPpDEREF_HV
1340 o->op_flags |= OPf_MOD;
1348 if (!(o->op_flags & OPf_KIDS))
1350 ref(cLISTOPo->op_last, type);
1366 if (!o || error_count)
1370 if (type == OP_LIST) {
1371 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1374 else if (type != OP_PADSV &&
1377 type != OP_PUSHMARK)
1379 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1382 o->op_flags |= OPf_MOD;
1383 o->op_private |= OPpLVAL_INTRO;
1392 o->op_flags |= OPf_PARENS;
1397 bind_match(type, left, right)
1405 (left->op_type == OP_RV2AV ||
1406 left->op_type == OP_RV2HV ||
1407 left->op_type == OP_PADAV ||
1408 left->op_type == OP_PADHV)) {
1409 char *desc = op_desc[(right->op_type == OP_SUBST ||
1410 right->op_type == OP_TRANS)
1411 ? right->op_type : OP_MATCH];
1412 char *sample = ((left->op_type == OP_RV2AV ||
1413 left->op_type == OP_PADAV)
1414 ? "@array" : "%hash");
1415 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1418 if (right->op_type == OP_MATCH ||
1419 right->op_type == OP_SUBST ||
1420 right->op_type == OP_TRANS) {
1421 right->op_flags |= OPf_STACKED;
1422 if (right->op_type != OP_MATCH)
1423 left = mod(left, right->op_type);
1424 if (right->op_type == OP_TRANS)
1425 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1427 o = prepend_elem(right->op_type, scalar(left), right);
1429 return newUNOP(OP_NOT, 0, scalar(o));
1433 return bind_match(type, left,
1434 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1443 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1444 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1452 if (o->op_flags & OPf_PARENS || perldb || tainting) {
1453 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1454 o->op_type = OP_LEAVE;
1455 o->op_ppaddr = ppaddr[OP_LEAVE];
1458 if (o->op_type == OP_LINESEQ) {
1460 o->op_type = OP_SCOPE;
1461 o->op_ppaddr = ppaddr[OP_SCOPE];
1462 kid = ((LISTOP*)o)->op_first;
1463 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1464 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1469 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1480 int retval = savestack_ix;
1481 SAVEI32(comppad_name_floor);
1483 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1484 comppad_name_floor = comppad_name_fill;
1486 comppad_name_floor = 0;
1488 SAVEI32(min_intro_pending);
1489 SAVEI32(max_intro_pending);
1490 min_intro_pending = 0;
1491 SAVEI32(comppad_name_fill);
1492 SAVEI32(padix_floor);
1493 padix_floor = padix;
1494 pad_reset_pending = FALSE;
1496 hints &= ~HINT_BLOCK_SCOPE;
1501 block_end(floor, seq)
1506 int needblockscope = hints & HINT_BLOCK_SCOPE;
1507 OP* retval = scalarseq(seq);
1509 pad_reset_pending = FALSE;
1511 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1512 pad_leavemy(comppad_name_fill);
1523 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1524 eval_start = linklist(eval_root);
1525 eval_root->op_next = 0;
1531 main_root = scope(sawparens(scalarvoid(o)));
1532 curcop = &compiling;
1533 main_start = LINKLIST(main_root);
1534 main_root->op_next = 0;
1538 /* Register with debugger */
1540 CV *cv = perl_get_cv("DB::postponed", FALSE);
1544 XPUSHs((SV*)compiling.cop_filegv);
1546 perl_call_sv((SV*)cv, G_DISCARD);
1557 if (o->op_flags & OPf_PARENS)
1561 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1563 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1564 if (*s == ';' || *s == '=')
1565 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1569 in_my_stash = Nullhv;
1573 return mod(o, OP_NULL); /* a bit kludgey */
1580 if (o->op_type == OP_LIST) {
1581 o = convert(OP_JOIN, 0,
1582 prepend_elem(OP_LIST,
1583 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1595 I32 type = o->op_type;
1598 if (opargs[type] & OA_RETSCALAR)
1600 if (opargs[type] & OA_TARGET)
1601 o->op_targ = pad_alloc(type, SVs_PADTMP);
1603 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1604 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1606 if (!(opargs[type] & OA_FOLDCONST))
1610 goto nope; /* Don't try to run w/ errors */
1612 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1613 if (curop->op_type != OP_CONST &&
1614 curop->op_type != OP_LIST &&
1615 curop->op_type != OP_SCALAR &&
1616 curop->op_type != OP_NULL &&
1617 curop->op_type != OP_PUSHMARK) {
1622 curop = LINKLIST(o);
1627 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1628 pad_swipe(o->op_targ);
1629 else if (SvTEMP(sv)) { /* grab mortal temp? */
1630 (void)SvREFCNT_inc(sv);
1634 if (type == OP_RV2GV)
1635 return newGVOP(OP_GV, 0, (GV*)sv);
1637 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1639 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1644 SvIOK_off(sv); /* undo SvIV() damage */
1646 return newSVOP(OP_CONST, 0, sv);
1650 if (!(opargs[type] & OA_OTHERINT))
1653 if (!(hints & HINT_INTEGER)) {
1654 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1657 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1658 if (curop->op_type == OP_CONST) {
1659 if (SvIOK(((SVOP*)curop)->op_sv))
1663 if (opargs[curop->op_type] & OA_RETINTEGER)
1667 o->op_ppaddr = ppaddr[++(o->op_type)];
1674 gen_constant_list(o)
1679 I32 oldtmps_floor = tmps_floor;
1683 return o; /* Don't attempt to run with errors */
1685 op = curop = LINKLIST(o);
1691 tmps_floor = oldtmps_floor;
1693 o->op_type = OP_RV2AV;
1694 o->op_ppaddr = ppaddr[OP_RV2AV];
1695 curop = ((UNOP*)o)->op_first;
1696 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1703 convert(type, flags, o)
1711 if (!o || o->op_type != OP_LIST)
1712 o = newLISTOP(OP_LIST, 0, o, Nullop);
1714 o->op_flags &= ~OPf_WANT;
1716 if (!(opargs[type] & OA_MARK))
1717 null(cLISTOPo->op_first);
1720 o->op_ppaddr = ppaddr[type];
1721 o->op_flags |= flags;
1723 o = CHECKOP(type, o);
1724 if (o->op_type != type)
1727 if (cLISTOPo->op_children < 7) {
1728 /* XXX do we really need to do this if we're done appending?? */
1729 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1731 cLISTOPo->op_last = last; /* in case check substituted last arg */
1734 return fold_constants(o);
1737 /* List constructors */
1740 append_elem(type, first, last)
1751 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1752 return newLISTOP(type, 0, first, last);
1754 if (first->op_flags & OPf_KIDS)
1755 ((LISTOP*)first)->op_last->op_sibling = last;
1757 first->op_flags |= OPf_KIDS;
1758 ((LISTOP*)first)->op_first = last;
1760 ((LISTOP*)first)->op_last = last;
1761 ((LISTOP*)first)->op_children++;
1766 append_list(type, first, last)
1777 if (first->op_type != type)
1778 return prepend_elem(type, (OP*)first, (OP*)last);
1780 if (last->op_type != type)
1781 return append_elem(type, (OP*)first, (OP*)last);
1783 first->op_last->op_sibling = last->op_first;
1784 first->op_last = last->op_last;
1785 first->op_children += last->op_children;
1786 if (first->op_children)
1787 last->op_flags |= OPf_KIDS;
1794 prepend_elem(type, first, last)
1805 if (last->op_type == type) {
1806 if (type == OP_LIST) { /* already a PUSHMARK there */
1807 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1808 ((LISTOP*)last)->op_first->op_sibling = first;
1811 if (!(last->op_flags & OPf_KIDS)) {
1812 ((LISTOP*)last)->op_last = first;
1813 last->op_flags |= OPf_KIDS;
1815 first->op_sibling = ((LISTOP*)last)->op_first;
1816 ((LISTOP*)last)->op_first = first;
1818 ((LISTOP*)last)->op_children++;
1822 return newLISTOP(type, 0, first, last);
1830 return newOP(OP_STUB, 0);
1837 if (!o || o->op_type != OP_LIST)
1838 o = newLISTOP(OP_LIST, 0, o, Nullop);
1844 newLISTOP(type, flags, first, last)
1852 Newz(1101, listop, 1, LISTOP);
1854 listop->op_type = type;
1855 listop->op_ppaddr = ppaddr[type];
1856 listop->op_children = (first != 0) + (last != 0);
1857 listop->op_flags = flags;
1861 else if (!first && last)
1864 first->op_sibling = last;
1865 listop->op_first = first;
1866 listop->op_last = last;
1867 if (type == OP_LIST) {
1869 pushop = newOP(OP_PUSHMARK, 0);
1870 pushop->op_sibling = first;
1871 listop->op_first = pushop;
1872 listop->op_flags |= OPf_KIDS;
1874 listop->op_last = pushop;
1876 else if (listop->op_children)
1877 listop->op_flags |= OPf_KIDS;
1888 Newz(1101, o, 1, OP);
1890 o->op_ppaddr = ppaddr[type];
1891 o->op_flags = flags;
1894 o->op_private = 0 + (flags >> 8);
1895 if (opargs[type] & OA_RETSCALAR)
1897 if (opargs[type] & OA_TARGET)
1898 o->op_targ = pad_alloc(type, SVs_PADTMP);
1899 return CHECKOP(type, o);
1903 newUNOP(type, flags, first)
1911 first = newOP(OP_STUB, 0);
1912 if (opargs[type] & OA_MARK)
1913 first = force_list(first);
1915 Newz(1101, unop, 1, UNOP);
1916 unop->op_type = type;
1917 unop->op_ppaddr = ppaddr[type];
1918 unop->op_first = first;
1919 unop->op_flags = flags | OPf_KIDS;
1920 unop->op_private = 1 | (flags >> 8);
1922 unop = (UNOP*) CHECKOP(type, unop);
1926 return fold_constants((OP *) unop);
1930 newBINOP(type, flags, first, last)
1937 Newz(1101, binop, 1, BINOP);
1940 first = newOP(OP_NULL, 0);
1942 binop->op_type = type;
1943 binop->op_ppaddr = ppaddr[type];
1944 binop->op_first = first;
1945 binop->op_flags = flags | OPf_KIDS;
1948 binop->op_private = 1 | (flags >> 8);
1951 binop->op_private = 2 | (flags >> 8);
1952 first->op_sibling = last;
1955 binop = (BINOP*)CHECKOP(type, binop);
1959 binop->op_last = last = binop->op_first->op_sibling;
1961 return fold_constants((OP *)binop);
1965 pmtrans(o, expr, repl)
1970 SV *tstr = ((SVOP*)expr)->op_sv;
1971 SV *rstr = ((SVOP*)repl)->op_sv;
1974 register U8 *t = (U8*)SvPV(tstr, tlen);
1975 register U8 *r = (U8*)SvPV(rstr, rlen);
1980 register short *tbl;
1982 tbl = (short*)cPVOPo->op_pv;
1983 complement = o->op_private & OPpTRANS_COMPLEMENT;
1984 delete = o->op_private & OPpTRANS_DELETE;
1985 /* squash = o->op_private & OPpTRANS_SQUASH; */
1988 Zero(tbl, 256, short);
1989 for (i = 0; i < tlen; i++)
1991 for (i = 0, j = 0; i < 256; i++) {
2007 if (!rlen && !delete) {
2010 for (i = 0; i < 256; i++)
2012 for (i = 0, j = 0; i < tlen; i++,j++) {
2015 if (tbl[t[i]] == -1)
2021 if (tbl[t[i]] == -1)
2032 newPMOP(type, flags)
2039 Newz(1101, pmop, 1, PMOP);
2040 pmop->op_type = type;
2041 pmop->op_ppaddr = ppaddr[type];
2042 pmop->op_flags = flags;
2043 pmop->op_private = 0 | (flags >> 8);
2045 if (hints & HINT_LOCALE)
2046 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2048 /* link into pm list */
2049 if (type != OP_TRANS && curstash) {
2050 pmop->op_pmnext = HvPMROOT(curstash);
2051 HvPMROOT(curstash) = pmop;
2058 pmruntime(o, expr, repl)
2066 if (o->op_type == OP_TRANS)
2067 return pmtrans(o, expr, repl);
2071 if (expr->op_type == OP_CONST) {
2073 SV *pat = ((SVOP*)expr)->op_sv;
2074 char *p = SvPV(pat, plen);
2075 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2076 sv_setpvn(pat, "\\s+", 3);
2077 p = SvPV(pat, plen);
2078 pm->op_pmflags |= PMf_SKIPWHITE;
2080 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2081 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2082 pm->op_pmflags |= PMf_WHITE;
2087 if (pm->op_pmflags & PMf_KEEP)
2088 expr = newUNOP(OP_REGCMAYBE,0,expr);
2090 Newz(1101, rcop, 1, LOGOP);
2091 rcop->op_type = OP_REGCOMP;
2092 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2093 rcop->op_first = scalar(expr);
2094 rcop->op_flags |= OPf_KIDS;
2095 rcop->op_private = 1;
2098 /* establish postfix order */
2099 if (pm->op_pmflags & PMf_KEEP) {
2101 rcop->op_next = expr;
2102 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2105 rcop->op_next = LINKLIST(expr);
2106 expr->op_next = (OP*)rcop;
2109 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2114 if (pm->op_pmflags & PMf_EVAL)
2116 else if (repl->op_type == OP_CONST)
2120 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2121 if (opargs[curop->op_type] & OA_DANGEROUS) {
2122 if (curop->op_type == OP_GV) {
2123 GV *gv = ((GVOP*)curop)->op_gv;
2124 if (strchr("&`'123456789+", *GvENAME(gv)))
2127 else if (curop->op_type == OP_RV2CV)
2129 else if (curop->op_type == OP_RV2SV ||
2130 curop->op_type == OP_RV2AV ||
2131 curop->op_type == OP_RV2HV ||
2132 curop->op_type == OP_RV2GV) {
2133 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2136 else if (curop->op_type == OP_PADSV ||
2137 curop->op_type == OP_PADAV ||
2138 curop->op_type == OP_PADHV ||
2139 curop->op_type == OP_PADANY) {
2148 if (curop == repl) {
2149 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2150 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2151 prepend_elem(o->op_type, scalar(repl), o);
2154 Newz(1101, rcop, 1, LOGOP);
2155 rcop->op_type = OP_SUBSTCONT;
2156 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2157 rcop->op_first = scalar(repl);
2158 rcop->op_flags |= OPf_KIDS;
2159 rcop->op_private = 1;
2162 /* establish postfix order */
2163 rcop->op_next = LINKLIST(repl);
2164 repl->op_next = (OP*)rcop;
2166 pm->op_pmreplroot = scalar((OP*)rcop);
2167 pm->op_pmreplstart = LINKLIST(rcop);
2176 newSVOP(type, flags, sv)
2182 Newz(1101, svop, 1, SVOP);
2183 svop->op_type = type;
2184 svop->op_ppaddr = ppaddr[type];
2186 svop->op_next = (OP*)svop;
2187 svop->op_flags = flags;
2188 if (opargs[type] & OA_RETSCALAR)
2190 if (opargs[type] & OA_TARGET)
2191 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2192 return CHECKOP(type, svop);
2196 newGVOP(type, flags, gv)
2203 Newz(1101, gvop, 1, GVOP);
2204 gvop->op_type = type;
2205 gvop->op_ppaddr = ppaddr[type];
2206 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2207 gvop->op_next = (OP*)gvop;
2208 gvop->op_flags = flags;
2209 if (opargs[type] & OA_RETSCALAR)
2211 if (opargs[type] & OA_TARGET)
2212 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2213 return CHECKOP(type, gvop);
2217 newPVOP(type, flags, pv)
2223 Newz(1101, pvop, 1, PVOP);
2224 pvop->op_type = type;
2225 pvop->op_ppaddr = ppaddr[type];
2227 pvop->op_next = (OP*)pvop;
2228 pvop->op_flags = flags;
2229 if (opargs[type] & OA_RETSCALAR)
2231 if (opargs[type] & OA_TARGET)
2232 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2233 return CHECKOP(type, pvop);
2243 save_hptr(&curstash);
2244 save_item(curstname);
2249 name = SvPV(sv, len);
2250 curstash = gv_stashpvn(name,len,TRUE);
2251 sv_setpvn(curstname, name, len);
2255 sv_setpv(curstname,"<none>");
2263 utilize(aver, floor, version, id, arg)
2276 if (id->op_type != OP_CONST)
2277 croak("Module name must be constant");
2281 if(version != Nullop) {
2282 SV *vesv = ((SVOP*)version)->op_sv;
2284 if (arg == Nullop && !SvNIOK(vesv)) {
2291 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2292 croak("Version number must be constant number");
2294 /* Make copy of id so we don't free it twice */
2295 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2297 /* Fake up a method call to VERSION */
2298 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2299 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2300 append_elem(OP_LIST,
2301 prepend_elem(OP_LIST, pack, list(version)),
2302 newUNOP(OP_METHOD, 0, meth)));
2306 /* Fake up an import/unimport */
2307 if (arg && arg->op_type == OP_STUB)
2308 imop = arg; /* no import on explicit () */
2309 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2310 imop = Nullop; /* use 5.0; */
2313 /* Make copy of id so we don't free it twice */
2314 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2315 meth = newSVOP(OP_CONST, 0,
2317 ? newSVpv("import", 6)
2318 : newSVpv("unimport", 8)
2320 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2321 append_elem(OP_LIST,
2322 prepend_elem(OP_LIST, pack, list(arg)),
2323 newUNOP(OP_METHOD, 0, meth)));
2326 /* Fake up a require */
2327 rqop = newUNOP(OP_REQUIRE, 0, id);
2329 /* Fake up the BEGIN {}, which does its thing immediately. */
2331 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2333 append_elem(OP_LINESEQ,
2334 append_elem(OP_LINESEQ,
2335 newSTATEOP(0, Nullch, rqop),
2336 newSTATEOP(0, Nullch, veop)),
2337 newSTATEOP(0, Nullch, imop) ));
2344 newSLICEOP(flags, subscript, listval)
2349 return newBINOP(OP_LSLICE, flags,
2350 list(force_list(subscript)),
2351 list(force_list(listval)) );
2361 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2362 o = cUNOPo->op_first;
2364 if (o->op_type == OP_COND_EXPR) {
2365 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2366 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2371 yyerror("Assignment to both a list and a scalar");
2375 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2376 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2377 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2380 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2383 if (o->op_type == OP_RV2SV)
2390 newASSIGNOP(flags, left, optype, right)
2399 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2400 return newLOGOP(optype, 0,
2401 mod(scalar(left), optype),
2402 newUNOP(OP_SASSIGN, 0, scalar(right)));
2405 return newBINOP(optype, OPf_STACKED,
2406 mod(scalar(left), optype), scalar(right));
2410 if (list_assignment(left)) {
2412 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2413 left = mod(left, OP_AASSIGN);
2421 o = newBINOP(OP_AASSIGN, flags,
2422 list(force_list(right)),
2423 list(force_list(left)) );
2424 o->op_private = 0 | (flags >> 8);
2425 if (!(left->op_private & OPpLVAL_INTRO)) {
2426 static int generation = 100;
2430 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2431 if (opargs[curop->op_type] & OA_DANGEROUS) {
2432 if (curop->op_type == OP_GV) {
2433 GV *gv = ((GVOP*)curop)->op_gv;
2434 if (gv == defgv || SvCUR(gv) == generation)
2436 SvCUR(gv) = generation;
2438 else if (curop->op_type == OP_PADSV ||
2439 curop->op_type == OP_PADAV ||
2440 curop->op_type == OP_PADHV ||
2441 curop->op_type == OP_PADANY) {
2442 SV **svp = AvARRAY(comppad_name);
2443 SV *sv = svp[curop->op_targ];
2444 if (SvCUR(sv) == generation)
2446 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2448 else if (curop->op_type == OP_RV2CV)
2450 else if (curop->op_type == OP_RV2SV ||
2451 curop->op_type == OP_RV2AV ||
2452 curop->op_type == OP_RV2HV ||
2453 curop->op_type == OP_RV2GV) {
2454 if (lastop->op_type != OP_GV) /* funny deref? */
2463 o->op_private = OPpASSIGN_COMMON;
2465 if (right && right->op_type == OP_SPLIT) {
2467 if ((tmpop = ((LISTOP*)right)->op_first) &&
2468 tmpop->op_type == OP_PUSHRE)
2470 PMOP *pm = (PMOP*)tmpop;
2471 if (left->op_type == OP_RV2AV &&
2472 !(left->op_private & OPpLVAL_INTRO) &&
2473 !(o->op_private & OPpASSIGN_COMMON) )
2475 tmpop = ((UNOP*)left)->op_first;
2476 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2477 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2478 pm->op_pmflags |= PMf_ONCE;
2479 tmpop = cUNOPo->op_first; /* to list (nulled) */
2480 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2481 tmpop->op_sibling = Nullop; /* don't free split */
2482 right->op_next = tmpop->op_next; /* fix starting loc */
2483 op_free(o); /* blow off assign */
2484 right->op_flags &= ~OPf_WANT;
2485 /* "I don't know and I don't care." */
2490 if (modcount < 10000 &&
2491 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2493 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2495 sv_setiv(sv, modcount+1);
2503 right = newOP(OP_UNDEF, 0);
2504 if (right->op_type == OP_READLINE) {
2505 right->op_flags |= OPf_STACKED;
2506 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2509 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2510 o = newBINOP(OP_SASSIGN, flags,
2511 scalar(right), mod(scalar(left), OP_SASSIGN) );
2523 newSTATEOP(flags, label, o)
2529 U32 seq = intro_my();
2532 Newz(1101, cop, 1, COP);
2533 if (perldb && curcop->cop_line && curstash != debstash) {
2534 cop->op_type = OP_DBSTATE;
2535 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2538 cop->op_type = OP_NEXTSTATE;
2539 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2541 cop->op_flags = flags;
2542 cop->op_private = 0 | (flags >> 8);
2544 cop->op_private |= NATIVE_HINTS;
2546 cop->op_next = (OP*)cop;
2549 cop->cop_label = label;
2550 hints |= HINT_BLOCK_SCOPE;
2553 cop->cop_arybase = curcop->cop_arybase;
2555 if (copline == NOLINE)
2556 cop->cop_line = curcop->cop_line;
2558 cop->cop_line = copline;
2561 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2562 cop->cop_stash = curstash;
2564 if (perldb && curstash != debstash) {
2565 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2566 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2567 (void)SvIOK_on(*svp);
2569 SvSTASH(*svp) = (HV*)cop;
2573 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2576 /* "Introduce" my variables to visible status. */
2584 if (! min_intro_pending)
2587 svp = AvARRAY(comppad_name);
2588 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2589 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2590 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2591 SvNVX(sv) = (double)cop_seqmax;
2594 min_intro_pending = 0;
2595 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2596 return cop_seqmax++;
2600 newLOGOP(type, flags, first, other)
2610 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2611 return newBINOP(type, flags, scalar(first), scalar(other));
2613 scalarboolean(first);
2614 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2615 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2616 if (type == OP_AND || type == OP_OR) {
2622 first = cUNOPo->op_first;
2624 first->op_next = o->op_next;
2625 cUNOPo->op_first = Nullop;
2629 if (first->op_type == OP_CONST) {
2630 if (dowarn && (first->op_private & OPpCONST_BARE))
2631 warn("Probable precedence problem on %s", op_desc[type]);
2632 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2641 else if (first->op_type == OP_WANTARRAY) {
2647 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2648 OP *k1 = ((UNOP*)first)->op_first;
2649 OP *k2 = k1->op_sibling;
2651 switch (first->op_type)
2654 if (k2 && k2->op_type == OP_READLINE
2655 && (k2->op_flags & OPf_STACKED)
2656 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2657 warnop = k2->op_type;
2661 if (k1->op_type == OP_READDIR
2662 || k1->op_type == OP_GLOB
2663 || k1->op_type == OP_EACH)
2664 warnop = k1->op_type;
2668 line_t oldline = curcop->cop_line;
2669 curcop->cop_line = copline;
2670 warn("Value of %s%s can be \"0\"; test with defined()",
2672 ((warnop == OP_READLINE || warnop == OP_GLOB)
2673 ? " construct" : "() operator"));
2674 curcop->cop_line = oldline;
2681 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2682 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2684 Newz(1101, logop, 1, LOGOP);
2686 logop->op_type = type;
2687 logop->op_ppaddr = ppaddr[type];
2688 logop->op_first = first;
2689 logop->op_flags = flags | OPf_KIDS;
2690 logop->op_other = LINKLIST(other);
2691 logop->op_private = 1 | (flags >> 8);
2693 /* establish postfix order */
2694 logop->op_next = LINKLIST(first);
2695 first->op_next = (OP*)logop;
2696 first->op_sibling = other;
2698 o = newUNOP(OP_NULL, 0, (OP*)logop);
2705 newCONDOP(flags, first, trueop, falseop)
2716 return newLOGOP(OP_AND, 0, first, trueop);
2718 return newLOGOP(OP_OR, 0, first, falseop);
2720 scalarboolean(first);
2721 if (first->op_type == OP_CONST) {
2722 if (SvTRUE(((SVOP*)first)->op_sv)) {
2733 else if (first->op_type == OP_WANTARRAY) {
2737 Newz(1101, condop, 1, CONDOP);
2739 condop->op_type = OP_COND_EXPR;
2740 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2741 condop->op_first = first;
2742 condop->op_flags = flags | OPf_KIDS;
2743 condop->op_true = LINKLIST(trueop);
2744 condop->op_false = LINKLIST(falseop);
2745 condop->op_private = 1 | (flags >> 8);
2747 /* establish postfix order */
2748 condop->op_next = LINKLIST(first);
2749 first->op_next = (OP*)condop;
2751 first->op_sibling = trueop;
2752 trueop->op_sibling = falseop;
2753 o = newUNOP(OP_NULL, 0, (OP*)condop);
2755 trueop->op_next = o;
2756 falseop->op_next = o;
2762 newRANGE(flags, left, right)
2773 Newz(1101, condop, 1, CONDOP);
2775 condop->op_type = OP_RANGE;
2776 condop->op_ppaddr = ppaddr[OP_RANGE];
2777 condop->op_first = left;
2778 condop->op_flags = OPf_KIDS;
2779 condop->op_true = LINKLIST(left);
2780 condop->op_false = LINKLIST(right);
2781 condop->op_private = 1 | (flags >> 8);
2783 left->op_sibling = right;
2785 condop->op_next = (OP*)condop;
2786 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2787 flop = newUNOP(OP_FLOP, 0, flip);
2788 o = newUNOP(OP_NULL, 0, flop);
2791 left->op_next = flip;
2792 right->op_next = flop;
2794 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2795 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2796 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2797 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2799 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2800 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2803 if (!flip->op_private || !flop->op_private)
2804 linklist(o); /* blow off optimizer unless constant */
2810 newLOOPOP(flags, debuggable, expr, block)
2819 int once = block && block->op_flags & OPf_SPECIAL &&
2820 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2823 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2824 return block; /* do {} while 0 does once */
2825 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB) {
2826 expr = newUNOP(OP_DEFINED, 0,
2827 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2831 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2832 o = newLOGOP(OP_AND, 0, expr, listop);
2834 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2836 if (once && o != listop)
2837 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2840 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2842 o->op_flags |= flags;
2844 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2849 newWHILEOP(flags, debuggable, loop, expr, block, cont)
2864 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB)) {
2865 expr = newUNOP(OP_DEFINED, 0,
2866 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2870 block = newOP(OP_NULL, 0);
2873 next = LINKLIST(cont);
2875 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2877 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2878 redo = LINKLIST(listop);
2881 o = newLOGOP(OP_AND, 0, expr, scalar(listop));
2882 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2883 op_free(expr); /* oops, it's a while (0) */
2885 return Nullop; /* (listop already freed by newLOGOP) */
2887 ((LISTOP*)listop)->op_last->op_next = condop =
2888 (o == listop ? redo : LINKLIST(o));
2896 Newz(1101,loop,1,LOOP);
2897 loop->op_type = OP_ENTERLOOP;
2898 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2899 loop->op_private = 0;
2900 loop->op_next = (OP*)loop;
2903 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2905 loop->op_redoop = redo;
2906 loop->op_lastop = o;
2909 loop->op_nextop = next;
2911 loop->op_nextop = o;
2913 o->op_flags |= flags;
2914 o->op_private |= (flags >> 8);
2919 #ifndef CAN_PROTOTYPE
2920 newFOROP(flags,label,forline,sv,expr,block,cont)
2929 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2930 #endif /* CAN_PROTOTYPE */
2938 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2939 sv->op_type = OP_RV2GV;
2940 sv->op_ppaddr = ppaddr[OP_RV2GV];
2942 else if (sv->op_type == OP_PADSV) { /* private variable */
2943 padoff = sv->op_targ;
2948 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2951 sv = newGVOP(OP_GV, 0, defgv);
2953 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2954 expr = scalar(ref(expr, OP_ITER));
2955 iterflags |= OPf_STACKED;
2957 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2958 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2960 assert(!loop->op_next);
2961 Renew(loop, 1, LOOP);
2962 loop->op_targ = padoff;
2963 return newSTATEOP(0, label, newWHILEOP(flags, 1, loop,
2964 newOP(OP_ITER, 0), block, cont));
2968 newLOOPEX(type, label)
2974 if (type != OP_GOTO || label->op_type == OP_CONST) {
2975 o = newPVOP(type, 0, savepv(
2976 label->op_type == OP_CONST
2977 ? SvPVx(((SVOP*)label)->op_sv, na)
2982 if (label->op_type == OP_ENTERSUB)
2983 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2984 o = newUNOP(type, OPf_STACKED, label);
2986 hints |= HINT_BLOCK_SCOPE;
2997 MUTEX_DESTROY(CvMUTEXP(cv));
2998 Safefree(CvMUTEXP(cv));
3001 #endif /* USE_THREADS */
3003 if (!CvXSUB(cv) && CvROOT(cv)) {
3005 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3006 croak("Can't undef active subroutine");
3009 croak("Can't undef active subroutine");
3010 #endif /* USE_THREADS */
3017 op_free(CvROOT(cv));
3018 CvROOT(cv) = Nullop;
3021 SvPOK_off((SV*)cv); /* forget prototype */
3023 SvREFCNT_dec(CvGV(cv));
3025 SvREFCNT_dec(CvOUTSIDE(cv));
3026 CvOUTSIDE(cv) = Nullcv;
3027 if (CvPADLIST(cv)) {
3028 /* may be during global destruction */
3029 if (SvREFCNT(CvPADLIST(cv))) {
3030 I32 i = AvFILL(CvPADLIST(cv));
3032 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3033 SV* sv = svp ? *svp : Nullsv;
3036 if (sv == (SV*)comppad_name)
3037 comppad_name = Nullav;
3038 else if (sv == (SV*)comppad) {
3040 curpad = Null(SV**);
3044 SvREFCNT_dec((SV*)CvPADLIST(cv));
3046 CvPADLIST(cv) = Nullav;
3050 #ifdef DEBUG_CLOSURES
3055 CV *outside = CvOUTSIDE(cv);
3056 AV* padlist = CvPADLIST(cv);
3063 PerlIO_printf(Perl_debug_log, "\tCV=0x%p (%s), OUTSIDE=0x%p (%s)\n",
3065 (CvANON(cv) ? "ANON"
3066 : (cv == main_cv) ? "MAIN"
3067 : CvUNIQUE(outside) ? "UNIQUE"
3068 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3071 : CvANON(outside) ? "ANON"
3072 : (outside == main_cv) ? "MAIN"
3073 : CvUNIQUE(outside) ? "UNIQUE"
3074 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3079 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3080 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3081 pname = AvARRAY(pad_name);
3082 ppad = AvARRAY(pad);
3084 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
3085 if (SvPOK(pname[ix]))
3086 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%p (%s\"%s\" %ld-%ld)\n",
3088 SvFAKE(pname[ix]) ? "FAKE " : "",
3090 (long)I_32(SvNVX(pname[ix])),
3091 (long)SvIVX(pname[ix]));
3094 #endif /* DEBUG_CLOSURES */
3097 cv_clone2(proto, outside)
3104 AV* protopadlist = CvPADLIST(proto);
3105 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3106 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3107 SV** pname = AvARRAY(protopad_name);
3108 SV** ppad = AvARRAY(protopad);
3109 I32 fname = AvFILL(protopad_name);
3110 I32 fpad = AvFILL(protopad);
3114 assert(!CvUNIQUE(proto));
3119 SAVESPTR(comppad_name);
3122 cv = compcv = (CV*)NEWSV(1104,0);
3123 sv_upgrade((SV *)cv, SvTYPE(proto));
3129 New(666, CvMUTEXP(cv), 1, perl_mutex);
3130 MUTEX_INIT(CvMUTEXP(cv));
3132 #endif /* USE_THREADS */
3133 CvFILEGV(cv) = CvFILEGV(proto);
3134 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3135 CvSTASH(cv) = CvSTASH(proto);
3136 CvROOT(cv) = CvROOT(proto);
3137 CvSTART(cv) = CvSTART(proto);
3139 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3142 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3144 comppad_name = newAV();
3145 for (ix = fname; ix >= 0; ix--)
3146 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3150 comppadlist = newAV();
3151 AvREAL_off(comppadlist);
3152 av_store(comppadlist, 0, (SV*)comppad_name);
3153 av_store(comppadlist, 1, (SV*)comppad);
3154 CvPADLIST(cv) = comppadlist;
3155 av_fill(comppad, AvFILL(protopad));
3156 curpad = AvARRAY(comppad);
3158 av = newAV(); /* will be @_ */
3160 av_store(comppad, 0, (SV*)av);
3161 AvFLAGS(av) = AVf_REIFY;
3163 for (ix = fpad; ix > 0; ix--) {
3164 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3165 if (namesv && namesv != &sv_undef) {
3166 char *name = SvPVX(namesv); /* XXX */
3167 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3168 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3169 CvOUTSIDE(cv), cxstack_ix);
3171 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3173 croak("panic: cv_clone: %s", name);
3175 else { /* our own lexical */
3178 /* anon code -- we'll come back for it */
3179 sv = SvREFCNT_inc(ppad[ix]);
3181 else if (*name == '@')
3183 else if (*name == '%')
3193 SV* sv = NEWSV(0,0);
3199 /* Now that vars are all in place, clone nested closures. */
3201 for (ix = fpad; ix > 0; ix--) {
3202 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3204 && namesv != &sv_undef
3205 && !(SvFLAGS(namesv) & SVf_FAKE)
3206 && *SvPVX(namesv) == '&'
3207 && CvCLONE(ppad[ix]))
3209 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3210 SvREFCNT_dec(ppad[ix]);
3213 curpad[ix] = (SV*)kid;
3217 #ifdef DEBUG_CLOSURES
3218 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3220 PerlIO_printf(Perl_debug_log, " from:\n");
3222 PerlIO_printf(Perl_debug_log, " to:\n");
3234 return cv_clone2(proto, CvOUTSIDE(proto));
3238 cv_ckproto(cv, gv, p)
3243 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3244 SV* msg = sv_newmortal();
3248 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3249 sv_setpv(msg, "Prototype mismatch:");
3251 sv_catpvf(msg, " sub %_", name);
3253 sv_catpvf(msg, " (%s)", SvPVX(cv));
3254 sv_catpv(msg, " vs ");
3256 sv_catpvf(msg, "(%s)", p);
3258 sv_catpv(msg, "none");
3270 if (!cv || !SvPOK(cv) || SvCUR(cv))
3274 for (o = CvSTART(cv); o; o = o->op_next) {
3275 OPCODE type = o->op_type;
3277 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3279 if (type == OP_LEAVESUB || type == OP_RETURN)
3283 if (type == OP_CONST)
3285 else if (type == OP_PADSV) {
3286 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3287 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3288 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3300 newSUB(floor,o,proto,block)
3307 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3308 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3309 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3318 if (!name || GvCVGEN(gv))
3320 else if (cv = GvCV(gv)) {
3321 cv_ckproto(cv, gv, ps);
3322 /* already defined (or promised)? */
3323 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3326 /* just a "sub foo;" when &foo is already defined */
3330 /* ahem, death to those who redefine active sort subs */
3331 if (curstack == sortstack && sortcop == CvSTART(cv))
3332 croak("Can't redefine active sort subroutine %s", name);
3333 const_sv = cv_const_sv(cv);
3334 if (const_sv || dowarn) {
3335 line_t oldline = curcop->cop_line;
3336 curcop->cop_line = copline;
3337 warn(const_sv ? "Constant subroutine %s redefined"
3338 : "Subroutine %s redefined", name);
3339 curcop->cop_line = oldline;
3345 if (cv) { /* must reuse cv if autoloaded */
3347 CvFLAGS(cv) = CvFLAGS(compcv);
3348 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3349 CvOUTSIDE(compcv) = 0;
3350 CvPADLIST(cv) = CvPADLIST(compcv);
3351 CvPADLIST(compcv) = 0;
3352 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3353 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3354 SvREFCNT_dec(compcv);
3364 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3365 CvFILEGV(cv) = curcop->cop_filegv;
3366 CvSTASH(cv) = curstash;
3369 New(666, CvMUTEXP(cv), 1, perl_mutex);
3370 MUTEX_INIT(CvMUTEXP(cv));
3371 #endif /* USE_THREADS */
3374 sv_setpv((SV*)cv, ps);
3380 char *s = strrchr(name, ':');
3382 if (strEQ(s, "BEGIN")) {
3384 "BEGIN not safe after errors--compilation aborted";
3388 /* force display of errors found but not reported */
3389 sv_catpv(GvSV(errgv), not_safe);
3390 croak("%s", SvPVx(GvSV(errgv), na));
3401 if (AvFILL(comppad_name) < AvFILL(comppad))
3402 av_store(comppad_name, AvFILL(comppad), Nullsv);
3405 SV **namep = AvARRAY(comppad_name);
3406 for (ix = AvFILL(comppad); ix > 0; ix--) {
3409 if (SvIMMORTAL(curpad[ix]))
3412 * The only things that a clonable function needs in its
3413 * pad are references to outer lexicals and anonymous subs.
3414 * The rest are created anew during cloning.
3416 if (!((namesv = namep[ix]) != Nullsv &&
3417 namesv != &sv_undef &&
3419 *SvPVX(namesv) == '&')))
3421 SvREFCNT_dec(curpad[ix]);
3422 curpad[ix] = Nullsv;
3427 AV *av = newAV(); /* Will be @_ */
3429 av_store(comppad, 0, (SV*)av);
3430 AvFLAGS(av) = AVf_REIFY;
3432 for (ix = AvFILL(comppad); ix > 0; ix--) {
3433 if (SvIMMORTAL(curpad[ix]))
3435 if (!SvPADMY(curpad[ix]))
3436 SvPADTMP_on(curpad[ix]);
3440 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3441 CvSTART(cv) = LINKLIST(CvROOT(cv));
3442 CvROOT(cv)->op_next = 0;
3448 if (perldb && curstash != debstash) {
3449 SV *sv = NEWSV(0,0);
3450 SV *tmpstr = sv_newmortal();
3451 static GV *db_postponed;
3455 sv_setpvf(sv, "%_:%ld-%ld",
3456 GvSV(curcop->cop_filegv),
3457 (long)subline, (long)curcop->cop_line);
3458 gv_efullname3(tmpstr, gv, Nullch);
3459 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3460 if (!db_postponed) {
3461 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3463 hv = GvHVn(db_postponed);
3464 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3465 && (cv = GvCV(db_postponed))) {
3470 perl_call_sv((SV*)cv, G_DISCARD);
3474 if ((s = strrchr(name,':')))
3478 if (strEQ(s, "BEGIN")) {
3479 I32 oldscope = scopestack_ix;
3481 SAVESPTR(compiling.cop_filegv);
3482 SAVEI16(compiling.cop_line);
3489 DEBUG_x( dump_sub(gv) );
3490 av_push(beginav, (SV *)cv);
3492 call_list(oldscope, beginav);
3494 curcop = &compiling;
3497 else if (strEQ(s, "END") && !error_count) {
3500 av_unshift(endav, 1);
3501 av_store(endav, 0, (SV *)cv);
3504 else if (strEQ(s, "INIT") && !error_count) {
3507 av_push(initav, SvREFCNT_inc(cv));
3519 newXSUB(name, ix, subaddr, filename)
3525 CV* cv = newXS(name, (void(*)())subaddr, filename);
3527 CvXSUBANY(cv).any_i32 = ix;
3533 newXS(name, subaddr, filename)
3535 void (*subaddr) _((CV*));
3539 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3542 if (cv = (name ? GvCV(gv) : Nullcv)) {
3544 /* just a cached method */
3548 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3549 /* already defined (or promised) */
3551 line_t oldline = curcop->cop_line;
3552 curcop->cop_line = copline;
3553 warn("Subroutine %s redefined",name);
3554 curcop->cop_line = oldline;
3561 if (cv) /* must reuse cv if autoloaded */
3564 cv = (CV*)NEWSV(1105,0);
3565 sv_upgrade((SV *)cv, SVt_PVCV);
3572 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3574 New(666, CvMUTEXP(cv), 1, perl_mutex);
3575 MUTEX_INIT(CvMUTEXP(cv));
3577 #endif /* USE_THREADS */
3578 CvFILEGV(cv) = gv_fetchfile(filename);
3579 CvXSUB(cv) = subaddr;
3582 char *s = strrchr(name,':');
3587 if (strEQ(s, "BEGIN")) {
3590 av_push(beginav, (SV *)cv);
3593 else if (strEQ(s, "END")) {
3596 av_unshift(endav, 1);
3597 av_store(endav, 0, (SV *)cv);
3600 else if (strEQ(s, "INIT")) {
3603 av_push(initav, (SV *)cv);
3613 newFORM(floor,o,block)
3625 name = SvPVx(cSVOPo->op_sv, na);
3628 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3630 if (cv = GvFORM(gv)) {
3632 line_t oldline = curcop->cop_line;
3634 curcop->cop_line = copline;
3635 warn("Format %s redefined",name);
3636 curcop->cop_line = oldline;
3642 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3643 CvFILEGV(cv) = curcop->cop_filegv;
3645 for (ix = AvFILL(comppad); ix > 0; ix--) {
3646 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3647 SvPADTMP_on(curpad[ix]);
3650 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3651 CvSTART(cv) = LINKLIST(CvROOT(cv));
3652 CvROOT(cv)->op_next = 0;
3663 return newUNOP(OP_REFGEN, 0,
3664 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3671 return newUNOP(OP_REFGEN, 0,
3672 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3676 newANONSUB(floor, proto, block)
3681 return newUNOP(OP_REFGEN, 0,
3682 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3689 switch (o->op_type) {
3691 o->op_type = OP_PADAV;
3692 o->op_ppaddr = ppaddr[OP_PADAV];
3693 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3696 o->op_type = OP_RV2AV;
3697 o->op_ppaddr = ppaddr[OP_RV2AV];
3702 warn("oops: oopsAV");
3712 switch (o->op_type) {
3715 o->op_type = OP_PADHV;
3716 o->op_ppaddr = ppaddr[OP_PADHV];
3717 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3721 o->op_type = OP_RV2HV;
3722 o->op_ppaddr = ppaddr[OP_RV2HV];
3727 warn("oops: oopsHV");
3737 if (o->op_type == OP_PADANY) {
3738 o->op_type = OP_PADAV;
3739 o->op_ppaddr = ppaddr[OP_PADAV];
3742 return newUNOP(OP_RV2AV, 0, scalar(o));
3750 if (type == OP_MAPSTART)
3751 return newUNOP(OP_NULL, 0, o);
3752 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3759 if (o->op_type == OP_PADANY) {
3760 o->op_type = OP_PADHV;
3761 o->op_ppaddr = ppaddr[OP_PADHV];
3764 return newUNOP(OP_RV2HV, 0, scalar(o));
3771 croak("NOT IMPL LINE %d",__LINE__);
3781 return newUNOP(OP_RV2CV, flags, scalar(o));
3788 if (o->op_type == OP_PADANY) {
3789 o->op_type = OP_PADSV;
3790 o->op_ppaddr = ppaddr[OP_PADSV];
3793 return newUNOP(OP_RV2SV, 0, scalar(o));
3796 /* Check routines. */
3805 name = NEWSV(1106,0);
3806 sv_upgrade(name, SVt_PVNV);
3807 sv_setpvn(name, "&", 1);
3810 ix = pad_alloc(o->op_type, SVs_PADMY);
3811 av_store(comppad_name, ix, name);
3812 av_store(comppad, ix, cSVOPo->op_sv);
3813 SvPADMY_on(cSVOPo->op_sv);
3814 cSVOPo->op_sv = Nullsv;
3815 cSVOPo->op_targ = ix;
3823 o->op_private = hints;
3831 if (cUNOPo->op_first->op_type == OP_CONCAT)
3832 o->op_flags |= OPf_STACKED;
3840 if (o->op_flags & OPf_KIDS) {
3843 OPCODE type = o->op_type;
3844 o = modkids(ck_fun(o), type);
3845 kid = cUNOPo->op_first;
3846 newop = kUNOP->op_first->op_sibling;
3848 (newop->op_sibling ||
3849 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3850 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3851 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3855 op_free(kUNOP->op_first);
3856 kUNOP->op_first = newop;
3858 o->op_ppaddr = ppaddr[++o->op_type];
3868 if (o->op_flags & OPf_KIDS) {
3869 OP *kid = cUNOPo->op_first;
3870 if (kid->op_type == OP_HSLICE)
3871 o->op_private |= OPpSLICE;
3872 else if (kid->op_type != OP_HELEM)
3873 croak("%s argument is not a HASH element or slice",
3874 op_desc[o->op_type]);
3884 I32 type = o->op_type;
3886 if (o->op_flags & OPf_KIDS) {
3887 if (cLISTOPo->op_first->op_type == OP_STUB) {
3889 o = newUNOP(type, OPf_SPECIAL,
3890 newGVOP(OP_GV, 0, gv_fetchpv("main'ARGV", TRUE, SVt_PVAV)));
3901 hints |= HINT_BLOCK_SCOPE;
3902 if (o->op_flags & OPf_KIDS) {
3903 SVOP *kid = (SVOP*)cUNOPo->op_first;
3906 o->op_flags &= ~OPf_KIDS;
3909 else if (kid->op_type == OP_LINESEQ) {
3912 kid->op_next = o->op_next;
3913 cUNOPo->op_first = 0;
3916 Newz(1101, enter, 1, LOGOP);
3917 enter->op_type = OP_ENTERTRY;
3918 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3919 enter->op_private = 0;
3921 /* establish postfix order */
3922 enter->op_next = (OP*)enter;
3924 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3925 o->op_type = OP_LEAVETRY;
3926 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3927 enter->op_other = o;
3933 o = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3935 o->op_targ = (PADOFFSET)hints;
3944 if (o->op_flags & OPf_STACKED) {
3946 kid = cUNOPo->op_first->op_sibling;
3947 if (kid->op_type == OP_RV2GV)
3960 if (o->op_flags & OPf_KIDS) {
3961 OP *kid = cUNOPo->op_first;
3962 if (kid->op_type != OP_HELEM)
3963 croak("%s argument is not a HASH element", op_desc[o->op_type]);
3973 o = fold_constants(o);
3974 if (o->op_type == OP_CONST)
3984 SVOP *kid = (SVOP*)cUNOPo->op_first;
3986 o->op_private |= (hints & HINT_STRICT_REFS);
3987 if (kid->op_type == OP_CONST) {
3992 name = SvPV(kid->op_sv, na);
3993 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3994 char *badthing = Nullch;
3995 switch (o->op_type) {
3997 badthing = "a SCALAR";
4000 badthing = "an ARRAY";
4003 badthing = "a HASH";
4008 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4011 kid->op_type = OP_GV;
4012 iscv = (o->op_type == OP_RV2CV) * 2;
4013 for (gv = 0; !gv; iscv++) {
4015 * This is a little tricky. We only want to add the symbol if we
4016 * didn't add it in the lexer. Otherwise we get duplicate strict
4017 * warnings. But if we didn't add it in the lexer, we must at
4018 * least pretend like we wanted to add it even if it existed before,
4019 * or we get possible typo warnings. OPpCONST_ENTERED says
4020 * whether the lexer already added THIS instance of this symbol.
4022 gv = gv_fetchpv(name,
4023 iscv | !(kid->op_private & OPpCONST_ENTERED),
4026 : o->op_type == OP_RV2SV
4028 : o->op_type == OP_RV2AV
4030 : o->op_type == OP_RV2HV
4034 SvREFCNT_dec(kid->op_sv);
4035 kid->op_sv = SvREFCNT_inc(gv);
4045 I32 type = o->op_type;
4047 if (o->op_flags & OPf_REF)
4050 if (o->op_flags & OPf_KIDS) {
4051 SVOP *kid = (SVOP*)cUNOPo->op_first;
4053 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4054 OP *newop = newGVOP(type, OPf_REF,
4055 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4062 if (type == OP_FTTTY)
4063 return newGVOP(type, OPf_REF, gv_fetchpv("main'STDIN", TRUE,
4066 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4080 int type = o->op_type;
4081 register I32 oa = opargs[type] >> OASHIFT;
4083 if (o->op_flags & OPf_STACKED) {
4084 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4087 return no_fh_allowed(o);
4090 if (o->op_flags & OPf_KIDS) {
4091 tokid = &cLISTOPo->op_first;
4092 kid = cLISTOPo->op_first;
4093 if (kid->op_type == OP_PUSHMARK ||
4094 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4096 tokid = &kid->op_sibling;
4097 kid = kid->op_sibling;
4099 if (!kid && opargs[type] & OA_DEFGV)
4100 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
4104 sibl = kid->op_sibling;
4118 if (kid->op_type == OP_CONST &&
4119 (kid->op_private & OPpCONST_BARE)) {
4120 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4121 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4122 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4124 warn("Array @%s missing the @ in argument %ld of %s()",
4125 name, (long)numargs, op_desc[type]);
4128 kid->op_sibling = sibl;
4131 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4132 bad_type(numargs, "array", op_desc[o->op_type], kid);
4136 if (kid->op_type == OP_CONST &&
4137 (kid->op_private & OPpCONST_BARE)) {
4138 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4139 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4140 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4142 warn("Hash %%%s missing the %% in argument %ld of %s()",
4143 name, (long)numargs, op_desc[type]);
4146 kid->op_sibling = sibl;
4149 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4150 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4155 OP *newop = newUNOP(OP_NULL, 0, kid);
4156 kid->op_sibling = 0;
4158 newop->op_next = newop;
4160 kid->op_sibling = sibl;
4165 if (kid->op_type != OP_GV) {
4166 if (kid->op_type == OP_CONST &&
4167 (kid->op_private & OPpCONST_BARE)) {
4168 OP *newop = newGVOP(OP_GV, 0,
4169 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4175 kid->op_sibling = 0;
4176 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4178 kid->op_sibling = sibl;
4184 mod(scalar(kid), type);
4188 tokid = &kid->op_sibling;
4189 kid = kid->op_sibling;
4191 o->op_private |= numargs;
4193 return too_many_arguments(o,op_desc[o->op_type]);
4196 else if (opargs[type] & OA_DEFGV) {
4198 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4202 while (oa & OA_OPTIONAL)
4204 if (oa && oa != OA_LIST)
4205 return too_few_arguments(o,op_desc[o->op_type]);
4214 GV *gv = gv_fetchpv("glob", FALSE, SVt_PVCV);
4216 if (gv && GvIMPORTED_CV(gv)) {
4217 static int glob_index;
4219 append_elem(OP_GLOB, o,
4220 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4221 o->op_type = OP_LIST;
4222 o->op_ppaddr = ppaddr[OP_LIST];
4223 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4224 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4225 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4226 append_elem(OP_LIST, o,
4227 scalar(newUNOP(OP_RV2CV, 0,
4228 newGVOP(OP_GV, 0, gv)))));
4231 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4232 append_elem(OP_GLOB, o, newSVREF(newGVOP(OP_GV, 0, defgv)));
4233 gv = newGVgen("main");
4235 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4246 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4248 o->op_ppaddr = ppaddr[OP_GREPSTART];
4249 Newz(1101, gwop, 1, LOGOP);
4251 if (o->op_flags & OPf_STACKED) {
4254 kid = cLISTOPo->op_first->op_sibling;
4255 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4258 kid->op_next = (OP*)gwop;
4259 o->op_flags &= ~OPf_STACKED;
4261 kid = cLISTOPo->op_first->op_sibling;
4262 if (type == OP_MAPWHILE)
4269 kid = cLISTOPo->op_first->op_sibling;
4270 if (kid->op_type != OP_NULL)
4271 croak("panic: ck_grep");
4272 kid = kUNOP->op_first;
4274 gwop->op_type = type;
4275 gwop->op_ppaddr = ppaddr[type];
4276 gwop->op_first = listkids(o);
4277 gwop->op_flags |= OPf_KIDS;
4278 gwop->op_private = 1;
4279 gwop->op_other = LINKLIST(kid);
4280 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4281 kid->op_next = (OP*)gwop;
4283 kid = cLISTOPo->op_first->op_sibling;
4284 if (!kid || !kid->op_sibling)
4285 return too_few_arguments(o,op_desc[o->op_type]);
4286 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4287 mod(kid, OP_GREPSTART);
4296 if (o->op_flags & OPf_KIDS) {
4297 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4298 if (kid && kid->op_type == OP_CONST)
4299 fbm_compile(((SVOP*)kid)->op_sv);
4308 /* XXX length optimization goes here */
4316 OPCODE type = o->op_type;
4317 return modkids(ck_fun(o), type);
4324 OPCODE type = o->op_type;
4325 return refkids(ck_fun(o), type);
4334 kid = cLISTOPo->op_first;
4337 kid = cLISTOPo->op_first;
4339 if (kid->op_type == OP_PUSHMARK)
4340 kid = kid->op_sibling;
4341 if (kid && o->op_flags & OPf_STACKED)
4342 kid = kid->op_sibling;
4343 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4344 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4345 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4346 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4347 cLISTOPo->op_first->op_sibling = kid;
4348 cLISTOPo->op_last = kid;
4349 kid = kid->op_sibling;
4354 append_elem(o->op_type, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4360 if (hints & HINT_LOCALE)
4361 o->op_private |= OPpLOCALE;
4375 if (hints & HINT_LOCALE)
4376 o->op_private |= OPpLOCALE;
4388 if (hints & HINT_LOCALE)
4389 o->op_private |= OPpLOCALE;
4399 o->op_private |= OPpRUNTIME;
4414 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4415 o->op_private |= OPpREPEAT_DOLIST;
4416 cBINOPo->op_first = force_list(cBINOPo->op_first);
4427 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4428 SVOP *kid = (SVOP*)cUNOPo->op_first;
4430 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4432 for (s = SvPVX(kid->op_sv); *s; s++) {
4433 if (*s == ':' && s[1] == ':') {
4435 Move(s+2, s+1, strlen(s+2)+1, char);
4436 --SvCUR(kid->op_sv);
4439 sv_catpvn(kid->op_sv, ".pm", 3);
4449 croak("NOT IMPL LINE %d",__LINE__);
4459 if (o->op_flags & OPf_KIDS) {
4460 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4461 if (kid && kid->op_sibling) {
4462 o->op_type = OP_SSELECT;
4463 o->op_ppaddr = ppaddr[OP_SSELECT];
4465 return fold_constants(o);
4469 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4470 if (kid && kid->op_type == OP_RV2GV)
4471 kid->op_private &= ~HINT_STRICT_REFS;
4479 I32 type = o->op_type;
4481 if (!(o->op_flags & OPf_KIDS)) {
4487 argop = newOP(OP_PADAV, OPf_REF);
4488 argop->op_targ = 0; /* curpad[0] is @_ */
4491 argop = newUNOP(OP_RV2AV, 0,
4492 scalar(newGVOP(OP_GV, 0,
4493 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4496 argop = newUNOP(OP_RV2AV, 0,
4497 scalar(newGVOP(OP_GV, 0, subline ?
4498 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4499 #endif /* USE_THREADS */
4500 return newUNOP(type, 0, scalar(argop));
4502 return scalar(modkids(ck_fun(o), type));
4511 if (hints & HINT_LOCALE)
4512 o->op_private |= OPpLOCALE;
4515 if (o->op_flags & OPf_STACKED) {
4516 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4518 kid = kUNOP->op_first; /* get past rv2gv */
4520 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4522 if (kid->op_type == OP_SCOPE) {
4526 else if (kid->op_type == OP_LEAVE) {
4527 if (o->op_type == OP_SORT) {
4528 null(kid); /* wipe out leave */
4531 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4532 if (k->op_next == kid)
4537 kid->op_next = 0; /* just disconnect the leave */
4538 k = kLISTOP->op_first;
4542 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4543 null(kid); /* wipe out rv2gv */
4544 if (o->op_type == OP_SORT)
4548 o->op_flags |= OPf_SPECIAL;
4562 if (o->op_flags & OPf_STACKED)
4563 return no_fh_allowed(o);
4565 kid = cLISTOPo->op_first;
4566 if (kid->op_type != OP_NULL)
4567 croak("panic: ck_split");
4568 kid = kid->op_sibling;
4569 op_free(cLISTOPo->op_first);
4570 cLISTOPo->op_first = kid;
4572 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4573 cLISTOPo->op_last = kid; /* There was only one element previously */
4576 if (kid->op_type != OP_MATCH) {
4577 OP *sibl = kid->op_sibling;
4578 kid->op_sibling = 0;
4579 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4580 if (cLISTOPo->op_first == cLISTOPo->op_last)
4581 cLISTOPo->op_last = kid;
4582 cLISTOPo->op_first = kid;
4583 kid->op_sibling = sibl;
4586 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4587 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4591 kid->op_type = OP_PUSHRE;
4592 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4595 if (!kid->op_sibling)
4596 append_elem(OP_SPLIT, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4598 kid = kid->op_sibling;
4601 if (!kid->op_sibling)
4602 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4604 kid = kid->op_sibling;
4607 if (kid->op_sibling)
4608 return too_many_arguments(o,op_desc[o->op_type]);
4618 OP *prev = ((cUNOPo->op_first->op_sibling)
4619 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4620 OP *o2 = prev->op_sibling;
4628 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4629 if (cvop->op_type == OP_RV2CV) {
4631 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4632 null(cvop); /* disable rv2cv */
4633 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4634 if (tmpop->op_type == OP_GV) {
4635 cv = GvCVu(tmpop->op_sv);
4636 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4637 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4638 proto = SvPV((SV*)cv, na);
4642 o->op_private |= (hints & HINT_STRICT_REFS);
4643 if (perldb && curstash != debstash)
4644 o->op_private |= OPpENTERSUB_DB;
4645 while (o2 != cvop) {
4649 return too_many_arguments(o, gv_ename(namegv));
4667 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4668 bad_type(arg, "block", gv_ename(namegv), o2);
4673 if (o2->op_type == OP_RV2GV)
4677 o2 = newUNOP(OP_RV2GV, 0, kid);
4678 o2->op_sibling = kid->op_sibling;
4679 kid->op_sibling = 0;
4680 prev->op_sibling = o;
4688 if (o2->op_type != OP_RV2GV)
4689 bad_type(arg, "symbol", gv_ename(namegv), o2);
4692 if (o2->op_type != OP_RV2CV)
4693 bad_type(arg, "sub", gv_ename(namegv), o2);
4696 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4697 bad_type(arg, "scalar", gv_ename(namegv), o2);
4700 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4701 bad_type(arg, "array", gv_ename(namegv), o2);
4704 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4705 bad_type(arg, "hash", gv_ename(namegv), o2);
4709 o2 = newUNOP(OP_REFGEN, 0, kid);
4710 o2->op_sibling = kid->op_sibling;
4711 kid->op_sibling = 0;
4712 prev->op_sibling = o2;
4723 croak("Malformed prototype for %s: %s",
4724 gv_ename(namegv), SvPV((SV*)cv, na));
4729 mod(o2, OP_ENTERSUB);
4731 o2 = o2->op_sibling;
4733 if (proto && !optional && *proto == '$')
4734 return too_few_arguments(o, gv_ename(namegv));
4742 SvREADONLY_on(cSVOPo->op_sv);
4750 if (o->op_flags & OPf_KIDS) {
4751 SVOP *kid = (SVOP*)cUNOPo->op_first;
4753 if (kid->op_type == OP_NULL)
4754 kid = (SVOP*)kid->op_sibling;
4756 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4757 o->op_flags |= OPf_SPECIAL;
4762 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4769 register OP* oldop = 0;
4770 if (!o || o->op_seq)
4775 for (; o; o = o->op_next) {
4781 switch (o->op_type) {
4784 curcop = ((COP*)o); /* for warnings */
4785 o->op_seq = op_seqmax++;
4796 if (o->op_next->op_type == OP_STRINGIFY)
4798 o->op_seq = op_seqmax++;
4801 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4802 o->op_seq = op_seqmax++;
4803 break; /* Scalar stub must produce undef. List stub is noop */
4807 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4808 curcop = ((COP*)op);
4814 if (oldop && o->op_next) {
4815 oldop->op_next = o->op_next;
4818 o->op_seq = op_seqmax++;
4822 if (o->op_next->op_type == OP_RV2SV) {
4823 if (!(o->op_next->op_private & OPpDEREF)) {
4825 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4826 o->op_next = o->op_next->op_next;
4827 o->op_type = OP_GVSV;
4828 o->op_ppaddr = ppaddr[OP_GVSV];
4831 else if (o->op_next->op_type == OP_RV2AV) {
4832 OP* pop = o->op_next->op_next;
4834 if (pop->op_type == OP_CONST &&
4835 (op = pop->op_next) &&
4836 pop->op_next->op_type == OP_AELEM &&
4837 !(pop->op_next->op_private &
4838 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4839 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4843 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4847 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4848 o->op_next = pop->op_next->op_next;
4849 o->op_type = OP_AELEMFAST;
4850 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4851 o->op_private = (U8)i;
4852 GvAVn(((GVOP*)o)->op_gv);
4855 o->op_seq = op_seqmax++;
4862 o->op_seq = op_seqmax++;
4863 peep(cLOGOP->op_other);
4867 o->op_seq = op_seqmax++;
4868 peep(cCONDOP->op_true);
4869 peep(cCONDOP->op_false);
4873 o->op_seq = op_seqmax++;
4874 peep(cLOOP->op_redoop);
4875 peep(cLOOP->op_nextop);
4876 peep(cLOOP->op_lastop);
4881 o->op_seq = op_seqmax++;
4882 peep(cPMOP->op_pmreplstart);
4886 o->op_seq = op_seqmax++;
4887 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4888 if (o->op_next->op_sibling &&
4889 o->op_next->op_sibling->op_type != OP_DIE) {
4890 line_t oldline = curcop->cop_line;
4892 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4893 warn("Statement unlikely to be reached");
4894 warn("(Maybe you meant system() when you said exec()?)\n");
4895 curcop->cop_line = oldline;
4909 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4910 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4912 rop = (UNOP*)((BINOP*)o)->op_first;
4913 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4915 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4916 if (!SvOBJECT(lexname))
4918 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4919 if (!fields || !GvHV(*fields))
4921 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4922 key = SvPV(*svp, keylen);
4923 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4925 croak("No such field \"%s\" in variable %s of type %s",
4926 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4928 ind = SvIV(*indsvp);
4930 croak("Bad index while coercing array into hash");
4931 rop->op_type = OP_RV2AV;
4932 rop->op_ppaddr = ppaddr[OP_RV2AV];
4933 o->op_type = OP_AELEM;
4934 o->op_ppaddr = ppaddr[OP_AELEM];
4936 *svp = newSViv(ind);
4941 o->op_seq = op_seqmax++;