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 ((PL_op_mask && PL_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,PL_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 && type != OP_GELEM) {
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(PL_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 (PL_dowarn && AvFILLp(PL_comppad_name) >= 0) {
130 SV **svp = AvARRAY(PL_comppad_name);
131 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
133 && sv != &PL_sv_undef
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);
146 if (PL_in_my_stash) {
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(PL_in_my_stash);
154 av_store(PL_comppad_name, off, sv);
155 SvNVX(sv) = (double)999999999;
156 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
157 if (!PL_min_intro_pending)
158 PL_min_intro_pending = off;
159 PL_max_intro_pending = off;
161 av_store(PL_comppad, off, (SV*)newAV());
162 else if (*name == '%')
163 av_store(PL_comppad, off, (SV*)newHV());
164 SvPADMY_on(PL_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 == &PL_sv_undef)
187 svp = AvARRAY(curname);
188 for (off = AvFILLp(curname); off > 0; off--) {
189 if ((sv = svp[off]) &&
190 sv != &PL_sv_undef &&
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(PL_comppad_name, newoff, namesv);
216 SvNVX(namesv) = (double)PL_curcop->cop_seq;
217 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
218 SvFAKE_on(namesv); /* A ref, not a real var */
219 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
220 /* "It's closures all the way down." */
221 CvCLONE_on(PL_compcv);
223 if (CvANON(PL_compcv))
224 oldsv = Nullsv; /* no need to keep ref */
229 bcv && bcv != cv && !CvCLONE(bcv);
230 bcv = CvOUTSIDE(bcv)) {
234 if (PL_dowarn && !CvUNIQUE(cv))
236 "Variable \"%s\" may be unavailable",
243 else if (!CvUNIQUE(PL_compcv)) {
244 if (PL_dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
245 warn("Variable \"%s\" will not stay shared", name);
248 av_store(PL_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, PL_main_cv, 0);
270 switch (cx->blk_eval.old_op_type) {
275 /* require must have its own scope */
283 if (PL_debstash && CvSTASH(cv) == PL_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(PL_comppad_name);
303 U32 seq = PL_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(PL_comppad_name); off > 0; off--) {
320 if ((sv = svp[off]) &&
321 sv != &PL_sv_undef &&
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(PL_compcv), cxstack_ix);
336 /* If there is a pending local definition, this new alias must die */
338 SvIVX(AvARRAY(PL_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(PL_comppad_name);
350 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
351 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
352 if ((sv = svp[off]) && sv != &PL_sv_undef)
353 warn("%s never introduced", SvPVX(sv));
356 /* "Deintroduce" my variables that are leaving with this scope. */
357 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
358 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == 999999999)
359 SvIVX(sv) = PL_cop_seqmax;
364 pad_alloc(I32 optype, U32 tmptype)
370 if (AvARRAY(PL_comppad) != PL_curpad)
371 croak("panic: pad_alloc");
372 if (PL_pad_reset_pending)
374 if (tmptype & SVs_PADMY) {
376 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
377 } while (SvPADBUSY(sv)); /* need a fresh one */
378 retval = AvFILLp(PL_comppad);
381 SV **names = AvARRAY(PL_comppad_name);
382 SSize_t names_fill = AvFILLp(PL_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 (++PL_padix <= names_fill &&
390 (sv = names[PL_padix]) && sv != &PL_sv_undef)
392 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
393 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
398 SvFLAGS(sv) |= tmptype;
399 PL_curpad = AvARRAY(PL_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) PL_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) PL_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) PL_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) PL_curpad, po));
424 #endif /* USE_THREADS */
425 return PL_curpad[po]; /* eventually we'll turn this into a macro */
429 pad_free(PADOFFSET po)
434 if (AvARRAY(PL_comppad) != PL_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) PL_curpad, po));
442 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
443 (unsigned long) PL_curpad, po));
444 #endif /* USE_THREADS */
445 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
446 SvPADTMP_off(PL_curpad[po]);
447 if ((I32)po < PL_padix)
452 pad_swipe(PADOFFSET po)
455 if (AvARRAY(PL_comppad) != PL_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) PL_curpad, po));
463 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
464 (unsigned long) PL_curpad, po));
465 #endif /* USE_THREADS */
466 SvPADTMP_off(PL_curpad[po]);
467 PL_curpad[po] = NEWSV(1107,0);
468 SvPADTMP_on(PL_curpad[po]);
469 if ((I32)po < PL_padix)
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(PL_comppad) != PL_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) PL_curpad));
492 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
493 (unsigned long) PL_curpad));
494 #endif /* USE_THREADS */
495 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
496 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
497 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
498 SvPADTMP_off(PL_curpad[po]);
500 PL_padix = PL_padix_floor;
503 PL_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(PL_threadsv_names, *name);
519 key = p - PL_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);
540 PL_sawampersand = TRUE;
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_S(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 if (!(o->op_flags & OPf_SPECIAL))
590 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
592 #endif /* USE_THREADS */
594 if (!(o->op_flags & OPf_REF)
595 || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
601 SvREFCNT_dec(cGVOPo->op_gv);
605 Safefree(cCOPo->cop_label);
606 SvREFCNT_dec(cCOPo->cop_filegv);
609 SvREFCNT_dec(cSVOPo->op_sv);
615 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
619 Safefree(cPVOPo->op_pv);
622 op_free(cPMOPo->op_pmreplroot);
627 ReREFCNT_dec(cPMOPo->op_pmregexp);
632 pad_free(o->op_targ);
640 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
641 pad_free(o->op_targ);
642 o->op_targ = o->op_type;
643 o->op_type = OP_NULL;
644 o->op_ppaddr = ppaddr[OP_NULL];
647 /* Contextualizers */
649 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
659 /* establish postfix order */
660 if (cUNOPo->op_first) {
661 o->op_next = LINKLIST(cUNOPo->op_first);
662 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
664 kid->op_next = LINKLIST(kid->op_sibling);
679 if (o && o->op_flags & OPf_KIDS) {
680 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
690 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
692 line_t oldline = PL_curcop->cop_line;
694 if (PL_copline != NOLINE)
695 PL_curcop->cop_line = PL_copline;
696 warn("Found = in conditional, should be ==");
697 PL_curcop->cop_line = oldline;
707 /* assumes no premature commitment */
708 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
709 || o->op_type == OP_RETURN)
712 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
714 switch (o->op_type) {
716 if (o->op_private & OPpREPEAT_DOLIST)
717 null(((LISTOP*)cBINOPo->op_first)->op_first);
718 scalar(cBINOPo->op_first);
723 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
727 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
728 if (!kPMOP->op_pmreplroot)
729 deprecate("implicit split to @_");
737 if (o->op_flags & OPf_KIDS) {
738 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
744 kid = cLISTOPo->op_first;
746 while (kid = kid->op_sibling) {
752 WITH_THR(PL_curcop = &PL_compiling);
757 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
763 WITH_THR(PL_curcop = &PL_compiling);
776 /* assumes no premature commitment */
777 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || PL_error_count
778 || o->op_type == OP_RETURN)
781 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
783 switch (o->op_type) {
785 if (!(opargs[o->op_type] & OA_FOLDCONST))
789 if (o->op_flags & OPf_STACKED)
793 if (o->op_private == 4)
864 if (!(o->op_private & OPpLVAL_INTRO))
865 useless = op_desc[o->op_type];
872 if (!(o->op_private & OPpLVAL_INTRO) &&
873 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
874 useless = "a variable";
879 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
885 useless = "a constant";
886 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
888 else if (SvPOK(sv)) {
889 if (strnEQ(SvPVX(sv), "di", 2) ||
890 strnEQ(SvPVX(sv), "ds", 2) ||
891 strnEQ(SvPVX(sv), "ig", 2))
895 null(o); /* don't execute a constant */
896 SvREFCNT_dec(sv); /* don't even remember it */
900 o->op_type = OP_PREINC; /* pre-increment is faster */
901 o->op_ppaddr = ppaddr[OP_PREINC];
905 o->op_type = OP_PREDEC; /* pre-decrement is faster */
906 o->op_ppaddr = ppaddr[OP_PREDEC];
912 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
917 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
918 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
919 if (o->op_flags & OPf_STACKED)
925 if (!(o->op_flags & OPf_KIDS))
934 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
941 /* all requires must return a boolean value */
942 o->op_flags &= ~OPf_WANT;
945 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
946 if (!kPMOP->op_pmreplroot)
947 deprecate("implicit split to @_");
951 if (useless && PL_dowarn)
952 warn("Useless use of %s in void context", useless);
960 if (o && o->op_flags & OPf_KIDS) {
961 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
972 /* assumes no premature commitment */
973 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
974 || o->op_type == OP_RETURN)
977 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
979 switch (o->op_type) {
982 list(cBINOPo->op_first);
987 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
995 if (!(o->op_flags & OPf_KIDS))
997 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
998 list(cBINOPo->op_first);
999 return gen_constant_list(o);
1006 kid = cLISTOPo->op_first;
1008 while (kid = kid->op_sibling) {
1009 if (kid->op_sibling)
1014 WITH_THR(PL_curcop = &PL_compiling);
1018 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1019 if (kid->op_sibling)
1024 WITH_THR(PL_curcop = &PL_compiling);
1027 /* all requires must return a boolean value */
1028 o->op_flags &= ~OPf_WANT;
1040 if (o->op_type == OP_LINESEQ ||
1041 o->op_type == OP_SCOPE ||
1042 o->op_type == OP_LEAVE ||
1043 o->op_type == OP_LEAVETRY)
1046 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1047 if (kid->op_sibling) {
1051 PL_curcop = &PL_compiling;
1053 o->op_flags &= ~OPf_PARENS;
1054 if (PL_hints & HINT_BLOCK_SCOPE)
1055 o->op_flags |= OPf_PARENS;
1058 o = newOP(OP_STUB, 0);
1063 modkids(OP *o, I32 type)
1066 if (o && o->op_flags & OPf_KIDS) {
1067 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1074 mod(OP *o, I32 type)
1080 if (!o || PL_error_count)
1083 switch (o->op_type) {
1088 if (!(o->op_private & (OPpCONST_ARYBASE)))
1090 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1091 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1095 SAVEI32(PL_compiling.cop_arybase);
1096 PL_compiling.cop_arybase = 0;
1098 else if (type == OP_REFGEN)
1101 croak("That use of $[ is unsupported");
1104 if (o->op_flags & OPf_PARENS)
1108 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1109 !(o->op_flags & OPf_STACKED)) {
1110 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1111 o->op_ppaddr = ppaddr[OP_RV2CV];
1112 assert(cUNOPo->op_first->op_type == OP_NULL);
1113 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1119 /* grep, foreach, subcalls, refgen */
1120 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1122 yyerror(form("Can't modify %s in %s",
1123 op_desc[o->op_type],
1124 type ? op_desc[type] : "local"));
1138 case OP_RIGHT_SHIFT:
1147 if (!(o->op_flags & OPf_STACKED))
1153 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1159 if (!type && cUNOPo->op_first->op_type != OP_GV)
1160 croak("Can't localize through a reference");
1161 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1162 PL_modcount = 10000;
1163 return o; /* Treat \(@foo) like ordinary list. */
1167 if (scalar_mod_type(o, type))
1169 ref(cUNOPo->op_first, o->op_type);
1178 PL_modcount = 10000;
1181 if (!type && cUNOPo->op_first->op_type != OP_GV)
1182 croak("Can't localize through a reference");
1183 ref(cUNOPo->op_first, o->op_type);
1187 PL_hints |= HINT_BLOCK_SCOPE;
1195 PL_modcount = 10000;
1196 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1197 return o; /* Treat \(@foo) like ordinary list. */
1198 if (scalar_mod_type(o, type))
1204 croak("Can't localize lexical variable %s",
1205 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), PL_na));
1210 PL_modcount++; /* XXX ??? */
1212 #endif /* USE_THREADS */
1218 if (type != OP_SASSIGN)
1222 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1228 pad_free(o->op_targ);
1229 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1230 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1231 if (o->op_flags & OPf_KIDS)
1232 mod(cBINOPo->op_first->op_sibling, type);
1237 ref(cBINOPo->op_first, o->op_type);
1238 if (type == OP_ENTERSUB &&
1239 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1240 o->op_private |= OPpLVAL_DEFER;
1247 if (o->op_flags & OPf_KIDS)
1248 mod(cLISTOPo->op_last, type);
1252 if (!(o->op_flags & OPf_KIDS))
1254 if (o->op_targ != OP_LIST) {
1255 mod(cBINOPo->op_first, type);
1260 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1264 o->op_flags |= OPf_MOD;
1266 if (type == OP_AASSIGN || type == OP_SASSIGN)
1267 o->op_flags |= OPf_SPECIAL|OPf_REF;
1269 o->op_private |= OPpLVAL_INTRO;
1270 o->op_flags &= ~OPf_SPECIAL;
1271 PL_hints |= HINT_BLOCK_SCOPE;
1273 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1274 o->op_flags |= OPf_REF;
1279 scalar_mod_type(OP *o, I32 type)
1283 if (o->op_type == OP_RV2GV)
1307 case OP_RIGHT_SHIFT:
1317 case OP_ANDASSIGN: /* may work later */
1318 case OP_ORASSIGN: /* may work later */
1326 refkids(OP *o, I32 type)
1329 if (o && o->op_flags & OPf_KIDS) {
1330 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1337 ref(OP *o, I32 type)
1341 if (!o || PL_error_count)
1344 switch (o->op_type) {
1346 if ((type == OP_DEFINED || type == OP_LOCK) &&
1347 !(o->op_flags & OPf_STACKED)) {
1348 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1349 o->op_ppaddr = ppaddr[OP_RV2CV];
1350 assert(cUNOPo->op_first->op_type == OP_NULL);
1351 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1352 o->op_flags |= OPf_SPECIAL;
1357 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1361 ref(cUNOPo->op_first, o->op_type);
1364 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1365 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1366 : type == OP_RV2HV ? OPpDEREF_HV
1368 o->op_flags |= OPf_MOD;
1373 o->op_flags |= OPf_MOD; /* XXX ??? */
1378 o->op_flags |= OPf_REF;
1381 ref(cUNOPo->op_first, o->op_type);
1386 o->op_flags |= OPf_REF;
1391 if (!(o->op_flags & OPf_KIDS))
1393 ref(cBINOPo->op_first, type);
1397 ref(cBINOPo->op_first, o->op_type);
1398 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1399 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1400 : type == OP_RV2HV ? OPpDEREF_HV
1402 o->op_flags |= OPf_MOD;
1410 if (!(o->op_flags & OPf_KIDS))
1412 ref(cLISTOPo->op_last, type);
1427 if (!o || PL_error_count)
1431 if (type == OP_LIST) {
1432 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1434 } else if (type == OP_UNDEF) {
1436 } else if (type != OP_PADSV &&
1439 type != OP_PUSHMARK)
1441 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1444 o->op_flags |= OPf_MOD;
1445 o->op_private |= OPpLVAL_INTRO;
1453 o->op_flags |= OPf_PARENS;
1458 bind_match(I32 type, OP *left, OP *right)
1463 (left->op_type == OP_RV2AV ||
1464 left->op_type == OP_RV2HV ||
1465 left->op_type == OP_PADAV ||
1466 left->op_type == OP_PADHV)) {
1467 char *desc = op_desc[(right->op_type == OP_SUBST ||
1468 right->op_type == OP_TRANS)
1469 ? right->op_type : OP_MATCH];
1470 char *sample = ((left->op_type == OP_RV2AV ||
1471 left->op_type == OP_PADAV)
1472 ? "@array" : "%hash");
1473 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1476 if (right->op_type == OP_MATCH ||
1477 right->op_type == OP_SUBST ||
1478 right->op_type == OP_TRANS) {
1479 right->op_flags |= OPf_STACKED;
1480 if (right->op_type != OP_MATCH)
1481 left = mod(left, right->op_type);
1482 if (right->op_type == OP_TRANS)
1483 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1485 o = prepend_elem(right->op_type, scalar(left), right);
1487 return newUNOP(OP_NOT, 0, scalar(o));
1491 return bind_match(type, left,
1492 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1500 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1501 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1508 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1509 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1510 o->op_type = OP_LEAVE;
1511 o->op_ppaddr = ppaddr[OP_LEAVE];
1514 if (o->op_type == OP_LINESEQ) {
1516 o->op_type = OP_SCOPE;
1517 o->op_ppaddr = ppaddr[OP_SCOPE];
1518 kid = ((LISTOP*)o)->op_first;
1519 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1520 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1525 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1535 SAVESPTR(GvHV(PL_hintgv));
1536 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1537 SAVEFREESV(GvHV(PL_hintgv));
1541 block_start(int full)
1544 int retval = PL_savestack_ix;
1546 SAVEI32(PL_comppad_name_floor);
1548 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1549 PL_comppad_name_floor = PL_comppad_name_fill;
1551 PL_comppad_name_floor = 0;
1553 SAVEI32(PL_min_intro_pending);
1554 SAVEI32(PL_max_intro_pending);
1555 PL_min_intro_pending = 0;
1556 SAVEI32(PL_comppad_name_fill);
1557 SAVEI32(PL_padix_floor);
1558 PL_padix_floor = PL_padix;
1559 PL_pad_reset_pending = FALSE;
1561 PL_hints &= ~HINT_BLOCK_SCOPE;
1566 block_end(I32 floor, OP *seq)
1569 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1570 OP* retval = scalarseq(seq);
1572 PL_pad_reset_pending = FALSE;
1574 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1575 pad_leavemy(PL_comppad_name_fill);
1584 OP *o = newOP(OP_THREADSV, 0);
1585 o->op_targ = find_threadsv("_");
1588 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1589 #endif /* USE_THREADS */
1597 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1598 PL_eval_start = linklist(PL_eval_root);
1599 PL_eval_root->op_next = 0;
1600 peep(PL_eval_start);
1605 PL_main_root = scope(sawparens(scalarvoid(o)));
1606 PL_curcop = &PL_compiling;
1607 PL_main_start = LINKLIST(PL_main_root);
1608 PL_main_root->op_next = 0;
1609 peep(PL_main_start);
1612 /* Register with debugger */
1614 CV *cv = perl_get_cv("DB::postponed", FALSE);
1618 XPUSHs((SV*)PL_compiling.cop_filegv);
1620 perl_call_sv((SV*)cv, G_DISCARD);
1627 localize(OP *o, I32 lex)
1629 if (o->op_flags & OPf_PARENS)
1632 if (PL_dowarn && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1634 for (s = PL_bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1635 if (*s == ';' || *s == '=')
1636 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1640 PL_in_my_stash = Nullhv;
1644 return mod(o, OP_NULL); /* a bit kludgey */
1650 if (o->op_type == OP_LIST) {
1653 o2 = newOP(OP_THREADSV, 0);
1654 o2->op_targ = find_threadsv(";");
1656 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1657 #endif /* USE_THREADS */
1658 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1664 fold_constants(register OP *o)
1668 I32 type = o->op_type;
1671 if (opargs[type] & OA_RETSCALAR)
1673 if (opargs[type] & OA_TARGET)
1674 o->op_targ = pad_alloc(type, SVs_PADTMP);
1676 if ((opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1677 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1679 if (!(opargs[type] & OA_FOLDCONST))
1694 if (o->op_private & OPpLOCALE)
1699 goto nope; /* Don't try to run w/ errors */
1701 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1702 if (curop->op_type != OP_CONST &&
1703 curop->op_type != OP_LIST &&
1704 curop->op_type != OP_SCALAR &&
1705 curop->op_type != OP_NULL &&
1706 curop->op_type != OP_PUSHMARK) {
1711 curop = LINKLIST(o);
1715 sv = *(PL_stack_sp--);
1716 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1717 pad_swipe(o->op_targ);
1718 else if (SvTEMP(sv)) { /* grab mortal temp? */
1719 (void)SvREFCNT_inc(sv);
1723 if (type == OP_RV2GV)
1724 return newGVOP(OP_GV, 0, (GV*)sv);
1726 /* try to smush double to int, but don't smush -2.0 to -2 */
1727 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1731 if ((double)iv == SvNV(sv)) {
1736 SvIOK_off(sv); /* undo SvIV() damage */
1738 return newSVOP(OP_CONST, 0, sv);
1742 if (!(opargs[type] & OA_OTHERINT))
1745 if (!(PL_hints & HINT_INTEGER)) {
1746 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1749 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1750 if (curop->op_type == OP_CONST) {
1751 if (SvIOK(((SVOP*)curop)->op_sv))
1755 if (opargs[curop->op_type] & OA_RETINTEGER)
1759 o->op_ppaddr = ppaddr[++(o->op_type)];
1766 gen_constant_list(register OP *o)
1770 I32 oldtmps_floor = PL_tmps_floor;
1774 return o; /* Don't attempt to run with errors */
1776 PL_op = curop = LINKLIST(o);
1782 PL_tmps_floor = oldtmps_floor;
1784 o->op_type = OP_RV2AV;
1785 o->op_ppaddr = ppaddr[OP_RV2AV];
1786 curop = ((UNOP*)o)->op_first;
1787 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1794 convert(I32 type, I32 flags, OP *o)
1799 if (!o || o->op_type != OP_LIST)
1800 o = newLISTOP(OP_LIST, 0, o, Nullop);
1802 o->op_flags &= ~OPf_WANT;
1804 if (!(opargs[type] & OA_MARK))
1805 null(cLISTOPo->op_first);
1808 o->op_ppaddr = ppaddr[type];
1809 o->op_flags |= flags;
1811 o = CHECKOP(type, o);
1812 if (o->op_type != type)
1815 if (cLISTOPo->op_children < 7) {
1816 /* XXX do we really need to do this if we're done appending?? */
1817 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1819 cLISTOPo->op_last = last; /* in case check substituted last arg */
1822 return fold_constants(o);
1825 /* List constructors */
1828 append_elem(I32 type, OP *first, OP *last)
1836 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1837 return newLISTOP(type, 0, first, last);
1839 if (first->op_flags & OPf_KIDS)
1840 ((LISTOP*)first)->op_last->op_sibling = last;
1842 first->op_flags |= OPf_KIDS;
1843 ((LISTOP*)first)->op_first = last;
1845 ((LISTOP*)first)->op_last = last;
1846 ((LISTOP*)first)->op_children++;
1851 append_list(I32 type, LISTOP *first, LISTOP *last)
1859 if (first->op_type != type)
1860 return prepend_elem(type, (OP*)first, (OP*)last);
1862 if (last->op_type != type)
1863 return append_elem(type, (OP*)first, (OP*)last);
1865 first->op_last->op_sibling = last->op_first;
1866 first->op_last = last->op_last;
1867 first->op_children += last->op_children;
1868 if (first->op_children)
1869 last->op_flags |= OPf_KIDS;
1876 prepend_elem(I32 type, OP *first, OP *last)
1884 if (last->op_type == type) {
1885 if (type == OP_LIST) { /* already a PUSHMARK there */
1886 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1887 ((LISTOP*)last)->op_first->op_sibling = first;
1890 if (!(last->op_flags & OPf_KIDS)) {
1891 ((LISTOP*)last)->op_last = first;
1892 last->op_flags |= OPf_KIDS;
1894 first->op_sibling = ((LISTOP*)last)->op_first;
1895 ((LISTOP*)last)->op_first = first;
1897 ((LISTOP*)last)->op_children++;
1901 return newLISTOP(type, 0, first, last);
1909 return newOP(OP_STUB, 0);
1915 if (!o || o->op_type != OP_LIST)
1916 o = newLISTOP(OP_LIST, 0, o, Nullop);
1922 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1926 Newz(1101, listop, 1, LISTOP);
1928 listop->op_type = type;
1929 listop->op_ppaddr = ppaddr[type];
1930 listop->op_children = (first != 0) + (last != 0);
1931 listop->op_flags = flags;
1935 else if (!first && last)
1938 first->op_sibling = last;
1939 listop->op_first = first;
1940 listop->op_last = last;
1941 if (type == OP_LIST) {
1943 pushop = newOP(OP_PUSHMARK, 0);
1944 pushop->op_sibling = first;
1945 listop->op_first = pushop;
1946 listop->op_flags |= OPf_KIDS;
1948 listop->op_last = pushop;
1950 else if (listop->op_children)
1951 listop->op_flags |= OPf_KIDS;
1957 newOP(I32 type, I32 flags)
1960 Newz(1101, o, 1, OP);
1962 o->op_ppaddr = ppaddr[type];
1963 o->op_flags = flags;
1966 o->op_private = 0 + (flags >> 8);
1967 if (opargs[type] & OA_RETSCALAR)
1969 if (opargs[type] & OA_TARGET)
1970 o->op_targ = pad_alloc(type, SVs_PADTMP);
1971 return CHECKOP(type, o);
1975 newUNOP(I32 type, I32 flags, OP *first)
1980 first = newOP(OP_STUB, 0);
1981 if (opargs[type] & OA_MARK)
1982 first = force_list(first);
1984 Newz(1101, unop, 1, UNOP);
1985 unop->op_type = type;
1986 unop->op_ppaddr = ppaddr[type];
1987 unop->op_first = first;
1988 unop->op_flags = flags | OPf_KIDS;
1989 unop->op_private = 1 | (flags >> 8);
1990 unop = (UNOP*) CHECKOP(type, unop);
1994 return fold_constants((OP *) unop);
1998 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2001 Newz(1101, binop, 1, BINOP);
2004 first = newOP(OP_NULL, 0);
2006 binop->op_type = type;
2007 binop->op_ppaddr = ppaddr[type];
2008 binop->op_first = first;
2009 binop->op_flags = flags | OPf_KIDS;
2012 binop->op_private = 1 | (flags >> 8);
2015 binop->op_private = 2 | (flags >> 8);
2016 first->op_sibling = last;
2019 binop = (BINOP*)CHECKOP(type, binop);
2023 binop->op_last = last = binop->op_first->op_sibling;
2025 return fold_constants((OP *)binop);
2029 pmtrans(OP *o, OP *expr, OP *repl)
2031 SV *tstr = ((SVOP*)expr)->op_sv;
2032 SV *rstr = ((SVOP*)repl)->op_sv;
2035 register U8 *t = (U8*)SvPV(tstr, tlen);
2036 register U8 *r = (U8*)SvPV(rstr, rlen);
2042 register short *tbl;
2044 tbl = (short*)cPVOPo->op_pv;
2045 complement = o->op_private & OPpTRANS_COMPLEMENT;
2046 Delete = o->op_private & OPpTRANS_DELETE;
2047 squash = o->op_private & OPpTRANS_SQUASH;
2050 Zero(tbl, 256, short);
2051 for (i = 0; i < tlen; i++)
2053 for (i = 0, j = 0; i < 256; i++) {
2069 if (!rlen && !Delete) {
2072 o->op_private |= OPpTRANS_COUNTONLY;
2074 for (i = 0; i < 256; i++)
2076 for (i = 0, j = 0; i < tlen; i++,j++) {
2079 if (tbl[t[i]] == -1)
2085 if (tbl[t[i]] == -1)
2096 newPMOP(I32 type, I32 flags)
2101 Newz(1101, pmop, 1, PMOP);
2102 pmop->op_type = type;
2103 pmop->op_ppaddr = ppaddr[type];
2104 pmop->op_flags = flags;
2105 pmop->op_private = 0 | (flags >> 8);
2107 if (PL_hints & HINT_RE_TAINT)
2108 pmop->op_pmpermflags |= PMf_RETAINT;
2109 if (PL_hints & HINT_LOCALE)
2110 pmop->op_pmpermflags |= PMf_LOCALE;
2111 pmop->op_pmflags = pmop->op_pmpermflags;
2113 /* link into pm list */
2114 if (type != OP_TRANS && PL_curstash) {
2115 pmop->op_pmnext = HvPMROOT(PL_curstash);
2116 HvPMROOT(PL_curstash) = pmop;
2123 pmruntime(OP *o, OP *expr, OP *repl)
2128 I32 repl_has_vars = 0;
2130 if (o->op_type == OP_TRANS)
2131 return pmtrans(o, expr, repl);
2133 PL_hints |= HINT_BLOCK_SCOPE;
2136 if (expr->op_type == OP_CONST) {
2138 SV *pat = ((SVOP*)expr)->op_sv;
2139 char *p = SvPV(pat, plen);
2140 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2141 sv_setpvn(pat, "\\s+", 3);
2142 p = SvPV(pat, plen);
2143 pm->op_pmflags |= PMf_SKIPWHITE;
2145 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2146 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2147 pm->op_pmflags |= PMf_WHITE;
2151 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2152 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2154 : OP_REGCMAYBE),0,expr);
2156 Newz(1101, rcop, 1, LOGOP);
2157 rcop->op_type = OP_REGCOMP;
2158 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2159 rcop->op_first = scalar(expr);
2160 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2161 ? (OPf_SPECIAL | OPf_KIDS)
2163 rcop->op_private = 1;
2166 /* establish postfix order */
2167 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2169 rcop->op_next = expr;
2170 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2173 rcop->op_next = LINKLIST(expr);
2174 expr->op_next = (OP*)rcop;
2177 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2182 if (pm->op_pmflags & PMf_EVAL)
2185 else if (repl->op_type == OP_THREADSV
2186 && strchr("&`'123456789+",
2187 PL_threadsv_names[repl->op_targ]))
2191 #endif /* USE_THREADS */
2192 else if (repl->op_type == OP_CONST)
2196 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2197 if (opargs[curop->op_type] & OA_DANGEROUS) {
2199 if (curop->op_type == OP_THREADSV) {
2201 if (strchr("&`'123456789+", curop->op_private))
2205 if (curop->op_type == OP_GV) {
2206 GV *gv = ((GVOP*)curop)->op_gv;
2208 if (strchr("&`'123456789+", *GvENAME(gv)))
2211 #endif /* USE_THREADS */
2212 else if (curop->op_type == OP_RV2CV)
2214 else if (curop->op_type == OP_RV2SV ||
2215 curop->op_type == OP_RV2AV ||
2216 curop->op_type == OP_RV2HV ||
2217 curop->op_type == OP_RV2GV) {
2218 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2221 else if (curop->op_type == OP_PADSV ||
2222 curop->op_type == OP_PADAV ||
2223 curop->op_type == OP_PADHV ||
2224 curop->op_type == OP_PADANY) {
2227 else if (curop->op_type == OP_PUSHRE)
2228 ; /* Okay here, dangerous in newASSIGNOP */
2237 && (!pm->op_pmregexp
2238 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2239 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2240 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2241 prepend_elem(o->op_type, scalar(repl), o);
2244 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2245 pm->op_pmflags |= PMf_MAYBE_CONST;
2246 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2248 Newz(1101, rcop, 1, LOGOP);
2249 rcop->op_type = OP_SUBSTCONT;
2250 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2251 rcop->op_first = scalar(repl);
2252 rcop->op_flags |= OPf_KIDS;
2253 rcop->op_private = 1;
2256 /* establish postfix order */
2257 rcop->op_next = LINKLIST(repl);
2258 repl->op_next = (OP*)rcop;
2260 pm->op_pmreplroot = scalar((OP*)rcop);
2261 pm->op_pmreplstart = LINKLIST(rcop);
2270 newSVOP(I32 type, I32 flags, SV *sv)
2273 Newz(1101, svop, 1, SVOP);
2274 svop->op_type = type;
2275 svop->op_ppaddr = ppaddr[type];
2277 svop->op_next = (OP*)svop;
2278 svop->op_flags = flags;
2279 if (opargs[type] & OA_RETSCALAR)
2281 if (opargs[type] & OA_TARGET)
2282 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2283 return CHECKOP(type, svop);
2287 newGVOP(I32 type, I32 flags, GV *gv)
2291 Newz(1101, gvop, 1, GVOP);
2292 gvop->op_type = type;
2293 gvop->op_ppaddr = ppaddr[type];
2294 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2295 gvop->op_next = (OP*)gvop;
2296 gvop->op_flags = flags;
2297 if (opargs[type] & OA_RETSCALAR)
2299 if (opargs[type] & OA_TARGET)
2300 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2301 return CHECKOP(type, gvop);
2305 newPVOP(I32 type, I32 flags, char *pv)
2308 Newz(1101, pvop, 1, PVOP);
2309 pvop->op_type = type;
2310 pvop->op_ppaddr = ppaddr[type];
2312 pvop->op_next = (OP*)pvop;
2313 pvop->op_flags = flags;
2314 if (opargs[type] & OA_RETSCALAR)
2316 if (opargs[type] & OA_TARGET)
2317 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2318 return CHECKOP(type, pvop);
2327 save_hptr(&PL_curstash);
2328 save_item(PL_curstname);
2333 name = SvPV(sv, len);
2334 PL_curstash = gv_stashpvn(name,len,TRUE);
2335 sv_setpvn(PL_curstname, name, len);
2339 sv_setpv(PL_curstname,"<none>");
2340 PL_curstash = Nullhv;
2342 PL_copline = NOLINE;
2347 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2355 if (id->op_type != OP_CONST)
2356 croak("Module name must be constant");
2360 if(version != Nullop) {
2361 SV *vesv = ((SVOP*)version)->op_sv;
2363 if (arg == Nullop && !SvNIOK(vesv)) {
2370 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2371 croak("Version number must be constant number");
2373 /* Make copy of id so we don't free it twice */
2374 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2376 /* Fake up a method call to VERSION */
2377 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2378 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2379 append_elem(OP_LIST,
2380 prepend_elem(OP_LIST, pack, list(version)),
2381 newUNOP(OP_METHOD, 0, meth)));
2385 /* Fake up an import/unimport */
2386 if (arg && arg->op_type == OP_STUB)
2387 imop = arg; /* no import on explicit () */
2388 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2389 imop = Nullop; /* use 5.0; */
2392 /* Make copy of id so we don't free it twice */
2393 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2394 meth = newSVOP(OP_CONST, 0,
2396 ? newSVpv("import", 6)
2397 : newSVpv("unimport", 8)
2399 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2400 append_elem(OP_LIST,
2401 prepend_elem(OP_LIST, pack, list(arg)),
2402 newUNOP(OP_METHOD, 0, meth)));
2405 /* Fake up a require */
2406 rqop = newUNOP(OP_REQUIRE, 0, id);
2408 /* Fake up the BEGIN {}, which does its thing immediately. */
2410 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2412 append_elem(OP_LINESEQ,
2413 append_elem(OP_LINESEQ,
2414 newSTATEOP(0, Nullch, rqop),
2415 newSTATEOP(0, Nullch, veop)),
2416 newSTATEOP(0, Nullch, imop) ));
2418 PL_copline = NOLINE;
2423 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2425 return newBINOP(OP_LSLICE, flags,
2426 list(force_list(subscript)),
2427 list(force_list(listval)) );
2431 list_assignment(register OP *o)
2436 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2437 o = cUNOPo->op_first;
2439 if (o->op_type == OP_COND_EXPR) {
2440 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2441 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2446 yyerror("Assignment to both a list and a scalar");
2450 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2451 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2452 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2455 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2458 if (o->op_type == OP_RV2SV)
2465 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2470 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2471 return newLOGOP(optype, 0,
2472 mod(scalar(left), optype),
2473 newUNOP(OP_SASSIGN, 0, scalar(right)));
2476 return newBINOP(optype, OPf_STACKED,
2477 mod(scalar(left), optype), scalar(right));
2481 if (list_assignment(left)) {
2484 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2485 left = mod(left, OP_AASSIGN);
2493 o = newBINOP(OP_AASSIGN, flags,
2494 list(force_list(right)),
2495 list(force_list(left)) );
2496 o->op_private = 0 | (flags >> 8);
2497 if (!(left->op_private & OPpLVAL_INTRO)) {
2501 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2502 if (opargs[curop->op_type] & OA_DANGEROUS) {
2503 if (curop->op_type == OP_GV) {
2504 GV *gv = ((GVOP*)curop)->op_gv;
2505 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2507 SvCUR(gv) = PL_generation;
2509 else if (curop->op_type == OP_PADSV ||
2510 curop->op_type == OP_PADAV ||
2511 curop->op_type == OP_PADHV ||
2512 curop->op_type == OP_PADANY) {
2513 SV **svp = AvARRAY(PL_comppad_name);
2514 SV *sv = svp[curop->op_targ];
2515 if (SvCUR(sv) == PL_generation)
2517 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2519 else if (curop->op_type == OP_RV2CV)
2521 else if (curop->op_type == OP_RV2SV ||
2522 curop->op_type == OP_RV2AV ||
2523 curop->op_type == OP_RV2HV ||
2524 curop->op_type == OP_RV2GV) {
2525 if (lastop->op_type != OP_GV) /* funny deref? */
2528 else if (curop->op_type == OP_PUSHRE) {
2529 if (((PMOP*)curop)->op_pmreplroot) {
2530 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2531 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2533 SvCUR(gv) = PL_generation;
2542 o->op_private = OPpASSIGN_COMMON;
2544 if (right && right->op_type == OP_SPLIT) {
2546 if ((tmpop = ((LISTOP*)right)->op_first) &&
2547 tmpop->op_type == OP_PUSHRE)
2549 PMOP *pm = (PMOP*)tmpop;
2550 if (left->op_type == OP_RV2AV &&
2551 !(left->op_private & OPpLVAL_INTRO) &&
2552 !(o->op_private & OPpASSIGN_COMMON) )
2554 tmpop = ((UNOP*)left)->op_first;
2555 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2556 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2557 pm->op_pmflags |= PMf_ONCE;
2558 tmpop = cUNOPo->op_first; /* to list (nulled) */
2559 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2560 tmpop->op_sibling = Nullop; /* don't free split */
2561 right->op_next = tmpop->op_next; /* fix starting loc */
2562 op_free(o); /* blow off assign */
2563 right->op_flags &= ~OPf_WANT;
2564 /* "I don't know and I don't care." */
2569 if (PL_modcount < 10000 &&
2570 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2572 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2574 sv_setiv(sv, PL_modcount+1);
2582 right = newOP(OP_UNDEF, 0);
2583 if (right->op_type == OP_READLINE) {
2584 right->op_flags |= OPf_STACKED;
2585 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2588 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2589 o = newBINOP(OP_SASSIGN, flags,
2590 scalar(right), mod(scalar(left), OP_SASSIGN) );
2602 newSTATEOP(I32 flags, char *label, OP *o)
2605 U32 seq = intro_my();
2608 Newz(1101, cop, 1, COP);
2609 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2610 cop->op_type = OP_DBSTATE;
2611 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2614 cop->op_type = OP_NEXTSTATE;
2615 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2617 cop->op_flags = flags;
2618 cop->op_private = 0 | (flags >> 8);
2620 cop->op_private |= NATIVE_HINTS;
2622 cop->op_next = (OP*)cop;
2625 cop->cop_label = label;
2626 PL_hints |= HINT_BLOCK_SCOPE;
2629 cop->cop_arybase = PL_curcop->cop_arybase;
2631 if (PL_copline == NOLINE)
2632 cop->cop_line = PL_curcop->cop_line;
2634 cop->cop_line = PL_copline;
2635 PL_copline = NOLINE;
2637 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2638 cop->cop_stash = PL_curstash;
2640 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2641 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2642 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2643 (void)SvIOK_on(*svp);
2645 SvSTASH(*svp) = (HV*)cop;
2649 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2652 /* "Introduce" my variables to visible status. */
2660 if (! PL_min_intro_pending)
2661 return PL_cop_seqmax;
2663 svp = AvARRAY(PL_comppad_name);
2664 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2665 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2666 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2667 SvNVX(sv) = (double)PL_cop_seqmax;
2670 PL_min_intro_pending = 0;
2671 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2672 return PL_cop_seqmax++;
2676 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2678 return new_logop(type, flags, &first, &other);
2682 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2687 OP *first = *firstp;
2688 OP *other = *otherp;
2690 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2691 return newBINOP(type, flags, scalar(first), scalar(other));
2693 scalarboolean(first);
2694 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2695 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2696 if (type == OP_AND || type == OP_OR) {
2702 first = *firstp = cUNOPo->op_first;
2704 first->op_next = o->op_next;
2705 cUNOPo->op_first = Nullop;
2709 if (first->op_type == OP_CONST) {
2710 if (PL_dowarn && (first->op_private & OPpCONST_BARE))
2711 warn("Probable precedence problem on %s", op_desc[type]);
2712 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2723 else if (first->op_type == OP_WANTARRAY) {
2729 else if (PL_dowarn && (first->op_flags & OPf_KIDS)) {
2730 OP *k1 = ((UNOP*)first)->op_first;
2731 OP *k2 = k1->op_sibling;
2733 switch (first->op_type)
2736 if (k2 && k2->op_type == OP_READLINE
2737 && (k2->op_flags & OPf_STACKED)
2738 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2739 warnop = k2->op_type;
2743 if (k1->op_type == OP_READDIR
2744 || k1->op_type == OP_GLOB
2745 || k1->op_type == OP_EACH)
2746 warnop = k1->op_type;
2750 line_t oldline = PL_curcop->cop_line;
2751 PL_curcop->cop_line = PL_copline;
2752 warn("Value of %s%s can be \"0\"; test with defined()",
2754 ((warnop == OP_READLINE || warnop == OP_GLOB)
2755 ? " construct" : "() operator"));
2756 PL_curcop->cop_line = oldline;
2763 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2764 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2766 Newz(1101, logop, 1, LOGOP);
2768 logop->op_type = type;
2769 logop->op_ppaddr = ppaddr[type];
2770 logop->op_first = first;
2771 logop->op_flags = flags | OPf_KIDS;
2772 logop->op_other = LINKLIST(other);
2773 logop->op_private = 1 | (flags >> 8);
2775 /* establish postfix order */
2776 logop->op_next = LINKLIST(first);
2777 first->op_next = (OP*)logop;
2778 first->op_sibling = other;
2780 o = newUNOP(OP_NULL, 0, (OP*)logop);
2787 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2794 return newLOGOP(OP_AND, 0, first, trueop);
2796 return newLOGOP(OP_OR, 0, first, falseop);
2798 scalarboolean(first);
2799 if (first->op_type == OP_CONST) {
2800 if (SvTRUE(((SVOP*)first)->op_sv)) {
2811 else if (first->op_type == OP_WANTARRAY) {
2815 Newz(1101, condop, 1, CONDOP);
2817 condop->op_type = OP_COND_EXPR;
2818 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2819 condop->op_first = first;
2820 condop->op_flags = flags | OPf_KIDS;
2821 condop->op_true = LINKLIST(trueop);
2822 condop->op_false = LINKLIST(falseop);
2823 condop->op_private = 1 | (flags >> 8);
2825 /* establish postfix order */
2826 condop->op_next = LINKLIST(first);
2827 first->op_next = (OP*)condop;
2829 first->op_sibling = trueop;
2830 trueop->op_sibling = falseop;
2831 o = newUNOP(OP_NULL, 0, (OP*)condop);
2833 trueop->op_next = o;
2834 falseop->op_next = o;
2840 newRANGE(I32 flags, OP *left, OP *right)
2848 Newz(1101, condop, 1, CONDOP);
2850 condop->op_type = OP_RANGE;
2851 condop->op_ppaddr = ppaddr[OP_RANGE];
2852 condop->op_first = left;
2853 condop->op_flags = OPf_KIDS;
2854 condop->op_true = LINKLIST(left);
2855 condop->op_false = LINKLIST(right);
2856 condop->op_private = 1 | (flags >> 8);
2858 left->op_sibling = right;
2860 condop->op_next = (OP*)condop;
2861 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2862 flop = newUNOP(OP_FLOP, 0, flip);
2863 o = newUNOP(OP_NULL, 0, flop);
2866 left->op_next = flip;
2867 right->op_next = flop;
2869 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2870 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2871 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2872 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2874 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2875 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2878 if (!flip->op_private || !flop->op_private)
2879 linklist(o); /* blow off optimizer unless constant */
2885 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2890 int once = block && block->op_flags & OPf_SPECIAL &&
2891 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2894 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2895 return block; /* do {} while 0 does once */
2896 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2897 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2898 expr = newUNOP(OP_DEFINED, 0,
2899 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2900 } else if (expr->op_flags & OPf_KIDS) {
2901 OP *k1 = ((UNOP*)expr)->op_first;
2902 OP *k2 = (k1) ? k1->op_sibling : NULL;
2903 switch (expr->op_type) {
2905 if (k2 && k2->op_type == OP_READLINE
2906 && (k2->op_flags & OPf_STACKED)
2907 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2908 expr = newUNOP(OP_DEFINED, 0, expr);
2912 if (k1->op_type == OP_READDIR
2913 || k1->op_type == OP_GLOB
2914 || k1->op_type == OP_EACH)
2915 expr = newUNOP(OP_DEFINED, 0, expr);
2921 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2922 o = new_logop(OP_AND, 0, &expr, &listop);
2925 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2927 if (once && o != listop)
2928 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2931 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2933 o->op_flags |= flags;
2935 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2940 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2949 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2950 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2951 expr = newUNOP(OP_DEFINED, 0,
2952 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2953 } else if (expr && (expr->op_flags & OPf_KIDS)) {
2954 OP *k1 = ((UNOP*)expr)->op_first;
2955 OP *k2 = (k1) ? k1->op_sibling : NULL;
2956 switch (expr->op_type) {
2958 if (k2 && k2->op_type == OP_READLINE
2959 && (k2->op_flags & OPf_STACKED)
2960 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2961 expr = newUNOP(OP_DEFINED, 0, expr);
2965 if (k1->op_type == OP_READDIR
2966 || k1->op_type == OP_GLOB
2967 || k1->op_type == OP_EACH)
2968 expr = newUNOP(OP_DEFINED, 0, expr);
2974 block = newOP(OP_NULL, 0);
2977 next = LINKLIST(cont);
2979 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2980 if ((line_t)whileline != NOLINE) {
2981 PL_copline = whileline;
2982 cont = append_elem(OP_LINESEQ, cont,
2983 newSTATEOP(0, Nullch, Nullop));
2987 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2988 redo = LINKLIST(listop);
2991 PL_copline = whileline;
2993 o = new_logop(OP_AND, 0, &expr, &listop);
2994 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2995 op_free(expr); /* oops, it's a while (0) */
2997 return Nullop; /* listop already freed by new_logop */
3000 ((LISTOP*)listop)->op_last->op_next = condop =
3001 (o == listop ? redo : LINKLIST(o));
3009 Newz(1101,loop,1,LOOP);
3010 loop->op_type = OP_ENTERLOOP;
3011 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
3012 loop->op_private = 0;
3013 loop->op_next = (OP*)loop;
3016 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3018 loop->op_redoop = redo;
3019 loop->op_lastop = o;
3022 loop->op_nextop = next;
3024 loop->op_nextop = o;
3026 o->op_flags |= flags;
3027 o->op_private |= (flags >> 8);
3032 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3040 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3041 sv->op_type = OP_RV2GV;
3042 sv->op_ppaddr = ppaddr[OP_RV2GV];
3044 else if (sv->op_type == OP_PADSV) { /* private variable */
3045 padoff = sv->op_targ;
3049 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3050 padoff = sv->op_targ;
3051 iterflags |= OPf_SPECIAL;
3056 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3060 padoff = find_threadsv("_");
3061 iterflags |= OPf_SPECIAL;
3063 sv = newGVOP(OP_GV, 0, PL_defgv);
3066 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3067 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3068 iterflags |= OPf_STACKED;
3070 else if (expr->op_type == OP_NULL &&
3071 (expr->op_flags & OPf_KIDS) &&
3072 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3074 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3075 * set the STACKED flag to indicate that these values are to be
3076 * treated as min/max values by 'pp_iterinit'.
3078 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3079 CONDOP* range = (CONDOP*) flip->op_first;
3080 OP* left = range->op_first;
3081 OP* right = left->op_sibling;
3084 range->op_flags &= ~OPf_KIDS;
3085 range->op_first = Nullop;
3087 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3088 listop->op_first->op_next = range->op_true;
3089 left->op_next = range->op_false;
3090 right->op_next = (OP*)listop;
3091 listop->op_next = listop->op_first;
3094 expr = (OP*)(listop);
3096 iterflags |= OPf_STACKED;
3099 expr = mod(force_list(expr), OP_GREPSTART);
3103 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3104 append_elem(OP_LIST, expr, scalar(sv))));
3105 assert(!loop->op_next);
3106 Renew(loop, 1, LOOP);
3107 loop->op_targ = padoff;
3108 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3109 PL_copline = forline;
3110 return newSTATEOP(0, label, wop);
3114 newLOOPEX(I32 type, OP *label)
3118 if (type != OP_GOTO || label->op_type == OP_CONST) {
3119 /* "last()" means "last" */
3120 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3121 o = newOP(type, OPf_SPECIAL);
3123 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3124 ? SvPVx(((SVOP*)label)->op_sv, PL_na)
3130 if (label->op_type == OP_ENTERSUB)
3131 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3132 o = newUNOP(type, OPf_STACKED, label);
3134 PL_hints |= HINT_BLOCK_SCOPE;
3144 MUTEX_DESTROY(CvMUTEXP(cv));
3145 Safefree(CvMUTEXP(cv));
3148 #endif /* USE_THREADS */
3150 if (!CvXSUB(cv) && CvROOT(cv)) {
3152 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3153 croak("Can't undef active subroutine");
3156 croak("Can't undef active subroutine");
3157 #endif /* USE_THREADS */
3160 SAVESPTR(PL_curpad);
3164 op_free(CvROOT(cv));
3165 CvROOT(cv) = Nullop;
3168 SvPOK_off((SV*)cv); /* forget prototype */
3170 SvREFCNT_dec(CvGV(cv));
3172 SvREFCNT_dec(CvOUTSIDE(cv));
3173 CvOUTSIDE(cv) = Nullcv;
3174 if (CvPADLIST(cv)) {
3175 /* may be during global destruction */
3176 if (SvREFCNT(CvPADLIST(cv))) {
3177 I32 i = AvFILLp(CvPADLIST(cv));
3179 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3180 SV* sv = svp ? *svp : Nullsv;
3183 if (sv == (SV*)PL_comppad_name)
3184 PL_comppad_name = Nullav;
3185 else if (sv == (SV*)PL_comppad) {
3186 PL_comppad = Nullav;
3187 PL_curpad = Null(SV**);
3191 SvREFCNT_dec((SV*)CvPADLIST(cv));
3193 CvPADLIST(cv) = Nullav;
3197 #ifdef DEBUG_CLOSURES
3202 CV *outside = CvOUTSIDE(cv);
3203 AV* padlist = CvPADLIST(cv);
3210 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3212 (CvANON(cv) ? "ANON"
3213 : (cv == PL_main_cv) ? "MAIN"
3214 : CvUNIQUE(outside) ? "UNIQUE"
3215 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3218 : CvANON(outside) ? "ANON"
3219 : (outside == PL_main_cv) ? "MAIN"
3220 : CvUNIQUE(outside) ? "UNIQUE"
3221 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3226 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3227 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3228 pname = AvARRAY(pad_name);
3229 ppad = AvARRAY(pad);
3231 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3232 if (SvPOK(pname[ix]))
3233 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3235 SvFAKE(pname[ix]) ? "FAKE " : "",
3237 (long)I_32(SvNVX(pname[ix])),
3238 (long)SvIVX(pname[ix]));
3241 #endif /* DEBUG_CLOSURES */
3244 cv_clone2(CV *proto, CV *outside)
3249 AV* protopadlist = CvPADLIST(proto);
3250 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3251 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3252 SV** pname = AvARRAY(protopad_name);
3253 SV** ppad = AvARRAY(protopad);
3254 I32 fname = AvFILLp(protopad_name);
3255 I32 fpad = AvFILLp(protopad);
3259 assert(!CvUNIQUE(proto));
3262 SAVESPTR(PL_curpad);
3263 SAVESPTR(PL_comppad);
3264 SAVESPTR(PL_comppad_name);
3265 SAVESPTR(PL_compcv);
3267 cv = PL_compcv = (CV*)NEWSV(1104,0);
3268 sv_upgrade((SV *)cv, SvTYPE(proto));
3274 New(666, CvMUTEXP(cv), 1, perl_mutex);
3275 MUTEX_INIT(CvMUTEXP(cv));
3277 #endif /* USE_THREADS */
3278 CvFILEGV(cv) = CvFILEGV(proto);
3279 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3280 CvSTASH(cv) = CvSTASH(proto);
3281 CvROOT(cv) = CvROOT(proto);
3282 CvSTART(cv) = CvSTART(proto);
3284 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3287 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3289 PL_comppad_name = newAV();
3290 for (ix = fname; ix >= 0; ix--)
3291 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3293 PL_comppad = newAV();
3295 comppadlist = newAV();
3296 AvREAL_off(comppadlist);
3297 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3298 av_store(comppadlist, 1, (SV*)PL_comppad);
3299 CvPADLIST(cv) = comppadlist;
3300 av_fill(PL_comppad, AvFILLp(protopad));
3301 PL_curpad = AvARRAY(PL_comppad);
3303 av = newAV(); /* will be @_ */
3305 av_store(PL_comppad, 0, (SV*)av);
3306 AvFLAGS(av) = AVf_REIFY;
3308 for (ix = fpad; ix > 0; ix--) {
3309 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3310 if (namesv && namesv != &PL_sv_undef) {
3311 char *name = SvPVX(namesv); /* XXX */
3312 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3313 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3314 CvOUTSIDE(cv), cxstack_ix);
3316 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3318 croak("panic: cv_clone: %s", name);
3320 else { /* our own lexical */
3323 /* anon code -- we'll come back for it */
3324 sv = SvREFCNT_inc(ppad[ix]);
3326 else if (*name == '@')
3328 else if (*name == '%')
3338 SV* sv = NEWSV(0,0);
3344 /* Now that vars are all in place, clone nested closures. */
3346 for (ix = fpad; ix > 0; ix--) {
3347 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3349 && namesv != &PL_sv_undef
3350 && !(SvFLAGS(namesv) & SVf_FAKE)
3351 && *SvPVX(namesv) == '&'
3352 && CvCLONE(ppad[ix]))
3354 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3355 SvREFCNT_dec(ppad[ix]);
3358 PL_curpad[ix] = (SV*)kid;
3362 #ifdef DEBUG_CLOSURES
3363 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3365 PerlIO_printf(Perl_debug_log, " from:\n");
3367 PerlIO_printf(Perl_debug_log, " to:\n");
3378 return cv_clone2(proto, CvOUTSIDE(proto));
3382 cv_ckproto(CV *cv, GV *gv, char *p)
3384 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3385 SV* msg = sv_newmortal();
3389 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3390 sv_setpv(msg, "Prototype mismatch:");
3392 sv_catpvf(msg, " sub %_", name);
3394 sv_catpvf(msg, " (%s)", SvPVX(cv));
3395 sv_catpv(msg, " vs ");
3397 sv_catpvf(msg, "(%s)", p);
3399 sv_catpv(msg, "none");
3407 if (!cv || !SvPOK(cv) || SvCUR(cv))
3409 return op_const_sv(CvSTART(cv), cv);
3413 op_const_sv(OP *o, CV *cv)
3420 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3421 o = cLISTOPo->op_first->op_sibling;
3423 for (; o; o = o->op_next) {
3424 OPCODE type = o->op_type;
3426 if(sv && o->op_next == o)
3428 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3430 if (type == OP_LEAVESUB || type == OP_RETURN)
3434 if (type == OP_CONST)
3436 else if (type == OP_PADSV && cv) {
3437 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3438 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3439 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3451 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3454 char *name = o ? SvPVx(cSVOPo->op_sv, PL_na) : Nullch;
3455 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3456 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3457 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, PL_na) : Nullch;
3466 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3467 maximum a prototype before. */
3468 if (SvTYPE(gv) > SVt_NULL) {
3469 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3470 warn("Runaway prototype");
3471 cv_ckproto((CV*)gv, NULL, ps);
3474 sv_setpv((SV*)gv, ps);
3476 sv_setiv((SV*)gv, -1);
3477 SvREFCNT_dec(PL_compcv);
3478 cv = PL_compcv = NULL;
3479 PL_sub_generation++;
3483 if (!name || GvCVGEN(gv))
3485 else if (cv = GvCV(gv)) {
3486 cv_ckproto(cv, gv, ps);
3487 /* already defined (or promised)? */
3488 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3490 bool const_changed = TRUE;
3492 /* just a "sub foo;" when &foo is already defined */
3493 SAVEFREESV(PL_compcv);
3496 /* ahem, death to those who redefine active sort subs */
3497 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3498 croak("Can't redefine active sort subroutine %s", name);
3499 if(const_sv = cv_const_sv(cv))
3500 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3501 if ((const_sv && const_changed) || PL_dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3502 && HvNAME(GvSTASH(CvGV(cv)))
3503 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3505 line_t oldline = PL_curcop->cop_line;
3506 PL_curcop->cop_line = PL_copline;
3507 warn(const_sv ? "Constant subroutine %s redefined"
3508 : "Subroutine %s redefined", name);
3509 PL_curcop->cop_line = oldline;
3515 if (cv) { /* must reuse cv if autoloaded */
3517 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3518 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3519 CvOUTSIDE(PL_compcv) = 0;
3520 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3521 CvPADLIST(PL_compcv) = 0;
3522 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3523 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3524 SvREFCNT_dec(PL_compcv);
3531 PL_sub_generation++;
3534 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3535 CvFILEGV(cv) = PL_curcop->cop_filegv;
3536 CvSTASH(cv) = PL_curstash;
3540 New(666, CvMUTEXP(cv), 1, perl_mutex);
3541 MUTEX_INIT(CvMUTEXP(cv));
3542 #endif /* USE_THREADS */
3545 sv_setpv((SV*)cv, ps);
3547 if (PL_error_count) {
3551 char *s = strrchr(name, ':');
3553 if (strEQ(s, "BEGIN")) {
3555 "BEGIN not safe after errors--compilation aborted";
3559 /* force display of errors found but not reported */
3560 sv_catpv(ERRSV, not_safe);
3561 croak("%s", SvPVx(ERRSV, PL_na));
3568 PL_copline = NOLINE;
3573 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3574 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3577 SV **namep = AvARRAY(PL_comppad_name);
3578 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3581 if (SvIMMORTAL(PL_curpad[ix]))
3584 * The only things that a clonable function needs in its
3585 * pad are references to outer lexicals and anonymous subs.
3586 * The rest are created anew during cloning.
3588 if (!((namesv = namep[ix]) != Nullsv &&
3589 namesv != &PL_sv_undef &&
3591 *SvPVX(namesv) == '&')))
3593 SvREFCNT_dec(PL_curpad[ix]);
3594 PL_curpad[ix] = Nullsv;
3599 AV *av = newAV(); /* Will be @_ */
3601 av_store(PL_comppad, 0, (SV*)av);
3602 AvFLAGS(av) = AVf_REIFY;
3604 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3605 if (SvIMMORTAL(PL_curpad[ix]))
3607 if (!SvPADMY(PL_curpad[ix]))
3608 SvPADTMP_on(PL_curpad[ix]);
3612 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3613 CvSTART(cv) = LINKLIST(CvROOT(cv));
3614 CvROOT(cv)->op_next = 0;
3620 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3621 SV *sv = NEWSV(0,0);
3622 SV *tmpstr = sv_newmortal();
3623 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3627 sv_setpvf(sv, "%_:%ld-%ld",
3628 GvSV(PL_curcop->cop_filegv),
3629 (long)PL_subline, (long)PL_curcop->cop_line);
3630 gv_efullname3(tmpstr, gv, Nullch);
3631 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3632 hv = GvHVn(db_postponed);
3633 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3634 && (cv = GvCV(db_postponed))) {
3639 perl_call_sv((SV*)cv, G_DISCARD);
3643 if ((s = strrchr(name,':')))
3647 if (strEQ(s, "BEGIN")) {
3648 I32 oldscope = PL_scopestack_ix;
3650 SAVESPTR(PL_compiling.cop_filegv);
3651 SAVEI16(PL_compiling.cop_line);
3653 sv_setsv(PL_rs, PL_nrs);
3656 PL_beginav = newAV();
3657 DEBUG_x( dump_sub(gv) );
3658 av_push(PL_beginav, (SV *)cv);
3660 call_list(oldscope, PL_beginav);
3662 PL_curcop = &PL_compiling;
3665 else if (strEQ(s, "END") && !PL_error_count) {
3668 av_unshift(PL_endav, 1);
3669 av_store(PL_endav, 0, (SV *)cv);
3672 else if (strEQ(s, "INIT") && !PL_error_count) {
3674 PL_initav = newAV();
3675 av_push(PL_initav, SvREFCNT_inc(cv));
3681 PL_copline = NOLINE;
3687 newCONSTSUB(HV *stash, char *name, SV *sv)
3690 U32 oldhints = PL_hints;
3691 HV *old_cop_stash = PL_curcop->cop_stash;
3692 HV *old_curstash = PL_curstash;
3693 line_t oldline = PL_curcop->cop_line;
3694 PL_curcop->cop_line = PL_copline;
3696 PL_hints &= ~HINT_BLOCK_SCOPE;
3698 PL_curstash = PL_curcop->cop_stash = stash;
3701 start_subparse(FALSE, 0),
3702 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3703 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
3704 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3707 PL_hints = oldhints;
3708 PL_curcop->cop_stash = old_cop_stash;
3709 PL_curstash = old_curstash;
3710 PL_curcop->cop_line = oldline;
3714 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3717 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3720 if (cv = (name ? GvCV(gv) : Nullcv)) {
3722 /* just a cached method */
3726 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3727 /* already defined (or promised) */
3728 if (PL_dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3729 && HvNAME(GvSTASH(CvGV(cv)))
3730 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3731 line_t oldline = PL_curcop->cop_line;
3732 PL_curcop->cop_line = PL_copline;
3733 warn("Subroutine %s redefined",name);
3734 PL_curcop->cop_line = oldline;
3741 if (cv) /* must reuse cv if autoloaded */
3744 cv = (CV*)NEWSV(1105,0);
3745 sv_upgrade((SV *)cv, SVt_PVCV);
3749 PL_sub_generation++;
3752 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3754 New(666, CvMUTEXP(cv), 1, perl_mutex);
3755 MUTEX_INIT(CvMUTEXP(cv));
3757 #endif /* USE_THREADS */
3758 CvFILEGV(cv) = gv_fetchfile(filename);
3759 CvXSUB(cv) = subaddr;
3762 char *s = strrchr(name,':');
3767 if (strEQ(s, "BEGIN")) {
3769 PL_beginav = newAV();
3770 av_push(PL_beginav, (SV *)cv);
3773 else if (strEQ(s, "END")) {
3776 av_unshift(PL_endav, 1);
3777 av_store(PL_endav, 0, (SV *)cv);
3780 else if (strEQ(s, "INIT")) {
3782 PL_initav = newAV();
3783 av_push(PL_initav, (SV *)cv);
3793 newFORM(I32 floor, OP *o, OP *block)
3802 name = SvPVx(cSVOPo->op_sv, PL_na);
3805 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3807 if (cv = GvFORM(gv)) {
3809 line_t oldline = PL_curcop->cop_line;
3811 PL_curcop->cop_line = PL_copline;
3812 warn("Format %s redefined",name);
3813 PL_curcop->cop_line = oldline;
3819 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3820 CvFILEGV(cv) = PL_curcop->cop_filegv;
3822 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3823 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
3824 SvPADTMP_on(PL_curpad[ix]);
3827 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3828 CvSTART(cv) = LINKLIST(CvROOT(cv));
3829 CvROOT(cv)->op_next = 0;
3832 PL_copline = NOLINE;
3839 return newUNOP(OP_REFGEN, 0,
3840 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3846 return newUNOP(OP_REFGEN, 0,
3847 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3851 newANONSUB(I32 floor, OP *proto, OP *block)
3853 return newUNOP(OP_REFGEN, 0,
3854 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3860 switch (o->op_type) {
3862 o->op_type = OP_PADAV;
3863 o->op_ppaddr = ppaddr[OP_PADAV];
3864 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3867 o->op_type = OP_RV2AV;
3868 o->op_ppaddr = ppaddr[OP_RV2AV];
3873 warn("oops: oopsAV");
3882 switch (o->op_type) {
3885 o->op_type = OP_PADHV;
3886 o->op_ppaddr = ppaddr[OP_PADHV];
3887 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3891 o->op_type = OP_RV2HV;
3892 o->op_ppaddr = ppaddr[OP_RV2HV];
3897 warn("oops: oopsHV");
3906 if (o->op_type == OP_PADANY) {
3907 o->op_type = OP_PADAV;
3908 o->op_ppaddr = ppaddr[OP_PADAV];
3911 return newUNOP(OP_RV2AV, 0, scalar(o));
3915 newGVREF(I32 type, OP *o)
3917 if (type == OP_MAPSTART)
3918 return newUNOP(OP_NULL, 0, o);
3919 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3925 if (o->op_type == OP_PADANY) {
3926 o->op_type = OP_PADHV;
3927 o->op_ppaddr = ppaddr[OP_PADHV];
3930 return newUNOP(OP_RV2HV, 0, scalar(o));
3936 croak("NOT IMPL LINE %d",__LINE__);
3942 newCVREF(I32 flags, OP *o)
3944 return newUNOP(OP_RV2CV, flags, scalar(o));
3950 if (o->op_type == OP_PADANY) {
3951 o->op_type = OP_PADSV;
3952 o->op_ppaddr = ppaddr[OP_PADSV];
3955 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3956 o->op_flags |= OPpDONE_SVREF;
3959 return newUNOP(OP_RV2SV, 0, scalar(o));
3962 /* Check routines. */
3970 name = NEWSV(1106,0);
3971 sv_upgrade(name, SVt_PVNV);
3972 sv_setpvn(name, "&", 1);
3975 ix = pad_alloc(o->op_type, SVs_PADMY);
3976 av_store(PL_comppad_name, ix, name);
3977 av_store(PL_comppad, ix, cSVOPo->op_sv);
3978 SvPADMY_on(cSVOPo->op_sv);
3979 cSVOPo->op_sv = Nullsv;
3980 cSVOPo->op_targ = ix;
3987 o->op_private = PL_hints;
3994 if (cUNOPo->op_first->op_type == OP_CONCAT)
3995 o->op_flags |= OPf_STACKED;
4002 if (o->op_flags & OPf_KIDS) {
4005 OPCODE type = o->op_type;
4006 o = modkids(ck_fun(o), type);
4007 kid = cUNOPo->op_first;
4008 newop = kUNOP->op_first->op_sibling;
4010 (newop->op_sibling ||
4011 !(opargs[newop->op_type] & OA_RETSCALAR) ||
4012 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4013 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4017 op_free(kUNOP->op_first);
4018 kUNOP->op_first = newop;
4020 o->op_ppaddr = ppaddr[++o->op_type];
4029 if (o->op_flags & OPf_KIDS) {
4030 OP *kid = cUNOPo->op_first;
4031 if (kid->op_type == OP_HSLICE)
4032 o->op_private |= OPpSLICE;
4033 else if (kid->op_type != OP_HELEM)
4034 croak("%s argument is not a HASH element or slice",
4035 op_desc[o->op_type]);
4044 I32 type = o->op_type;
4046 if (o->op_flags & OPf_KIDS) {
4047 if (cLISTOPo->op_first->op_type == OP_STUB) {
4049 o = newUNOP(type, OPf_SPECIAL,
4050 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4060 PL_hints |= HINT_BLOCK_SCOPE;
4061 if (o->op_flags & OPf_KIDS) {
4062 SVOP *kid = (SVOP*)cUNOPo->op_first;
4065 o->op_flags &= ~OPf_KIDS;
4068 else if (kid->op_type == OP_LINESEQ) {
4071 kid->op_next = o->op_next;
4072 cUNOPo->op_first = 0;
4075 Newz(1101, enter, 1, LOGOP);
4076 enter->op_type = OP_ENTERTRY;
4077 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4078 enter->op_private = 0;
4080 /* establish postfix order */
4081 enter->op_next = (OP*)enter;
4083 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4084 o->op_type = OP_LEAVETRY;
4085 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4086 enter->op_other = o;
4094 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4096 o->op_targ = (PADOFFSET)PL_hints;
4104 if (o->op_flags & OPf_STACKED) {
4106 kid = cUNOPo->op_first->op_sibling;
4107 if (kid->op_type == OP_RV2GV)
4119 if (o->op_flags & OPf_KIDS) {
4120 OP *kid = cUNOPo->op_first;
4121 if (kid->op_type != OP_HELEM)
4122 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4129 ck_gvconst(register OP *o)
4131 o = fold_constants(o);
4132 if (o->op_type == OP_CONST)
4138 ck_rvconst(register OP *o)
4141 SVOP *kid = (SVOP*)cUNOPo->op_first;
4143 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4144 if (kid->op_type == OP_CONST) {
4149 name = SvPV(kid->op_sv, PL_na);
4150 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4151 char *badthing = Nullch;
4152 switch (o->op_type) {
4154 badthing = "a SCALAR";
4157 badthing = "an ARRAY";
4160 badthing = "a HASH";
4165 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4169 * This is a little tricky. We only want to add the symbol if we
4170 * didn't add it in the lexer. Otherwise we get duplicate strict
4171 * warnings. But if we didn't add it in the lexer, we must at
4172 * least pretend like we wanted to add it even if it existed before,
4173 * or we get possible typo warnings. OPpCONST_ENTERED says
4174 * whether the lexer already added THIS instance of this symbol.
4176 iscv = (o->op_type == OP_RV2CV) * 2;
4178 gv = gv_fetchpv(name,
4179 iscv | !(kid->op_private & OPpCONST_ENTERED),
4182 : o->op_type == OP_RV2SV
4184 : o->op_type == OP_RV2AV
4186 : o->op_type == OP_RV2HV
4189 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4191 kid->op_type = OP_GV;
4192 SvREFCNT_dec(kid->op_sv);
4193 kid->op_sv = SvREFCNT_inc(gv);
4203 I32 type = o->op_type;
4205 if (o->op_flags & OPf_REF)
4208 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4209 SVOP *kid = (SVOP*)cUNOPo->op_first;
4211 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4212 OP *newop = newGVOP(type, OPf_REF,
4213 gv_fetchpv(SvPVx(kid->op_sv, PL_na), TRUE, SVt_PVIO));
4220 if (type == OP_FTTTY)
4221 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4224 return newUNOP(type, 0, newDEFSVOP());
4237 int type = o->op_type;
4238 register I32 oa = opargs[type] >> OASHIFT;
4240 if (o->op_flags & OPf_STACKED) {
4241 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4244 return no_fh_allowed(o);
4247 if (o->op_flags & OPf_KIDS) {
4248 tokid = &cLISTOPo->op_first;
4249 kid = cLISTOPo->op_first;
4250 if (kid->op_type == OP_PUSHMARK ||
4251 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4253 tokid = &kid->op_sibling;
4254 kid = kid->op_sibling;
4256 if (!kid && opargs[type] & OA_DEFGV)
4257 *tokid = kid = newDEFSVOP();
4261 sibl = kid->op_sibling;
4275 if (kid->op_type == OP_CONST &&
4276 (kid->op_private & OPpCONST_BARE)) {
4277 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4278 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4279 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4281 warn("Array @%s missing the @ in argument %ld of %s()",
4282 name, (long)numargs, op_desc[type]);
4285 kid->op_sibling = sibl;
4288 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4289 bad_type(numargs, "array", op_desc[o->op_type], kid);
4293 if (kid->op_type == OP_CONST &&
4294 (kid->op_private & OPpCONST_BARE)) {
4295 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4296 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4297 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4299 warn("Hash %%%s missing the %% in argument %ld of %s()",
4300 name, (long)numargs, op_desc[type]);
4303 kid->op_sibling = sibl;
4306 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4307 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4312 OP *newop = newUNOP(OP_NULL, 0, kid);
4313 kid->op_sibling = 0;
4315 newop->op_next = newop;
4317 kid->op_sibling = sibl;
4322 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4323 if (kid->op_type == OP_CONST &&
4324 (kid->op_private & OPpCONST_BARE)) {
4325 OP *newop = newGVOP(OP_GV, 0,
4326 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, PL_na), TRUE,
4332 kid->op_sibling = 0;
4333 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4335 kid->op_sibling = sibl;
4341 mod(scalar(kid), type);
4345 tokid = &kid->op_sibling;
4346 kid = kid->op_sibling;
4348 o->op_private |= numargs;
4350 return too_many_arguments(o,op_desc[o->op_type]);
4353 else if (opargs[type] & OA_DEFGV) {
4355 return newUNOP(type, 0, newDEFSVOP());
4359 while (oa & OA_OPTIONAL)
4361 if (oa && oa != OA_LIST)
4362 return too_few_arguments(o,op_desc[o->op_type]);
4372 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4373 append_elem(OP_GLOB, o, newDEFSVOP());
4375 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4376 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4378 if (gv && GvIMPORTED_CV(gv)) {
4379 static int glob_index;
4381 append_elem(OP_GLOB, o,
4382 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4383 o->op_type = OP_LIST;
4384 o->op_ppaddr = ppaddr[OP_LIST];
4385 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4386 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4387 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4388 append_elem(OP_LIST, o,
4389 scalar(newUNOP(OP_RV2CV, 0,
4390 newGVOP(OP_GV, 0, gv)))));
4391 o = newUNOP(OP_NULL, 0, ck_subr(o));
4392 o->op_targ = OP_GLOB; /* hint at what it used to be */
4395 gv = newGVgen("main");
4397 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4407 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4409 o->op_ppaddr = ppaddr[OP_GREPSTART];
4410 Newz(1101, gwop, 1, LOGOP);
4412 if (o->op_flags & OPf_STACKED) {
4415 kid = cLISTOPo->op_first->op_sibling;
4416 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4419 kid->op_next = (OP*)gwop;
4420 o->op_flags &= ~OPf_STACKED;
4422 kid = cLISTOPo->op_first->op_sibling;
4423 if (type == OP_MAPWHILE)
4430 kid = cLISTOPo->op_first->op_sibling;
4431 if (kid->op_type != OP_NULL)
4432 croak("panic: ck_grep");
4433 kid = kUNOP->op_first;
4435 gwop->op_type = type;
4436 gwop->op_ppaddr = ppaddr[type];
4437 gwop->op_first = listkids(o);
4438 gwop->op_flags |= OPf_KIDS;
4439 gwop->op_private = 1;
4440 gwop->op_other = LINKLIST(kid);
4441 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4442 kid->op_next = (OP*)gwop;
4444 kid = cLISTOPo->op_first->op_sibling;
4445 if (!kid || !kid->op_sibling)
4446 return too_few_arguments(o,op_desc[o->op_type]);
4447 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4448 mod(kid, OP_GREPSTART);
4456 if (o->op_flags & OPf_KIDS) {
4457 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4458 if (kid && kid->op_type == OP_CONST)
4459 fbm_compile(((SVOP*)kid)->op_sv, 0);
4465 ck_lengthconst(OP *o)
4467 /* XXX length optimization goes here */
4474 OPCODE type = o->op_type;
4475 return modkids(ck_fun(o), type);
4481 OPCODE type = o->op_type;
4482 return refkids(ck_fun(o), type);
4490 kid = cLISTOPo->op_first;
4493 kid = cLISTOPo->op_first;
4495 if (kid->op_type == OP_PUSHMARK)
4496 kid = kid->op_sibling;
4497 if (kid && o->op_flags & OPf_STACKED)
4498 kid = kid->op_sibling;
4499 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4500 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4501 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4502 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4503 cLISTOPo->op_first->op_sibling = kid;
4504 cLISTOPo->op_last = kid;
4505 kid = kid->op_sibling;
4510 append_elem(o->op_type, o, newDEFSVOP());
4516 if (PL_hints & HINT_LOCALE)
4517 o->op_private |= OPpLOCALE;
4524 ck_fun_locale(OP *o)
4530 if (PL_hints & HINT_LOCALE)
4531 o->op_private |= OPpLOCALE;
4542 if (PL_hints & HINT_LOCALE)
4543 o->op_private |= OPpLOCALE;
4552 o->op_private |= OPpRUNTIME;
4565 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4566 o->op_private |= OPpREPEAT_DOLIST;
4567 cBINOPo->op_first = force_list(cBINOPo->op_first);
4577 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4578 SVOP *kid = (SVOP*)cUNOPo->op_first;
4580 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4582 for (s = SvPVX(kid->op_sv); *s; s++) {
4583 if (*s == ':' && s[1] == ':') {
4585 Move(s+2, s+1, strlen(s+2)+1, char);
4586 --SvCUR(kid->op_sv);
4589 sv_catpvn(kid->op_sv, ".pm", 3);
4598 croak("NOT IMPL LINE %d",__LINE__);
4607 if (o->op_flags & OPf_KIDS) {
4608 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4609 if (kid && kid->op_sibling) {
4610 o->op_type = OP_SSELECT;
4611 o->op_ppaddr = ppaddr[OP_SSELECT];
4613 return fold_constants(o);
4617 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4618 if (kid && kid->op_type == OP_RV2GV)
4619 kid->op_private &= ~HINT_STRICT_REFS;
4626 I32 type = o->op_type;
4628 if (!(o->op_flags & OPf_KIDS)) {
4633 if (!CvUNIQUE(PL_compcv)) {
4634 argop = newOP(OP_PADAV, OPf_REF);
4635 argop->op_targ = 0; /* PL_curpad[0] is @_ */
4638 argop = newUNOP(OP_RV2AV, 0,
4639 scalar(newGVOP(OP_GV, 0,
4640 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4643 argop = newUNOP(OP_RV2AV, 0,
4644 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
4645 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4646 #endif /* USE_THREADS */
4647 return newUNOP(type, 0, scalar(argop));
4649 return scalar(modkids(ck_fun(o), type));
4657 if (PL_hints & HINT_LOCALE)
4658 o->op_private |= OPpLOCALE;
4661 if (o->op_flags & OPf_STACKED) {
4662 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4664 kid = kUNOP->op_first; /* get past rv2gv */
4666 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4668 if (kid->op_type == OP_SCOPE) {
4672 else if (kid->op_type == OP_LEAVE) {
4673 if (o->op_type == OP_SORT) {
4674 null(kid); /* wipe out leave */
4677 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4678 if (k->op_next == kid)
4683 kid->op_next = 0; /* just disconnect the leave */
4684 k = kLISTOP->op_first;
4688 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4689 null(kid); /* wipe out rv2gv */
4690 if (o->op_type == OP_SORT)
4694 o->op_flags |= OPf_SPECIAL;
4706 if (o->op_flags & OPf_STACKED)
4707 return no_fh_allowed(o);
4709 kid = cLISTOPo->op_first;
4710 if (kid->op_type != OP_NULL)
4711 croak("panic: ck_split");
4712 kid = kid->op_sibling;
4713 op_free(cLISTOPo->op_first);
4714 cLISTOPo->op_first = kid;
4716 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4717 cLISTOPo->op_last = kid; /* There was only one element previously */
4720 if (kid->op_type != OP_MATCH) {
4721 OP *sibl = kid->op_sibling;
4722 kid->op_sibling = 0;
4723 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4724 if (cLISTOPo->op_first == cLISTOPo->op_last)
4725 cLISTOPo->op_last = kid;
4726 cLISTOPo->op_first = kid;
4727 kid->op_sibling = sibl;
4730 kid->op_type = OP_PUSHRE;
4731 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4734 if (!kid->op_sibling)
4735 append_elem(OP_SPLIT, o, newDEFSVOP());
4737 kid = kid->op_sibling;
4740 if (!kid->op_sibling)
4741 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4743 kid = kid->op_sibling;
4746 if (kid->op_sibling)
4747 return too_many_arguments(o,op_desc[o->op_type]);
4756 OP *prev = ((cUNOPo->op_first->op_sibling)
4757 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4758 OP *o2 = prev->op_sibling;
4766 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4767 if (cvop->op_type == OP_RV2CV) {
4769 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4770 null(cvop); /* disable rv2cv */
4771 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4772 if (tmpop->op_type == OP_GV) {
4773 cv = GvCVu(tmpop->op_sv);
4774 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4775 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4776 proto = SvPV((SV*)cv, PL_na);
4780 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4781 if (PERLDB_SUB && PL_curstash != PL_debstash)
4782 o->op_private |= OPpENTERSUB_DB;
4783 while (o2 != cvop) {
4787 return too_many_arguments(o, gv_ename(namegv));
4805 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4806 bad_type(arg, "block", gv_ename(namegv), o2);
4811 if (o2->op_type == OP_RV2GV)
4815 OP* sib = kid->op_sibling;
4816 kid->op_sibling = 0;
4817 o2 = newUNOP(OP_RV2GV, 0, kid);
4818 o2->op_sibling = sib;
4819 prev->op_sibling = o2;
4827 if (o2->op_type != OP_RV2GV)
4828 bad_type(arg, "symbol", gv_ename(namegv), o2);
4831 if (o2->op_type != OP_RV2CV)
4832 bad_type(arg, "sub", gv_ename(namegv), o2);
4835 if (o2->op_type != OP_RV2SV
4836 && o2->op_type != OP_PADSV
4837 && o2->op_type != OP_THREADSV)
4839 bad_type(arg, "scalar", gv_ename(namegv), o2);
4843 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4844 bad_type(arg, "array", gv_ename(namegv), o2);
4847 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4848 bad_type(arg, "hash", gv_ename(namegv), o2);
4852 OP* sib = kid->op_sibling;
4853 kid->op_sibling = 0;
4854 o2 = newUNOP(OP_REFGEN, 0, kid);
4855 o2->op_sibling = sib;
4856 prev->op_sibling = o2;
4867 croak("Malformed prototype for %s: %s",
4868 gv_ename(namegv), SvPV((SV*)cv, PL_na));
4873 mod(o2, OP_ENTERSUB);
4875 o2 = o2->op_sibling;
4877 if (proto && !optional &&
4878 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4879 return too_few_arguments(o, gv_ename(namegv));
4886 SvREADONLY_on(cSVOPo->op_sv);
4893 if (o->op_flags & OPf_KIDS) {
4894 SVOP *kid = (SVOP*)cUNOPo->op_first;
4896 if (kid->op_type == OP_NULL)
4897 kid = (SVOP*)kid->op_sibling;
4899 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4900 o->op_flags |= OPf_SPECIAL;
4905 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4908 peep(register OP *o)
4911 register OP* oldop = 0;
4912 if (!o || o->op_seq)
4916 SAVESPTR(PL_curcop);
4917 for (; o; o = o->op_next) {
4923 switch (o->op_type) {
4926 PL_curcop = ((COP*)o); /* for warnings */
4927 o->op_seq = PL_op_seqmax++;
4938 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
4940 o->op_seq = PL_op_seqmax++;
4943 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4944 o->op_seq = PL_op_seqmax++;
4945 break; /* Scalar stub must produce undef. List stub is noop */
4949 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4950 PL_curcop = ((COP*)o);
4956 if (oldop && o->op_next) {
4957 oldop->op_next = o->op_next;
4960 o->op_seq = PL_op_seqmax++;
4964 if (o->op_next->op_type == OP_RV2SV) {
4965 if (!(o->op_next->op_private & OPpDEREF)) {
4967 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4968 o->op_next = o->op_next->op_next;
4969 o->op_type = OP_GVSV;
4970 o->op_ppaddr = ppaddr[OP_GVSV];
4973 else if (o->op_next->op_type == OP_RV2AV) {
4974 OP* pop = o->op_next->op_next;
4976 if (pop->op_type == OP_CONST &&
4977 (PL_op = pop->op_next) &&
4978 pop->op_next->op_type == OP_AELEM &&
4979 !(pop->op_next->op_private &
4980 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4981 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
4985 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4989 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4990 o->op_next = pop->op_next->op_next;
4991 o->op_type = OP_AELEMFAST;
4992 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4993 o->op_private = (U8)i;
4994 GvAVn(((GVOP*)o)->op_gv);
4997 o->op_seq = PL_op_seqmax++;
5001 if (o->op_next->op_type == OP_RV2AV
5002 && (o->op_next->op_flags & OPf_REF))
5005 o->op_next = o->op_next->op_next;
5010 if (o->op_next->op_type == OP_RV2HV
5011 && (o->op_next->op_flags & OPf_REF))
5014 o->op_next = o->op_next->op_next;
5022 o->op_seq = PL_op_seqmax++;
5023 while (cLOGOP->op_other->op_type == OP_NULL)
5024 cLOGOP->op_other = cLOGOP->op_other->op_next;
5025 peep(cLOGOP->op_other);
5029 o->op_seq = PL_op_seqmax++;
5030 peep(cCONDOP->op_true);
5031 peep(cCONDOP->op_false);
5035 o->op_seq = PL_op_seqmax++;
5036 peep(cLOOP->op_redoop);
5037 peep(cLOOP->op_nextop);
5038 peep(cLOOP->op_lastop);
5044 o->op_seq = PL_op_seqmax++;
5045 peep(cPMOP->op_pmreplstart);
5049 o->op_seq = PL_op_seqmax++;
5050 if (PL_dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
5051 if (o->op_next->op_sibling &&
5052 o->op_next->op_sibling->op_type != OP_EXIT &&
5053 o->op_next->op_sibling->op_type != OP_WARN &&
5054 o->op_next->op_sibling->op_type != OP_DIE) {
5055 line_t oldline = PL_curcop->cop_line;
5057 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5058 warn("Statement unlikely to be reached");
5059 warn("(Maybe you meant system() when you said exec()?)\n");
5060 PL_curcop->cop_line = oldline;
5074 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5075 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5077 rop = (UNOP*)((BINOP*)o)->op_first;
5078 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5080 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5081 if (!SvOBJECT(lexname))
5083 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5084 if (!fields || !GvHV(*fields))
5086 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5087 key = SvPV(*svp, keylen);
5088 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5090 croak("No such field \"%s\" in variable %s of type %s",
5091 key, SvPV(lexname, PL_na), HvNAME(SvSTASH(lexname)));
5093 ind = SvIV(*indsvp);
5095 croak("Bad index while coercing array into hash");
5096 rop->op_type = OP_RV2AV;
5097 rop->op_ppaddr = ppaddr[OP_RV2AV];
5098 o->op_type = OP_AELEM;
5099 o->op_ppaddr = ppaddr[OP_AELEM];
5101 *svp = newSViv(ind);
5106 o->op_seq = PL_op_seqmax++;