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 (dowarn && 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 && cUNOPo->op_first->op_type != OP_GV)
1114 croak("Can't localize through a reference");
1115 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1117 return o; /* Treat \(@foo) like ordinary list. */
1121 if (scalar_mod_type(o, type))
1123 ref(cUNOPo->op_first, o->op_type);
1135 if (!type && cUNOPo->op_first->op_type != OP_GV)
1136 croak("Can't localize through a reference");
1137 ref(cUNOPo->op_first, o->op_type);
1149 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1150 return o; /* Treat \(@foo) like ordinary list. */
1151 if (scalar_mod_type(o, type))
1157 croak("Can't localize lexical variable %s",
1158 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1165 if (type != OP_SASSIGN)
1171 pad_free(o->op_targ);
1172 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1173 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1174 if (o->op_flags & OPf_KIDS)
1175 mod(cBINOPo->op_first->op_sibling, type);
1180 ref(cBINOPo->op_first, o->op_type);
1181 if (type == OP_ENTERSUB &&
1182 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1183 o->op_private |= OPpLVAL_DEFER;
1190 if (o->op_flags & OPf_KIDS)
1191 mod(cLISTOPo->op_last, type);
1195 if (!(o->op_flags & OPf_KIDS))
1197 if (o->op_targ != OP_LIST) {
1198 mod(cBINOPo->op_first, type);
1203 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1207 o->op_flags |= OPf_MOD;
1209 if (type == OP_AASSIGN || type == OP_SASSIGN)
1210 o->op_flags |= OPf_SPECIAL|OPf_REF;
1212 o->op_private |= OPpLVAL_INTRO;
1213 o->op_flags &= ~OPf_SPECIAL;
1215 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1216 o->op_flags |= OPf_REF;
1221 scalar_mod_type(o, type)
1227 if (o->op_type == OP_RV2GV)
1251 case OP_RIGHT_SHIFT:
1258 case OP_ANDASSIGN: /* may work later */
1259 case OP_ORASSIGN: /* may work later */
1272 if (o && o->op_flags & OPf_KIDS) {
1273 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1286 if (!o || error_count)
1289 switch (o->op_type) {
1291 if ((type == OP_DEFINED || type == OP_LOCK) &&
1292 !(o->op_flags & OPf_STACKED)) {
1293 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1294 o->op_ppaddr = ppaddr[OP_RV2CV];
1295 assert(cUNOPo->op_first->op_type == OP_NULL);
1296 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1297 o->op_flags |= OPf_SPECIAL;
1302 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1306 ref(cUNOPo->op_first, o->op_type);
1309 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1310 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1311 : type == OP_RV2HV ? OPpDEREF_HV
1313 o->op_flags |= OPf_MOD;
1319 o->op_flags |= OPf_REF;
1322 ref(cUNOPo->op_first, o->op_type);
1327 o->op_flags |= OPf_REF;
1332 if (!(o->op_flags & OPf_KIDS))
1334 ref(cBINOPo->op_first, type);
1338 ref(cBINOPo->op_first, o->op_type);
1339 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1340 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1341 : type == OP_RV2HV ? OPpDEREF_HV
1343 o->op_flags |= OPf_MOD;
1351 if (!(o->op_flags & OPf_KIDS))
1353 ref(cLISTOPo->op_last, type);
1369 if (!o || error_count)
1373 if (type == OP_LIST) {
1374 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1377 else if (type != OP_PADSV &&
1380 type != OP_PUSHMARK)
1382 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1385 o->op_flags |= OPf_MOD;
1386 o->op_private |= OPpLVAL_INTRO;
1395 o->op_flags |= OPf_PARENS;
1400 bind_match(type, left, right)
1408 (left->op_type == OP_RV2AV ||
1409 left->op_type == OP_RV2HV ||
1410 left->op_type == OP_PADAV ||
1411 left->op_type == OP_PADHV)) {
1412 char *desc = op_desc[(right->op_type == OP_SUBST ||
1413 right->op_type == OP_TRANS)
1414 ? right->op_type : OP_MATCH];
1415 char *sample = ((left->op_type == OP_RV2AV ||
1416 left->op_type == OP_PADAV)
1417 ? "@array" : "%hash");
1418 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1421 if (right->op_type == OP_MATCH ||
1422 right->op_type == OP_SUBST ||
1423 right->op_type == OP_TRANS) {
1424 right->op_flags |= OPf_STACKED;
1425 if (right->op_type != OP_MATCH)
1426 left = mod(left, right->op_type);
1427 if (right->op_type == OP_TRANS)
1428 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1430 o = prepend_elem(right->op_type, scalar(left), right);
1432 return newUNOP(OP_NOT, 0, scalar(o));
1436 return bind_match(type, left,
1437 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1446 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1447 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1455 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1456 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1457 o->op_type = OP_LEAVE;
1458 o->op_ppaddr = ppaddr[OP_LEAVE];
1461 if (o->op_type == OP_LINESEQ) {
1463 o->op_type = OP_SCOPE;
1464 o->op_ppaddr = ppaddr[OP_SCOPE];
1465 kid = ((LISTOP*)o)->op_first;
1466 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1467 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1472 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1483 int retval = savestack_ix;
1484 SAVEI32(comppad_name_floor);
1486 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1487 comppad_name_floor = comppad_name_fill;
1489 comppad_name_floor = 0;
1491 SAVEI32(min_intro_pending);
1492 SAVEI32(max_intro_pending);
1493 min_intro_pending = 0;
1494 SAVEI32(comppad_name_fill);
1495 SAVEI32(padix_floor);
1496 padix_floor = padix;
1497 pad_reset_pending = FALSE;
1499 hints &= ~HINT_BLOCK_SCOPE;
1504 block_end(floor, seq)
1509 int needblockscope = hints & HINT_BLOCK_SCOPE;
1510 OP* retval = scalarseq(seq);
1512 pad_reset_pending = FALSE;
1514 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1515 pad_leavemy(comppad_name_fill);
1526 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1527 eval_start = linklist(eval_root);
1528 eval_root->op_next = 0;
1534 main_root = scope(sawparens(scalarvoid(o)));
1535 curcop = &compiling;
1536 main_start = LINKLIST(main_root);
1537 main_root->op_next = 0;
1541 /* Register with debugger */
1543 CV *cv = perl_get_cv("DB::postponed", FALSE);
1547 XPUSHs((SV*)compiling.cop_filegv);
1549 perl_call_sv((SV*)cv, G_DISCARD);
1560 if (o->op_flags & OPf_PARENS)
1564 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1566 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1567 if (*s == ';' || *s == '=')
1568 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1572 in_my_stash = Nullhv;
1576 return mod(o, OP_NULL); /* a bit kludgey */
1583 if (o->op_type == OP_LIST) {
1584 o = convert(OP_JOIN, 0,
1585 prepend_elem(OP_LIST,
1586 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1598 I32 type = o->op_type;
1601 if (opargs[type] & OA_RETSCALAR)
1603 if (opargs[type] & OA_TARGET)
1604 o->op_targ = pad_alloc(type, SVs_PADTMP);
1606 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1607 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1609 if (!(opargs[type] & OA_FOLDCONST))
1618 if (o->op_private & OPpLOCALE)
1623 goto nope; /* Don't try to run w/ errors */
1625 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1626 if (curop->op_type != OP_CONST &&
1627 curop->op_type != OP_LIST &&
1628 curop->op_type != OP_SCALAR &&
1629 curop->op_type != OP_NULL &&
1630 curop->op_type != OP_PUSHMARK) {
1635 curop = LINKLIST(o);
1640 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1641 pad_swipe(o->op_targ);
1642 else if (SvTEMP(sv)) { /* grab mortal temp? */
1643 (void)SvREFCNT_inc(sv);
1647 if (type == OP_RV2GV)
1648 return newGVOP(OP_GV, 0, (GV*)sv);
1650 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1652 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1657 SvIOK_off(sv); /* undo SvIV() damage */
1659 return newSVOP(OP_CONST, 0, sv);
1663 if (!(opargs[type] & OA_OTHERINT))
1666 if (!(hints & HINT_INTEGER)) {
1667 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1670 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1671 if (curop->op_type == OP_CONST) {
1672 if (SvIOK(((SVOP*)curop)->op_sv))
1676 if (opargs[curop->op_type] & OA_RETINTEGER)
1680 o->op_ppaddr = ppaddr[++(o->op_type)];
1687 gen_constant_list(o)
1692 I32 oldtmps_floor = tmps_floor;
1696 return o; /* Don't attempt to run with errors */
1698 op = curop = LINKLIST(o);
1704 tmps_floor = oldtmps_floor;
1706 o->op_type = OP_RV2AV;
1707 o->op_ppaddr = ppaddr[OP_RV2AV];
1708 curop = ((UNOP*)o)->op_first;
1709 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1716 convert(type, flags, o)
1724 if (!o || o->op_type != OP_LIST)
1725 o = newLISTOP(OP_LIST, 0, o, Nullop);
1727 o->op_flags &= ~OPf_WANT;
1729 if (!(opargs[type] & OA_MARK))
1730 null(cLISTOPo->op_first);
1733 o->op_ppaddr = ppaddr[type];
1734 o->op_flags |= flags;
1736 o = CHECKOP(type, o);
1737 if (o->op_type != type)
1740 if (cLISTOPo->op_children < 7) {
1741 /* XXX do we really need to do this if we're done appending?? */
1742 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1744 cLISTOPo->op_last = last; /* in case check substituted last arg */
1747 return fold_constants(o);
1750 /* List constructors */
1753 append_elem(type, first, last)
1764 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1765 return newLISTOP(type, 0, first, last);
1767 if (first->op_flags & OPf_KIDS)
1768 ((LISTOP*)first)->op_last->op_sibling = last;
1770 first->op_flags |= OPf_KIDS;
1771 ((LISTOP*)first)->op_first = last;
1773 ((LISTOP*)first)->op_last = last;
1774 ((LISTOP*)first)->op_children++;
1779 append_list(type, first, last)
1790 if (first->op_type != type)
1791 return prepend_elem(type, (OP*)first, (OP*)last);
1793 if (last->op_type != type)
1794 return append_elem(type, (OP*)first, (OP*)last);
1796 first->op_last->op_sibling = last->op_first;
1797 first->op_last = last->op_last;
1798 first->op_children += last->op_children;
1799 if (first->op_children)
1800 last->op_flags |= OPf_KIDS;
1807 prepend_elem(type, first, last)
1818 if (last->op_type == type) {
1819 if (type == OP_LIST) { /* already a PUSHMARK there */
1820 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1821 ((LISTOP*)last)->op_first->op_sibling = first;
1824 if (!(last->op_flags & OPf_KIDS)) {
1825 ((LISTOP*)last)->op_last = first;
1826 last->op_flags |= OPf_KIDS;
1828 first->op_sibling = ((LISTOP*)last)->op_first;
1829 ((LISTOP*)last)->op_first = first;
1831 ((LISTOP*)last)->op_children++;
1835 return newLISTOP(type, 0, first, last);
1843 return newOP(OP_STUB, 0);
1850 if (!o || o->op_type != OP_LIST)
1851 o = newLISTOP(OP_LIST, 0, o, Nullop);
1857 newLISTOP(type, flags, first, last)
1865 Newz(1101, listop, 1, LISTOP);
1867 listop->op_type = type;
1868 listop->op_ppaddr = ppaddr[type];
1869 listop->op_children = (first != 0) + (last != 0);
1870 listop->op_flags = flags;
1874 else if (!first && last)
1877 first->op_sibling = last;
1878 listop->op_first = first;
1879 listop->op_last = last;
1880 if (type == OP_LIST) {
1882 pushop = newOP(OP_PUSHMARK, 0);
1883 pushop->op_sibling = first;
1884 listop->op_first = pushop;
1885 listop->op_flags |= OPf_KIDS;
1887 listop->op_last = pushop;
1889 else if (listop->op_children)
1890 listop->op_flags |= OPf_KIDS;
1901 Newz(1101, o, 1, OP);
1903 o->op_ppaddr = ppaddr[type];
1904 o->op_flags = flags;
1907 o->op_private = 0 + (flags >> 8);
1908 if (opargs[type] & OA_RETSCALAR)
1910 if (opargs[type] & OA_TARGET)
1911 o->op_targ = pad_alloc(type, SVs_PADTMP);
1912 return CHECKOP(type, o);
1916 newUNOP(type, flags, first)
1924 first = newOP(OP_STUB, 0);
1925 if (opargs[type] & OA_MARK)
1926 first = force_list(first);
1928 Newz(1101, unop, 1, UNOP);
1929 unop->op_type = type;
1930 unop->op_ppaddr = ppaddr[type];
1931 unop->op_first = first;
1932 unop->op_flags = flags | OPf_KIDS;
1933 unop->op_private = 1 | (flags >> 8);
1935 unop = (UNOP*) CHECKOP(type, unop);
1939 return fold_constants((OP *) unop);
1943 newBINOP(type, flags, first, last)
1950 Newz(1101, binop, 1, BINOP);
1953 first = newOP(OP_NULL, 0);
1955 binop->op_type = type;
1956 binop->op_ppaddr = ppaddr[type];
1957 binop->op_first = first;
1958 binop->op_flags = flags | OPf_KIDS;
1961 binop->op_private = 1 | (flags >> 8);
1964 binop->op_private = 2 | (flags >> 8);
1965 first->op_sibling = last;
1968 binop = (BINOP*)CHECKOP(type, binop);
1972 binop->op_last = last = binop->op_first->op_sibling;
1974 return fold_constants((OP *)binop);
1978 pmtrans(o, expr, repl)
1983 SV *tstr = ((SVOP*)expr)->op_sv;
1984 SV *rstr = ((SVOP*)repl)->op_sv;
1987 register U8 *t = (U8*)SvPV(tstr, tlen);
1988 register U8 *r = (U8*)SvPV(rstr, rlen);
1993 register short *tbl;
1995 tbl = (short*)cPVOPo->op_pv;
1996 complement = o->op_private & OPpTRANS_COMPLEMENT;
1997 delete = o->op_private & OPpTRANS_DELETE;
1998 /* squash = o->op_private & OPpTRANS_SQUASH; */
2001 Zero(tbl, 256, short);
2002 for (i = 0; i < tlen; i++)
2004 for (i = 0, j = 0; i < 256; i++) {
2020 if (!rlen && !delete) {
2023 for (i = 0; i < 256; i++)
2025 for (i = 0, j = 0; i < tlen; i++,j++) {
2028 if (tbl[t[i]] == -1)
2034 if (tbl[t[i]] == -1)
2045 newPMOP(type, flags)
2052 Newz(1101, pmop, 1, PMOP);
2053 pmop->op_type = type;
2054 pmop->op_ppaddr = ppaddr[type];
2055 pmop->op_flags = flags;
2056 pmop->op_private = 0 | (flags >> 8);
2058 if (hints & HINT_LOCALE)
2059 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2061 /* link into pm list */
2062 if (type != OP_TRANS && curstash) {
2063 pmop->op_pmnext = HvPMROOT(curstash);
2064 HvPMROOT(curstash) = pmop;
2071 pmruntime(o, expr, repl)
2079 if (o->op_type == OP_TRANS)
2080 return pmtrans(o, expr, repl);
2082 hints |= HINT_BLOCK_SCOPE;
2085 if (expr->op_type == OP_CONST) {
2087 SV *pat = ((SVOP*)expr)->op_sv;
2088 char *p = SvPV(pat, plen);
2089 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2090 sv_setpvn(pat, "\\s+", 3);
2091 p = SvPV(pat, plen);
2092 pm->op_pmflags |= PMf_SKIPWHITE;
2094 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2095 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2096 pm->op_pmflags |= PMf_WHITE;
2101 if (pm->op_pmflags & PMf_KEEP)
2102 expr = newUNOP(OP_REGCMAYBE,0,expr);
2104 Newz(1101, rcop, 1, LOGOP);
2105 rcop->op_type = OP_REGCOMP;
2106 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2107 rcop->op_first = scalar(expr);
2108 rcop->op_flags |= OPf_KIDS;
2109 rcop->op_private = 1;
2112 /* establish postfix order */
2113 if (pm->op_pmflags & PMf_KEEP) {
2115 rcop->op_next = expr;
2116 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2119 rcop->op_next = LINKLIST(expr);
2120 expr->op_next = (OP*)rcop;
2123 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2128 if (pm->op_pmflags & PMf_EVAL)
2130 else if (repl->op_type == OP_CONST)
2134 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2135 if (opargs[curop->op_type] & OA_DANGEROUS) {
2136 if (curop->op_type == OP_GV) {
2137 GV *gv = ((GVOP*)curop)->op_gv;
2138 if (strchr("&`'123456789+", *GvENAME(gv)))
2141 else if (curop->op_type == OP_RV2CV)
2143 else if (curop->op_type == OP_RV2SV ||
2144 curop->op_type == OP_RV2AV ||
2145 curop->op_type == OP_RV2HV ||
2146 curop->op_type == OP_RV2GV) {
2147 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2150 else if (curop->op_type == OP_PADSV ||
2151 curop->op_type == OP_PADAV ||
2152 curop->op_type == OP_PADHV ||
2153 curop->op_type == OP_PADANY) {
2162 if (curop == repl) {
2163 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2164 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2165 prepend_elem(o->op_type, scalar(repl), o);
2168 Newz(1101, rcop, 1, LOGOP);
2169 rcop->op_type = OP_SUBSTCONT;
2170 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2171 rcop->op_first = scalar(repl);
2172 rcop->op_flags |= OPf_KIDS;
2173 rcop->op_private = 1;
2176 /* establish postfix order */
2177 rcop->op_next = LINKLIST(repl);
2178 repl->op_next = (OP*)rcop;
2180 pm->op_pmreplroot = scalar((OP*)rcop);
2181 pm->op_pmreplstart = LINKLIST(rcop);
2190 newSVOP(type, flags, sv)
2196 Newz(1101, svop, 1, SVOP);
2197 svop->op_type = type;
2198 svop->op_ppaddr = ppaddr[type];
2200 svop->op_next = (OP*)svop;
2201 svop->op_flags = flags;
2202 if (opargs[type] & OA_RETSCALAR)
2204 if (opargs[type] & OA_TARGET)
2205 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2206 return CHECKOP(type, svop);
2210 newGVOP(type, flags, gv)
2217 Newz(1101, gvop, 1, GVOP);
2218 gvop->op_type = type;
2219 gvop->op_ppaddr = ppaddr[type];
2220 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2221 gvop->op_next = (OP*)gvop;
2222 gvop->op_flags = flags;
2223 if (opargs[type] & OA_RETSCALAR)
2225 if (opargs[type] & OA_TARGET)
2226 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2227 return CHECKOP(type, gvop);
2231 newPVOP(type, flags, pv)
2237 Newz(1101, pvop, 1, PVOP);
2238 pvop->op_type = type;
2239 pvop->op_ppaddr = ppaddr[type];
2241 pvop->op_next = (OP*)pvop;
2242 pvop->op_flags = flags;
2243 if (opargs[type] & OA_RETSCALAR)
2245 if (opargs[type] & OA_TARGET)
2246 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2247 return CHECKOP(type, pvop);
2257 save_hptr(&curstash);
2258 save_item(curstname);
2263 name = SvPV(sv, len);
2264 curstash = gv_stashpvn(name,len,TRUE);
2265 sv_setpvn(curstname, name, len);
2269 sv_setpv(curstname,"<none>");
2277 utilize(aver, floor, version, id, arg)
2290 if (id->op_type != OP_CONST)
2291 croak("Module name must be constant");
2295 if(version != Nullop) {
2296 SV *vesv = ((SVOP*)version)->op_sv;
2298 if (arg == Nullop && !SvNIOK(vesv)) {
2305 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2306 croak("Version number must be constant number");
2308 /* Make copy of id so we don't free it twice */
2309 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2311 /* Fake up a method call to VERSION */
2312 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2313 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2314 append_elem(OP_LIST,
2315 prepend_elem(OP_LIST, pack, list(version)),
2316 newUNOP(OP_METHOD, 0, meth)));
2320 /* Fake up an import/unimport */
2321 if (arg && arg->op_type == OP_STUB)
2322 imop = arg; /* no import on explicit () */
2323 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2324 imop = Nullop; /* use 5.0; */
2327 /* Make copy of id so we don't free it twice */
2328 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2329 meth = newSVOP(OP_CONST, 0,
2331 ? newSVpv("import", 6)
2332 : newSVpv("unimport", 8)
2334 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2335 append_elem(OP_LIST,
2336 prepend_elem(OP_LIST, pack, list(arg)),
2337 newUNOP(OP_METHOD, 0, meth)));
2340 /* Fake up a require */
2341 rqop = newUNOP(OP_REQUIRE, 0, id);
2343 /* Fake up the BEGIN {}, which does its thing immediately. */
2345 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2347 append_elem(OP_LINESEQ,
2348 append_elem(OP_LINESEQ,
2349 newSTATEOP(0, Nullch, rqop),
2350 newSTATEOP(0, Nullch, veop)),
2351 newSTATEOP(0, Nullch, imop) ));
2358 newSLICEOP(flags, subscript, listval)
2363 return newBINOP(OP_LSLICE, flags,
2364 list(force_list(subscript)),
2365 list(force_list(listval)) );
2375 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2376 o = cUNOPo->op_first;
2378 if (o->op_type == OP_COND_EXPR) {
2379 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2380 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2385 yyerror("Assignment to both a list and a scalar");
2389 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2390 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2391 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2394 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2397 if (o->op_type == OP_RV2SV)
2404 newASSIGNOP(flags, left, optype, right)
2413 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2414 return newLOGOP(optype, 0,
2415 mod(scalar(left), optype),
2416 newUNOP(OP_SASSIGN, 0, scalar(right)));
2419 return newBINOP(optype, OPf_STACKED,
2420 mod(scalar(left), optype), scalar(right));
2424 if (list_assignment(left)) {
2426 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2427 left = mod(left, OP_AASSIGN);
2435 o = newBINOP(OP_AASSIGN, flags,
2436 list(force_list(right)),
2437 list(force_list(left)) );
2438 o->op_private = 0 | (flags >> 8);
2439 if (!(left->op_private & OPpLVAL_INTRO)) {
2440 static int generation = 100;
2444 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2445 if (opargs[curop->op_type] & OA_DANGEROUS) {
2446 if (curop->op_type == OP_GV) {
2447 GV *gv = ((GVOP*)curop)->op_gv;
2448 if (gv == defgv || SvCUR(gv) == generation)
2450 SvCUR(gv) = generation;
2452 else if (curop->op_type == OP_PADSV ||
2453 curop->op_type == OP_PADAV ||
2454 curop->op_type == OP_PADHV ||
2455 curop->op_type == OP_PADANY) {
2456 SV **svp = AvARRAY(comppad_name);
2457 SV *sv = svp[curop->op_targ];
2458 if (SvCUR(sv) == generation)
2460 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2462 else if (curop->op_type == OP_RV2CV)
2464 else if (curop->op_type == OP_RV2SV ||
2465 curop->op_type == OP_RV2AV ||
2466 curop->op_type == OP_RV2HV ||
2467 curop->op_type == OP_RV2GV) {
2468 if (lastop->op_type != OP_GV) /* funny deref? */
2477 o->op_private = OPpASSIGN_COMMON;
2479 if (right && right->op_type == OP_SPLIT) {
2481 if ((tmpop = ((LISTOP*)right)->op_first) &&
2482 tmpop->op_type == OP_PUSHRE)
2484 PMOP *pm = (PMOP*)tmpop;
2485 if (left->op_type == OP_RV2AV &&
2486 !(left->op_private & OPpLVAL_INTRO) &&
2487 !(o->op_private & OPpASSIGN_COMMON) )
2489 tmpop = ((UNOP*)left)->op_first;
2490 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2491 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2492 pm->op_pmflags |= PMf_ONCE;
2493 tmpop = cUNOPo->op_first; /* to list (nulled) */
2494 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2495 tmpop->op_sibling = Nullop; /* don't free split */
2496 right->op_next = tmpop->op_next; /* fix starting loc */
2497 op_free(o); /* blow off assign */
2498 right->op_flags &= ~OPf_WANT;
2499 /* "I don't know and I don't care." */
2504 if (modcount < 10000 &&
2505 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2507 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2509 sv_setiv(sv, modcount+1);
2517 right = newOP(OP_UNDEF, 0);
2518 if (right->op_type == OP_READLINE) {
2519 right->op_flags |= OPf_STACKED;
2520 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2523 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2524 o = newBINOP(OP_SASSIGN, flags,
2525 scalar(right), mod(scalar(left), OP_SASSIGN) );
2537 newSTATEOP(flags, label, o)
2543 U32 seq = intro_my();
2546 Newz(1101, cop, 1, COP);
2547 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2548 cop->op_type = OP_DBSTATE;
2549 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2552 cop->op_type = OP_NEXTSTATE;
2553 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2555 cop->op_flags = flags;
2556 cop->op_private = 0 | (flags >> 8);
2558 cop->op_private |= NATIVE_HINTS;
2560 cop->op_next = (OP*)cop;
2563 cop->cop_label = label;
2564 hints |= HINT_BLOCK_SCOPE;
2567 cop->cop_arybase = curcop->cop_arybase;
2569 if (copline == NOLINE)
2570 cop->cop_line = curcop->cop_line;
2572 cop->cop_line = copline;
2575 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2576 cop->cop_stash = curstash;
2578 if (PERLDB_LINE && curstash != debstash) {
2579 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2580 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2581 (void)SvIOK_on(*svp);
2583 SvSTASH(*svp) = (HV*)cop;
2587 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2590 /* "Introduce" my variables to visible status. */
2598 if (! min_intro_pending)
2601 svp = AvARRAY(comppad_name);
2602 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2603 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2604 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2605 SvNVX(sv) = (double)cop_seqmax;
2608 min_intro_pending = 0;
2609 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2610 return cop_seqmax++;
2614 newLOGOP(type, flags, first, other)
2624 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2625 return newBINOP(type, flags, scalar(first), scalar(other));
2627 scalarboolean(first);
2628 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2629 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2630 if (type == OP_AND || type == OP_OR) {
2636 first = cUNOPo->op_first;
2638 first->op_next = o->op_next;
2639 cUNOPo->op_first = Nullop;
2643 if (first->op_type == OP_CONST) {
2644 if (dowarn && (first->op_private & OPpCONST_BARE))
2645 warn("Probable precedence problem on %s", op_desc[type]);
2646 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2655 else if (first->op_type == OP_WANTARRAY) {
2661 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2662 OP *k1 = ((UNOP*)first)->op_first;
2663 OP *k2 = k1->op_sibling;
2665 switch (first->op_type)
2668 if (k2 && k2->op_type == OP_READLINE
2669 && (k2->op_flags & OPf_STACKED)
2670 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2671 warnop = k2->op_type;
2675 if (k1->op_type == OP_READDIR
2676 || k1->op_type == OP_GLOB
2677 || k1->op_type == OP_EACH)
2678 warnop = k1->op_type;
2682 line_t oldline = curcop->cop_line;
2683 curcop->cop_line = copline;
2684 warn("Value of %s%s can be \"0\"; test with defined()",
2686 ((warnop == OP_READLINE || warnop == OP_GLOB)
2687 ? " construct" : "() operator"));
2688 curcop->cop_line = oldline;
2695 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2696 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2698 Newz(1101, logop, 1, LOGOP);
2700 logop->op_type = type;
2701 logop->op_ppaddr = ppaddr[type];
2702 logop->op_first = first;
2703 logop->op_flags = flags | OPf_KIDS;
2704 logop->op_other = LINKLIST(other);
2705 logop->op_private = 1 | (flags >> 8);
2707 /* establish postfix order */
2708 logop->op_next = LINKLIST(first);
2709 first->op_next = (OP*)logop;
2710 first->op_sibling = other;
2712 o = newUNOP(OP_NULL, 0, (OP*)logop);
2719 newCONDOP(flags, first, trueop, falseop)
2730 return newLOGOP(OP_AND, 0, first, trueop);
2732 return newLOGOP(OP_OR, 0, first, falseop);
2734 scalarboolean(first);
2735 if (first->op_type == OP_CONST) {
2736 if (SvTRUE(((SVOP*)first)->op_sv)) {
2747 else if (first->op_type == OP_WANTARRAY) {
2751 Newz(1101, condop, 1, CONDOP);
2753 condop->op_type = OP_COND_EXPR;
2754 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2755 condop->op_first = first;
2756 condop->op_flags = flags | OPf_KIDS;
2757 condop->op_true = LINKLIST(trueop);
2758 condop->op_false = LINKLIST(falseop);
2759 condop->op_private = 1 | (flags >> 8);
2761 /* establish postfix order */
2762 condop->op_next = LINKLIST(first);
2763 first->op_next = (OP*)condop;
2765 first->op_sibling = trueop;
2766 trueop->op_sibling = falseop;
2767 o = newUNOP(OP_NULL, 0, (OP*)condop);
2769 trueop->op_next = o;
2770 falseop->op_next = o;
2776 newRANGE(flags, left, right)
2787 Newz(1101, condop, 1, CONDOP);
2789 condop->op_type = OP_RANGE;
2790 condop->op_ppaddr = ppaddr[OP_RANGE];
2791 condop->op_first = left;
2792 condop->op_flags = OPf_KIDS;
2793 condop->op_true = LINKLIST(left);
2794 condop->op_false = LINKLIST(right);
2795 condop->op_private = 1 | (flags >> 8);
2797 left->op_sibling = right;
2799 condop->op_next = (OP*)condop;
2800 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2801 flop = newUNOP(OP_FLOP, 0, flip);
2802 o = newUNOP(OP_NULL, 0, flop);
2805 left->op_next = flip;
2806 right->op_next = flop;
2808 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2809 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2810 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2811 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2813 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2814 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2817 if (!flip->op_private || !flop->op_private)
2818 linklist(o); /* blow off optimizer unless constant */
2824 newLOOPOP(flags, debuggable, expr, block)
2833 int once = block && block->op_flags & OPf_SPECIAL &&
2834 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2837 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2838 return block; /* do {} while 0 does once */
2839 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2840 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2841 expr = newUNOP(OP_DEFINED, 0,
2842 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2846 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2847 o = newLOGOP(OP_AND, 0, expr, listop);
2849 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2851 if (once && o != listop)
2852 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2855 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2857 o->op_flags |= flags;
2859 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2864 newWHILEOP(flags, debuggable, loop, whileline, expr, block, cont)
2880 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2881 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2882 expr = newUNOP(OP_DEFINED, 0,
2883 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2887 block = newOP(OP_NULL, 0);
2890 next = LINKLIST(cont);
2892 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2893 if ((line_t)whileline != NOLINE) {
2894 copline = whileline;
2895 cont = append_elem(OP_LINESEQ, cont,
2896 newSTATEOP(0, Nullch, Nullop));
2900 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2901 redo = LINKLIST(listop);
2904 o = newLOGOP(OP_AND, 0, expr, scalar(listop));
2905 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2906 op_free(expr); /* oops, it's a while (0) */
2908 return Nullop; /* (listop already freed by newLOGOP) */
2910 ((LISTOP*)listop)->op_last->op_next = condop =
2911 (o == listop ? redo : LINKLIST(o));
2919 Newz(1101,loop,1,LOOP);
2920 loop->op_type = OP_ENTERLOOP;
2921 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2922 loop->op_private = 0;
2923 loop->op_next = (OP*)loop;
2926 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2928 loop->op_redoop = redo;
2929 loop->op_lastop = o;
2932 loop->op_nextop = next;
2934 loop->op_nextop = o;
2936 o->op_flags |= flags;
2937 o->op_private |= (flags >> 8);
2942 #ifndef CAN_PROTOTYPE
2943 newFOROP(flags,label,forline,sv,expr,block,cont)
2952 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2953 #endif /* CAN_PROTOTYPE */
2961 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2962 sv->op_type = OP_RV2GV;
2963 sv->op_ppaddr = ppaddr[OP_RV2GV];
2965 else if (sv->op_type == OP_PADSV) { /* private variable */
2966 padoff = sv->op_targ;
2971 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2974 sv = newGVOP(OP_GV, 0, defgv);
2976 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2977 expr = scalar(ref(expr, OP_ITER));
2978 iterflags |= OPf_STACKED;
2980 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2981 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2983 assert(!loop->op_next);
2984 Renew(loop, 1, LOOP);
2985 loop->op_targ = padoff;
2986 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
2988 return newSTATEOP(0, label, wop);
2992 newLOOPEX(type, label)
2998 if (type != OP_GOTO || label->op_type == OP_CONST) {
2999 o = newPVOP(type, 0, savepv(
3000 label->op_type == OP_CONST
3001 ? SvPVx(((SVOP*)label)->op_sv, na)
3006 if (label->op_type == OP_ENTERSUB)
3007 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3008 o = newUNOP(type, OPf_STACKED, label);
3010 hints |= HINT_BLOCK_SCOPE;
3021 MUTEX_DESTROY(CvMUTEXP(cv));
3022 Safefree(CvMUTEXP(cv));
3025 #endif /* USE_THREADS */
3027 if (!CvXSUB(cv) && CvROOT(cv)) {
3029 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3030 croak("Can't undef active subroutine");
3033 croak("Can't undef active subroutine");
3034 #endif /* USE_THREADS */
3041 op_free(CvROOT(cv));
3042 CvROOT(cv) = Nullop;
3045 SvPOK_off((SV*)cv); /* forget prototype */
3047 SvREFCNT_dec(CvGV(cv));
3049 SvREFCNT_dec(CvOUTSIDE(cv));
3050 CvOUTSIDE(cv) = Nullcv;
3051 if (CvPADLIST(cv)) {
3052 /* may be during global destruction */
3053 if (SvREFCNT(CvPADLIST(cv))) {
3054 I32 i = AvFILL(CvPADLIST(cv));
3056 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3057 SV* sv = svp ? *svp : Nullsv;
3060 if (sv == (SV*)comppad_name)
3061 comppad_name = Nullav;
3062 else if (sv == (SV*)comppad) {
3064 curpad = Null(SV**);
3068 SvREFCNT_dec((SV*)CvPADLIST(cv));
3070 CvPADLIST(cv) = Nullav;
3074 #ifdef DEBUG_CLOSURES
3079 CV *outside = CvOUTSIDE(cv);
3080 AV* padlist = CvPADLIST(cv);
3087 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3089 (CvANON(cv) ? "ANON"
3090 : (cv == main_cv) ? "MAIN"
3091 : CvUNIQUE(outside) ? "UNIQUE"
3092 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3095 : CvANON(outside) ? "ANON"
3096 : (outside == main_cv) ? "MAIN"
3097 : CvUNIQUE(outside) ? "UNIQUE"
3098 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3103 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3104 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3105 pname = AvARRAY(pad_name);
3106 ppad = AvARRAY(pad);
3108 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
3109 if (SvPOK(pname[ix]))
3110 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3112 SvFAKE(pname[ix]) ? "FAKE " : "",
3114 (long)I_32(SvNVX(pname[ix])),
3115 (long)SvIVX(pname[ix]));
3118 #endif /* DEBUG_CLOSURES */
3121 cv_clone2(proto, outside)
3128 AV* protopadlist = CvPADLIST(proto);
3129 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3130 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3131 SV** pname = AvARRAY(protopad_name);
3132 SV** ppad = AvARRAY(protopad);
3133 I32 fname = AvFILL(protopad_name);
3134 I32 fpad = AvFILL(protopad);
3138 assert(!CvUNIQUE(proto));
3143 SAVESPTR(comppad_name);
3146 cv = compcv = (CV*)NEWSV(1104,0);
3147 sv_upgrade((SV *)cv, SvTYPE(proto));
3153 New(666, CvMUTEXP(cv), 1, perl_mutex);
3154 MUTEX_INIT(CvMUTEXP(cv));
3156 #endif /* USE_THREADS */
3157 CvFILEGV(cv) = CvFILEGV(proto);
3158 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3159 CvSTASH(cv) = CvSTASH(proto);
3160 CvROOT(cv) = CvROOT(proto);
3161 CvSTART(cv) = CvSTART(proto);
3163 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3166 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3168 comppad_name = newAV();
3169 for (ix = fname; ix >= 0; ix--)
3170 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3174 comppadlist = newAV();
3175 AvREAL_off(comppadlist);
3176 av_store(comppadlist, 0, (SV*)comppad_name);
3177 av_store(comppadlist, 1, (SV*)comppad);
3178 CvPADLIST(cv) = comppadlist;
3179 av_fill(comppad, AvFILL(protopad));
3180 curpad = AvARRAY(comppad);
3182 av = newAV(); /* will be @_ */
3184 av_store(comppad, 0, (SV*)av);
3185 AvFLAGS(av) = AVf_REIFY;
3187 for (ix = fpad; ix > 0; ix--) {
3188 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3189 if (namesv && namesv != &sv_undef) {
3190 char *name = SvPVX(namesv); /* XXX */
3191 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3192 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3193 CvOUTSIDE(cv), cxstack_ix);
3195 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3197 croak("panic: cv_clone: %s", name);
3199 else { /* our own lexical */
3202 /* anon code -- we'll come back for it */
3203 sv = SvREFCNT_inc(ppad[ix]);
3205 else if (*name == '@')
3207 else if (*name == '%')
3217 SV* sv = NEWSV(0,0);
3223 /* Now that vars are all in place, clone nested closures. */
3225 for (ix = fpad; ix > 0; ix--) {
3226 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3228 && namesv != &sv_undef
3229 && !(SvFLAGS(namesv) & SVf_FAKE)
3230 && *SvPVX(namesv) == '&'
3231 && CvCLONE(ppad[ix]))
3233 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3234 SvREFCNT_dec(ppad[ix]);
3237 curpad[ix] = (SV*)kid;
3241 #ifdef DEBUG_CLOSURES
3242 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3244 PerlIO_printf(Perl_debug_log, " from:\n");
3246 PerlIO_printf(Perl_debug_log, " to:\n");
3258 return cv_clone2(proto, CvOUTSIDE(proto));
3262 cv_ckproto(cv, gv, p)
3267 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3268 SV* msg = sv_newmortal();
3272 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3273 sv_setpv(msg, "Prototype mismatch:");
3275 sv_catpvf(msg, " sub %_", name);
3277 sv_catpvf(msg, " (%s)", SvPVX(cv));
3278 sv_catpv(msg, " vs ");
3280 sv_catpvf(msg, "(%s)", p);
3282 sv_catpv(msg, "none");
3294 if (!cv || !SvPOK(cv) || SvCUR(cv))
3298 for (o = CvSTART(cv); o; o = o->op_next) {
3299 OPCODE type = o->op_type;
3301 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3303 if (type == OP_LEAVESUB || type == OP_RETURN)
3307 if (type == OP_CONST)
3309 else if (type == OP_PADSV) {
3310 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3311 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3312 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3324 newSUB(floor,o,proto,block)
3331 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3332 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3333 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3342 if (!name || GvCVGEN(gv))
3344 else if (cv = GvCV(gv)) {
3345 cv_ckproto(cv, gv, ps);
3346 /* already defined (or promised)? */
3347 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3350 /* just a "sub foo;" when &foo is already defined */
3354 /* ahem, death to those who redefine active sort subs */
3355 if (curstack == sortstack && sortcop == CvSTART(cv))
3356 croak("Can't redefine active sort subroutine %s", name);
3357 const_sv = cv_const_sv(cv);
3358 if (const_sv || dowarn) {
3359 line_t oldline = curcop->cop_line;
3360 curcop->cop_line = copline;
3361 warn(const_sv ? "Constant subroutine %s redefined"
3362 : "Subroutine %s redefined", name);
3363 curcop->cop_line = oldline;
3369 if (cv) { /* must reuse cv if autoloaded */
3371 CvFLAGS(cv) = CvFLAGS(compcv);
3372 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3373 CvOUTSIDE(compcv) = 0;
3374 CvPADLIST(cv) = CvPADLIST(compcv);
3375 CvPADLIST(compcv) = 0;
3376 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3377 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3378 SvREFCNT_dec(compcv);
3388 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3389 CvFILEGV(cv) = curcop->cop_filegv;
3390 CvSTASH(cv) = curstash;
3393 New(666, CvMUTEXP(cv), 1, perl_mutex);
3394 MUTEX_INIT(CvMUTEXP(cv));
3395 #endif /* USE_THREADS */
3398 sv_setpv((SV*)cv, ps);
3404 char *s = strrchr(name, ':');
3406 if (strEQ(s, "BEGIN")) {
3408 "BEGIN not safe after errors--compilation aborted";
3412 /* force display of errors found but not reported */
3413 sv_catpv(GvSV(errgv), not_safe);
3414 croak("%s", SvPVx(GvSV(errgv), na));
3425 if (AvFILL(comppad_name) < AvFILL(comppad))
3426 av_store(comppad_name, AvFILL(comppad), Nullsv);
3429 SV **namep = AvARRAY(comppad_name);
3430 for (ix = AvFILL(comppad); ix > 0; ix--) {
3433 if (SvIMMORTAL(curpad[ix]))
3436 * The only things that a clonable function needs in its
3437 * pad are references to outer lexicals and anonymous subs.
3438 * The rest are created anew during cloning.
3440 if (!((namesv = namep[ix]) != Nullsv &&
3441 namesv != &sv_undef &&
3443 *SvPVX(namesv) == '&')))
3445 SvREFCNT_dec(curpad[ix]);
3446 curpad[ix] = Nullsv;
3451 AV *av = newAV(); /* Will be @_ */
3453 av_store(comppad, 0, (SV*)av);
3454 AvFLAGS(av) = AVf_REIFY;
3456 for (ix = AvFILL(comppad); ix > 0; ix--) {
3457 if (SvIMMORTAL(curpad[ix]))
3459 if (!SvPADMY(curpad[ix]))
3460 SvPADTMP_on(curpad[ix]);
3464 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3465 CvSTART(cv) = LINKLIST(CvROOT(cv));
3466 CvROOT(cv)->op_next = 0;
3472 if (PERLDB_SUBLINE && curstash != debstash) {
3473 SV *sv = NEWSV(0,0);
3474 SV *tmpstr = sv_newmortal();
3475 static GV *db_postponed;
3479 sv_setpvf(sv, "%_:%ld-%ld",
3480 GvSV(curcop->cop_filegv),
3481 (long)subline, (long)curcop->cop_line);
3482 gv_efullname3(tmpstr, gv, Nullch);
3483 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3484 if (!db_postponed) {
3485 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3487 hv = GvHVn(db_postponed);
3488 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3489 && (cv = GvCV(db_postponed))) {
3494 perl_call_sv((SV*)cv, G_DISCARD);
3498 if ((s = strrchr(name,':')))
3502 if (strEQ(s, "BEGIN")) {
3503 I32 oldscope = scopestack_ix;
3505 SAVESPTR(compiling.cop_filegv);
3506 SAVEI16(compiling.cop_line);
3513 DEBUG_x( dump_sub(gv) );
3514 av_push(beginav, (SV *)cv);
3516 call_list(oldscope, beginav);
3518 curcop = &compiling;
3521 else if (strEQ(s, "END") && !error_count) {
3524 av_unshift(endav, 1);
3525 av_store(endav, 0, (SV *)cv);
3528 else if (strEQ(s, "INIT") && !error_count) {
3531 av_push(initav, SvREFCNT_inc(cv));
3543 newXSUB(name, ix, subaddr, filename)
3549 CV* cv = newXS(name, (void(*)())subaddr, filename);
3551 CvXSUBANY(cv).any_i32 = ix;
3557 newXS(name, subaddr, filename)
3559 void (*subaddr) _((CV*));
3563 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3566 if (cv = (name ? GvCV(gv) : Nullcv)) {
3568 /* just a cached method */
3572 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3573 /* already defined (or promised) */
3575 line_t oldline = curcop->cop_line;
3576 curcop->cop_line = copline;
3577 warn("Subroutine %s redefined",name);
3578 curcop->cop_line = oldline;
3585 if (cv) /* must reuse cv if autoloaded */
3588 cv = (CV*)NEWSV(1105,0);
3589 sv_upgrade((SV *)cv, SVt_PVCV);
3596 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3598 New(666, CvMUTEXP(cv), 1, perl_mutex);
3599 MUTEX_INIT(CvMUTEXP(cv));
3601 #endif /* USE_THREADS */
3602 CvFILEGV(cv) = gv_fetchfile(filename);
3603 CvXSUB(cv) = subaddr;
3606 char *s = strrchr(name,':');
3611 if (strEQ(s, "BEGIN")) {
3614 av_push(beginav, (SV *)cv);
3617 else if (strEQ(s, "END")) {
3620 av_unshift(endav, 1);
3621 av_store(endav, 0, (SV *)cv);
3624 else if (strEQ(s, "INIT")) {
3627 av_push(initav, (SV *)cv);
3637 newFORM(floor,o,block)
3649 name = SvPVx(cSVOPo->op_sv, na);
3652 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3654 if (cv = GvFORM(gv)) {
3656 line_t oldline = curcop->cop_line;
3658 curcop->cop_line = copline;
3659 warn("Format %s redefined",name);
3660 curcop->cop_line = oldline;
3666 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3667 CvFILEGV(cv) = curcop->cop_filegv;
3669 for (ix = AvFILL(comppad); ix > 0; ix--) {
3670 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3671 SvPADTMP_on(curpad[ix]);
3674 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3675 CvSTART(cv) = LINKLIST(CvROOT(cv));
3676 CvROOT(cv)->op_next = 0;
3687 return newUNOP(OP_REFGEN, 0,
3688 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3695 return newUNOP(OP_REFGEN, 0,
3696 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3700 newANONSUB(floor, proto, block)
3705 return newUNOP(OP_REFGEN, 0,
3706 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3713 switch (o->op_type) {
3715 o->op_type = OP_PADAV;
3716 o->op_ppaddr = ppaddr[OP_PADAV];
3717 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3720 o->op_type = OP_RV2AV;
3721 o->op_ppaddr = ppaddr[OP_RV2AV];
3726 warn("oops: oopsAV");
3736 switch (o->op_type) {
3739 o->op_type = OP_PADHV;
3740 o->op_ppaddr = ppaddr[OP_PADHV];
3741 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3745 o->op_type = OP_RV2HV;
3746 o->op_ppaddr = ppaddr[OP_RV2HV];
3751 warn("oops: oopsHV");
3761 if (o->op_type == OP_PADANY) {
3762 o->op_type = OP_PADAV;
3763 o->op_ppaddr = ppaddr[OP_PADAV];
3766 return newUNOP(OP_RV2AV, 0, scalar(o));
3774 if (type == OP_MAPSTART)
3775 return newUNOP(OP_NULL, 0, o);
3776 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3783 if (o->op_type == OP_PADANY) {
3784 o->op_type = OP_PADHV;
3785 o->op_ppaddr = ppaddr[OP_PADHV];
3788 return newUNOP(OP_RV2HV, 0, scalar(o));
3795 croak("NOT IMPL LINE %d",__LINE__);
3805 return newUNOP(OP_RV2CV, flags, scalar(o));
3812 if (o->op_type == OP_PADANY) {
3813 o->op_type = OP_PADSV;
3814 o->op_ppaddr = ppaddr[OP_PADSV];
3817 return newUNOP(OP_RV2SV, 0, scalar(o));
3820 /* Check routines. */
3829 name = NEWSV(1106,0);
3830 sv_upgrade(name, SVt_PVNV);
3831 sv_setpvn(name, "&", 1);
3834 ix = pad_alloc(o->op_type, SVs_PADMY);
3835 av_store(comppad_name, ix, name);
3836 av_store(comppad, ix, cSVOPo->op_sv);
3837 SvPADMY_on(cSVOPo->op_sv);
3838 cSVOPo->op_sv = Nullsv;
3839 cSVOPo->op_targ = ix;
3847 o->op_private = hints;
3855 if (cUNOPo->op_first->op_type == OP_CONCAT)
3856 o->op_flags |= OPf_STACKED;
3864 if (o->op_flags & OPf_KIDS) {
3867 OPCODE type = o->op_type;
3868 o = modkids(ck_fun(o), type);
3869 kid = cUNOPo->op_first;
3870 newop = kUNOP->op_first->op_sibling;
3872 (newop->op_sibling ||
3873 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3874 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3875 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3879 op_free(kUNOP->op_first);
3880 kUNOP->op_first = newop;
3882 o->op_ppaddr = ppaddr[++o->op_type];
3892 if (o->op_flags & OPf_KIDS) {
3893 OP *kid = cUNOPo->op_first;
3894 if (kid->op_type == OP_HSLICE)
3895 o->op_private |= OPpSLICE;
3896 else if (kid->op_type != OP_HELEM)
3897 croak("%s argument is not a HASH element or slice",
3898 op_desc[o->op_type]);
3908 I32 type = o->op_type;
3910 if (o->op_flags & OPf_KIDS) {
3911 if (cLISTOPo->op_first->op_type == OP_STUB) {
3913 o = newUNOP(type, OPf_SPECIAL,
3914 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3925 hints |= HINT_BLOCK_SCOPE;
3926 if (o->op_flags & OPf_KIDS) {
3927 SVOP *kid = (SVOP*)cUNOPo->op_first;
3930 o->op_flags &= ~OPf_KIDS;
3933 else if (kid->op_type == OP_LINESEQ) {
3936 kid->op_next = o->op_next;
3937 cUNOPo->op_first = 0;
3940 Newz(1101, enter, 1, LOGOP);
3941 enter->op_type = OP_ENTERTRY;
3942 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3943 enter->op_private = 0;
3945 /* establish postfix order */
3946 enter->op_next = (OP*)enter;
3948 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3949 o->op_type = OP_LEAVETRY;
3950 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3951 enter->op_other = o;
3957 o = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3959 o->op_targ = (PADOFFSET)hints;
3968 if (o->op_flags & OPf_STACKED) {
3970 kid = cUNOPo->op_first->op_sibling;
3971 if (kid->op_type == OP_RV2GV)
3984 if (o->op_flags & OPf_KIDS) {
3985 OP *kid = cUNOPo->op_first;
3986 if (kid->op_type != OP_HELEM)
3987 croak("%s argument is not a HASH element", op_desc[o->op_type]);
3997 o = fold_constants(o);
3998 if (o->op_type == OP_CONST)
4008 SVOP *kid = (SVOP*)cUNOPo->op_first;
4010 o->op_private |= (hints & HINT_STRICT_REFS);
4011 if (kid->op_type == OP_CONST) {
4016 name = SvPV(kid->op_sv, na);
4017 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4018 char *badthing = Nullch;
4019 switch (o->op_type) {
4021 badthing = "a SCALAR";
4024 badthing = "an ARRAY";
4027 badthing = "a HASH";
4032 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4035 kid->op_type = OP_GV;
4036 iscv = (o->op_type == OP_RV2CV) * 2;
4037 for (gv = 0; !gv; iscv++) {
4039 * This is a little tricky. We only want to add the symbol if we
4040 * didn't add it in the lexer. Otherwise we get duplicate strict
4041 * warnings. But if we didn't add it in the lexer, we must at
4042 * least pretend like we wanted to add it even if it existed before,
4043 * or we get possible typo warnings. OPpCONST_ENTERED says
4044 * whether the lexer already added THIS instance of this symbol.
4046 gv = gv_fetchpv(name,
4047 iscv | !(kid->op_private & OPpCONST_ENTERED),
4050 : o->op_type == OP_RV2SV
4052 : o->op_type == OP_RV2AV
4054 : o->op_type == OP_RV2HV
4058 SvREFCNT_dec(kid->op_sv);
4059 kid->op_sv = SvREFCNT_inc(gv);
4069 I32 type = o->op_type;
4071 if (o->op_flags & OPf_REF)
4074 if (o->op_flags & OPf_KIDS) {
4075 SVOP *kid = (SVOP*)cUNOPo->op_first;
4077 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4078 OP *newop = newGVOP(type, OPf_REF,
4079 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4086 if (type == OP_FTTTY)
4087 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4090 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4104 int type = o->op_type;
4105 register I32 oa = opargs[type] >> OASHIFT;
4107 if (o->op_flags & OPf_STACKED) {
4108 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4111 return no_fh_allowed(o);
4114 if (o->op_flags & OPf_KIDS) {
4115 tokid = &cLISTOPo->op_first;
4116 kid = cLISTOPo->op_first;
4117 if (kid->op_type == OP_PUSHMARK ||
4118 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4120 tokid = &kid->op_sibling;
4121 kid = kid->op_sibling;
4123 if (!kid && opargs[type] & OA_DEFGV)
4124 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
4128 sibl = kid->op_sibling;
4142 if (kid->op_type == OP_CONST &&
4143 (kid->op_private & OPpCONST_BARE)) {
4144 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4145 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4146 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4148 warn("Array @%s missing the @ in argument %ld of %s()",
4149 name, (long)numargs, op_desc[type]);
4152 kid->op_sibling = sibl;
4155 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4156 bad_type(numargs, "array", op_desc[o->op_type], kid);
4160 if (kid->op_type == OP_CONST &&
4161 (kid->op_private & OPpCONST_BARE)) {
4162 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4163 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4164 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4166 warn("Hash %%%s missing the %% in argument %ld of %s()",
4167 name, (long)numargs, op_desc[type]);
4170 kid->op_sibling = sibl;
4173 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4174 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4179 OP *newop = newUNOP(OP_NULL, 0, kid);
4180 kid->op_sibling = 0;
4182 newop->op_next = newop;
4184 kid->op_sibling = sibl;
4189 if (kid->op_type != OP_GV) {
4190 if (kid->op_type == OP_CONST &&
4191 (kid->op_private & OPpCONST_BARE)) {
4192 OP *newop = newGVOP(OP_GV, 0,
4193 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4199 kid->op_sibling = 0;
4200 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4202 kid->op_sibling = sibl;
4208 mod(scalar(kid), type);
4212 tokid = &kid->op_sibling;
4213 kid = kid->op_sibling;
4215 o->op_private |= numargs;
4217 return too_many_arguments(o,op_desc[o->op_type]);
4220 else if (opargs[type] & OA_DEFGV) {
4222 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4226 while (oa & OA_OPTIONAL)
4228 if (oa && oa != OA_LIST)
4229 return too_few_arguments(o,op_desc[o->op_type]);
4240 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4241 append_elem(OP_GLOB, o, newSVREF(newGVOP(OP_GV, 0, defgv)));
4243 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4244 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4246 if (gv && GvIMPORTED_CV(gv)) {
4247 static int glob_index;
4249 append_elem(OP_GLOB, o,
4250 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4251 o->op_type = OP_LIST;
4252 o->op_ppaddr = ppaddr[OP_LIST];
4253 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4254 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4255 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4256 append_elem(OP_LIST, o,
4257 scalar(newUNOP(OP_RV2CV, 0,
4258 newGVOP(OP_GV, 0, gv)))));
4259 o = newUNOP(OP_NULL, 0, ck_subr(o));
4260 o->op_targ = OP_GLOB; /* hint at what it used to be */
4263 gv = newGVgen("main");
4265 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4276 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4278 o->op_ppaddr = ppaddr[OP_GREPSTART];
4279 Newz(1101, gwop, 1, LOGOP);
4281 if (o->op_flags & OPf_STACKED) {
4284 kid = cLISTOPo->op_first->op_sibling;
4285 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4288 kid->op_next = (OP*)gwop;
4289 o->op_flags &= ~OPf_STACKED;
4291 kid = cLISTOPo->op_first->op_sibling;
4292 if (type == OP_MAPWHILE)
4299 kid = cLISTOPo->op_first->op_sibling;
4300 if (kid->op_type != OP_NULL)
4301 croak("panic: ck_grep");
4302 kid = kUNOP->op_first;
4304 gwop->op_type = type;
4305 gwop->op_ppaddr = ppaddr[type];
4306 gwop->op_first = listkids(o);
4307 gwop->op_flags |= OPf_KIDS;
4308 gwop->op_private = 1;
4309 gwop->op_other = LINKLIST(kid);
4310 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4311 kid->op_next = (OP*)gwop;
4313 kid = cLISTOPo->op_first->op_sibling;
4314 if (!kid || !kid->op_sibling)
4315 return too_few_arguments(o,op_desc[o->op_type]);
4316 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4317 mod(kid, OP_GREPSTART);
4326 if (o->op_flags & OPf_KIDS) {
4327 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4328 if (kid && kid->op_type == OP_CONST)
4329 fbm_compile(((SVOP*)kid)->op_sv);
4338 /* XXX length optimization goes here */
4346 OPCODE type = o->op_type;
4347 return modkids(ck_fun(o), type);
4354 OPCODE type = o->op_type;
4355 return refkids(ck_fun(o), type);
4364 kid = cLISTOPo->op_first;
4367 kid = cLISTOPo->op_first;
4369 if (kid->op_type == OP_PUSHMARK)
4370 kid = kid->op_sibling;
4371 if (kid && o->op_flags & OPf_STACKED)
4372 kid = kid->op_sibling;
4373 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4374 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4375 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4376 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4377 cLISTOPo->op_first->op_sibling = kid;
4378 cLISTOPo->op_last = kid;
4379 kid = kid->op_sibling;
4384 append_elem(o->op_type, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4390 if (hints & HINT_LOCALE)
4391 o->op_private |= OPpLOCALE;
4405 if (hints & HINT_LOCALE)
4406 o->op_private |= OPpLOCALE;
4418 if (hints & HINT_LOCALE)
4419 o->op_private |= OPpLOCALE;
4429 o->op_private |= OPpRUNTIME;
4444 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4445 o->op_private |= OPpREPEAT_DOLIST;
4446 cBINOPo->op_first = force_list(cBINOPo->op_first);
4457 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4458 SVOP *kid = (SVOP*)cUNOPo->op_first;
4460 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4462 for (s = SvPVX(kid->op_sv); *s; s++) {
4463 if (*s == ':' && s[1] == ':') {
4465 Move(s+2, s+1, strlen(s+2)+1, char);
4466 --SvCUR(kid->op_sv);
4469 sv_catpvn(kid->op_sv, ".pm", 3);
4479 croak("NOT IMPL LINE %d",__LINE__);
4489 if (o->op_flags & OPf_KIDS) {
4490 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4491 if (kid && kid->op_sibling) {
4492 o->op_type = OP_SSELECT;
4493 o->op_ppaddr = ppaddr[OP_SSELECT];
4495 return fold_constants(o);
4499 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4500 if (kid && kid->op_type == OP_RV2GV)
4501 kid->op_private &= ~HINT_STRICT_REFS;
4509 I32 type = o->op_type;
4511 if (!(o->op_flags & OPf_KIDS)) {
4517 argop = newOP(OP_PADAV, OPf_REF);
4518 argop->op_targ = 0; /* curpad[0] is @_ */
4521 argop = newUNOP(OP_RV2AV, 0,
4522 scalar(newGVOP(OP_GV, 0,
4523 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4526 argop = newUNOP(OP_RV2AV, 0,
4527 scalar(newGVOP(OP_GV, 0, subline ?
4528 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4529 #endif /* USE_THREADS */
4530 return newUNOP(type, 0, scalar(argop));
4532 return scalar(modkids(ck_fun(o), type));
4541 if (hints & HINT_LOCALE)
4542 o->op_private |= OPpLOCALE;
4545 if (o->op_flags & OPf_STACKED) {
4546 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4548 kid = kUNOP->op_first; /* get past rv2gv */
4550 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4552 if (kid->op_type == OP_SCOPE) {
4556 else if (kid->op_type == OP_LEAVE) {
4557 if (o->op_type == OP_SORT) {
4558 null(kid); /* wipe out leave */
4561 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4562 if (k->op_next == kid)
4567 kid->op_next = 0; /* just disconnect the leave */
4568 k = kLISTOP->op_first;
4572 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4573 null(kid); /* wipe out rv2gv */
4574 if (o->op_type == OP_SORT)
4578 o->op_flags |= OPf_SPECIAL;
4592 if (o->op_flags & OPf_STACKED)
4593 return no_fh_allowed(o);
4595 kid = cLISTOPo->op_first;
4596 if (kid->op_type != OP_NULL)
4597 croak("panic: ck_split");
4598 kid = kid->op_sibling;
4599 op_free(cLISTOPo->op_first);
4600 cLISTOPo->op_first = kid;
4602 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4603 cLISTOPo->op_last = kid; /* There was only one element previously */
4606 if (kid->op_type != OP_MATCH) {
4607 OP *sibl = kid->op_sibling;
4608 kid->op_sibling = 0;
4609 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4610 if (cLISTOPo->op_first == cLISTOPo->op_last)
4611 cLISTOPo->op_last = kid;
4612 cLISTOPo->op_first = kid;
4613 kid->op_sibling = sibl;
4616 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4617 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4621 kid->op_type = OP_PUSHRE;
4622 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4625 if (!kid->op_sibling)
4626 append_elem(OP_SPLIT, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4628 kid = kid->op_sibling;
4631 if (!kid->op_sibling)
4632 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4634 kid = kid->op_sibling;
4637 if (kid->op_sibling)
4638 return too_many_arguments(o,op_desc[o->op_type]);
4648 OP *prev = ((cUNOPo->op_first->op_sibling)
4649 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4650 OP *o2 = prev->op_sibling;
4658 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4659 if (cvop->op_type == OP_RV2CV) {
4661 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4662 null(cvop); /* disable rv2cv */
4663 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4664 if (tmpop->op_type == OP_GV) {
4665 cv = GvCVu(tmpop->op_sv);
4666 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4667 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4668 proto = SvPV((SV*)cv, na);
4672 o->op_private |= (hints & HINT_STRICT_REFS);
4673 if (PERLDB_SUB && curstash != debstash)
4674 o->op_private |= OPpENTERSUB_DB;
4675 while (o2 != cvop) {
4679 return too_many_arguments(o, gv_ename(namegv));
4697 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4698 bad_type(arg, "block", gv_ename(namegv), o2);
4703 if (o2->op_type == OP_RV2GV)
4707 o2 = newUNOP(OP_RV2GV, 0, kid);
4708 o2->op_sibling = kid->op_sibling;
4709 kid->op_sibling = 0;
4710 prev->op_sibling = o;
4718 if (o2->op_type != OP_RV2GV)
4719 bad_type(arg, "symbol", gv_ename(namegv), o2);
4722 if (o2->op_type != OP_RV2CV)
4723 bad_type(arg, "sub", gv_ename(namegv), o2);
4726 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4727 bad_type(arg, "scalar", gv_ename(namegv), o2);
4730 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4731 bad_type(arg, "array", gv_ename(namegv), o2);
4734 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4735 bad_type(arg, "hash", gv_ename(namegv), o2);
4739 o2 = newUNOP(OP_REFGEN, 0, kid);
4740 o2->op_sibling = kid->op_sibling;
4741 kid->op_sibling = 0;
4742 prev->op_sibling = o2;
4753 croak("Malformed prototype for %s: %s",
4754 gv_ename(namegv), SvPV((SV*)cv, na));
4759 mod(o2, OP_ENTERSUB);
4761 o2 = o2->op_sibling;
4763 if (proto && !optional &&
4764 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4765 return too_few_arguments(o, gv_ename(namegv));
4773 SvREADONLY_on(cSVOPo->op_sv);
4781 if (o->op_flags & OPf_KIDS) {
4782 SVOP *kid = (SVOP*)cUNOPo->op_first;
4784 if (kid->op_type == OP_NULL)
4785 kid = (SVOP*)kid->op_sibling;
4787 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4788 o->op_flags |= OPf_SPECIAL;
4793 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4800 register OP* oldop = 0;
4801 if (!o || o->op_seq)
4806 for (; o; o = o->op_next) {
4812 switch (o->op_type) {
4815 curcop = ((COP*)o); /* for warnings */
4816 o->op_seq = op_seqmax++;
4827 if (o->op_next->op_type == OP_STRINGIFY)
4829 o->op_seq = op_seqmax++;
4832 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4833 o->op_seq = op_seqmax++;
4834 break; /* Scalar stub must produce undef. List stub is noop */
4838 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4839 curcop = ((COP*)op);
4845 if (oldop && o->op_next) {
4846 oldop->op_next = o->op_next;
4849 o->op_seq = op_seqmax++;
4853 if (o->op_next->op_type == OP_RV2SV) {
4854 if (!(o->op_next->op_private & OPpDEREF)) {
4856 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4857 o->op_next = o->op_next->op_next;
4858 o->op_type = OP_GVSV;
4859 o->op_ppaddr = ppaddr[OP_GVSV];
4862 else if (o->op_next->op_type == OP_RV2AV) {
4863 OP* pop = o->op_next->op_next;
4865 if (pop->op_type == OP_CONST &&
4866 (op = pop->op_next) &&
4867 pop->op_next->op_type == OP_AELEM &&
4868 !(pop->op_next->op_private &
4869 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4870 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4874 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4878 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4879 o->op_next = pop->op_next->op_next;
4880 o->op_type = OP_AELEMFAST;
4881 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4882 o->op_private = (U8)i;
4883 GvAVn(((GVOP*)o)->op_gv);
4886 o->op_seq = op_seqmax++;
4893 o->op_seq = op_seqmax++;
4894 peep(cLOGOP->op_other);
4898 o->op_seq = op_seqmax++;
4899 peep(cCONDOP->op_true);
4900 peep(cCONDOP->op_false);
4904 o->op_seq = op_seqmax++;
4905 peep(cLOOP->op_redoop);
4906 peep(cLOOP->op_nextop);
4907 peep(cLOOP->op_lastop);
4912 o->op_seq = op_seqmax++;
4913 peep(cPMOP->op_pmreplstart);
4917 o->op_seq = op_seqmax++;
4918 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4919 if (o->op_next->op_sibling &&
4920 o->op_next->op_sibling->op_type != OP_DIE) {
4921 line_t oldline = curcop->cop_line;
4923 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4924 warn("Statement unlikely to be reached");
4925 warn("(Maybe you meant system() when you said exec()?)\n");
4926 curcop->cop_line = oldline;
4940 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4941 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4943 rop = (UNOP*)((BINOP*)o)->op_first;
4944 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4946 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4947 if (!SvOBJECT(lexname))
4949 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4950 if (!fields || !GvHV(*fields))
4952 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4953 key = SvPV(*svp, keylen);
4954 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4956 croak("No such field \"%s\" in variable %s of type %s",
4957 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4959 ind = SvIV(*indsvp);
4961 croak("Bad index while coercing array into hash");
4962 rop->op_type = OP_RV2AV;
4963 rop->op_ppaddr = ppaddr[OP_RV2AV];
4964 o->op_type = OP_AELEM;
4965 o->op_ppaddr = ppaddr[OP_AELEM];
4967 *svp = newSViv(ind);
4972 o->op_seq = op_seqmax++;