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 #define CHECKCALL this->*check
24 #define CHECKCALL *check
28 * In the following definition, the ", Nullop" is just to make the compiler
29 * think the expression is of the right type: croak actually does a Siglongjmp.
31 #define CHECKOP(type,o) \
32 ((op_mask && op_mask[type]) \
33 ? ( op_free((OP*)o), \
34 croak("%s trapped by operation mask", op_desc[type]), \
36 : (CHECKCALL[type])((OP*)o))
38 static bool scalar_mod_type _((OP *o, I32 type));
40 static I32 list_assignment _((OP *o));
41 static void bad_type _((I32 n, char *t, char *name, OP *kid));
42 static OP *modkids _((OP *o, I32 type));
43 static OP *no_fh_allowed _((OP *o));
44 static OP *scalarboolean _((OP *o));
45 static OP *too_few_arguments _((OP *o, char* name));
46 static OP *too_many_arguments _((OP *o, char* name));
47 static void null _((OP* o));
48 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
49 CV* startcv, I32 cx_ix));
50 static OP *newDEFSVOP _((void));
51 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
57 SV* tmpsv = sv_newmortal();
58 gv_efullname3(tmpsv, gv, Nullch);
59 return SvPV(tmpsv,na);
65 yyerror(form("Missing comma after first argument to %s function",
66 op_desc[o->op_type]));
71 too_few_arguments(OP *o, char *name)
73 yyerror(form("Not enough arguments for %s", name));
78 too_many_arguments(OP *o, char *name)
80 yyerror(form("Too many arguments for %s", name));
85 bad_type(I32 n, char *t, char *name, OP *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]));
94 int type = o->op_type;
95 if (type != OP_AELEM && type != OP_HELEM) {
96 yyerror(form("Can't use subscript on %s", op_desc[type]));
97 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
100 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
101 type == OP_ENTERSUB ? '&' : '%'));
105 sv_catsv(GvSV(errgv), msg);
107 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
112 /* "register" allocation */
115 pad_allocmy(char *name)
121 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
122 if (!isPRINT(name[1])) {
124 name[2] = toCTRL(name[1]);
127 croak("Can't use global %s in \"my\"",name);
129 if (dowarn && AvFILLp(comppad_name) >= 0) {
130 SV **svp = AvARRAY(comppad_name);
131 for (off = AvFILLp(comppad_name); off > comppad_name_floor; off--) {
134 && SvIVX(sv) == 999999999 /* var is in open scope */
135 && strEQ(name, SvPVX(sv)))
137 warn("\"my\" variable %s masks earlier declaration in same scope", name);
142 off = pad_alloc(OP_PADSV, SVs_PADMY);
144 sv_upgrade(sv, SVt_PVNV);
148 croak("Can't declare class for non-scalar %s in \"my\"",name);
150 (void)SvUPGRADE(sv, SVt_PVMG);
151 SvSTASH(sv) = (HV*)SvREFCNT_inc(in_my_stash);
154 av_store(comppad_name, off, sv);
155 SvNVX(sv) = (double)999999999;
156 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
157 if (!min_intro_pending)
158 min_intro_pending = off;
159 max_intro_pending = off;
161 av_store(comppad, off, (SV*)newAV());
162 else if (*name == '%')
163 av_store(comppad, off, (SV*)newHV());
164 SvPADMY_on(curpad[off]);
169 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
176 register PERL_CONTEXT *cx;
179 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
180 AV *curlist = CvPADLIST(cv);
181 SV **svp = av_fetch(curlist, 0, FALSE);
184 if (!svp || *svp == &sv_undef)
187 svp = AvARRAY(curname);
188 for (off = AvFILLp(curname); off > 0; off--) {
189 if ((sv = svp[off]) &&
192 seq > I_32(SvNVX(sv)) &&
193 strEQ(SvPVX(sv), name))
204 return 0; /* don't clone from inactive stack frame */
208 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
209 oldsv = *av_fetch(oldpad, off, TRUE);
210 if (!newoff) { /* Not a mere clone operation. */
211 SV *namesv = NEWSV(1103,0);
212 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
213 sv_upgrade(namesv, SVt_PVNV);
214 sv_setpv(namesv, name);
215 av_store(comppad_name, newoff, namesv);
216 SvNVX(namesv) = (double)curcop->cop_seq;
217 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
218 SvFAKE_on(namesv); /* A ref, not a real var */
219 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
220 /* "It's closures all the way down." */
224 oldsv = Nullsv; /* no need to keep ref */
229 bcv && bcv != cv && !CvCLONE(bcv);
230 bcv = CvOUTSIDE(bcv)) {
234 if (dowarn && !CvUNIQUE(cv))
236 "Variable \"%s\" may be unavailable",
243 else if (!CvUNIQUE(compcv)) {
244 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
245 warn("Variable \"%s\" will not stay shared", name);
248 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
254 /* Nothing in current lexical context--try eval's context, if any.
255 * This is necessary to let the perldb get at lexically scoped variables.
256 * XXX This will also probably interact badly with eval tree caching.
260 for (i = cx_ix; i >= 0; i--) {
262 switch (cx->cx_type) {
264 if (i == 0 && saweval) {
265 seq = cxstack[saweval].blk_oldcop->cop_seq;
266 return pad_findlex(name, newoff, seq, main_cv, 0);
270 switch (cx->blk_eval.old_op_type) {
275 /* require must have its own scope */
283 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
284 saweval = i; /* so we know where we were called from */
287 seq = cxstack[saweval].blk_oldcop->cop_seq;
288 return pad_findlex(name, newoff, seq, cv, i-1);
296 pad_findmy(char *name)
302 SV **svp = AvARRAY(comppad_name);
303 U32 seq = cop_seqmax;
307 * Special case to get lexical (and hence per-thread) @_.
308 * XXX I need to find out how to tell at parse-time whether use
309 * of @_ should refer to a lexical (from a sub) or defgv (global
310 * scope and maybe weird sub-ish things like formats). See
311 * startsub in perly.y. It's possible that @_ could be lexical
312 * (at least from subs) even in non-threaded perl.
314 if (strEQ(name, "@_"))
315 return 0; /* success. (NOT_IN_PAD indicates failure) */
316 #endif /* USE_THREADS */
318 /* The one we're looking for is probably just before comppad_name_fill. */
319 for (off = AvFILLp(comppad_name); off > 0; off--) {
320 if ((sv = svp[off]) &&
324 seq > I_32(SvNVX(sv)))) &&
325 strEQ(SvPVX(sv), name))
328 return (PADOFFSET)off;
329 pendoff = off; /* this pending def. will override import */
333 /* See if it's in a nested scope */
334 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
336 /* If there is a pending local definition, this new alias must die */
338 SvIVX(AvARRAY(comppad_name)[off]) = seq;
339 return off; /* pad_findlex returns 0 for failure...*/
341 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
345 pad_leavemy(I32 fill)
348 SV **svp = AvARRAY(comppad_name);
350 if (min_intro_pending && fill < min_intro_pending) {
351 for (off = max_intro_pending; off >= min_intro_pending; off--) {
352 if ((sv = svp[off]) && sv != &sv_undef)
353 warn("%s never introduced", SvPVX(sv));
356 /* "Deintroduce" my variables that are leaving with this scope. */
357 for (off = AvFILLp(comppad_name); off > fill; off--) {
358 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
359 SvIVX(sv) = cop_seqmax;
364 pad_alloc(I32 optype, U32 tmptype)
370 if (AvARRAY(comppad) != curpad)
371 croak("panic: pad_alloc");
372 if (pad_reset_pending)
374 if (tmptype & SVs_PADMY) {
376 sv = *av_fetch(comppad, AvFILLp(comppad) + 1, TRUE);
377 } while (SvPADBUSY(sv)); /* need a fresh one */
378 retval = AvFILLp(comppad);
381 SV **names = AvARRAY(comppad_name);
382 SSize_t names_fill = AvFILLp(comppad_name);
385 * "foreach" index vars temporarily become aliases to non-"my"
386 * values. Thus we must skip, not just pad values that are
387 * marked as current pad values, but also those with names.
389 if (++padix <= names_fill &&
390 (sv = names[padix]) && sv != &sv_undef)
392 sv = *av_fetch(comppad, padix, TRUE);
393 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
398 SvFLAGS(sv) |= tmptype;
399 curpad = AvARRAY(comppad);
401 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
402 (unsigned long) thr, (unsigned long) curpad,
403 (long) retval, op_name[optype]));
405 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
406 (unsigned long) curpad,
407 (long) retval, op_name[optype]));
408 #endif /* USE_THREADS */
409 return (PADOFFSET)retval;
417 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
418 (unsigned long) thr, (unsigned long) curpad, po));
421 croak("panic: pad_sv po");
422 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
423 (unsigned long) curpad, po));
424 #endif /* USE_THREADS */
425 return curpad[po]; /* eventually we'll turn this into a macro */
429 pad_free(PADOFFSET po)
434 if (AvARRAY(comppad) != curpad)
435 croak("panic: pad_free curpad");
437 croak("panic: pad_free po");
439 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
440 (unsigned long) thr, (unsigned long) curpad, po));
442 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
443 (unsigned long) curpad, po));
444 #endif /* USE_THREADS */
445 if (curpad[po] && curpad[po] != &sv_undef)
446 SvPADTMP_off(curpad[po]);
452 pad_swipe(PADOFFSET po)
455 if (AvARRAY(comppad) != curpad)
456 croak("panic: pad_swipe curpad");
458 croak("panic: pad_swipe po");
460 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
461 (unsigned long) thr, (unsigned long) curpad, po));
463 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
464 (unsigned long) curpad, po));
465 #endif /* USE_THREADS */
466 SvPADTMP_off(curpad[po]);
467 curpad[po] = NEWSV(1107,0);
468 SvPADTMP_on(curpad[po]);
473 /* XXX pad_reset() is currently disabled because it results in serious bugs.
474 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
475 * on the stack by OPs that use them, there are several ways to get an alias
476 * to a shared TARG. Such an alias will change randomly and unpredictably.
477 * We avoid doing this until we can think of a Better Way.
482 #ifdef USE_BROKEN_PAD_RESET
486 if (AvARRAY(comppad) != curpad)
487 croak("panic: pad_reset curpad");
489 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
490 (unsigned long) thr, (unsigned long) curpad));
492 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
493 (unsigned long) curpad));
494 #endif /* USE_THREADS */
495 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
496 for (po = AvMAX(comppad); po > padix_floor; po--) {
497 if (curpad[po] && !SvIMMORTAL(curpad[po]))
498 SvPADTMP_off(curpad[po]);
503 pad_reset_pending = FALSE;
507 /* find_threadsv is not reentrant */
509 find_threadsv(char *name)
515 /* We currently only handle names of a single character */
516 p = strchr(threadsv_names, *name);
519 key = p - threadsv_names;
520 svp = av_fetch(thr->threadsv, key, FALSE);
522 SV *sv = NEWSV(0, 0);
523 av_store(thr->threadsv, key, sv);
524 thr->threadsvp = AvARRAY(thr->threadsv);
526 * Some magic variables used to be automagically initialised
527 * in gv_fetchpv. Those which are now per-thread magicals get
528 * initialised here instead.
534 sv_setpv(sv, "\034");
535 sv_magic(sv, 0, 0, name, 1);
544 /* XXX %! tied to Errno.pm needs to be added here.
545 * See gv_fetchpv(). */
549 sv_magic(sv, 0, 0, name, 1);
551 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
552 "find_threadsv: new SV %p for $%s%c\n",
553 sv, (*name < 32) ? "^" : "",
554 (*name < 32) ? toCTRL(*name) : *name));
558 #endif /* USE_THREADS */
565 register OP *kid, *nextkid;
567 if (!o || o->op_seq == (U16)-1)
570 if (o->op_flags & OPf_KIDS) {
571 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
572 nextkid = kid->op_sibling; /* Get before next freeing kid */
577 switch (o->op_type) {
579 o->op_targ = 0; /* Was holding old type, if any. */
582 o->op_targ = 0; /* Was holding hints. */
586 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
588 #endif /* USE_THREADS */
590 if (!(o->op_flags & OPf_REF)
591 || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
597 SvREFCNT_dec(cGVOPo->op_gv);
601 Safefree(cCOPo->cop_label);
602 SvREFCNT_dec(cCOPo->cop_filegv);
605 SvREFCNT_dec(cSVOPo->op_sv);
611 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
615 Safefree(cPVOPo->op_pv);
618 op_free(cPMOPo->op_pmreplroot);
622 ReREFCNT_dec(cPMOPo->op_pmregexp);
627 pad_free(o->op_targ);
635 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
636 pad_free(o->op_targ);
637 o->op_targ = o->op_type;
638 o->op_type = OP_NULL;
639 o->op_ppaddr = ppaddr[OP_NULL];
642 /* Contextualizers */
644 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
654 /* establish postfix order */
655 if (cUNOPo->op_first) {
656 o->op_next = LINKLIST(cUNOPo->op_first);
657 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
659 kid->op_next = LINKLIST(kid->op_sibling);
674 if (o && o->op_flags & OPf_KIDS) {
675 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
685 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
687 line_t oldline = curcop->cop_line;
689 if (copline != NOLINE)
690 curcop->cop_line = copline;
691 warn("Found = in conditional, should be ==");
692 curcop->cop_line = oldline;
702 /* assumes no premature commitment */
703 if (!o || (o->op_flags & OPf_WANT) || error_count
704 || o->op_type == OP_RETURN)
707 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
709 switch (o->op_type) {
711 if (o->op_private & OPpREPEAT_DOLIST)
712 null(((LISTOP*)cBINOPo->op_first)->op_first);
713 scalar(cBINOPo->op_first);
718 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
722 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
723 if (!kPMOP->op_pmreplroot)
724 deprecate("implicit split to @_");
731 if (o->op_flags & OPf_KIDS) {
732 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
738 kid = cLISTOPo->op_first;
740 while (kid = kid->op_sibling) {
746 WITH_THR(curcop = &compiling);
751 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
757 WITH_THR(curcop = &compiling);
770 /* assumes no premature commitment */
771 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
772 || o->op_type == OP_RETURN)
775 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
777 switch (o->op_type) {
779 if (!(opargs[o->op_type] & OA_FOLDCONST))
783 if (o->op_flags & OPf_STACKED)
854 if (!(o->op_private & OPpLVAL_INTRO))
855 useless = op_desc[o->op_type];
862 if (!(o->op_private & OPpLVAL_INTRO) &&
863 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
864 useless = "a variable";
869 WITH_THR(curcop = ((COP*)o)); /* for warning below */
875 useless = "a constant";
876 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
878 else if (SvPOK(sv)) {
879 if (strnEQ(SvPVX(sv), "di", 2) ||
880 strnEQ(SvPVX(sv), "ds", 2) ||
881 strnEQ(SvPVX(sv), "ig", 2))
885 null(o); /* don't execute a constant */
886 SvREFCNT_dec(sv); /* don't even remember it */
890 o->op_type = OP_PREINC; /* pre-increment is faster */
891 o->op_ppaddr = ppaddr[OP_PREINC];
895 o->op_type = OP_PREDEC; /* pre-decrement is faster */
896 o->op_ppaddr = ppaddr[OP_PREDEC];
902 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
907 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
908 WITH_THR(curcop = ((COP*)o)); /* for warning below */
909 if (o->op_flags & OPf_STACKED)
915 if (!(o->op_flags & OPf_KIDS))
924 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
931 /* all requires must return a boolean value */
932 o->op_flags &= ~OPf_WANT;
935 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
936 if (!kPMOP->op_pmreplroot)
937 deprecate("implicit split to @_");
941 if (useless && dowarn)
942 warn("Useless use of %s in void context", useless);
950 if (o && o->op_flags & OPf_KIDS) {
951 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
962 /* assumes no premature commitment */
963 if (!o || (o->op_flags & OPf_WANT) || error_count
964 || o->op_type == OP_RETURN)
967 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
969 switch (o->op_type) {
972 list(cBINOPo->op_first);
977 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
984 if (!(o->op_flags & OPf_KIDS))
986 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
987 list(cBINOPo->op_first);
988 return gen_constant_list(o);
995 kid = cLISTOPo->op_first;
997 while (kid = kid->op_sibling) {
1003 WITH_THR(curcop = &compiling);
1007 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1008 if (kid->op_sibling)
1013 WITH_THR(curcop = &compiling);
1016 /* all requires must return a boolean value */
1017 o->op_flags &= ~OPf_WANT;
1029 if (o->op_type == OP_LINESEQ ||
1030 o->op_type == OP_SCOPE ||
1031 o->op_type == OP_LEAVE ||
1032 o->op_type == OP_LEAVETRY)
1035 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1036 if (kid->op_sibling) {
1040 curcop = &compiling;
1042 o->op_flags &= ~OPf_PARENS;
1043 if (hints & HINT_BLOCK_SCOPE)
1044 o->op_flags |= OPf_PARENS;
1047 o = newOP(OP_STUB, 0);
1052 modkids(OP *o, I32 type)
1055 if (o && o->op_flags & OPf_KIDS) {
1056 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1063 mod(OP *o, I32 type)
1069 if (!o || error_count)
1072 switch (o->op_type) {
1077 if (!(o->op_private & (OPpCONST_ARYBASE)))
1079 if (eval_start && eval_start->op_type == OP_CONST) {
1080 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1084 SAVEI32(compiling.cop_arybase);
1085 compiling.cop_arybase = 0;
1087 else if (type == OP_REFGEN)
1090 croak("That use of $[ is unsupported");
1093 if (o->op_flags & OPf_PARENS)
1097 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1098 !(o->op_flags & OPf_STACKED)) {
1099 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1100 o->op_ppaddr = ppaddr[OP_RV2CV];
1101 assert(cUNOPo->op_first->op_type == OP_NULL);
1102 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1108 /* grep, foreach, subcalls, refgen */
1109 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1111 yyerror(form("Can't modify %s in %s",
1112 op_desc[o->op_type],
1113 type ? op_desc[type] : "local"));
1127 case OP_RIGHT_SHIFT:
1136 if (!(o->op_flags & OPf_STACKED))
1142 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1148 if (!type && cUNOPo->op_first->op_type != OP_GV)
1149 croak("Can't localize through a reference");
1150 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1152 return o; /* Treat \(@foo) like ordinary list. */
1156 if (scalar_mod_type(o, type))
1158 ref(cUNOPo->op_first, o->op_type);
1170 if (!type && cUNOPo->op_first->op_type != OP_GV)
1171 croak("Can't localize through a reference");
1172 ref(cUNOPo->op_first, o->op_type);
1176 hints |= HINT_BLOCK_SCOPE;
1185 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1186 return o; /* Treat \(@foo) like ordinary list. */
1187 if (scalar_mod_type(o, type))
1193 croak("Can't localize lexical variable %s",
1194 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1199 modcount++; /* XXX ??? */
1201 #endif /* USE_THREADS */
1207 if (type != OP_SASSIGN)
1213 pad_free(o->op_targ);
1214 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1215 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1216 if (o->op_flags & OPf_KIDS)
1217 mod(cBINOPo->op_first->op_sibling, type);
1222 ref(cBINOPo->op_first, o->op_type);
1223 if (type == OP_ENTERSUB &&
1224 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1225 o->op_private |= OPpLVAL_DEFER;
1232 if (o->op_flags & OPf_KIDS)
1233 mod(cLISTOPo->op_last, type);
1237 if (!(o->op_flags & OPf_KIDS))
1239 if (o->op_targ != OP_LIST) {
1240 mod(cBINOPo->op_first, type);
1245 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1249 o->op_flags |= OPf_MOD;
1251 if (type == OP_AASSIGN || type == OP_SASSIGN)
1252 o->op_flags |= OPf_SPECIAL|OPf_REF;
1254 o->op_private |= OPpLVAL_INTRO;
1255 o->op_flags &= ~OPf_SPECIAL;
1256 hints |= HINT_BLOCK_SCOPE;
1258 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1259 o->op_flags |= OPf_REF;
1264 scalar_mod_type(OP *o, I32 type)
1268 if (o->op_type == OP_RV2GV)
1292 case OP_RIGHT_SHIFT:
1299 case OP_ANDASSIGN: /* may work later */
1300 case OP_ORASSIGN: /* may work later */
1308 refkids(OP *o, I32 type)
1311 if (o && o->op_flags & OPf_KIDS) {
1312 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1319 ref(OP *o, I32 type)
1323 if (!o || error_count)
1326 switch (o->op_type) {
1328 if ((type == OP_DEFINED || type == OP_LOCK) &&
1329 !(o->op_flags & OPf_STACKED)) {
1330 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1331 o->op_ppaddr = ppaddr[OP_RV2CV];
1332 assert(cUNOPo->op_first->op_type == OP_NULL);
1333 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1334 o->op_flags |= OPf_SPECIAL;
1339 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1343 ref(cUNOPo->op_first, o->op_type);
1346 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1347 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1348 : type == OP_RV2HV ? OPpDEREF_HV
1350 o->op_flags |= OPf_MOD;
1355 o->op_flags |= OPf_MOD; /* XXX ??? */
1360 o->op_flags |= OPf_REF;
1363 ref(cUNOPo->op_first, o->op_type);
1368 o->op_flags |= OPf_REF;
1373 if (!(o->op_flags & OPf_KIDS))
1375 ref(cBINOPo->op_first, type);
1379 ref(cBINOPo->op_first, o->op_type);
1380 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1381 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1382 : type == OP_RV2HV ? OPpDEREF_HV
1384 o->op_flags |= OPf_MOD;
1392 if (!(o->op_flags & OPf_KIDS))
1394 ref(cLISTOPo->op_last, type);
1409 if (!o || error_count)
1413 if (type == OP_LIST) {
1414 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1416 } else if (type == OP_UNDEF) {
1418 } else if (type != OP_PADSV &&
1421 type != OP_PUSHMARK)
1423 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1426 o->op_flags |= OPf_MOD;
1427 o->op_private |= OPpLVAL_INTRO;
1435 o->op_flags |= OPf_PARENS;
1440 bind_match(I32 type, OP *left, OP *right)
1445 (left->op_type == OP_RV2AV ||
1446 left->op_type == OP_RV2HV ||
1447 left->op_type == OP_PADAV ||
1448 left->op_type == OP_PADHV)) {
1449 char *desc = op_desc[(right->op_type == OP_SUBST ||
1450 right->op_type == OP_TRANS)
1451 ? right->op_type : OP_MATCH];
1452 char *sample = ((left->op_type == OP_RV2AV ||
1453 left->op_type == OP_PADAV)
1454 ? "@array" : "%hash");
1455 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1458 if (right->op_type == OP_MATCH ||
1459 right->op_type == OP_SUBST ||
1460 right->op_type == OP_TRANS) {
1461 right->op_flags |= OPf_STACKED;
1462 if (right->op_type != OP_MATCH)
1463 left = mod(left, right->op_type);
1464 if (right->op_type == OP_TRANS)
1465 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1467 o = prepend_elem(right->op_type, scalar(left), right);
1469 return newUNOP(OP_NOT, 0, scalar(o));
1473 return bind_match(type, left,
1474 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1482 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1483 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1490 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1491 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1492 o->op_type = OP_LEAVE;
1493 o->op_ppaddr = ppaddr[OP_LEAVE];
1496 if (o->op_type == OP_LINESEQ) {
1498 o->op_type = OP_SCOPE;
1499 o->op_ppaddr = ppaddr[OP_SCOPE];
1500 kid = ((LISTOP*)o)->op_first;
1501 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1502 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1507 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1514 block_start(int full)
1517 int retval = savestack_ix;
1518 SAVEI32(comppad_name_floor);
1520 if ((comppad_name_fill = AvFILLp(comppad_name)) > 0)
1521 comppad_name_floor = comppad_name_fill;
1523 comppad_name_floor = 0;
1525 SAVEI32(min_intro_pending);
1526 SAVEI32(max_intro_pending);
1527 min_intro_pending = 0;
1528 SAVEI32(comppad_name_fill);
1529 SAVEI32(padix_floor);
1530 padix_floor = padix;
1531 pad_reset_pending = FALSE;
1533 hints &= ~HINT_BLOCK_SCOPE;
1538 block_end(I32 floor, OP *seq)
1541 int needblockscope = hints & HINT_BLOCK_SCOPE;
1542 OP* retval = scalarseq(seq);
1544 pad_reset_pending = FALSE;
1546 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1547 pad_leavemy(comppad_name_fill);
1556 OP *o = newOP(OP_THREADSV, 0);
1557 o->op_targ = find_threadsv("_");
1560 return newSVREF(newGVOP(OP_GV, 0, defgv));
1561 #endif /* USE_THREADS */
1569 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1570 eval_start = linklist(eval_root);
1571 eval_root->op_next = 0;
1577 main_root = scope(sawparens(scalarvoid(o)));
1578 curcop = &compiling;
1579 main_start = LINKLIST(main_root);
1580 main_root->op_next = 0;
1584 /* Register with debugger */
1586 CV *cv = perl_get_cv("DB::postponed", FALSE);
1590 XPUSHs((SV*)compiling.cop_filegv);
1592 perl_call_sv((SV*)cv, G_DISCARD);
1599 localize(OP *o, I32 lex)
1601 if (o->op_flags & OPf_PARENS)
1604 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1606 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1607 if (*s == ';' || *s == '=')
1608 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1612 in_my_stash = Nullhv;
1616 return mod(o, OP_NULL); /* a bit kludgey */
1622 if (o->op_type == OP_LIST) {
1625 o2 = newOP(OP_THREADSV, 0);
1626 o2->op_targ = find_threadsv(";");
1628 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1629 #endif /* USE_THREADS */
1630 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1636 fold_constants(register OP *o)
1640 I32 type = o->op_type;
1643 if (opargs[type] & OA_RETSCALAR)
1645 if (opargs[type] & OA_TARGET)
1646 o->op_targ = pad_alloc(type, SVs_PADTMP);
1648 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1649 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1651 if (!(opargs[type] & OA_FOLDCONST))
1666 if (o->op_private & OPpLOCALE)
1671 goto nope; /* Don't try to run w/ errors */
1673 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1674 if (curop->op_type != OP_CONST &&
1675 curop->op_type != OP_LIST &&
1676 curop->op_type != OP_SCALAR &&
1677 curop->op_type != OP_NULL &&
1678 curop->op_type != OP_PUSHMARK) {
1683 curop = LINKLIST(o);
1688 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1689 pad_swipe(o->op_targ);
1690 else if (SvTEMP(sv)) { /* grab mortal temp? */
1691 (void)SvREFCNT_inc(sv);
1695 if (type == OP_RV2GV)
1696 return newGVOP(OP_GV, 0, (GV*)sv);
1698 /* try to smush double to int, but don't smush -2.0 to -2 */
1699 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1703 if ((double)iv == SvNV(sv)) {
1708 SvIOK_off(sv); /* undo SvIV() damage */
1710 return newSVOP(OP_CONST, 0, sv);
1714 if (!(opargs[type] & OA_OTHERINT))
1717 if (!(hints & HINT_INTEGER)) {
1718 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1721 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1722 if (curop->op_type == OP_CONST) {
1723 if (SvIOK(((SVOP*)curop)->op_sv))
1727 if (opargs[curop->op_type] & OA_RETINTEGER)
1731 o->op_ppaddr = ppaddr[++(o->op_type)];
1738 gen_constant_list(register OP *o)
1742 I32 oldtmps_floor = tmps_floor;
1746 return o; /* Don't attempt to run with errors */
1748 op = curop = LINKLIST(o);
1754 tmps_floor = oldtmps_floor;
1756 o->op_type = OP_RV2AV;
1757 o->op_ppaddr = ppaddr[OP_RV2AV];
1758 curop = ((UNOP*)o)->op_first;
1759 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1766 convert(I32 type, I32 flags, OP *o)
1771 if (!o || o->op_type != OP_LIST)
1772 o = newLISTOP(OP_LIST, 0, o, Nullop);
1774 o->op_flags &= ~OPf_WANT;
1776 if (!(opargs[type] & OA_MARK))
1777 null(cLISTOPo->op_first);
1780 o->op_ppaddr = ppaddr[type];
1781 o->op_flags |= flags;
1783 o = CHECKOP(type, o);
1784 if (o->op_type != type)
1787 if (cLISTOPo->op_children < 7) {
1788 /* XXX do we really need to do this if we're done appending?? */
1789 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1791 cLISTOPo->op_last = last; /* in case check substituted last arg */
1794 return fold_constants(o);
1797 /* List constructors */
1800 append_elem(I32 type, OP *first, OP *last)
1808 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1809 return newLISTOP(type, 0, first, last);
1811 if (first->op_flags & OPf_KIDS)
1812 ((LISTOP*)first)->op_last->op_sibling = last;
1814 first->op_flags |= OPf_KIDS;
1815 ((LISTOP*)first)->op_first = last;
1817 ((LISTOP*)first)->op_last = last;
1818 ((LISTOP*)first)->op_children++;
1823 append_list(I32 type, LISTOP *first, LISTOP *last)
1831 if (first->op_type != type)
1832 return prepend_elem(type, (OP*)first, (OP*)last);
1834 if (last->op_type != type)
1835 return append_elem(type, (OP*)first, (OP*)last);
1837 first->op_last->op_sibling = last->op_first;
1838 first->op_last = last->op_last;
1839 first->op_children += last->op_children;
1840 if (first->op_children)
1841 last->op_flags |= OPf_KIDS;
1848 prepend_elem(I32 type, OP *first, OP *last)
1856 if (last->op_type == type) {
1857 if (type == OP_LIST) { /* already a PUSHMARK there */
1858 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1859 ((LISTOP*)last)->op_first->op_sibling = first;
1862 if (!(last->op_flags & OPf_KIDS)) {
1863 ((LISTOP*)last)->op_last = first;
1864 last->op_flags |= OPf_KIDS;
1866 first->op_sibling = ((LISTOP*)last)->op_first;
1867 ((LISTOP*)last)->op_first = first;
1869 ((LISTOP*)last)->op_children++;
1873 return newLISTOP(type, 0, first, last);
1881 return newOP(OP_STUB, 0);
1887 if (!o || o->op_type != OP_LIST)
1888 o = newLISTOP(OP_LIST, 0, o, Nullop);
1894 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1898 Newz(1101, listop, 1, LISTOP);
1900 listop->op_type = type;
1901 listop->op_ppaddr = ppaddr[type];
1902 listop->op_children = (first != 0) + (last != 0);
1903 listop->op_flags = flags;
1907 else if (!first && last)
1910 first->op_sibling = last;
1911 listop->op_first = first;
1912 listop->op_last = last;
1913 if (type == OP_LIST) {
1915 pushop = newOP(OP_PUSHMARK, 0);
1916 pushop->op_sibling = first;
1917 listop->op_first = pushop;
1918 listop->op_flags |= OPf_KIDS;
1920 listop->op_last = pushop;
1922 else if (listop->op_children)
1923 listop->op_flags |= OPf_KIDS;
1929 newOP(I32 type, I32 flags)
1932 Newz(1101, o, 1, OP);
1934 o->op_ppaddr = ppaddr[type];
1935 o->op_flags = flags;
1938 o->op_private = 0 + (flags >> 8);
1939 if (opargs[type] & OA_RETSCALAR)
1941 if (opargs[type] & OA_TARGET)
1942 o->op_targ = pad_alloc(type, SVs_PADTMP);
1943 return CHECKOP(type, o);
1947 newUNOP(I32 type, I32 flags, OP *first)
1952 first = newOP(OP_STUB, 0);
1953 if (opargs[type] & OA_MARK)
1954 first = force_list(first);
1956 Newz(1101, unop, 1, UNOP);
1957 unop->op_type = type;
1958 unop->op_ppaddr = ppaddr[type];
1959 unop->op_first = first;
1960 unop->op_flags = flags | OPf_KIDS;
1961 unop->op_private = 1 | (flags >> 8);
1963 if(type == OP_STUDY && first->op_type == OP_MATCH) {
1964 first->op_type = OP_PUSHRE;
1965 first->op_ppaddr = ppaddr[OP_PUSHRE];
1968 unop = (UNOP*) CHECKOP(type, unop);
1972 return fold_constants((OP *) unop);
1976 newBINOP(I32 type, I32 flags, OP *first, OP *last)
1979 Newz(1101, binop, 1, BINOP);
1982 first = newOP(OP_NULL, 0);
1984 binop->op_type = type;
1985 binop->op_ppaddr = ppaddr[type];
1986 binop->op_first = first;
1987 binop->op_flags = flags | OPf_KIDS;
1990 binop->op_private = 1 | (flags >> 8);
1993 binop->op_private = 2 | (flags >> 8);
1994 first->op_sibling = last;
1997 binop = (BINOP*)CHECKOP(type, binop);
2001 binop->op_last = last = binop->op_first->op_sibling;
2003 return fold_constants((OP *)binop);
2007 pmtrans(OP *o, OP *expr, OP *repl)
2009 SV *tstr = ((SVOP*)expr)->op_sv;
2010 SV *rstr = ((SVOP*)repl)->op_sv;
2013 register U8 *t = (U8*)SvPV(tstr, tlen);
2014 register U8 *r = (U8*)SvPV(rstr, rlen);
2020 register short *tbl;
2022 tbl = (short*)cPVOPo->op_pv;
2023 complement = o->op_private & OPpTRANS_COMPLEMENT;
2024 Delete = o->op_private & OPpTRANS_DELETE;
2025 squash = o->op_private & OPpTRANS_SQUASH;
2028 Zero(tbl, 256, short);
2029 for (i = 0; i < tlen; i++)
2031 for (i = 0, j = 0; i < 256; i++) {
2047 if (!rlen && !Delete) {
2050 o->op_private |= OPpTRANS_COUNTONLY;
2052 for (i = 0; i < 256; i++)
2054 for (i = 0, j = 0; i < tlen; i++,j++) {
2057 if (tbl[t[i]] == -1)
2063 if (tbl[t[i]] == -1)
2074 newPMOP(I32 type, I32 flags)
2079 Newz(1101, pmop, 1, PMOP);
2080 pmop->op_type = type;
2081 pmop->op_ppaddr = ppaddr[type];
2082 pmop->op_flags = flags;
2083 pmop->op_private = 0 | (flags >> 8);
2085 if (hints & HINT_LOCALE)
2086 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2088 /* link into pm list */
2089 if (type != OP_TRANS && curstash) {
2090 pmop->op_pmnext = HvPMROOT(curstash);
2091 HvPMROOT(curstash) = pmop;
2098 pmruntime(OP *o, OP *expr, OP *repl)
2103 if (o->op_type == OP_TRANS)
2104 return pmtrans(o, expr, repl);
2106 hints |= HINT_BLOCK_SCOPE;
2109 if (expr->op_type == OP_CONST) {
2111 SV *pat = ((SVOP*)expr)->op_sv;
2112 char *p = SvPV(pat, plen);
2113 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2114 sv_setpvn(pat, "\\s+", 3);
2115 p = SvPV(pat, plen);
2116 pm->op_pmflags |= PMf_SKIPWHITE;
2118 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2119 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2120 pm->op_pmflags |= PMf_WHITE;
2124 if (pm->op_pmflags & PMf_KEEP)
2125 expr = newUNOP(OP_REGCMAYBE,0,expr);
2127 Newz(1101, rcop, 1, LOGOP);
2128 rcop->op_type = OP_REGCOMP;
2129 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2130 rcop->op_first = scalar(expr);
2131 rcop->op_flags |= OPf_KIDS;
2132 rcop->op_private = 1;
2135 /* establish postfix order */
2136 if (pm->op_pmflags & PMf_KEEP) {
2138 rcop->op_next = expr;
2139 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2142 rcop->op_next = LINKLIST(expr);
2143 expr->op_next = (OP*)rcop;
2146 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2151 if (pm->op_pmflags & PMf_EVAL)
2154 else if (repl->op_type == OP_THREADSV
2155 && strchr("&`'123456789+",
2156 threadsv_names[repl->op_targ]))
2160 #endif /* USE_THREADS */
2161 else if (repl->op_type == OP_CONST)
2165 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2166 if (opargs[curop->op_type] & OA_DANGEROUS) {
2168 if (curop->op_type == OP_THREADSV
2169 && strchr("&`'123456789+", curop->op_private)) {
2173 if (curop->op_type == OP_GV) {
2174 GV *gv = ((GVOP*)curop)->op_gv;
2175 if (strchr("&`'123456789+", *GvENAME(gv)))
2178 #endif /* USE_THREADS */
2179 else if (curop->op_type == OP_RV2CV)
2181 else if (curop->op_type == OP_RV2SV ||
2182 curop->op_type == OP_RV2AV ||
2183 curop->op_type == OP_RV2HV ||
2184 curop->op_type == OP_RV2GV) {
2185 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2188 else if (curop->op_type == OP_PADSV ||
2189 curop->op_type == OP_PADAV ||
2190 curop->op_type == OP_PADHV ||
2191 curop->op_type == OP_PADANY) {
2200 if (curop == repl) {
2201 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2202 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2203 prepend_elem(o->op_type, scalar(repl), o);
2206 Newz(1101, rcop, 1, LOGOP);
2207 rcop->op_type = OP_SUBSTCONT;
2208 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2209 rcop->op_first = scalar(repl);
2210 rcop->op_flags |= OPf_KIDS;
2211 rcop->op_private = 1;
2214 /* establish postfix order */
2215 rcop->op_next = LINKLIST(repl);
2216 repl->op_next = (OP*)rcop;
2218 pm->op_pmreplroot = scalar((OP*)rcop);
2219 pm->op_pmreplstart = LINKLIST(rcop);
2228 newSVOP(I32 type, I32 flags, SV *sv)
2231 Newz(1101, svop, 1, SVOP);
2232 svop->op_type = type;
2233 svop->op_ppaddr = ppaddr[type];
2235 svop->op_next = (OP*)svop;
2236 svop->op_flags = flags;
2237 if (opargs[type] & OA_RETSCALAR)
2239 if (opargs[type] & OA_TARGET)
2240 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2241 return CHECKOP(type, svop);
2245 newGVOP(I32 type, I32 flags, GV *gv)
2249 Newz(1101, gvop, 1, GVOP);
2250 gvop->op_type = type;
2251 gvop->op_ppaddr = ppaddr[type];
2252 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2253 gvop->op_next = (OP*)gvop;
2254 gvop->op_flags = flags;
2255 if (opargs[type] & OA_RETSCALAR)
2257 if (opargs[type] & OA_TARGET)
2258 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2259 return CHECKOP(type, gvop);
2263 newPVOP(I32 type, I32 flags, char *pv)
2266 Newz(1101, pvop, 1, PVOP);
2267 pvop->op_type = type;
2268 pvop->op_ppaddr = ppaddr[type];
2270 pvop->op_next = (OP*)pvop;
2271 pvop->op_flags = flags;
2272 if (opargs[type] & OA_RETSCALAR)
2274 if (opargs[type] & OA_TARGET)
2275 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2276 return CHECKOP(type, pvop);
2285 save_hptr(&curstash);
2286 save_item(curstname);
2291 name = SvPV(sv, len);
2292 curstash = gv_stashpvn(name,len,TRUE);
2293 sv_setpvn(curstname, name, len);
2297 sv_setpv(curstname,"<none>");
2305 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2313 if (id->op_type != OP_CONST)
2314 croak("Module name must be constant");
2318 if(version != Nullop) {
2319 SV *vesv = ((SVOP*)version)->op_sv;
2321 if (arg == Nullop && !SvNIOK(vesv)) {
2328 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2329 croak("Version number must be constant number");
2331 /* Make copy of id so we don't free it twice */
2332 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2334 /* Fake up a method call to VERSION */
2335 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2336 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2337 append_elem(OP_LIST,
2338 prepend_elem(OP_LIST, pack, list(version)),
2339 newUNOP(OP_METHOD, 0, meth)));
2343 /* Fake up an import/unimport */
2344 if (arg && arg->op_type == OP_STUB)
2345 imop = arg; /* no import on explicit () */
2346 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2347 imop = Nullop; /* use 5.0; */
2350 /* Make copy of id so we don't free it twice */
2351 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2352 meth = newSVOP(OP_CONST, 0,
2354 ? newSVpv("import", 6)
2355 : newSVpv("unimport", 8)
2357 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2358 append_elem(OP_LIST,
2359 prepend_elem(OP_LIST, pack, list(arg)),
2360 newUNOP(OP_METHOD, 0, meth)));
2363 /* Fake up a require */
2364 rqop = newUNOP(OP_REQUIRE, 0, id);
2366 /* Fake up the BEGIN {}, which does its thing immediately. */
2368 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2370 append_elem(OP_LINESEQ,
2371 append_elem(OP_LINESEQ,
2372 newSTATEOP(0, Nullch, rqop),
2373 newSTATEOP(0, Nullch, veop)),
2374 newSTATEOP(0, Nullch, imop) ));
2381 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2383 return newBINOP(OP_LSLICE, flags,
2384 list(force_list(subscript)),
2385 list(force_list(listval)) );
2389 list_assignment(register OP *o)
2394 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2395 o = cUNOPo->op_first;
2397 if (o->op_type == OP_COND_EXPR) {
2398 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2399 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2404 yyerror("Assignment to both a list and a scalar");
2408 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2409 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2410 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2413 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2416 if (o->op_type == OP_RV2SV)
2423 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2428 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2429 return newLOGOP(optype, 0,
2430 mod(scalar(left), optype),
2431 newUNOP(OP_SASSIGN, 0, scalar(right)));
2434 return newBINOP(optype, OPf_STACKED,
2435 mod(scalar(left), optype), scalar(right));
2439 if (list_assignment(left)) {
2442 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2443 left = mod(left, OP_AASSIGN);
2451 o = newBINOP(OP_AASSIGN, flags,
2452 list(force_list(right)),
2453 list(force_list(left)) );
2454 o->op_private = 0 | (flags >> 8);
2455 if (!(left->op_private & OPpLVAL_INTRO)) {
2459 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2460 if (opargs[curop->op_type] & OA_DANGEROUS) {
2461 if (curop->op_type == OP_GV) {
2462 GV *gv = ((GVOP*)curop)->op_gv;
2463 if (gv == defgv || SvCUR(gv) == generation)
2465 SvCUR(gv) = generation;
2467 else if (curop->op_type == OP_PADSV ||
2468 curop->op_type == OP_PADAV ||
2469 curop->op_type == OP_PADHV ||
2470 curop->op_type == OP_PADANY) {
2471 SV **svp = AvARRAY(comppad_name);
2472 SV *sv = svp[curop->op_targ];
2473 if (SvCUR(sv) == generation)
2475 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2477 else if (curop->op_type == OP_RV2CV)
2479 else if (curop->op_type == OP_RV2SV ||
2480 curop->op_type == OP_RV2AV ||
2481 curop->op_type == OP_RV2HV ||
2482 curop->op_type == OP_RV2GV) {
2483 if (lastop->op_type != OP_GV) /* funny deref? */
2492 o->op_private = OPpASSIGN_COMMON;
2494 if (right && right->op_type == OP_SPLIT) {
2496 if ((tmpop = ((LISTOP*)right)->op_first) &&
2497 tmpop->op_type == OP_PUSHRE)
2499 PMOP *pm = (PMOP*)tmpop;
2500 if (left->op_type == OP_RV2AV &&
2501 !(left->op_private & OPpLVAL_INTRO) &&
2502 !(o->op_private & OPpASSIGN_COMMON) )
2504 tmpop = ((UNOP*)left)->op_first;
2505 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2506 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2507 pm->op_pmflags |= PMf_ONCE;
2508 tmpop = cUNOPo->op_first; /* to list (nulled) */
2509 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2510 tmpop->op_sibling = Nullop; /* don't free split */
2511 right->op_next = tmpop->op_next; /* fix starting loc */
2512 op_free(o); /* blow off assign */
2513 right->op_flags &= ~OPf_WANT;
2514 /* "I don't know and I don't care." */
2519 if (modcount < 10000 &&
2520 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2522 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2524 sv_setiv(sv, modcount+1);
2532 right = newOP(OP_UNDEF, 0);
2533 if (right->op_type == OP_READLINE) {
2534 right->op_flags |= OPf_STACKED;
2535 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2538 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2539 o = newBINOP(OP_SASSIGN, flags,
2540 scalar(right), mod(scalar(left), OP_SASSIGN) );
2552 newSTATEOP(I32 flags, char *label, OP *o)
2555 U32 seq = intro_my();
2558 Newz(1101, cop, 1, COP);
2559 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2560 cop->op_type = OP_DBSTATE;
2561 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2564 cop->op_type = OP_NEXTSTATE;
2565 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2567 cop->op_flags = flags;
2568 cop->op_private = 0 | (flags >> 8);
2570 cop->op_private |= NATIVE_HINTS;
2572 cop->op_next = (OP*)cop;
2575 cop->cop_label = label;
2576 hints |= HINT_BLOCK_SCOPE;
2579 cop->cop_arybase = curcop->cop_arybase;
2581 if (copline == NOLINE)
2582 cop->cop_line = curcop->cop_line;
2584 cop->cop_line = copline;
2587 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2588 cop->cop_stash = curstash;
2590 if (PERLDB_LINE && curstash != debstash) {
2591 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2592 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2593 (void)SvIOK_on(*svp);
2595 SvSTASH(*svp) = (HV*)cop;
2599 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2602 /* "Introduce" my variables to visible status. */
2610 if (! min_intro_pending)
2613 svp = AvARRAY(comppad_name);
2614 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2615 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2616 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2617 SvNVX(sv) = (double)cop_seqmax;
2620 min_intro_pending = 0;
2621 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2622 return cop_seqmax++;
2626 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2628 return new_logop(type, flags, &first, &other);
2632 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2637 OP *first = *firstp;
2638 OP *other = *otherp;
2640 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2641 return newBINOP(type, flags, scalar(first), scalar(other));
2643 scalarboolean(first);
2644 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2645 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2646 if (type == OP_AND || type == OP_OR) {
2652 first = *firstp = cUNOPo->op_first;
2654 first->op_next = o->op_next;
2655 cUNOPo->op_first = Nullop;
2659 if (first->op_type == OP_CONST) {
2660 if (dowarn && (first->op_private & OPpCONST_BARE))
2661 warn("Probable precedence problem on %s", op_desc[type]);
2662 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2673 else if (first->op_type == OP_WANTARRAY) {
2679 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2680 OP *k1 = ((UNOP*)first)->op_first;
2681 OP *k2 = k1->op_sibling;
2683 switch (first->op_type)
2686 if (k2 && k2->op_type == OP_READLINE
2687 && (k2->op_flags & OPf_STACKED)
2688 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2689 warnop = k2->op_type;
2693 if (k1->op_type == OP_READDIR
2694 || k1->op_type == OP_GLOB
2695 || k1->op_type == OP_EACH)
2696 warnop = k1->op_type;
2700 line_t oldline = curcop->cop_line;
2701 curcop->cop_line = copline;
2702 warn("Value of %s%s can be \"0\"; test with defined()",
2704 ((warnop == OP_READLINE || warnop == OP_GLOB)
2705 ? " construct" : "() operator"));
2706 curcop->cop_line = oldline;
2713 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2714 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2716 Newz(1101, logop, 1, LOGOP);
2718 logop->op_type = type;
2719 logop->op_ppaddr = ppaddr[type];
2720 logop->op_first = first;
2721 logop->op_flags = flags | OPf_KIDS;
2722 logop->op_other = LINKLIST(other);
2723 logop->op_private = 1 | (flags >> 8);
2725 /* establish postfix order */
2726 logop->op_next = LINKLIST(first);
2727 first->op_next = (OP*)logop;
2728 first->op_sibling = other;
2730 o = newUNOP(OP_NULL, 0, (OP*)logop);
2737 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2744 return newLOGOP(OP_AND, 0, first, trueop);
2746 return newLOGOP(OP_OR, 0, first, falseop);
2748 scalarboolean(first);
2749 if (first->op_type == OP_CONST) {
2750 if (SvTRUE(((SVOP*)first)->op_sv)) {
2761 else if (first->op_type == OP_WANTARRAY) {
2765 Newz(1101, condop, 1, CONDOP);
2767 condop->op_type = OP_COND_EXPR;
2768 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2769 condop->op_first = first;
2770 condop->op_flags = flags | OPf_KIDS;
2771 condop->op_true = LINKLIST(trueop);
2772 condop->op_false = LINKLIST(falseop);
2773 condop->op_private = 1 | (flags >> 8);
2775 /* establish postfix order */
2776 condop->op_next = LINKLIST(first);
2777 first->op_next = (OP*)condop;
2779 first->op_sibling = trueop;
2780 trueop->op_sibling = falseop;
2781 o = newUNOP(OP_NULL, 0, (OP*)condop);
2783 trueop->op_next = o;
2784 falseop->op_next = o;
2790 newRANGE(I32 flags, OP *left, OP *right)
2798 Newz(1101, condop, 1, CONDOP);
2800 condop->op_type = OP_RANGE;
2801 condop->op_ppaddr = ppaddr[OP_RANGE];
2802 condop->op_first = left;
2803 condop->op_flags = OPf_KIDS;
2804 condop->op_true = LINKLIST(left);
2805 condop->op_false = LINKLIST(right);
2806 condop->op_private = 1 | (flags >> 8);
2808 left->op_sibling = right;
2810 condop->op_next = (OP*)condop;
2811 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2812 flop = newUNOP(OP_FLOP, 0, flip);
2813 o = newUNOP(OP_NULL, 0, flop);
2816 left->op_next = flip;
2817 right->op_next = flop;
2819 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2820 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2821 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2822 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2824 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2825 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2828 if (!flip->op_private || !flop->op_private)
2829 linklist(o); /* blow off optimizer unless constant */
2835 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2840 int once = block && block->op_flags & OPf_SPECIAL &&
2841 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2844 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2845 return block; /* do {} while 0 does once */
2846 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2847 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2848 expr = newUNOP(OP_DEFINED, 0,
2849 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2850 } else if (expr->op_flags & OPf_KIDS) {
2851 OP *k1 = ((UNOP*)expr)->op_first;
2852 OP *k2 = (k1) ? k1->op_sibling : NULL;
2853 switch (expr->op_type) {
2855 if (k2 && k2->op_type == OP_READLINE
2856 && (k2->op_flags & OPf_STACKED)
2857 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2858 expr = newUNOP(OP_DEFINED, 0, expr);
2862 if (k1->op_type == OP_READDIR
2863 || k1->op_type == OP_GLOB
2864 || k1->op_type == OP_EACH)
2865 expr = newUNOP(OP_DEFINED, 0, expr);
2871 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2872 o = new_logop(OP_AND, 0, &expr, &listop);
2875 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2877 if (once && o != listop)
2878 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2881 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2883 o->op_flags |= flags;
2885 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2890 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2899 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2900 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2901 expr = newUNOP(OP_DEFINED, 0,
2902 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2903 } else if (expr && (expr->op_flags & OPf_KIDS)) {
2904 OP *k1 = ((UNOP*)expr)->op_first;
2905 OP *k2 = (k1) ? k1->op_sibling : NULL;
2906 switch (expr->op_type) {
2908 if (k2 && k2->op_type == OP_READLINE
2909 && (k2->op_flags & OPf_STACKED)
2910 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2911 expr = newUNOP(OP_DEFINED, 0, expr);
2915 if (k1->op_type == OP_READDIR
2916 || k1->op_type == OP_GLOB
2917 || k1->op_type == OP_EACH)
2918 expr = newUNOP(OP_DEFINED, 0, expr);
2924 block = newOP(OP_NULL, 0);
2927 next = LINKLIST(cont);
2929 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2930 if ((line_t)whileline != NOLINE) {
2931 copline = whileline;
2932 cont = append_elem(OP_LINESEQ, cont,
2933 newSTATEOP(0, Nullch, Nullop));
2937 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2938 redo = LINKLIST(listop);
2941 copline = whileline;
2943 o = new_logop(OP_AND, 0, &expr, &listop);
2944 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2945 op_free(expr); /* oops, it's a while (0) */
2947 return Nullop; /* listop already freed by new_logop */
2950 ((LISTOP*)listop)->op_last->op_next = condop =
2951 (o == listop ? redo : LINKLIST(o));
2959 Newz(1101,loop,1,LOOP);
2960 loop->op_type = OP_ENTERLOOP;
2961 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2962 loop->op_private = 0;
2963 loop->op_next = (OP*)loop;
2966 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2968 loop->op_redoop = redo;
2969 loop->op_lastop = o;
2972 loop->op_nextop = next;
2974 loop->op_nextop = o;
2976 o->op_flags |= flags;
2977 o->op_private |= (flags >> 8);
2982 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2990 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2991 sv->op_type = OP_RV2GV;
2992 sv->op_ppaddr = ppaddr[OP_RV2GV];
2994 else if (sv->op_type == OP_PADSV) { /* private variable */
2995 padoff = sv->op_targ;
2999 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3000 padoff = sv->op_targ;
3001 iterflags |= OPf_SPECIAL;
3006 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3010 padoff = find_threadsv("_");
3011 iterflags |= OPf_SPECIAL;
3013 sv = newGVOP(OP_GV, 0, defgv);
3016 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3017 expr = scalar(ref(expr, OP_ITER));
3018 iterflags |= OPf_STACKED;
3020 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3021 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
3023 assert(!loop->op_next);
3024 Renew(loop, 1, LOOP);
3025 loop->op_targ = padoff;
3026 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3028 return newSTATEOP(0, label, wop);
3032 newLOOPEX(I32 type, OP *label)
3036 if (type != OP_GOTO || label->op_type == OP_CONST) {
3037 /* "last()" means "last" */
3038 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3039 o = newOP(type, OPf_SPECIAL);
3041 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3042 ? SvPVx(((SVOP*)label)->op_sv, na)
3048 if (label->op_type == OP_ENTERSUB)
3049 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3050 o = newUNOP(type, OPf_STACKED, label);
3052 hints |= HINT_BLOCK_SCOPE;
3062 MUTEX_DESTROY(CvMUTEXP(cv));
3063 Safefree(CvMUTEXP(cv));
3066 #endif /* USE_THREADS */
3068 if (!CvXSUB(cv) && CvROOT(cv)) {
3070 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3071 croak("Can't undef active subroutine");
3074 croak("Can't undef active subroutine");
3075 #endif /* USE_THREADS */
3082 op_free(CvROOT(cv));
3083 CvROOT(cv) = Nullop;
3086 SvPOK_off((SV*)cv); /* forget prototype */
3088 SvREFCNT_dec(CvGV(cv));
3090 SvREFCNT_dec(CvOUTSIDE(cv));
3091 CvOUTSIDE(cv) = Nullcv;
3092 if (CvPADLIST(cv)) {
3093 /* may be during global destruction */
3094 if (SvREFCNT(CvPADLIST(cv))) {
3095 I32 i = AvFILLp(CvPADLIST(cv));
3097 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3098 SV* sv = svp ? *svp : Nullsv;
3101 if (sv == (SV*)comppad_name)
3102 comppad_name = Nullav;
3103 else if (sv == (SV*)comppad) {
3105 curpad = Null(SV**);
3109 SvREFCNT_dec((SV*)CvPADLIST(cv));
3111 CvPADLIST(cv) = Nullav;
3115 #ifdef DEBUG_CLOSURES
3120 CV *outside = CvOUTSIDE(cv);
3121 AV* padlist = CvPADLIST(cv);
3128 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3130 (CvANON(cv) ? "ANON"
3131 : (cv == main_cv) ? "MAIN"
3132 : CvUNIQUE(outside) ? "UNIQUE"
3133 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3136 : CvANON(outside) ? "ANON"
3137 : (outside == main_cv) ? "MAIN"
3138 : CvUNIQUE(outside) ? "UNIQUE"
3139 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3144 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3145 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3146 pname = AvARRAY(pad_name);
3147 ppad = AvARRAY(pad);
3149 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3150 if (SvPOK(pname[ix]))
3151 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3153 SvFAKE(pname[ix]) ? "FAKE " : "",
3155 (long)I_32(SvNVX(pname[ix])),
3156 (long)SvIVX(pname[ix]));
3159 #endif /* DEBUG_CLOSURES */
3162 cv_clone2(CV *proto, CV *outside)
3167 AV* protopadlist = CvPADLIST(proto);
3168 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3169 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3170 SV** pname = AvARRAY(protopad_name);
3171 SV** ppad = AvARRAY(protopad);
3172 I32 fname = AvFILLp(protopad_name);
3173 I32 fpad = AvFILLp(protopad);
3177 assert(!CvUNIQUE(proto));
3182 SAVESPTR(comppad_name);
3185 cv = compcv = (CV*)NEWSV(1104,0);
3186 sv_upgrade((SV *)cv, SvTYPE(proto));
3192 New(666, CvMUTEXP(cv), 1, perl_mutex);
3193 MUTEX_INIT(CvMUTEXP(cv));
3195 #endif /* USE_THREADS */
3196 CvFILEGV(cv) = CvFILEGV(proto);
3197 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3198 CvSTASH(cv) = CvSTASH(proto);
3199 CvROOT(cv) = CvROOT(proto);
3200 CvSTART(cv) = CvSTART(proto);
3202 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3205 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3207 comppad_name = newAV();
3208 for (ix = fname; ix >= 0; ix--)
3209 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3213 comppadlist = newAV();
3214 AvREAL_off(comppadlist);
3215 av_store(comppadlist, 0, (SV*)comppad_name);
3216 av_store(comppadlist, 1, (SV*)comppad);
3217 CvPADLIST(cv) = comppadlist;
3218 av_fill(comppad, AvFILLp(protopad));
3219 curpad = AvARRAY(comppad);
3221 av = newAV(); /* will be @_ */
3223 av_store(comppad, 0, (SV*)av);
3224 AvFLAGS(av) = AVf_REIFY;
3226 for (ix = fpad; ix > 0; ix--) {
3227 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3228 if (namesv && namesv != &sv_undef) {
3229 char *name = SvPVX(namesv); /* XXX */
3230 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3231 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3232 CvOUTSIDE(cv), cxstack_ix);
3234 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3236 croak("panic: cv_clone: %s", name);
3238 else { /* our own lexical */
3241 /* anon code -- we'll come back for it */
3242 sv = SvREFCNT_inc(ppad[ix]);
3244 else if (*name == '@')
3246 else if (*name == '%')
3256 SV* sv = NEWSV(0,0);
3262 /* Now that vars are all in place, clone nested closures. */
3264 for (ix = fpad; ix > 0; ix--) {
3265 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3267 && namesv != &sv_undef
3268 && !(SvFLAGS(namesv) & SVf_FAKE)
3269 && *SvPVX(namesv) == '&'
3270 && CvCLONE(ppad[ix]))
3272 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3273 SvREFCNT_dec(ppad[ix]);
3276 curpad[ix] = (SV*)kid;
3280 #ifdef DEBUG_CLOSURES
3281 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3283 PerlIO_printf(Perl_debug_log, " from:\n");
3285 PerlIO_printf(Perl_debug_log, " to:\n");
3296 return cv_clone2(proto, CvOUTSIDE(proto));
3300 cv_ckproto(CV *cv, GV *gv, char *p)
3302 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3303 SV* msg = sv_newmortal();
3307 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3308 sv_setpv(msg, "Prototype mismatch:");
3310 sv_catpvf(msg, " sub %_", name);
3312 sv_catpvf(msg, " (%s)", SvPVX(cv));
3313 sv_catpv(msg, " vs ");
3315 sv_catpvf(msg, "(%s)", p);
3317 sv_catpv(msg, "none");
3325 if (!cv || !SvPOK(cv) || SvCUR(cv))
3327 return op_const_sv(CvSTART(cv), cv);
3331 op_const_sv(OP *o, CV *cv)
3338 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3339 o = cLISTOPo->op_first->op_sibling;
3341 for (; o; o = o->op_next) {
3342 OPCODE type = o->op_type;
3344 if(sv && o->op_next == o)
3346 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3348 if (type == OP_LEAVESUB || type == OP_RETURN)
3352 if (type == OP_CONST)
3354 else if (type == OP_PADSV && cv) {
3355 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3356 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3357 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3369 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3372 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3373 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3374 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3375 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3384 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3385 maximum a prototype before. */
3386 if (SvTYPE(gv) > SVt_NULL) {
3387 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3388 warn("Runaway prototype");
3389 cv_ckproto((CV*)gv, NULL, ps);
3392 sv_setpv((SV*)gv, ps);
3394 sv_setiv((SV*)gv, -1);
3395 SvREFCNT_dec(compcv);
3401 if (!name || GvCVGEN(gv))
3403 else if (cv = GvCV(gv)) {
3404 cv_ckproto(cv, gv, ps);
3405 /* already defined (or promised)? */
3406 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3408 bool const_changed = TRUE;
3410 /* just a "sub foo;" when &foo is already defined */
3414 /* ahem, death to those who redefine active sort subs */
3415 if (curstackinfo->si_type == SI_SORT && sortcop == CvSTART(cv))
3416 croak("Can't redefine active sort subroutine %s", name);
3417 if(const_sv = cv_const_sv(cv))
3418 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3419 if ((const_sv && const_changed) || dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3420 && HvNAME(GvSTASH(CvGV(cv)))
3421 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3423 line_t oldline = curcop->cop_line;
3424 curcop->cop_line = copline;
3425 warn(const_sv ? "Constant subroutine %s redefined"
3426 : "Subroutine %s redefined", name);
3427 curcop->cop_line = oldline;
3433 if (cv) { /* must reuse cv if autoloaded */
3435 CvFLAGS(cv) = CvFLAGS(compcv);
3436 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3437 CvOUTSIDE(compcv) = 0;
3438 CvPADLIST(cv) = CvPADLIST(compcv);
3439 CvPADLIST(compcv) = 0;
3440 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3441 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3442 SvREFCNT_dec(compcv);
3452 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3453 CvFILEGV(cv) = curcop->cop_filegv;
3454 CvSTASH(cv) = curstash;
3457 New(666, CvMUTEXP(cv), 1, perl_mutex);
3458 MUTEX_INIT(CvMUTEXP(cv));
3459 #endif /* USE_THREADS */
3462 sv_setpv((SV*)cv, ps);
3468 char *s = strrchr(name, ':');
3470 if (strEQ(s, "BEGIN")) {
3472 "BEGIN not safe after errors--compilation aborted";
3476 /* force display of errors found but not reported */
3477 sv_catpv(ERRSV, not_safe);
3478 croak("%s", SvPVx(ERRSV, na));
3490 if (AvFILLp(comppad_name) < AvFILLp(comppad))
3491 av_store(comppad_name, AvFILLp(comppad), Nullsv);
3494 SV **namep = AvARRAY(comppad_name);
3495 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3498 if (SvIMMORTAL(curpad[ix]))
3501 * The only things that a clonable function needs in its
3502 * pad are references to outer lexicals and anonymous subs.
3503 * The rest are created anew during cloning.
3505 if (!((namesv = namep[ix]) != Nullsv &&
3506 namesv != &sv_undef &&
3508 *SvPVX(namesv) == '&')))
3510 SvREFCNT_dec(curpad[ix]);
3511 curpad[ix] = Nullsv;
3516 AV *av = newAV(); /* Will be @_ */
3518 av_store(comppad, 0, (SV*)av);
3519 AvFLAGS(av) = AVf_REIFY;
3521 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3522 if (SvIMMORTAL(curpad[ix]))
3524 if (!SvPADMY(curpad[ix]))
3525 SvPADTMP_on(curpad[ix]);
3529 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3530 CvSTART(cv) = LINKLIST(CvROOT(cv));
3531 CvROOT(cv)->op_next = 0;
3537 if (PERLDB_SUBLINE && curstash != debstash) {
3538 SV *sv = NEWSV(0,0);
3539 SV *tmpstr = sv_newmortal();
3540 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3544 sv_setpvf(sv, "%_:%ld-%ld",
3545 GvSV(curcop->cop_filegv),
3546 (long)subline, (long)curcop->cop_line);
3547 gv_efullname3(tmpstr, gv, Nullch);
3548 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3549 hv = GvHVn(db_postponed);
3550 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3551 && (cv = GvCV(db_postponed))) {
3556 perl_call_sv((SV*)cv, G_DISCARD);
3560 if ((s = strrchr(name,':')))
3564 if (strEQ(s, "BEGIN")) {
3565 I32 oldscope = scopestack_ix;
3567 SAVESPTR(compiling.cop_filegv);
3568 SAVEI16(compiling.cop_line);
3574 DEBUG_x( dump_sub(gv) );
3575 av_push(beginav, (SV *)cv);
3577 call_list(oldscope, beginav);
3579 curcop = &compiling;
3582 else if (strEQ(s, "END") && !error_count) {
3585 av_unshift(endav, 1);
3586 av_store(endav, 0, (SV *)cv);
3589 else if (strEQ(s, "INIT") && !error_count) {
3592 av_push(initav, SvREFCNT_inc(cv));
3603 newCONSTSUB(HV *stash, char *name, SV *sv)
3606 U32 oldhints = hints;
3607 HV *old_cop_stash = curcop->cop_stash;
3608 HV *old_curstash = curstash;
3609 line_t oldline = curcop->cop_line;
3610 curcop->cop_line = copline;
3612 hints &= ~HINT_BLOCK_SCOPE;
3614 curstash = curcop->cop_stash = stash;
3617 start_subparse(FALSE, 0),
3618 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3619 newSVOP(OP_CONST, 0, &sv_no), /* SvPV(&sv_no) == "" -- GMB */
3620 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3624 curcop->cop_stash = old_cop_stash;
3625 curstash = old_curstash;
3626 curcop->cop_line = oldline;
3630 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3633 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3636 if (cv = (name ? GvCV(gv) : Nullcv)) {
3638 /* just a cached method */
3642 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3643 /* already defined (or promised) */
3644 if (dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3645 && HvNAME(GvSTASH(CvGV(cv)))
3646 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3647 line_t oldline = curcop->cop_line;
3648 curcop->cop_line = copline;
3649 warn("Subroutine %s redefined",name);
3650 curcop->cop_line = oldline;
3657 if (cv) /* must reuse cv if autoloaded */
3660 cv = (CV*)NEWSV(1105,0);
3661 sv_upgrade((SV *)cv, SVt_PVCV);
3668 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3670 New(666, CvMUTEXP(cv), 1, perl_mutex);
3671 MUTEX_INIT(CvMUTEXP(cv));
3673 #endif /* USE_THREADS */
3674 CvFILEGV(cv) = gv_fetchfile(filename);
3675 CvXSUB(cv) = subaddr;
3678 char *s = strrchr(name,':');
3683 if (strEQ(s, "BEGIN")) {
3686 av_push(beginav, (SV *)cv);
3689 else if (strEQ(s, "END")) {
3692 av_unshift(endav, 1);
3693 av_store(endav, 0, (SV *)cv);
3696 else if (strEQ(s, "INIT")) {
3699 av_push(initav, (SV *)cv);
3709 newFORM(I32 floor, OP *o, OP *block)
3718 name = SvPVx(cSVOPo->op_sv, na);
3721 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3723 if (cv = GvFORM(gv)) {
3725 line_t oldline = curcop->cop_line;
3727 curcop->cop_line = copline;
3728 warn("Format %s redefined",name);
3729 curcop->cop_line = oldline;
3735 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3736 CvFILEGV(cv) = curcop->cop_filegv;
3738 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3739 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3740 SvPADTMP_on(curpad[ix]);
3743 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3744 CvSTART(cv) = LINKLIST(CvROOT(cv));
3745 CvROOT(cv)->op_next = 0;
3755 return newUNOP(OP_REFGEN, 0,
3756 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3762 return newUNOP(OP_REFGEN, 0,
3763 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3767 newANONSUB(I32 floor, OP *proto, OP *block)
3769 return newUNOP(OP_REFGEN, 0,
3770 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3776 switch (o->op_type) {
3778 o->op_type = OP_PADAV;
3779 o->op_ppaddr = ppaddr[OP_PADAV];
3780 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3783 o->op_type = OP_RV2AV;
3784 o->op_ppaddr = ppaddr[OP_RV2AV];
3789 warn("oops: oopsAV");
3798 switch (o->op_type) {
3801 o->op_type = OP_PADHV;
3802 o->op_ppaddr = ppaddr[OP_PADHV];
3803 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3807 o->op_type = OP_RV2HV;
3808 o->op_ppaddr = ppaddr[OP_RV2HV];
3813 warn("oops: oopsHV");
3822 if (o->op_type == OP_PADANY) {
3823 o->op_type = OP_PADAV;
3824 o->op_ppaddr = ppaddr[OP_PADAV];
3827 return newUNOP(OP_RV2AV, 0, scalar(o));
3831 newGVREF(I32 type, OP *o)
3833 if (type == OP_MAPSTART)
3834 return newUNOP(OP_NULL, 0, o);
3835 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3841 if (o->op_type == OP_PADANY) {
3842 o->op_type = OP_PADHV;
3843 o->op_ppaddr = ppaddr[OP_PADHV];
3846 return newUNOP(OP_RV2HV, 0, scalar(o));
3852 croak("NOT IMPL LINE %d",__LINE__);
3858 newCVREF(I32 flags, OP *o)
3860 return newUNOP(OP_RV2CV, flags, scalar(o));
3866 if (o->op_type == OP_PADANY) {
3867 o->op_type = OP_PADSV;
3868 o->op_ppaddr = ppaddr[OP_PADSV];
3871 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3872 o->op_flags |= OPpDONE_SVREF;
3875 return newUNOP(OP_RV2SV, 0, scalar(o));
3878 /* Check routines. */
3886 name = NEWSV(1106,0);
3887 sv_upgrade(name, SVt_PVNV);
3888 sv_setpvn(name, "&", 1);
3891 ix = pad_alloc(o->op_type, SVs_PADMY);
3892 av_store(comppad_name, ix, name);
3893 av_store(comppad, ix, cSVOPo->op_sv);
3894 SvPADMY_on(cSVOPo->op_sv);
3895 cSVOPo->op_sv = Nullsv;
3896 cSVOPo->op_targ = ix;
3903 o->op_private = hints;
3910 if (cUNOPo->op_first->op_type == OP_CONCAT)
3911 o->op_flags |= OPf_STACKED;
3918 if (o->op_flags & OPf_KIDS) {
3921 OPCODE type = o->op_type;
3922 o = modkids(ck_fun(o), type);
3923 kid = cUNOPo->op_first;
3924 newop = kUNOP->op_first->op_sibling;
3926 (newop->op_sibling ||
3927 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3928 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3929 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3933 op_free(kUNOP->op_first);
3934 kUNOP->op_first = newop;
3936 o->op_ppaddr = ppaddr[++o->op_type];
3945 if (o->op_flags & OPf_KIDS) {
3946 OP *kid = cUNOPo->op_first;
3947 if (kid->op_type == OP_HSLICE)
3948 o->op_private |= OPpSLICE;
3949 else if (kid->op_type != OP_HELEM)
3950 croak("%s argument is not a HASH element or slice",
3951 op_desc[o->op_type]);
3960 I32 type = o->op_type;
3962 if (o->op_flags & OPf_KIDS) {
3963 if (cLISTOPo->op_first->op_type == OP_STUB) {
3965 o = newUNOP(type, OPf_SPECIAL,
3966 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3976 hints |= HINT_BLOCK_SCOPE;
3977 if (o->op_flags & OPf_KIDS) {
3978 SVOP *kid = (SVOP*)cUNOPo->op_first;
3981 o->op_flags &= ~OPf_KIDS;
3984 else if (kid->op_type == OP_LINESEQ) {
3987 kid->op_next = o->op_next;
3988 cUNOPo->op_first = 0;
3991 Newz(1101, enter, 1, LOGOP);
3992 enter->op_type = OP_ENTERTRY;
3993 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3994 enter->op_private = 0;
3996 /* establish postfix order */
3997 enter->op_next = (OP*)enter;
3999 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4000 o->op_type = OP_LEAVETRY;
4001 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4002 enter->op_other = o;
4010 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4012 o->op_targ = (PADOFFSET)hints;
4020 if (o->op_flags & OPf_STACKED) {
4022 kid = cUNOPo->op_first->op_sibling;
4023 if (kid->op_type == OP_RV2GV)
4035 if (o->op_flags & OPf_KIDS) {
4036 OP *kid = cUNOPo->op_first;
4037 if (kid->op_type != OP_HELEM)
4038 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4045 ck_gvconst(register OP *o)
4047 o = fold_constants(o);
4048 if (o->op_type == OP_CONST)
4054 ck_rvconst(register OP *o)
4057 SVOP *kid = (SVOP*)cUNOPo->op_first;
4059 o->op_private |= (hints & HINT_STRICT_REFS);
4060 if (kid->op_type == OP_CONST) {
4065 name = SvPV(kid->op_sv, na);
4066 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4067 char *badthing = Nullch;
4068 switch (o->op_type) {
4070 badthing = "a SCALAR";
4073 badthing = "an ARRAY";
4076 badthing = "a HASH";
4081 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4085 * This is a little tricky. We only want to add the symbol if we
4086 * didn't add it in the lexer. Otherwise we get duplicate strict
4087 * warnings. But if we didn't add it in the lexer, we must at
4088 * least pretend like we wanted to add it even if it existed before,
4089 * or we get possible typo warnings. OPpCONST_ENTERED says
4090 * whether the lexer already added THIS instance of this symbol.
4092 iscv = (o->op_type == OP_RV2CV) * 2;
4094 gv = gv_fetchpv(name,
4095 iscv | !(kid->op_private & OPpCONST_ENTERED),
4098 : o->op_type == OP_RV2SV
4100 : o->op_type == OP_RV2AV
4102 : o->op_type == OP_RV2HV
4105 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4107 kid->op_type = OP_GV;
4108 SvREFCNT_dec(kid->op_sv);
4109 kid->op_sv = SvREFCNT_inc(gv);
4119 I32 type = o->op_type;
4121 if (o->op_flags & OPf_REF)
4124 if (o->op_flags & OPf_KIDS) {
4125 SVOP *kid = (SVOP*)cUNOPo->op_first;
4127 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4128 OP *newop = newGVOP(type, OPf_REF,
4129 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4136 if (type == OP_FTTTY)
4137 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4140 return newUNOP(type, 0, newDEFSVOP());
4153 int type = o->op_type;
4154 register I32 oa = opargs[type] >> OASHIFT;
4156 if (o->op_flags & OPf_STACKED) {
4157 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4160 return no_fh_allowed(o);
4163 if (o->op_flags & OPf_KIDS) {
4164 tokid = &cLISTOPo->op_first;
4165 kid = cLISTOPo->op_first;
4166 if (kid->op_type == OP_PUSHMARK ||
4167 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4169 tokid = &kid->op_sibling;
4170 kid = kid->op_sibling;
4172 if (!kid && opargs[type] & OA_DEFGV)
4173 *tokid = kid = newDEFSVOP();
4177 sibl = kid->op_sibling;
4191 if (kid->op_type == OP_CONST &&
4192 (kid->op_private & OPpCONST_BARE)) {
4193 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4194 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4195 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4197 warn("Array @%s missing the @ in argument %ld of %s()",
4198 name, (long)numargs, op_desc[type]);
4201 kid->op_sibling = sibl;
4204 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4205 bad_type(numargs, "array", op_desc[o->op_type], kid);
4209 if (kid->op_type == OP_CONST &&
4210 (kid->op_private & OPpCONST_BARE)) {
4211 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4212 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4213 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4215 warn("Hash %%%s missing the %% in argument %ld of %s()",
4216 name, (long)numargs, op_desc[type]);
4219 kid->op_sibling = sibl;
4222 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4223 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4228 OP *newop = newUNOP(OP_NULL, 0, kid);
4229 kid->op_sibling = 0;
4231 newop->op_next = newop;
4233 kid->op_sibling = sibl;
4238 if (kid->op_type != OP_GV) {
4239 if (kid->op_type == OP_CONST &&
4240 (kid->op_private & OPpCONST_BARE)) {
4241 OP *newop = newGVOP(OP_GV, 0,
4242 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4248 kid->op_sibling = 0;
4249 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4251 kid->op_sibling = sibl;
4257 mod(scalar(kid), type);
4261 tokid = &kid->op_sibling;
4262 kid = kid->op_sibling;
4264 o->op_private |= numargs;
4266 return too_many_arguments(o,op_desc[o->op_type]);
4269 else if (opargs[type] & OA_DEFGV) {
4271 return newUNOP(type, 0, newDEFSVOP());
4275 while (oa & OA_OPTIONAL)
4277 if (oa && oa != OA_LIST)
4278 return too_few_arguments(o,op_desc[o->op_type]);
4288 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4289 append_elem(OP_GLOB, o, newDEFSVOP());
4291 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4292 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4294 if (gv && GvIMPORTED_CV(gv)) {
4295 static int glob_index;
4297 append_elem(OP_GLOB, o,
4298 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4299 o->op_type = OP_LIST;
4300 o->op_ppaddr = ppaddr[OP_LIST];
4301 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4302 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4303 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4304 append_elem(OP_LIST, o,
4305 scalar(newUNOP(OP_RV2CV, 0,
4306 newGVOP(OP_GV, 0, gv)))));
4307 o = newUNOP(OP_NULL, 0, ck_subr(o));
4308 o->op_targ = OP_GLOB; /* hint at what it used to be */
4311 gv = newGVgen("main");
4313 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4323 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4325 o->op_ppaddr = ppaddr[OP_GREPSTART];
4326 Newz(1101, gwop, 1, LOGOP);
4328 if (o->op_flags & OPf_STACKED) {
4331 kid = cLISTOPo->op_first->op_sibling;
4332 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4335 kid->op_next = (OP*)gwop;
4336 o->op_flags &= ~OPf_STACKED;
4338 kid = cLISTOPo->op_first->op_sibling;
4339 if (type == OP_MAPWHILE)
4346 kid = cLISTOPo->op_first->op_sibling;
4347 if (kid->op_type != OP_NULL)
4348 croak("panic: ck_grep");
4349 kid = kUNOP->op_first;
4351 gwop->op_type = type;
4352 gwop->op_ppaddr = ppaddr[type];
4353 gwop->op_first = listkids(o);
4354 gwop->op_flags |= OPf_KIDS;
4355 gwop->op_private = 1;
4356 gwop->op_other = LINKLIST(kid);
4357 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4358 kid->op_next = (OP*)gwop;
4360 kid = cLISTOPo->op_first->op_sibling;
4361 if (!kid || !kid->op_sibling)
4362 return too_few_arguments(o,op_desc[o->op_type]);
4363 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4364 mod(kid, OP_GREPSTART);
4372 if (o->op_flags & OPf_KIDS) {
4373 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4374 if (kid && kid->op_type == OP_CONST)
4375 fbm_compile(((SVOP*)kid)->op_sv, 0);
4381 ck_lengthconst(OP *o)
4383 /* XXX length optimization goes here */
4390 OPCODE type = o->op_type;
4391 return modkids(ck_fun(o), type);
4397 OPCODE type = o->op_type;
4398 return refkids(ck_fun(o), type);
4406 kid = cLISTOPo->op_first;
4409 kid = cLISTOPo->op_first;
4411 if (kid->op_type == OP_PUSHMARK)
4412 kid = kid->op_sibling;
4413 if (kid && o->op_flags & OPf_STACKED)
4414 kid = kid->op_sibling;
4415 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4416 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4417 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4418 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4419 cLISTOPo->op_first->op_sibling = kid;
4420 cLISTOPo->op_last = kid;
4421 kid = kid->op_sibling;
4426 append_elem(o->op_type, o, newDEFSVOP());
4432 if (hints & HINT_LOCALE)
4433 o->op_private |= OPpLOCALE;
4440 ck_fun_locale(OP *o)
4446 if (hints & HINT_LOCALE)
4447 o->op_private |= OPpLOCALE;
4458 if (hints & HINT_LOCALE)
4459 o->op_private |= OPpLOCALE;
4468 o->op_private |= OPpRUNTIME;
4481 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4482 o->op_private |= OPpREPEAT_DOLIST;
4483 cBINOPo->op_first = force_list(cBINOPo->op_first);
4493 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4494 SVOP *kid = (SVOP*)cUNOPo->op_first;
4496 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4498 for (s = SvPVX(kid->op_sv); *s; s++) {
4499 if (*s == ':' && s[1] == ':') {
4501 Move(s+2, s+1, strlen(s+2)+1, char);
4502 --SvCUR(kid->op_sv);
4505 sv_catpvn(kid->op_sv, ".pm", 3);
4514 croak("NOT IMPL LINE %d",__LINE__);
4523 if (o->op_flags & OPf_KIDS) {
4524 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4525 if (kid && kid->op_sibling) {
4526 o->op_type = OP_SSELECT;
4527 o->op_ppaddr = ppaddr[OP_SSELECT];
4529 return fold_constants(o);
4533 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4534 if (kid && kid->op_type == OP_RV2GV)
4535 kid->op_private &= ~HINT_STRICT_REFS;
4542 I32 type = o->op_type;
4544 if (!(o->op_flags & OPf_KIDS)) {
4549 if (!CvUNIQUE(compcv)) {
4550 argop = newOP(OP_PADAV, OPf_REF);
4551 argop->op_targ = 0; /* curpad[0] is @_ */
4554 argop = newUNOP(OP_RV2AV, 0,
4555 scalar(newGVOP(OP_GV, 0,
4556 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4559 argop = newUNOP(OP_RV2AV, 0,
4560 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(compcv) ?
4561 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4562 #endif /* USE_THREADS */
4563 return newUNOP(type, 0, scalar(argop));
4565 return scalar(modkids(ck_fun(o), type));
4573 if (hints & HINT_LOCALE)
4574 o->op_private |= OPpLOCALE;
4577 if (o->op_flags & OPf_STACKED) {
4578 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4580 kid = kUNOP->op_first; /* get past rv2gv */
4582 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4584 if (kid->op_type == OP_SCOPE) {
4588 else if (kid->op_type == OP_LEAVE) {
4589 if (o->op_type == OP_SORT) {
4590 null(kid); /* wipe out leave */
4593 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4594 if (k->op_next == kid)
4599 kid->op_next = 0; /* just disconnect the leave */
4600 k = kLISTOP->op_first;
4604 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4605 null(kid); /* wipe out rv2gv */
4606 if (o->op_type == OP_SORT)
4610 o->op_flags |= OPf_SPECIAL;
4622 if (o->op_flags & OPf_STACKED)
4623 return no_fh_allowed(o);
4625 kid = cLISTOPo->op_first;
4626 if (kid->op_type != OP_NULL)
4627 croak("panic: ck_split");
4628 kid = kid->op_sibling;
4629 op_free(cLISTOPo->op_first);
4630 cLISTOPo->op_first = kid;
4632 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4633 cLISTOPo->op_last = kid; /* There was only one element previously */
4636 if (kid->op_type != OP_MATCH) {
4637 OP *sibl = kid->op_sibling;
4638 kid->op_sibling = 0;
4639 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4640 if (cLISTOPo->op_first == cLISTOPo->op_last)
4641 cLISTOPo->op_last = kid;
4642 cLISTOPo->op_first = kid;
4643 kid->op_sibling = sibl;
4646 kid->op_type = OP_PUSHRE;
4647 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4650 if (!kid->op_sibling)
4651 append_elem(OP_SPLIT, o, newDEFSVOP());
4653 kid = kid->op_sibling;
4656 if (!kid->op_sibling)
4657 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4659 kid = kid->op_sibling;
4662 if (kid->op_sibling)
4663 return too_many_arguments(o,op_desc[o->op_type]);
4672 OP *prev = ((cUNOPo->op_first->op_sibling)
4673 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4674 OP *o2 = prev->op_sibling;
4682 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4683 if (cvop->op_type == OP_RV2CV) {
4685 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4686 null(cvop); /* disable rv2cv */
4687 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4688 if (tmpop->op_type == OP_GV) {
4689 cv = GvCVu(tmpop->op_sv);
4690 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4691 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4692 proto = SvPV((SV*)cv, na);
4696 o->op_private |= (hints & HINT_STRICT_REFS);
4697 if (PERLDB_SUB && curstash != debstash)
4698 o->op_private |= OPpENTERSUB_DB;
4699 while (o2 != cvop) {
4703 return too_many_arguments(o, gv_ename(namegv));
4721 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4722 bad_type(arg, "block", gv_ename(namegv), o2);
4727 if (o2->op_type == OP_RV2GV)
4731 OP* sib = kid->op_sibling;
4732 kid->op_sibling = 0;
4733 o2 = newUNOP(OP_RV2GV, 0, kid);
4734 o2->op_sibling = sib;
4735 prev->op_sibling = o2;
4743 if (o2->op_type != OP_RV2GV)
4744 bad_type(arg, "symbol", gv_ename(namegv), o2);
4747 if (o2->op_type != OP_RV2CV)
4748 bad_type(arg, "sub", gv_ename(namegv), o2);
4751 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4752 bad_type(arg, "scalar", gv_ename(namegv), o2);
4755 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4756 bad_type(arg, "array", gv_ename(namegv), o2);
4759 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4760 bad_type(arg, "hash", gv_ename(namegv), o2);
4764 OP* sib = kid->op_sibling;
4765 kid->op_sibling = 0;
4766 o2 = newUNOP(OP_REFGEN, 0, kid);
4767 o2->op_sibling = sib;
4768 prev->op_sibling = o2;
4779 croak("Malformed prototype for %s: %s",
4780 gv_ename(namegv), SvPV((SV*)cv, na));
4785 mod(o2, OP_ENTERSUB);
4787 o2 = o2->op_sibling;
4789 if (proto && !optional &&
4790 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4791 return too_few_arguments(o, gv_ename(namegv));
4798 SvREADONLY_on(cSVOPo->op_sv);
4805 if (o->op_flags & OPf_KIDS) {
4806 SVOP *kid = (SVOP*)cUNOPo->op_first;
4808 if (kid->op_type == OP_NULL)
4809 kid = (SVOP*)kid->op_sibling;
4811 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4812 o->op_flags |= OPf_SPECIAL;
4817 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4820 peep(register OP *o)
4823 register OP* oldop = 0;
4824 if (!o || o->op_seq)
4829 for (; o; o = o->op_next) {
4835 switch (o->op_type) {
4838 curcop = ((COP*)o); /* for warnings */
4839 o->op_seq = op_seqmax++;
4850 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
4852 o->op_seq = op_seqmax++;
4855 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4856 o->op_seq = op_seqmax++;
4857 break; /* Scalar stub must produce undef. List stub is noop */
4861 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4868 if (oldop && o->op_next) {
4869 oldop->op_next = o->op_next;
4872 o->op_seq = op_seqmax++;
4876 if (o->op_next->op_type == OP_RV2SV) {
4877 if (!(o->op_next->op_private & OPpDEREF)) {
4879 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4880 o->op_next = o->op_next->op_next;
4881 o->op_type = OP_GVSV;
4882 o->op_ppaddr = ppaddr[OP_GVSV];
4885 else if (o->op_next->op_type == OP_RV2AV) {
4886 OP* pop = o->op_next->op_next;
4888 if (pop->op_type == OP_CONST &&
4889 (op = pop->op_next) &&
4890 pop->op_next->op_type == OP_AELEM &&
4891 !(pop->op_next->op_private &
4892 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4893 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4897 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4901 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4902 o->op_next = pop->op_next->op_next;
4903 o->op_type = OP_AELEMFAST;
4904 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4905 o->op_private = (U8)i;
4906 GvAVn(((GVOP*)o)->op_gv);
4909 o->op_seq = op_seqmax++;
4913 if (o->op_next->op_type == OP_RV2AV
4914 && (o->op_next->op_flags && OPf_REF))
4917 o->op_next = o->op_next->op_next;
4922 if (o->op_next->op_type == OP_RV2HV
4923 && (o->op_next->op_flags && OPf_REF))
4926 o->op_next = o->op_next->op_next;
4934 o->op_seq = op_seqmax++;
4935 while (cLOGOP->op_other->op_type == OP_NULL)
4936 cLOGOP->op_other = cLOGOP->op_other->op_next;
4937 peep(cLOGOP->op_other);
4941 o->op_seq = op_seqmax++;
4942 peep(cCONDOP->op_true);
4943 peep(cCONDOP->op_false);
4947 o->op_seq = op_seqmax++;
4948 peep(cLOOP->op_redoop);
4949 peep(cLOOP->op_nextop);
4950 peep(cLOOP->op_lastop);
4955 o->op_seq = op_seqmax++;
4956 peep(cPMOP->op_pmreplstart);
4960 o->op_seq = op_seqmax++;
4961 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4962 if (o->op_next->op_sibling &&
4963 o->op_next->op_sibling->op_type != OP_EXIT &&
4964 o->op_next->op_sibling->op_type != OP_WARN &&
4965 o->op_next->op_sibling->op_type != OP_DIE) {
4966 line_t oldline = curcop->cop_line;
4968 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4969 warn("Statement unlikely to be reached");
4970 warn("(Maybe you meant system() when you said exec()?)\n");
4971 curcop->cop_line = oldline;
4985 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4986 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4988 rop = (UNOP*)((BINOP*)o)->op_first;
4989 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4991 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4992 if (!SvOBJECT(lexname))
4994 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4995 if (!fields || !GvHV(*fields))
4997 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4998 key = SvPV(*svp, keylen);
4999 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5001 croak("No such field \"%s\" in variable %s of type %s",
5002 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
5004 ind = SvIV(*indsvp);
5006 croak("Bad index while coercing array into hash");
5007 rop->op_type = OP_RV2AV;
5008 rop->op_ppaddr = ppaddr[OP_RV2AV];
5009 o->op_type = OP_AELEM;
5010 o->op_ppaddr = ppaddr[OP_AELEM];
5012 *svp = newSViv(ind);
5017 o->op_seq = op_seqmax++;