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));
43 static OP *newDEFSVOP _((void));
44 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
49 SV* tmpsv = sv_newmortal();
50 gv_efullname3(tmpsv, gv, Nullch);
51 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(OP *o, char *name)
65 yyerror(form("Not enough arguments for %s", name));
70 too_many_arguments(OP *o, char *name)
72 yyerror(form("Too many arguments for %s", name));
77 bad_type(I32 n, char *t, char *name, OP *kid)
79 yyerror(form("Type of arg %d to %s must be %s (not %s)",
80 (int)n, name, t, op_desc[kid->op_type]));
86 int type = o->op_type;
87 if (type != OP_AELEM && type != OP_HELEM) {
88 yyerror(form("Can't use subscript on %s", op_desc[type]));
89 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
92 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
93 type == OP_ENTERSUB ? '&' : '%'));
97 sv_catsv(GvSV(errgv), msg);
99 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
104 /* "register" allocation */
107 pad_allocmy(char *name)
113 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
114 if (!isPRINT(name[1])) {
116 name[2] = toCTRL(name[1]);
119 croak("Can't use global %s in \"my\"",name);
121 if (dowarn && AvFILLp(comppad_name) >= 0) {
122 SV **svp = AvARRAY(comppad_name);
123 for (off = AvFILLp(comppad_name); off > comppad_name_floor; off--) {
126 && SvIVX(sv) == 999999999 /* var is in open scope */
127 && strEQ(name, SvPVX(sv)))
129 warn("\"my\" variable %s masks earlier declaration in same scope", name);
134 off = pad_alloc(OP_PADSV, SVs_PADMY);
136 sv_upgrade(sv, SVt_PVNV);
140 croak("Can't declare class for non-scalar %s in \"my\"",name);
142 (void)SvUPGRADE(sv, SVt_PVMG);
143 SvSTASH(sv) = (HV*)SvREFCNT_inc(in_my_stash);
146 av_store(comppad_name, off, sv);
147 SvNVX(sv) = (double)999999999;
148 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
149 if (!min_intro_pending)
150 min_intro_pending = off;
151 max_intro_pending = off;
153 av_store(comppad, off, (SV*)newAV());
154 else if (*name == '%')
155 av_store(comppad, off, (SV*)newHV());
156 SvPADMY_on(curpad[off]);
161 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
168 register PERL_CONTEXT *cx;
171 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
172 AV *curlist = CvPADLIST(cv);
173 SV **svp = av_fetch(curlist, 0, FALSE);
176 if (!svp || *svp == &sv_undef)
179 svp = AvARRAY(curname);
180 for (off = AvFILLp(curname); off > 0; off--) {
181 if ((sv = svp[off]) &&
184 seq > I_32(SvNVX(sv)) &&
185 strEQ(SvPVX(sv), name))
196 return 0; /* don't clone from inactive stack frame */
200 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
201 oldsv = *av_fetch(oldpad, off, TRUE);
202 if (!newoff) { /* Not a mere clone operation. */
203 SV *namesv = NEWSV(1103,0);
204 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
205 sv_upgrade(namesv, SVt_PVNV);
206 sv_setpv(namesv, name);
207 av_store(comppad_name, newoff, namesv);
208 SvNVX(namesv) = (double)curcop->cop_seq;
209 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
210 SvFAKE_on(namesv); /* A ref, not a real var */
211 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
212 /* "It's closures all the way down." */
216 oldsv = Nullsv; /* no need to keep ref */
221 bcv && bcv != cv && !CvCLONE(bcv);
222 bcv = CvOUTSIDE(bcv)) {
226 if (dowarn && !CvUNIQUE(cv))
228 "Variable \"%s\" may be unavailable",
235 else if (!CvUNIQUE(compcv)) {
236 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
237 warn("Variable \"%s\" will not stay shared", name);
240 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
246 /* Nothing in current lexical context--try eval's context, if any.
247 * This is necessary to let the perldb get at lexically scoped variables.
248 * XXX This will also probably interact badly with eval tree caching.
252 for (i = cx_ix; i >= 0; i--) {
254 switch (cx->cx_type) {
256 if (i == 0 && saweval) {
257 seq = cxstack[saweval].blk_oldcop->cop_seq;
258 return pad_findlex(name, newoff, seq, main_cv, 0);
262 switch (cx->blk_eval.old_op_type) {
267 /* require must have its own scope */
275 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
276 saweval = i; /* so we know where we were called from */
279 seq = cxstack[saweval].blk_oldcop->cop_seq;
280 return pad_findlex(name, newoff, seq, cv, i-1);
288 pad_findmy(char *name)
294 SV **svp = AvARRAY(comppad_name);
295 U32 seq = cop_seqmax;
299 * Special case to get lexical (and hence per-thread) @_.
300 * XXX I need to find out how to tell at parse-time whether use
301 * of @_ should refer to a lexical (from a sub) or defgv (global
302 * scope and maybe weird sub-ish things like formats). See
303 * startsub in perly.y. It's possible that @_ could be lexical
304 * (at least from subs) even in non-threaded perl.
306 if (strEQ(name, "@_"))
307 return 0; /* success. (NOT_IN_PAD indicates failure) */
308 #endif /* USE_THREADS */
310 /* The one we're looking for is probably just before comppad_name_fill. */
311 for (off = AvFILLp(comppad_name); off > 0; off--) {
312 if ((sv = svp[off]) &&
316 seq > I_32(SvNVX(sv)))) &&
317 strEQ(SvPVX(sv), name))
320 return (PADOFFSET)off;
321 pendoff = off; /* this pending def. will override import */
325 /* See if it's in a nested scope */
326 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
328 /* If there is a pending local definition, this new alias must die */
330 SvIVX(AvARRAY(comppad_name)[off]) = seq;
331 return off; /* pad_findlex returns 0 for failure...*/
333 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
337 pad_leavemy(I32 fill)
340 SV **svp = AvARRAY(comppad_name);
342 if (min_intro_pending && fill < min_intro_pending) {
343 for (off = max_intro_pending; off >= min_intro_pending; off--) {
344 if ((sv = svp[off]) && sv != &sv_undef)
345 warn("%s never introduced", SvPVX(sv));
348 /* "Deintroduce" my variables that are leaving with this scope. */
349 for (off = AvFILLp(comppad_name); off > fill; off--) {
350 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
351 SvIVX(sv) = cop_seqmax;
356 pad_alloc(I32 optype, U32 tmptype)
362 if (AvARRAY(comppad) != curpad)
363 croak("panic: pad_alloc");
364 if (pad_reset_pending)
366 if (tmptype & SVs_PADMY) {
368 sv = *av_fetch(comppad, AvFILLp(comppad) + 1, TRUE);
369 } while (SvPADBUSY(sv)); /* need a fresh one */
370 retval = AvFILLp(comppad);
373 SV **names = AvARRAY(comppad_name);
374 SSize_t names_fill = AvFILLp(comppad_name);
377 * "foreach" index vars temporarily become aliases to non-"my"
378 * values. Thus we must skip, not just pad values that are
379 * marked as current pad values, but also those with names.
381 if (++padix <= names_fill &&
382 (sv = names[padix]) && sv != &sv_undef)
384 sv = *av_fetch(comppad, padix, TRUE);
385 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
390 SvFLAGS(sv) |= tmptype;
391 curpad = AvARRAY(comppad);
393 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
394 (unsigned long) thr, (unsigned long) curpad,
395 (long) retval, op_name[optype]));
397 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
398 (unsigned long) curpad,
399 (long) retval, op_name[optype]));
400 #endif /* USE_THREADS */
401 return (PADOFFSET)retval;
409 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
410 (unsigned long) thr, (unsigned long) curpad, po));
413 croak("panic: pad_sv po");
414 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
415 (unsigned long) curpad, po));
416 #endif /* USE_THREADS */
417 return curpad[po]; /* eventually we'll turn this into a macro */
421 pad_free(PADOFFSET po)
426 if (AvARRAY(comppad) != curpad)
427 croak("panic: pad_free curpad");
429 croak("panic: pad_free po");
431 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
432 (unsigned long) thr, (unsigned long) curpad, po));
434 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
435 (unsigned long) curpad, po));
436 #endif /* USE_THREADS */
437 if (curpad[po] && curpad[po] != &sv_undef)
438 SvPADTMP_off(curpad[po]);
444 pad_swipe(PADOFFSET po)
447 if (AvARRAY(comppad) != curpad)
448 croak("panic: pad_swipe curpad");
450 croak("panic: pad_swipe po");
452 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
453 (unsigned long) thr, (unsigned long) curpad, po));
455 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
456 (unsigned long) curpad, po));
457 #endif /* USE_THREADS */
458 SvPADTMP_off(curpad[po]);
459 curpad[po] = NEWSV(1107,0);
460 SvPADTMP_on(curpad[po]);
465 /* XXX pad_reset() is currently disabled because it results in serious bugs.
466 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
467 * on the stack by OPs that use them, there are several ways to get an alias
468 * to a shared TARG. Such an alias will change randomly and unpredictably.
469 * We avoid doing this until we can think of a Better Way.
474 #ifdef USE_BROKEN_PAD_RESET
478 if (AvARRAY(comppad) != curpad)
479 croak("panic: pad_reset curpad");
481 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
482 (unsigned long) thr, (unsigned long) curpad));
484 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
485 (unsigned long) curpad));
486 #endif /* USE_THREADS */
487 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
488 for (po = AvMAX(comppad); po > padix_floor; po--) {
489 if (curpad[po] && !SvIMMORTAL(curpad[po]))
490 SvPADTMP_off(curpad[po]);
495 pad_reset_pending = FALSE;
499 /* find_threadsv is not reentrant */
501 find_threadsv(char *name)
507 /* We currently only handle names of a single character */
508 p = strchr(threadsv_names, *name);
511 key = p - threadsv_names;
512 svp = av_fetch(thr->threadsv, key, FALSE);
514 SV *sv = NEWSV(0, 0);
515 av_store(thr->threadsv, key, sv);
516 thr->threadsvp = AvARRAY(thr->threadsv);
518 * Some magic variables used to be automagically initialised
519 * in gv_fetchpv. Those which are now per-thread magicals get
520 * initialised here instead.
526 sv_setpv(sv, "\034");
527 sv_magic(sv, 0, 0, name, 1);
536 /* XXX %! tied to Errno.pm needs to be added here.
537 * See gv_fetchpv(). */
541 sv_magic(sv, 0, 0, name, 1);
543 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
544 "find_threadsv: new SV %p for $%s%c\n",
545 sv, (*name < 32) ? "^" : "",
546 (*name < 32) ? toCTRL(*name) : *name));
550 #endif /* USE_THREADS */
557 register OP *kid, *nextkid;
559 if (!o || o->op_seq == (U16)-1)
562 if (o->op_flags & OPf_KIDS) {
563 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
564 nextkid = kid->op_sibling; /* Get before next freeing kid */
569 switch (o->op_type) {
571 o->op_targ = 0; /* Was holding old type, if any. */
574 o->op_targ = 0; /* Was holding hints. */
578 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
580 #endif /* USE_THREADS */
582 if (!(o->op_flags & OPf_REF) || (check[o->op_type] != ck_ftst))
588 SvREFCNT_dec(cGVOPo->op_gv);
592 Safefree(cCOPo->cop_label);
593 SvREFCNT_dec(cCOPo->cop_filegv);
596 SvREFCNT_dec(cSVOPo->op_sv);
602 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
606 Safefree(cPVOPo->op_pv);
609 op_free(cPMOPo->op_pmreplroot);
613 ReREFCNT_dec(cPMOPo->op_pmregexp);
618 pad_free(o->op_targ);
626 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
627 pad_free(o->op_targ);
628 o->op_targ = o->op_type;
629 o->op_type = OP_NULL;
630 o->op_ppaddr = ppaddr[OP_NULL];
633 /* Contextualizers */
635 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
645 /* establish postfix order */
646 if (cUNOPo->op_first) {
647 o->op_next = LINKLIST(cUNOPo->op_first);
648 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
650 kid->op_next = LINKLIST(kid->op_sibling);
665 if (o && o->op_flags & OPf_KIDS) {
666 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
676 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
678 line_t oldline = curcop->cop_line;
680 if (copline != NOLINE)
681 curcop->cop_line = copline;
682 warn("Found = in conditional, should be ==");
683 curcop->cop_line = oldline;
693 /* assumes no premature commitment */
694 if (!o || (o->op_flags & OPf_WANT) || error_count
695 || o->op_type == OP_RETURN)
698 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
700 switch (o->op_type) {
702 if (o->op_private & OPpREPEAT_DOLIST)
703 null(((LISTOP*)cBINOPo->op_first)->op_first);
704 scalar(cBINOPo->op_first);
709 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
713 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
714 if (!kPMOP->op_pmreplroot)
715 deprecate("implicit split to @_");
722 if (o->op_flags & OPf_KIDS) {
723 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
729 kid = cLISTOPo->op_first;
731 while (kid = kid->op_sibling) {
737 WITH_THR(curcop = &compiling);
742 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
748 WITH_THR(curcop = &compiling);
761 /* assumes no premature commitment */
762 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
763 || o->op_type == OP_RETURN)
766 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
768 switch (o->op_type) {
770 if (!(opargs[o->op_type] & OA_FOLDCONST))
774 if (o->op_flags & OPf_STACKED)
845 if (!(o->op_private & OPpLVAL_INTRO))
846 useless = op_desc[o->op_type];
853 if (!(o->op_private & OPpLVAL_INTRO) &&
854 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
855 useless = "a variable";
860 WITH_THR(curcop = ((COP*)o)); /* for warning below */
866 useless = "a constant";
867 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
869 else if (SvPOK(sv)) {
870 if (strnEQ(SvPVX(sv), "di", 2) ||
871 strnEQ(SvPVX(sv), "ds", 2) ||
872 strnEQ(SvPVX(sv), "ig", 2))
876 null(o); /* don't execute a constant */
877 SvREFCNT_dec(sv); /* don't even remember it */
881 o->op_type = OP_PREINC; /* pre-increment is faster */
882 o->op_ppaddr = ppaddr[OP_PREINC];
886 o->op_type = OP_PREDEC; /* pre-decrement is faster */
887 o->op_ppaddr = ppaddr[OP_PREDEC];
893 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
898 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
899 WITH_THR(curcop = ((COP*)o)); /* for warning below */
900 if (o->op_flags & OPf_STACKED)
906 if (!(o->op_flags & OPf_KIDS))
915 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
922 /* all requires must return a boolean value */
923 o->op_flags &= ~OPf_WANT;
926 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
927 if (!kPMOP->op_pmreplroot)
928 deprecate("implicit split to @_");
932 if (useless && dowarn)
933 warn("Useless use of %s in void context", useless);
941 if (o && o->op_flags & OPf_KIDS) {
942 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
953 /* assumes no premature commitment */
954 if (!o || (o->op_flags & OPf_WANT) || error_count
955 || o->op_type == OP_RETURN)
958 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
960 switch (o->op_type) {
963 list(cBINOPo->op_first);
968 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
975 if (!(o->op_flags & OPf_KIDS))
977 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
978 list(cBINOPo->op_first);
979 return gen_constant_list(o);
986 kid = cLISTOPo->op_first;
988 while (kid = kid->op_sibling) {
994 WITH_THR(curcop = &compiling);
998 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1004 WITH_THR(curcop = &compiling);
1007 /* all requires must return a boolean value */
1008 o->op_flags &= ~OPf_WANT;
1020 if (o->op_type == OP_LINESEQ ||
1021 o->op_type == OP_SCOPE ||
1022 o->op_type == OP_LEAVE ||
1023 o->op_type == OP_LEAVETRY)
1026 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1027 if (kid->op_sibling) {
1031 curcop = &compiling;
1033 o->op_flags &= ~OPf_PARENS;
1034 if (hints & HINT_BLOCK_SCOPE)
1035 o->op_flags |= OPf_PARENS;
1038 o = newOP(OP_STUB, 0);
1043 modkids(OP *o, I32 type)
1046 if (o && o->op_flags & OPf_KIDS) {
1047 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1054 mod(OP *o, I32 type)
1060 if (!o || error_count)
1063 switch (o->op_type) {
1068 if (!(o->op_private & (OPpCONST_ARYBASE)))
1070 if (eval_start && eval_start->op_type == OP_CONST) {
1071 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1075 SAVEI32(compiling.cop_arybase);
1076 compiling.cop_arybase = 0;
1078 else if (type == OP_REFGEN)
1081 croak("That use of $[ is unsupported");
1084 if (o->op_flags & OPf_PARENS)
1088 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1089 !(o->op_flags & OPf_STACKED)) {
1090 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1091 o->op_ppaddr = ppaddr[OP_RV2CV];
1092 assert(cUNOPo->op_first->op_type == OP_NULL);
1093 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1099 /* grep, foreach, subcalls, refgen */
1100 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1102 yyerror(form("Can't modify %s in %s",
1103 op_desc[o->op_type],
1104 type ? op_desc[type] : "local"));
1118 case OP_RIGHT_SHIFT:
1127 if (!(o->op_flags & OPf_STACKED))
1133 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1139 if (!type && cUNOPo->op_first->op_type != OP_GV)
1140 croak("Can't localize through a reference");
1141 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1143 return o; /* Treat \(@foo) like ordinary list. */
1147 if (scalar_mod_type(o, type))
1149 ref(cUNOPo->op_first, o->op_type);
1161 if (!type && cUNOPo->op_first->op_type != OP_GV)
1162 croak("Can't localize through a reference");
1163 ref(cUNOPo->op_first, o->op_type);
1167 hints |= HINT_BLOCK_SCOPE;
1176 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1177 return o; /* Treat \(@foo) like ordinary list. */
1178 if (scalar_mod_type(o, type))
1184 croak("Can't localize lexical variable %s",
1185 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1190 modcount++; /* XXX ??? */
1192 #endif /* USE_THREADS */
1198 if (type != OP_SASSIGN)
1204 pad_free(o->op_targ);
1205 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1206 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1207 if (o->op_flags & OPf_KIDS)
1208 mod(cBINOPo->op_first->op_sibling, type);
1213 ref(cBINOPo->op_first, o->op_type);
1214 if (type == OP_ENTERSUB &&
1215 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1216 o->op_private |= OPpLVAL_DEFER;
1223 if (o->op_flags & OPf_KIDS)
1224 mod(cLISTOPo->op_last, type);
1228 if (!(o->op_flags & OPf_KIDS))
1230 if (o->op_targ != OP_LIST) {
1231 mod(cBINOPo->op_first, type);
1236 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1240 o->op_flags |= OPf_MOD;
1242 if (type == OP_AASSIGN || type == OP_SASSIGN)
1243 o->op_flags |= OPf_SPECIAL|OPf_REF;
1245 o->op_private |= OPpLVAL_INTRO;
1246 o->op_flags &= ~OPf_SPECIAL;
1247 hints |= HINT_BLOCK_SCOPE;
1249 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1250 o->op_flags |= OPf_REF;
1255 scalar_mod_type(OP *o, I32 type)
1259 if (o->op_type == OP_RV2GV)
1283 case OP_RIGHT_SHIFT:
1290 case OP_ANDASSIGN: /* may work later */
1291 case OP_ORASSIGN: /* may work later */
1299 refkids(OP *o, I32 type)
1302 if (o && o->op_flags & OPf_KIDS) {
1303 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1310 ref(OP *o, I32 type)
1314 if (!o || error_count)
1317 switch (o->op_type) {
1319 if ((type == OP_DEFINED || type == OP_LOCK) &&
1320 !(o->op_flags & OPf_STACKED)) {
1321 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1322 o->op_ppaddr = ppaddr[OP_RV2CV];
1323 assert(cUNOPo->op_first->op_type == OP_NULL);
1324 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1325 o->op_flags |= OPf_SPECIAL;
1330 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1334 ref(cUNOPo->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;
1346 o->op_flags |= OPf_MOD; /* XXX ??? */
1351 o->op_flags |= OPf_REF;
1354 ref(cUNOPo->op_first, o->op_type);
1359 o->op_flags |= OPf_REF;
1364 if (!(o->op_flags & OPf_KIDS))
1366 ref(cBINOPo->op_first, type);
1370 ref(cBINOPo->op_first, o->op_type);
1371 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1372 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1373 : type == OP_RV2HV ? OPpDEREF_HV
1375 o->op_flags |= OPf_MOD;
1383 if (!(o->op_flags & OPf_KIDS))
1385 ref(cLISTOPo->op_last, type);
1400 if (!o || error_count)
1404 if (type == OP_LIST) {
1405 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1407 } else if (type == OP_UNDEF) {
1409 } else if (type != OP_PADSV &&
1412 type != OP_PUSHMARK)
1414 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1417 o->op_flags |= OPf_MOD;
1418 o->op_private |= OPpLVAL_INTRO;
1426 o->op_flags |= OPf_PARENS;
1431 bind_match(I32 type, OP *left, OP *right)
1436 (left->op_type == OP_RV2AV ||
1437 left->op_type == OP_RV2HV ||
1438 left->op_type == OP_PADAV ||
1439 left->op_type == OP_PADHV)) {
1440 char *desc = op_desc[(right->op_type == OP_SUBST ||
1441 right->op_type == OP_TRANS)
1442 ? right->op_type : OP_MATCH];
1443 char *sample = ((left->op_type == OP_RV2AV ||
1444 left->op_type == OP_PADAV)
1445 ? "@array" : "%hash");
1446 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1449 if (right->op_type == OP_MATCH ||
1450 right->op_type == OP_SUBST ||
1451 right->op_type == OP_TRANS) {
1452 right->op_flags |= OPf_STACKED;
1453 if (right->op_type != OP_MATCH)
1454 left = mod(left, right->op_type);
1455 if (right->op_type == OP_TRANS)
1456 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1458 o = prepend_elem(right->op_type, scalar(left), right);
1460 return newUNOP(OP_NOT, 0, scalar(o));
1464 return bind_match(type, left,
1465 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1473 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1474 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1481 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1482 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1483 o->op_type = OP_LEAVE;
1484 o->op_ppaddr = ppaddr[OP_LEAVE];
1487 if (o->op_type == OP_LINESEQ) {
1489 o->op_type = OP_SCOPE;
1490 o->op_ppaddr = ppaddr[OP_SCOPE];
1491 kid = ((LISTOP*)o)->op_first;
1492 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1493 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1498 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1505 block_start(int full)
1508 int retval = savestack_ix;
1509 SAVEI32(comppad_name_floor);
1511 if ((comppad_name_fill = AvFILLp(comppad_name)) > 0)
1512 comppad_name_floor = comppad_name_fill;
1514 comppad_name_floor = 0;
1516 SAVEI32(min_intro_pending);
1517 SAVEI32(max_intro_pending);
1518 min_intro_pending = 0;
1519 SAVEI32(comppad_name_fill);
1520 SAVEI32(padix_floor);
1521 padix_floor = padix;
1522 pad_reset_pending = FALSE;
1524 hints &= ~HINT_BLOCK_SCOPE;
1529 block_end(I32 floor, OP *seq)
1532 int needblockscope = hints & HINT_BLOCK_SCOPE;
1533 OP* retval = scalarseq(seq);
1535 pad_reset_pending = FALSE;
1537 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1538 pad_leavemy(comppad_name_fill);
1547 OP *o = newOP(OP_THREADSV, 0);
1548 o->op_targ = find_threadsv("_");
1551 return newSVREF(newGVOP(OP_GV, 0, defgv));
1552 #endif /* USE_THREADS */
1560 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1561 eval_start = linklist(eval_root);
1562 eval_root->op_next = 0;
1568 main_root = scope(sawparens(scalarvoid(o)));
1569 curcop = &compiling;
1570 main_start = LINKLIST(main_root);
1571 main_root->op_next = 0;
1575 /* Register with debugger */
1577 CV *cv = perl_get_cv("DB::postponed", FALSE);
1581 XPUSHs((SV*)compiling.cop_filegv);
1583 perl_call_sv((SV*)cv, G_DISCARD);
1590 localize(OP *o, I32 lex)
1592 if (o->op_flags & OPf_PARENS)
1595 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1597 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1598 if (*s == ';' || *s == '=')
1599 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1603 in_my_stash = Nullhv;
1607 return mod(o, OP_NULL); /* a bit kludgey */
1613 if (o->op_type == OP_LIST) {
1616 o2 = newOP(OP_THREADSV, 0);
1617 o2->op_targ = find_threadsv(";");
1619 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1620 #endif /* USE_THREADS */
1621 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1627 fold_constants(register OP *o)
1631 I32 type = o->op_type;
1634 if (opargs[type] & OA_RETSCALAR)
1636 if (opargs[type] & OA_TARGET)
1637 o->op_targ = pad_alloc(type, SVs_PADTMP);
1639 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1640 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1642 if (!(opargs[type] & OA_FOLDCONST))
1657 if (o->op_private & OPpLOCALE)
1662 goto nope; /* Don't try to run w/ errors */
1664 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1665 if (curop->op_type != OP_CONST &&
1666 curop->op_type != OP_LIST &&
1667 curop->op_type != OP_SCALAR &&
1668 curop->op_type != OP_NULL &&
1669 curop->op_type != OP_PUSHMARK) {
1674 curop = LINKLIST(o);
1679 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1680 pad_swipe(o->op_targ);
1681 else if (SvTEMP(sv)) { /* grab mortal temp? */
1682 (void)SvREFCNT_inc(sv);
1686 if (type == OP_RV2GV)
1687 return newGVOP(OP_GV, 0, (GV*)sv);
1689 /* try to smush double to int, but don't smush -2.0 to -2 */
1690 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1694 if ((double)iv == SvNV(sv)) {
1699 SvIOK_off(sv); /* undo SvIV() damage */
1701 return newSVOP(OP_CONST, 0, sv);
1705 if (!(opargs[type] & OA_OTHERINT))
1708 if (!(hints & HINT_INTEGER)) {
1709 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1712 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1713 if (curop->op_type == OP_CONST) {
1714 if (SvIOK(((SVOP*)curop)->op_sv))
1718 if (opargs[curop->op_type] & OA_RETINTEGER)
1722 o->op_ppaddr = ppaddr[++(o->op_type)];
1729 gen_constant_list(register OP *o)
1733 I32 oldtmps_floor = tmps_floor;
1737 return o; /* Don't attempt to run with errors */
1739 op = curop = LINKLIST(o);
1745 tmps_floor = oldtmps_floor;
1747 o->op_type = OP_RV2AV;
1748 o->op_ppaddr = ppaddr[OP_RV2AV];
1749 curop = ((UNOP*)o)->op_first;
1750 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1757 convert(I32 type, I32 flags, OP *o)
1762 if (!o || o->op_type != OP_LIST)
1763 o = newLISTOP(OP_LIST, 0, o, Nullop);
1765 o->op_flags &= ~OPf_WANT;
1767 if (!(opargs[type] & OA_MARK))
1768 null(cLISTOPo->op_first);
1771 o->op_ppaddr = ppaddr[type];
1772 o->op_flags |= flags;
1774 o = CHECKOP(type, o);
1775 if (o->op_type != type)
1778 if (cLISTOPo->op_children < 7) {
1779 /* XXX do we really need to do this if we're done appending?? */
1780 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1782 cLISTOPo->op_last = last; /* in case check substituted last arg */
1785 return fold_constants(o);
1788 /* List constructors */
1791 append_elem(I32 type, OP *first, OP *last)
1799 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1800 return newLISTOP(type, 0, first, last);
1802 if (first->op_flags & OPf_KIDS)
1803 ((LISTOP*)first)->op_last->op_sibling = last;
1805 first->op_flags |= OPf_KIDS;
1806 ((LISTOP*)first)->op_first = last;
1808 ((LISTOP*)first)->op_last = last;
1809 ((LISTOP*)first)->op_children++;
1814 append_list(I32 type, LISTOP *first, LISTOP *last)
1822 if (first->op_type != type)
1823 return prepend_elem(type, (OP*)first, (OP*)last);
1825 if (last->op_type != type)
1826 return append_elem(type, (OP*)first, (OP*)last);
1828 first->op_last->op_sibling = last->op_first;
1829 first->op_last = last->op_last;
1830 first->op_children += last->op_children;
1831 if (first->op_children)
1832 last->op_flags |= OPf_KIDS;
1839 prepend_elem(I32 type, OP *first, OP *last)
1847 if (last->op_type == type) {
1848 if (type == OP_LIST) { /* already a PUSHMARK there */
1849 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1850 ((LISTOP*)last)->op_first->op_sibling = first;
1853 if (!(last->op_flags & OPf_KIDS)) {
1854 ((LISTOP*)last)->op_last = first;
1855 last->op_flags |= OPf_KIDS;
1857 first->op_sibling = ((LISTOP*)last)->op_first;
1858 ((LISTOP*)last)->op_first = first;
1860 ((LISTOP*)last)->op_children++;
1864 return newLISTOP(type, 0, first, last);
1872 return newOP(OP_STUB, 0);
1878 if (!o || o->op_type != OP_LIST)
1879 o = newLISTOP(OP_LIST, 0, o, Nullop);
1885 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1889 Newz(1101, listop, 1, LISTOP);
1891 listop->op_type = type;
1892 listop->op_ppaddr = ppaddr[type];
1893 listop->op_children = (first != 0) + (last != 0);
1894 listop->op_flags = flags;
1898 else if (!first && last)
1901 first->op_sibling = last;
1902 listop->op_first = first;
1903 listop->op_last = last;
1904 if (type == OP_LIST) {
1906 pushop = newOP(OP_PUSHMARK, 0);
1907 pushop->op_sibling = first;
1908 listop->op_first = pushop;
1909 listop->op_flags |= OPf_KIDS;
1911 listop->op_last = pushop;
1913 else if (listop->op_children)
1914 listop->op_flags |= OPf_KIDS;
1920 newOP(I32 type, I32 flags)
1923 Newz(1101, o, 1, OP);
1925 o->op_ppaddr = ppaddr[type];
1926 o->op_flags = flags;
1929 o->op_private = 0 + (flags >> 8);
1930 if (opargs[type] & OA_RETSCALAR)
1932 if (opargs[type] & OA_TARGET)
1933 o->op_targ = pad_alloc(type, SVs_PADTMP);
1934 return CHECKOP(type, o);
1938 newUNOP(I32 type, I32 flags, OP *first)
1943 first = newOP(OP_STUB, 0);
1944 if (opargs[type] & OA_MARK)
1945 first = force_list(first);
1947 Newz(1101, unop, 1, UNOP);
1948 unop->op_type = type;
1949 unop->op_ppaddr = ppaddr[type];
1950 unop->op_first = first;
1951 unop->op_flags = flags | OPf_KIDS;
1952 unop->op_private = 1 | (flags >> 8);
1954 if(type == OP_STUDY && first->op_type == OP_MATCH) {
1955 first->op_type = OP_PUSHRE;
1956 first->op_ppaddr = ppaddr[OP_PUSHRE];
1959 unop = (UNOP*) CHECKOP(type, unop);
1963 return fold_constants((OP *) unop);
1967 newBINOP(I32 type, I32 flags, OP *first, OP *last)
1970 Newz(1101, binop, 1, BINOP);
1973 first = newOP(OP_NULL, 0);
1975 binop->op_type = type;
1976 binop->op_ppaddr = ppaddr[type];
1977 binop->op_first = first;
1978 binop->op_flags = flags | OPf_KIDS;
1981 binop->op_private = 1 | (flags >> 8);
1984 binop->op_private = 2 | (flags >> 8);
1985 first->op_sibling = last;
1988 binop = (BINOP*)CHECKOP(type, binop);
1992 binop->op_last = last = binop->op_first->op_sibling;
1994 return fold_constants((OP *)binop);
1998 pmtrans(OP *o, OP *expr, OP *repl)
2000 SV *tstr = ((SVOP*)expr)->op_sv;
2001 SV *rstr = ((SVOP*)repl)->op_sv;
2004 register U8 *t = (U8*)SvPV(tstr, tlen);
2005 register U8 *r = (U8*)SvPV(rstr, rlen);
2011 register short *tbl;
2013 tbl = (short*)cPVOPo->op_pv;
2014 complement = o->op_private & OPpTRANS_COMPLEMENT;
2015 Delete = o->op_private & OPpTRANS_DELETE;
2016 squash = o->op_private & OPpTRANS_SQUASH;
2019 Zero(tbl, 256, short);
2020 for (i = 0; i < tlen; i++)
2022 for (i = 0, j = 0; i < 256; i++) {
2038 if (!rlen && !Delete) {
2041 o->op_private |= OPpTRANS_COUNTONLY;
2043 for (i = 0; i < 256; i++)
2045 for (i = 0, j = 0; i < tlen; i++,j++) {
2048 if (tbl[t[i]] == -1)
2054 if (tbl[t[i]] == -1)
2065 newPMOP(I32 type, I32 flags)
2070 Newz(1101, pmop, 1, PMOP);
2071 pmop->op_type = type;
2072 pmop->op_ppaddr = ppaddr[type];
2073 pmop->op_flags = flags;
2074 pmop->op_private = 0 | (flags >> 8);
2076 if (hints & HINT_LOCALE)
2077 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2079 /* link into pm list */
2080 if (type != OP_TRANS && curstash) {
2081 pmop->op_pmnext = HvPMROOT(curstash);
2082 HvPMROOT(curstash) = pmop;
2089 pmruntime(OP *o, OP *expr, OP *repl)
2094 if (o->op_type == OP_TRANS)
2095 return pmtrans(o, expr, repl);
2097 hints |= HINT_BLOCK_SCOPE;
2100 if (expr->op_type == OP_CONST) {
2102 SV *pat = ((SVOP*)expr)->op_sv;
2103 char *p = SvPV(pat, plen);
2104 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2105 sv_setpvn(pat, "\\s+", 3);
2106 p = SvPV(pat, plen);
2107 pm->op_pmflags |= PMf_SKIPWHITE;
2109 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2110 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2111 pm->op_pmflags |= PMf_WHITE;
2115 if (pm->op_pmflags & PMf_KEEP)
2116 expr = newUNOP(OP_REGCMAYBE,0,expr);
2118 Newz(1101, rcop, 1, LOGOP);
2119 rcop->op_type = OP_REGCOMP;
2120 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2121 rcop->op_first = scalar(expr);
2122 rcop->op_flags |= OPf_KIDS;
2123 rcop->op_private = 1;
2126 /* establish postfix order */
2127 if (pm->op_pmflags & PMf_KEEP) {
2129 rcop->op_next = expr;
2130 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2133 rcop->op_next = LINKLIST(expr);
2134 expr->op_next = (OP*)rcop;
2137 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2142 if (pm->op_pmflags & PMf_EVAL)
2145 else if (repl->op_type == OP_THREADSV
2146 && strchr("&`'123456789+",
2147 threadsv_names[repl->op_targ]))
2151 #endif /* USE_THREADS */
2152 else if (repl->op_type == OP_CONST)
2156 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2157 if (opargs[curop->op_type] & OA_DANGEROUS) {
2159 if (curop->op_type == OP_THREADSV
2160 && strchr("&`'123456789+", curop->op_private)) {
2164 if (curop->op_type == OP_GV) {
2165 GV *gv = ((GVOP*)curop)->op_gv;
2166 if (strchr("&`'123456789+", *GvENAME(gv)))
2169 #endif /* USE_THREADS */
2170 else if (curop->op_type == OP_RV2CV)
2172 else if (curop->op_type == OP_RV2SV ||
2173 curop->op_type == OP_RV2AV ||
2174 curop->op_type == OP_RV2HV ||
2175 curop->op_type == OP_RV2GV) {
2176 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2179 else if (curop->op_type == OP_PADSV ||
2180 curop->op_type == OP_PADAV ||
2181 curop->op_type == OP_PADHV ||
2182 curop->op_type == OP_PADANY) {
2191 if (curop == repl) {
2192 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2193 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2194 prepend_elem(o->op_type, scalar(repl), o);
2197 Newz(1101, rcop, 1, LOGOP);
2198 rcop->op_type = OP_SUBSTCONT;
2199 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2200 rcop->op_first = scalar(repl);
2201 rcop->op_flags |= OPf_KIDS;
2202 rcop->op_private = 1;
2205 /* establish postfix order */
2206 rcop->op_next = LINKLIST(repl);
2207 repl->op_next = (OP*)rcop;
2209 pm->op_pmreplroot = scalar((OP*)rcop);
2210 pm->op_pmreplstart = LINKLIST(rcop);
2219 newSVOP(I32 type, I32 flags, SV *sv)
2222 Newz(1101, svop, 1, SVOP);
2223 svop->op_type = type;
2224 svop->op_ppaddr = ppaddr[type];
2226 svop->op_next = (OP*)svop;
2227 svop->op_flags = flags;
2228 if (opargs[type] & OA_RETSCALAR)
2230 if (opargs[type] & OA_TARGET)
2231 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2232 return CHECKOP(type, svop);
2236 newGVOP(I32 type, I32 flags, GV *gv)
2240 Newz(1101, gvop, 1, GVOP);
2241 gvop->op_type = type;
2242 gvop->op_ppaddr = ppaddr[type];
2243 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2244 gvop->op_next = (OP*)gvop;
2245 gvop->op_flags = flags;
2246 if (opargs[type] & OA_RETSCALAR)
2248 if (opargs[type] & OA_TARGET)
2249 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2250 return CHECKOP(type, gvop);
2254 newPVOP(I32 type, I32 flags, char *pv)
2257 Newz(1101, pvop, 1, PVOP);
2258 pvop->op_type = type;
2259 pvop->op_ppaddr = ppaddr[type];
2261 pvop->op_next = (OP*)pvop;
2262 pvop->op_flags = flags;
2263 if (opargs[type] & OA_RETSCALAR)
2265 if (opargs[type] & OA_TARGET)
2266 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2267 return CHECKOP(type, pvop);
2276 save_hptr(&curstash);
2277 save_item(curstname);
2282 name = SvPV(sv, len);
2283 curstash = gv_stashpvn(name,len,TRUE);
2284 sv_setpvn(curstname, name, len);
2288 sv_setpv(curstname,"<none>");
2296 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2304 if (id->op_type != OP_CONST)
2305 croak("Module name must be constant");
2309 if(version != Nullop) {
2310 SV *vesv = ((SVOP*)version)->op_sv;
2312 if (arg == Nullop && !SvNIOK(vesv)) {
2319 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2320 croak("Version number must be constant number");
2322 /* Make copy of id so we don't free it twice */
2323 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2325 /* Fake up a method call to VERSION */
2326 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2327 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2328 append_elem(OP_LIST,
2329 prepend_elem(OP_LIST, pack, list(version)),
2330 newUNOP(OP_METHOD, 0, meth)));
2334 /* Fake up an import/unimport */
2335 if (arg && arg->op_type == OP_STUB)
2336 imop = arg; /* no import on explicit () */
2337 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2338 imop = Nullop; /* use 5.0; */
2341 /* Make copy of id so we don't free it twice */
2342 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2343 meth = newSVOP(OP_CONST, 0,
2345 ? newSVpv("import", 6)
2346 : newSVpv("unimport", 8)
2348 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2349 append_elem(OP_LIST,
2350 prepend_elem(OP_LIST, pack, list(arg)),
2351 newUNOP(OP_METHOD, 0, meth)));
2354 /* Fake up a require */
2355 rqop = newUNOP(OP_REQUIRE, 0, id);
2357 /* Fake up the BEGIN {}, which does its thing immediately. */
2359 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2361 append_elem(OP_LINESEQ,
2362 append_elem(OP_LINESEQ,
2363 newSTATEOP(0, Nullch, rqop),
2364 newSTATEOP(0, Nullch, veop)),
2365 newSTATEOP(0, Nullch, imop) ));
2372 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2374 return newBINOP(OP_LSLICE, flags,
2375 list(force_list(subscript)),
2376 list(force_list(listval)) );
2380 list_assignment(register OP *o)
2385 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2386 o = cUNOPo->op_first;
2388 if (o->op_type == OP_COND_EXPR) {
2389 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2390 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2395 yyerror("Assignment to both a list and a scalar");
2399 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2400 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2401 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2404 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2407 if (o->op_type == OP_RV2SV)
2414 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2419 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2420 return newLOGOP(optype, 0,
2421 mod(scalar(left), optype),
2422 newUNOP(OP_SASSIGN, 0, scalar(right)));
2425 return newBINOP(optype, OPf_STACKED,
2426 mod(scalar(left), optype), scalar(right));
2430 if (list_assignment(left)) {
2433 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2434 left = mod(left, OP_AASSIGN);
2442 o = newBINOP(OP_AASSIGN, flags,
2443 list(force_list(right)),
2444 list(force_list(left)) );
2445 o->op_private = 0 | (flags >> 8);
2446 if (!(left->op_private & OPpLVAL_INTRO)) {
2447 static int generation = 100;
2451 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2452 if (opargs[curop->op_type] & OA_DANGEROUS) {
2453 if (curop->op_type == OP_GV) {
2454 GV *gv = ((GVOP*)curop)->op_gv;
2455 if (gv == defgv || SvCUR(gv) == generation)
2457 SvCUR(gv) = generation;
2459 else if (curop->op_type == OP_PADSV ||
2460 curop->op_type == OP_PADAV ||
2461 curop->op_type == OP_PADHV ||
2462 curop->op_type == OP_PADANY) {
2463 SV **svp = AvARRAY(comppad_name);
2464 SV *sv = svp[curop->op_targ];
2465 if (SvCUR(sv) == generation)
2467 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2469 else if (curop->op_type == OP_RV2CV)
2471 else if (curop->op_type == OP_RV2SV ||
2472 curop->op_type == OP_RV2AV ||
2473 curop->op_type == OP_RV2HV ||
2474 curop->op_type == OP_RV2GV) {
2475 if (lastop->op_type != OP_GV) /* funny deref? */
2484 o->op_private = OPpASSIGN_COMMON;
2486 if (right && right->op_type == OP_SPLIT) {
2488 if ((tmpop = ((LISTOP*)right)->op_first) &&
2489 tmpop->op_type == OP_PUSHRE)
2491 PMOP *pm = (PMOP*)tmpop;
2492 if (left->op_type == OP_RV2AV &&
2493 !(left->op_private & OPpLVAL_INTRO) &&
2494 !(o->op_private & OPpASSIGN_COMMON) )
2496 tmpop = ((UNOP*)left)->op_first;
2497 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2498 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2499 pm->op_pmflags |= PMf_ONCE;
2500 tmpop = cUNOPo->op_first; /* to list (nulled) */
2501 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2502 tmpop->op_sibling = Nullop; /* don't free split */
2503 right->op_next = tmpop->op_next; /* fix starting loc */
2504 op_free(o); /* blow off assign */
2505 right->op_flags &= ~OPf_WANT;
2506 /* "I don't know and I don't care." */
2511 if (modcount < 10000 &&
2512 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2514 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2516 sv_setiv(sv, modcount+1);
2524 right = newOP(OP_UNDEF, 0);
2525 if (right->op_type == OP_READLINE) {
2526 right->op_flags |= OPf_STACKED;
2527 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2530 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2531 o = newBINOP(OP_SASSIGN, flags,
2532 scalar(right), mod(scalar(left), OP_SASSIGN) );
2544 newSTATEOP(I32 flags, char *label, OP *o)
2547 U32 seq = intro_my();
2550 Newz(1101, cop, 1, COP);
2551 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2552 cop->op_type = OP_DBSTATE;
2553 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2556 cop->op_type = OP_NEXTSTATE;
2557 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2559 cop->op_flags = flags;
2560 cop->op_private = 0 | (flags >> 8);
2562 cop->op_private |= NATIVE_HINTS;
2564 cop->op_next = (OP*)cop;
2567 cop->cop_label = label;
2568 hints |= HINT_BLOCK_SCOPE;
2571 cop->cop_arybase = curcop->cop_arybase;
2573 if (copline == NOLINE)
2574 cop->cop_line = curcop->cop_line;
2576 cop->cop_line = copline;
2579 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2580 cop->cop_stash = curstash;
2582 if (PERLDB_LINE && curstash != debstash) {
2583 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2584 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2585 (void)SvIOK_on(*svp);
2587 SvSTASH(*svp) = (HV*)cop;
2591 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2594 /* "Introduce" my variables to visible status. */
2602 if (! min_intro_pending)
2605 svp = AvARRAY(comppad_name);
2606 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2607 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2608 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2609 SvNVX(sv) = (double)cop_seqmax;
2612 min_intro_pending = 0;
2613 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2614 return cop_seqmax++;
2618 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2620 return new_logop(type, flags, &first, &other);
2624 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2629 OP *first = *firstp;
2630 OP *other = *otherp;
2632 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2633 return newBINOP(type, flags, scalar(first), scalar(other));
2635 scalarboolean(first);
2636 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2637 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2638 if (type == OP_AND || type == OP_OR) {
2644 first = *firstp = cUNOPo->op_first;
2646 first->op_next = o->op_next;
2647 cUNOPo->op_first = Nullop;
2651 if (first->op_type == OP_CONST) {
2652 if (dowarn && (first->op_private & OPpCONST_BARE))
2653 warn("Probable precedence problem on %s", op_desc[type]);
2654 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2665 else if (first->op_type == OP_WANTARRAY) {
2671 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2672 OP *k1 = ((UNOP*)first)->op_first;
2673 OP *k2 = k1->op_sibling;
2675 switch (first->op_type)
2678 if (k2 && k2->op_type == OP_READLINE
2679 && (k2->op_flags & OPf_STACKED)
2680 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2681 warnop = k2->op_type;
2685 if (k1->op_type == OP_READDIR
2686 || k1->op_type == OP_GLOB
2687 || k1->op_type == OP_EACH)
2688 warnop = k1->op_type;
2692 line_t oldline = curcop->cop_line;
2693 curcop->cop_line = copline;
2694 warn("Value of %s%s can be \"0\"; test with defined()",
2696 ((warnop == OP_READLINE || warnop == OP_GLOB)
2697 ? " construct" : "() operator"));
2698 curcop->cop_line = oldline;
2705 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2706 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2708 Newz(1101, logop, 1, LOGOP);
2710 logop->op_type = type;
2711 logop->op_ppaddr = ppaddr[type];
2712 logop->op_first = first;
2713 logop->op_flags = flags | OPf_KIDS;
2714 logop->op_other = LINKLIST(other);
2715 logop->op_private = 1 | (flags >> 8);
2717 /* establish postfix order */
2718 logop->op_next = LINKLIST(first);
2719 first->op_next = (OP*)logop;
2720 first->op_sibling = other;
2722 o = newUNOP(OP_NULL, 0, (OP*)logop);
2729 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2736 return newLOGOP(OP_AND, 0, first, trueop);
2738 return newLOGOP(OP_OR, 0, first, falseop);
2740 scalarboolean(first);
2741 if (first->op_type == OP_CONST) {
2742 if (SvTRUE(((SVOP*)first)->op_sv)) {
2753 else if (first->op_type == OP_WANTARRAY) {
2757 Newz(1101, condop, 1, CONDOP);
2759 condop->op_type = OP_COND_EXPR;
2760 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2761 condop->op_first = first;
2762 condop->op_flags = flags | OPf_KIDS;
2763 condop->op_true = LINKLIST(trueop);
2764 condop->op_false = LINKLIST(falseop);
2765 condop->op_private = 1 | (flags >> 8);
2767 /* establish postfix order */
2768 condop->op_next = LINKLIST(first);
2769 first->op_next = (OP*)condop;
2771 first->op_sibling = trueop;
2772 trueop->op_sibling = falseop;
2773 o = newUNOP(OP_NULL, 0, (OP*)condop);
2775 trueop->op_next = o;
2776 falseop->op_next = o;
2782 newRANGE(I32 flags, OP *left, OP *right)
2790 Newz(1101, condop, 1, CONDOP);
2792 condop->op_type = OP_RANGE;
2793 condop->op_ppaddr = ppaddr[OP_RANGE];
2794 condop->op_first = left;
2795 condop->op_flags = OPf_KIDS;
2796 condop->op_true = LINKLIST(left);
2797 condop->op_false = LINKLIST(right);
2798 condop->op_private = 1 | (flags >> 8);
2800 left->op_sibling = right;
2802 condop->op_next = (OP*)condop;
2803 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2804 flop = newUNOP(OP_FLOP, 0, flip);
2805 o = newUNOP(OP_NULL, 0, flop);
2808 left->op_next = flip;
2809 right->op_next = flop;
2811 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2812 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2813 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2814 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2816 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2817 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2820 if (!flip->op_private || !flop->op_private)
2821 linklist(o); /* blow off optimizer unless constant */
2827 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2832 int once = block && block->op_flags & OPf_SPECIAL &&
2833 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2836 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2837 return block; /* do {} while 0 does once */
2838 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2839 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2840 expr = newUNOP(OP_DEFINED, 0,
2841 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2842 } else if (expr->op_flags & OPf_KIDS) {
2843 OP *k1 = ((UNOP*)expr)->op_first;
2844 OP *k2 = (k1) ? k1->op_sibling : NULL;
2845 switch (expr->op_type) {
2847 if (k2 && k2->op_type == OP_READLINE
2848 && (k2->op_flags & OPf_STACKED)
2849 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2850 expr = newUNOP(OP_DEFINED, 0, expr);
2854 if (k1->op_type == OP_READDIR
2855 || k1->op_type == OP_GLOB
2856 || k1->op_type == OP_EACH)
2857 expr = newUNOP(OP_DEFINED, 0, expr);
2863 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2864 o = new_logop(OP_AND, 0, &expr, &listop);
2867 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2869 if (once && o != listop)
2870 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2873 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2875 o->op_flags |= flags;
2877 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2882 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2891 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2892 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2893 expr = newUNOP(OP_DEFINED, 0,
2894 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2895 } else if (expr && (expr->op_flags & OPf_KIDS)) {
2896 OP *k1 = ((UNOP*)expr)->op_first;
2897 OP *k2 = (k1) ? k1->op_sibling : NULL;
2898 switch (expr->op_type) {
2900 if (k2 && k2->op_type == OP_READLINE
2901 && (k2->op_flags & OPf_STACKED)
2902 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2903 expr = newUNOP(OP_DEFINED, 0, expr);
2907 if (k1->op_type == OP_READDIR
2908 || k1->op_type == OP_GLOB
2909 || k1->op_type == OP_EACH)
2910 expr = newUNOP(OP_DEFINED, 0, expr);
2916 block = newOP(OP_NULL, 0);
2919 next = LINKLIST(cont);
2921 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2922 if ((line_t)whileline != NOLINE) {
2923 copline = whileline;
2924 cont = append_elem(OP_LINESEQ, cont,
2925 newSTATEOP(0, Nullch, Nullop));
2929 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2930 redo = LINKLIST(listop);
2933 copline = whileline;
2935 o = new_logop(OP_AND, 0, &expr, &listop);
2936 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2937 op_free(expr); /* oops, it's a while (0) */
2939 return Nullop; /* listop already freed by new_logop */
2942 ((LISTOP*)listop)->op_last->op_next = condop =
2943 (o == listop ? redo : LINKLIST(o));
2951 Newz(1101,loop,1,LOOP);
2952 loop->op_type = OP_ENTERLOOP;
2953 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2954 loop->op_private = 0;
2955 loop->op_next = (OP*)loop;
2958 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2960 loop->op_redoop = redo;
2961 loop->op_lastop = o;
2964 loop->op_nextop = next;
2966 loop->op_nextop = o;
2968 o->op_flags |= flags;
2969 o->op_private |= (flags >> 8);
2974 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2982 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2983 sv->op_type = OP_RV2GV;
2984 sv->op_ppaddr = ppaddr[OP_RV2GV];
2986 else if (sv->op_type == OP_PADSV) { /* private variable */
2987 padoff = sv->op_targ;
2991 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
2992 padoff = sv->op_targ;
2993 iterflags |= OPf_SPECIAL;
2998 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3002 padoff = find_threadsv("_");
3003 iterflags |= OPf_SPECIAL;
3005 sv = newGVOP(OP_GV, 0, defgv);
3008 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3009 expr = scalar(ref(expr, OP_ITER));
3010 iterflags |= OPf_STACKED;
3012 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3013 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
3015 assert(!loop->op_next);
3016 Renew(loop, 1, LOOP);
3017 loop->op_targ = padoff;
3018 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3020 return newSTATEOP(0, label, wop);
3024 newLOOPEX(I32 type, OP *label)
3028 if (type != OP_GOTO || label->op_type == OP_CONST) {
3029 /* "last()" means "last" */
3030 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3031 o = newOP(type, OPf_SPECIAL);
3033 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3034 ? SvPVx(((SVOP*)label)->op_sv, na)
3040 if (label->op_type == OP_ENTERSUB)
3041 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3042 o = newUNOP(type, OPf_STACKED, label);
3044 hints |= HINT_BLOCK_SCOPE;
3054 MUTEX_DESTROY(CvMUTEXP(cv));
3055 Safefree(CvMUTEXP(cv));
3058 #endif /* USE_THREADS */
3060 if (!CvXSUB(cv) && CvROOT(cv)) {
3062 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3063 croak("Can't undef active subroutine");
3066 croak("Can't undef active subroutine");
3067 #endif /* USE_THREADS */
3074 op_free(CvROOT(cv));
3075 CvROOT(cv) = Nullop;
3078 SvPOK_off((SV*)cv); /* forget prototype */
3080 SvREFCNT_dec(CvGV(cv));
3082 SvREFCNT_dec(CvOUTSIDE(cv));
3083 CvOUTSIDE(cv) = Nullcv;
3084 if (CvPADLIST(cv)) {
3085 /* may be during global destruction */
3086 if (SvREFCNT(CvPADLIST(cv))) {
3087 I32 i = AvFILLp(CvPADLIST(cv));
3089 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3090 SV* sv = svp ? *svp : Nullsv;
3093 if (sv == (SV*)comppad_name)
3094 comppad_name = Nullav;
3095 else if (sv == (SV*)comppad) {
3097 curpad = Null(SV**);
3101 SvREFCNT_dec((SV*)CvPADLIST(cv));
3103 CvPADLIST(cv) = Nullav;
3107 #ifdef DEBUG_CLOSURES
3112 CV *outside = CvOUTSIDE(cv);
3113 AV* padlist = CvPADLIST(cv);
3120 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3122 (CvANON(cv) ? "ANON"
3123 : (cv == main_cv) ? "MAIN"
3124 : CvUNIQUE(outside) ? "UNIQUE"
3125 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3128 : CvANON(outside) ? "ANON"
3129 : (outside == main_cv) ? "MAIN"
3130 : CvUNIQUE(outside) ? "UNIQUE"
3131 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3136 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3137 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3138 pname = AvARRAY(pad_name);
3139 ppad = AvARRAY(pad);
3141 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3142 if (SvPOK(pname[ix]))
3143 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3145 SvFAKE(pname[ix]) ? "FAKE " : "",
3147 (long)I_32(SvNVX(pname[ix])),
3148 (long)SvIVX(pname[ix]));
3151 #endif /* DEBUG_CLOSURES */
3154 cv_clone2(CV *proto, CV *outside)
3159 AV* protopadlist = CvPADLIST(proto);
3160 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3161 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3162 SV** pname = AvARRAY(protopad_name);
3163 SV** ppad = AvARRAY(protopad);
3164 I32 fname = AvFILLp(protopad_name);
3165 I32 fpad = AvFILLp(protopad);
3169 assert(!CvUNIQUE(proto));
3174 SAVESPTR(comppad_name);
3177 cv = compcv = (CV*)NEWSV(1104,0);
3178 sv_upgrade((SV *)cv, SvTYPE(proto));
3184 New(666, CvMUTEXP(cv), 1, perl_mutex);
3185 MUTEX_INIT(CvMUTEXP(cv));
3187 #endif /* USE_THREADS */
3188 CvFILEGV(cv) = CvFILEGV(proto);
3189 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3190 CvSTASH(cv) = CvSTASH(proto);
3191 CvROOT(cv) = CvROOT(proto);
3192 CvSTART(cv) = CvSTART(proto);
3194 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3197 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3199 comppad_name = newAV();
3200 for (ix = fname; ix >= 0; ix--)
3201 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3205 comppadlist = newAV();
3206 AvREAL_off(comppadlist);
3207 av_store(comppadlist, 0, (SV*)comppad_name);
3208 av_store(comppadlist, 1, (SV*)comppad);
3209 CvPADLIST(cv) = comppadlist;
3210 av_fill(comppad, AvFILLp(protopad));
3211 curpad = AvARRAY(comppad);
3213 av = newAV(); /* will be @_ */
3215 av_store(comppad, 0, (SV*)av);
3216 AvFLAGS(av) = AVf_REIFY;
3218 for (ix = fpad; ix > 0; ix--) {
3219 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3220 if (namesv && namesv != &sv_undef) {
3221 char *name = SvPVX(namesv); /* XXX */
3222 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3223 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3224 CvOUTSIDE(cv), cxstack_ix);
3226 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3228 croak("panic: cv_clone: %s", name);
3230 else { /* our own lexical */
3233 /* anon code -- we'll come back for it */
3234 sv = SvREFCNT_inc(ppad[ix]);
3236 else if (*name == '@')
3238 else if (*name == '%')
3248 SV* sv = NEWSV(0,0);
3254 /* Now that vars are all in place, clone nested closures. */
3256 for (ix = fpad; ix > 0; ix--) {
3257 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3259 && namesv != &sv_undef
3260 && !(SvFLAGS(namesv) & SVf_FAKE)
3261 && *SvPVX(namesv) == '&'
3262 && CvCLONE(ppad[ix]))
3264 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3265 SvREFCNT_dec(ppad[ix]);
3268 curpad[ix] = (SV*)kid;
3272 #ifdef DEBUG_CLOSURES
3273 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3275 PerlIO_printf(Perl_debug_log, " from:\n");
3277 PerlIO_printf(Perl_debug_log, " to:\n");
3288 return cv_clone2(proto, CvOUTSIDE(proto));
3292 cv_ckproto(CV *cv, GV *gv, char *p)
3294 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3295 SV* msg = sv_newmortal();
3299 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3300 sv_setpv(msg, "Prototype mismatch:");
3302 sv_catpvf(msg, " sub %_", name);
3304 sv_catpvf(msg, " (%s)", SvPVX(cv));
3305 sv_catpv(msg, " vs ");
3307 sv_catpvf(msg, "(%s)", p);
3309 sv_catpv(msg, "none");
3320 if (!cv || !SvPOK(cv) || SvCUR(cv))
3324 for (o = CvSTART(cv); o; o = o->op_next) {
3325 OPCODE type = o->op_type;
3327 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3329 if (type == OP_LEAVESUB || type == OP_RETURN)
3333 if (type == OP_CONST)
3335 else if (type == OP_PADSV) {
3336 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3337 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3338 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3350 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3353 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3354 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3355 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3356 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3365 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3366 maximum a prototype before. */
3367 if (SvTYPE(gv) > SVt_NULL) {
3368 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3369 warn("Runaway prototype");
3370 cv_ckproto((CV*)gv, NULL, ps);
3373 sv_setpv((SV*)gv, ps);
3375 sv_setiv((SV*)gv, -1);
3376 SvREFCNT_dec(compcv);
3382 if (!name || GvCVGEN(gv))
3384 else if (cv = GvCV(gv)) {
3385 cv_ckproto(cv, gv, ps);
3386 /* already defined (or promised)? */
3387 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3390 /* just a "sub foo;" when &foo is already defined */
3394 /* ahem, death to those who redefine active sort subs */
3395 if (curstackinfo->si_type == SI_SORT && sortcop == CvSTART(cv))
3396 croak("Can't redefine active sort subroutine %s", name);
3397 const_sv = cv_const_sv(cv);
3398 if (const_sv || dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3399 && HvNAME(GvSTASH(CvGV(cv)))
3400 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3402 line_t oldline = curcop->cop_line;
3403 curcop->cop_line = copline;
3404 warn(const_sv ? "Constant subroutine %s redefined"
3405 : "Subroutine %s redefined", name);
3406 curcop->cop_line = oldline;
3412 if (cv) { /* must reuse cv if autoloaded */
3414 CvFLAGS(cv) = CvFLAGS(compcv);
3415 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3416 CvOUTSIDE(compcv) = 0;
3417 CvPADLIST(cv) = CvPADLIST(compcv);
3418 CvPADLIST(compcv) = 0;
3419 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3420 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3421 SvREFCNT_dec(compcv);
3431 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3432 CvFILEGV(cv) = curcop->cop_filegv;
3433 CvSTASH(cv) = curstash;
3436 New(666, CvMUTEXP(cv), 1, perl_mutex);
3437 MUTEX_INIT(CvMUTEXP(cv));
3438 #endif /* USE_THREADS */
3441 sv_setpv((SV*)cv, ps);
3447 char *s = strrchr(name, ':');
3449 if (strEQ(s, "BEGIN")) {
3451 "BEGIN not safe after errors--compilation aborted";
3455 /* force display of errors found but not reported */
3456 sv_catpv(ERRSV, not_safe);
3457 croak("%s", SvPVx(ERRSV, na));
3469 if (AvFILLp(comppad_name) < AvFILLp(comppad))
3470 av_store(comppad_name, AvFILLp(comppad), Nullsv);
3473 SV **namep = AvARRAY(comppad_name);
3474 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3477 if (SvIMMORTAL(curpad[ix]))
3480 * The only things that a clonable function needs in its
3481 * pad are references to outer lexicals and anonymous subs.
3482 * The rest are created anew during cloning.
3484 if (!((namesv = namep[ix]) != Nullsv &&
3485 namesv != &sv_undef &&
3487 *SvPVX(namesv) == '&')))
3489 SvREFCNT_dec(curpad[ix]);
3490 curpad[ix] = Nullsv;
3495 AV *av = newAV(); /* Will be @_ */
3497 av_store(comppad, 0, (SV*)av);
3498 AvFLAGS(av) = AVf_REIFY;
3500 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3501 if (SvIMMORTAL(curpad[ix]))
3503 if (!SvPADMY(curpad[ix]))
3504 SvPADTMP_on(curpad[ix]);
3508 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3509 CvSTART(cv) = LINKLIST(CvROOT(cv));
3510 CvROOT(cv)->op_next = 0;
3516 if (PERLDB_SUBLINE && curstash != debstash) {
3517 SV *sv = NEWSV(0,0);
3518 SV *tmpstr = sv_newmortal();
3519 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3523 sv_setpvf(sv, "%_:%ld-%ld",
3524 GvSV(curcop->cop_filegv),
3525 (long)subline, (long)curcop->cop_line);
3526 gv_efullname3(tmpstr, gv, Nullch);
3527 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3528 hv = GvHVn(db_postponed);
3529 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3530 && (cv = GvCV(db_postponed))) {
3535 perl_call_sv((SV*)cv, G_DISCARD);
3539 if ((s = strrchr(name,':')))
3543 if (strEQ(s, "BEGIN")) {
3544 I32 oldscope = scopestack_ix;
3546 SAVESPTR(compiling.cop_filegv);
3547 SAVEI16(compiling.cop_line);
3553 DEBUG_x( dump_sub(gv) );
3554 av_push(beginav, (SV *)cv);
3556 call_list(oldscope, beginav);
3558 curcop = &compiling;
3561 else if (strEQ(s, "END") && !error_count) {
3564 av_unshift(endav, 1);
3565 av_store(endav, 0, (SV *)cv);
3568 else if (strEQ(s, "INIT") && !error_count) {
3571 av_push(initav, SvREFCNT_inc(cv));
3582 newCONSTSUB(HV *stash, char *name, SV *sv)
3585 U32 oldhints = hints;
3586 HV *old_cop_stash = curcop->cop_stash;
3587 HV *old_curstash = curstash;
3588 line_t oldline = curcop->cop_line;
3589 curcop->cop_line = copline;
3591 hints &= ~HINT_BLOCK_SCOPE;
3593 curstash = curcop->cop_stash = stash;
3596 start_subparse(FALSE, 0),
3597 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3598 newSVOP(OP_CONST, 0, &sv_no), /* SvPV(&sv_no) == "" -- GMB */
3599 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3603 curcop->cop_stash = old_cop_stash;
3604 curstash = old_curstash;
3605 curcop->cop_line = oldline;
3609 newXS(char *name, void (*subaddr) (CV *), char *filename)
3612 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3615 if (cv = (name ? GvCV(gv) : Nullcv)) {
3617 /* just a cached method */
3621 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3622 /* already defined (or promised) */
3623 if (dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3624 && HvNAME(GvSTASH(CvGV(cv)))
3625 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3626 line_t oldline = curcop->cop_line;
3627 curcop->cop_line = copline;
3628 warn("Subroutine %s redefined",name);
3629 curcop->cop_line = oldline;
3636 if (cv) /* must reuse cv if autoloaded */
3639 cv = (CV*)NEWSV(1105,0);
3640 sv_upgrade((SV *)cv, SVt_PVCV);
3647 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3649 New(666, CvMUTEXP(cv), 1, perl_mutex);
3650 MUTEX_INIT(CvMUTEXP(cv));
3652 #endif /* USE_THREADS */
3653 CvFILEGV(cv) = gv_fetchfile(filename);
3654 CvXSUB(cv) = subaddr;
3657 char *s = strrchr(name,':');
3662 if (strEQ(s, "BEGIN")) {
3665 av_push(beginav, (SV *)cv);
3668 else if (strEQ(s, "END")) {
3671 av_unshift(endav, 1);
3672 av_store(endav, 0, (SV *)cv);
3675 else if (strEQ(s, "INIT")) {
3678 av_push(initav, (SV *)cv);
3688 newFORM(I32 floor, OP *o, OP *block)
3697 name = SvPVx(cSVOPo->op_sv, na);
3700 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3702 if (cv = GvFORM(gv)) {
3704 line_t oldline = curcop->cop_line;
3706 curcop->cop_line = copline;
3707 warn("Format %s redefined",name);
3708 curcop->cop_line = oldline;
3714 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3715 CvFILEGV(cv) = curcop->cop_filegv;
3717 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3718 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3719 SvPADTMP_on(curpad[ix]);
3722 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3723 CvSTART(cv) = LINKLIST(CvROOT(cv));
3724 CvROOT(cv)->op_next = 0;
3734 return newUNOP(OP_REFGEN, 0,
3735 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3741 return newUNOP(OP_REFGEN, 0,
3742 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3746 newANONSUB(I32 floor, OP *proto, OP *block)
3748 return newUNOP(OP_REFGEN, 0,
3749 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3755 switch (o->op_type) {
3757 o->op_type = OP_PADAV;
3758 o->op_ppaddr = ppaddr[OP_PADAV];
3759 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3762 o->op_type = OP_RV2AV;
3763 o->op_ppaddr = ppaddr[OP_RV2AV];
3768 warn("oops: oopsAV");
3777 switch (o->op_type) {
3780 o->op_type = OP_PADHV;
3781 o->op_ppaddr = ppaddr[OP_PADHV];
3782 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3786 o->op_type = OP_RV2HV;
3787 o->op_ppaddr = ppaddr[OP_RV2HV];
3792 warn("oops: oopsHV");
3801 if (o->op_type == OP_PADANY) {
3802 o->op_type = OP_PADAV;
3803 o->op_ppaddr = ppaddr[OP_PADAV];
3806 return newUNOP(OP_RV2AV, 0, scalar(o));
3810 newGVREF(I32 type, OP *o)
3812 if (type == OP_MAPSTART)
3813 return newUNOP(OP_NULL, 0, o);
3814 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3820 if (o->op_type == OP_PADANY) {
3821 o->op_type = OP_PADHV;
3822 o->op_ppaddr = ppaddr[OP_PADHV];
3825 return newUNOP(OP_RV2HV, 0, scalar(o));
3831 croak("NOT IMPL LINE %d",__LINE__);
3837 newCVREF(I32 flags, OP *o)
3839 return newUNOP(OP_RV2CV, flags, scalar(o));
3845 if (o->op_type == OP_PADANY) {
3846 o->op_type = OP_PADSV;
3847 o->op_ppaddr = ppaddr[OP_PADSV];
3850 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3851 o->op_flags |= OPpDONE_SVREF;
3854 return newUNOP(OP_RV2SV, 0, scalar(o));
3857 /* Check routines. */
3865 name = NEWSV(1106,0);
3866 sv_upgrade(name, SVt_PVNV);
3867 sv_setpvn(name, "&", 1);
3870 ix = pad_alloc(o->op_type, SVs_PADMY);
3871 av_store(comppad_name, ix, name);
3872 av_store(comppad, ix, cSVOPo->op_sv);
3873 SvPADMY_on(cSVOPo->op_sv);
3874 cSVOPo->op_sv = Nullsv;
3875 cSVOPo->op_targ = ix;
3882 o->op_private = hints;
3889 if (cUNOPo->op_first->op_type == OP_CONCAT)
3890 o->op_flags |= OPf_STACKED;
3897 if (o->op_flags & OPf_KIDS) {
3900 OPCODE type = o->op_type;
3901 o = modkids(ck_fun(o), type);
3902 kid = cUNOPo->op_first;
3903 newop = kUNOP->op_first->op_sibling;
3905 (newop->op_sibling ||
3906 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3907 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3908 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3912 op_free(kUNOP->op_first);
3913 kUNOP->op_first = newop;
3915 o->op_ppaddr = ppaddr[++o->op_type];
3924 if (o->op_flags & OPf_KIDS) {
3925 OP *kid = cUNOPo->op_first;
3926 if (kid->op_type == OP_HSLICE)
3927 o->op_private |= OPpSLICE;
3928 else if (kid->op_type != OP_HELEM)
3929 croak("%s argument is not a HASH element or slice",
3930 op_desc[o->op_type]);
3939 I32 type = o->op_type;
3941 if (o->op_flags & OPf_KIDS) {
3942 if (cLISTOPo->op_first->op_type == OP_STUB) {
3944 o = newUNOP(type, OPf_SPECIAL,
3945 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3955 hints |= HINT_BLOCK_SCOPE;
3956 if (o->op_flags & OPf_KIDS) {
3957 SVOP *kid = (SVOP*)cUNOPo->op_first;
3960 o->op_flags &= ~OPf_KIDS;
3963 else if (kid->op_type == OP_LINESEQ) {
3966 kid->op_next = o->op_next;
3967 cUNOPo->op_first = 0;
3970 Newz(1101, enter, 1, LOGOP);
3971 enter->op_type = OP_ENTERTRY;
3972 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3973 enter->op_private = 0;
3975 /* establish postfix order */
3976 enter->op_next = (OP*)enter;
3978 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3979 o->op_type = OP_LEAVETRY;
3980 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3981 enter->op_other = o;
3989 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
3991 o->op_targ = (PADOFFSET)hints;
3999 if (o->op_flags & OPf_STACKED) {
4001 kid = cUNOPo->op_first->op_sibling;
4002 if (kid->op_type == OP_RV2GV)
4014 if (o->op_flags & OPf_KIDS) {
4015 OP *kid = cUNOPo->op_first;
4016 if (kid->op_type != OP_HELEM)
4017 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4024 ck_gvconst(register OP *o)
4026 o = fold_constants(o);
4027 if (o->op_type == OP_CONST)
4033 ck_rvconst(register OP *o)
4036 SVOP *kid = (SVOP*)cUNOPo->op_first;
4038 o->op_private |= (hints & HINT_STRICT_REFS);
4039 if (kid->op_type == OP_CONST) {
4044 name = SvPV(kid->op_sv, na);
4045 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4046 char *badthing = Nullch;
4047 switch (o->op_type) {
4049 badthing = "a SCALAR";
4052 badthing = "an ARRAY";
4055 badthing = "a HASH";
4060 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4064 * This is a little tricky. We only want to add the symbol if we
4065 * didn't add it in the lexer. Otherwise we get duplicate strict
4066 * warnings. But if we didn't add it in the lexer, we must at
4067 * least pretend like we wanted to add it even if it existed before,
4068 * or we get possible typo warnings. OPpCONST_ENTERED says
4069 * whether the lexer already added THIS instance of this symbol.
4071 iscv = (o->op_type == OP_RV2CV) * 2;
4073 gv = gv_fetchpv(name,
4074 iscv | !(kid->op_private & OPpCONST_ENTERED),
4077 : o->op_type == OP_RV2SV
4079 : o->op_type == OP_RV2AV
4081 : o->op_type == OP_RV2HV
4084 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4086 kid->op_type = OP_GV;
4087 SvREFCNT_dec(kid->op_sv);
4088 kid->op_sv = SvREFCNT_inc(gv);
4098 I32 type = o->op_type;
4100 if (o->op_flags & OPf_REF)
4103 if (o->op_flags & OPf_KIDS) {
4104 SVOP *kid = (SVOP*)cUNOPo->op_first;
4106 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4107 OP *newop = newGVOP(type, OPf_REF,
4108 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4115 if (type == OP_FTTTY)
4116 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4119 return newUNOP(type, 0, newDEFSVOP());
4132 int type = o->op_type;
4133 register I32 oa = opargs[type] >> OASHIFT;
4135 if (o->op_flags & OPf_STACKED) {
4136 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4139 return no_fh_allowed(o);
4142 if (o->op_flags & OPf_KIDS) {
4143 tokid = &cLISTOPo->op_first;
4144 kid = cLISTOPo->op_first;
4145 if (kid->op_type == OP_PUSHMARK ||
4146 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4148 tokid = &kid->op_sibling;
4149 kid = kid->op_sibling;
4151 if (!kid && opargs[type] & OA_DEFGV)
4152 *tokid = kid = newDEFSVOP();
4156 sibl = kid->op_sibling;
4170 if (kid->op_type == OP_CONST &&
4171 (kid->op_private & OPpCONST_BARE)) {
4172 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4173 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4174 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4176 warn("Array @%s missing the @ in argument %ld of %s()",
4177 name, (long)numargs, op_desc[type]);
4180 kid->op_sibling = sibl;
4183 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4184 bad_type(numargs, "array", op_desc[o->op_type], kid);
4188 if (kid->op_type == OP_CONST &&
4189 (kid->op_private & OPpCONST_BARE)) {
4190 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4191 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4192 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4194 warn("Hash %%%s missing the %% in argument %ld of %s()",
4195 name, (long)numargs, op_desc[type]);
4198 kid->op_sibling = sibl;
4201 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4202 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4207 OP *newop = newUNOP(OP_NULL, 0, kid);
4208 kid->op_sibling = 0;
4210 newop->op_next = newop;
4212 kid->op_sibling = sibl;
4217 if (kid->op_type != OP_GV) {
4218 if (kid->op_type == OP_CONST &&
4219 (kid->op_private & OPpCONST_BARE)) {
4220 OP *newop = newGVOP(OP_GV, 0,
4221 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4227 kid->op_sibling = 0;
4228 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4230 kid->op_sibling = sibl;
4236 mod(scalar(kid), type);
4240 tokid = &kid->op_sibling;
4241 kid = kid->op_sibling;
4243 o->op_private |= numargs;
4245 return too_many_arguments(o,op_desc[o->op_type]);
4248 else if (opargs[type] & OA_DEFGV) {
4250 return newUNOP(type, 0, newDEFSVOP());
4254 while (oa & OA_OPTIONAL)
4256 if (oa && oa != OA_LIST)
4257 return too_few_arguments(o,op_desc[o->op_type]);
4267 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4268 append_elem(OP_GLOB, o, newDEFSVOP());
4270 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4271 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4273 if (gv && GvIMPORTED_CV(gv)) {
4274 static int glob_index;
4276 append_elem(OP_GLOB, o,
4277 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4278 o->op_type = OP_LIST;
4279 o->op_ppaddr = ppaddr[OP_LIST];
4280 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4281 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4282 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4283 append_elem(OP_LIST, o,
4284 scalar(newUNOP(OP_RV2CV, 0,
4285 newGVOP(OP_GV, 0, gv)))));
4286 o = newUNOP(OP_NULL, 0, ck_subr(o));
4287 o->op_targ = OP_GLOB; /* hint at what it used to be */
4290 gv = newGVgen("main");
4292 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4302 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4304 o->op_ppaddr = ppaddr[OP_GREPSTART];
4305 Newz(1101, gwop, 1, LOGOP);
4307 if (o->op_flags & OPf_STACKED) {
4310 kid = cLISTOPo->op_first->op_sibling;
4311 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4314 kid->op_next = (OP*)gwop;
4315 o->op_flags &= ~OPf_STACKED;
4317 kid = cLISTOPo->op_first->op_sibling;
4318 if (type == OP_MAPWHILE)
4325 kid = cLISTOPo->op_first->op_sibling;
4326 if (kid->op_type != OP_NULL)
4327 croak("panic: ck_grep");
4328 kid = kUNOP->op_first;
4330 gwop->op_type = type;
4331 gwop->op_ppaddr = ppaddr[type];
4332 gwop->op_first = listkids(o);
4333 gwop->op_flags |= OPf_KIDS;
4334 gwop->op_private = 1;
4335 gwop->op_other = LINKLIST(kid);
4336 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4337 kid->op_next = (OP*)gwop;
4339 kid = cLISTOPo->op_first->op_sibling;
4340 if (!kid || !kid->op_sibling)
4341 return too_few_arguments(o,op_desc[o->op_type]);
4342 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4343 mod(kid, OP_GREPSTART);
4351 if (o->op_flags & OPf_KIDS) {
4352 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4353 if (kid && kid->op_type == OP_CONST)
4354 fbm_compile(((SVOP*)kid)->op_sv, 0);
4360 ck_lengthconst(OP *o)
4362 /* XXX length optimization goes here */
4369 OPCODE type = o->op_type;
4370 return modkids(ck_fun(o), type);
4376 OPCODE type = o->op_type;
4377 return refkids(ck_fun(o), type);
4385 kid = cLISTOPo->op_first;
4388 kid = cLISTOPo->op_first;
4390 if (kid->op_type == OP_PUSHMARK)
4391 kid = kid->op_sibling;
4392 if (kid && o->op_flags & OPf_STACKED)
4393 kid = kid->op_sibling;
4394 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4395 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4396 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4397 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4398 cLISTOPo->op_first->op_sibling = kid;
4399 cLISTOPo->op_last = kid;
4400 kid = kid->op_sibling;
4405 append_elem(o->op_type, o, newDEFSVOP());
4411 if (hints & HINT_LOCALE)
4412 o->op_private |= OPpLOCALE;
4419 ck_fun_locale(OP *o)
4425 if (hints & HINT_LOCALE)
4426 o->op_private |= OPpLOCALE;
4437 if (hints & HINT_LOCALE)
4438 o->op_private |= OPpLOCALE;
4447 o->op_private |= OPpRUNTIME;
4460 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4461 o->op_private |= OPpREPEAT_DOLIST;
4462 cBINOPo->op_first = force_list(cBINOPo->op_first);
4472 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4473 SVOP *kid = (SVOP*)cUNOPo->op_first;
4475 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4477 for (s = SvPVX(kid->op_sv); *s; s++) {
4478 if (*s == ':' && s[1] == ':') {
4480 Move(s+2, s+1, strlen(s+2)+1, char);
4481 --SvCUR(kid->op_sv);
4484 sv_catpvn(kid->op_sv, ".pm", 3);
4493 croak("NOT IMPL LINE %d",__LINE__);
4502 if (o->op_flags & OPf_KIDS) {
4503 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4504 if (kid && kid->op_sibling) {
4505 o->op_type = OP_SSELECT;
4506 o->op_ppaddr = ppaddr[OP_SSELECT];
4508 return fold_constants(o);
4512 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4513 if (kid && kid->op_type == OP_RV2GV)
4514 kid->op_private &= ~HINT_STRICT_REFS;
4521 I32 type = o->op_type;
4523 if (!(o->op_flags & OPf_KIDS)) {
4528 if (!CvUNIQUE(compcv)) {
4529 argop = newOP(OP_PADAV, OPf_REF);
4530 argop->op_targ = 0; /* curpad[0] is @_ */
4533 argop = newUNOP(OP_RV2AV, 0,
4534 scalar(newGVOP(OP_GV, 0,
4535 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4538 argop = newUNOP(OP_RV2AV, 0,
4539 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(compcv) ?
4540 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4541 #endif /* USE_THREADS */
4542 return newUNOP(type, 0, scalar(argop));
4544 return scalar(modkids(ck_fun(o), type));
4552 if (hints & HINT_LOCALE)
4553 o->op_private |= OPpLOCALE;
4556 if (o->op_flags & OPf_STACKED) {
4557 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4559 kid = kUNOP->op_first; /* get past rv2gv */
4561 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4563 if (kid->op_type == OP_SCOPE) {
4567 else if (kid->op_type == OP_LEAVE) {
4568 if (o->op_type == OP_SORT) {
4569 null(kid); /* wipe out leave */
4572 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4573 if (k->op_next == kid)
4578 kid->op_next = 0; /* just disconnect the leave */
4579 k = kLISTOP->op_first;
4583 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4584 null(kid); /* wipe out rv2gv */
4585 if (o->op_type == OP_SORT)
4589 o->op_flags |= OPf_SPECIAL;
4601 if (o->op_flags & OPf_STACKED)
4602 return no_fh_allowed(o);
4604 kid = cLISTOPo->op_first;
4605 if (kid->op_type != OP_NULL)
4606 croak("panic: ck_split");
4607 kid = kid->op_sibling;
4608 op_free(cLISTOPo->op_first);
4609 cLISTOPo->op_first = kid;
4611 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4612 cLISTOPo->op_last = kid; /* There was only one element previously */
4615 if (kid->op_type != OP_MATCH) {
4616 OP *sibl = kid->op_sibling;
4617 kid->op_sibling = 0;
4618 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4619 if (cLISTOPo->op_first == cLISTOPo->op_last)
4620 cLISTOPo->op_last = kid;
4621 cLISTOPo->op_first = kid;
4622 kid->op_sibling = sibl;
4625 kid->op_type = OP_PUSHRE;
4626 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4629 if (!kid->op_sibling)
4630 append_elem(OP_SPLIT, o, newDEFSVOP());
4632 kid = kid->op_sibling;
4635 if (!kid->op_sibling)
4636 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4638 kid = kid->op_sibling;
4641 if (kid->op_sibling)
4642 return too_many_arguments(o,op_desc[o->op_type]);
4651 OP *prev = ((cUNOPo->op_first->op_sibling)
4652 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4653 OP *o2 = prev->op_sibling;
4661 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4662 if (cvop->op_type == OP_RV2CV) {
4664 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4665 null(cvop); /* disable rv2cv */
4666 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4667 if (tmpop->op_type == OP_GV) {
4668 cv = GvCVu(tmpop->op_sv);
4669 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4670 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4671 proto = SvPV((SV*)cv, na);
4675 o->op_private |= (hints & HINT_STRICT_REFS);
4676 if (PERLDB_SUB && curstash != debstash)
4677 o->op_private |= OPpENTERSUB_DB;
4678 while (o2 != cvop) {
4682 return too_many_arguments(o, gv_ename(namegv));
4700 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4701 bad_type(arg, "block", gv_ename(namegv), o2);
4706 if (o2->op_type == OP_RV2GV)
4710 OP* sib = kid->op_sibling;
4711 kid->op_sibling = 0;
4712 o2 = newUNOP(OP_RV2GV, 0, kid);
4713 o2->op_sibling = sib;
4714 prev->op_sibling = o2;
4722 if (o2->op_type != OP_RV2GV)
4723 bad_type(arg, "symbol", gv_ename(namegv), o2);
4726 if (o2->op_type != OP_RV2CV)
4727 bad_type(arg, "sub", gv_ename(namegv), o2);
4730 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4731 bad_type(arg, "scalar", gv_ename(namegv), o2);
4734 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4735 bad_type(arg, "array", gv_ename(namegv), o2);
4738 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4739 bad_type(arg, "hash", gv_ename(namegv), o2);
4743 OP* sib = kid->op_sibling;
4744 kid->op_sibling = 0;
4745 o2 = newUNOP(OP_REFGEN, 0, kid);
4746 o2->op_sibling = sib;
4747 prev->op_sibling = o2;
4758 croak("Malformed prototype for %s: %s",
4759 gv_ename(namegv), SvPV((SV*)cv, na));
4764 mod(o2, OP_ENTERSUB);
4766 o2 = o2->op_sibling;
4768 if (proto && !optional &&
4769 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4770 return too_few_arguments(o, gv_ename(namegv));
4777 SvREADONLY_on(cSVOPo->op_sv);
4784 if (o->op_flags & OPf_KIDS) {
4785 SVOP *kid = (SVOP*)cUNOPo->op_first;
4787 if (kid->op_type == OP_NULL)
4788 kid = (SVOP*)kid->op_sibling;
4790 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4791 o->op_flags |= OPf_SPECIAL;
4796 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4799 peep(register OP *o)
4802 register OP* oldop = 0;
4803 if (!o || o->op_seq)
4808 for (; o; o = o->op_next) {
4814 switch (o->op_type) {
4817 curcop = ((COP*)o); /* for warnings */
4818 o->op_seq = op_seqmax++;
4829 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
4831 o->op_seq = op_seqmax++;
4834 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4835 o->op_seq = op_seqmax++;
4836 break; /* Scalar stub must produce undef. List stub is noop */
4840 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4847 if (oldop && o->op_next) {
4848 oldop->op_next = o->op_next;
4851 o->op_seq = op_seqmax++;
4855 if (o->op_next->op_type == OP_RV2SV) {
4856 if (!(o->op_next->op_private & OPpDEREF)) {
4858 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4859 o->op_next = o->op_next->op_next;
4860 o->op_type = OP_GVSV;
4861 o->op_ppaddr = ppaddr[OP_GVSV];
4864 else if (o->op_next->op_type == OP_RV2AV) {
4865 OP* pop = o->op_next->op_next;
4867 if (pop->op_type == OP_CONST &&
4868 (op = pop->op_next) &&
4869 pop->op_next->op_type == OP_AELEM &&
4870 !(pop->op_next->op_private &
4871 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4872 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4876 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4880 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4881 o->op_next = pop->op_next->op_next;
4882 o->op_type = OP_AELEMFAST;
4883 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4884 o->op_private = (U8)i;
4885 GvAVn(((GVOP*)o)->op_gv);
4888 o->op_seq = op_seqmax++;
4892 if (o->op_next->op_type == OP_RV2AV
4893 && (o->op_next->op_flags && OPf_REF))
4896 o->op_next = o->op_next->op_next;
4901 if (o->op_next->op_type == OP_RV2HV
4902 && (o->op_next->op_flags && OPf_REF))
4905 o->op_next = o->op_next->op_next;
4913 o->op_seq = op_seqmax++;
4914 while (cLOGOP->op_other->op_type == OP_NULL)
4915 cLOGOP->op_other = cLOGOP->op_other->op_next;
4916 peep(cLOGOP->op_other);
4920 o->op_seq = op_seqmax++;
4921 peep(cCONDOP->op_true);
4922 peep(cCONDOP->op_false);
4926 o->op_seq = op_seqmax++;
4927 peep(cLOOP->op_redoop);
4928 peep(cLOOP->op_nextop);
4929 peep(cLOOP->op_lastop);
4934 o->op_seq = op_seqmax++;
4935 peep(cPMOP->op_pmreplstart);
4939 o->op_seq = op_seqmax++;
4940 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4941 if (o->op_next->op_sibling &&
4942 o->op_next->op_sibling->op_type != OP_EXIT &&
4943 o->op_next->op_sibling->op_type != OP_WARN &&
4944 o->op_next->op_sibling->op_type != OP_DIE) {
4945 line_t oldline = curcop->cop_line;
4947 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4948 warn("Statement unlikely to be reached");
4949 warn("(Maybe you meant system() when you said exec()?)\n");
4950 curcop->cop_line = oldline;
4964 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4965 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4967 rop = (UNOP*)((BINOP*)o)->op_first;
4968 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4970 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4971 if (!SvOBJECT(lexname))
4973 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4974 if (!fields || !GvHV(*fields))
4976 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4977 key = SvPV(*svp, keylen);
4978 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4980 croak("No such field \"%s\" in variable %s of type %s",
4981 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4983 ind = SvIV(*indsvp);
4985 croak("Bad index while coercing array into hash");
4986 rop->op_type = OP_RV2AV;
4987 rop->op_ppaddr = ppaddr[OP_RV2AV];
4988 o->op_type = OP_AELEM;
4989 o->op_ppaddr = ppaddr[OP_AELEM];
4991 *svp = newSViv(ind);
4996 o->op_seq = op_seqmax++;