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) {
1042 if (!(o->op_private & (OPpCONST_ARYBASE)))
1044 if (eval_start && eval_start->op_type == OP_CONST) {
1045 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1049 SAVEI32(compiling.cop_arybase);
1050 compiling.cop_arybase = 0;
1052 else if (type == OP_REFGEN)
1055 croak("That use of $[ is unsupported");
1058 if (o->op_flags & OPf_PARENS)
1062 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1063 !(o->op_flags & OPf_STACKED)) {
1064 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1065 o->op_ppaddr = ppaddr[OP_RV2CV];
1066 assert(cUNOPo->op_first->op_type == OP_NULL);
1067 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1073 /* grep, foreach, subcalls, refgen */
1074 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1076 yyerror(form("Can't modify %s in %s",
1077 op_desc[o->op_type],
1078 type ? op_desc[type] : "local"));
1092 case OP_RIGHT_SHIFT:
1101 if (!(o->op_flags & OPf_STACKED))
1107 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1113 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1115 return o; /* Treat \(@foo) like ordinary list. */
1119 if (scalar_mod_type(o, type))
1121 ref(cUNOPo->op_first, o->op_type);
1133 if (!type && cUNOPo->op_first->op_type != OP_GV)
1134 croak("Can't localize a reference");
1135 ref(cUNOPo->op_first, o->op_type);
1147 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1148 return o; /* Treat \(@foo) like ordinary list. */
1149 if (scalar_mod_type(o, type))
1155 croak("Can't localize lexical variable %s",
1156 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1163 if (type != OP_SASSIGN)
1169 pad_free(o->op_targ);
1170 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1171 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1172 if (o->op_flags & OPf_KIDS)
1173 mod(cBINOPo->op_first->op_sibling, type);
1178 ref(cBINOPo->op_first, o->op_type);
1179 if (type == OP_ENTERSUB &&
1180 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1181 o->op_private |= OPpLVAL_DEFER;
1188 if (o->op_flags & OPf_KIDS)
1189 mod(cLISTOPo->op_last, type);
1193 if (!(o->op_flags & OPf_KIDS))
1195 if (o->op_targ != OP_LIST) {
1196 mod(cBINOPo->op_first, type);
1201 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1205 o->op_flags |= OPf_MOD;
1207 if (type == OP_AASSIGN || type == OP_SASSIGN)
1208 o->op_flags |= OPf_SPECIAL|OPf_REF;
1210 o->op_private |= OPpLVAL_INTRO;
1211 o->op_flags &= ~OPf_SPECIAL;
1213 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1214 o->op_flags |= OPf_REF;
1219 scalar_mod_type(o, type)
1225 if (o->op_type == OP_RV2GV)
1249 case OP_RIGHT_SHIFT:
1256 case OP_ANDASSIGN: /* may work later */
1257 case OP_ORASSIGN: /* may work later */
1270 if (o && o->op_flags & OPf_KIDS) {
1271 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1284 if (!o || error_count)
1287 switch (o->op_type) {
1289 if ((type == OP_DEFINED) &&
1290 !(o->op_flags & OPf_STACKED)) {
1291 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1292 o->op_ppaddr = ppaddr[OP_RV2CV];
1293 assert(cUNOPo->op_first->op_type == OP_NULL);
1294 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1295 o->op_flags |= OPf_SPECIAL;
1300 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1304 ref(cUNOPo->op_first, o->op_type);
1307 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1308 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1309 : type == OP_RV2HV ? OPpDEREF_HV
1311 o->op_flags |= OPf_MOD;
1317 o->op_flags |= OPf_REF;
1320 ref(cUNOPo->op_first, o->op_type);
1325 o->op_flags |= OPf_REF;
1330 if (!(o->op_flags & OPf_KIDS))
1332 ref(cBINOPo->op_first, type);
1336 ref(cBINOPo->op_first, o->op_type);
1337 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1338 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1339 : type == OP_RV2HV ? OPpDEREF_HV
1341 o->op_flags |= OPf_MOD;
1349 if (!(o->op_flags & OPf_KIDS))
1351 ref(cLISTOPo->op_last, type);
1367 if (!o || error_count)
1371 if (type == OP_LIST) {
1372 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1375 else if (type != OP_PADSV &&
1378 type != OP_PUSHMARK)
1380 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1383 o->op_flags |= OPf_MOD;
1384 o->op_private |= OPpLVAL_INTRO;
1393 o->op_flags |= OPf_PARENS;
1398 bind_match(type, left, right)
1406 (left->op_type == OP_RV2AV ||
1407 left->op_type == OP_RV2HV ||
1408 left->op_type == OP_PADAV ||
1409 left->op_type == OP_PADHV)) {
1410 char *desc = op_desc[(right->op_type == OP_SUBST ||
1411 right->op_type == OP_TRANS)
1412 ? right->op_type : OP_MATCH];
1413 char *sample = ((left->op_type == OP_RV2AV ||
1414 left->op_type == OP_PADAV)
1415 ? "@array" : "%hash");
1416 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1419 if (right->op_type == OP_MATCH ||
1420 right->op_type == OP_SUBST ||
1421 right->op_type == OP_TRANS) {
1422 right->op_flags |= OPf_STACKED;
1423 if (right->op_type != OP_MATCH)
1424 left = mod(left, right->op_type);
1425 if (right->op_type == OP_TRANS)
1426 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1428 o = prepend_elem(right->op_type, scalar(left), right);
1430 return newUNOP(OP_NOT, 0, scalar(o));
1434 return bind_match(type, left,
1435 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1444 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1445 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1453 if (o->op_flags & OPf_PARENS || perldb || tainting) {
1454 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1455 o->op_type = OP_LEAVE;
1456 o->op_ppaddr = ppaddr[OP_LEAVE];
1459 if (o->op_type == OP_LINESEQ) {
1461 o->op_type = OP_SCOPE;
1462 o->op_ppaddr = ppaddr[OP_SCOPE];
1463 kid = ((LISTOP*)o)->op_first;
1464 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1465 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1470 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1481 int retval = savestack_ix;
1482 SAVEI32(comppad_name_floor);
1484 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1485 comppad_name_floor = comppad_name_fill;
1487 comppad_name_floor = 0;
1489 SAVEI32(min_intro_pending);
1490 SAVEI32(max_intro_pending);
1491 min_intro_pending = 0;
1492 SAVEI32(comppad_name_fill);
1493 SAVEI32(padix_floor);
1494 padix_floor = padix;
1495 pad_reset_pending = FALSE;
1497 hints &= ~HINT_BLOCK_SCOPE;
1502 block_end(floor, seq)
1507 int needblockscope = hints & HINT_BLOCK_SCOPE;
1508 OP* retval = scalarseq(seq);
1510 pad_reset_pending = FALSE;
1512 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1513 pad_leavemy(comppad_name_fill);
1524 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1525 eval_start = linklist(eval_root);
1526 eval_root->op_next = 0;
1532 main_root = scope(sawparens(scalarvoid(o)));
1533 curcop = &compiling;
1534 main_start = LINKLIST(main_root);
1535 main_root->op_next = 0;
1539 /* Register with debugger */
1541 CV *cv = perl_get_cv("DB::postponed", FALSE);
1545 XPUSHs((SV*)compiling.cop_filegv);
1547 perl_call_sv((SV*)cv, G_DISCARD);
1558 if (o->op_flags & OPf_PARENS)
1562 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1564 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1565 if (*s == ';' || *s == '=')
1566 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1570 in_my_stash = Nullhv;
1574 return mod(o, OP_NULL); /* a bit kludgey */
1581 if (o->op_type == OP_LIST) {
1582 o = convert(OP_JOIN, 0,
1583 prepend_elem(OP_LIST,
1584 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1596 I32 type = o->op_type;
1599 if (opargs[type] & OA_RETSCALAR)
1601 if (opargs[type] & OA_TARGET)
1602 o->op_targ = pad_alloc(type, SVs_PADTMP);
1604 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1605 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1607 if (!(opargs[type] & OA_FOLDCONST))
1611 goto nope; /* Don't try to run w/ errors */
1613 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1614 if (curop->op_type != OP_CONST &&
1615 curop->op_type != OP_LIST &&
1616 curop->op_type != OP_SCALAR &&
1617 curop->op_type != OP_NULL &&
1618 curop->op_type != OP_PUSHMARK) {
1623 curop = LINKLIST(o);
1628 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1629 pad_swipe(o->op_targ);
1630 else if (SvTEMP(sv)) { /* grab mortal temp? */
1631 (void)SvREFCNT_inc(sv);
1635 if (type == OP_RV2GV)
1636 return newGVOP(OP_GV, 0, (GV*)sv);
1638 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1640 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1645 SvIOK_off(sv); /* undo SvIV() damage */
1647 return newSVOP(OP_CONST, 0, sv);
1651 if (!(opargs[type] & OA_OTHERINT))
1654 if (!(hints & HINT_INTEGER)) {
1655 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1658 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1659 if (curop->op_type == OP_CONST) {
1660 if (SvIOK(((SVOP*)curop)->op_sv))
1664 if (opargs[curop->op_type] & OA_RETINTEGER)
1668 o->op_ppaddr = ppaddr[++(o->op_type)];
1675 gen_constant_list(o)
1680 I32 oldtmps_floor = tmps_floor;
1684 return o; /* Don't attempt to run with errors */
1686 op = curop = LINKLIST(o);
1692 tmps_floor = oldtmps_floor;
1694 o->op_type = OP_RV2AV;
1695 o->op_ppaddr = ppaddr[OP_RV2AV];
1696 curop = ((UNOP*)o)->op_first;
1697 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1704 convert(type, flags, o)
1712 if (!o || o->op_type != OP_LIST)
1713 o = newLISTOP(OP_LIST, 0, o, Nullop);
1715 o->op_flags &= ~OPf_WANT;
1717 if (!(opargs[type] & OA_MARK))
1718 null(cLISTOPo->op_first);
1721 o->op_ppaddr = ppaddr[type];
1722 o->op_flags |= flags;
1724 o = CHECKOP(type, o);
1725 if (o->op_type != type)
1728 if (cLISTOPo->op_children < 7) {
1729 /* XXX do we really need to do this if we're done appending?? */
1730 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1732 cLISTOPo->op_last = last; /* in case check substituted last arg */
1735 return fold_constants(o);
1738 /* List constructors */
1741 append_elem(type, first, last)
1752 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1753 return newLISTOP(type, 0, first, last);
1755 if (first->op_flags & OPf_KIDS)
1756 ((LISTOP*)first)->op_last->op_sibling = last;
1758 first->op_flags |= OPf_KIDS;
1759 ((LISTOP*)first)->op_first = last;
1761 ((LISTOP*)first)->op_last = last;
1762 ((LISTOP*)first)->op_children++;
1767 append_list(type, first, last)
1778 if (first->op_type != type)
1779 return prepend_elem(type, (OP*)first, (OP*)last);
1781 if (last->op_type != type)
1782 return append_elem(type, (OP*)first, (OP*)last);
1784 first->op_last->op_sibling = last->op_first;
1785 first->op_last = last->op_last;
1786 first->op_children += last->op_children;
1787 if (first->op_children)
1788 last->op_flags |= OPf_KIDS;
1795 prepend_elem(type, first, last)
1806 if (last->op_type == type) {
1807 if (type == OP_LIST) { /* already a PUSHMARK there */
1808 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1809 ((LISTOP*)last)->op_first->op_sibling = first;
1812 if (!(last->op_flags & OPf_KIDS)) {
1813 ((LISTOP*)last)->op_last = first;
1814 last->op_flags |= OPf_KIDS;
1816 first->op_sibling = ((LISTOP*)last)->op_first;
1817 ((LISTOP*)last)->op_first = first;
1819 ((LISTOP*)last)->op_children++;
1823 return newLISTOP(type, 0, first, last);
1831 return newOP(OP_STUB, 0);
1838 if (!o || o->op_type != OP_LIST)
1839 o = newLISTOP(OP_LIST, 0, o, Nullop);
1845 newLISTOP(type, flags, first, last)
1853 Newz(1101, listop, 1, LISTOP);
1855 listop->op_type = type;
1856 listop->op_ppaddr = ppaddr[type];
1857 listop->op_children = (first != 0) + (last != 0);
1858 listop->op_flags = flags;
1862 else if (!first && last)
1865 first->op_sibling = last;
1866 listop->op_first = first;
1867 listop->op_last = last;
1868 if (type == OP_LIST) {
1870 pushop = newOP(OP_PUSHMARK, 0);
1871 pushop->op_sibling = first;
1872 listop->op_first = pushop;
1873 listop->op_flags |= OPf_KIDS;
1875 listop->op_last = pushop;
1877 else if (listop->op_children)
1878 listop->op_flags |= OPf_KIDS;
1889 Newz(1101, o, 1, OP);
1891 o->op_ppaddr = ppaddr[type];
1892 o->op_flags = flags;
1895 o->op_private = 0 + (flags >> 8);
1896 if (opargs[type] & OA_RETSCALAR)
1898 if (opargs[type] & OA_TARGET)
1899 o->op_targ = pad_alloc(type, SVs_PADTMP);
1900 return CHECKOP(type, o);
1904 newUNOP(type, flags, first)
1912 first = newOP(OP_STUB, 0);
1913 if (opargs[type] & OA_MARK)
1914 first = force_list(first);
1916 Newz(1101, unop, 1, UNOP);
1917 unop->op_type = type;
1918 unop->op_ppaddr = ppaddr[type];
1919 unop->op_first = first;
1920 unop->op_flags = flags | OPf_KIDS;
1921 unop->op_private = 1 | (flags >> 8);
1923 unop = (UNOP*) CHECKOP(type, unop);
1927 return fold_constants((OP *) unop);
1931 newBINOP(type, flags, first, last)
1938 Newz(1101, binop, 1, BINOP);
1941 first = newOP(OP_NULL, 0);
1943 binop->op_type = type;
1944 binop->op_ppaddr = ppaddr[type];
1945 binop->op_first = first;
1946 binop->op_flags = flags | OPf_KIDS;
1949 binop->op_private = 1 | (flags >> 8);
1952 binop->op_private = 2 | (flags >> 8);
1953 first->op_sibling = last;
1956 binop = (BINOP*)CHECKOP(type, binop);
1960 binop->op_last = last = binop->op_first->op_sibling;
1962 return fold_constants((OP *)binop);
1966 pmtrans(o, expr, repl)
1971 SV *tstr = ((SVOP*)expr)->op_sv;
1972 SV *rstr = ((SVOP*)repl)->op_sv;
1975 register U8 *t = (U8*)SvPV(tstr, tlen);
1976 register U8 *r = (U8*)SvPV(rstr, rlen);
1981 register short *tbl;
1983 tbl = (short*)cPVOPo->op_pv;
1984 complement = o->op_private & OPpTRANS_COMPLEMENT;
1985 delete = o->op_private & OPpTRANS_DELETE;
1986 /* squash = o->op_private & OPpTRANS_SQUASH; */
1989 Zero(tbl, 256, short);
1990 for (i = 0; i < tlen; i++)
1992 for (i = 0, j = 0; i < 256; i++) {
2008 if (!rlen && !delete) {
2011 for (i = 0; i < 256; i++)
2013 for (i = 0, j = 0; i < tlen; i++,j++) {
2016 if (tbl[t[i]] == -1)
2022 if (tbl[t[i]] == -1)
2033 newPMOP(type, flags)
2040 Newz(1101, pmop, 1, PMOP);
2041 pmop->op_type = type;
2042 pmop->op_ppaddr = ppaddr[type];
2043 pmop->op_flags = flags;
2044 pmop->op_private = 0 | (flags >> 8);
2046 if (hints & HINT_LOCALE)
2047 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2049 /* link into pm list */
2050 if (type != OP_TRANS && curstash) {
2051 pmop->op_pmnext = HvPMROOT(curstash);
2052 HvPMROOT(curstash) = pmop;
2059 pmruntime(o, expr, repl)
2067 if (o->op_type == OP_TRANS)
2068 return pmtrans(o, expr, repl);
2070 hints |= HINT_BLOCK_SCOPE;
2073 if (expr->op_type == OP_CONST) {
2075 SV *pat = ((SVOP*)expr)->op_sv;
2076 char *p = SvPV(pat, plen);
2077 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2078 sv_setpvn(pat, "\\s+", 3);
2079 p = SvPV(pat, plen);
2080 pm->op_pmflags |= PMf_SKIPWHITE;
2082 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2083 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2084 pm->op_pmflags |= PMf_WHITE;
2089 if (pm->op_pmflags & PMf_KEEP)
2090 expr = newUNOP(OP_REGCMAYBE,0,expr);
2092 Newz(1101, rcop, 1, LOGOP);
2093 rcop->op_type = OP_REGCOMP;
2094 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2095 rcop->op_first = scalar(expr);
2096 rcop->op_flags |= OPf_KIDS;
2097 rcop->op_private = 1;
2100 /* establish postfix order */
2101 if (pm->op_pmflags & PMf_KEEP) {
2103 rcop->op_next = expr;
2104 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2107 rcop->op_next = LINKLIST(expr);
2108 expr->op_next = (OP*)rcop;
2111 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2116 if (pm->op_pmflags & PMf_EVAL)
2118 else if (repl->op_type == OP_CONST)
2122 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2123 if (opargs[curop->op_type] & OA_DANGEROUS) {
2124 if (curop->op_type == OP_GV) {
2125 GV *gv = ((GVOP*)curop)->op_gv;
2126 if (strchr("&`'123456789+", *GvENAME(gv)))
2129 else if (curop->op_type == OP_RV2CV)
2131 else if (curop->op_type == OP_RV2SV ||
2132 curop->op_type == OP_RV2AV ||
2133 curop->op_type == OP_RV2HV ||
2134 curop->op_type == OP_RV2GV) {
2135 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2138 else if (curop->op_type == OP_PADSV ||
2139 curop->op_type == OP_PADAV ||
2140 curop->op_type == OP_PADHV ||
2141 curop->op_type == OP_PADANY) {
2150 if (curop == repl) {
2151 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2152 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2153 prepend_elem(o->op_type, scalar(repl), o);
2156 Newz(1101, rcop, 1, LOGOP);
2157 rcop->op_type = OP_SUBSTCONT;
2158 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2159 rcop->op_first = scalar(repl);
2160 rcop->op_flags |= OPf_KIDS;
2161 rcop->op_private = 1;
2164 /* establish postfix order */
2165 rcop->op_next = LINKLIST(repl);
2166 repl->op_next = (OP*)rcop;
2168 pm->op_pmreplroot = scalar((OP*)rcop);
2169 pm->op_pmreplstart = LINKLIST(rcop);
2178 newSVOP(type, flags, sv)
2184 Newz(1101, svop, 1, SVOP);
2185 svop->op_type = type;
2186 svop->op_ppaddr = ppaddr[type];
2188 svop->op_next = (OP*)svop;
2189 svop->op_flags = flags;
2190 if (opargs[type] & OA_RETSCALAR)
2192 if (opargs[type] & OA_TARGET)
2193 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2194 return CHECKOP(type, svop);
2198 newGVOP(type, flags, gv)
2205 Newz(1101, gvop, 1, GVOP);
2206 gvop->op_type = type;
2207 gvop->op_ppaddr = ppaddr[type];
2208 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2209 gvop->op_next = (OP*)gvop;
2210 gvop->op_flags = flags;
2211 if (opargs[type] & OA_RETSCALAR)
2213 if (opargs[type] & OA_TARGET)
2214 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2215 return CHECKOP(type, gvop);
2219 newPVOP(type, flags, pv)
2225 Newz(1101, pvop, 1, PVOP);
2226 pvop->op_type = type;
2227 pvop->op_ppaddr = ppaddr[type];
2229 pvop->op_next = (OP*)pvop;
2230 pvop->op_flags = flags;
2231 if (opargs[type] & OA_RETSCALAR)
2233 if (opargs[type] & OA_TARGET)
2234 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2235 return CHECKOP(type, pvop);
2245 save_hptr(&curstash);
2246 save_item(curstname);
2251 name = SvPV(sv, len);
2252 curstash = gv_stashpvn(name,len,TRUE);
2253 sv_setpvn(curstname, name, len);
2257 sv_setpv(curstname,"<none>");
2265 utilize(aver, floor, version, id, arg)
2278 if (id->op_type != OP_CONST)
2279 croak("Module name must be constant");
2283 if(version != Nullop) {
2284 SV *vesv = ((SVOP*)version)->op_sv;
2286 if (arg == Nullop && !SvNIOK(vesv)) {
2293 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2294 croak("Version number must be constant number");
2296 /* Make copy of id so we don't free it twice */
2297 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2299 /* Fake up a method call to VERSION */
2300 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2301 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2302 append_elem(OP_LIST,
2303 prepend_elem(OP_LIST, pack, list(version)),
2304 newUNOP(OP_METHOD, 0, meth)));
2308 /* Fake up an import/unimport */
2309 if (arg && arg->op_type == OP_STUB)
2310 imop = arg; /* no import on explicit () */
2311 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2312 imop = Nullop; /* use 5.0; */
2315 /* Make copy of id so we don't free it twice */
2316 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2317 meth = newSVOP(OP_CONST, 0,
2319 ? newSVpv("import", 6)
2320 : newSVpv("unimport", 8)
2322 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2323 append_elem(OP_LIST,
2324 prepend_elem(OP_LIST, pack, list(arg)),
2325 newUNOP(OP_METHOD, 0, meth)));
2328 /* Fake up a require */
2329 rqop = newUNOP(OP_REQUIRE, 0, id);
2331 /* Fake up the BEGIN {}, which does its thing immediately. */
2333 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2335 append_elem(OP_LINESEQ,
2336 append_elem(OP_LINESEQ,
2337 newSTATEOP(0, Nullch, rqop),
2338 newSTATEOP(0, Nullch, veop)),
2339 newSTATEOP(0, Nullch, imop) ));
2346 newSLICEOP(flags, subscript, listval)
2351 return newBINOP(OP_LSLICE, flags,
2352 list(force_list(subscript)),
2353 list(force_list(listval)) );
2363 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2364 o = cUNOPo->op_first;
2366 if (o->op_type == OP_COND_EXPR) {
2367 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2368 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2373 yyerror("Assignment to both a list and a scalar");
2377 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2378 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2379 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2382 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2385 if (o->op_type == OP_RV2SV)
2392 newASSIGNOP(flags, left, optype, right)
2401 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2402 return newLOGOP(optype, 0,
2403 mod(scalar(left), optype),
2404 newUNOP(OP_SASSIGN, 0, scalar(right)));
2407 return newBINOP(optype, OPf_STACKED,
2408 mod(scalar(left), optype), scalar(right));
2412 if (list_assignment(left)) {
2414 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2415 left = mod(left, OP_AASSIGN);
2423 o = newBINOP(OP_AASSIGN, flags,
2424 list(force_list(right)),
2425 list(force_list(left)) );
2426 o->op_private = 0 | (flags >> 8);
2427 if (!(left->op_private & OPpLVAL_INTRO)) {
2428 static int generation = 100;
2432 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2433 if (opargs[curop->op_type] & OA_DANGEROUS) {
2434 if (curop->op_type == OP_GV) {
2435 GV *gv = ((GVOP*)curop)->op_gv;
2436 if (gv == defgv || SvCUR(gv) == generation)
2438 SvCUR(gv) = generation;
2440 else if (curop->op_type == OP_PADSV ||
2441 curop->op_type == OP_PADAV ||
2442 curop->op_type == OP_PADHV ||
2443 curop->op_type == OP_PADANY) {
2444 SV **svp = AvARRAY(comppad_name);
2445 SV *sv = svp[curop->op_targ];
2446 if (SvCUR(sv) == generation)
2448 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2450 else if (curop->op_type == OP_RV2CV)
2452 else if (curop->op_type == OP_RV2SV ||
2453 curop->op_type == OP_RV2AV ||
2454 curop->op_type == OP_RV2HV ||
2455 curop->op_type == OP_RV2GV) {
2456 if (lastop->op_type != OP_GV) /* funny deref? */
2465 o->op_private = OPpASSIGN_COMMON;
2467 if (right && right->op_type == OP_SPLIT) {
2469 if ((tmpop = ((LISTOP*)right)->op_first) &&
2470 tmpop->op_type == OP_PUSHRE)
2472 PMOP *pm = (PMOP*)tmpop;
2473 if (left->op_type == OP_RV2AV &&
2474 !(left->op_private & OPpLVAL_INTRO) &&
2475 !(o->op_private & OPpASSIGN_COMMON) )
2477 tmpop = ((UNOP*)left)->op_first;
2478 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2479 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2480 pm->op_pmflags |= PMf_ONCE;
2481 tmpop = cUNOPo->op_first; /* to list (nulled) */
2482 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2483 tmpop->op_sibling = Nullop; /* don't free split */
2484 right->op_next = tmpop->op_next; /* fix starting loc */
2485 op_free(o); /* blow off assign */
2486 right->op_flags &= ~OPf_WANT;
2487 /* "I don't know and I don't care." */
2492 if (modcount < 10000 &&
2493 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2495 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2497 sv_setiv(sv, modcount+1);
2505 right = newOP(OP_UNDEF, 0);
2506 if (right->op_type == OP_READLINE) {
2507 right->op_flags |= OPf_STACKED;
2508 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2511 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2512 o = newBINOP(OP_SASSIGN, flags,
2513 scalar(right), mod(scalar(left), OP_SASSIGN) );
2525 newSTATEOP(flags, label, o)
2531 U32 seq = intro_my();
2534 Newz(1101, cop, 1, COP);
2535 if (perldb && curcop->cop_line && curstash != debstash) {
2536 cop->op_type = OP_DBSTATE;
2537 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2540 cop->op_type = OP_NEXTSTATE;
2541 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2543 cop->op_flags = flags;
2544 cop->op_private = 0 | (flags >> 8);
2546 cop->op_private |= NATIVE_HINTS;
2548 cop->op_next = (OP*)cop;
2551 cop->cop_label = label;
2552 hints |= HINT_BLOCK_SCOPE;
2555 cop->cop_arybase = curcop->cop_arybase;
2557 if (copline == NOLINE)
2558 cop->cop_line = curcop->cop_line;
2560 cop->cop_line = copline;
2563 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2564 cop->cop_stash = curstash;
2566 if (perldb && curstash != debstash) {
2567 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2568 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2569 (void)SvIOK_on(*svp);
2571 SvSTASH(*svp) = (HV*)cop;
2575 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2578 /* "Introduce" my variables to visible status. */
2586 if (! min_intro_pending)
2589 svp = AvARRAY(comppad_name);
2590 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2591 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2592 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2593 SvNVX(sv) = (double)cop_seqmax;
2596 min_intro_pending = 0;
2597 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2598 return cop_seqmax++;
2602 newLOGOP(type, flags, first, other)
2612 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2613 return newBINOP(type, flags, scalar(first), scalar(other));
2615 scalarboolean(first);
2616 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2617 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2618 if (type == OP_AND || type == OP_OR) {
2624 first = cUNOPo->op_first;
2626 first->op_next = o->op_next;
2627 cUNOPo->op_first = Nullop;
2631 if (first->op_type == OP_CONST) {
2632 if (dowarn && (first->op_private & OPpCONST_BARE))
2633 warn("Probable precedence problem on %s", op_desc[type]);
2634 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2643 else if (first->op_type == OP_WANTARRAY) {
2649 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2650 OP *k1 = ((UNOP*)first)->op_first;
2651 OP *k2 = k1->op_sibling;
2653 switch (first->op_type)
2656 if (k2 && k2->op_type == OP_READLINE
2657 && (k2->op_flags & OPf_STACKED)
2658 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2659 warnop = k2->op_type;
2663 if (k1->op_type == OP_READDIR
2664 || k1->op_type == OP_GLOB
2665 || k1->op_type == OP_EACH)
2666 warnop = k1->op_type;
2670 line_t oldline = curcop->cop_line;
2671 curcop->cop_line = copline;
2672 warn("Value of %s%s can be \"0\"; test with defined()",
2674 ((warnop == OP_READLINE || warnop == OP_GLOB)
2675 ? " construct" : "() operator"));
2676 curcop->cop_line = oldline;
2683 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2684 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2686 Newz(1101, logop, 1, LOGOP);
2688 logop->op_type = type;
2689 logop->op_ppaddr = ppaddr[type];
2690 logop->op_first = first;
2691 logop->op_flags = flags | OPf_KIDS;
2692 logop->op_other = LINKLIST(other);
2693 logop->op_private = 1 | (flags >> 8);
2695 /* establish postfix order */
2696 logop->op_next = LINKLIST(first);
2697 first->op_next = (OP*)logop;
2698 first->op_sibling = other;
2700 o = newUNOP(OP_NULL, 0, (OP*)logop);
2707 newCONDOP(flags, first, trueop, falseop)
2718 return newLOGOP(OP_AND, 0, first, trueop);
2720 return newLOGOP(OP_OR, 0, first, falseop);
2722 scalarboolean(first);
2723 if (first->op_type == OP_CONST) {
2724 if (SvTRUE(((SVOP*)first)->op_sv)) {
2735 else if (first->op_type == OP_WANTARRAY) {
2739 Newz(1101, condop, 1, CONDOP);
2741 condop->op_type = OP_COND_EXPR;
2742 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2743 condop->op_first = first;
2744 condop->op_flags = flags | OPf_KIDS;
2745 condop->op_true = LINKLIST(trueop);
2746 condop->op_false = LINKLIST(falseop);
2747 condop->op_private = 1 | (flags >> 8);
2749 /* establish postfix order */
2750 condop->op_next = LINKLIST(first);
2751 first->op_next = (OP*)condop;
2753 first->op_sibling = trueop;
2754 trueop->op_sibling = falseop;
2755 o = newUNOP(OP_NULL, 0, (OP*)condop);
2757 trueop->op_next = o;
2758 falseop->op_next = o;
2764 newRANGE(flags, left, right)
2775 Newz(1101, condop, 1, CONDOP);
2777 condop->op_type = OP_RANGE;
2778 condop->op_ppaddr = ppaddr[OP_RANGE];
2779 condop->op_first = left;
2780 condop->op_flags = OPf_KIDS;
2781 condop->op_true = LINKLIST(left);
2782 condop->op_false = LINKLIST(right);
2783 condop->op_private = 1 | (flags >> 8);
2785 left->op_sibling = right;
2787 condop->op_next = (OP*)condop;
2788 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2789 flop = newUNOP(OP_FLOP, 0, flip);
2790 o = newUNOP(OP_NULL, 0, flop);
2793 left->op_next = flip;
2794 right->op_next = flop;
2796 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2797 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2798 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2799 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2801 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2802 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2805 if (!flip->op_private || !flop->op_private)
2806 linklist(o); /* blow off optimizer unless constant */
2812 newLOOPOP(flags, debuggable, expr, block)
2821 int once = block && block->op_flags & OPf_SPECIAL &&
2822 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2825 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2826 return block; /* do {} while 0 does once */
2827 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB) {
2828 expr = newUNOP(OP_DEFINED, 0,
2829 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2833 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2834 o = newLOGOP(OP_AND, 0, expr, listop);
2836 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2838 if (once && o != listop)
2839 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2842 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2844 o->op_flags |= flags;
2846 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2851 newWHILEOP(flags, debuggable, loop, expr, block, cont)
2866 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB)) {
2867 expr = newUNOP(OP_DEFINED, 0,
2868 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2872 block = newOP(OP_NULL, 0);
2875 next = LINKLIST(cont);
2877 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2879 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2880 redo = LINKLIST(listop);
2883 o = newLOGOP(OP_AND, 0, expr, scalar(listop));
2884 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2885 op_free(expr); /* oops, it's a while (0) */
2887 return Nullop; /* (listop already freed by newLOGOP) */
2889 ((LISTOP*)listop)->op_last->op_next = condop =
2890 (o == listop ? redo : LINKLIST(o));
2898 Newz(1101,loop,1,LOOP);
2899 loop->op_type = OP_ENTERLOOP;
2900 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2901 loop->op_private = 0;
2902 loop->op_next = (OP*)loop;
2905 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2907 loop->op_redoop = redo;
2908 loop->op_lastop = o;
2911 loop->op_nextop = next;
2913 loop->op_nextop = o;
2915 o->op_flags |= flags;
2916 o->op_private |= (flags >> 8);
2921 #ifndef CAN_PROTOTYPE
2922 newFOROP(flags,label,forline,sv,expr,block,cont)
2931 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2932 #endif /* CAN_PROTOTYPE */
2940 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2941 sv->op_type = OP_RV2GV;
2942 sv->op_ppaddr = ppaddr[OP_RV2GV];
2944 else if (sv->op_type == OP_PADSV) { /* private variable */
2945 padoff = sv->op_targ;
2950 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2953 sv = newGVOP(OP_GV, 0, defgv);
2955 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2956 expr = scalar(ref(expr, OP_ITER));
2957 iterflags |= OPf_STACKED;
2959 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2960 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2962 assert(!loop->op_next);
2963 Renew(loop, 1, LOOP);
2964 loop->op_targ = padoff;
2965 return newSTATEOP(0, label, newWHILEOP(flags, 1, loop,
2966 newOP(OP_ITER, 0), block, cont));
2970 newLOOPEX(type, label)
2976 if (type != OP_GOTO || label->op_type == OP_CONST) {
2977 o = newPVOP(type, 0, savepv(
2978 label->op_type == OP_CONST
2979 ? SvPVx(((SVOP*)label)->op_sv, na)
2984 if (label->op_type == OP_ENTERSUB)
2985 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2986 o = newUNOP(type, OPf_STACKED, label);
2988 hints |= HINT_BLOCK_SCOPE;
2999 MUTEX_DESTROY(CvMUTEXP(cv));
3000 Safefree(CvMUTEXP(cv));
3003 #endif /* USE_THREADS */
3005 if (!CvXSUB(cv) && CvROOT(cv)) {
3007 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3008 croak("Can't undef active subroutine");
3011 croak("Can't undef active subroutine");
3012 #endif /* USE_THREADS */
3019 op_free(CvROOT(cv));
3020 CvROOT(cv) = Nullop;
3023 SvPOK_off((SV*)cv); /* forget prototype */
3025 SvREFCNT_dec(CvGV(cv));
3027 SvREFCNT_dec(CvOUTSIDE(cv));
3028 CvOUTSIDE(cv) = Nullcv;
3029 if (CvPADLIST(cv)) {
3030 /* may be during global destruction */
3031 if (SvREFCNT(CvPADLIST(cv))) {
3032 I32 i = AvFILL(CvPADLIST(cv));
3034 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3035 SV* sv = svp ? *svp : Nullsv;
3038 if (sv == (SV*)comppad_name)
3039 comppad_name = Nullav;
3040 else if (sv == (SV*)comppad) {
3042 curpad = Null(SV**);
3046 SvREFCNT_dec((SV*)CvPADLIST(cv));
3048 CvPADLIST(cv) = Nullav;
3052 #ifdef DEBUG_CLOSURES
3057 CV *outside = CvOUTSIDE(cv);
3058 AV* padlist = CvPADLIST(cv);
3065 PerlIO_printf(Perl_debug_log, "\tCV=0x%p (%s), OUTSIDE=0x%p (%s)\n",
3067 (CvANON(cv) ? "ANON"
3068 : (cv == main_cv) ? "MAIN"
3069 : CvUNIQUE(outside) ? "UNIQUE"
3070 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3073 : CvANON(outside) ? "ANON"
3074 : (outside == main_cv) ? "MAIN"
3075 : CvUNIQUE(outside) ? "UNIQUE"
3076 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3081 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3082 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3083 pname = AvARRAY(pad_name);
3084 ppad = AvARRAY(pad);
3086 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
3087 if (SvPOK(pname[ix]))
3088 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%p (%s\"%s\" %ld-%ld)\n",
3090 SvFAKE(pname[ix]) ? "FAKE " : "",
3092 (long)I_32(SvNVX(pname[ix])),
3093 (long)SvIVX(pname[ix]));
3096 #endif /* DEBUG_CLOSURES */
3099 cv_clone2(proto, outside)
3106 AV* protopadlist = CvPADLIST(proto);
3107 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3108 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3109 SV** pname = AvARRAY(protopad_name);
3110 SV** ppad = AvARRAY(protopad);
3111 I32 fname = AvFILL(protopad_name);
3112 I32 fpad = AvFILL(protopad);
3116 assert(!CvUNIQUE(proto));
3121 SAVESPTR(comppad_name);
3124 cv = compcv = (CV*)NEWSV(1104,0);
3125 sv_upgrade((SV *)cv, SvTYPE(proto));
3131 New(666, CvMUTEXP(cv), 1, perl_mutex);
3132 MUTEX_INIT(CvMUTEXP(cv));
3134 #endif /* USE_THREADS */
3135 CvFILEGV(cv) = CvFILEGV(proto);
3136 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3137 CvSTASH(cv) = CvSTASH(proto);
3138 CvROOT(cv) = CvROOT(proto);
3139 CvSTART(cv) = CvSTART(proto);
3141 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3144 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3146 comppad_name = newAV();
3147 for (ix = fname; ix >= 0; ix--)
3148 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3152 comppadlist = newAV();
3153 AvREAL_off(comppadlist);
3154 av_store(comppadlist, 0, (SV*)comppad_name);
3155 av_store(comppadlist, 1, (SV*)comppad);
3156 CvPADLIST(cv) = comppadlist;
3157 av_fill(comppad, AvFILL(protopad));
3158 curpad = AvARRAY(comppad);
3160 av = newAV(); /* will be @_ */
3162 av_store(comppad, 0, (SV*)av);
3163 AvFLAGS(av) = AVf_REIFY;
3165 for (ix = fpad; ix > 0; ix--) {
3166 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3167 if (namesv && namesv != &sv_undef) {
3168 char *name = SvPVX(namesv); /* XXX */
3169 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3170 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3171 CvOUTSIDE(cv), cxstack_ix);
3173 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3175 croak("panic: cv_clone: %s", name);
3177 else { /* our own lexical */
3180 /* anon code -- we'll come back for it */
3181 sv = SvREFCNT_inc(ppad[ix]);
3183 else if (*name == '@')
3185 else if (*name == '%')
3195 SV* sv = NEWSV(0,0);
3201 /* Now that vars are all in place, clone nested closures. */
3203 for (ix = fpad; ix > 0; ix--) {
3204 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3206 && namesv != &sv_undef
3207 && !(SvFLAGS(namesv) & SVf_FAKE)
3208 && *SvPVX(namesv) == '&'
3209 && CvCLONE(ppad[ix]))
3211 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3212 SvREFCNT_dec(ppad[ix]);
3215 curpad[ix] = (SV*)kid;
3219 #ifdef DEBUG_CLOSURES
3220 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3222 PerlIO_printf(Perl_debug_log, " from:\n");
3224 PerlIO_printf(Perl_debug_log, " to:\n");
3236 return cv_clone2(proto, CvOUTSIDE(proto));
3240 cv_ckproto(cv, gv, p)
3245 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3246 SV* msg = sv_newmortal();
3250 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3251 sv_setpv(msg, "Prototype mismatch:");
3253 sv_catpvf(msg, " sub %_", name);
3255 sv_catpvf(msg, " (%s)", SvPVX(cv));
3256 sv_catpv(msg, " vs ");
3258 sv_catpvf(msg, "(%s)", p);
3260 sv_catpv(msg, "none");
3272 if (!cv || !SvPOK(cv) || SvCUR(cv))
3276 for (o = CvSTART(cv); o; o = o->op_next) {
3277 OPCODE type = o->op_type;
3279 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3281 if (type == OP_LEAVESUB || type == OP_RETURN)
3285 if (type == OP_CONST)
3287 else if (type == OP_PADSV) {
3288 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3289 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3290 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3302 newSUB(floor,o,proto,block)
3309 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3310 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3311 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3320 if (!name || GvCVGEN(gv))
3322 else if (cv = GvCV(gv)) {
3323 cv_ckproto(cv, gv, ps);
3324 /* already defined (or promised)? */
3325 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3328 /* just a "sub foo;" when &foo is already defined */
3332 /* ahem, death to those who redefine active sort subs */
3333 if (curstack == sortstack && sortcop == CvSTART(cv))
3334 croak("Can't redefine active sort subroutine %s", name);
3335 const_sv = cv_const_sv(cv);
3336 if (const_sv || dowarn) {
3337 line_t oldline = curcop->cop_line;
3338 curcop->cop_line = copline;
3339 warn(const_sv ? "Constant subroutine %s redefined"
3340 : "Subroutine %s redefined", name);
3341 curcop->cop_line = oldline;
3347 if (cv) { /* must reuse cv if autoloaded */
3349 CvFLAGS(cv) = CvFLAGS(compcv);
3350 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3351 CvOUTSIDE(compcv) = 0;
3352 CvPADLIST(cv) = CvPADLIST(compcv);
3353 CvPADLIST(compcv) = 0;
3354 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3355 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3356 SvREFCNT_dec(compcv);
3366 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3367 CvFILEGV(cv) = curcop->cop_filegv;
3368 CvSTASH(cv) = curstash;
3371 New(666, CvMUTEXP(cv), 1, perl_mutex);
3372 MUTEX_INIT(CvMUTEXP(cv));
3373 #endif /* USE_THREADS */
3376 sv_setpv((SV*)cv, ps);
3382 char *s = strrchr(name, ':');
3384 if (strEQ(s, "BEGIN")) {
3386 "BEGIN not safe after errors--compilation aborted";
3390 /* force display of errors found but not reported */
3391 sv_catpv(GvSV(errgv), not_safe);
3392 croak("%s", SvPVx(GvSV(errgv), na));
3403 if (AvFILL(comppad_name) < AvFILL(comppad))
3404 av_store(comppad_name, AvFILL(comppad), Nullsv);
3407 SV **namep = AvARRAY(comppad_name);
3408 for (ix = AvFILL(comppad); ix > 0; ix--) {
3411 if (SvIMMORTAL(curpad[ix]))
3414 * The only things that a clonable function needs in its
3415 * pad are references to outer lexicals and anonymous subs.
3416 * The rest are created anew during cloning.
3418 if (!((namesv = namep[ix]) != Nullsv &&
3419 namesv != &sv_undef &&
3421 *SvPVX(namesv) == '&')))
3423 SvREFCNT_dec(curpad[ix]);
3424 curpad[ix] = Nullsv;
3429 AV *av = newAV(); /* Will be @_ */
3431 av_store(comppad, 0, (SV*)av);
3432 AvFLAGS(av) = AVf_REIFY;
3434 for (ix = AvFILL(comppad); ix > 0; ix--) {
3435 if (SvIMMORTAL(curpad[ix]))
3437 if (!SvPADMY(curpad[ix]))
3438 SvPADTMP_on(curpad[ix]);
3442 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3443 CvSTART(cv) = LINKLIST(CvROOT(cv));
3444 CvROOT(cv)->op_next = 0;
3450 if (perldb && curstash != debstash) {
3451 SV *sv = NEWSV(0,0);
3452 SV *tmpstr = sv_newmortal();
3453 static GV *db_postponed;
3457 sv_setpvf(sv, "%_:%ld-%ld",
3458 GvSV(curcop->cop_filegv),
3459 (long)subline, (long)curcop->cop_line);
3460 gv_efullname3(tmpstr, gv, Nullch);
3461 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3462 if (!db_postponed) {
3463 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3465 hv = GvHVn(db_postponed);
3466 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3467 && (cv = GvCV(db_postponed))) {
3472 perl_call_sv((SV*)cv, G_DISCARD);
3476 if ((s = strrchr(name,':')))
3480 if (strEQ(s, "BEGIN")) {
3481 I32 oldscope = scopestack_ix;
3483 SAVESPTR(compiling.cop_filegv);
3484 SAVEI16(compiling.cop_line);
3491 DEBUG_x( dump_sub(gv) );
3492 av_push(beginav, (SV *)cv);
3494 call_list(oldscope, beginav);
3496 curcop = &compiling;
3499 else if (strEQ(s, "END") && !error_count) {
3502 av_unshift(endav, 1);
3503 av_store(endav, 0, (SV *)cv);
3506 else if (strEQ(s, "INIT") && !error_count) {
3509 av_push(initav, SvREFCNT_inc(cv));
3521 newXSUB(name, ix, subaddr, filename)
3527 CV* cv = newXS(name, (void(*)())subaddr, filename);
3529 CvXSUBANY(cv).any_i32 = ix;
3535 newXS(name, subaddr, filename)
3537 void (*subaddr) _((CV*));
3541 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3544 if (cv = (name ? GvCV(gv) : Nullcv)) {
3546 /* just a cached method */
3550 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3551 /* already defined (or promised) */
3553 line_t oldline = curcop->cop_line;
3554 curcop->cop_line = copline;
3555 warn("Subroutine %s redefined",name);
3556 curcop->cop_line = oldline;
3563 if (cv) /* must reuse cv if autoloaded */
3566 cv = (CV*)NEWSV(1105,0);
3567 sv_upgrade((SV *)cv, SVt_PVCV);
3574 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3576 New(666, CvMUTEXP(cv), 1, perl_mutex);
3577 MUTEX_INIT(CvMUTEXP(cv));
3579 #endif /* USE_THREADS */
3580 CvFILEGV(cv) = gv_fetchfile(filename);
3581 CvXSUB(cv) = subaddr;
3584 char *s = strrchr(name,':');
3589 if (strEQ(s, "BEGIN")) {
3592 av_push(beginav, (SV *)cv);
3595 else if (strEQ(s, "END")) {
3598 av_unshift(endav, 1);
3599 av_store(endav, 0, (SV *)cv);
3602 else if (strEQ(s, "INIT")) {
3605 av_push(initav, (SV *)cv);
3615 newFORM(floor,o,block)
3627 name = SvPVx(cSVOPo->op_sv, na);
3630 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3632 if (cv = GvFORM(gv)) {
3634 line_t oldline = curcop->cop_line;
3636 curcop->cop_line = copline;
3637 warn("Format %s redefined",name);
3638 curcop->cop_line = oldline;
3644 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3645 CvFILEGV(cv) = curcop->cop_filegv;
3647 for (ix = AvFILL(comppad); ix > 0; ix--) {
3648 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3649 SvPADTMP_on(curpad[ix]);
3652 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3653 CvSTART(cv) = LINKLIST(CvROOT(cv));
3654 CvROOT(cv)->op_next = 0;
3665 return newUNOP(OP_REFGEN, 0,
3666 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3673 return newUNOP(OP_REFGEN, 0,
3674 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3678 newANONSUB(floor, proto, block)
3683 return newUNOP(OP_REFGEN, 0,
3684 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3691 switch (o->op_type) {
3693 o->op_type = OP_PADAV;
3694 o->op_ppaddr = ppaddr[OP_PADAV];
3695 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3698 o->op_type = OP_RV2AV;
3699 o->op_ppaddr = ppaddr[OP_RV2AV];
3704 warn("oops: oopsAV");
3714 switch (o->op_type) {
3717 o->op_type = OP_PADHV;
3718 o->op_ppaddr = ppaddr[OP_PADHV];
3719 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3723 o->op_type = OP_RV2HV;
3724 o->op_ppaddr = ppaddr[OP_RV2HV];
3729 warn("oops: oopsHV");
3739 if (o->op_type == OP_PADANY) {
3740 o->op_type = OP_PADAV;
3741 o->op_ppaddr = ppaddr[OP_PADAV];
3744 return newUNOP(OP_RV2AV, 0, scalar(o));
3752 if (type == OP_MAPSTART)
3753 return newUNOP(OP_NULL, 0, o);
3754 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3761 if (o->op_type == OP_PADANY) {
3762 o->op_type = OP_PADHV;
3763 o->op_ppaddr = ppaddr[OP_PADHV];
3766 return newUNOP(OP_RV2HV, 0, scalar(o));
3773 croak("NOT IMPL LINE %d",__LINE__);
3783 return newUNOP(OP_RV2CV, flags, scalar(o));
3790 if (o->op_type == OP_PADANY) {
3791 o->op_type = OP_PADSV;
3792 o->op_ppaddr = ppaddr[OP_PADSV];
3795 return newUNOP(OP_RV2SV, 0, scalar(o));
3798 /* Check routines. */
3807 name = NEWSV(1106,0);
3808 sv_upgrade(name, SVt_PVNV);
3809 sv_setpvn(name, "&", 1);
3812 ix = pad_alloc(o->op_type, SVs_PADMY);
3813 av_store(comppad_name, ix, name);
3814 av_store(comppad, ix, cSVOPo->op_sv);
3815 SvPADMY_on(cSVOPo->op_sv);
3816 cSVOPo->op_sv = Nullsv;
3817 cSVOPo->op_targ = ix;
3825 o->op_private = hints;
3833 if (cUNOPo->op_first->op_type == OP_CONCAT)
3834 o->op_flags |= OPf_STACKED;
3842 if (o->op_flags & OPf_KIDS) {
3845 OPCODE type = o->op_type;
3846 o = modkids(ck_fun(o), type);
3847 kid = cUNOPo->op_first;
3848 newop = kUNOP->op_first->op_sibling;
3850 (newop->op_sibling ||
3851 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3852 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3853 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3857 op_free(kUNOP->op_first);
3858 kUNOP->op_first = newop;
3860 o->op_ppaddr = ppaddr[++o->op_type];
3870 if (o->op_flags & OPf_KIDS) {
3871 OP *kid = cUNOPo->op_first;
3872 if (kid->op_type == OP_HSLICE)
3873 o->op_private |= OPpSLICE;
3874 else if (kid->op_type != OP_HELEM)
3875 croak("%s argument is not a HASH element or slice",
3876 op_desc[o->op_type]);
3886 I32 type = o->op_type;
3888 if (o->op_flags & OPf_KIDS) {
3889 if (cLISTOPo->op_first->op_type == OP_STUB) {
3891 o = newUNOP(type, OPf_SPECIAL,
3892 newGVOP(OP_GV, 0, gv_fetchpv("main'ARGV", TRUE, SVt_PVAV)));
3903 hints |= HINT_BLOCK_SCOPE;
3904 if (o->op_flags & OPf_KIDS) {
3905 SVOP *kid = (SVOP*)cUNOPo->op_first;
3908 o->op_flags &= ~OPf_KIDS;
3911 else if (kid->op_type == OP_LINESEQ) {
3914 kid->op_next = o->op_next;
3915 cUNOPo->op_first = 0;
3918 Newz(1101, enter, 1, LOGOP);
3919 enter->op_type = OP_ENTERTRY;
3920 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3921 enter->op_private = 0;
3923 /* establish postfix order */
3924 enter->op_next = (OP*)enter;
3926 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3927 o->op_type = OP_LEAVETRY;
3928 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3929 enter->op_other = o;
3935 o = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3937 o->op_targ = (PADOFFSET)hints;
3946 if (o->op_flags & OPf_STACKED) {
3948 kid = cUNOPo->op_first->op_sibling;
3949 if (kid->op_type == OP_RV2GV)
3962 if (o->op_flags & OPf_KIDS) {
3963 OP *kid = cUNOPo->op_first;
3964 if (kid->op_type != OP_HELEM)
3965 croak("%s argument is not a HASH element", op_desc[o->op_type]);
3975 o = fold_constants(o);
3976 if (o->op_type == OP_CONST)
3986 SVOP *kid = (SVOP*)cUNOPo->op_first;
3988 o->op_private |= (hints & HINT_STRICT_REFS);
3989 if (kid->op_type == OP_CONST) {
3994 name = SvPV(kid->op_sv, na);
3995 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3996 char *badthing = Nullch;
3997 switch (o->op_type) {
3999 badthing = "a SCALAR";
4002 badthing = "an ARRAY";
4005 badthing = "a HASH";
4010 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4013 kid->op_type = OP_GV;
4014 iscv = (o->op_type == OP_RV2CV) * 2;
4015 for (gv = 0; !gv; iscv++) {
4017 * This is a little tricky. We only want to add the symbol if we
4018 * didn't add it in the lexer. Otherwise we get duplicate strict
4019 * warnings. But if we didn't add it in the lexer, we must at
4020 * least pretend like we wanted to add it even if it existed before,
4021 * or we get possible typo warnings. OPpCONST_ENTERED says
4022 * whether the lexer already added THIS instance of this symbol.
4024 gv = gv_fetchpv(name,
4025 iscv | !(kid->op_private & OPpCONST_ENTERED),
4028 : o->op_type == OP_RV2SV
4030 : o->op_type == OP_RV2AV
4032 : o->op_type == OP_RV2HV
4036 SvREFCNT_dec(kid->op_sv);
4037 kid->op_sv = SvREFCNT_inc(gv);
4047 I32 type = o->op_type;
4049 if (o->op_flags & OPf_REF)
4052 if (o->op_flags & OPf_KIDS) {
4053 SVOP *kid = (SVOP*)cUNOPo->op_first;
4055 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4056 OP *newop = newGVOP(type, OPf_REF,
4057 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4064 if (type == OP_FTTTY)
4065 return newGVOP(type, OPf_REF, gv_fetchpv("main'STDIN", TRUE,
4068 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4082 int type = o->op_type;
4083 register I32 oa = opargs[type] >> OASHIFT;
4085 if (o->op_flags & OPf_STACKED) {
4086 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4089 return no_fh_allowed(o);
4092 if (o->op_flags & OPf_KIDS) {
4093 tokid = &cLISTOPo->op_first;
4094 kid = cLISTOPo->op_first;
4095 if (kid->op_type == OP_PUSHMARK ||
4096 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4098 tokid = &kid->op_sibling;
4099 kid = kid->op_sibling;
4101 if (!kid && opargs[type] & OA_DEFGV)
4102 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
4106 sibl = kid->op_sibling;
4120 if (kid->op_type == OP_CONST &&
4121 (kid->op_private & OPpCONST_BARE)) {
4122 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4123 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4124 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4126 warn("Array @%s missing the @ in argument %ld of %s()",
4127 name, (long)numargs, op_desc[type]);
4130 kid->op_sibling = sibl;
4133 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4134 bad_type(numargs, "array", op_desc[o->op_type], kid);
4138 if (kid->op_type == OP_CONST &&
4139 (kid->op_private & OPpCONST_BARE)) {
4140 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4141 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4142 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4144 warn("Hash %%%s missing the %% in argument %ld of %s()",
4145 name, (long)numargs, op_desc[type]);
4148 kid->op_sibling = sibl;
4151 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4152 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4157 OP *newop = newUNOP(OP_NULL, 0, kid);
4158 kid->op_sibling = 0;
4160 newop->op_next = newop;
4162 kid->op_sibling = sibl;
4167 if (kid->op_type != OP_GV) {
4168 if (kid->op_type == OP_CONST &&
4169 (kid->op_private & OPpCONST_BARE)) {
4170 OP *newop = newGVOP(OP_GV, 0,
4171 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4177 kid->op_sibling = 0;
4178 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4180 kid->op_sibling = sibl;
4186 mod(scalar(kid), type);
4190 tokid = &kid->op_sibling;
4191 kid = kid->op_sibling;
4193 o->op_private |= numargs;
4195 return too_many_arguments(o,op_desc[o->op_type]);
4198 else if (opargs[type] & OA_DEFGV) {
4200 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4204 while (oa & OA_OPTIONAL)
4206 if (oa && oa != OA_LIST)
4207 return too_few_arguments(o,op_desc[o->op_type]);
4216 GV *gv = gv_fetchpv("glob", FALSE, SVt_PVCV);
4218 if (gv && GvIMPORTED_CV(gv)) {
4219 static int glob_index;
4221 append_elem(OP_GLOB, o,
4222 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4223 o->op_type = OP_LIST;
4224 o->op_ppaddr = ppaddr[OP_LIST];
4225 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4226 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4227 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4228 append_elem(OP_LIST, o,
4229 scalar(newUNOP(OP_RV2CV, 0,
4230 newGVOP(OP_GV, 0, gv)))));
4233 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4234 append_elem(OP_GLOB, o, newSVREF(newGVOP(OP_GV, 0, defgv)));
4235 gv = newGVgen("main");
4237 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4248 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4250 o->op_ppaddr = ppaddr[OP_GREPSTART];
4251 Newz(1101, gwop, 1, LOGOP);
4253 if (o->op_flags & OPf_STACKED) {
4256 kid = cLISTOPo->op_first->op_sibling;
4257 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4260 kid->op_next = (OP*)gwop;
4261 o->op_flags &= ~OPf_STACKED;
4263 kid = cLISTOPo->op_first->op_sibling;
4264 if (type == OP_MAPWHILE)
4271 kid = cLISTOPo->op_first->op_sibling;
4272 if (kid->op_type != OP_NULL)
4273 croak("panic: ck_grep");
4274 kid = kUNOP->op_first;
4276 gwop->op_type = type;
4277 gwop->op_ppaddr = ppaddr[type];
4278 gwop->op_first = listkids(o);
4279 gwop->op_flags |= OPf_KIDS;
4280 gwop->op_private = 1;
4281 gwop->op_other = LINKLIST(kid);
4282 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4283 kid->op_next = (OP*)gwop;
4285 kid = cLISTOPo->op_first->op_sibling;
4286 if (!kid || !kid->op_sibling)
4287 return too_few_arguments(o,op_desc[o->op_type]);
4288 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4289 mod(kid, OP_GREPSTART);
4298 if (o->op_flags & OPf_KIDS) {
4299 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4300 if (kid && kid->op_type == OP_CONST)
4301 fbm_compile(((SVOP*)kid)->op_sv);
4310 /* XXX length optimization goes here */
4318 OPCODE type = o->op_type;
4319 return modkids(ck_fun(o), type);
4326 OPCODE type = o->op_type;
4327 return refkids(ck_fun(o), type);
4336 kid = cLISTOPo->op_first;
4339 kid = cLISTOPo->op_first;
4341 if (kid->op_type == OP_PUSHMARK)
4342 kid = kid->op_sibling;
4343 if (kid && o->op_flags & OPf_STACKED)
4344 kid = kid->op_sibling;
4345 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4346 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4347 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4348 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4349 cLISTOPo->op_first->op_sibling = kid;
4350 cLISTOPo->op_last = kid;
4351 kid = kid->op_sibling;
4356 append_elem(o->op_type, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4362 if (hints & HINT_LOCALE)
4363 o->op_private |= OPpLOCALE;
4377 if (hints & HINT_LOCALE)
4378 o->op_private |= OPpLOCALE;
4390 if (hints & HINT_LOCALE)
4391 o->op_private |= OPpLOCALE;
4401 o->op_private |= OPpRUNTIME;
4416 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4417 o->op_private |= OPpREPEAT_DOLIST;
4418 cBINOPo->op_first = force_list(cBINOPo->op_first);
4429 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4430 SVOP *kid = (SVOP*)cUNOPo->op_first;
4432 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4434 for (s = SvPVX(kid->op_sv); *s; s++) {
4435 if (*s == ':' && s[1] == ':') {
4437 Move(s+2, s+1, strlen(s+2)+1, char);
4438 --SvCUR(kid->op_sv);
4441 sv_catpvn(kid->op_sv, ".pm", 3);
4451 croak("NOT IMPL LINE %d",__LINE__);
4461 if (o->op_flags & OPf_KIDS) {
4462 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4463 if (kid && kid->op_sibling) {
4464 o->op_type = OP_SSELECT;
4465 o->op_ppaddr = ppaddr[OP_SSELECT];
4467 return fold_constants(o);
4471 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4472 if (kid && kid->op_type == OP_RV2GV)
4473 kid->op_private &= ~HINT_STRICT_REFS;
4481 I32 type = o->op_type;
4483 if (!(o->op_flags & OPf_KIDS)) {
4489 argop = newOP(OP_PADAV, OPf_REF);
4490 argop->op_targ = 0; /* curpad[0] is @_ */
4493 argop = newUNOP(OP_RV2AV, 0,
4494 scalar(newGVOP(OP_GV, 0,
4495 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4498 argop = newUNOP(OP_RV2AV, 0,
4499 scalar(newGVOP(OP_GV, 0, subline ?
4500 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4501 #endif /* USE_THREADS */
4502 return newUNOP(type, 0, scalar(argop));
4504 return scalar(modkids(ck_fun(o), type));
4513 if (hints & HINT_LOCALE)
4514 o->op_private |= OPpLOCALE;
4517 if (o->op_flags & OPf_STACKED) {
4518 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4520 kid = kUNOP->op_first; /* get past rv2gv */
4522 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4524 if (kid->op_type == OP_SCOPE) {
4528 else if (kid->op_type == OP_LEAVE) {
4529 if (o->op_type == OP_SORT) {
4530 null(kid); /* wipe out leave */
4533 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4534 if (k->op_next == kid)
4539 kid->op_next = 0; /* just disconnect the leave */
4540 k = kLISTOP->op_first;
4544 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4545 null(kid); /* wipe out rv2gv */
4546 if (o->op_type == OP_SORT)
4550 o->op_flags |= OPf_SPECIAL;
4564 if (o->op_flags & OPf_STACKED)
4565 return no_fh_allowed(o);
4567 kid = cLISTOPo->op_first;
4568 if (kid->op_type != OP_NULL)
4569 croak("panic: ck_split");
4570 kid = kid->op_sibling;
4571 op_free(cLISTOPo->op_first);
4572 cLISTOPo->op_first = kid;
4574 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4575 cLISTOPo->op_last = kid; /* There was only one element previously */
4578 if (kid->op_type != OP_MATCH) {
4579 OP *sibl = kid->op_sibling;
4580 kid->op_sibling = 0;
4581 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4582 if (cLISTOPo->op_first == cLISTOPo->op_last)
4583 cLISTOPo->op_last = kid;
4584 cLISTOPo->op_first = kid;
4585 kid->op_sibling = sibl;
4588 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4589 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4593 kid->op_type = OP_PUSHRE;
4594 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4597 if (!kid->op_sibling)
4598 append_elem(OP_SPLIT, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4600 kid = kid->op_sibling;
4603 if (!kid->op_sibling)
4604 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4606 kid = kid->op_sibling;
4609 if (kid->op_sibling)
4610 return too_many_arguments(o,op_desc[o->op_type]);
4620 OP *prev = ((cUNOPo->op_first->op_sibling)
4621 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4622 OP *o2 = prev->op_sibling;
4630 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4631 if (cvop->op_type == OP_RV2CV) {
4633 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4634 null(cvop); /* disable rv2cv */
4635 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4636 if (tmpop->op_type == OP_GV) {
4637 cv = GvCVu(tmpop->op_sv);
4638 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4639 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4640 proto = SvPV((SV*)cv, na);
4644 o->op_private |= (hints & HINT_STRICT_REFS);
4645 if (perldb && curstash != debstash)
4646 o->op_private |= OPpENTERSUB_DB;
4647 while (o2 != cvop) {
4651 return too_many_arguments(o, gv_ename(namegv));
4669 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4670 bad_type(arg, "block", gv_ename(namegv), o2);
4675 if (o2->op_type == OP_RV2GV)
4679 o2 = newUNOP(OP_RV2GV, 0, kid);
4680 o2->op_sibling = kid->op_sibling;
4681 kid->op_sibling = 0;
4682 prev->op_sibling = o;
4690 if (o2->op_type != OP_RV2GV)
4691 bad_type(arg, "symbol", gv_ename(namegv), o2);
4694 if (o2->op_type != OP_RV2CV)
4695 bad_type(arg, "sub", gv_ename(namegv), o2);
4698 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4699 bad_type(arg, "scalar", gv_ename(namegv), o2);
4702 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4703 bad_type(arg, "array", gv_ename(namegv), o2);
4706 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4707 bad_type(arg, "hash", gv_ename(namegv), o2);
4711 o2 = newUNOP(OP_REFGEN, 0, kid);
4712 o2->op_sibling = kid->op_sibling;
4713 kid->op_sibling = 0;
4714 prev->op_sibling = o2;
4725 croak("Malformed prototype for %s: %s",
4726 gv_ename(namegv), SvPV((SV*)cv, na));
4731 mod(o2, OP_ENTERSUB);
4733 o2 = o2->op_sibling;
4735 if (proto && !optional && *proto == '$')
4736 return too_few_arguments(o, gv_ename(namegv));
4744 SvREADONLY_on(cSVOPo->op_sv);
4752 if (o->op_flags & OPf_KIDS) {
4753 SVOP *kid = (SVOP*)cUNOPo->op_first;
4755 if (kid->op_type == OP_NULL)
4756 kid = (SVOP*)kid->op_sibling;
4758 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4759 o->op_flags |= OPf_SPECIAL;
4764 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4771 register OP* oldop = 0;
4772 if (!o || o->op_seq)
4777 for (; o; o = o->op_next) {
4783 switch (o->op_type) {
4786 curcop = ((COP*)o); /* for warnings */
4787 o->op_seq = op_seqmax++;
4798 if (o->op_next->op_type == OP_STRINGIFY)
4800 o->op_seq = op_seqmax++;
4803 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4804 o->op_seq = op_seqmax++;
4805 break; /* Scalar stub must produce undef. List stub is noop */
4809 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4810 curcop = ((COP*)op);
4816 if (oldop && o->op_next) {
4817 oldop->op_next = o->op_next;
4820 o->op_seq = op_seqmax++;
4824 if (o->op_next->op_type == OP_RV2SV) {
4825 if (!(o->op_next->op_private & OPpDEREF)) {
4827 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4828 o->op_next = o->op_next->op_next;
4829 o->op_type = OP_GVSV;
4830 o->op_ppaddr = ppaddr[OP_GVSV];
4833 else if (o->op_next->op_type == OP_RV2AV) {
4834 OP* pop = o->op_next->op_next;
4836 if (pop->op_type == OP_CONST &&
4837 (op = pop->op_next) &&
4838 pop->op_next->op_type == OP_AELEM &&
4839 !(pop->op_next->op_private &
4840 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4841 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4845 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4849 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4850 o->op_next = pop->op_next->op_next;
4851 o->op_type = OP_AELEMFAST;
4852 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4853 o->op_private = (U8)i;
4854 GvAVn(((GVOP*)o)->op_gv);
4857 o->op_seq = op_seqmax++;
4864 o->op_seq = op_seqmax++;
4865 peep(cLOGOP->op_other);
4869 o->op_seq = op_seqmax++;
4870 peep(cCONDOP->op_true);
4871 peep(cCONDOP->op_false);
4875 o->op_seq = op_seqmax++;
4876 peep(cLOOP->op_redoop);
4877 peep(cLOOP->op_nextop);
4878 peep(cLOOP->op_lastop);
4883 o->op_seq = op_seqmax++;
4884 peep(cPMOP->op_pmreplstart);
4888 o->op_seq = op_seqmax++;
4889 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4890 if (o->op_next->op_sibling &&
4891 o->op_next->op_sibling->op_type != OP_DIE) {
4892 line_t oldline = curcop->cop_line;
4894 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4895 warn("Statement unlikely to be reached");
4896 warn("(Maybe you meant system() when you said exec()?)\n");
4897 curcop->cop_line = oldline;
4911 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4912 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4914 rop = (UNOP*)((BINOP*)o)->op_first;
4915 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4917 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4918 if (!SvOBJECT(lexname))
4920 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4921 if (!fields || !GvHV(*fields))
4923 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4924 key = SvPV(*svp, keylen);
4925 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4927 croak("No such field \"%s\" in variable %s of type %s",
4928 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4930 ind = SvIV(*indsvp);
4932 croak("Bad index while coercing array into hash");
4933 rop->op_type = OP_RV2AV;
4934 rop->op_ppaddr = ppaddr[OP_RV2AV];
4935 o->op_type = OP_AELEM;
4936 o->op_ppaddr = ppaddr[OP_AELEM];
4938 *svp = newSViv(ind);
4943 o->op_seq = op_seqmax++;