3 * Copyright (c) 1991-2000, 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
23 /* #define PL_OP_SLAB_ALLOC */
25 #ifdef PL_OP_SLAB_ALLOC
26 #define SLAB_SIZE 8192
27 static char *PL_OpPtr = NULL;
28 static int PL_OpSpace = 0;
29 #define NewOp(m,var,c,type) do { if ((PL_OpSpace -= c*sizeof(type)) >= 0) \
30 var = (type *)(PL_OpPtr -= c*sizeof(type)); \
32 var = (type *) Slab_Alloc(m,c*sizeof(type)); \
36 S_Slab_Alloc(pTHX_ int m, size_t sz)
38 Newz(m,PL_OpPtr,SLAB_SIZE,char);
39 PL_OpSpace = SLAB_SIZE - sz;
40 return PL_OpPtr += PL_OpSpace;
44 #define NewOp(m, var, c, type) Newz(m, var, c, type)
47 * In the following definition, the ", Nullop" is just to make the compiler
48 * think the expression is of the right type: croak actually does a Siglongjmp.
50 #define CHECKOP(type,o) \
51 ((PL_op_mask && PL_op_mask[type]) \
52 ? ( op_free((OP*)o), \
53 Perl_croak(aTHX_ "%s trapped by operation mask", PL_op_desc[type]), \
55 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
57 #define PAD_MAX 999999999
60 S_gv_ename(pTHX_ GV *gv)
63 SV* tmpsv = sv_newmortal();
64 gv_efullname3(tmpsv, gv, Nullch);
65 return SvPV(tmpsv,n_a);
69 S_no_fh_allowed(pTHX_ OP *o)
71 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
72 PL_op_desc[o->op_type]));
77 S_too_few_arguments(pTHX_ OP *o, char *name)
79 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
84 S_too_many_arguments(pTHX_ OP *o, char *name)
86 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
91 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
93 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
94 (int)n, name, t, PL_op_desc[kid->op_type]));
98 S_no_bareword_allowed(pTHX_ OP *o)
100 qerror(Perl_mess(aTHX_
101 "Bareword \"%s\" not allowed while \"strict subs\" in use",
102 SvPV_nolen(cSVOPo_sv)));
105 /* "register" allocation */
108 Perl_pad_allocmy(pTHX_ char *name)
113 if (!(PL_in_my == KEY_our ||
115 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
116 (name[1] == '_' && (int)strlen(name) > 2)))
118 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
119 /* 1999-02-27 mjd@plover.com */
121 p = strchr(name, '\0');
122 /* The next block assumes the buffer is at least 205 chars
123 long. At present, it's always at least 256 chars. */
125 strcpy(name+200, "...");
131 /* Move everything else down one character */
132 for (; p-name > 2; p--)
134 name[2] = toCTRL(name[1]);
137 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
139 if (ckWARN(WARN_MISC) && AvFILLp(PL_comppad_name) >= 0) {
140 SV **svp = AvARRAY(PL_comppad_name);
141 HV *ourstash = (PL_curstash ? PL_curstash : PL_defstash);
142 PADOFFSET top = AvFILLp(PL_comppad_name);
143 for (off = top; off > PL_comppad_name_floor; off--) {
145 && sv != &PL_sv_undef
146 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
147 && (PL_in_my != KEY_our
148 || ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash))
149 && strEQ(name, SvPVX(sv)))
151 Perl_warner(aTHX_ WARN_MISC,
152 "\"%s\" variable %s masks earlier declaration in same %s",
153 (PL_in_my == KEY_our ? "our" : "my"),
155 (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
160 if (PL_in_my == KEY_our) {
163 && sv != &PL_sv_undef
164 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
165 && ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash)
166 && strEQ(name, SvPVX(sv)))
168 Perl_warner(aTHX_ WARN_MISC,
169 "\"our\" variable %s redeclared", name);
170 Perl_warner(aTHX_ WARN_MISC,
171 "\t(Did you mean \"local\" instead of \"our\"?)\n");
174 } while ( off-- > 0 );
177 off = pad_alloc(OP_PADSV, SVs_PADMY);
179 sv_upgrade(sv, SVt_PVNV);
181 if (PL_in_my_stash) {
183 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"%s\"",
184 name, PL_in_my == KEY_our ? "our" : "my"));
186 (void)SvUPGRADE(sv, SVt_PVMG);
187 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
190 if (PL_in_my == KEY_our) {
191 (void)SvUPGRADE(sv, SVt_PVGV);
192 GvSTASH(sv) = (HV*)SvREFCNT_inc(PL_curstash ? (SV*)PL_curstash : (SV*)PL_defstash);
193 SvFLAGS(sv) |= SVpad_OUR;
195 av_store(PL_comppad_name, off, sv);
196 SvNVX(sv) = (NV)PAD_MAX;
197 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
198 if (!PL_min_intro_pending)
199 PL_min_intro_pending = off;
200 PL_max_intro_pending = off;
202 av_store(PL_comppad, off, (SV*)newAV());
203 else if (*name == '%')
204 av_store(PL_comppad, off, (SV*)newHV());
205 SvPADMY_on(PL_curpad[off]);
210 S_pad_addlex(pTHX_ SV *proto_namesv)
212 SV *namesv = NEWSV(1103,0);
213 PADOFFSET newoff = pad_alloc(OP_PADSV, SVs_PADMY);
214 sv_upgrade(namesv, SVt_PVNV);
215 sv_setpv(namesv, SvPVX(proto_namesv));
216 av_store(PL_comppad_name, newoff, namesv);
217 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
218 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
219 SvFAKE_on(namesv); /* A ref, not a real var */
220 if (SvFLAGS(proto_namesv) & SVpad_OUR) { /* An "our" variable */
221 SvFLAGS(namesv) |= SVpad_OUR;
222 (void)SvUPGRADE(namesv, SVt_PVGV);
223 GvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)GvSTASH(proto_namesv));
225 if (SvOBJECT(proto_namesv)) { /* A typed var */
227 (void)SvUPGRADE(namesv, SVt_PVMG);
228 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(proto_namesv));
234 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
237 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
238 I32 cx_ix, I32 saweval, U32 flags)
244 register PERL_CONTEXT *cx;
246 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
247 AV *curlist = CvPADLIST(cv);
248 SV **svp = av_fetch(curlist, 0, FALSE);
251 if (!svp || *svp == &PL_sv_undef)
254 svp = AvARRAY(curname);
255 for (off = AvFILLp(curname); off > 0; off--) {
256 if ((sv = svp[off]) &&
257 sv != &PL_sv_undef &&
259 seq > I_32(SvNVX(sv)) &&
260 strEQ(SvPVX(sv), name))
271 return 0; /* don't clone from inactive stack frame */
275 oldpad = (AV*)AvARRAY(curlist)[depth];
276 oldsv = *av_fetch(oldpad, off, TRUE);
277 if (!newoff) { /* Not a mere clone operation. */
278 newoff = pad_addlex(sv);
279 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
280 /* "It's closures all the way down." */
281 CvCLONE_on(PL_compcv);
283 if (CvANON(PL_compcv))
284 oldsv = Nullsv; /* no need to keep ref */
289 bcv && bcv != cv && !CvCLONE(bcv);
290 bcv = CvOUTSIDE(bcv))
293 /* install the missing pad entry in intervening
294 * nested subs and mark them cloneable.
295 * XXX fix pad_foo() to not use globals */
296 AV *ocomppad_name = PL_comppad_name;
297 AV *ocomppad = PL_comppad;
298 SV **ocurpad = PL_curpad;
299 AV *padlist = CvPADLIST(bcv);
300 PL_comppad_name = (AV*)AvARRAY(padlist)[0];
301 PL_comppad = (AV*)AvARRAY(padlist)[1];
302 PL_curpad = AvARRAY(PL_comppad);
304 PL_comppad_name = ocomppad_name;
305 PL_comppad = ocomppad;
310 if (ckWARN(WARN_CLOSURE)
311 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
313 Perl_warner(aTHX_ WARN_CLOSURE,
314 "Variable \"%s\" may be unavailable",
322 else if (!CvUNIQUE(PL_compcv)) {
323 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv)
324 && !(SvFLAGS(sv) & SVpad_OUR))
326 Perl_warner(aTHX_ WARN_CLOSURE,
327 "Variable \"%s\" will not stay shared", name);
331 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
337 if (flags & FINDLEX_NOSEARCH)
340 /* Nothing in current lexical context--try eval's context, if any.
341 * This is necessary to let the perldb get at lexically scoped variables.
342 * XXX This will also probably interact badly with eval tree caching.
345 for (i = cx_ix; i >= 0; i--) {
347 switch (CxTYPE(cx)) {
349 if (i == 0 && saweval) {
350 seq = cxstack[saweval].blk_oldcop->cop_seq;
351 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
355 switch (cx->blk_eval.old_op_type) {
362 /* require/do must have their own scope */
371 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
372 saweval = i; /* so we know where we were called from */
375 seq = cxstack[saweval].blk_oldcop->cop_seq;
376 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
384 Perl_pad_findmy(pTHX_ char *name)
389 SV **svp = AvARRAY(PL_comppad_name);
390 U32 seq = PL_cop_seqmax;
396 * Special case to get lexical (and hence per-thread) @_.
397 * XXX I need to find out how to tell at parse-time whether use
398 * of @_ should refer to a lexical (from a sub) or defgv (global
399 * scope and maybe weird sub-ish things like formats). See
400 * startsub in perly.y. It's possible that @_ could be lexical
401 * (at least from subs) even in non-threaded perl.
403 if (strEQ(name, "@_"))
404 return 0; /* success. (NOT_IN_PAD indicates failure) */
405 #endif /* USE_THREADS */
407 /* The one we're looking for is probably just before comppad_name_fill. */
408 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
409 if ((sv = svp[off]) &&
410 sv != &PL_sv_undef &&
413 seq > I_32(SvNVX(sv)))) &&
414 strEQ(SvPVX(sv), name))
416 if (SvIVX(sv) || SvFLAGS(sv) & SVpad_OUR)
417 return (PADOFFSET)off;
418 pendoff = off; /* this pending def. will override import */
422 outside = CvOUTSIDE(PL_compcv);
424 /* Check if if we're compiling an eval'', and adjust seq to be the
425 * eval's seq number. This depends on eval'' having a non-null
426 * CvOUTSIDE() while it is being compiled. The eval'' itself is
427 * identified by CvEVAL being true and CvGV being null. */
428 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
429 cx = &cxstack[cxstack_ix];
431 seq = cx->blk_oldcop->cop_seq;
434 /* See if it's in a nested scope */
435 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
437 /* If there is a pending local definition, this new alias must die */
439 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
440 return off; /* pad_findlex returns 0 for failure...*/
442 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
446 Perl_pad_leavemy(pTHX_ I32 fill)
449 SV **svp = AvARRAY(PL_comppad_name);
451 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
452 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
453 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
454 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
457 /* "Deintroduce" my variables that are leaving with this scope. */
458 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
459 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
460 SvIVX(sv) = PL_cop_seqmax;
465 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
470 if (AvARRAY(PL_comppad) != PL_curpad)
471 Perl_croak(aTHX_ "panic: pad_alloc");
472 if (PL_pad_reset_pending)
474 if (tmptype & SVs_PADMY) {
476 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
477 } while (SvPADBUSY(sv)); /* need a fresh one */
478 retval = AvFILLp(PL_comppad);
481 SV **names = AvARRAY(PL_comppad_name);
482 SSize_t names_fill = AvFILLp(PL_comppad_name);
485 * "foreach" index vars temporarily become aliases to non-"my"
486 * values. Thus we must skip, not just pad values that are
487 * marked as current pad values, but also those with names.
489 if (++PL_padix <= names_fill &&
490 (sv = names[PL_padix]) && sv != &PL_sv_undef)
492 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
493 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)) &&
494 !IS_PADGV(sv) && !IS_PADCONST(sv))
499 SvFLAGS(sv) |= tmptype;
500 PL_curpad = AvARRAY(PL_comppad);
502 DEBUG_X(PerlIO_printf(Perl_debug_log,
503 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
504 PTR2UV(thr), PTR2UV(PL_curpad),
505 (long) retval, PL_op_name[optype]));
507 DEBUG_X(PerlIO_printf(Perl_debug_log,
508 "Pad 0x%"UVxf" alloc %ld for %s\n",
510 (long) retval, PL_op_name[optype]));
511 #endif /* USE_THREADS */
512 return (PADOFFSET)retval;
516 Perl_pad_sv(pTHX_ PADOFFSET po)
519 DEBUG_X(PerlIO_printf(Perl_debug_log,
520 "0x%"UVxf" Pad 0x%"UVxf" sv %"IVdf"\n",
521 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
524 Perl_croak(aTHX_ "panic: pad_sv po");
525 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %"IVdf"\n",
526 PTR2UV(PL_curpad), (IV)po));
527 #endif /* USE_THREADS */
528 return PL_curpad[po]; /* eventually we'll turn this into a macro */
532 Perl_pad_free(pTHX_ PADOFFSET po)
536 if (AvARRAY(PL_comppad) != PL_curpad)
537 Perl_croak(aTHX_ "panic: pad_free curpad");
539 Perl_croak(aTHX_ "panic: pad_free po");
541 DEBUG_X(PerlIO_printf(Perl_debug_log,
542 "0x%"UVxf" Pad 0x%"UVxf" free %"IVdf"\n",
543 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
545 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %"IVdf"\n",
546 PTR2UV(PL_curpad), (IV)po));
547 #endif /* USE_THREADS */
548 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
549 SvPADTMP_off(PL_curpad[po]);
551 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
554 if ((I32)po < PL_padix)
559 Perl_pad_swipe(pTHX_ PADOFFSET po)
561 if (AvARRAY(PL_comppad) != PL_curpad)
562 Perl_croak(aTHX_ "panic: pad_swipe curpad");
564 Perl_croak(aTHX_ "panic: pad_swipe po");
566 DEBUG_X(PerlIO_printf(Perl_debug_log,
567 "0x%"UVxf" Pad 0x%"UVxf" swipe %"IVdf"\n",
568 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
570 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %"IVdf"\n",
571 PTR2UV(PL_curpad), (IV)po));
572 #endif /* USE_THREADS */
573 SvPADTMP_off(PL_curpad[po]);
574 PL_curpad[po] = NEWSV(1107,0);
575 SvPADTMP_on(PL_curpad[po]);
576 if ((I32)po < PL_padix)
580 /* XXX pad_reset() is currently disabled because it results in serious bugs.
581 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
582 * on the stack by OPs that use them, there are several ways to get an alias
583 * to a shared TARG. Such an alias will change randomly and unpredictably.
584 * We avoid doing this until we can think of a Better Way.
589 #ifdef USE_BROKEN_PAD_RESET
592 if (AvARRAY(PL_comppad) != PL_curpad)
593 Perl_croak(aTHX_ "panic: pad_reset curpad");
595 DEBUG_X(PerlIO_printf(Perl_debug_log,
596 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
597 PTR2UV(thr), PTR2UV(PL_curpad)));
599 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
601 #endif /* USE_THREADS */
602 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
603 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
604 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
605 SvPADTMP_off(PL_curpad[po]);
607 PL_padix = PL_padix_floor;
610 PL_pad_reset_pending = FALSE;
614 /* find_threadsv is not reentrant */
616 Perl_find_threadsv(pTHX_ const char *name)
621 /* We currently only handle names of a single character */
622 p = strchr(PL_threadsv_names, *name);
625 key = p - PL_threadsv_names;
626 MUTEX_LOCK(&thr->mutex);
627 svp = av_fetch(thr->threadsv, key, FALSE);
629 MUTEX_UNLOCK(&thr->mutex);
631 SV *sv = NEWSV(0, 0);
632 av_store(thr->threadsv, key, sv);
633 thr->threadsvp = AvARRAY(thr->threadsv);
634 MUTEX_UNLOCK(&thr->mutex);
636 * Some magic variables used to be automagically initialised
637 * in gv_fetchpv. Those which are now per-thread magicals get
638 * initialised here instead.
644 sv_setpv(sv, "\034");
645 sv_magic(sv, 0, 0, name, 1);
650 PL_sawampersand = TRUE;
664 /* XXX %! tied to Errno.pm needs to be added here.
665 * See gv_fetchpv(). */
669 sv_magic(sv, 0, 0, name, 1);
671 DEBUG_S(PerlIO_printf(Perl_error_log,
672 "find_threadsv: new SV %p for $%s%c\n",
673 sv, (*name < 32) ? "^" : "",
674 (*name < 32) ? toCTRL(*name) : *name));
678 #endif /* USE_THREADS */
683 Perl_op_free(pTHX_ OP *o)
685 register OP *kid, *nextkid;
688 if (!o || o->op_seq == (U16)-1)
691 if (o->op_private & OPpREFCOUNTED) {
692 switch (o->op_type) {
700 if (OpREFCNT_dec(o)) {
711 if (o->op_flags & OPf_KIDS) {
712 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
713 nextkid = kid->op_sibling; /* Get before next freeing kid */
721 /* COP* is not cleared by op_clear() so that we may track line
722 * numbers etc even after null() */
723 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
728 #ifdef PL_OP_SLAB_ALLOC
729 if ((char *) o == PL_OpPtr)
738 S_op_clear(pTHX_ OP *o)
740 switch (o->op_type) {
741 case OP_NULL: /* Was holding old type, if any. */
742 case OP_ENTEREVAL: /* Was holding hints. */
744 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
750 if (!(o->op_flags & OPf_SPECIAL))
753 #endif /* USE_THREADS */
755 if (!(o->op_flags & OPf_REF)
756 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
763 if (cPADOPo->op_padix > 0) {
766 pad_swipe(cPADOPo->op_padix);
767 /* No GvIN_PAD_off(gv) here, because other references may still
768 * exist on the pad */
771 cPADOPo->op_padix = 0;
774 SvREFCNT_dec(cSVOPo->op_sv);
775 cSVOPo->op_sv = Nullsv;
778 case OP_METHOD_NAMED:
780 SvREFCNT_dec(cSVOPo->op_sv);
781 cSVOPo->op_sv = Nullsv;
787 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
791 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
792 SvREFCNT_dec(cSVOPo->op_sv);
793 cSVOPo->op_sv = Nullsv;
796 Safefree(cPVOPo->op_pv);
797 cPVOPo->op_pv = Nullch;
801 op_free(cPMOPo->op_pmreplroot);
805 if ((PADOFFSET)cPMOPo->op_pmreplroot) {
807 GV *gv = (GV*)PL_curpad[(PADOFFSET)cPMOPo->op_pmreplroot];
808 pad_swipe((PADOFFSET)cPMOPo->op_pmreplroot);
809 /* No GvIN_PAD_off(gv) here, because other references may still
810 * exist on the pad */
815 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
821 cPMOPo->op_pmreplroot = Nullop;
822 ReREFCNT_dec(cPMOPo->op_pmregexp);
823 cPMOPo->op_pmregexp = (REGEXP*)NULL;
827 if (o->op_targ > 0) {
828 pad_free(o->op_targ);
834 S_cop_free(pTHX_ COP* cop)
836 Safefree(cop->cop_label);
838 Safefree(CopFILE(cop)); /* XXX share in a pvtable? */
839 Safefree(CopSTASHPV(cop)); /* XXX share in a pvtable? */
841 /* NOTE: COP.cop_stash is not refcounted */
842 SvREFCNT_dec(CopFILEGV(cop));
844 if (! specialWARN(cop->cop_warnings))
845 SvREFCNT_dec(cop->cop_warnings);
846 if (! specialCopIO(cop->cop_io))
847 SvREFCNT_dec(cop->cop_io);
853 if (o->op_type == OP_NULL)
856 o->op_targ = o->op_type;
857 o->op_type = OP_NULL;
858 o->op_ppaddr = PL_ppaddr[OP_NULL];
861 /* Contextualizers */
863 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
866 Perl_linklist(pTHX_ OP *o)
873 /* establish postfix order */
874 if (cUNOPo->op_first) {
875 o->op_next = LINKLIST(cUNOPo->op_first);
876 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
878 kid->op_next = LINKLIST(kid->op_sibling);
890 Perl_scalarkids(pTHX_ OP *o)
893 if (o && o->op_flags & OPf_KIDS) {
894 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
901 S_scalarboolean(pTHX_ OP *o)
903 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
904 if (ckWARN(WARN_SYNTAX)) {
905 line_t oldline = CopLINE(PL_curcop);
907 if (PL_copline != NOLINE)
908 CopLINE_set(PL_curcop, PL_copline);
909 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
910 CopLINE_set(PL_curcop, oldline);
917 Perl_scalar(pTHX_ OP *o)
921 /* assumes no premature commitment */
922 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
923 || o->op_type == OP_RETURN)
928 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
930 switch (o->op_type) {
932 if (o->op_private & OPpREPEAT_DOLIST)
933 null(((LISTOP*)cBINOPo->op_first)->op_first);
934 scalar(cBINOPo->op_first);
939 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
943 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
944 if (!kPMOP->op_pmreplroot)
945 deprecate("implicit split to @_");
953 if (o->op_flags & OPf_KIDS) {
954 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
960 kid = cLISTOPo->op_first;
962 while ((kid = kid->op_sibling)) {
968 WITH_THR(PL_curcop = &PL_compiling);
973 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
979 WITH_THR(PL_curcop = &PL_compiling);
986 Perl_scalarvoid(pTHX_ OP *o)
993 if (o->op_type == OP_NEXTSTATE
994 || o->op_type == OP_SETSTATE
995 || o->op_type == OP_DBSTATE
996 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
997 || o->op_targ == OP_SETSTATE
998 || o->op_targ == OP_DBSTATE)))
999 PL_curcop = (COP*)o; /* for warning below */
1001 /* assumes no premature commitment */
1002 want = o->op_flags & OPf_WANT;
1003 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
1004 || o->op_type == OP_RETURN)
1009 if ((o->op_private & OPpTARGET_MY)
1010 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1012 return scalar(o); /* As if inside SASSIGN */
1015 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1017 switch (o->op_type) {
1019 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1023 if (o->op_flags & OPf_STACKED)
1027 if (o->op_private == 4)
1069 case OP_GETSOCKNAME:
1070 case OP_GETPEERNAME:
1075 case OP_GETPRIORITY:
1098 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1099 useless = PL_op_desc[o->op_type];
1106 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1107 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1108 useless = "a variable";
1113 if (cSVOPo->op_private & OPpCONST_STRICT)
1114 no_bareword_allowed(o);
1116 if (ckWARN(WARN_VOID)) {
1117 useless = "a constant";
1118 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1120 else if (SvPOK(sv)) {
1121 if (strnEQ(SvPVX(sv), "di", 2) ||
1122 strnEQ(SvPVX(sv), "ds", 2) ||
1123 strnEQ(SvPVX(sv), "ig", 2))
1128 null(o); /* don't execute or even remember it */
1132 o->op_type = OP_PREINC; /* pre-increment is faster */
1133 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1137 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1138 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1144 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1149 if (o->op_flags & OPf_STACKED)
1156 if (!(o->op_flags & OPf_KIDS))
1165 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1172 /* all requires must return a boolean value */
1173 o->op_flags &= ~OPf_WANT;
1178 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1179 if (!kPMOP->op_pmreplroot)
1180 deprecate("implicit split to @_");
1184 if (useless && ckWARN(WARN_VOID))
1185 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1190 Perl_listkids(pTHX_ OP *o)
1193 if (o && o->op_flags & OPf_KIDS) {
1194 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1201 Perl_list(pTHX_ OP *o)
1205 /* assumes no premature commitment */
1206 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1207 || o->op_type == OP_RETURN)
1212 if ((o->op_private & OPpTARGET_MY)
1213 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1215 return o; /* As if inside SASSIGN */
1218 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1220 switch (o->op_type) {
1223 list(cBINOPo->op_first);
1228 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1236 if (!(o->op_flags & OPf_KIDS))
1238 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1239 list(cBINOPo->op_first);
1240 return gen_constant_list(o);
1247 kid = cLISTOPo->op_first;
1249 while ((kid = kid->op_sibling)) {
1250 if (kid->op_sibling)
1255 WITH_THR(PL_curcop = &PL_compiling);
1259 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1260 if (kid->op_sibling)
1265 WITH_THR(PL_curcop = &PL_compiling);
1268 /* all requires must return a boolean value */
1269 o->op_flags &= ~OPf_WANT;
1276 Perl_scalarseq(pTHX_ OP *o)
1281 if (o->op_type == OP_LINESEQ ||
1282 o->op_type == OP_SCOPE ||
1283 o->op_type == OP_LEAVE ||
1284 o->op_type == OP_LEAVETRY)
1286 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1287 if (kid->op_sibling) {
1291 PL_curcop = &PL_compiling;
1293 o->op_flags &= ~OPf_PARENS;
1294 if (PL_hints & HINT_BLOCK_SCOPE)
1295 o->op_flags |= OPf_PARENS;
1298 o = newOP(OP_STUB, 0);
1303 S_modkids(pTHX_ OP *o, I32 type)
1306 if (o && o->op_flags & OPf_KIDS) {
1307 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1314 Perl_mod(pTHX_ OP *o, I32 type)
1319 if (!o || PL_error_count)
1322 if ((o->op_private & OPpTARGET_MY)
1323 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1328 switch (o->op_type) {
1333 if (!(o->op_private & (OPpCONST_ARYBASE)))
1335 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1336 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1340 SAVEI32(PL_compiling.cop_arybase);
1341 PL_compiling.cop_arybase = 0;
1343 else if (type == OP_REFGEN)
1346 Perl_croak(aTHX_ "That use of $[ is unsupported");
1349 if (o->op_flags & OPf_PARENS)
1353 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1354 !(o->op_flags & OPf_STACKED)) {
1355 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1356 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1357 assert(cUNOPo->op_first->op_type == OP_NULL);
1358 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1361 else { /* lvalue subroutine call */
1362 o->op_private |= OPpLVAL_INTRO;
1363 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1364 /* Backward compatibility mode: */
1365 o->op_private |= OPpENTERSUB_INARGS;
1368 else { /* Compile-time error message: */
1369 OP *kid = cUNOPo->op_first;
1373 if (kid->op_type == OP_PUSHMARK)
1375 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1377 "panic: unexpected lvalue entersub "
1378 "args: type/targ %ld:%ld",
1379 (long)kid->op_type,kid->op_targ);
1380 kid = kLISTOP->op_first;
1382 while (kid->op_sibling)
1383 kid = kid->op_sibling;
1384 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1386 if (kid->op_type == OP_METHOD_NAMED
1387 || kid->op_type == OP_METHOD)
1391 if (kid->op_sibling || kid->op_next != kid) {
1392 yyerror("panic: unexpected optree near method call");
1396 NewOp(1101, newop, 1, UNOP);
1397 newop->op_type = OP_RV2CV;
1398 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1399 newop->op_first = Nullop;
1400 newop->op_next = (OP*)newop;
1401 kid->op_sibling = (OP*)newop;
1402 newop->op_private |= OPpLVAL_INTRO;
1406 if (kid->op_type != OP_RV2CV)
1408 "panic: unexpected lvalue entersub "
1409 "entry via type/targ %ld:%ld",
1410 (long)kid->op_type,kid->op_targ);
1411 kid->op_private |= OPpLVAL_INTRO;
1412 break; /* Postpone until runtime */
1416 kid = kUNOP->op_first;
1417 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1418 kid = kUNOP->op_first;
1419 if (kid->op_type == OP_NULL)
1421 "Unexpected constant lvalue entersub "
1422 "entry via type/targ %ld:%ld",
1423 (long)kid->op_type,kid->op_targ);
1424 if (kid->op_type != OP_GV) {
1425 /* Restore RV2CV to check lvalueness */
1427 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1428 okid->op_next = kid->op_next;
1429 kid->op_next = okid;
1432 okid->op_next = Nullop;
1433 okid->op_type = OP_RV2CV;
1435 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1436 okid->op_private |= OPpLVAL_INTRO;
1440 cv = GvCV(kGVOP_gv);
1450 /* grep, foreach, subcalls, refgen */
1451 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1453 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1454 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1456 : (o->op_type == OP_ENTERSUB
1457 ? "non-lvalue subroutine call"
1458 : PL_op_desc[o->op_type])),
1459 type ? PL_op_desc[type] : "local"));
1473 case OP_RIGHT_SHIFT:
1482 if (!(o->op_flags & OPf_STACKED))
1488 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1494 if (!type && cUNOPo->op_first->op_type != OP_GV)
1495 Perl_croak(aTHX_ "Can't localize through a reference");
1496 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1497 PL_modcount = 10000;
1498 return o; /* Treat \(@foo) like ordinary list. */
1502 if (scalar_mod_type(o, type))
1504 ref(cUNOPo->op_first, o->op_type);
1513 PL_modcount = 10000;
1516 if (!type && cUNOPo->op_first->op_type != OP_GV)
1517 Perl_croak(aTHX_ "Can't localize through a reference");
1518 ref(cUNOPo->op_first, o->op_type);
1522 PL_hints |= HINT_BLOCK_SCOPE;
1532 PL_modcount = 10000;
1533 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1534 return o; /* Treat \(@foo) like ordinary list. */
1535 if (scalar_mod_type(o, type))
1541 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1542 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1547 PL_modcount++; /* XXX ??? */
1549 #endif /* USE_THREADS */
1555 if (type != OP_SASSIGN)
1559 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1565 pad_free(o->op_targ);
1566 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1567 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1568 if (o->op_flags & OPf_KIDS)
1569 mod(cBINOPo->op_first->op_sibling, type);
1574 ref(cBINOPo->op_first, o->op_type);
1575 if (type == OP_ENTERSUB &&
1576 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1577 o->op_private |= OPpLVAL_DEFER;
1584 if (o->op_flags & OPf_KIDS)
1585 mod(cLISTOPo->op_last, type);
1589 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1591 else if (!(o->op_flags & OPf_KIDS))
1593 if (o->op_targ != OP_LIST) {
1594 mod(cBINOPo->op_first, type);
1599 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1603 o->op_flags |= OPf_MOD;
1605 if (type == OP_AASSIGN || type == OP_SASSIGN)
1606 o->op_flags |= OPf_SPECIAL|OPf_REF;
1608 o->op_private |= OPpLVAL_INTRO;
1609 o->op_flags &= ~OPf_SPECIAL;
1610 PL_hints |= HINT_BLOCK_SCOPE;
1612 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1613 o->op_flags |= OPf_REF;
1618 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1622 if (o->op_type == OP_RV2GV)
1646 case OP_RIGHT_SHIFT:
1665 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1667 switch (o->op_type) {
1675 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1688 Perl_refkids(pTHX_ OP *o, I32 type)
1691 if (o && o->op_flags & OPf_KIDS) {
1692 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1699 Perl_ref(pTHX_ OP *o, I32 type)
1703 if (!o || PL_error_count)
1706 switch (o->op_type) {
1708 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1709 !(o->op_flags & OPf_STACKED)) {
1710 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1711 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1712 assert(cUNOPo->op_first->op_type == OP_NULL);
1713 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1714 o->op_flags |= OPf_SPECIAL;
1719 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1723 if (type == OP_DEFINED)
1724 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1725 ref(cUNOPo->op_first, o->op_type);
1728 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1729 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1730 : type == OP_RV2HV ? OPpDEREF_HV
1732 o->op_flags |= OPf_MOD;
1737 o->op_flags |= OPf_MOD; /* XXX ??? */
1742 o->op_flags |= OPf_REF;
1745 if (type == OP_DEFINED)
1746 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1747 ref(cUNOPo->op_first, o->op_type);
1752 o->op_flags |= OPf_REF;
1757 if (!(o->op_flags & OPf_KIDS))
1759 ref(cBINOPo->op_first, type);
1763 ref(cBINOPo->op_first, o->op_type);
1764 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1765 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1766 : type == OP_RV2HV ? OPpDEREF_HV
1768 o->op_flags |= OPf_MOD;
1776 if (!(o->op_flags & OPf_KIDS))
1778 ref(cLISTOPo->op_last, type);
1788 S_dup_attrlist(pTHX_ OP *o)
1792 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1793 * where the first kid is OP_PUSHMARK and the remaining ones
1794 * are OP_CONST. We need to push the OP_CONST values.
1796 if (o->op_type == OP_CONST)
1797 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1799 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1800 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1801 if (o->op_type == OP_CONST)
1802 rop = append_elem(OP_LIST, rop,
1803 newSVOP(OP_CONST, o->op_flags,
1804 SvREFCNT_inc(cSVOPo->op_sv)));
1811 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1815 /* fake up C<use attributes $pkg,$rv,@attrs> */
1816 ENTER; /* need to protect against side-effects of 'use' */
1818 if (stash && HvNAME(stash))
1819 stashsv = newSVpv(HvNAME(stash), 0);
1821 stashsv = &PL_sv_no;
1823 #define ATTRSMODULE "attributes"
1825 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1826 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1828 prepend_elem(OP_LIST,
1829 newSVOP(OP_CONST, 0, stashsv),
1830 prepend_elem(OP_LIST,
1831 newSVOP(OP_CONST, 0,
1833 dup_attrlist(attrs))));
1838 Perl_apply_attrs_string(pTHX_ char *stashpv, CV *cv,
1839 char *attrstr, STRLEN len)
1844 len = strlen(attrstr);
1848 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
1850 char *sstr = attrstr;
1851 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
1852 attrs = append_elem(OP_LIST, attrs,
1853 newSVOP(OP_CONST, 0,
1854 newSVpvn(sstr, attrstr-sstr)));
1858 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1859 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1860 Nullsv, prepend_elem(OP_LIST,
1861 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
1862 prepend_elem(OP_LIST,
1863 newSVOP(OP_CONST, 0,
1869 S_my_kid(pTHX_ OP *o, OP *attrs)
1874 if (!o || PL_error_count)
1878 if (type == OP_LIST) {
1879 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1881 } else if (type == OP_UNDEF) {
1883 } else if (type == OP_RV2SV || /* "our" declaration */
1885 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1886 o->op_private |= OPpOUR_INTRO;
1888 } else if (type != OP_PADSV &&
1891 type != OP_PUSHMARK)
1893 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1894 PL_op_desc[o->op_type],
1895 PL_in_my == KEY_our ? "our" : "my"));
1898 else if (attrs && type != OP_PUSHMARK) {
1904 PL_in_my_stash = Nullhv;
1906 /* check for C<my Dog $spot> when deciding package */
1907 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1908 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1909 stash = SvSTASH(*namesvp);
1911 stash = PL_curstash;
1912 padsv = PAD_SV(o->op_targ);
1913 apply_attrs(stash, padsv, attrs);
1915 o->op_flags |= OPf_MOD;
1916 o->op_private |= OPpLVAL_INTRO;
1921 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1923 if (o->op_flags & OPf_PARENS)
1927 o = my_kid(o, attrs);
1929 PL_in_my_stash = Nullhv;
1934 Perl_my(pTHX_ OP *o)
1936 return my_kid(o, Nullop);
1940 Perl_sawparens(pTHX_ OP *o)
1943 o->op_flags |= OPf_PARENS;
1948 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1952 if (ckWARN(WARN_MISC) &&
1953 (left->op_type == OP_RV2AV ||
1954 left->op_type == OP_RV2HV ||
1955 left->op_type == OP_PADAV ||
1956 left->op_type == OP_PADHV)) {
1957 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1958 right->op_type == OP_TRANS)
1959 ? right->op_type : OP_MATCH];
1960 const char *sample = ((left->op_type == OP_RV2AV ||
1961 left->op_type == OP_PADAV)
1962 ? "@array" : "%hash");
1963 Perl_warner(aTHX_ WARN_MISC,
1964 "Applying %s to %s will act on scalar(%s)",
1965 desc, sample, sample);
1968 if (!(right->op_flags & OPf_STACKED) &&
1969 (right->op_type == OP_MATCH ||
1970 right->op_type == OP_SUBST ||
1971 right->op_type == OP_TRANS)) {
1972 right->op_flags |= OPf_STACKED;
1973 if (right->op_type != OP_MATCH &&
1974 ! (right->op_type == OP_TRANS &&
1975 right->op_private & OPpTRANS_IDENTICAL))
1976 left = mod(left, right->op_type);
1977 if (right->op_type == OP_TRANS)
1978 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1980 o = prepend_elem(right->op_type, scalar(left), right);
1982 return newUNOP(OP_NOT, 0, scalar(o));
1986 return bind_match(type, left,
1987 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1991 Perl_invert(pTHX_ OP *o)
1995 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1996 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2000 Perl_scope(pTHX_ OP *o)
2003 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2004 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2005 o->op_type = OP_LEAVE;
2006 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2009 if (o->op_type == OP_LINESEQ) {
2011 o->op_type = OP_SCOPE;
2012 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2013 kid = ((LISTOP*)o)->op_first;
2014 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2018 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
2025 Perl_save_hints(pTHX)
2028 SAVESPTR(GvHV(PL_hintgv));
2029 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
2030 SAVEFREESV(GvHV(PL_hintgv));
2034 Perl_block_start(pTHX_ int full)
2036 int retval = PL_savestack_ix;
2038 SAVEI32(PL_comppad_name_floor);
2039 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
2041 PL_comppad_name_fill = PL_comppad_name_floor;
2042 if (PL_comppad_name_floor < 0)
2043 PL_comppad_name_floor = 0;
2044 SAVEI32(PL_min_intro_pending);
2045 SAVEI32(PL_max_intro_pending);
2046 PL_min_intro_pending = 0;
2047 SAVEI32(PL_comppad_name_fill);
2048 SAVEI32(PL_padix_floor);
2049 PL_padix_floor = PL_padix;
2050 PL_pad_reset_pending = FALSE;
2052 PL_hints &= ~HINT_BLOCK_SCOPE;
2053 SAVESPTR(PL_compiling.cop_warnings);
2054 if (! specialWARN(PL_compiling.cop_warnings)) {
2055 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2056 SAVEFREESV(PL_compiling.cop_warnings) ;
2058 SAVESPTR(PL_compiling.cop_io);
2059 if (! specialCopIO(PL_compiling.cop_io)) {
2060 PL_compiling.cop_io = newSVsv(PL_compiling.cop_io) ;
2061 SAVEFREESV(PL_compiling.cop_io) ;
2067 Perl_block_end(pTHX_ I32 floor, OP *seq)
2069 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2070 OP* retval = scalarseq(seq);
2072 PL_pad_reset_pending = FALSE;
2073 PL_compiling.op_private = PL_hints;
2075 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2076 pad_leavemy(PL_comppad_name_fill);
2085 OP *o = newOP(OP_THREADSV, 0);
2086 o->op_targ = find_threadsv("_");
2089 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2090 #endif /* USE_THREADS */
2094 Perl_newPROG(pTHX_ OP *o)
2099 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2100 ((PL_in_eval & EVAL_KEEPERR)
2101 ? OPf_SPECIAL : 0), o);
2102 PL_eval_start = linklist(PL_eval_root);
2103 PL_eval_root->op_private |= OPpREFCOUNTED;
2104 OpREFCNT_set(PL_eval_root, 1);
2105 PL_eval_root->op_next = 0;
2106 peep(PL_eval_start);
2111 PL_main_root = scope(sawparens(scalarvoid(o)));
2112 PL_curcop = &PL_compiling;
2113 PL_main_start = LINKLIST(PL_main_root);
2114 PL_main_root->op_private |= OPpREFCOUNTED;
2115 OpREFCNT_set(PL_main_root, 1);
2116 PL_main_root->op_next = 0;
2117 peep(PL_main_start);
2120 /* Register with debugger */
2122 CV *cv = get_cv("DB::postponed", FALSE);
2126 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2128 call_sv((SV*)cv, G_DISCARD);
2135 Perl_localize(pTHX_ OP *o, I32 lex)
2137 if (o->op_flags & OPf_PARENS)
2140 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2142 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2143 if (*s == ';' || *s == '=')
2144 Perl_warner(aTHX_ WARN_PARENTHESIS,
2145 "Parentheses missing around \"%s\" list",
2146 lex ? (PL_in_my == KEY_our ? "our" : "my") : "local");
2152 o = mod(o, OP_NULL); /* a bit kludgey */
2154 PL_in_my_stash = Nullhv;
2159 Perl_jmaybe(pTHX_ OP *o)
2161 if (o->op_type == OP_LIST) {
2164 o2 = newOP(OP_THREADSV, 0);
2165 o2->op_targ = find_threadsv(";");
2167 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2168 #endif /* USE_THREADS */
2169 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2175 Perl_fold_constants(pTHX_ register OP *o)
2178 I32 type = o->op_type;
2181 if (PL_opargs[type] & OA_RETSCALAR)
2183 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2184 o->op_targ = pad_alloc(type, SVs_PADTMP);
2186 /* integerize op, unless it happens to be C<-foo>.
2187 * XXX should pp_i_negate() do magic string negation instead? */
2188 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2189 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2190 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2192 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2195 if (!(PL_opargs[type] & OA_FOLDCONST))
2200 /* XXX might want a ck_negate() for this */
2201 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2214 if (o->op_private & OPpLOCALE)
2219 goto nope; /* Don't try to run w/ errors */
2221 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2222 if ((curop->op_type != OP_CONST ||
2223 (curop->op_private & OPpCONST_BARE)) &&
2224 curop->op_type != OP_LIST &&
2225 curop->op_type != OP_SCALAR &&
2226 curop->op_type != OP_NULL &&
2227 curop->op_type != OP_PUSHMARK)
2233 curop = LINKLIST(o);
2237 sv = *(PL_stack_sp--);
2238 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2239 pad_swipe(o->op_targ);
2240 else if (SvTEMP(sv)) { /* grab mortal temp? */
2241 (void)SvREFCNT_inc(sv);
2245 if (type == OP_RV2GV)
2246 return newGVOP(OP_GV, 0, (GV*)sv);
2248 /* try to smush double to int, but don't smush -2.0 to -2 */
2249 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2253 if ((NV)iv == SvNV(sv)) {
2258 SvIOK_off(sv); /* undo SvIV() damage */
2260 return newSVOP(OP_CONST, 0, sv);
2264 if (!(PL_opargs[type] & OA_OTHERINT))
2267 if (!(PL_hints & HINT_INTEGER)) {
2268 if (type == OP_MODULO
2269 || type == OP_DIVIDE
2270 || !(o->op_flags & OPf_KIDS))
2275 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2276 if (curop->op_type == OP_CONST) {
2277 if (SvIOK(((SVOP*)curop)->op_sv))
2281 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2285 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2292 Perl_gen_constant_list(pTHX_ register OP *o)
2295 I32 oldtmps_floor = PL_tmps_floor;
2299 return o; /* Don't attempt to run with errors */
2301 PL_op = curop = LINKLIST(o);
2308 PL_tmps_floor = oldtmps_floor;
2310 o->op_type = OP_RV2AV;
2311 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2312 curop = ((UNOP*)o)->op_first;
2313 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2320 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2325 if (!o || o->op_type != OP_LIST)
2326 o = newLISTOP(OP_LIST, 0, o, Nullop);
2328 o->op_flags &= ~OPf_WANT;
2330 if (!(PL_opargs[type] & OA_MARK))
2331 null(cLISTOPo->op_first);
2334 o->op_ppaddr = PL_ppaddr[type];
2335 o->op_flags |= flags;
2337 o = CHECKOP(type, o);
2338 if (o->op_type != type)
2341 if (cLISTOPo->op_children < 7) {
2342 /* XXX do we really need to do this if we're done appending?? */
2343 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2345 cLISTOPo->op_last = last; /* in case check substituted last arg */
2348 return fold_constants(o);
2351 /* List constructors */
2354 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2362 if (first->op_type != type
2363 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2365 return newLISTOP(type, 0, first, last);
2368 if (first->op_flags & OPf_KIDS)
2369 ((LISTOP*)first)->op_last->op_sibling = last;
2371 first->op_flags |= OPf_KIDS;
2372 ((LISTOP*)first)->op_first = last;
2374 ((LISTOP*)first)->op_last = last;
2375 ((LISTOP*)first)->op_children++;
2380 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2388 if (first->op_type != type)
2389 return prepend_elem(type, (OP*)first, (OP*)last);
2391 if (last->op_type != type)
2392 return append_elem(type, (OP*)first, (OP*)last);
2394 first->op_last->op_sibling = last->op_first;
2395 first->op_last = last->op_last;
2396 first->op_children += last->op_children;
2397 if (first->op_children)
2398 first->op_flags |= OPf_KIDS;
2400 #ifdef PL_OP_SLAB_ALLOC
2408 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2416 if (last->op_type == type) {
2417 if (type == OP_LIST) { /* already a PUSHMARK there */
2418 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2419 ((LISTOP*)last)->op_first->op_sibling = first;
2422 if (!(last->op_flags & OPf_KIDS)) {
2423 ((LISTOP*)last)->op_last = first;
2424 last->op_flags |= OPf_KIDS;
2426 first->op_sibling = ((LISTOP*)last)->op_first;
2427 ((LISTOP*)last)->op_first = first;
2429 ((LISTOP*)last)->op_children++;
2433 return newLISTOP(type, 0, first, last);
2439 Perl_newNULLLIST(pTHX)
2441 return newOP(OP_STUB, 0);
2445 Perl_force_list(pTHX_ OP *o)
2447 if (!o || o->op_type != OP_LIST)
2448 o = newLISTOP(OP_LIST, 0, o, Nullop);
2454 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2458 NewOp(1101, listop, 1, LISTOP);
2460 listop->op_type = type;
2461 listop->op_ppaddr = PL_ppaddr[type];
2462 listop->op_children = (first != 0) + (last != 0);
2463 listop->op_flags = flags;
2467 else if (!first && last)
2470 first->op_sibling = last;
2471 listop->op_first = first;
2472 listop->op_last = last;
2473 if (type == OP_LIST) {
2475 pushop = newOP(OP_PUSHMARK, 0);
2476 pushop->op_sibling = first;
2477 listop->op_first = pushop;
2478 listop->op_flags |= OPf_KIDS;
2480 listop->op_last = pushop;
2482 else if (listop->op_children)
2483 listop->op_flags |= OPf_KIDS;
2489 Perl_newOP(pTHX_ I32 type, I32 flags)
2492 NewOp(1101, o, 1, OP);
2494 o->op_ppaddr = PL_ppaddr[type];
2495 o->op_flags = flags;
2498 o->op_private = 0 + (flags >> 8);
2499 if (PL_opargs[type] & OA_RETSCALAR)
2501 if (PL_opargs[type] & OA_TARGET)
2502 o->op_targ = pad_alloc(type, SVs_PADTMP);
2503 return CHECKOP(type, o);
2507 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2512 first = newOP(OP_STUB, 0);
2513 if (PL_opargs[type] & OA_MARK)
2514 first = force_list(first);
2516 NewOp(1101, unop, 1, UNOP);
2517 unop->op_type = type;
2518 unop->op_ppaddr = PL_ppaddr[type];
2519 unop->op_first = first;
2520 unop->op_flags = flags | OPf_KIDS;
2521 unop->op_private = 1 | (flags >> 8);
2522 unop = (UNOP*) CHECKOP(type, unop);
2526 return fold_constants((OP *) unop);
2530 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2533 NewOp(1101, binop, 1, BINOP);
2536 first = newOP(OP_NULL, 0);
2538 binop->op_type = type;
2539 binop->op_ppaddr = PL_ppaddr[type];
2540 binop->op_first = first;
2541 binop->op_flags = flags | OPf_KIDS;
2544 binop->op_private = 1 | (flags >> 8);
2547 binop->op_private = 2 | (flags >> 8);
2548 first->op_sibling = last;
2551 binop = (BINOP*)CHECKOP(type, binop);
2552 if (binop->op_next || binop->op_type != type)
2555 binop->op_last = binop->op_first->op_sibling;
2557 return fold_constants((OP *)binop);
2561 utf8compare(const void *a, const void *b)
2564 for (i = 0; i < 10; i++) {
2565 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2567 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2574 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2576 SV *tstr = ((SVOP*)expr)->op_sv;
2577 SV *rstr = ((SVOP*)repl)->op_sv;
2580 register U8 *t = (U8*)SvPV(tstr, tlen);
2581 register U8 *r = (U8*)SvPV(rstr, rlen);
2587 register short *tbl;
2589 complement = o->op_private & OPpTRANS_COMPLEMENT;
2590 del = o->op_private & OPpTRANS_DELETE;
2591 squash = o->op_private & OPpTRANS_SQUASH;
2594 o->op_private |= OPpTRANS_FROM_UTF;
2597 o->op_private |= OPpTRANS_TO_UTF;
2599 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2600 SV* listsv = newSVpvn("# comment\n",10);
2602 U8* tend = t + tlen;
2603 U8* rend = r + rlen;
2618 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2619 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2622 U8 tmpbuf[UTF8_MAXLEN+1];
2626 New(1109, cp, tlen, U8*);
2628 transv = newSVpvn("",0);
2637 qsort(cp, i, sizeof(U8*), utf8compare);
2638 for (j = 0; j < i; j++) {
2640 I32 cur = j < i ? cp[j+1] - s : tend - s;
2641 UV val = utf8_to_uv(s, cur, &ulen, 0);
2643 diff = val - nextmin;
2645 t = uv_to_utf8(tmpbuf,nextmin);
2646 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2648 t = uv_to_utf8(tmpbuf, val - 1);
2649 sv_catpvn(transv, "\377", 1);
2650 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2654 val = utf8_to_uv(s+1, cur - 1, &ulen, 0);
2658 t = uv_to_utf8(tmpbuf,nextmin);
2659 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2660 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2661 sv_catpvn(transv, "\377", 1);
2662 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2663 t = (U8*)SvPVX(transv);
2664 tlen = SvCUR(transv);
2667 else if (!rlen && !del) {
2668 r = t; rlen = tlen; rend = tend;
2672 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
2674 o->op_private |= OPpTRANS_IDENTICAL;
2678 while (t < tend || tfirst <= tlast) {
2679 /* see if we need more "t" chars */
2680 if (tfirst > tlast) {
2681 tfirst = (I32)utf8_to_uv(t, tend - t, &ulen, 0);
2683 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2685 tlast = (I32)utf8_to_uv(t, tend - t, &ulen, 0);
2692 /* now see if we need more "r" chars */
2693 if (rfirst > rlast) {
2695 rfirst = (I32)utf8_to_uv(r, rend - r, &ulen, 0);
2697 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2699 rlast = (I32)utf8_to_uv(r, rend - r, &ulen, 0);
2708 rfirst = rlast = 0xffffffff;
2712 /* now see which range will peter our first, if either. */
2713 tdiff = tlast - tfirst;
2714 rdiff = rlast - rfirst;
2721 if (rfirst == 0xffffffff) {
2722 diff = tdiff; /* oops, pretend rdiff is infinite */
2724 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2725 (long)tfirst, (long)tlast);
2727 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2731 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2732 (long)tfirst, (long)(tfirst + diff),
2735 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2736 (long)tfirst, (long)rfirst);
2738 if (rfirst + diff > max)
2739 max = rfirst + diff;
2744 else if (rfirst <= 0x800)
2745 grows |= (tfirst < 0x80);
2746 else if (rfirst <= 0x10000)
2747 grows |= (tfirst < 0x800);
2748 else if (rfirst <= 0x200000)
2749 grows |= (tfirst < 0x10000);
2750 else if (rfirst <= 0x4000000)
2751 grows |= (tfirst < 0x200000);
2752 else if (rfirst <= 0x80000000)
2753 grows |= (tfirst < 0x4000000);
2765 else if (max > 0xff)
2770 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2771 SvREFCNT_dec(listsv);
2773 SvREFCNT_dec(transv);
2775 if (!del && havefinal)
2776 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
2777 newSVuv((UV)final), 0);
2779 if (grows && to_utf)
2780 o->op_private |= OPpTRANS_GROWS;
2787 tbl = (short*)cPVOPo->op_pv;
2789 Zero(tbl, 256, short);
2790 for (i = 0; i < tlen; i++)
2792 for (i = 0, j = 0; i < 256; i++) {
2808 if (!rlen && !del) {
2811 o->op_private |= OPpTRANS_IDENTICAL;
2813 for (i = 0; i < 256; i++)
2815 for (i = 0, j = 0; i < tlen; i++,j++) {
2818 if (tbl[t[i]] == -1)
2824 if (tbl[t[i]] == -1)
2835 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2839 NewOp(1101, pmop, 1, PMOP);
2840 pmop->op_type = type;
2841 pmop->op_ppaddr = PL_ppaddr[type];
2842 pmop->op_flags = flags;
2843 pmop->op_private = 0 | (flags >> 8);
2845 if (PL_hints & HINT_RE_TAINT)
2846 pmop->op_pmpermflags |= PMf_RETAINT;
2847 if (PL_hints & HINT_LOCALE)
2848 pmop->op_pmpermflags |= PMf_LOCALE;
2849 pmop->op_pmflags = pmop->op_pmpermflags;
2851 /* link into pm list */
2852 if (type != OP_TRANS && PL_curstash) {
2853 pmop->op_pmnext = HvPMROOT(PL_curstash);
2854 HvPMROOT(PL_curstash) = pmop;
2861 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2865 I32 repl_has_vars = 0;
2867 if (o->op_type == OP_TRANS)
2868 return pmtrans(o, expr, repl);
2870 PL_hints |= HINT_BLOCK_SCOPE;
2873 if (expr->op_type == OP_CONST) {
2875 SV *pat = ((SVOP*)expr)->op_sv;
2876 char *p = SvPV(pat, plen);
2877 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2878 sv_setpvn(pat, "\\s+", 3);
2879 p = SvPV(pat, plen);
2880 pm->op_pmflags |= PMf_SKIPWHITE;
2882 if ((PL_hints & HINT_UTF8) || DO_UTF8(pat))
2883 pm->op_pmdynflags |= PMdf_UTF8;
2884 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2885 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2886 pm->op_pmflags |= PMf_WHITE;
2890 if (PL_hints & HINT_UTF8)
2891 pm->op_pmdynflags |= PMdf_UTF8;
2892 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2893 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2895 : OP_REGCMAYBE),0,expr);
2897 NewOp(1101, rcop, 1, LOGOP);
2898 rcop->op_type = OP_REGCOMP;
2899 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2900 rcop->op_first = scalar(expr);
2901 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2902 ? (OPf_SPECIAL | OPf_KIDS)
2904 rcop->op_private = 1;
2907 /* establish postfix order */
2908 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2910 rcop->op_next = expr;
2911 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2914 rcop->op_next = LINKLIST(expr);
2915 expr->op_next = (OP*)rcop;
2918 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2923 if (pm->op_pmflags & PMf_EVAL) {
2925 if (CopLINE(PL_curcop) < PL_multi_end)
2926 CopLINE_set(PL_curcop, PL_multi_end);
2929 else if (repl->op_type == OP_THREADSV
2930 && strchr("&`'123456789+",
2931 PL_threadsv_names[repl->op_targ]))
2935 #endif /* USE_THREADS */
2936 else if (repl->op_type == OP_CONST)
2940 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2941 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2943 if (curop->op_type == OP_THREADSV) {
2945 if (strchr("&`'123456789+", curop->op_private))
2949 if (curop->op_type == OP_GV) {
2950 GV *gv = cGVOPx_gv(curop);
2952 if (strchr("&`'123456789+", *GvENAME(gv)))
2955 #endif /* USE_THREADS */
2956 else if (curop->op_type == OP_RV2CV)
2958 else if (curop->op_type == OP_RV2SV ||
2959 curop->op_type == OP_RV2AV ||
2960 curop->op_type == OP_RV2HV ||
2961 curop->op_type == OP_RV2GV) {
2962 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2965 else if (curop->op_type == OP_PADSV ||
2966 curop->op_type == OP_PADAV ||
2967 curop->op_type == OP_PADHV ||
2968 curop->op_type == OP_PADANY) {
2971 else if (curop->op_type == OP_PUSHRE)
2972 ; /* Okay here, dangerous in newASSIGNOP */
2981 && (!pm->op_pmregexp
2982 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2983 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2984 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2985 prepend_elem(o->op_type, scalar(repl), o);
2988 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2989 pm->op_pmflags |= PMf_MAYBE_CONST;
2990 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2992 NewOp(1101, rcop, 1, LOGOP);
2993 rcop->op_type = OP_SUBSTCONT;
2994 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2995 rcop->op_first = scalar(repl);
2996 rcop->op_flags |= OPf_KIDS;
2997 rcop->op_private = 1;
3000 /* establish postfix order */
3001 rcop->op_next = LINKLIST(repl);
3002 repl->op_next = (OP*)rcop;
3004 pm->op_pmreplroot = scalar((OP*)rcop);
3005 pm->op_pmreplstart = LINKLIST(rcop);
3014 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3017 NewOp(1101, svop, 1, SVOP);
3018 svop->op_type = type;
3019 svop->op_ppaddr = PL_ppaddr[type];
3021 svop->op_next = (OP*)svop;
3022 svop->op_flags = flags;
3023 if (PL_opargs[type] & OA_RETSCALAR)
3025 if (PL_opargs[type] & OA_TARGET)
3026 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3027 return CHECKOP(type, svop);
3031 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3034 NewOp(1101, padop, 1, PADOP);
3035 padop->op_type = type;
3036 padop->op_ppaddr = PL_ppaddr[type];
3037 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3038 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3039 PL_curpad[padop->op_padix] = sv;
3041 padop->op_next = (OP*)padop;
3042 padop->op_flags = flags;
3043 if (PL_opargs[type] & OA_RETSCALAR)
3045 if (PL_opargs[type] & OA_TARGET)
3046 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3047 return CHECKOP(type, padop);
3051 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3055 return newPADOP(type, flags, SvREFCNT_inc(gv));
3057 return newSVOP(type, flags, SvREFCNT_inc(gv));
3062 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3065 NewOp(1101, pvop, 1, PVOP);
3066 pvop->op_type = type;
3067 pvop->op_ppaddr = PL_ppaddr[type];
3069 pvop->op_next = (OP*)pvop;
3070 pvop->op_flags = flags;
3071 if (PL_opargs[type] & OA_RETSCALAR)
3073 if (PL_opargs[type] & OA_TARGET)
3074 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3075 return CHECKOP(type, pvop);
3079 Perl_package(pTHX_ OP *o)
3083 save_hptr(&PL_curstash);
3084 save_item(PL_curstname);
3089 name = SvPV(sv, len);
3090 PL_curstash = gv_stashpvn(name,len,TRUE);
3091 sv_setpvn(PL_curstname, name, len);
3095 sv_setpv(PL_curstname,"<none>");
3096 PL_curstash = Nullhv;
3098 PL_hints |= HINT_BLOCK_SCOPE;
3099 PL_copline = NOLINE;
3104 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3112 if (id->op_type != OP_CONST)
3113 Perl_croak(aTHX_ "Module name must be constant");
3117 if (version != Nullop) {
3118 SV *vesv = ((SVOP*)version)->op_sv;
3120 if (arg == Nullop && !SvNIOKp(vesv)) {
3127 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3128 Perl_croak(aTHX_ "Version number must be constant number");
3130 /* Make copy of id so we don't free it twice */
3131 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3133 /* Fake up a method call to VERSION */
3134 meth = newSVpvn("VERSION",7);
3135 sv_upgrade(meth, SVt_PVIV);
3136 (void)SvIOK_on(meth);
3137 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3138 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3139 append_elem(OP_LIST,
3140 prepend_elem(OP_LIST, pack, list(version)),
3141 newSVOP(OP_METHOD_NAMED, 0, meth)));
3145 /* Fake up an import/unimport */
3146 if (arg && arg->op_type == OP_STUB)
3147 imop = arg; /* no import on explicit () */
3148 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3149 imop = Nullop; /* use 5.0; */
3154 /* Make copy of id so we don't free it twice */
3155 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3157 /* Fake up a method call to import/unimport */
3158 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);;
3159 sv_upgrade(meth, SVt_PVIV);
3160 (void)SvIOK_on(meth);
3161 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3162 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3163 append_elem(OP_LIST,
3164 prepend_elem(OP_LIST, pack, list(arg)),
3165 newSVOP(OP_METHOD_NAMED, 0, meth)));
3168 /* Fake up a require, handle override, if any */
3169 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3170 if (!(gv && GvIMPORTED_CV(gv)))
3171 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3173 if (gv && GvIMPORTED_CV(gv)) {
3174 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3175 append_elem(OP_LIST, id,
3176 scalar(newUNOP(OP_RV2CV, 0,
3181 rqop = newUNOP(OP_REQUIRE, 0, id);
3184 /* Fake up the BEGIN {}, which does its thing immediately. */
3186 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3189 append_elem(OP_LINESEQ,
3190 append_elem(OP_LINESEQ,
3191 newSTATEOP(0, Nullch, rqop),
3192 newSTATEOP(0, Nullch, veop)),
3193 newSTATEOP(0, Nullch, imop) ));
3195 PL_hints |= HINT_BLOCK_SCOPE;
3196 PL_copline = NOLINE;
3201 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3204 va_start(args, ver);
3205 vload_module(flags, name, ver, &args);
3209 #ifdef PERL_IMPLICIT_CONTEXT
3211 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3215 va_start(args, ver);
3216 vload_module(flags, name, ver, &args);
3222 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3224 OP *modname, *veop, *imop;
3226 modname = newSVOP(OP_CONST, 0, name);
3227 modname->op_private |= OPpCONST_BARE;
3229 veop = newSVOP(OP_CONST, 0, ver);
3233 if (flags & PERL_LOADMOD_NOIMPORT) {
3234 imop = sawparens(newNULLLIST());
3236 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3237 imop = va_arg(*args, OP*);
3242 sv = va_arg(*args, SV*);
3244 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3245 sv = va_arg(*args, SV*);
3249 line_t ocopline = PL_copline;
3250 int oexpect = PL_expect;
3252 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3253 veop, modname, imop);
3254 PL_expect = oexpect;
3255 PL_copline = ocopline;
3260 Perl_dofile(pTHX_ OP *term)
3265 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3266 if (!(gv && GvIMPORTED_CV(gv)))
3267 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3269 if (gv && GvIMPORTED_CV(gv)) {
3270 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3271 append_elem(OP_LIST, term,
3272 scalar(newUNOP(OP_RV2CV, 0,
3277 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3283 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3285 return newBINOP(OP_LSLICE, flags,
3286 list(force_list(subscript)),
3287 list(force_list(listval)) );
3291 S_list_assignment(pTHX_ register OP *o)
3296 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3297 o = cUNOPo->op_first;
3299 if (o->op_type == OP_COND_EXPR) {
3300 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3301 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3306 yyerror("Assignment to both a list and a scalar");
3310 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3311 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3312 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3315 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3318 if (o->op_type == OP_RV2SV)
3325 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3330 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3331 return newLOGOP(optype, 0,
3332 mod(scalar(left), optype),
3333 newUNOP(OP_SASSIGN, 0, scalar(right)));
3336 return newBINOP(optype, OPf_STACKED,
3337 mod(scalar(left), optype), scalar(right));
3341 if (list_assignment(left)) {
3345 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3346 left = mod(left, OP_AASSIGN);
3354 curop = list(force_list(left));
3355 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3356 o->op_private = 0 | (flags >> 8);
3357 for (curop = ((LISTOP*)curop)->op_first;
3358 curop; curop = curop->op_sibling)
3360 if (curop->op_type == OP_RV2HV &&
3361 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3362 o->op_private |= OPpASSIGN_HASH;
3366 if (!(left->op_private & OPpLVAL_INTRO)) {
3369 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3370 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3371 if (curop->op_type == OP_GV) {
3372 GV *gv = cGVOPx_gv(curop);
3373 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3375 SvCUR(gv) = PL_generation;
3377 else if (curop->op_type == OP_PADSV ||
3378 curop->op_type == OP_PADAV ||
3379 curop->op_type == OP_PADHV ||
3380 curop->op_type == OP_PADANY) {
3381 SV **svp = AvARRAY(PL_comppad_name);
3382 SV *sv = svp[curop->op_targ];
3383 if (SvCUR(sv) == PL_generation)
3385 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3387 else if (curop->op_type == OP_RV2CV)
3389 else if (curop->op_type == OP_RV2SV ||
3390 curop->op_type == OP_RV2AV ||
3391 curop->op_type == OP_RV2HV ||
3392 curop->op_type == OP_RV2GV) {
3393 if (lastop->op_type != OP_GV) /* funny deref? */
3396 else if (curop->op_type == OP_PUSHRE) {
3397 if (((PMOP*)curop)->op_pmreplroot) {
3399 GV *gv = (GV*)PL_curpad[(PADOFFSET)((PMOP*)curop)->op_pmreplroot];
3401 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3403 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3405 SvCUR(gv) = PL_generation;
3414 o->op_private |= OPpASSIGN_COMMON;
3416 if (right && right->op_type == OP_SPLIT) {
3418 if ((tmpop = ((LISTOP*)right)->op_first) &&
3419 tmpop->op_type == OP_PUSHRE)
3421 PMOP *pm = (PMOP*)tmpop;
3422 if (left->op_type == OP_RV2AV &&
3423 !(left->op_private & OPpLVAL_INTRO) &&
3424 !(o->op_private & OPpASSIGN_COMMON) )
3426 tmpop = ((UNOP*)left)->op_first;
3427 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3429 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3430 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3432 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3433 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3435 pm->op_pmflags |= PMf_ONCE;
3436 tmpop = cUNOPo->op_first; /* to list (nulled) */
3437 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3438 tmpop->op_sibling = Nullop; /* don't free split */
3439 right->op_next = tmpop->op_next; /* fix starting loc */
3440 op_free(o); /* blow off assign */
3441 right->op_flags &= ~OPf_WANT;
3442 /* "I don't know and I don't care." */
3447 if (PL_modcount < 10000 &&
3448 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3450 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3452 sv_setiv(sv, PL_modcount+1);
3460 right = newOP(OP_UNDEF, 0);
3461 if (right->op_type == OP_READLINE) {
3462 right->op_flags |= OPf_STACKED;
3463 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3466 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3467 o = newBINOP(OP_SASSIGN, flags,
3468 scalar(right), mod(scalar(left), OP_SASSIGN) );
3480 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3482 U32 seq = intro_my();
3485 NewOp(1101, cop, 1, COP);
3486 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3487 cop->op_type = OP_DBSTATE;
3488 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3491 cop->op_type = OP_NEXTSTATE;
3492 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3494 cop->op_flags = flags;
3495 cop->op_private = (PL_hints & HINT_BYTE);
3497 cop->op_private |= NATIVE_HINTS;
3499 PL_compiling.op_private = cop->op_private;
3500 cop->op_next = (OP*)cop;
3503 cop->cop_label = label;
3504 PL_hints |= HINT_BLOCK_SCOPE;
3507 cop->cop_arybase = PL_curcop->cop_arybase;
3508 if (specialWARN(PL_curcop->cop_warnings))
3509 cop->cop_warnings = PL_curcop->cop_warnings ;
3511 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3512 if (specialCopIO(PL_curcop->cop_io))
3513 cop->cop_io = PL_curcop->cop_io;
3515 cop->cop_io = newSVsv(PL_curcop->cop_io) ;
3518 if (PL_copline == NOLINE)
3519 CopLINE_set(cop, CopLINE(PL_curcop));
3521 CopLINE_set(cop, PL_copline);
3522 PL_copline = NOLINE;
3525 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
3527 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
3529 CopSTASH_set(cop, PL_curstash);
3531 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3532 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3533 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3534 (void)SvIOK_on(*svp);
3535 SvIVX(*svp) = PTR2IV(cop);
3539 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3542 /* "Introduce" my variables to visible status. */
3550 if (! PL_min_intro_pending)
3551 return PL_cop_seqmax;
3553 svp = AvARRAY(PL_comppad_name);
3554 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3555 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3556 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3557 SvNVX(sv) = (NV)PL_cop_seqmax;
3560 PL_min_intro_pending = 0;
3561 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3562 return PL_cop_seqmax++;
3566 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3568 return new_logop(type, flags, &first, &other);
3572 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3576 OP *first = *firstp;
3577 OP *other = *otherp;
3579 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3580 return newBINOP(type, flags, scalar(first), scalar(other));
3582 scalarboolean(first);
3583 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3584 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3585 if (type == OP_AND || type == OP_OR) {
3591 first = *firstp = cUNOPo->op_first;
3593 first->op_next = o->op_next;
3594 cUNOPo->op_first = Nullop;
3598 if (first->op_type == OP_CONST) {
3599 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3600 Perl_warner(aTHX_ WARN_BAREWORD, "Bareword found in conditional");
3601 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3612 else if (first->op_type == OP_WANTARRAY) {
3618 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3619 OP *k1 = ((UNOP*)first)->op_first;
3620 OP *k2 = k1->op_sibling;
3622 switch (first->op_type)
3625 if (k2 && k2->op_type == OP_READLINE
3626 && (k2->op_flags & OPf_STACKED)
3627 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3629 warnop = k2->op_type;
3634 if (k1->op_type == OP_READDIR
3635 || k1->op_type == OP_GLOB
3636 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3637 || k1->op_type == OP_EACH)
3639 warnop = ((k1->op_type == OP_NULL)
3640 ? k1->op_targ : k1->op_type);
3645 line_t oldline = CopLINE(PL_curcop);
3646 CopLINE_set(PL_curcop, PL_copline);
3647 Perl_warner(aTHX_ WARN_MISC,
3648 "Value of %s%s can be \"0\"; test with defined()",
3650 ((warnop == OP_READLINE || warnop == OP_GLOB)
3651 ? " construct" : "() operator"));
3652 CopLINE_set(PL_curcop, oldline);
3659 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3660 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3662 NewOp(1101, logop, 1, LOGOP);
3664 logop->op_type = type;
3665 logop->op_ppaddr = PL_ppaddr[type];
3666 logop->op_first = first;
3667 logop->op_flags = flags | OPf_KIDS;
3668 logop->op_other = LINKLIST(other);
3669 logop->op_private = 1 | (flags >> 8);
3671 /* establish postfix order */
3672 logop->op_next = LINKLIST(first);
3673 first->op_next = (OP*)logop;
3674 first->op_sibling = other;
3676 o = newUNOP(OP_NULL, 0, (OP*)logop);
3683 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3690 return newLOGOP(OP_AND, 0, first, trueop);
3692 return newLOGOP(OP_OR, 0, first, falseop);
3694 scalarboolean(first);
3695 if (first->op_type == OP_CONST) {
3696 if (SvTRUE(((SVOP*)first)->op_sv)) {
3707 else if (first->op_type == OP_WANTARRAY) {
3711 NewOp(1101, logop, 1, LOGOP);
3712 logop->op_type = OP_COND_EXPR;
3713 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3714 logop->op_first = first;
3715 logop->op_flags = flags | OPf_KIDS;
3716 logop->op_private = 1 | (flags >> 8);
3717 logop->op_other = LINKLIST(trueop);
3718 logop->op_next = LINKLIST(falseop);
3721 /* establish postfix order */
3722 start = LINKLIST(first);
3723 first->op_next = (OP*)logop;
3725 first->op_sibling = trueop;
3726 trueop->op_sibling = falseop;
3727 o = newUNOP(OP_NULL, 0, (OP*)logop);
3729 trueop->op_next = falseop->op_next = o;
3736 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3744 NewOp(1101, range, 1, LOGOP);
3746 range->op_type = OP_RANGE;
3747 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3748 range->op_first = left;
3749 range->op_flags = OPf_KIDS;
3750 leftstart = LINKLIST(left);
3751 range->op_other = LINKLIST(right);
3752 range->op_private = 1 | (flags >> 8);
3754 left->op_sibling = right;
3756 range->op_next = (OP*)range;
3757 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3758 flop = newUNOP(OP_FLOP, 0, flip);
3759 o = newUNOP(OP_NULL, 0, flop);
3761 range->op_next = leftstart;
3763 left->op_next = flip;
3764 right->op_next = flop;
3766 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3767 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3768 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3769 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3771 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3772 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3775 if (!flip->op_private || !flop->op_private)
3776 linklist(o); /* blow off optimizer unless constant */
3782 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3786 int once = block && block->op_flags & OPf_SPECIAL &&
3787 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3790 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3791 return block; /* do {} while 0 does once */
3792 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3793 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3794 expr = newUNOP(OP_DEFINED, 0,
3795 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3796 } else if (expr->op_flags & OPf_KIDS) {
3797 OP *k1 = ((UNOP*)expr)->op_first;
3798 OP *k2 = (k1) ? k1->op_sibling : NULL;
3799 switch (expr->op_type) {
3801 if (k2 && k2->op_type == OP_READLINE
3802 && (k2->op_flags & OPf_STACKED)
3803 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3804 expr = newUNOP(OP_DEFINED, 0, expr);
3808 if (k1->op_type == OP_READDIR
3809 || k1->op_type == OP_GLOB
3810 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3811 || k1->op_type == OP_EACH)
3812 expr = newUNOP(OP_DEFINED, 0, expr);
3818 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3819 o = new_logop(OP_AND, 0, &expr, &listop);
3822 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3824 if (once && o != listop)
3825 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3828 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3830 o->op_flags |= flags;
3832 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3837 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3846 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3847 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3848 expr = newUNOP(OP_DEFINED, 0,
3849 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3850 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3851 OP *k1 = ((UNOP*)expr)->op_first;
3852 OP *k2 = (k1) ? k1->op_sibling : NULL;
3853 switch (expr->op_type) {
3855 if (k2 && k2->op_type == OP_READLINE
3856 && (k2->op_flags & OPf_STACKED)
3857 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3858 expr = newUNOP(OP_DEFINED, 0, expr);
3862 if (k1->op_type == OP_READDIR
3863 || k1->op_type == OP_GLOB
3864 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3865 || k1->op_type == OP_EACH)
3866 expr = newUNOP(OP_DEFINED, 0, expr);
3872 block = newOP(OP_NULL, 0);
3874 block = scope(block);
3878 next = LINKLIST(cont);
3879 loopflags |= OPpLOOP_CONTINUE;
3882 OP *unstack = newOP(OP_UNSTACK, 0);
3885 cont = append_elem(OP_LINESEQ, cont, unstack);
3886 if ((line_t)whileline != NOLINE) {
3887 PL_copline = whileline;
3888 cont = append_elem(OP_LINESEQ, cont,
3889 newSTATEOP(0, Nullch, Nullop));
3893 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3894 redo = LINKLIST(listop);
3897 PL_copline = whileline;
3899 o = new_logop(OP_AND, 0, &expr, &listop);
3900 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3901 op_free(expr); /* oops, it's a while (0) */
3903 return Nullop; /* listop already freed by new_logop */
3906 ((LISTOP*)listop)->op_last->op_next = condop =
3907 (o == listop ? redo : LINKLIST(o));
3913 NewOp(1101,loop,1,LOOP);
3914 loop->op_type = OP_ENTERLOOP;
3915 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3916 loop->op_private = 0;
3917 loop->op_next = (OP*)loop;
3920 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3922 loop->op_redoop = redo;
3923 loop->op_lastop = o;
3924 o->op_private |= loopflags;
3927 loop->op_nextop = next;
3929 loop->op_nextop = o;
3931 o->op_flags |= flags;
3932 o->op_private |= (flags >> 8);
3937 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3945 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3946 sv->op_type = OP_RV2GV;
3947 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3949 else if (sv->op_type == OP_PADSV) { /* private variable */
3950 padoff = sv->op_targ;
3955 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3956 padoff = sv->op_targ;
3958 iterflags |= OPf_SPECIAL;
3963 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3967 padoff = find_threadsv("_");
3968 iterflags |= OPf_SPECIAL;
3970 sv = newGVOP(OP_GV, 0, PL_defgv);
3973 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3974 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3975 iterflags |= OPf_STACKED;
3977 else if (expr->op_type == OP_NULL &&
3978 (expr->op_flags & OPf_KIDS) &&
3979 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3981 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3982 * set the STACKED flag to indicate that these values are to be
3983 * treated as min/max values by 'pp_iterinit'.
3985 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3986 LOGOP* range = (LOGOP*) flip->op_first;
3987 OP* left = range->op_first;
3988 OP* right = left->op_sibling;
3991 range->op_flags &= ~OPf_KIDS;
3992 range->op_first = Nullop;
3994 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3995 listop->op_first->op_next = range->op_next;
3996 left->op_next = range->op_other;
3997 right->op_next = (OP*)listop;
3998 listop->op_next = listop->op_first;
4001 expr = (OP*)(listop);
4003 iterflags |= OPf_STACKED;
4006 expr = mod(force_list(expr), OP_GREPSTART);
4010 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
4011 append_elem(OP_LIST, expr, scalar(sv))));
4012 assert(!loop->op_next);
4013 #ifdef PL_OP_SLAB_ALLOC
4016 NewOp(1234,tmp,1,LOOP);
4017 Copy(loop,tmp,1,LOOP);
4021 Renew(loop, 1, LOOP);
4023 loop->op_targ = padoff;
4024 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
4025 PL_copline = forline;
4026 return newSTATEOP(0, label, wop);
4030 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4035 if (type != OP_GOTO || label->op_type == OP_CONST) {
4036 /* "last()" means "last" */
4037 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4038 o = newOP(type, OPf_SPECIAL);
4040 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
4041 ? SvPVx(((SVOP*)label)->op_sv, n_a)
4047 if (label->op_type == OP_ENTERSUB)
4048 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4049 o = newUNOP(type, OPf_STACKED, label);
4051 PL_hints |= HINT_BLOCK_SCOPE;
4056 Perl_cv_undef(pTHX_ CV *cv)
4060 MUTEX_DESTROY(CvMUTEXP(cv));
4061 Safefree(CvMUTEXP(cv));
4064 #endif /* USE_THREADS */
4066 if (!CvXSUB(cv) && CvROOT(cv)) {
4068 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4069 Perl_croak(aTHX_ "Can't undef active subroutine");
4072 Perl_croak(aTHX_ "Can't undef active subroutine");
4073 #endif /* USE_THREADS */
4076 SAVEVPTR(PL_curpad);
4080 op_free(CvROOT(cv));
4081 CvROOT(cv) = Nullop;
4084 SvPOK_off((SV*)cv); /* forget prototype */
4086 SvREFCNT_dec(CvGV(cv));
4088 SvREFCNT_dec(CvOUTSIDE(cv));
4089 CvOUTSIDE(cv) = Nullcv;
4091 SvREFCNT_dec((SV*)CvXSUBANY(cv).any_ptr);
4094 if (CvPADLIST(cv)) {
4095 /* may be during global destruction */
4096 if (SvREFCNT(CvPADLIST(cv))) {
4097 I32 i = AvFILLp(CvPADLIST(cv));
4099 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4100 SV* sv = svp ? *svp : Nullsv;
4103 if (sv == (SV*)PL_comppad_name)
4104 PL_comppad_name = Nullav;
4105 else if (sv == (SV*)PL_comppad) {
4106 PL_comppad = Nullav;
4107 PL_curpad = Null(SV**);
4111 SvREFCNT_dec((SV*)CvPADLIST(cv));
4113 CvPADLIST(cv) = Nullav;
4118 S_cv_dump(pTHX_ CV *cv)
4121 CV *outside = CvOUTSIDE(cv);
4122 AV* padlist = CvPADLIST(cv);
4129 PerlIO_printf(Perl_debug_log,
4130 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4132 (CvANON(cv) ? "ANON"
4133 : (cv == PL_main_cv) ? "MAIN"
4134 : CvUNIQUE(cv) ? "UNIQUE"
4135 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4138 : CvANON(outside) ? "ANON"
4139 : (outside == PL_main_cv) ? "MAIN"
4140 : CvUNIQUE(outside) ? "UNIQUE"
4141 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4146 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4147 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4148 pname = AvARRAY(pad_name);
4149 ppad = AvARRAY(pad);
4151 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4152 if (SvPOK(pname[ix]))
4153 PerlIO_printf(Perl_debug_log,
4154 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4155 (int)ix, PTR2UV(ppad[ix]),
4156 SvFAKE(pname[ix]) ? "FAKE " : "",
4158 (IV)I_32(SvNVX(pname[ix])),
4161 #endif /* DEBUGGING */
4165 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4169 AV* protopadlist = CvPADLIST(proto);
4170 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4171 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4172 SV** pname = AvARRAY(protopad_name);
4173 SV** ppad = AvARRAY(protopad);
4174 I32 fname = AvFILLp(protopad_name);
4175 I32 fpad = AvFILLp(protopad);
4179 assert(!CvUNIQUE(proto));
4183 SAVESPTR(PL_comppad_name);
4184 SAVESPTR(PL_compcv);
4186 cv = PL_compcv = (CV*)NEWSV(1104,0);
4187 sv_upgrade((SV *)cv, SvTYPE(proto));
4188 CvFLAGS(cv) = CvFLAGS(proto) & ~CVf_CLONE;
4192 New(666, CvMUTEXP(cv), 1, perl_mutex);
4193 MUTEX_INIT(CvMUTEXP(cv));
4195 #endif /* USE_THREADS */
4196 CvFILE(cv) = CvFILE(proto);
4197 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4198 CvSTASH(cv) = CvSTASH(proto);
4199 CvROOT(cv) = CvROOT(proto);
4200 CvSTART(cv) = CvSTART(proto);
4202 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4205 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4207 PL_comppad_name = newAV();
4208 for (ix = fname; ix >= 0; ix--)
4209 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4211 PL_comppad = newAV();
4213 comppadlist = newAV();
4214 AvREAL_off(comppadlist);
4215 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4216 av_store(comppadlist, 1, (SV*)PL_comppad);
4217 CvPADLIST(cv) = comppadlist;
4218 av_fill(PL_comppad, AvFILLp(protopad));
4219 PL_curpad = AvARRAY(PL_comppad);
4221 av = newAV(); /* will be @_ */
4223 av_store(PL_comppad, 0, (SV*)av);
4224 AvFLAGS(av) = AVf_REIFY;
4226 for (ix = fpad; ix > 0; ix--) {
4227 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4228 if (namesv && namesv != &PL_sv_undef) {
4229 char *name = SvPVX(namesv); /* XXX */
4230 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4231 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4232 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4234 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4236 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4238 else { /* our own lexical */
4241 /* anon code -- we'll come back for it */
4242 sv = SvREFCNT_inc(ppad[ix]);
4244 else if (*name == '@')
4246 else if (*name == '%')
4255 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4256 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4259 SV* sv = NEWSV(0,0);
4265 /* Now that vars are all in place, clone nested closures. */
4267 for (ix = fpad; ix > 0; ix--) {
4268 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4270 && namesv != &PL_sv_undef
4271 && !(SvFLAGS(namesv) & SVf_FAKE)
4272 && *SvPVX(namesv) == '&'
4273 && CvCLONE(ppad[ix]))
4275 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4276 SvREFCNT_dec(ppad[ix]);
4279 PL_curpad[ix] = (SV*)kid;
4283 #ifdef DEBUG_CLOSURES
4284 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4286 PerlIO_printf(Perl_debug_log, " from:\n");
4288 PerlIO_printf(Perl_debug_log, " to:\n");
4295 SV* const_sv = op_const_sv(CvSTART(cv), cv);
4297 /* constant sub () { $x } closing over $x - see lib/constant.pm */
4299 cv = newCONSTSUB(CvSTASH(proto), 0, const_sv);
4306 Perl_cv_clone(pTHX_ CV *proto)
4309 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4310 cv = cv_clone2(proto, CvOUTSIDE(proto));
4311 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4316 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4318 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4319 SV* msg = sv_newmortal();
4323 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4324 sv_setpv(msg, "Prototype mismatch:");
4326 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4328 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4329 sv_catpv(msg, " vs ");
4331 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4333 sv_catpv(msg, "none");
4334 Perl_warner(aTHX_ WARN_PROTOTYPE, "%"SVf, msg);
4338 static void const_sv_xsub(pTHXo_ CV* cv);
4341 =for apidoc cv_const_sv
4343 If C<cv> is a constant sub eligible for inlining. returns the constant
4344 value returned by the sub. Otherwise, returns NULL.
4346 Constant subs can be created with C<newCONSTSUB> or as described in
4347 L<perlsub/"Constant Functions">.
4352 Perl_cv_const_sv(pTHX_ CV *cv)
4354 if (!cv || !CvCONST(cv))
4356 return (SV*)CvXSUBANY(cv).any_ptr;
4360 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4367 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4368 o = cLISTOPo->op_first->op_sibling;
4370 for (; o; o = o->op_next) {
4371 OPCODE type = o->op_type;
4373 if (sv && o->op_next == o)
4375 if (o->op_next != o) {
4376 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4378 if (type == OP_DBSTATE)
4381 if (type == OP_LEAVESUB || type == OP_RETURN)
4385 if (type == OP_CONST && cSVOPo->op_sv)
4387 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4388 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4389 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4393 /* We get here only from cv_clone2() while creating a closure.
4394 Copy the const value here instead of in cv_clone2 so that
4395 SvREADONLY_on doesn't lead to problems when leaving
4400 if (!SvREADONLY(sv) && SvREFCNT(sv) > 1)
4412 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4422 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4426 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4428 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4432 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4438 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4443 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4444 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4445 SV *sv = sv_newmortal();
4446 Perl_sv_setpvf(aTHX_ sv, "__ANON__[%s:%"IVdf"]",
4447 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4452 gv = gv_fetchpv(name ? name : (aname ? aname : "__ANON__"),
4453 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4463 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4464 maximum a prototype before. */
4465 if (SvTYPE(gv) > SVt_NULL) {
4466 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4467 && ckWARN_d(WARN_PROTOTYPE))
4469 Perl_warner(aTHX_ WARN_PROTOTYPE, "Runaway prototype");
4471 cv_ckproto((CV*)gv, NULL, ps);
4474 sv_setpv((SV*)gv, ps);
4476 sv_setiv((SV*)gv, -1);
4477 SvREFCNT_dec(PL_compcv);
4478 cv = PL_compcv = NULL;
4479 PL_sub_generation++;
4483 cv = (!name || GvCVGEN(gv)) ? Nullcv : GvCV(gv);
4485 if (!block || !ps || *ps || attrs)
4488 const_sv = op_const_sv(block, Nullcv);
4491 bool exists = CvROOT(cv) || CvXSUB(cv);
4492 /* if the subroutine doesn't exist and wasn't pre-declared
4493 * with a prototype, assume it will be AUTOLOADed,
4494 * skipping the prototype check
4496 if (exists || SvPOK(cv))
4497 cv_ckproto(cv, gv, ps);
4498 /* already defined (or promised)? */
4499 if (exists || GvASSUMECV(gv)) {
4500 if (!block && !attrs) {
4501 /* just a "sub foo;" when &foo is already defined */
4502 SAVEFREESV(PL_compcv);
4505 /* ahem, death to those who redefine active sort subs */
4506 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4507 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4509 if (ckWARN(WARN_REDEFINE)
4511 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
4513 line_t oldline = CopLINE(PL_curcop);
4514 CopLINE_set(PL_curcop, PL_copline);
4515 Perl_warner(aTHX_ WARN_REDEFINE,
4516 CvCONST(cv) ? "Constant subroutine %s redefined"
4517 : "Subroutine %s redefined", name);
4518 CopLINE_set(PL_curcop, oldline);
4526 SvREFCNT_inc(const_sv);
4528 assert(!CvROOT(cv) && !CvCONST(cv));
4529 sv_setpv((SV*)cv, ""); /* prototype is "" */
4530 CvXSUBANY(cv).any_ptr = const_sv;
4531 CvXSUB(cv) = const_sv_xsub;
4536 cv = newCONSTSUB(NULL, name, const_sv);
4539 SvREFCNT_dec(PL_compcv);
4541 PL_sub_generation++;
4548 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4549 * before we clobber PL_compcv.
4553 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4554 stash = GvSTASH(CvGV(cv));
4555 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4556 stash = CvSTASH(cv);
4558 stash = PL_curstash;
4561 /* possibly about to re-define existing subr -- ignore old cv */
4562 rcv = (SV*)PL_compcv;
4563 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4564 stash = GvSTASH(gv);
4566 stash = PL_curstash;
4568 apply_attrs(stash, rcv, attrs);
4570 if (cv) { /* must reuse cv if autoloaded */
4572 /* got here with just attrs -- work done, so bug out */
4573 SAVEFREESV(PL_compcv);
4577 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4578 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4579 CvOUTSIDE(PL_compcv) = 0;
4580 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4581 CvPADLIST(PL_compcv) = 0;
4582 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4583 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4584 SvREFCNT_dec(PL_compcv);
4591 PL_sub_generation++;
4594 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4595 CvFILE(cv) = CopFILE(PL_curcop);
4596 CvSTASH(cv) = PL_curstash;
4599 if (!CvMUTEXP(cv)) {
4600 New(666, CvMUTEXP(cv), 1, perl_mutex);
4601 MUTEX_INIT(CvMUTEXP(cv));
4603 #endif /* USE_THREADS */
4606 sv_setpv((SV*)cv, ps);
4608 if (PL_error_count) {
4612 char *s = strrchr(name, ':');
4614 if (strEQ(s, "BEGIN")) {
4616 "BEGIN not safe after errors--compilation aborted";
4617 if (PL_in_eval & EVAL_KEEPERR)
4618 Perl_croak(aTHX_ not_safe);
4620 /* force display of errors found but not reported */
4621 sv_catpv(ERRSV, not_safe);
4622 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4630 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4631 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4634 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4637 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4639 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4640 OpREFCNT_set(CvROOT(cv), 1);
4641 CvSTART(cv) = LINKLIST(CvROOT(cv));
4642 CvROOT(cv)->op_next = 0;
4645 /* now that optimizer has done its work, adjust pad values */
4647 SV **namep = AvARRAY(PL_comppad_name);
4648 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4651 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4654 * The only things that a clonable function needs in its
4655 * pad are references to outer lexicals and anonymous subs.
4656 * The rest are created anew during cloning.
4658 if (!((namesv = namep[ix]) != Nullsv &&
4659 namesv != &PL_sv_undef &&
4661 *SvPVX(namesv) == '&')))
4663 SvREFCNT_dec(PL_curpad[ix]);
4664 PL_curpad[ix] = Nullsv;
4667 assert(!CvCONST(cv));
4668 if (ps && !*ps && op_const_sv(block, cv))
4672 AV *av = newAV(); /* Will be @_ */
4674 av_store(PL_comppad, 0, (SV*)av);
4675 AvFLAGS(av) = AVf_REIFY;
4677 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4678 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4680 if (!SvPADMY(PL_curpad[ix]))
4681 SvPADTMP_on(PL_curpad[ix]);
4685 if (name || aname) {
4687 char *tname = (name ? name : aname);
4689 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4690 SV *sv = NEWSV(0,0);
4691 SV *tmpstr = sv_newmortal();
4692 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4696 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4698 (long)PL_subline, (long)CopLINE(PL_curcop));
4699 gv_efullname3(tmpstr, gv, Nullch);
4700 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4701 hv = GvHVn(db_postponed);
4702 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4703 && (pcv = GvCV(db_postponed)))
4709 call_sv((SV*)pcv, G_DISCARD);
4713 if ((s = strrchr(tname,':')))
4718 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4721 if (strEQ(s, "BEGIN")) {
4722 I32 oldscope = PL_scopestack_ix;
4724 SAVECOPFILE(&PL_compiling);
4725 SAVECOPLINE(&PL_compiling);
4727 sv_setsv(PL_rs, PL_nrs);
4730 PL_beginav = newAV();
4731 DEBUG_x( dump_sub(gv) );
4732 av_push(PL_beginav, (SV*)cv);
4733 GvCV(gv) = 0; /* cv has been hijacked */
4734 call_list(oldscope, PL_beginav);
4736 PL_curcop = &PL_compiling;
4737 PL_compiling.op_private = PL_hints;
4740 else if (strEQ(s, "END") && !PL_error_count) {
4743 DEBUG_x( dump_sub(gv) );
4744 av_unshift(PL_endav, 1);
4745 av_store(PL_endav, 0, (SV*)cv);
4746 GvCV(gv) = 0; /* cv has been hijacked */
4748 else if (strEQ(s, "CHECK") && !PL_error_count) {
4750 PL_checkav = newAV();
4751 DEBUG_x( dump_sub(gv) );
4752 if (PL_main_start && ckWARN(WARN_VOID))
4753 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4754 av_unshift(PL_checkav, 1);
4755 av_store(PL_checkav, 0, (SV*)cv);
4756 GvCV(gv) = 0; /* cv has been hijacked */
4758 else if (strEQ(s, "INIT") && !PL_error_count) {
4760 PL_initav = newAV();
4761 DEBUG_x( dump_sub(gv) );
4762 if (PL_main_start && ckWARN(WARN_VOID))
4763 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4764 av_push(PL_initav, (SV*)cv);
4765 GvCV(gv) = 0; /* cv has been hijacked */
4770 PL_copline = NOLINE;
4775 /* XXX unsafe for threads if eval_owner isn't held */
4777 =for apidoc newCONSTSUB
4779 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4780 eligible for inlining at compile-time.
4786 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4792 SAVECOPLINE(PL_curcop);
4793 CopLINE_set(PL_curcop, PL_copline);
4796 PL_hints &= ~HINT_BLOCK_SCOPE;
4799 SAVESPTR(PL_curstash);
4800 SAVECOPSTASH(PL_curcop);
4801 PL_curstash = stash;
4803 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4805 CopSTASH(PL_curcop) = stash;
4809 cv = newXS(name, const_sv_xsub, __FILE__);
4810 CvXSUBANY(cv).any_ptr = sv;
4812 sv_setpv((SV*)cv, ""); /* prototype is "" */
4820 =for apidoc U||newXS
4822 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4828 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4830 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4833 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4835 /* just a cached method */
4839 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4840 /* already defined (or promised) */
4841 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4842 && HvNAME(GvSTASH(CvGV(cv)))
4843 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4844 line_t oldline = CopLINE(PL_curcop);
4845 if (PL_copline != NOLINE)
4846 CopLINE_set(PL_curcop, PL_copline);
4847 Perl_warner(aTHX_ WARN_REDEFINE,
4848 CvCONST(cv) ? "Constant subroutine %s redefined"
4849 : "Subroutine %s redefined"
4851 CopLINE_set(PL_curcop, oldline);
4858 if (cv) /* must reuse cv if autoloaded */
4861 cv = (CV*)NEWSV(1105,0);
4862 sv_upgrade((SV *)cv, SVt_PVCV);
4866 PL_sub_generation++;
4869 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4871 New(666, CvMUTEXP(cv), 1, perl_mutex);
4872 MUTEX_INIT(CvMUTEXP(cv));
4874 #endif /* USE_THREADS */
4875 (void)gv_fetchfile(filename);
4876 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4877 an external constant string */
4878 CvXSUB(cv) = subaddr;
4881 char *s = strrchr(name,':');
4887 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4890 if (strEQ(s, "BEGIN")) {
4892 PL_beginav = newAV();
4893 av_push(PL_beginav, (SV*)cv);
4894 GvCV(gv) = 0; /* cv has been hijacked */
4896 else if (strEQ(s, "END")) {
4899 av_unshift(PL_endav, 1);
4900 av_store(PL_endav, 0, (SV*)cv);
4901 GvCV(gv) = 0; /* cv has been hijacked */
4903 else if (strEQ(s, "CHECK")) {
4905 PL_checkav = newAV();
4906 if (PL_main_start && ckWARN(WARN_VOID))
4907 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4908 av_unshift(PL_checkav, 1);
4909 av_store(PL_checkav, 0, (SV*)cv);
4910 GvCV(gv) = 0; /* cv has been hijacked */
4912 else if (strEQ(s, "INIT")) {
4914 PL_initav = newAV();
4915 if (PL_main_start && ckWARN(WARN_VOID))
4916 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4917 av_push(PL_initav, (SV*)cv);
4918 GvCV(gv) = 0; /* cv has been hijacked */
4929 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4938 name = SvPVx(cSVOPo->op_sv, n_a);
4941 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4943 if ((cv = GvFORM(gv))) {
4944 if (ckWARN(WARN_REDEFINE)) {
4945 line_t oldline = CopLINE(PL_curcop);
4947 CopLINE_set(PL_curcop, PL_copline);
4948 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4949 CopLINE_set(PL_curcop, oldline);
4955 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4956 CvFILE(cv) = CopFILE(PL_curcop);
4958 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4959 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4960 SvPADTMP_on(PL_curpad[ix]);
4963 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4964 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4965 OpREFCNT_set(CvROOT(cv), 1);
4966 CvSTART(cv) = LINKLIST(CvROOT(cv));
4967 CvROOT(cv)->op_next = 0;
4970 PL_copline = NOLINE;
4975 Perl_newANONLIST(pTHX_ OP *o)
4977 return newUNOP(OP_REFGEN, 0,
4978 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4982 Perl_newANONHASH(pTHX_ OP *o)
4984 return newUNOP(OP_REFGEN, 0,
4985 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4989 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4991 return newANONATTRSUB(floor, proto, Nullop, block);
4995 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4997 return newUNOP(OP_REFGEN, 0,
4998 newSVOP(OP_ANONCODE, 0,
4999 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
5003 Perl_oopsAV(pTHX_ OP *o)
5005 switch (o->op_type) {
5007 o->op_type = OP_PADAV;
5008 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5009 return ref(o, OP_RV2AV);
5012 o->op_type = OP_RV2AV;
5013 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
5018 if (ckWARN_d(WARN_INTERNAL))
5019 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
5026 Perl_oopsHV(pTHX_ OP *o)
5028 switch (o->op_type) {
5031 o->op_type = OP_PADHV;
5032 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5033 return ref(o, OP_RV2HV);
5037 o->op_type = OP_RV2HV;
5038 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
5043 if (ckWARN_d(WARN_INTERNAL))
5044 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
5051 Perl_newAVREF(pTHX_ OP *o)
5053 if (o->op_type == OP_PADANY) {
5054 o->op_type = OP_PADAV;
5055 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5058 return newUNOP(OP_RV2AV, 0, scalar(o));
5062 Perl_newGVREF(pTHX_ I32 type, OP *o)
5064 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
5065 return newUNOP(OP_NULL, 0, o);
5066 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
5070 Perl_newHVREF(pTHX_ OP *o)
5072 if (o->op_type == OP_PADANY) {
5073 o->op_type = OP_PADHV;
5074 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5077 return newUNOP(OP_RV2HV, 0, scalar(o));
5081 Perl_oopsCV(pTHX_ OP *o)
5083 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5089 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5091 return newUNOP(OP_RV2CV, flags, scalar(o));
5095 Perl_newSVREF(pTHX_ OP *o)
5097 if (o->op_type == OP_PADANY) {
5098 o->op_type = OP_PADSV;
5099 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5102 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
5103 o->op_flags |= OPpDONE_SVREF;
5106 return newUNOP(OP_RV2SV, 0, scalar(o));
5109 /* Check routines. */
5112 Perl_ck_anoncode(pTHX_ OP *o)
5117 name = NEWSV(1106,0);
5118 sv_upgrade(name, SVt_PVNV);
5119 sv_setpvn(name, "&", 1);
5122 ix = pad_alloc(o->op_type, SVs_PADMY);
5123 av_store(PL_comppad_name, ix, name);
5124 av_store(PL_comppad, ix, cSVOPo->op_sv);
5125 SvPADMY_on(cSVOPo->op_sv);
5126 cSVOPo->op_sv = Nullsv;
5127 cSVOPo->op_targ = ix;
5132 Perl_ck_bitop(pTHX_ OP *o)
5134 o->op_private = PL_hints;
5139 Perl_ck_concat(pTHX_ OP *o)
5141 if (cUNOPo->op_first->op_type == OP_CONCAT)
5142 o->op_flags |= OPf_STACKED;
5147 Perl_ck_spair(pTHX_ OP *o)
5149 if (o->op_flags & OPf_KIDS) {
5152 OPCODE type = o->op_type;
5153 o = modkids(ck_fun(o), type);
5154 kid = cUNOPo->op_first;
5155 newop = kUNOP->op_first->op_sibling;
5157 (newop->op_sibling ||
5158 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5159 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5160 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5164 op_free(kUNOP->op_first);
5165 kUNOP->op_first = newop;
5167 o->op_ppaddr = PL_ppaddr[++o->op_type];
5172 Perl_ck_delete(pTHX_ OP *o)
5176 if (o->op_flags & OPf_KIDS) {
5177 OP *kid = cUNOPo->op_first;
5178 switch (kid->op_type) {
5180 o->op_flags |= OPf_SPECIAL;
5183 o->op_private |= OPpSLICE;
5186 o->op_flags |= OPf_SPECIAL;
5191 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5192 PL_op_desc[o->op_type]);
5200 Perl_ck_eof(pTHX_ OP *o)
5202 I32 type = o->op_type;
5204 if (o->op_flags & OPf_KIDS) {
5205 if (cLISTOPo->op_first->op_type == OP_STUB) {
5207 o = newUNOP(type, OPf_SPECIAL,
5208 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5216 Perl_ck_eval(pTHX_ OP *o)
5218 PL_hints |= HINT_BLOCK_SCOPE;
5219 if (o->op_flags & OPf_KIDS) {
5220 SVOP *kid = (SVOP*)cUNOPo->op_first;
5223 o->op_flags &= ~OPf_KIDS;
5226 else if (kid->op_type == OP_LINESEQ) {
5229 kid->op_next = o->op_next;
5230 cUNOPo->op_first = 0;
5233 NewOp(1101, enter, 1, LOGOP);
5234 enter->op_type = OP_ENTERTRY;
5235 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5236 enter->op_private = 0;
5238 /* establish postfix order */
5239 enter->op_next = (OP*)enter;
5241 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5242 o->op_type = OP_LEAVETRY;
5243 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5244 enter->op_other = o;
5252 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5254 o->op_targ = (PADOFFSET)PL_hints;
5259 Perl_ck_exit(pTHX_ OP *o)
5262 HV *table = GvHV(PL_hintgv);
5264 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
5265 if (svp && *svp && SvTRUE(*svp))
5266 o->op_private |= OPpEXIT_VMSISH;
5273 Perl_ck_exec(pTHX_ OP *o)
5276 if (o->op_flags & OPf_STACKED) {
5278 kid = cUNOPo->op_first->op_sibling;
5279 if (kid->op_type == OP_RV2GV)
5288 Perl_ck_exists(pTHX_ OP *o)
5291 if (o->op_flags & OPf_KIDS) {
5292 OP *kid = cUNOPo->op_first;
5293 if (kid->op_type == OP_ENTERSUB) {
5294 (void) ref(kid, o->op_type);
5295 if (kid->op_type != OP_RV2CV && !PL_error_count)
5296 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5297 PL_op_desc[o->op_type]);
5298 o->op_private |= OPpEXISTS_SUB;
5300 else if (kid->op_type == OP_AELEM)
5301 o->op_flags |= OPf_SPECIAL;
5302 else if (kid->op_type != OP_HELEM)
5303 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5304 PL_op_desc[o->op_type]);
5312 Perl_ck_gvconst(pTHX_ register OP *o)
5314 o = fold_constants(o);
5315 if (o->op_type == OP_CONST)
5322 Perl_ck_rvconst(pTHX_ register OP *o)
5324 SVOP *kid = (SVOP*)cUNOPo->op_first;
5326 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5327 if (kid->op_type == OP_CONST) {
5331 SV *kidsv = kid->op_sv;
5334 /* Is it a constant from cv_const_sv()? */
5335 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5336 SV *rsv = SvRV(kidsv);
5337 int svtype = SvTYPE(rsv);
5338 char *badtype = Nullch;
5340 switch (o->op_type) {
5342 if (svtype > SVt_PVMG)
5343 badtype = "a SCALAR";
5346 if (svtype != SVt_PVAV)
5347 badtype = "an ARRAY";
5350 if (svtype != SVt_PVHV) {
5351 if (svtype == SVt_PVAV) { /* pseudohash? */
5352 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5353 if (ksv && SvROK(*ksv)
5354 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5363 if (svtype != SVt_PVCV)
5368 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5371 name = SvPV(kidsv, n_a);
5372 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5373 char *badthing = Nullch;
5374 switch (o->op_type) {
5376 badthing = "a SCALAR";
5379 badthing = "an ARRAY";
5382 badthing = "a HASH";
5387 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5391 * This is a little tricky. We only want to add the symbol if we
5392 * didn't add it in the lexer. Otherwise we get duplicate strict
5393 * warnings. But if we didn't add it in the lexer, we must at
5394 * least pretend like we wanted to add it even if it existed before,
5395 * or we get possible typo warnings. OPpCONST_ENTERED says
5396 * whether the lexer already added THIS instance of this symbol.
5398 iscv = (o->op_type == OP_RV2CV) * 2;
5400 gv = gv_fetchpv(name,
5401 iscv | !(kid->op_private & OPpCONST_ENTERED),
5404 : o->op_type == OP_RV2SV
5406 : o->op_type == OP_RV2AV
5408 : o->op_type == OP_RV2HV
5411 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5413 kid->op_type = OP_GV;
5414 SvREFCNT_dec(kid->op_sv);
5416 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5417 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5418 SvREFCNT_dec(PL_curpad[kPADOP->op_padix]);
5420 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5422 kid->op_sv = SvREFCNT_inc(gv);
5424 kid->op_ppaddr = PL_ppaddr[OP_GV];
5431 Perl_ck_ftst(pTHX_ OP *o)
5433 I32 type = o->op_type;
5435 if (o->op_flags & OPf_REF) {
5438 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5439 SVOP *kid = (SVOP*)cUNOPo->op_first;
5441 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5443 OP *newop = newGVOP(type, OPf_REF,
5444 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5451 if (type == OP_FTTTY)
5452 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5455 o = newUNOP(type, 0, newDEFSVOP());
5458 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5460 if (PL_hints & HINT_LOCALE)
5461 o->op_private |= OPpLOCALE;
5468 Perl_ck_fun(pTHX_ OP *o)
5474 int type = o->op_type;
5475 register I32 oa = PL_opargs[type] >> OASHIFT;
5477 if (o->op_flags & OPf_STACKED) {
5478 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5481 return no_fh_allowed(o);
5484 if (o->op_flags & OPf_KIDS) {
5486 tokid = &cLISTOPo->op_first;
5487 kid = cLISTOPo->op_first;
5488 if (kid->op_type == OP_PUSHMARK ||
5489 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5491 tokid = &kid->op_sibling;
5492 kid = kid->op_sibling;
5494 if (!kid && PL_opargs[type] & OA_DEFGV)
5495 *tokid = kid = newDEFSVOP();
5499 sibl = kid->op_sibling;
5502 /* list seen where single (scalar) arg expected? */
5503 if (numargs == 1 && !(oa >> 4)
5504 && kid->op_type == OP_LIST && type != OP_SCALAR)
5506 return too_many_arguments(o,PL_op_desc[type]);
5519 if (kid->op_type == OP_CONST &&
5520 (kid->op_private & OPpCONST_BARE))
5522 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5523 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5524 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5525 if (ckWARN(WARN_DEPRECATED))
5526 Perl_warner(aTHX_ WARN_DEPRECATED,
5527 "Array @%s missing the @ in argument %"IVdf" of %s()",
5528 name, (IV)numargs, PL_op_desc[type]);
5531 kid->op_sibling = sibl;
5534 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5535 bad_type(numargs, "array", PL_op_desc[type], kid);
5539 if (kid->op_type == OP_CONST &&
5540 (kid->op_private & OPpCONST_BARE))
5542 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5543 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5544 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5545 if (ckWARN(WARN_DEPRECATED))
5546 Perl_warner(aTHX_ WARN_DEPRECATED,
5547 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5548 name, (IV)numargs, PL_op_desc[type]);
5551 kid->op_sibling = sibl;
5554 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5555 bad_type(numargs, "hash", PL_op_desc[type], kid);
5560 OP *newop = newUNOP(OP_NULL, 0, kid);
5561 kid->op_sibling = 0;
5563 newop->op_next = newop;
5565 kid->op_sibling = sibl;
5570 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5571 if (kid->op_type == OP_CONST &&
5572 (kid->op_private & OPpCONST_BARE))
5574 OP *newop = newGVOP(OP_GV, 0,
5575 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5580 else if (kid->op_type == OP_READLINE) {
5581 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5582 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5585 I32 flags = OPf_SPECIAL;
5589 /* is this op a FH constructor? */
5590 if (is_handle_constructor(o,numargs)) {
5591 char *name = Nullch;
5595 /* Set a flag to tell rv2gv to vivify
5596 * need to "prove" flag does not mean something
5597 * else already - NI-S 1999/05/07
5600 if (kid->op_type == OP_PADSV) {
5601 SV **namep = av_fetch(PL_comppad_name,
5603 if (namep && *namep)
5604 name = SvPV(*namep, len);
5606 else if (kid->op_type == OP_RV2SV
5607 && kUNOP->op_first->op_type == OP_GV)
5609 GV *gv = cGVOPx_gv(kUNOP->op_first);
5611 len = GvNAMELEN(gv);
5613 else if (kid->op_type == OP_AELEM
5614 || kid->op_type == OP_HELEM)
5616 name = "__ANONIO__";
5622 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5623 namesv = PL_curpad[targ];
5624 (void)SvUPGRADE(namesv, SVt_PV);
5626 sv_setpvn(namesv, "$", 1);
5627 sv_catpvn(namesv, name, len);
5630 kid->op_sibling = 0;
5631 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5632 kid->op_targ = targ;
5633 kid->op_private |= priv;
5635 kid->op_sibling = sibl;
5641 mod(scalar(kid), type);
5645 tokid = &kid->op_sibling;
5646 kid = kid->op_sibling;
5648 o->op_private |= numargs;
5650 return too_many_arguments(o,PL_op_desc[o->op_type]);
5653 else if (PL_opargs[type] & OA_DEFGV) {
5655 return newUNOP(type, 0, newDEFSVOP());
5659 while (oa & OA_OPTIONAL)
5661 if (oa && oa != OA_LIST)
5662 return too_few_arguments(o,PL_op_desc[o->op_type]);
5668 Perl_ck_glob(pTHX_ OP *o)
5673 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5674 append_elem(OP_GLOB, o, newDEFSVOP());
5676 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5677 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5679 #if !defined(PERL_EXTERNAL_GLOB)
5680 /* XXX this can be tightened up and made more failsafe. */
5683 Perl_load_module(aTHX_ 0, newSVpvn("File::Glob", 10), Nullsv,
5684 /* null-terminated import list */
5685 newSVpvn(":globally", 9), Nullsv);
5686 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5689 #endif /* PERL_EXTERNAL_GLOB */
5691 if (gv && GvIMPORTED_CV(gv)) {
5692 append_elem(OP_GLOB, o,
5693 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5694 o->op_type = OP_LIST;
5695 o->op_ppaddr = PL_ppaddr[OP_LIST];
5696 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5697 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5698 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5699 append_elem(OP_LIST, o,
5700 scalar(newUNOP(OP_RV2CV, 0,
5701 newGVOP(OP_GV, 0, gv)))));
5702 o = newUNOP(OP_NULL, 0, ck_subr(o));
5703 o->op_targ = OP_GLOB; /* hint at what it used to be */
5706 gv = newGVgen("main");
5708 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5714 Perl_ck_grep(pTHX_ OP *o)
5718 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5720 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5721 NewOp(1101, gwop, 1, LOGOP);
5723 if (o->op_flags & OPf_STACKED) {
5726 kid = cLISTOPo->op_first->op_sibling;
5727 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5730 kid->op_next = (OP*)gwop;
5731 o->op_flags &= ~OPf_STACKED;
5733 kid = cLISTOPo->op_first->op_sibling;
5734 if (type == OP_MAPWHILE)
5741 kid = cLISTOPo->op_first->op_sibling;
5742 if (kid->op_type != OP_NULL)
5743 Perl_croak(aTHX_ "panic: ck_grep");
5744 kid = kUNOP->op_first;
5746 gwop->op_type = type;
5747 gwop->op_ppaddr = PL_ppaddr[type];
5748 gwop->op_first = listkids(o);
5749 gwop->op_flags |= OPf_KIDS;
5750 gwop->op_private = 1;
5751 gwop->op_other = LINKLIST(kid);
5752 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5753 kid->op_next = (OP*)gwop;
5755 kid = cLISTOPo->op_first->op_sibling;
5756 if (!kid || !kid->op_sibling)
5757 return too_few_arguments(o,PL_op_desc[o->op_type]);
5758 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5759 mod(kid, OP_GREPSTART);
5765 Perl_ck_index(pTHX_ OP *o)
5767 if (o->op_flags & OPf_KIDS) {
5768 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5770 kid = kid->op_sibling; /* get past "big" */
5771 if (kid && kid->op_type == OP_CONST)
5772 fbm_compile(((SVOP*)kid)->op_sv, 0);
5778 Perl_ck_lengthconst(pTHX_ OP *o)
5780 /* XXX length optimization goes here */
5785 Perl_ck_lfun(pTHX_ OP *o)
5787 OPCODE type = o->op_type;
5788 return modkids(ck_fun(o), type);
5792 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5794 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5795 switch (cUNOPo->op_first->op_type) {
5797 /* This is needed for
5798 if (defined %stash::)
5799 to work. Do not break Tk.
5801 break; /* Globals via GV can be undef */
5803 case OP_AASSIGN: /* Is this a good idea? */
5804 Perl_warner(aTHX_ WARN_DEPRECATED,
5805 "defined(@array) is deprecated");
5806 Perl_warner(aTHX_ WARN_DEPRECATED,
5807 "\t(Maybe you should just omit the defined()?)\n");
5810 /* This is needed for
5811 if (defined %stash::)
5812 to work. Do not break Tk.
5814 break; /* Globals via GV can be undef */
5816 Perl_warner(aTHX_ WARN_DEPRECATED,
5817 "defined(%%hash) is deprecated");
5818 Perl_warner(aTHX_ WARN_DEPRECATED,
5819 "\t(Maybe you should just omit the defined()?)\n");
5830 Perl_ck_rfun(pTHX_ OP *o)
5832 OPCODE type = o->op_type;
5833 return refkids(ck_fun(o), type);
5837 Perl_ck_listiob(pTHX_ OP *o)
5841 kid = cLISTOPo->op_first;
5844 kid = cLISTOPo->op_first;
5846 if (kid->op_type == OP_PUSHMARK)
5847 kid = kid->op_sibling;
5848 if (kid && o->op_flags & OPf_STACKED)
5849 kid = kid->op_sibling;
5850 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5851 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5852 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5853 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5854 cLISTOPo->op_first->op_sibling = kid;
5855 cLISTOPo->op_last = kid;
5856 kid = kid->op_sibling;
5861 append_elem(o->op_type, o, newDEFSVOP());
5867 if (PL_hints & HINT_LOCALE)
5868 o->op_private |= OPpLOCALE;
5875 Perl_ck_fun_locale(pTHX_ OP *o)
5881 if (PL_hints & HINT_LOCALE)
5882 o->op_private |= OPpLOCALE;
5889 Perl_ck_sassign(pTHX_ OP *o)
5891 OP *kid = cLISTOPo->op_first;
5892 /* has a disposable target? */
5893 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5894 && !(kid->op_flags & OPf_STACKED)
5895 /* Cannot steal the second time! */
5896 && !(kid->op_private & OPpTARGET_MY))
5898 OP *kkid = kid->op_sibling;
5900 /* Can just relocate the target. */
5901 if (kkid && kkid->op_type == OP_PADSV
5902 && !(kkid->op_private & OPpLVAL_INTRO))
5904 kid->op_targ = kkid->op_targ;
5906 /* Now we do not need PADSV and SASSIGN. */
5907 kid->op_sibling = o->op_sibling; /* NULL */
5908 cLISTOPo->op_first = NULL;
5911 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5919 Perl_ck_scmp(pTHX_ OP *o)
5923 if (PL_hints & HINT_LOCALE)
5924 o->op_private |= OPpLOCALE;
5931 Perl_ck_match(pTHX_ OP *o)
5933 o->op_private |= OPpRUNTIME;
5938 Perl_ck_method(pTHX_ OP *o)
5940 OP *kid = cUNOPo->op_first;
5941 if (kid->op_type == OP_CONST) {
5942 SV* sv = kSVOP->op_sv;
5943 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5945 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
5946 sv = newSVpvn_share(SvPVX(sv), SvCUR(sv), 0);
5949 kSVOP->op_sv = Nullsv;
5951 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5960 Perl_ck_null(pTHX_ OP *o)
5966 Perl_ck_open(pTHX_ OP *o)
5968 HV *table = GvHV(PL_hintgv);
5972 svp = hv_fetch(table, "open_IN", 7, FALSE);
5974 mode = mode_from_discipline(*svp);
5975 if (mode & O_BINARY)
5976 o->op_private |= OPpOPEN_IN_RAW;
5977 else if (mode & O_TEXT)
5978 o->op_private |= OPpOPEN_IN_CRLF;
5981 svp = hv_fetch(table, "open_OUT", 8, FALSE);
5983 mode = mode_from_discipline(*svp);
5984 if (mode & O_BINARY)
5985 o->op_private |= OPpOPEN_OUT_RAW;
5986 else if (mode & O_TEXT)
5987 o->op_private |= OPpOPEN_OUT_CRLF;
5990 if (o->op_type == OP_BACKTICK)
5996 Perl_ck_repeat(pTHX_ OP *o)
5998 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5999 o->op_private |= OPpREPEAT_DOLIST;
6000 cBINOPo->op_first = force_list(cBINOPo->op_first);
6008 Perl_ck_require(pTHX_ OP *o)
6010 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
6011 SVOP *kid = (SVOP*)cUNOPo->op_first;
6013 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6015 for (s = SvPVX(kid->op_sv); *s; s++) {
6016 if (*s == ':' && s[1] == ':') {
6018 Move(s+2, s+1, strlen(s+2)+1, char);
6019 --SvCUR(kid->op_sv);
6022 if (SvREADONLY(kid->op_sv)) {
6023 SvREADONLY_off(kid->op_sv);
6024 sv_catpvn(kid->op_sv, ".pm", 3);
6025 SvREADONLY_on(kid->op_sv);
6028 sv_catpvn(kid->op_sv, ".pm", 3);
6036 Perl_ck_retarget(pTHX_ OP *o)
6038 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
6045 Perl_ck_select(pTHX_ OP *o)
6048 if (o->op_flags & OPf_KIDS) {
6049 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6050 if (kid && kid->op_sibling) {
6051 o->op_type = OP_SSELECT;
6052 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
6054 return fold_constants(o);
6058 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6059 if (kid && kid->op_type == OP_RV2GV)
6060 kid->op_private &= ~HINT_STRICT_REFS;
6065 Perl_ck_shift(pTHX_ OP *o)
6067 I32 type = o->op_type;
6069 if (!(o->op_flags & OPf_KIDS)) {
6074 if (!CvUNIQUE(PL_compcv)) {
6075 argop = newOP(OP_PADAV, OPf_REF);
6076 argop->op_targ = 0; /* PL_curpad[0] is @_ */
6079 argop = newUNOP(OP_RV2AV, 0,
6080 scalar(newGVOP(OP_GV, 0,
6081 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6084 argop = newUNOP(OP_RV2AV, 0,
6085 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
6086 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6087 #endif /* USE_THREADS */
6088 return newUNOP(type, 0, scalar(argop));
6090 return scalar(modkids(ck_fun(o), type));
6094 Perl_ck_sort(pTHX_ OP *o)
6099 if (PL_hints & HINT_LOCALE)
6100 o->op_private |= OPpLOCALE;
6103 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
6105 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6106 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
6108 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
6110 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
6112 if (kid->op_type == OP_SCOPE) {
6116 else if (kid->op_type == OP_LEAVE) {
6117 if (o->op_type == OP_SORT) {
6118 null(kid); /* wipe out leave */
6121 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
6122 if (k->op_next == kid)
6124 /* don't descend into loops */
6125 else if (k->op_type == OP_ENTERLOOP
6126 || k->op_type == OP_ENTERITER)
6128 k = cLOOPx(k)->op_lastop;
6133 kid->op_next = 0; /* just disconnect the leave */
6134 k = kLISTOP->op_first;
6139 if (o->op_type == OP_SORT) {
6140 /* provide scalar context for comparison function/block */
6146 o->op_flags |= OPf_SPECIAL;
6148 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
6151 firstkid = firstkid->op_sibling;
6154 /* provide list context for arguments */
6155 if (o->op_type == OP_SORT)
6162 S_simplify_sort(pTHX_ OP *o)
6164 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6168 if (!(o->op_flags & OPf_STACKED))
6170 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
6171 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
6172 kid = kUNOP->op_first; /* get past null */
6173 if (kid->op_type != OP_SCOPE)
6175 kid = kLISTOP->op_last; /* get past scope */
6176 switch(kid->op_type) {
6184 k = kid; /* remember this node*/
6185 if (kBINOP->op_first->op_type != OP_RV2SV)
6187 kid = kBINOP->op_first; /* get past cmp */
6188 if (kUNOP->op_first->op_type != OP_GV)
6190 kid = kUNOP->op_first; /* get past rv2sv */
6192 if (GvSTASH(gv) != PL_curstash)
6194 if (strEQ(GvNAME(gv), "a"))
6196 else if (strEQ(GvNAME(gv), "b"))
6200 kid = k; /* back to cmp */
6201 if (kBINOP->op_last->op_type != OP_RV2SV)
6203 kid = kBINOP->op_last; /* down to 2nd arg */
6204 if (kUNOP->op_first->op_type != OP_GV)
6206 kid = kUNOP->op_first; /* get past rv2sv */
6208 if (GvSTASH(gv) != PL_curstash
6210 ? strNE(GvNAME(gv), "a")
6211 : strNE(GvNAME(gv), "b")))
6213 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6215 o->op_private |= OPpSORT_REVERSE;
6216 if (k->op_type == OP_NCMP)
6217 o->op_private |= OPpSORT_NUMERIC;
6218 if (k->op_type == OP_I_NCMP)
6219 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6220 kid = cLISTOPo->op_first->op_sibling;
6221 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6222 op_free(kid); /* then delete it */
6223 cLISTOPo->op_children--;
6227 Perl_ck_split(pTHX_ OP *o)
6231 if (o->op_flags & OPf_STACKED)
6232 return no_fh_allowed(o);
6234 kid = cLISTOPo->op_first;
6235 if (kid->op_type != OP_NULL)
6236 Perl_croak(aTHX_ "panic: ck_split");
6237 kid = kid->op_sibling;
6238 op_free(cLISTOPo->op_first);
6239 cLISTOPo->op_first = kid;
6241 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6242 cLISTOPo->op_last = kid; /* There was only one element previously */
6245 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
6246 OP *sibl = kid->op_sibling;
6247 kid->op_sibling = 0;
6248 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6249 if (cLISTOPo->op_first == cLISTOPo->op_last)
6250 cLISTOPo->op_last = kid;
6251 cLISTOPo->op_first = kid;
6252 kid->op_sibling = sibl;
6255 kid->op_type = OP_PUSHRE;
6256 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6259 if (!kid->op_sibling)
6260 append_elem(OP_SPLIT, o, newDEFSVOP());
6262 kid = kid->op_sibling;
6265 if (!kid->op_sibling)
6266 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6268 kid = kid->op_sibling;
6271 if (kid->op_sibling)
6272 return too_many_arguments(o,PL_op_desc[o->op_type]);
6278 Perl_ck_join(pTHX_ OP *o)
6280 if (ckWARN(WARN_SYNTAX)) {
6281 OP *kid = cLISTOPo->op_first->op_sibling;
6282 if (kid && kid->op_type == OP_MATCH) {
6283 char *pmstr = "STRING";
6284 if (kPMOP->op_pmregexp)
6285 pmstr = kPMOP->op_pmregexp->precomp;
6286 Perl_warner(aTHX_ WARN_SYNTAX,
6287 "/%s/ should probably be written as \"%s\"",
6295 Perl_ck_subr(pTHX_ OP *o)
6297 OP *prev = ((cUNOPo->op_first->op_sibling)
6298 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6299 OP *o2 = prev->op_sibling;
6308 o->op_private |= OPpENTERSUB_HASTARG;
6309 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6310 if (cvop->op_type == OP_RV2CV) {
6312 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6313 null(cvop); /* disable rv2cv */
6314 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6315 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6316 GV *gv = cGVOPx_gv(tmpop);
6319 tmpop->op_private |= OPpEARLY_CV;
6320 else if (SvPOK(cv)) {
6321 namegv = CvANON(cv) ? gv : CvGV(cv);
6322 proto = SvPV((SV*)cv, n_a);
6326 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6327 if (o2->op_type == OP_CONST)
6328 o2->op_private &= ~OPpCONST_STRICT;
6329 else if (o2->op_type == OP_LIST) {
6330 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6331 if (o && o->op_type == OP_CONST)
6332 o->op_private &= ~OPpCONST_STRICT;
6335 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6336 if (PERLDB_SUB && PL_curstash != PL_debstash)
6337 o->op_private |= OPpENTERSUB_DB;
6338 while (o2 != cvop) {
6342 return too_many_arguments(o, gv_ename(namegv));
6360 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6362 arg == 1 ? "block or sub {}" : "sub {}",
6363 gv_ename(namegv), o2);
6366 /* '*' allows any scalar type, including bareword */
6369 if (o2->op_type == OP_RV2GV)
6370 goto wrapref; /* autoconvert GLOB -> GLOBref */
6371 else if (o2->op_type == OP_CONST)
6372 o2->op_private &= ~OPpCONST_STRICT;
6373 else if (o2->op_type == OP_ENTERSUB) {
6374 /* accidental subroutine, revert to bareword */
6375 OP *gvop = ((UNOP*)o2)->op_first;
6376 if (gvop && gvop->op_type == OP_NULL) {
6377 gvop = ((UNOP*)gvop)->op_first;
6379 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6382 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6383 (gvop = ((UNOP*)gvop)->op_first) &&
6384 gvop->op_type == OP_GV)
6386 GV *gv = cGVOPx_gv(gvop);
6387 OP *sibling = o2->op_sibling;
6388 SV *n = newSVpvn("",0);
6390 gv_fullname3(n, gv, "");
6391 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6392 sv_chop(n, SvPVX(n)+6);
6393 o2 = newSVOP(OP_CONST, 0, n);
6394 prev->op_sibling = o2;
6395 o2->op_sibling = sibling;
6407 if (o2->op_type != OP_RV2GV)
6408 bad_type(arg, "symbol", gv_ename(namegv), o2);
6411 if (o2->op_type != OP_ENTERSUB)
6412 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6415 if (o2->op_type != OP_RV2SV
6416 && o2->op_type != OP_PADSV
6417 && o2->op_type != OP_HELEM
6418 && o2->op_type != OP_AELEM
6419 && o2->op_type != OP_THREADSV)
6421 bad_type(arg, "scalar", gv_ename(namegv), o2);
6425 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6426 bad_type(arg, "array", gv_ename(namegv), o2);
6429 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6430 bad_type(arg, "hash", gv_ename(namegv), o2);
6434 OP* sib = kid->op_sibling;
6435 kid->op_sibling = 0;
6436 o2 = newUNOP(OP_REFGEN, 0, kid);
6437 o2->op_sibling = sib;
6438 prev->op_sibling = o2;
6449 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6450 gv_ename(namegv), SvPV((SV*)cv, n_a));
6455 mod(o2, OP_ENTERSUB);
6457 o2 = o2->op_sibling;
6459 if (proto && !optional &&
6460 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6461 return too_few_arguments(o, gv_ename(namegv));
6466 Perl_ck_svconst(pTHX_ OP *o)
6468 SvREADONLY_on(cSVOPo->op_sv);
6473 Perl_ck_trunc(pTHX_ OP *o)
6475 if (o->op_flags & OPf_KIDS) {
6476 SVOP *kid = (SVOP*)cUNOPo->op_first;
6478 if (kid->op_type == OP_NULL)
6479 kid = (SVOP*)kid->op_sibling;
6480 if (kid && kid->op_type == OP_CONST &&
6481 (kid->op_private & OPpCONST_BARE))
6483 o->op_flags |= OPf_SPECIAL;
6484 kid->op_private &= ~OPpCONST_STRICT;
6491 Perl_ck_substr(pTHX_ OP *o)
6494 if ((o->op_flags & OPf_KIDS) && o->op_private == 4) {
6495 OP *kid = cLISTOPo->op_first;
6497 if (kid->op_type == OP_NULL)
6498 kid = kid->op_sibling;
6500 kid->op_flags |= OPf_MOD;
6506 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6509 Perl_peep(pTHX_ register OP *o)
6511 register OP* oldop = 0;
6513 OP *last_composite = Nullop;
6515 if (!o || o->op_seq)
6519 SAVEVPTR(PL_curcop);
6520 for (; o; o = o->op_next) {
6526 switch (o->op_type) {
6530 PL_curcop = ((COP*)o); /* for warnings */
6531 o->op_seq = PL_op_seqmax++;
6532 last_composite = Nullop;
6536 if (cSVOPo->op_private & OPpCONST_STRICT)
6537 no_bareword_allowed(o);
6539 /* Relocate sv to the pad for thread safety.
6540 * Despite being a "constant", the SV is written to,
6541 * for reference counts, sv_upgrade() etc. */
6543 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6544 if (SvPADTMP(cSVOPo->op_sv)) {
6545 /* If op_sv is already a PADTMP then it is being used by
6546 * some pad, so make a copy. */
6547 sv_setsv(PL_curpad[ix],cSVOPo->op_sv);
6548 SvREADONLY_on(PL_curpad[ix]);
6549 SvREFCNT_dec(cSVOPo->op_sv);
6552 SvREFCNT_dec(PL_curpad[ix]);
6553 SvPADTMP_on(cSVOPo->op_sv);
6554 PL_curpad[ix] = cSVOPo->op_sv;
6555 /* XXX I don't know how this isn't readonly already. */
6556 SvREADONLY_on(PL_curpad[ix]);
6558 cSVOPo->op_sv = Nullsv;
6562 o->op_seq = PL_op_seqmax++;
6566 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6567 if (o->op_next->op_private & OPpTARGET_MY) {
6568 if (o->op_flags & OPf_STACKED) /* chained concats */
6569 goto ignore_optimization;
6571 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6572 o->op_targ = o->op_next->op_targ;
6573 o->op_next->op_targ = 0;
6574 o->op_private |= OPpTARGET_MY;
6579 ignore_optimization:
6580 o->op_seq = PL_op_seqmax++;
6583 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6584 o->op_seq = PL_op_seqmax++;
6585 break; /* Scalar stub must produce undef. List stub is noop */
6589 if (o->op_targ == OP_NEXTSTATE
6590 || o->op_targ == OP_DBSTATE
6591 || o->op_targ == OP_SETSTATE)
6593 PL_curcop = ((COP*)o);
6600 if (oldop && o->op_next) {
6601 oldop->op_next = o->op_next;
6604 o->op_seq = PL_op_seqmax++;
6608 if (o->op_next->op_type == OP_RV2SV) {
6609 if (!(o->op_next->op_private & OPpDEREF)) {
6611 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6613 o->op_next = o->op_next->op_next;
6614 o->op_type = OP_GVSV;
6615 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6618 else if (o->op_next->op_type == OP_RV2AV) {
6619 OP* pop = o->op_next->op_next;
6621 if (pop->op_type == OP_CONST &&
6622 (PL_op = pop->op_next) &&
6623 pop->op_next->op_type == OP_AELEM &&
6624 !(pop->op_next->op_private &
6625 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6626 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6634 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6635 o->op_next = pop->op_next->op_next;
6636 o->op_type = OP_AELEMFAST;
6637 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6638 o->op_private = (U8)i;
6643 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6645 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6646 /* XXX could check prototype here instead of just carping */
6647 SV *sv = sv_newmortal();
6648 gv_efullname3(sv, gv, Nullch);
6649 Perl_warner(aTHX_ WARN_PROTOTYPE,
6650 "%s() called too early to check prototype",
6655 o->op_seq = PL_op_seqmax++;
6666 o->op_seq = PL_op_seqmax++;
6667 while (cLOGOP->op_other->op_type == OP_NULL)
6668 cLOGOP->op_other = cLOGOP->op_other->op_next;
6669 peep(cLOGOP->op_other);
6673 o->op_seq = PL_op_seqmax++;
6674 peep(cLOOP->op_redoop);
6675 peep(cLOOP->op_nextop);
6676 peep(cLOOP->op_lastop);
6682 o->op_seq = PL_op_seqmax++;
6683 peep(cPMOP->op_pmreplstart);
6687 o->op_seq = PL_op_seqmax++;
6688 if (ckWARN(WARN_SYNTAX) && o->op_next
6689 && o->op_next->op_type == OP_NEXTSTATE) {
6690 if (o->op_next->op_sibling &&
6691 o->op_next->op_sibling->op_type != OP_EXIT &&
6692 o->op_next->op_sibling->op_type != OP_WARN &&
6693 o->op_next->op_sibling->op_type != OP_DIE) {
6694 line_t oldline = CopLINE(PL_curcop);
6696 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6697 Perl_warner(aTHX_ WARN_EXEC,
6698 "Statement unlikely to be reached");
6699 Perl_warner(aTHX_ WARN_EXEC,
6700 "\t(Maybe you meant system() when you said exec()?)\n");
6701 CopLINE_set(PL_curcop, oldline);
6710 SV **svp, **indsvp, *sv;
6715 o->op_seq = PL_op_seqmax++;
6717 if (((BINOP*)o)->op_last->op_type != OP_CONST)
6720 /* Make the CONST have a shared SV */
6721 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6722 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv)) && !IS_PADCONST(sv)) {
6723 key = SvPV(sv, keylen);
6724 lexname = newSVpvn_share(key, keylen, 0);
6731 if ((o->op_private & (OPpLVAL_INTRO)))
6734 rop = (UNOP*)((BINOP*)o)->op_first;
6735 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6737 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6738 if (!SvOBJECT(lexname))
6740 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6741 if (!fields || !GvHV(*fields))
6743 key = SvPV(*svp, keylen);
6744 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6746 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6747 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6749 ind = SvIV(*indsvp);
6751 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6752 rop->op_type = OP_RV2AV;
6753 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6754 o->op_type = OP_AELEM;
6755 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6757 if (SvREADONLY(*svp))
6759 SvFLAGS(sv) |= (SvFLAGS(*svp)
6760 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6770 SV **svp, **indsvp, *sv;
6774 SVOP *first_key_op, *key_op;
6776 o->op_seq = PL_op_seqmax++;
6777 if ((o->op_private & (OPpLVAL_INTRO))
6778 /* I bet there's always a pushmark... */
6779 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
6780 /* hmmm, no optimization if list contains only one key. */
6782 rop = (UNOP*)((LISTOP*)o)->op_last;
6783 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6785 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6786 if (!SvOBJECT(lexname))
6788 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6789 if (!fields || !GvHV(*fields))
6791 /* Again guessing that the pushmark can be jumped over.... */
6792 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
6793 ->op_first->op_sibling;
6794 /* Check that the key list contains only constants. */
6795 for (key_op = first_key_op; key_op;
6796 key_op = (SVOP*)key_op->op_sibling)
6797 if (key_op->op_type != OP_CONST)
6801 rop->op_type = OP_RV2AV;
6802 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6803 o->op_type = OP_ASLICE;
6804 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
6805 for (key_op = first_key_op; key_op;
6806 key_op = (SVOP*)key_op->op_sibling) {
6807 svp = cSVOPx_svp(key_op);
6808 key = SvPV(*svp, keylen);
6809 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6811 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
6812 "in variable %s of type %s",
6813 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6815 ind = SvIV(*indsvp);
6817 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6819 if (SvREADONLY(*svp))
6821 SvFLAGS(sv) |= (SvFLAGS(*svp)
6822 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6831 if (!(o->op_flags & OPf_WANT)
6832 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6836 o->op_seq = PL_op_seqmax++;
6840 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6841 o->op_seq = PL_op_seqmax++;
6847 if (last_composite) {
6848 OP *r = last_composite;
6850 while (r->op_sibling)
6853 || (r->op_next->op_type == OP_LIST
6854 && r->op_next->op_next == o))
6856 if (last_composite->op_type == OP_RV2AV)
6857 yyerror("Lvalue subs returning arrays not implemented yet");
6859 yyerror("Lvalue subs returning hashes not implemented yet");
6866 o->op_seq = PL_op_seqmax++;
6876 /* Efficient sub that returns a constant scalar value. */
6878 const_sv_xsub(pTHXo_ CV* cv)
6882 ST(0) = (SV*)XSANY.any_ptr;