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)
2102 I32 repl_has_vars = 0;
2104 if (o->op_type == OP_TRANS)
2105 return pmtrans(o, expr, repl);
2107 hints |= HINT_BLOCK_SCOPE;
2110 if (expr->op_type == OP_CONST) {
2112 SV *pat = ((SVOP*)expr)->op_sv;
2113 char *p = SvPV(pat, plen);
2114 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2115 sv_setpvn(pat, "\\s+", 3);
2116 p = SvPV(pat, plen);
2117 pm->op_pmflags |= PMf_SKIPWHITE;
2119 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2120 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2121 pm->op_pmflags |= PMf_WHITE;
2125 if (pm->op_pmflags & PMf_KEEP)
2126 expr = newUNOP(OP_REGCMAYBE,0,expr);
2128 Newz(1101, rcop, 1, LOGOP);
2129 rcop->op_type = OP_REGCOMP;
2130 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2131 rcop->op_first = scalar(expr);
2132 rcop->op_flags |= OPf_KIDS;
2133 rcop->op_private = 1;
2136 /* establish postfix order */
2137 if (pm->op_pmflags & PMf_KEEP) {
2139 rcop->op_next = expr;
2140 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2143 rcop->op_next = LINKLIST(expr);
2144 expr->op_next = (OP*)rcop;
2147 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2152 if (pm->op_pmflags & PMf_EVAL)
2155 else if (repl->op_type == OP_THREADSV
2156 && strchr("&`'123456789+",
2157 threadsv_names[repl->op_targ]))
2161 #endif /* USE_THREADS */
2162 else if (repl->op_type == OP_CONST)
2166 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2167 if (opargs[curop->op_type] & OA_DANGEROUS) {
2169 if (curop->op_type == OP_THREADSV) {
2171 if (strchr("&`'123456789+", curop->op_private))
2175 if (curop->op_type == OP_GV) {
2176 GV *gv = ((GVOP*)curop)->op_gv;
2178 if (strchr("&`'123456789+", *GvENAME(gv)))
2181 #endif /* USE_THREADS */
2182 else if (curop->op_type == OP_RV2CV)
2184 else if (curop->op_type == OP_RV2SV ||
2185 curop->op_type == OP_RV2AV ||
2186 curop->op_type == OP_RV2HV ||
2187 curop->op_type == OP_RV2GV) {
2188 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2191 else if (curop->op_type == OP_PADSV ||
2192 curop->op_type == OP_PADAV ||
2193 curop->op_type == OP_PADHV ||
2194 curop->op_type == OP_PADANY) {
2205 && (!pm->op_pmregexp
2206 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2207 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2208 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2209 prepend_elem(o->op_type, scalar(repl), o);
2212 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2213 pm->op_pmflags |= PMf_MAYBE_CONST;
2214 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2216 Newz(1101, rcop, 1, LOGOP);
2217 rcop->op_type = OP_SUBSTCONT;
2218 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2219 rcop->op_first = scalar(repl);
2220 rcop->op_flags |= OPf_KIDS;
2221 rcop->op_private = 1;
2224 /* establish postfix order */
2225 rcop->op_next = LINKLIST(repl);
2226 repl->op_next = (OP*)rcop;
2228 pm->op_pmreplroot = scalar((OP*)rcop);
2229 pm->op_pmreplstart = LINKLIST(rcop);
2238 newSVOP(I32 type, I32 flags, SV *sv)
2241 Newz(1101, svop, 1, SVOP);
2242 svop->op_type = type;
2243 svop->op_ppaddr = ppaddr[type];
2245 svop->op_next = (OP*)svop;
2246 svop->op_flags = flags;
2247 if (opargs[type] & OA_RETSCALAR)
2249 if (opargs[type] & OA_TARGET)
2250 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2251 return CHECKOP(type, svop);
2255 newGVOP(I32 type, I32 flags, GV *gv)
2259 Newz(1101, gvop, 1, GVOP);
2260 gvop->op_type = type;
2261 gvop->op_ppaddr = ppaddr[type];
2262 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2263 gvop->op_next = (OP*)gvop;
2264 gvop->op_flags = flags;
2265 if (opargs[type] & OA_RETSCALAR)
2267 if (opargs[type] & OA_TARGET)
2268 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2269 return CHECKOP(type, gvop);
2273 newPVOP(I32 type, I32 flags, char *pv)
2276 Newz(1101, pvop, 1, PVOP);
2277 pvop->op_type = type;
2278 pvop->op_ppaddr = ppaddr[type];
2280 pvop->op_next = (OP*)pvop;
2281 pvop->op_flags = flags;
2282 if (opargs[type] & OA_RETSCALAR)
2284 if (opargs[type] & OA_TARGET)
2285 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2286 return CHECKOP(type, pvop);
2295 save_hptr(&curstash);
2296 save_item(curstname);
2301 name = SvPV(sv, len);
2302 curstash = gv_stashpvn(name,len,TRUE);
2303 sv_setpvn(curstname, name, len);
2307 sv_setpv(curstname,"<none>");
2315 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2323 if (id->op_type != OP_CONST)
2324 croak("Module name must be constant");
2328 if(version != Nullop) {
2329 SV *vesv = ((SVOP*)version)->op_sv;
2331 if (arg == Nullop && !SvNIOK(vesv)) {
2338 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2339 croak("Version number must be constant number");
2341 /* Make copy of id so we don't free it twice */
2342 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2344 /* Fake up a method call to VERSION */
2345 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2346 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2347 append_elem(OP_LIST,
2348 prepend_elem(OP_LIST, pack, list(version)),
2349 newUNOP(OP_METHOD, 0, meth)));
2353 /* Fake up an import/unimport */
2354 if (arg && arg->op_type == OP_STUB)
2355 imop = arg; /* no import on explicit () */
2356 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2357 imop = Nullop; /* use 5.0; */
2360 /* Make copy of id so we don't free it twice */
2361 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2362 meth = newSVOP(OP_CONST, 0,
2364 ? newSVpv("import", 6)
2365 : newSVpv("unimport", 8)
2367 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2368 append_elem(OP_LIST,
2369 prepend_elem(OP_LIST, pack, list(arg)),
2370 newUNOP(OP_METHOD, 0, meth)));
2373 /* Fake up a require */
2374 rqop = newUNOP(OP_REQUIRE, 0, id);
2376 /* Fake up the BEGIN {}, which does its thing immediately. */
2378 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2380 append_elem(OP_LINESEQ,
2381 append_elem(OP_LINESEQ,
2382 newSTATEOP(0, Nullch, rqop),
2383 newSTATEOP(0, Nullch, veop)),
2384 newSTATEOP(0, Nullch, imop) ));
2391 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2393 return newBINOP(OP_LSLICE, flags,
2394 list(force_list(subscript)),
2395 list(force_list(listval)) );
2399 list_assignment(register OP *o)
2404 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2405 o = cUNOPo->op_first;
2407 if (o->op_type == OP_COND_EXPR) {
2408 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2409 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2414 yyerror("Assignment to both a list and a scalar");
2418 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2419 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2420 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2423 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2426 if (o->op_type == OP_RV2SV)
2433 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2438 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2439 return newLOGOP(optype, 0,
2440 mod(scalar(left), optype),
2441 newUNOP(OP_SASSIGN, 0, scalar(right)));
2444 return newBINOP(optype, OPf_STACKED,
2445 mod(scalar(left), optype), scalar(right));
2449 if (list_assignment(left)) {
2452 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2453 left = mod(left, OP_AASSIGN);
2461 o = newBINOP(OP_AASSIGN, flags,
2462 list(force_list(right)),
2463 list(force_list(left)) );
2464 o->op_private = 0 | (flags >> 8);
2465 if (!(left->op_private & OPpLVAL_INTRO)) {
2469 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2470 if (opargs[curop->op_type] & OA_DANGEROUS) {
2471 if (curop->op_type == OP_GV) {
2472 GV *gv = ((GVOP*)curop)->op_gv;
2473 if (gv == defgv || SvCUR(gv) == generation)
2475 SvCUR(gv) = generation;
2477 else if (curop->op_type == OP_PADSV ||
2478 curop->op_type == OP_PADAV ||
2479 curop->op_type == OP_PADHV ||
2480 curop->op_type == OP_PADANY) {
2481 SV **svp = AvARRAY(comppad_name);
2482 SV *sv = svp[curop->op_targ];
2483 if (SvCUR(sv) == generation)
2485 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2487 else if (curop->op_type == OP_RV2CV)
2489 else if (curop->op_type == OP_RV2SV ||
2490 curop->op_type == OP_RV2AV ||
2491 curop->op_type == OP_RV2HV ||
2492 curop->op_type == OP_RV2GV) {
2493 if (lastop->op_type != OP_GV) /* funny deref? */
2502 o->op_private = OPpASSIGN_COMMON;
2504 if (right && right->op_type == OP_SPLIT) {
2506 if ((tmpop = ((LISTOP*)right)->op_first) &&
2507 tmpop->op_type == OP_PUSHRE)
2509 PMOP *pm = (PMOP*)tmpop;
2510 if (left->op_type == OP_RV2AV &&
2511 !(left->op_private & OPpLVAL_INTRO) &&
2512 !(o->op_private & OPpASSIGN_COMMON) )
2514 tmpop = ((UNOP*)left)->op_first;
2515 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2516 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2517 pm->op_pmflags |= PMf_ONCE;
2518 tmpop = cUNOPo->op_first; /* to list (nulled) */
2519 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2520 tmpop->op_sibling = Nullop; /* don't free split */
2521 right->op_next = tmpop->op_next; /* fix starting loc */
2522 op_free(o); /* blow off assign */
2523 right->op_flags &= ~OPf_WANT;
2524 /* "I don't know and I don't care." */
2529 if (modcount < 10000 &&
2530 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2532 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2534 sv_setiv(sv, modcount+1);
2542 right = newOP(OP_UNDEF, 0);
2543 if (right->op_type == OP_READLINE) {
2544 right->op_flags |= OPf_STACKED;
2545 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2548 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2549 o = newBINOP(OP_SASSIGN, flags,
2550 scalar(right), mod(scalar(left), OP_SASSIGN) );
2562 newSTATEOP(I32 flags, char *label, OP *o)
2565 U32 seq = intro_my();
2568 Newz(1101, cop, 1, COP);
2569 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2570 cop->op_type = OP_DBSTATE;
2571 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2574 cop->op_type = OP_NEXTSTATE;
2575 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2577 cop->op_flags = flags;
2578 cop->op_private = 0 | (flags >> 8);
2580 cop->op_private |= NATIVE_HINTS;
2582 cop->op_next = (OP*)cop;
2585 cop->cop_label = label;
2586 hints |= HINT_BLOCK_SCOPE;
2589 cop->cop_arybase = curcop->cop_arybase;
2591 if (copline == NOLINE)
2592 cop->cop_line = curcop->cop_line;
2594 cop->cop_line = copline;
2597 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2598 cop->cop_stash = curstash;
2600 if (PERLDB_LINE && curstash != debstash) {
2601 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2602 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2603 (void)SvIOK_on(*svp);
2605 SvSTASH(*svp) = (HV*)cop;
2609 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2612 /* "Introduce" my variables to visible status. */
2620 if (! min_intro_pending)
2623 svp = AvARRAY(comppad_name);
2624 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2625 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2626 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2627 SvNVX(sv) = (double)cop_seqmax;
2630 min_intro_pending = 0;
2631 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2632 return cop_seqmax++;
2636 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2638 return new_logop(type, flags, &first, &other);
2642 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2647 OP *first = *firstp;
2648 OP *other = *otherp;
2650 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2651 return newBINOP(type, flags, scalar(first), scalar(other));
2653 scalarboolean(first);
2654 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2655 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2656 if (type == OP_AND || type == OP_OR) {
2662 first = *firstp = cUNOPo->op_first;
2664 first->op_next = o->op_next;
2665 cUNOPo->op_first = Nullop;
2669 if (first->op_type == OP_CONST) {
2670 if (dowarn && (first->op_private & OPpCONST_BARE))
2671 warn("Probable precedence problem on %s", op_desc[type]);
2672 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2683 else if (first->op_type == OP_WANTARRAY) {
2689 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2690 OP *k1 = ((UNOP*)first)->op_first;
2691 OP *k2 = k1->op_sibling;
2693 switch (first->op_type)
2696 if (k2 && k2->op_type == OP_READLINE
2697 && (k2->op_flags & OPf_STACKED)
2698 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2699 warnop = k2->op_type;
2703 if (k1->op_type == OP_READDIR
2704 || k1->op_type == OP_GLOB
2705 || k1->op_type == OP_EACH)
2706 warnop = k1->op_type;
2710 line_t oldline = curcop->cop_line;
2711 curcop->cop_line = copline;
2712 warn("Value of %s%s can be \"0\"; test with defined()",
2714 ((warnop == OP_READLINE || warnop == OP_GLOB)
2715 ? " construct" : "() operator"));
2716 curcop->cop_line = oldline;
2723 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2724 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2726 Newz(1101, logop, 1, LOGOP);
2728 logop->op_type = type;
2729 logop->op_ppaddr = ppaddr[type];
2730 logop->op_first = first;
2731 logop->op_flags = flags | OPf_KIDS;
2732 logop->op_other = LINKLIST(other);
2733 logop->op_private = 1 | (flags >> 8);
2735 /* establish postfix order */
2736 logop->op_next = LINKLIST(first);
2737 first->op_next = (OP*)logop;
2738 first->op_sibling = other;
2740 o = newUNOP(OP_NULL, 0, (OP*)logop);
2747 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2754 return newLOGOP(OP_AND, 0, first, trueop);
2756 return newLOGOP(OP_OR, 0, first, falseop);
2758 scalarboolean(first);
2759 if (first->op_type == OP_CONST) {
2760 if (SvTRUE(((SVOP*)first)->op_sv)) {
2771 else if (first->op_type == OP_WANTARRAY) {
2775 Newz(1101, condop, 1, CONDOP);
2777 condop->op_type = OP_COND_EXPR;
2778 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2779 condop->op_first = first;
2780 condop->op_flags = flags | OPf_KIDS;
2781 condop->op_true = LINKLIST(trueop);
2782 condop->op_false = LINKLIST(falseop);
2783 condop->op_private = 1 | (flags >> 8);
2785 /* establish postfix order */
2786 condop->op_next = LINKLIST(first);
2787 first->op_next = (OP*)condop;
2789 first->op_sibling = trueop;
2790 trueop->op_sibling = falseop;
2791 o = newUNOP(OP_NULL, 0, (OP*)condop);
2793 trueop->op_next = o;
2794 falseop->op_next = o;
2800 newRANGE(I32 flags, OP *left, OP *right)
2808 Newz(1101, condop, 1, CONDOP);
2810 condop->op_type = OP_RANGE;
2811 condop->op_ppaddr = ppaddr[OP_RANGE];
2812 condop->op_first = left;
2813 condop->op_flags = OPf_KIDS;
2814 condop->op_true = LINKLIST(left);
2815 condop->op_false = LINKLIST(right);
2816 condop->op_private = 1 | (flags >> 8);
2818 left->op_sibling = right;
2820 condop->op_next = (OP*)condop;
2821 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2822 flop = newUNOP(OP_FLOP, 0, flip);
2823 o = newUNOP(OP_NULL, 0, flop);
2826 left->op_next = flip;
2827 right->op_next = flop;
2829 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2830 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2831 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2832 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2834 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2835 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2838 if (!flip->op_private || !flop->op_private)
2839 linklist(o); /* blow off optimizer unless constant */
2845 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2850 int once = block && block->op_flags & OPf_SPECIAL &&
2851 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2854 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2855 return block; /* do {} while 0 does once */
2856 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2857 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2858 expr = newUNOP(OP_DEFINED, 0,
2859 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2860 } else if (expr->op_flags & OPf_KIDS) {
2861 OP *k1 = ((UNOP*)expr)->op_first;
2862 OP *k2 = (k1) ? k1->op_sibling : NULL;
2863 switch (expr->op_type) {
2865 if (k2 && k2->op_type == OP_READLINE
2866 && (k2->op_flags & OPf_STACKED)
2867 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2868 expr = newUNOP(OP_DEFINED, 0, expr);
2872 if (k1->op_type == OP_READDIR
2873 || k1->op_type == OP_GLOB
2874 || k1->op_type == OP_EACH)
2875 expr = newUNOP(OP_DEFINED, 0, expr);
2881 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2882 o = new_logop(OP_AND, 0, &expr, &listop);
2885 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2887 if (once && o != listop)
2888 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2891 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2893 o->op_flags |= flags;
2895 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2900 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2909 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2910 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2911 expr = newUNOP(OP_DEFINED, 0,
2912 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2913 } else if (expr && (expr->op_flags & OPf_KIDS)) {
2914 OP *k1 = ((UNOP*)expr)->op_first;
2915 OP *k2 = (k1) ? k1->op_sibling : NULL;
2916 switch (expr->op_type) {
2918 if (k2 && k2->op_type == OP_READLINE
2919 && (k2->op_flags & OPf_STACKED)
2920 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2921 expr = newUNOP(OP_DEFINED, 0, expr);
2925 if (k1->op_type == OP_READDIR
2926 || k1->op_type == OP_GLOB
2927 || k1->op_type == OP_EACH)
2928 expr = newUNOP(OP_DEFINED, 0, expr);
2934 block = newOP(OP_NULL, 0);
2937 next = LINKLIST(cont);
2939 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2940 if ((line_t)whileline != NOLINE) {
2941 copline = whileline;
2942 cont = append_elem(OP_LINESEQ, cont,
2943 newSTATEOP(0, Nullch, Nullop));
2947 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2948 redo = LINKLIST(listop);
2951 copline = whileline;
2953 o = new_logop(OP_AND, 0, &expr, &listop);
2954 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2955 op_free(expr); /* oops, it's a while (0) */
2957 return Nullop; /* listop already freed by new_logop */
2960 ((LISTOP*)listop)->op_last->op_next = condop =
2961 (o == listop ? redo : LINKLIST(o));
2969 Newz(1101,loop,1,LOOP);
2970 loop->op_type = OP_ENTERLOOP;
2971 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2972 loop->op_private = 0;
2973 loop->op_next = (OP*)loop;
2976 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2978 loop->op_redoop = redo;
2979 loop->op_lastop = o;
2982 loop->op_nextop = next;
2984 loop->op_nextop = o;
2986 o->op_flags |= flags;
2987 o->op_private |= (flags >> 8);
2992 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3000 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3001 sv->op_type = OP_RV2GV;
3002 sv->op_ppaddr = ppaddr[OP_RV2GV];
3004 else if (sv->op_type == OP_PADSV) { /* private variable */
3005 padoff = sv->op_targ;
3009 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3010 padoff = sv->op_targ;
3011 iterflags |= OPf_SPECIAL;
3016 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3020 padoff = find_threadsv("_");
3021 iterflags |= OPf_SPECIAL;
3023 sv = newGVOP(OP_GV, 0, defgv);
3026 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3027 expr = scalar(ref(expr, OP_ITER));
3028 iterflags |= OPf_STACKED;
3030 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3031 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
3033 assert(!loop->op_next);
3034 Renew(loop, 1, LOOP);
3035 loop->op_targ = padoff;
3036 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3038 return newSTATEOP(0, label, wop);
3042 newLOOPEX(I32 type, OP *label)
3046 if (type != OP_GOTO || label->op_type == OP_CONST) {
3047 /* "last()" means "last" */
3048 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3049 o = newOP(type, OPf_SPECIAL);
3051 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3052 ? SvPVx(((SVOP*)label)->op_sv, na)
3058 if (label->op_type == OP_ENTERSUB)
3059 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3060 o = newUNOP(type, OPf_STACKED, label);
3062 hints |= HINT_BLOCK_SCOPE;
3072 MUTEX_DESTROY(CvMUTEXP(cv));
3073 Safefree(CvMUTEXP(cv));
3076 #endif /* USE_THREADS */
3078 if (!CvXSUB(cv) && CvROOT(cv)) {
3080 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3081 croak("Can't undef active subroutine");
3084 croak("Can't undef active subroutine");
3085 #endif /* USE_THREADS */
3092 op_free(CvROOT(cv));
3093 CvROOT(cv) = Nullop;
3096 SvPOK_off((SV*)cv); /* forget prototype */
3098 SvREFCNT_dec(CvGV(cv));
3100 SvREFCNT_dec(CvOUTSIDE(cv));
3101 CvOUTSIDE(cv) = Nullcv;
3102 if (CvPADLIST(cv)) {
3103 /* may be during global destruction */
3104 if (SvREFCNT(CvPADLIST(cv))) {
3105 I32 i = AvFILLp(CvPADLIST(cv));
3107 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3108 SV* sv = svp ? *svp : Nullsv;
3111 if (sv == (SV*)comppad_name)
3112 comppad_name = Nullav;
3113 else if (sv == (SV*)comppad) {
3115 curpad = Null(SV**);
3119 SvREFCNT_dec((SV*)CvPADLIST(cv));
3121 CvPADLIST(cv) = Nullav;
3125 #ifdef DEBUG_CLOSURES
3130 CV *outside = CvOUTSIDE(cv);
3131 AV* padlist = CvPADLIST(cv);
3138 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3140 (CvANON(cv) ? "ANON"
3141 : (cv == main_cv) ? "MAIN"
3142 : CvUNIQUE(outside) ? "UNIQUE"
3143 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3146 : CvANON(outside) ? "ANON"
3147 : (outside == main_cv) ? "MAIN"
3148 : CvUNIQUE(outside) ? "UNIQUE"
3149 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3154 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3155 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3156 pname = AvARRAY(pad_name);
3157 ppad = AvARRAY(pad);
3159 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3160 if (SvPOK(pname[ix]))
3161 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3163 SvFAKE(pname[ix]) ? "FAKE " : "",
3165 (long)I_32(SvNVX(pname[ix])),
3166 (long)SvIVX(pname[ix]));
3169 #endif /* DEBUG_CLOSURES */
3172 cv_clone2(CV *proto, CV *outside)
3177 AV* protopadlist = CvPADLIST(proto);
3178 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3179 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3180 SV** pname = AvARRAY(protopad_name);
3181 SV** ppad = AvARRAY(protopad);
3182 I32 fname = AvFILLp(protopad_name);
3183 I32 fpad = AvFILLp(protopad);
3187 assert(!CvUNIQUE(proto));
3192 SAVESPTR(comppad_name);
3195 cv = compcv = (CV*)NEWSV(1104,0);
3196 sv_upgrade((SV *)cv, SvTYPE(proto));
3202 New(666, CvMUTEXP(cv), 1, perl_mutex);
3203 MUTEX_INIT(CvMUTEXP(cv));
3205 #endif /* USE_THREADS */
3206 CvFILEGV(cv) = CvFILEGV(proto);
3207 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3208 CvSTASH(cv) = CvSTASH(proto);
3209 CvROOT(cv) = CvROOT(proto);
3210 CvSTART(cv) = CvSTART(proto);
3212 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3215 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3217 comppad_name = newAV();
3218 for (ix = fname; ix >= 0; ix--)
3219 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3223 comppadlist = newAV();
3224 AvREAL_off(comppadlist);
3225 av_store(comppadlist, 0, (SV*)comppad_name);
3226 av_store(comppadlist, 1, (SV*)comppad);
3227 CvPADLIST(cv) = comppadlist;
3228 av_fill(comppad, AvFILLp(protopad));
3229 curpad = AvARRAY(comppad);
3231 av = newAV(); /* will be @_ */
3233 av_store(comppad, 0, (SV*)av);
3234 AvFLAGS(av) = AVf_REIFY;
3236 for (ix = fpad; ix > 0; ix--) {
3237 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3238 if (namesv && namesv != &sv_undef) {
3239 char *name = SvPVX(namesv); /* XXX */
3240 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3241 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3242 CvOUTSIDE(cv), cxstack_ix);
3244 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3246 croak("panic: cv_clone: %s", name);
3248 else { /* our own lexical */
3251 /* anon code -- we'll come back for it */
3252 sv = SvREFCNT_inc(ppad[ix]);
3254 else if (*name == '@')
3256 else if (*name == '%')
3266 SV* sv = NEWSV(0,0);
3272 /* Now that vars are all in place, clone nested closures. */
3274 for (ix = fpad; ix > 0; ix--) {
3275 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3277 && namesv != &sv_undef
3278 && !(SvFLAGS(namesv) & SVf_FAKE)
3279 && *SvPVX(namesv) == '&'
3280 && CvCLONE(ppad[ix]))
3282 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3283 SvREFCNT_dec(ppad[ix]);
3286 curpad[ix] = (SV*)kid;
3290 #ifdef DEBUG_CLOSURES
3291 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3293 PerlIO_printf(Perl_debug_log, " from:\n");
3295 PerlIO_printf(Perl_debug_log, " to:\n");
3306 return cv_clone2(proto, CvOUTSIDE(proto));
3310 cv_ckproto(CV *cv, GV *gv, char *p)
3312 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3313 SV* msg = sv_newmortal();
3317 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3318 sv_setpv(msg, "Prototype mismatch:");
3320 sv_catpvf(msg, " sub %_", name);
3322 sv_catpvf(msg, " (%s)", SvPVX(cv));
3323 sv_catpv(msg, " vs ");
3325 sv_catpvf(msg, "(%s)", p);
3327 sv_catpv(msg, "none");
3335 if (!cv || !SvPOK(cv) || SvCUR(cv))
3337 return op_const_sv(CvSTART(cv), cv);
3341 op_const_sv(OP *o, CV *cv)
3348 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3349 o = cLISTOPo->op_first->op_sibling;
3351 for (; o; o = o->op_next) {
3352 OPCODE type = o->op_type;
3354 if(sv && o->op_next == o)
3356 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3358 if (type == OP_LEAVESUB || type == OP_RETURN)
3362 if (type == OP_CONST)
3364 else if (type == OP_PADSV && cv) {
3365 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3366 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3367 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3379 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3382 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3383 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3384 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3385 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3394 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3395 maximum a prototype before. */
3396 if (SvTYPE(gv) > SVt_NULL) {
3397 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3398 warn("Runaway prototype");
3399 cv_ckproto((CV*)gv, NULL, ps);
3402 sv_setpv((SV*)gv, ps);
3404 sv_setiv((SV*)gv, -1);
3405 SvREFCNT_dec(compcv);
3411 if (!name || GvCVGEN(gv))
3413 else if (cv = GvCV(gv)) {
3414 cv_ckproto(cv, gv, ps);
3415 /* already defined (or promised)? */
3416 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3418 bool const_changed = TRUE;
3420 /* just a "sub foo;" when &foo is already defined */
3424 /* ahem, death to those who redefine active sort subs */
3425 if (curstackinfo->si_type == SI_SORT && sortcop == CvSTART(cv))
3426 croak("Can't redefine active sort subroutine %s", name);
3427 if(const_sv = cv_const_sv(cv))
3428 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3429 if ((const_sv && const_changed) || dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3430 && HvNAME(GvSTASH(CvGV(cv)))
3431 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3433 line_t oldline = curcop->cop_line;
3434 curcop->cop_line = copline;
3435 warn(const_sv ? "Constant subroutine %s redefined"
3436 : "Subroutine %s redefined", name);
3437 curcop->cop_line = oldline;
3443 if (cv) { /* must reuse cv if autoloaded */
3445 CvFLAGS(cv) = CvFLAGS(compcv);
3446 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3447 CvOUTSIDE(compcv) = 0;
3448 CvPADLIST(cv) = CvPADLIST(compcv);
3449 CvPADLIST(compcv) = 0;
3450 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3451 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3452 SvREFCNT_dec(compcv);
3462 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3463 CvFILEGV(cv) = curcop->cop_filegv;
3464 CvSTASH(cv) = curstash;
3467 New(666, CvMUTEXP(cv), 1, perl_mutex);
3468 MUTEX_INIT(CvMUTEXP(cv));
3469 #endif /* USE_THREADS */
3472 sv_setpv((SV*)cv, ps);
3478 char *s = strrchr(name, ':');
3480 if (strEQ(s, "BEGIN")) {
3482 "BEGIN not safe after errors--compilation aborted";
3486 /* force display of errors found but not reported */
3487 sv_catpv(ERRSV, not_safe);
3488 croak("%s", SvPVx(ERRSV, na));
3500 if (AvFILLp(comppad_name) < AvFILLp(comppad))
3501 av_store(comppad_name, AvFILLp(comppad), Nullsv);
3504 SV **namep = AvARRAY(comppad_name);
3505 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3508 if (SvIMMORTAL(curpad[ix]))
3511 * The only things that a clonable function needs in its
3512 * pad are references to outer lexicals and anonymous subs.
3513 * The rest are created anew during cloning.
3515 if (!((namesv = namep[ix]) != Nullsv &&
3516 namesv != &sv_undef &&
3518 *SvPVX(namesv) == '&')))
3520 SvREFCNT_dec(curpad[ix]);
3521 curpad[ix] = Nullsv;
3526 AV *av = newAV(); /* Will be @_ */
3528 av_store(comppad, 0, (SV*)av);
3529 AvFLAGS(av) = AVf_REIFY;
3531 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3532 if (SvIMMORTAL(curpad[ix]))
3534 if (!SvPADMY(curpad[ix]))
3535 SvPADTMP_on(curpad[ix]);
3539 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3540 CvSTART(cv) = LINKLIST(CvROOT(cv));
3541 CvROOT(cv)->op_next = 0;
3547 if (PERLDB_SUBLINE && curstash != debstash) {
3548 SV *sv = NEWSV(0,0);
3549 SV *tmpstr = sv_newmortal();
3550 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3554 sv_setpvf(sv, "%_:%ld-%ld",
3555 GvSV(curcop->cop_filegv),
3556 (long)subline, (long)curcop->cop_line);
3557 gv_efullname3(tmpstr, gv, Nullch);
3558 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3559 hv = GvHVn(db_postponed);
3560 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3561 && (cv = GvCV(db_postponed))) {
3566 perl_call_sv((SV*)cv, G_DISCARD);
3570 if ((s = strrchr(name,':')))
3574 if (strEQ(s, "BEGIN")) {
3575 I32 oldscope = scopestack_ix;
3577 SAVESPTR(compiling.cop_filegv);
3578 SAVEI16(compiling.cop_line);
3584 DEBUG_x( dump_sub(gv) );
3585 av_push(beginav, (SV *)cv);
3587 call_list(oldscope, beginav);
3589 curcop = &compiling;
3592 else if (strEQ(s, "END") && !error_count) {
3595 av_unshift(endav, 1);
3596 av_store(endav, 0, (SV *)cv);
3599 else if (strEQ(s, "INIT") && !error_count) {
3602 av_push(initav, SvREFCNT_inc(cv));
3613 newCONSTSUB(HV *stash, char *name, SV *sv)
3616 U32 oldhints = hints;
3617 HV *old_cop_stash = curcop->cop_stash;
3618 HV *old_curstash = curstash;
3619 line_t oldline = curcop->cop_line;
3620 curcop->cop_line = copline;
3622 hints &= ~HINT_BLOCK_SCOPE;
3624 curstash = curcop->cop_stash = stash;
3627 start_subparse(FALSE, 0),
3628 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3629 newSVOP(OP_CONST, 0, &sv_no), /* SvPV(&sv_no) == "" -- GMB */
3630 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3634 curcop->cop_stash = old_cop_stash;
3635 curstash = old_curstash;
3636 curcop->cop_line = oldline;
3640 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3643 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3646 if (cv = (name ? GvCV(gv) : Nullcv)) {
3648 /* just a cached method */
3652 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3653 /* already defined (or promised) */
3654 if (dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3655 && HvNAME(GvSTASH(CvGV(cv)))
3656 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3657 line_t oldline = curcop->cop_line;
3658 curcop->cop_line = copline;
3659 warn("Subroutine %s redefined",name);
3660 curcop->cop_line = oldline;
3667 if (cv) /* must reuse cv if autoloaded */
3670 cv = (CV*)NEWSV(1105,0);
3671 sv_upgrade((SV *)cv, SVt_PVCV);
3678 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3680 New(666, CvMUTEXP(cv), 1, perl_mutex);
3681 MUTEX_INIT(CvMUTEXP(cv));
3683 #endif /* USE_THREADS */
3684 CvFILEGV(cv) = gv_fetchfile(filename);
3685 CvXSUB(cv) = subaddr;
3688 char *s = strrchr(name,':');
3693 if (strEQ(s, "BEGIN")) {
3696 av_push(beginav, (SV *)cv);
3699 else if (strEQ(s, "END")) {
3702 av_unshift(endav, 1);
3703 av_store(endav, 0, (SV *)cv);
3706 else if (strEQ(s, "INIT")) {
3709 av_push(initav, (SV *)cv);
3719 newFORM(I32 floor, OP *o, OP *block)
3728 name = SvPVx(cSVOPo->op_sv, na);
3731 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3733 if (cv = GvFORM(gv)) {
3735 line_t oldline = curcop->cop_line;
3737 curcop->cop_line = copline;
3738 warn("Format %s redefined",name);
3739 curcop->cop_line = oldline;
3745 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3746 CvFILEGV(cv) = curcop->cop_filegv;
3748 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3749 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3750 SvPADTMP_on(curpad[ix]);
3753 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3754 CvSTART(cv) = LINKLIST(CvROOT(cv));
3755 CvROOT(cv)->op_next = 0;
3765 return newUNOP(OP_REFGEN, 0,
3766 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3772 return newUNOP(OP_REFGEN, 0,
3773 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3777 newANONSUB(I32 floor, OP *proto, OP *block)
3779 return newUNOP(OP_REFGEN, 0,
3780 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3786 switch (o->op_type) {
3788 o->op_type = OP_PADAV;
3789 o->op_ppaddr = ppaddr[OP_PADAV];
3790 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3793 o->op_type = OP_RV2AV;
3794 o->op_ppaddr = ppaddr[OP_RV2AV];
3799 warn("oops: oopsAV");
3808 switch (o->op_type) {
3811 o->op_type = OP_PADHV;
3812 o->op_ppaddr = ppaddr[OP_PADHV];
3813 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3817 o->op_type = OP_RV2HV;
3818 o->op_ppaddr = ppaddr[OP_RV2HV];
3823 warn("oops: oopsHV");
3832 if (o->op_type == OP_PADANY) {
3833 o->op_type = OP_PADAV;
3834 o->op_ppaddr = ppaddr[OP_PADAV];
3837 return newUNOP(OP_RV2AV, 0, scalar(o));
3841 newGVREF(I32 type, OP *o)
3843 if (type == OP_MAPSTART)
3844 return newUNOP(OP_NULL, 0, o);
3845 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3851 if (o->op_type == OP_PADANY) {
3852 o->op_type = OP_PADHV;
3853 o->op_ppaddr = ppaddr[OP_PADHV];
3856 return newUNOP(OP_RV2HV, 0, scalar(o));
3862 croak("NOT IMPL LINE %d",__LINE__);
3868 newCVREF(I32 flags, OP *o)
3870 return newUNOP(OP_RV2CV, flags, scalar(o));
3876 if (o->op_type == OP_PADANY) {
3877 o->op_type = OP_PADSV;
3878 o->op_ppaddr = ppaddr[OP_PADSV];
3881 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3882 o->op_flags |= OPpDONE_SVREF;
3885 return newUNOP(OP_RV2SV, 0, scalar(o));
3888 /* Check routines. */
3896 name = NEWSV(1106,0);
3897 sv_upgrade(name, SVt_PVNV);
3898 sv_setpvn(name, "&", 1);
3901 ix = pad_alloc(o->op_type, SVs_PADMY);
3902 av_store(comppad_name, ix, name);
3903 av_store(comppad, ix, cSVOPo->op_sv);
3904 SvPADMY_on(cSVOPo->op_sv);
3905 cSVOPo->op_sv = Nullsv;
3906 cSVOPo->op_targ = ix;
3913 o->op_private = hints;
3920 if (cUNOPo->op_first->op_type == OP_CONCAT)
3921 o->op_flags |= OPf_STACKED;
3928 if (o->op_flags & OPf_KIDS) {
3931 OPCODE type = o->op_type;
3932 o = modkids(ck_fun(o), type);
3933 kid = cUNOPo->op_first;
3934 newop = kUNOP->op_first->op_sibling;
3936 (newop->op_sibling ||
3937 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3938 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3939 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3943 op_free(kUNOP->op_first);
3944 kUNOP->op_first = newop;
3946 o->op_ppaddr = ppaddr[++o->op_type];
3955 if (o->op_flags & OPf_KIDS) {
3956 OP *kid = cUNOPo->op_first;
3957 if (kid->op_type == OP_HSLICE)
3958 o->op_private |= OPpSLICE;
3959 else if (kid->op_type != OP_HELEM)
3960 croak("%s argument is not a HASH element or slice",
3961 op_desc[o->op_type]);
3970 I32 type = o->op_type;
3972 if (o->op_flags & OPf_KIDS) {
3973 if (cLISTOPo->op_first->op_type == OP_STUB) {
3975 o = newUNOP(type, OPf_SPECIAL,
3976 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3986 hints |= HINT_BLOCK_SCOPE;
3987 if (o->op_flags & OPf_KIDS) {
3988 SVOP *kid = (SVOP*)cUNOPo->op_first;
3991 o->op_flags &= ~OPf_KIDS;
3994 else if (kid->op_type == OP_LINESEQ) {
3997 kid->op_next = o->op_next;
3998 cUNOPo->op_first = 0;
4001 Newz(1101, enter, 1, LOGOP);
4002 enter->op_type = OP_ENTERTRY;
4003 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4004 enter->op_private = 0;
4006 /* establish postfix order */
4007 enter->op_next = (OP*)enter;
4009 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4010 o->op_type = OP_LEAVETRY;
4011 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4012 enter->op_other = o;
4020 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4022 o->op_targ = (PADOFFSET)hints;
4030 if (o->op_flags & OPf_STACKED) {
4032 kid = cUNOPo->op_first->op_sibling;
4033 if (kid->op_type == OP_RV2GV)
4045 if (o->op_flags & OPf_KIDS) {
4046 OP *kid = cUNOPo->op_first;
4047 if (kid->op_type != OP_HELEM)
4048 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4055 ck_gvconst(register OP *o)
4057 o = fold_constants(o);
4058 if (o->op_type == OP_CONST)
4064 ck_rvconst(register OP *o)
4067 SVOP *kid = (SVOP*)cUNOPo->op_first;
4069 o->op_private |= (hints & HINT_STRICT_REFS);
4070 if (kid->op_type == OP_CONST) {
4075 name = SvPV(kid->op_sv, na);
4076 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4077 char *badthing = Nullch;
4078 switch (o->op_type) {
4080 badthing = "a SCALAR";
4083 badthing = "an ARRAY";
4086 badthing = "a HASH";
4091 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4095 * This is a little tricky. We only want to add the symbol if we
4096 * didn't add it in the lexer. Otherwise we get duplicate strict
4097 * warnings. But if we didn't add it in the lexer, we must at
4098 * least pretend like we wanted to add it even if it existed before,
4099 * or we get possible typo warnings. OPpCONST_ENTERED says
4100 * whether the lexer already added THIS instance of this symbol.
4102 iscv = (o->op_type == OP_RV2CV) * 2;
4104 gv = gv_fetchpv(name,
4105 iscv | !(kid->op_private & OPpCONST_ENTERED),
4108 : o->op_type == OP_RV2SV
4110 : o->op_type == OP_RV2AV
4112 : o->op_type == OP_RV2HV
4115 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4117 kid->op_type = OP_GV;
4118 SvREFCNT_dec(kid->op_sv);
4119 kid->op_sv = SvREFCNT_inc(gv);
4129 I32 type = o->op_type;
4131 if (o->op_flags & OPf_REF)
4134 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4135 SVOP *kid = (SVOP*)cUNOPo->op_first;
4137 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4138 OP *newop = newGVOP(type, OPf_REF,
4139 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4146 if (type == OP_FTTTY)
4147 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4150 return newUNOP(type, 0, newDEFSVOP());
4163 int type = o->op_type;
4164 register I32 oa = opargs[type] >> OASHIFT;
4166 if (o->op_flags & OPf_STACKED) {
4167 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4170 return no_fh_allowed(o);
4173 if (o->op_flags & OPf_KIDS) {
4174 tokid = &cLISTOPo->op_first;
4175 kid = cLISTOPo->op_first;
4176 if (kid->op_type == OP_PUSHMARK ||
4177 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4179 tokid = &kid->op_sibling;
4180 kid = kid->op_sibling;
4182 if (!kid && opargs[type] & OA_DEFGV)
4183 *tokid = kid = newDEFSVOP();
4187 sibl = kid->op_sibling;
4201 if (kid->op_type == OP_CONST &&
4202 (kid->op_private & OPpCONST_BARE)) {
4203 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4204 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4205 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4207 warn("Array @%s missing the @ in argument %ld of %s()",
4208 name, (long)numargs, op_desc[type]);
4211 kid->op_sibling = sibl;
4214 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4215 bad_type(numargs, "array", op_desc[o->op_type], kid);
4219 if (kid->op_type == OP_CONST &&
4220 (kid->op_private & OPpCONST_BARE)) {
4221 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4222 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4223 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4225 warn("Hash %%%s missing the %% in argument %ld of %s()",
4226 name, (long)numargs, op_desc[type]);
4229 kid->op_sibling = sibl;
4232 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4233 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4238 OP *newop = newUNOP(OP_NULL, 0, kid);
4239 kid->op_sibling = 0;
4241 newop->op_next = newop;
4243 kid->op_sibling = sibl;
4248 if (kid->op_type != OP_GV) {
4249 if (kid->op_type == OP_CONST &&
4250 (kid->op_private & OPpCONST_BARE)) {
4251 OP *newop = newGVOP(OP_GV, 0,
4252 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4258 kid->op_sibling = 0;
4259 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4261 kid->op_sibling = sibl;
4267 mod(scalar(kid), type);
4271 tokid = &kid->op_sibling;
4272 kid = kid->op_sibling;
4274 o->op_private |= numargs;
4276 return too_many_arguments(o,op_desc[o->op_type]);
4279 else if (opargs[type] & OA_DEFGV) {
4281 return newUNOP(type, 0, newDEFSVOP());
4285 while (oa & OA_OPTIONAL)
4287 if (oa && oa != OA_LIST)
4288 return too_few_arguments(o,op_desc[o->op_type]);
4298 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4299 append_elem(OP_GLOB, o, newDEFSVOP());
4301 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4302 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4304 if (gv && GvIMPORTED_CV(gv)) {
4305 static int glob_index;
4307 append_elem(OP_GLOB, o,
4308 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4309 o->op_type = OP_LIST;
4310 o->op_ppaddr = ppaddr[OP_LIST];
4311 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4312 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4313 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4314 append_elem(OP_LIST, o,
4315 scalar(newUNOP(OP_RV2CV, 0,
4316 newGVOP(OP_GV, 0, gv)))));
4317 o = newUNOP(OP_NULL, 0, ck_subr(o));
4318 o->op_targ = OP_GLOB; /* hint at what it used to be */
4321 gv = newGVgen("main");
4323 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4333 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4335 o->op_ppaddr = ppaddr[OP_GREPSTART];
4336 Newz(1101, gwop, 1, LOGOP);
4338 if (o->op_flags & OPf_STACKED) {
4341 kid = cLISTOPo->op_first->op_sibling;
4342 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4345 kid->op_next = (OP*)gwop;
4346 o->op_flags &= ~OPf_STACKED;
4348 kid = cLISTOPo->op_first->op_sibling;
4349 if (type == OP_MAPWHILE)
4356 kid = cLISTOPo->op_first->op_sibling;
4357 if (kid->op_type != OP_NULL)
4358 croak("panic: ck_grep");
4359 kid = kUNOP->op_first;
4361 gwop->op_type = type;
4362 gwop->op_ppaddr = ppaddr[type];
4363 gwop->op_first = listkids(o);
4364 gwop->op_flags |= OPf_KIDS;
4365 gwop->op_private = 1;
4366 gwop->op_other = LINKLIST(kid);
4367 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4368 kid->op_next = (OP*)gwop;
4370 kid = cLISTOPo->op_first->op_sibling;
4371 if (!kid || !kid->op_sibling)
4372 return too_few_arguments(o,op_desc[o->op_type]);
4373 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4374 mod(kid, OP_GREPSTART);
4382 if (o->op_flags & OPf_KIDS) {
4383 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4384 if (kid && kid->op_type == OP_CONST)
4385 fbm_compile(((SVOP*)kid)->op_sv, 0);
4391 ck_lengthconst(OP *o)
4393 /* XXX length optimization goes here */
4400 OPCODE type = o->op_type;
4401 return modkids(ck_fun(o), type);
4407 OPCODE type = o->op_type;
4408 return refkids(ck_fun(o), type);
4416 kid = cLISTOPo->op_first;
4419 kid = cLISTOPo->op_first;
4421 if (kid->op_type == OP_PUSHMARK)
4422 kid = kid->op_sibling;
4423 if (kid && o->op_flags & OPf_STACKED)
4424 kid = kid->op_sibling;
4425 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4426 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4427 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4428 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4429 cLISTOPo->op_first->op_sibling = kid;
4430 cLISTOPo->op_last = kid;
4431 kid = kid->op_sibling;
4436 append_elem(o->op_type, o, newDEFSVOP());
4442 if (hints & HINT_LOCALE)
4443 o->op_private |= OPpLOCALE;
4450 ck_fun_locale(OP *o)
4456 if (hints & HINT_LOCALE)
4457 o->op_private |= OPpLOCALE;
4468 if (hints & HINT_LOCALE)
4469 o->op_private |= OPpLOCALE;
4478 o->op_private |= OPpRUNTIME;
4491 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4492 o->op_private |= OPpREPEAT_DOLIST;
4493 cBINOPo->op_first = force_list(cBINOPo->op_first);
4503 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4504 SVOP *kid = (SVOP*)cUNOPo->op_first;
4506 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4508 for (s = SvPVX(kid->op_sv); *s; s++) {
4509 if (*s == ':' && s[1] == ':') {
4511 Move(s+2, s+1, strlen(s+2)+1, char);
4512 --SvCUR(kid->op_sv);
4515 sv_catpvn(kid->op_sv, ".pm", 3);
4524 croak("NOT IMPL LINE %d",__LINE__);
4533 if (o->op_flags & OPf_KIDS) {
4534 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4535 if (kid && kid->op_sibling) {
4536 o->op_type = OP_SSELECT;
4537 o->op_ppaddr = ppaddr[OP_SSELECT];
4539 return fold_constants(o);
4543 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4544 if (kid && kid->op_type == OP_RV2GV)
4545 kid->op_private &= ~HINT_STRICT_REFS;
4552 I32 type = o->op_type;
4554 if (!(o->op_flags & OPf_KIDS)) {
4559 if (!CvUNIQUE(compcv)) {
4560 argop = newOP(OP_PADAV, OPf_REF);
4561 argop->op_targ = 0; /* curpad[0] is @_ */
4564 argop = newUNOP(OP_RV2AV, 0,
4565 scalar(newGVOP(OP_GV, 0,
4566 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4569 argop = newUNOP(OP_RV2AV, 0,
4570 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(compcv) ?
4571 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4572 #endif /* USE_THREADS */
4573 return newUNOP(type, 0, scalar(argop));
4575 return scalar(modkids(ck_fun(o), type));
4583 if (hints & HINT_LOCALE)
4584 o->op_private |= OPpLOCALE;
4587 if (o->op_flags & OPf_STACKED) {
4588 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4590 kid = kUNOP->op_first; /* get past rv2gv */
4592 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4594 if (kid->op_type == OP_SCOPE) {
4598 else if (kid->op_type == OP_LEAVE) {
4599 if (o->op_type == OP_SORT) {
4600 null(kid); /* wipe out leave */
4603 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4604 if (k->op_next == kid)
4609 kid->op_next = 0; /* just disconnect the leave */
4610 k = kLISTOP->op_first;
4614 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4615 null(kid); /* wipe out rv2gv */
4616 if (o->op_type == OP_SORT)
4620 o->op_flags |= OPf_SPECIAL;
4632 if (o->op_flags & OPf_STACKED)
4633 return no_fh_allowed(o);
4635 kid = cLISTOPo->op_first;
4636 if (kid->op_type != OP_NULL)
4637 croak("panic: ck_split");
4638 kid = kid->op_sibling;
4639 op_free(cLISTOPo->op_first);
4640 cLISTOPo->op_first = kid;
4642 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4643 cLISTOPo->op_last = kid; /* There was only one element previously */
4646 if (kid->op_type != OP_MATCH) {
4647 OP *sibl = kid->op_sibling;
4648 kid->op_sibling = 0;
4649 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4650 if (cLISTOPo->op_first == cLISTOPo->op_last)
4651 cLISTOPo->op_last = kid;
4652 cLISTOPo->op_first = kid;
4653 kid->op_sibling = sibl;
4656 kid->op_type = OP_PUSHRE;
4657 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4660 if (!kid->op_sibling)
4661 append_elem(OP_SPLIT, o, newDEFSVOP());
4663 kid = kid->op_sibling;
4666 if (!kid->op_sibling)
4667 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4669 kid = kid->op_sibling;
4672 if (kid->op_sibling)
4673 return too_many_arguments(o,op_desc[o->op_type]);
4682 OP *prev = ((cUNOPo->op_first->op_sibling)
4683 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4684 OP *o2 = prev->op_sibling;
4692 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4693 if (cvop->op_type == OP_RV2CV) {
4695 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4696 null(cvop); /* disable rv2cv */
4697 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4698 if (tmpop->op_type == OP_GV) {
4699 cv = GvCVu(tmpop->op_sv);
4700 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4701 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4702 proto = SvPV((SV*)cv, na);
4706 o->op_private |= (hints & HINT_STRICT_REFS);
4707 if (PERLDB_SUB && curstash != debstash)
4708 o->op_private |= OPpENTERSUB_DB;
4709 while (o2 != cvop) {
4713 return too_many_arguments(o, gv_ename(namegv));
4731 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4732 bad_type(arg, "block", gv_ename(namegv), o2);
4737 if (o2->op_type == OP_RV2GV)
4741 OP* sib = kid->op_sibling;
4742 kid->op_sibling = 0;
4743 o2 = newUNOP(OP_RV2GV, 0, kid);
4744 o2->op_sibling = sib;
4745 prev->op_sibling = o2;
4753 if (o2->op_type != OP_RV2GV)
4754 bad_type(arg, "symbol", gv_ename(namegv), o2);
4757 if (o2->op_type != OP_RV2CV)
4758 bad_type(arg, "sub", gv_ename(namegv), o2);
4761 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4762 bad_type(arg, "scalar", gv_ename(namegv), o2);
4765 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4766 bad_type(arg, "array", gv_ename(namegv), o2);
4769 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4770 bad_type(arg, "hash", gv_ename(namegv), o2);
4774 OP* sib = kid->op_sibling;
4775 kid->op_sibling = 0;
4776 o2 = newUNOP(OP_REFGEN, 0, kid);
4777 o2->op_sibling = sib;
4778 prev->op_sibling = o2;
4789 croak("Malformed prototype for %s: %s",
4790 gv_ename(namegv), SvPV((SV*)cv, na));
4795 mod(o2, OP_ENTERSUB);
4797 o2 = o2->op_sibling;
4799 if (proto && !optional &&
4800 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4801 return too_few_arguments(o, gv_ename(namegv));
4808 SvREADONLY_on(cSVOPo->op_sv);
4815 if (o->op_flags & OPf_KIDS) {
4816 SVOP *kid = (SVOP*)cUNOPo->op_first;
4818 if (kid->op_type == OP_NULL)
4819 kid = (SVOP*)kid->op_sibling;
4821 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4822 o->op_flags |= OPf_SPECIAL;
4827 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4830 peep(register OP *o)
4833 register OP* oldop = 0;
4834 if (!o || o->op_seq)
4839 for (; o; o = o->op_next) {
4845 switch (o->op_type) {
4848 curcop = ((COP*)o); /* for warnings */
4849 o->op_seq = op_seqmax++;
4860 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
4862 o->op_seq = op_seqmax++;
4865 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4866 o->op_seq = op_seqmax++;
4867 break; /* Scalar stub must produce undef. List stub is noop */
4871 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4878 if (oldop && o->op_next) {
4879 oldop->op_next = o->op_next;
4882 o->op_seq = op_seqmax++;
4886 if (o->op_next->op_type == OP_RV2SV) {
4887 if (!(o->op_next->op_private & OPpDEREF)) {
4889 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4890 o->op_next = o->op_next->op_next;
4891 o->op_type = OP_GVSV;
4892 o->op_ppaddr = ppaddr[OP_GVSV];
4895 else if (o->op_next->op_type == OP_RV2AV) {
4896 OP* pop = o->op_next->op_next;
4898 if (pop->op_type == OP_CONST &&
4899 (op = pop->op_next) &&
4900 pop->op_next->op_type == OP_AELEM &&
4901 !(pop->op_next->op_private &
4902 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4903 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4907 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4911 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4912 o->op_next = pop->op_next->op_next;
4913 o->op_type = OP_AELEMFAST;
4914 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4915 o->op_private = (U8)i;
4916 GvAVn(((GVOP*)o)->op_gv);
4919 o->op_seq = op_seqmax++;
4923 if (o->op_next->op_type == OP_RV2AV
4924 && (o->op_next->op_flags && OPf_REF))
4927 o->op_next = o->op_next->op_next;
4932 if (o->op_next->op_type == OP_RV2HV
4933 && (o->op_next->op_flags && OPf_REF))
4936 o->op_next = o->op_next->op_next;
4944 o->op_seq = op_seqmax++;
4945 while (cLOGOP->op_other->op_type == OP_NULL)
4946 cLOGOP->op_other = cLOGOP->op_other->op_next;
4947 peep(cLOGOP->op_other);
4951 o->op_seq = op_seqmax++;
4952 peep(cCONDOP->op_true);
4953 peep(cCONDOP->op_false);
4957 o->op_seq = op_seqmax++;
4958 peep(cLOOP->op_redoop);
4959 peep(cLOOP->op_nextop);
4960 peep(cLOOP->op_lastop);
4965 o->op_seq = op_seqmax++;
4966 peep(cPMOP->op_pmreplstart);
4970 o->op_seq = op_seqmax++;
4971 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4972 if (o->op_next->op_sibling &&
4973 o->op_next->op_sibling->op_type != OP_EXIT &&
4974 o->op_next->op_sibling->op_type != OP_WARN &&
4975 o->op_next->op_sibling->op_type != OP_DIE) {
4976 line_t oldline = curcop->cop_line;
4978 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4979 warn("Statement unlikely to be reached");
4980 warn("(Maybe you meant system() when you said exec()?)\n");
4981 curcop->cop_line = oldline;
4995 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4996 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4998 rop = (UNOP*)((BINOP*)o)->op_first;
4999 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5001 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
5002 if (!SvOBJECT(lexname))
5004 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5005 if (!fields || !GvHV(*fields))
5007 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5008 key = SvPV(*svp, keylen);
5009 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5011 croak("No such field \"%s\" in variable %s of type %s",
5012 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
5014 ind = SvIV(*indsvp);
5016 croak("Bad index while coercing array into hash");
5017 rop->op_type = OP_RV2AV;
5018 rop->op_ppaddr = ppaddr[OP_RV2AV];
5019 o->op_type = OP_AELEM;
5020 o->op_ppaddr = ppaddr[OP_AELEM];
5022 *svp = newSViv(ind);
5027 o->op_seq = op_seqmax++;