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)
114 if (!(PL_in_my == KEY_our ||
116 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
117 (name[1] == '_' && (int)strlen(name) > 2)))
119 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
120 /* 1999-02-27 mjd@plover.com */
122 p = strchr(name, '\0');
123 /* The next block assumes the buffer is at least 205 chars
124 long. At present, it's always at least 256 chars. */
126 strcpy(name+200, "...");
132 /* Move everything else down one character */
133 for (; p-name > 2; p--)
135 name[2] = toCTRL(name[1]);
138 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
140 if (ckWARN(WARN_MISC) && AvFILLp(PL_comppad_name) >= 0) {
141 SV **svp = AvARRAY(PL_comppad_name);
142 HV *ourstash = (PL_curstash ? PL_curstash : PL_defstash);
143 PADOFFSET top = AvFILLp(PL_comppad_name);
144 for (off = top; off > PL_comppad_name_floor; off--) {
146 && sv != &PL_sv_undef
147 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
148 && (PL_in_my != KEY_our
149 || ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash))
150 && strEQ(name, SvPVX(sv)))
152 Perl_warner(aTHX_ WARN_MISC,
153 "\"%s\" variable %s masks earlier declaration in same %s",
154 (PL_in_my == KEY_our ? "our" : "my"),
156 (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
161 if (PL_in_my == KEY_our) {
164 && sv != &PL_sv_undef
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)
245 register PERL_CONTEXT *cx;
247 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
248 AV *curlist = CvPADLIST(cv);
249 SV **svp = av_fetch(curlist, 0, FALSE);
252 if (!svp || *svp == &PL_sv_undef)
255 svp = AvARRAY(curname);
256 for (off = AvFILLp(curname); off > 0; off--) {
257 if ((sv = svp[off]) &&
258 sv != &PL_sv_undef &&
260 seq > I_32(SvNVX(sv)) &&
261 strEQ(SvPVX(sv), name))
272 return 0; /* don't clone from inactive stack frame */
276 oldpad = (AV*)AvARRAY(curlist)[depth];
277 oldsv = *av_fetch(oldpad, off, TRUE);
278 if (!newoff) { /* Not a mere clone operation. */
279 newoff = pad_addlex(sv);
280 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
281 /* "It's closures all the way down." */
282 CvCLONE_on(PL_compcv);
284 if (CvANON(PL_compcv))
285 oldsv = Nullsv; /* no need to keep ref */
290 bcv && bcv != cv && !CvCLONE(bcv);
291 bcv = CvOUTSIDE(bcv))
294 /* install the missing pad entry in intervening
295 * nested subs and mark them cloneable.
296 * XXX fix pad_foo() to not use globals */
297 AV *ocomppad_name = PL_comppad_name;
298 AV *ocomppad = PL_comppad;
299 SV **ocurpad = PL_curpad;
300 AV *padlist = CvPADLIST(bcv);
301 PL_comppad_name = (AV*)AvARRAY(padlist)[0];
302 PL_comppad = (AV*)AvARRAY(padlist)[1];
303 PL_curpad = AvARRAY(PL_comppad);
305 PL_comppad_name = ocomppad_name;
306 PL_comppad = ocomppad;
311 if (ckWARN(WARN_CLOSURE)
312 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
314 Perl_warner(aTHX_ WARN_CLOSURE,
315 "Variable \"%s\" may be unavailable",
323 else if (!CvUNIQUE(PL_compcv)) {
324 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv)
325 && !(SvFLAGS(sv) & SVpad_OUR))
327 Perl_warner(aTHX_ WARN_CLOSURE,
328 "Variable \"%s\" will not stay shared", name);
332 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
338 if (flags & FINDLEX_NOSEARCH)
341 /* Nothing in current lexical context--try eval's context, if any.
342 * This is necessary to let the perldb get at lexically scoped variables.
343 * XXX This will also probably interact badly with eval tree caching.
346 for (i = cx_ix; i >= 0; i--) {
348 switch (CxTYPE(cx)) {
350 if (i == 0 && saweval) {
351 seq = cxstack[saweval].blk_oldcop->cop_seq;
352 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
356 switch (cx->blk_eval.old_op_type) {
363 /* require/do must have their own scope */
372 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
373 saweval = i; /* so we know where we were called from */
376 seq = cxstack[saweval].blk_oldcop->cop_seq;
377 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
385 Perl_pad_findmy(pTHX_ char *name)
391 SV **svp = AvARRAY(PL_comppad_name);
392 U32 seq = PL_cop_seqmax;
398 * Special case to get lexical (and hence per-thread) @_.
399 * XXX I need to find out how to tell at parse-time whether use
400 * of @_ should refer to a lexical (from a sub) or defgv (global
401 * scope and maybe weird sub-ish things like formats). See
402 * startsub in perly.y. It's possible that @_ could be lexical
403 * (at least from subs) even in non-threaded perl.
405 if (strEQ(name, "@_"))
406 return 0; /* success. (NOT_IN_PAD indicates failure) */
407 #endif /* USE_THREADS */
409 /* The one we're looking for is probably just before comppad_name_fill. */
410 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
411 if ((sv = svp[off]) &&
412 sv != &PL_sv_undef &&
415 seq > I_32(SvNVX(sv)))) &&
416 strEQ(SvPVX(sv), name))
418 if (SvIVX(sv) || SvFLAGS(sv) & SVpad_OUR)
419 return (PADOFFSET)off;
420 pendoff = off; /* this pending def. will override import */
424 outside = CvOUTSIDE(PL_compcv);
426 /* Check if if we're compiling an eval'', and adjust seq to be the
427 * eval's seq number. This depends on eval'' having a non-null
428 * CvOUTSIDE() while it is being compiled. The eval'' itself is
429 * identified by CvEVAL being true and CvGV being null. */
430 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
431 cx = &cxstack[cxstack_ix];
433 seq = cx->blk_oldcop->cop_seq;
436 /* See if it's in a nested scope */
437 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
439 /* If there is a pending local definition, this new alias must die */
441 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
442 return off; /* pad_findlex returns 0 for failure...*/
444 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
448 Perl_pad_leavemy(pTHX_ I32 fill)
452 SV **svp = AvARRAY(PL_comppad_name);
454 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
455 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
456 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
457 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
460 /* "Deintroduce" my variables that are leaving with this scope. */
461 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
462 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
463 SvIVX(sv) = PL_cop_seqmax;
468 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
474 if (AvARRAY(PL_comppad) != PL_curpad)
475 Perl_croak(aTHX_ "panic: pad_alloc");
476 if (PL_pad_reset_pending)
478 if (tmptype & SVs_PADMY) {
480 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
481 } while (SvPADBUSY(sv)); /* need a fresh one */
482 retval = AvFILLp(PL_comppad);
485 SV **names = AvARRAY(PL_comppad_name);
486 SSize_t names_fill = AvFILLp(PL_comppad_name);
489 * "foreach" index vars temporarily become aliases to non-"my"
490 * values. Thus we must skip, not just pad values that are
491 * marked as current pad values, but also those with names.
493 if (++PL_padix <= names_fill &&
494 (sv = names[PL_padix]) && sv != &PL_sv_undef)
496 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
497 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)) && !IS_PADGV(sv))
502 SvFLAGS(sv) |= tmptype;
503 PL_curpad = AvARRAY(PL_comppad);
505 DEBUG_X(PerlIO_printf(Perl_debug_log,
506 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
507 PTR2UV(thr), PTR2UV(PL_curpad),
508 (long) retval, PL_op_name[optype]));
510 DEBUG_X(PerlIO_printf(Perl_debug_log,
511 "Pad 0x%"UVxf" alloc %ld for %s\n",
513 (long) retval, PL_op_name[optype]));
514 #endif /* USE_THREADS */
515 return (PADOFFSET)retval;
519 Perl_pad_sv(pTHX_ PADOFFSET po)
523 DEBUG_X(PerlIO_printf(Perl_debug_log,
524 "0x%"UVxf" Pad 0x%"UVxf" sv %"IVdf"\n",
525 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
528 Perl_croak(aTHX_ "panic: pad_sv po");
529 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %"IVdf"\n",
530 PTR2UV(PL_curpad), (IV)po));
531 #endif /* USE_THREADS */
532 return PL_curpad[po]; /* eventually we'll turn this into a macro */
536 Perl_pad_free(pTHX_ PADOFFSET po)
541 if (AvARRAY(PL_comppad) != PL_curpad)
542 Perl_croak(aTHX_ "panic: pad_free curpad");
544 Perl_croak(aTHX_ "panic: pad_free po");
546 DEBUG_X(PerlIO_printf(Perl_debug_log,
547 "0x%"UVxf" Pad 0x%"UVxf" free %"IVdf"\n",
548 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
550 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %"IVdf"\n",
551 PTR2UV(PL_curpad), (IV)po));
552 #endif /* USE_THREADS */
553 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
554 SvPADTMP_off(PL_curpad[po]);
556 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
559 if ((I32)po < PL_padix)
564 Perl_pad_swipe(pTHX_ PADOFFSET po)
567 if (AvARRAY(PL_comppad) != PL_curpad)
568 Perl_croak(aTHX_ "panic: pad_swipe curpad");
570 Perl_croak(aTHX_ "panic: pad_swipe po");
572 DEBUG_X(PerlIO_printf(Perl_debug_log,
573 "0x%"UVxf" Pad 0x%"UVxf" swipe %"IVdf"\n",
574 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
576 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %"IVdf"\n",
577 PTR2UV(PL_curpad), (IV)po));
578 #endif /* USE_THREADS */
579 SvPADTMP_off(PL_curpad[po]);
580 PL_curpad[po] = NEWSV(1107,0);
581 SvPADTMP_on(PL_curpad[po]);
582 if ((I32)po < PL_padix)
586 /* XXX pad_reset() is currently disabled because it results in serious bugs.
587 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
588 * on the stack by OPs that use them, there are several ways to get an alias
589 * to a shared TARG. Such an alias will change randomly and unpredictably.
590 * We avoid doing this until we can think of a Better Way.
595 #ifdef USE_BROKEN_PAD_RESET
599 if (AvARRAY(PL_comppad) != PL_curpad)
600 Perl_croak(aTHX_ "panic: pad_reset curpad");
602 DEBUG_X(PerlIO_printf(Perl_debug_log,
603 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
604 PTR2UV(thr), PTR2UV(PL_curpad)));
606 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
608 #endif /* USE_THREADS */
609 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
610 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
611 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
612 SvPADTMP_off(PL_curpad[po]);
614 PL_padix = PL_padix_floor;
617 PL_pad_reset_pending = FALSE;
621 /* find_threadsv is not reentrant */
623 Perl_find_threadsv(pTHX_ const char *name)
629 /* We currently only handle names of a single character */
630 p = strchr(PL_threadsv_names, *name);
633 key = p - PL_threadsv_names;
634 MUTEX_LOCK(&thr->mutex);
635 svp = av_fetch(thr->threadsv, key, FALSE);
637 MUTEX_UNLOCK(&thr->mutex);
639 SV *sv = NEWSV(0, 0);
640 av_store(thr->threadsv, key, sv);
641 thr->threadsvp = AvARRAY(thr->threadsv);
642 MUTEX_UNLOCK(&thr->mutex);
644 * Some magic variables used to be automagically initialised
645 * in gv_fetchpv. Those which are now per-thread magicals get
646 * initialised here instead.
652 sv_setpv(sv, "\034");
653 sv_magic(sv, 0, 0, name, 1);
658 PL_sawampersand = TRUE;
672 /* XXX %! tied to Errno.pm needs to be added here.
673 * See gv_fetchpv(). */
677 sv_magic(sv, 0, 0, name, 1);
679 DEBUG_S(PerlIO_printf(Perl_error_log,
680 "find_threadsv: new SV %p for $%s%c\n",
681 sv, (*name < 32) ? "^" : "",
682 (*name < 32) ? toCTRL(*name) : *name));
686 #endif /* USE_THREADS */
691 Perl_op_free(pTHX_ OP *o)
693 register OP *kid, *nextkid;
696 if (!o || o->op_seq == (U16)-1)
699 if (o->op_private & OPpREFCOUNTED) {
700 switch (o->op_type) {
708 if (OpREFCNT_dec(o)) {
719 if (o->op_flags & OPf_KIDS) {
720 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
721 nextkid = kid->op_sibling; /* Get before next freeing kid */
729 /* COP* is not cleared by op_clear() so that we may track line
730 * numbers etc even after null() */
731 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
736 #ifdef PL_OP_SLAB_ALLOC
737 if ((char *) o == PL_OpPtr)
746 S_op_clear(pTHX_ OP *o)
748 switch (o->op_type) {
749 case OP_NULL: /* Was holding old type, if any. */
750 case OP_ENTEREVAL: /* Was holding hints. */
752 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
758 if (!(o->op_flags & OPf_SPECIAL))
761 #endif /* USE_THREADS */
763 if (!(o->op_flags & OPf_REF)
764 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
771 if (cPADOPo->op_padix > 0) {
774 pad_swipe(cPADOPo->op_padix);
775 /* No GvIN_PAD_off(gv) here, because other references may still
776 * exist on the pad */
779 cPADOPo->op_padix = 0;
782 SvREFCNT_dec(cSVOPo->op_sv);
783 cSVOPo->op_sv = Nullsv;
787 SvREFCNT_dec(cSVOPo->op_sv);
788 cSVOPo->op_sv = Nullsv;
794 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
798 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
799 SvREFCNT_dec(cSVOPo->op_sv);
800 cSVOPo->op_sv = Nullsv;
803 Safefree(cPVOPo->op_pv);
804 cPVOPo->op_pv = Nullch;
808 op_free(cPMOPo->op_pmreplroot);
812 if ((PADOFFSET)cPMOPo->op_pmreplroot) {
814 GV *gv = (GV*)PL_curpad[(PADOFFSET)cPMOPo->op_pmreplroot];
815 pad_swipe((PADOFFSET)cPMOPo->op_pmreplroot);
816 /* No GvIN_PAD_off(gv) here, because other references may still
817 * exist on the pad */
822 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
828 cPMOPo->op_pmreplroot = Nullop;
829 ReREFCNT_dec(cPMOPo->op_pmregexp);
830 cPMOPo->op_pmregexp = (REGEXP*)NULL;
834 if (o->op_targ > 0) {
835 pad_free(o->op_targ);
841 S_cop_free(pTHX_ COP* cop)
843 Safefree(cop->cop_label);
845 Safefree(CopFILE(cop)); /* XXXXX share in a pvtable? */
846 Safefree(CopSTASHPV(cop)); /* XXXXX share in a pvtable? */
848 /* NOTE: COP.cop_stash is not refcounted */
849 SvREFCNT_dec(CopFILEGV(cop));
851 if (! specialWARN(cop->cop_warnings))
852 SvREFCNT_dec(cop->cop_warnings);
858 if (o->op_type == OP_NULL)
861 o->op_targ = o->op_type;
862 o->op_type = OP_NULL;
863 o->op_ppaddr = PL_ppaddr[OP_NULL];
866 /* Contextualizers */
868 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
871 Perl_linklist(pTHX_ OP *o)
878 /* establish postfix order */
879 if (cUNOPo->op_first) {
880 o->op_next = LINKLIST(cUNOPo->op_first);
881 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
883 kid->op_next = LINKLIST(kid->op_sibling);
895 Perl_scalarkids(pTHX_ OP *o)
898 if (o && o->op_flags & OPf_KIDS) {
899 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
906 S_scalarboolean(pTHX_ OP *o)
908 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
910 if (ckWARN(WARN_SYNTAX)) {
911 line_t oldline = CopLINE(PL_curcop);
913 if (PL_copline != NOLINE)
914 CopLINE_set(PL_curcop, PL_copline);
915 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
916 CopLINE_set(PL_curcop, oldline);
923 Perl_scalar(pTHX_ OP *o)
927 /* assumes no premature commitment */
928 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
929 || o->op_type == OP_RETURN)
934 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
936 switch (o->op_type) {
938 if (o->op_private & OPpREPEAT_DOLIST)
939 null(((LISTOP*)cBINOPo->op_first)->op_first);
940 scalar(cBINOPo->op_first);
945 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
949 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
950 if (!kPMOP->op_pmreplroot)
951 deprecate("implicit split to @_");
959 if (o->op_flags & OPf_KIDS) {
960 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
966 kid = cLISTOPo->op_first;
968 while ((kid = kid->op_sibling)) {
974 WITH_THR(PL_curcop = &PL_compiling);
979 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
985 WITH_THR(PL_curcop = &PL_compiling);
992 Perl_scalarvoid(pTHX_ OP *o)
999 if (o->op_type == OP_NEXTSTATE
1000 || o->op_type == OP_SETSTATE
1001 || o->op_type == OP_DBSTATE
1002 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1003 || o->op_targ == OP_SETSTATE
1004 || o->op_targ == OP_DBSTATE)))
1007 PL_curcop = (COP*)o; /* for warning below */
1010 /* assumes no premature commitment */
1011 want = o->op_flags & OPf_WANT;
1012 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
1013 || o->op_type == OP_RETURN)
1018 if ((o->op_private & OPpTARGET_MY)
1019 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1021 return scalar(o); /* As if inside SASSIGN */
1024 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1026 switch (o->op_type) {
1028 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1032 if (o->op_flags & OPf_STACKED)
1036 if (o->op_private == 4)
1078 case OP_GETSOCKNAME:
1079 case OP_GETPEERNAME:
1084 case OP_GETPRIORITY:
1107 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1108 useless = PL_op_desc[o->op_type];
1115 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1116 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1117 useless = "a variable";
1122 if (cSVOPo->op_private & OPpCONST_STRICT)
1123 no_bareword_allowed(o);
1126 if (ckWARN(WARN_VOID)) {
1127 useless = "a constant";
1128 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1130 else if (SvPOK(sv)) {
1131 if (strnEQ(SvPVX(sv), "di", 2) ||
1132 strnEQ(SvPVX(sv), "ds", 2) ||
1133 strnEQ(SvPVX(sv), "ig", 2))
1138 null(o); /* don't execute or even remember it */
1142 o->op_type = OP_PREINC; /* pre-increment is faster */
1143 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1147 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1148 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1154 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1159 if (o->op_flags & OPf_STACKED)
1167 if (!(o->op_flags & OPf_KIDS))
1176 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1183 /* all requires must return a boolean value */
1184 o->op_flags &= ~OPf_WANT;
1187 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1188 if (!kPMOP->op_pmreplroot)
1189 deprecate("implicit split to @_");
1195 if (ckWARN(WARN_VOID))
1196 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1202 Perl_listkids(pTHX_ OP *o)
1205 if (o && o->op_flags & OPf_KIDS) {
1206 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1213 Perl_list(pTHX_ OP *o)
1217 /* assumes no premature commitment */
1218 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1219 || o->op_type == OP_RETURN)
1224 if ((o->op_private & OPpTARGET_MY)
1225 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1227 return o; /* As if inside SASSIGN */
1230 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1232 switch (o->op_type) {
1235 list(cBINOPo->op_first);
1240 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1248 if (!(o->op_flags & OPf_KIDS))
1250 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1251 list(cBINOPo->op_first);
1252 return gen_constant_list(o);
1259 kid = cLISTOPo->op_first;
1261 while ((kid = kid->op_sibling)) {
1262 if (kid->op_sibling)
1267 WITH_THR(PL_curcop = &PL_compiling);
1271 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1272 if (kid->op_sibling)
1277 WITH_THR(PL_curcop = &PL_compiling);
1280 /* all requires must return a boolean value */
1281 o->op_flags &= ~OPf_WANT;
1288 Perl_scalarseq(pTHX_ OP *o)
1293 if (o->op_type == OP_LINESEQ ||
1294 o->op_type == OP_SCOPE ||
1295 o->op_type == OP_LEAVE ||
1296 o->op_type == OP_LEAVETRY)
1299 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1300 if (kid->op_sibling) {
1304 PL_curcop = &PL_compiling;
1306 o->op_flags &= ~OPf_PARENS;
1307 if (PL_hints & HINT_BLOCK_SCOPE)
1308 o->op_flags |= OPf_PARENS;
1311 o = newOP(OP_STUB, 0);
1316 S_modkids(pTHX_ OP *o, I32 type)
1319 if (o && o->op_flags & OPf_KIDS) {
1320 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1327 Perl_mod(pTHX_ OP *o, I32 type)
1333 if (!o || PL_error_count)
1336 if ((o->op_private & OPpTARGET_MY)
1337 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1342 switch (o->op_type) {
1347 if (!(o->op_private & (OPpCONST_ARYBASE)))
1349 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1350 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1354 SAVEI32(PL_compiling.cop_arybase);
1355 PL_compiling.cop_arybase = 0;
1357 else if (type == OP_REFGEN)
1360 Perl_croak(aTHX_ "That use of $[ is unsupported");
1363 if (o->op_flags & OPf_PARENS)
1367 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1368 !(o->op_flags & OPf_STACKED)) {
1369 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1370 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1371 assert(cUNOPo->op_first->op_type == OP_NULL);
1372 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1375 else { /* lvalue subroutine call */
1376 o->op_private |= OPpLVAL_INTRO;
1377 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1378 /* Backward compatibility mode: */
1379 o->op_private |= OPpENTERSUB_INARGS;
1382 else { /* Compile-time error message: */
1383 OP *kid = cUNOPo->op_first;
1387 if (kid->op_type == OP_PUSHMARK)
1389 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1391 "panic: unexpected lvalue entersub "
1392 "args: type/targ %ld:%ld",
1393 (long)kid->op_type,kid->op_targ);
1394 kid = kLISTOP->op_first;
1396 while (kid->op_sibling)
1397 kid = kid->op_sibling;
1398 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1400 if (kid->op_type == OP_METHOD_NAMED
1401 || kid->op_type == OP_METHOD)
1405 if (kid->op_sibling || kid->op_next != kid) {
1406 yyerror("panic: unexpected optree near method call");
1410 NewOp(1101, newop, 1, UNOP);
1411 newop->op_type = OP_RV2CV;
1412 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1413 newop->op_first = Nullop;
1414 newop->op_next = (OP*)newop;
1415 kid->op_sibling = (OP*)newop;
1416 newop->op_private |= OPpLVAL_INTRO;
1420 if (kid->op_type != OP_RV2CV)
1422 "panic: unexpected lvalue entersub "
1423 "entry via type/targ %ld:%ld",
1424 (long)kid->op_type,kid->op_targ);
1425 kid->op_private |= OPpLVAL_INTRO;
1426 break; /* Postpone until runtime */
1430 kid = kUNOP->op_first;
1431 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1432 kid = kUNOP->op_first;
1433 if (kid->op_type == OP_NULL)
1435 "Unexpected constant lvalue entersub "
1436 "entry via type/targ %ld:%ld",
1437 (long)kid->op_type,kid->op_targ);
1438 if (kid->op_type != OP_GV) {
1439 /* Restore RV2CV to check lvalueness */
1441 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1442 okid->op_next = kid->op_next;
1443 kid->op_next = okid;
1446 okid->op_next = Nullop;
1447 okid->op_type = OP_RV2CV;
1449 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1450 okid->op_private |= OPpLVAL_INTRO;
1454 cv = GvCV(kGVOP_gv);
1464 /* grep, foreach, subcalls, refgen */
1465 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1467 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1468 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1470 : (o->op_type == OP_ENTERSUB
1471 ? "non-lvalue subroutine call"
1472 : PL_op_desc[o->op_type])),
1473 type ? PL_op_desc[type] : "local"));
1487 case OP_RIGHT_SHIFT:
1496 if (!(o->op_flags & OPf_STACKED))
1502 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1508 if (!type && cUNOPo->op_first->op_type != OP_GV)
1509 Perl_croak(aTHX_ "Can't localize through a reference");
1510 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1511 PL_modcount = 10000;
1512 return o; /* Treat \(@foo) like ordinary list. */
1516 if (scalar_mod_type(o, type))
1518 ref(cUNOPo->op_first, o->op_type);
1527 PL_modcount = 10000;
1530 if (!type && cUNOPo->op_first->op_type != OP_GV)
1531 Perl_croak(aTHX_ "Can't localize through a reference");
1532 ref(cUNOPo->op_first, o->op_type);
1536 PL_hints |= HINT_BLOCK_SCOPE;
1546 PL_modcount = 10000;
1547 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1548 return o; /* Treat \(@foo) like ordinary list. */
1549 if (scalar_mod_type(o, type))
1555 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1556 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1561 PL_modcount++; /* XXX ??? */
1563 #endif /* USE_THREADS */
1569 if (type != OP_SASSIGN)
1573 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1579 pad_free(o->op_targ);
1580 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1581 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1582 if (o->op_flags & OPf_KIDS)
1583 mod(cBINOPo->op_first->op_sibling, type);
1588 ref(cBINOPo->op_first, o->op_type);
1589 if (type == OP_ENTERSUB &&
1590 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1591 o->op_private |= OPpLVAL_DEFER;
1598 if (o->op_flags & OPf_KIDS)
1599 mod(cLISTOPo->op_last, type);
1603 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1605 else if (!(o->op_flags & OPf_KIDS))
1607 if (o->op_targ != OP_LIST) {
1608 mod(cBINOPo->op_first, type);
1613 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1617 o->op_flags |= OPf_MOD;
1619 if (type == OP_AASSIGN || type == OP_SASSIGN)
1620 o->op_flags |= OPf_SPECIAL|OPf_REF;
1622 o->op_private |= OPpLVAL_INTRO;
1623 o->op_flags &= ~OPf_SPECIAL;
1624 PL_hints |= HINT_BLOCK_SCOPE;
1626 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1627 o->op_flags |= OPf_REF;
1632 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1636 if (o->op_type == OP_RV2GV)
1660 case OP_RIGHT_SHIFT:
1679 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1681 switch (o->op_type) {
1689 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1702 Perl_refkids(pTHX_ OP *o, I32 type)
1705 if (o && o->op_flags & OPf_KIDS) {
1706 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1713 Perl_ref(pTHX_ OP *o, I32 type)
1717 if (!o || PL_error_count)
1720 switch (o->op_type) {
1722 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1723 !(o->op_flags & OPf_STACKED)) {
1724 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1725 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1726 assert(cUNOPo->op_first->op_type == OP_NULL);
1727 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1728 o->op_flags |= OPf_SPECIAL;
1733 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1737 if (type == OP_DEFINED)
1738 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1739 ref(cUNOPo->op_first, o->op_type);
1742 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1743 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1744 : type == OP_RV2HV ? OPpDEREF_HV
1746 o->op_flags |= OPf_MOD;
1751 o->op_flags |= OPf_MOD; /* XXX ??? */
1756 o->op_flags |= OPf_REF;
1759 if (type == OP_DEFINED)
1760 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1761 ref(cUNOPo->op_first, o->op_type);
1766 o->op_flags |= OPf_REF;
1771 if (!(o->op_flags & OPf_KIDS))
1773 ref(cBINOPo->op_first, type);
1777 ref(cBINOPo->op_first, o->op_type);
1778 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1779 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1780 : type == OP_RV2HV ? OPpDEREF_HV
1782 o->op_flags |= OPf_MOD;
1790 if (!(o->op_flags & OPf_KIDS))
1792 ref(cLISTOPo->op_last, type);
1802 S_dup_attrlist(pTHX_ OP *o)
1806 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1807 * where the first kid is OP_PUSHMARK and the remaining ones
1808 * are OP_CONST. We need to push the OP_CONST values.
1810 if (o->op_type == OP_CONST)
1811 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1813 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1814 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1815 if (o->op_type == OP_CONST)
1816 rop = append_elem(OP_LIST, rop,
1817 newSVOP(OP_CONST, o->op_flags,
1818 SvREFCNT_inc(cSVOPo->op_sv)));
1825 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1829 /* fake up C<use attributes $pkg,$rv,@attrs> */
1830 ENTER; /* need to protect against side-effects of 'use' */
1832 if (stash && HvNAME(stash))
1833 stashsv = newSVpv(HvNAME(stash), 0);
1835 stashsv = &PL_sv_no;
1837 #define ATTRSMODULE "attributes"
1839 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1840 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1842 prepend_elem(OP_LIST,
1843 newSVOP(OP_CONST, 0, stashsv),
1844 prepend_elem(OP_LIST,
1845 newSVOP(OP_CONST, 0,
1847 dup_attrlist(attrs))));
1852 S_my_kid(pTHX_ OP *o, OP *attrs)
1857 if (!o || PL_error_count)
1861 if (type == OP_LIST) {
1862 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1864 } else if (type == OP_UNDEF) {
1866 } else if (type == OP_RV2SV || /* "our" declaration */
1868 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1869 o->op_private |= OPpOUR_INTRO;
1871 } else if (type != OP_PADSV &&
1874 type != OP_PUSHMARK)
1876 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1877 PL_op_desc[o->op_type],
1878 PL_in_my == KEY_our ? "our" : "my"));
1881 else if (attrs && type != OP_PUSHMARK) {
1887 PL_in_my_stash = Nullhv;
1889 /* check for C<my Dog $spot> when deciding package */
1890 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1891 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1892 stash = SvSTASH(*namesvp);
1894 stash = PL_curstash;
1895 padsv = PAD_SV(o->op_targ);
1896 apply_attrs(stash, padsv, attrs);
1898 o->op_flags |= OPf_MOD;
1899 o->op_private |= OPpLVAL_INTRO;
1904 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1906 if (o->op_flags & OPf_PARENS)
1910 o = my_kid(o, attrs);
1912 PL_in_my_stash = Nullhv;
1917 Perl_my(pTHX_ OP *o)
1919 return my_kid(o, Nullop);
1923 Perl_sawparens(pTHX_ OP *o)
1926 o->op_flags |= OPf_PARENS;
1931 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1936 if (ckWARN(WARN_MISC) &&
1937 (left->op_type == OP_RV2AV ||
1938 left->op_type == OP_RV2HV ||
1939 left->op_type == OP_PADAV ||
1940 left->op_type == OP_PADHV)) {
1941 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1942 right->op_type == OP_TRANS)
1943 ? right->op_type : OP_MATCH];
1944 const char *sample = ((left->op_type == OP_RV2AV ||
1945 left->op_type == OP_PADAV)
1946 ? "@array" : "%hash");
1947 Perl_warner(aTHX_ WARN_MISC,
1948 "Applying %s to %s will act on scalar(%s)",
1949 desc, sample, sample);
1952 if (right->op_type == OP_MATCH ||
1953 right->op_type == OP_SUBST ||
1954 right->op_type == OP_TRANS) {
1955 right->op_flags |= OPf_STACKED;
1956 if (right->op_type != OP_MATCH)
1957 left = mod(left, right->op_type);
1958 if (right->op_type == OP_TRANS)
1959 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1961 o = prepend_elem(right->op_type, scalar(left), right);
1963 return newUNOP(OP_NOT, 0, scalar(o));
1967 return bind_match(type, left,
1968 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1972 Perl_invert(pTHX_ OP *o)
1976 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1977 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1981 Perl_scope(pTHX_ OP *o)
1984 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1985 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1986 o->op_type = OP_LEAVE;
1987 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1990 if (o->op_type == OP_LINESEQ) {
1992 o->op_type = OP_SCOPE;
1993 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1994 kid = ((LISTOP*)o)->op_first;
1995 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
1999 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
2006 Perl_save_hints(pTHX)
2009 SAVESPTR(GvHV(PL_hintgv));
2010 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
2011 SAVEFREESV(GvHV(PL_hintgv));
2015 Perl_block_start(pTHX_ int full)
2018 int retval = PL_savestack_ix;
2020 SAVEI32(PL_comppad_name_floor);
2021 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
2023 PL_comppad_name_fill = PL_comppad_name_floor;
2024 if (PL_comppad_name_floor < 0)
2025 PL_comppad_name_floor = 0;
2026 SAVEI32(PL_min_intro_pending);
2027 SAVEI32(PL_max_intro_pending);
2028 PL_min_intro_pending = 0;
2029 SAVEI32(PL_comppad_name_fill);
2030 SAVEI32(PL_padix_floor);
2031 PL_padix_floor = PL_padix;
2032 PL_pad_reset_pending = FALSE;
2034 PL_hints &= ~HINT_BLOCK_SCOPE;
2035 SAVESPTR(PL_compiling.cop_warnings);
2036 if (! specialWARN(PL_compiling.cop_warnings)) {
2037 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2038 SAVEFREESV(PL_compiling.cop_warnings) ;
2044 Perl_block_end(pTHX_ I32 floor, OP *seq)
2047 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2048 OP* retval = scalarseq(seq);
2050 PL_pad_reset_pending = FALSE;
2051 PL_compiling.op_private = PL_hints;
2053 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2054 pad_leavemy(PL_comppad_name_fill);
2063 OP *o = newOP(OP_THREADSV, 0);
2064 o->op_targ = find_threadsv("_");
2067 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2068 #endif /* USE_THREADS */
2072 Perl_newPROG(pTHX_ OP *o)
2078 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2079 ((PL_in_eval & EVAL_KEEPERR)
2080 ? OPf_SPECIAL : 0), o);
2081 PL_eval_start = linklist(PL_eval_root);
2082 PL_eval_root->op_private |= OPpREFCOUNTED;
2083 OpREFCNT_set(PL_eval_root, 1);
2084 PL_eval_root->op_next = 0;
2085 peep(PL_eval_start);
2090 PL_main_root = scope(sawparens(scalarvoid(o)));
2091 PL_curcop = &PL_compiling;
2092 PL_main_start = LINKLIST(PL_main_root);
2093 PL_main_root->op_private |= OPpREFCOUNTED;
2094 OpREFCNT_set(PL_main_root, 1);
2095 PL_main_root->op_next = 0;
2096 peep(PL_main_start);
2099 /* Register with debugger */
2101 CV *cv = get_cv("DB::postponed", FALSE);
2105 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2107 call_sv((SV*)cv, G_DISCARD);
2114 Perl_localize(pTHX_ OP *o, I32 lex)
2116 if (o->op_flags & OPf_PARENS)
2120 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2122 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2123 if (*s == ';' || *s == '=')
2124 Perl_warner(aTHX_ WARN_PARENTHESIS,
2125 "Parentheses missing around \"%s\" list",
2126 lex ? (PL_in_my == KEY_our ? "our" : "my") : "local");
2132 o = mod(o, OP_NULL); /* a bit kludgey */
2134 PL_in_my_stash = Nullhv;
2139 Perl_jmaybe(pTHX_ OP *o)
2141 if (o->op_type == OP_LIST) {
2144 o2 = newOP(OP_THREADSV, 0);
2145 o2->op_targ = find_threadsv(";");
2147 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2148 #endif /* USE_THREADS */
2149 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2155 Perl_fold_constants(pTHX_ register OP *o)
2159 I32 type = o->op_type;
2162 if (PL_opargs[type] & OA_RETSCALAR)
2164 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2165 o->op_targ = pad_alloc(type, SVs_PADTMP);
2167 /* integerize op, unless it happens to be C<-foo>.
2168 * XXX should pp_i_negate() do magic string negation instead? */
2169 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2170 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2171 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2173 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2176 if (!(PL_opargs[type] & OA_FOLDCONST))
2181 /* XXX might want a ck_negate() for this */
2182 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2195 if (o->op_private & OPpLOCALE)
2200 goto nope; /* Don't try to run w/ errors */
2202 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2203 if ((curop->op_type != OP_CONST ||
2204 (curop->op_private & OPpCONST_BARE)) &&
2205 curop->op_type != OP_LIST &&
2206 curop->op_type != OP_SCALAR &&
2207 curop->op_type != OP_NULL &&
2208 curop->op_type != OP_PUSHMARK)
2214 curop = LINKLIST(o);
2218 sv = *(PL_stack_sp--);
2219 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2220 pad_swipe(o->op_targ);
2221 else if (SvTEMP(sv)) { /* grab mortal temp? */
2222 (void)SvREFCNT_inc(sv);
2226 if (type == OP_RV2GV)
2227 return newGVOP(OP_GV, 0, (GV*)sv);
2229 /* try to smush double to int, but don't smush -2.0 to -2 */
2230 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2234 if ((NV)iv == SvNV(sv)) {
2239 SvIOK_off(sv); /* undo SvIV() damage */
2241 return newSVOP(OP_CONST, 0, sv);
2245 if (!(PL_opargs[type] & OA_OTHERINT))
2248 if (!(PL_hints & HINT_INTEGER)) {
2249 if (type == OP_MODULO
2250 || type == OP_DIVIDE
2251 || !(o->op_flags & OPf_KIDS))
2256 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2257 if (curop->op_type == OP_CONST) {
2258 if (SvIOK(((SVOP*)curop)->op_sv))
2262 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2266 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2273 Perl_gen_constant_list(pTHX_ register OP *o)
2277 I32 oldtmps_floor = PL_tmps_floor;
2281 return o; /* Don't attempt to run with errors */
2283 PL_op = curop = LINKLIST(o);
2290 PL_tmps_floor = oldtmps_floor;
2292 o->op_type = OP_RV2AV;
2293 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2294 curop = ((UNOP*)o)->op_first;
2295 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2302 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2307 if (!o || o->op_type != OP_LIST)
2308 o = newLISTOP(OP_LIST, 0, o, Nullop);
2310 o->op_flags &= ~OPf_WANT;
2312 if (!(PL_opargs[type] & OA_MARK))
2313 null(cLISTOPo->op_first);
2316 o->op_ppaddr = PL_ppaddr[type];
2317 o->op_flags |= flags;
2319 o = CHECKOP(type, o);
2320 if (o->op_type != type)
2323 if (cLISTOPo->op_children < 7) {
2324 /* XXX do we really need to do this if we're done appending?? */
2325 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2327 cLISTOPo->op_last = last; /* in case check substituted last arg */
2330 return fold_constants(o);
2333 /* List constructors */
2336 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2344 if (first->op_type != type
2345 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2347 return newLISTOP(type, 0, first, last);
2350 if (first->op_flags & OPf_KIDS)
2351 ((LISTOP*)first)->op_last->op_sibling = last;
2353 first->op_flags |= OPf_KIDS;
2354 ((LISTOP*)first)->op_first = last;
2356 ((LISTOP*)first)->op_last = last;
2357 ((LISTOP*)first)->op_children++;
2362 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2370 if (first->op_type != type)
2371 return prepend_elem(type, (OP*)first, (OP*)last);
2373 if (last->op_type != type)
2374 return append_elem(type, (OP*)first, (OP*)last);
2376 first->op_last->op_sibling = last->op_first;
2377 first->op_last = last->op_last;
2378 first->op_children += last->op_children;
2379 if (first->op_children)
2380 first->op_flags |= OPf_KIDS;
2382 #ifdef PL_OP_SLAB_ALLOC
2390 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2398 if (last->op_type == type) {
2399 if (type == OP_LIST) { /* already a PUSHMARK there */
2400 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2401 ((LISTOP*)last)->op_first->op_sibling = first;
2404 if (!(last->op_flags & OPf_KIDS)) {
2405 ((LISTOP*)last)->op_last = first;
2406 last->op_flags |= OPf_KIDS;
2408 first->op_sibling = ((LISTOP*)last)->op_first;
2409 ((LISTOP*)last)->op_first = first;
2411 ((LISTOP*)last)->op_children++;
2415 return newLISTOP(type, 0, first, last);
2421 Perl_newNULLLIST(pTHX)
2423 return newOP(OP_STUB, 0);
2427 Perl_force_list(pTHX_ OP *o)
2429 if (!o || o->op_type != OP_LIST)
2430 o = newLISTOP(OP_LIST, 0, o, Nullop);
2436 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2440 NewOp(1101, listop, 1, LISTOP);
2442 listop->op_type = type;
2443 listop->op_ppaddr = PL_ppaddr[type];
2444 listop->op_children = (first != 0) + (last != 0);
2445 listop->op_flags = flags;
2449 else if (!first && last)
2452 first->op_sibling = last;
2453 listop->op_first = first;
2454 listop->op_last = last;
2455 if (type == OP_LIST) {
2457 pushop = newOP(OP_PUSHMARK, 0);
2458 pushop->op_sibling = first;
2459 listop->op_first = pushop;
2460 listop->op_flags |= OPf_KIDS;
2462 listop->op_last = pushop;
2464 else if (listop->op_children)
2465 listop->op_flags |= OPf_KIDS;
2471 Perl_newOP(pTHX_ I32 type, I32 flags)
2474 NewOp(1101, o, 1, OP);
2476 o->op_ppaddr = PL_ppaddr[type];
2477 o->op_flags = flags;
2480 o->op_private = 0 + (flags >> 8);
2481 if (PL_opargs[type] & OA_RETSCALAR)
2483 if (PL_opargs[type] & OA_TARGET)
2484 o->op_targ = pad_alloc(type, SVs_PADTMP);
2485 return CHECKOP(type, o);
2489 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2494 first = newOP(OP_STUB, 0);
2495 if (PL_opargs[type] & OA_MARK)
2496 first = force_list(first);
2498 NewOp(1101, unop, 1, UNOP);
2499 unop->op_type = type;
2500 unop->op_ppaddr = PL_ppaddr[type];
2501 unop->op_first = first;
2502 unop->op_flags = flags | OPf_KIDS;
2503 unop->op_private = 1 | (flags >> 8);
2504 unop = (UNOP*) CHECKOP(type, unop);
2508 return fold_constants((OP *) unop);
2512 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2515 NewOp(1101, binop, 1, BINOP);
2518 first = newOP(OP_NULL, 0);
2520 binop->op_type = type;
2521 binop->op_ppaddr = PL_ppaddr[type];
2522 binop->op_first = first;
2523 binop->op_flags = flags | OPf_KIDS;
2526 binop->op_private = 1 | (flags >> 8);
2529 binop->op_private = 2 | (flags >> 8);
2530 first->op_sibling = last;
2533 binop = (BINOP*)CHECKOP(type, binop);
2534 if (binop->op_next || binop->op_type != type)
2537 binop->op_last = binop->op_first->op_sibling;
2539 return fold_constants((OP *)binop);
2543 utf8compare(const void *a, const void *b)
2546 for (i = 0; i < 10; i++) {
2547 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2549 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2556 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2558 SV *tstr = ((SVOP*)expr)->op_sv;
2559 SV *rstr = ((SVOP*)repl)->op_sv;
2562 register U8 *t = (U8*)SvPV(tstr, tlen);
2563 register U8 *r = (U8*)SvPV(rstr, rlen);
2569 register short *tbl;
2571 complement = o->op_private & OPpTRANS_COMPLEMENT;
2572 del = o->op_private & OPpTRANS_DELETE;
2573 squash = o->op_private & OPpTRANS_SQUASH;
2575 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2576 SV* listsv = newSVpvn("# comment\n",10);
2578 U8* tend = t + tlen;
2579 U8* rend = r + rlen;
2594 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2595 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2598 U8 tmpbuf[UTF8_MAXLEN];
2601 New(1109, cp, tlen, U8*);
2603 transv = newSVpvn("",0);
2612 qsort(cp, i, sizeof(U8*), utf8compare);
2613 for (j = 0; j < i; j++) {
2615 UV val = utf8_to_uv(s, &ulen);
2617 diff = val - nextmin;
2619 t = uv_to_utf8(tmpbuf,nextmin);
2620 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2622 t = uv_to_utf8(tmpbuf, val - 1);
2623 sv_catpvn(transv, "\377", 1);
2624 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2628 val = utf8_to_uv(s+1, &ulen);
2632 t = uv_to_utf8(tmpbuf,nextmin);
2633 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2634 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2635 sv_catpvn(transv, "\377", 1);
2636 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2637 t = (U8*)SvPVX(transv);
2638 tlen = SvCUR(transv);
2641 else if (!rlen && !del) {
2642 r = t; rlen = tlen; rend = tend;
2645 if (to_utf && from_utf) { /* only counting characters */
2646 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2647 o->op_private |= OPpTRANS_IDENTICAL;
2649 else { /* straight latin-1 translation */
2650 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2651 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2652 o->op_private |= OPpTRANS_IDENTICAL;
2656 while (t < tend || tfirst <= tlast) {
2657 /* see if we need more "t" chars */
2658 if (tfirst > tlast) {
2659 tfirst = (I32)utf8_to_uv(t, &ulen);
2661 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2662 tlast = (I32)utf8_to_uv(++t, &ulen);
2669 /* now see if we need more "r" chars */
2670 if (rfirst > rlast) {
2672 rfirst = (I32)utf8_to_uv(r, &ulen);
2674 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2675 rlast = (I32)utf8_to_uv(++r, &ulen);
2684 rfirst = rlast = 0xffffffff;
2688 /* now see which range will peter our first, if either. */
2689 tdiff = tlast - tfirst;
2690 rdiff = rlast - rfirst;
2697 if (rfirst == 0xffffffff) {
2698 diff = tdiff; /* oops, pretend rdiff is infinite */
2700 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2701 (long)tfirst, (long)tlast);
2703 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2707 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2708 (long)tfirst, (long)(tfirst + diff),
2711 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2712 (long)tfirst, (long)rfirst);
2714 if (rfirst + diff > max)
2715 max = rfirst + diff;
2720 else if (rfirst <= 0x800)
2721 grows |= (tfirst < 0x80);
2722 else if (rfirst <= 0x10000)
2723 grows |= (tfirst < 0x800);
2724 else if (rfirst <= 0x200000)
2725 grows |= (tfirst < 0x10000);
2726 else if (rfirst <= 0x4000000)
2727 grows |= (tfirst < 0x200000);
2728 else if (rfirst <= 0x80000000)
2729 grows |= (tfirst < 0x4000000);
2741 else if (max > 0xff)
2746 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2747 SvREFCNT_dec(listsv);
2749 SvREFCNT_dec(transv);
2751 if (!del && havefinal)
2752 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
2753 newSVuv((UV)final), 0);
2755 if (grows && to_utf)
2756 o->op_private |= OPpTRANS_GROWS;
2763 tbl = (short*)cPVOPo->op_pv;
2765 Zero(tbl, 256, short);
2766 for (i = 0; i < tlen; i++)
2768 for (i = 0, j = 0; i < 256; i++) {
2784 if (!rlen && !del) {
2787 o->op_private |= OPpTRANS_IDENTICAL;
2789 for (i = 0; i < 256; i++)
2791 for (i = 0, j = 0; i < tlen; i++,j++) {
2794 if (tbl[t[i]] == -1)
2800 if (tbl[t[i]] == -1)
2811 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2816 NewOp(1101, pmop, 1, PMOP);
2817 pmop->op_type = type;
2818 pmop->op_ppaddr = PL_ppaddr[type];
2819 pmop->op_flags = flags;
2820 pmop->op_private = 0 | (flags >> 8);
2822 if (PL_hints & HINT_RE_TAINT)
2823 pmop->op_pmpermflags |= PMf_RETAINT;
2824 if (PL_hints & HINT_LOCALE)
2825 pmop->op_pmpermflags |= PMf_LOCALE;
2826 pmop->op_pmflags = pmop->op_pmpermflags;
2828 /* link into pm list */
2829 if (type != OP_TRANS && PL_curstash) {
2830 pmop->op_pmnext = HvPMROOT(PL_curstash);
2831 HvPMROOT(PL_curstash) = pmop;
2838 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2843 I32 repl_has_vars = 0;
2845 if (o->op_type == OP_TRANS)
2846 return pmtrans(o, expr, repl);
2848 PL_hints |= HINT_BLOCK_SCOPE;
2851 if (expr->op_type == OP_CONST) {
2853 SV *pat = ((SVOP*)expr)->op_sv;
2854 char *p = SvPV(pat, plen);
2855 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2856 sv_setpvn(pat, "\\s+", 3);
2857 p = SvPV(pat, plen);
2858 pm->op_pmflags |= PMf_SKIPWHITE;
2860 if ((PL_hints & HINT_UTF8) || (SvUTF8(pat) && !(PL_hints & HINT_BYTE)))
2861 pm->op_pmdynflags |= PMdf_UTF8;
2862 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2863 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2864 pm->op_pmflags |= PMf_WHITE;
2868 if (PL_hints & HINT_UTF8)
2869 pm->op_pmdynflags |= PMdf_UTF8;
2870 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2871 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2873 : OP_REGCMAYBE),0,expr);
2875 NewOp(1101, rcop, 1, LOGOP);
2876 rcop->op_type = OP_REGCOMP;
2877 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2878 rcop->op_first = scalar(expr);
2879 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2880 ? (OPf_SPECIAL | OPf_KIDS)
2882 rcop->op_private = 1;
2885 /* establish postfix order */
2886 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2888 rcop->op_next = expr;
2889 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2892 rcop->op_next = LINKLIST(expr);
2893 expr->op_next = (OP*)rcop;
2896 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2901 if (pm->op_pmflags & PMf_EVAL) {
2903 if (CopLINE(PL_curcop) < PL_multi_end)
2904 CopLINE_set(PL_curcop, PL_multi_end);
2907 else if (repl->op_type == OP_THREADSV
2908 && strchr("&`'123456789+",
2909 PL_threadsv_names[repl->op_targ]))
2913 #endif /* USE_THREADS */
2914 else if (repl->op_type == OP_CONST)
2918 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2919 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2921 if (curop->op_type == OP_THREADSV) {
2923 if (strchr("&`'123456789+", curop->op_private))
2927 if (curop->op_type == OP_GV) {
2928 GV *gv = cGVOPx_gv(curop);
2930 if (strchr("&`'123456789+", *GvENAME(gv)))
2933 #endif /* USE_THREADS */
2934 else if (curop->op_type == OP_RV2CV)
2936 else if (curop->op_type == OP_RV2SV ||
2937 curop->op_type == OP_RV2AV ||
2938 curop->op_type == OP_RV2HV ||
2939 curop->op_type == OP_RV2GV) {
2940 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2943 else if (curop->op_type == OP_PADSV ||
2944 curop->op_type == OP_PADAV ||
2945 curop->op_type == OP_PADHV ||
2946 curop->op_type == OP_PADANY) {
2949 else if (curop->op_type == OP_PUSHRE)
2950 ; /* Okay here, dangerous in newASSIGNOP */
2959 && (!pm->op_pmregexp
2960 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2961 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2962 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2963 prepend_elem(o->op_type, scalar(repl), o);
2966 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2967 pm->op_pmflags |= PMf_MAYBE_CONST;
2968 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2970 NewOp(1101, rcop, 1, LOGOP);
2971 rcop->op_type = OP_SUBSTCONT;
2972 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2973 rcop->op_first = scalar(repl);
2974 rcop->op_flags |= OPf_KIDS;
2975 rcop->op_private = 1;
2978 /* establish postfix order */
2979 rcop->op_next = LINKLIST(repl);
2980 repl->op_next = (OP*)rcop;
2982 pm->op_pmreplroot = scalar((OP*)rcop);
2983 pm->op_pmreplstart = LINKLIST(rcop);
2992 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2995 NewOp(1101, svop, 1, SVOP);
2996 svop->op_type = type;
2997 svop->op_ppaddr = PL_ppaddr[type];
2999 svop->op_next = (OP*)svop;
3000 svop->op_flags = flags;
3001 if (PL_opargs[type] & OA_RETSCALAR)
3003 if (PL_opargs[type] & OA_TARGET)
3004 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3005 return CHECKOP(type, svop);
3009 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3012 NewOp(1101, padop, 1, PADOP);
3013 padop->op_type = type;
3014 padop->op_ppaddr = PL_ppaddr[type];
3015 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3016 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3017 PL_curpad[padop->op_padix] = sv;
3019 padop->op_next = (OP*)padop;
3020 padop->op_flags = flags;
3021 if (PL_opargs[type] & OA_RETSCALAR)
3023 if (PL_opargs[type] & OA_TARGET)
3024 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3025 return CHECKOP(type, padop);
3029 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3034 return newPADOP(type, flags, SvREFCNT_inc(gv));
3036 return newSVOP(type, flags, SvREFCNT_inc(gv));
3041 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3044 NewOp(1101, pvop, 1, PVOP);
3045 pvop->op_type = type;
3046 pvop->op_ppaddr = PL_ppaddr[type];
3048 pvop->op_next = (OP*)pvop;
3049 pvop->op_flags = flags;
3050 if (PL_opargs[type] & OA_RETSCALAR)
3052 if (PL_opargs[type] & OA_TARGET)
3053 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3054 return CHECKOP(type, pvop);
3058 Perl_package(pTHX_ OP *o)
3063 save_hptr(&PL_curstash);
3064 save_item(PL_curstname);
3069 name = SvPV(sv, len);
3070 PL_curstash = gv_stashpvn(name,len,TRUE);
3071 sv_setpvn(PL_curstname, name, len);
3075 sv_setpv(PL_curstname,"<none>");
3076 PL_curstash = Nullhv;
3078 PL_hints |= HINT_BLOCK_SCOPE;
3079 PL_copline = NOLINE;
3084 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3092 if (id->op_type != OP_CONST)
3093 Perl_croak(aTHX_ "Module name must be constant");
3097 if (version != Nullop) {
3098 SV *vesv = ((SVOP*)version)->op_sv;
3100 if (arg == Nullop && !SvNIOKp(vesv)) {
3107 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3108 Perl_croak(aTHX_ "Version number must be constant number");
3110 /* Make copy of id so we don't free it twice */
3111 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3113 /* Fake up a method call to VERSION */
3114 meth = newSVpvn("VERSION",7);
3115 sv_upgrade(meth, SVt_PVIV);
3116 (void)SvIOK_on(meth);
3117 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3118 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3119 append_elem(OP_LIST,
3120 prepend_elem(OP_LIST, pack, list(version)),
3121 newSVOP(OP_METHOD_NAMED, 0, meth)));
3125 /* Fake up an import/unimport */
3126 if (arg && arg->op_type == OP_STUB)
3127 imop = arg; /* no import on explicit () */
3128 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3129 imop = Nullop; /* use 5.0; */
3134 /* Make copy of id so we don't free it twice */
3135 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3137 /* Fake up a method call to import/unimport */
3138 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);;
3139 sv_upgrade(meth, SVt_PVIV);
3140 (void)SvIOK_on(meth);
3141 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3142 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3143 append_elem(OP_LIST,
3144 prepend_elem(OP_LIST, pack, list(arg)),
3145 newSVOP(OP_METHOD_NAMED, 0, meth)));
3148 /* Fake up a require, handle override, if any */
3149 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3150 if (!(gv && GvIMPORTED_CV(gv)))
3151 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3153 if (gv && GvIMPORTED_CV(gv)) {
3154 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3155 append_elem(OP_LIST, id,
3156 scalar(newUNOP(OP_RV2CV, 0,
3161 rqop = newUNOP(OP_REQUIRE, 0, id);
3164 /* Fake up the BEGIN {}, which does its thing immediately. */
3166 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3169 append_elem(OP_LINESEQ,
3170 append_elem(OP_LINESEQ,
3171 newSTATEOP(0, Nullch, rqop),
3172 newSTATEOP(0, Nullch, veop)),
3173 newSTATEOP(0, Nullch, imop) ));
3175 PL_hints |= HINT_BLOCK_SCOPE;
3176 PL_copline = NOLINE;
3181 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3184 va_start(args, ver);
3185 vload_module(flags, name, ver, &args);
3189 #ifdef PERL_IMPLICIT_CONTEXT
3191 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3195 va_start(args, ver);
3196 vload_module(flags, name, ver, &args);
3202 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3204 OP *modname, *veop, *imop;
3206 modname = newSVOP(OP_CONST, 0, name);
3207 modname->op_private |= OPpCONST_BARE;
3209 veop = newSVOP(OP_CONST, 0, ver);
3213 if (flags & PERL_LOADMOD_NOIMPORT) {
3214 imop = sawparens(newNULLLIST());
3216 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3217 imop = va_arg(*args, OP*);
3222 sv = va_arg(*args, SV*);
3224 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3225 sv = va_arg(*args, SV*);
3229 line_t ocopline = PL_copline;
3230 int oexpect = PL_expect;
3232 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3233 veop, modname, imop);
3234 PL_expect = oexpect;
3235 PL_copline = ocopline;
3240 Perl_dofile(pTHX_ OP *term)
3245 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3246 if (!(gv && GvIMPORTED_CV(gv)))
3247 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3249 if (gv && GvIMPORTED_CV(gv)) {
3250 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3251 append_elem(OP_LIST, term,
3252 scalar(newUNOP(OP_RV2CV, 0,
3257 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3263 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3265 return newBINOP(OP_LSLICE, flags,
3266 list(force_list(subscript)),
3267 list(force_list(listval)) );
3271 S_list_assignment(pTHX_ register OP *o)
3276 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3277 o = cUNOPo->op_first;
3279 if (o->op_type == OP_COND_EXPR) {
3280 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3281 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3286 yyerror("Assignment to both a list and a scalar");
3290 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3291 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3292 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3295 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3298 if (o->op_type == OP_RV2SV)
3305 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3310 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3311 return newLOGOP(optype, 0,
3312 mod(scalar(left), optype),
3313 newUNOP(OP_SASSIGN, 0, scalar(right)));
3316 return newBINOP(optype, OPf_STACKED,
3317 mod(scalar(left), optype), scalar(right));
3321 if (list_assignment(left)) {
3326 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3327 left = mod(left, OP_AASSIGN);
3335 curop = list(force_list(left));
3336 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3337 o->op_private = 0 | (flags >> 8);
3338 for (curop = ((LISTOP*)curop)->op_first;
3339 curop; curop = curop->op_sibling)
3341 if (curop->op_type == OP_RV2HV &&
3342 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3343 o->op_private |= OPpASSIGN_HASH;
3347 if (!(left->op_private & OPpLVAL_INTRO)) {
3350 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3351 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3352 if (curop->op_type == OP_GV) {
3353 GV *gv = cGVOPx_gv(curop);
3354 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3356 SvCUR(gv) = PL_generation;
3358 else if (curop->op_type == OP_PADSV ||
3359 curop->op_type == OP_PADAV ||
3360 curop->op_type == OP_PADHV ||
3361 curop->op_type == OP_PADANY) {
3362 SV **svp = AvARRAY(PL_comppad_name);
3363 SV *sv = svp[curop->op_targ];
3364 if (SvCUR(sv) == PL_generation)
3366 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3368 else if (curop->op_type == OP_RV2CV)
3370 else if (curop->op_type == OP_RV2SV ||
3371 curop->op_type == OP_RV2AV ||
3372 curop->op_type == OP_RV2HV ||
3373 curop->op_type == OP_RV2GV) {
3374 if (lastop->op_type != OP_GV) /* funny deref? */
3377 else if (curop->op_type == OP_PUSHRE) {
3378 if (((PMOP*)curop)->op_pmreplroot) {
3379 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3380 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3382 SvCUR(gv) = PL_generation;
3391 o->op_private |= OPpASSIGN_COMMON;
3393 if (right && right->op_type == OP_SPLIT) {
3395 if ((tmpop = ((LISTOP*)right)->op_first) &&
3396 tmpop->op_type == OP_PUSHRE)
3398 PMOP *pm = (PMOP*)tmpop;
3399 if (left->op_type == OP_RV2AV &&
3400 !(left->op_private & OPpLVAL_INTRO) &&
3401 !(o->op_private & OPpASSIGN_COMMON) )
3403 tmpop = ((UNOP*)left)->op_first;
3404 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3406 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3407 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3409 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3410 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3412 pm->op_pmflags |= PMf_ONCE;
3413 tmpop = cUNOPo->op_first; /* to list (nulled) */
3414 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3415 tmpop->op_sibling = Nullop; /* don't free split */
3416 right->op_next = tmpop->op_next; /* fix starting loc */
3417 op_free(o); /* blow off assign */
3418 right->op_flags &= ~OPf_WANT;
3419 /* "I don't know and I don't care." */
3424 if (PL_modcount < 10000 &&
3425 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3427 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3429 sv_setiv(sv, PL_modcount+1);
3437 right = newOP(OP_UNDEF, 0);
3438 if (right->op_type == OP_READLINE) {
3439 right->op_flags |= OPf_STACKED;
3440 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3443 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3444 o = newBINOP(OP_SASSIGN, flags,
3445 scalar(right), mod(scalar(left), OP_SASSIGN) );
3457 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3460 U32 seq = intro_my();
3463 NewOp(1101, cop, 1, COP);
3464 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3465 cop->op_type = OP_DBSTATE;
3466 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3469 cop->op_type = OP_NEXTSTATE;
3470 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3472 cop->op_flags = flags;
3473 cop->op_private = (PL_hints & HINT_BYTE);
3475 cop->op_private |= NATIVE_HINTS;
3477 PL_compiling.op_private = cop->op_private;
3478 cop->op_next = (OP*)cop;
3481 cop->cop_label = label;
3482 PL_hints |= HINT_BLOCK_SCOPE;
3485 cop->cop_arybase = PL_curcop->cop_arybase;
3486 if (specialWARN(PL_curcop->cop_warnings))
3487 cop->cop_warnings = PL_curcop->cop_warnings ;
3489 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3492 if (PL_copline == NOLINE)
3493 CopLINE_set(cop, CopLINE(PL_curcop));
3495 CopLINE_set(cop, PL_copline);
3496 PL_copline = NOLINE;
3499 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXXXX share in a pvtable? */
3501 CopFILEGV_set(cop, (GV*)SvREFCNT_inc(CopFILEGV(PL_curcop)));
3503 CopSTASH_set(cop, PL_curstash);
3505 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3506 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3507 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3508 (void)SvIOK_on(*svp);
3509 SvIVX(*svp) = PTR2IV(cop);
3513 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3516 /* "Introduce" my variables to visible status. */
3524 if (! PL_min_intro_pending)
3525 return PL_cop_seqmax;
3527 svp = AvARRAY(PL_comppad_name);
3528 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3529 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3530 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3531 SvNVX(sv) = (NV)PL_cop_seqmax;
3534 PL_min_intro_pending = 0;
3535 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3536 return PL_cop_seqmax++;
3540 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3542 return new_logop(type, flags, &first, &other);
3546 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3551 OP *first = *firstp;
3552 OP *other = *otherp;
3554 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3555 return newBINOP(type, flags, scalar(first), scalar(other));
3557 scalarboolean(first);
3558 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3559 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3560 if (type == OP_AND || type == OP_OR) {
3566 first = *firstp = cUNOPo->op_first;
3568 first->op_next = o->op_next;
3569 cUNOPo->op_first = Nullop;
3573 if (first->op_type == OP_CONST) {
3574 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3575 Perl_warner(aTHX_ WARN_BAREWORD, "Bareword found in conditional");
3576 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3587 else if (first->op_type == OP_WANTARRAY) {
3593 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3594 OP *k1 = ((UNOP*)first)->op_first;
3595 OP *k2 = k1->op_sibling;
3597 switch (first->op_type)
3600 if (k2 && k2->op_type == OP_READLINE
3601 && (k2->op_flags & OPf_STACKED)
3602 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3604 warnop = k2->op_type;
3609 if (k1->op_type == OP_READDIR
3610 || k1->op_type == OP_GLOB
3611 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3612 || k1->op_type == OP_EACH)
3614 warnop = ((k1->op_type == OP_NULL)
3615 ? k1->op_targ : k1->op_type);
3620 line_t oldline = CopLINE(PL_curcop);
3621 CopLINE_set(PL_curcop, PL_copline);
3622 Perl_warner(aTHX_ WARN_MISC,
3623 "Value of %s%s can be \"0\"; test with defined()",
3625 ((warnop == OP_READLINE || warnop == OP_GLOB)
3626 ? " construct" : "() operator"));
3627 CopLINE_set(PL_curcop, oldline);
3634 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3635 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3637 NewOp(1101, logop, 1, LOGOP);
3639 logop->op_type = type;
3640 logop->op_ppaddr = PL_ppaddr[type];
3641 logop->op_first = first;
3642 logop->op_flags = flags | OPf_KIDS;
3643 logop->op_other = LINKLIST(other);
3644 logop->op_private = 1 | (flags >> 8);
3646 /* establish postfix order */
3647 logop->op_next = LINKLIST(first);
3648 first->op_next = (OP*)logop;
3649 first->op_sibling = other;
3651 o = newUNOP(OP_NULL, 0, (OP*)logop);
3658 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3666 return newLOGOP(OP_AND, 0, first, trueop);
3668 return newLOGOP(OP_OR, 0, first, falseop);
3670 scalarboolean(first);
3671 if (first->op_type == OP_CONST) {
3672 if (SvTRUE(((SVOP*)first)->op_sv)) {
3683 else if (first->op_type == OP_WANTARRAY) {
3687 NewOp(1101, logop, 1, LOGOP);
3688 logop->op_type = OP_COND_EXPR;
3689 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3690 logop->op_first = first;
3691 logop->op_flags = flags | OPf_KIDS;
3692 logop->op_private = 1 | (flags >> 8);
3693 logop->op_other = LINKLIST(trueop);
3694 logop->op_next = LINKLIST(falseop);
3697 /* establish postfix order */
3698 start = LINKLIST(first);
3699 first->op_next = (OP*)logop;
3701 first->op_sibling = trueop;
3702 trueop->op_sibling = falseop;
3703 o = newUNOP(OP_NULL, 0, (OP*)logop);
3705 trueop->op_next = falseop->op_next = o;
3712 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3721 NewOp(1101, range, 1, LOGOP);
3723 range->op_type = OP_RANGE;
3724 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3725 range->op_first = left;
3726 range->op_flags = OPf_KIDS;
3727 leftstart = LINKLIST(left);
3728 range->op_other = LINKLIST(right);
3729 range->op_private = 1 | (flags >> 8);
3731 left->op_sibling = right;
3733 range->op_next = (OP*)range;
3734 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3735 flop = newUNOP(OP_FLOP, 0, flip);
3736 o = newUNOP(OP_NULL, 0, flop);
3738 range->op_next = leftstart;
3740 left->op_next = flip;
3741 right->op_next = flop;
3743 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3744 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3745 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3746 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3748 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3749 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3752 if (!flip->op_private || !flop->op_private)
3753 linklist(o); /* blow off optimizer unless constant */
3759 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3764 int once = block && block->op_flags & OPf_SPECIAL &&
3765 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3768 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3769 return block; /* do {} while 0 does once */
3770 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3771 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3772 expr = newUNOP(OP_DEFINED, 0,
3773 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3774 } else if (expr->op_flags & OPf_KIDS) {
3775 OP *k1 = ((UNOP*)expr)->op_first;
3776 OP *k2 = (k1) ? k1->op_sibling : NULL;
3777 switch (expr->op_type) {
3779 if (k2 && k2->op_type == OP_READLINE
3780 && (k2->op_flags & OPf_STACKED)
3781 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3782 expr = newUNOP(OP_DEFINED, 0, expr);
3786 if (k1->op_type == OP_READDIR
3787 || k1->op_type == OP_GLOB
3788 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3789 || k1->op_type == OP_EACH)
3790 expr = newUNOP(OP_DEFINED, 0, expr);
3796 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3797 o = new_logop(OP_AND, 0, &expr, &listop);
3800 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3802 if (once && o != listop)
3803 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3806 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3808 o->op_flags |= flags;
3810 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3815 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3825 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3826 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3827 expr = newUNOP(OP_DEFINED, 0,
3828 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3829 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3830 OP *k1 = ((UNOP*)expr)->op_first;
3831 OP *k2 = (k1) ? k1->op_sibling : NULL;
3832 switch (expr->op_type) {
3834 if (k2 && k2->op_type == OP_READLINE
3835 && (k2->op_flags & OPf_STACKED)
3836 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3837 expr = newUNOP(OP_DEFINED, 0, expr);
3841 if (k1->op_type == OP_READDIR
3842 || k1->op_type == OP_GLOB
3843 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3844 || k1->op_type == OP_EACH)
3845 expr = newUNOP(OP_DEFINED, 0, expr);
3851 block = newOP(OP_NULL, 0);
3853 block = scope(block);
3857 next = LINKLIST(cont);
3858 loopflags |= OPpLOOP_CONTINUE;
3861 OP *unstack = newOP(OP_UNSTACK, 0);
3864 cont = append_elem(OP_LINESEQ, cont, unstack);
3865 if ((line_t)whileline != NOLINE) {
3866 PL_copline = whileline;
3867 cont = append_elem(OP_LINESEQ, cont,
3868 newSTATEOP(0, Nullch, Nullop));
3872 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3873 redo = LINKLIST(listop);
3876 PL_copline = whileline;
3878 o = new_logop(OP_AND, 0, &expr, &listop);
3879 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3880 op_free(expr); /* oops, it's a while (0) */
3882 return Nullop; /* listop already freed by new_logop */
3885 ((LISTOP*)listop)->op_last->op_next = condop =
3886 (o == listop ? redo : LINKLIST(o));
3892 NewOp(1101,loop,1,LOOP);
3893 loop->op_type = OP_ENTERLOOP;
3894 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3895 loop->op_private = 0;
3896 loop->op_next = (OP*)loop;
3899 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3901 loop->op_redoop = redo;
3902 loop->op_lastop = o;
3903 o->op_private |= loopflags;
3906 loop->op_nextop = next;
3908 loop->op_nextop = o;
3910 o->op_flags |= flags;
3911 o->op_private |= (flags >> 8);
3916 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3924 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3925 sv->op_type = OP_RV2GV;
3926 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3928 else if (sv->op_type == OP_PADSV) { /* private variable */
3929 padoff = sv->op_targ;
3934 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3935 padoff = sv->op_targ;
3937 iterflags |= OPf_SPECIAL;
3942 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3946 padoff = find_threadsv("_");
3947 iterflags |= OPf_SPECIAL;
3949 sv = newGVOP(OP_GV, 0, PL_defgv);
3952 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3953 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3954 iterflags |= OPf_STACKED;
3956 else if (expr->op_type == OP_NULL &&
3957 (expr->op_flags & OPf_KIDS) &&
3958 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3960 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3961 * set the STACKED flag to indicate that these values are to be
3962 * treated as min/max values by 'pp_iterinit'.
3964 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3965 LOGOP* range = (LOGOP*) flip->op_first;
3966 OP* left = range->op_first;
3967 OP* right = left->op_sibling;
3970 range->op_flags &= ~OPf_KIDS;
3971 range->op_first = Nullop;
3973 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3974 listop->op_first->op_next = range->op_next;
3975 left->op_next = range->op_other;
3976 right->op_next = (OP*)listop;
3977 listop->op_next = listop->op_first;
3980 expr = (OP*)(listop);
3982 iterflags |= OPf_STACKED;
3985 expr = mod(force_list(expr), OP_GREPSTART);
3989 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3990 append_elem(OP_LIST, expr, scalar(sv))));
3991 assert(!loop->op_next);
3992 #ifdef PL_OP_SLAB_ALLOC
3995 NewOp(1234,tmp,1,LOOP);
3996 Copy(loop,tmp,1,LOOP);
4000 Renew(loop, 1, LOOP);
4002 loop->op_targ = padoff;
4003 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
4004 PL_copline = forline;
4005 return newSTATEOP(0, label, wop);
4009 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4015 if (type != OP_GOTO || label->op_type == OP_CONST) {
4016 /* "last()" means "last" */
4017 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4018 o = newOP(type, OPf_SPECIAL);
4020 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
4021 ? SvPVx(((SVOP*)label)->op_sv, n_a)
4027 if (label->op_type == OP_ENTERSUB)
4028 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4029 o = newUNOP(type, OPf_STACKED, label);
4031 PL_hints |= HINT_BLOCK_SCOPE;
4036 Perl_cv_undef(pTHX_ CV *cv)
4041 MUTEX_DESTROY(CvMUTEXP(cv));
4042 Safefree(CvMUTEXP(cv));
4045 #endif /* USE_THREADS */
4047 if (!CvXSUB(cv) && CvROOT(cv)) {
4049 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4050 Perl_croak(aTHX_ "Can't undef active subroutine");
4053 Perl_croak(aTHX_ "Can't undef active subroutine");
4054 #endif /* USE_THREADS */
4057 SAVEVPTR(PL_curpad);
4061 op_free(CvROOT(cv));
4062 CvROOT(cv) = Nullop;
4065 SvPOK_off((SV*)cv); /* forget prototype */
4067 SvREFCNT_dec(CvGV(cv));
4069 SvREFCNT_dec(CvOUTSIDE(cv));
4070 CvOUTSIDE(cv) = Nullcv;
4071 if (CvPADLIST(cv)) {
4072 /* may be during global destruction */
4073 if (SvREFCNT(CvPADLIST(cv))) {
4074 I32 i = AvFILLp(CvPADLIST(cv));
4076 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4077 SV* sv = svp ? *svp : Nullsv;
4080 if (sv == (SV*)PL_comppad_name)
4081 PL_comppad_name = Nullav;
4082 else if (sv == (SV*)PL_comppad) {
4083 PL_comppad = Nullav;
4084 PL_curpad = Null(SV**);
4088 SvREFCNT_dec((SV*)CvPADLIST(cv));
4090 CvPADLIST(cv) = Nullav;
4095 S_cv_dump(pTHX_ CV *cv)
4098 CV *outside = CvOUTSIDE(cv);
4099 AV* padlist = CvPADLIST(cv);
4106 PerlIO_printf(Perl_debug_log,
4107 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4109 (CvANON(cv) ? "ANON"
4110 : (cv == PL_main_cv) ? "MAIN"
4111 : CvUNIQUE(cv) ? "UNIQUE"
4112 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4115 : CvANON(outside) ? "ANON"
4116 : (outside == PL_main_cv) ? "MAIN"
4117 : CvUNIQUE(outside) ? "UNIQUE"
4118 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4123 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4124 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4125 pname = AvARRAY(pad_name);
4126 ppad = AvARRAY(pad);
4128 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4129 if (SvPOK(pname[ix]))
4130 PerlIO_printf(Perl_debug_log,
4131 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4132 (int)ix, PTR2UV(ppad[ix]),
4133 SvFAKE(pname[ix]) ? "FAKE " : "",
4135 (IV)I_32(SvNVX(pname[ix])),
4138 #endif /* DEBUGGING */
4142 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4147 AV* protopadlist = CvPADLIST(proto);
4148 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4149 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4150 SV** pname = AvARRAY(protopad_name);
4151 SV** ppad = AvARRAY(protopad);
4152 I32 fname = AvFILLp(protopad_name);
4153 I32 fpad = AvFILLp(protopad);
4157 assert(!CvUNIQUE(proto));
4161 SAVESPTR(PL_comppad_name);
4162 SAVESPTR(PL_compcv);
4164 cv = PL_compcv = (CV*)NEWSV(1104,0);
4165 sv_upgrade((SV *)cv, SvTYPE(proto));
4166 CvFLAGS(cv) = CvFLAGS(proto) & ~CVf_CLONE;
4170 New(666, CvMUTEXP(cv), 1, perl_mutex);
4171 MUTEX_INIT(CvMUTEXP(cv));
4173 #endif /* USE_THREADS */
4174 CvFILE(cv) = CvFILE(proto);
4175 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4176 CvSTASH(cv) = CvSTASH(proto);
4177 CvROOT(cv) = CvROOT(proto);
4178 CvSTART(cv) = CvSTART(proto);
4180 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4183 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4185 PL_comppad_name = newAV();
4186 for (ix = fname; ix >= 0; ix--)
4187 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4189 PL_comppad = newAV();
4191 comppadlist = newAV();
4192 AvREAL_off(comppadlist);
4193 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4194 av_store(comppadlist, 1, (SV*)PL_comppad);
4195 CvPADLIST(cv) = comppadlist;
4196 av_fill(PL_comppad, AvFILLp(protopad));
4197 PL_curpad = AvARRAY(PL_comppad);
4199 av = newAV(); /* will be @_ */
4201 av_store(PL_comppad, 0, (SV*)av);
4202 AvFLAGS(av) = AVf_REIFY;
4204 for (ix = fpad; ix > 0; ix--) {
4205 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4206 if (namesv && namesv != &PL_sv_undef) {
4207 char *name = SvPVX(namesv); /* XXX */
4208 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4209 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4210 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4212 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4214 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4216 else { /* our own lexical */
4219 /* anon code -- we'll come back for it */
4220 sv = SvREFCNT_inc(ppad[ix]);
4222 else if (*name == '@')
4224 else if (*name == '%')
4233 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4234 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4237 SV* sv = NEWSV(0,0);
4243 /* Now that vars are all in place, clone nested closures. */
4245 for (ix = fpad; ix > 0; ix--) {
4246 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4248 && namesv != &PL_sv_undef
4249 && !(SvFLAGS(namesv) & SVf_FAKE)
4250 && *SvPVX(namesv) == '&'
4251 && CvCLONE(ppad[ix]))
4253 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4254 SvREFCNT_dec(ppad[ix]);
4257 PL_curpad[ix] = (SV*)kid;
4261 #ifdef DEBUG_CLOSURES
4262 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4264 PerlIO_printf(Perl_debug_log, " from:\n");
4266 PerlIO_printf(Perl_debug_log, " to:\n");
4275 Perl_cv_clone(pTHX_ CV *proto)
4278 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4279 cv = cv_clone2(proto, CvOUTSIDE(proto));
4280 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4285 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4289 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4290 SV* msg = sv_newmortal();
4294 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4295 sv_setpv(msg, "Prototype mismatch:");
4297 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4299 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4300 sv_catpv(msg, " vs ");
4302 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4304 sv_catpv(msg, "none");
4305 Perl_warner(aTHX_ WARN_PROTOTYPE, "%"SVf, msg);
4310 Perl_cv_const_sv(pTHX_ CV *cv)
4312 if (!cv || !SvPOK(cv) || SvCUR(cv))
4314 return op_const_sv(CvSTART(cv), cv);
4318 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4325 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4326 o = cLISTOPo->op_first->op_sibling;
4328 for (; o; o = o->op_next) {
4329 OPCODE type = o->op_type;
4331 if (sv && o->op_next == o)
4333 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4335 if (type == OP_LEAVESUB || type == OP_RETURN)
4339 if (type == OP_CONST && cSVOPo->op_sv)
4341 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4342 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4343 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4344 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4356 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4366 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4370 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4372 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4376 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4383 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4387 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4388 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4389 SV *sv = sv_newmortal();
4390 Perl_sv_setpvf(aTHX_ sv, "__ANON__[%s:%"IVdf"]",
4391 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4396 gv = gv_fetchpv(name ? name : (aname ? aname : "__ANON__"),
4397 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4407 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4408 maximum a prototype before. */
4409 if (SvTYPE(gv) > SVt_NULL) {
4410 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4411 && ckWARN_d(WARN_PROTOTYPE))
4413 Perl_warner(aTHX_ WARN_PROTOTYPE, "Runaway prototype");
4415 cv_ckproto((CV*)gv, NULL, ps);
4418 sv_setpv((SV*)gv, ps);
4420 sv_setiv((SV*)gv, -1);
4421 SvREFCNT_dec(PL_compcv);
4422 cv = PL_compcv = NULL;
4423 PL_sub_generation++;
4427 if (!name || GvCVGEN(gv))
4429 else if ((cv = GvCV(gv))) {
4430 cv_ckproto(cv, gv, ps);
4431 /* already defined (or promised)? */
4432 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4434 bool const_changed = TRUE;
4435 if (!block && !attrs) {
4436 /* just a "sub foo;" when &foo is already defined */
4437 SAVEFREESV(PL_compcv);
4440 /* ahem, death to those who redefine active sort subs */
4441 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4442 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4445 if ((const_sv = cv_const_sv(cv)))
4446 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4447 if ((const_sv || const_changed) && ckWARN(WARN_REDEFINE))
4449 line_t oldline = CopLINE(PL_curcop);
4450 CopLINE_set(PL_curcop, PL_copline);
4451 Perl_warner(aTHX_ WARN_REDEFINE,
4452 const_sv ? "Constant subroutine %s redefined"
4453 : "Subroutine %s redefined", name);
4454 CopLINE_set(PL_curcop, oldline);
4465 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4466 * before we clobber PL_compcv.
4470 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4471 stash = GvSTASH(CvGV(cv));
4472 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4473 stash = CvSTASH(cv);
4475 stash = PL_curstash;
4478 /* possibly about to re-define existing subr -- ignore old cv */
4479 rcv = (SV*)PL_compcv;
4480 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4481 stash = GvSTASH(gv);
4483 stash = PL_curstash;
4485 apply_attrs(stash, rcv, attrs);
4487 if (cv) { /* must reuse cv if autoloaded */
4489 /* got here with just attrs -- work done, so bug out */
4490 SAVEFREESV(PL_compcv);
4494 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4495 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4496 CvOUTSIDE(PL_compcv) = 0;
4497 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4498 CvPADLIST(PL_compcv) = 0;
4499 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4500 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4501 SvREFCNT_dec(PL_compcv);
4508 PL_sub_generation++;
4511 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4512 CvFILE(cv) = CopFILE(PL_curcop);
4513 CvSTASH(cv) = PL_curstash;
4516 if (!CvMUTEXP(cv)) {
4517 New(666, CvMUTEXP(cv), 1, perl_mutex);
4518 MUTEX_INIT(CvMUTEXP(cv));
4520 #endif /* USE_THREADS */
4523 sv_setpv((SV*)cv, ps);
4525 if (PL_error_count) {
4529 char *s = strrchr(name, ':');
4531 if (strEQ(s, "BEGIN")) {
4533 "BEGIN not safe after errors--compilation aborted";
4534 if (PL_in_eval & EVAL_KEEPERR)
4535 Perl_croak(aTHX_ not_safe);
4537 /* force display of errors found but not reported */
4538 sv_catpv(ERRSV, not_safe);
4539 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4546 PL_copline = NOLINE;
4551 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4552 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4555 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4558 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4560 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4561 OpREFCNT_set(CvROOT(cv), 1);
4562 CvSTART(cv) = LINKLIST(CvROOT(cv));
4563 CvROOT(cv)->op_next = 0;
4566 /* now that optimizer has done its work, adjust pad values */
4568 SV **namep = AvARRAY(PL_comppad_name);
4569 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4572 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4575 * The only things that a clonable function needs in its
4576 * pad are references to outer lexicals and anonymous subs.
4577 * The rest are created anew during cloning.
4579 if (!((namesv = namep[ix]) != Nullsv &&
4580 namesv != &PL_sv_undef &&
4582 *SvPVX(namesv) == '&')))
4584 SvREFCNT_dec(PL_curpad[ix]);
4585 PL_curpad[ix] = Nullsv;
4590 AV *av = newAV(); /* Will be @_ */
4592 av_store(PL_comppad, 0, (SV*)av);
4593 AvFLAGS(av) = AVf_REIFY;
4595 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4596 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4598 if (!SvPADMY(PL_curpad[ix]))
4599 SvPADTMP_on(PL_curpad[ix]);
4603 if (name || aname) {
4605 char *tname = (name ? name : aname);
4607 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4608 SV *sv = NEWSV(0,0);
4609 SV *tmpstr = sv_newmortal();
4610 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4614 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4616 (long)PL_subline, (long)CopLINE(PL_curcop));
4617 gv_efullname3(tmpstr, gv, Nullch);
4618 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4619 hv = GvHVn(db_postponed);
4620 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4621 && (pcv = GvCV(db_postponed)))
4627 call_sv((SV*)pcv, G_DISCARD);
4631 if ((s = strrchr(tname,':')))
4636 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4639 if (strEQ(s, "BEGIN")) {
4640 I32 oldscope = PL_scopestack_ix;
4642 SAVECOPFILE(&PL_compiling);
4643 SAVECOPLINE(&PL_compiling);
4645 sv_setsv(PL_rs, PL_nrs);
4648 PL_beginav = newAV();
4649 DEBUG_x( dump_sub(gv) );
4650 av_push(PL_beginav, SvREFCNT_inc(cv));
4652 call_list(oldscope, PL_beginav);
4654 PL_curcop = &PL_compiling;
4655 PL_compiling.op_private = PL_hints;
4658 else if (strEQ(s, "END") && !PL_error_count) {
4661 DEBUG_x( dump_sub(gv) );
4662 av_unshift(PL_endav, 1);
4663 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4666 else if (strEQ(s, "CHECK") && !PL_error_count) {
4668 PL_checkav = newAV();
4669 DEBUG_x( dump_sub(gv) );
4670 if (PL_main_start && ckWARN(WARN_VOID))
4671 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4672 av_unshift(PL_checkav, 1);
4673 av_store(PL_checkav, 0, SvREFCNT_inc(cv));
4676 else if (strEQ(s, "INIT") && !PL_error_count) {
4678 PL_initav = newAV();
4679 DEBUG_x( dump_sub(gv) );
4680 if (PL_main_start && ckWARN(WARN_VOID))
4681 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4682 av_push(PL_initav, SvREFCNT_inc(cv));
4688 PL_copline = NOLINE;
4693 /* XXX unsafe for threads if eval_owner isn't held */
4695 =for apidoc newCONSTSUB
4697 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4698 eligible for inlining at compile-time.
4704 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4709 SAVECOPLINE(PL_curcop);
4712 CopLINE_set(PL_curcop, PL_copline);
4713 PL_hints &= ~HINT_BLOCK_SCOPE;
4716 SAVESPTR(PL_curstash);
4717 SAVECOPSTASH(PL_curcop);
4718 PL_curstash = stash;
4720 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4722 CopSTASH(PL_curcop) = stash;
4727 start_subparse(FALSE, 0),
4728 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4729 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4731 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4738 =for apidoc U||newXS
4740 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4746 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4749 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4752 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4754 /* just a cached method */
4758 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4759 /* already defined (or promised) */
4760 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4761 && HvNAME(GvSTASH(CvGV(cv)))
4762 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4763 line_t oldline = CopLINE(PL_curcop);
4764 if (PL_copline != NOLINE)
4765 CopLINE_set(PL_curcop, PL_copline);
4766 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4767 CopLINE_set(PL_curcop, oldline);
4774 if (cv) /* must reuse cv if autoloaded */
4777 cv = (CV*)NEWSV(1105,0);
4778 sv_upgrade((SV *)cv, SVt_PVCV);
4782 PL_sub_generation++;
4785 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4787 New(666, CvMUTEXP(cv), 1, perl_mutex);
4788 MUTEX_INIT(CvMUTEXP(cv));
4790 #endif /* USE_THREADS */
4791 (void)gv_fetchfile(filename);
4792 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4793 an external constant string */
4794 CvXSUB(cv) = subaddr;
4797 char *s = strrchr(name,':');
4803 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4806 if (strEQ(s, "BEGIN")) {
4808 PL_beginav = newAV();
4809 av_push(PL_beginav, SvREFCNT_inc(cv));
4812 else if (strEQ(s, "END")) {
4815 av_unshift(PL_endav, 1);
4816 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4819 else if (strEQ(s, "CHECK")) {
4821 PL_checkav = newAV();
4822 if (PL_main_start && ckWARN(WARN_VOID))
4823 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4824 av_unshift(PL_checkav, 1);
4825 av_store(PL_checkav, 0, SvREFCNT_inc(cv));
4828 else if (strEQ(s, "INIT")) {
4830 PL_initav = newAV();
4831 if (PL_main_start && ckWARN(WARN_VOID))
4832 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4833 av_push(PL_initav, SvREFCNT_inc(cv));
4845 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4855 name = SvPVx(cSVOPo->op_sv, n_a);
4858 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4860 if ((cv = GvFORM(gv))) {
4861 if (ckWARN(WARN_REDEFINE)) {
4862 line_t oldline = CopLINE(PL_curcop);
4864 CopLINE_set(PL_curcop, PL_copline);
4865 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4866 CopLINE_set(PL_curcop, oldline);
4872 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4873 CvFILE(cv) = CopFILE(PL_curcop);
4875 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4876 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4877 SvPADTMP_on(PL_curpad[ix]);
4880 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4881 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4882 OpREFCNT_set(CvROOT(cv), 1);
4883 CvSTART(cv) = LINKLIST(CvROOT(cv));
4884 CvROOT(cv)->op_next = 0;
4887 PL_copline = NOLINE;
4892 Perl_newANONLIST(pTHX_ OP *o)
4894 return newUNOP(OP_REFGEN, 0,
4895 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4899 Perl_newANONHASH(pTHX_ OP *o)
4901 return newUNOP(OP_REFGEN, 0,
4902 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4906 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4908 return newANONATTRSUB(floor, proto, Nullop, block);
4912 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4914 return newUNOP(OP_REFGEN, 0,
4915 newSVOP(OP_ANONCODE, 0,
4916 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4920 Perl_oopsAV(pTHX_ OP *o)
4922 switch (o->op_type) {
4924 o->op_type = OP_PADAV;
4925 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4926 return ref(o, OP_RV2AV);
4929 o->op_type = OP_RV2AV;
4930 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4935 if (ckWARN_d(WARN_INTERNAL))
4936 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4943 Perl_oopsHV(pTHX_ OP *o)
4947 switch (o->op_type) {
4950 o->op_type = OP_PADHV;
4951 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4952 return ref(o, OP_RV2HV);
4956 o->op_type = OP_RV2HV;
4957 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4962 if (ckWARN_d(WARN_INTERNAL))
4963 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
4970 Perl_newAVREF(pTHX_ OP *o)
4972 if (o->op_type == OP_PADANY) {
4973 o->op_type = OP_PADAV;
4974 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4977 return newUNOP(OP_RV2AV, 0, scalar(o));
4981 Perl_newGVREF(pTHX_ I32 type, OP *o)
4983 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4984 return newUNOP(OP_NULL, 0, o);
4985 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4989 Perl_newHVREF(pTHX_ OP *o)
4991 if (o->op_type == OP_PADANY) {
4992 o->op_type = OP_PADHV;
4993 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4996 return newUNOP(OP_RV2HV, 0, scalar(o));
5000 Perl_oopsCV(pTHX_ OP *o)
5002 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5008 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5010 return newUNOP(OP_RV2CV, flags, scalar(o));
5014 Perl_newSVREF(pTHX_ OP *o)
5016 if (o->op_type == OP_PADANY) {
5017 o->op_type = OP_PADSV;
5018 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5021 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
5022 o->op_flags |= OPpDONE_SVREF;
5025 return newUNOP(OP_RV2SV, 0, scalar(o));
5028 /* Check routines. */
5031 Perl_ck_anoncode(pTHX_ OP *o)
5036 name = NEWSV(1106,0);
5037 sv_upgrade(name, SVt_PVNV);
5038 sv_setpvn(name, "&", 1);
5041 ix = pad_alloc(o->op_type, SVs_PADMY);
5042 av_store(PL_comppad_name, ix, name);
5043 av_store(PL_comppad, ix, cSVOPo->op_sv);
5044 SvPADMY_on(cSVOPo->op_sv);
5045 cSVOPo->op_sv = Nullsv;
5046 cSVOPo->op_targ = ix;
5051 Perl_ck_bitop(pTHX_ OP *o)
5053 o->op_private = PL_hints;
5058 Perl_ck_concat(pTHX_ OP *o)
5060 if (cUNOPo->op_first->op_type == OP_CONCAT)
5061 o->op_flags |= OPf_STACKED;
5066 Perl_ck_spair(pTHX_ OP *o)
5068 if (o->op_flags & OPf_KIDS) {
5071 OPCODE type = o->op_type;
5072 o = modkids(ck_fun(o), type);
5073 kid = cUNOPo->op_first;
5074 newop = kUNOP->op_first->op_sibling;
5076 (newop->op_sibling ||
5077 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5078 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5079 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5083 op_free(kUNOP->op_first);
5084 kUNOP->op_first = newop;
5086 o->op_ppaddr = PL_ppaddr[++o->op_type];
5091 Perl_ck_delete(pTHX_ OP *o)
5095 if (o->op_flags & OPf_KIDS) {
5096 OP *kid = cUNOPo->op_first;
5097 switch (kid->op_type) {
5099 o->op_flags |= OPf_SPECIAL;
5102 o->op_private |= OPpSLICE;
5105 o->op_flags |= OPf_SPECIAL;
5110 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5111 PL_op_desc[o->op_type]);
5119 Perl_ck_eof(pTHX_ OP *o)
5121 I32 type = o->op_type;
5123 if (o->op_flags & OPf_KIDS) {
5124 if (cLISTOPo->op_first->op_type == OP_STUB) {
5126 o = newUNOP(type, OPf_SPECIAL,
5127 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5135 Perl_ck_eval(pTHX_ OP *o)
5137 PL_hints |= HINT_BLOCK_SCOPE;
5138 if (o->op_flags & OPf_KIDS) {
5139 SVOP *kid = (SVOP*)cUNOPo->op_first;
5142 o->op_flags &= ~OPf_KIDS;
5145 else if (kid->op_type == OP_LINESEQ) {
5148 kid->op_next = o->op_next;
5149 cUNOPo->op_first = 0;
5152 NewOp(1101, enter, 1, LOGOP);
5153 enter->op_type = OP_ENTERTRY;
5154 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5155 enter->op_private = 0;
5157 /* establish postfix order */
5158 enter->op_next = (OP*)enter;
5160 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5161 o->op_type = OP_LEAVETRY;
5162 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5163 enter->op_other = o;
5171 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5173 o->op_targ = (PADOFFSET)PL_hints;
5178 Perl_ck_exit(pTHX_ OP *o)
5181 HV *table = GvHV(PL_hintgv);
5183 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
5184 if (svp && *svp && SvTRUE(*svp))
5185 o->op_private |= OPpEXIT_VMSISH;
5192 Perl_ck_exec(pTHX_ OP *o)
5195 if (o->op_flags & OPf_STACKED) {
5197 kid = cUNOPo->op_first->op_sibling;
5198 if (kid->op_type == OP_RV2GV)
5207 Perl_ck_exists(pTHX_ OP *o)
5210 if (o->op_flags & OPf_KIDS) {
5211 OP *kid = cUNOPo->op_first;
5212 if (kid->op_type == OP_ENTERSUB) {
5213 (void) ref(kid, o->op_type);
5214 if (kid->op_type != OP_RV2CV && !PL_error_count)
5215 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5216 PL_op_desc[o->op_type]);
5217 o->op_private |= OPpEXISTS_SUB;
5219 else if (kid->op_type == OP_AELEM)
5220 o->op_flags |= OPf_SPECIAL;
5221 else if (kid->op_type != OP_HELEM)
5222 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5223 PL_op_desc[o->op_type]);
5231 Perl_ck_gvconst(pTHX_ register OP *o)
5233 o = fold_constants(o);
5234 if (o->op_type == OP_CONST)
5241 Perl_ck_rvconst(pTHX_ register OP *o)
5244 SVOP *kid = (SVOP*)cUNOPo->op_first;
5246 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5247 if (kid->op_type == OP_CONST) {
5251 SV *kidsv = kid->op_sv;
5254 /* Is it a constant from cv_const_sv()? */
5255 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5256 SV *rsv = SvRV(kidsv);
5257 int svtype = SvTYPE(rsv);
5258 char *badtype = Nullch;
5260 switch (o->op_type) {
5262 if (svtype > SVt_PVMG)
5263 badtype = "a SCALAR";
5266 if (svtype != SVt_PVAV)
5267 badtype = "an ARRAY";
5270 if (svtype != SVt_PVHV) {
5271 if (svtype == SVt_PVAV) { /* pseudohash? */
5272 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5273 if (ksv && SvROK(*ksv)
5274 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5283 if (svtype != SVt_PVCV)
5288 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5291 name = SvPV(kidsv, n_a);
5292 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5293 char *badthing = Nullch;
5294 switch (o->op_type) {
5296 badthing = "a SCALAR";
5299 badthing = "an ARRAY";
5302 badthing = "a HASH";
5307 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5311 * This is a little tricky. We only want to add the symbol if we
5312 * didn't add it in the lexer. Otherwise we get duplicate strict
5313 * warnings. But if we didn't add it in the lexer, we must at
5314 * least pretend like we wanted to add it even if it existed before,
5315 * or we get possible typo warnings. OPpCONST_ENTERED says
5316 * whether the lexer already added THIS instance of this symbol.
5318 iscv = (o->op_type == OP_RV2CV) * 2;
5320 gv = gv_fetchpv(name,
5321 iscv | !(kid->op_private & OPpCONST_ENTERED),
5324 : o->op_type == OP_RV2SV
5326 : o->op_type == OP_RV2AV
5328 : o->op_type == OP_RV2HV
5331 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5333 kid->op_type = OP_GV;
5334 SvREFCNT_dec(kid->op_sv);
5336 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5337 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5339 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5341 kid->op_sv = SvREFCNT_inc(gv);
5343 kid->op_ppaddr = PL_ppaddr[OP_GV];
5350 Perl_ck_ftst(pTHX_ OP *o)
5353 I32 type = o->op_type;
5355 if (o->op_flags & OPf_REF) {
5358 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5359 SVOP *kid = (SVOP*)cUNOPo->op_first;
5361 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5363 OP *newop = newGVOP(type, OPf_REF,
5364 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5371 if (type == OP_FTTTY)
5372 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5375 o = newUNOP(type, 0, newDEFSVOP());
5378 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5380 if (PL_hints & HINT_LOCALE)
5381 o->op_private |= OPpLOCALE;
5388 Perl_ck_fun(pTHX_ OP *o)
5395 int type = o->op_type;
5396 register I32 oa = PL_opargs[type] >> OASHIFT;
5398 if (o->op_flags & OPf_STACKED) {
5399 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5402 return no_fh_allowed(o);
5405 if (o->op_flags & OPf_KIDS) {
5407 tokid = &cLISTOPo->op_first;
5408 kid = cLISTOPo->op_first;
5409 if (kid->op_type == OP_PUSHMARK ||
5410 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5412 tokid = &kid->op_sibling;
5413 kid = kid->op_sibling;
5415 if (!kid && PL_opargs[type] & OA_DEFGV)
5416 *tokid = kid = newDEFSVOP();
5420 sibl = kid->op_sibling;
5423 /* list seen where single (scalar) arg expected? */
5424 if (numargs == 1 && !(oa >> 4)
5425 && kid->op_type == OP_LIST && type != OP_SCALAR)
5427 return too_many_arguments(o,PL_op_desc[type]);
5440 if (kid->op_type == OP_CONST &&
5441 (kid->op_private & OPpCONST_BARE))
5443 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5444 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5445 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5446 if (ckWARN(WARN_DEPRECATED))
5447 Perl_warner(aTHX_ WARN_DEPRECATED,
5448 "Array @%s missing the @ in argument %"IVdf" of %s()",
5449 name, (IV)numargs, PL_op_desc[type]);
5452 kid->op_sibling = sibl;
5455 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5456 bad_type(numargs, "array", PL_op_desc[type], kid);
5460 if (kid->op_type == OP_CONST &&
5461 (kid->op_private & OPpCONST_BARE))
5463 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5464 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5465 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5466 if (ckWARN(WARN_DEPRECATED))
5467 Perl_warner(aTHX_ WARN_DEPRECATED,
5468 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5469 name, (IV)numargs, PL_op_desc[type]);
5472 kid->op_sibling = sibl;
5475 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5476 bad_type(numargs, "hash", PL_op_desc[type], kid);
5481 OP *newop = newUNOP(OP_NULL, 0, kid);
5482 kid->op_sibling = 0;
5484 newop->op_next = newop;
5486 kid->op_sibling = sibl;
5491 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5492 if (kid->op_type == OP_CONST &&
5493 (kid->op_private & OPpCONST_BARE))
5495 OP *newop = newGVOP(OP_GV, 0,
5496 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5501 else if (kid->op_type == OP_READLINE) {
5502 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5503 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5506 I32 flags = OPf_SPECIAL;
5510 /* is this op a FH constructor? */
5511 if (is_handle_constructor(o,numargs)) {
5512 char *name = Nullch;
5516 /* Set a flag to tell rv2gv to vivify
5517 * need to "prove" flag does not mean something
5518 * else already - NI-S 1999/05/07
5521 if (kid->op_type == OP_PADSV) {
5522 SV **namep = av_fetch(PL_comppad_name,
5524 if (namep && *namep)
5525 name = SvPV(*namep, len);
5527 else if (kid->op_type == OP_RV2SV
5528 && kUNOP->op_first->op_type == OP_GV)
5530 GV *gv = cGVOPx_gv(kUNOP->op_first);
5532 len = GvNAMELEN(gv);
5534 else if (kid->op_type == OP_AELEM
5535 || kid->op_type == OP_HELEM)
5537 name = "__ANONIO__";
5543 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5544 namesv = PL_curpad[targ];
5545 (void)SvUPGRADE(namesv, SVt_PV);
5547 sv_setpvn(namesv, "$", 1);
5548 sv_catpvn(namesv, name, len);
5551 kid->op_sibling = 0;
5552 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5553 kid->op_targ = targ;
5554 kid->op_private |= priv;
5556 kid->op_sibling = sibl;
5562 mod(scalar(kid), type);
5566 tokid = &kid->op_sibling;
5567 kid = kid->op_sibling;
5569 o->op_private |= numargs;
5571 return too_many_arguments(o,PL_op_desc[o->op_type]);
5574 else if (PL_opargs[type] & OA_DEFGV) {
5576 return newUNOP(type, 0, newDEFSVOP());
5580 while (oa & OA_OPTIONAL)
5582 if (oa && oa != OA_LIST)
5583 return too_few_arguments(o,PL_op_desc[o->op_type]);
5589 Perl_ck_glob(pTHX_ OP *o)
5594 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5595 append_elem(OP_GLOB, o, newDEFSVOP());
5597 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5598 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5600 #if !defined(PERL_EXTERNAL_GLOB)
5601 /* XXX this can be tightened up and made more failsafe. */
5604 Perl_load_module(aTHX_ 0, newSVpvn("File::Glob", 10), Nullsv,
5605 /* null-terminated import list */
5606 newSVpvn(":globally", 9), Nullsv);
5607 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5610 #endif /* PERL_EXTERNAL_GLOB */
5612 if (gv && GvIMPORTED_CV(gv)) {
5613 append_elem(OP_GLOB, o,
5614 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5615 o->op_type = OP_LIST;
5616 o->op_ppaddr = PL_ppaddr[OP_LIST];
5617 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5618 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5619 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5620 append_elem(OP_LIST, o,
5621 scalar(newUNOP(OP_RV2CV, 0,
5622 newGVOP(OP_GV, 0, gv)))));
5623 o = newUNOP(OP_NULL, 0, ck_subr(o));
5624 o->op_targ = OP_GLOB; /* hint at what it used to be */
5627 gv = newGVgen("main");
5629 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5635 Perl_ck_grep(pTHX_ OP *o)
5639 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5641 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5642 NewOp(1101, gwop, 1, LOGOP);
5644 if (o->op_flags & OPf_STACKED) {
5647 kid = cLISTOPo->op_first->op_sibling;
5648 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5651 kid->op_next = (OP*)gwop;
5652 o->op_flags &= ~OPf_STACKED;
5654 kid = cLISTOPo->op_first->op_sibling;
5655 if (type == OP_MAPWHILE)
5662 kid = cLISTOPo->op_first->op_sibling;
5663 if (kid->op_type != OP_NULL)
5664 Perl_croak(aTHX_ "panic: ck_grep");
5665 kid = kUNOP->op_first;
5667 gwop->op_type = type;
5668 gwop->op_ppaddr = PL_ppaddr[type];
5669 gwop->op_first = listkids(o);
5670 gwop->op_flags |= OPf_KIDS;
5671 gwop->op_private = 1;
5672 gwop->op_other = LINKLIST(kid);
5673 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5674 kid->op_next = (OP*)gwop;
5676 kid = cLISTOPo->op_first->op_sibling;
5677 if (!kid || !kid->op_sibling)
5678 return too_few_arguments(o,PL_op_desc[o->op_type]);
5679 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5680 mod(kid, OP_GREPSTART);
5686 Perl_ck_index(pTHX_ OP *o)
5688 if (o->op_flags & OPf_KIDS) {
5689 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5691 kid = kid->op_sibling; /* get past "big" */
5692 if (kid && kid->op_type == OP_CONST)
5693 fbm_compile(((SVOP*)kid)->op_sv, 0);
5699 Perl_ck_lengthconst(pTHX_ OP *o)
5701 /* XXX length optimization goes here */
5706 Perl_ck_lfun(pTHX_ OP *o)
5708 OPCODE type = o->op_type;
5709 return modkids(ck_fun(o), type);
5713 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5716 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5717 switch (cUNOPo->op_first->op_type) {
5719 break; /* Globals via GV can be undef */
5721 case OP_AASSIGN: /* Is this a good idea? */
5722 Perl_warner(aTHX_ WARN_DEPRECATED,
5723 "defined(@array) is deprecated");
5724 Perl_warner(aTHX_ WARN_DEPRECATED,
5725 "\t(Maybe you should just omit the defined()?)\n");
5728 break; /* Globals via GV can be undef */
5730 Perl_warner(aTHX_ WARN_DEPRECATED,
5731 "defined(%%hash) is deprecated");
5732 Perl_warner(aTHX_ WARN_DEPRECATED,
5733 "\t(Maybe you should just omit the defined()?)\n");
5744 Perl_ck_rfun(pTHX_ OP *o)
5746 OPCODE type = o->op_type;
5747 return refkids(ck_fun(o), type);
5751 Perl_ck_listiob(pTHX_ OP *o)
5755 kid = cLISTOPo->op_first;
5758 kid = cLISTOPo->op_first;
5760 if (kid->op_type == OP_PUSHMARK)
5761 kid = kid->op_sibling;
5762 if (kid && o->op_flags & OPf_STACKED)
5763 kid = kid->op_sibling;
5764 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5765 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5766 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5767 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5768 cLISTOPo->op_first->op_sibling = kid;
5769 cLISTOPo->op_last = kid;
5770 kid = kid->op_sibling;
5775 append_elem(o->op_type, o, newDEFSVOP());
5781 if (PL_hints & HINT_LOCALE)
5782 o->op_private |= OPpLOCALE;
5789 Perl_ck_fun_locale(pTHX_ OP *o)
5795 if (PL_hints & HINT_LOCALE)
5796 o->op_private |= OPpLOCALE;
5803 Perl_ck_sassign(pTHX_ OP *o)
5805 OP *kid = cLISTOPo->op_first;
5806 /* has a disposable target? */
5807 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5808 && !(kid->op_flags & OPf_STACKED)
5809 /* Cannot steal the second time! */
5810 && !(kid->op_private & OPpTARGET_MY))
5812 OP *kkid = kid->op_sibling;
5814 /* Can just relocate the target. */
5815 if (kkid && kkid->op_type == OP_PADSV
5816 && !(kkid->op_private & OPpLVAL_INTRO))
5818 kid->op_targ = kkid->op_targ;
5820 /* Now we do not need PADSV and SASSIGN. */
5821 kid->op_sibling = o->op_sibling; /* NULL */
5822 cLISTOPo->op_first = NULL;
5825 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5833 Perl_ck_scmp(pTHX_ OP *o)
5837 if (PL_hints & HINT_LOCALE)
5838 o->op_private |= OPpLOCALE;
5845 Perl_ck_match(pTHX_ OP *o)
5847 o->op_private |= OPpRUNTIME;
5852 Perl_ck_method(pTHX_ OP *o)
5854 OP *kid = cUNOPo->op_first;
5855 if (kid->op_type == OP_CONST) {
5856 SV* sv = kSVOP->op_sv;
5857 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5859 (void)SvUPGRADE(sv, SVt_PVIV);
5861 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5862 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5863 kSVOP->op_sv = Nullsv;
5872 Perl_ck_null(pTHX_ OP *o)
5878 Perl_ck_open(pTHX_ OP *o)
5880 HV *table = GvHV(PL_hintgv);
5884 svp = hv_fetch(table, "open_IN", 7, FALSE);
5886 mode = mode_from_discipline(*svp);
5887 if (mode & O_BINARY)
5888 o->op_private |= OPpOPEN_IN_RAW;
5889 else if (mode & O_TEXT)
5890 o->op_private |= OPpOPEN_IN_CRLF;
5893 svp = hv_fetch(table, "open_OUT", 8, FALSE);
5895 mode = mode_from_discipline(*svp);
5896 if (mode & O_BINARY)
5897 o->op_private |= OPpOPEN_OUT_RAW;
5898 else if (mode & O_TEXT)
5899 o->op_private |= OPpOPEN_OUT_CRLF;
5902 if (o->op_type == OP_BACKTICK)
5908 Perl_ck_repeat(pTHX_ OP *o)
5910 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5911 o->op_private |= OPpREPEAT_DOLIST;
5912 cBINOPo->op_first = force_list(cBINOPo->op_first);
5920 Perl_ck_require(pTHX_ OP *o)
5922 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5923 SVOP *kid = (SVOP*)cUNOPo->op_first;
5925 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5927 for (s = SvPVX(kid->op_sv); *s; s++) {
5928 if (*s == ':' && s[1] == ':') {
5930 Move(s+2, s+1, strlen(s+2)+1, char);
5931 --SvCUR(kid->op_sv);
5934 if (SvREADONLY(kid->op_sv)) {
5935 SvREADONLY_off(kid->op_sv);
5936 sv_catpvn(kid->op_sv, ".pm", 3);
5937 SvREADONLY_on(kid->op_sv);
5940 sv_catpvn(kid->op_sv, ".pm", 3);
5948 Perl_ck_retarget(pTHX_ OP *o)
5950 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5957 Perl_ck_select(pTHX_ OP *o)
5960 if (o->op_flags & OPf_KIDS) {
5961 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5962 if (kid && kid->op_sibling) {
5963 o->op_type = OP_SSELECT;
5964 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5966 return fold_constants(o);
5970 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5971 if (kid && kid->op_type == OP_RV2GV)
5972 kid->op_private &= ~HINT_STRICT_REFS;
5977 Perl_ck_shift(pTHX_ OP *o)
5979 I32 type = o->op_type;
5981 if (!(o->op_flags & OPf_KIDS)) {
5986 if (!CvUNIQUE(PL_compcv)) {
5987 argop = newOP(OP_PADAV, OPf_REF);
5988 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5991 argop = newUNOP(OP_RV2AV, 0,
5992 scalar(newGVOP(OP_GV, 0,
5993 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5996 argop = newUNOP(OP_RV2AV, 0,
5997 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5998 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5999 #endif /* USE_THREADS */
6000 return newUNOP(type, 0, scalar(argop));
6002 return scalar(modkids(ck_fun(o), type));
6006 Perl_ck_sort(pTHX_ OP *o)
6011 if (PL_hints & HINT_LOCALE)
6012 o->op_private |= OPpLOCALE;
6015 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
6017 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6018 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
6020 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
6022 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
6024 if (kid->op_type == OP_SCOPE) {
6028 else if (kid->op_type == OP_LEAVE) {
6029 if (o->op_type == OP_SORT) {
6030 null(kid); /* wipe out leave */
6033 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
6034 if (k->op_next == kid)
6036 /* don't descend into loops */
6037 else if (k->op_type == OP_ENTERLOOP
6038 || k->op_type == OP_ENTERITER)
6040 k = cLOOPx(k)->op_lastop;
6045 kid->op_next = 0; /* just disconnect the leave */
6046 k = kLISTOP->op_first;
6051 if (o->op_type == OP_SORT) {
6052 /* provide scalar context for comparison function/block */
6058 o->op_flags |= OPf_SPECIAL;
6060 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
6063 firstkid = firstkid->op_sibling;
6066 /* provide list context for arguments */
6067 if (o->op_type == OP_SORT)
6074 S_simplify_sort(pTHX_ OP *o)
6077 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6081 if (!(o->op_flags & OPf_STACKED))
6083 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
6084 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
6085 kid = kUNOP->op_first; /* get past null */
6086 if (kid->op_type != OP_SCOPE)
6088 kid = kLISTOP->op_last; /* get past scope */
6089 switch(kid->op_type) {
6097 k = kid; /* remember this node*/
6098 if (kBINOP->op_first->op_type != OP_RV2SV)
6100 kid = kBINOP->op_first; /* get past cmp */
6101 if (kUNOP->op_first->op_type != OP_GV)
6103 kid = kUNOP->op_first; /* get past rv2sv */
6105 if (GvSTASH(gv) != PL_curstash)
6107 if (strEQ(GvNAME(gv), "a"))
6109 else if (strEQ(GvNAME(gv), "b"))
6113 kid = k; /* back to cmp */
6114 if (kBINOP->op_last->op_type != OP_RV2SV)
6116 kid = kBINOP->op_last; /* down to 2nd arg */
6117 if (kUNOP->op_first->op_type != OP_GV)
6119 kid = kUNOP->op_first; /* get past rv2sv */
6121 if (GvSTASH(gv) != PL_curstash
6123 ? strNE(GvNAME(gv), "a")
6124 : strNE(GvNAME(gv), "b")))
6126 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6128 o->op_private |= OPpSORT_REVERSE;
6129 if (k->op_type == OP_NCMP)
6130 o->op_private |= OPpSORT_NUMERIC;
6131 if (k->op_type == OP_I_NCMP)
6132 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6133 kid = cLISTOPo->op_first->op_sibling;
6134 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6135 op_free(kid); /* then delete it */
6136 cLISTOPo->op_children--;
6140 Perl_ck_split(pTHX_ OP *o)
6144 if (o->op_flags & OPf_STACKED)
6145 return no_fh_allowed(o);
6147 kid = cLISTOPo->op_first;
6148 if (kid->op_type != OP_NULL)
6149 Perl_croak(aTHX_ "panic: ck_split");
6150 kid = kid->op_sibling;
6151 op_free(cLISTOPo->op_first);
6152 cLISTOPo->op_first = kid;
6154 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6155 cLISTOPo->op_last = kid; /* There was only one element previously */
6158 if (kid->op_type != OP_MATCH) {
6159 OP *sibl = kid->op_sibling;
6160 kid->op_sibling = 0;
6161 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6162 if (cLISTOPo->op_first == cLISTOPo->op_last)
6163 cLISTOPo->op_last = kid;
6164 cLISTOPo->op_first = kid;
6165 kid->op_sibling = sibl;
6168 kid->op_type = OP_PUSHRE;
6169 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6172 if (!kid->op_sibling)
6173 append_elem(OP_SPLIT, o, newDEFSVOP());
6175 kid = kid->op_sibling;
6178 if (!kid->op_sibling)
6179 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6181 kid = kid->op_sibling;
6184 if (kid->op_sibling)
6185 return too_many_arguments(o,PL_op_desc[o->op_type]);
6191 Perl_ck_join(pTHX_ OP *o)
6193 if (ckWARN(WARN_SYNTAX)) {
6194 OP *kid = cLISTOPo->op_first->op_sibling;
6195 if (kid && kid->op_type == OP_MATCH) {
6196 char *pmstr = "STRING";
6197 if (kPMOP->op_pmregexp)
6198 pmstr = kPMOP->op_pmregexp->precomp;
6199 Perl_warner(aTHX_ WARN_SYNTAX,
6200 "/%s/ should probably be written as \"%s\"",
6208 Perl_ck_subr(pTHX_ OP *o)
6211 OP *prev = ((cUNOPo->op_first->op_sibling)
6212 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6213 OP *o2 = prev->op_sibling;
6222 o->op_private |= OPpENTERSUB_HASTARG;
6223 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6224 if (cvop->op_type == OP_RV2CV) {
6226 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6227 null(cvop); /* disable rv2cv */
6228 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6229 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6230 GV *gv = cGVOPx_gv(tmpop);
6233 tmpop->op_private |= OPpEARLY_CV;
6234 else if (SvPOK(cv)) {
6235 namegv = CvANON(cv) ? gv : CvGV(cv);
6236 proto = SvPV((SV*)cv, n_a);
6240 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6241 if (o2->op_type == OP_CONST)
6242 o2->op_private &= ~OPpCONST_STRICT;
6243 else if (o2->op_type == OP_LIST) {
6244 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6245 if (o && o->op_type == OP_CONST)
6246 o->op_private &= ~OPpCONST_STRICT;
6249 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6250 if (PERLDB_SUB && PL_curstash != PL_debstash)
6251 o->op_private |= OPpENTERSUB_DB;
6252 while (o2 != cvop) {
6256 return too_many_arguments(o, gv_ename(namegv));
6274 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6276 arg == 1 ? "block or sub {}" : "sub {}",
6277 gv_ename(namegv), o2);
6280 /* '*' allows any scalar type, including bareword */
6283 if (o2->op_type == OP_RV2GV)
6284 goto wrapref; /* autoconvert GLOB -> GLOBref */
6285 else if (o2->op_type == OP_CONST)
6286 o2->op_private &= ~OPpCONST_STRICT;
6287 else if (o2->op_type == OP_ENTERSUB) {
6288 /* accidental subroutine, revert to bareword */
6289 OP *gvop = ((UNOP*)o2)->op_first;
6290 if (gvop && gvop->op_type == OP_NULL) {
6291 gvop = ((UNOP*)gvop)->op_first;
6293 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6296 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6297 (gvop = ((UNOP*)gvop)->op_first) &&
6298 gvop->op_type == OP_GV)
6300 GV *gv = cGVOPx_gv(gvop);
6301 OP *sibling = o2->op_sibling;
6302 SV *n = newSVpvn("",0);
6304 gv_fullname3(n, gv, "");
6305 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6306 sv_chop(n, SvPVX(n)+6);
6307 o2 = newSVOP(OP_CONST, 0, n);
6308 prev->op_sibling = o2;
6309 o2->op_sibling = sibling;
6321 if (o2->op_type != OP_RV2GV)
6322 bad_type(arg, "symbol", gv_ename(namegv), o2);
6325 if (o2->op_type != OP_ENTERSUB)
6326 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6329 if (o2->op_type != OP_RV2SV
6330 && o2->op_type != OP_PADSV
6331 && o2->op_type != OP_HELEM
6332 && o2->op_type != OP_AELEM
6333 && o2->op_type != OP_THREADSV)
6335 bad_type(arg, "scalar", gv_ename(namegv), o2);
6339 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6340 bad_type(arg, "array", gv_ename(namegv), o2);
6343 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6344 bad_type(arg, "hash", gv_ename(namegv), o2);
6348 OP* sib = kid->op_sibling;
6349 kid->op_sibling = 0;
6350 o2 = newUNOP(OP_REFGEN, 0, kid);
6351 o2->op_sibling = sib;
6352 prev->op_sibling = o2;
6363 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6364 gv_ename(namegv), SvPV((SV*)cv, n_a));
6369 mod(o2, OP_ENTERSUB);
6371 o2 = o2->op_sibling;
6373 if (proto && !optional &&
6374 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6375 return too_few_arguments(o, gv_ename(namegv));
6380 Perl_ck_svconst(pTHX_ OP *o)
6382 SvREADONLY_on(cSVOPo->op_sv);
6387 Perl_ck_trunc(pTHX_ OP *o)
6389 if (o->op_flags & OPf_KIDS) {
6390 SVOP *kid = (SVOP*)cUNOPo->op_first;
6392 if (kid->op_type == OP_NULL)
6393 kid = (SVOP*)kid->op_sibling;
6394 if (kid && kid->op_type == OP_CONST &&
6395 (kid->op_private & OPpCONST_BARE))
6397 o->op_flags |= OPf_SPECIAL;
6398 kid->op_private &= ~OPpCONST_STRICT;
6404 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6407 Perl_peep(pTHX_ register OP *o)
6410 register OP* oldop = 0;
6412 OP *last_composite = Nullop;
6414 if (!o || o->op_seq)
6418 SAVEVPTR(PL_curcop);
6419 for (; o; o = o->op_next) {
6425 switch (o->op_type) {
6429 PL_curcop = ((COP*)o); /* for warnings */
6430 o->op_seq = PL_op_seqmax++;
6431 last_composite = Nullop;
6435 if (cSVOPo->op_private & OPpCONST_STRICT)
6436 no_bareword_allowed(o);
6438 /* Relocate sv to the pad for thread safety.
6439 * Despite being a "constant", the SV is written to,
6440 * for reference counts, sv_upgrade() etc. */
6442 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6443 if (SvPADTMP(cSVOPo->op_sv)) {
6444 /* If op_sv is already a PADTMP then it is being used by
6445 * another pad, so make a copy. */
6446 sv_setsv(PL_curpad[ix],cSVOPo->op_sv);
6447 SvREADONLY_on(PL_curpad[ix]);
6448 SvREFCNT_dec(cSVOPo->op_sv);
6451 SvREFCNT_dec(PL_curpad[ix]);
6452 SvPADTMP_on(cSVOPo->op_sv);
6453 PL_curpad[ix] = cSVOPo->op_sv;
6455 cSVOPo->op_sv = Nullsv;
6459 o->op_seq = PL_op_seqmax++;
6463 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6464 if (o->op_next->op_private & OPpTARGET_MY) {
6465 if (o->op_flags & OPf_STACKED) /* chained concats */
6466 goto ignore_optimization;
6468 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6469 o->op_targ = o->op_next->op_targ;
6470 o->op_next->op_targ = 0;
6471 o->op_private |= OPpTARGET_MY;
6476 ignore_optimization:
6477 o->op_seq = PL_op_seqmax++;
6480 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6481 o->op_seq = PL_op_seqmax++;
6482 break; /* Scalar stub must produce undef. List stub is noop */
6486 if (o->op_targ == OP_NEXTSTATE
6487 || o->op_targ == OP_DBSTATE
6488 || o->op_targ == OP_SETSTATE)
6490 PL_curcop = ((COP*)o);
6497 if (oldop && o->op_next) {
6498 oldop->op_next = o->op_next;
6501 o->op_seq = PL_op_seqmax++;
6505 if (o->op_next->op_type == OP_RV2SV) {
6506 if (!(o->op_next->op_private & OPpDEREF)) {
6508 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6510 o->op_next = o->op_next->op_next;
6511 o->op_type = OP_GVSV;
6512 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6515 else if (o->op_next->op_type == OP_RV2AV) {
6516 OP* pop = o->op_next->op_next;
6518 if (pop->op_type == OP_CONST &&
6519 (PL_op = pop->op_next) &&
6520 pop->op_next->op_type == OP_AELEM &&
6521 !(pop->op_next->op_private &
6522 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6523 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6531 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6532 o->op_next = pop->op_next->op_next;
6533 o->op_type = OP_AELEMFAST;
6534 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6535 o->op_private = (U8)i;
6540 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6542 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6543 /* XXX could check prototype here instead of just carping */
6544 SV *sv = sv_newmortal();
6545 gv_efullname3(sv, gv, Nullch);
6546 Perl_warner(aTHX_ WARN_PROTOTYPE,
6547 "%s() called too early to check prototype",
6552 o->op_seq = PL_op_seqmax++;
6563 o->op_seq = PL_op_seqmax++;
6564 while (cLOGOP->op_other->op_type == OP_NULL)
6565 cLOGOP->op_other = cLOGOP->op_other->op_next;
6566 peep(cLOGOP->op_other);
6570 o->op_seq = PL_op_seqmax++;
6571 peep(cLOOP->op_redoop);
6572 peep(cLOOP->op_nextop);
6573 peep(cLOOP->op_lastop);
6579 o->op_seq = PL_op_seqmax++;
6580 peep(cPMOP->op_pmreplstart);
6584 o->op_seq = PL_op_seqmax++;
6585 if (ckWARN(WARN_SYNTAX) && o->op_next
6586 && o->op_next->op_type == OP_NEXTSTATE) {
6587 if (o->op_next->op_sibling &&
6588 o->op_next->op_sibling->op_type != OP_EXIT &&
6589 o->op_next->op_sibling->op_type != OP_WARN &&
6590 o->op_next->op_sibling->op_type != OP_DIE) {
6591 line_t oldline = CopLINE(PL_curcop);
6593 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6594 Perl_warner(aTHX_ WARN_EXEC,
6595 "Statement unlikely to be reached");
6596 Perl_warner(aTHX_ WARN_EXEC,
6597 "\t(Maybe you meant system() when you said exec()?)\n");
6598 CopLINE_set(PL_curcop, oldline);
6607 SV **svp, **indsvp, *sv;
6612 o->op_seq = PL_op_seqmax++;
6613 if ((o->op_private & (OPpLVAL_INTRO))
6614 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6616 rop = (UNOP*)((BINOP*)o)->op_first;
6617 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6619 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6620 if (!SvOBJECT(lexname))
6622 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6623 if (!fields || !GvHV(*fields))
6625 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6626 key = SvPV(*svp, keylen);
6627 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6629 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6630 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6632 ind = SvIV(*indsvp);
6634 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6635 rop->op_type = OP_RV2AV;
6636 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6637 o->op_type = OP_AELEM;
6638 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6640 if (SvREADONLY(*svp))
6642 SvFLAGS(sv) |= (SvFLAGS(*svp)
6643 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6653 SV **svp, **indsvp, *sv;
6657 SVOP *first_key_op, *key_op;
6659 o->op_seq = PL_op_seqmax++;
6660 if ((o->op_private & (OPpLVAL_INTRO))
6661 /* I bet there's always a pushmark... */
6662 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
6663 /* hmmm, no optimization if list contains only one key. */
6665 rop = (UNOP*)((LISTOP*)o)->op_last;
6666 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6668 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6669 if (!SvOBJECT(lexname))
6671 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6672 if (!fields || !GvHV(*fields))
6674 /* Again guessing that the pushmark can be jumped over.... */
6675 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
6676 ->op_first->op_sibling;
6677 /* Check that the key list contains only constants. */
6678 for (key_op = first_key_op; key_op;
6679 key_op = (SVOP*)key_op->op_sibling)
6680 if (key_op->op_type != OP_CONST)
6684 rop->op_type = OP_RV2AV;
6685 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6686 o->op_type = OP_ASLICE;
6687 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
6688 for (key_op = first_key_op; key_op;
6689 key_op = (SVOP*)key_op->op_sibling) {
6690 svp = cSVOPx_svp(key_op);
6691 key = SvPV(*svp, keylen);
6692 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6694 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
6695 "in variable %s of type %s",
6696 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6698 ind = SvIV(*indsvp);
6700 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6702 if (SvREADONLY(*svp))
6704 SvFLAGS(sv) |= (SvFLAGS(*svp)
6705 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6714 if (!(o->op_flags & OPf_WANT)
6715 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6719 o->op_seq = PL_op_seqmax++;
6723 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6724 o->op_seq = PL_op_seqmax++;
6730 if (last_composite) {
6731 OP *r = last_composite;
6733 while (r->op_sibling)
6736 || (r->op_next->op_type == OP_LIST
6737 && r->op_next->op_next == o))
6739 if (last_composite->op_type == OP_RV2AV)
6740 yyerror("Lvalue subs returning arrays not implemented yet");
6742 yyerror("Lvalue subs returning hashes not implemented yet");
6749 o->op_seq = PL_op_seqmax++;