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();
61 gv_efullname3(tmpsv, gv, Nullch);
62 return SvPV(tmpsv,n_a);
68 yyerror(form("Missing comma after first argument to %s function",
69 op_desc[o->op_type]));
74 too_few_arguments(OP *o, char *name)
76 yyerror(form("Not enough arguments for %s", name));
81 too_many_arguments(OP *o, char *name)
83 yyerror(form("Too many arguments for %s", name));
88 bad_type(I32 n, char *t, char *name, OP *kid)
90 yyerror(form("Type of arg %d to %s must be %s (not %s)",
91 (int)n, name, t, op_desc[kid->op_type]));
97 int type = o->op_type;
98 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
99 yyerror(form("Can't use subscript on %s", op_desc[type]));
100 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
102 SV *msg = sv_2mortal(
103 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
104 type == OP_ENTERSUB ? '&' : '%'));
108 sv_catsv(GvSV(PL_errgv), msg);
110 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
115 /* "register" allocation */
118 pad_allocmy(char *name)
124 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
125 if (!isPRINT(name[1])) {
127 name[2] = toCTRL(name[1]);
130 croak("Can't use global %s in \"my\"",name);
132 if (PL_dowarn && AvFILLp(PL_comppad_name) >= 0) {
133 SV **svp = AvARRAY(PL_comppad_name);
134 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
136 && sv != &PL_sv_undef
137 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
138 && strEQ(name, SvPVX(sv)))
140 warn("\"my\" variable %s masks earlier declaration in same %s",
141 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
146 off = pad_alloc(OP_PADSV, SVs_PADMY);
148 sv_upgrade(sv, SVt_PVNV);
150 if (PL_in_my_stash) {
152 croak("Can't declare class for non-scalar %s in \"my\"",name);
154 (void)SvUPGRADE(sv, SVt_PVMG);
155 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
158 av_store(PL_comppad_name, off, sv);
159 SvNVX(sv) = (double)PAD_MAX;
160 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
161 if (!PL_min_intro_pending)
162 PL_min_intro_pending = off;
163 PL_max_intro_pending = off;
165 av_store(PL_comppad, off, (SV*)newAV());
166 else if (*name == '%')
167 av_store(PL_comppad, off, (SV*)newHV());
168 SvPADMY_on(PL_curpad[off]);
173 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix, I32 saweval)
180 register PERL_CONTEXT *cx;
182 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
183 AV *curlist = CvPADLIST(cv);
184 SV **svp = av_fetch(curlist, 0, FALSE);
187 if (!svp || *svp == &PL_sv_undef)
190 svp = AvARRAY(curname);
191 for (off = AvFILLp(curname); off > 0; off--) {
192 if ((sv = svp[off]) &&
193 sv != &PL_sv_undef &&
195 seq > I_32(SvNVX(sv)) &&
196 strEQ(SvPVX(sv), name))
207 return 0; /* don't clone from inactive stack frame */
211 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
212 oldsv = *av_fetch(oldpad, off, TRUE);
213 if (!newoff) { /* Not a mere clone operation. */
214 SV *namesv = NEWSV(1103,0);
215 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
216 sv_upgrade(namesv, SVt_PVNV);
217 sv_setpv(namesv, name);
218 av_store(PL_comppad_name, newoff, namesv);
219 SvNVX(namesv) = (double)PL_curcop->cop_seq;
220 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
221 SvFAKE_on(namesv); /* A ref, not a real var */
222 if (SvOBJECT(svp[off])) { /* A typed var */
224 (void)SvUPGRADE(namesv, SVt_PVMG);
225 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(svp[off]));
228 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
229 /* "It's closures all the way down." */
230 CvCLONE_on(PL_compcv);
232 if (CvANON(PL_compcv))
233 oldsv = Nullsv; /* no need to keep ref */
238 bcv && bcv != cv && !CvCLONE(bcv);
239 bcv = CvOUTSIDE(bcv))
245 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
248 "Variable \"%s\" may be unavailable",
256 else if (!CvUNIQUE(PL_compcv)) {
257 if (PL_dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
258 warn("Variable \"%s\" will not stay shared", name);
261 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
267 /* Nothing in current lexical context--try eval's context, if any.
268 * This is necessary to let the perldb get at lexically scoped variables.
269 * XXX This will also probably interact badly with eval tree caching.
272 for (i = cx_ix; i >= 0; i--) {
274 switch (CxTYPE(cx)) {
276 if (i == 0 && saweval) {
277 seq = cxstack[saweval].blk_oldcop->cop_seq;
278 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval);
282 switch (cx->blk_eval.old_op_type) {
288 /* require must have its own scope */
296 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
297 saweval = i; /* so we know where we were called from */
300 seq = cxstack[saweval].blk_oldcop->cop_seq;
301 return pad_findlex(name, newoff, seq, cv, i-1, saweval);
309 pad_findmy(char *name)
315 SV **svp = AvARRAY(PL_comppad_name);
316 U32 seq = PL_cop_seqmax;
322 * Special case to get lexical (and hence per-thread) @_.
323 * XXX I need to find out how to tell at parse-time whether use
324 * of @_ should refer to a lexical (from a sub) or defgv (global
325 * scope and maybe weird sub-ish things like formats). See
326 * startsub in perly.y. It's possible that @_ could be lexical
327 * (at least from subs) even in non-threaded perl.
329 if (strEQ(name, "@_"))
330 return 0; /* success. (NOT_IN_PAD indicates failure) */
331 #endif /* USE_THREADS */
333 /* The one we're looking for is probably just before comppad_name_fill. */
334 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
335 if ((sv = svp[off]) &&
336 sv != &PL_sv_undef &&
339 seq > I_32(SvNVX(sv)))) &&
340 strEQ(SvPVX(sv), name))
343 return (PADOFFSET)off;
344 pendoff = off; /* this pending def. will override import */
348 outside = CvOUTSIDE(PL_compcv);
350 /* Check if if we're compiling an eval'', and adjust seq to be the
351 * eval's seq number. This depends on eval'' having a non-null
352 * CvOUTSIDE() while it is being compiled. The eval'' itself is
353 * identified by CvEVAL being true and CvGV being null. */
354 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
355 cx = &cxstack[cxstack_ix];
357 seq = cx->blk_oldcop->cop_seq;
360 /* See if it's in a nested scope */
361 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0);
363 /* If there is a pending local definition, this new alias must die */
365 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
366 return off; /* pad_findlex returns 0 for failure...*/
368 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
372 pad_leavemy(I32 fill)
375 SV **svp = AvARRAY(PL_comppad_name);
377 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
378 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
379 if ((sv = svp[off]) && sv != &PL_sv_undef)
380 warn("%s never introduced", SvPVX(sv));
383 /* "Deintroduce" my variables that are leaving with this scope. */
384 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
385 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
386 SvIVX(sv) = PL_cop_seqmax;
391 pad_alloc(I32 optype, U32 tmptype)
397 if (AvARRAY(PL_comppad) != PL_curpad)
398 croak("panic: pad_alloc");
399 if (PL_pad_reset_pending)
401 if (tmptype & SVs_PADMY) {
403 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
404 } while (SvPADBUSY(sv)); /* need a fresh one */
405 retval = AvFILLp(PL_comppad);
408 SV **names = AvARRAY(PL_comppad_name);
409 SSize_t names_fill = AvFILLp(PL_comppad_name);
412 * "foreach" index vars temporarily become aliases to non-"my"
413 * values. Thus we must skip, not just pad values that are
414 * marked as current pad values, but also those with names.
416 if (++PL_padix <= names_fill &&
417 (sv = names[PL_padix]) && sv != &PL_sv_undef)
419 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
420 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
425 SvFLAGS(sv) |= tmptype;
426 PL_curpad = AvARRAY(PL_comppad);
428 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
429 (unsigned long) thr, (unsigned long) PL_curpad,
430 (long) retval, op_name[optype]));
432 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
433 (unsigned long) PL_curpad,
434 (long) retval, op_name[optype]));
435 #endif /* USE_THREADS */
436 return (PADOFFSET)retval;
444 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
445 (unsigned long) thr, (unsigned long) PL_curpad, po));
448 croak("panic: pad_sv po");
449 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
450 (unsigned long) PL_curpad, po));
451 #endif /* USE_THREADS */
452 return PL_curpad[po]; /* eventually we'll turn this into a macro */
456 pad_free(PADOFFSET po)
461 if (AvARRAY(PL_comppad) != PL_curpad)
462 croak("panic: pad_free curpad");
464 croak("panic: pad_free po");
466 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
467 (unsigned long) thr, (unsigned long) PL_curpad, po));
469 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
470 (unsigned long) PL_curpad, po));
471 #endif /* USE_THREADS */
472 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
473 SvPADTMP_off(PL_curpad[po]);
474 if ((I32)po < PL_padix)
479 pad_swipe(PADOFFSET po)
482 if (AvARRAY(PL_comppad) != PL_curpad)
483 croak("panic: pad_swipe curpad");
485 croak("panic: pad_swipe po");
487 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
488 (unsigned long) thr, (unsigned long) PL_curpad, po));
490 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
491 (unsigned long) PL_curpad, po));
492 #endif /* USE_THREADS */
493 SvPADTMP_off(PL_curpad[po]);
494 PL_curpad[po] = NEWSV(1107,0);
495 SvPADTMP_on(PL_curpad[po]);
496 if ((I32)po < PL_padix)
500 /* XXX pad_reset() is currently disabled because it results in serious bugs.
501 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
502 * on the stack by OPs that use them, there are several ways to get an alias
503 * to a shared TARG. Such an alias will change randomly and unpredictably.
504 * We avoid doing this until we can think of a Better Way.
509 #ifdef USE_BROKEN_PAD_RESET
513 if (AvARRAY(PL_comppad) != PL_curpad)
514 croak("panic: pad_reset curpad");
516 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
517 (unsigned long) thr, (unsigned long) PL_curpad));
519 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
520 (unsigned long) PL_curpad));
521 #endif /* USE_THREADS */
522 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
523 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
524 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
525 SvPADTMP_off(PL_curpad[po]);
527 PL_padix = PL_padix_floor;
530 PL_pad_reset_pending = FALSE;
534 /* find_threadsv is not reentrant */
536 find_threadsv(char *name)
542 /* We currently only handle names of a single character */
543 p = strchr(PL_threadsv_names, *name);
546 key = p - PL_threadsv_names;
547 MUTEX_LOCK(&thr->mutex);
548 svp = av_fetch(thr->threadsv, key, FALSE);
550 MUTEX_UNLOCK(&thr->mutex);
552 SV *sv = NEWSV(0, 0);
553 av_store(thr->threadsv, key, sv);
554 thr->threadsvp = AvARRAY(thr->threadsv);
555 MUTEX_UNLOCK(&thr->mutex);
557 * Some magic variables used to be automagically initialised
558 * in gv_fetchpv. Those which are now per-thread magicals get
559 * initialised here instead.
565 sv_setpv(sv, "\034");
566 sv_magic(sv, 0, 0, name, 1);
571 PL_sawampersand = TRUE;
585 /* XXX %! tied to Errno.pm needs to be added here.
586 * See gv_fetchpv(). */
590 sv_magic(sv, 0, 0, name, 1);
592 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
593 "find_threadsv: new SV %p for $%s%c\n",
594 sv, (*name < 32) ? "^" : "",
595 (*name < 32) ? toCTRL(*name) : *name));
599 #endif /* USE_THREADS */
606 register OP *kid, *nextkid;
608 if (!o || o->op_seq == (U16)-1)
611 if (o->op_flags & OPf_KIDS) {
612 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
613 nextkid = kid->op_sibling; /* Get before next freeing kid */
618 switch (o->op_type) {
620 o->op_targ = 0; /* Was holding old type, if any. */
623 o->op_targ = 0; /* Was holding hints. */
627 if (!(o->op_flags & OPf_SPECIAL))
631 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
633 #endif /* USE_THREADS */
635 if (!(o->op_flags & OPf_REF)
636 || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
642 SvREFCNT_dec(cGVOPo->op_gv);
646 Safefree(cCOPo->cop_label);
647 SvREFCNT_dec(cCOPo->cop_filegv);
650 SvREFCNT_dec(cSVOPo->op_sv);
656 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
660 Safefree(cPVOPo->op_pv);
663 op_free(cPMOPo->op_pmreplroot);
668 ReREFCNT_dec(cPMOPo->op_pmregexp);
673 pad_free(o->op_targ);
681 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
682 pad_free(o->op_targ);
683 o->op_targ = o->op_type;
684 o->op_type = OP_NULL;
685 o->op_ppaddr = ppaddr[OP_NULL];
688 /* Contextualizers */
690 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
700 /* establish postfix order */
701 if (cUNOPo->op_first) {
702 o->op_next = LINKLIST(cUNOPo->op_first);
703 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
705 kid->op_next = LINKLIST(kid->op_sibling);
720 if (o && o->op_flags & OPf_KIDS) {
721 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
731 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
733 line_t oldline = PL_curcop->cop_line;
735 if (PL_copline != NOLINE)
736 PL_curcop->cop_line = PL_copline;
737 warn("Found = in conditional, should be ==");
738 PL_curcop->cop_line = oldline;
748 /* assumes no premature commitment */
749 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
750 || o->op_type == OP_RETURN)
753 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
755 switch (o->op_type) {
757 if (o->op_private & OPpREPEAT_DOLIST)
758 null(((LISTOP*)cBINOPo->op_first)->op_first);
759 scalar(cBINOPo->op_first);
764 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
768 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
769 if (!kPMOP->op_pmreplroot)
770 deprecate("implicit split to @_");
778 if (o->op_flags & OPf_KIDS) {
779 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
785 kid = cLISTOPo->op_first;
787 while (kid = kid->op_sibling) {
793 WITH_THR(PL_curcop = &PL_compiling);
798 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
804 WITH_THR(PL_curcop = &PL_compiling);
817 /* assumes no premature commitment */
818 U8 want = o->op_flags & OPf_WANT;
819 if (!o || (want && want != OPf_WANT_SCALAR) || PL_error_count
820 || o->op_type == OP_RETURN)
823 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
825 switch (o->op_type) {
827 if (!(opargs[o->op_type] & OA_FOLDCONST))
831 if (o->op_flags & OPf_STACKED)
835 if (o->op_private == 4)
906 if (!(o->op_private & OPpLVAL_INTRO))
907 useless = op_desc[o->op_type];
914 if (!(o->op_private & OPpLVAL_INTRO) &&
915 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
916 useless = "a variable";
921 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
927 useless = "a constant";
928 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
930 else if (SvPOK(sv)) {
931 if (strnEQ(SvPVX(sv), "di", 2) ||
932 strnEQ(SvPVX(sv), "ds", 2) ||
933 strnEQ(SvPVX(sv), "ig", 2))
937 null(o); /* don't execute a constant */
938 SvREFCNT_dec(sv); /* don't even remember it */
942 o->op_type = OP_PREINC; /* pre-increment is faster */
943 o->op_ppaddr = ppaddr[OP_PREINC];
947 o->op_type = OP_PREDEC; /* pre-decrement is faster */
948 o->op_ppaddr = ppaddr[OP_PREDEC];
954 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
959 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
960 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
961 if (o->op_flags & OPf_STACKED)
967 if (!(o->op_flags & OPf_KIDS))
976 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
983 /* all requires must return a boolean value */
984 o->op_flags &= ~OPf_WANT;
987 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
988 if (!kPMOP->op_pmreplroot)
989 deprecate("implicit split to @_");
993 if (useless && PL_dowarn)
994 warn("Useless use of %s in void context", useless);
1002 if (o && o->op_flags & OPf_KIDS) {
1003 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1014 /* assumes no premature commitment */
1015 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1016 || o->op_type == OP_RETURN)
1019 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1021 switch (o->op_type) {
1024 list(cBINOPo->op_first);
1029 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1037 if (!(o->op_flags & OPf_KIDS))
1039 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1040 list(cBINOPo->op_first);
1041 return gen_constant_list(o);
1048 kid = cLISTOPo->op_first;
1050 while (kid = kid->op_sibling) {
1051 if (kid->op_sibling)
1056 WITH_THR(PL_curcop = &PL_compiling);
1060 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1061 if (kid->op_sibling)
1066 WITH_THR(PL_curcop = &PL_compiling);
1069 /* all requires must return a boolean value */
1070 o->op_flags &= ~OPf_WANT;
1082 if (o->op_type == OP_LINESEQ ||
1083 o->op_type == OP_SCOPE ||
1084 o->op_type == OP_LEAVE ||
1085 o->op_type == OP_LEAVETRY)
1088 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1089 if (kid->op_sibling) {
1093 PL_curcop = &PL_compiling;
1095 o->op_flags &= ~OPf_PARENS;
1096 if (PL_hints & HINT_BLOCK_SCOPE)
1097 o->op_flags |= OPf_PARENS;
1100 o = newOP(OP_STUB, 0);
1105 modkids(OP *o, I32 type)
1108 if (o && o->op_flags & OPf_KIDS) {
1109 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1116 mod(OP *o, I32 type)
1123 if (!o || PL_error_count)
1126 switch (o->op_type) {
1131 if (!(o->op_private & (OPpCONST_ARYBASE)))
1133 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1134 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1138 SAVEI32(PL_compiling.cop_arybase);
1139 PL_compiling.cop_arybase = 0;
1141 else if (type == OP_REFGEN)
1144 croak("That use of $[ is unsupported");
1147 if (o->op_flags & OPf_PARENS)
1151 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1152 !(o->op_flags & OPf_STACKED)) {
1153 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1154 o->op_ppaddr = ppaddr[OP_RV2CV];
1155 assert(cUNOPo->op_first->op_type == OP_NULL);
1156 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1162 /* grep, foreach, subcalls, refgen */
1163 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1165 yyerror(form("Can't modify %s in %s",
1166 op_desc[o->op_type],
1167 type ? op_desc[type] : "local"));
1181 case OP_RIGHT_SHIFT:
1190 if (!(o->op_flags & OPf_STACKED))
1196 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1202 if (!type && cUNOPo->op_first->op_type != OP_GV)
1203 croak("Can't localize through a reference");
1204 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1205 PL_modcount = 10000;
1206 return o; /* Treat \(@foo) like ordinary list. */
1210 if (scalar_mod_type(o, type))
1212 ref(cUNOPo->op_first, o->op_type);
1221 PL_modcount = 10000;
1224 if (!type && cUNOPo->op_first->op_type != OP_GV)
1225 croak("Can't localize through a reference");
1226 ref(cUNOPo->op_first, o->op_type);
1230 PL_hints |= HINT_BLOCK_SCOPE;
1238 PL_modcount = 10000;
1239 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1240 return o; /* Treat \(@foo) like ordinary list. */
1241 if (scalar_mod_type(o, type))
1247 croak("Can't localize lexical variable %s",
1248 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1253 PL_modcount++; /* XXX ??? */
1255 #endif /* USE_THREADS */
1261 if (type != OP_SASSIGN)
1265 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1271 pad_free(o->op_targ);
1272 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1273 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1274 if (o->op_flags & OPf_KIDS)
1275 mod(cBINOPo->op_first->op_sibling, type);
1280 ref(cBINOPo->op_first, o->op_type);
1281 if (type == OP_ENTERSUB &&
1282 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1283 o->op_private |= OPpLVAL_DEFER;
1290 if (o->op_flags & OPf_KIDS)
1291 mod(cLISTOPo->op_last, type);
1295 if (!(o->op_flags & OPf_KIDS))
1297 if (o->op_targ != OP_LIST) {
1298 mod(cBINOPo->op_first, type);
1303 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1307 o->op_flags |= OPf_MOD;
1309 if (type == OP_AASSIGN || type == OP_SASSIGN)
1310 o->op_flags |= OPf_SPECIAL|OPf_REF;
1312 o->op_private |= OPpLVAL_INTRO;
1313 o->op_flags &= ~OPf_SPECIAL;
1314 PL_hints |= HINT_BLOCK_SCOPE;
1316 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1317 o->op_flags |= OPf_REF;
1322 scalar_mod_type(OP *o, I32 type)
1326 if (o->op_type == OP_RV2GV)
1350 case OP_RIGHT_SHIFT:
1360 case OP_ANDASSIGN: /* may work later */
1361 case OP_ORASSIGN: /* may work later */
1369 refkids(OP *o, I32 type)
1372 if (o && o->op_flags & OPf_KIDS) {
1373 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1380 ref(OP *o, I32 type)
1384 if (!o || PL_error_count)
1387 switch (o->op_type) {
1389 if ((type == OP_DEFINED || type == OP_LOCK) &&
1390 !(o->op_flags & OPf_STACKED)) {
1391 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1392 o->op_ppaddr = ppaddr[OP_RV2CV];
1393 assert(cUNOPo->op_first->op_type == OP_NULL);
1394 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1395 o->op_flags |= OPf_SPECIAL;
1400 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1404 ref(cUNOPo->op_first, o->op_type);
1407 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1408 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1409 : type == OP_RV2HV ? OPpDEREF_HV
1411 o->op_flags |= OPf_MOD;
1416 o->op_flags |= OPf_MOD; /* XXX ??? */
1421 o->op_flags |= OPf_REF;
1424 ref(cUNOPo->op_first, o->op_type);
1429 o->op_flags |= OPf_REF;
1434 if (!(o->op_flags & OPf_KIDS))
1436 ref(cBINOPo->op_first, type);
1440 ref(cBINOPo->op_first, o->op_type);
1441 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1442 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1443 : type == OP_RV2HV ? OPpDEREF_HV
1445 o->op_flags |= OPf_MOD;
1453 if (!(o->op_flags & OPf_KIDS))
1455 ref(cLISTOPo->op_last, type);
1470 if (!o || PL_error_count)
1474 if (type == OP_LIST) {
1475 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1477 } else if (type == OP_UNDEF) {
1479 } else if (type != OP_PADSV &&
1482 type != OP_PUSHMARK)
1484 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1487 o->op_flags |= OPf_MOD;
1488 o->op_private |= OPpLVAL_INTRO;
1496 o->op_flags |= OPf_PARENS;
1501 bind_match(I32 type, OP *left, OP *right)
1506 (left->op_type == OP_RV2AV ||
1507 left->op_type == OP_RV2HV ||
1508 left->op_type == OP_PADAV ||
1509 left->op_type == OP_PADHV)) {
1510 char *desc = op_desc[(right->op_type == OP_SUBST ||
1511 right->op_type == OP_TRANS)
1512 ? right->op_type : OP_MATCH];
1513 char *sample = ((left->op_type == OP_RV2AV ||
1514 left->op_type == OP_PADAV)
1515 ? "@array" : "%hash");
1516 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1519 if (right->op_type == OP_MATCH ||
1520 right->op_type == OP_SUBST ||
1521 right->op_type == OP_TRANS) {
1522 right->op_flags |= OPf_STACKED;
1523 if (right->op_type != OP_MATCH)
1524 left = mod(left, right->op_type);
1525 if (right->op_type == OP_TRANS)
1526 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1528 o = prepend_elem(right->op_type, scalar(left), right);
1530 return newUNOP(OP_NOT, 0, scalar(o));
1534 return bind_match(type, left,
1535 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1543 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1544 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1551 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1552 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1553 o->op_type = OP_LEAVE;
1554 o->op_ppaddr = ppaddr[OP_LEAVE];
1557 if (o->op_type == OP_LINESEQ) {
1559 o->op_type = OP_SCOPE;
1560 o->op_ppaddr = ppaddr[OP_SCOPE];
1561 kid = ((LISTOP*)o)->op_first;
1562 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1563 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1568 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1578 SAVESPTR(GvHV(PL_hintgv));
1579 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1580 SAVEFREESV(GvHV(PL_hintgv));
1584 block_start(int full)
1587 int retval = PL_savestack_ix;
1589 SAVEI32(PL_comppad_name_floor);
1591 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1592 PL_comppad_name_floor = PL_comppad_name_fill;
1594 PL_comppad_name_floor = 0;
1596 SAVEI32(PL_min_intro_pending);
1597 SAVEI32(PL_max_intro_pending);
1598 PL_min_intro_pending = 0;
1599 SAVEI32(PL_comppad_name_fill);
1600 SAVEI32(PL_padix_floor);
1601 PL_padix_floor = PL_padix;
1602 PL_pad_reset_pending = FALSE;
1604 PL_hints &= ~HINT_BLOCK_SCOPE;
1609 block_end(I32 floor, OP *seq)
1612 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1613 OP* retval = scalarseq(seq);
1615 PL_pad_reset_pending = FALSE;
1617 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1618 pad_leavemy(PL_comppad_name_fill);
1627 OP *o = newOP(OP_THREADSV, 0);
1628 o->op_targ = find_threadsv("_");
1631 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1632 #endif /* USE_THREADS */
1640 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1641 PL_eval_start = linklist(PL_eval_root);
1642 PL_eval_root->op_next = 0;
1643 peep(PL_eval_start);
1648 PL_main_root = scope(sawparens(scalarvoid(o)));
1649 PL_curcop = &PL_compiling;
1650 PL_main_start = LINKLIST(PL_main_root);
1651 PL_main_root->op_next = 0;
1652 peep(PL_main_start);
1655 /* Register with debugger */
1657 CV *cv = perl_get_cv("DB::postponed", FALSE);
1661 XPUSHs((SV*)PL_compiling.cop_filegv);
1663 perl_call_sv((SV*)cv, G_DISCARD);
1670 localize(OP *o, I32 lex)
1672 if (o->op_flags & OPf_PARENS)
1675 if (PL_dowarn && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1677 for (s = PL_bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1678 if (*s == ';' || *s == '=')
1679 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1683 PL_in_my_stash = Nullhv;
1687 return mod(o, OP_NULL); /* a bit kludgey */
1693 if (o->op_type == OP_LIST) {
1696 o2 = newOP(OP_THREADSV, 0);
1697 o2->op_targ = find_threadsv(";");
1699 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1700 #endif /* USE_THREADS */
1701 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1707 fold_constants(register OP *o)
1711 I32 type = o->op_type;
1714 if (opargs[type] & OA_RETSCALAR)
1716 if (opargs[type] & OA_TARGET)
1717 o->op_targ = pad_alloc(type, SVs_PADTMP);
1719 if ((opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1720 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1722 if (!(opargs[type] & OA_FOLDCONST))
1737 if (o->op_private & OPpLOCALE)
1742 goto nope; /* Don't try to run w/ errors */
1744 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1745 if (curop->op_type != OP_CONST &&
1746 curop->op_type != OP_LIST &&
1747 curop->op_type != OP_SCALAR &&
1748 curop->op_type != OP_NULL &&
1749 curop->op_type != OP_PUSHMARK) {
1754 curop = LINKLIST(o);
1758 sv = *(PL_stack_sp--);
1759 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1760 pad_swipe(o->op_targ);
1761 else if (SvTEMP(sv)) { /* grab mortal temp? */
1762 (void)SvREFCNT_inc(sv);
1766 if (type == OP_RV2GV)
1767 return newGVOP(OP_GV, 0, (GV*)sv);
1769 /* try to smush double to int, but don't smush -2.0 to -2 */
1770 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1774 if ((double)iv == SvNV(sv)) {
1779 SvIOK_off(sv); /* undo SvIV() damage */
1781 return newSVOP(OP_CONST, 0, sv);
1785 if (!(opargs[type] & OA_OTHERINT))
1788 if (!(PL_hints & HINT_INTEGER)) {
1789 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1792 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1793 if (curop->op_type == OP_CONST) {
1794 if (SvIOK(((SVOP*)curop)->op_sv))
1798 if (opargs[curop->op_type] & OA_RETINTEGER)
1802 o->op_ppaddr = ppaddr[++(o->op_type)];
1809 gen_constant_list(register OP *o)
1813 I32 oldtmps_floor = PL_tmps_floor;
1817 return o; /* Don't attempt to run with errors */
1819 PL_op = curop = LINKLIST(o);
1825 PL_tmps_floor = oldtmps_floor;
1827 o->op_type = OP_RV2AV;
1828 o->op_ppaddr = ppaddr[OP_RV2AV];
1829 curop = ((UNOP*)o)->op_first;
1830 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1837 convert(I32 type, I32 flags, OP *o)
1842 if (!o || o->op_type != OP_LIST)
1843 o = newLISTOP(OP_LIST, 0, o, Nullop);
1845 o->op_flags &= ~OPf_WANT;
1847 if (!(opargs[type] & OA_MARK))
1848 null(cLISTOPo->op_first);
1851 o->op_ppaddr = ppaddr[type];
1852 o->op_flags |= flags;
1854 o = CHECKOP(type, o);
1855 if (o->op_type != type)
1858 if (cLISTOPo->op_children < 7) {
1859 /* XXX do we really need to do this if we're done appending?? */
1860 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1862 cLISTOPo->op_last = last; /* in case check substituted last arg */
1865 return fold_constants(o);
1868 /* List constructors */
1871 append_elem(I32 type, OP *first, OP *last)
1879 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1880 return newLISTOP(type, 0, first, last);
1882 if (first->op_flags & OPf_KIDS)
1883 ((LISTOP*)first)->op_last->op_sibling = last;
1885 first->op_flags |= OPf_KIDS;
1886 ((LISTOP*)first)->op_first = last;
1888 ((LISTOP*)first)->op_last = last;
1889 ((LISTOP*)first)->op_children++;
1894 append_list(I32 type, LISTOP *first, LISTOP *last)
1902 if (first->op_type != type)
1903 return prepend_elem(type, (OP*)first, (OP*)last);
1905 if (last->op_type != type)
1906 return append_elem(type, (OP*)first, (OP*)last);
1908 first->op_last->op_sibling = last->op_first;
1909 first->op_last = last->op_last;
1910 first->op_children += last->op_children;
1911 if (first->op_children)
1912 first->op_flags |= OPf_KIDS;
1919 prepend_elem(I32 type, OP *first, OP *last)
1927 if (last->op_type == type) {
1928 if (type == OP_LIST) { /* already a PUSHMARK there */
1929 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1930 ((LISTOP*)last)->op_first->op_sibling = first;
1933 if (!(last->op_flags & OPf_KIDS)) {
1934 ((LISTOP*)last)->op_last = first;
1935 last->op_flags |= OPf_KIDS;
1937 first->op_sibling = ((LISTOP*)last)->op_first;
1938 ((LISTOP*)last)->op_first = first;
1940 ((LISTOP*)last)->op_children++;
1944 return newLISTOP(type, 0, first, last);
1952 return newOP(OP_STUB, 0);
1958 if (!o || o->op_type != OP_LIST)
1959 o = newLISTOP(OP_LIST, 0, o, Nullop);
1965 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1969 Newz(1101, listop, 1, LISTOP);
1971 listop->op_type = type;
1972 listop->op_ppaddr = ppaddr[type];
1973 listop->op_children = (first != 0) + (last != 0);
1974 listop->op_flags = flags;
1978 else if (!first && last)
1981 first->op_sibling = last;
1982 listop->op_first = first;
1983 listop->op_last = last;
1984 if (type == OP_LIST) {
1986 pushop = newOP(OP_PUSHMARK, 0);
1987 pushop->op_sibling = first;
1988 listop->op_first = pushop;
1989 listop->op_flags |= OPf_KIDS;
1991 listop->op_last = pushop;
1993 else if (listop->op_children)
1994 listop->op_flags |= OPf_KIDS;
2000 newOP(I32 type, I32 flags)
2003 Newz(1101, o, 1, OP);
2005 o->op_ppaddr = ppaddr[type];
2006 o->op_flags = flags;
2009 o->op_private = 0 + (flags >> 8);
2010 if (opargs[type] & OA_RETSCALAR)
2012 if (opargs[type] & OA_TARGET)
2013 o->op_targ = pad_alloc(type, SVs_PADTMP);
2014 return CHECKOP(type, o);
2018 newUNOP(I32 type, I32 flags, OP *first)
2023 first = newOP(OP_STUB, 0);
2024 if (opargs[type] & OA_MARK)
2025 first = force_list(first);
2027 Newz(1101, unop, 1, UNOP);
2028 unop->op_type = type;
2029 unop->op_ppaddr = ppaddr[type];
2030 unop->op_first = first;
2031 unop->op_flags = flags | OPf_KIDS;
2032 unop->op_private = 1 | (flags >> 8);
2033 unop = (UNOP*) CHECKOP(type, unop);
2037 return fold_constants((OP *) unop);
2041 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2044 Newz(1101, binop, 1, BINOP);
2047 first = newOP(OP_NULL, 0);
2049 binop->op_type = type;
2050 binop->op_ppaddr = ppaddr[type];
2051 binop->op_first = first;
2052 binop->op_flags = flags | OPf_KIDS;
2055 binop->op_private = 1 | (flags >> 8);
2058 binop->op_private = 2 | (flags >> 8);
2059 first->op_sibling = last;
2062 binop = (BINOP*)CHECKOP(type, binop);
2066 binop->op_last = last = binop->op_first->op_sibling;
2068 return fold_constants((OP *)binop);
2072 pmtrans(OP *o, OP *expr, OP *repl)
2074 SV *tstr = ((SVOP*)expr)->op_sv;
2075 SV *rstr = ((SVOP*)repl)->op_sv;
2078 register U8 *t = (U8*)SvPV(tstr, tlen);
2079 register U8 *r = (U8*)SvPV(rstr, rlen);
2085 register short *tbl;
2087 tbl = (short*)cPVOPo->op_pv;
2088 complement = o->op_private & OPpTRANS_COMPLEMENT;
2089 Delete = o->op_private & OPpTRANS_DELETE;
2090 squash = o->op_private & OPpTRANS_SQUASH;
2093 Zero(tbl, 256, short);
2094 for (i = 0; i < tlen; i++)
2096 for (i = 0, j = 0; i < 256; i++) {
2112 if (!rlen && !Delete) {
2115 o->op_private |= OPpTRANS_COUNTONLY;
2117 for (i = 0; i < 256; i++)
2119 for (i = 0, j = 0; i < tlen; i++,j++) {
2122 if (tbl[t[i]] == -1)
2128 if (tbl[t[i]] == -1)
2139 newPMOP(I32 type, I32 flags)
2144 Newz(1101, pmop, 1, PMOP);
2145 pmop->op_type = type;
2146 pmop->op_ppaddr = ppaddr[type];
2147 pmop->op_flags = flags;
2148 pmop->op_private = 0 | (flags >> 8);
2150 if (PL_hints & HINT_RE_TAINT)
2151 pmop->op_pmpermflags |= PMf_RETAINT;
2152 if (PL_hints & HINT_LOCALE)
2153 pmop->op_pmpermflags |= PMf_LOCALE;
2154 pmop->op_pmflags = pmop->op_pmpermflags;
2156 /* link into pm list */
2157 if (type != OP_TRANS && PL_curstash) {
2158 pmop->op_pmnext = HvPMROOT(PL_curstash);
2159 HvPMROOT(PL_curstash) = pmop;
2166 pmruntime(OP *o, OP *expr, OP *repl)
2171 I32 repl_has_vars = 0;
2173 if (o->op_type == OP_TRANS)
2174 return pmtrans(o, expr, repl);
2176 PL_hints |= HINT_BLOCK_SCOPE;
2179 if (expr->op_type == OP_CONST) {
2181 SV *pat = ((SVOP*)expr)->op_sv;
2182 char *p = SvPV(pat, plen);
2183 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2184 sv_setpvn(pat, "\\s+", 3);
2185 p = SvPV(pat, plen);
2186 pm->op_pmflags |= PMf_SKIPWHITE;
2188 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2189 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2190 pm->op_pmflags |= PMf_WHITE;
2194 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2195 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2197 : OP_REGCMAYBE),0,expr);
2199 Newz(1101, rcop, 1, LOGOP);
2200 rcop->op_type = OP_REGCOMP;
2201 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2202 rcop->op_first = scalar(expr);
2203 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2204 ? (OPf_SPECIAL | OPf_KIDS)
2206 rcop->op_private = 1;
2209 /* establish postfix order */
2210 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2212 rcop->op_next = expr;
2213 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2216 rcop->op_next = LINKLIST(expr);
2217 expr->op_next = (OP*)rcop;
2220 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2225 if (pm->op_pmflags & PMf_EVAL)
2228 else if (repl->op_type == OP_THREADSV
2229 && strchr("&`'123456789+",
2230 PL_threadsv_names[repl->op_targ]))
2234 #endif /* USE_THREADS */
2235 else if (repl->op_type == OP_CONST)
2239 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2240 if (opargs[curop->op_type] & OA_DANGEROUS) {
2242 if (curop->op_type == OP_THREADSV) {
2244 if (strchr("&`'123456789+", curop->op_private))
2248 if (curop->op_type == OP_GV) {
2249 GV *gv = ((GVOP*)curop)->op_gv;
2251 if (strchr("&`'123456789+", *GvENAME(gv)))
2254 #endif /* USE_THREADS */
2255 else if (curop->op_type == OP_RV2CV)
2257 else if (curop->op_type == OP_RV2SV ||
2258 curop->op_type == OP_RV2AV ||
2259 curop->op_type == OP_RV2HV ||
2260 curop->op_type == OP_RV2GV) {
2261 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2264 else if (curop->op_type == OP_PADSV ||
2265 curop->op_type == OP_PADAV ||
2266 curop->op_type == OP_PADHV ||
2267 curop->op_type == OP_PADANY) {
2270 else if (curop->op_type == OP_PUSHRE)
2271 ; /* Okay here, dangerous in newASSIGNOP */
2280 && (!pm->op_pmregexp
2281 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2282 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2283 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2284 prepend_elem(o->op_type, scalar(repl), o);
2287 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2288 pm->op_pmflags |= PMf_MAYBE_CONST;
2289 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2291 Newz(1101, rcop, 1, LOGOP);
2292 rcop->op_type = OP_SUBSTCONT;
2293 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2294 rcop->op_first = scalar(repl);
2295 rcop->op_flags |= OPf_KIDS;
2296 rcop->op_private = 1;
2299 /* establish postfix order */
2300 rcop->op_next = LINKLIST(repl);
2301 repl->op_next = (OP*)rcop;
2303 pm->op_pmreplroot = scalar((OP*)rcop);
2304 pm->op_pmreplstart = LINKLIST(rcop);
2313 newSVOP(I32 type, I32 flags, SV *sv)
2316 Newz(1101, svop, 1, SVOP);
2317 svop->op_type = type;
2318 svop->op_ppaddr = ppaddr[type];
2320 svop->op_next = (OP*)svop;
2321 svop->op_flags = flags;
2322 if (opargs[type] & OA_RETSCALAR)
2324 if (opargs[type] & OA_TARGET)
2325 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2326 return CHECKOP(type, svop);
2330 newGVOP(I32 type, I32 flags, GV *gv)
2334 Newz(1101, gvop, 1, GVOP);
2335 gvop->op_type = type;
2336 gvop->op_ppaddr = ppaddr[type];
2337 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2338 gvop->op_next = (OP*)gvop;
2339 gvop->op_flags = flags;
2340 if (opargs[type] & OA_RETSCALAR)
2342 if (opargs[type] & OA_TARGET)
2343 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2344 return CHECKOP(type, gvop);
2348 newPVOP(I32 type, I32 flags, char *pv)
2351 Newz(1101, pvop, 1, PVOP);
2352 pvop->op_type = type;
2353 pvop->op_ppaddr = ppaddr[type];
2355 pvop->op_next = (OP*)pvop;
2356 pvop->op_flags = flags;
2357 if (opargs[type] & OA_RETSCALAR)
2359 if (opargs[type] & OA_TARGET)
2360 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2361 return CHECKOP(type, pvop);
2370 save_hptr(&PL_curstash);
2371 save_item(PL_curstname);
2376 name = SvPV(sv, len);
2377 PL_curstash = gv_stashpvn(name,len,TRUE);
2378 sv_setpvn(PL_curstname, name, len);
2382 sv_setpv(PL_curstname,"<none>");
2383 PL_curstash = Nullhv;
2385 PL_hints |= HINT_BLOCK_SCOPE;
2386 PL_copline = NOLINE;
2391 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2400 if (id->op_type != OP_CONST)
2401 croak("Module name must be constant");
2405 if(version != Nullop) {
2406 SV *vesv = ((SVOP*)version)->op_sv;
2408 if (arg == Nullop && !SvNIOK(vesv)) {
2415 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2416 croak("Version number must be constant number");
2418 /* Make copy of id so we don't free it twice */
2419 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2421 /* Fake up a method call to VERSION */
2422 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2423 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2424 append_elem(OP_LIST,
2425 prepend_elem(OP_LIST, pack, list(version)),
2426 newUNOP(OP_METHOD, 0, meth)));
2430 /* Fake up an import/unimport */
2431 if (arg && arg->op_type == OP_STUB)
2432 imop = arg; /* no import on explicit () */
2433 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2434 imop = Nullop; /* use 5.0; */
2437 /* Make copy of id so we don't free it twice */
2438 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2439 meth = newSVOP(OP_CONST, 0,
2441 ? newSVpv("import", 6)
2442 : newSVpv("unimport", 8)
2444 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2445 append_elem(OP_LIST,
2446 prepend_elem(OP_LIST, pack, list(arg)),
2447 newUNOP(OP_METHOD, 0, meth)));
2450 /* Fake up a require, handle override, if any */
2451 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2452 if (!(gv && GvIMPORTED_CV(gv)))
2453 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2455 if (gv && GvIMPORTED_CV(gv)) {
2456 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2457 append_elem(OP_LIST, id,
2458 scalar(newUNOP(OP_RV2CV, 0,
2463 rqop = newUNOP(OP_REQUIRE, 0, id);
2466 /* Fake up the BEGIN {}, which does its thing immediately. */
2468 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2470 append_elem(OP_LINESEQ,
2471 append_elem(OP_LINESEQ,
2472 newSTATEOP(0, Nullch, rqop),
2473 newSTATEOP(0, Nullch, veop)),
2474 newSTATEOP(0, Nullch, imop) ));
2476 PL_copline = NOLINE;
2486 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2487 if (!(gv && GvIMPORTED_CV(gv)))
2488 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2490 if (gv && GvIMPORTED_CV(gv)) {
2491 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2492 append_elem(OP_LIST, term,
2493 scalar(newUNOP(OP_RV2CV, 0,
2498 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2504 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2506 return newBINOP(OP_LSLICE, flags,
2507 list(force_list(subscript)),
2508 list(force_list(listval)) );
2512 list_assignment(register OP *o)
2517 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2518 o = cUNOPo->op_first;
2520 if (o->op_type == OP_COND_EXPR) {
2521 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2522 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2527 yyerror("Assignment to both a list and a scalar");
2531 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2532 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2533 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2536 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2539 if (o->op_type == OP_RV2SV)
2546 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2551 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2552 return newLOGOP(optype, 0,
2553 mod(scalar(left), optype),
2554 newUNOP(OP_SASSIGN, 0, scalar(right)));
2557 return newBINOP(optype, OPf_STACKED,
2558 mod(scalar(left), optype), scalar(right));
2562 if (list_assignment(left)) {
2565 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2566 left = mod(left, OP_AASSIGN);
2574 o = newBINOP(OP_AASSIGN, flags,
2575 list(force_list(right)),
2576 list(force_list(left)) );
2577 o->op_private = 0 | (flags >> 8);
2578 if (!(left->op_private & OPpLVAL_INTRO)) {
2582 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2583 if (opargs[curop->op_type] & OA_DANGEROUS) {
2584 if (curop->op_type == OP_GV) {
2585 GV *gv = ((GVOP*)curop)->op_gv;
2586 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2588 SvCUR(gv) = PL_generation;
2590 else if (curop->op_type == OP_PADSV ||
2591 curop->op_type == OP_PADAV ||
2592 curop->op_type == OP_PADHV ||
2593 curop->op_type == OP_PADANY) {
2594 SV **svp = AvARRAY(PL_comppad_name);
2595 SV *sv = svp[curop->op_targ];
2596 if (SvCUR(sv) == PL_generation)
2598 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2600 else if (curop->op_type == OP_RV2CV)
2602 else if (curop->op_type == OP_RV2SV ||
2603 curop->op_type == OP_RV2AV ||
2604 curop->op_type == OP_RV2HV ||
2605 curop->op_type == OP_RV2GV) {
2606 if (lastop->op_type != OP_GV) /* funny deref? */
2609 else if (curop->op_type == OP_PUSHRE) {
2610 if (((PMOP*)curop)->op_pmreplroot) {
2611 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2612 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2614 SvCUR(gv) = PL_generation;
2623 o->op_private = OPpASSIGN_COMMON;
2625 if (right && right->op_type == OP_SPLIT) {
2627 if ((tmpop = ((LISTOP*)right)->op_first) &&
2628 tmpop->op_type == OP_PUSHRE)
2630 PMOP *pm = (PMOP*)tmpop;
2631 if (left->op_type == OP_RV2AV &&
2632 !(left->op_private & OPpLVAL_INTRO) &&
2633 !(o->op_private & OPpASSIGN_COMMON) )
2635 tmpop = ((UNOP*)left)->op_first;
2636 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2637 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2638 pm->op_pmflags |= PMf_ONCE;
2639 tmpop = cUNOPo->op_first; /* to list (nulled) */
2640 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2641 tmpop->op_sibling = Nullop; /* don't free split */
2642 right->op_next = tmpop->op_next; /* fix starting loc */
2643 op_free(o); /* blow off assign */
2644 right->op_flags &= ~OPf_WANT;
2645 /* "I don't know and I don't care." */
2650 if (PL_modcount < 10000 &&
2651 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2653 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2655 sv_setiv(sv, PL_modcount+1);
2663 right = newOP(OP_UNDEF, 0);
2664 if (right->op_type == OP_READLINE) {
2665 right->op_flags |= OPf_STACKED;
2666 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2669 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2670 o = newBINOP(OP_SASSIGN, flags,
2671 scalar(right), mod(scalar(left), OP_SASSIGN) );
2683 newSTATEOP(I32 flags, char *label, OP *o)
2686 U32 seq = intro_my();
2689 Newz(1101, cop, 1, COP);
2690 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2691 cop->op_type = OP_DBSTATE;
2692 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2695 cop->op_type = OP_NEXTSTATE;
2696 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2698 cop->op_flags = flags;
2699 cop->op_private = 0 | (flags >> 8);
2701 cop->op_private |= NATIVE_HINTS;
2703 cop->op_next = (OP*)cop;
2706 cop->cop_label = label;
2707 PL_hints |= HINT_BLOCK_SCOPE;
2710 cop->cop_arybase = PL_curcop->cop_arybase;
2712 if (PL_copline == NOLINE)
2713 cop->cop_line = PL_curcop->cop_line;
2715 cop->cop_line = PL_copline;
2716 PL_copline = NOLINE;
2718 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2719 cop->cop_stash = PL_curstash;
2721 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2722 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2723 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2724 (void)SvIOK_on(*svp);
2726 SvSTASH(*svp) = (HV*)cop;
2730 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2733 /* "Introduce" my variables to visible status. */
2741 if (! PL_min_intro_pending)
2742 return PL_cop_seqmax;
2744 svp = AvARRAY(PL_comppad_name);
2745 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2746 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2747 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
2748 SvNVX(sv) = (double)PL_cop_seqmax;
2751 PL_min_intro_pending = 0;
2752 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2753 return PL_cop_seqmax++;
2757 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2759 return new_logop(type, flags, &first, &other);
2763 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2768 OP *first = *firstp;
2769 OP *other = *otherp;
2771 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2772 return newBINOP(type, flags, scalar(first), scalar(other));
2774 scalarboolean(first);
2775 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2776 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2777 if (type == OP_AND || type == OP_OR) {
2783 first = *firstp = cUNOPo->op_first;
2785 first->op_next = o->op_next;
2786 cUNOPo->op_first = Nullop;
2790 if (first->op_type == OP_CONST) {
2791 if (PL_dowarn && (first->op_private & OPpCONST_BARE))
2792 warn("Probable precedence problem on %s", op_desc[type]);
2793 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2804 else if (first->op_type == OP_WANTARRAY) {
2810 else if (PL_dowarn && (first->op_flags & OPf_KIDS)) {
2811 OP *k1 = ((UNOP*)first)->op_first;
2812 OP *k2 = k1->op_sibling;
2814 switch (first->op_type)
2817 if (k2 && k2->op_type == OP_READLINE
2818 && (k2->op_flags & OPf_STACKED)
2819 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2820 warnop = k2->op_type;
2824 if (k1->op_type == OP_READDIR
2825 || k1->op_type == OP_GLOB
2826 || k1->op_type == OP_EACH)
2827 warnop = k1->op_type;
2831 line_t oldline = PL_curcop->cop_line;
2832 PL_curcop->cop_line = PL_copline;
2833 warn("Value of %s%s can be \"0\"; test with defined()",
2835 ((warnop == OP_READLINE || warnop == OP_GLOB)
2836 ? " construct" : "() operator"));
2837 PL_curcop->cop_line = oldline;
2844 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2845 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2847 Newz(1101, logop, 1, LOGOP);
2849 logop->op_type = type;
2850 logop->op_ppaddr = ppaddr[type];
2851 logop->op_first = first;
2852 logop->op_flags = flags | OPf_KIDS;
2853 logop->op_other = LINKLIST(other);
2854 logop->op_private = 1 | (flags >> 8);
2856 /* establish postfix order */
2857 logop->op_next = LINKLIST(first);
2858 first->op_next = (OP*)logop;
2859 first->op_sibling = other;
2861 o = newUNOP(OP_NULL, 0, (OP*)logop);
2868 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2875 return newLOGOP(OP_AND, 0, first, trueop);
2877 return newLOGOP(OP_OR, 0, first, falseop);
2879 scalarboolean(first);
2880 if (first->op_type == OP_CONST) {
2881 if (SvTRUE(((SVOP*)first)->op_sv)) {
2892 else if (first->op_type == OP_WANTARRAY) {
2896 Newz(1101, condop, 1, CONDOP);
2898 condop->op_type = OP_COND_EXPR;
2899 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2900 condop->op_first = first;
2901 condop->op_flags = flags | OPf_KIDS;
2902 condop->op_true = LINKLIST(trueop);
2903 condop->op_false = LINKLIST(falseop);
2904 condop->op_private = 1 | (flags >> 8);
2906 /* establish postfix order */
2907 condop->op_next = LINKLIST(first);
2908 first->op_next = (OP*)condop;
2910 first->op_sibling = trueop;
2911 trueop->op_sibling = falseop;
2912 o = newUNOP(OP_NULL, 0, (OP*)condop);
2914 trueop->op_next = o;
2915 falseop->op_next = o;
2921 newRANGE(I32 flags, OP *left, OP *right)
2929 Newz(1101, condop, 1, CONDOP);
2931 condop->op_type = OP_RANGE;
2932 condop->op_ppaddr = ppaddr[OP_RANGE];
2933 condop->op_first = left;
2934 condop->op_flags = OPf_KIDS;
2935 condop->op_true = LINKLIST(left);
2936 condop->op_false = LINKLIST(right);
2937 condop->op_private = 1 | (flags >> 8);
2939 left->op_sibling = right;
2941 condop->op_next = (OP*)condop;
2942 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2943 flop = newUNOP(OP_FLOP, 0, flip);
2944 o = newUNOP(OP_NULL, 0, flop);
2947 left->op_next = flip;
2948 right->op_next = flop;
2950 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2951 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2952 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2953 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2955 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2956 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2959 if (!flip->op_private || !flop->op_private)
2960 linklist(o); /* blow off optimizer unless constant */
2966 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2971 int once = block && block->op_flags & OPf_SPECIAL &&
2972 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2975 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2976 return block; /* do {} while 0 does once */
2977 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2978 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2979 expr = newUNOP(OP_DEFINED, 0,
2980 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2981 } else if (expr->op_flags & OPf_KIDS) {
2982 OP *k1 = ((UNOP*)expr)->op_first;
2983 OP *k2 = (k1) ? k1->op_sibling : NULL;
2984 switch (expr->op_type) {
2986 if (k2 && k2->op_type == OP_READLINE
2987 && (k2->op_flags & OPf_STACKED)
2988 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2989 expr = newUNOP(OP_DEFINED, 0, expr);
2993 if (k1->op_type == OP_READDIR
2994 || k1->op_type == OP_GLOB
2995 || k1->op_type == OP_EACH)
2996 expr = newUNOP(OP_DEFINED, 0, expr);
3002 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3003 o = new_logop(OP_AND, 0, &expr, &listop);
3006 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3008 if (once && o != listop)
3009 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3012 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3014 o->op_flags |= flags;
3016 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3021 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3030 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3031 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3032 expr = newUNOP(OP_DEFINED, 0,
3033 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3034 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3035 OP *k1 = ((UNOP*)expr)->op_first;
3036 OP *k2 = (k1) ? k1->op_sibling : NULL;
3037 switch (expr->op_type) {
3039 if (k2 && k2->op_type == OP_READLINE
3040 && (k2->op_flags & OPf_STACKED)
3041 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3042 expr = newUNOP(OP_DEFINED, 0, expr);
3046 if (k1->op_type == OP_READDIR
3047 || k1->op_type == OP_GLOB
3048 || k1->op_type == OP_EACH)
3049 expr = newUNOP(OP_DEFINED, 0, expr);
3055 block = newOP(OP_NULL, 0);
3058 next = LINKLIST(cont);
3060 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3061 if ((line_t)whileline != NOLINE) {
3062 PL_copline = whileline;
3063 cont = append_elem(OP_LINESEQ, cont,
3064 newSTATEOP(0, Nullch, Nullop));
3068 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3069 redo = LINKLIST(listop);
3072 PL_copline = whileline;
3074 o = new_logop(OP_AND, 0, &expr, &listop);
3075 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3076 op_free(expr); /* oops, it's a while (0) */
3078 return Nullop; /* listop already freed by new_logop */
3081 ((LISTOP*)listop)->op_last->op_next = condop =
3082 (o == listop ? redo : LINKLIST(o));
3090 Newz(1101,loop,1,LOOP);
3091 loop->op_type = OP_ENTERLOOP;
3092 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
3093 loop->op_private = 0;
3094 loop->op_next = (OP*)loop;
3097 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3099 loop->op_redoop = redo;
3100 loop->op_lastop = o;
3103 loop->op_nextop = next;
3105 loop->op_nextop = o;
3107 o->op_flags |= flags;
3108 o->op_private |= (flags >> 8);
3113 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3121 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3122 sv->op_type = OP_RV2GV;
3123 sv->op_ppaddr = ppaddr[OP_RV2GV];
3125 else if (sv->op_type == OP_PADSV) { /* private variable */
3126 padoff = sv->op_targ;
3130 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3131 padoff = sv->op_targ;
3132 iterflags |= OPf_SPECIAL;
3137 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3141 padoff = find_threadsv("_");
3142 iterflags |= OPf_SPECIAL;
3144 sv = newGVOP(OP_GV, 0, PL_defgv);
3147 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3148 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3149 iterflags |= OPf_STACKED;
3151 else if (expr->op_type == OP_NULL &&
3152 (expr->op_flags & OPf_KIDS) &&
3153 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3155 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3156 * set the STACKED flag to indicate that these values are to be
3157 * treated as min/max values by 'pp_iterinit'.
3159 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3160 CONDOP* range = (CONDOP*) flip->op_first;
3161 OP* left = range->op_first;
3162 OP* right = left->op_sibling;
3165 range->op_flags &= ~OPf_KIDS;
3166 range->op_first = Nullop;
3168 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3169 listop->op_first->op_next = range->op_true;
3170 left->op_next = range->op_false;
3171 right->op_next = (OP*)listop;
3172 listop->op_next = listop->op_first;
3175 expr = (OP*)(listop);
3177 iterflags |= OPf_STACKED;
3180 expr = mod(force_list(expr), OP_GREPSTART);
3184 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3185 append_elem(OP_LIST, expr, scalar(sv))));
3186 assert(!loop->op_next);
3187 Renew(loop, 1, LOOP);
3188 loop->op_targ = padoff;
3189 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3190 PL_copline = forline;
3191 return newSTATEOP(0, label, wop);
3195 newLOOPEX(I32 type, OP *label)
3200 if (type != OP_GOTO || label->op_type == OP_CONST) {
3201 /* "last()" means "last" */
3202 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3203 o = newOP(type, OPf_SPECIAL);
3205 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3206 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3212 if (label->op_type == OP_ENTERSUB)
3213 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3214 o = newUNOP(type, OPf_STACKED, label);
3216 PL_hints |= HINT_BLOCK_SCOPE;
3226 MUTEX_DESTROY(CvMUTEXP(cv));
3227 Safefree(CvMUTEXP(cv));
3230 #endif /* USE_THREADS */
3232 if (!CvXSUB(cv) && CvROOT(cv)) {
3234 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3235 croak("Can't undef active subroutine");
3238 croak("Can't undef active subroutine");
3239 #endif /* USE_THREADS */
3242 SAVESPTR(PL_curpad);
3246 op_free(CvROOT(cv));
3247 CvROOT(cv) = Nullop;
3250 SvPOK_off((SV*)cv); /* forget prototype */
3252 SvREFCNT_dec(CvGV(cv));
3254 SvREFCNT_dec(CvOUTSIDE(cv));
3255 CvOUTSIDE(cv) = Nullcv;
3256 if (CvPADLIST(cv)) {
3257 /* may be during global destruction */
3258 if (SvREFCNT(CvPADLIST(cv))) {
3259 I32 i = AvFILLp(CvPADLIST(cv));
3261 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3262 SV* sv = svp ? *svp : Nullsv;
3265 if (sv == (SV*)PL_comppad_name)
3266 PL_comppad_name = Nullav;
3267 else if (sv == (SV*)PL_comppad) {
3268 PL_comppad = Nullav;
3269 PL_curpad = Null(SV**);
3273 SvREFCNT_dec((SV*)CvPADLIST(cv));
3275 CvPADLIST(cv) = Nullav;
3279 #ifdef DEBUG_CLOSURES
3284 CV *outside = CvOUTSIDE(cv);
3285 AV* padlist = CvPADLIST(cv);
3292 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3294 (CvANON(cv) ? "ANON"
3295 : (cv == PL_main_cv) ? "MAIN"
3296 : CvUNIQUE(cv) ? "UNIQUE"
3297 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3300 : CvANON(outside) ? "ANON"
3301 : (outside == PL_main_cv) ? "MAIN"
3302 : CvUNIQUE(outside) ? "UNIQUE"
3303 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3308 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3309 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3310 pname = AvARRAY(pad_name);
3311 ppad = AvARRAY(pad);
3313 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3314 if (SvPOK(pname[ix]))
3315 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3317 SvFAKE(pname[ix]) ? "FAKE " : "",
3319 (long)I_32(SvNVX(pname[ix])),
3320 (long)SvIVX(pname[ix]));
3323 #endif /* DEBUG_CLOSURES */
3326 cv_clone2(CV *proto, CV *outside)
3331 AV* protopadlist = CvPADLIST(proto);
3332 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3333 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3334 SV** pname = AvARRAY(protopad_name);
3335 SV** ppad = AvARRAY(protopad);
3336 I32 fname = AvFILLp(protopad_name);
3337 I32 fpad = AvFILLp(protopad);
3341 assert(!CvUNIQUE(proto));
3344 SAVESPTR(PL_curpad);
3345 SAVESPTR(PL_comppad);
3346 SAVESPTR(PL_comppad_name);
3347 SAVESPTR(PL_compcv);
3349 cv = PL_compcv = (CV*)NEWSV(1104,0);
3350 sv_upgrade((SV *)cv, SvTYPE(proto));
3356 New(666, CvMUTEXP(cv), 1, perl_mutex);
3357 MUTEX_INIT(CvMUTEXP(cv));
3359 #endif /* USE_THREADS */
3360 CvFILEGV(cv) = CvFILEGV(proto);
3361 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3362 CvSTASH(cv) = CvSTASH(proto);
3363 CvROOT(cv) = CvROOT(proto);
3364 CvSTART(cv) = CvSTART(proto);
3366 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3369 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3371 PL_comppad_name = newAV();
3372 for (ix = fname; ix >= 0; ix--)
3373 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3375 PL_comppad = newAV();
3377 comppadlist = newAV();
3378 AvREAL_off(comppadlist);
3379 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3380 av_store(comppadlist, 1, (SV*)PL_comppad);
3381 CvPADLIST(cv) = comppadlist;
3382 av_fill(PL_comppad, AvFILLp(protopad));
3383 PL_curpad = AvARRAY(PL_comppad);
3385 av = newAV(); /* will be @_ */
3387 av_store(PL_comppad, 0, (SV*)av);
3388 AvFLAGS(av) = AVf_REIFY;
3390 for (ix = fpad; ix > 0; ix--) {
3391 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3392 if (namesv && namesv != &PL_sv_undef) {
3393 char *name = SvPVX(namesv); /* XXX */
3394 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3395 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3396 CvOUTSIDE(cv), cxstack_ix, 0);
3398 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3400 croak("panic: cv_clone: %s", name);
3402 else { /* our own lexical */
3405 /* anon code -- we'll come back for it */
3406 sv = SvREFCNT_inc(ppad[ix]);
3408 else if (*name == '@')
3410 else if (*name == '%')
3420 SV* sv = NEWSV(0,0);
3426 /* Now that vars are all in place, clone nested closures. */
3428 for (ix = fpad; ix > 0; ix--) {
3429 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3431 && namesv != &PL_sv_undef
3432 && !(SvFLAGS(namesv) & SVf_FAKE)
3433 && *SvPVX(namesv) == '&'
3434 && CvCLONE(ppad[ix]))
3436 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3437 SvREFCNT_dec(ppad[ix]);
3440 PL_curpad[ix] = (SV*)kid;
3444 #ifdef DEBUG_CLOSURES
3445 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3447 PerlIO_printf(Perl_debug_log, " from:\n");
3449 PerlIO_printf(Perl_debug_log, " to:\n");
3461 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3462 cv = cv_clone2(proto, CvOUTSIDE(proto));
3463 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3468 cv_ckproto(CV *cv, GV *gv, char *p)
3470 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3471 SV* msg = sv_newmortal();
3475 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3476 sv_setpv(msg, "Prototype mismatch:");
3478 sv_catpvf(msg, " sub %_", name);
3480 sv_catpvf(msg, " (%s)", SvPVX(cv));
3481 sv_catpv(msg, " vs ");
3483 sv_catpvf(msg, "(%s)", p);
3485 sv_catpv(msg, "none");
3493 if (!cv || !SvPOK(cv) || SvCUR(cv))
3495 return op_const_sv(CvSTART(cv), cv);
3499 op_const_sv(OP *o, CV *cv)
3506 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3507 o = cLISTOPo->op_first->op_sibling;
3509 for (; o; o = o->op_next) {
3510 OPCODE type = o->op_type;
3512 if(sv && o->op_next == o)
3514 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3516 if (type == OP_LEAVESUB || type == OP_RETURN)
3520 if (type == OP_CONST)
3522 else if (type == OP_PADSV && cv) {
3523 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3524 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3525 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3537 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3541 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3542 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3543 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3544 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3553 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3554 maximum a prototype before. */
3555 if (SvTYPE(gv) > SVt_NULL) {
3556 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3557 warn("Runaway prototype");
3558 cv_ckproto((CV*)gv, NULL, ps);
3561 sv_setpv((SV*)gv, ps);
3563 sv_setiv((SV*)gv, -1);
3564 SvREFCNT_dec(PL_compcv);
3565 cv = PL_compcv = NULL;
3566 PL_sub_generation++;
3570 if (!name || GvCVGEN(gv))
3572 else if (cv = GvCV(gv)) {
3573 cv_ckproto(cv, gv, ps);
3574 /* already defined (or promised)? */
3575 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3577 bool const_changed = TRUE;
3579 /* just a "sub foo;" when &foo is already defined */
3580 SAVEFREESV(PL_compcv);
3583 /* ahem, death to those who redefine active sort subs */
3584 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3585 croak("Can't redefine active sort subroutine %s", name);
3586 if(const_sv = cv_const_sv(cv))
3587 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3588 if ((const_sv && const_changed) || PL_dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3589 && HvNAME(GvSTASH(CvGV(cv)))
3590 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3592 line_t oldline = PL_curcop->cop_line;
3593 PL_curcop->cop_line = PL_copline;
3594 warn(const_sv ? "Constant subroutine %s redefined"
3595 : "Subroutine %s redefined", name);
3596 PL_curcop->cop_line = oldline;
3602 if (cv) { /* must reuse cv if autoloaded */
3604 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3605 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3606 CvOUTSIDE(PL_compcv) = 0;
3607 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3608 CvPADLIST(PL_compcv) = 0;
3609 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3610 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3611 SvREFCNT_dec(PL_compcv);
3618 PL_sub_generation++;
3621 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3622 CvFILEGV(cv) = PL_curcop->cop_filegv;
3623 CvSTASH(cv) = PL_curstash;
3626 if (!CvMUTEXP(cv)) {
3627 New(666, CvMUTEXP(cv), 1, perl_mutex);
3628 MUTEX_INIT(CvMUTEXP(cv));
3630 #endif /* USE_THREADS */
3633 sv_setpv((SV*)cv, ps);
3635 if (PL_error_count) {
3639 char *s = strrchr(name, ':');
3641 if (strEQ(s, "BEGIN")) {
3643 "BEGIN not safe after errors--compilation aborted";
3647 /* force display of errors found but not reported */
3648 sv_catpv(ERRSV, not_safe);
3649 croak("%s", SvPVx(ERRSV, n_a));
3656 PL_copline = NOLINE;
3661 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3662 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3665 SV **namep = AvARRAY(PL_comppad_name);
3666 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3669 if (SvIMMORTAL(PL_curpad[ix]))
3672 * The only things that a clonable function needs in its
3673 * pad are references to outer lexicals and anonymous subs.
3674 * The rest are created anew during cloning.
3676 if (!((namesv = namep[ix]) != Nullsv &&
3677 namesv != &PL_sv_undef &&
3679 *SvPVX(namesv) == '&')))
3681 SvREFCNT_dec(PL_curpad[ix]);
3682 PL_curpad[ix] = Nullsv;
3687 AV *av = newAV(); /* Will be @_ */
3689 av_store(PL_comppad, 0, (SV*)av);
3690 AvFLAGS(av) = AVf_REIFY;
3692 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3693 if (SvIMMORTAL(PL_curpad[ix]))
3695 if (!SvPADMY(PL_curpad[ix]))
3696 SvPADTMP_on(PL_curpad[ix]);
3700 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3701 CvSTART(cv) = LINKLIST(CvROOT(cv));
3702 CvROOT(cv)->op_next = 0;
3708 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3709 SV *sv = NEWSV(0,0);
3710 SV *tmpstr = sv_newmortal();
3711 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3715 sv_setpvf(sv, "%_:%ld-%ld",
3716 GvSV(PL_curcop->cop_filegv),
3717 (long)PL_subline, (long)PL_curcop->cop_line);
3718 gv_efullname3(tmpstr, gv, Nullch);
3719 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3720 hv = GvHVn(db_postponed);
3721 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3722 && (cv = GvCV(db_postponed))) {
3727 perl_call_sv((SV*)cv, G_DISCARD);
3731 if ((s = strrchr(name,':')))
3735 if (strEQ(s, "BEGIN")) {
3736 I32 oldscope = PL_scopestack_ix;
3738 SAVESPTR(PL_compiling.cop_filegv);
3739 SAVEI16(PL_compiling.cop_line);
3741 sv_setsv(PL_rs, PL_nrs);
3744 PL_beginav = newAV();
3745 DEBUG_x( dump_sub(gv) );
3746 av_push(PL_beginav, (SV *)cv);
3748 call_list(oldscope, PL_beginav);
3750 PL_curcop = &PL_compiling;
3753 else if (strEQ(s, "END") && !PL_error_count) {
3756 av_unshift(PL_endav, 1);
3757 av_store(PL_endav, 0, (SV *)cv);
3760 else if (strEQ(s, "INIT") && !PL_error_count) {
3762 PL_initav = newAV();
3763 av_push(PL_initav, SvREFCNT_inc(cv));
3769 PL_copline = NOLINE;
3774 /* XXX unsafe for threads if eval_owner isn't held */
3776 newCONSTSUB(HV *stash, char *name, SV *sv)
3779 U32 oldhints = PL_hints;
3780 HV *old_cop_stash = PL_curcop->cop_stash;
3781 HV *old_curstash = PL_curstash;
3782 line_t oldline = PL_curcop->cop_line;
3783 PL_curcop->cop_line = PL_copline;
3785 PL_hints &= ~HINT_BLOCK_SCOPE;
3787 PL_curstash = PL_curcop->cop_stash = stash;
3790 start_subparse(FALSE, 0),
3791 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3792 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
3793 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3796 PL_hints = oldhints;
3797 PL_curcop->cop_stash = old_cop_stash;
3798 PL_curstash = old_curstash;
3799 PL_curcop->cop_line = oldline;
3803 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3806 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3809 if (cv = (name ? GvCV(gv) : Nullcv)) {
3811 /* just a cached method */
3815 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3816 /* already defined (or promised) */
3817 if (PL_dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3818 && HvNAME(GvSTASH(CvGV(cv)))
3819 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3820 line_t oldline = PL_curcop->cop_line;
3821 if (PL_copline != NOLINE)
3822 PL_curcop->cop_line = PL_copline;
3823 warn("Subroutine %s redefined",name);
3824 PL_curcop->cop_line = oldline;
3831 if (cv) /* must reuse cv if autoloaded */
3834 cv = (CV*)NEWSV(1105,0);
3835 sv_upgrade((SV *)cv, SVt_PVCV);
3839 PL_sub_generation++;
3842 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3844 New(666, CvMUTEXP(cv), 1, perl_mutex);
3845 MUTEX_INIT(CvMUTEXP(cv));
3847 #endif /* USE_THREADS */
3848 CvFILEGV(cv) = gv_fetchfile(filename);
3849 CvXSUB(cv) = subaddr;
3852 char *s = strrchr(name,':');
3857 if (strEQ(s, "BEGIN")) {
3859 PL_beginav = newAV();
3860 av_push(PL_beginav, (SV *)cv);
3863 else if (strEQ(s, "END")) {
3866 av_unshift(PL_endav, 1);
3867 av_store(PL_endav, 0, (SV *)cv);
3870 else if (strEQ(s, "INIT")) {
3872 PL_initav = newAV();
3873 av_push(PL_initav, (SV *)cv);
3884 newFORM(I32 floor, OP *o, OP *block)
3894 name = SvPVx(cSVOPo->op_sv, n_a);
3897 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3899 if (cv = GvFORM(gv)) {
3901 line_t oldline = PL_curcop->cop_line;
3903 PL_curcop->cop_line = PL_copline;
3904 warn("Format %s redefined",name);
3905 PL_curcop->cop_line = oldline;
3911 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3912 CvFILEGV(cv) = PL_curcop->cop_filegv;
3914 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3915 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
3916 SvPADTMP_on(PL_curpad[ix]);
3919 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3920 CvSTART(cv) = LINKLIST(CvROOT(cv));
3921 CvROOT(cv)->op_next = 0;
3924 PL_copline = NOLINE;
3931 return newUNOP(OP_REFGEN, 0,
3932 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3938 return newUNOP(OP_REFGEN, 0,
3939 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3943 newANONSUB(I32 floor, OP *proto, OP *block)
3945 return newUNOP(OP_REFGEN, 0,
3946 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3952 switch (o->op_type) {
3954 o->op_type = OP_PADAV;
3955 o->op_ppaddr = ppaddr[OP_PADAV];
3956 return ref(o, OP_RV2AV);
3959 o->op_type = OP_RV2AV;
3960 o->op_ppaddr = ppaddr[OP_RV2AV];
3965 warn("oops: oopsAV");
3974 switch (o->op_type) {
3977 o->op_type = OP_PADHV;
3978 o->op_ppaddr = ppaddr[OP_PADHV];
3979 return ref(o, OP_RV2HV);
3983 o->op_type = OP_RV2HV;
3984 o->op_ppaddr = ppaddr[OP_RV2HV];
3989 warn("oops: oopsHV");
3998 if (o->op_type == OP_PADANY) {
3999 o->op_type = OP_PADAV;
4000 o->op_ppaddr = ppaddr[OP_PADAV];
4003 return newUNOP(OP_RV2AV, 0, scalar(o));
4007 newGVREF(I32 type, OP *o)
4009 if (type == OP_MAPSTART)
4010 return newUNOP(OP_NULL, 0, o);
4011 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4017 if (o->op_type == OP_PADANY) {
4018 o->op_type = OP_PADHV;
4019 o->op_ppaddr = ppaddr[OP_PADHV];
4022 return newUNOP(OP_RV2HV, 0, scalar(o));
4028 croak("NOT IMPL LINE %d",__LINE__);
4034 newCVREF(I32 flags, OP *o)
4036 return newUNOP(OP_RV2CV, flags, scalar(o));
4042 if (o->op_type == OP_PADANY) {
4043 o->op_type = OP_PADSV;
4044 o->op_ppaddr = ppaddr[OP_PADSV];
4047 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4048 o->op_flags |= OPpDONE_SVREF;
4051 return newUNOP(OP_RV2SV, 0, scalar(o));
4054 /* Check routines. */
4062 name = NEWSV(1106,0);
4063 sv_upgrade(name, SVt_PVNV);
4064 sv_setpvn(name, "&", 1);
4067 ix = pad_alloc(o->op_type, SVs_PADMY);
4068 av_store(PL_comppad_name, ix, name);
4069 av_store(PL_comppad, ix, cSVOPo->op_sv);
4070 SvPADMY_on(cSVOPo->op_sv);
4071 cSVOPo->op_sv = Nullsv;
4072 cSVOPo->op_targ = ix;
4079 o->op_private = PL_hints;
4086 if (cUNOPo->op_first->op_type == OP_CONCAT)
4087 o->op_flags |= OPf_STACKED;
4094 if (o->op_flags & OPf_KIDS) {
4097 OPCODE type = o->op_type;
4098 o = modkids(ck_fun(o), type);
4099 kid = cUNOPo->op_first;
4100 newop = kUNOP->op_first->op_sibling;
4102 (newop->op_sibling ||
4103 !(opargs[newop->op_type] & OA_RETSCALAR) ||
4104 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4105 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4109 op_free(kUNOP->op_first);
4110 kUNOP->op_first = newop;
4112 o->op_ppaddr = ppaddr[++o->op_type];
4121 if (o->op_flags & OPf_KIDS) {
4122 OP *kid = cUNOPo->op_first;
4123 if (kid->op_type == OP_HSLICE)
4124 o->op_private |= OPpSLICE;
4125 else if (kid->op_type != OP_HELEM)
4126 croak("%s argument is not a HASH element or slice",
4127 op_desc[o->op_type]);
4136 I32 type = o->op_type;
4138 if (o->op_flags & OPf_KIDS) {
4139 if (cLISTOPo->op_first->op_type == OP_STUB) {
4141 o = newUNOP(type, OPf_SPECIAL,
4142 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4152 PL_hints |= HINT_BLOCK_SCOPE;
4153 if (o->op_flags & OPf_KIDS) {
4154 SVOP *kid = (SVOP*)cUNOPo->op_first;
4157 o->op_flags &= ~OPf_KIDS;
4160 else if (kid->op_type == OP_LINESEQ) {
4163 kid->op_next = o->op_next;
4164 cUNOPo->op_first = 0;
4167 Newz(1101, enter, 1, LOGOP);
4168 enter->op_type = OP_ENTERTRY;
4169 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4170 enter->op_private = 0;
4172 /* establish postfix order */
4173 enter->op_next = (OP*)enter;
4175 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4176 o->op_type = OP_LEAVETRY;
4177 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4178 enter->op_other = o;
4186 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4188 o->op_targ = (PADOFFSET)PL_hints;
4196 if (o->op_flags & OPf_STACKED) {
4198 kid = cUNOPo->op_first->op_sibling;
4199 if (kid->op_type == OP_RV2GV)
4211 if (o->op_flags & OPf_KIDS) {
4212 OP *kid = cUNOPo->op_first;
4213 if (kid->op_type != OP_HELEM)
4214 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4221 ck_gvconst(register OP *o)
4223 o = fold_constants(o);
4224 if (o->op_type == OP_CONST)
4230 ck_rvconst(register OP *o)
4233 SVOP *kid = (SVOP*)cUNOPo->op_first;
4235 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4236 if (kid->op_type == OP_CONST) {
4240 SV *kidsv = kid->op_sv;
4243 /* Is it a constant from cv_const_sv()? */
4244 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4245 SV *rsv = SvRV(kidsv);
4246 int svtype = SvTYPE(rsv);
4247 char *badtype = Nullch;
4249 switch (o->op_type) {
4251 if (svtype > SVt_PVMG)
4252 badtype = "a SCALAR";
4255 if (svtype != SVt_PVAV)
4256 badtype = "an ARRAY";
4259 if (svtype != SVt_PVHV) {
4260 if (svtype == SVt_PVAV) { /* pseudohash? */
4261 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4262 if (ksv && SvROK(*ksv)
4263 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4272 if (svtype != SVt_PVCV)
4277 croak("Constant is not %s reference", badtype);
4280 name = SvPV(kidsv, n_a);
4282 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4283 char *badthing = Nullch;
4284 switch (o->op_type) {
4286 badthing = "a SCALAR";
4289 badthing = "an ARRAY";
4292 badthing = "a HASH";
4297 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4301 * This is a little tricky. We only want to add the symbol if we
4302 * didn't add it in the lexer. Otherwise we get duplicate strict
4303 * warnings. But if we didn't add it in the lexer, we must at
4304 * least pretend like we wanted to add it even if it existed before,
4305 * or we get possible typo warnings. OPpCONST_ENTERED says
4306 * whether the lexer already added THIS instance of this symbol.
4308 iscv = (o->op_type == OP_RV2CV) * 2;
4310 gv = gv_fetchpv(name,
4311 iscv | !(kid->op_private & OPpCONST_ENTERED),
4314 : o->op_type == OP_RV2SV
4316 : o->op_type == OP_RV2AV
4318 : o->op_type == OP_RV2HV
4321 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4323 kid->op_type = OP_GV;
4324 SvREFCNT_dec(kid->op_sv);
4325 kid->op_sv = SvREFCNT_inc(gv);
4335 I32 type = o->op_type;
4337 if (o->op_flags & OPf_REF)
4340 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4341 SVOP *kid = (SVOP*)cUNOPo->op_first;
4343 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4345 OP *newop = newGVOP(type, OPf_REF,
4346 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4353 if (type == OP_FTTTY)
4354 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4357 return newUNOP(type, 0, newDEFSVOP());
4370 int type = o->op_type;
4371 register I32 oa = opargs[type] >> OASHIFT;
4373 if (o->op_flags & OPf_STACKED) {
4374 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4377 return no_fh_allowed(o);
4380 if (o->op_flags & OPf_KIDS) {
4382 tokid = &cLISTOPo->op_first;
4383 kid = cLISTOPo->op_first;
4384 if (kid->op_type == OP_PUSHMARK ||
4385 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4387 tokid = &kid->op_sibling;
4388 kid = kid->op_sibling;
4390 if (!kid && opargs[type] & OA_DEFGV)
4391 *tokid = kid = newDEFSVOP();
4395 sibl = kid->op_sibling;
4409 if (kid->op_type == OP_CONST &&
4410 (kid->op_private & OPpCONST_BARE)) {
4411 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4412 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4413 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4415 warn("Array @%s missing the @ in argument %ld of %s()",
4416 name, (long)numargs, op_desc[type]);
4419 kid->op_sibling = sibl;
4422 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4423 bad_type(numargs, "array", op_desc[o->op_type], kid);
4427 if (kid->op_type == OP_CONST &&
4428 (kid->op_private & OPpCONST_BARE)) {
4429 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4430 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4431 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4433 warn("Hash %%%s missing the %% in argument %ld of %s()",
4434 name, (long)numargs, op_desc[type]);
4437 kid->op_sibling = sibl;
4440 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4441 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4446 OP *newop = newUNOP(OP_NULL, 0, kid);
4447 kid->op_sibling = 0;
4449 newop->op_next = newop;
4451 kid->op_sibling = sibl;
4456 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4457 if (kid->op_type == OP_CONST &&
4458 (kid->op_private & OPpCONST_BARE)) {
4459 OP *newop = newGVOP(OP_GV, 0,
4460 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4465 else if (kid->op_type == OP_READLINE) {
4466 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4467 bad_type(numargs, "HANDLE", op_desc[o->op_type], kid);
4470 kid->op_sibling = 0;
4471 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4473 kid->op_sibling = sibl;
4479 mod(scalar(kid), type);
4483 tokid = &kid->op_sibling;
4484 kid = kid->op_sibling;
4486 o->op_private |= numargs;
4488 return too_many_arguments(o,op_desc[o->op_type]);
4491 else if (opargs[type] & OA_DEFGV) {
4493 return newUNOP(type, 0, newDEFSVOP());
4497 while (oa & OA_OPTIONAL)
4499 if (oa && oa != OA_LIST)
4500 return too_few_arguments(o,op_desc[o->op_type]);
4510 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4511 append_elem(OP_GLOB, o, newDEFSVOP());
4513 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4514 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4516 if (gv && GvIMPORTED_CV(gv)) {
4518 static int glob_index;
4521 append_elem(OP_GLOB, o,
4522 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4523 o->op_type = OP_LIST;
4524 o->op_ppaddr = ppaddr[OP_LIST];
4525 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4526 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4527 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4528 append_elem(OP_LIST, o,
4529 scalar(newUNOP(OP_RV2CV, 0,
4530 newGVOP(OP_GV, 0, gv)))));
4531 o = newUNOP(OP_NULL, 0, ck_subr(o));
4532 o->op_targ = OP_GLOB; /* hint at what it used to be */
4535 gv = newGVgen("main");
4537 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4547 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4549 o->op_ppaddr = ppaddr[OP_GREPSTART];
4550 Newz(1101, gwop, 1, LOGOP);
4552 if (o->op_flags & OPf_STACKED) {
4555 kid = cLISTOPo->op_first->op_sibling;
4556 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4559 kid->op_next = (OP*)gwop;
4560 o->op_flags &= ~OPf_STACKED;
4562 kid = cLISTOPo->op_first->op_sibling;
4563 if (type == OP_MAPWHILE)
4570 kid = cLISTOPo->op_first->op_sibling;
4571 if (kid->op_type != OP_NULL)
4572 croak("panic: ck_grep");
4573 kid = kUNOP->op_first;
4575 gwop->op_type = type;
4576 gwop->op_ppaddr = ppaddr[type];
4577 gwop->op_first = listkids(o);
4578 gwop->op_flags |= OPf_KIDS;
4579 gwop->op_private = 1;
4580 gwop->op_other = LINKLIST(kid);
4581 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4582 kid->op_next = (OP*)gwop;
4584 kid = cLISTOPo->op_first->op_sibling;
4585 if (!kid || !kid->op_sibling)
4586 return too_few_arguments(o,op_desc[o->op_type]);
4587 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4588 mod(kid, OP_GREPSTART);
4596 if (o->op_flags & OPf_KIDS) {
4597 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4599 kid = kid->op_sibling; /* get past "big" */
4600 if (kid && kid->op_type == OP_CONST)
4601 fbm_compile(((SVOP*)kid)->op_sv, 0);
4607 ck_lengthconst(OP *o)
4609 /* XXX length optimization goes here */
4616 OPCODE type = o->op_type;
4617 return modkids(ck_fun(o), type);
4623 OPCODE type = o->op_type;
4624 return refkids(ck_fun(o), type);
4632 kid = cLISTOPo->op_first;
4635 kid = cLISTOPo->op_first;
4637 if (kid->op_type == OP_PUSHMARK)
4638 kid = kid->op_sibling;
4639 if (kid && o->op_flags & OPf_STACKED)
4640 kid = kid->op_sibling;
4641 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4642 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4643 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4644 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4645 cLISTOPo->op_first->op_sibling = kid;
4646 cLISTOPo->op_last = kid;
4647 kid = kid->op_sibling;
4652 append_elem(o->op_type, o, newDEFSVOP());
4658 if (PL_hints & HINT_LOCALE)
4659 o->op_private |= OPpLOCALE;
4666 ck_fun_locale(OP *o)
4672 if (PL_hints & HINT_LOCALE)
4673 o->op_private |= OPpLOCALE;
4684 if (PL_hints & HINT_LOCALE)
4685 o->op_private |= OPpLOCALE;
4694 o->op_private |= OPpRUNTIME;
4707 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4708 o->op_private |= OPpREPEAT_DOLIST;
4709 cBINOPo->op_first = force_list(cBINOPo->op_first);
4719 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4720 SVOP *kid = (SVOP*)cUNOPo->op_first;
4722 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4724 for (s = SvPVX(kid->op_sv); *s; s++) {
4725 if (*s == ':' && s[1] == ':') {
4727 Move(s+2, s+1, strlen(s+2)+1, char);
4728 --SvCUR(kid->op_sv);
4731 sv_catpvn(kid->op_sv, ".pm", 3);
4740 croak("NOT IMPL LINE %d",__LINE__);
4749 if (o->op_flags & OPf_KIDS) {
4750 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4751 if (kid && kid->op_sibling) {
4752 o->op_type = OP_SSELECT;
4753 o->op_ppaddr = ppaddr[OP_SSELECT];
4755 return fold_constants(o);
4759 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4760 if (kid && kid->op_type == OP_RV2GV)
4761 kid->op_private &= ~HINT_STRICT_REFS;
4768 I32 type = o->op_type;
4770 if (!(o->op_flags & OPf_KIDS)) {
4775 if (!CvUNIQUE(PL_compcv)) {
4776 argop = newOP(OP_PADAV, OPf_REF);
4777 argop->op_targ = 0; /* PL_curpad[0] is @_ */
4780 argop = newUNOP(OP_RV2AV, 0,
4781 scalar(newGVOP(OP_GV, 0,
4782 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4785 argop = newUNOP(OP_RV2AV, 0,
4786 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
4787 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4788 #endif /* USE_THREADS */
4789 return newUNOP(type, 0, scalar(argop));
4791 return scalar(modkids(ck_fun(o), type));
4799 if (PL_hints & HINT_LOCALE)
4800 o->op_private |= OPpLOCALE;
4803 if (o->op_flags & OPf_STACKED) {
4804 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4806 kid = kUNOP->op_first; /* get past rv2gv */
4808 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4810 if (kid->op_type == OP_SCOPE) {
4814 else if (kid->op_type == OP_LEAVE) {
4815 if (o->op_type == OP_SORT) {
4816 null(kid); /* wipe out leave */
4819 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4820 if (k->op_next == kid)
4825 kid->op_next = 0; /* just disconnect the leave */
4826 k = kLISTOP->op_first;
4830 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4831 null(kid); /* wipe out rv2gv */
4832 if (o->op_type == OP_SORT)
4836 o->op_flags |= OPf_SPECIAL;
4838 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
4839 null(cLISTOPo->op_first->op_sibling);
4850 if (o->op_flags & OPf_STACKED)
4851 return no_fh_allowed(o);
4853 kid = cLISTOPo->op_first;
4854 if (kid->op_type != OP_NULL)
4855 croak("panic: ck_split");
4856 kid = kid->op_sibling;
4857 op_free(cLISTOPo->op_first);
4858 cLISTOPo->op_first = kid;
4860 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4861 cLISTOPo->op_last = kid; /* There was only one element previously */
4864 if (kid->op_type != OP_MATCH) {
4865 OP *sibl = kid->op_sibling;
4866 kid->op_sibling = 0;
4867 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4868 if (cLISTOPo->op_first == cLISTOPo->op_last)
4869 cLISTOPo->op_last = kid;
4870 cLISTOPo->op_first = kid;
4871 kid->op_sibling = sibl;
4874 kid->op_type = OP_PUSHRE;
4875 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4878 if (!kid->op_sibling)
4879 append_elem(OP_SPLIT, o, newDEFSVOP());
4881 kid = kid->op_sibling;
4884 if (!kid->op_sibling)
4885 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4887 kid = kid->op_sibling;
4890 if (kid->op_sibling)
4891 return too_many_arguments(o,op_desc[o->op_type]);
4900 OP *prev = ((cUNOPo->op_first->op_sibling)
4901 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4902 OP *o2 = prev->op_sibling;
4911 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4912 if (cvop->op_type == OP_RV2CV) {
4914 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4915 null(cvop); /* disable rv2cv */
4916 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4917 if (tmpop->op_type == OP_GV) {
4918 cv = GvCVu(tmpop->op_sv);
4919 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4920 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4921 proto = SvPV((SV*)cv, n_a);
4925 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4926 if (PERLDB_SUB && PL_curstash != PL_debstash)
4927 o->op_private |= OPpENTERSUB_DB;
4928 while (o2 != cvop) {
4932 return too_many_arguments(o, gv_ename(namegv));
4950 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4951 bad_type(arg, "block", gv_ename(namegv), o2);
4954 /* '*' allows any scalar type, including bareword */
4957 if (o2->op_type == OP_RV2GV)
4958 goto wrapref; /* autoconvert GLOB -> GLOBref */
4966 if (o2->op_type != OP_RV2GV)
4967 bad_type(arg, "symbol", gv_ename(namegv), o2);
4970 if (o2->op_type != OP_RV2CV)
4971 bad_type(arg, "sub", gv_ename(namegv), o2);
4974 if (o2->op_type != OP_RV2SV
4975 && o2->op_type != OP_PADSV
4976 && o2->op_type != OP_THREADSV)
4978 bad_type(arg, "scalar", gv_ename(namegv), o2);
4982 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4983 bad_type(arg, "array", gv_ename(namegv), o2);
4986 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4987 bad_type(arg, "hash", gv_ename(namegv), o2);
4991 OP* sib = kid->op_sibling;
4992 kid->op_sibling = 0;
4993 o2 = newUNOP(OP_REFGEN, 0, kid);
4994 o2->op_sibling = sib;
4995 prev->op_sibling = o2;
5006 croak("Malformed prototype for %s: %s",
5007 gv_ename(namegv), SvPV((SV*)cv, n_a));
5012 mod(o2, OP_ENTERSUB);
5014 o2 = o2->op_sibling;
5016 if (proto && !optional &&
5017 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5018 return too_few_arguments(o, gv_ename(namegv));
5025 SvREADONLY_on(cSVOPo->op_sv);
5032 if (o->op_flags & OPf_KIDS) {
5033 SVOP *kid = (SVOP*)cUNOPo->op_first;
5035 if (kid->op_type == OP_NULL)
5036 kid = (SVOP*)kid->op_sibling;
5038 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5039 o->op_flags |= OPf_SPECIAL;
5044 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5047 peep(register OP *o)
5050 register OP* oldop = 0;
5052 if (!o || o->op_seq)
5056 SAVESPTR(PL_curcop);
5057 for (; o; o = o->op_next) {
5063 switch (o->op_type) {
5066 PL_curcop = ((COP*)o); /* for warnings */
5067 o->op_seq = PL_op_seqmax++;
5078 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5080 o->op_seq = PL_op_seqmax++;
5083 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5084 o->op_seq = PL_op_seqmax++;
5085 break; /* Scalar stub must produce undef. List stub is noop */
5089 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5090 PL_curcop = ((COP*)o);
5096 if (oldop && o->op_next) {
5097 oldop->op_next = o->op_next;
5100 o->op_seq = PL_op_seqmax++;
5104 if (o->op_next->op_type == OP_RV2SV) {
5105 if (!(o->op_next->op_private & OPpDEREF)) {
5107 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5108 o->op_next = o->op_next->op_next;
5109 o->op_type = OP_GVSV;
5110 o->op_ppaddr = ppaddr[OP_GVSV];
5113 else if (o->op_next->op_type == OP_RV2AV) {
5114 OP* pop = o->op_next->op_next;
5116 if (pop->op_type == OP_CONST &&
5117 (PL_op = pop->op_next) &&
5118 pop->op_next->op_type == OP_AELEM &&
5119 !(pop->op_next->op_private &
5120 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5121 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5125 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5129 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5130 o->op_next = pop->op_next->op_next;
5131 o->op_type = OP_AELEMFAST;
5132 o->op_ppaddr = ppaddr[OP_AELEMFAST];
5133 o->op_private = (U8)i;
5134 GvAVn(((GVOP*)o)->op_gv);
5137 o->op_seq = PL_op_seqmax++;
5144 o->op_seq = PL_op_seqmax++;
5145 while (cLOGOP->op_other->op_type == OP_NULL)
5146 cLOGOP->op_other = cLOGOP->op_other->op_next;
5147 peep(cLOGOP->op_other);
5151 o->op_seq = PL_op_seqmax++;
5152 peep(cCONDOP->op_true);
5153 peep(cCONDOP->op_false);
5157 o->op_seq = PL_op_seqmax++;
5158 peep(cLOOP->op_redoop);
5159 peep(cLOOP->op_nextop);
5160 peep(cLOOP->op_lastop);
5166 o->op_seq = PL_op_seqmax++;
5167 peep(cPMOP->op_pmreplstart);
5171 o->op_seq = PL_op_seqmax++;
5172 if (PL_dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
5173 if (o->op_next->op_sibling &&
5174 o->op_next->op_sibling->op_type != OP_EXIT &&
5175 o->op_next->op_sibling->op_type != OP_WARN &&
5176 o->op_next->op_sibling->op_type != OP_DIE) {
5177 line_t oldline = PL_curcop->cop_line;
5179 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5180 warn("Statement unlikely to be reached");
5181 warn("(Maybe you meant system() when you said exec()?)\n");
5182 PL_curcop->cop_line = oldline;
5196 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5197 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5199 rop = (UNOP*)((BINOP*)o)->op_first;
5200 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5202 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5203 if (!SvOBJECT(lexname))
5205 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5206 if (!fields || !GvHV(*fields))
5208 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5209 key = SvPV(*svp, keylen);
5210 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5212 croak("No such field \"%s\" in variable %s of type %s",
5213 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5215 ind = SvIV(*indsvp);
5217 croak("Bad index while coercing array into hash");
5218 rop->op_type = OP_RV2AV;
5219 rop->op_ppaddr = ppaddr[OP_RV2AV];
5220 o->op_type = OP_AELEM;
5221 o->op_ppaddr = ppaddr[OP_AELEM];
5223 *svp = newSViv(ind);
5228 o->op_seq = PL_op_seqmax++;