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)));
106 S_trlist_upgrade(pTHX_ U8** sp, U8** ep)
112 Newz(801, d, (e - s) * 2, U8);
116 if (*s < 0x80 || *s == 0xff)
120 *d++ = ((c >> 6) | 0xc0);
121 *d++ = ((c & 0x3f) | 0x80);
129 /* "register" allocation */
132 Perl_pad_allocmy(pTHX_ char *name)
138 if (!(PL_in_my == KEY_our ||
140 (PL_hints & HINT_UTF8 && UTF8_IS_START(name[1])) ||
141 (name[1] == '_' && (int)strlen(name) > 2)))
143 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
144 /* 1999-02-27 mjd@plover.com */
146 p = strchr(name, '\0');
147 /* The next block assumes the buffer is at least 205 chars
148 long. At present, it's always at least 256 chars. */
150 strcpy(name+200, "...");
156 /* Move everything else down one character */
157 for (; p-name > 2; p--)
159 name[2] = toCTRL(name[1]);
162 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
164 if (ckWARN(WARN_MISC) && AvFILLp(PL_comppad_name) >= 0) {
165 SV **svp = AvARRAY(PL_comppad_name);
166 HV *ourstash = (PL_curstash ? PL_curstash : PL_defstash);
167 PADOFFSET top = AvFILLp(PL_comppad_name);
168 for (off = top; off > PL_comppad_name_floor; off--) {
170 && sv != &PL_sv_undef
171 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
172 && (PL_in_my != KEY_our
173 || ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash))
174 && strEQ(name, SvPVX(sv)))
176 Perl_warner(aTHX_ WARN_MISC,
177 "\"%s\" variable %s masks earlier declaration in same %s",
178 (PL_in_my == KEY_our ? "our" : "my"),
180 (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
185 if (PL_in_my == KEY_our) {
188 && sv != &PL_sv_undef
189 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
190 && ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash)
191 && strEQ(name, SvPVX(sv)))
193 Perl_warner(aTHX_ WARN_MISC,
194 "\"our\" variable %s redeclared", name);
195 Perl_warner(aTHX_ WARN_MISC,
196 "\t(Did you mean \"local\" instead of \"our\"?)\n");
199 } while ( off-- > 0 );
202 off = pad_alloc(OP_PADSV, SVs_PADMY);
204 sv_upgrade(sv, SVt_PVNV);
206 if (PL_in_my_stash) {
208 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"%s\"",
209 name, PL_in_my == KEY_our ? "our" : "my"));
211 (void)SvUPGRADE(sv, SVt_PVMG);
212 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
215 if (PL_in_my == KEY_our) {
216 (void)SvUPGRADE(sv, SVt_PVGV);
217 GvSTASH(sv) = (HV*)SvREFCNT_inc(PL_curstash ? (SV*)PL_curstash : (SV*)PL_defstash);
218 SvFLAGS(sv) |= SVpad_OUR;
220 av_store(PL_comppad_name, off, sv);
221 SvNVX(sv) = (NV)PAD_MAX;
222 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
223 if (!PL_min_intro_pending)
224 PL_min_intro_pending = off;
225 PL_max_intro_pending = off;
227 av_store(PL_comppad, off, (SV*)newAV());
228 else if (*name == '%')
229 av_store(PL_comppad, off, (SV*)newHV());
230 SvPADMY_on(PL_curpad[off]);
235 S_pad_addlex(pTHX_ SV *proto_namesv)
237 SV *namesv = NEWSV(1103,0);
238 PADOFFSET newoff = pad_alloc(OP_PADSV, SVs_PADMY);
239 sv_upgrade(namesv, SVt_PVNV);
240 sv_setpv(namesv, SvPVX(proto_namesv));
241 av_store(PL_comppad_name, newoff, namesv);
242 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
243 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
244 SvFAKE_on(namesv); /* A ref, not a real var */
245 if (SvFLAGS(proto_namesv) & SVpad_OUR) { /* An "our" variable */
246 SvFLAGS(namesv) |= SVpad_OUR;
247 (void)SvUPGRADE(namesv, SVt_PVGV);
248 GvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)GvSTASH(proto_namesv));
250 if (SvOBJECT(proto_namesv)) { /* A typed var */
252 (void)SvUPGRADE(namesv, SVt_PVMG);
253 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(proto_namesv));
259 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
262 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
263 I32 cx_ix, I32 saweval, U32 flags)
270 register PERL_CONTEXT *cx;
272 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
273 AV *curlist = CvPADLIST(cv);
274 SV **svp = av_fetch(curlist, 0, FALSE);
277 if (!svp || *svp == &PL_sv_undef)
280 svp = AvARRAY(curname);
281 for (off = AvFILLp(curname); off > 0; off--) {
282 if ((sv = svp[off]) &&
283 sv != &PL_sv_undef &&
285 seq > I_32(SvNVX(sv)) &&
286 strEQ(SvPVX(sv), name))
297 return 0; /* don't clone from inactive stack frame */
301 oldpad = (AV*)AvARRAY(curlist)[depth];
302 oldsv = *av_fetch(oldpad, off, TRUE);
303 if (!newoff) { /* Not a mere clone operation. */
304 newoff = pad_addlex(sv);
305 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
306 /* "It's closures all the way down." */
307 CvCLONE_on(PL_compcv);
309 if (CvANON(PL_compcv))
310 oldsv = Nullsv; /* no need to keep ref */
315 bcv && bcv != cv && !CvCLONE(bcv);
316 bcv = CvOUTSIDE(bcv))
319 /* install the missing pad entry in intervening
320 * nested subs and mark them cloneable.
321 * XXX fix pad_foo() to not use globals */
322 AV *ocomppad_name = PL_comppad_name;
323 AV *ocomppad = PL_comppad;
324 SV **ocurpad = PL_curpad;
325 AV *padlist = CvPADLIST(bcv);
326 PL_comppad_name = (AV*)AvARRAY(padlist)[0];
327 PL_comppad = (AV*)AvARRAY(padlist)[1];
328 PL_curpad = AvARRAY(PL_comppad);
330 PL_comppad_name = ocomppad_name;
331 PL_comppad = ocomppad;
336 if (ckWARN(WARN_CLOSURE)
337 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
339 Perl_warner(aTHX_ WARN_CLOSURE,
340 "Variable \"%s\" may be unavailable",
348 else if (!CvUNIQUE(PL_compcv)) {
349 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv)
350 && !(SvFLAGS(sv) & SVpad_OUR))
352 Perl_warner(aTHX_ WARN_CLOSURE,
353 "Variable \"%s\" will not stay shared", name);
357 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
363 if (flags & FINDLEX_NOSEARCH)
366 /* Nothing in current lexical context--try eval's context, if any.
367 * This is necessary to let the perldb get at lexically scoped variables.
368 * XXX This will also probably interact badly with eval tree caching.
371 for (i = cx_ix; i >= 0; i--) {
373 switch (CxTYPE(cx)) {
375 if (i == 0 && saweval) {
376 seq = cxstack[saweval].blk_oldcop->cop_seq;
377 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
381 switch (cx->blk_eval.old_op_type) {
388 /* require/do must have their own scope */
397 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
398 saweval = i; /* so we know where we were called from */
401 seq = cxstack[saweval].blk_oldcop->cop_seq;
402 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
410 Perl_pad_findmy(pTHX_ char *name)
416 SV **svp = AvARRAY(PL_comppad_name);
417 U32 seq = PL_cop_seqmax;
423 * Special case to get lexical (and hence per-thread) @_.
424 * XXX I need to find out how to tell at parse-time whether use
425 * of @_ should refer to a lexical (from a sub) or defgv (global
426 * scope and maybe weird sub-ish things like formats). See
427 * startsub in perly.y. It's possible that @_ could be lexical
428 * (at least from subs) even in non-threaded perl.
430 if (strEQ(name, "@_"))
431 return 0; /* success. (NOT_IN_PAD indicates failure) */
432 #endif /* USE_THREADS */
434 /* The one we're looking for is probably just before comppad_name_fill. */
435 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
436 if ((sv = svp[off]) &&
437 sv != &PL_sv_undef &&
440 seq > I_32(SvNVX(sv)))) &&
441 strEQ(SvPVX(sv), name))
443 if (SvIVX(sv) || SvFLAGS(sv) & SVpad_OUR)
444 return (PADOFFSET)off;
445 pendoff = off; /* this pending def. will override import */
449 outside = CvOUTSIDE(PL_compcv);
451 /* Check if if we're compiling an eval'', and adjust seq to be the
452 * eval's seq number. This depends on eval'' having a non-null
453 * CvOUTSIDE() while it is being compiled. The eval'' itself is
454 * identified by CvEVAL being true and CvGV being null. */
455 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
456 cx = &cxstack[cxstack_ix];
458 seq = cx->blk_oldcop->cop_seq;
461 /* See if it's in a nested scope */
462 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
464 /* If there is a pending local definition, this new alias must die */
466 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
467 return off; /* pad_findlex returns 0 for failure...*/
469 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
473 Perl_pad_leavemy(pTHX_ I32 fill)
477 SV **svp = AvARRAY(PL_comppad_name);
479 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
480 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
481 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
482 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
485 /* "Deintroduce" my variables that are leaving with this scope. */
486 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
487 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
488 SvIVX(sv) = PL_cop_seqmax;
493 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
499 if (AvARRAY(PL_comppad) != PL_curpad)
500 Perl_croak(aTHX_ "panic: pad_alloc");
501 if (PL_pad_reset_pending)
503 if (tmptype & SVs_PADMY) {
505 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
506 } while (SvPADBUSY(sv)); /* need a fresh one */
507 retval = AvFILLp(PL_comppad);
510 SV **names = AvARRAY(PL_comppad_name);
511 SSize_t names_fill = AvFILLp(PL_comppad_name);
514 * "foreach" index vars temporarily become aliases to non-"my"
515 * values. Thus we must skip, not just pad values that are
516 * marked as current pad values, but also those with names.
518 if (++PL_padix <= names_fill &&
519 (sv = names[PL_padix]) && sv != &PL_sv_undef)
521 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
522 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)) && !IS_PADGV(sv))
527 SvFLAGS(sv) |= tmptype;
528 PL_curpad = AvARRAY(PL_comppad);
530 DEBUG_X(PerlIO_printf(Perl_debug_log,
531 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
532 PTR2UV(thr), PTR2UV(PL_curpad),
533 (long) retval, PL_op_name[optype]));
535 DEBUG_X(PerlIO_printf(Perl_debug_log,
536 "Pad 0x%"UVxf" alloc %ld for %s\n",
538 (long) retval, PL_op_name[optype]));
539 #endif /* USE_THREADS */
540 return (PADOFFSET)retval;
544 Perl_pad_sv(pTHX_ PADOFFSET po)
548 DEBUG_X(PerlIO_printf(Perl_debug_log,
549 "0x%"UVxf" Pad 0x%"UVxf" sv %"IVdf"\n",
550 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
553 Perl_croak(aTHX_ "panic: pad_sv po");
554 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %"IVdf"\n",
555 PTR2UV(PL_curpad), (IV)po));
556 #endif /* USE_THREADS */
557 return PL_curpad[po]; /* eventually we'll turn this into a macro */
561 Perl_pad_free(pTHX_ PADOFFSET po)
566 if (AvARRAY(PL_comppad) != PL_curpad)
567 Perl_croak(aTHX_ "panic: pad_free curpad");
569 Perl_croak(aTHX_ "panic: pad_free po");
571 DEBUG_X(PerlIO_printf(Perl_debug_log,
572 "0x%"UVxf" Pad 0x%"UVxf" free %"IVdf"\n",
573 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
575 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %"IVdf"\n",
576 PTR2UV(PL_curpad), (IV)po));
577 #endif /* USE_THREADS */
578 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
579 SvPADTMP_off(PL_curpad[po]);
581 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
584 if ((I32)po < PL_padix)
589 Perl_pad_swipe(pTHX_ PADOFFSET po)
592 if (AvARRAY(PL_comppad) != PL_curpad)
593 Perl_croak(aTHX_ "panic: pad_swipe curpad");
595 Perl_croak(aTHX_ "panic: pad_swipe po");
597 DEBUG_X(PerlIO_printf(Perl_debug_log,
598 "0x%"UVxf" Pad 0x%"UVxf" swipe %"IVdf"\n",
599 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
601 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %"IVdf"\n",
602 PTR2UV(PL_curpad), (IV)po));
603 #endif /* USE_THREADS */
604 SvPADTMP_off(PL_curpad[po]);
605 PL_curpad[po] = NEWSV(1107,0);
606 SvPADTMP_on(PL_curpad[po]);
607 if ((I32)po < PL_padix)
611 /* XXX pad_reset() is currently disabled because it results in serious bugs.
612 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
613 * on the stack by OPs that use them, there are several ways to get an alias
614 * to a shared TARG. Such an alias will change randomly and unpredictably.
615 * We avoid doing this until we can think of a Better Way.
620 #ifdef USE_BROKEN_PAD_RESET
624 if (AvARRAY(PL_comppad) != PL_curpad)
625 Perl_croak(aTHX_ "panic: pad_reset curpad");
627 DEBUG_X(PerlIO_printf(Perl_debug_log,
628 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
629 PTR2UV(thr), PTR2UV(PL_curpad)));
631 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
633 #endif /* USE_THREADS */
634 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
635 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
636 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
637 SvPADTMP_off(PL_curpad[po]);
639 PL_padix = PL_padix_floor;
642 PL_pad_reset_pending = FALSE;
646 /* find_threadsv is not reentrant */
648 Perl_find_threadsv(pTHX_ const char *name)
654 /* We currently only handle names of a single character */
655 p = strchr(PL_threadsv_names, *name);
658 key = p - PL_threadsv_names;
659 MUTEX_LOCK(&thr->mutex);
660 svp = av_fetch(thr->threadsv, key, FALSE);
662 MUTEX_UNLOCK(&thr->mutex);
664 SV *sv = NEWSV(0, 0);
665 av_store(thr->threadsv, key, sv);
666 thr->threadsvp = AvARRAY(thr->threadsv);
667 MUTEX_UNLOCK(&thr->mutex);
669 * Some magic variables used to be automagically initialised
670 * in gv_fetchpv. Those which are now per-thread magicals get
671 * initialised here instead.
677 sv_setpv(sv, "\034");
678 sv_magic(sv, 0, 0, name, 1);
683 PL_sawampersand = TRUE;
697 /* XXX %! tied to Errno.pm needs to be added here.
698 * See gv_fetchpv(). */
702 sv_magic(sv, 0, 0, name, 1);
704 DEBUG_S(PerlIO_printf(Perl_error_log,
705 "find_threadsv: new SV %p for $%s%c\n",
706 sv, (*name < 32) ? "^" : "",
707 (*name < 32) ? toCTRL(*name) : *name));
711 #endif /* USE_THREADS */
716 Perl_op_free(pTHX_ OP *o)
718 register OP *kid, *nextkid;
721 if (!o || o->op_seq == (U16)-1)
724 if (o->op_private & OPpREFCOUNTED) {
725 switch (o->op_type) {
733 if (OpREFCNT_dec(o)) {
744 if (o->op_flags & OPf_KIDS) {
745 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
746 nextkid = kid->op_sibling; /* Get before next freeing kid */
754 /* COP* is not cleared by op_clear() so that we may track line
755 * numbers etc even after null() */
756 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
761 #ifdef PL_OP_SLAB_ALLOC
762 if ((char *) o == PL_OpPtr)
771 S_op_clear(pTHX_ OP *o)
773 switch (o->op_type) {
774 case OP_NULL: /* Was holding old type, if any. */
775 case OP_ENTEREVAL: /* Was holding hints. */
777 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
783 if (!(o->op_flags & OPf_SPECIAL))
786 #endif /* USE_THREADS */
788 if (!(o->op_flags & OPf_REF)
789 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
796 if (cPADOPo->op_padix > 0) {
799 pad_swipe(cPADOPo->op_padix);
800 /* No GvIN_PAD_off(gv) here, because other references may still
801 * exist on the pad */
804 cPADOPo->op_padix = 0;
807 SvREFCNT_dec(cSVOPo->op_sv);
808 cSVOPo->op_sv = Nullsv;
812 SvREFCNT_dec(cSVOPo->op_sv);
813 cSVOPo->op_sv = Nullsv;
819 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
823 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
824 SvREFCNT_dec(cSVOPo->op_sv);
825 cSVOPo->op_sv = Nullsv;
828 Safefree(cPVOPo->op_pv);
829 cPVOPo->op_pv = Nullch;
833 op_free(cPMOPo->op_pmreplroot);
837 if ((PADOFFSET)cPMOPo->op_pmreplroot) {
839 GV *gv = (GV*)PL_curpad[(PADOFFSET)cPMOPo->op_pmreplroot];
840 pad_swipe((PADOFFSET)cPMOPo->op_pmreplroot);
841 /* No GvIN_PAD_off(gv) here, because other references may still
842 * exist on the pad */
847 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
853 cPMOPo->op_pmreplroot = Nullop;
854 ReREFCNT_dec(cPMOPo->op_pmregexp);
855 cPMOPo->op_pmregexp = (REGEXP*)NULL;
859 if (o->op_targ > 0) {
860 pad_free(o->op_targ);
866 S_cop_free(pTHX_ COP* cop)
868 Safefree(cop->cop_label);
870 Safefree(CopFILE(cop)); /* XXX share in a pvtable? */
871 Safefree(CopSTASHPV(cop)); /* XXX share in a pvtable? */
873 /* NOTE: COP.cop_stash is not refcounted */
874 SvREFCNT_dec(CopFILEGV(cop));
876 if (! specialWARN(cop->cop_warnings))
877 SvREFCNT_dec(cop->cop_warnings);
883 if (o->op_type == OP_NULL)
886 o->op_targ = o->op_type;
887 o->op_type = OP_NULL;
888 o->op_ppaddr = PL_ppaddr[OP_NULL];
891 /* Contextualizers */
893 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
896 Perl_linklist(pTHX_ OP *o)
903 /* establish postfix order */
904 if (cUNOPo->op_first) {
905 o->op_next = LINKLIST(cUNOPo->op_first);
906 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
908 kid->op_next = LINKLIST(kid->op_sibling);
920 Perl_scalarkids(pTHX_ OP *o)
923 if (o && o->op_flags & OPf_KIDS) {
924 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
931 S_scalarboolean(pTHX_ OP *o)
933 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
935 if (ckWARN(WARN_SYNTAX)) {
936 line_t oldline = CopLINE(PL_curcop);
938 if (PL_copline != NOLINE)
939 CopLINE_set(PL_curcop, PL_copline);
940 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
941 CopLINE_set(PL_curcop, oldline);
948 Perl_scalar(pTHX_ OP *o)
952 /* assumes no premature commitment */
953 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
954 || o->op_type == OP_RETURN)
959 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
961 switch (o->op_type) {
963 if (o->op_private & OPpREPEAT_DOLIST)
964 null(((LISTOP*)cBINOPo->op_first)->op_first);
965 scalar(cBINOPo->op_first);
970 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
974 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
975 if (!kPMOP->op_pmreplroot)
976 deprecate("implicit split to @_");
984 if (o->op_flags & OPf_KIDS) {
985 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
991 kid = cLISTOPo->op_first;
993 while ((kid = kid->op_sibling)) {
999 WITH_THR(PL_curcop = &PL_compiling);
1004 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1005 if (kid->op_sibling)
1010 WITH_THR(PL_curcop = &PL_compiling);
1017 Perl_scalarvoid(pTHX_ OP *o)
1024 if (o->op_type == OP_NEXTSTATE
1025 || o->op_type == OP_SETSTATE
1026 || o->op_type == OP_DBSTATE
1027 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1028 || o->op_targ == OP_SETSTATE
1029 || o->op_targ == OP_DBSTATE)))
1032 PL_curcop = (COP*)o; /* for warning below */
1035 /* assumes no premature commitment */
1036 want = o->op_flags & OPf_WANT;
1037 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
1038 || o->op_type == OP_RETURN)
1043 if ((o->op_private & OPpTARGET_MY)
1044 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1046 return scalar(o); /* As if inside SASSIGN */
1049 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1051 switch (o->op_type) {
1053 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1057 if (o->op_flags & OPf_STACKED)
1061 if (o->op_private == 4)
1103 case OP_GETSOCKNAME:
1104 case OP_GETPEERNAME:
1109 case OP_GETPRIORITY:
1132 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1133 useless = PL_op_desc[o->op_type];
1140 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1141 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1142 useless = "a variable";
1147 if (cSVOPo->op_private & OPpCONST_STRICT)
1148 no_bareword_allowed(o);
1151 if (ckWARN(WARN_VOID)) {
1152 useless = "a constant";
1153 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1155 else if (SvPOK(sv)) {
1156 if (strnEQ(SvPVX(sv), "di", 2) ||
1157 strnEQ(SvPVX(sv), "ds", 2) ||
1158 strnEQ(SvPVX(sv), "ig", 2))
1163 null(o); /* don't execute or even remember it */
1167 o->op_type = OP_PREINC; /* pre-increment is faster */
1168 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1172 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1173 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1179 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1184 if (o->op_flags & OPf_STACKED)
1191 if (!(o->op_flags & OPf_KIDS))
1200 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1207 /* all requires must return a boolean value */
1208 o->op_flags &= ~OPf_WANT;
1213 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1214 if (!kPMOP->op_pmreplroot)
1215 deprecate("implicit split to @_");
1221 if (ckWARN(WARN_VOID))
1222 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1228 Perl_listkids(pTHX_ OP *o)
1231 if (o && o->op_flags & OPf_KIDS) {
1232 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1239 Perl_list(pTHX_ OP *o)
1243 /* assumes no premature commitment */
1244 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1245 || o->op_type == OP_RETURN)
1250 if ((o->op_private & OPpTARGET_MY)
1251 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1253 return o; /* As if inside SASSIGN */
1256 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1258 switch (o->op_type) {
1261 list(cBINOPo->op_first);
1266 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1274 if (!(o->op_flags & OPf_KIDS))
1276 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1277 list(cBINOPo->op_first);
1278 return gen_constant_list(o);
1285 kid = cLISTOPo->op_first;
1287 while ((kid = kid->op_sibling)) {
1288 if (kid->op_sibling)
1293 WITH_THR(PL_curcop = &PL_compiling);
1297 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1298 if (kid->op_sibling)
1303 WITH_THR(PL_curcop = &PL_compiling);
1306 /* all requires must return a boolean value */
1307 o->op_flags &= ~OPf_WANT;
1314 Perl_scalarseq(pTHX_ OP *o)
1319 if (o->op_type == OP_LINESEQ ||
1320 o->op_type == OP_SCOPE ||
1321 o->op_type == OP_LEAVE ||
1322 o->op_type == OP_LEAVETRY)
1325 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1326 if (kid->op_sibling) {
1330 PL_curcop = &PL_compiling;
1332 o->op_flags &= ~OPf_PARENS;
1333 if (PL_hints & HINT_BLOCK_SCOPE)
1334 o->op_flags |= OPf_PARENS;
1337 o = newOP(OP_STUB, 0);
1342 S_modkids(pTHX_ OP *o, I32 type)
1345 if (o && o->op_flags & OPf_KIDS) {
1346 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1353 Perl_mod(pTHX_ OP *o, I32 type)
1359 if (!o || PL_error_count)
1362 if ((o->op_private & OPpTARGET_MY)
1363 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1368 switch (o->op_type) {
1373 if (!(o->op_private & (OPpCONST_ARYBASE)))
1375 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1376 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1380 SAVEI32(PL_compiling.cop_arybase);
1381 PL_compiling.cop_arybase = 0;
1383 else if (type == OP_REFGEN)
1386 Perl_croak(aTHX_ "That use of $[ is unsupported");
1389 if (o->op_flags & OPf_PARENS)
1393 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1394 !(o->op_flags & OPf_STACKED)) {
1395 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1396 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1397 assert(cUNOPo->op_first->op_type == OP_NULL);
1398 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1401 else { /* lvalue subroutine call */
1402 o->op_private |= OPpLVAL_INTRO;
1403 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1404 /* Backward compatibility mode: */
1405 o->op_private |= OPpENTERSUB_INARGS;
1408 else { /* Compile-time error message: */
1409 OP *kid = cUNOPo->op_first;
1413 if (kid->op_type == OP_PUSHMARK)
1415 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1417 "panic: unexpected lvalue entersub "
1418 "args: type/targ %ld:%ld",
1419 (long)kid->op_type,kid->op_targ);
1420 kid = kLISTOP->op_first;
1422 while (kid->op_sibling)
1423 kid = kid->op_sibling;
1424 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1426 if (kid->op_type == OP_METHOD_NAMED
1427 || kid->op_type == OP_METHOD)
1431 if (kid->op_sibling || kid->op_next != kid) {
1432 yyerror("panic: unexpected optree near method call");
1436 NewOp(1101, newop, 1, UNOP);
1437 newop->op_type = OP_RV2CV;
1438 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1439 newop->op_first = Nullop;
1440 newop->op_next = (OP*)newop;
1441 kid->op_sibling = (OP*)newop;
1442 newop->op_private |= OPpLVAL_INTRO;
1446 if (kid->op_type != OP_RV2CV)
1448 "panic: unexpected lvalue entersub "
1449 "entry via type/targ %ld:%ld",
1450 (long)kid->op_type,kid->op_targ);
1451 kid->op_private |= OPpLVAL_INTRO;
1452 break; /* Postpone until runtime */
1456 kid = kUNOP->op_first;
1457 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1458 kid = kUNOP->op_first;
1459 if (kid->op_type == OP_NULL)
1461 "Unexpected constant lvalue entersub "
1462 "entry via type/targ %ld:%ld",
1463 (long)kid->op_type,kid->op_targ);
1464 if (kid->op_type != OP_GV) {
1465 /* Restore RV2CV to check lvalueness */
1467 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1468 okid->op_next = kid->op_next;
1469 kid->op_next = okid;
1472 okid->op_next = Nullop;
1473 okid->op_type = OP_RV2CV;
1475 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1476 okid->op_private |= OPpLVAL_INTRO;
1480 cv = GvCV(kGVOP_gv);
1490 /* grep, foreach, subcalls, refgen */
1491 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1493 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1494 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1496 : (o->op_type == OP_ENTERSUB
1497 ? "non-lvalue subroutine call"
1498 : PL_op_desc[o->op_type])),
1499 type ? PL_op_desc[type] : "local"));
1513 case OP_RIGHT_SHIFT:
1522 if (!(o->op_flags & OPf_STACKED))
1528 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1534 if (!type && cUNOPo->op_first->op_type != OP_GV)
1535 Perl_croak(aTHX_ "Can't localize through a reference");
1536 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1537 PL_modcount = 10000;
1538 return o; /* Treat \(@foo) like ordinary list. */
1542 if (scalar_mod_type(o, type))
1544 ref(cUNOPo->op_first, o->op_type);
1553 PL_modcount = 10000;
1556 if (!type && cUNOPo->op_first->op_type != OP_GV)
1557 Perl_croak(aTHX_ "Can't localize through a reference");
1558 ref(cUNOPo->op_first, o->op_type);
1562 PL_hints |= HINT_BLOCK_SCOPE;
1572 PL_modcount = 10000;
1573 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1574 return o; /* Treat \(@foo) like ordinary list. */
1575 if (scalar_mod_type(o, type))
1581 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1582 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1587 PL_modcount++; /* XXX ??? */
1589 #endif /* USE_THREADS */
1595 if (type != OP_SASSIGN)
1599 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1605 pad_free(o->op_targ);
1606 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1607 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1608 if (o->op_flags & OPf_KIDS)
1609 mod(cBINOPo->op_first->op_sibling, type);
1614 ref(cBINOPo->op_first, o->op_type);
1615 if (type == OP_ENTERSUB &&
1616 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1617 o->op_private |= OPpLVAL_DEFER;
1624 if (o->op_flags & OPf_KIDS)
1625 mod(cLISTOPo->op_last, type);
1629 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1631 else if (!(o->op_flags & OPf_KIDS))
1633 if (o->op_targ != OP_LIST) {
1634 mod(cBINOPo->op_first, type);
1639 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1643 o->op_flags |= OPf_MOD;
1645 if (type == OP_AASSIGN || type == OP_SASSIGN)
1646 o->op_flags |= OPf_SPECIAL|OPf_REF;
1648 o->op_private |= OPpLVAL_INTRO;
1649 o->op_flags &= ~OPf_SPECIAL;
1650 PL_hints |= HINT_BLOCK_SCOPE;
1652 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1653 o->op_flags |= OPf_REF;
1658 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1662 if (o->op_type == OP_RV2GV)
1686 case OP_RIGHT_SHIFT:
1705 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1707 switch (o->op_type) {
1715 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1728 Perl_refkids(pTHX_ OP *o, I32 type)
1731 if (o && o->op_flags & OPf_KIDS) {
1732 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1739 Perl_ref(pTHX_ OP *o, I32 type)
1743 if (!o || PL_error_count)
1746 switch (o->op_type) {
1748 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1749 !(o->op_flags & OPf_STACKED)) {
1750 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1751 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1752 assert(cUNOPo->op_first->op_type == OP_NULL);
1753 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1754 o->op_flags |= OPf_SPECIAL;
1759 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1763 if (type == OP_DEFINED)
1764 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1765 ref(cUNOPo->op_first, o->op_type);
1768 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1769 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1770 : type == OP_RV2HV ? OPpDEREF_HV
1772 o->op_flags |= OPf_MOD;
1777 o->op_flags |= OPf_MOD; /* XXX ??? */
1782 o->op_flags |= OPf_REF;
1785 if (type == OP_DEFINED)
1786 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1787 ref(cUNOPo->op_first, o->op_type);
1792 o->op_flags |= OPf_REF;
1797 if (!(o->op_flags & OPf_KIDS))
1799 ref(cBINOPo->op_first, type);
1803 ref(cBINOPo->op_first, o->op_type);
1804 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1805 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1806 : type == OP_RV2HV ? OPpDEREF_HV
1808 o->op_flags |= OPf_MOD;
1816 if (!(o->op_flags & OPf_KIDS))
1818 ref(cLISTOPo->op_last, type);
1828 S_dup_attrlist(pTHX_ OP *o)
1832 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1833 * where the first kid is OP_PUSHMARK and the remaining ones
1834 * are OP_CONST. We need to push the OP_CONST values.
1836 if (o->op_type == OP_CONST)
1837 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1839 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1840 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1841 if (o->op_type == OP_CONST)
1842 rop = append_elem(OP_LIST, rop,
1843 newSVOP(OP_CONST, o->op_flags,
1844 SvREFCNT_inc(cSVOPo->op_sv)));
1851 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1855 /* fake up C<use attributes $pkg,$rv,@attrs> */
1856 ENTER; /* need to protect against side-effects of 'use' */
1858 if (stash && HvNAME(stash))
1859 stashsv = newSVpv(HvNAME(stash), 0);
1861 stashsv = &PL_sv_no;
1863 #define ATTRSMODULE "attributes"
1865 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1866 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1868 prepend_elem(OP_LIST,
1869 newSVOP(OP_CONST, 0, stashsv),
1870 prepend_elem(OP_LIST,
1871 newSVOP(OP_CONST, 0,
1873 dup_attrlist(attrs))));
1878 Perl_apply_attrs_string(pTHX_ char *stashpv, CV *cv,
1879 char *attrstr, STRLEN len)
1884 len = strlen(attrstr);
1888 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
1890 char *sstr = attrstr;
1891 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
1892 attrs = append_elem(OP_LIST, attrs,
1893 newSVOP(OP_CONST, 0,
1894 newSVpvn(sstr, attrstr-sstr)));
1898 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1899 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1900 Nullsv, prepend_elem(OP_LIST,
1901 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
1902 prepend_elem(OP_LIST,
1903 newSVOP(OP_CONST, 0,
1909 S_my_kid(pTHX_ OP *o, OP *attrs)
1914 if (!o || PL_error_count)
1918 if (type == OP_LIST) {
1919 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1921 } else if (type == OP_UNDEF) {
1923 } else if (type == OP_RV2SV || /* "our" declaration */
1925 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1926 o->op_private |= OPpOUR_INTRO;
1928 } else if (type != OP_PADSV &&
1931 type != OP_PUSHMARK)
1933 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1934 PL_op_desc[o->op_type],
1935 PL_in_my == KEY_our ? "our" : "my"));
1938 else if (attrs && type != OP_PUSHMARK) {
1944 PL_in_my_stash = Nullhv;
1946 /* check for C<my Dog $spot> when deciding package */
1947 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1948 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1949 stash = SvSTASH(*namesvp);
1951 stash = PL_curstash;
1952 padsv = PAD_SV(o->op_targ);
1953 apply_attrs(stash, padsv, attrs);
1955 o->op_flags |= OPf_MOD;
1956 o->op_private |= OPpLVAL_INTRO;
1961 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1963 if (o->op_flags & OPf_PARENS)
1967 o = my_kid(o, attrs);
1969 PL_in_my_stash = Nullhv;
1974 Perl_my(pTHX_ OP *o)
1976 return my_kid(o, Nullop);
1980 Perl_sawparens(pTHX_ OP *o)
1983 o->op_flags |= OPf_PARENS;
1988 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1993 if (ckWARN(WARN_MISC) &&
1994 (left->op_type == OP_RV2AV ||
1995 left->op_type == OP_RV2HV ||
1996 left->op_type == OP_PADAV ||
1997 left->op_type == OP_PADHV)) {
1998 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1999 right->op_type == OP_TRANS)
2000 ? right->op_type : OP_MATCH];
2001 const char *sample = ((left->op_type == OP_RV2AV ||
2002 left->op_type == OP_PADAV)
2003 ? "@array" : "%hash");
2004 Perl_warner(aTHX_ WARN_MISC,
2005 "Applying %s to %s will act on scalar(%s)",
2006 desc, sample, sample);
2009 if (!(right->op_flags & OPf_STACKED) &&
2010 (right->op_type == OP_MATCH ||
2011 right->op_type == OP_SUBST ||
2012 right->op_type == OP_TRANS)) {
2013 right->op_flags |= OPf_STACKED;
2014 if (right->op_type != OP_MATCH &&
2015 ! (right->op_type == OP_TRANS &&
2016 right->op_private & OPpTRANS_IDENTICAL))
2017 left = mod(left, right->op_type);
2018 if (right->op_type == OP_TRANS)
2019 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
2021 o = prepend_elem(right->op_type, scalar(left), right);
2023 return newUNOP(OP_NOT, 0, scalar(o));
2027 return bind_match(type, left,
2028 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
2032 Perl_invert(pTHX_ OP *o)
2036 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
2037 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2041 Perl_scope(pTHX_ OP *o)
2044 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2045 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2046 o->op_type = OP_LEAVE;
2047 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2050 if (o->op_type == OP_LINESEQ) {
2052 o->op_type = OP_SCOPE;
2053 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2054 kid = ((LISTOP*)o)->op_first;
2055 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2059 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
2066 Perl_save_hints(pTHX)
2069 SAVESPTR(GvHV(PL_hintgv));
2070 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
2071 SAVEFREESV(GvHV(PL_hintgv));
2075 Perl_block_start(pTHX_ int full)
2078 int retval = PL_savestack_ix;
2080 SAVEI32(PL_comppad_name_floor);
2081 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
2083 PL_comppad_name_fill = PL_comppad_name_floor;
2084 if (PL_comppad_name_floor < 0)
2085 PL_comppad_name_floor = 0;
2086 SAVEI32(PL_min_intro_pending);
2087 SAVEI32(PL_max_intro_pending);
2088 PL_min_intro_pending = 0;
2089 SAVEI32(PL_comppad_name_fill);
2090 SAVEI32(PL_padix_floor);
2091 PL_padix_floor = PL_padix;
2092 PL_pad_reset_pending = FALSE;
2094 PL_hints &= ~HINT_BLOCK_SCOPE;
2095 SAVESPTR(PL_compiling.cop_warnings);
2096 if (! specialWARN(PL_compiling.cop_warnings)) {
2097 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2098 SAVEFREESV(PL_compiling.cop_warnings) ;
2104 Perl_block_end(pTHX_ I32 floor, OP *seq)
2107 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2108 OP* retval = scalarseq(seq);
2110 PL_pad_reset_pending = FALSE;
2111 PL_compiling.op_private = PL_hints;
2113 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2114 pad_leavemy(PL_comppad_name_fill);
2123 OP *o = newOP(OP_THREADSV, 0);
2124 o->op_targ = find_threadsv("_");
2127 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2128 #endif /* USE_THREADS */
2132 Perl_newPROG(pTHX_ OP *o)
2138 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2139 ((PL_in_eval & EVAL_KEEPERR)
2140 ? OPf_SPECIAL : 0), o);
2141 PL_eval_start = linklist(PL_eval_root);
2142 PL_eval_root->op_private |= OPpREFCOUNTED;
2143 OpREFCNT_set(PL_eval_root, 1);
2144 PL_eval_root->op_next = 0;
2145 peep(PL_eval_start);
2150 PL_main_root = scope(sawparens(scalarvoid(o)));
2151 PL_curcop = &PL_compiling;
2152 PL_main_start = LINKLIST(PL_main_root);
2153 PL_main_root->op_private |= OPpREFCOUNTED;
2154 OpREFCNT_set(PL_main_root, 1);
2155 PL_main_root->op_next = 0;
2156 peep(PL_main_start);
2159 /* Register with debugger */
2161 CV *cv = get_cv("DB::postponed", FALSE);
2165 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2167 call_sv((SV*)cv, G_DISCARD);
2174 Perl_localize(pTHX_ OP *o, I32 lex)
2176 if (o->op_flags & OPf_PARENS)
2180 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2182 for (s = PL_bufptr; *s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s) || strchr("@$%, ",*s)); s++) ;
2183 if (*s == ';' || *s == '=')
2184 Perl_warner(aTHX_ WARN_PARENTHESIS,
2185 "Parentheses missing around \"%s\" list",
2186 lex ? (PL_in_my == KEY_our ? "our" : "my") : "local");
2192 o = mod(o, OP_NULL); /* a bit kludgey */
2194 PL_in_my_stash = Nullhv;
2199 Perl_jmaybe(pTHX_ OP *o)
2201 if (o->op_type == OP_LIST) {
2204 o2 = newOP(OP_THREADSV, 0);
2205 o2->op_targ = find_threadsv(";");
2207 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2208 #endif /* USE_THREADS */
2209 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2215 Perl_fold_constants(pTHX_ register OP *o)
2219 I32 type = o->op_type;
2222 if (PL_opargs[type] & OA_RETSCALAR)
2224 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2225 o->op_targ = pad_alloc(type, SVs_PADTMP);
2227 /* integerize op, unless it happens to be C<-foo>.
2228 * XXX should pp_i_negate() do magic string negation instead? */
2229 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2230 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2231 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2233 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2236 if (!(PL_opargs[type] & OA_FOLDCONST))
2241 /* XXX might want a ck_negate() for this */
2242 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2255 if (o->op_private & OPpLOCALE)
2260 goto nope; /* Don't try to run w/ errors */
2262 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2263 if ((curop->op_type != OP_CONST ||
2264 (curop->op_private & OPpCONST_BARE)) &&
2265 curop->op_type != OP_LIST &&
2266 curop->op_type != OP_SCALAR &&
2267 curop->op_type != OP_NULL &&
2268 curop->op_type != OP_PUSHMARK)
2274 curop = LINKLIST(o);
2278 sv = *(PL_stack_sp--);
2279 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2280 pad_swipe(o->op_targ);
2281 else if (SvTEMP(sv)) { /* grab mortal temp? */
2282 (void)SvREFCNT_inc(sv);
2286 if (type == OP_RV2GV)
2287 return newGVOP(OP_GV, 0, (GV*)sv);
2289 /* try to smush double to int, but don't smush -2.0 to -2 */
2290 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2294 if ((NV)iv == SvNV(sv)) {
2299 SvIOK_off(sv); /* undo SvIV() damage */
2301 return newSVOP(OP_CONST, 0, sv);
2305 if (!(PL_opargs[type] & OA_OTHERINT))
2308 if (!(PL_hints & HINT_INTEGER)) {
2309 if (type == OP_MODULO
2310 || type == OP_DIVIDE
2311 || !(o->op_flags & OPf_KIDS))
2316 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2317 if (curop->op_type == OP_CONST) {
2318 if (SvIOK(((SVOP*)curop)->op_sv))
2322 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2326 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2333 Perl_gen_constant_list(pTHX_ register OP *o)
2337 I32 oldtmps_floor = PL_tmps_floor;
2341 return o; /* Don't attempt to run with errors */
2343 PL_op = curop = LINKLIST(o);
2350 PL_tmps_floor = oldtmps_floor;
2352 o->op_type = OP_RV2AV;
2353 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2354 curop = ((UNOP*)o)->op_first;
2355 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2362 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2367 if (!o || o->op_type != OP_LIST)
2368 o = newLISTOP(OP_LIST, 0, o, Nullop);
2370 o->op_flags &= ~OPf_WANT;
2372 if (!(PL_opargs[type] & OA_MARK))
2373 null(cLISTOPo->op_first);
2376 o->op_ppaddr = PL_ppaddr[type];
2377 o->op_flags |= flags;
2379 o = CHECKOP(type, o);
2380 if (o->op_type != type)
2383 if (cLISTOPo->op_children < 7) {
2384 /* XXX do we really need to do this if we're done appending?? */
2385 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2387 cLISTOPo->op_last = last; /* in case check substituted last arg */
2390 return fold_constants(o);
2393 /* List constructors */
2396 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2404 if (first->op_type != type
2405 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2407 return newLISTOP(type, 0, first, last);
2410 if (first->op_flags & OPf_KIDS)
2411 ((LISTOP*)first)->op_last->op_sibling = last;
2413 first->op_flags |= OPf_KIDS;
2414 ((LISTOP*)first)->op_first = last;
2416 ((LISTOP*)first)->op_last = last;
2417 ((LISTOP*)first)->op_children++;
2422 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2430 if (first->op_type != type)
2431 return prepend_elem(type, (OP*)first, (OP*)last);
2433 if (last->op_type != type)
2434 return append_elem(type, (OP*)first, (OP*)last);
2436 first->op_last->op_sibling = last->op_first;
2437 first->op_last = last->op_last;
2438 first->op_children += last->op_children;
2439 if (first->op_children)
2440 first->op_flags |= OPf_KIDS;
2442 #ifdef PL_OP_SLAB_ALLOC
2450 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2458 if (last->op_type == type) {
2459 if (type == OP_LIST) { /* already a PUSHMARK there */
2460 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2461 ((LISTOP*)last)->op_first->op_sibling = first;
2464 if (!(last->op_flags & OPf_KIDS)) {
2465 ((LISTOP*)last)->op_last = first;
2466 last->op_flags |= OPf_KIDS;
2468 first->op_sibling = ((LISTOP*)last)->op_first;
2469 ((LISTOP*)last)->op_first = first;
2471 ((LISTOP*)last)->op_children++;
2475 return newLISTOP(type, 0, first, last);
2481 Perl_newNULLLIST(pTHX)
2483 return newOP(OP_STUB, 0);
2487 Perl_force_list(pTHX_ OP *o)
2489 if (!o || o->op_type != OP_LIST)
2490 o = newLISTOP(OP_LIST, 0, o, Nullop);
2496 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2500 NewOp(1101, listop, 1, LISTOP);
2502 listop->op_type = type;
2503 listop->op_ppaddr = PL_ppaddr[type];
2504 listop->op_children = (first != 0) + (last != 0);
2505 listop->op_flags = flags;
2509 else if (!first && last)
2512 first->op_sibling = last;
2513 listop->op_first = first;
2514 listop->op_last = last;
2515 if (type == OP_LIST) {
2517 pushop = newOP(OP_PUSHMARK, 0);
2518 pushop->op_sibling = first;
2519 listop->op_first = pushop;
2520 listop->op_flags |= OPf_KIDS;
2522 listop->op_last = pushop;
2524 else if (listop->op_children)
2525 listop->op_flags |= OPf_KIDS;
2531 Perl_newOP(pTHX_ I32 type, I32 flags)
2534 NewOp(1101, o, 1, OP);
2536 o->op_ppaddr = PL_ppaddr[type];
2537 o->op_flags = flags;
2540 o->op_private = 0 + (flags >> 8);
2541 if (PL_opargs[type] & OA_RETSCALAR)
2543 if (PL_opargs[type] & OA_TARGET)
2544 o->op_targ = pad_alloc(type, SVs_PADTMP);
2545 return CHECKOP(type, o);
2549 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2554 first = newOP(OP_STUB, 0);
2555 if (PL_opargs[type] & OA_MARK)
2556 first = force_list(first);
2558 NewOp(1101, unop, 1, UNOP);
2559 unop->op_type = type;
2560 unop->op_ppaddr = PL_ppaddr[type];
2561 unop->op_first = first;
2562 unop->op_flags = flags | OPf_KIDS;
2563 unop->op_private = 1 | (flags >> 8);
2564 unop = (UNOP*) CHECKOP(type, unop);
2568 return fold_constants((OP *) unop);
2572 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2575 NewOp(1101, binop, 1, BINOP);
2578 first = newOP(OP_NULL, 0);
2580 binop->op_type = type;
2581 binop->op_ppaddr = PL_ppaddr[type];
2582 binop->op_first = first;
2583 binop->op_flags = flags | OPf_KIDS;
2586 binop->op_private = 1 | (flags >> 8);
2589 binop->op_private = 2 | (flags >> 8);
2590 first->op_sibling = last;
2593 binop = (BINOP*)CHECKOP(type, binop);
2594 if (binop->op_next || binop->op_type != type)
2597 binop->op_last = binop->op_first->op_sibling;
2599 return fold_constants((OP *)binop);
2603 utf8compare(const void *a, const void *b)
2606 for (i = 0; i < 10; i++) {
2607 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2609 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2616 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2618 SV *tstr = ((SVOP*)expr)->op_sv;
2619 SV *rstr = ((SVOP*)repl)->op_sv;
2622 U8 *t = (U8*)SvPV(tstr, tlen);
2623 U8 *r = (U8*)SvPV(rstr, rlen);
2630 register short *tbl;
2632 complement = o->op_private & OPpTRANS_COMPLEMENT;
2633 del = o->op_private & OPpTRANS_DELETE;
2634 squash = o->op_private & OPpTRANS_SQUASH;
2637 o->op_private |= OPpTRANS_FROM_UTF;
2640 o->op_private |= OPpTRANS_TO_UTF;
2642 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2643 SV* listsv = newSVpvn("# comment\n",10);
2645 U8* tend = t + tlen;
2646 U8* rend = r + rlen;
2660 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2661 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2662 U8* tsave = from_utf ? NULL : trlist_upgrade(&t, &tend);
2663 U8* rsave = to_utf ? NULL : trlist_upgrade(&r, &rend);
2666 U8 tmpbuf[UTF8_MAXLEN+1];
2670 New(1109, cp, tlen, U8*);
2672 transv = newSVpvn("",0);
2681 qsort(cp, i, sizeof(U8*), utf8compare);
2682 for (j = 0; j < i; j++) {
2684 I32 cur = j < i ? cp[j+1] - s : tend - s;
2685 UV val = utf8_to_uv(s, cur, &ulen, 0);
2687 diff = val - nextmin;
2689 t = uv_to_utf8(tmpbuf,nextmin);
2690 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2692 t = uv_to_utf8(tmpbuf, val - 1);
2693 sv_catpvn(transv, "\377", 1);
2694 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2698 val = utf8_to_uv(s+1, cur - 1, &ulen, 0);
2702 t = uv_to_utf8(tmpbuf,nextmin);
2703 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2704 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2705 sv_catpvn(transv, "\377", 1);
2706 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2707 t = (U8*)SvPVX(transv);
2708 tlen = SvCUR(transv);
2711 else if (!rlen && !del) {
2712 r = t; rlen = tlen; rend = tend;
2716 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
2718 o->op_private |= OPpTRANS_IDENTICAL;
2722 while (t < tend || tfirst <= tlast) {
2723 /* see if we need more "t" chars */
2724 if (tfirst > tlast) {
2725 tfirst = (I32)utf8_to_uv(t, tend - t, &ulen, 0);
2727 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2729 tlast = (I32)utf8_to_uv(t, tend - t, &ulen, 0);
2736 /* now see if we need more "r" chars */
2737 if (rfirst > rlast) {
2739 rfirst = (I32)utf8_to_uv(r, rend - r, &ulen, 0);
2741 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2743 rlast = (I32)utf8_to_uv(r, rend - r, &ulen, 0);
2752 rfirst = rlast = 0xffffffff;
2756 /* now see which range will peter our first, if either. */
2757 tdiff = tlast - tfirst;
2758 rdiff = rlast - rfirst;
2765 if (rfirst == 0xffffffff) {
2766 diff = tdiff; /* oops, pretend rdiff is infinite */
2768 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2769 (long)tfirst, (long)tlast);
2771 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2775 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2776 (long)tfirst, (long)(tfirst + diff),
2779 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2780 (long)tfirst, (long)rfirst);
2782 if (rfirst + diff > max)
2783 max = rfirst + diff;
2786 grows = (UNISKIP(tfirst) < UNISKIP(rfirst));
2797 else if (max > 0xff)
2802 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2803 SvREFCNT_dec(listsv);
2805 SvREFCNT_dec(transv);
2807 if (!del && havefinal)
2808 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
2809 newSVuv((UV)final), 0);
2812 o->op_private |= OPpTRANS_GROWS;
2824 tbl = (short*)cPVOPo->op_pv;
2826 Zero(tbl, 256, short);
2827 for (i = 0; i < tlen; i++)
2829 for (i = 0, j = 0; i < 256; i++) {
2840 if (i < 128 && r[j] >= 128)
2848 if (!rlen && !del) {
2851 o->op_private |= OPpTRANS_IDENTICAL;
2853 for (i = 0; i < 256; i++)
2855 for (i = 0, j = 0; i < tlen; i++,j++) {
2858 if (tbl[t[i]] == -1)
2864 if (tbl[t[i]] == -1) {
2865 if (t[i] < 128 && r[j] >= 128)
2872 o->op_private |= OPpTRANS_GROWS;
2880 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2885 NewOp(1101, pmop, 1, PMOP);
2886 pmop->op_type = type;
2887 pmop->op_ppaddr = PL_ppaddr[type];
2888 pmop->op_flags = flags;
2889 pmop->op_private = 0 | (flags >> 8);
2891 if (PL_hints & HINT_RE_TAINT)
2892 pmop->op_pmpermflags |= PMf_RETAINT;
2893 if (PL_hints & HINT_LOCALE)
2894 pmop->op_pmpermflags |= PMf_LOCALE;
2895 pmop->op_pmflags = pmop->op_pmpermflags;
2897 /* link into pm list */
2898 if (type != OP_TRANS && PL_curstash) {
2899 pmop->op_pmnext = HvPMROOT(PL_curstash);
2900 HvPMROOT(PL_curstash) = pmop;
2907 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2912 I32 repl_has_vars = 0;
2914 if (o->op_type == OP_TRANS)
2915 return pmtrans(o, expr, repl);
2917 PL_hints |= HINT_BLOCK_SCOPE;
2920 if (expr->op_type == OP_CONST) {
2922 SV *pat = ((SVOP*)expr)->op_sv;
2923 char *p = SvPV(pat, plen);
2924 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2925 sv_setpvn(pat, "\\s+", 3);
2926 p = SvPV(pat, plen);
2927 pm->op_pmflags |= PMf_SKIPWHITE;
2929 if ((PL_hints & HINT_UTF8) || DO_UTF8(pat))
2930 pm->op_pmdynflags |= PMdf_UTF8;
2931 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2932 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2933 pm->op_pmflags |= PMf_WHITE;
2937 if (PL_hints & HINT_UTF8)
2938 pm->op_pmdynflags |= PMdf_UTF8;
2939 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2940 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2942 : OP_REGCMAYBE),0,expr);
2944 NewOp(1101, rcop, 1, LOGOP);
2945 rcop->op_type = OP_REGCOMP;
2946 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2947 rcop->op_first = scalar(expr);
2948 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2949 ? (OPf_SPECIAL | OPf_KIDS)
2951 rcop->op_private = 1;
2954 /* establish postfix order */
2955 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2957 rcop->op_next = expr;
2958 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2961 rcop->op_next = LINKLIST(expr);
2962 expr->op_next = (OP*)rcop;
2965 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2970 if (pm->op_pmflags & PMf_EVAL) {
2972 if (CopLINE(PL_curcop) < PL_multi_end)
2973 CopLINE_set(PL_curcop, PL_multi_end);
2976 else if (repl->op_type == OP_THREADSV
2977 && strchr("&`'123456789+",
2978 PL_threadsv_names[repl->op_targ]))
2982 #endif /* USE_THREADS */
2983 else if (repl->op_type == OP_CONST)
2987 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2988 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2990 if (curop->op_type == OP_THREADSV) {
2992 if (strchr("&`'123456789+", curop->op_private))
2996 if (curop->op_type == OP_GV) {
2997 GV *gv = cGVOPx_gv(curop);
2999 if (strchr("&`'123456789+", *GvENAME(gv)))
3002 #endif /* USE_THREADS */
3003 else if (curop->op_type == OP_RV2CV)
3005 else if (curop->op_type == OP_RV2SV ||
3006 curop->op_type == OP_RV2AV ||
3007 curop->op_type == OP_RV2HV ||
3008 curop->op_type == OP_RV2GV) {
3009 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
3012 else if (curop->op_type == OP_PADSV ||
3013 curop->op_type == OP_PADAV ||
3014 curop->op_type == OP_PADHV ||
3015 curop->op_type == OP_PADANY) {
3018 else if (curop->op_type == OP_PUSHRE)
3019 ; /* Okay here, dangerous in newASSIGNOP */
3028 && (!pm->op_pmregexp
3029 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
3030 pm->op_pmflags |= PMf_CONST; /* const for long enough */
3031 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
3032 prepend_elem(o->op_type, scalar(repl), o);
3035 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
3036 pm->op_pmflags |= PMf_MAYBE_CONST;
3037 pm->op_pmpermflags |= PMf_MAYBE_CONST;
3039 NewOp(1101, rcop, 1, LOGOP);
3040 rcop->op_type = OP_SUBSTCONT;
3041 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3042 rcop->op_first = scalar(repl);
3043 rcop->op_flags |= OPf_KIDS;
3044 rcop->op_private = 1;
3047 /* establish postfix order */
3048 rcop->op_next = LINKLIST(repl);
3049 repl->op_next = (OP*)rcop;
3051 pm->op_pmreplroot = scalar((OP*)rcop);
3052 pm->op_pmreplstart = LINKLIST(rcop);
3061 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3064 NewOp(1101, svop, 1, SVOP);
3065 svop->op_type = type;
3066 svop->op_ppaddr = PL_ppaddr[type];
3068 svop->op_next = (OP*)svop;
3069 svop->op_flags = flags;
3070 if (PL_opargs[type] & OA_RETSCALAR)
3072 if (PL_opargs[type] & OA_TARGET)
3073 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3074 return CHECKOP(type, svop);
3078 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3081 NewOp(1101, padop, 1, PADOP);
3082 padop->op_type = type;
3083 padop->op_ppaddr = PL_ppaddr[type];
3084 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3085 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3086 PL_curpad[padop->op_padix] = sv;
3088 padop->op_next = (OP*)padop;
3089 padop->op_flags = flags;
3090 if (PL_opargs[type] & OA_RETSCALAR)
3092 if (PL_opargs[type] & OA_TARGET)
3093 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3094 return CHECKOP(type, padop);
3098 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3103 return newPADOP(type, flags, SvREFCNT_inc(gv));
3105 return newSVOP(type, flags, SvREFCNT_inc(gv));
3110 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3113 NewOp(1101, pvop, 1, PVOP);
3114 pvop->op_type = type;
3115 pvop->op_ppaddr = PL_ppaddr[type];
3117 pvop->op_next = (OP*)pvop;
3118 pvop->op_flags = flags;
3119 if (PL_opargs[type] & OA_RETSCALAR)
3121 if (PL_opargs[type] & OA_TARGET)
3122 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3123 return CHECKOP(type, pvop);
3127 Perl_package(pTHX_ OP *o)
3132 save_hptr(&PL_curstash);
3133 save_item(PL_curstname);
3138 name = SvPV(sv, len);
3139 PL_curstash = gv_stashpvn(name,len,TRUE);
3140 sv_setpvn(PL_curstname, name, len);
3144 sv_setpv(PL_curstname,"<none>");
3145 PL_curstash = Nullhv;
3147 PL_hints |= HINT_BLOCK_SCOPE;
3148 PL_copline = NOLINE;
3153 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3161 if (id->op_type != OP_CONST)
3162 Perl_croak(aTHX_ "Module name must be constant");
3166 if (version != Nullop) {
3167 SV *vesv = ((SVOP*)version)->op_sv;
3169 if (arg == Nullop && !SvNIOKp(vesv)) {
3176 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3177 Perl_croak(aTHX_ "Version number must be constant number");
3179 /* Make copy of id so we don't free it twice */
3180 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3182 /* Fake up a method call to VERSION */
3183 meth = newSVpvn("VERSION",7);
3184 sv_upgrade(meth, SVt_PVIV);
3185 (void)SvIOK_on(meth);
3186 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3187 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3188 append_elem(OP_LIST,
3189 prepend_elem(OP_LIST, pack, list(version)),
3190 newSVOP(OP_METHOD_NAMED, 0, meth)));
3194 /* Fake up an import/unimport */
3195 if (arg && arg->op_type == OP_STUB)
3196 imop = arg; /* no import on explicit () */
3197 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3198 imop = Nullop; /* use 5.0; */
3203 /* Make copy of id so we don't free it twice */
3204 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3206 /* Fake up a method call to import/unimport */
3207 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);;
3208 sv_upgrade(meth, SVt_PVIV);
3209 (void)SvIOK_on(meth);
3210 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3211 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3212 append_elem(OP_LIST,
3213 prepend_elem(OP_LIST, pack, list(arg)),
3214 newSVOP(OP_METHOD_NAMED, 0, meth)));
3217 /* Fake up a require, handle override, if any */
3218 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3219 if (!(gv && GvIMPORTED_CV(gv)))
3220 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3222 if (gv && GvIMPORTED_CV(gv)) {
3223 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3224 append_elem(OP_LIST, id,
3225 scalar(newUNOP(OP_RV2CV, 0,
3230 rqop = newUNOP(OP_REQUIRE, 0, id);
3233 /* Fake up the BEGIN {}, which does its thing immediately. */
3235 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3238 append_elem(OP_LINESEQ,
3239 append_elem(OP_LINESEQ,
3240 newSTATEOP(0, Nullch, rqop),
3241 newSTATEOP(0, Nullch, veop)),
3242 newSTATEOP(0, Nullch, imop) ));
3244 PL_hints |= HINT_BLOCK_SCOPE;
3245 PL_copline = NOLINE;
3250 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3253 va_start(args, ver);
3254 vload_module(flags, name, ver, &args);
3258 #ifdef PERL_IMPLICIT_CONTEXT
3260 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3264 va_start(args, ver);
3265 vload_module(flags, name, ver, &args);
3271 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3273 OP *modname, *veop, *imop;
3275 modname = newSVOP(OP_CONST, 0, name);
3276 modname->op_private |= OPpCONST_BARE;
3278 veop = newSVOP(OP_CONST, 0, ver);
3282 if (flags & PERL_LOADMOD_NOIMPORT) {
3283 imop = sawparens(newNULLLIST());
3285 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3286 imop = va_arg(*args, OP*);
3291 sv = va_arg(*args, SV*);
3293 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3294 sv = va_arg(*args, SV*);
3298 line_t ocopline = PL_copline;
3299 int oexpect = PL_expect;
3301 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3302 veop, modname, imop);
3303 PL_expect = oexpect;
3304 PL_copline = ocopline;
3309 Perl_dofile(pTHX_ OP *term)
3314 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3315 if (!(gv && GvIMPORTED_CV(gv)))
3316 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3318 if (gv && GvIMPORTED_CV(gv)) {
3319 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3320 append_elem(OP_LIST, term,
3321 scalar(newUNOP(OP_RV2CV, 0,
3326 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3332 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3334 return newBINOP(OP_LSLICE, flags,
3335 list(force_list(subscript)),
3336 list(force_list(listval)) );
3340 S_list_assignment(pTHX_ register OP *o)
3345 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3346 o = cUNOPo->op_first;
3348 if (o->op_type == OP_COND_EXPR) {
3349 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3350 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3355 yyerror("Assignment to both a list and a scalar");
3359 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3360 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3361 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3364 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3367 if (o->op_type == OP_RV2SV)
3374 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3379 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3380 return newLOGOP(optype, 0,
3381 mod(scalar(left), optype),
3382 newUNOP(OP_SASSIGN, 0, scalar(right)));
3385 return newBINOP(optype, OPf_STACKED,
3386 mod(scalar(left), optype), scalar(right));
3390 if (list_assignment(left)) {
3395 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3396 left = mod(left, OP_AASSIGN);
3404 curop = list(force_list(left));
3405 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3406 o->op_private = 0 | (flags >> 8);
3407 for (curop = ((LISTOP*)curop)->op_first;
3408 curop; curop = curop->op_sibling)
3410 if (curop->op_type == OP_RV2HV &&
3411 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3412 o->op_private |= OPpASSIGN_HASH;
3416 if (!(left->op_private & OPpLVAL_INTRO)) {
3419 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3420 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3421 if (curop->op_type == OP_GV) {
3422 GV *gv = cGVOPx_gv(curop);
3423 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3425 SvCUR(gv) = PL_generation;
3427 else if (curop->op_type == OP_PADSV ||
3428 curop->op_type == OP_PADAV ||
3429 curop->op_type == OP_PADHV ||
3430 curop->op_type == OP_PADANY) {
3431 SV **svp = AvARRAY(PL_comppad_name);
3432 SV *sv = svp[curop->op_targ];
3433 if (SvCUR(sv) == PL_generation)
3435 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3437 else if (curop->op_type == OP_RV2CV)
3439 else if (curop->op_type == OP_RV2SV ||
3440 curop->op_type == OP_RV2AV ||
3441 curop->op_type == OP_RV2HV ||
3442 curop->op_type == OP_RV2GV) {
3443 if (lastop->op_type != OP_GV) /* funny deref? */
3446 else if (curop->op_type == OP_PUSHRE) {
3447 if (((PMOP*)curop)->op_pmreplroot) {
3449 GV *gv = (GV*)PL_curpad[(PADOFFSET)((PMOP*)curop)->op_pmreplroot];
3451 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3453 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3455 SvCUR(gv) = PL_generation;
3464 o->op_private |= OPpASSIGN_COMMON;
3466 if (right && right->op_type == OP_SPLIT) {
3468 if ((tmpop = ((LISTOP*)right)->op_first) &&
3469 tmpop->op_type == OP_PUSHRE)
3471 PMOP *pm = (PMOP*)tmpop;
3472 if (left->op_type == OP_RV2AV &&
3473 !(left->op_private & OPpLVAL_INTRO) &&
3474 !(o->op_private & OPpASSIGN_COMMON) )
3476 tmpop = ((UNOP*)left)->op_first;
3477 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3479 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3480 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3482 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3483 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3485 pm->op_pmflags |= PMf_ONCE;
3486 tmpop = cUNOPo->op_first; /* to list (nulled) */
3487 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3488 tmpop->op_sibling = Nullop; /* don't free split */
3489 right->op_next = tmpop->op_next; /* fix starting loc */
3490 op_free(o); /* blow off assign */
3491 right->op_flags &= ~OPf_WANT;
3492 /* "I don't know and I don't care." */
3497 if (PL_modcount < 10000 &&
3498 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3500 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3502 sv_setiv(sv, PL_modcount+1);
3510 right = newOP(OP_UNDEF, 0);
3511 if (right->op_type == OP_READLINE) {
3512 right->op_flags |= OPf_STACKED;
3513 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3516 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3517 o = newBINOP(OP_SASSIGN, flags,
3518 scalar(right), mod(scalar(left), OP_SASSIGN) );
3530 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3533 U32 seq = intro_my();
3536 NewOp(1101, cop, 1, COP);
3537 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3538 cop->op_type = OP_DBSTATE;
3539 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3542 cop->op_type = OP_NEXTSTATE;
3543 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3545 cop->op_flags = flags;
3546 cop->op_private = (PL_hints & HINT_BYTE);
3548 cop->op_private |= NATIVE_HINTS;
3550 PL_compiling.op_private = cop->op_private;
3551 cop->op_next = (OP*)cop;
3554 cop->cop_label = label;
3555 PL_hints |= HINT_BLOCK_SCOPE;
3558 cop->cop_arybase = PL_curcop->cop_arybase;
3559 if (specialWARN(PL_curcop->cop_warnings))
3560 cop->cop_warnings = PL_curcop->cop_warnings ;
3562 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3565 if (PL_copline == NOLINE)
3566 CopLINE_set(cop, CopLINE(PL_curcop));
3568 CopLINE_set(cop, PL_copline);
3569 PL_copline = NOLINE;
3572 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
3574 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
3576 CopSTASH_set(cop, PL_curstash);
3578 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3579 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3580 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3581 (void)SvIOK_on(*svp);
3582 SvIVX(*svp) = PTR2IV(cop);
3586 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3589 /* "Introduce" my variables to visible status. */
3597 if (! PL_min_intro_pending)
3598 return PL_cop_seqmax;
3600 svp = AvARRAY(PL_comppad_name);
3601 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3602 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3603 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3604 SvNVX(sv) = (NV)PL_cop_seqmax;
3607 PL_min_intro_pending = 0;
3608 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3609 return PL_cop_seqmax++;
3613 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3615 return new_logop(type, flags, &first, &other);
3619 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3624 OP *first = *firstp;
3625 OP *other = *otherp;
3627 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3628 return newBINOP(type, flags, scalar(first), scalar(other));
3630 scalarboolean(first);
3631 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3632 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3633 if (type == OP_AND || type == OP_OR) {
3639 first = *firstp = cUNOPo->op_first;
3641 first->op_next = o->op_next;
3642 cUNOPo->op_first = Nullop;
3646 if (first->op_type == OP_CONST) {
3647 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3648 Perl_warner(aTHX_ WARN_BAREWORD, "Bareword found in conditional");
3649 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3660 else if (first->op_type == OP_WANTARRAY) {
3666 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3667 OP *k1 = ((UNOP*)first)->op_first;
3668 OP *k2 = k1->op_sibling;
3670 switch (first->op_type)
3673 if (k2 && k2->op_type == OP_READLINE
3674 && (k2->op_flags & OPf_STACKED)
3675 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3677 warnop = k2->op_type;
3682 if (k1->op_type == OP_READDIR
3683 || k1->op_type == OP_GLOB
3684 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3685 || k1->op_type == OP_EACH)
3687 warnop = ((k1->op_type == OP_NULL)
3688 ? k1->op_targ : k1->op_type);
3693 line_t oldline = CopLINE(PL_curcop);
3694 CopLINE_set(PL_curcop, PL_copline);
3695 Perl_warner(aTHX_ WARN_MISC,
3696 "Value of %s%s can be \"0\"; test with defined()",
3698 ((warnop == OP_READLINE || warnop == OP_GLOB)
3699 ? " construct" : "() operator"));
3700 CopLINE_set(PL_curcop, oldline);
3707 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3708 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3710 NewOp(1101, logop, 1, LOGOP);
3712 logop->op_type = type;
3713 logop->op_ppaddr = PL_ppaddr[type];
3714 logop->op_first = first;
3715 logop->op_flags = flags | OPf_KIDS;
3716 logop->op_other = LINKLIST(other);
3717 logop->op_private = 1 | (flags >> 8);
3719 /* establish postfix order */
3720 logop->op_next = LINKLIST(first);
3721 first->op_next = (OP*)logop;
3722 first->op_sibling = other;
3724 o = newUNOP(OP_NULL, 0, (OP*)logop);
3731 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3739 return newLOGOP(OP_AND, 0, first, trueop);
3741 return newLOGOP(OP_OR, 0, first, falseop);
3743 scalarboolean(first);
3744 if (first->op_type == OP_CONST) {
3745 if (SvTRUE(((SVOP*)first)->op_sv)) {
3756 else if (first->op_type == OP_WANTARRAY) {
3760 NewOp(1101, logop, 1, LOGOP);
3761 logop->op_type = OP_COND_EXPR;
3762 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3763 logop->op_first = first;
3764 logop->op_flags = flags | OPf_KIDS;
3765 logop->op_private = 1 | (flags >> 8);
3766 logop->op_other = LINKLIST(trueop);
3767 logop->op_next = LINKLIST(falseop);
3770 /* establish postfix order */
3771 start = LINKLIST(first);
3772 first->op_next = (OP*)logop;
3774 first->op_sibling = trueop;
3775 trueop->op_sibling = falseop;
3776 o = newUNOP(OP_NULL, 0, (OP*)logop);
3778 trueop->op_next = falseop->op_next = o;
3785 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3794 NewOp(1101, range, 1, LOGOP);
3796 range->op_type = OP_RANGE;
3797 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3798 range->op_first = left;
3799 range->op_flags = OPf_KIDS;
3800 leftstart = LINKLIST(left);
3801 range->op_other = LINKLIST(right);
3802 range->op_private = 1 | (flags >> 8);
3804 left->op_sibling = right;
3806 range->op_next = (OP*)range;
3807 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3808 flop = newUNOP(OP_FLOP, 0, flip);
3809 o = newUNOP(OP_NULL, 0, flop);
3811 range->op_next = leftstart;
3813 left->op_next = flip;
3814 right->op_next = flop;
3816 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3817 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3818 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3819 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3821 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3822 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3825 if (!flip->op_private || !flop->op_private)
3826 linklist(o); /* blow off optimizer unless constant */
3832 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3837 int once = block && block->op_flags & OPf_SPECIAL &&
3838 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3841 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3842 return block; /* do {} while 0 does once */
3843 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3844 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3845 expr = newUNOP(OP_DEFINED, 0,
3846 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3847 } else if (expr->op_flags & OPf_KIDS) {
3848 OP *k1 = ((UNOP*)expr)->op_first;
3849 OP *k2 = (k1) ? k1->op_sibling : NULL;
3850 switch (expr->op_type) {
3852 if (k2 && k2->op_type == OP_READLINE
3853 && (k2->op_flags & OPf_STACKED)
3854 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3855 expr = newUNOP(OP_DEFINED, 0, expr);
3859 if (k1->op_type == OP_READDIR
3860 || k1->op_type == OP_GLOB
3861 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3862 || k1->op_type == OP_EACH)
3863 expr = newUNOP(OP_DEFINED, 0, expr);
3869 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3870 o = new_logop(OP_AND, 0, &expr, &listop);
3873 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3875 if (once && o != listop)
3876 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3879 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3881 o->op_flags |= flags;
3883 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3888 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3898 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3899 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3900 expr = newUNOP(OP_DEFINED, 0,
3901 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3902 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3903 OP *k1 = ((UNOP*)expr)->op_first;
3904 OP *k2 = (k1) ? k1->op_sibling : NULL;
3905 switch (expr->op_type) {
3907 if (k2 && k2->op_type == OP_READLINE
3908 && (k2->op_flags & OPf_STACKED)
3909 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3910 expr = newUNOP(OP_DEFINED, 0, expr);
3914 if (k1->op_type == OP_READDIR
3915 || k1->op_type == OP_GLOB
3916 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3917 || k1->op_type == OP_EACH)
3918 expr = newUNOP(OP_DEFINED, 0, expr);
3924 block = newOP(OP_NULL, 0);
3926 block = scope(block);
3930 next = LINKLIST(cont);
3931 loopflags |= OPpLOOP_CONTINUE;
3934 OP *unstack = newOP(OP_UNSTACK, 0);
3937 cont = append_elem(OP_LINESEQ, cont, unstack);
3938 if ((line_t)whileline != NOLINE) {
3939 PL_copline = whileline;
3940 cont = append_elem(OP_LINESEQ, cont,
3941 newSTATEOP(0, Nullch, Nullop));
3945 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3946 redo = LINKLIST(listop);
3949 PL_copline = whileline;
3951 o = new_logop(OP_AND, 0, &expr, &listop);
3952 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3953 op_free(expr); /* oops, it's a while (0) */
3955 return Nullop; /* listop already freed by new_logop */
3958 ((LISTOP*)listop)->op_last->op_next = condop =
3959 (o == listop ? redo : LINKLIST(o));
3965 NewOp(1101,loop,1,LOOP);
3966 loop->op_type = OP_ENTERLOOP;
3967 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3968 loop->op_private = 0;
3969 loop->op_next = (OP*)loop;
3972 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3974 loop->op_redoop = redo;
3975 loop->op_lastop = o;
3976 o->op_private |= loopflags;
3979 loop->op_nextop = next;
3981 loop->op_nextop = o;
3983 o->op_flags |= flags;
3984 o->op_private |= (flags >> 8);
3989 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3997 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3998 sv->op_type = OP_RV2GV;
3999 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
4001 else if (sv->op_type == OP_PADSV) { /* private variable */
4002 padoff = sv->op_targ;
4007 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
4008 padoff = sv->op_targ;
4010 iterflags |= OPf_SPECIAL;
4015 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
4019 padoff = find_threadsv("_");
4020 iterflags |= OPf_SPECIAL;
4022 sv = newGVOP(OP_GV, 0, PL_defgv);
4025 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
4026 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
4027 iterflags |= OPf_STACKED;
4029 else if (expr->op_type == OP_NULL &&
4030 (expr->op_flags & OPf_KIDS) &&
4031 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
4033 /* Basically turn for($x..$y) into the same as for($x,$y), but we
4034 * set the STACKED flag to indicate that these values are to be
4035 * treated as min/max values by 'pp_iterinit'.
4037 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
4038 LOGOP* range = (LOGOP*) flip->op_first;
4039 OP* left = range->op_first;
4040 OP* right = left->op_sibling;
4043 range->op_flags &= ~OPf_KIDS;
4044 range->op_first = Nullop;
4046 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
4047 listop->op_first->op_next = range->op_next;
4048 left->op_next = range->op_other;
4049 right->op_next = (OP*)listop;
4050 listop->op_next = listop->op_first;
4053 expr = (OP*)(listop);
4055 iterflags |= OPf_STACKED;
4058 expr = mod(force_list(expr), OP_GREPSTART);
4062 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
4063 append_elem(OP_LIST, expr, scalar(sv))));
4064 assert(!loop->op_next);
4065 #ifdef PL_OP_SLAB_ALLOC
4068 NewOp(1234,tmp,1,LOOP);
4069 Copy(loop,tmp,1,LOOP);
4073 Renew(loop, 1, LOOP);
4075 loop->op_targ = padoff;
4076 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
4077 PL_copline = forline;
4078 return newSTATEOP(0, label, wop);
4082 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4088 if (type != OP_GOTO || label->op_type == OP_CONST) {
4089 /* "last()" means "last" */
4090 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4091 o = newOP(type, OPf_SPECIAL);
4093 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
4094 ? SvPVx(((SVOP*)label)->op_sv, n_a)
4100 if (label->op_type == OP_ENTERSUB)
4101 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4102 o = newUNOP(type, OPf_STACKED, label);
4104 PL_hints |= HINT_BLOCK_SCOPE;
4109 Perl_cv_undef(pTHX_ CV *cv)
4114 MUTEX_DESTROY(CvMUTEXP(cv));
4115 Safefree(CvMUTEXP(cv));
4118 #endif /* USE_THREADS */
4120 if (!CvXSUB(cv) && CvROOT(cv)) {
4122 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4123 Perl_croak(aTHX_ "Can't undef active subroutine");
4126 Perl_croak(aTHX_ "Can't undef active subroutine");
4127 #endif /* USE_THREADS */
4130 SAVEVPTR(PL_curpad);
4134 op_free(CvROOT(cv));
4135 CvROOT(cv) = Nullop;
4138 SvPOK_off((SV*)cv); /* forget prototype */
4140 SvREFCNT_dec(CvGV(cv));
4142 SvREFCNT_dec(CvOUTSIDE(cv));
4143 CvOUTSIDE(cv) = Nullcv;
4144 if (CvPADLIST(cv)) {
4145 /* may be during global destruction */
4146 if (SvREFCNT(CvPADLIST(cv))) {
4147 I32 i = AvFILLp(CvPADLIST(cv));
4149 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4150 SV* sv = svp ? *svp : Nullsv;
4153 if (sv == (SV*)PL_comppad_name)
4154 PL_comppad_name = Nullav;
4155 else if (sv == (SV*)PL_comppad) {
4156 PL_comppad = Nullav;
4157 PL_curpad = Null(SV**);
4161 SvREFCNT_dec((SV*)CvPADLIST(cv));
4163 CvPADLIST(cv) = Nullav;
4168 S_cv_dump(pTHX_ CV *cv)
4171 CV *outside = CvOUTSIDE(cv);
4172 AV* padlist = CvPADLIST(cv);
4179 PerlIO_printf(Perl_debug_log,
4180 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4182 (CvANON(cv) ? "ANON"
4183 : (cv == PL_main_cv) ? "MAIN"
4184 : CvUNIQUE(cv) ? "UNIQUE"
4185 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4188 : CvANON(outside) ? "ANON"
4189 : (outside == PL_main_cv) ? "MAIN"
4190 : CvUNIQUE(outside) ? "UNIQUE"
4191 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4196 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4197 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4198 pname = AvARRAY(pad_name);
4199 ppad = AvARRAY(pad);
4201 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4202 if (SvPOK(pname[ix]))
4203 PerlIO_printf(Perl_debug_log,
4204 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4205 (int)ix, PTR2UV(ppad[ix]),
4206 SvFAKE(pname[ix]) ? "FAKE " : "",
4208 (IV)I_32(SvNVX(pname[ix])),
4211 #endif /* DEBUGGING */
4215 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4220 AV* protopadlist = CvPADLIST(proto);
4221 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4222 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4223 SV** pname = AvARRAY(protopad_name);
4224 SV** ppad = AvARRAY(protopad);
4225 I32 fname = AvFILLp(protopad_name);
4226 I32 fpad = AvFILLp(protopad);
4230 assert(!CvUNIQUE(proto));
4234 SAVESPTR(PL_comppad_name);
4235 SAVESPTR(PL_compcv);
4237 cv = PL_compcv = (CV*)NEWSV(1104,0);
4238 sv_upgrade((SV *)cv, SvTYPE(proto));
4239 CvFLAGS(cv) = CvFLAGS(proto) & ~CVf_CLONE;
4243 New(666, CvMUTEXP(cv), 1, perl_mutex);
4244 MUTEX_INIT(CvMUTEXP(cv));
4246 #endif /* USE_THREADS */
4247 CvFILE(cv) = CvFILE(proto);
4248 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4249 CvSTASH(cv) = CvSTASH(proto);
4250 CvROOT(cv) = CvROOT(proto);
4251 CvSTART(cv) = CvSTART(proto);
4253 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4256 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4258 PL_comppad_name = newAV();
4259 for (ix = fname; ix >= 0; ix--)
4260 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4262 PL_comppad = newAV();
4264 comppadlist = newAV();
4265 AvREAL_off(comppadlist);
4266 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4267 av_store(comppadlist, 1, (SV*)PL_comppad);
4268 CvPADLIST(cv) = comppadlist;
4269 av_fill(PL_comppad, AvFILLp(protopad));
4270 PL_curpad = AvARRAY(PL_comppad);
4272 av = newAV(); /* will be @_ */
4274 av_store(PL_comppad, 0, (SV*)av);
4275 AvFLAGS(av) = AVf_REIFY;
4277 for (ix = fpad; ix > 0; ix--) {
4278 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4279 if (namesv && namesv != &PL_sv_undef) {
4280 char *name = SvPVX(namesv); /* XXX */
4281 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4282 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4283 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4285 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4287 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4289 else { /* our own lexical */
4292 /* anon code -- we'll come back for it */
4293 sv = SvREFCNT_inc(ppad[ix]);
4295 else if (*name == '@')
4297 else if (*name == '%')
4306 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4307 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4310 SV* sv = NEWSV(0,0);
4316 /* Now that vars are all in place, clone nested closures. */
4318 for (ix = fpad; ix > 0; ix--) {
4319 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4321 && namesv != &PL_sv_undef
4322 && !(SvFLAGS(namesv) & SVf_FAKE)
4323 && *SvPVX(namesv) == '&'
4324 && CvCLONE(ppad[ix]))
4326 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4327 SvREFCNT_dec(ppad[ix]);
4330 PL_curpad[ix] = (SV*)kid;
4334 #ifdef DEBUG_CLOSURES
4335 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4337 PerlIO_printf(Perl_debug_log, " from:\n");
4339 PerlIO_printf(Perl_debug_log, " to:\n");
4348 Perl_cv_clone(pTHX_ CV *proto)
4351 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4352 cv = cv_clone2(proto, CvOUTSIDE(proto));
4353 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4358 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4362 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4363 SV* msg = sv_newmortal();
4367 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4368 sv_setpv(msg, "Prototype mismatch:");
4370 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4372 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4373 sv_catpv(msg, " vs ");
4375 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4377 sv_catpv(msg, "none");
4378 Perl_warner(aTHX_ WARN_PROTOTYPE, "%"SVf, msg);
4383 Perl_cv_const_sv(pTHX_ CV *cv)
4385 if (!cv || !SvPOK(cv) || SvCUR(cv))
4387 return op_const_sv(CvSTART(cv), cv);
4391 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4398 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4399 o = cLISTOPo->op_first->op_sibling;
4401 for (; o; o = o->op_next) {
4402 OPCODE type = o->op_type;
4404 if (sv && o->op_next == o)
4406 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4408 if (type == OP_LEAVESUB || type == OP_RETURN)
4412 if (type == OP_CONST && cSVOPo->op_sv)
4414 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4415 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4416 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4417 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4429 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4439 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4443 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4445 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4449 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4456 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4460 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4461 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4462 SV *sv = sv_newmortal();
4463 Perl_sv_setpvf(aTHX_ sv, "__ANON__[%s:%"IVdf"]",
4464 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4469 gv = gv_fetchpv(name ? name : (aname ? aname : "__ANON__"),
4470 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4480 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4481 maximum a prototype before. */
4482 if (SvTYPE(gv) > SVt_NULL) {
4483 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4484 && ckWARN_d(WARN_PROTOTYPE))
4486 Perl_warner(aTHX_ WARN_PROTOTYPE, "Runaway prototype");
4488 cv_ckproto((CV*)gv, NULL, ps);
4491 sv_setpv((SV*)gv, ps);
4493 sv_setiv((SV*)gv, -1);
4494 SvREFCNT_dec(PL_compcv);
4495 cv = PL_compcv = NULL;
4496 PL_sub_generation++;
4500 if (!name || GvCVGEN(gv))
4502 else if ((cv = GvCV(gv))) {
4503 cv_ckproto(cv, gv, ps);
4504 /* already defined (or promised)? */
4505 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4507 bool const_changed = TRUE;
4508 if (!block && !attrs) {
4509 /* just a "sub foo;" when &foo is already defined */
4510 SAVEFREESV(PL_compcv);
4513 /* ahem, death to those who redefine active sort subs */
4514 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4515 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4518 if ((const_sv = cv_const_sv(cv)))
4519 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4520 if ((const_sv || const_changed) && ckWARN(WARN_REDEFINE))
4522 line_t oldline = CopLINE(PL_curcop);
4523 CopLINE_set(PL_curcop, PL_copline);
4524 Perl_warner(aTHX_ WARN_REDEFINE,
4525 const_sv ? "Constant subroutine %s redefined"
4526 : "Subroutine %s redefined", name);
4527 CopLINE_set(PL_curcop, oldline);
4538 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4539 * before we clobber PL_compcv.
4543 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4544 stash = GvSTASH(CvGV(cv));
4545 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4546 stash = CvSTASH(cv);
4548 stash = PL_curstash;
4551 /* possibly about to re-define existing subr -- ignore old cv */
4552 rcv = (SV*)PL_compcv;
4553 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4554 stash = GvSTASH(gv);
4556 stash = PL_curstash;
4558 apply_attrs(stash, rcv, attrs);
4560 if (cv) { /* must reuse cv if autoloaded */
4562 /* got here with just attrs -- work done, so bug out */
4563 SAVEFREESV(PL_compcv);
4567 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4568 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4569 CvOUTSIDE(PL_compcv) = 0;
4570 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4571 CvPADLIST(PL_compcv) = 0;
4572 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4573 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4574 SvREFCNT_dec(PL_compcv);
4581 PL_sub_generation++;
4584 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4585 CvFILE(cv) = CopFILE(PL_curcop);
4586 CvSTASH(cv) = PL_curstash;
4589 if (!CvMUTEXP(cv)) {
4590 New(666, CvMUTEXP(cv), 1, perl_mutex);
4591 MUTEX_INIT(CvMUTEXP(cv));
4593 #endif /* USE_THREADS */
4596 sv_setpv((SV*)cv, ps);
4598 if (PL_error_count) {
4602 char *s = strrchr(name, ':');
4604 if (strEQ(s, "BEGIN")) {
4606 "BEGIN not safe after errors--compilation aborted";
4607 if (PL_in_eval & EVAL_KEEPERR)
4608 Perl_croak(aTHX_ not_safe);
4610 /* force display of errors found but not reported */
4611 sv_catpv(ERRSV, not_safe);
4612 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4619 PL_copline = NOLINE;
4624 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4625 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4628 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4631 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4633 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4634 OpREFCNT_set(CvROOT(cv), 1);
4635 CvSTART(cv) = LINKLIST(CvROOT(cv));
4636 CvROOT(cv)->op_next = 0;
4639 /* now that optimizer has done its work, adjust pad values */
4641 SV **namep = AvARRAY(PL_comppad_name);
4642 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4645 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4648 * The only things that a clonable function needs in its
4649 * pad are references to outer lexicals and anonymous subs.
4650 * The rest are created anew during cloning.
4652 if (!((namesv = namep[ix]) != Nullsv &&
4653 namesv != &PL_sv_undef &&
4655 *SvPVX(namesv) == '&')))
4657 SvREFCNT_dec(PL_curpad[ix]);
4658 PL_curpad[ix] = Nullsv;
4663 AV *av = newAV(); /* Will be @_ */
4665 av_store(PL_comppad, 0, (SV*)av);
4666 AvFLAGS(av) = AVf_REIFY;
4668 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4669 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4671 if (!SvPADMY(PL_curpad[ix]))
4672 SvPADTMP_on(PL_curpad[ix]);
4676 if (name || aname) {
4678 char *tname = (name ? name : aname);
4680 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4681 SV *sv = NEWSV(0,0);
4682 SV *tmpstr = sv_newmortal();
4683 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4687 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4689 (long)PL_subline, (long)CopLINE(PL_curcop));
4690 gv_efullname3(tmpstr, gv, Nullch);
4691 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4692 hv = GvHVn(db_postponed);
4693 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4694 && (pcv = GvCV(db_postponed)))
4700 call_sv((SV*)pcv, G_DISCARD);
4704 if ((s = strrchr(tname,':')))
4709 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4712 if (strEQ(s, "BEGIN")) {
4713 I32 oldscope = PL_scopestack_ix;
4715 SAVECOPFILE(&PL_compiling);
4716 SAVECOPLINE(&PL_compiling);
4718 sv_setsv(PL_rs, PL_nrs);
4721 PL_beginav = newAV();
4722 DEBUG_x( dump_sub(gv) );
4723 av_push(PL_beginav, SvREFCNT_inc(cv));
4725 call_list(oldscope, PL_beginav);
4727 PL_curcop = &PL_compiling;
4728 PL_compiling.op_private = PL_hints;
4731 else if (strEQ(s, "END") && !PL_error_count) {
4734 DEBUG_x( dump_sub(gv) );
4735 av_unshift(PL_endav, 1);
4736 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4739 else if (strEQ(s, "CHECK") && !PL_error_count) {
4741 PL_checkav = newAV();
4742 DEBUG_x( dump_sub(gv) );
4743 if (PL_main_start && ckWARN(WARN_VOID))
4744 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4745 av_unshift(PL_checkav, 1);
4746 av_store(PL_checkav, 0, SvREFCNT_inc(cv));
4749 else if (strEQ(s, "INIT") && !PL_error_count) {
4751 PL_initav = newAV();
4752 DEBUG_x( dump_sub(gv) );
4753 if (PL_main_start && ckWARN(WARN_VOID))
4754 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4755 av_push(PL_initav, SvREFCNT_inc(cv));
4761 PL_copline = NOLINE;
4766 /* XXX unsafe for threads if eval_owner isn't held */
4768 =for apidoc newCONSTSUB
4770 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4771 eligible for inlining at compile-time.
4777 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4783 SAVECOPLINE(PL_curcop);
4784 CopLINE_set(PL_curcop, PL_copline);
4787 PL_hints &= ~HINT_BLOCK_SCOPE;
4790 SAVESPTR(PL_curstash);
4791 SAVECOPSTASH(PL_curcop);
4792 PL_curstash = stash;
4794 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4796 CopSTASH(PL_curcop) = stash;
4801 start_subparse(FALSE, 0),
4802 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4803 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4805 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4812 =for apidoc U||newXS
4814 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4820 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4823 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4826 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4828 /* just a cached method */
4832 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4833 /* already defined (or promised) */
4834 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4835 && HvNAME(GvSTASH(CvGV(cv)))
4836 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4837 line_t oldline = CopLINE(PL_curcop);
4838 if (PL_copline != NOLINE)
4839 CopLINE_set(PL_curcop, PL_copline);
4840 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4841 CopLINE_set(PL_curcop, oldline);
4848 if (cv) /* must reuse cv if autoloaded */
4851 cv = (CV*)NEWSV(1105,0);
4852 sv_upgrade((SV *)cv, SVt_PVCV);
4856 PL_sub_generation++;
4859 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4861 New(666, CvMUTEXP(cv), 1, perl_mutex);
4862 MUTEX_INIT(CvMUTEXP(cv));
4864 #endif /* USE_THREADS */
4865 (void)gv_fetchfile(filename);
4866 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4867 an external constant string */
4868 CvXSUB(cv) = subaddr;
4871 char *s = strrchr(name,':');
4877 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4880 if (strEQ(s, "BEGIN")) {
4882 PL_beginav = newAV();
4883 av_push(PL_beginav, SvREFCNT_inc(cv));
4886 else if (strEQ(s, "END")) {
4889 av_unshift(PL_endav, 1);
4890 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4893 else if (strEQ(s, "CHECK")) {
4895 PL_checkav = newAV();
4896 if (PL_main_start && ckWARN(WARN_VOID))
4897 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4898 av_unshift(PL_checkav, 1);
4899 av_store(PL_checkav, 0, SvREFCNT_inc(cv));
4902 else if (strEQ(s, "INIT")) {
4904 PL_initav = newAV();
4905 if (PL_main_start && ckWARN(WARN_VOID))
4906 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4907 av_push(PL_initav, SvREFCNT_inc(cv));
4919 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4929 name = SvPVx(cSVOPo->op_sv, n_a);
4932 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4934 if ((cv = GvFORM(gv))) {
4935 if (ckWARN(WARN_REDEFINE)) {
4936 line_t oldline = CopLINE(PL_curcop);
4938 CopLINE_set(PL_curcop, PL_copline);
4939 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4940 CopLINE_set(PL_curcop, oldline);
4946 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4947 CvFILE(cv) = CopFILE(PL_curcop);
4949 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4950 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4951 SvPADTMP_on(PL_curpad[ix]);
4954 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4955 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4956 OpREFCNT_set(CvROOT(cv), 1);
4957 CvSTART(cv) = LINKLIST(CvROOT(cv));
4958 CvROOT(cv)->op_next = 0;
4961 PL_copline = NOLINE;
4966 Perl_newANONLIST(pTHX_ OP *o)
4968 return newUNOP(OP_REFGEN, 0,
4969 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4973 Perl_newANONHASH(pTHX_ OP *o)
4975 return newUNOP(OP_REFGEN, 0,
4976 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4980 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4982 return newANONATTRSUB(floor, proto, Nullop, block);
4986 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4988 return newUNOP(OP_REFGEN, 0,
4989 newSVOP(OP_ANONCODE, 0,
4990 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4994 Perl_oopsAV(pTHX_ OP *o)
4996 switch (o->op_type) {
4998 o->op_type = OP_PADAV;
4999 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5000 return ref(o, OP_RV2AV);
5003 o->op_type = OP_RV2AV;
5004 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
5009 if (ckWARN_d(WARN_INTERNAL))
5010 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
5017 Perl_oopsHV(pTHX_ OP *o)
5021 switch (o->op_type) {
5024 o->op_type = OP_PADHV;
5025 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5026 return ref(o, OP_RV2HV);
5030 o->op_type = OP_RV2HV;
5031 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
5036 if (ckWARN_d(WARN_INTERNAL))
5037 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
5044 Perl_newAVREF(pTHX_ OP *o)
5046 if (o->op_type == OP_PADANY) {
5047 o->op_type = OP_PADAV;
5048 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5051 return newUNOP(OP_RV2AV, 0, scalar(o));
5055 Perl_newGVREF(pTHX_ I32 type, OP *o)
5057 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
5058 return newUNOP(OP_NULL, 0, o);
5059 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
5063 Perl_newHVREF(pTHX_ OP *o)
5065 if (o->op_type == OP_PADANY) {
5066 o->op_type = OP_PADHV;
5067 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5070 return newUNOP(OP_RV2HV, 0, scalar(o));
5074 Perl_oopsCV(pTHX_ OP *o)
5076 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5082 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5084 return newUNOP(OP_RV2CV, flags, scalar(o));
5088 Perl_newSVREF(pTHX_ OP *o)
5090 if (o->op_type == OP_PADANY) {
5091 o->op_type = OP_PADSV;
5092 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5095 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
5096 o->op_flags |= OPpDONE_SVREF;
5099 return newUNOP(OP_RV2SV, 0, scalar(o));
5102 /* Check routines. */
5105 Perl_ck_anoncode(pTHX_ OP *o)
5110 name = NEWSV(1106,0);
5111 sv_upgrade(name, SVt_PVNV);
5112 sv_setpvn(name, "&", 1);
5115 ix = pad_alloc(o->op_type, SVs_PADMY);
5116 av_store(PL_comppad_name, ix, name);
5117 av_store(PL_comppad, ix, cSVOPo->op_sv);
5118 SvPADMY_on(cSVOPo->op_sv);
5119 cSVOPo->op_sv = Nullsv;
5120 cSVOPo->op_targ = ix;
5125 Perl_ck_bitop(pTHX_ OP *o)
5127 o->op_private = PL_hints;
5132 Perl_ck_concat(pTHX_ OP *o)
5134 if (cUNOPo->op_first->op_type == OP_CONCAT)
5135 o->op_flags |= OPf_STACKED;
5140 Perl_ck_spair(pTHX_ OP *o)
5142 if (o->op_flags & OPf_KIDS) {
5145 OPCODE type = o->op_type;
5146 o = modkids(ck_fun(o), type);
5147 kid = cUNOPo->op_first;
5148 newop = kUNOP->op_first->op_sibling;
5150 (newop->op_sibling ||
5151 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5152 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5153 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5157 op_free(kUNOP->op_first);
5158 kUNOP->op_first = newop;
5160 o->op_ppaddr = PL_ppaddr[++o->op_type];
5165 Perl_ck_delete(pTHX_ OP *o)
5169 if (o->op_flags & OPf_KIDS) {
5170 OP *kid = cUNOPo->op_first;
5171 switch (kid->op_type) {
5173 o->op_flags |= OPf_SPECIAL;
5176 o->op_private |= OPpSLICE;
5179 o->op_flags |= OPf_SPECIAL;
5184 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5185 PL_op_desc[o->op_type]);
5193 Perl_ck_eof(pTHX_ OP *o)
5195 I32 type = o->op_type;
5197 if (o->op_flags & OPf_KIDS) {
5198 if (cLISTOPo->op_first->op_type == OP_STUB) {
5200 o = newUNOP(type, OPf_SPECIAL,
5201 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5209 Perl_ck_eval(pTHX_ OP *o)
5211 PL_hints |= HINT_BLOCK_SCOPE;
5212 if (o->op_flags & OPf_KIDS) {
5213 SVOP *kid = (SVOP*)cUNOPo->op_first;
5216 o->op_flags &= ~OPf_KIDS;
5219 else if (kid->op_type == OP_LINESEQ) {
5222 kid->op_next = o->op_next;
5223 cUNOPo->op_first = 0;
5226 NewOp(1101, enter, 1, LOGOP);
5227 enter->op_type = OP_ENTERTRY;
5228 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5229 enter->op_private = 0;
5231 /* establish postfix order */
5232 enter->op_next = (OP*)enter;
5234 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5235 o->op_type = OP_LEAVETRY;
5236 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5237 enter->op_other = o;
5245 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5247 o->op_targ = (PADOFFSET)PL_hints;
5252 Perl_ck_exit(pTHX_ OP *o)
5255 HV *table = GvHV(PL_hintgv);
5257 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
5258 if (svp && *svp && SvTRUE(*svp))
5259 o->op_private |= OPpEXIT_VMSISH;
5266 Perl_ck_exec(pTHX_ OP *o)
5269 if (o->op_flags & OPf_STACKED) {
5271 kid = cUNOPo->op_first->op_sibling;
5272 if (kid->op_type == OP_RV2GV)
5281 Perl_ck_exists(pTHX_ OP *o)
5284 if (o->op_flags & OPf_KIDS) {
5285 OP *kid = cUNOPo->op_first;
5286 if (kid->op_type == OP_ENTERSUB) {
5287 (void) ref(kid, o->op_type);
5288 if (kid->op_type != OP_RV2CV && !PL_error_count)
5289 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5290 PL_op_desc[o->op_type]);
5291 o->op_private |= OPpEXISTS_SUB;
5293 else if (kid->op_type == OP_AELEM)
5294 o->op_flags |= OPf_SPECIAL;
5295 else if (kid->op_type != OP_HELEM)
5296 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5297 PL_op_desc[o->op_type]);
5305 Perl_ck_gvconst(pTHX_ register OP *o)
5307 o = fold_constants(o);
5308 if (o->op_type == OP_CONST)
5315 Perl_ck_rvconst(pTHX_ register OP *o)
5318 SVOP *kid = (SVOP*)cUNOPo->op_first;
5320 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5321 if (kid->op_type == OP_CONST) {
5325 SV *kidsv = kid->op_sv;
5328 /* Is it a constant from cv_const_sv()? */
5329 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5330 SV *rsv = SvRV(kidsv);
5331 int svtype = SvTYPE(rsv);
5332 char *badtype = Nullch;
5334 switch (o->op_type) {
5336 if (svtype > SVt_PVMG)
5337 badtype = "a SCALAR";
5340 if (svtype != SVt_PVAV)
5341 badtype = "an ARRAY";
5344 if (svtype != SVt_PVHV) {
5345 if (svtype == SVt_PVAV) { /* pseudohash? */
5346 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5347 if (ksv && SvROK(*ksv)
5348 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5357 if (svtype != SVt_PVCV)
5362 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5365 name = SvPV(kidsv, n_a);
5366 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5367 char *badthing = Nullch;
5368 switch (o->op_type) {
5370 badthing = "a SCALAR";
5373 badthing = "an ARRAY";
5376 badthing = "a HASH";
5381 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5385 * This is a little tricky. We only want to add the symbol if we
5386 * didn't add it in the lexer. Otherwise we get duplicate strict
5387 * warnings. But if we didn't add it in the lexer, we must at
5388 * least pretend like we wanted to add it even if it existed before,
5389 * or we get possible typo warnings. OPpCONST_ENTERED says
5390 * whether the lexer already added THIS instance of this symbol.
5392 iscv = (o->op_type == OP_RV2CV) * 2;
5394 gv = gv_fetchpv(name,
5395 iscv | !(kid->op_private & OPpCONST_ENTERED),
5398 : o->op_type == OP_RV2SV
5400 : o->op_type == OP_RV2AV
5402 : o->op_type == OP_RV2HV
5405 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5407 kid->op_type = OP_GV;
5408 SvREFCNT_dec(kid->op_sv);
5410 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5411 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5412 SvREFCNT_dec(PL_curpad[kPADOP->op_padix]);
5414 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5416 kid->op_sv = SvREFCNT_inc(gv);
5418 kid->op_ppaddr = PL_ppaddr[OP_GV];
5425 Perl_ck_ftst(pTHX_ OP *o)
5428 I32 type = o->op_type;
5430 if (o->op_flags & OPf_REF) {
5433 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5434 SVOP *kid = (SVOP*)cUNOPo->op_first;
5436 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5438 OP *newop = newGVOP(type, OPf_REF,
5439 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5446 if (type == OP_FTTTY)
5447 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5450 o = newUNOP(type, 0, newDEFSVOP());
5453 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5455 if (PL_hints & HINT_LOCALE)
5456 o->op_private |= OPpLOCALE;
5463 Perl_ck_fun(pTHX_ OP *o)
5470 int type = o->op_type;
5471 register I32 oa = PL_opargs[type] >> OASHIFT;
5473 if (o->op_flags & OPf_STACKED) {
5474 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5477 return no_fh_allowed(o);
5480 if (o->op_flags & OPf_KIDS) {
5482 tokid = &cLISTOPo->op_first;
5483 kid = cLISTOPo->op_first;
5484 if (kid->op_type == OP_PUSHMARK ||
5485 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5487 tokid = &kid->op_sibling;
5488 kid = kid->op_sibling;
5490 if (!kid && PL_opargs[type] & OA_DEFGV)
5491 *tokid = kid = newDEFSVOP();
5495 sibl = kid->op_sibling;
5498 /* list seen where single (scalar) arg expected? */
5499 if (numargs == 1 && !(oa >> 4)
5500 && kid->op_type == OP_LIST && type != OP_SCALAR)
5502 return too_many_arguments(o,PL_op_desc[type]);
5515 if (kid->op_type == OP_CONST &&
5516 (kid->op_private & OPpCONST_BARE))
5518 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5519 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5520 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5521 if (ckWARN(WARN_DEPRECATED))
5522 Perl_warner(aTHX_ WARN_DEPRECATED,
5523 "Array @%s missing the @ in argument %"IVdf" of %s()",
5524 name, (IV)numargs, PL_op_desc[type]);
5527 kid->op_sibling = sibl;
5530 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5531 bad_type(numargs, "array", PL_op_desc[type], kid);
5535 if (kid->op_type == OP_CONST &&
5536 (kid->op_private & OPpCONST_BARE))
5538 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5539 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5540 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5541 if (ckWARN(WARN_DEPRECATED))
5542 Perl_warner(aTHX_ WARN_DEPRECATED,
5543 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5544 name, (IV)numargs, PL_op_desc[type]);
5547 kid->op_sibling = sibl;
5550 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5551 bad_type(numargs, "hash", PL_op_desc[type], kid);
5556 OP *newop = newUNOP(OP_NULL, 0, kid);
5557 kid->op_sibling = 0;
5559 newop->op_next = newop;
5561 kid->op_sibling = sibl;
5566 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5567 if (kid->op_type == OP_CONST &&
5568 (kid->op_private & OPpCONST_BARE))
5570 OP *newop = newGVOP(OP_GV, 0,
5571 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5576 else if (kid->op_type == OP_READLINE) {
5577 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5578 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5581 I32 flags = OPf_SPECIAL;
5585 /* is this op a FH constructor? */
5586 if (is_handle_constructor(o,numargs)) {
5587 char *name = Nullch;
5591 /* Set a flag to tell rv2gv to vivify
5592 * need to "prove" flag does not mean something
5593 * else already - NI-S 1999/05/07
5596 if (kid->op_type == OP_PADSV) {
5597 SV **namep = av_fetch(PL_comppad_name,
5599 if (namep && *namep)
5600 name = SvPV(*namep, len);
5602 else if (kid->op_type == OP_RV2SV
5603 && kUNOP->op_first->op_type == OP_GV)
5605 GV *gv = cGVOPx_gv(kUNOP->op_first);
5607 len = GvNAMELEN(gv);
5609 else if (kid->op_type == OP_AELEM
5610 || kid->op_type == OP_HELEM)
5612 name = "__ANONIO__";
5618 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5619 namesv = PL_curpad[targ];
5620 (void)SvUPGRADE(namesv, SVt_PV);
5622 sv_setpvn(namesv, "$", 1);
5623 sv_catpvn(namesv, name, len);
5626 kid->op_sibling = 0;
5627 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5628 kid->op_targ = targ;
5629 kid->op_private |= priv;
5631 kid->op_sibling = sibl;
5637 mod(scalar(kid), type);
5641 tokid = &kid->op_sibling;
5642 kid = kid->op_sibling;
5644 o->op_private |= numargs;
5646 return too_many_arguments(o,PL_op_desc[o->op_type]);
5649 else if (PL_opargs[type] & OA_DEFGV) {
5651 return newUNOP(type, 0, newDEFSVOP());
5655 while (oa & OA_OPTIONAL)
5657 if (oa && oa != OA_LIST)
5658 return too_few_arguments(o,PL_op_desc[o->op_type]);
5664 Perl_ck_glob(pTHX_ OP *o)
5669 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5670 append_elem(OP_GLOB, o, newDEFSVOP());
5672 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5673 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5675 #if !defined(PERL_EXTERNAL_GLOB)
5676 /* XXX this can be tightened up and made more failsafe. */
5679 Perl_load_module(aTHX_ 0, newSVpvn("File::Glob", 10), Nullsv,
5680 /* null-terminated import list */
5681 newSVpvn(":globally", 9), Nullsv);
5682 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5685 #endif /* PERL_EXTERNAL_GLOB */
5687 if (gv && GvIMPORTED_CV(gv)) {
5688 append_elem(OP_GLOB, o,
5689 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5690 o->op_type = OP_LIST;
5691 o->op_ppaddr = PL_ppaddr[OP_LIST];
5692 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5693 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5694 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5695 append_elem(OP_LIST, o,
5696 scalar(newUNOP(OP_RV2CV, 0,
5697 newGVOP(OP_GV, 0, gv)))));
5698 o = newUNOP(OP_NULL, 0, ck_subr(o));
5699 o->op_targ = OP_GLOB; /* hint at what it used to be */
5702 gv = newGVgen("main");
5704 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5710 Perl_ck_grep(pTHX_ OP *o)
5714 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5716 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5717 NewOp(1101, gwop, 1, LOGOP);
5719 if (o->op_flags & OPf_STACKED) {
5722 kid = cLISTOPo->op_first->op_sibling;
5723 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5726 kid->op_next = (OP*)gwop;
5727 o->op_flags &= ~OPf_STACKED;
5729 kid = cLISTOPo->op_first->op_sibling;
5730 if (type == OP_MAPWHILE)
5737 kid = cLISTOPo->op_first->op_sibling;
5738 if (kid->op_type != OP_NULL)
5739 Perl_croak(aTHX_ "panic: ck_grep");
5740 kid = kUNOP->op_first;
5742 gwop->op_type = type;
5743 gwop->op_ppaddr = PL_ppaddr[type];
5744 gwop->op_first = listkids(o);
5745 gwop->op_flags |= OPf_KIDS;
5746 gwop->op_private = 1;
5747 gwop->op_other = LINKLIST(kid);
5748 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5749 kid->op_next = (OP*)gwop;
5751 kid = cLISTOPo->op_first->op_sibling;
5752 if (!kid || !kid->op_sibling)
5753 return too_few_arguments(o,PL_op_desc[o->op_type]);
5754 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5755 mod(kid, OP_GREPSTART);
5761 Perl_ck_index(pTHX_ OP *o)
5763 if (o->op_flags & OPf_KIDS) {
5764 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5766 kid = kid->op_sibling; /* get past "big" */
5767 if (kid && kid->op_type == OP_CONST)
5768 fbm_compile(((SVOP*)kid)->op_sv, 0);
5774 Perl_ck_lengthconst(pTHX_ OP *o)
5776 /* XXX length optimization goes here */
5781 Perl_ck_lfun(pTHX_ OP *o)
5783 OPCODE type = o->op_type;
5784 return modkids(ck_fun(o), type);
5788 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5791 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5792 switch (cUNOPo->op_first->op_type) {
5794 /* This is needed for
5795 if (defined %stash::)
5796 to work. Do not break Tk.
5798 break; /* Globals via GV can be undef */
5800 case OP_AASSIGN: /* Is this a good idea? */
5801 Perl_warner(aTHX_ WARN_DEPRECATED,
5802 "defined(@array) is deprecated");
5803 Perl_warner(aTHX_ WARN_DEPRECATED,
5804 "\t(Maybe you should just omit the defined()?)\n");
5807 /* This is needed for
5808 if (defined %stash::)
5809 to work. Do not break Tk.
5811 break; /* Globals via GV can be undef */
5813 Perl_warner(aTHX_ WARN_DEPRECATED,
5814 "defined(%%hash) is deprecated");
5815 Perl_warner(aTHX_ WARN_DEPRECATED,
5816 "\t(Maybe you should just omit the defined()?)\n");
5827 Perl_ck_rfun(pTHX_ OP *o)
5829 OPCODE type = o->op_type;
5830 return refkids(ck_fun(o), type);
5834 Perl_ck_listiob(pTHX_ OP *o)
5838 kid = cLISTOPo->op_first;
5841 kid = cLISTOPo->op_first;
5843 if (kid->op_type == OP_PUSHMARK)
5844 kid = kid->op_sibling;
5845 if (kid && o->op_flags & OPf_STACKED)
5846 kid = kid->op_sibling;
5847 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5848 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5849 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5850 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5851 cLISTOPo->op_first->op_sibling = kid;
5852 cLISTOPo->op_last = kid;
5853 kid = kid->op_sibling;
5858 append_elem(o->op_type, o, newDEFSVOP());
5864 if (PL_hints & HINT_LOCALE)
5865 o->op_private |= OPpLOCALE;
5872 Perl_ck_fun_locale(pTHX_ OP *o)
5878 if (PL_hints & HINT_LOCALE)
5879 o->op_private |= OPpLOCALE;
5886 Perl_ck_sassign(pTHX_ OP *o)
5888 OP *kid = cLISTOPo->op_first;
5889 /* has a disposable target? */
5890 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5891 && !(kid->op_flags & OPf_STACKED)
5892 /* Cannot steal the second time! */
5893 && !(kid->op_private & OPpTARGET_MY))
5895 OP *kkid = kid->op_sibling;
5897 /* Can just relocate the target. */
5898 if (kkid && kkid->op_type == OP_PADSV
5899 && !(kkid->op_private & OPpLVAL_INTRO))
5901 kid->op_targ = kkid->op_targ;
5903 /* Now we do not need PADSV and SASSIGN. */
5904 kid->op_sibling = o->op_sibling; /* NULL */
5905 cLISTOPo->op_first = NULL;
5908 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5916 Perl_ck_scmp(pTHX_ OP *o)
5920 if (PL_hints & HINT_LOCALE)
5921 o->op_private |= OPpLOCALE;
5928 Perl_ck_match(pTHX_ OP *o)
5930 o->op_private |= OPpRUNTIME;
5935 Perl_ck_method(pTHX_ OP *o)
5937 OP *kid = cUNOPo->op_first;
5938 if (kid->op_type == OP_CONST) {
5939 SV* sv = kSVOP->op_sv;
5940 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5942 (void)SvUPGRADE(sv, SVt_PVIV);
5944 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5945 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5946 kSVOP->op_sv = Nullsv;
5955 Perl_ck_null(pTHX_ OP *o)
5961 Perl_ck_open(pTHX_ OP *o)
5963 HV *table = GvHV(PL_hintgv);
5967 svp = hv_fetch(table, "open_IN", 7, FALSE);
5969 mode = mode_from_discipline(*svp);
5970 if (mode & O_BINARY)
5971 o->op_private |= OPpOPEN_IN_RAW;
5972 else if (mode & O_TEXT)
5973 o->op_private |= OPpOPEN_IN_CRLF;
5976 svp = hv_fetch(table, "open_OUT", 8, FALSE);
5978 mode = mode_from_discipline(*svp);
5979 if (mode & O_BINARY)
5980 o->op_private |= OPpOPEN_OUT_RAW;
5981 else if (mode & O_TEXT)
5982 o->op_private |= OPpOPEN_OUT_CRLF;
5985 if (o->op_type == OP_BACKTICK)
5991 Perl_ck_repeat(pTHX_ OP *o)
5993 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5994 o->op_private |= OPpREPEAT_DOLIST;
5995 cBINOPo->op_first = force_list(cBINOPo->op_first);
6003 Perl_ck_require(pTHX_ OP *o)
6005 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
6006 SVOP *kid = (SVOP*)cUNOPo->op_first;
6008 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6010 for (s = SvPVX(kid->op_sv); *s; s++) {
6011 if (*s == ':' && s[1] == ':') {
6013 Move(s+2, s+1, strlen(s+2)+1, char);
6014 --SvCUR(kid->op_sv);
6017 if (SvREADONLY(kid->op_sv)) {
6018 SvREADONLY_off(kid->op_sv);
6019 sv_catpvn(kid->op_sv, ".pm", 3);
6020 SvREADONLY_on(kid->op_sv);
6023 sv_catpvn(kid->op_sv, ".pm", 3);
6031 Perl_ck_retarget(pTHX_ OP *o)
6033 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
6040 Perl_ck_select(pTHX_ OP *o)
6043 if (o->op_flags & OPf_KIDS) {
6044 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6045 if (kid && kid->op_sibling) {
6046 o->op_type = OP_SSELECT;
6047 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
6049 return fold_constants(o);
6053 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6054 if (kid && kid->op_type == OP_RV2GV)
6055 kid->op_private &= ~HINT_STRICT_REFS;
6060 Perl_ck_shift(pTHX_ OP *o)
6062 I32 type = o->op_type;
6064 if (!(o->op_flags & OPf_KIDS)) {
6069 if (!CvUNIQUE(PL_compcv)) {
6070 argop = newOP(OP_PADAV, OPf_REF);
6071 argop->op_targ = 0; /* PL_curpad[0] is @_ */
6074 argop = newUNOP(OP_RV2AV, 0,
6075 scalar(newGVOP(OP_GV, 0,
6076 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6079 argop = newUNOP(OP_RV2AV, 0,
6080 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
6081 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6082 #endif /* USE_THREADS */
6083 return newUNOP(type, 0, scalar(argop));
6085 return scalar(modkids(ck_fun(o), type));
6089 Perl_ck_sort(pTHX_ OP *o)
6094 if (PL_hints & HINT_LOCALE)
6095 o->op_private |= OPpLOCALE;
6098 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
6100 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6101 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
6103 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
6105 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
6107 if (kid->op_type == OP_SCOPE) {
6111 else if (kid->op_type == OP_LEAVE) {
6112 if (o->op_type == OP_SORT) {
6113 null(kid); /* wipe out leave */
6116 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
6117 if (k->op_next == kid)
6119 /* don't descend into loops */
6120 else if (k->op_type == OP_ENTERLOOP
6121 || k->op_type == OP_ENTERITER)
6123 k = cLOOPx(k)->op_lastop;
6128 kid->op_next = 0; /* just disconnect the leave */
6129 k = kLISTOP->op_first;
6134 if (o->op_type == OP_SORT) {
6135 /* provide scalar context for comparison function/block */
6141 o->op_flags |= OPf_SPECIAL;
6143 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
6146 firstkid = firstkid->op_sibling;
6149 /* provide list context for arguments */
6150 if (o->op_type == OP_SORT)
6157 S_simplify_sort(pTHX_ OP *o)
6160 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6164 if (!(o->op_flags & OPf_STACKED))
6166 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
6167 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
6168 kid = kUNOP->op_first; /* get past null */
6169 if (kid->op_type != OP_SCOPE)
6171 kid = kLISTOP->op_last; /* get past scope */
6172 switch(kid->op_type) {
6180 k = kid; /* remember this node*/
6181 if (kBINOP->op_first->op_type != OP_RV2SV)
6183 kid = kBINOP->op_first; /* get past cmp */
6184 if (kUNOP->op_first->op_type != OP_GV)
6186 kid = kUNOP->op_first; /* get past rv2sv */
6188 if (GvSTASH(gv) != PL_curstash)
6190 if (strEQ(GvNAME(gv), "a"))
6192 else if (strEQ(GvNAME(gv), "b"))
6196 kid = k; /* back to cmp */
6197 if (kBINOP->op_last->op_type != OP_RV2SV)
6199 kid = kBINOP->op_last; /* down to 2nd arg */
6200 if (kUNOP->op_first->op_type != OP_GV)
6202 kid = kUNOP->op_first; /* get past rv2sv */
6204 if (GvSTASH(gv) != PL_curstash
6206 ? strNE(GvNAME(gv), "a")
6207 : strNE(GvNAME(gv), "b")))
6209 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6211 o->op_private |= OPpSORT_REVERSE;
6212 if (k->op_type == OP_NCMP)
6213 o->op_private |= OPpSORT_NUMERIC;
6214 if (k->op_type == OP_I_NCMP)
6215 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6216 kid = cLISTOPo->op_first->op_sibling;
6217 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6218 op_free(kid); /* then delete it */
6219 cLISTOPo->op_children--;
6223 Perl_ck_split(pTHX_ OP *o)
6227 if (o->op_flags & OPf_STACKED)
6228 return no_fh_allowed(o);
6230 kid = cLISTOPo->op_first;
6231 if (kid->op_type != OP_NULL)
6232 Perl_croak(aTHX_ "panic: ck_split");
6233 kid = kid->op_sibling;
6234 op_free(cLISTOPo->op_first);
6235 cLISTOPo->op_first = kid;
6237 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6238 cLISTOPo->op_last = kid; /* There was only one element previously */
6241 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
6242 OP *sibl = kid->op_sibling;
6243 kid->op_sibling = 0;
6244 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6245 if (cLISTOPo->op_first == cLISTOPo->op_last)
6246 cLISTOPo->op_last = kid;
6247 cLISTOPo->op_first = kid;
6248 kid->op_sibling = sibl;
6251 kid->op_type = OP_PUSHRE;
6252 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6255 if (!kid->op_sibling)
6256 append_elem(OP_SPLIT, o, newDEFSVOP());
6258 kid = kid->op_sibling;
6261 if (!kid->op_sibling)
6262 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6264 kid = kid->op_sibling;
6267 if (kid->op_sibling)
6268 return too_many_arguments(o,PL_op_desc[o->op_type]);
6274 Perl_ck_join(pTHX_ OP *o)
6276 if (ckWARN(WARN_SYNTAX)) {
6277 OP *kid = cLISTOPo->op_first->op_sibling;
6278 if (kid && kid->op_type == OP_MATCH) {
6279 char *pmstr = "STRING";
6280 if (kPMOP->op_pmregexp)
6281 pmstr = kPMOP->op_pmregexp->precomp;
6282 Perl_warner(aTHX_ WARN_SYNTAX,
6283 "/%s/ should probably be written as \"%s\"",
6291 Perl_ck_subr(pTHX_ OP *o)
6294 OP *prev = ((cUNOPo->op_first->op_sibling)
6295 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6296 OP *o2 = prev->op_sibling;
6305 o->op_private |= OPpENTERSUB_HASTARG;
6306 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6307 if (cvop->op_type == OP_RV2CV) {
6309 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6310 null(cvop); /* disable rv2cv */
6311 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6312 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6313 GV *gv = cGVOPx_gv(tmpop);
6316 tmpop->op_private |= OPpEARLY_CV;
6317 else if (SvPOK(cv)) {
6318 namegv = CvANON(cv) ? gv : CvGV(cv);
6319 proto = SvPV((SV*)cv, n_a);
6323 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6324 if (o2->op_type == OP_CONST)
6325 o2->op_private &= ~OPpCONST_STRICT;
6326 else if (o2->op_type == OP_LIST) {
6327 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6328 if (o && o->op_type == OP_CONST)
6329 o->op_private &= ~OPpCONST_STRICT;
6332 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6333 if (PERLDB_SUB && PL_curstash != PL_debstash)
6334 o->op_private |= OPpENTERSUB_DB;
6335 while (o2 != cvop) {
6339 return too_many_arguments(o, gv_ename(namegv));
6357 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6359 arg == 1 ? "block or sub {}" : "sub {}",
6360 gv_ename(namegv), o2);
6363 /* '*' allows any scalar type, including bareword */
6366 if (o2->op_type == OP_RV2GV)
6367 goto wrapref; /* autoconvert GLOB -> GLOBref */
6368 else if (o2->op_type == OP_CONST)
6369 o2->op_private &= ~OPpCONST_STRICT;
6370 else if (o2->op_type == OP_ENTERSUB) {
6371 /* accidental subroutine, revert to bareword */
6372 OP *gvop = ((UNOP*)o2)->op_first;
6373 if (gvop && gvop->op_type == OP_NULL) {
6374 gvop = ((UNOP*)gvop)->op_first;
6376 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6379 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6380 (gvop = ((UNOP*)gvop)->op_first) &&
6381 gvop->op_type == OP_GV)
6383 GV *gv = cGVOPx_gv(gvop);
6384 OP *sibling = o2->op_sibling;
6385 SV *n = newSVpvn("",0);
6387 gv_fullname3(n, gv, "");
6388 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6389 sv_chop(n, SvPVX(n)+6);
6390 o2 = newSVOP(OP_CONST, 0, n);
6391 prev->op_sibling = o2;
6392 o2->op_sibling = sibling;
6404 if (o2->op_type != OP_RV2GV)
6405 bad_type(arg, "symbol", gv_ename(namegv), o2);
6408 if (o2->op_type != OP_ENTERSUB)
6409 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6412 if (o2->op_type != OP_RV2SV
6413 && o2->op_type != OP_PADSV
6414 && o2->op_type != OP_HELEM
6415 && o2->op_type != OP_AELEM
6416 && o2->op_type != OP_THREADSV)
6418 bad_type(arg, "scalar", gv_ename(namegv), o2);
6422 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6423 bad_type(arg, "array", gv_ename(namegv), o2);
6426 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6427 bad_type(arg, "hash", gv_ename(namegv), o2);
6431 OP* sib = kid->op_sibling;
6432 kid->op_sibling = 0;
6433 o2 = newUNOP(OP_REFGEN, 0, kid);
6434 o2->op_sibling = sib;
6435 prev->op_sibling = o2;
6446 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6447 gv_ename(namegv), SvPV((SV*)cv, n_a));
6452 mod(o2, OP_ENTERSUB);
6454 o2 = o2->op_sibling;
6456 if (proto && !optional &&
6457 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6458 return too_few_arguments(o, gv_ename(namegv));
6463 Perl_ck_svconst(pTHX_ OP *o)
6465 SvREADONLY_on(cSVOPo->op_sv);
6470 Perl_ck_trunc(pTHX_ OP *o)
6472 if (o->op_flags & OPf_KIDS) {
6473 SVOP *kid = (SVOP*)cUNOPo->op_first;
6475 if (kid->op_type == OP_NULL)
6476 kid = (SVOP*)kid->op_sibling;
6477 if (kid && kid->op_type == OP_CONST &&
6478 (kid->op_private & OPpCONST_BARE))
6480 o->op_flags |= OPf_SPECIAL;
6481 kid->op_private &= ~OPpCONST_STRICT;
6488 Perl_ck_substr(pTHX_ OP *o)
6491 if ((o->op_flags & OPf_KIDS) && o->op_private == 4) {
6492 OP *kid = cLISTOPo->op_first;
6494 if (kid->op_type == OP_NULL)
6495 kid = kid->op_sibling;
6497 kid->op_flags |= OPf_MOD;
6503 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6506 Perl_peep(pTHX_ register OP *o)
6509 register OP* oldop = 0;
6511 OP *last_composite = Nullop;
6513 if (!o || o->op_seq)
6517 SAVEVPTR(PL_curcop);
6518 for (; o; o = o->op_next) {
6524 switch (o->op_type) {
6528 PL_curcop = ((COP*)o); /* for warnings */
6529 o->op_seq = PL_op_seqmax++;
6530 last_composite = Nullop;
6534 if (cSVOPo->op_private & OPpCONST_STRICT)
6535 no_bareword_allowed(o);
6537 /* Relocate sv to the pad for thread safety.
6538 * Despite being a "constant", the SV is written to,
6539 * for reference counts, sv_upgrade() etc. */
6541 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6542 if (SvPADTMP(cSVOPo->op_sv)) {
6543 /* If op_sv is already a PADTMP then it is being used by
6544 * another pad, so make a copy. */
6545 sv_setsv(PL_curpad[ix],cSVOPo->op_sv);
6546 SvREADONLY_on(PL_curpad[ix]);
6547 SvREFCNT_dec(cSVOPo->op_sv);
6550 SvREFCNT_dec(PL_curpad[ix]);
6551 SvPADTMP_on(cSVOPo->op_sv);
6552 PL_curpad[ix] = cSVOPo->op_sv;
6554 cSVOPo->op_sv = Nullsv;
6558 o->op_seq = PL_op_seqmax++;
6562 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6563 if (o->op_next->op_private & OPpTARGET_MY) {
6564 if (o->op_flags & OPf_STACKED) /* chained concats */
6565 goto ignore_optimization;
6567 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6568 o->op_targ = o->op_next->op_targ;
6569 o->op_next->op_targ = 0;
6570 o->op_private |= OPpTARGET_MY;
6575 ignore_optimization:
6576 o->op_seq = PL_op_seqmax++;
6579 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6580 o->op_seq = PL_op_seqmax++;
6581 break; /* Scalar stub must produce undef. List stub is noop */
6585 if (o->op_targ == OP_NEXTSTATE
6586 || o->op_targ == OP_DBSTATE
6587 || o->op_targ == OP_SETSTATE)
6589 PL_curcop = ((COP*)o);
6596 if (oldop && o->op_next) {
6597 oldop->op_next = o->op_next;
6600 o->op_seq = PL_op_seqmax++;
6604 if (o->op_next->op_type == OP_RV2SV) {
6605 if (!(o->op_next->op_private & OPpDEREF)) {
6607 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6609 o->op_next = o->op_next->op_next;
6610 o->op_type = OP_GVSV;
6611 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6614 else if (o->op_next->op_type == OP_RV2AV) {
6615 OP* pop = o->op_next->op_next;
6617 if (pop->op_type == OP_CONST &&
6618 (PL_op = pop->op_next) &&
6619 pop->op_next->op_type == OP_AELEM &&
6620 !(pop->op_next->op_private &
6621 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6622 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6630 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6631 o->op_next = pop->op_next->op_next;
6632 o->op_type = OP_AELEMFAST;
6633 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6634 o->op_private = (U8)i;
6639 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6641 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6642 /* XXX could check prototype here instead of just carping */
6643 SV *sv = sv_newmortal();
6644 gv_efullname3(sv, gv, Nullch);
6645 Perl_warner(aTHX_ WARN_PROTOTYPE,
6646 "%s() called too early to check prototype",
6651 o->op_seq = PL_op_seqmax++;
6662 o->op_seq = PL_op_seqmax++;
6663 while (cLOGOP->op_other->op_type == OP_NULL)
6664 cLOGOP->op_other = cLOGOP->op_other->op_next;
6665 peep(cLOGOP->op_other);
6669 o->op_seq = PL_op_seqmax++;
6670 peep(cLOOP->op_redoop);
6671 peep(cLOOP->op_nextop);
6672 peep(cLOOP->op_lastop);
6678 o->op_seq = PL_op_seqmax++;
6679 peep(cPMOP->op_pmreplstart);
6683 o->op_seq = PL_op_seqmax++;
6684 if (ckWARN(WARN_SYNTAX) && o->op_next
6685 && o->op_next->op_type == OP_NEXTSTATE) {
6686 if (o->op_next->op_sibling &&
6687 o->op_next->op_sibling->op_type != OP_EXIT &&
6688 o->op_next->op_sibling->op_type != OP_WARN &&
6689 o->op_next->op_sibling->op_type != OP_DIE) {
6690 line_t oldline = CopLINE(PL_curcop);
6692 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6693 Perl_warner(aTHX_ WARN_EXEC,
6694 "Statement unlikely to be reached");
6695 Perl_warner(aTHX_ WARN_EXEC,
6696 "\t(Maybe you meant system() when you said exec()?)\n");
6697 CopLINE_set(PL_curcop, oldline);
6706 SV **svp, **indsvp, *sv;
6711 o->op_seq = PL_op_seqmax++;
6712 if ((o->op_private & (OPpLVAL_INTRO))
6713 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6715 rop = (UNOP*)((BINOP*)o)->op_first;
6716 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6718 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6719 if (!SvOBJECT(lexname))
6721 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6722 if (!fields || !GvHV(*fields))
6724 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6725 key = SvPV(*svp, keylen);
6726 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6728 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6729 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6731 ind = SvIV(*indsvp);
6733 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6734 rop->op_type = OP_RV2AV;
6735 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6736 o->op_type = OP_AELEM;
6737 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6739 if (SvREADONLY(*svp))
6741 SvFLAGS(sv) |= (SvFLAGS(*svp)
6742 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6752 SV **svp, **indsvp, *sv;
6756 SVOP *first_key_op, *key_op;
6758 o->op_seq = PL_op_seqmax++;
6759 if ((o->op_private & (OPpLVAL_INTRO))
6760 /* I bet there's always a pushmark... */
6761 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
6762 /* hmmm, no optimization if list contains only one key. */
6764 rop = (UNOP*)((LISTOP*)o)->op_last;
6765 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6767 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6768 if (!SvOBJECT(lexname))
6770 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6771 if (!fields || !GvHV(*fields))
6773 /* Again guessing that the pushmark can be jumped over.... */
6774 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
6775 ->op_first->op_sibling;
6776 /* Check that the key list contains only constants. */
6777 for (key_op = first_key_op; key_op;
6778 key_op = (SVOP*)key_op->op_sibling)
6779 if (key_op->op_type != OP_CONST)
6783 rop->op_type = OP_RV2AV;
6784 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6785 o->op_type = OP_ASLICE;
6786 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
6787 for (key_op = first_key_op; key_op;
6788 key_op = (SVOP*)key_op->op_sibling) {
6789 svp = cSVOPx_svp(key_op);
6790 key = SvPV(*svp, keylen);
6791 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6793 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
6794 "in variable %s of type %s",
6795 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6797 ind = SvIV(*indsvp);
6799 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6801 if (SvREADONLY(*svp))
6803 SvFLAGS(sv) |= (SvFLAGS(*svp)
6804 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6813 if (!(o->op_flags & OPf_WANT)
6814 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6818 o->op_seq = PL_op_seqmax++;
6822 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6823 o->op_seq = PL_op_seqmax++;
6829 if (last_composite) {
6830 OP *r = last_composite;
6832 while (r->op_sibling)
6835 || (r->op_next->op_type == OP_LIST
6836 && r->op_next->op_next == o))
6838 if (last_composite->op_type == OP_RV2AV)
6839 yyerror("Lvalue subs returning arrays not implemented yet");
6841 yyerror("Lvalue subs returning hashes not implemented yet");
6848 o->op_seq = PL_op_seqmax++;