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 #define PAD_MAX 999999999
40 static bool scalar_mod_type _((OP *o, I32 type));
42 static I32 list_assignment _((OP *o));
43 static void bad_type _((I32 n, char *t, char *name, OP *kid));
44 static OP *modkids _((OP *o, I32 type));
45 static OP *no_fh_allowed _((OP *o));
46 static OP *scalarboolean _((OP *o));
47 static OP *too_few_arguments _((OP *o, char* name));
48 static OP *too_many_arguments _((OP *o, char* name));
49 static void null _((OP* o));
50 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
51 CV* startcv, I32 cx_ix, I32 saweval));
52 static OP *newDEFSVOP _((void));
53 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
59 SV* tmpsv = sv_newmortal();
60 gv_efullname3(tmpsv, gv, Nullch);
61 return SvPV(tmpsv,PL_na);
67 yyerror(form("Missing comma after first argument to %s function",
68 op_desc[o->op_type]));
73 too_few_arguments(OP *o, char *name)
75 yyerror(form("Not enough arguments for %s", name));
80 too_many_arguments(OP *o, char *name)
82 yyerror(form("Too many arguments for %s", name));
87 bad_type(I32 n, char *t, char *name, OP *kid)
89 yyerror(form("Type of arg %d to %s must be %s (not %s)",
90 (int)n, name, t, op_desc[kid->op_type]));
96 int type = o->op_type;
97 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
98 yyerror(form("Can't use subscript on %s", op_desc[type]));
99 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
101 SV *msg = sv_2mortal(
102 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
103 type == OP_ENTERSUB ? '&' : '%'));
107 sv_catsv(GvSV(PL_errgv), msg);
109 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
114 /* "register" allocation */
117 pad_allocmy(char *name)
123 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
124 if (!isPRINT(name[1])) {
126 name[2] = toCTRL(name[1]);
129 croak("Can't use global %s in \"my\"",name);
131 if (PL_dowarn && AvFILLp(PL_comppad_name) >= 0) {
132 SV **svp = AvARRAY(PL_comppad_name);
133 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
135 && sv != &PL_sv_undef
136 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
137 && strEQ(name, SvPVX(sv)))
139 warn("\"my\" variable %s masks earlier declaration in same %s",
140 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
145 off = pad_alloc(OP_PADSV, SVs_PADMY);
147 sv_upgrade(sv, SVt_PVNV);
149 if (PL_in_my_stash) {
151 croak("Can't declare class for non-scalar %s in \"my\"",name);
153 (void)SvUPGRADE(sv, SVt_PVMG);
154 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
157 av_store(PL_comppad_name, off, sv);
158 SvNVX(sv) = (double)PAD_MAX;
159 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
160 if (!PL_min_intro_pending)
161 PL_min_intro_pending = off;
162 PL_max_intro_pending = off;
164 av_store(PL_comppad, off, (SV*)newAV());
165 else if (*name == '%')
166 av_store(PL_comppad, off, (SV*)newHV());
167 SvPADMY_on(PL_curpad[off]);
172 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix, I32 saweval)
179 register PERL_CONTEXT *cx;
181 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
182 AV *curlist = CvPADLIST(cv);
183 SV **svp = av_fetch(curlist, 0, FALSE);
186 if (!svp || *svp == &PL_sv_undef)
189 svp = AvARRAY(curname);
190 for (off = AvFILLp(curname); off > 0; off--) {
191 if ((sv = svp[off]) &&
192 sv != &PL_sv_undef &&
194 seq > I_32(SvNVX(sv)) &&
195 strEQ(SvPVX(sv), name))
206 return 0; /* don't clone from inactive stack frame */
210 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
211 oldsv = *av_fetch(oldpad, off, TRUE);
212 if (!newoff) { /* Not a mere clone operation. */
213 SV *namesv = NEWSV(1103,0);
214 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
215 sv_upgrade(namesv, SVt_PVNV);
216 sv_setpv(namesv, name);
217 av_store(PL_comppad_name, newoff, namesv);
218 SvNVX(namesv) = (double)PL_curcop->cop_seq;
219 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
220 SvFAKE_on(namesv); /* A ref, not a real var */
221 if (SvOBJECT(svp[off])) { /* A typed var */
223 (void)SvUPGRADE(namesv, SVt_PVMG);
224 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(svp[off]));
227 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
228 /* "It's closures all the way down." */
229 CvCLONE_on(PL_compcv);
231 if (CvANON(PL_compcv))
232 oldsv = Nullsv; /* no need to keep ref */
237 bcv && bcv != cv && !CvCLONE(bcv);
238 bcv = CvOUTSIDE(bcv))
244 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
247 "Variable \"%s\" may be unavailable",
255 else if (!CvUNIQUE(PL_compcv)) {
256 if (PL_dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
257 warn("Variable \"%s\" will not stay shared", name);
260 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
266 /* Nothing in current lexical context--try eval's context, if any.
267 * This is necessary to let the perldb get at lexically scoped variables.
268 * XXX This will also probably interact badly with eval tree caching.
271 for (i = cx_ix; i >= 0; i--) {
273 switch (CxTYPE(cx)) {
275 if (i == 0 && saweval) {
276 seq = cxstack[saweval].blk_oldcop->cop_seq;
277 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval);
281 switch (cx->blk_eval.old_op_type) {
287 /* require must have its own scope */
295 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
296 saweval = i; /* so we know where we were called from */
299 seq = cxstack[saweval].blk_oldcop->cop_seq;
300 return pad_findlex(name, newoff, seq, cv, i-1, saweval);
308 pad_findmy(char *name)
314 SV **svp = AvARRAY(PL_comppad_name);
315 U32 seq = PL_cop_seqmax;
321 * Special case to get lexical (and hence per-thread) @_.
322 * XXX I need to find out how to tell at parse-time whether use
323 * of @_ should refer to a lexical (from a sub) or defgv (global
324 * scope and maybe weird sub-ish things like formats). See
325 * startsub in perly.y. It's possible that @_ could be lexical
326 * (at least from subs) even in non-threaded perl.
328 if (strEQ(name, "@_"))
329 return 0; /* success. (NOT_IN_PAD indicates failure) */
330 #endif /* USE_THREADS */
332 /* The one we're looking for is probably just before comppad_name_fill. */
333 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
334 if ((sv = svp[off]) &&
335 sv != &PL_sv_undef &&
338 seq > I_32(SvNVX(sv)))) &&
339 strEQ(SvPVX(sv), name))
342 return (PADOFFSET)off;
343 pendoff = off; /* this pending def. will override import */
347 outside = CvOUTSIDE(PL_compcv);
349 /* Check if if we're compiling an eval'', and adjust seq to be the
350 * eval's seq number. This depends on eval'' having a non-null
351 * CvOUTSIDE() while it is being compiled. The eval'' itself is
352 * identified by CvUNIQUE being set and CvGV being null. */
353 if (outside && CvUNIQUE(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
354 cx = &cxstack[cxstack_ix];
356 seq = cx->blk_oldcop->cop_seq;
359 /* See if it's in a nested scope */
360 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0);
362 /* If there is a pending local definition, this new alias must die */
364 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
365 return off; /* pad_findlex returns 0 for failure...*/
367 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
371 pad_leavemy(I32 fill)
374 SV **svp = AvARRAY(PL_comppad_name);
376 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
377 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
378 if ((sv = svp[off]) && sv != &PL_sv_undef)
379 warn("%s never introduced", SvPVX(sv));
382 /* "Deintroduce" my variables that are leaving with this scope. */
383 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
384 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
385 SvIVX(sv) = PL_cop_seqmax;
390 pad_alloc(I32 optype, U32 tmptype)
396 if (AvARRAY(PL_comppad) != PL_curpad)
397 croak("panic: pad_alloc");
398 if (PL_pad_reset_pending)
400 if (tmptype & SVs_PADMY) {
402 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
403 } while (SvPADBUSY(sv)); /* need a fresh one */
404 retval = AvFILLp(PL_comppad);
407 SV **names = AvARRAY(PL_comppad_name);
408 SSize_t names_fill = AvFILLp(PL_comppad_name);
411 * "foreach" index vars temporarily become aliases to non-"my"
412 * values. Thus we must skip, not just pad values that are
413 * marked as current pad values, but also those with names.
415 if (++PL_padix <= names_fill &&
416 (sv = names[PL_padix]) && sv != &PL_sv_undef)
418 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
419 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
424 SvFLAGS(sv) |= tmptype;
425 PL_curpad = AvARRAY(PL_comppad);
427 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
428 (unsigned long) thr, (unsigned long) PL_curpad,
429 (long) retval, op_name[optype]));
431 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
432 (unsigned long) PL_curpad,
433 (long) retval, op_name[optype]));
434 #endif /* USE_THREADS */
435 return (PADOFFSET)retval;
443 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
444 (unsigned long) thr, (unsigned long) PL_curpad, po));
447 croak("panic: pad_sv po");
448 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
449 (unsigned long) PL_curpad, po));
450 #endif /* USE_THREADS */
451 return PL_curpad[po]; /* eventually we'll turn this into a macro */
455 pad_free(PADOFFSET po)
460 if (AvARRAY(PL_comppad) != PL_curpad)
461 croak("panic: pad_free curpad");
463 croak("panic: pad_free po");
465 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
466 (unsigned long) thr, (unsigned long) PL_curpad, po));
468 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
469 (unsigned long) PL_curpad, po));
470 #endif /* USE_THREADS */
471 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
472 SvPADTMP_off(PL_curpad[po]);
473 if ((I32)po < PL_padix)
478 pad_swipe(PADOFFSET po)
481 if (AvARRAY(PL_comppad) != PL_curpad)
482 croak("panic: pad_swipe curpad");
484 croak("panic: pad_swipe po");
486 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
487 (unsigned long) thr, (unsigned long) PL_curpad, po));
489 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
490 (unsigned long) PL_curpad, po));
491 #endif /* USE_THREADS */
492 SvPADTMP_off(PL_curpad[po]);
493 PL_curpad[po] = NEWSV(1107,0);
494 SvPADTMP_on(PL_curpad[po]);
495 if ((I32)po < PL_padix)
499 /* XXX pad_reset() is currently disabled because it results in serious bugs.
500 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
501 * on the stack by OPs that use them, there are several ways to get an alias
502 * to a shared TARG. Such an alias will change randomly and unpredictably.
503 * We avoid doing this until we can think of a Better Way.
508 #ifdef USE_BROKEN_PAD_RESET
512 if (AvARRAY(PL_comppad) != PL_curpad)
513 croak("panic: pad_reset curpad");
515 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
516 (unsigned long) thr, (unsigned long) PL_curpad));
518 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
519 (unsigned long) PL_curpad));
520 #endif /* USE_THREADS */
521 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
522 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
523 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
524 SvPADTMP_off(PL_curpad[po]);
526 PL_padix = PL_padix_floor;
529 PL_pad_reset_pending = FALSE;
533 /* find_threadsv is not reentrant */
535 find_threadsv(char *name)
541 /* We currently only handle names of a single character */
542 p = strchr(PL_threadsv_names, *name);
545 key = p - PL_threadsv_names;
546 svp = av_fetch(thr->threadsv, key, FALSE);
548 SV *sv = NEWSV(0, 0);
549 av_store(thr->threadsv, key, sv);
550 thr->threadsvp = AvARRAY(thr->threadsv);
552 * Some magic variables used to be automagically initialised
553 * in gv_fetchpv. Those which are now per-thread magicals get
554 * initialised here instead.
560 sv_setpv(sv, "\034");
561 sv_magic(sv, 0, 0, name, 1);
566 PL_sawampersand = TRUE;
580 /* XXX %! tied to Errno.pm needs to be added here.
581 * See gv_fetchpv(). */
585 sv_magic(sv, 0, 0, name, 1);
587 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
588 "find_threadsv: new SV %p for $%s%c\n",
589 sv, (*name < 32) ? "^" : "",
590 (*name < 32) ? toCTRL(*name) : *name));
594 #endif /* USE_THREADS */
601 register OP *kid, *nextkid;
603 if (!o || o->op_seq == (U16)-1)
606 if (o->op_flags & OPf_KIDS) {
607 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
608 nextkid = kid->op_sibling; /* Get before next freeing kid */
613 switch (o->op_type) {
615 o->op_targ = 0; /* Was holding old type, if any. */
618 o->op_targ = 0; /* Was holding hints. */
622 if (!(o->op_flags & OPf_SPECIAL))
626 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
628 #endif /* USE_THREADS */
630 if (!(o->op_flags & OPf_REF)
631 || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
637 SvREFCNT_dec(cGVOPo->op_gv);
641 Safefree(cCOPo->cop_label);
642 SvREFCNT_dec(cCOPo->cop_filegv);
645 SvREFCNT_dec(cSVOPo->op_sv);
651 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
655 Safefree(cPVOPo->op_pv);
658 op_free(cPMOPo->op_pmreplroot);
663 ReREFCNT_dec(cPMOPo->op_pmregexp);
668 pad_free(o->op_targ);
676 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
677 pad_free(o->op_targ);
678 o->op_targ = o->op_type;
679 o->op_type = OP_NULL;
680 o->op_ppaddr = ppaddr[OP_NULL];
683 /* Contextualizers */
685 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
695 /* establish postfix order */
696 if (cUNOPo->op_first) {
697 o->op_next = LINKLIST(cUNOPo->op_first);
698 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
700 kid->op_next = LINKLIST(kid->op_sibling);
715 if (o && o->op_flags & OPf_KIDS) {
716 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
726 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
728 line_t oldline = PL_curcop->cop_line;
730 if (PL_copline != NOLINE)
731 PL_curcop->cop_line = PL_copline;
732 warn("Found = in conditional, should be ==");
733 PL_curcop->cop_line = oldline;
743 /* assumes no premature commitment */
744 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
745 || o->op_type == OP_RETURN)
748 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
750 switch (o->op_type) {
752 if (o->op_private & OPpREPEAT_DOLIST)
753 null(((LISTOP*)cBINOPo->op_first)->op_first);
754 scalar(cBINOPo->op_first);
759 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
763 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
764 if (!kPMOP->op_pmreplroot)
765 deprecate("implicit split to @_");
773 if (o->op_flags & OPf_KIDS) {
774 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
780 kid = cLISTOPo->op_first;
782 while (kid = kid->op_sibling) {
788 WITH_THR(PL_curcop = &PL_compiling);
793 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
799 WITH_THR(PL_curcop = &PL_compiling);
812 /* assumes no premature commitment */
813 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || PL_error_count
814 || o->op_type == OP_RETURN)
817 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
819 switch (o->op_type) {
821 if (!(opargs[o->op_type] & OA_FOLDCONST))
825 if (o->op_flags & OPf_STACKED)
829 if (o->op_private == 4)
900 if (!(o->op_private & OPpLVAL_INTRO))
901 useless = op_desc[o->op_type];
908 if (!(o->op_private & OPpLVAL_INTRO) &&
909 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
910 useless = "a variable";
915 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
921 useless = "a constant";
922 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
924 else if (SvPOK(sv)) {
925 if (strnEQ(SvPVX(sv), "di", 2) ||
926 strnEQ(SvPVX(sv), "ds", 2) ||
927 strnEQ(SvPVX(sv), "ig", 2))
931 null(o); /* don't execute a constant */
932 SvREFCNT_dec(sv); /* don't even remember it */
936 o->op_type = OP_PREINC; /* pre-increment is faster */
937 o->op_ppaddr = ppaddr[OP_PREINC];
941 o->op_type = OP_PREDEC; /* pre-decrement is faster */
942 o->op_ppaddr = ppaddr[OP_PREDEC];
948 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
953 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
954 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
955 if (o->op_flags & OPf_STACKED)
961 if (!(o->op_flags & OPf_KIDS))
970 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
977 /* all requires must return a boolean value */
978 o->op_flags &= ~OPf_WANT;
981 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
982 if (!kPMOP->op_pmreplroot)
983 deprecate("implicit split to @_");
987 if (useless && PL_dowarn)
988 warn("Useless use of %s in void context", useless);
996 if (o && o->op_flags & OPf_KIDS) {
997 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1008 /* assumes no premature commitment */
1009 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1010 || o->op_type == OP_RETURN)
1013 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1015 switch (o->op_type) {
1018 list(cBINOPo->op_first);
1023 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1031 if (!(o->op_flags & OPf_KIDS))
1033 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1034 list(cBINOPo->op_first);
1035 return gen_constant_list(o);
1042 kid = cLISTOPo->op_first;
1044 while (kid = kid->op_sibling) {
1045 if (kid->op_sibling)
1050 WITH_THR(PL_curcop = &PL_compiling);
1054 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1055 if (kid->op_sibling)
1060 WITH_THR(PL_curcop = &PL_compiling);
1063 /* all requires must return a boolean value */
1064 o->op_flags &= ~OPf_WANT;
1076 if (o->op_type == OP_LINESEQ ||
1077 o->op_type == OP_SCOPE ||
1078 o->op_type == OP_LEAVE ||
1079 o->op_type == OP_LEAVETRY)
1082 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1083 if (kid->op_sibling) {
1087 PL_curcop = &PL_compiling;
1089 o->op_flags &= ~OPf_PARENS;
1090 if (PL_hints & HINT_BLOCK_SCOPE)
1091 o->op_flags |= OPf_PARENS;
1094 o = newOP(OP_STUB, 0);
1099 modkids(OP *o, I32 type)
1102 if (o && o->op_flags & OPf_KIDS) {
1103 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1110 mod(OP *o, I32 type)
1116 if (!o || PL_error_count)
1119 switch (o->op_type) {
1124 if (!(o->op_private & (OPpCONST_ARYBASE)))
1126 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1127 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1131 SAVEI32(PL_compiling.cop_arybase);
1132 PL_compiling.cop_arybase = 0;
1134 else if (type == OP_REFGEN)
1137 croak("That use of $[ is unsupported");
1140 if (o->op_flags & OPf_PARENS)
1144 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1145 !(o->op_flags & OPf_STACKED)) {
1146 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1147 o->op_ppaddr = ppaddr[OP_RV2CV];
1148 assert(cUNOPo->op_first->op_type == OP_NULL);
1149 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1155 /* grep, foreach, subcalls, refgen */
1156 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1158 yyerror(form("Can't modify %s in %s",
1159 op_desc[o->op_type],
1160 type ? op_desc[type] : "local"));
1174 case OP_RIGHT_SHIFT:
1183 if (!(o->op_flags & OPf_STACKED))
1189 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1195 if (!type && cUNOPo->op_first->op_type != OP_GV)
1196 croak("Can't localize through a reference");
1197 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1198 PL_modcount = 10000;
1199 return o; /* Treat \(@foo) like ordinary list. */
1203 if (scalar_mod_type(o, type))
1205 ref(cUNOPo->op_first, o->op_type);
1214 PL_modcount = 10000;
1217 if (!type && cUNOPo->op_first->op_type != OP_GV)
1218 croak("Can't localize through a reference");
1219 ref(cUNOPo->op_first, o->op_type);
1223 PL_hints |= HINT_BLOCK_SCOPE;
1231 PL_modcount = 10000;
1232 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1233 return o; /* Treat \(@foo) like ordinary list. */
1234 if (scalar_mod_type(o, type))
1240 croak("Can't localize lexical variable %s",
1241 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), PL_na));
1246 PL_modcount++; /* XXX ??? */
1248 #endif /* USE_THREADS */
1254 if (type != OP_SASSIGN)
1258 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1264 pad_free(o->op_targ);
1265 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1266 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1267 if (o->op_flags & OPf_KIDS)
1268 mod(cBINOPo->op_first->op_sibling, type);
1273 ref(cBINOPo->op_first, o->op_type);
1274 if (type == OP_ENTERSUB &&
1275 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1276 o->op_private |= OPpLVAL_DEFER;
1283 if (o->op_flags & OPf_KIDS)
1284 mod(cLISTOPo->op_last, type);
1288 if (!(o->op_flags & OPf_KIDS))
1290 if (o->op_targ != OP_LIST) {
1291 mod(cBINOPo->op_first, type);
1296 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1300 o->op_flags |= OPf_MOD;
1302 if (type == OP_AASSIGN || type == OP_SASSIGN)
1303 o->op_flags |= OPf_SPECIAL|OPf_REF;
1305 o->op_private |= OPpLVAL_INTRO;
1306 o->op_flags &= ~OPf_SPECIAL;
1307 PL_hints |= HINT_BLOCK_SCOPE;
1309 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1310 o->op_flags |= OPf_REF;
1315 scalar_mod_type(OP *o, I32 type)
1319 if (o->op_type == OP_RV2GV)
1343 case OP_RIGHT_SHIFT:
1353 case OP_ANDASSIGN: /* may work later */
1354 case OP_ORASSIGN: /* may work later */
1362 refkids(OP *o, I32 type)
1365 if (o && o->op_flags & OPf_KIDS) {
1366 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1373 ref(OP *o, I32 type)
1377 if (!o || PL_error_count)
1380 switch (o->op_type) {
1382 if ((type == OP_DEFINED || type == OP_LOCK) &&
1383 !(o->op_flags & OPf_STACKED)) {
1384 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1385 o->op_ppaddr = ppaddr[OP_RV2CV];
1386 assert(cUNOPo->op_first->op_type == OP_NULL);
1387 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1388 o->op_flags |= OPf_SPECIAL;
1393 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1397 ref(cUNOPo->op_first, o->op_type);
1400 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1401 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1402 : type == OP_RV2HV ? OPpDEREF_HV
1404 o->op_flags |= OPf_MOD;
1409 o->op_flags |= OPf_MOD; /* XXX ??? */
1414 o->op_flags |= OPf_REF;
1417 ref(cUNOPo->op_first, o->op_type);
1422 o->op_flags |= OPf_REF;
1427 if (!(o->op_flags & OPf_KIDS))
1429 ref(cBINOPo->op_first, type);
1433 ref(cBINOPo->op_first, o->op_type);
1434 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1435 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1436 : type == OP_RV2HV ? OPpDEREF_HV
1438 o->op_flags |= OPf_MOD;
1446 if (!(o->op_flags & OPf_KIDS))
1448 ref(cLISTOPo->op_last, type);
1463 if (!o || PL_error_count)
1467 if (type == OP_LIST) {
1468 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1470 } else if (type == OP_UNDEF) {
1472 } else if (type != OP_PADSV &&
1475 type != OP_PUSHMARK)
1477 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1480 o->op_flags |= OPf_MOD;
1481 o->op_private |= OPpLVAL_INTRO;
1489 o->op_flags |= OPf_PARENS;
1494 bind_match(I32 type, OP *left, OP *right)
1499 (left->op_type == OP_RV2AV ||
1500 left->op_type == OP_RV2HV ||
1501 left->op_type == OP_PADAV ||
1502 left->op_type == OP_PADHV)) {
1503 char *desc = op_desc[(right->op_type == OP_SUBST ||
1504 right->op_type == OP_TRANS)
1505 ? right->op_type : OP_MATCH];
1506 char *sample = ((left->op_type == OP_RV2AV ||
1507 left->op_type == OP_PADAV)
1508 ? "@array" : "%hash");
1509 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1512 if (right->op_type == OP_MATCH ||
1513 right->op_type == OP_SUBST ||
1514 right->op_type == OP_TRANS) {
1515 right->op_flags |= OPf_STACKED;
1516 if (right->op_type != OP_MATCH)
1517 left = mod(left, right->op_type);
1518 if (right->op_type == OP_TRANS)
1519 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1521 o = prepend_elem(right->op_type, scalar(left), right);
1523 return newUNOP(OP_NOT, 0, scalar(o));
1527 return bind_match(type, left,
1528 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1536 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1537 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1544 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1545 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1546 o->op_type = OP_LEAVE;
1547 o->op_ppaddr = ppaddr[OP_LEAVE];
1550 if (o->op_type == OP_LINESEQ) {
1552 o->op_type = OP_SCOPE;
1553 o->op_ppaddr = ppaddr[OP_SCOPE];
1554 kid = ((LISTOP*)o)->op_first;
1555 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1556 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1561 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1571 SAVESPTR(GvHV(PL_hintgv));
1572 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1573 SAVEFREESV(GvHV(PL_hintgv));
1577 block_start(int full)
1580 int retval = PL_savestack_ix;
1582 SAVEI32(PL_comppad_name_floor);
1584 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1585 PL_comppad_name_floor = PL_comppad_name_fill;
1587 PL_comppad_name_floor = 0;
1589 SAVEI32(PL_min_intro_pending);
1590 SAVEI32(PL_max_intro_pending);
1591 PL_min_intro_pending = 0;
1592 SAVEI32(PL_comppad_name_fill);
1593 SAVEI32(PL_padix_floor);
1594 PL_padix_floor = PL_padix;
1595 PL_pad_reset_pending = FALSE;
1597 PL_hints &= ~HINT_BLOCK_SCOPE;
1602 block_end(I32 floor, OP *seq)
1605 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1606 OP* retval = scalarseq(seq);
1608 PL_pad_reset_pending = FALSE;
1610 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1611 pad_leavemy(PL_comppad_name_fill);
1620 OP *o = newOP(OP_THREADSV, 0);
1621 o->op_targ = find_threadsv("_");
1624 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1625 #endif /* USE_THREADS */
1633 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1634 PL_eval_start = linklist(PL_eval_root);
1635 PL_eval_root->op_next = 0;
1636 peep(PL_eval_start);
1641 PL_main_root = scope(sawparens(scalarvoid(o)));
1642 PL_curcop = &PL_compiling;
1643 PL_main_start = LINKLIST(PL_main_root);
1644 PL_main_root->op_next = 0;
1645 peep(PL_main_start);
1648 /* Register with debugger */
1650 CV *cv = perl_get_cv("DB::postponed", FALSE);
1654 XPUSHs((SV*)PL_compiling.cop_filegv);
1656 perl_call_sv((SV*)cv, G_DISCARD);
1663 localize(OP *o, I32 lex)
1665 if (o->op_flags & OPf_PARENS)
1668 if (PL_dowarn && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1670 for (s = PL_bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1671 if (*s == ';' || *s == '=')
1672 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1676 PL_in_my_stash = Nullhv;
1680 return mod(o, OP_NULL); /* a bit kludgey */
1686 if (o->op_type == OP_LIST) {
1689 o2 = newOP(OP_THREADSV, 0);
1690 o2->op_targ = find_threadsv(";");
1692 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1693 #endif /* USE_THREADS */
1694 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1700 fold_constants(register OP *o)
1704 I32 type = o->op_type;
1707 if (opargs[type] & OA_RETSCALAR)
1709 if (opargs[type] & OA_TARGET)
1710 o->op_targ = pad_alloc(type, SVs_PADTMP);
1712 if ((opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1713 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1715 if (!(opargs[type] & OA_FOLDCONST))
1730 if (o->op_private & OPpLOCALE)
1735 goto nope; /* Don't try to run w/ errors */
1737 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1738 if (curop->op_type != OP_CONST &&
1739 curop->op_type != OP_LIST &&
1740 curop->op_type != OP_SCALAR &&
1741 curop->op_type != OP_NULL &&
1742 curop->op_type != OP_PUSHMARK) {
1747 curop = LINKLIST(o);
1751 sv = *(PL_stack_sp--);
1752 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1753 pad_swipe(o->op_targ);
1754 else if (SvTEMP(sv)) { /* grab mortal temp? */
1755 (void)SvREFCNT_inc(sv);
1759 if (type == OP_RV2GV)
1760 return newGVOP(OP_GV, 0, (GV*)sv);
1762 /* try to smush double to int, but don't smush -2.0 to -2 */
1763 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1767 if ((double)iv == SvNV(sv)) {
1772 SvIOK_off(sv); /* undo SvIV() damage */
1774 return newSVOP(OP_CONST, 0, sv);
1778 if (!(opargs[type] & OA_OTHERINT))
1781 if (!(PL_hints & HINT_INTEGER)) {
1782 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1785 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1786 if (curop->op_type == OP_CONST) {
1787 if (SvIOK(((SVOP*)curop)->op_sv))
1791 if (opargs[curop->op_type] & OA_RETINTEGER)
1795 o->op_ppaddr = ppaddr[++(o->op_type)];
1802 gen_constant_list(register OP *o)
1806 I32 oldtmps_floor = PL_tmps_floor;
1810 return o; /* Don't attempt to run with errors */
1812 PL_op = curop = LINKLIST(o);
1818 PL_tmps_floor = oldtmps_floor;
1820 o->op_type = OP_RV2AV;
1821 o->op_ppaddr = ppaddr[OP_RV2AV];
1822 curop = ((UNOP*)o)->op_first;
1823 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1830 convert(I32 type, I32 flags, OP *o)
1835 if (!o || o->op_type != OP_LIST)
1836 o = newLISTOP(OP_LIST, 0, o, Nullop);
1838 o->op_flags &= ~OPf_WANT;
1840 if (!(opargs[type] & OA_MARK))
1841 null(cLISTOPo->op_first);
1844 o->op_ppaddr = ppaddr[type];
1845 o->op_flags |= flags;
1847 o = CHECKOP(type, o);
1848 if (o->op_type != type)
1851 if (cLISTOPo->op_children < 7) {
1852 /* XXX do we really need to do this if we're done appending?? */
1853 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1855 cLISTOPo->op_last = last; /* in case check substituted last arg */
1858 return fold_constants(o);
1861 /* List constructors */
1864 append_elem(I32 type, OP *first, OP *last)
1872 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1873 return newLISTOP(type, 0, first, last);
1875 if (first->op_flags & OPf_KIDS)
1876 ((LISTOP*)first)->op_last->op_sibling = last;
1878 first->op_flags |= OPf_KIDS;
1879 ((LISTOP*)first)->op_first = last;
1881 ((LISTOP*)first)->op_last = last;
1882 ((LISTOP*)first)->op_children++;
1887 append_list(I32 type, LISTOP *first, LISTOP *last)
1895 if (first->op_type != type)
1896 return prepend_elem(type, (OP*)first, (OP*)last);
1898 if (last->op_type != type)
1899 return append_elem(type, (OP*)first, (OP*)last);
1901 first->op_last->op_sibling = last->op_first;
1902 first->op_last = last->op_last;
1903 first->op_children += last->op_children;
1904 if (first->op_children)
1905 first->op_flags |= OPf_KIDS;
1912 prepend_elem(I32 type, OP *first, OP *last)
1920 if (last->op_type == type) {
1921 if (type == OP_LIST) { /* already a PUSHMARK there */
1922 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1923 ((LISTOP*)last)->op_first->op_sibling = first;
1926 if (!(last->op_flags & OPf_KIDS)) {
1927 ((LISTOP*)last)->op_last = first;
1928 last->op_flags |= OPf_KIDS;
1930 first->op_sibling = ((LISTOP*)last)->op_first;
1931 ((LISTOP*)last)->op_first = first;
1933 ((LISTOP*)last)->op_children++;
1937 return newLISTOP(type, 0, first, last);
1945 return newOP(OP_STUB, 0);
1951 if (!o || o->op_type != OP_LIST)
1952 o = newLISTOP(OP_LIST, 0, o, Nullop);
1958 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1962 Newz(1101, listop, 1, LISTOP);
1964 listop->op_type = type;
1965 listop->op_ppaddr = ppaddr[type];
1966 listop->op_children = (first != 0) + (last != 0);
1967 listop->op_flags = flags;
1971 else if (!first && last)
1974 first->op_sibling = last;
1975 listop->op_first = first;
1976 listop->op_last = last;
1977 if (type == OP_LIST) {
1979 pushop = newOP(OP_PUSHMARK, 0);
1980 pushop->op_sibling = first;
1981 listop->op_first = pushop;
1982 listop->op_flags |= OPf_KIDS;
1984 listop->op_last = pushop;
1986 else if (listop->op_children)
1987 listop->op_flags |= OPf_KIDS;
1993 newOP(I32 type, I32 flags)
1996 Newz(1101, o, 1, OP);
1998 o->op_ppaddr = ppaddr[type];
1999 o->op_flags = flags;
2002 o->op_private = 0 + (flags >> 8);
2003 if (opargs[type] & OA_RETSCALAR)
2005 if (opargs[type] & OA_TARGET)
2006 o->op_targ = pad_alloc(type, SVs_PADTMP);
2007 return CHECKOP(type, o);
2011 newUNOP(I32 type, I32 flags, OP *first)
2016 first = newOP(OP_STUB, 0);
2017 if (opargs[type] & OA_MARK)
2018 first = force_list(first);
2020 Newz(1101, unop, 1, UNOP);
2021 unop->op_type = type;
2022 unop->op_ppaddr = ppaddr[type];
2023 unop->op_first = first;
2024 unop->op_flags = flags | OPf_KIDS;
2025 unop->op_private = 1 | (flags >> 8);
2026 unop = (UNOP*) CHECKOP(type, unop);
2030 return fold_constants((OP *) unop);
2034 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2037 Newz(1101, binop, 1, BINOP);
2040 first = newOP(OP_NULL, 0);
2042 binop->op_type = type;
2043 binop->op_ppaddr = ppaddr[type];
2044 binop->op_first = first;
2045 binop->op_flags = flags | OPf_KIDS;
2048 binop->op_private = 1 | (flags >> 8);
2051 binop->op_private = 2 | (flags >> 8);
2052 first->op_sibling = last;
2055 binop = (BINOP*)CHECKOP(type, binop);
2059 binop->op_last = last = binop->op_first->op_sibling;
2061 return fold_constants((OP *)binop);
2065 pmtrans(OP *o, OP *expr, OP *repl)
2067 SV *tstr = ((SVOP*)expr)->op_sv;
2068 SV *rstr = ((SVOP*)repl)->op_sv;
2071 register U8 *t = (U8*)SvPV(tstr, tlen);
2072 register U8 *r = (U8*)SvPV(rstr, rlen);
2078 register short *tbl;
2080 tbl = (short*)cPVOPo->op_pv;
2081 complement = o->op_private & OPpTRANS_COMPLEMENT;
2082 Delete = o->op_private & OPpTRANS_DELETE;
2083 squash = o->op_private & OPpTRANS_SQUASH;
2086 Zero(tbl, 256, short);
2087 for (i = 0; i < tlen; i++)
2089 for (i = 0, j = 0; i < 256; i++) {
2105 if (!rlen && !Delete) {
2108 o->op_private |= OPpTRANS_COUNTONLY;
2110 for (i = 0; i < 256; i++)
2112 for (i = 0, j = 0; i < tlen; i++,j++) {
2115 if (tbl[t[i]] == -1)
2121 if (tbl[t[i]] == -1)
2132 newPMOP(I32 type, I32 flags)
2137 Newz(1101, pmop, 1, PMOP);
2138 pmop->op_type = type;
2139 pmop->op_ppaddr = ppaddr[type];
2140 pmop->op_flags = flags;
2141 pmop->op_private = 0 | (flags >> 8);
2143 if (PL_hints & HINT_RE_TAINT)
2144 pmop->op_pmpermflags |= PMf_RETAINT;
2145 if (PL_hints & HINT_LOCALE)
2146 pmop->op_pmpermflags |= PMf_LOCALE;
2147 pmop->op_pmflags = pmop->op_pmpermflags;
2149 /* link into pm list */
2150 if (type != OP_TRANS && PL_curstash) {
2151 pmop->op_pmnext = HvPMROOT(PL_curstash);
2152 HvPMROOT(PL_curstash) = pmop;
2159 pmruntime(OP *o, OP *expr, OP *repl)
2164 I32 repl_has_vars = 0;
2166 if (o->op_type == OP_TRANS)
2167 return pmtrans(o, expr, repl);
2169 PL_hints |= HINT_BLOCK_SCOPE;
2172 if (expr->op_type == OP_CONST) {
2174 SV *pat = ((SVOP*)expr)->op_sv;
2175 char *p = SvPV(pat, plen);
2176 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2177 sv_setpvn(pat, "\\s+", 3);
2178 p = SvPV(pat, plen);
2179 pm->op_pmflags |= PMf_SKIPWHITE;
2181 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2182 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2183 pm->op_pmflags |= PMf_WHITE;
2187 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2188 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2190 : OP_REGCMAYBE),0,expr);
2192 Newz(1101, rcop, 1, LOGOP);
2193 rcop->op_type = OP_REGCOMP;
2194 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2195 rcop->op_first = scalar(expr);
2196 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2197 ? (OPf_SPECIAL | OPf_KIDS)
2199 rcop->op_private = 1;
2202 /* establish postfix order */
2203 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2205 rcop->op_next = expr;
2206 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2209 rcop->op_next = LINKLIST(expr);
2210 expr->op_next = (OP*)rcop;
2213 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2218 if (pm->op_pmflags & PMf_EVAL)
2221 else if (repl->op_type == OP_THREADSV
2222 && strchr("&`'123456789+",
2223 PL_threadsv_names[repl->op_targ]))
2227 #endif /* USE_THREADS */
2228 else if (repl->op_type == OP_CONST)
2232 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2233 if (opargs[curop->op_type] & OA_DANGEROUS) {
2235 if (curop->op_type == OP_THREADSV) {
2237 if (strchr("&`'123456789+", curop->op_private))
2241 if (curop->op_type == OP_GV) {
2242 GV *gv = ((GVOP*)curop)->op_gv;
2244 if (strchr("&`'123456789+", *GvENAME(gv)))
2247 #endif /* USE_THREADS */
2248 else if (curop->op_type == OP_RV2CV)
2250 else if (curop->op_type == OP_RV2SV ||
2251 curop->op_type == OP_RV2AV ||
2252 curop->op_type == OP_RV2HV ||
2253 curop->op_type == OP_RV2GV) {
2254 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2257 else if (curop->op_type == OP_PADSV ||
2258 curop->op_type == OP_PADAV ||
2259 curop->op_type == OP_PADHV ||
2260 curop->op_type == OP_PADANY) {
2263 else if (curop->op_type == OP_PUSHRE)
2264 ; /* Okay here, dangerous in newASSIGNOP */
2273 && (!pm->op_pmregexp
2274 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2275 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2276 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2277 prepend_elem(o->op_type, scalar(repl), o);
2280 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2281 pm->op_pmflags |= PMf_MAYBE_CONST;
2282 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2284 Newz(1101, rcop, 1, LOGOP);
2285 rcop->op_type = OP_SUBSTCONT;
2286 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2287 rcop->op_first = scalar(repl);
2288 rcop->op_flags |= OPf_KIDS;
2289 rcop->op_private = 1;
2292 /* establish postfix order */
2293 rcop->op_next = LINKLIST(repl);
2294 repl->op_next = (OP*)rcop;
2296 pm->op_pmreplroot = scalar((OP*)rcop);
2297 pm->op_pmreplstart = LINKLIST(rcop);
2306 newSVOP(I32 type, I32 flags, SV *sv)
2309 Newz(1101, svop, 1, SVOP);
2310 svop->op_type = type;
2311 svop->op_ppaddr = ppaddr[type];
2313 svop->op_next = (OP*)svop;
2314 svop->op_flags = flags;
2315 if (opargs[type] & OA_RETSCALAR)
2317 if (opargs[type] & OA_TARGET)
2318 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2319 return CHECKOP(type, svop);
2323 newGVOP(I32 type, I32 flags, GV *gv)
2327 Newz(1101, gvop, 1, GVOP);
2328 gvop->op_type = type;
2329 gvop->op_ppaddr = ppaddr[type];
2330 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2331 gvop->op_next = (OP*)gvop;
2332 gvop->op_flags = flags;
2333 if (opargs[type] & OA_RETSCALAR)
2335 if (opargs[type] & OA_TARGET)
2336 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2337 return CHECKOP(type, gvop);
2341 newPVOP(I32 type, I32 flags, char *pv)
2344 Newz(1101, pvop, 1, PVOP);
2345 pvop->op_type = type;
2346 pvop->op_ppaddr = ppaddr[type];
2348 pvop->op_next = (OP*)pvop;
2349 pvop->op_flags = flags;
2350 if (opargs[type] & OA_RETSCALAR)
2352 if (opargs[type] & OA_TARGET)
2353 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2354 return CHECKOP(type, pvop);
2363 save_hptr(&PL_curstash);
2364 save_item(PL_curstname);
2369 name = SvPV(sv, len);
2370 PL_curstash = gv_stashpvn(name,len,TRUE);
2371 sv_setpvn(PL_curstname, name, len);
2375 sv_setpv(PL_curstname,"<none>");
2376 PL_curstash = Nullhv;
2378 PL_hints |= HINT_BLOCK_SCOPE;
2379 PL_copline = NOLINE;
2384 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2392 if (id->op_type != OP_CONST)
2393 croak("Module name must be constant");
2397 if(version != Nullop) {
2398 SV *vesv = ((SVOP*)version)->op_sv;
2400 if (arg == Nullop && !SvNIOK(vesv)) {
2407 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2408 croak("Version number must be constant number");
2410 /* Make copy of id so we don't free it twice */
2411 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2413 /* Fake up a method call to VERSION */
2414 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2415 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2416 append_elem(OP_LIST,
2417 prepend_elem(OP_LIST, pack, list(version)),
2418 newUNOP(OP_METHOD, 0, meth)));
2422 /* Fake up an import/unimport */
2423 if (arg && arg->op_type == OP_STUB)
2424 imop = arg; /* no import on explicit () */
2425 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2426 imop = Nullop; /* use 5.0; */
2429 /* Make copy of id so we don't free it twice */
2430 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2431 meth = newSVOP(OP_CONST, 0,
2433 ? newSVpv("import", 6)
2434 : newSVpv("unimport", 8)
2436 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2437 append_elem(OP_LIST,
2438 prepend_elem(OP_LIST, pack, list(arg)),
2439 newUNOP(OP_METHOD, 0, meth)));
2442 /* Fake up a require */
2443 rqop = newUNOP(OP_REQUIRE, 0, id);
2445 /* Fake up the BEGIN {}, which does its thing immediately. */
2447 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2449 append_elem(OP_LINESEQ,
2450 append_elem(OP_LINESEQ,
2451 newSTATEOP(0, Nullch, rqop),
2452 newSTATEOP(0, Nullch, veop)),
2453 newSTATEOP(0, Nullch, imop) ));
2455 PL_copline = NOLINE;
2460 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2462 return newBINOP(OP_LSLICE, flags,
2463 list(force_list(subscript)),
2464 list(force_list(listval)) );
2468 list_assignment(register OP *o)
2473 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2474 o = cUNOPo->op_first;
2476 if (o->op_type == OP_COND_EXPR) {
2477 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2478 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2483 yyerror("Assignment to both a list and a scalar");
2487 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2488 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2489 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2492 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2495 if (o->op_type == OP_RV2SV)
2502 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2507 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2508 return newLOGOP(optype, 0,
2509 mod(scalar(left), optype),
2510 newUNOP(OP_SASSIGN, 0, scalar(right)));
2513 return newBINOP(optype, OPf_STACKED,
2514 mod(scalar(left), optype), scalar(right));
2518 if (list_assignment(left)) {
2521 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2522 left = mod(left, OP_AASSIGN);
2530 o = newBINOP(OP_AASSIGN, flags,
2531 list(force_list(right)),
2532 list(force_list(left)) );
2533 o->op_private = 0 | (flags >> 8);
2534 if (!(left->op_private & OPpLVAL_INTRO)) {
2538 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2539 if (opargs[curop->op_type] & OA_DANGEROUS) {
2540 if (curop->op_type == OP_GV) {
2541 GV *gv = ((GVOP*)curop)->op_gv;
2542 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2544 SvCUR(gv) = PL_generation;
2546 else if (curop->op_type == OP_PADSV ||
2547 curop->op_type == OP_PADAV ||
2548 curop->op_type == OP_PADHV ||
2549 curop->op_type == OP_PADANY) {
2550 SV **svp = AvARRAY(PL_comppad_name);
2551 SV *sv = svp[curop->op_targ];
2552 if (SvCUR(sv) == PL_generation)
2554 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2556 else if (curop->op_type == OP_RV2CV)
2558 else if (curop->op_type == OP_RV2SV ||
2559 curop->op_type == OP_RV2AV ||
2560 curop->op_type == OP_RV2HV ||
2561 curop->op_type == OP_RV2GV) {
2562 if (lastop->op_type != OP_GV) /* funny deref? */
2565 else if (curop->op_type == OP_PUSHRE) {
2566 if (((PMOP*)curop)->op_pmreplroot) {
2567 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2568 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2570 SvCUR(gv) = PL_generation;
2579 o->op_private = OPpASSIGN_COMMON;
2581 if (right && right->op_type == OP_SPLIT) {
2583 if ((tmpop = ((LISTOP*)right)->op_first) &&
2584 tmpop->op_type == OP_PUSHRE)
2586 PMOP *pm = (PMOP*)tmpop;
2587 if (left->op_type == OP_RV2AV &&
2588 !(left->op_private & OPpLVAL_INTRO) &&
2589 !(o->op_private & OPpASSIGN_COMMON) )
2591 tmpop = ((UNOP*)left)->op_first;
2592 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2593 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2594 pm->op_pmflags |= PMf_ONCE;
2595 tmpop = cUNOPo->op_first; /* to list (nulled) */
2596 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2597 tmpop->op_sibling = Nullop; /* don't free split */
2598 right->op_next = tmpop->op_next; /* fix starting loc */
2599 op_free(o); /* blow off assign */
2600 right->op_flags &= ~OPf_WANT;
2601 /* "I don't know and I don't care." */
2606 if (PL_modcount < 10000 &&
2607 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2609 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2611 sv_setiv(sv, PL_modcount+1);
2619 right = newOP(OP_UNDEF, 0);
2620 if (right->op_type == OP_READLINE) {
2621 right->op_flags |= OPf_STACKED;
2622 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2625 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2626 o = newBINOP(OP_SASSIGN, flags,
2627 scalar(right), mod(scalar(left), OP_SASSIGN) );
2639 newSTATEOP(I32 flags, char *label, OP *o)
2642 U32 seq = intro_my();
2645 Newz(1101, cop, 1, COP);
2646 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2647 cop->op_type = OP_DBSTATE;
2648 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2651 cop->op_type = OP_NEXTSTATE;
2652 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2654 cop->op_flags = flags;
2655 cop->op_private = 0 | (flags >> 8);
2657 cop->op_private |= NATIVE_HINTS;
2659 cop->op_next = (OP*)cop;
2662 cop->cop_label = label;
2663 PL_hints |= HINT_BLOCK_SCOPE;
2666 cop->cop_arybase = PL_curcop->cop_arybase;
2668 if (PL_copline == NOLINE)
2669 cop->cop_line = PL_curcop->cop_line;
2671 cop->cop_line = PL_copline;
2672 PL_copline = NOLINE;
2674 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2675 cop->cop_stash = PL_curstash;
2677 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2678 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2679 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2680 (void)SvIOK_on(*svp);
2682 SvSTASH(*svp) = (HV*)cop;
2686 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2689 /* "Introduce" my variables to visible status. */
2697 if (! PL_min_intro_pending)
2698 return PL_cop_seqmax;
2700 svp = AvARRAY(PL_comppad_name);
2701 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2702 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2703 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
2704 SvNVX(sv) = (double)PL_cop_seqmax;
2707 PL_min_intro_pending = 0;
2708 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2709 return PL_cop_seqmax++;
2713 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2715 return new_logop(type, flags, &first, &other);
2719 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2724 OP *first = *firstp;
2725 OP *other = *otherp;
2727 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2728 return newBINOP(type, flags, scalar(first), scalar(other));
2730 scalarboolean(first);
2731 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2732 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2733 if (type == OP_AND || type == OP_OR) {
2739 first = *firstp = cUNOPo->op_first;
2741 first->op_next = o->op_next;
2742 cUNOPo->op_first = Nullop;
2746 if (first->op_type == OP_CONST) {
2747 if (PL_dowarn && (first->op_private & OPpCONST_BARE))
2748 warn("Probable precedence problem on %s", op_desc[type]);
2749 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2760 else if (first->op_type == OP_WANTARRAY) {
2766 else if (PL_dowarn && (first->op_flags & OPf_KIDS)) {
2767 OP *k1 = ((UNOP*)first)->op_first;
2768 OP *k2 = k1->op_sibling;
2770 switch (first->op_type)
2773 if (k2 && k2->op_type == OP_READLINE
2774 && (k2->op_flags & OPf_STACKED)
2775 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2776 warnop = k2->op_type;
2780 if (k1->op_type == OP_READDIR
2781 || k1->op_type == OP_GLOB
2782 || k1->op_type == OP_EACH)
2783 warnop = k1->op_type;
2787 line_t oldline = PL_curcop->cop_line;
2788 PL_curcop->cop_line = PL_copline;
2789 warn("Value of %s%s can be \"0\"; test with defined()",
2791 ((warnop == OP_READLINE || warnop == OP_GLOB)
2792 ? " construct" : "() operator"));
2793 PL_curcop->cop_line = oldline;
2800 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2801 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2803 Newz(1101, logop, 1, LOGOP);
2805 logop->op_type = type;
2806 logop->op_ppaddr = ppaddr[type];
2807 logop->op_first = first;
2808 logop->op_flags = flags | OPf_KIDS;
2809 logop->op_other = LINKLIST(other);
2810 logop->op_private = 1 | (flags >> 8);
2812 /* establish postfix order */
2813 logop->op_next = LINKLIST(first);
2814 first->op_next = (OP*)logop;
2815 first->op_sibling = other;
2817 o = newUNOP(OP_NULL, 0, (OP*)logop);
2824 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2831 return newLOGOP(OP_AND, 0, first, trueop);
2833 return newLOGOP(OP_OR, 0, first, falseop);
2835 scalarboolean(first);
2836 if (first->op_type == OP_CONST) {
2837 if (SvTRUE(((SVOP*)first)->op_sv)) {
2848 else if (first->op_type == OP_WANTARRAY) {
2852 Newz(1101, condop, 1, CONDOP);
2854 condop->op_type = OP_COND_EXPR;
2855 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2856 condop->op_first = first;
2857 condop->op_flags = flags | OPf_KIDS;
2858 condop->op_true = LINKLIST(trueop);
2859 condop->op_false = LINKLIST(falseop);
2860 condop->op_private = 1 | (flags >> 8);
2862 /* establish postfix order */
2863 condop->op_next = LINKLIST(first);
2864 first->op_next = (OP*)condop;
2866 first->op_sibling = trueop;
2867 trueop->op_sibling = falseop;
2868 o = newUNOP(OP_NULL, 0, (OP*)condop);
2870 trueop->op_next = o;
2871 falseop->op_next = o;
2877 newRANGE(I32 flags, OP *left, OP *right)
2885 Newz(1101, condop, 1, CONDOP);
2887 condop->op_type = OP_RANGE;
2888 condop->op_ppaddr = ppaddr[OP_RANGE];
2889 condop->op_first = left;
2890 condop->op_flags = OPf_KIDS;
2891 condop->op_true = LINKLIST(left);
2892 condop->op_false = LINKLIST(right);
2893 condop->op_private = 1 | (flags >> 8);
2895 left->op_sibling = right;
2897 condop->op_next = (OP*)condop;
2898 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2899 flop = newUNOP(OP_FLOP, 0, flip);
2900 o = newUNOP(OP_NULL, 0, flop);
2903 left->op_next = flip;
2904 right->op_next = flop;
2906 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2907 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2908 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2909 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2911 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2912 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2915 if (!flip->op_private || !flop->op_private)
2916 linklist(o); /* blow off optimizer unless constant */
2922 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2927 int once = block && block->op_flags & OPf_SPECIAL &&
2928 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2931 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2932 return block; /* do {} while 0 does once */
2933 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2934 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2935 expr = newUNOP(OP_DEFINED, 0,
2936 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2937 } else if (expr->op_flags & OPf_KIDS) {
2938 OP *k1 = ((UNOP*)expr)->op_first;
2939 OP *k2 = (k1) ? k1->op_sibling : NULL;
2940 switch (expr->op_type) {
2942 if (k2 && k2->op_type == OP_READLINE
2943 && (k2->op_flags & OPf_STACKED)
2944 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2945 expr = newUNOP(OP_DEFINED, 0, expr);
2949 if (k1->op_type == OP_READDIR
2950 || k1->op_type == OP_GLOB
2951 || k1->op_type == OP_EACH)
2952 expr = newUNOP(OP_DEFINED, 0, expr);
2958 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2959 o = new_logop(OP_AND, 0, &expr, &listop);
2962 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2964 if (once && o != listop)
2965 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2968 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2970 o->op_flags |= flags;
2972 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2977 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2986 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2987 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2988 expr = newUNOP(OP_DEFINED, 0,
2989 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2990 } else if (expr && (expr->op_flags & OPf_KIDS)) {
2991 OP *k1 = ((UNOP*)expr)->op_first;
2992 OP *k2 = (k1) ? k1->op_sibling : NULL;
2993 switch (expr->op_type) {
2995 if (k2 && k2->op_type == OP_READLINE
2996 && (k2->op_flags & OPf_STACKED)
2997 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2998 expr = newUNOP(OP_DEFINED, 0, expr);
3002 if (k1->op_type == OP_READDIR
3003 || k1->op_type == OP_GLOB
3004 || k1->op_type == OP_EACH)
3005 expr = newUNOP(OP_DEFINED, 0, expr);
3011 block = newOP(OP_NULL, 0);
3014 next = LINKLIST(cont);
3016 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3017 if ((line_t)whileline != NOLINE) {
3018 PL_copline = whileline;
3019 cont = append_elem(OP_LINESEQ, cont,
3020 newSTATEOP(0, Nullch, Nullop));
3024 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3025 redo = LINKLIST(listop);
3028 PL_copline = whileline;
3030 o = new_logop(OP_AND, 0, &expr, &listop);
3031 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3032 op_free(expr); /* oops, it's a while (0) */
3034 return Nullop; /* listop already freed by new_logop */
3037 ((LISTOP*)listop)->op_last->op_next = condop =
3038 (o == listop ? redo : LINKLIST(o));
3046 Newz(1101,loop,1,LOOP);
3047 loop->op_type = OP_ENTERLOOP;
3048 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
3049 loop->op_private = 0;
3050 loop->op_next = (OP*)loop;
3053 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3055 loop->op_redoop = redo;
3056 loop->op_lastop = o;
3059 loop->op_nextop = next;
3061 loop->op_nextop = o;
3063 o->op_flags |= flags;
3064 o->op_private |= (flags >> 8);
3069 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3077 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3078 sv->op_type = OP_RV2GV;
3079 sv->op_ppaddr = ppaddr[OP_RV2GV];
3081 else if (sv->op_type == OP_PADSV) { /* private variable */
3082 padoff = sv->op_targ;
3086 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3087 padoff = sv->op_targ;
3088 iterflags |= OPf_SPECIAL;
3093 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3097 padoff = find_threadsv("_");
3098 iterflags |= OPf_SPECIAL;
3100 sv = newGVOP(OP_GV, 0, PL_defgv);
3103 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3104 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3105 iterflags |= OPf_STACKED;
3107 else if (expr->op_type == OP_NULL &&
3108 (expr->op_flags & OPf_KIDS) &&
3109 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3111 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3112 * set the STACKED flag to indicate that these values are to be
3113 * treated as min/max values by 'pp_iterinit'.
3115 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3116 CONDOP* range = (CONDOP*) flip->op_first;
3117 OP* left = range->op_first;
3118 OP* right = left->op_sibling;
3121 range->op_flags &= ~OPf_KIDS;
3122 range->op_first = Nullop;
3124 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3125 listop->op_first->op_next = range->op_true;
3126 left->op_next = range->op_false;
3127 right->op_next = (OP*)listop;
3128 listop->op_next = listop->op_first;
3131 expr = (OP*)(listop);
3133 iterflags |= OPf_STACKED;
3136 expr = mod(force_list(expr), OP_GREPSTART);
3140 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3141 append_elem(OP_LIST, expr, scalar(sv))));
3142 assert(!loop->op_next);
3143 Renew(loop, 1, LOOP);
3144 loop->op_targ = padoff;
3145 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3146 PL_copline = forline;
3147 return newSTATEOP(0, label, wop);
3151 newLOOPEX(I32 type, OP *label)
3155 if (type != OP_GOTO || label->op_type == OP_CONST) {
3156 /* "last()" means "last" */
3157 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3158 o = newOP(type, OPf_SPECIAL);
3160 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3161 ? SvPVx(((SVOP*)label)->op_sv, PL_na)
3167 if (label->op_type == OP_ENTERSUB)
3168 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3169 o = newUNOP(type, OPf_STACKED, label);
3171 PL_hints |= HINT_BLOCK_SCOPE;
3181 MUTEX_DESTROY(CvMUTEXP(cv));
3182 Safefree(CvMUTEXP(cv));
3185 #endif /* USE_THREADS */
3187 if (!CvXSUB(cv) && CvROOT(cv)) {
3189 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3190 croak("Can't undef active subroutine");
3193 croak("Can't undef active subroutine");
3194 #endif /* USE_THREADS */
3197 SAVESPTR(PL_curpad);
3201 op_free(CvROOT(cv));
3202 CvROOT(cv) = Nullop;
3205 SvPOK_off((SV*)cv); /* forget prototype */
3207 SvREFCNT_dec(CvGV(cv));
3209 SvREFCNT_dec(CvOUTSIDE(cv));
3210 CvOUTSIDE(cv) = Nullcv;
3211 if (CvPADLIST(cv)) {
3212 /* may be during global destruction */
3213 if (SvREFCNT(CvPADLIST(cv))) {
3214 I32 i = AvFILLp(CvPADLIST(cv));
3216 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3217 SV* sv = svp ? *svp : Nullsv;
3220 if (sv == (SV*)PL_comppad_name)
3221 PL_comppad_name = Nullav;
3222 else if (sv == (SV*)PL_comppad) {
3223 PL_comppad = Nullav;
3224 PL_curpad = Null(SV**);
3228 SvREFCNT_dec((SV*)CvPADLIST(cv));
3230 CvPADLIST(cv) = Nullav;
3234 #ifdef DEBUG_CLOSURES
3239 CV *outside = CvOUTSIDE(cv);
3240 AV* padlist = CvPADLIST(cv);
3247 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3249 (CvANON(cv) ? "ANON"
3250 : (cv == PL_main_cv) ? "MAIN"
3251 : CvUNIQUE(cv) ? "UNIQUE"
3252 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3255 : CvANON(outside) ? "ANON"
3256 : (outside == PL_main_cv) ? "MAIN"
3257 : CvUNIQUE(outside) ? "UNIQUE"
3258 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3263 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3264 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3265 pname = AvARRAY(pad_name);
3266 ppad = AvARRAY(pad);
3268 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3269 if (SvPOK(pname[ix]))
3270 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3272 SvFAKE(pname[ix]) ? "FAKE " : "",
3274 (long)I_32(SvNVX(pname[ix])),
3275 (long)SvIVX(pname[ix]));
3278 #endif /* DEBUG_CLOSURES */
3281 cv_clone2(CV *proto, CV *outside)
3286 AV* protopadlist = CvPADLIST(proto);
3287 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3288 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3289 SV** pname = AvARRAY(protopad_name);
3290 SV** ppad = AvARRAY(protopad);
3291 I32 fname = AvFILLp(protopad_name);
3292 I32 fpad = AvFILLp(protopad);
3296 assert(!CvUNIQUE(proto));
3299 SAVESPTR(PL_curpad);
3300 SAVESPTR(PL_comppad);
3301 SAVESPTR(PL_comppad_name);
3302 SAVESPTR(PL_compcv);
3304 cv = PL_compcv = (CV*)NEWSV(1104,0);
3305 sv_upgrade((SV *)cv, SvTYPE(proto));
3311 New(666, CvMUTEXP(cv), 1, perl_mutex);
3312 MUTEX_INIT(CvMUTEXP(cv));
3314 #endif /* USE_THREADS */
3315 CvFILEGV(cv) = CvFILEGV(proto);
3316 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3317 CvSTASH(cv) = CvSTASH(proto);
3318 CvROOT(cv) = CvROOT(proto);
3319 CvSTART(cv) = CvSTART(proto);
3321 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3324 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3326 PL_comppad_name = newAV();
3327 for (ix = fname; ix >= 0; ix--)
3328 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3330 PL_comppad = newAV();
3332 comppadlist = newAV();
3333 AvREAL_off(comppadlist);
3334 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3335 av_store(comppadlist, 1, (SV*)PL_comppad);
3336 CvPADLIST(cv) = comppadlist;
3337 av_fill(PL_comppad, AvFILLp(protopad));
3338 PL_curpad = AvARRAY(PL_comppad);
3340 av = newAV(); /* will be @_ */
3342 av_store(PL_comppad, 0, (SV*)av);
3343 AvFLAGS(av) = AVf_REIFY;
3345 for (ix = fpad; ix > 0; ix--) {
3346 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3347 if (namesv && namesv != &PL_sv_undef) {
3348 char *name = SvPVX(namesv); /* XXX */
3349 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3350 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3351 CvOUTSIDE(cv), cxstack_ix, 0);
3353 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3355 croak("panic: cv_clone: %s", name);
3357 else { /* our own lexical */
3360 /* anon code -- we'll come back for it */
3361 sv = SvREFCNT_inc(ppad[ix]);
3363 else if (*name == '@')
3365 else if (*name == '%')
3375 SV* sv = NEWSV(0,0);
3381 /* Now that vars are all in place, clone nested closures. */
3383 for (ix = fpad; ix > 0; ix--) {
3384 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3386 && namesv != &PL_sv_undef
3387 && !(SvFLAGS(namesv) & SVf_FAKE)
3388 && *SvPVX(namesv) == '&'
3389 && CvCLONE(ppad[ix]))
3391 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3392 SvREFCNT_dec(ppad[ix]);
3395 PL_curpad[ix] = (SV*)kid;
3399 #ifdef DEBUG_CLOSURES
3400 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3402 PerlIO_printf(Perl_debug_log, " from:\n");
3404 PerlIO_printf(Perl_debug_log, " to:\n");
3415 return cv_clone2(proto, CvOUTSIDE(proto));
3419 cv_ckproto(CV *cv, GV *gv, char *p)
3421 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3422 SV* msg = sv_newmortal();
3426 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3427 sv_setpv(msg, "Prototype mismatch:");
3429 sv_catpvf(msg, " sub %_", name);
3431 sv_catpvf(msg, " (%s)", SvPVX(cv));
3432 sv_catpv(msg, " vs ");
3434 sv_catpvf(msg, "(%s)", p);
3436 sv_catpv(msg, "none");
3444 if (!cv || !SvPOK(cv) || SvCUR(cv))
3446 return op_const_sv(CvSTART(cv), cv);
3450 op_const_sv(OP *o, CV *cv)
3457 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3458 o = cLISTOPo->op_first->op_sibling;
3460 for (; o; o = o->op_next) {
3461 OPCODE type = o->op_type;
3463 if(sv && o->op_next == o)
3465 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3467 if (type == OP_LEAVESUB || type == OP_RETURN)
3471 if (type == OP_CONST)
3473 else if (type == OP_PADSV && cv) {
3474 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3475 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3476 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3488 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3491 char *name = o ? SvPVx(cSVOPo->op_sv, PL_na) : Nullch;
3492 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3493 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3494 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, PL_na) : Nullch;
3503 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3504 maximum a prototype before. */
3505 if (SvTYPE(gv) > SVt_NULL) {
3506 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3507 warn("Runaway prototype");
3508 cv_ckproto((CV*)gv, NULL, ps);
3511 sv_setpv((SV*)gv, ps);
3513 sv_setiv((SV*)gv, -1);
3514 SvREFCNT_dec(PL_compcv);
3515 cv = PL_compcv = NULL;
3516 PL_sub_generation++;
3520 if (!name || GvCVGEN(gv))
3522 else if (cv = GvCV(gv)) {
3523 cv_ckproto(cv, gv, ps);
3524 /* already defined (or promised)? */
3525 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3527 bool const_changed = TRUE;
3529 /* just a "sub foo;" when &foo is already defined */
3530 SAVEFREESV(PL_compcv);
3533 /* ahem, death to those who redefine active sort subs */
3534 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3535 croak("Can't redefine active sort subroutine %s", name);
3536 if(const_sv = cv_const_sv(cv))
3537 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3538 if ((const_sv && const_changed) || PL_dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3539 && HvNAME(GvSTASH(CvGV(cv)))
3540 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3542 line_t oldline = PL_curcop->cop_line;
3543 PL_curcop->cop_line = PL_copline;
3544 warn(const_sv ? "Constant subroutine %s redefined"
3545 : "Subroutine %s redefined", name);
3546 PL_curcop->cop_line = oldline;
3552 if (cv) { /* must reuse cv if autoloaded */
3554 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3555 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3556 CvOUTSIDE(PL_compcv) = 0;
3557 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3558 CvPADLIST(PL_compcv) = 0;
3559 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3560 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3561 SvREFCNT_dec(PL_compcv);
3568 PL_sub_generation++;
3571 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3572 CvFILEGV(cv) = PL_curcop->cop_filegv;
3573 CvSTASH(cv) = PL_curstash;
3576 if (!CvMUTEXP(cv)) {
3577 New(666, CvMUTEXP(cv), 1, perl_mutex);
3578 MUTEX_INIT(CvMUTEXP(cv));
3580 #endif /* USE_THREADS */
3583 sv_setpv((SV*)cv, ps);
3585 if (PL_error_count) {
3589 char *s = strrchr(name, ':');
3591 if (strEQ(s, "BEGIN")) {
3593 "BEGIN not safe after errors--compilation aborted";
3597 /* force display of errors found but not reported */
3598 sv_catpv(ERRSV, not_safe);
3599 croak("%s", SvPVx(ERRSV, PL_na));
3606 PL_copline = NOLINE;
3611 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3612 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3615 SV **namep = AvARRAY(PL_comppad_name);
3616 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3619 if (SvIMMORTAL(PL_curpad[ix]))
3622 * The only things that a clonable function needs in its
3623 * pad are references to outer lexicals and anonymous subs.
3624 * The rest are created anew during cloning.
3626 if (!((namesv = namep[ix]) != Nullsv &&
3627 namesv != &PL_sv_undef &&
3629 *SvPVX(namesv) == '&')))
3631 SvREFCNT_dec(PL_curpad[ix]);
3632 PL_curpad[ix] = Nullsv;
3637 AV *av = newAV(); /* Will be @_ */
3639 av_store(PL_comppad, 0, (SV*)av);
3640 AvFLAGS(av) = AVf_REIFY;
3642 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3643 if (SvIMMORTAL(PL_curpad[ix]))
3645 if (!SvPADMY(PL_curpad[ix]))
3646 SvPADTMP_on(PL_curpad[ix]);
3650 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3651 CvSTART(cv) = LINKLIST(CvROOT(cv));
3652 CvROOT(cv)->op_next = 0;
3658 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3659 SV *sv = NEWSV(0,0);
3660 SV *tmpstr = sv_newmortal();
3661 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3665 sv_setpvf(sv, "%_:%ld-%ld",
3666 GvSV(PL_curcop->cop_filegv),
3667 (long)PL_subline, (long)PL_curcop->cop_line);
3668 gv_efullname3(tmpstr, gv, Nullch);
3669 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3670 hv = GvHVn(db_postponed);
3671 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3672 && (cv = GvCV(db_postponed))) {
3677 perl_call_sv((SV*)cv, G_DISCARD);
3681 if ((s = strrchr(name,':')))
3685 if (strEQ(s, "BEGIN")) {
3686 I32 oldscope = PL_scopestack_ix;
3688 SAVESPTR(PL_compiling.cop_filegv);
3689 SAVEI16(PL_compiling.cop_line);
3691 sv_setsv(PL_rs, PL_nrs);
3694 PL_beginav = newAV();
3695 DEBUG_x( dump_sub(gv) );
3696 av_push(PL_beginav, (SV *)cv);
3698 call_list(oldscope, PL_beginav);
3700 PL_curcop = &PL_compiling;
3703 else if (strEQ(s, "END") && !PL_error_count) {
3706 av_unshift(PL_endav, 1);
3707 av_store(PL_endav, 0, (SV *)cv);
3710 else if (strEQ(s, "INIT") && !PL_error_count) {
3712 PL_initav = newAV();
3713 av_push(PL_initav, SvREFCNT_inc(cv));
3719 PL_copline = NOLINE;
3725 newCONSTSUB(HV *stash, char *name, SV *sv)
3728 U32 oldhints = PL_hints;
3729 HV *old_cop_stash = PL_curcop->cop_stash;
3730 HV *old_curstash = PL_curstash;
3731 line_t oldline = PL_curcop->cop_line;
3732 PL_curcop->cop_line = PL_copline;
3734 PL_hints &= ~HINT_BLOCK_SCOPE;
3736 PL_curstash = PL_curcop->cop_stash = stash;
3739 start_subparse(FALSE, 0),
3740 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3741 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
3742 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3745 PL_hints = oldhints;
3746 PL_curcop->cop_stash = old_cop_stash;
3747 PL_curstash = old_curstash;
3748 PL_curcop->cop_line = oldline;
3752 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3755 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3758 if (cv = (name ? GvCV(gv) : Nullcv)) {
3760 /* just a cached method */
3764 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3765 /* already defined (or promised) */
3766 if (PL_dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3767 && HvNAME(GvSTASH(CvGV(cv)))
3768 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3769 line_t oldline = PL_curcop->cop_line;
3770 if (PL_copline != NOLINE)
3771 PL_curcop->cop_line = PL_copline;
3772 warn("Subroutine %s redefined",name);
3773 PL_curcop->cop_line = oldline;
3780 if (cv) /* must reuse cv if autoloaded */
3783 cv = (CV*)NEWSV(1105,0);
3784 sv_upgrade((SV *)cv, SVt_PVCV);
3788 PL_sub_generation++;
3791 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3793 New(666, CvMUTEXP(cv), 1, perl_mutex);
3794 MUTEX_INIT(CvMUTEXP(cv));
3796 #endif /* USE_THREADS */
3797 CvFILEGV(cv) = gv_fetchfile(filename);
3798 CvXSUB(cv) = subaddr;
3801 char *s = strrchr(name,':');
3806 if (strEQ(s, "BEGIN")) {
3808 PL_beginav = newAV();
3809 av_push(PL_beginav, (SV *)cv);
3812 else if (strEQ(s, "END")) {
3815 av_unshift(PL_endav, 1);
3816 av_store(PL_endav, 0, (SV *)cv);
3819 else if (strEQ(s, "INIT")) {
3821 PL_initav = newAV();
3822 av_push(PL_initav, (SV *)cv);
3833 newFORM(I32 floor, OP *o, OP *block)
3842 name = SvPVx(cSVOPo->op_sv, PL_na);
3845 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3847 if (cv = GvFORM(gv)) {
3849 line_t oldline = PL_curcop->cop_line;
3851 PL_curcop->cop_line = PL_copline;
3852 warn("Format %s redefined",name);
3853 PL_curcop->cop_line = oldline;
3859 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3860 CvFILEGV(cv) = PL_curcop->cop_filegv;
3862 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3863 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
3864 SvPADTMP_on(PL_curpad[ix]);
3867 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3868 CvSTART(cv) = LINKLIST(CvROOT(cv));
3869 CvROOT(cv)->op_next = 0;
3872 PL_copline = NOLINE;
3879 return newUNOP(OP_REFGEN, 0,
3880 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3886 return newUNOP(OP_REFGEN, 0,
3887 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3891 newANONSUB(I32 floor, OP *proto, OP *block)
3893 return newUNOP(OP_REFGEN, 0,
3894 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3900 switch (o->op_type) {
3902 o->op_type = OP_PADAV;
3903 o->op_ppaddr = ppaddr[OP_PADAV];
3904 return ref(o, OP_RV2AV);
3907 o->op_type = OP_RV2AV;
3908 o->op_ppaddr = ppaddr[OP_RV2AV];
3913 warn("oops: oopsAV");
3922 switch (o->op_type) {
3925 o->op_type = OP_PADHV;
3926 o->op_ppaddr = ppaddr[OP_PADHV];
3927 return ref(o, OP_RV2HV);
3931 o->op_type = OP_RV2HV;
3932 o->op_ppaddr = ppaddr[OP_RV2HV];
3937 warn("oops: oopsHV");
3946 if (o->op_type == OP_PADANY) {
3947 o->op_type = OP_PADAV;
3948 o->op_ppaddr = ppaddr[OP_PADAV];
3951 return newUNOP(OP_RV2AV, 0, scalar(o));
3955 newGVREF(I32 type, OP *o)
3957 if (type == OP_MAPSTART)
3958 return newUNOP(OP_NULL, 0, o);
3959 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3965 if (o->op_type == OP_PADANY) {
3966 o->op_type = OP_PADHV;
3967 o->op_ppaddr = ppaddr[OP_PADHV];
3970 return newUNOP(OP_RV2HV, 0, scalar(o));
3976 croak("NOT IMPL LINE %d",__LINE__);
3982 newCVREF(I32 flags, OP *o)
3984 return newUNOP(OP_RV2CV, flags, scalar(o));
3990 if (o->op_type == OP_PADANY) {
3991 o->op_type = OP_PADSV;
3992 o->op_ppaddr = ppaddr[OP_PADSV];
3995 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3996 o->op_flags |= OPpDONE_SVREF;
3999 return newUNOP(OP_RV2SV, 0, scalar(o));
4002 /* Check routines. */
4010 name = NEWSV(1106,0);
4011 sv_upgrade(name, SVt_PVNV);
4012 sv_setpvn(name, "&", 1);
4015 ix = pad_alloc(o->op_type, SVs_PADMY);
4016 av_store(PL_comppad_name, ix, name);
4017 av_store(PL_comppad, ix, cSVOPo->op_sv);
4018 SvPADMY_on(cSVOPo->op_sv);
4019 cSVOPo->op_sv = Nullsv;
4020 cSVOPo->op_targ = ix;
4027 o->op_private = PL_hints;
4034 if (cUNOPo->op_first->op_type == OP_CONCAT)
4035 o->op_flags |= OPf_STACKED;
4042 if (o->op_flags & OPf_KIDS) {
4045 OPCODE type = o->op_type;
4046 o = modkids(ck_fun(o), type);
4047 kid = cUNOPo->op_first;
4048 newop = kUNOP->op_first->op_sibling;
4050 (newop->op_sibling ||
4051 !(opargs[newop->op_type] & OA_RETSCALAR) ||
4052 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4053 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4057 op_free(kUNOP->op_first);
4058 kUNOP->op_first = newop;
4060 o->op_ppaddr = ppaddr[++o->op_type];
4069 if (o->op_flags & OPf_KIDS) {
4070 OP *kid = cUNOPo->op_first;
4071 if (kid->op_type == OP_HSLICE)
4072 o->op_private |= OPpSLICE;
4073 else if (kid->op_type != OP_HELEM)
4074 croak("%s argument is not a HASH element or slice",
4075 op_desc[o->op_type]);
4084 I32 type = o->op_type;
4086 if (o->op_flags & OPf_KIDS) {
4087 if (cLISTOPo->op_first->op_type == OP_STUB) {
4089 o = newUNOP(type, OPf_SPECIAL,
4090 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4100 PL_hints |= HINT_BLOCK_SCOPE;
4101 if (o->op_flags & OPf_KIDS) {
4102 SVOP *kid = (SVOP*)cUNOPo->op_first;
4105 o->op_flags &= ~OPf_KIDS;
4108 else if (kid->op_type == OP_LINESEQ) {
4111 kid->op_next = o->op_next;
4112 cUNOPo->op_first = 0;
4115 Newz(1101, enter, 1, LOGOP);
4116 enter->op_type = OP_ENTERTRY;
4117 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4118 enter->op_private = 0;
4120 /* establish postfix order */
4121 enter->op_next = (OP*)enter;
4123 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4124 o->op_type = OP_LEAVETRY;
4125 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4126 enter->op_other = o;
4134 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4136 o->op_targ = (PADOFFSET)PL_hints;
4144 if (o->op_flags & OPf_STACKED) {
4146 kid = cUNOPo->op_first->op_sibling;
4147 if (kid->op_type == OP_RV2GV)
4159 if (o->op_flags & OPf_KIDS) {
4160 OP *kid = cUNOPo->op_first;
4161 if (kid->op_type != OP_HELEM)
4162 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4169 ck_gvconst(register OP *o)
4171 o = fold_constants(o);
4172 if (o->op_type == OP_CONST)
4178 ck_rvconst(register OP *o)
4181 SVOP *kid = (SVOP*)cUNOPo->op_first;
4183 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4184 if (kid->op_type == OP_CONST) {
4188 SV *kidsv = kid->op_sv;
4190 /* Is it a constant from cv_const_sv()? */
4191 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4192 SV *rsv = SvRV(kidsv);
4193 int svtype = SvTYPE(rsv);
4194 char *badtype = Nullch;
4196 switch (o->op_type) {
4198 if (svtype > SVt_PVMG)
4199 badtype = "a SCALAR";
4202 if (svtype != SVt_PVAV)
4203 badtype = "an ARRAY";
4206 if (svtype != SVt_PVHV) {
4207 if (svtype == SVt_PVAV) { /* pseudohash? */
4208 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4209 if (ksv && SvROK(*ksv)
4210 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4219 if (svtype != SVt_PVCV)
4224 croak("Constant is not %s reference", badtype);
4227 name = SvPV(kidsv, PL_na);
4229 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4230 char *badthing = Nullch;
4231 switch (o->op_type) {
4233 badthing = "a SCALAR";
4236 badthing = "an ARRAY";
4239 badthing = "a HASH";
4244 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4248 * This is a little tricky. We only want to add the symbol if we
4249 * didn't add it in the lexer. Otherwise we get duplicate strict
4250 * warnings. But if we didn't add it in the lexer, we must at
4251 * least pretend like we wanted to add it even if it existed before,
4252 * or we get possible typo warnings. OPpCONST_ENTERED says
4253 * whether the lexer already added THIS instance of this symbol.
4255 iscv = (o->op_type == OP_RV2CV) * 2;
4257 gv = gv_fetchpv(name,
4258 iscv | !(kid->op_private & OPpCONST_ENTERED),
4261 : o->op_type == OP_RV2SV
4263 : o->op_type == OP_RV2AV
4265 : o->op_type == OP_RV2HV
4268 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4270 kid->op_type = OP_GV;
4271 SvREFCNT_dec(kid->op_sv);
4272 kid->op_sv = SvREFCNT_inc(gv);
4282 I32 type = o->op_type;
4284 if (o->op_flags & OPf_REF)
4287 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4288 SVOP *kid = (SVOP*)cUNOPo->op_first;
4290 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4291 OP *newop = newGVOP(type, OPf_REF,
4292 gv_fetchpv(SvPVx(kid->op_sv, PL_na), TRUE, SVt_PVIO));
4299 if (type == OP_FTTTY)
4300 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4303 return newUNOP(type, 0, newDEFSVOP());
4316 int type = o->op_type;
4317 register I32 oa = opargs[type] >> OASHIFT;
4319 if (o->op_flags & OPf_STACKED) {
4320 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4323 return no_fh_allowed(o);
4326 if (o->op_flags & OPf_KIDS) {
4327 tokid = &cLISTOPo->op_first;
4328 kid = cLISTOPo->op_first;
4329 if (kid->op_type == OP_PUSHMARK ||
4330 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4332 tokid = &kid->op_sibling;
4333 kid = kid->op_sibling;
4335 if (!kid && opargs[type] & OA_DEFGV)
4336 *tokid = kid = newDEFSVOP();
4340 sibl = kid->op_sibling;
4354 if (kid->op_type == OP_CONST &&
4355 (kid->op_private & OPpCONST_BARE)) {
4356 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4357 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4358 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4360 warn("Array @%s missing the @ in argument %ld of %s()",
4361 name, (long)numargs, op_desc[type]);
4364 kid->op_sibling = sibl;
4367 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4368 bad_type(numargs, "array", op_desc[o->op_type], kid);
4372 if (kid->op_type == OP_CONST &&
4373 (kid->op_private & OPpCONST_BARE)) {
4374 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4375 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4376 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4378 warn("Hash %%%s missing the %% in argument %ld of %s()",
4379 name, (long)numargs, op_desc[type]);
4382 kid->op_sibling = sibl;
4385 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4386 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4391 OP *newop = newUNOP(OP_NULL, 0, kid);
4392 kid->op_sibling = 0;
4394 newop->op_next = newop;
4396 kid->op_sibling = sibl;
4401 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4402 if (kid->op_type == OP_CONST &&
4403 (kid->op_private & OPpCONST_BARE)) {
4404 OP *newop = newGVOP(OP_GV, 0,
4405 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, PL_na), TRUE,
4410 else if (kid->op_type == OP_READLINE) {
4411 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4412 bad_type(numargs, "HANDLE", op_desc[o->op_type], kid);
4415 kid->op_sibling = 0;
4416 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4418 kid->op_sibling = sibl;
4424 mod(scalar(kid), type);
4428 tokid = &kid->op_sibling;
4429 kid = kid->op_sibling;
4431 o->op_private |= numargs;
4433 return too_many_arguments(o,op_desc[o->op_type]);
4436 else if (opargs[type] & OA_DEFGV) {
4438 return newUNOP(type, 0, newDEFSVOP());
4442 while (oa & OA_OPTIONAL)
4444 if (oa && oa != OA_LIST)
4445 return too_few_arguments(o,op_desc[o->op_type]);
4455 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4456 append_elem(OP_GLOB, o, newDEFSVOP());
4458 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4459 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4461 if (gv && GvIMPORTED_CV(gv)) {
4462 static int glob_index;
4464 append_elem(OP_GLOB, o,
4465 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4466 o->op_type = OP_LIST;
4467 o->op_ppaddr = ppaddr[OP_LIST];
4468 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4469 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4470 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4471 append_elem(OP_LIST, o,
4472 scalar(newUNOP(OP_RV2CV, 0,
4473 newGVOP(OP_GV, 0, gv)))));
4474 o = newUNOP(OP_NULL, 0, ck_subr(o));
4475 o->op_targ = OP_GLOB; /* hint at what it used to be */
4478 gv = newGVgen("main");
4480 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4490 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4492 o->op_ppaddr = ppaddr[OP_GREPSTART];
4493 Newz(1101, gwop, 1, LOGOP);
4495 if (o->op_flags & OPf_STACKED) {
4498 kid = cLISTOPo->op_first->op_sibling;
4499 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4502 kid->op_next = (OP*)gwop;
4503 o->op_flags &= ~OPf_STACKED;
4505 kid = cLISTOPo->op_first->op_sibling;
4506 if (type == OP_MAPWHILE)
4513 kid = cLISTOPo->op_first->op_sibling;
4514 if (kid->op_type != OP_NULL)
4515 croak("panic: ck_grep");
4516 kid = kUNOP->op_first;
4518 gwop->op_type = type;
4519 gwop->op_ppaddr = ppaddr[type];
4520 gwop->op_first = listkids(o);
4521 gwop->op_flags |= OPf_KIDS;
4522 gwop->op_private = 1;
4523 gwop->op_other = LINKLIST(kid);
4524 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4525 kid->op_next = (OP*)gwop;
4527 kid = cLISTOPo->op_first->op_sibling;
4528 if (!kid || !kid->op_sibling)
4529 return too_few_arguments(o,op_desc[o->op_type]);
4530 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4531 mod(kid, OP_GREPSTART);
4539 if (o->op_flags & OPf_KIDS) {
4540 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4542 kid = kid->op_sibling; /* get past "big" */
4543 if (kid && kid->op_type == OP_CONST)
4544 fbm_compile(((SVOP*)kid)->op_sv, 0);
4550 ck_lengthconst(OP *o)
4552 /* XXX length optimization goes here */
4559 OPCODE type = o->op_type;
4560 return modkids(ck_fun(o), type);
4566 OPCODE type = o->op_type;
4567 return refkids(ck_fun(o), type);
4575 kid = cLISTOPo->op_first;
4578 kid = cLISTOPo->op_first;
4580 if (kid->op_type == OP_PUSHMARK)
4581 kid = kid->op_sibling;
4582 if (kid && o->op_flags & OPf_STACKED)
4583 kid = kid->op_sibling;
4584 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4585 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4586 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4587 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4588 cLISTOPo->op_first->op_sibling = kid;
4589 cLISTOPo->op_last = kid;
4590 kid = kid->op_sibling;
4595 append_elem(o->op_type, o, newDEFSVOP());
4601 if (PL_hints & HINT_LOCALE)
4602 o->op_private |= OPpLOCALE;
4609 ck_fun_locale(OP *o)
4615 if (PL_hints & HINT_LOCALE)
4616 o->op_private |= OPpLOCALE;
4627 if (PL_hints & HINT_LOCALE)
4628 o->op_private |= OPpLOCALE;
4637 o->op_private |= OPpRUNTIME;
4650 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4651 o->op_private |= OPpREPEAT_DOLIST;
4652 cBINOPo->op_first = force_list(cBINOPo->op_first);
4662 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4663 SVOP *kid = (SVOP*)cUNOPo->op_first;
4665 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4667 for (s = SvPVX(kid->op_sv); *s; s++) {
4668 if (*s == ':' && s[1] == ':') {
4670 Move(s+2, s+1, strlen(s+2)+1, char);
4671 --SvCUR(kid->op_sv);
4674 sv_catpvn(kid->op_sv, ".pm", 3);
4683 croak("NOT IMPL LINE %d",__LINE__);
4692 if (o->op_flags & OPf_KIDS) {
4693 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4694 if (kid && kid->op_sibling) {
4695 o->op_type = OP_SSELECT;
4696 o->op_ppaddr = ppaddr[OP_SSELECT];
4698 return fold_constants(o);
4702 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4703 if (kid && kid->op_type == OP_RV2GV)
4704 kid->op_private &= ~HINT_STRICT_REFS;
4711 I32 type = o->op_type;
4713 if (!(o->op_flags & OPf_KIDS)) {
4718 if (!CvUNIQUE(PL_compcv)) {
4719 argop = newOP(OP_PADAV, OPf_REF);
4720 argop->op_targ = 0; /* PL_curpad[0] is @_ */
4723 argop = newUNOP(OP_RV2AV, 0,
4724 scalar(newGVOP(OP_GV, 0,
4725 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4728 argop = newUNOP(OP_RV2AV, 0,
4729 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
4730 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4731 #endif /* USE_THREADS */
4732 return newUNOP(type, 0, scalar(argop));
4734 return scalar(modkids(ck_fun(o), type));
4742 if (PL_hints & HINT_LOCALE)
4743 o->op_private |= OPpLOCALE;
4746 if (o->op_flags & OPf_STACKED) {
4747 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4749 kid = kUNOP->op_first; /* get past rv2gv */
4751 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4753 if (kid->op_type == OP_SCOPE) {
4757 else if (kid->op_type == OP_LEAVE) {
4758 if (o->op_type == OP_SORT) {
4759 null(kid); /* wipe out leave */
4762 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4763 if (k->op_next == kid)
4768 kid->op_next = 0; /* just disconnect the leave */
4769 k = kLISTOP->op_first;
4773 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4774 null(kid); /* wipe out rv2gv */
4775 if (o->op_type == OP_SORT)
4779 o->op_flags |= OPf_SPECIAL;
4781 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
4782 null(cLISTOPo->op_first->op_sibling);
4793 if (o->op_flags & OPf_STACKED)
4794 return no_fh_allowed(o);
4796 kid = cLISTOPo->op_first;
4797 if (kid->op_type != OP_NULL)
4798 croak("panic: ck_split");
4799 kid = kid->op_sibling;
4800 op_free(cLISTOPo->op_first);
4801 cLISTOPo->op_first = kid;
4803 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4804 cLISTOPo->op_last = kid; /* There was only one element previously */
4807 if (kid->op_type != OP_MATCH) {
4808 OP *sibl = kid->op_sibling;
4809 kid->op_sibling = 0;
4810 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4811 if (cLISTOPo->op_first == cLISTOPo->op_last)
4812 cLISTOPo->op_last = kid;
4813 cLISTOPo->op_first = kid;
4814 kid->op_sibling = sibl;
4817 kid->op_type = OP_PUSHRE;
4818 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4821 if (!kid->op_sibling)
4822 append_elem(OP_SPLIT, o, newDEFSVOP());
4824 kid = kid->op_sibling;
4827 if (!kid->op_sibling)
4828 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4830 kid = kid->op_sibling;
4833 if (kid->op_sibling)
4834 return too_many_arguments(o,op_desc[o->op_type]);
4843 OP *prev = ((cUNOPo->op_first->op_sibling)
4844 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4845 OP *o2 = prev->op_sibling;
4853 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4854 if (cvop->op_type == OP_RV2CV) {
4856 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4857 null(cvop); /* disable rv2cv */
4858 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4859 if (tmpop->op_type == OP_GV) {
4860 cv = GvCVu(tmpop->op_sv);
4861 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4862 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4863 proto = SvPV((SV*)cv, PL_na);
4867 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4868 if (PERLDB_SUB && PL_curstash != PL_debstash)
4869 o->op_private |= OPpENTERSUB_DB;
4870 while (o2 != cvop) {
4874 return too_many_arguments(o, gv_ename(namegv));
4892 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4893 bad_type(arg, "block", gv_ename(namegv), o2);
4898 if (o2->op_type == OP_RV2GV)
4902 OP* sib = kid->op_sibling;
4903 kid->op_sibling = 0;
4904 o2 = newUNOP(OP_RV2GV, 0, kid);
4905 o2->op_sibling = sib;
4906 prev->op_sibling = o2;
4914 if (o2->op_type != OP_RV2GV)
4915 bad_type(arg, "symbol", gv_ename(namegv), o2);
4918 if (o2->op_type != OP_RV2CV)
4919 bad_type(arg, "sub", gv_ename(namegv), o2);
4922 if (o2->op_type != OP_RV2SV
4923 && o2->op_type != OP_PADSV
4924 && o2->op_type != OP_THREADSV)
4926 bad_type(arg, "scalar", gv_ename(namegv), o2);
4930 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4931 bad_type(arg, "array", gv_ename(namegv), o2);
4934 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4935 bad_type(arg, "hash", gv_ename(namegv), o2);
4939 OP* sib = kid->op_sibling;
4940 kid->op_sibling = 0;
4941 o2 = newUNOP(OP_REFGEN, 0, kid);
4942 o2->op_sibling = sib;
4943 prev->op_sibling = o2;
4954 croak("Malformed prototype for %s: %s",
4955 gv_ename(namegv), SvPV((SV*)cv, PL_na));
4960 mod(o2, OP_ENTERSUB);
4962 o2 = o2->op_sibling;
4964 if (proto && !optional &&
4965 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4966 return too_few_arguments(o, gv_ename(namegv));
4973 SvREADONLY_on(cSVOPo->op_sv);
4980 if (o->op_flags & OPf_KIDS) {
4981 SVOP *kid = (SVOP*)cUNOPo->op_first;
4983 if (kid->op_type == OP_NULL)
4984 kid = (SVOP*)kid->op_sibling;
4986 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4987 o->op_flags |= OPf_SPECIAL;
4992 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4995 peep(register OP *o)
4998 register OP* oldop = 0;
4999 if (!o || o->op_seq)
5003 SAVESPTR(PL_curcop);
5004 for (; o; o = o->op_next) {
5010 switch (o->op_type) {
5013 PL_curcop = ((COP*)o); /* for warnings */
5014 o->op_seq = PL_op_seqmax++;
5025 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5027 o->op_seq = PL_op_seqmax++;
5030 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5031 o->op_seq = PL_op_seqmax++;
5032 break; /* Scalar stub must produce undef. List stub is noop */
5036 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5037 PL_curcop = ((COP*)o);
5043 if (oldop && o->op_next) {
5044 oldop->op_next = o->op_next;
5047 o->op_seq = PL_op_seqmax++;
5051 if (o->op_next->op_type == OP_RV2SV) {
5052 if (!(o->op_next->op_private & OPpDEREF)) {
5054 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5055 o->op_next = o->op_next->op_next;
5056 o->op_type = OP_GVSV;
5057 o->op_ppaddr = ppaddr[OP_GVSV];
5060 else if (o->op_next->op_type == OP_RV2AV) {
5061 OP* pop = o->op_next->op_next;
5063 if (pop->op_type == OP_CONST &&
5064 (PL_op = pop->op_next) &&
5065 pop->op_next->op_type == OP_AELEM &&
5066 !(pop->op_next->op_private &
5067 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5068 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5072 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5076 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5077 o->op_next = pop->op_next->op_next;
5078 o->op_type = OP_AELEMFAST;
5079 o->op_ppaddr = ppaddr[OP_AELEMFAST];
5080 o->op_private = (U8)i;
5081 GvAVn(((GVOP*)o)->op_gv);
5084 o->op_seq = PL_op_seqmax++;
5091 o->op_seq = PL_op_seqmax++;
5092 while (cLOGOP->op_other->op_type == OP_NULL)
5093 cLOGOP->op_other = cLOGOP->op_other->op_next;
5094 peep(cLOGOP->op_other);
5098 o->op_seq = PL_op_seqmax++;
5099 peep(cCONDOP->op_true);
5100 peep(cCONDOP->op_false);
5104 o->op_seq = PL_op_seqmax++;
5105 peep(cLOOP->op_redoop);
5106 peep(cLOOP->op_nextop);
5107 peep(cLOOP->op_lastop);
5113 o->op_seq = PL_op_seqmax++;
5114 peep(cPMOP->op_pmreplstart);
5118 o->op_seq = PL_op_seqmax++;
5119 if (PL_dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
5120 if (o->op_next->op_sibling &&
5121 o->op_next->op_sibling->op_type != OP_EXIT &&
5122 o->op_next->op_sibling->op_type != OP_WARN &&
5123 o->op_next->op_sibling->op_type != OP_DIE) {
5124 line_t oldline = PL_curcop->cop_line;
5126 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5127 warn("Statement unlikely to be reached");
5128 warn("(Maybe you meant system() when you said exec()?)\n");
5129 PL_curcop->cop_line = oldline;
5143 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5144 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5146 rop = (UNOP*)((BINOP*)o)->op_first;
5147 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5149 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5150 if (!SvOBJECT(lexname))
5152 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5153 if (!fields || !GvHV(*fields))
5155 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5156 key = SvPV(*svp, keylen);
5157 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5159 croak("No such field \"%s\" in variable %s of type %s",
5160 key, SvPV(lexname, PL_na), HvNAME(SvSTASH(lexname)));
5162 ind = SvIV(*indsvp);
5164 croak("Bad index while coercing array into hash");
5165 rop->op_type = OP_RV2AV;
5166 rop->op_ppaddr = ppaddr[OP_RV2AV];
5167 o->op_type = OP_AELEM;
5168 o->op_ppaddr = ppaddr[OP_AELEM];
5170 *svp = newSViv(ind);
5175 o->op_seq = PL_op_seqmax++;