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 &&
2252 #ifdef PERL_PRESERVE_IVUV
2253 /* Only bother to attempt to fold to IV if
2254 most operators will benefit */
2258 return newSVOP(OP_CONST, 0, sv);
2262 if (!(PL_opargs[type] & OA_OTHERINT))
2265 if (!(PL_hints & HINT_INTEGER)) {
2266 if (type == OP_MODULO
2267 || type == OP_DIVIDE
2268 || !(o->op_flags & OPf_KIDS))
2273 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2274 if (curop->op_type == OP_CONST) {
2275 if (SvIOK(((SVOP*)curop)->op_sv))
2279 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2283 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2290 Perl_gen_constant_list(pTHX_ register OP *o)
2293 I32 oldtmps_floor = PL_tmps_floor;
2297 return o; /* Don't attempt to run with errors */
2299 PL_op = curop = LINKLIST(o);
2306 PL_tmps_floor = oldtmps_floor;
2308 o->op_type = OP_RV2AV;
2309 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2310 curop = ((UNOP*)o)->op_first;
2311 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2318 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2323 if (!o || o->op_type != OP_LIST)
2324 o = newLISTOP(OP_LIST, 0, o, Nullop);
2326 o->op_flags &= ~OPf_WANT;
2328 if (!(PL_opargs[type] & OA_MARK))
2329 null(cLISTOPo->op_first);
2332 o->op_ppaddr = PL_ppaddr[type];
2333 o->op_flags |= flags;
2335 o = CHECKOP(type, o);
2336 if (o->op_type != type)
2339 if (cLISTOPo->op_children < 7) {
2340 /* XXX do we really need to do this if we're done appending?? */
2341 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2343 cLISTOPo->op_last = last; /* in case check substituted last arg */
2346 return fold_constants(o);
2349 /* List constructors */
2352 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2360 if (first->op_type != type
2361 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2363 return newLISTOP(type, 0, first, last);
2366 if (first->op_flags & OPf_KIDS)
2367 ((LISTOP*)first)->op_last->op_sibling = last;
2369 first->op_flags |= OPf_KIDS;
2370 ((LISTOP*)first)->op_first = last;
2372 ((LISTOP*)first)->op_last = last;
2373 ((LISTOP*)first)->op_children++;
2378 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2386 if (first->op_type != type)
2387 return prepend_elem(type, (OP*)first, (OP*)last);
2389 if (last->op_type != type)
2390 return append_elem(type, (OP*)first, (OP*)last);
2392 first->op_last->op_sibling = last->op_first;
2393 first->op_last = last->op_last;
2394 first->op_children += last->op_children;
2395 if (first->op_children)
2396 first->op_flags |= OPf_KIDS;
2398 #ifdef PL_OP_SLAB_ALLOC
2406 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2414 if (last->op_type == type) {
2415 if (type == OP_LIST) { /* already a PUSHMARK there */
2416 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2417 ((LISTOP*)last)->op_first->op_sibling = first;
2420 if (!(last->op_flags & OPf_KIDS)) {
2421 ((LISTOP*)last)->op_last = first;
2422 last->op_flags |= OPf_KIDS;
2424 first->op_sibling = ((LISTOP*)last)->op_first;
2425 ((LISTOP*)last)->op_first = first;
2427 ((LISTOP*)last)->op_children++;
2431 return newLISTOP(type, 0, first, last);
2437 Perl_newNULLLIST(pTHX)
2439 return newOP(OP_STUB, 0);
2443 Perl_force_list(pTHX_ OP *o)
2445 if (!o || o->op_type != OP_LIST)
2446 o = newLISTOP(OP_LIST, 0, o, Nullop);
2452 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2456 NewOp(1101, listop, 1, LISTOP);
2458 listop->op_type = type;
2459 listop->op_ppaddr = PL_ppaddr[type];
2460 listop->op_children = (first != 0) + (last != 0);
2461 listop->op_flags = flags;
2465 else if (!first && last)
2468 first->op_sibling = last;
2469 listop->op_first = first;
2470 listop->op_last = last;
2471 if (type == OP_LIST) {
2473 pushop = newOP(OP_PUSHMARK, 0);
2474 pushop->op_sibling = first;
2475 listop->op_first = pushop;
2476 listop->op_flags |= OPf_KIDS;
2478 listop->op_last = pushop;
2480 else if (listop->op_children)
2481 listop->op_flags |= OPf_KIDS;
2487 Perl_newOP(pTHX_ I32 type, I32 flags)
2490 NewOp(1101, o, 1, OP);
2492 o->op_ppaddr = PL_ppaddr[type];
2493 o->op_flags = flags;
2496 o->op_private = 0 + (flags >> 8);
2497 if (PL_opargs[type] & OA_RETSCALAR)
2499 if (PL_opargs[type] & OA_TARGET)
2500 o->op_targ = pad_alloc(type, SVs_PADTMP);
2501 return CHECKOP(type, o);
2505 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2510 first = newOP(OP_STUB, 0);
2511 if (PL_opargs[type] & OA_MARK)
2512 first = force_list(first);
2514 NewOp(1101, unop, 1, UNOP);
2515 unop->op_type = type;
2516 unop->op_ppaddr = PL_ppaddr[type];
2517 unop->op_first = first;
2518 unop->op_flags = flags | OPf_KIDS;
2519 unop->op_private = 1 | (flags >> 8);
2520 unop = (UNOP*) CHECKOP(type, unop);
2524 return fold_constants((OP *) unop);
2528 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2531 NewOp(1101, binop, 1, BINOP);
2534 first = newOP(OP_NULL, 0);
2536 binop->op_type = type;
2537 binop->op_ppaddr = PL_ppaddr[type];
2538 binop->op_first = first;
2539 binop->op_flags = flags | OPf_KIDS;
2542 binop->op_private = 1 | (flags >> 8);
2545 binop->op_private = 2 | (flags >> 8);
2546 first->op_sibling = last;
2549 binop = (BINOP*)CHECKOP(type, binop);
2550 if (binop->op_next || binop->op_type != type)
2553 binop->op_last = binop->op_first->op_sibling;
2555 return fold_constants((OP *)binop);
2559 utf8compare(const void *a, const void *b)
2562 for (i = 0; i < 10; i++) {
2563 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2565 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2572 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2574 SV *tstr = ((SVOP*)expr)->op_sv;
2575 SV *rstr = ((SVOP*)repl)->op_sv;
2578 register U8 *t = (U8*)SvPV(tstr, tlen);
2579 register U8 *r = (U8*)SvPV(rstr, rlen);
2585 register short *tbl;
2587 complement = o->op_private & OPpTRANS_COMPLEMENT;
2588 del = o->op_private & OPpTRANS_DELETE;
2589 squash = o->op_private & OPpTRANS_SQUASH;
2592 o->op_private |= OPpTRANS_FROM_UTF;
2595 o->op_private |= OPpTRANS_TO_UTF;
2597 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2598 SV* listsv = newSVpvn("# comment\n",10);
2600 U8* tend = t + tlen;
2601 U8* rend = r + rlen;
2616 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2617 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2620 U8 tmpbuf[UTF8_MAXLEN+1];
2624 New(1109, cp, tlen, U8*);
2626 transv = newSVpvn("",0);
2635 qsort(cp, i, sizeof(U8*), utf8compare);
2636 for (j = 0; j < i; j++) {
2638 I32 cur = j < i ? cp[j+1] - s : tend - s;
2639 UV val = utf8_to_uv(s, cur, &ulen, 0);
2641 diff = val - nextmin;
2643 t = uv_to_utf8(tmpbuf,nextmin);
2644 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2646 t = uv_to_utf8(tmpbuf, val - 1);
2647 sv_catpvn(transv, "\377", 1);
2648 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2652 val = utf8_to_uv(s+1, cur - 1, &ulen, 0);
2656 t = uv_to_utf8(tmpbuf,nextmin);
2657 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2658 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2659 sv_catpvn(transv, "\377", 1);
2660 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2661 t = (U8*)SvPVX(transv);
2662 tlen = SvCUR(transv);
2665 else if (!rlen && !del) {
2666 r = t; rlen = tlen; rend = tend;
2670 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
2672 o->op_private |= OPpTRANS_IDENTICAL;
2676 while (t < tend || tfirst <= tlast) {
2677 /* see if we need more "t" chars */
2678 if (tfirst > tlast) {
2679 tfirst = (I32)utf8_to_uv(t, tend - t, &ulen, 0);
2681 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2683 tlast = (I32)utf8_to_uv(t, tend - t, &ulen, 0);
2690 /* now see if we need more "r" chars */
2691 if (rfirst > rlast) {
2693 rfirst = (I32)utf8_to_uv(r, rend - r, &ulen, 0);
2695 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2697 rlast = (I32)utf8_to_uv(r, rend - r, &ulen, 0);
2706 rfirst = rlast = 0xffffffff;
2710 /* now see which range will peter our first, if either. */
2711 tdiff = tlast - tfirst;
2712 rdiff = rlast - rfirst;
2719 if (rfirst == 0xffffffff) {
2720 diff = tdiff; /* oops, pretend rdiff is infinite */
2722 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2723 (long)tfirst, (long)tlast);
2725 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2729 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2730 (long)tfirst, (long)(tfirst + diff),
2733 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2734 (long)tfirst, (long)rfirst);
2736 if (rfirst + diff > max)
2737 max = rfirst + diff;
2742 else if (rfirst <= 0x800)
2743 grows |= (tfirst < 0x80);
2744 else if (rfirst <= 0x10000)
2745 grows |= (tfirst < 0x800);
2746 else if (rfirst <= 0x200000)
2747 grows |= (tfirst < 0x10000);
2748 else if (rfirst <= 0x4000000)
2749 grows |= (tfirst < 0x200000);
2750 else if (rfirst <= 0x80000000)
2751 grows |= (tfirst < 0x4000000);
2763 else if (max > 0xff)
2768 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2769 SvREFCNT_dec(listsv);
2771 SvREFCNT_dec(transv);
2773 if (!del && havefinal)
2774 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
2775 newSVuv((UV)final), 0);
2777 if (grows && to_utf)
2778 o->op_private |= OPpTRANS_GROWS;
2785 tbl = (short*)cPVOPo->op_pv;
2787 Zero(tbl, 256, short);
2788 for (i = 0; i < tlen; i++)
2790 for (i = 0, j = 0; i < 256; i++) {
2806 if (!rlen && !del) {
2809 o->op_private |= OPpTRANS_IDENTICAL;
2811 for (i = 0; i < 256; i++)
2813 for (i = 0, j = 0; i < tlen; i++,j++) {
2816 if (tbl[t[i]] == -1)
2822 if (tbl[t[i]] == -1)
2833 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2837 NewOp(1101, pmop, 1, PMOP);
2838 pmop->op_type = type;
2839 pmop->op_ppaddr = PL_ppaddr[type];
2840 pmop->op_flags = flags;
2841 pmop->op_private = 0 | (flags >> 8);
2843 if (PL_hints & HINT_RE_TAINT)
2844 pmop->op_pmpermflags |= PMf_RETAINT;
2845 if (PL_hints & HINT_LOCALE)
2846 pmop->op_pmpermflags |= PMf_LOCALE;
2847 pmop->op_pmflags = pmop->op_pmpermflags;
2849 /* link into pm list */
2850 if (type != OP_TRANS && PL_curstash) {
2851 pmop->op_pmnext = HvPMROOT(PL_curstash);
2852 HvPMROOT(PL_curstash) = pmop;
2859 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2863 I32 repl_has_vars = 0;
2865 if (o->op_type == OP_TRANS)
2866 return pmtrans(o, expr, repl);
2868 PL_hints |= HINT_BLOCK_SCOPE;
2871 if (expr->op_type == OP_CONST) {
2873 SV *pat = ((SVOP*)expr)->op_sv;
2874 char *p = SvPV(pat, plen);
2875 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2876 sv_setpvn(pat, "\\s+", 3);
2877 p = SvPV(pat, plen);
2878 pm->op_pmflags |= PMf_SKIPWHITE;
2880 if ((PL_hints & HINT_UTF8) || DO_UTF8(pat))
2881 pm->op_pmdynflags |= PMdf_UTF8;
2882 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2883 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2884 pm->op_pmflags |= PMf_WHITE;
2888 if (PL_hints & HINT_UTF8)
2889 pm->op_pmdynflags |= PMdf_UTF8;
2890 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2891 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2893 : OP_REGCMAYBE),0,expr);
2895 NewOp(1101, rcop, 1, LOGOP);
2896 rcop->op_type = OP_REGCOMP;
2897 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2898 rcop->op_first = scalar(expr);
2899 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2900 ? (OPf_SPECIAL | OPf_KIDS)
2902 rcop->op_private = 1;
2905 /* establish postfix order */
2906 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2908 rcop->op_next = expr;
2909 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2912 rcop->op_next = LINKLIST(expr);
2913 expr->op_next = (OP*)rcop;
2916 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2921 if (pm->op_pmflags & PMf_EVAL) {
2923 if (CopLINE(PL_curcop) < PL_multi_end)
2924 CopLINE_set(PL_curcop, PL_multi_end);
2927 else if (repl->op_type == OP_THREADSV
2928 && strchr("&`'123456789+",
2929 PL_threadsv_names[repl->op_targ]))
2933 #endif /* USE_THREADS */
2934 else if (repl->op_type == OP_CONST)
2938 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2939 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2941 if (curop->op_type == OP_THREADSV) {
2943 if (strchr("&`'123456789+", curop->op_private))
2947 if (curop->op_type == OP_GV) {
2948 GV *gv = cGVOPx_gv(curop);
2950 if (strchr("&`'123456789+", *GvENAME(gv)))
2953 #endif /* USE_THREADS */
2954 else if (curop->op_type == OP_RV2CV)
2956 else if (curop->op_type == OP_RV2SV ||
2957 curop->op_type == OP_RV2AV ||
2958 curop->op_type == OP_RV2HV ||
2959 curop->op_type == OP_RV2GV) {
2960 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2963 else if (curop->op_type == OP_PADSV ||
2964 curop->op_type == OP_PADAV ||
2965 curop->op_type == OP_PADHV ||
2966 curop->op_type == OP_PADANY) {
2969 else if (curop->op_type == OP_PUSHRE)
2970 ; /* Okay here, dangerous in newASSIGNOP */
2979 && (!pm->op_pmregexp
2980 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2981 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2982 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2983 prepend_elem(o->op_type, scalar(repl), o);
2986 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2987 pm->op_pmflags |= PMf_MAYBE_CONST;
2988 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2990 NewOp(1101, rcop, 1, LOGOP);
2991 rcop->op_type = OP_SUBSTCONT;
2992 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2993 rcop->op_first = scalar(repl);
2994 rcop->op_flags |= OPf_KIDS;
2995 rcop->op_private = 1;
2998 /* establish postfix order */
2999 rcop->op_next = LINKLIST(repl);
3000 repl->op_next = (OP*)rcop;
3002 pm->op_pmreplroot = scalar((OP*)rcop);
3003 pm->op_pmreplstart = LINKLIST(rcop);
3012 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3015 NewOp(1101, svop, 1, SVOP);
3016 svop->op_type = type;
3017 svop->op_ppaddr = PL_ppaddr[type];
3019 svop->op_next = (OP*)svop;
3020 svop->op_flags = flags;
3021 if (PL_opargs[type] & OA_RETSCALAR)
3023 if (PL_opargs[type] & OA_TARGET)
3024 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3025 return CHECKOP(type, svop);
3029 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3032 NewOp(1101, padop, 1, PADOP);
3033 padop->op_type = type;
3034 padop->op_ppaddr = PL_ppaddr[type];
3035 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3036 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3037 PL_curpad[padop->op_padix] = sv;
3039 padop->op_next = (OP*)padop;
3040 padop->op_flags = flags;
3041 if (PL_opargs[type] & OA_RETSCALAR)
3043 if (PL_opargs[type] & OA_TARGET)
3044 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3045 return CHECKOP(type, padop);
3049 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3053 return newPADOP(type, flags, SvREFCNT_inc(gv));
3055 return newSVOP(type, flags, SvREFCNT_inc(gv));
3060 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3063 NewOp(1101, pvop, 1, PVOP);
3064 pvop->op_type = type;
3065 pvop->op_ppaddr = PL_ppaddr[type];
3067 pvop->op_next = (OP*)pvop;
3068 pvop->op_flags = flags;
3069 if (PL_opargs[type] & OA_RETSCALAR)
3071 if (PL_opargs[type] & OA_TARGET)
3072 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3073 return CHECKOP(type, pvop);
3077 Perl_package(pTHX_ OP *o)
3081 save_hptr(&PL_curstash);
3082 save_item(PL_curstname);
3087 name = SvPV(sv, len);
3088 PL_curstash = gv_stashpvn(name,len,TRUE);
3089 sv_setpvn(PL_curstname, name, len);
3093 sv_setpv(PL_curstname,"<none>");
3094 PL_curstash = Nullhv;
3096 PL_hints |= HINT_BLOCK_SCOPE;
3097 PL_copline = NOLINE;
3102 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3110 if (id->op_type != OP_CONST)
3111 Perl_croak(aTHX_ "Module name must be constant");
3115 if (version != Nullop) {
3116 SV *vesv = ((SVOP*)version)->op_sv;
3118 if (arg == Nullop && !SvNIOKp(vesv)) {
3125 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3126 Perl_croak(aTHX_ "Version number must be constant number");
3128 /* Make copy of id so we don't free it twice */
3129 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3131 /* Fake up a method call to VERSION */
3132 meth = newSVpvn("VERSION",7);
3133 sv_upgrade(meth, SVt_PVIV);
3134 (void)SvIOK_on(meth);
3135 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3136 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3137 append_elem(OP_LIST,
3138 prepend_elem(OP_LIST, pack, list(version)),
3139 newSVOP(OP_METHOD_NAMED, 0, meth)));
3143 /* Fake up an import/unimport */
3144 if (arg && arg->op_type == OP_STUB)
3145 imop = arg; /* no import on explicit () */
3146 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3147 imop = Nullop; /* use 5.0; */
3152 /* Make copy of id so we don't free it twice */
3153 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3155 /* Fake up a method call to import/unimport */
3156 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);;
3157 sv_upgrade(meth, SVt_PVIV);
3158 (void)SvIOK_on(meth);
3159 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3160 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3161 append_elem(OP_LIST,
3162 prepend_elem(OP_LIST, pack, list(arg)),
3163 newSVOP(OP_METHOD_NAMED, 0, meth)));
3166 /* Fake up a require, handle override, if any */
3167 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3168 if (!(gv && GvIMPORTED_CV(gv)))
3169 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3171 if (gv && GvIMPORTED_CV(gv)) {
3172 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3173 append_elem(OP_LIST, id,
3174 scalar(newUNOP(OP_RV2CV, 0,
3179 rqop = newUNOP(OP_REQUIRE, 0, id);
3182 /* Fake up the BEGIN {}, which does its thing immediately. */
3184 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3187 append_elem(OP_LINESEQ,
3188 append_elem(OP_LINESEQ,
3189 newSTATEOP(0, Nullch, rqop),
3190 newSTATEOP(0, Nullch, veop)),
3191 newSTATEOP(0, Nullch, imop) ));
3193 PL_hints |= HINT_BLOCK_SCOPE;
3194 PL_copline = NOLINE;
3199 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3202 va_start(args, ver);
3203 vload_module(flags, name, ver, &args);
3207 #ifdef PERL_IMPLICIT_CONTEXT
3209 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3213 va_start(args, ver);
3214 vload_module(flags, name, ver, &args);
3220 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3222 OP *modname, *veop, *imop;
3224 modname = newSVOP(OP_CONST, 0, name);
3225 modname->op_private |= OPpCONST_BARE;
3227 veop = newSVOP(OP_CONST, 0, ver);
3231 if (flags & PERL_LOADMOD_NOIMPORT) {
3232 imop = sawparens(newNULLLIST());
3234 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3235 imop = va_arg(*args, OP*);
3240 sv = va_arg(*args, SV*);
3242 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3243 sv = va_arg(*args, SV*);
3247 line_t ocopline = PL_copline;
3248 int oexpect = PL_expect;
3250 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3251 veop, modname, imop);
3252 PL_expect = oexpect;
3253 PL_copline = ocopline;
3258 Perl_dofile(pTHX_ OP *term)
3263 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3264 if (!(gv && GvIMPORTED_CV(gv)))
3265 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3267 if (gv && GvIMPORTED_CV(gv)) {
3268 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3269 append_elem(OP_LIST, term,
3270 scalar(newUNOP(OP_RV2CV, 0,
3275 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3281 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3283 return newBINOP(OP_LSLICE, flags,
3284 list(force_list(subscript)),
3285 list(force_list(listval)) );
3289 S_list_assignment(pTHX_ register OP *o)
3294 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3295 o = cUNOPo->op_first;
3297 if (o->op_type == OP_COND_EXPR) {
3298 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3299 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3304 yyerror("Assignment to both a list and a scalar");
3308 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3309 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3310 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3313 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3316 if (o->op_type == OP_RV2SV)
3323 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3328 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3329 return newLOGOP(optype, 0,
3330 mod(scalar(left), optype),
3331 newUNOP(OP_SASSIGN, 0, scalar(right)));
3334 return newBINOP(optype, OPf_STACKED,
3335 mod(scalar(left), optype), scalar(right));
3339 if (list_assignment(left)) {
3343 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3344 left = mod(left, OP_AASSIGN);
3352 curop = list(force_list(left));
3353 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3354 o->op_private = 0 | (flags >> 8);
3355 for (curop = ((LISTOP*)curop)->op_first;
3356 curop; curop = curop->op_sibling)
3358 if (curop->op_type == OP_RV2HV &&
3359 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3360 o->op_private |= OPpASSIGN_HASH;
3364 if (!(left->op_private & OPpLVAL_INTRO)) {
3367 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3368 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3369 if (curop->op_type == OP_GV) {
3370 GV *gv = cGVOPx_gv(curop);
3371 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3373 SvCUR(gv) = PL_generation;
3375 else if (curop->op_type == OP_PADSV ||
3376 curop->op_type == OP_PADAV ||
3377 curop->op_type == OP_PADHV ||
3378 curop->op_type == OP_PADANY) {
3379 SV **svp = AvARRAY(PL_comppad_name);
3380 SV *sv = svp[curop->op_targ];
3381 if (SvCUR(sv) == PL_generation)
3383 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3385 else if (curop->op_type == OP_RV2CV)
3387 else if (curop->op_type == OP_RV2SV ||
3388 curop->op_type == OP_RV2AV ||
3389 curop->op_type == OP_RV2HV ||
3390 curop->op_type == OP_RV2GV) {
3391 if (lastop->op_type != OP_GV) /* funny deref? */
3394 else if (curop->op_type == OP_PUSHRE) {
3395 if (((PMOP*)curop)->op_pmreplroot) {
3397 GV *gv = (GV*)PL_curpad[(PADOFFSET)((PMOP*)curop)->op_pmreplroot];
3399 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3401 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3403 SvCUR(gv) = PL_generation;
3412 o->op_private |= OPpASSIGN_COMMON;
3414 if (right && right->op_type == OP_SPLIT) {
3416 if ((tmpop = ((LISTOP*)right)->op_first) &&
3417 tmpop->op_type == OP_PUSHRE)
3419 PMOP *pm = (PMOP*)tmpop;
3420 if (left->op_type == OP_RV2AV &&
3421 !(left->op_private & OPpLVAL_INTRO) &&
3422 !(o->op_private & OPpASSIGN_COMMON) )
3424 tmpop = ((UNOP*)left)->op_first;
3425 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3427 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3428 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3430 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3431 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3433 pm->op_pmflags |= PMf_ONCE;
3434 tmpop = cUNOPo->op_first; /* to list (nulled) */
3435 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3436 tmpop->op_sibling = Nullop; /* don't free split */
3437 right->op_next = tmpop->op_next; /* fix starting loc */
3438 op_free(o); /* blow off assign */
3439 right->op_flags &= ~OPf_WANT;
3440 /* "I don't know and I don't care." */
3445 if (PL_modcount < 10000 &&
3446 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3448 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3450 sv_setiv(sv, PL_modcount+1);
3458 right = newOP(OP_UNDEF, 0);
3459 if (right->op_type == OP_READLINE) {
3460 right->op_flags |= OPf_STACKED;
3461 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3464 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3465 o = newBINOP(OP_SASSIGN, flags,
3466 scalar(right), mod(scalar(left), OP_SASSIGN) );
3478 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3480 U32 seq = intro_my();
3483 NewOp(1101, cop, 1, COP);
3484 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3485 cop->op_type = OP_DBSTATE;
3486 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3489 cop->op_type = OP_NEXTSTATE;
3490 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3492 cop->op_flags = flags;
3493 cop->op_private = (PL_hints & HINT_BYTE);
3495 cop->op_private |= NATIVE_HINTS;
3497 PL_compiling.op_private = cop->op_private;
3498 cop->op_next = (OP*)cop;
3501 cop->cop_label = label;
3502 PL_hints |= HINT_BLOCK_SCOPE;
3505 cop->cop_arybase = PL_curcop->cop_arybase;
3506 if (specialWARN(PL_curcop->cop_warnings))
3507 cop->cop_warnings = PL_curcop->cop_warnings ;
3509 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3510 if (specialCopIO(PL_curcop->cop_io))
3511 cop->cop_io = PL_curcop->cop_io;
3513 cop->cop_io = newSVsv(PL_curcop->cop_io) ;
3516 if (PL_copline == NOLINE)
3517 CopLINE_set(cop, CopLINE(PL_curcop));
3519 CopLINE_set(cop, PL_copline);
3520 PL_copline = NOLINE;
3523 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
3525 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
3527 CopSTASH_set(cop, PL_curstash);
3529 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3530 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3531 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3532 (void)SvIOK_on(*svp);
3533 SvIVX(*svp) = PTR2IV(cop);
3537 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3540 /* "Introduce" my variables to visible status. */
3548 if (! PL_min_intro_pending)
3549 return PL_cop_seqmax;
3551 svp = AvARRAY(PL_comppad_name);
3552 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3553 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3554 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3555 SvNVX(sv) = (NV)PL_cop_seqmax;
3558 PL_min_intro_pending = 0;
3559 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3560 return PL_cop_seqmax++;
3564 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3566 return new_logop(type, flags, &first, &other);
3570 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3574 OP *first = *firstp;
3575 OP *other = *otherp;
3577 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3578 return newBINOP(type, flags, scalar(first), scalar(other));
3580 scalarboolean(first);
3581 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3582 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3583 if (type == OP_AND || type == OP_OR) {
3589 first = *firstp = cUNOPo->op_first;
3591 first->op_next = o->op_next;
3592 cUNOPo->op_first = Nullop;
3596 if (first->op_type == OP_CONST) {
3597 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3598 Perl_warner(aTHX_ WARN_BAREWORD, "Bareword found in conditional");
3599 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3610 else if (first->op_type == OP_WANTARRAY) {
3616 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3617 OP *k1 = ((UNOP*)first)->op_first;
3618 OP *k2 = k1->op_sibling;
3620 switch (first->op_type)
3623 if (k2 && k2->op_type == OP_READLINE
3624 && (k2->op_flags & OPf_STACKED)
3625 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3627 warnop = k2->op_type;
3632 if (k1->op_type == OP_READDIR
3633 || k1->op_type == OP_GLOB
3634 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3635 || k1->op_type == OP_EACH)
3637 warnop = ((k1->op_type == OP_NULL)
3638 ? k1->op_targ : k1->op_type);
3643 line_t oldline = CopLINE(PL_curcop);
3644 CopLINE_set(PL_curcop, PL_copline);
3645 Perl_warner(aTHX_ WARN_MISC,
3646 "Value of %s%s can be \"0\"; test with defined()",
3648 ((warnop == OP_READLINE || warnop == OP_GLOB)
3649 ? " construct" : "() operator"));
3650 CopLINE_set(PL_curcop, oldline);
3657 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3658 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3660 NewOp(1101, logop, 1, LOGOP);
3662 logop->op_type = type;
3663 logop->op_ppaddr = PL_ppaddr[type];
3664 logop->op_first = first;
3665 logop->op_flags = flags | OPf_KIDS;
3666 logop->op_other = LINKLIST(other);
3667 logop->op_private = 1 | (flags >> 8);
3669 /* establish postfix order */
3670 logop->op_next = LINKLIST(first);
3671 first->op_next = (OP*)logop;
3672 first->op_sibling = other;
3674 o = newUNOP(OP_NULL, 0, (OP*)logop);
3681 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3688 return newLOGOP(OP_AND, 0, first, trueop);
3690 return newLOGOP(OP_OR, 0, first, falseop);
3692 scalarboolean(first);
3693 if (first->op_type == OP_CONST) {
3694 if (SvTRUE(((SVOP*)first)->op_sv)) {
3705 else if (first->op_type == OP_WANTARRAY) {
3709 NewOp(1101, logop, 1, LOGOP);
3710 logop->op_type = OP_COND_EXPR;
3711 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3712 logop->op_first = first;
3713 logop->op_flags = flags | OPf_KIDS;
3714 logop->op_private = 1 | (flags >> 8);
3715 logop->op_other = LINKLIST(trueop);
3716 logop->op_next = LINKLIST(falseop);
3719 /* establish postfix order */
3720 start = LINKLIST(first);
3721 first->op_next = (OP*)logop;
3723 first->op_sibling = trueop;
3724 trueop->op_sibling = falseop;
3725 o = newUNOP(OP_NULL, 0, (OP*)logop);
3727 trueop->op_next = falseop->op_next = o;
3734 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3742 NewOp(1101, range, 1, LOGOP);
3744 range->op_type = OP_RANGE;
3745 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3746 range->op_first = left;
3747 range->op_flags = OPf_KIDS;
3748 leftstart = LINKLIST(left);
3749 range->op_other = LINKLIST(right);
3750 range->op_private = 1 | (flags >> 8);
3752 left->op_sibling = right;
3754 range->op_next = (OP*)range;
3755 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3756 flop = newUNOP(OP_FLOP, 0, flip);
3757 o = newUNOP(OP_NULL, 0, flop);
3759 range->op_next = leftstart;
3761 left->op_next = flip;
3762 right->op_next = flop;
3764 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3765 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3766 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3767 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3769 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3770 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3773 if (!flip->op_private || !flop->op_private)
3774 linklist(o); /* blow off optimizer unless constant */
3780 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3784 int once = block && block->op_flags & OPf_SPECIAL &&
3785 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3788 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3789 return block; /* do {} while 0 does once */
3790 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3791 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3792 expr = newUNOP(OP_DEFINED, 0,
3793 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3794 } else if (expr->op_flags & OPf_KIDS) {
3795 OP *k1 = ((UNOP*)expr)->op_first;
3796 OP *k2 = (k1) ? k1->op_sibling : NULL;
3797 switch (expr->op_type) {
3799 if (k2 && k2->op_type == OP_READLINE
3800 && (k2->op_flags & OPf_STACKED)
3801 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3802 expr = newUNOP(OP_DEFINED, 0, expr);
3806 if (k1->op_type == OP_READDIR
3807 || k1->op_type == OP_GLOB
3808 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3809 || k1->op_type == OP_EACH)
3810 expr = newUNOP(OP_DEFINED, 0, expr);
3816 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3817 o = new_logop(OP_AND, 0, &expr, &listop);
3820 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3822 if (once && o != listop)
3823 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3826 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3828 o->op_flags |= flags;
3830 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3835 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3844 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3845 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3846 expr = newUNOP(OP_DEFINED, 0,
3847 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3848 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3849 OP *k1 = ((UNOP*)expr)->op_first;
3850 OP *k2 = (k1) ? k1->op_sibling : NULL;
3851 switch (expr->op_type) {
3853 if (k2 && k2->op_type == OP_READLINE
3854 && (k2->op_flags & OPf_STACKED)
3855 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3856 expr = newUNOP(OP_DEFINED, 0, expr);
3860 if (k1->op_type == OP_READDIR
3861 || k1->op_type == OP_GLOB
3862 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3863 || k1->op_type == OP_EACH)
3864 expr = newUNOP(OP_DEFINED, 0, expr);
3870 block = newOP(OP_NULL, 0);
3872 block = scope(block);
3876 next = LINKLIST(cont);
3877 loopflags |= OPpLOOP_CONTINUE;
3880 OP *unstack = newOP(OP_UNSTACK, 0);
3883 cont = append_elem(OP_LINESEQ, cont, unstack);
3884 if ((line_t)whileline != NOLINE) {
3885 PL_copline = whileline;
3886 cont = append_elem(OP_LINESEQ, cont,
3887 newSTATEOP(0, Nullch, Nullop));
3891 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3892 redo = LINKLIST(listop);
3895 PL_copline = whileline;
3897 o = new_logop(OP_AND, 0, &expr, &listop);
3898 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3899 op_free(expr); /* oops, it's a while (0) */
3901 return Nullop; /* listop already freed by new_logop */
3904 ((LISTOP*)listop)->op_last->op_next = condop =
3905 (o == listop ? redo : LINKLIST(o));
3911 NewOp(1101,loop,1,LOOP);
3912 loop->op_type = OP_ENTERLOOP;
3913 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3914 loop->op_private = 0;
3915 loop->op_next = (OP*)loop;
3918 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3920 loop->op_redoop = redo;
3921 loop->op_lastop = o;
3922 o->op_private |= loopflags;
3925 loop->op_nextop = next;
3927 loop->op_nextop = o;
3929 o->op_flags |= flags;
3930 o->op_private |= (flags >> 8);
3935 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3943 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3944 sv->op_type = OP_RV2GV;
3945 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3947 else if (sv->op_type == OP_PADSV) { /* private variable */
3948 padoff = sv->op_targ;
3953 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3954 padoff = sv->op_targ;
3956 iterflags |= OPf_SPECIAL;
3961 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3965 padoff = find_threadsv("_");
3966 iterflags |= OPf_SPECIAL;
3968 sv = newGVOP(OP_GV, 0, PL_defgv);
3971 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3972 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3973 iterflags |= OPf_STACKED;
3975 else if (expr->op_type == OP_NULL &&
3976 (expr->op_flags & OPf_KIDS) &&
3977 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3979 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3980 * set the STACKED flag to indicate that these values are to be
3981 * treated as min/max values by 'pp_iterinit'.
3983 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3984 LOGOP* range = (LOGOP*) flip->op_first;
3985 OP* left = range->op_first;
3986 OP* right = left->op_sibling;
3989 range->op_flags &= ~OPf_KIDS;
3990 range->op_first = Nullop;
3992 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3993 listop->op_first->op_next = range->op_next;
3994 left->op_next = range->op_other;
3995 right->op_next = (OP*)listop;
3996 listop->op_next = listop->op_first;
3999 expr = (OP*)(listop);
4001 iterflags |= OPf_STACKED;
4004 expr = mod(force_list(expr), OP_GREPSTART);
4008 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
4009 append_elem(OP_LIST, expr, scalar(sv))));
4010 assert(!loop->op_next);
4011 #ifdef PL_OP_SLAB_ALLOC
4014 NewOp(1234,tmp,1,LOOP);
4015 Copy(loop,tmp,1,LOOP);
4019 Renew(loop, 1, LOOP);
4021 loop->op_targ = padoff;
4022 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
4023 PL_copline = forline;
4024 return newSTATEOP(0, label, wop);
4028 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4033 if (type != OP_GOTO || label->op_type == OP_CONST) {
4034 /* "last()" means "last" */
4035 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4036 o = newOP(type, OPf_SPECIAL);
4038 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
4039 ? SvPVx(((SVOP*)label)->op_sv, n_a)
4045 if (label->op_type == OP_ENTERSUB)
4046 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4047 o = newUNOP(type, OPf_STACKED, label);
4049 PL_hints |= HINT_BLOCK_SCOPE;
4054 Perl_cv_undef(pTHX_ CV *cv)
4058 MUTEX_DESTROY(CvMUTEXP(cv));
4059 Safefree(CvMUTEXP(cv));
4062 #endif /* USE_THREADS */
4064 if (!CvXSUB(cv) && CvROOT(cv)) {
4066 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4067 Perl_croak(aTHX_ "Can't undef active subroutine");
4070 Perl_croak(aTHX_ "Can't undef active subroutine");
4071 #endif /* USE_THREADS */
4074 SAVEVPTR(PL_curpad);
4078 op_free(CvROOT(cv));
4079 CvROOT(cv) = Nullop;
4082 SvPOK_off((SV*)cv); /* forget prototype */
4084 SvREFCNT_dec(CvGV(cv));
4086 SvREFCNT_dec(CvOUTSIDE(cv));
4087 CvOUTSIDE(cv) = Nullcv;
4089 SvREFCNT_dec((SV*)CvXSUBANY(cv).any_ptr);
4092 if (CvPADLIST(cv)) {
4093 /* may be during global destruction */
4094 if (SvREFCNT(CvPADLIST(cv))) {
4095 I32 i = AvFILLp(CvPADLIST(cv));
4097 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4098 SV* sv = svp ? *svp : Nullsv;
4101 if (sv == (SV*)PL_comppad_name)
4102 PL_comppad_name = Nullav;
4103 else if (sv == (SV*)PL_comppad) {
4104 PL_comppad = Nullav;
4105 PL_curpad = Null(SV**);
4109 SvREFCNT_dec((SV*)CvPADLIST(cv));
4111 CvPADLIST(cv) = Nullav;
4116 S_cv_dump(pTHX_ CV *cv)
4119 CV *outside = CvOUTSIDE(cv);
4120 AV* padlist = CvPADLIST(cv);
4127 PerlIO_printf(Perl_debug_log,
4128 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4130 (CvANON(cv) ? "ANON"
4131 : (cv == PL_main_cv) ? "MAIN"
4132 : CvUNIQUE(cv) ? "UNIQUE"
4133 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4136 : CvANON(outside) ? "ANON"
4137 : (outside == PL_main_cv) ? "MAIN"
4138 : CvUNIQUE(outside) ? "UNIQUE"
4139 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4144 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4145 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4146 pname = AvARRAY(pad_name);
4147 ppad = AvARRAY(pad);
4149 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4150 if (SvPOK(pname[ix]))
4151 PerlIO_printf(Perl_debug_log,
4152 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4153 (int)ix, PTR2UV(ppad[ix]),
4154 SvFAKE(pname[ix]) ? "FAKE " : "",
4156 (IV)I_32(SvNVX(pname[ix])),
4159 #endif /* DEBUGGING */
4163 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4167 AV* protopadlist = CvPADLIST(proto);
4168 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4169 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4170 SV** pname = AvARRAY(protopad_name);
4171 SV** ppad = AvARRAY(protopad);
4172 I32 fname = AvFILLp(protopad_name);
4173 I32 fpad = AvFILLp(protopad);
4177 assert(!CvUNIQUE(proto));
4181 SAVESPTR(PL_comppad_name);
4182 SAVESPTR(PL_compcv);
4184 cv = PL_compcv = (CV*)NEWSV(1104,0);
4185 sv_upgrade((SV *)cv, SvTYPE(proto));
4186 CvFLAGS(cv) = CvFLAGS(proto) & ~CVf_CLONE;
4190 New(666, CvMUTEXP(cv), 1, perl_mutex);
4191 MUTEX_INIT(CvMUTEXP(cv));
4193 #endif /* USE_THREADS */
4194 CvFILE(cv) = CvFILE(proto);
4195 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4196 CvSTASH(cv) = CvSTASH(proto);
4197 CvROOT(cv) = CvROOT(proto);
4198 CvSTART(cv) = CvSTART(proto);
4200 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4203 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4205 PL_comppad_name = newAV();
4206 for (ix = fname; ix >= 0; ix--)
4207 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4209 PL_comppad = newAV();
4211 comppadlist = newAV();
4212 AvREAL_off(comppadlist);
4213 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4214 av_store(comppadlist, 1, (SV*)PL_comppad);
4215 CvPADLIST(cv) = comppadlist;
4216 av_fill(PL_comppad, AvFILLp(protopad));
4217 PL_curpad = AvARRAY(PL_comppad);
4219 av = newAV(); /* will be @_ */
4221 av_store(PL_comppad, 0, (SV*)av);
4222 AvFLAGS(av) = AVf_REIFY;
4224 for (ix = fpad; ix > 0; ix--) {
4225 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4226 if (namesv && namesv != &PL_sv_undef) {
4227 char *name = SvPVX(namesv); /* XXX */
4228 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4229 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4230 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4232 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4234 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4236 else { /* our own lexical */
4239 /* anon code -- we'll come back for it */
4240 sv = SvREFCNT_inc(ppad[ix]);
4242 else if (*name == '@')
4244 else if (*name == '%')
4253 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4254 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4257 SV* sv = NEWSV(0,0);
4263 /* Now that vars are all in place, clone nested closures. */
4265 for (ix = fpad; ix > 0; ix--) {
4266 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4268 && namesv != &PL_sv_undef
4269 && !(SvFLAGS(namesv) & SVf_FAKE)
4270 && *SvPVX(namesv) == '&'
4271 && CvCLONE(ppad[ix]))
4273 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4274 SvREFCNT_dec(ppad[ix]);
4277 PL_curpad[ix] = (SV*)kid;
4281 #ifdef DEBUG_CLOSURES
4282 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4284 PerlIO_printf(Perl_debug_log, " from:\n");
4286 PerlIO_printf(Perl_debug_log, " to:\n");
4293 SV* const_sv = op_const_sv(CvSTART(cv), cv);
4295 /* constant sub () { $x } closing over $x - see lib/constant.pm */
4297 cv = newCONSTSUB(CvSTASH(proto), 0, const_sv);
4304 Perl_cv_clone(pTHX_ CV *proto)
4307 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4308 cv = cv_clone2(proto, CvOUTSIDE(proto));
4309 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4314 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4316 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4317 SV* msg = sv_newmortal();
4321 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4322 sv_setpv(msg, "Prototype mismatch:");
4324 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4326 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4327 sv_catpv(msg, " vs ");
4329 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4331 sv_catpv(msg, "none");
4332 Perl_warner(aTHX_ WARN_PROTOTYPE, "%"SVf, msg);
4336 static void const_sv_xsub(pTHXo_ CV* cv);
4339 =for apidoc cv_const_sv
4341 If C<cv> is a constant sub eligible for inlining. returns the constant
4342 value returned by the sub. Otherwise, returns NULL.
4344 Constant subs can be created with C<newCONSTSUB> or as described in
4345 L<perlsub/"Constant Functions">.
4350 Perl_cv_const_sv(pTHX_ CV *cv)
4352 if (!cv || !CvCONST(cv))
4354 return (SV*)CvXSUBANY(cv).any_ptr;
4358 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4365 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4366 o = cLISTOPo->op_first->op_sibling;
4368 for (; o; o = o->op_next) {
4369 OPCODE type = o->op_type;
4371 if (sv && o->op_next == o)
4373 if (o->op_next != o) {
4374 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4376 if (type == OP_DBSTATE)
4379 if (type == OP_LEAVESUB || type == OP_RETURN)
4383 if (type == OP_CONST && cSVOPo->op_sv)
4385 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4386 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4387 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4391 /* We get here only from cv_clone2() while creating a closure.
4392 Copy the const value here instead of in cv_clone2 so that
4393 SvREADONLY_on doesn't lead to problems when leaving
4398 if (!SvREADONLY(sv) && SvREFCNT(sv) > 1)
4410 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4420 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4424 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4426 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4430 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4436 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4441 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4442 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4443 SV *sv = sv_newmortal();
4444 Perl_sv_setpvf(aTHX_ sv, "__ANON__[%s:%"IVdf"]",
4445 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4450 gv = gv_fetchpv(name ? name : (aname ? aname : "__ANON__"),
4451 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4461 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4462 maximum a prototype before. */
4463 if (SvTYPE(gv) > SVt_NULL) {
4464 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4465 && ckWARN_d(WARN_PROTOTYPE))
4467 Perl_warner(aTHX_ WARN_PROTOTYPE, "Runaway prototype");
4469 cv_ckproto((CV*)gv, NULL, ps);
4472 sv_setpv((SV*)gv, ps);
4474 sv_setiv((SV*)gv, -1);
4475 SvREFCNT_dec(PL_compcv);
4476 cv = PL_compcv = NULL;
4477 PL_sub_generation++;
4481 cv = (!name || GvCVGEN(gv)) ? Nullcv : GvCV(gv);
4483 if (!block || !ps || *ps || attrs)
4486 const_sv = op_const_sv(block, Nullcv);
4489 bool exists = CvROOT(cv) || CvXSUB(cv);
4490 /* if the subroutine doesn't exist and wasn't pre-declared
4491 * with a prototype, assume it will be AUTOLOADed,
4492 * skipping the prototype check
4494 if (exists || SvPOK(cv))
4495 cv_ckproto(cv, gv, ps);
4496 /* already defined (or promised)? */
4497 if (exists || GvASSUMECV(gv)) {
4498 if (!block && !attrs) {
4499 /* just a "sub foo;" when &foo is already defined */
4500 SAVEFREESV(PL_compcv);
4503 /* ahem, death to those who redefine active sort subs */
4504 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4505 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4507 if (ckWARN(WARN_REDEFINE)
4509 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
4511 line_t oldline = CopLINE(PL_curcop);
4512 CopLINE_set(PL_curcop, PL_copline);
4513 Perl_warner(aTHX_ WARN_REDEFINE,
4514 CvCONST(cv) ? "Constant subroutine %s redefined"
4515 : "Subroutine %s redefined", name);
4516 CopLINE_set(PL_curcop, oldline);
4524 SvREFCNT_inc(const_sv);
4526 assert(!CvROOT(cv) && !CvCONST(cv));
4527 sv_setpv((SV*)cv, ""); /* prototype is "" */
4528 CvXSUBANY(cv).any_ptr = const_sv;
4529 CvXSUB(cv) = const_sv_xsub;
4534 cv = newCONSTSUB(NULL, name, const_sv);
4537 SvREFCNT_dec(PL_compcv);
4539 PL_sub_generation++;
4546 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4547 * before we clobber PL_compcv.
4551 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4552 stash = GvSTASH(CvGV(cv));
4553 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4554 stash = CvSTASH(cv);
4556 stash = PL_curstash;
4559 /* possibly about to re-define existing subr -- ignore old cv */
4560 rcv = (SV*)PL_compcv;
4561 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4562 stash = GvSTASH(gv);
4564 stash = PL_curstash;
4566 apply_attrs(stash, rcv, attrs);
4568 if (cv) { /* must reuse cv if autoloaded */
4570 /* got here with just attrs -- work done, so bug out */
4571 SAVEFREESV(PL_compcv);
4575 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4576 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4577 CvOUTSIDE(PL_compcv) = 0;
4578 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4579 CvPADLIST(PL_compcv) = 0;
4580 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4581 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4582 SvREFCNT_dec(PL_compcv);
4589 PL_sub_generation++;
4592 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4593 CvFILE(cv) = CopFILE(PL_curcop);
4594 CvSTASH(cv) = PL_curstash;
4597 if (!CvMUTEXP(cv)) {
4598 New(666, CvMUTEXP(cv), 1, perl_mutex);
4599 MUTEX_INIT(CvMUTEXP(cv));
4601 #endif /* USE_THREADS */
4604 sv_setpv((SV*)cv, ps);
4606 if (PL_error_count) {
4610 char *s = strrchr(name, ':');
4612 if (strEQ(s, "BEGIN")) {
4614 "BEGIN not safe after errors--compilation aborted";
4615 if (PL_in_eval & EVAL_KEEPERR)
4616 Perl_croak(aTHX_ not_safe);
4618 /* force display of errors found but not reported */
4619 sv_catpv(ERRSV, not_safe);
4620 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4628 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4629 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4632 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4635 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4637 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4638 OpREFCNT_set(CvROOT(cv), 1);
4639 CvSTART(cv) = LINKLIST(CvROOT(cv));
4640 CvROOT(cv)->op_next = 0;
4643 /* now that optimizer has done its work, adjust pad values */
4645 SV **namep = AvARRAY(PL_comppad_name);
4646 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4649 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4652 * The only things that a clonable function needs in its
4653 * pad are references to outer lexicals and anonymous subs.
4654 * The rest are created anew during cloning.
4656 if (!((namesv = namep[ix]) != Nullsv &&
4657 namesv != &PL_sv_undef &&
4659 *SvPVX(namesv) == '&')))
4661 SvREFCNT_dec(PL_curpad[ix]);
4662 PL_curpad[ix] = Nullsv;
4665 assert(!CvCONST(cv));
4666 if (ps && !*ps && op_const_sv(block, cv))
4670 AV *av = newAV(); /* Will be @_ */
4672 av_store(PL_comppad, 0, (SV*)av);
4673 AvFLAGS(av) = AVf_REIFY;
4675 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4676 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4678 if (!SvPADMY(PL_curpad[ix]))
4679 SvPADTMP_on(PL_curpad[ix]);
4683 if (name || aname) {
4685 char *tname = (name ? name : aname);
4687 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4688 SV *sv = NEWSV(0,0);
4689 SV *tmpstr = sv_newmortal();
4690 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4694 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4696 (long)PL_subline, (long)CopLINE(PL_curcop));
4697 gv_efullname3(tmpstr, gv, Nullch);
4698 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4699 hv = GvHVn(db_postponed);
4700 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4701 && (pcv = GvCV(db_postponed)))
4707 call_sv((SV*)pcv, G_DISCARD);
4711 if ((s = strrchr(tname,':')))
4716 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4719 if (strEQ(s, "BEGIN")) {
4720 I32 oldscope = PL_scopestack_ix;
4722 SAVECOPFILE(&PL_compiling);
4723 SAVECOPLINE(&PL_compiling);
4725 sv_setsv(PL_rs, PL_nrs);
4728 PL_beginav = newAV();
4729 DEBUG_x( dump_sub(gv) );
4730 av_push(PL_beginav, (SV*)cv);
4731 GvCV(gv) = 0; /* cv has been hijacked */
4732 call_list(oldscope, PL_beginav);
4734 PL_curcop = &PL_compiling;
4735 PL_compiling.op_private = PL_hints;
4738 else if (strEQ(s, "END") && !PL_error_count) {
4741 DEBUG_x( dump_sub(gv) );
4742 av_unshift(PL_endav, 1);
4743 av_store(PL_endav, 0, (SV*)cv);
4744 GvCV(gv) = 0; /* cv has been hijacked */
4746 else if (strEQ(s, "CHECK") && !PL_error_count) {
4748 PL_checkav = newAV();
4749 DEBUG_x( dump_sub(gv) );
4750 if (PL_main_start && ckWARN(WARN_VOID))
4751 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4752 av_unshift(PL_checkav, 1);
4753 av_store(PL_checkav, 0, (SV*)cv);
4754 GvCV(gv) = 0; /* cv has been hijacked */
4756 else if (strEQ(s, "INIT") && !PL_error_count) {
4758 PL_initav = newAV();
4759 DEBUG_x( dump_sub(gv) );
4760 if (PL_main_start && ckWARN(WARN_VOID))
4761 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4762 av_push(PL_initav, (SV*)cv);
4763 GvCV(gv) = 0; /* cv has been hijacked */
4768 PL_copline = NOLINE;
4773 /* XXX unsafe for threads if eval_owner isn't held */
4775 =for apidoc newCONSTSUB
4777 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4778 eligible for inlining at compile-time.
4784 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4790 SAVECOPLINE(PL_curcop);
4791 CopLINE_set(PL_curcop, PL_copline);
4794 PL_hints &= ~HINT_BLOCK_SCOPE;
4797 SAVESPTR(PL_curstash);
4798 SAVECOPSTASH(PL_curcop);
4799 PL_curstash = stash;
4801 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4803 CopSTASH(PL_curcop) = stash;
4807 cv = newXS(name, const_sv_xsub, __FILE__);
4808 CvXSUBANY(cv).any_ptr = sv;
4810 sv_setpv((SV*)cv, ""); /* prototype is "" */
4818 =for apidoc U||newXS
4820 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4826 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4828 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4831 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4833 /* just a cached method */
4837 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4838 /* already defined (or promised) */
4839 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4840 && HvNAME(GvSTASH(CvGV(cv)))
4841 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4842 line_t oldline = CopLINE(PL_curcop);
4843 if (PL_copline != NOLINE)
4844 CopLINE_set(PL_curcop, PL_copline);
4845 Perl_warner(aTHX_ WARN_REDEFINE,
4846 CvCONST(cv) ? "Constant subroutine %s redefined"
4847 : "Subroutine %s redefined"
4849 CopLINE_set(PL_curcop, oldline);
4856 if (cv) /* must reuse cv if autoloaded */
4859 cv = (CV*)NEWSV(1105,0);
4860 sv_upgrade((SV *)cv, SVt_PVCV);
4864 PL_sub_generation++;
4867 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4869 New(666, CvMUTEXP(cv), 1, perl_mutex);
4870 MUTEX_INIT(CvMUTEXP(cv));
4872 #endif /* USE_THREADS */
4873 (void)gv_fetchfile(filename);
4874 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4875 an external constant string */
4876 CvXSUB(cv) = subaddr;
4879 char *s = strrchr(name,':');
4885 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4888 if (strEQ(s, "BEGIN")) {
4890 PL_beginav = newAV();
4891 av_push(PL_beginav, (SV*)cv);
4892 GvCV(gv) = 0; /* cv has been hijacked */
4894 else if (strEQ(s, "END")) {
4897 av_unshift(PL_endav, 1);
4898 av_store(PL_endav, 0, (SV*)cv);
4899 GvCV(gv) = 0; /* cv has been hijacked */
4901 else if (strEQ(s, "CHECK")) {
4903 PL_checkav = newAV();
4904 if (PL_main_start && ckWARN(WARN_VOID))
4905 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4906 av_unshift(PL_checkav, 1);
4907 av_store(PL_checkav, 0, (SV*)cv);
4908 GvCV(gv) = 0; /* cv has been hijacked */
4910 else if (strEQ(s, "INIT")) {
4912 PL_initav = newAV();
4913 if (PL_main_start && ckWARN(WARN_VOID))
4914 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4915 av_push(PL_initav, (SV*)cv);
4916 GvCV(gv) = 0; /* cv has been hijacked */
4927 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4936 name = SvPVx(cSVOPo->op_sv, n_a);
4939 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4941 if ((cv = GvFORM(gv))) {
4942 if (ckWARN(WARN_REDEFINE)) {
4943 line_t oldline = CopLINE(PL_curcop);
4945 CopLINE_set(PL_curcop, PL_copline);
4946 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4947 CopLINE_set(PL_curcop, oldline);
4953 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4954 CvFILE(cv) = CopFILE(PL_curcop);
4956 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4957 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4958 SvPADTMP_on(PL_curpad[ix]);
4961 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4962 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4963 OpREFCNT_set(CvROOT(cv), 1);
4964 CvSTART(cv) = LINKLIST(CvROOT(cv));
4965 CvROOT(cv)->op_next = 0;
4968 PL_copline = NOLINE;
4973 Perl_newANONLIST(pTHX_ OP *o)
4975 return newUNOP(OP_REFGEN, 0,
4976 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4980 Perl_newANONHASH(pTHX_ OP *o)
4982 return newUNOP(OP_REFGEN, 0,
4983 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4987 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4989 return newANONATTRSUB(floor, proto, Nullop, block);
4993 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4995 return newUNOP(OP_REFGEN, 0,
4996 newSVOP(OP_ANONCODE, 0,
4997 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
5001 Perl_oopsAV(pTHX_ OP *o)
5003 switch (o->op_type) {
5005 o->op_type = OP_PADAV;
5006 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5007 return ref(o, OP_RV2AV);
5010 o->op_type = OP_RV2AV;
5011 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
5016 if (ckWARN_d(WARN_INTERNAL))
5017 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
5024 Perl_oopsHV(pTHX_ OP *o)
5026 switch (o->op_type) {
5029 o->op_type = OP_PADHV;
5030 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5031 return ref(o, OP_RV2HV);
5035 o->op_type = OP_RV2HV;
5036 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
5041 if (ckWARN_d(WARN_INTERNAL))
5042 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
5049 Perl_newAVREF(pTHX_ OP *o)
5051 if (o->op_type == OP_PADANY) {
5052 o->op_type = OP_PADAV;
5053 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5056 return newUNOP(OP_RV2AV, 0, scalar(o));
5060 Perl_newGVREF(pTHX_ I32 type, OP *o)
5062 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
5063 return newUNOP(OP_NULL, 0, o);
5064 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
5068 Perl_newHVREF(pTHX_ OP *o)
5070 if (o->op_type == OP_PADANY) {
5071 o->op_type = OP_PADHV;
5072 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5075 return newUNOP(OP_RV2HV, 0, scalar(o));
5079 Perl_oopsCV(pTHX_ OP *o)
5081 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5087 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5089 return newUNOP(OP_RV2CV, flags, scalar(o));
5093 Perl_newSVREF(pTHX_ OP *o)
5095 if (o->op_type == OP_PADANY) {
5096 o->op_type = OP_PADSV;
5097 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5100 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
5101 o->op_flags |= OPpDONE_SVREF;
5104 return newUNOP(OP_RV2SV, 0, scalar(o));
5107 /* Check routines. */
5110 Perl_ck_anoncode(pTHX_ OP *o)
5115 name = NEWSV(1106,0);
5116 sv_upgrade(name, SVt_PVNV);
5117 sv_setpvn(name, "&", 1);
5120 ix = pad_alloc(o->op_type, SVs_PADMY);
5121 av_store(PL_comppad_name, ix, name);
5122 av_store(PL_comppad, ix, cSVOPo->op_sv);
5123 SvPADMY_on(cSVOPo->op_sv);
5124 cSVOPo->op_sv = Nullsv;
5125 cSVOPo->op_targ = ix;
5130 Perl_ck_bitop(pTHX_ OP *o)
5132 o->op_private = PL_hints;
5137 Perl_ck_concat(pTHX_ OP *o)
5139 if (cUNOPo->op_first->op_type == OP_CONCAT)
5140 o->op_flags |= OPf_STACKED;
5145 Perl_ck_spair(pTHX_ OP *o)
5147 if (o->op_flags & OPf_KIDS) {
5150 OPCODE type = o->op_type;
5151 o = modkids(ck_fun(o), type);
5152 kid = cUNOPo->op_first;
5153 newop = kUNOP->op_first->op_sibling;
5155 (newop->op_sibling ||
5156 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5157 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5158 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5162 op_free(kUNOP->op_first);
5163 kUNOP->op_first = newop;
5165 o->op_ppaddr = PL_ppaddr[++o->op_type];
5170 Perl_ck_delete(pTHX_ OP *o)
5174 if (o->op_flags & OPf_KIDS) {
5175 OP *kid = cUNOPo->op_first;
5176 switch (kid->op_type) {
5178 o->op_flags |= OPf_SPECIAL;
5181 o->op_private |= OPpSLICE;
5184 o->op_flags |= OPf_SPECIAL;
5189 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5190 PL_op_desc[o->op_type]);
5198 Perl_ck_eof(pTHX_ OP *o)
5200 I32 type = o->op_type;
5202 if (o->op_flags & OPf_KIDS) {
5203 if (cLISTOPo->op_first->op_type == OP_STUB) {
5205 o = newUNOP(type, OPf_SPECIAL,
5206 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5214 Perl_ck_eval(pTHX_ OP *o)
5216 PL_hints |= HINT_BLOCK_SCOPE;
5217 if (o->op_flags & OPf_KIDS) {
5218 SVOP *kid = (SVOP*)cUNOPo->op_first;
5221 o->op_flags &= ~OPf_KIDS;
5224 else if (kid->op_type == OP_LINESEQ) {
5227 kid->op_next = o->op_next;
5228 cUNOPo->op_first = 0;
5231 NewOp(1101, enter, 1, LOGOP);
5232 enter->op_type = OP_ENTERTRY;
5233 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5234 enter->op_private = 0;
5236 /* establish postfix order */
5237 enter->op_next = (OP*)enter;
5239 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5240 o->op_type = OP_LEAVETRY;
5241 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5242 enter->op_other = o;
5250 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5252 o->op_targ = (PADOFFSET)PL_hints;
5257 Perl_ck_exit(pTHX_ OP *o)
5260 HV *table = GvHV(PL_hintgv);
5262 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
5263 if (svp && *svp && SvTRUE(*svp))
5264 o->op_private |= OPpEXIT_VMSISH;
5271 Perl_ck_exec(pTHX_ OP *o)
5274 if (o->op_flags & OPf_STACKED) {
5276 kid = cUNOPo->op_first->op_sibling;
5277 if (kid->op_type == OP_RV2GV)
5286 Perl_ck_exists(pTHX_ OP *o)
5289 if (o->op_flags & OPf_KIDS) {
5290 OP *kid = cUNOPo->op_first;
5291 if (kid->op_type == OP_ENTERSUB) {
5292 (void) ref(kid, o->op_type);
5293 if (kid->op_type != OP_RV2CV && !PL_error_count)
5294 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5295 PL_op_desc[o->op_type]);
5296 o->op_private |= OPpEXISTS_SUB;
5298 else if (kid->op_type == OP_AELEM)
5299 o->op_flags |= OPf_SPECIAL;
5300 else if (kid->op_type != OP_HELEM)
5301 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5302 PL_op_desc[o->op_type]);
5310 Perl_ck_gvconst(pTHX_ register OP *o)
5312 o = fold_constants(o);
5313 if (o->op_type == OP_CONST)
5320 Perl_ck_rvconst(pTHX_ register OP *o)
5322 SVOP *kid = (SVOP*)cUNOPo->op_first;
5324 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5325 if (kid->op_type == OP_CONST) {
5329 SV *kidsv = kid->op_sv;
5332 /* Is it a constant from cv_const_sv()? */
5333 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5334 SV *rsv = SvRV(kidsv);
5335 int svtype = SvTYPE(rsv);
5336 char *badtype = Nullch;
5338 switch (o->op_type) {
5340 if (svtype > SVt_PVMG)
5341 badtype = "a SCALAR";
5344 if (svtype != SVt_PVAV)
5345 badtype = "an ARRAY";
5348 if (svtype != SVt_PVHV) {
5349 if (svtype == SVt_PVAV) { /* pseudohash? */
5350 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5351 if (ksv && SvROK(*ksv)
5352 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5361 if (svtype != SVt_PVCV)
5366 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5369 name = SvPV(kidsv, n_a);
5370 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5371 char *badthing = Nullch;
5372 switch (o->op_type) {
5374 badthing = "a SCALAR";
5377 badthing = "an ARRAY";
5380 badthing = "a HASH";
5385 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5389 * This is a little tricky. We only want to add the symbol if we
5390 * didn't add it in the lexer. Otherwise we get duplicate strict
5391 * warnings. But if we didn't add it in the lexer, we must at
5392 * least pretend like we wanted to add it even if it existed before,
5393 * or we get possible typo warnings. OPpCONST_ENTERED says
5394 * whether the lexer already added THIS instance of this symbol.
5396 iscv = (o->op_type == OP_RV2CV) * 2;
5398 gv = gv_fetchpv(name,
5399 iscv | !(kid->op_private & OPpCONST_ENTERED),
5402 : o->op_type == OP_RV2SV
5404 : o->op_type == OP_RV2AV
5406 : o->op_type == OP_RV2HV
5409 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5411 kid->op_type = OP_GV;
5412 SvREFCNT_dec(kid->op_sv);
5414 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5415 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5416 SvREFCNT_dec(PL_curpad[kPADOP->op_padix]);
5418 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5420 kid->op_sv = SvREFCNT_inc(gv);
5422 kid->op_ppaddr = PL_ppaddr[OP_GV];
5429 Perl_ck_ftst(pTHX_ OP *o)
5431 I32 type = o->op_type;
5433 if (o->op_flags & OPf_REF) {
5436 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5437 SVOP *kid = (SVOP*)cUNOPo->op_first;
5439 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5441 OP *newop = newGVOP(type, OPf_REF,
5442 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5449 if (type == OP_FTTTY)
5450 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5453 o = newUNOP(type, 0, newDEFSVOP());
5456 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5458 if (PL_hints & HINT_LOCALE)
5459 o->op_private |= OPpLOCALE;
5466 Perl_ck_fun(pTHX_ OP *o)
5472 int type = o->op_type;
5473 register I32 oa = PL_opargs[type] >> OASHIFT;
5475 if (o->op_flags & OPf_STACKED) {
5476 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5479 return no_fh_allowed(o);
5482 if (o->op_flags & OPf_KIDS) {
5484 tokid = &cLISTOPo->op_first;
5485 kid = cLISTOPo->op_first;
5486 if (kid->op_type == OP_PUSHMARK ||
5487 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5489 tokid = &kid->op_sibling;
5490 kid = kid->op_sibling;
5492 if (!kid && PL_opargs[type] & OA_DEFGV)
5493 *tokid = kid = newDEFSVOP();
5497 sibl = kid->op_sibling;
5500 /* list seen where single (scalar) arg expected? */
5501 if (numargs == 1 && !(oa >> 4)
5502 && kid->op_type == OP_LIST && type != OP_SCALAR)
5504 return too_many_arguments(o,PL_op_desc[type]);
5517 if (kid->op_type == OP_CONST &&
5518 (kid->op_private & OPpCONST_BARE))
5520 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5521 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5522 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5523 if (ckWARN(WARN_DEPRECATED))
5524 Perl_warner(aTHX_ WARN_DEPRECATED,
5525 "Array @%s missing the @ in argument %"IVdf" of %s()",
5526 name, (IV)numargs, PL_op_desc[type]);
5529 kid->op_sibling = sibl;
5532 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5533 bad_type(numargs, "array", PL_op_desc[type], kid);
5537 if (kid->op_type == OP_CONST &&
5538 (kid->op_private & OPpCONST_BARE))
5540 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5541 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5542 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5543 if (ckWARN(WARN_DEPRECATED))
5544 Perl_warner(aTHX_ WARN_DEPRECATED,
5545 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5546 name, (IV)numargs, PL_op_desc[type]);
5549 kid->op_sibling = sibl;
5552 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5553 bad_type(numargs, "hash", PL_op_desc[type], kid);
5558 OP *newop = newUNOP(OP_NULL, 0, kid);
5559 kid->op_sibling = 0;
5561 newop->op_next = newop;
5563 kid->op_sibling = sibl;
5568 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5569 if (kid->op_type == OP_CONST &&
5570 (kid->op_private & OPpCONST_BARE))
5572 OP *newop = newGVOP(OP_GV, 0,
5573 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5578 else if (kid->op_type == OP_READLINE) {
5579 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5580 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5583 I32 flags = OPf_SPECIAL;
5587 /* is this op a FH constructor? */
5588 if (is_handle_constructor(o,numargs)) {
5589 char *name = Nullch;
5593 /* Set a flag to tell rv2gv to vivify
5594 * need to "prove" flag does not mean something
5595 * else already - NI-S 1999/05/07
5598 if (kid->op_type == OP_PADSV) {
5599 SV **namep = av_fetch(PL_comppad_name,
5601 if (namep && *namep)
5602 name = SvPV(*namep, len);
5604 else if (kid->op_type == OP_RV2SV
5605 && kUNOP->op_first->op_type == OP_GV)
5607 GV *gv = cGVOPx_gv(kUNOP->op_first);
5609 len = GvNAMELEN(gv);
5611 else if (kid->op_type == OP_AELEM
5612 || kid->op_type == OP_HELEM)
5614 name = "__ANONIO__";
5620 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5621 namesv = PL_curpad[targ];
5622 (void)SvUPGRADE(namesv, SVt_PV);
5624 sv_setpvn(namesv, "$", 1);
5625 sv_catpvn(namesv, name, len);
5628 kid->op_sibling = 0;
5629 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5630 kid->op_targ = targ;
5631 kid->op_private |= priv;
5633 kid->op_sibling = sibl;
5639 mod(scalar(kid), type);
5643 tokid = &kid->op_sibling;
5644 kid = kid->op_sibling;
5646 o->op_private |= numargs;
5648 return too_many_arguments(o,PL_op_desc[o->op_type]);
5651 else if (PL_opargs[type] & OA_DEFGV) {
5653 return newUNOP(type, 0, newDEFSVOP());
5657 while (oa & OA_OPTIONAL)
5659 if (oa && oa != OA_LIST)
5660 return too_few_arguments(o,PL_op_desc[o->op_type]);
5666 Perl_ck_glob(pTHX_ OP *o)
5671 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5672 append_elem(OP_GLOB, o, newDEFSVOP());
5674 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5675 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5677 #if !defined(PERL_EXTERNAL_GLOB)
5678 /* XXX this can be tightened up and made more failsafe. */
5681 Perl_load_module(aTHX_ 0, newSVpvn("File::Glob", 10), Nullsv,
5682 /* null-terminated import list */
5683 newSVpvn(":globally", 9), Nullsv);
5684 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5687 #endif /* PERL_EXTERNAL_GLOB */
5689 if (gv && GvIMPORTED_CV(gv)) {
5690 append_elem(OP_GLOB, o,
5691 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5692 o->op_type = OP_LIST;
5693 o->op_ppaddr = PL_ppaddr[OP_LIST];
5694 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5695 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5696 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5697 append_elem(OP_LIST, o,
5698 scalar(newUNOP(OP_RV2CV, 0,
5699 newGVOP(OP_GV, 0, gv)))));
5700 o = newUNOP(OP_NULL, 0, ck_subr(o));
5701 o->op_targ = OP_GLOB; /* hint at what it used to be */
5704 gv = newGVgen("main");
5706 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5712 Perl_ck_grep(pTHX_ OP *o)
5716 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5718 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5719 NewOp(1101, gwop, 1, LOGOP);
5721 if (o->op_flags & OPf_STACKED) {
5724 kid = cLISTOPo->op_first->op_sibling;
5725 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5728 kid->op_next = (OP*)gwop;
5729 o->op_flags &= ~OPf_STACKED;
5731 kid = cLISTOPo->op_first->op_sibling;
5732 if (type == OP_MAPWHILE)
5739 kid = cLISTOPo->op_first->op_sibling;
5740 if (kid->op_type != OP_NULL)
5741 Perl_croak(aTHX_ "panic: ck_grep");
5742 kid = kUNOP->op_first;
5744 gwop->op_type = type;
5745 gwop->op_ppaddr = PL_ppaddr[type];
5746 gwop->op_first = listkids(o);
5747 gwop->op_flags |= OPf_KIDS;
5748 gwop->op_private = 1;
5749 gwop->op_other = LINKLIST(kid);
5750 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5751 kid->op_next = (OP*)gwop;
5753 kid = cLISTOPo->op_first->op_sibling;
5754 if (!kid || !kid->op_sibling)
5755 return too_few_arguments(o,PL_op_desc[o->op_type]);
5756 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5757 mod(kid, OP_GREPSTART);
5763 Perl_ck_index(pTHX_ OP *o)
5765 if (o->op_flags & OPf_KIDS) {
5766 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5768 kid = kid->op_sibling; /* get past "big" */
5769 if (kid && kid->op_type == OP_CONST)
5770 fbm_compile(((SVOP*)kid)->op_sv, 0);
5776 Perl_ck_lengthconst(pTHX_ OP *o)
5778 /* XXX length optimization goes here */
5783 Perl_ck_lfun(pTHX_ OP *o)
5785 OPCODE type = o->op_type;
5786 return modkids(ck_fun(o), type);
5790 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5792 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5793 switch (cUNOPo->op_first->op_type) {
5795 /* This is needed for
5796 if (defined %stash::)
5797 to work. Do not break Tk.
5799 break; /* Globals via GV can be undef */
5801 case OP_AASSIGN: /* Is this a good idea? */
5802 Perl_warner(aTHX_ WARN_DEPRECATED,
5803 "defined(@array) is deprecated");
5804 Perl_warner(aTHX_ WARN_DEPRECATED,
5805 "\t(Maybe you should just omit the defined()?)\n");
5808 /* This is needed for
5809 if (defined %stash::)
5810 to work. Do not break Tk.
5812 break; /* Globals via GV can be undef */
5814 Perl_warner(aTHX_ WARN_DEPRECATED,
5815 "defined(%%hash) is deprecated");
5816 Perl_warner(aTHX_ WARN_DEPRECATED,
5817 "\t(Maybe you should just omit the defined()?)\n");
5828 Perl_ck_rfun(pTHX_ OP *o)
5830 OPCODE type = o->op_type;
5831 return refkids(ck_fun(o), type);
5835 Perl_ck_listiob(pTHX_ OP *o)
5839 kid = cLISTOPo->op_first;
5842 kid = cLISTOPo->op_first;
5844 if (kid->op_type == OP_PUSHMARK)
5845 kid = kid->op_sibling;
5846 if (kid && o->op_flags & OPf_STACKED)
5847 kid = kid->op_sibling;
5848 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5849 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5850 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5851 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5852 cLISTOPo->op_first->op_sibling = kid;
5853 cLISTOPo->op_last = kid;
5854 kid = kid->op_sibling;
5859 append_elem(o->op_type, o, newDEFSVOP());
5865 if (PL_hints & HINT_LOCALE)
5866 o->op_private |= OPpLOCALE;
5873 Perl_ck_fun_locale(pTHX_ OP *o)
5879 if (PL_hints & HINT_LOCALE)
5880 o->op_private |= OPpLOCALE;
5887 Perl_ck_sassign(pTHX_ OP *o)
5889 OP *kid = cLISTOPo->op_first;
5890 /* has a disposable target? */
5891 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5892 && !(kid->op_flags & OPf_STACKED)
5893 /* Cannot steal the second time! */
5894 && !(kid->op_private & OPpTARGET_MY))
5896 OP *kkid = kid->op_sibling;
5898 /* Can just relocate the target. */
5899 if (kkid && kkid->op_type == OP_PADSV
5900 && !(kkid->op_private & OPpLVAL_INTRO))
5902 kid->op_targ = kkid->op_targ;
5904 /* Now we do not need PADSV and SASSIGN. */
5905 kid->op_sibling = o->op_sibling; /* NULL */
5906 cLISTOPo->op_first = NULL;
5909 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5917 Perl_ck_scmp(pTHX_ OP *o)
5921 if (PL_hints & HINT_LOCALE)
5922 o->op_private |= OPpLOCALE;
5929 Perl_ck_match(pTHX_ OP *o)
5931 o->op_private |= OPpRUNTIME;
5936 Perl_ck_method(pTHX_ OP *o)
5938 OP *kid = cUNOPo->op_first;
5939 if (kid->op_type == OP_CONST) {
5940 SV* sv = kSVOP->op_sv;
5941 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5943 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
5944 sv = newSVpvn_share(SvPVX(sv), SvCUR(sv), 0);
5947 kSVOP->op_sv = Nullsv;
5949 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5958 Perl_ck_null(pTHX_ OP *o)
5964 Perl_ck_open(pTHX_ OP *o)
5966 HV *table = GvHV(PL_hintgv);
5970 svp = hv_fetch(table, "open_IN", 7, FALSE);
5972 mode = mode_from_discipline(*svp);
5973 if (mode & O_BINARY)
5974 o->op_private |= OPpOPEN_IN_RAW;
5975 else if (mode & O_TEXT)
5976 o->op_private |= OPpOPEN_IN_CRLF;
5979 svp = hv_fetch(table, "open_OUT", 8, FALSE);
5981 mode = mode_from_discipline(*svp);
5982 if (mode & O_BINARY)
5983 o->op_private |= OPpOPEN_OUT_RAW;
5984 else if (mode & O_TEXT)
5985 o->op_private |= OPpOPEN_OUT_CRLF;
5988 if (o->op_type == OP_BACKTICK)
5994 Perl_ck_repeat(pTHX_ OP *o)
5996 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5997 o->op_private |= OPpREPEAT_DOLIST;
5998 cBINOPo->op_first = force_list(cBINOPo->op_first);
6006 Perl_ck_require(pTHX_ OP *o)
6008 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
6009 SVOP *kid = (SVOP*)cUNOPo->op_first;
6011 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6013 for (s = SvPVX(kid->op_sv); *s; s++) {
6014 if (*s == ':' && s[1] == ':') {
6016 Move(s+2, s+1, strlen(s+2)+1, char);
6017 --SvCUR(kid->op_sv);
6020 if (SvREADONLY(kid->op_sv)) {
6021 SvREADONLY_off(kid->op_sv);
6022 sv_catpvn(kid->op_sv, ".pm", 3);
6023 SvREADONLY_on(kid->op_sv);
6026 sv_catpvn(kid->op_sv, ".pm", 3);
6034 Perl_ck_retarget(pTHX_ OP *o)
6036 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
6043 Perl_ck_select(pTHX_ OP *o)
6046 if (o->op_flags & OPf_KIDS) {
6047 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6048 if (kid && kid->op_sibling) {
6049 o->op_type = OP_SSELECT;
6050 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
6052 return fold_constants(o);
6056 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6057 if (kid && kid->op_type == OP_RV2GV)
6058 kid->op_private &= ~HINT_STRICT_REFS;
6063 Perl_ck_shift(pTHX_ OP *o)
6065 I32 type = o->op_type;
6067 if (!(o->op_flags & OPf_KIDS)) {
6072 if (!CvUNIQUE(PL_compcv)) {
6073 argop = newOP(OP_PADAV, OPf_REF);
6074 argop->op_targ = 0; /* PL_curpad[0] is @_ */
6077 argop = newUNOP(OP_RV2AV, 0,
6078 scalar(newGVOP(OP_GV, 0,
6079 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6082 argop = newUNOP(OP_RV2AV, 0,
6083 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
6084 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6085 #endif /* USE_THREADS */
6086 return newUNOP(type, 0, scalar(argop));
6088 return scalar(modkids(ck_fun(o), type));
6092 Perl_ck_sort(pTHX_ OP *o)
6097 if (PL_hints & HINT_LOCALE)
6098 o->op_private |= OPpLOCALE;
6101 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
6103 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6104 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
6106 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
6108 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
6110 if (kid->op_type == OP_SCOPE) {
6114 else if (kid->op_type == OP_LEAVE) {
6115 if (o->op_type == OP_SORT) {
6116 null(kid); /* wipe out leave */
6119 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
6120 if (k->op_next == kid)
6122 /* don't descend into loops */
6123 else if (k->op_type == OP_ENTERLOOP
6124 || k->op_type == OP_ENTERITER)
6126 k = cLOOPx(k)->op_lastop;
6131 kid->op_next = 0; /* just disconnect the leave */
6132 k = kLISTOP->op_first;
6137 if (o->op_type == OP_SORT) {
6138 /* provide scalar context for comparison function/block */
6144 o->op_flags |= OPf_SPECIAL;
6146 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
6149 firstkid = firstkid->op_sibling;
6152 /* provide list context for arguments */
6153 if (o->op_type == OP_SORT)
6160 S_simplify_sort(pTHX_ OP *o)
6162 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6166 if (!(o->op_flags & OPf_STACKED))
6168 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
6169 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
6170 kid = kUNOP->op_first; /* get past null */
6171 if (kid->op_type != OP_SCOPE)
6173 kid = kLISTOP->op_last; /* get past scope */
6174 switch(kid->op_type) {
6182 k = kid; /* remember this node*/
6183 if (kBINOP->op_first->op_type != OP_RV2SV)
6185 kid = kBINOP->op_first; /* get past cmp */
6186 if (kUNOP->op_first->op_type != OP_GV)
6188 kid = kUNOP->op_first; /* get past rv2sv */
6190 if (GvSTASH(gv) != PL_curstash)
6192 if (strEQ(GvNAME(gv), "a"))
6194 else if (strEQ(GvNAME(gv), "b"))
6198 kid = k; /* back to cmp */
6199 if (kBINOP->op_last->op_type != OP_RV2SV)
6201 kid = kBINOP->op_last; /* down to 2nd arg */
6202 if (kUNOP->op_first->op_type != OP_GV)
6204 kid = kUNOP->op_first; /* get past rv2sv */
6206 if (GvSTASH(gv) != PL_curstash
6208 ? strNE(GvNAME(gv), "a")
6209 : strNE(GvNAME(gv), "b")))
6211 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6213 o->op_private |= OPpSORT_REVERSE;
6214 if (k->op_type == OP_NCMP)
6215 o->op_private |= OPpSORT_NUMERIC;
6216 if (k->op_type == OP_I_NCMP)
6217 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6218 kid = cLISTOPo->op_first->op_sibling;
6219 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6220 op_free(kid); /* then delete it */
6221 cLISTOPo->op_children--;
6225 Perl_ck_split(pTHX_ OP *o)
6229 if (o->op_flags & OPf_STACKED)
6230 return no_fh_allowed(o);
6232 kid = cLISTOPo->op_first;
6233 if (kid->op_type != OP_NULL)
6234 Perl_croak(aTHX_ "panic: ck_split");
6235 kid = kid->op_sibling;
6236 op_free(cLISTOPo->op_first);
6237 cLISTOPo->op_first = kid;
6239 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6240 cLISTOPo->op_last = kid; /* There was only one element previously */
6243 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
6244 OP *sibl = kid->op_sibling;
6245 kid->op_sibling = 0;
6246 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6247 if (cLISTOPo->op_first == cLISTOPo->op_last)
6248 cLISTOPo->op_last = kid;
6249 cLISTOPo->op_first = kid;
6250 kid->op_sibling = sibl;
6253 kid->op_type = OP_PUSHRE;
6254 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6257 if (!kid->op_sibling)
6258 append_elem(OP_SPLIT, o, newDEFSVOP());
6260 kid = kid->op_sibling;
6263 if (!kid->op_sibling)
6264 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6266 kid = kid->op_sibling;
6269 if (kid->op_sibling)
6270 return too_many_arguments(o,PL_op_desc[o->op_type]);
6276 Perl_ck_join(pTHX_ OP *o)
6278 if (ckWARN(WARN_SYNTAX)) {
6279 OP *kid = cLISTOPo->op_first->op_sibling;
6280 if (kid && kid->op_type == OP_MATCH) {
6281 char *pmstr = "STRING";
6282 if (kPMOP->op_pmregexp)
6283 pmstr = kPMOP->op_pmregexp->precomp;
6284 Perl_warner(aTHX_ WARN_SYNTAX,
6285 "/%s/ should probably be written as \"%s\"",
6293 Perl_ck_subr(pTHX_ OP *o)
6295 OP *prev = ((cUNOPo->op_first->op_sibling)
6296 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6297 OP *o2 = prev->op_sibling;
6306 o->op_private |= OPpENTERSUB_HASTARG;
6307 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6308 if (cvop->op_type == OP_RV2CV) {
6310 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6311 null(cvop); /* disable rv2cv */
6312 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6313 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6314 GV *gv = cGVOPx_gv(tmpop);
6317 tmpop->op_private |= OPpEARLY_CV;
6318 else if (SvPOK(cv)) {
6319 namegv = CvANON(cv) ? gv : CvGV(cv);
6320 proto = SvPV((SV*)cv, n_a);
6324 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6325 if (o2->op_type == OP_CONST)
6326 o2->op_private &= ~OPpCONST_STRICT;
6327 else if (o2->op_type == OP_LIST) {
6328 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6329 if (o && o->op_type == OP_CONST)
6330 o->op_private &= ~OPpCONST_STRICT;
6333 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6334 if (PERLDB_SUB && PL_curstash != PL_debstash)
6335 o->op_private |= OPpENTERSUB_DB;
6336 while (o2 != cvop) {
6340 return too_many_arguments(o, gv_ename(namegv));
6358 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6360 arg == 1 ? "block or sub {}" : "sub {}",
6361 gv_ename(namegv), o2);
6364 /* '*' allows any scalar type, including bareword */
6367 if (o2->op_type == OP_RV2GV)
6368 goto wrapref; /* autoconvert GLOB -> GLOBref */
6369 else if (o2->op_type == OP_CONST)
6370 o2->op_private &= ~OPpCONST_STRICT;
6371 else if (o2->op_type == OP_ENTERSUB) {
6372 /* accidental subroutine, revert to bareword */
6373 OP *gvop = ((UNOP*)o2)->op_first;
6374 if (gvop && gvop->op_type == OP_NULL) {
6375 gvop = ((UNOP*)gvop)->op_first;
6377 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6380 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6381 (gvop = ((UNOP*)gvop)->op_first) &&
6382 gvop->op_type == OP_GV)
6384 GV *gv = cGVOPx_gv(gvop);
6385 OP *sibling = o2->op_sibling;
6386 SV *n = newSVpvn("",0);
6388 gv_fullname3(n, gv, "");
6389 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6390 sv_chop(n, SvPVX(n)+6);
6391 o2 = newSVOP(OP_CONST, 0, n);
6392 prev->op_sibling = o2;
6393 o2->op_sibling = sibling;
6405 if (o2->op_type != OP_RV2GV)
6406 bad_type(arg, "symbol", gv_ename(namegv), o2);
6409 if (o2->op_type != OP_ENTERSUB)
6410 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6413 if (o2->op_type != OP_RV2SV
6414 && o2->op_type != OP_PADSV
6415 && o2->op_type != OP_HELEM
6416 && o2->op_type != OP_AELEM
6417 && o2->op_type != OP_THREADSV)
6419 bad_type(arg, "scalar", gv_ename(namegv), o2);
6423 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6424 bad_type(arg, "array", gv_ename(namegv), o2);
6427 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6428 bad_type(arg, "hash", gv_ename(namegv), o2);
6432 OP* sib = kid->op_sibling;
6433 kid->op_sibling = 0;
6434 o2 = newUNOP(OP_REFGEN, 0, kid);
6435 o2->op_sibling = sib;
6436 prev->op_sibling = o2;
6447 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6448 gv_ename(namegv), SvPV((SV*)cv, n_a));
6453 mod(o2, OP_ENTERSUB);
6455 o2 = o2->op_sibling;
6457 if (proto && !optional &&
6458 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6459 return too_few_arguments(o, gv_ename(namegv));
6464 Perl_ck_svconst(pTHX_ OP *o)
6466 SvREADONLY_on(cSVOPo->op_sv);
6471 Perl_ck_trunc(pTHX_ OP *o)
6473 if (o->op_flags & OPf_KIDS) {
6474 SVOP *kid = (SVOP*)cUNOPo->op_first;
6476 if (kid->op_type == OP_NULL)
6477 kid = (SVOP*)kid->op_sibling;
6478 if (kid && kid->op_type == OP_CONST &&
6479 (kid->op_private & OPpCONST_BARE))
6481 o->op_flags |= OPf_SPECIAL;
6482 kid->op_private &= ~OPpCONST_STRICT;
6489 Perl_ck_substr(pTHX_ OP *o)
6492 if ((o->op_flags & OPf_KIDS) && o->op_private == 4) {
6493 OP *kid = cLISTOPo->op_first;
6495 if (kid->op_type == OP_NULL)
6496 kid = kid->op_sibling;
6498 kid->op_flags |= OPf_MOD;
6504 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6507 Perl_peep(pTHX_ register OP *o)
6509 register OP* oldop = 0;
6511 OP *last_composite = Nullop;
6513 if (!o || o->op_seq)
6517 SAVEVPTR(PL_curcop);
6518 for (; o; o = o->op_next) {
6524 switch (o->op_type) {
6528 PL_curcop = ((COP*)o); /* for warnings */
6529 o->op_seq = PL_op_seqmax++;
6530 last_composite = Nullop;
6534 if (cSVOPo->op_private & OPpCONST_STRICT)
6535 no_bareword_allowed(o);
6537 /* Relocate sv to the pad for thread safety.
6538 * Despite being a "constant", the SV is written to,
6539 * for reference counts, sv_upgrade() etc. */
6541 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6542 if (SvPADTMP(cSVOPo->op_sv)) {
6543 /* If op_sv is already a PADTMP then it is being used by
6544 * some pad, so make a copy. */
6545 sv_setsv(PL_curpad[ix],cSVOPo->op_sv);
6546 SvREADONLY_on(PL_curpad[ix]);
6547 SvREFCNT_dec(cSVOPo->op_sv);
6550 SvREFCNT_dec(PL_curpad[ix]);
6551 SvPADTMP_on(cSVOPo->op_sv);
6552 PL_curpad[ix] = cSVOPo->op_sv;
6553 /* XXX I don't know how this isn't readonly already. */
6554 SvREADONLY_on(PL_curpad[ix]);
6556 cSVOPo->op_sv = Nullsv;
6560 o->op_seq = PL_op_seqmax++;
6564 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6565 if (o->op_next->op_private & OPpTARGET_MY) {
6566 if (o->op_flags & OPf_STACKED) /* chained concats */
6567 goto ignore_optimization;
6569 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6570 o->op_targ = o->op_next->op_targ;
6571 o->op_next->op_targ = 0;
6572 o->op_private |= OPpTARGET_MY;
6577 ignore_optimization:
6578 o->op_seq = PL_op_seqmax++;
6581 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6582 o->op_seq = PL_op_seqmax++;
6583 break; /* Scalar stub must produce undef. List stub is noop */
6587 if (o->op_targ == OP_NEXTSTATE
6588 || o->op_targ == OP_DBSTATE
6589 || o->op_targ == OP_SETSTATE)
6591 PL_curcop = ((COP*)o);
6598 if (oldop && o->op_next) {
6599 oldop->op_next = o->op_next;
6602 o->op_seq = PL_op_seqmax++;
6606 if (o->op_next->op_type == OP_RV2SV) {
6607 if (!(o->op_next->op_private & OPpDEREF)) {
6609 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6611 o->op_next = o->op_next->op_next;
6612 o->op_type = OP_GVSV;
6613 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6616 else if (o->op_next->op_type == OP_RV2AV) {
6617 OP* pop = o->op_next->op_next;
6619 if (pop->op_type == OP_CONST &&
6620 (PL_op = pop->op_next) &&
6621 pop->op_next->op_type == OP_AELEM &&
6622 !(pop->op_next->op_private &
6623 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6624 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6632 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6633 o->op_next = pop->op_next->op_next;
6634 o->op_type = OP_AELEMFAST;
6635 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6636 o->op_private = (U8)i;
6641 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6643 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6644 /* XXX could check prototype here instead of just carping */
6645 SV *sv = sv_newmortal();
6646 gv_efullname3(sv, gv, Nullch);
6647 Perl_warner(aTHX_ WARN_PROTOTYPE,
6648 "%s() called too early to check prototype",
6653 o->op_seq = PL_op_seqmax++;
6664 o->op_seq = PL_op_seqmax++;
6665 while (cLOGOP->op_other->op_type == OP_NULL)
6666 cLOGOP->op_other = cLOGOP->op_other->op_next;
6667 peep(cLOGOP->op_other);
6671 o->op_seq = PL_op_seqmax++;
6672 peep(cLOOP->op_redoop);
6673 peep(cLOOP->op_nextop);
6674 peep(cLOOP->op_lastop);
6680 o->op_seq = PL_op_seqmax++;
6681 peep(cPMOP->op_pmreplstart);
6685 o->op_seq = PL_op_seqmax++;
6686 if (ckWARN(WARN_SYNTAX) && o->op_next
6687 && o->op_next->op_type == OP_NEXTSTATE) {
6688 if (o->op_next->op_sibling &&
6689 o->op_next->op_sibling->op_type != OP_EXIT &&
6690 o->op_next->op_sibling->op_type != OP_WARN &&
6691 o->op_next->op_sibling->op_type != OP_DIE) {
6692 line_t oldline = CopLINE(PL_curcop);
6694 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6695 Perl_warner(aTHX_ WARN_EXEC,
6696 "Statement unlikely to be reached");
6697 Perl_warner(aTHX_ WARN_EXEC,
6698 "\t(Maybe you meant system() when you said exec()?)\n");
6699 CopLINE_set(PL_curcop, oldline);
6708 SV **svp, **indsvp, *sv;
6713 o->op_seq = PL_op_seqmax++;
6715 if (((BINOP*)o)->op_last->op_type != OP_CONST)
6718 /* Make the CONST have a shared SV */
6719 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6720 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv)) && !IS_PADCONST(sv)) {
6721 key = SvPV(sv, keylen);
6724 lexname = newSVpvn_share(key, keylen, 0);
6729 if ((o->op_private & (OPpLVAL_INTRO)))
6732 rop = (UNOP*)((BINOP*)o)->op_first;
6733 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6735 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6736 if (!SvOBJECT(lexname))
6738 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6739 if (!fields || !GvHV(*fields))
6741 key = SvPV(*svp, keylen);
6742 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6744 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6745 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6747 ind = SvIV(*indsvp);
6749 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6750 rop->op_type = OP_RV2AV;
6751 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6752 o->op_type = OP_AELEM;
6753 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6755 if (SvREADONLY(*svp))
6757 SvFLAGS(sv) |= (SvFLAGS(*svp)
6758 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6768 SV **svp, **indsvp, *sv;
6772 SVOP *first_key_op, *key_op;
6774 o->op_seq = PL_op_seqmax++;
6775 if ((o->op_private & (OPpLVAL_INTRO))
6776 /* I bet there's always a pushmark... */
6777 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
6778 /* hmmm, no optimization if list contains only one key. */
6780 rop = (UNOP*)((LISTOP*)o)->op_last;
6781 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6783 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6784 if (!SvOBJECT(lexname))
6786 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6787 if (!fields || !GvHV(*fields))
6789 /* Again guessing that the pushmark can be jumped over.... */
6790 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
6791 ->op_first->op_sibling;
6792 /* Check that the key list contains only constants. */
6793 for (key_op = first_key_op; key_op;
6794 key_op = (SVOP*)key_op->op_sibling)
6795 if (key_op->op_type != OP_CONST)
6799 rop->op_type = OP_RV2AV;
6800 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6801 o->op_type = OP_ASLICE;
6802 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
6803 for (key_op = first_key_op; key_op;
6804 key_op = (SVOP*)key_op->op_sibling) {
6805 svp = cSVOPx_svp(key_op);
6806 key = SvPV(*svp, keylen);
6807 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6809 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
6810 "in variable %s of type %s",
6811 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6813 ind = SvIV(*indsvp);
6815 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6817 if (SvREADONLY(*svp))
6819 SvFLAGS(sv) |= (SvFLAGS(*svp)
6820 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6829 if (!(o->op_flags & OPf_WANT)
6830 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6834 o->op_seq = PL_op_seqmax++;
6838 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6839 o->op_seq = PL_op_seqmax++;
6845 if (last_composite) {
6846 OP *r = last_composite;
6848 while (r->op_sibling)
6851 || (r->op_next->op_type == OP_LIST
6852 && r->op_next->op_next == o))
6854 if (last_composite->op_type == OP_RV2AV)
6855 yyerror("Lvalue subs returning arrays not implemented yet");
6857 yyerror("Lvalue subs returning hashes not implemented yet");
6864 o->op_seq = PL_op_seqmax++;
6874 /* Efficient sub that returns a constant scalar value. */
6876 const_sv_xsub(pTHXo_ CV* cv)
6880 ST(0) = (SV*)XSANY.any_ptr;