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)
787 if (o->op_private == 4)
858 if (!(o->op_private & OPpLVAL_INTRO))
859 useless = op_desc[o->op_type];
866 if (!(o->op_private & OPpLVAL_INTRO) &&
867 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
868 useless = "a variable";
873 WITH_THR(curcop = ((COP*)o)); /* for warning below */
879 useless = "a constant";
880 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
882 else if (SvPOK(sv)) {
883 if (strnEQ(SvPVX(sv), "di", 2) ||
884 strnEQ(SvPVX(sv), "ds", 2) ||
885 strnEQ(SvPVX(sv), "ig", 2))
889 null(o); /* don't execute a constant */
890 SvREFCNT_dec(sv); /* don't even remember it */
894 o->op_type = OP_PREINC; /* pre-increment is faster */
895 o->op_ppaddr = ppaddr[OP_PREINC];
899 o->op_type = OP_PREDEC; /* pre-decrement is faster */
900 o->op_ppaddr = ppaddr[OP_PREDEC];
906 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
911 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
912 WITH_THR(curcop = ((COP*)o)); /* for warning below */
913 if (o->op_flags & OPf_STACKED)
919 if (!(o->op_flags & OPf_KIDS))
928 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
935 /* all requires must return a boolean value */
936 o->op_flags &= ~OPf_WANT;
939 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
940 if (!kPMOP->op_pmreplroot)
941 deprecate("implicit split to @_");
945 if (useless && dowarn)
946 warn("Useless use of %s in void context", useless);
954 if (o && o->op_flags & OPf_KIDS) {
955 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
966 /* assumes no premature commitment */
967 if (!o || (o->op_flags & OPf_WANT) || error_count
968 || o->op_type == OP_RETURN)
971 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
973 switch (o->op_type) {
976 list(cBINOPo->op_first);
981 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
988 if (!(o->op_flags & OPf_KIDS))
990 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
991 list(cBINOPo->op_first);
992 return gen_constant_list(o);
999 kid = cLISTOPo->op_first;
1001 while (kid = kid->op_sibling) {
1002 if (kid->op_sibling)
1007 WITH_THR(curcop = &compiling);
1011 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1012 if (kid->op_sibling)
1017 WITH_THR(curcop = &compiling);
1020 /* all requires must return a boolean value */
1021 o->op_flags &= ~OPf_WANT;
1033 if (o->op_type == OP_LINESEQ ||
1034 o->op_type == OP_SCOPE ||
1035 o->op_type == OP_LEAVE ||
1036 o->op_type == OP_LEAVETRY)
1039 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1040 if (kid->op_sibling) {
1044 curcop = &compiling;
1046 o->op_flags &= ~OPf_PARENS;
1047 if (hints & HINT_BLOCK_SCOPE)
1048 o->op_flags |= OPf_PARENS;
1051 o = newOP(OP_STUB, 0);
1056 modkids(OP *o, I32 type)
1059 if (o && o->op_flags & OPf_KIDS) {
1060 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1067 mod(OP *o, I32 type)
1073 if (!o || error_count)
1076 switch (o->op_type) {
1081 if (!(o->op_private & (OPpCONST_ARYBASE)))
1083 if (eval_start && eval_start->op_type == OP_CONST) {
1084 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1088 SAVEI32(compiling.cop_arybase);
1089 compiling.cop_arybase = 0;
1091 else if (type == OP_REFGEN)
1094 croak("That use of $[ is unsupported");
1097 if (o->op_flags & OPf_PARENS)
1101 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1102 !(o->op_flags & OPf_STACKED)) {
1103 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1104 o->op_ppaddr = ppaddr[OP_RV2CV];
1105 assert(cUNOPo->op_first->op_type == OP_NULL);
1106 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1112 /* grep, foreach, subcalls, refgen */
1113 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1115 yyerror(form("Can't modify %s in %s",
1116 op_desc[o->op_type],
1117 type ? op_desc[type] : "local"));
1131 case OP_RIGHT_SHIFT:
1140 if (!(o->op_flags & OPf_STACKED))
1146 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1152 if (!type && cUNOPo->op_first->op_type != OP_GV)
1153 croak("Can't localize through a reference");
1154 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1156 return o; /* Treat \(@foo) like ordinary list. */
1160 if (scalar_mod_type(o, type))
1162 ref(cUNOPo->op_first, o->op_type);
1174 if (!type && cUNOPo->op_first->op_type != OP_GV)
1175 croak("Can't localize through a reference");
1176 ref(cUNOPo->op_first, o->op_type);
1180 hints |= HINT_BLOCK_SCOPE;
1189 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1190 return o; /* Treat \(@foo) like ordinary list. */
1191 if (scalar_mod_type(o, type))
1197 croak("Can't localize lexical variable %s",
1198 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1203 modcount++; /* XXX ??? */
1205 #endif /* USE_THREADS */
1211 if (type != OP_SASSIGN)
1215 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1221 pad_free(o->op_targ);
1222 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1223 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1224 if (o->op_flags & OPf_KIDS)
1225 mod(cBINOPo->op_first->op_sibling, type);
1230 ref(cBINOPo->op_first, o->op_type);
1231 if (type == OP_ENTERSUB &&
1232 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1233 o->op_private |= OPpLVAL_DEFER;
1240 if (o->op_flags & OPf_KIDS)
1241 mod(cLISTOPo->op_last, type);
1245 if (!(o->op_flags & OPf_KIDS))
1247 if (o->op_targ != OP_LIST) {
1248 mod(cBINOPo->op_first, type);
1253 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1257 o->op_flags |= OPf_MOD;
1259 if (type == OP_AASSIGN || type == OP_SASSIGN)
1260 o->op_flags |= OPf_SPECIAL|OPf_REF;
1262 o->op_private |= OPpLVAL_INTRO;
1263 o->op_flags &= ~OPf_SPECIAL;
1264 hints |= HINT_BLOCK_SCOPE;
1266 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1267 o->op_flags |= OPf_REF;
1272 scalar_mod_type(OP *o, I32 type)
1276 if (o->op_type == OP_RV2GV)
1300 case OP_RIGHT_SHIFT:
1307 case OP_ANDASSIGN: /* may work later */
1308 case OP_ORASSIGN: /* may work later */
1316 refkids(OP *o, I32 type)
1319 if (o && o->op_flags & OPf_KIDS) {
1320 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1327 ref(OP *o, I32 type)
1331 if (!o || error_count)
1334 switch (o->op_type) {
1336 if ((type == OP_DEFINED || type == OP_LOCK) &&
1337 !(o->op_flags & OPf_STACKED)) {
1338 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1339 o->op_ppaddr = ppaddr[OP_RV2CV];
1340 assert(cUNOPo->op_first->op_type == OP_NULL);
1341 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1342 o->op_flags |= OPf_SPECIAL;
1347 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1351 ref(cUNOPo->op_first, o->op_type);
1354 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1355 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1356 : type == OP_RV2HV ? OPpDEREF_HV
1358 o->op_flags |= OPf_MOD;
1363 o->op_flags |= OPf_MOD; /* XXX ??? */
1368 o->op_flags |= OPf_REF;
1371 ref(cUNOPo->op_first, o->op_type);
1376 o->op_flags |= OPf_REF;
1381 if (!(o->op_flags & OPf_KIDS))
1383 ref(cBINOPo->op_first, type);
1387 ref(cBINOPo->op_first, o->op_type);
1388 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1389 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1390 : type == OP_RV2HV ? OPpDEREF_HV
1392 o->op_flags |= OPf_MOD;
1400 if (!(o->op_flags & OPf_KIDS))
1402 ref(cLISTOPo->op_last, type);
1417 if (!o || error_count)
1421 if (type == OP_LIST) {
1422 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1424 } else if (type == OP_UNDEF) {
1426 } else if (type != OP_PADSV &&
1429 type != OP_PUSHMARK)
1431 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1434 o->op_flags |= OPf_MOD;
1435 o->op_private |= OPpLVAL_INTRO;
1443 o->op_flags |= OPf_PARENS;
1448 bind_match(I32 type, OP *left, OP *right)
1453 (left->op_type == OP_RV2AV ||
1454 left->op_type == OP_RV2HV ||
1455 left->op_type == OP_PADAV ||
1456 left->op_type == OP_PADHV)) {
1457 char *desc = op_desc[(right->op_type == OP_SUBST ||
1458 right->op_type == OP_TRANS)
1459 ? right->op_type : OP_MATCH];
1460 char *sample = ((left->op_type == OP_RV2AV ||
1461 left->op_type == OP_PADAV)
1462 ? "@array" : "%hash");
1463 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1466 if (right->op_type == OP_MATCH ||
1467 right->op_type == OP_SUBST ||
1468 right->op_type == OP_TRANS) {
1469 right->op_flags |= OPf_STACKED;
1470 if (right->op_type != OP_MATCH)
1471 left = mod(left, right->op_type);
1472 if (right->op_type == OP_TRANS)
1473 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1475 o = prepend_elem(right->op_type, scalar(left), right);
1477 return newUNOP(OP_NOT, 0, scalar(o));
1481 return bind_match(type, left,
1482 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1490 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1491 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1498 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1499 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1500 o->op_type = OP_LEAVE;
1501 o->op_ppaddr = ppaddr[OP_LEAVE];
1504 if (o->op_type == OP_LINESEQ) {
1506 o->op_type = OP_SCOPE;
1507 o->op_ppaddr = ppaddr[OP_SCOPE];
1508 kid = ((LISTOP*)o)->op_first;
1509 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1510 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1515 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1525 SAVESPTR(GvHV(hintgv));
1526 GvHV(hintgv) = newHVhv(GvHV(hintgv));
1527 SAVEFREESV(GvHV(hintgv));
1531 block_start(int full)
1534 int retval = savestack_ix;
1536 SAVEI32(comppad_name_floor);
1538 if ((comppad_name_fill = AvFILLp(comppad_name)) > 0)
1539 comppad_name_floor = comppad_name_fill;
1541 comppad_name_floor = 0;
1543 SAVEI32(min_intro_pending);
1544 SAVEI32(max_intro_pending);
1545 min_intro_pending = 0;
1546 SAVEI32(comppad_name_fill);
1547 SAVEI32(padix_floor);
1548 padix_floor = padix;
1549 pad_reset_pending = FALSE;
1551 hints &= ~HINT_BLOCK_SCOPE;
1556 block_end(I32 floor, OP *seq)
1559 int needblockscope = hints & HINT_BLOCK_SCOPE;
1560 OP* retval = scalarseq(seq);
1562 pad_reset_pending = FALSE;
1564 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1565 pad_leavemy(comppad_name_fill);
1574 OP *o = newOP(OP_THREADSV, 0);
1575 o->op_targ = find_threadsv("_");
1578 return newSVREF(newGVOP(OP_GV, 0, defgv));
1579 #endif /* USE_THREADS */
1587 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1588 eval_start = linklist(eval_root);
1589 eval_root->op_next = 0;
1595 main_root = scope(sawparens(scalarvoid(o)));
1596 curcop = &compiling;
1597 main_start = LINKLIST(main_root);
1598 main_root->op_next = 0;
1602 /* Register with debugger */
1604 CV *cv = perl_get_cv("DB::postponed", FALSE);
1608 XPUSHs((SV*)compiling.cop_filegv);
1610 perl_call_sv((SV*)cv, G_DISCARD);
1617 localize(OP *o, I32 lex)
1619 if (o->op_flags & OPf_PARENS)
1622 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1624 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1625 if (*s == ';' || *s == '=')
1626 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1630 in_my_stash = Nullhv;
1634 return mod(o, OP_NULL); /* a bit kludgey */
1640 if (o->op_type == OP_LIST) {
1643 o2 = newOP(OP_THREADSV, 0);
1644 o2->op_targ = find_threadsv(";");
1646 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1647 #endif /* USE_THREADS */
1648 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1654 fold_constants(register OP *o)
1658 I32 type = o->op_type;
1661 if (opargs[type] & OA_RETSCALAR)
1663 if (opargs[type] & OA_TARGET)
1664 o->op_targ = pad_alloc(type, SVs_PADTMP);
1666 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1667 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1669 if (!(opargs[type] & OA_FOLDCONST))
1684 if (o->op_private & OPpLOCALE)
1689 goto nope; /* Don't try to run w/ errors */
1691 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1692 if (curop->op_type != OP_CONST &&
1693 curop->op_type != OP_LIST &&
1694 curop->op_type != OP_SCALAR &&
1695 curop->op_type != OP_NULL &&
1696 curop->op_type != OP_PUSHMARK) {
1701 curop = LINKLIST(o);
1706 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1707 pad_swipe(o->op_targ);
1708 else if (SvTEMP(sv)) { /* grab mortal temp? */
1709 (void)SvREFCNT_inc(sv);
1713 if (type == OP_RV2GV)
1714 return newGVOP(OP_GV, 0, (GV*)sv);
1716 /* try to smush double to int, but don't smush -2.0 to -2 */
1717 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1721 if ((double)iv == SvNV(sv)) {
1726 SvIOK_off(sv); /* undo SvIV() damage */
1728 return newSVOP(OP_CONST, 0, sv);
1732 if (!(opargs[type] & OA_OTHERINT))
1735 if (!(hints & HINT_INTEGER)) {
1736 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1739 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1740 if (curop->op_type == OP_CONST) {
1741 if (SvIOK(((SVOP*)curop)->op_sv))
1745 if (opargs[curop->op_type] & OA_RETINTEGER)
1749 o->op_ppaddr = ppaddr[++(o->op_type)];
1756 gen_constant_list(register OP *o)
1760 I32 oldtmps_floor = tmps_floor;
1764 return o; /* Don't attempt to run with errors */
1766 op = curop = LINKLIST(o);
1772 tmps_floor = oldtmps_floor;
1774 o->op_type = OP_RV2AV;
1775 o->op_ppaddr = ppaddr[OP_RV2AV];
1776 curop = ((UNOP*)o)->op_first;
1777 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1784 convert(I32 type, I32 flags, OP *o)
1789 if (!o || o->op_type != OP_LIST)
1790 o = newLISTOP(OP_LIST, 0, o, Nullop);
1792 o->op_flags &= ~OPf_WANT;
1794 if (!(opargs[type] & OA_MARK))
1795 null(cLISTOPo->op_first);
1798 o->op_ppaddr = ppaddr[type];
1799 o->op_flags |= flags;
1801 o = CHECKOP(type, o);
1802 if (o->op_type != type)
1805 if (cLISTOPo->op_children < 7) {
1806 /* XXX do we really need to do this if we're done appending?? */
1807 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1809 cLISTOPo->op_last = last; /* in case check substituted last arg */
1812 return fold_constants(o);
1815 /* List constructors */
1818 append_elem(I32 type, OP *first, OP *last)
1826 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1827 return newLISTOP(type, 0, first, last);
1829 if (first->op_flags & OPf_KIDS)
1830 ((LISTOP*)first)->op_last->op_sibling = last;
1832 first->op_flags |= OPf_KIDS;
1833 ((LISTOP*)first)->op_first = last;
1835 ((LISTOP*)first)->op_last = last;
1836 ((LISTOP*)first)->op_children++;
1841 append_list(I32 type, LISTOP *first, LISTOP *last)
1849 if (first->op_type != type)
1850 return prepend_elem(type, (OP*)first, (OP*)last);
1852 if (last->op_type != type)
1853 return append_elem(type, (OP*)first, (OP*)last);
1855 first->op_last->op_sibling = last->op_first;
1856 first->op_last = last->op_last;
1857 first->op_children += last->op_children;
1858 if (first->op_children)
1859 last->op_flags |= OPf_KIDS;
1866 prepend_elem(I32 type, OP *first, OP *last)
1874 if (last->op_type == type) {
1875 if (type == OP_LIST) { /* already a PUSHMARK there */
1876 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1877 ((LISTOP*)last)->op_first->op_sibling = first;
1880 if (!(last->op_flags & OPf_KIDS)) {
1881 ((LISTOP*)last)->op_last = first;
1882 last->op_flags |= OPf_KIDS;
1884 first->op_sibling = ((LISTOP*)last)->op_first;
1885 ((LISTOP*)last)->op_first = first;
1887 ((LISTOP*)last)->op_children++;
1891 return newLISTOP(type, 0, first, last);
1899 return newOP(OP_STUB, 0);
1905 if (!o || o->op_type != OP_LIST)
1906 o = newLISTOP(OP_LIST, 0, o, Nullop);
1912 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1916 Newz(1101, listop, 1, LISTOP);
1918 listop->op_type = type;
1919 listop->op_ppaddr = ppaddr[type];
1920 listop->op_children = (first != 0) + (last != 0);
1921 listop->op_flags = flags;
1925 else if (!first && last)
1928 first->op_sibling = last;
1929 listop->op_first = first;
1930 listop->op_last = last;
1931 if (type == OP_LIST) {
1933 pushop = newOP(OP_PUSHMARK, 0);
1934 pushop->op_sibling = first;
1935 listop->op_first = pushop;
1936 listop->op_flags |= OPf_KIDS;
1938 listop->op_last = pushop;
1940 else if (listop->op_children)
1941 listop->op_flags |= OPf_KIDS;
1947 newOP(I32 type, I32 flags)
1950 Newz(1101, o, 1, OP);
1952 o->op_ppaddr = ppaddr[type];
1953 o->op_flags = flags;
1956 o->op_private = 0 + (flags >> 8);
1957 if (opargs[type] & OA_RETSCALAR)
1959 if (opargs[type] & OA_TARGET)
1960 o->op_targ = pad_alloc(type, SVs_PADTMP);
1961 return CHECKOP(type, o);
1965 newUNOP(I32 type, I32 flags, OP *first)
1970 first = newOP(OP_STUB, 0);
1971 if (opargs[type] & OA_MARK)
1972 first = force_list(first);
1974 Newz(1101, unop, 1, UNOP);
1975 unop->op_type = type;
1976 unop->op_ppaddr = ppaddr[type];
1977 unop->op_first = first;
1978 unop->op_flags = flags | OPf_KIDS;
1979 unop->op_private = 1 | (flags >> 8);
1981 if(type == OP_STUDY && first->op_type == OP_MATCH) {
1982 first->op_type = OP_PUSHRE;
1983 first->op_ppaddr = ppaddr[OP_PUSHRE];
1986 unop = (UNOP*) CHECKOP(type, unop);
1990 return fold_constants((OP *) unop);
1994 newBINOP(I32 type, I32 flags, OP *first, OP *last)
1997 Newz(1101, binop, 1, BINOP);
2000 first = newOP(OP_NULL, 0);
2002 binop->op_type = type;
2003 binop->op_ppaddr = ppaddr[type];
2004 binop->op_first = first;
2005 binop->op_flags = flags | OPf_KIDS;
2008 binop->op_private = 1 | (flags >> 8);
2011 binop->op_private = 2 | (flags >> 8);
2012 first->op_sibling = last;
2015 binop = (BINOP*)CHECKOP(type, binop);
2019 binop->op_last = last = binop->op_first->op_sibling;
2021 return fold_constants((OP *)binop);
2025 pmtrans(OP *o, OP *expr, OP *repl)
2027 SV *tstr = ((SVOP*)expr)->op_sv;
2028 SV *rstr = ((SVOP*)repl)->op_sv;
2031 register U8 *t = (U8*)SvPV(tstr, tlen);
2032 register U8 *r = (U8*)SvPV(rstr, rlen);
2038 register short *tbl;
2040 tbl = (short*)cPVOPo->op_pv;
2041 complement = o->op_private & OPpTRANS_COMPLEMENT;
2042 Delete = o->op_private & OPpTRANS_DELETE;
2043 squash = o->op_private & OPpTRANS_SQUASH;
2046 Zero(tbl, 256, short);
2047 for (i = 0; i < tlen; i++)
2049 for (i = 0, j = 0; i < 256; i++) {
2065 if (!rlen && !Delete) {
2068 o->op_private |= OPpTRANS_COUNTONLY;
2070 for (i = 0; i < 256; i++)
2072 for (i = 0, j = 0; i < tlen; i++,j++) {
2075 if (tbl[t[i]] == -1)
2081 if (tbl[t[i]] == -1)
2092 newPMOP(I32 type, I32 flags)
2097 Newz(1101, pmop, 1, PMOP);
2098 pmop->op_type = type;
2099 pmop->op_ppaddr = ppaddr[type];
2100 pmop->op_flags = flags;
2101 pmop->op_private = 0 | (flags >> 8);
2103 if (hints & HINT_LOCALE)
2104 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2106 /* link into pm list */
2107 if (type != OP_TRANS && curstash) {
2108 pmop->op_pmnext = HvPMROOT(curstash);
2109 HvPMROOT(curstash) = pmop;
2116 pmruntime(OP *o, OP *expr, OP *repl)
2120 I32 repl_has_vars = 0;
2122 if (o->op_type == OP_TRANS)
2123 return pmtrans(o, expr, repl);
2125 hints |= HINT_BLOCK_SCOPE;
2128 if (expr->op_type == OP_CONST) {
2130 SV *pat = ((SVOP*)expr)->op_sv;
2131 char *p = SvPV(pat, plen);
2132 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2133 sv_setpvn(pat, "\\s+", 3);
2134 p = SvPV(pat, plen);
2135 pm->op_pmflags |= PMf_SKIPWHITE;
2137 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2138 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2139 pm->op_pmflags |= PMf_WHITE;
2143 if (pm->op_pmflags & PMf_KEEP)
2144 expr = newUNOP(OP_REGCMAYBE,0,expr);
2146 Newz(1101, rcop, 1, LOGOP);
2147 rcop->op_type = OP_REGCOMP;
2148 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2149 rcop->op_first = scalar(expr);
2150 rcop->op_flags |= OPf_KIDS;
2151 rcop->op_private = 1;
2154 /* establish postfix order */
2155 if (pm->op_pmflags & PMf_KEEP) {
2157 rcop->op_next = expr;
2158 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2161 rcop->op_next = LINKLIST(expr);
2162 expr->op_next = (OP*)rcop;
2165 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2170 if (pm->op_pmflags & PMf_EVAL)
2173 else if (repl->op_type == OP_THREADSV
2174 && strchr("&`'123456789+",
2175 threadsv_names[repl->op_targ]))
2179 #endif /* USE_THREADS */
2180 else if (repl->op_type == OP_CONST)
2184 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2185 if (opargs[curop->op_type] & OA_DANGEROUS) {
2187 if (curop->op_type == OP_THREADSV) {
2189 if (strchr("&`'123456789+", curop->op_private))
2193 if (curop->op_type == OP_GV) {
2194 GV *gv = ((GVOP*)curop)->op_gv;
2196 if (strchr("&`'123456789+", *GvENAME(gv)))
2199 #endif /* USE_THREADS */
2200 else if (curop->op_type == OP_RV2CV)
2202 else if (curop->op_type == OP_RV2SV ||
2203 curop->op_type == OP_RV2AV ||
2204 curop->op_type == OP_RV2HV ||
2205 curop->op_type == OP_RV2GV) {
2206 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2209 else if (curop->op_type == OP_PADSV ||
2210 curop->op_type == OP_PADAV ||
2211 curop->op_type == OP_PADHV ||
2212 curop->op_type == OP_PADANY) {
2223 && (!pm->op_pmregexp
2224 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2225 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2226 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2227 prepend_elem(o->op_type, scalar(repl), o);
2230 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2231 pm->op_pmflags |= PMf_MAYBE_CONST;
2232 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2234 Newz(1101, rcop, 1, LOGOP);
2235 rcop->op_type = OP_SUBSTCONT;
2236 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2237 rcop->op_first = scalar(repl);
2238 rcop->op_flags |= OPf_KIDS;
2239 rcop->op_private = 1;
2242 /* establish postfix order */
2243 rcop->op_next = LINKLIST(repl);
2244 repl->op_next = (OP*)rcop;
2246 pm->op_pmreplroot = scalar((OP*)rcop);
2247 pm->op_pmreplstart = LINKLIST(rcop);
2256 newSVOP(I32 type, I32 flags, SV *sv)
2259 Newz(1101, svop, 1, SVOP);
2260 svop->op_type = type;
2261 svop->op_ppaddr = ppaddr[type];
2263 svop->op_next = (OP*)svop;
2264 svop->op_flags = flags;
2265 if (opargs[type] & OA_RETSCALAR)
2267 if (opargs[type] & OA_TARGET)
2268 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2269 return CHECKOP(type, svop);
2273 newGVOP(I32 type, I32 flags, GV *gv)
2277 Newz(1101, gvop, 1, GVOP);
2278 gvop->op_type = type;
2279 gvop->op_ppaddr = ppaddr[type];
2280 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2281 gvop->op_next = (OP*)gvop;
2282 gvop->op_flags = flags;
2283 if (opargs[type] & OA_RETSCALAR)
2285 if (opargs[type] & OA_TARGET)
2286 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2287 return CHECKOP(type, gvop);
2291 newPVOP(I32 type, I32 flags, char *pv)
2294 Newz(1101, pvop, 1, PVOP);
2295 pvop->op_type = type;
2296 pvop->op_ppaddr = ppaddr[type];
2298 pvop->op_next = (OP*)pvop;
2299 pvop->op_flags = flags;
2300 if (opargs[type] & OA_RETSCALAR)
2302 if (opargs[type] & OA_TARGET)
2303 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2304 return CHECKOP(type, pvop);
2313 save_hptr(&curstash);
2314 save_item(curstname);
2319 name = SvPV(sv, len);
2320 curstash = gv_stashpvn(name,len,TRUE);
2321 sv_setpvn(curstname, name, len);
2325 sv_setpv(curstname,"<none>");
2333 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2341 if (id->op_type != OP_CONST)
2342 croak("Module name must be constant");
2346 if(version != Nullop) {
2347 SV *vesv = ((SVOP*)version)->op_sv;
2349 if (arg == Nullop && !SvNIOK(vesv)) {
2356 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2357 croak("Version number must be constant number");
2359 /* Make copy of id so we don't free it twice */
2360 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2362 /* Fake up a method call to VERSION */
2363 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2364 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2365 append_elem(OP_LIST,
2366 prepend_elem(OP_LIST, pack, list(version)),
2367 newUNOP(OP_METHOD, 0, meth)));
2371 /* Fake up an import/unimport */
2372 if (arg && arg->op_type == OP_STUB)
2373 imop = arg; /* no import on explicit () */
2374 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2375 imop = Nullop; /* use 5.0; */
2378 /* Make copy of id so we don't free it twice */
2379 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2380 meth = newSVOP(OP_CONST, 0,
2382 ? newSVpv("import", 6)
2383 : newSVpv("unimport", 8)
2385 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2386 append_elem(OP_LIST,
2387 prepend_elem(OP_LIST, pack, list(arg)),
2388 newUNOP(OP_METHOD, 0, meth)));
2391 /* Fake up a require */
2392 rqop = newUNOP(OP_REQUIRE, 0, id);
2394 /* Fake up the BEGIN {}, which does its thing immediately. */
2396 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2398 append_elem(OP_LINESEQ,
2399 append_elem(OP_LINESEQ,
2400 newSTATEOP(0, Nullch, rqop),
2401 newSTATEOP(0, Nullch, veop)),
2402 newSTATEOP(0, Nullch, imop) ));
2409 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2411 return newBINOP(OP_LSLICE, flags,
2412 list(force_list(subscript)),
2413 list(force_list(listval)) );
2417 list_assignment(register OP *o)
2422 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2423 o = cUNOPo->op_first;
2425 if (o->op_type == OP_COND_EXPR) {
2426 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2427 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2432 yyerror("Assignment to both a list and a scalar");
2436 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2437 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2438 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2441 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2444 if (o->op_type == OP_RV2SV)
2451 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2456 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2457 return newLOGOP(optype, 0,
2458 mod(scalar(left), optype),
2459 newUNOP(OP_SASSIGN, 0, scalar(right)));
2462 return newBINOP(optype, OPf_STACKED,
2463 mod(scalar(left), optype), scalar(right));
2467 if (list_assignment(left)) {
2470 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2471 left = mod(left, OP_AASSIGN);
2479 o = newBINOP(OP_AASSIGN, flags,
2480 list(force_list(right)),
2481 list(force_list(left)) );
2482 o->op_private = 0 | (flags >> 8);
2483 if (!(left->op_private & OPpLVAL_INTRO)) {
2487 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2488 if (opargs[curop->op_type] & OA_DANGEROUS) {
2489 if (curop->op_type == OP_GV) {
2490 GV *gv = ((GVOP*)curop)->op_gv;
2491 if (gv == defgv || SvCUR(gv) == generation)
2493 SvCUR(gv) = generation;
2495 else if (curop->op_type == OP_PADSV ||
2496 curop->op_type == OP_PADAV ||
2497 curop->op_type == OP_PADHV ||
2498 curop->op_type == OP_PADANY) {
2499 SV **svp = AvARRAY(comppad_name);
2500 SV *sv = svp[curop->op_targ];
2501 if (SvCUR(sv) == generation)
2503 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2505 else if (curop->op_type == OP_RV2CV)
2507 else if (curop->op_type == OP_RV2SV ||
2508 curop->op_type == OP_RV2AV ||
2509 curop->op_type == OP_RV2HV ||
2510 curop->op_type == OP_RV2GV) {
2511 if (lastop->op_type != OP_GV) /* funny deref? */
2520 o->op_private = OPpASSIGN_COMMON;
2522 if (right && right->op_type == OP_SPLIT) {
2524 if ((tmpop = ((LISTOP*)right)->op_first) &&
2525 tmpop->op_type == OP_PUSHRE)
2527 PMOP *pm = (PMOP*)tmpop;
2528 if (left->op_type == OP_RV2AV &&
2529 !(left->op_private & OPpLVAL_INTRO) &&
2530 !(o->op_private & OPpASSIGN_COMMON) )
2532 tmpop = ((UNOP*)left)->op_first;
2533 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2534 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2535 pm->op_pmflags |= PMf_ONCE;
2536 tmpop = cUNOPo->op_first; /* to list (nulled) */
2537 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2538 tmpop->op_sibling = Nullop; /* don't free split */
2539 right->op_next = tmpop->op_next; /* fix starting loc */
2540 op_free(o); /* blow off assign */
2541 right->op_flags &= ~OPf_WANT;
2542 /* "I don't know and I don't care." */
2547 if (modcount < 10000 &&
2548 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2550 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2552 sv_setiv(sv, modcount+1);
2560 right = newOP(OP_UNDEF, 0);
2561 if (right->op_type == OP_READLINE) {
2562 right->op_flags |= OPf_STACKED;
2563 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2566 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2567 o = newBINOP(OP_SASSIGN, flags,
2568 scalar(right), mod(scalar(left), OP_SASSIGN) );
2580 newSTATEOP(I32 flags, char *label, OP *o)
2583 U32 seq = intro_my();
2586 Newz(1101, cop, 1, COP);
2587 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2588 cop->op_type = OP_DBSTATE;
2589 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2592 cop->op_type = OP_NEXTSTATE;
2593 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2595 cop->op_flags = flags;
2596 cop->op_private = 0 | (flags >> 8);
2598 cop->op_private |= NATIVE_HINTS;
2600 cop->op_next = (OP*)cop;
2603 cop->cop_label = label;
2604 hints |= HINT_BLOCK_SCOPE;
2607 cop->cop_arybase = curcop->cop_arybase;
2609 if (copline == NOLINE)
2610 cop->cop_line = curcop->cop_line;
2612 cop->cop_line = copline;
2615 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2616 cop->cop_stash = curstash;
2618 if (PERLDB_LINE && curstash != debstash) {
2619 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2620 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2621 (void)SvIOK_on(*svp);
2623 SvSTASH(*svp) = (HV*)cop;
2627 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2630 /* "Introduce" my variables to visible status. */
2638 if (! min_intro_pending)
2641 svp = AvARRAY(comppad_name);
2642 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2643 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2644 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2645 SvNVX(sv) = (double)cop_seqmax;
2648 min_intro_pending = 0;
2649 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2650 return cop_seqmax++;
2654 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2656 return new_logop(type, flags, &first, &other);
2660 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2665 OP *first = *firstp;
2666 OP *other = *otherp;
2668 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2669 return newBINOP(type, flags, scalar(first), scalar(other));
2671 scalarboolean(first);
2672 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2673 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2674 if (type == OP_AND || type == OP_OR) {
2680 first = *firstp = cUNOPo->op_first;
2682 first->op_next = o->op_next;
2683 cUNOPo->op_first = Nullop;
2687 if (first->op_type == OP_CONST) {
2688 if (dowarn && (first->op_private & OPpCONST_BARE))
2689 warn("Probable precedence problem on %s", op_desc[type]);
2690 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2701 else if (first->op_type == OP_WANTARRAY) {
2707 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2708 OP *k1 = ((UNOP*)first)->op_first;
2709 OP *k2 = k1->op_sibling;
2711 switch (first->op_type)
2714 if (k2 && k2->op_type == OP_READLINE
2715 && (k2->op_flags & OPf_STACKED)
2716 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2717 warnop = k2->op_type;
2721 if (k1->op_type == OP_READDIR
2722 || k1->op_type == OP_GLOB
2723 || k1->op_type == OP_EACH)
2724 warnop = k1->op_type;
2728 line_t oldline = curcop->cop_line;
2729 curcop->cop_line = copline;
2730 warn("Value of %s%s can be \"0\"; test with defined()",
2732 ((warnop == OP_READLINE || warnop == OP_GLOB)
2733 ? " construct" : "() operator"));
2734 curcop->cop_line = oldline;
2741 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2742 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2744 Newz(1101, logop, 1, LOGOP);
2746 logop->op_type = type;
2747 logop->op_ppaddr = ppaddr[type];
2748 logop->op_first = first;
2749 logop->op_flags = flags | OPf_KIDS;
2750 logop->op_other = LINKLIST(other);
2751 logop->op_private = 1 | (flags >> 8);
2753 /* establish postfix order */
2754 logop->op_next = LINKLIST(first);
2755 first->op_next = (OP*)logop;
2756 first->op_sibling = other;
2758 o = newUNOP(OP_NULL, 0, (OP*)logop);
2765 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2772 return newLOGOP(OP_AND, 0, first, trueop);
2774 return newLOGOP(OP_OR, 0, first, falseop);
2776 scalarboolean(first);
2777 if (first->op_type == OP_CONST) {
2778 if (SvTRUE(((SVOP*)first)->op_sv)) {
2789 else if (first->op_type == OP_WANTARRAY) {
2793 Newz(1101, condop, 1, CONDOP);
2795 condop->op_type = OP_COND_EXPR;
2796 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2797 condop->op_first = first;
2798 condop->op_flags = flags | OPf_KIDS;
2799 condop->op_true = LINKLIST(trueop);
2800 condop->op_false = LINKLIST(falseop);
2801 condop->op_private = 1 | (flags >> 8);
2803 /* establish postfix order */
2804 condop->op_next = LINKLIST(first);
2805 first->op_next = (OP*)condop;
2807 first->op_sibling = trueop;
2808 trueop->op_sibling = falseop;
2809 o = newUNOP(OP_NULL, 0, (OP*)condop);
2811 trueop->op_next = o;
2812 falseop->op_next = o;
2818 newRANGE(I32 flags, OP *left, OP *right)
2826 Newz(1101, condop, 1, CONDOP);
2828 condop->op_type = OP_RANGE;
2829 condop->op_ppaddr = ppaddr[OP_RANGE];
2830 condop->op_first = left;
2831 condop->op_flags = OPf_KIDS;
2832 condop->op_true = LINKLIST(left);
2833 condop->op_false = LINKLIST(right);
2834 condop->op_private = 1 | (flags >> 8);
2836 left->op_sibling = right;
2838 condop->op_next = (OP*)condop;
2839 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2840 flop = newUNOP(OP_FLOP, 0, flip);
2841 o = newUNOP(OP_NULL, 0, flop);
2844 left->op_next = flip;
2845 right->op_next = flop;
2847 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2848 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2849 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2850 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2852 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2853 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2856 if (!flip->op_private || !flop->op_private)
2857 linklist(o); /* blow off optimizer unless constant */
2863 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2868 int once = block && block->op_flags & OPf_SPECIAL &&
2869 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2872 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2873 return block; /* do {} while 0 does once */
2874 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2875 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2876 expr = newUNOP(OP_DEFINED, 0,
2877 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2878 } else if (expr->op_flags & OPf_KIDS) {
2879 OP *k1 = ((UNOP*)expr)->op_first;
2880 OP *k2 = (k1) ? k1->op_sibling : NULL;
2881 switch (expr->op_type) {
2883 if (k2 && k2->op_type == OP_READLINE
2884 && (k2->op_flags & OPf_STACKED)
2885 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2886 expr = newUNOP(OP_DEFINED, 0, expr);
2890 if (k1->op_type == OP_READDIR
2891 || k1->op_type == OP_GLOB
2892 || k1->op_type == OP_EACH)
2893 expr = newUNOP(OP_DEFINED, 0, expr);
2899 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2900 o = new_logop(OP_AND, 0, &expr, &listop);
2903 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2905 if (once && o != listop)
2906 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2909 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2911 o->op_flags |= flags;
2913 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2918 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2927 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2928 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2929 expr = newUNOP(OP_DEFINED, 0,
2930 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2931 } else if (expr && (expr->op_flags & OPf_KIDS)) {
2932 OP *k1 = ((UNOP*)expr)->op_first;
2933 OP *k2 = (k1) ? k1->op_sibling : NULL;
2934 switch (expr->op_type) {
2936 if (k2 && k2->op_type == OP_READLINE
2937 && (k2->op_flags & OPf_STACKED)
2938 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2939 expr = newUNOP(OP_DEFINED, 0, expr);
2943 if (k1->op_type == OP_READDIR
2944 || k1->op_type == OP_GLOB
2945 || k1->op_type == OP_EACH)
2946 expr = newUNOP(OP_DEFINED, 0, expr);
2952 block = newOP(OP_NULL, 0);
2955 next = LINKLIST(cont);
2957 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2958 if ((line_t)whileline != NOLINE) {
2959 copline = whileline;
2960 cont = append_elem(OP_LINESEQ, cont,
2961 newSTATEOP(0, Nullch, Nullop));
2965 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2966 redo = LINKLIST(listop);
2969 copline = whileline;
2971 o = new_logop(OP_AND, 0, &expr, &listop);
2972 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2973 op_free(expr); /* oops, it's a while (0) */
2975 return Nullop; /* listop already freed by new_logop */
2978 ((LISTOP*)listop)->op_last->op_next = condop =
2979 (o == listop ? redo : LINKLIST(o));
2987 Newz(1101,loop,1,LOOP);
2988 loop->op_type = OP_ENTERLOOP;
2989 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2990 loop->op_private = 0;
2991 loop->op_next = (OP*)loop;
2994 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2996 loop->op_redoop = redo;
2997 loop->op_lastop = o;
3000 loop->op_nextop = next;
3002 loop->op_nextop = o;
3004 o->op_flags |= flags;
3005 o->op_private |= (flags >> 8);
3010 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3018 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3019 sv->op_type = OP_RV2GV;
3020 sv->op_ppaddr = ppaddr[OP_RV2GV];
3022 else if (sv->op_type == OP_PADSV) { /* private variable */
3023 padoff = sv->op_targ;
3027 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3028 padoff = sv->op_targ;
3029 iterflags |= OPf_SPECIAL;
3034 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3038 padoff = find_threadsv("_");
3039 iterflags |= OPf_SPECIAL;
3041 sv = newGVOP(OP_GV, 0, defgv);
3044 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3045 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3046 iterflags |= OPf_STACKED;
3048 else if (expr->op_type == OP_NULL &&
3049 (expr->op_flags & OPf_KIDS) &&
3050 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3052 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3053 * set the STACKED flag to indicate that these values are to be
3054 * treated as min/max values by 'pp_iterinit'.
3056 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3057 CONDOP* range = (CONDOP*) flip->op_first;
3058 OP* left = range->op_first;
3059 OP* right = left->op_sibling;
3062 range->op_flags &= ~OPf_KIDS;
3063 range->op_first = Nullop;
3065 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3066 listop->op_first->op_next = range->op_true;
3067 left->op_next = range->op_false;
3068 right->op_next = (OP*)listop;
3069 listop->op_next = listop->op_first;
3072 expr = (OP*)(listop);
3074 iterflags |= OPf_STACKED;
3077 expr = mod(force_list(expr), OP_GREPSTART);
3081 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3082 append_elem(OP_LIST, expr, scalar(sv))));
3083 assert(!loop->op_next);
3084 Renew(loop, 1, LOOP);
3085 loop->op_targ = padoff;
3086 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3088 return newSTATEOP(0, label, wop);
3092 newLOOPEX(I32 type, OP *label)
3096 if (type != OP_GOTO || label->op_type == OP_CONST) {
3097 /* "last()" means "last" */
3098 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3099 o = newOP(type, OPf_SPECIAL);
3101 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3102 ? SvPVx(((SVOP*)label)->op_sv, na)
3108 if (label->op_type == OP_ENTERSUB)
3109 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3110 o = newUNOP(type, OPf_STACKED, label);
3112 hints |= HINT_BLOCK_SCOPE;
3122 MUTEX_DESTROY(CvMUTEXP(cv));
3123 Safefree(CvMUTEXP(cv));
3126 #endif /* USE_THREADS */
3128 if (!CvXSUB(cv) && CvROOT(cv)) {
3130 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3131 croak("Can't undef active subroutine");
3134 croak("Can't undef active subroutine");
3135 #endif /* USE_THREADS */
3142 op_free(CvROOT(cv));
3143 CvROOT(cv) = Nullop;
3146 SvPOK_off((SV*)cv); /* forget prototype */
3148 SvREFCNT_dec(CvGV(cv));
3150 SvREFCNT_dec(CvOUTSIDE(cv));
3151 CvOUTSIDE(cv) = Nullcv;
3152 if (CvPADLIST(cv)) {
3153 /* may be during global destruction */
3154 if (SvREFCNT(CvPADLIST(cv))) {
3155 I32 i = AvFILLp(CvPADLIST(cv));
3157 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3158 SV* sv = svp ? *svp : Nullsv;
3161 if (sv == (SV*)comppad_name)
3162 comppad_name = Nullav;
3163 else if (sv == (SV*)comppad) {
3165 curpad = Null(SV**);
3169 SvREFCNT_dec((SV*)CvPADLIST(cv));
3171 CvPADLIST(cv) = Nullav;
3175 #ifdef DEBUG_CLOSURES
3180 CV *outside = CvOUTSIDE(cv);
3181 AV* padlist = CvPADLIST(cv);
3188 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3190 (CvANON(cv) ? "ANON"
3191 : (cv == main_cv) ? "MAIN"
3192 : CvUNIQUE(outside) ? "UNIQUE"
3193 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3196 : CvANON(outside) ? "ANON"
3197 : (outside == main_cv) ? "MAIN"
3198 : CvUNIQUE(outside) ? "UNIQUE"
3199 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3204 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3205 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3206 pname = AvARRAY(pad_name);
3207 ppad = AvARRAY(pad);
3209 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3210 if (SvPOK(pname[ix]))
3211 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3213 SvFAKE(pname[ix]) ? "FAKE " : "",
3215 (long)I_32(SvNVX(pname[ix])),
3216 (long)SvIVX(pname[ix]));
3219 #endif /* DEBUG_CLOSURES */
3222 cv_clone2(CV *proto, CV *outside)
3227 AV* protopadlist = CvPADLIST(proto);
3228 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3229 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3230 SV** pname = AvARRAY(protopad_name);
3231 SV** ppad = AvARRAY(protopad);
3232 I32 fname = AvFILLp(protopad_name);
3233 I32 fpad = AvFILLp(protopad);
3237 assert(!CvUNIQUE(proto));
3242 SAVESPTR(comppad_name);
3245 cv = compcv = (CV*)NEWSV(1104,0);
3246 sv_upgrade((SV *)cv, SvTYPE(proto));
3252 New(666, CvMUTEXP(cv), 1, perl_mutex);
3253 MUTEX_INIT(CvMUTEXP(cv));
3255 #endif /* USE_THREADS */
3256 CvFILEGV(cv) = CvFILEGV(proto);
3257 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3258 CvSTASH(cv) = CvSTASH(proto);
3259 CvROOT(cv) = CvROOT(proto);
3260 CvSTART(cv) = CvSTART(proto);
3262 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3265 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3267 comppad_name = newAV();
3268 for (ix = fname; ix >= 0; ix--)
3269 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3273 comppadlist = newAV();
3274 AvREAL_off(comppadlist);
3275 av_store(comppadlist, 0, (SV*)comppad_name);
3276 av_store(comppadlist, 1, (SV*)comppad);
3277 CvPADLIST(cv) = comppadlist;
3278 av_fill(comppad, AvFILLp(protopad));
3279 curpad = AvARRAY(comppad);
3281 av = newAV(); /* will be @_ */
3283 av_store(comppad, 0, (SV*)av);
3284 AvFLAGS(av) = AVf_REIFY;
3286 for (ix = fpad; ix > 0; ix--) {
3287 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3288 if (namesv && namesv != &sv_undef) {
3289 char *name = SvPVX(namesv); /* XXX */
3290 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3291 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3292 CvOUTSIDE(cv), cxstack_ix);
3294 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3296 croak("panic: cv_clone: %s", name);
3298 else { /* our own lexical */
3301 /* anon code -- we'll come back for it */
3302 sv = SvREFCNT_inc(ppad[ix]);
3304 else if (*name == '@')
3306 else if (*name == '%')
3316 SV* sv = NEWSV(0,0);
3322 /* Now that vars are all in place, clone nested closures. */
3324 for (ix = fpad; ix > 0; ix--) {
3325 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3327 && namesv != &sv_undef
3328 && !(SvFLAGS(namesv) & SVf_FAKE)
3329 && *SvPVX(namesv) == '&'
3330 && CvCLONE(ppad[ix]))
3332 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3333 SvREFCNT_dec(ppad[ix]);
3336 curpad[ix] = (SV*)kid;
3340 #ifdef DEBUG_CLOSURES
3341 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3343 PerlIO_printf(Perl_debug_log, " from:\n");
3345 PerlIO_printf(Perl_debug_log, " to:\n");
3356 return cv_clone2(proto, CvOUTSIDE(proto));
3360 cv_ckproto(CV *cv, GV *gv, char *p)
3362 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3363 SV* msg = sv_newmortal();
3367 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3368 sv_setpv(msg, "Prototype mismatch:");
3370 sv_catpvf(msg, " sub %_", name);
3372 sv_catpvf(msg, " (%s)", SvPVX(cv));
3373 sv_catpv(msg, " vs ");
3375 sv_catpvf(msg, "(%s)", p);
3377 sv_catpv(msg, "none");
3385 if (!cv || !SvPOK(cv) || SvCUR(cv))
3387 return op_const_sv(CvSTART(cv), cv);
3391 op_const_sv(OP *o, CV *cv)
3398 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3399 o = cLISTOPo->op_first->op_sibling;
3401 for (; o; o = o->op_next) {
3402 OPCODE type = o->op_type;
3404 if(sv && o->op_next == o)
3406 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3408 if (type == OP_LEAVESUB || type == OP_RETURN)
3412 if (type == OP_CONST)
3414 else if (type == OP_PADSV && cv) {
3415 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3416 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3417 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3429 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3432 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3433 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3434 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3435 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3444 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3445 maximum a prototype before. */
3446 if (SvTYPE(gv) > SVt_NULL) {
3447 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3448 warn("Runaway prototype");
3449 cv_ckproto((CV*)gv, NULL, ps);
3452 sv_setpv((SV*)gv, ps);
3454 sv_setiv((SV*)gv, -1);
3455 SvREFCNT_dec(compcv);
3461 if (!name || GvCVGEN(gv))
3463 else if (cv = GvCV(gv)) {
3464 cv_ckproto(cv, gv, ps);
3465 /* already defined (or promised)? */
3466 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3468 bool const_changed = TRUE;
3470 /* just a "sub foo;" when &foo is already defined */
3474 /* ahem, death to those who redefine active sort subs */
3475 if (curstackinfo->si_type == SI_SORT && sortcop == CvSTART(cv))
3476 croak("Can't redefine active sort subroutine %s", name);
3477 if(const_sv = cv_const_sv(cv))
3478 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3479 if ((const_sv && const_changed) || dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3480 && HvNAME(GvSTASH(CvGV(cv)))
3481 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3483 line_t oldline = curcop->cop_line;
3484 curcop->cop_line = copline;
3485 warn(const_sv ? "Constant subroutine %s redefined"
3486 : "Subroutine %s redefined", name);
3487 curcop->cop_line = oldline;
3493 if (cv) { /* must reuse cv if autoloaded */
3495 CvFLAGS(cv) = CvFLAGS(compcv);
3496 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3497 CvOUTSIDE(compcv) = 0;
3498 CvPADLIST(cv) = CvPADLIST(compcv);
3499 CvPADLIST(compcv) = 0;
3500 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3501 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3502 SvREFCNT_dec(compcv);
3512 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3513 CvFILEGV(cv) = curcop->cop_filegv;
3514 CvSTASH(cv) = curstash;
3517 New(666, CvMUTEXP(cv), 1, perl_mutex);
3518 MUTEX_INIT(CvMUTEXP(cv));
3519 #endif /* USE_THREADS */
3522 sv_setpv((SV*)cv, ps);
3528 char *s = strrchr(name, ':');
3530 if (strEQ(s, "BEGIN")) {
3532 "BEGIN not safe after errors--compilation aborted";
3536 /* force display of errors found but not reported */
3537 sv_catpv(ERRSV, not_safe);
3538 croak("%s", SvPVx(ERRSV, na));
3550 if (AvFILLp(comppad_name) < AvFILLp(comppad))
3551 av_store(comppad_name, AvFILLp(comppad), Nullsv);
3554 SV **namep = AvARRAY(comppad_name);
3555 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3558 if (SvIMMORTAL(curpad[ix]))
3561 * The only things that a clonable function needs in its
3562 * pad are references to outer lexicals and anonymous subs.
3563 * The rest are created anew during cloning.
3565 if (!((namesv = namep[ix]) != Nullsv &&
3566 namesv != &sv_undef &&
3568 *SvPVX(namesv) == '&')))
3570 SvREFCNT_dec(curpad[ix]);
3571 curpad[ix] = Nullsv;
3576 AV *av = newAV(); /* Will be @_ */
3578 av_store(comppad, 0, (SV*)av);
3579 AvFLAGS(av) = AVf_REIFY;
3581 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3582 if (SvIMMORTAL(curpad[ix]))
3584 if (!SvPADMY(curpad[ix]))
3585 SvPADTMP_on(curpad[ix]);
3589 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3590 CvSTART(cv) = LINKLIST(CvROOT(cv));
3591 CvROOT(cv)->op_next = 0;
3597 if (PERLDB_SUBLINE && curstash != debstash) {
3598 SV *sv = NEWSV(0,0);
3599 SV *tmpstr = sv_newmortal();
3600 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3604 sv_setpvf(sv, "%_:%ld-%ld",
3605 GvSV(curcop->cop_filegv),
3606 (long)subline, (long)curcop->cop_line);
3607 gv_efullname3(tmpstr, gv, Nullch);
3608 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3609 hv = GvHVn(db_postponed);
3610 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3611 && (cv = GvCV(db_postponed))) {
3616 perl_call_sv((SV*)cv, G_DISCARD);
3620 if ((s = strrchr(name,':')))
3624 if (strEQ(s, "BEGIN")) {
3625 I32 oldscope = scopestack_ix;
3627 SAVESPTR(compiling.cop_filegv);
3628 SAVEI16(compiling.cop_line);
3634 DEBUG_x( dump_sub(gv) );
3635 av_push(beginav, (SV *)cv);
3637 call_list(oldscope, beginav);
3639 curcop = &compiling;
3642 else if (strEQ(s, "END") && !error_count) {
3645 av_unshift(endav, 1);
3646 av_store(endav, 0, (SV *)cv);
3649 else if (strEQ(s, "INIT") && !error_count) {
3652 av_push(initav, SvREFCNT_inc(cv));
3663 newCONSTSUB(HV *stash, char *name, SV *sv)
3666 U32 oldhints = hints;
3667 HV *old_cop_stash = curcop->cop_stash;
3668 HV *old_curstash = curstash;
3669 line_t oldline = curcop->cop_line;
3670 curcop->cop_line = copline;
3672 hints &= ~HINT_BLOCK_SCOPE;
3674 curstash = curcop->cop_stash = stash;
3677 start_subparse(FALSE, 0),
3678 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3679 newSVOP(OP_CONST, 0, &sv_no), /* SvPV(&sv_no) == "" -- GMB */
3680 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3684 curcop->cop_stash = old_cop_stash;
3685 curstash = old_curstash;
3686 curcop->cop_line = oldline;
3690 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3693 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3696 if (cv = (name ? GvCV(gv) : Nullcv)) {
3698 /* just a cached method */
3702 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3703 /* already defined (or promised) */
3704 if (dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3705 && HvNAME(GvSTASH(CvGV(cv)))
3706 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3707 line_t oldline = curcop->cop_line;
3708 curcop->cop_line = copline;
3709 warn("Subroutine %s redefined",name);
3710 curcop->cop_line = oldline;
3717 if (cv) /* must reuse cv if autoloaded */
3720 cv = (CV*)NEWSV(1105,0);
3721 sv_upgrade((SV *)cv, SVt_PVCV);
3728 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3730 New(666, CvMUTEXP(cv), 1, perl_mutex);
3731 MUTEX_INIT(CvMUTEXP(cv));
3733 #endif /* USE_THREADS */
3734 CvFILEGV(cv) = gv_fetchfile(filename);
3735 CvXSUB(cv) = subaddr;
3738 char *s = strrchr(name,':');
3743 if (strEQ(s, "BEGIN")) {
3746 av_push(beginav, (SV *)cv);
3749 else if (strEQ(s, "END")) {
3752 av_unshift(endav, 1);
3753 av_store(endav, 0, (SV *)cv);
3756 else if (strEQ(s, "INIT")) {
3759 av_push(initav, (SV *)cv);
3769 newFORM(I32 floor, OP *o, OP *block)
3778 name = SvPVx(cSVOPo->op_sv, na);
3781 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3783 if (cv = GvFORM(gv)) {
3785 line_t oldline = curcop->cop_line;
3787 curcop->cop_line = copline;
3788 warn("Format %s redefined",name);
3789 curcop->cop_line = oldline;
3795 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3796 CvFILEGV(cv) = curcop->cop_filegv;
3798 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3799 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3800 SvPADTMP_on(curpad[ix]);
3803 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3804 CvSTART(cv) = LINKLIST(CvROOT(cv));
3805 CvROOT(cv)->op_next = 0;
3815 return newUNOP(OP_REFGEN, 0,
3816 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3822 return newUNOP(OP_REFGEN, 0,
3823 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3827 newANONSUB(I32 floor, OP *proto, OP *block)
3829 return newUNOP(OP_REFGEN, 0,
3830 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3836 switch (o->op_type) {
3838 o->op_type = OP_PADAV;
3839 o->op_ppaddr = ppaddr[OP_PADAV];
3840 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3843 o->op_type = OP_RV2AV;
3844 o->op_ppaddr = ppaddr[OP_RV2AV];
3849 warn("oops: oopsAV");
3858 switch (o->op_type) {
3861 o->op_type = OP_PADHV;
3862 o->op_ppaddr = ppaddr[OP_PADHV];
3863 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3867 o->op_type = OP_RV2HV;
3868 o->op_ppaddr = ppaddr[OP_RV2HV];
3873 warn("oops: oopsHV");
3882 if (o->op_type == OP_PADANY) {
3883 o->op_type = OP_PADAV;
3884 o->op_ppaddr = ppaddr[OP_PADAV];
3887 return newUNOP(OP_RV2AV, 0, scalar(o));
3891 newGVREF(I32 type, OP *o)
3893 if (type == OP_MAPSTART)
3894 return newUNOP(OP_NULL, 0, o);
3895 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3901 if (o->op_type == OP_PADANY) {
3902 o->op_type = OP_PADHV;
3903 o->op_ppaddr = ppaddr[OP_PADHV];
3906 return newUNOP(OP_RV2HV, 0, scalar(o));
3912 croak("NOT IMPL LINE %d",__LINE__);
3918 newCVREF(I32 flags, OP *o)
3920 return newUNOP(OP_RV2CV, flags, scalar(o));
3926 if (o->op_type == OP_PADANY) {
3927 o->op_type = OP_PADSV;
3928 o->op_ppaddr = ppaddr[OP_PADSV];
3931 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3932 o->op_flags |= OPpDONE_SVREF;
3935 return newUNOP(OP_RV2SV, 0, scalar(o));
3938 /* Check routines. */
3946 name = NEWSV(1106,0);
3947 sv_upgrade(name, SVt_PVNV);
3948 sv_setpvn(name, "&", 1);
3951 ix = pad_alloc(o->op_type, SVs_PADMY);
3952 av_store(comppad_name, ix, name);
3953 av_store(comppad, ix, cSVOPo->op_sv);
3954 SvPADMY_on(cSVOPo->op_sv);
3955 cSVOPo->op_sv = Nullsv;
3956 cSVOPo->op_targ = ix;
3963 o->op_private = hints;
3970 if (cUNOPo->op_first->op_type == OP_CONCAT)
3971 o->op_flags |= OPf_STACKED;
3978 if (o->op_flags & OPf_KIDS) {
3981 OPCODE type = o->op_type;
3982 o = modkids(ck_fun(o), type);
3983 kid = cUNOPo->op_first;
3984 newop = kUNOP->op_first->op_sibling;
3986 (newop->op_sibling ||
3987 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3988 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3989 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3993 op_free(kUNOP->op_first);
3994 kUNOP->op_first = newop;
3996 o->op_ppaddr = ppaddr[++o->op_type];
4005 if (o->op_flags & OPf_KIDS) {
4006 OP *kid = cUNOPo->op_first;
4007 if (kid->op_type == OP_HSLICE)
4008 o->op_private |= OPpSLICE;
4009 else if (kid->op_type != OP_HELEM)
4010 croak("%s argument is not a HASH element or slice",
4011 op_desc[o->op_type]);
4020 I32 type = o->op_type;
4022 if (o->op_flags & OPf_KIDS) {
4023 if (cLISTOPo->op_first->op_type == OP_STUB) {
4025 o = newUNOP(type, OPf_SPECIAL,
4026 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4036 hints |= HINT_BLOCK_SCOPE;
4037 if (o->op_flags & OPf_KIDS) {
4038 SVOP *kid = (SVOP*)cUNOPo->op_first;
4041 o->op_flags &= ~OPf_KIDS;
4044 else if (kid->op_type == OP_LINESEQ) {
4047 kid->op_next = o->op_next;
4048 cUNOPo->op_first = 0;
4051 Newz(1101, enter, 1, LOGOP);
4052 enter->op_type = OP_ENTERTRY;
4053 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4054 enter->op_private = 0;
4056 /* establish postfix order */
4057 enter->op_next = (OP*)enter;
4059 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4060 o->op_type = OP_LEAVETRY;
4061 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4062 enter->op_other = o;
4070 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4072 o->op_targ = (PADOFFSET)hints;
4080 if (o->op_flags & OPf_STACKED) {
4082 kid = cUNOPo->op_first->op_sibling;
4083 if (kid->op_type == OP_RV2GV)
4095 if (o->op_flags & OPf_KIDS) {
4096 OP *kid = cUNOPo->op_first;
4097 if (kid->op_type != OP_HELEM)
4098 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4105 ck_gvconst(register OP *o)
4107 o = fold_constants(o);
4108 if (o->op_type == OP_CONST)
4114 ck_rvconst(register OP *o)
4117 SVOP *kid = (SVOP*)cUNOPo->op_first;
4119 o->op_private |= (hints & HINT_STRICT_REFS);
4120 if (kid->op_type == OP_CONST) {
4125 name = SvPV(kid->op_sv, na);
4126 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4127 char *badthing = Nullch;
4128 switch (o->op_type) {
4130 badthing = "a SCALAR";
4133 badthing = "an ARRAY";
4136 badthing = "a HASH";
4141 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4145 * This is a little tricky. We only want to add the symbol if we
4146 * didn't add it in the lexer. Otherwise we get duplicate strict
4147 * warnings. But if we didn't add it in the lexer, we must at
4148 * least pretend like we wanted to add it even if it existed before,
4149 * or we get possible typo warnings. OPpCONST_ENTERED says
4150 * whether the lexer already added THIS instance of this symbol.
4152 iscv = (o->op_type == OP_RV2CV) * 2;
4154 gv = gv_fetchpv(name,
4155 iscv | !(kid->op_private & OPpCONST_ENTERED),
4158 : o->op_type == OP_RV2SV
4160 : o->op_type == OP_RV2AV
4162 : o->op_type == OP_RV2HV
4165 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4167 kid->op_type = OP_GV;
4168 SvREFCNT_dec(kid->op_sv);
4169 kid->op_sv = SvREFCNT_inc(gv);
4179 I32 type = o->op_type;
4181 if (o->op_flags & OPf_REF)
4184 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4185 SVOP *kid = (SVOP*)cUNOPo->op_first;
4187 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4188 OP *newop = newGVOP(type, OPf_REF,
4189 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4196 if (type == OP_FTTTY)
4197 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4200 return newUNOP(type, 0, newDEFSVOP());
4213 int type = o->op_type;
4214 register I32 oa = opargs[type] >> OASHIFT;
4216 if (o->op_flags & OPf_STACKED) {
4217 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4220 return no_fh_allowed(o);
4223 if (o->op_flags & OPf_KIDS) {
4224 tokid = &cLISTOPo->op_first;
4225 kid = cLISTOPo->op_first;
4226 if (kid->op_type == OP_PUSHMARK ||
4227 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4229 tokid = &kid->op_sibling;
4230 kid = kid->op_sibling;
4232 if (!kid && opargs[type] & OA_DEFGV)
4233 *tokid = kid = newDEFSVOP();
4237 sibl = kid->op_sibling;
4251 if (kid->op_type == OP_CONST &&
4252 (kid->op_private & OPpCONST_BARE)) {
4253 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4254 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4255 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4257 warn("Array @%s missing the @ in argument %ld of %s()",
4258 name, (long)numargs, op_desc[type]);
4261 kid->op_sibling = sibl;
4264 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4265 bad_type(numargs, "array", op_desc[o->op_type], kid);
4269 if (kid->op_type == OP_CONST &&
4270 (kid->op_private & OPpCONST_BARE)) {
4271 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4272 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4273 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4275 warn("Hash %%%s missing the %% in argument %ld of %s()",
4276 name, (long)numargs, op_desc[type]);
4279 kid->op_sibling = sibl;
4282 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4283 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4288 OP *newop = newUNOP(OP_NULL, 0, kid);
4289 kid->op_sibling = 0;
4291 newop->op_next = newop;
4293 kid->op_sibling = sibl;
4298 if (kid->op_type != OP_GV) {
4299 if (kid->op_type == OP_CONST &&
4300 (kid->op_private & OPpCONST_BARE)) {
4301 OP *newop = newGVOP(OP_GV, 0,
4302 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4308 kid->op_sibling = 0;
4309 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4311 kid->op_sibling = sibl;
4317 mod(scalar(kid), type);
4321 tokid = &kid->op_sibling;
4322 kid = kid->op_sibling;
4324 o->op_private |= numargs;
4326 return too_many_arguments(o,op_desc[o->op_type]);
4329 else if (opargs[type] & OA_DEFGV) {
4331 return newUNOP(type, 0, newDEFSVOP());
4335 while (oa & OA_OPTIONAL)
4337 if (oa && oa != OA_LIST)
4338 return too_few_arguments(o,op_desc[o->op_type]);
4348 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4349 append_elem(OP_GLOB, o, newDEFSVOP());
4351 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4352 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4354 if (gv && GvIMPORTED_CV(gv)) {
4355 static int glob_index;
4357 append_elem(OP_GLOB, o,
4358 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4359 o->op_type = OP_LIST;
4360 o->op_ppaddr = ppaddr[OP_LIST];
4361 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4362 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4363 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4364 append_elem(OP_LIST, o,
4365 scalar(newUNOP(OP_RV2CV, 0,
4366 newGVOP(OP_GV, 0, gv)))));
4367 o = newUNOP(OP_NULL, 0, ck_subr(o));
4368 o->op_targ = OP_GLOB; /* hint at what it used to be */
4371 gv = newGVgen("main");
4373 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4383 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4385 o->op_ppaddr = ppaddr[OP_GREPSTART];
4386 Newz(1101, gwop, 1, LOGOP);
4388 if (o->op_flags & OPf_STACKED) {
4391 kid = cLISTOPo->op_first->op_sibling;
4392 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4395 kid->op_next = (OP*)gwop;
4396 o->op_flags &= ~OPf_STACKED;
4398 kid = cLISTOPo->op_first->op_sibling;
4399 if (type == OP_MAPWHILE)
4406 kid = cLISTOPo->op_first->op_sibling;
4407 if (kid->op_type != OP_NULL)
4408 croak("panic: ck_grep");
4409 kid = kUNOP->op_first;
4411 gwop->op_type = type;
4412 gwop->op_ppaddr = ppaddr[type];
4413 gwop->op_first = listkids(o);
4414 gwop->op_flags |= OPf_KIDS;
4415 gwop->op_private = 1;
4416 gwop->op_other = LINKLIST(kid);
4417 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4418 kid->op_next = (OP*)gwop;
4420 kid = cLISTOPo->op_first->op_sibling;
4421 if (!kid || !kid->op_sibling)
4422 return too_few_arguments(o,op_desc[o->op_type]);
4423 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4424 mod(kid, OP_GREPSTART);
4432 if (o->op_flags & OPf_KIDS) {
4433 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4434 if (kid && kid->op_type == OP_CONST)
4435 fbm_compile(((SVOP*)kid)->op_sv, 0);
4441 ck_lengthconst(OP *o)
4443 /* XXX length optimization goes here */
4450 OPCODE type = o->op_type;
4451 return modkids(ck_fun(o), type);
4457 OPCODE type = o->op_type;
4458 return refkids(ck_fun(o), type);
4466 kid = cLISTOPo->op_first;
4469 kid = cLISTOPo->op_first;
4471 if (kid->op_type == OP_PUSHMARK)
4472 kid = kid->op_sibling;
4473 if (kid && o->op_flags & OPf_STACKED)
4474 kid = kid->op_sibling;
4475 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4476 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4477 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4478 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4479 cLISTOPo->op_first->op_sibling = kid;
4480 cLISTOPo->op_last = kid;
4481 kid = kid->op_sibling;
4486 append_elem(o->op_type, o, newDEFSVOP());
4492 if (hints & HINT_LOCALE)
4493 o->op_private |= OPpLOCALE;
4500 ck_fun_locale(OP *o)
4506 if (hints & HINT_LOCALE)
4507 o->op_private |= OPpLOCALE;
4518 if (hints & HINT_LOCALE)
4519 o->op_private |= OPpLOCALE;
4528 o->op_private |= OPpRUNTIME;
4541 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4542 o->op_private |= OPpREPEAT_DOLIST;
4543 cBINOPo->op_first = force_list(cBINOPo->op_first);
4553 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4554 SVOP *kid = (SVOP*)cUNOPo->op_first;
4556 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4558 for (s = SvPVX(kid->op_sv); *s; s++) {
4559 if (*s == ':' && s[1] == ':') {
4561 Move(s+2, s+1, strlen(s+2)+1, char);
4562 --SvCUR(kid->op_sv);
4565 sv_catpvn(kid->op_sv, ".pm", 3);
4574 croak("NOT IMPL LINE %d",__LINE__);
4583 if (o->op_flags & OPf_KIDS) {
4584 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4585 if (kid && kid->op_sibling) {
4586 o->op_type = OP_SSELECT;
4587 o->op_ppaddr = ppaddr[OP_SSELECT];
4589 return fold_constants(o);
4593 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4594 if (kid && kid->op_type == OP_RV2GV)
4595 kid->op_private &= ~HINT_STRICT_REFS;
4602 I32 type = o->op_type;
4604 if (!(o->op_flags & OPf_KIDS)) {
4609 if (!CvUNIQUE(compcv)) {
4610 argop = newOP(OP_PADAV, OPf_REF);
4611 argop->op_targ = 0; /* curpad[0] is @_ */
4614 argop = newUNOP(OP_RV2AV, 0,
4615 scalar(newGVOP(OP_GV, 0,
4616 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4619 argop = newUNOP(OP_RV2AV, 0,
4620 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(compcv) ?
4621 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4622 #endif /* USE_THREADS */
4623 return newUNOP(type, 0, scalar(argop));
4625 return scalar(modkids(ck_fun(o), type));
4633 if (hints & HINT_LOCALE)
4634 o->op_private |= OPpLOCALE;
4637 if (o->op_flags & OPf_STACKED) {
4638 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4640 kid = kUNOP->op_first; /* get past rv2gv */
4642 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4644 if (kid->op_type == OP_SCOPE) {
4648 else if (kid->op_type == OP_LEAVE) {
4649 if (o->op_type == OP_SORT) {
4650 null(kid); /* wipe out leave */
4653 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4654 if (k->op_next == kid)
4659 kid->op_next = 0; /* just disconnect the leave */
4660 k = kLISTOP->op_first;
4664 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4665 null(kid); /* wipe out rv2gv */
4666 if (o->op_type == OP_SORT)
4670 o->op_flags |= OPf_SPECIAL;
4682 if (o->op_flags & OPf_STACKED)
4683 return no_fh_allowed(o);
4685 kid = cLISTOPo->op_first;
4686 if (kid->op_type != OP_NULL)
4687 croak("panic: ck_split");
4688 kid = kid->op_sibling;
4689 op_free(cLISTOPo->op_first);
4690 cLISTOPo->op_first = kid;
4692 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4693 cLISTOPo->op_last = kid; /* There was only one element previously */
4696 if (kid->op_type != OP_MATCH) {
4697 OP *sibl = kid->op_sibling;
4698 kid->op_sibling = 0;
4699 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4700 if (cLISTOPo->op_first == cLISTOPo->op_last)
4701 cLISTOPo->op_last = kid;
4702 cLISTOPo->op_first = kid;
4703 kid->op_sibling = sibl;
4706 kid->op_type = OP_PUSHRE;
4707 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4710 if (!kid->op_sibling)
4711 append_elem(OP_SPLIT, o, newDEFSVOP());
4713 kid = kid->op_sibling;
4716 if (!kid->op_sibling)
4717 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4719 kid = kid->op_sibling;
4722 if (kid->op_sibling)
4723 return too_many_arguments(o,op_desc[o->op_type]);
4732 OP *prev = ((cUNOPo->op_first->op_sibling)
4733 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4734 OP *o2 = prev->op_sibling;
4742 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4743 if (cvop->op_type == OP_RV2CV) {
4745 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4746 null(cvop); /* disable rv2cv */
4747 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4748 if (tmpop->op_type == OP_GV) {
4749 cv = GvCVu(tmpop->op_sv);
4750 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4751 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4752 proto = SvPV((SV*)cv, na);
4756 o->op_private |= (hints & HINT_STRICT_REFS);
4757 if (PERLDB_SUB && curstash != debstash)
4758 o->op_private |= OPpENTERSUB_DB;
4759 while (o2 != cvop) {
4763 return too_many_arguments(o, gv_ename(namegv));
4781 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4782 bad_type(arg, "block", gv_ename(namegv), o2);
4787 if (o2->op_type == OP_RV2GV)
4791 OP* sib = kid->op_sibling;
4792 kid->op_sibling = 0;
4793 o2 = newUNOP(OP_RV2GV, 0, kid);
4794 o2->op_sibling = sib;
4795 prev->op_sibling = o2;
4803 if (o2->op_type != OP_RV2GV)
4804 bad_type(arg, "symbol", gv_ename(namegv), o2);
4807 if (o2->op_type != OP_RV2CV)
4808 bad_type(arg, "sub", gv_ename(namegv), o2);
4811 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4812 bad_type(arg, "scalar", gv_ename(namegv), o2);
4815 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4816 bad_type(arg, "array", gv_ename(namegv), o2);
4819 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4820 bad_type(arg, "hash", gv_ename(namegv), o2);
4824 OP* sib = kid->op_sibling;
4825 kid->op_sibling = 0;
4826 o2 = newUNOP(OP_REFGEN, 0, kid);
4827 o2->op_sibling = sib;
4828 prev->op_sibling = o2;
4839 croak("Malformed prototype for %s: %s",
4840 gv_ename(namegv), SvPV((SV*)cv, na));
4845 mod(o2, OP_ENTERSUB);
4847 o2 = o2->op_sibling;
4849 if (proto && !optional &&
4850 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4851 return too_few_arguments(o, gv_ename(namegv));
4858 SvREADONLY_on(cSVOPo->op_sv);
4865 if (o->op_flags & OPf_KIDS) {
4866 SVOP *kid = (SVOP*)cUNOPo->op_first;
4868 if (kid->op_type == OP_NULL)
4869 kid = (SVOP*)kid->op_sibling;
4871 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4872 o->op_flags |= OPf_SPECIAL;
4877 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4880 peep(register OP *o)
4883 register OP* oldop = 0;
4884 if (!o || o->op_seq)
4889 for (; o; o = o->op_next) {
4895 switch (o->op_type) {
4898 curcop = ((COP*)o); /* for warnings */
4899 o->op_seq = op_seqmax++;
4910 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
4912 o->op_seq = op_seqmax++;
4915 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4916 o->op_seq = op_seqmax++;
4917 break; /* Scalar stub must produce undef. List stub is noop */
4921 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4928 if (oldop && o->op_next) {
4929 oldop->op_next = o->op_next;
4932 o->op_seq = op_seqmax++;
4936 if (o->op_next->op_type == OP_RV2SV) {
4937 if (!(o->op_next->op_private & OPpDEREF)) {
4939 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4940 o->op_next = o->op_next->op_next;
4941 o->op_type = OP_GVSV;
4942 o->op_ppaddr = ppaddr[OP_GVSV];
4945 else if (o->op_next->op_type == OP_RV2AV) {
4946 OP* pop = o->op_next->op_next;
4948 if (pop->op_type == OP_CONST &&
4949 (op = pop->op_next) &&
4950 pop->op_next->op_type == OP_AELEM &&
4951 !(pop->op_next->op_private &
4952 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4953 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4957 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4961 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4962 o->op_next = pop->op_next->op_next;
4963 o->op_type = OP_AELEMFAST;
4964 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4965 o->op_private = (U8)i;
4966 GvAVn(((GVOP*)o)->op_gv);
4969 o->op_seq = op_seqmax++;
4973 if (o->op_next->op_type == OP_RV2AV
4974 && (o->op_next->op_flags && OPf_REF))
4977 o->op_next = o->op_next->op_next;
4982 if (o->op_next->op_type == OP_RV2HV
4983 && (o->op_next->op_flags && OPf_REF))
4986 o->op_next = o->op_next->op_next;
4994 o->op_seq = op_seqmax++;
4995 while (cLOGOP->op_other->op_type == OP_NULL)
4996 cLOGOP->op_other = cLOGOP->op_other->op_next;
4997 peep(cLOGOP->op_other);
5001 o->op_seq = op_seqmax++;
5002 peep(cCONDOP->op_true);
5003 peep(cCONDOP->op_false);
5007 o->op_seq = op_seqmax++;
5008 peep(cLOOP->op_redoop);
5009 peep(cLOOP->op_nextop);
5010 peep(cLOOP->op_lastop);
5015 o->op_seq = op_seqmax++;
5016 peep(cPMOP->op_pmreplstart);
5020 o->op_seq = op_seqmax++;
5021 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
5022 if (o->op_next->op_sibling &&
5023 o->op_next->op_sibling->op_type != OP_EXIT &&
5024 o->op_next->op_sibling->op_type != OP_WARN &&
5025 o->op_next->op_sibling->op_type != OP_DIE) {
5026 line_t oldline = curcop->cop_line;
5028 curcop->cop_line = ((COP*)o->op_next)->cop_line;
5029 warn("Statement unlikely to be reached");
5030 warn("(Maybe you meant system() when you said exec()?)\n");
5031 curcop->cop_line = oldline;
5045 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5046 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5048 rop = (UNOP*)((BINOP*)o)->op_first;
5049 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5051 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
5052 if (!SvOBJECT(lexname))
5054 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5055 if (!fields || !GvHV(*fields))
5057 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5058 key = SvPV(*svp, keylen);
5059 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5061 croak("No such field \"%s\" in variable %s of type %s",
5062 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
5064 ind = SvIV(*indsvp);
5066 croak("Bad index while coercing array into hash");
5067 rop->op_type = OP_RV2AV;
5068 rop->op_ppaddr = ppaddr[OP_RV2AV];
5069 o->op_type = OP_AELEM;
5070 o->op_ppaddr = ppaddr[OP_AELEM];
5072 *svp = newSViv(ind);
5077 o->op_seq = op_seqmax++;