3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
23 /* #define PL_OP_SLAB_ALLOC */
25 #ifdef PL_OP_SLAB_ALLOC
26 #define SLAB_SIZE 8192
27 static char *PL_OpPtr = NULL;
28 static int PL_OpSpace = 0;
29 #define NewOp(m,var,c,type) do { if ((PL_OpSpace -= c*sizeof(type)) >= 0) \
30 var = (type *)(PL_OpPtr -= c*sizeof(type)); \
32 var = (type *) Slab_Alloc(m,c*sizeof(type)); \
36 S_Slab_Alloc(pTHX_ int m, size_t sz)
38 Newz(m,PL_OpPtr,SLAB_SIZE,char);
39 PL_OpSpace = SLAB_SIZE - sz;
40 return PL_OpPtr += PL_OpSpace;
44 #define NewOp(m, var, c, type) Newz(m, var, c, type)
47 * In the following definition, the ", Nullop" is just to make the compiler
48 * think the expression is of the right type: croak actually does a Siglongjmp.
50 #define CHECKOP(type,o) \
51 ((PL_op_mask && PL_op_mask[type]) \
52 ? ( op_free((OP*)o), \
53 Perl_croak(aTHX_ "%s trapped by operation mask", PL_op_desc[type]), \
55 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
57 #define PAD_MAX 999999999
60 S_gv_ename(pTHX_ GV *gv)
63 SV* tmpsv = sv_newmortal();
64 gv_efullname3(tmpsv, gv, Nullch);
65 return SvPV(tmpsv,n_a);
69 S_no_fh_allowed(pTHX_ OP *o)
71 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
72 PL_op_desc[o->op_type]));
77 S_too_few_arguments(pTHX_ OP *o, char *name)
79 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
84 S_too_many_arguments(pTHX_ OP *o, char *name)
86 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
91 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
93 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
94 (int)n, name, t, PL_op_desc[kid->op_type]));
98 S_no_bareword_allowed(pTHX_ OP *o)
100 qerror(Perl_mess(aTHX_
101 "Bareword \"%s\" not allowed while \"strict subs\" in use",
102 SvPV_nolen(cSVOPo_sv)));
105 /* "register" allocation */
108 Perl_pad_allocmy(pTHX_ char *name)
114 if (!(PL_in_my == KEY_our ||
116 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
117 (name[1] == '_' && (int)strlen(name) > 2)))
119 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
120 /* 1999-02-27 mjd@plover.com */
122 p = strchr(name, '\0');
123 /* The next block assumes the buffer is at least 205 chars
124 long. At present, it's always at least 256 chars. */
126 strcpy(name+200, "...");
132 /* Move everything else down one character */
133 for (; p-name > 2; p--)
135 name[2] = toCTRL(name[1]);
138 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
140 if (ckWARN(WARN_MISC) && AvFILLp(PL_comppad_name) >= 0) {
141 SV **svp = AvARRAY(PL_comppad_name);
142 HV *ourstash = (PL_curstash ? PL_curstash : PL_defstash);
143 PADOFFSET top = AvFILLp(PL_comppad_name);
144 for (off = top; off > PL_comppad_name_floor; off--) {
146 && sv != &PL_sv_undef
147 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
148 && (PL_in_my != KEY_our
149 || ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash))
150 && strEQ(name, SvPVX(sv)))
152 Perl_warner(aTHX_ WARN_MISC,
153 "\"%s\" variable %s masks earlier declaration in same %s",
154 (PL_in_my == KEY_our ? "our" : "my"),
156 (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
161 if (PL_in_my == KEY_our) {
164 && sv != &PL_sv_undef
165 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
166 && ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash)
167 && strEQ(name, SvPVX(sv)))
169 Perl_warner(aTHX_ WARN_MISC,
170 "\"our\" variable %s redeclared", name);
171 Perl_warner(aTHX_ WARN_MISC,
172 "\t(Did you mean \"local\" instead of \"our\"?)\n");
175 } while ( off-- > 0 );
178 off = pad_alloc(OP_PADSV, SVs_PADMY);
180 sv_upgrade(sv, SVt_PVNV);
182 if (PL_in_my_stash) {
184 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"%s\"",
185 name, PL_in_my == KEY_our ? "our" : "my"));
187 (void)SvUPGRADE(sv, SVt_PVMG);
188 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
191 if (PL_in_my == KEY_our) {
192 (void)SvUPGRADE(sv, SVt_PVGV);
193 GvSTASH(sv) = (HV*)SvREFCNT_inc(PL_curstash ? (SV*)PL_curstash : (SV*)PL_defstash);
194 SvFLAGS(sv) |= SVpad_OUR;
196 av_store(PL_comppad_name, off, sv);
197 SvNVX(sv) = (NV)PAD_MAX;
198 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
199 if (!PL_min_intro_pending)
200 PL_min_intro_pending = off;
201 PL_max_intro_pending = off;
203 av_store(PL_comppad, off, (SV*)newAV());
204 else if (*name == '%')
205 av_store(PL_comppad, off, (SV*)newHV());
206 SvPADMY_on(PL_curpad[off]);
211 S_pad_addlex(pTHX_ SV *proto_namesv)
213 SV *namesv = NEWSV(1103,0);
214 PADOFFSET newoff = pad_alloc(OP_PADSV, SVs_PADMY);
215 sv_upgrade(namesv, SVt_PVNV);
216 sv_setpv(namesv, SvPVX(proto_namesv));
217 av_store(PL_comppad_name, newoff, namesv);
218 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
219 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
220 SvFAKE_on(namesv); /* A ref, not a real var */
221 if (SvFLAGS(proto_namesv) & SVpad_OUR) { /* An "our" variable */
222 SvFLAGS(namesv) |= SVpad_OUR;
223 (void)SvUPGRADE(namesv, SVt_PVGV);
224 GvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)GvSTASH(proto_namesv));
226 if (SvOBJECT(proto_namesv)) { /* A typed var */
228 (void)SvUPGRADE(namesv, SVt_PVMG);
229 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(proto_namesv));
235 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
238 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
239 I32 cx_ix, I32 saweval, U32 flags)
246 register PERL_CONTEXT *cx;
248 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
249 AV *curlist = CvPADLIST(cv);
250 SV **svp = av_fetch(curlist, 0, FALSE);
253 if (!svp || *svp == &PL_sv_undef)
256 svp = AvARRAY(curname);
257 for (off = AvFILLp(curname); off > 0; off--) {
258 if ((sv = svp[off]) &&
259 sv != &PL_sv_undef &&
261 seq > I_32(SvNVX(sv)) &&
262 strEQ(SvPVX(sv), name))
273 return 0; /* don't clone from inactive stack frame */
277 oldpad = (AV*)AvARRAY(curlist)[depth];
278 oldsv = *av_fetch(oldpad, off, TRUE);
279 if (!newoff) { /* Not a mere clone operation. */
280 newoff = pad_addlex(sv);
281 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
282 /* "It's closures all the way down." */
283 CvCLONE_on(PL_compcv);
285 if (CvANON(PL_compcv))
286 oldsv = Nullsv; /* no need to keep ref */
291 bcv && bcv != cv && !CvCLONE(bcv);
292 bcv = CvOUTSIDE(bcv))
295 /* install the missing pad entry in intervening
296 * nested subs and mark them cloneable.
297 * XXX fix pad_foo() to not use globals */
298 AV *ocomppad_name = PL_comppad_name;
299 AV *ocomppad = PL_comppad;
300 SV **ocurpad = PL_curpad;
301 AV *padlist = CvPADLIST(bcv);
302 PL_comppad_name = (AV*)AvARRAY(padlist)[0];
303 PL_comppad = (AV*)AvARRAY(padlist)[1];
304 PL_curpad = AvARRAY(PL_comppad);
306 PL_comppad_name = ocomppad_name;
307 PL_comppad = ocomppad;
312 if (ckWARN(WARN_CLOSURE)
313 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
315 Perl_warner(aTHX_ WARN_CLOSURE,
316 "Variable \"%s\" may be unavailable",
324 else if (!CvUNIQUE(PL_compcv)) {
325 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv)
326 && !(SvFLAGS(sv) & SVpad_OUR))
328 Perl_warner(aTHX_ WARN_CLOSURE,
329 "Variable \"%s\" will not stay shared", name);
333 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
339 if (flags & FINDLEX_NOSEARCH)
342 /* Nothing in current lexical context--try eval's context, if any.
343 * This is necessary to let the perldb get at lexically scoped variables.
344 * XXX This will also probably interact badly with eval tree caching.
347 for (i = cx_ix; i >= 0; i--) {
349 switch (CxTYPE(cx)) {
351 if (i == 0 && saweval) {
352 seq = cxstack[saweval].blk_oldcop->cop_seq;
353 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
357 switch (cx->blk_eval.old_op_type) {
364 /* require/do must have their own scope */
373 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
374 saweval = i; /* so we know where we were called from */
377 seq = cxstack[saweval].blk_oldcop->cop_seq;
378 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
386 Perl_pad_findmy(pTHX_ char *name)
392 SV **svp = AvARRAY(PL_comppad_name);
393 U32 seq = PL_cop_seqmax;
399 * Special case to get lexical (and hence per-thread) @_.
400 * XXX I need to find out how to tell at parse-time whether use
401 * of @_ should refer to a lexical (from a sub) or defgv (global
402 * scope and maybe weird sub-ish things like formats). See
403 * startsub in perly.y. It's possible that @_ could be lexical
404 * (at least from subs) even in non-threaded perl.
406 if (strEQ(name, "@_"))
407 return 0; /* success. (NOT_IN_PAD indicates failure) */
408 #endif /* USE_THREADS */
410 /* The one we're looking for is probably just before comppad_name_fill. */
411 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
412 if ((sv = svp[off]) &&
413 sv != &PL_sv_undef &&
416 seq > I_32(SvNVX(sv)))) &&
417 strEQ(SvPVX(sv), name))
419 if (SvIVX(sv) || SvFLAGS(sv) & SVpad_OUR)
420 return (PADOFFSET)off;
421 pendoff = off; /* this pending def. will override import */
425 outside = CvOUTSIDE(PL_compcv);
427 /* Check if if we're compiling an eval'', and adjust seq to be the
428 * eval's seq number. This depends on eval'' having a non-null
429 * CvOUTSIDE() while it is being compiled. The eval'' itself is
430 * identified by CvEVAL being true and CvGV being null. */
431 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
432 cx = &cxstack[cxstack_ix];
434 seq = cx->blk_oldcop->cop_seq;
437 /* See if it's in a nested scope */
438 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
440 /* If there is a pending local definition, this new alias must die */
442 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
443 return off; /* pad_findlex returns 0 for failure...*/
445 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
449 Perl_pad_leavemy(pTHX_ I32 fill)
453 SV **svp = AvARRAY(PL_comppad_name);
455 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
456 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
457 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
458 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
461 /* "Deintroduce" my variables that are leaving with this scope. */
462 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
463 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
464 SvIVX(sv) = PL_cop_seqmax;
469 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
475 if (AvARRAY(PL_comppad) != PL_curpad)
476 Perl_croak(aTHX_ "panic: pad_alloc");
477 if (PL_pad_reset_pending)
479 if (tmptype & SVs_PADMY) {
481 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
482 } while (SvPADBUSY(sv)); /* need a fresh one */
483 retval = AvFILLp(PL_comppad);
486 SV **names = AvARRAY(PL_comppad_name);
487 SSize_t names_fill = AvFILLp(PL_comppad_name);
490 * "foreach" index vars temporarily become aliases to non-"my"
491 * values. Thus we must skip, not just pad values that are
492 * marked as current pad values, but also those with names.
494 if (++PL_padix <= names_fill &&
495 (sv = names[PL_padix]) && sv != &PL_sv_undef)
497 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
498 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)) && !IS_PADGV(sv))
503 SvFLAGS(sv) |= tmptype;
504 PL_curpad = AvARRAY(PL_comppad);
506 DEBUG_X(PerlIO_printf(Perl_debug_log,
507 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
508 PTR2UV(thr), PTR2UV(PL_curpad),
509 (long) retval, PL_op_name[optype]));
511 DEBUG_X(PerlIO_printf(Perl_debug_log,
512 "Pad 0x%"UVxf" alloc %ld for %s\n",
514 (long) retval, PL_op_name[optype]));
515 #endif /* USE_THREADS */
516 return (PADOFFSET)retval;
520 Perl_pad_sv(pTHX_ PADOFFSET po)
524 DEBUG_X(PerlIO_printf(Perl_debug_log,
525 "0x%"UVxf" Pad 0x%"UVxf" sv %"IVdf"\n",
526 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
529 Perl_croak(aTHX_ "panic: pad_sv po");
530 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %"IVdf"\n",
531 PTR2UV(PL_curpad), (IV)po));
532 #endif /* USE_THREADS */
533 return PL_curpad[po]; /* eventually we'll turn this into a macro */
537 Perl_pad_free(pTHX_ PADOFFSET po)
542 if (AvARRAY(PL_comppad) != PL_curpad)
543 Perl_croak(aTHX_ "panic: pad_free curpad");
545 Perl_croak(aTHX_ "panic: pad_free po");
547 DEBUG_X(PerlIO_printf(Perl_debug_log,
548 "0x%"UVxf" Pad 0x%"UVxf" free %"IVdf"\n",
549 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
551 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %"IVdf"\n",
552 PTR2UV(PL_curpad), (IV)po));
553 #endif /* USE_THREADS */
554 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
555 SvPADTMP_off(PL_curpad[po]);
557 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
560 if ((I32)po < PL_padix)
565 Perl_pad_swipe(pTHX_ PADOFFSET po)
568 if (AvARRAY(PL_comppad) != PL_curpad)
569 Perl_croak(aTHX_ "panic: pad_swipe curpad");
571 Perl_croak(aTHX_ "panic: pad_swipe po");
573 DEBUG_X(PerlIO_printf(Perl_debug_log,
574 "0x%"UVxf" Pad 0x%"UVxf" swipe %"IVdf"\n",
575 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
577 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %"IVdf"\n",
578 PTR2UV(PL_curpad), (IV)po));
579 #endif /* USE_THREADS */
580 SvPADTMP_off(PL_curpad[po]);
581 PL_curpad[po] = NEWSV(1107,0);
582 SvPADTMP_on(PL_curpad[po]);
583 if ((I32)po < PL_padix)
587 /* XXX pad_reset() is currently disabled because it results in serious bugs.
588 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
589 * on the stack by OPs that use them, there are several ways to get an alias
590 * to a shared TARG. Such an alias will change randomly and unpredictably.
591 * We avoid doing this until we can think of a Better Way.
596 #ifdef USE_BROKEN_PAD_RESET
600 if (AvARRAY(PL_comppad) != PL_curpad)
601 Perl_croak(aTHX_ "panic: pad_reset curpad");
603 DEBUG_X(PerlIO_printf(Perl_debug_log,
604 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
605 PTR2UV(thr), PTR2UV(PL_curpad)));
607 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
609 #endif /* USE_THREADS */
610 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
611 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
612 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
613 SvPADTMP_off(PL_curpad[po]);
615 PL_padix = PL_padix_floor;
618 PL_pad_reset_pending = FALSE;
622 /* find_threadsv is not reentrant */
624 Perl_find_threadsv(pTHX_ const char *name)
630 /* We currently only handle names of a single character */
631 p = strchr(PL_threadsv_names, *name);
634 key = p - PL_threadsv_names;
635 MUTEX_LOCK(&thr->mutex);
636 svp = av_fetch(thr->threadsv, key, FALSE);
638 MUTEX_UNLOCK(&thr->mutex);
640 SV *sv = NEWSV(0, 0);
641 av_store(thr->threadsv, key, sv);
642 thr->threadsvp = AvARRAY(thr->threadsv);
643 MUTEX_UNLOCK(&thr->mutex);
645 * Some magic variables used to be automagically initialised
646 * in gv_fetchpv. Those which are now per-thread magicals get
647 * initialised here instead.
653 sv_setpv(sv, "\034");
654 sv_magic(sv, 0, 0, name, 1);
659 PL_sawampersand = TRUE;
673 /* XXX %! tied to Errno.pm needs to be added here.
674 * See gv_fetchpv(). */
678 sv_magic(sv, 0, 0, name, 1);
680 DEBUG_S(PerlIO_printf(Perl_error_log,
681 "find_threadsv: new SV %p for $%s%c\n",
682 sv, (*name < 32) ? "^" : "",
683 (*name < 32) ? toCTRL(*name) : *name));
687 #endif /* USE_THREADS */
692 Perl_op_free(pTHX_ OP *o)
694 register OP *kid, *nextkid;
697 if (!o || o->op_seq == (U16)-1)
700 if (o->op_private & OPpREFCOUNTED) {
701 switch (o->op_type) {
709 if (OpREFCNT_dec(o)) {
720 if (o->op_flags & OPf_KIDS) {
721 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
722 nextkid = kid->op_sibling; /* Get before next freeing kid */
730 /* COP* is not cleared by op_clear() so that we may track line
731 * numbers etc even after null() */
732 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
737 #ifdef PL_OP_SLAB_ALLOC
738 if ((char *) o == PL_OpPtr)
747 S_op_clear(pTHX_ OP *o)
749 switch (o->op_type) {
750 case OP_NULL: /* Was holding old type, if any. */
751 case OP_ENTEREVAL: /* Was holding hints. */
753 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
759 if (!(o->op_flags & OPf_SPECIAL))
762 #endif /* USE_THREADS */
764 if (!(o->op_flags & OPf_REF)
765 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
772 if (cPADOPo->op_padix > 0) {
775 pad_swipe(cPADOPo->op_padix);
776 /* No GvIN_PAD_off(gv) here, because other references may still
777 * exist on the pad */
780 cPADOPo->op_padix = 0;
783 SvREFCNT_dec(cSVOPo->op_sv);
784 cSVOPo->op_sv = Nullsv;
787 case OP_METHOD_NAMED:
789 SvREFCNT_dec(cSVOPo->op_sv);
790 cSVOPo->op_sv = Nullsv;
796 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
800 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
801 SvREFCNT_dec(cSVOPo->op_sv);
802 cSVOPo->op_sv = Nullsv;
805 Safefree(cPVOPo->op_pv);
806 cPVOPo->op_pv = Nullch;
810 op_free(cPMOPo->op_pmreplroot);
814 if ((PADOFFSET)cPMOPo->op_pmreplroot) {
816 GV *gv = (GV*)PL_curpad[(PADOFFSET)cPMOPo->op_pmreplroot];
817 pad_swipe((PADOFFSET)cPMOPo->op_pmreplroot);
818 /* No GvIN_PAD_off(gv) here, because other references may still
819 * exist on the pad */
824 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
830 cPMOPo->op_pmreplroot = Nullop;
831 ReREFCNT_dec(cPMOPo->op_pmregexp);
832 cPMOPo->op_pmregexp = (REGEXP*)NULL;
836 if (o->op_targ > 0) {
837 pad_free(o->op_targ);
843 S_cop_free(pTHX_ COP* cop)
845 Safefree(cop->cop_label);
847 Safefree(CopFILE(cop)); /* XXXXX share in a pvtable? */
848 Safefree(CopSTASHPV(cop)); /* XXXXX share in a pvtable? */
850 /* NOTE: COP.cop_stash is not refcounted */
851 SvREFCNT_dec(CopFILEGV(cop));
853 if (! specialWARN(cop->cop_warnings))
854 SvREFCNT_dec(cop->cop_warnings);
860 if (o->op_type == OP_NULL)
863 o->op_targ = o->op_type;
864 o->op_type = OP_NULL;
865 o->op_ppaddr = PL_ppaddr[OP_NULL];
868 /* Contextualizers */
870 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
873 Perl_linklist(pTHX_ OP *o)
880 /* establish postfix order */
881 if (cUNOPo->op_first) {
882 o->op_next = LINKLIST(cUNOPo->op_first);
883 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
885 kid->op_next = LINKLIST(kid->op_sibling);
897 Perl_scalarkids(pTHX_ OP *o)
900 if (o && o->op_flags & OPf_KIDS) {
901 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
908 S_scalarboolean(pTHX_ OP *o)
910 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
912 if (ckWARN(WARN_SYNTAX)) {
913 line_t oldline = CopLINE(PL_curcop);
915 if (PL_copline != NOLINE)
916 CopLINE_set(PL_curcop, PL_copline);
917 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
918 CopLINE_set(PL_curcop, oldline);
925 Perl_scalar(pTHX_ OP *o)
929 /* assumes no premature commitment */
930 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
931 || o->op_type == OP_RETURN)
936 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
938 switch (o->op_type) {
940 if (o->op_private & OPpREPEAT_DOLIST)
941 null(((LISTOP*)cBINOPo->op_first)->op_first);
942 scalar(cBINOPo->op_first);
947 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
951 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
952 if (!kPMOP->op_pmreplroot)
953 deprecate("implicit split to @_");
961 if (o->op_flags & OPf_KIDS) {
962 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
968 kid = cLISTOPo->op_first;
970 while ((kid = kid->op_sibling)) {
976 WITH_THR(PL_curcop = &PL_compiling);
981 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
987 WITH_THR(PL_curcop = &PL_compiling);
994 Perl_scalarvoid(pTHX_ OP *o)
1001 if (o->op_type == OP_NEXTSTATE
1002 || o->op_type == OP_SETSTATE
1003 || o->op_type == OP_DBSTATE
1004 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1005 || o->op_targ == OP_SETSTATE
1006 || o->op_targ == OP_DBSTATE)))
1009 PL_curcop = (COP*)o; /* for warning below */
1012 /* assumes no premature commitment */
1013 want = o->op_flags & OPf_WANT;
1014 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
1015 || o->op_type == OP_RETURN)
1020 if ((o->op_private & OPpTARGET_MY)
1021 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1023 return scalar(o); /* As if inside SASSIGN */
1026 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1028 switch (o->op_type) {
1030 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1034 if (o->op_flags & OPf_STACKED)
1038 if (o->op_private == 4)
1080 case OP_GETSOCKNAME:
1081 case OP_GETPEERNAME:
1086 case OP_GETPRIORITY:
1109 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1110 useless = PL_op_desc[o->op_type];
1117 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1118 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1119 useless = "a variable";
1124 if (cSVOPo->op_private & OPpCONST_STRICT)
1125 no_bareword_allowed(o);
1128 if (ckWARN(WARN_VOID)) {
1129 useless = "a constant";
1130 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1132 else if (SvPOK(sv)) {
1133 if (strnEQ(SvPVX(sv), "di", 2) ||
1134 strnEQ(SvPVX(sv), "ds", 2) ||
1135 strnEQ(SvPVX(sv), "ig", 2))
1140 null(o); /* don't execute or even remember it */
1144 o->op_type = OP_PREINC; /* pre-increment is faster */
1145 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1149 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1150 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1156 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1161 if (o->op_flags & OPf_STACKED)
1169 if (!(o->op_flags & OPf_KIDS))
1178 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1185 /* all requires must return a boolean value */
1186 o->op_flags &= ~OPf_WANT;
1189 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1190 if (!kPMOP->op_pmreplroot)
1191 deprecate("implicit split to @_");
1197 if (ckWARN(WARN_VOID))
1198 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1204 Perl_listkids(pTHX_ OP *o)
1207 if (o && o->op_flags & OPf_KIDS) {
1208 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1215 Perl_list(pTHX_ OP *o)
1219 /* assumes no premature commitment */
1220 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1221 || o->op_type == OP_RETURN)
1226 if ((o->op_private & OPpTARGET_MY)
1227 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1229 return o; /* As if inside SASSIGN */
1232 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1234 switch (o->op_type) {
1237 list(cBINOPo->op_first);
1242 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1250 if (!(o->op_flags & OPf_KIDS))
1252 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1253 list(cBINOPo->op_first);
1254 return gen_constant_list(o);
1261 kid = cLISTOPo->op_first;
1263 while ((kid = kid->op_sibling)) {
1264 if (kid->op_sibling)
1269 WITH_THR(PL_curcop = &PL_compiling);
1273 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1274 if (kid->op_sibling)
1279 WITH_THR(PL_curcop = &PL_compiling);
1282 /* all requires must return a boolean value */
1283 o->op_flags &= ~OPf_WANT;
1290 Perl_scalarseq(pTHX_ OP *o)
1295 if (o->op_type == OP_LINESEQ ||
1296 o->op_type == OP_SCOPE ||
1297 o->op_type == OP_LEAVE ||
1298 o->op_type == OP_LEAVETRY)
1301 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1302 if (kid->op_sibling) {
1306 PL_curcop = &PL_compiling;
1308 o->op_flags &= ~OPf_PARENS;
1309 if (PL_hints & HINT_BLOCK_SCOPE)
1310 o->op_flags |= OPf_PARENS;
1313 o = newOP(OP_STUB, 0);
1318 S_modkids(pTHX_ OP *o, I32 type)
1321 if (o && o->op_flags & OPf_KIDS) {
1322 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1329 Perl_mod(pTHX_ OP *o, I32 type)
1335 if (!o || PL_error_count)
1338 if ((o->op_private & OPpTARGET_MY)
1339 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1344 switch (o->op_type) {
1349 if (!(o->op_private & (OPpCONST_ARYBASE)))
1351 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1352 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1356 SAVEI32(PL_compiling.cop_arybase);
1357 PL_compiling.cop_arybase = 0;
1359 else if (type == OP_REFGEN)
1362 Perl_croak(aTHX_ "That use of $[ is unsupported");
1365 if (o->op_flags & OPf_PARENS)
1369 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1370 !(o->op_flags & OPf_STACKED)) {
1371 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1372 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1373 assert(cUNOPo->op_first->op_type == OP_NULL);
1374 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1377 else { /* lvalue subroutine call */
1378 o->op_private |= OPpLVAL_INTRO;
1379 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1380 /* Backward compatibility mode: */
1381 o->op_private |= OPpENTERSUB_INARGS;
1384 else { /* Compile-time error message: */
1385 OP *kid = cUNOPo->op_first;
1389 if (kid->op_type == OP_PUSHMARK)
1391 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1393 "panic: unexpected lvalue entersub "
1394 "args: type/targ %ld:%ld",
1395 (long)kid->op_type,kid->op_targ);
1396 kid = kLISTOP->op_first;
1398 while (kid->op_sibling)
1399 kid = kid->op_sibling;
1400 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1402 if (kid->op_type == OP_METHOD_NAMED
1403 || kid->op_type == OP_METHOD)
1407 if (kid->op_sibling || kid->op_next != kid) {
1408 yyerror("panic: unexpected optree near method call");
1412 NewOp(1101, newop, 1, UNOP);
1413 newop->op_type = OP_RV2CV;
1414 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1415 newop->op_first = Nullop;
1416 newop->op_next = (OP*)newop;
1417 kid->op_sibling = (OP*)newop;
1418 newop->op_private |= OPpLVAL_INTRO;
1422 if (kid->op_type != OP_RV2CV)
1424 "panic: unexpected lvalue entersub "
1425 "entry via type/targ %ld:%ld",
1426 (long)kid->op_type,kid->op_targ);
1427 kid->op_private |= OPpLVAL_INTRO;
1428 break; /* Postpone until runtime */
1432 kid = kUNOP->op_first;
1433 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1434 kid = kUNOP->op_first;
1435 if (kid->op_type == OP_NULL)
1437 "Unexpected constant lvalue entersub "
1438 "entry via type/targ %ld:%ld",
1439 (long)kid->op_type,kid->op_targ);
1440 if (kid->op_type != OP_GV) {
1441 /* Restore RV2CV to check lvalueness */
1443 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1444 okid->op_next = kid->op_next;
1445 kid->op_next = okid;
1448 okid->op_next = Nullop;
1449 okid->op_type = OP_RV2CV;
1451 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1452 okid->op_private |= OPpLVAL_INTRO;
1456 cv = GvCV(kGVOP_gv);
1466 /* grep, foreach, subcalls, refgen */
1467 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1469 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1470 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1472 : (o->op_type == OP_ENTERSUB
1473 ? "non-lvalue subroutine call"
1474 : PL_op_desc[o->op_type])),
1475 type ? PL_op_desc[type] : "local"));
1489 case OP_RIGHT_SHIFT:
1498 if (!(o->op_flags & OPf_STACKED))
1504 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1510 if (!type && cUNOPo->op_first->op_type != OP_GV)
1511 Perl_croak(aTHX_ "Can't localize through a reference");
1512 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1513 PL_modcount = 10000;
1514 return o; /* Treat \(@foo) like ordinary list. */
1518 if (scalar_mod_type(o, type))
1520 ref(cUNOPo->op_first, o->op_type);
1529 PL_modcount = 10000;
1532 if (!type && cUNOPo->op_first->op_type != OP_GV)
1533 Perl_croak(aTHX_ "Can't localize through a reference");
1534 ref(cUNOPo->op_first, o->op_type);
1538 PL_hints |= HINT_BLOCK_SCOPE;
1548 PL_modcount = 10000;
1549 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1550 return o; /* Treat \(@foo) like ordinary list. */
1551 if (scalar_mod_type(o, type))
1557 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1558 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1563 PL_modcount++; /* XXX ??? */
1565 #endif /* USE_THREADS */
1571 if (type != OP_SASSIGN)
1575 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1581 pad_free(o->op_targ);
1582 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1583 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1584 if (o->op_flags & OPf_KIDS)
1585 mod(cBINOPo->op_first->op_sibling, type);
1590 ref(cBINOPo->op_first, o->op_type);
1591 if (type == OP_ENTERSUB &&
1592 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1593 o->op_private |= OPpLVAL_DEFER;
1600 if (o->op_flags & OPf_KIDS)
1601 mod(cLISTOPo->op_last, type);
1605 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1607 else if (!(o->op_flags & OPf_KIDS))
1609 if (o->op_targ != OP_LIST) {
1610 mod(cBINOPo->op_first, type);
1615 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1619 o->op_flags |= OPf_MOD;
1621 if (type == OP_AASSIGN || type == OP_SASSIGN)
1622 o->op_flags |= OPf_SPECIAL|OPf_REF;
1624 o->op_private |= OPpLVAL_INTRO;
1625 o->op_flags &= ~OPf_SPECIAL;
1626 PL_hints |= HINT_BLOCK_SCOPE;
1628 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1629 o->op_flags |= OPf_REF;
1634 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1638 if (o->op_type == OP_RV2GV)
1662 case OP_RIGHT_SHIFT:
1681 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1683 switch (o->op_type) {
1691 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1704 Perl_refkids(pTHX_ OP *o, I32 type)
1707 if (o && o->op_flags & OPf_KIDS) {
1708 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1715 Perl_ref(pTHX_ OP *o, I32 type)
1719 if (!o || PL_error_count)
1722 switch (o->op_type) {
1724 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1725 !(o->op_flags & OPf_STACKED)) {
1726 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1727 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1728 assert(cUNOPo->op_first->op_type == OP_NULL);
1729 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1730 o->op_flags |= OPf_SPECIAL;
1735 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1739 if (type == OP_DEFINED)
1740 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1741 ref(cUNOPo->op_first, o->op_type);
1744 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1745 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1746 : type == OP_RV2HV ? OPpDEREF_HV
1748 o->op_flags |= OPf_MOD;
1753 o->op_flags |= OPf_MOD; /* XXX ??? */
1758 o->op_flags |= OPf_REF;
1761 if (type == OP_DEFINED)
1762 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1763 ref(cUNOPo->op_first, o->op_type);
1768 o->op_flags |= OPf_REF;
1773 if (!(o->op_flags & OPf_KIDS))
1775 ref(cBINOPo->op_first, type);
1779 ref(cBINOPo->op_first, o->op_type);
1780 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1781 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1782 : type == OP_RV2HV ? OPpDEREF_HV
1784 o->op_flags |= OPf_MOD;
1792 if (!(o->op_flags & OPf_KIDS))
1794 ref(cLISTOPo->op_last, type);
1804 S_dup_attrlist(pTHX_ OP *o)
1808 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1809 * where the first kid is OP_PUSHMARK and the remaining ones
1810 * are OP_CONST. We need to push the OP_CONST values.
1812 if (o->op_type == OP_CONST)
1813 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1815 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1816 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1817 if (o->op_type == OP_CONST)
1818 rop = append_elem(OP_LIST, rop,
1819 newSVOP(OP_CONST, o->op_flags,
1820 SvREFCNT_inc(cSVOPo->op_sv)));
1827 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1831 /* fake up C<use attributes $pkg,$rv,@attrs> */
1832 ENTER; /* need to protect against side-effects of 'use' */
1834 if (stash && HvNAME(stash))
1835 stashsv = newSVpv(HvNAME(stash), 0);
1837 stashsv = &PL_sv_no;
1839 #define ATTRSMODULE "attributes"
1841 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1842 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1844 prepend_elem(OP_LIST,
1845 newSVOP(OP_CONST, 0, stashsv),
1846 prepend_elem(OP_LIST,
1847 newSVOP(OP_CONST, 0,
1849 dup_attrlist(attrs))));
1854 S_my_kid(pTHX_ OP *o, OP *attrs)
1859 if (!o || PL_error_count)
1863 if (type == OP_LIST) {
1864 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1866 } else if (type == OP_UNDEF) {
1868 } else if (type == OP_RV2SV || /* "our" declaration */
1870 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1871 o->op_private |= OPpOUR_INTRO;
1873 } else if (type != OP_PADSV &&
1876 type != OP_PUSHMARK)
1878 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1879 PL_op_desc[o->op_type],
1880 PL_in_my == KEY_our ? "our" : "my"));
1883 else if (attrs && type != OP_PUSHMARK) {
1889 PL_in_my_stash = Nullhv;
1891 /* check for C<my Dog $spot> when deciding package */
1892 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1893 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1894 stash = SvSTASH(*namesvp);
1896 stash = PL_curstash;
1897 padsv = PAD_SV(o->op_targ);
1898 apply_attrs(stash, padsv, attrs);
1900 o->op_flags |= OPf_MOD;
1901 o->op_private |= OPpLVAL_INTRO;
1906 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1908 if (o->op_flags & OPf_PARENS)
1912 o = my_kid(o, attrs);
1914 PL_in_my_stash = Nullhv;
1919 Perl_my(pTHX_ OP *o)
1921 return my_kid(o, Nullop);
1925 Perl_sawparens(pTHX_ OP *o)
1928 o->op_flags |= OPf_PARENS;
1933 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1938 if (ckWARN(WARN_MISC) &&
1939 (left->op_type == OP_RV2AV ||
1940 left->op_type == OP_RV2HV ||
1941 left->op_type == OP_PADAV ||
1942 left->op_type == OP_PADHV)) {
1943 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1944 right->op_type == OP_TRANS)
1945 ? right->op_type : OP_MATCH];
1946 const char *sample = ((left->op_type == OP_RV2AV ||
1947 left->op_type == OP_PADAV)
1948 ? "@array" : "%hash");
1949 Perl_warner(aTHX_ WARN_MISC,
1950 "Applying %s to %s will act on scalar(%s)",
1951 desc, sample, sample);
1954 if (right->op_type == OP_MATCH ||
1955 right->op_type == OP_SUBST ||
1956 right->op_type == OP_TRANS) {
1957 right->op_flags |= OPf_STACKED;
1958 if (right->op_type != OP_MATCH)
1959 left = mod(left, right->op_type);
1960 if (right->op_type == OP_TRANS)
1961 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1963 o = prepend_elem(right->op_type, scalar(left), right);
1965 return newUNOP(OP_NOT, 0, scalar(o));
1969 return bind_match(type, left,
1970 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1974 Perl_invert(pTHX_ OP *o)
1978 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1979 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1983 Perl_scope(pTHX_ OP *o)
1986 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1987 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1988 o->op_type = OP_LEAVE;
1989 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1992 if (o->op_type == OP_LINESEQ) {
1994 o->op_type = OP_SCOPE;
1995 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1996 kid = ((LISTOP*)o)->op_first;
1997 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2001 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
2008 Perl_save_hints(pTHX)
2011 SAVESPTR(GvHV(PL_hintgv));
2012 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
2013 SAVEFREESV(GvHV(PL_hintgv));
2017 Perl_block_start(pTHX_ int full)
2020 int retval = PL_savestack_ix;
2022 SAVEI32(PL_comppad_name_floor);
2023 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
2025 PL_comppad_name_fill = PL_comppad_name_floor;
2026 if (PL_comppad_name_floor < 0)
2027 PL_comppad_name_floor = 0;
2028 SAVEI32(PL_min_intro_pending);
2029 SAVEI32(PL_max_intro_pending);
2030 PL_min_intro_pending = 0;
2031 SAVEI32(PL_comppad_name_fill);
2032 SAVEI32(PL_padix_floor);
2033 PL_padix_floor = PL_padix;
2034 PL_pad_reset_pending = FALSE;
2036 PL_hints &= ~HINT_BLOCK_SCOPE;
2037 SAVESPTR(PL_compiling.cop_warnings);
2038 if (! specialWARN(PL_compiling.cop_warnings)) {
2039 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2040 SAVEFREESV(PL_compiling.cop_warnings) ;
2046 Perl_block_end(pTHX_ I32 floor, OP *seq)
2049 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2050 OP* retval = scalarseq(seq);
2052 PL_pad_reset_pending = FALSE;
2053 PL_compiling.op_private = PL_hints;
2055 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2056 pad_leavemy(PL_comppad_name_fill);
2065 OP *o = newOP(OP_THREADSV, 0);
2066 o->op_targ = find_threadsv("_");
2069 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2070 #endif /* USE_THREADS */
2074 Perl_newPROG(pTHX_ OP *o)
2080 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2081 ((PL_in_eval & EVAL_KEEPERR)
2082 ? OPf_SPECIAL : 0), o);
2083 PL_eval_start = linklist(PL_eval_root);
2084 PL_eval_root->op_private |= OPpREFCOUNTED;
2085 OpREFCNT_set(PL_eval_root, 1);
2086 PL_eval_root->op_next = 0;
2087 peep(PL_eval_start);
2092 PL_main_root = scope(sawparens(scalarvoid(o)));
2093 PL_curcop = &PL_compiling;
2094 PL_main_start = LINKLIST(PL_main_root);
2095 PL_main_root->op_private |= OPpREFCOUNTED;
2096 OpREFCNT_set(PL_main_root, 1);
2097 PL_main_root->op_next = 0;
2098 peep(PL_main_start);
2101 /* Register with debugger */
2103 CV *cv = get_cv("DB::postponed", FALSE);
2107 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2109 call_sv((SV*)cv, G_DISCARD);
2116 Perl_localize(pTHX_ OP *o, I32 lex)
2118 if (o->op_flags & OPf_PARENS)
2122 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2124 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2125 if (*s == ';' || *s == '=')
2126 Perl_warner(aTHX_ WARN_PARENTHESIS,
2127 "Parentheses missing around \"%s\" list",
2128 lex ? (PL_in_my == KEY_our ? "our" : "my") : "local");
2134 o = mod(o, OP_NULL); /* a bit kludgey */
2136 PL_in_my_stash = Nullhv;
2141 Perl_jmaybe(pTHX_ OP *o)
2143 if (o->op_type == OP_LIST) {
2146 o2 = newOP(OP_THREADSV, 0);
2147 o2->op_targ = find_threadsv(";");
2149 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2150 #endif /* USE_THREADS */
2151 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2157 Perl_fold_constants(pTHX_ register OP *o)
2161 I32 type = o->op_type;
2164 if (PL_opargs[type] & OA_RETSCALAR)
2166 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2167 o->op_targ = pad_alloc(type, SVs_PADTMP);
2169 /* integerize op, unless it happens to be C<-foo>.
2170 * XXX should pp_i_negate() do magic string negation instead? */
2171 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2172 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2173 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2175 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2178 if (!(PL_opargs[type] & OA_FOLDCONST))
2183 /* XXX might want a ck_negate() for this */
2184 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2197 if (o->op_private & OPpLOCALE)
2202 goto nope; /* Don't try to run w/ errors */
2204 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2205 if ((curop->op_type != OP_CONST ||
2206 (curop->op_private & OPpCONST_BARE)) &&
2207 curop->op_type != OP_LIST &&
2208 curop->op_type != OP_SCALAR &&
2209 curop->op_type != OP_NULL &&
2210 curop->op_type != OP_PUSHMARK)
2216 curop = LINKLIST(o);
2220 sv = *(PL_stack_sp--);
2221 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2222 pad_swipe(o->op_targ);
2223 else if (SvTEMP(sv)) { /* grab mortal temp? */
2224 (void)SvREFCNT_inc(sv);
2228 if (type == OP_RV2GV)
2229 return newGVOP(OP_GV, 0, (GV*)sv);
2231 /* try to smush double to int, but don't smush -2.0 to -2 */
2232 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2236 if ((NV)iv == SvNV(sv)) {
2241 SvIOK_off(sv); /* undo SvIV() damage */
2243 return newSVOP(OP_CONST, 0, sv);
2247 if (!(PL_opargs[type] & OA_OTHERINT))
2250 if (!(PL_hints & HINT_INTEGER)) {
2251 if (type == OP_MODULO
2252 || type == OP_DIVIDE
2253 || !(o->op_flags & OPf_KIDS))
2258 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2259 if (curop->op_type == OP_CONST) {
2260 if (SvIOK(((SVOP*)curop)->op_sv))
2264 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2268 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2275 Perl_gen_constant_list(pTHX_ register OP *o)
2279 I32 oldtmps_floor = PL_tmps_floor;
2283 return o; /* Don't attempt to run with errors */
2285 PL_op = curop = LINKLIST(o);
2292 PL_tmps_floor = oldtmps_floor;
2294 o->op_type = OP_RV2AV;
2295 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2296 curop = ((UNOP*)o)->op_first;
2297 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2304 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2309 if (!o || o->op_type != OP_LIST)
2310 o = newLISTOP(OP_LIST, 0, o, Nullop);
2312 o->op_flags &= ~OPf_WANT;
2314 if (!(PL_opargs[type] & OA_MARK))
2315 null(cLISTOPo->op_first);
2318 o->op_ppaddr = PL_ppaddr[type];
2319 o->op_flags |= flags;
2321 o = CHECKOP(type, o);
2322 if (o->op_type != type)
2325 if (cLISTOPo->op_children < 7) {
2326 /* XXX do we really need to do this if we're done appending?? */
2327 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2329 cLISTOPo->op_last = last; /* in case check substituted last arg */
2332 return fold_constants(o);
2335 /* List constructors */
2338 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2346 if (first->op_type != type
2347 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2349 return newLISTOP(type, 0, first, last);
2352 if (first->op_flags & OPf_KIDS)
2353 ((LISTOP*)first)->op_last->op_sibling = last;
2355 first->op_flags |= OPf_KIDS;
2356 ((LISTOP*)first)->op_first = last;
2358 ((LISTOP*)first)->op_last = last;
2359 ((LISTOP*)first)->op_children++;
2364 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2372 if (first->op_type != type)
2373 return prepend_elem(type, (OP*)first, (OP*)last);
2375 if (last->op_type != type)
2376 return append_elem(type, (OP*)first, (OP*)last);
2378 first->op_last->op_sibling = last->op_first;
2379 first->op_last = last->op_last;
2380 first->op_children += last->op_children;
2381 if (first->op_children)
2382 first->op_flags |= OPf_KIDS;
2384 #ifdef PL_OP_SLAB_ALLOC
2392 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2400 if (last->op_type == type) {
2401 if (type == OP_LIST) { /* already a PUSHMARK there */
2402 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2403 ((LISTOP*)last)->op_first->op_sibling = first;
2406 if (!(last->op_flags & OPf_KIDS)) {
2407 ((LISTOP*)last)->op_last = first;
2408 last->op_flags |= OPf_KIDS;
2410 first->op_sibling = ((LISTOP*)last)->op_first;
2411 ((LISTOP*)last)->op_first = first;
2413 ((LISTOP*)last)->op_children++;
2417 return newLISTOP(type, 0, first, last);
2423 Perl_newNULLLIST(pTHX)
2425 return newOP(OP_STUB, 0);
2429 Perl_force_list(pTHX_ OP *o)
2431 if (!o || o->op_type != OP_LIST)
2432 o = newLISTOP(OP_LIST, 0, o, Nullop);
2438 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2442 NewOp(1101, listop, 1, LISTOP);
2444 listop->op_type = type;
2445 listop->op_ppaddr = PL_ppaddr[type];
2446 listop->op_children = (first != 0) + (last != 0);
2447 listop->op_flags = flags;
2451 else if (!first && last)
2454 first->op_sibling = last;
2455 listop->op_first = first;
2456 listop->op_last = last;
2457 if (type == OP_LIST) {
2459 pushop = newOP(OP_PUSHMARK, 0);
2460 pushop->op_sibling = first;
2461 listop->op_first = pushop;
2462 listop->op_flags |= OPf_KIDS;
2464 listop->op_last = pushop;
2466 else if (listop->op_children)
2467 listop->op_flags |= OPf_KIDS;
2473 Perl_newOP(pTHX_ I32 type, I32 flags)
2476 NewOp(1101, o, 1, OP);
2478 o->op_ppaddr = PL_ppaddr[type];
2479 o->op_flags = flags;
2482 o->op_private = 0 + (flags >> 8);
2483 if (PL_opargs[type] & OA_RETSCALAR)
2485 if (PL_opargs[type] & OA_TARGET)
2486 o->op_targ = pad_alloc(type, SVs_PADTMP);
2487 return CHECKOP(type, o);
2491 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2496 first = newOP(OP_STUB, 0);
2497 if (PL_opargs[type] & OA_MARK)
2498 first = force_list(first);
2500 NewOp(1101, unop, 1, UNOP);
2501 unop->op_type = type;
2502 unop->op_ppaddr = PL_ppaddr[type];
2503 unop->op_first = first;
2504 unop->op_flags = flags | OPf_KIDS;
2505 unop->op_private = 1 | (flags >> 8);
2506 unop = (UNOP*) CHECKOP(type, unop);
2510 return fold_constants((OP *) unop);
2514 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2517 NewOp(1101, binop, 1, BINOP);
2520 first = newOP(OP_NULL, 0);
2522 binop->op_type = type;
2523 binop->op_ppaddr = PL_ppaddr[type];
2524 binop->op_first = first;
2525 binop->op_flags = flags | OPf_KIDS;
2528 binop->op_private = 1 | (flags >> 8);
2531 binop->op_private = 2 | (flags >> 8);
2532 first->op_sibling = last;
2535 binop = (BINOP*)CHECKOP(type, binop);
2536 if (binop->op_next || binop->op_type != type)
2539 binop->op_last = binop->op_first->op_sibling;
2541 return fold_constants((OP *)binop);
2545 utf8compare(const void *a, const void *b)
2548 for (i = 0; i < 10; i++) {
2549 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2551 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2558 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2560 SV *tstr = ((SVOP*)expr)->op_sv;
2561 SV *rstr = ((SVOP*)repl)->op_sv;
2564 register U8 *t = (U8*)SvPV(tstr, tlen);
2565 register U8 *r = (U8*)SvPV(rstr, rlen);
2571 register short *tbl;
2573 complement = o->op_private & OPpTRANS_COMPLEMENT;
2574 del = o->op_private & OPpTRANS_DELETE;
2575 squash = o->op_private & OPpTRANS_SQUASH;
2577 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2578 SV* listsv = newSVpvn("# comment\n",10);
2580 U8* tend = t + tlen;
2581 U8* rend = r + rlen;
2596 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2597 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2600 U8 tmpbuf[UTF8_MAXLEN];
2603 New(1109, cp, tlen, U8*);
2605 transv = newSVpvn("",0);
2614 qsort(cp, i, sizeof(U8*), utf8compare);
2615 for (j = 0; j < i; j++) {
2617 UV val = utf8_to_uv(s, &ulen);
2619 diff = val - nextmin;
2621 t = uv_to_utf8(tmpbuf,nextmin);
2622 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2624 t = uv_to_utf8(tmpbuf, val - 1);
2625 sv_catpvn(transv, "\377", 1);
2626 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2630 val = utf8_to_uv(s+1, &ulen);
2634 t = uv_to_utf8(tmpbuf,nextmin);
2635 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2636 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2637 sv_catpvn(transv, "\377", 1);
2638 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2639 t = (U8*)SvPVX(transv);
2640 tlen = SvCUR(transv);
2643 else if (!rlen && !del) {
2644 r = t; rlen = tlen; rend = tend;
2647 if (to_utf && from_utf) { /* only counting characters */
2648 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2649 o->op_private |= OPpTRANS_IDENTICAL;
2651 else { /* straight latin-1 translation */
2652 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2653 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2654 o->op_private |= OPpTRANS_IDENTICAL;
2658 while (t < tend || tfirst <= tlast) {
2659 /* see if we need more "t" chars */
2660 if (tfirst > tlast) {
2661 tfirst = (I32)utf8_to_uv(t, &ulen);
2663 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2664 tlast = (I32)utf8_to_uv(++t, &ulen);
2671 /* now see if we need more "r" chars */
2672 if (rfirst > rlast) {
2674 rfirst = (I32)utf8_to_uv(r, &ulen);
2676 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2677 rlast = (I32)utf8_to_uv(++r, &ulen);
2686 rfirst = rlast = 0xffffffff;
2690 /* now see which range will peter our first, if either. */
2691 tdiff = tlast - tfirst;
2692 rdiff = rlast - rfirst;
2699 if (rfirst == 0xffffffff) {
2700 diff = tdiff; /* oops, pretend rdiff is infinite */
2702 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2703 (long)tfirst, (long)tlast);
2705 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2709 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2710 (long)tfirst, (long)(tfirst + diff),
2713 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2714 (long)tfirst, (long)rfirst);
2716 if (rfirst + diff > max)
2717 max = rfirst + diff;
2722 else if (rfirst <= 0x800)
2723 grows |= (tfirst < 0x80);
2724 else if (rfirst <= 0x10000)
2725 grows |= (tfirst < 0x800);
2726 else if (rfirst <= 0x200000)
2727 grows |= (tfirst < 0x10000);
2728 else if (rfirst <= 0x4000000)
2729 grows |= (tfirst < 0x200000);
2730 else if (rfirst <= 0x80000000)
2731 grows |= (tfirst < 0x4000000);
2743 else if (max > 0xff)
2748 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2749 SvREFCNT_dec(listsv);
2751 SvREFCNT_dec(transv);
2753 if (!del && havefinal)
2754 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
2755 newSVuv((UV)final), 0);
2757 if (grows && to_utf)
2758 o->op_private |= OPpTRANS_GROWS;
2765 tbl = (short*)cPVOPo->op_pv;
2767 Zero(tbl, 256, short);
2768 for (i = 0; i < tlen; i++)
2770 for (i = 0, j = 0; i < 256; i++) {
2786 if (!rlen && !del) {
2789 o->op_private |= OPpTRANS_IDENTICAL;
2791 for (i = 0; i < 256; i++)
2793 for (i = 0, j = 0; i < tlen; i++,j++) {
2796 if (tbl[t[i]] == -1)
2802 if (tbl[t[i]] == -1)
2813 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2818 NewOp(1101, pmop, 1, PMOP);
2819 pmop->op_type = type;
2820 pmop->op_ppaddr = PL_ppaddr[type];
2821 pmop->op_flags = flags;
2822 pmop->op_private = 0 | (flags >> 8);
2824 if (PL_hints & HINT_RE_TAINT)
2825 pmop->op_pmpermflags |= PMf_RETAINT;
2826 if (PL_hints & HINT_LOCALE)
2827 pmop->op_pmpermflags |= PMf_LOCALE;
2828 pmop->op_pmflags = pmop->op_pmpermflags;
2830 /* link into pm list */
2831 if (type != OP_TRANS && PL_curstash) {
2832 pmop->op_pmnext = HvPMROOT(PL_curstash);
2833 HvPMROOT(PL_curstash) = pmop;
2840 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2845 I32 repl_has_vars = 0;
2847 if (o->op_type == OP_TRANS)
2848 return pmtrans(o, expr, repl);
2850 PL_hints |= HINT_BLOCK_SCOPE;
2853 if (expr->op_type == OP_CONST) {
2855 SV *pat = ((SVOP*)expr)->op_sv;
2856 char *p = SvPV(pat, plen);
2857 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2858 sv_setpvn(pat, "\\s+", 3);
2859 p = SvPV(pat, plen);
2860 pm->op_pmflags |= PMf_SKIPWHITE;
2862 if ((PL_hints & HINT_UTF8) || (SvUTF8(pat) && !(PL_hints & HINT_BYTE)))
2863 pm->op_pmdynflags |= PMdf_UTF8;
2864 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2865 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2866 pm->op_pmflags |= PMf_WHITE;
2870 if (PL_hints & HINT_UTF8)
2871 pm->op_pmdynflags |= PMdf_UTF8;
2872 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2873 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2875 : OP_REGCMAYBE),0,expr);
2877 NewOp(1101, rcop, 1, LOGOP);
2878 rcop->op_type = OP_REGCOMP;
2879 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2880 rcop->op_first = scalar(expr);
2881 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2882 ? (OPf_SPECIAL | OPf_KIDS)
2884 rcop->op_private = 1;
2887 /* establish postfix order */
2888 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2890 rcop->op_next = expr;
2891 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2894 rcop->op_next = LINKLIST(expr);
2895 expr->op_next = (OP*)rcop;
2898 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2903 if (pm->op_pmflags & PMf_EVAL) {
2905 if (CopLINE(PL_curcop) < PL_multi_end)
2906 CopLINE_set(PL_curcop, PL_multi_end);
2909 else if (repl->op_type == OP_THREADSV
2910 && strchr("&`'123456789+",
2911 PL_threadsv_names[repl->op_targ]))
2915 #endif /* USE_THREADS */
2916 else if (repl->op_type == OP_CONST)
2920 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2921 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2923 if (curop->op_type == OP_THREADSV) {
2925 if (strchr("&`'123456789+", curop->op_private))
2929 if (curop->op_type == OP_GV) {
2930 GV *gv = cGVOPx_gv(curop);
2932 if (strchr("&`'123456789+", *GvENAME(gv)))
2935 #endif /* USE_THREADS */
2936 else if (curop->op_type == OP_RV2CV)
2938 else if (curop->op_type == OP_RV2SV ||
2939 curop->op_type == OP_RV2AV ||
2940 curop->op_type == OP_RV2HV ||
2941 curop->op_type == OP_RV2GV) {
2942 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2945 else if (curop->op_type == OP_PADSV ||
2946 curop->op_type == OP_PADAV ||
2947 curop->op_type == OP_PADHV ||
2948 curop->op_type == OP_PADANY) {
2951 else if (curop->op_type == OP_PUSHRE)
2952 ; /* Okay here, dangerous in newASSIGNOP */
2961 && (!pm->op_pmregexp
2962 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2963 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2964 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2965 prepend_elem(o->op_type, scalar(repl), o);
2968 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2969 pm->op_pmflags |= PMf_MAYBE_CONST;
2970 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2972 NewOp(1101, rcop, 1, LOGOP);
2973 rcop->op_type = OP_SUBSTCONT;
2974 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2975 rcop->op_first = scalar(repl);
2976 rcop->op_flags |= OPf_KIDS;
2977 rcop->op_private = 1;
2980 /* establish postfix order */
2981 rcop->op_next = LINKLIST(repl);
2982 repl->op_next = (OP*)rcop;
2984 pm->op_pmreplroot = scalar((OP*)rcop);
2985 pm->op_pmreplstart = LINKLIST(rcop);
2994 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2997 NewOp(1101, svop, 1, SVOP);
2998 svop->op_type = type;
2999 svop->op_ppaddr = PL_ppaddr[type];
3001 svop->op_next = (OP*)svop;
3002 svop->op_flags = flags;
3003 if (PL_opargs[type] & OA_RETSCALAR)
3005 if (PL_opargs[type] & OA_TARGET)
3006 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3007 return CHECKOP(type, svop);
3011 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3014 NewOp(1101, padop, 1, PADOP);
3015 padop->op_type = type;
3016 padop->op_ppaddr = PL_ppaddr[type];
3017 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3018 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3019 PL_curpad[padop->op_padix] = sv;
3021 padop->op_next = (OP*)padop;
3022 padop->op_flags = flags;
3023 if (PL_opargs[type] & OA_RETSCALAR)
3025 if (PL_opargs[type] & OA_TARGET)
3026 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3027 return CHECKOP(type, padop);
3031 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3036 return newPADOP(type, flags, SvREFCNT_inc(gv));
3038 return newSVOP(type, flags, SvREFCNT_inc(gv));
3043 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3046 NewOp(1101, pvop, 1, PVOP);
3047 pvop->op_type = type;
3048 pvop->op_ppaddr = PL_ppaddr[type];
3050 pvop->op_next = (OP*)pvop;
3051 pvop->op_flags = flags;
3052 if (PL_opargs[type] & OA_RETSCALAR)
3054 if (PL_opargs[type] & OA_TARGET)
3055 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3056 return CHECKOP(type, pvop);
3060 Perl_package(pTHX_ OP *o)
3065 save_hptr(&PL_curstash);
3066 save_item(PL_curstname);
3071 name = SvPV(sv, len);
3072 PL_curstash = gv_stashpvn(name,len,TRUE);
3073 sv_setpvn(PL_curstname, name, len);
3077 sv_setpv(PL_curstname,"<none>");
3078 PL_curstash = Nullhv;
3080 PL_hints |= HINT_BLOCK_SCOPE;
3081 PL_copline = NOLINE;
3086 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3094 if (id->op_type != OP_CONST)
3095 Perl_croak(aTHX_ "Module name must be constant");
3099 if (version != Nullop) {
3100 SV *vesv = ((SVOP*)version)->op_sv;
3102 if (arg == Nullop && !SvNIOKp(vesv)) {
3109 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3110 Perl_croak(aTHX_ "Version number must be constant number");
3112 /* Make copy of id so we don't free it twice */
3113 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3115 /* Fake up a method call to VERSION */
3116 meth = newSVpvn("VERSION",7);
3117 sv_upgrade(meth, SVt_PVIV);
3118 (void)SvIOK_on(meth);
3119 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3120 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3121 append_elem(OP_LIST,
3122 prepend_elem(OP_LIST, pack, list(version)),
3123 newSVOP(OP_METHOD_NAMED, 0, meth)));
3127 /* Fake up an import/unimport */
3128 if (arg && arg->op_type == OP_STUB)
3129 imop = arg; /* no import on explicit () */
3130 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3131 imop = Nullop; /* use 5.0; */
3136 /* Make copy of id so we don't free it twice */
3137 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3139 /* Fake up a method call to import/unimport */
3140 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);;
3141 sv_upgrade(meth, SVt_PVIV);
3142 (void)SvIOK_on(meth);
3143 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3144 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3145 append_elem(OP_LIST,
3146 prepend_elem(OP_LIST, pack, list(arg)),
3147 newSVOP(OP_METHOD_NAMED, 0, meth)));
3150 /* Fake up a require, handle override, if any */
3151 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3152 if (!(gv && GvIMPORTED_CV(gv)))
3153 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3155 if (gv && GvIMPORTED_CV(gv)) {
3156 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3157 append_elem(OP_LIST, id,
3158 scalar(newUNOP(OP_RV2CV, 0,
3163 rqop = newUNOP(OP_REQUIRE, 0, id);
3166 /* Fake up the BEGIN {}, which does its thing immediately. */
3168 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3171 append_elem(OP_LINESEQ,
3172 append_elem(OP_LINESEQ,
3173 newSTATEOP(0, Nullch, rqop),
3174 newSTATEOP(0, Nullch, veop)),
3175 newSTATEOP(0, Nullch, imop) ));
3177 PL_hints |= HINT_BLOCK_SCOPE;
3178 PL_copline = NOLINE;
3183 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3186 va_start(args, ver);
3187 vload_module(flags, name, ver, &args);
3191 #ifdef PERL_IMPLICIT_CONTEXT
3193 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3197 va_start(args, ver);
3198 vload_module(flags, name, ver, &args);
3204 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3206 OP *modname, *veop, *imop;
3208 modname = newSVOP(OP_CONST, 0, name);
3209 modname->op_private |= OPpCONST_BARE;
3211 veop = newSVOP(OP_CONST, 0, ver);
3215 if (flags & PERL_LOADMOD_NOIMPORT) {
3216 imop = sawparens(newNULLLIST());
3218 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3219 imop = va_arg(*args, OP*);
3224 sv = va_arg(*args, SV*);
3226 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3227 sv = va_arg(*args, SV*);
3231 line_t ocopline = PL_copline;
3232 int oexpect = PL_expect;
3234 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3235 veop, modname, imop);
3236 PL_expect = oexpect;
3237 PL_copline = ocopline;
3242 Perl_dofile(pTHX_ OP *term)
3247 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3248 if (!(gv && GvIMPORTED_CV(gv)))
3249 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3251 if (gv && GvIMPORTED_CV(gv)) {
3252 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3253 append_elem(OP_LIST, term,
3254 scalar(newUNOP(OP_RV2CV, 0,
3259 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3265 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3267 return newBINOP(OP_LSLICE, flags,
3268 list(force_list(subscript)),
3269 list(force_list(listval)) );
3273 S_list_assignment(pTHX_ register OP *o)
3278 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3279 o = cUNOPo->op_first;
3281 if (o->op_type == OP_COND_EXPR) {
3282 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3283 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3288 yyerror("Assignment to both a list and a scalar");
3292 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3293 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3294 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3297 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3300 if (o->op_type == OP_RV2SV)
3307 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3312 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3313 return newLOGOP(optype, 0,
3314 mod(scalar(left), optype),
3315 newUNOP(OP_SASSIGN, 0, scalar(right)));
3318 return newBINOP(optype, OPf_STACKED,
3319 mod(scalar(left), optype), scalar(right));
3323 if (list_assignment(left)) {
3328 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3329 left = mod(left, OP_AASSIGN);
3337 curop = list(force_list(left));
3338 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3339 o->op_private = 0 | (flags >> 8);
3340 for (curop = ((LISTOP*)curop)->op_first;
3341 curop; curop = curop->op_sibling)
3343 if (curop->op_type == OP_RV2HV &&
3344 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3345 o->op_private |= OPpASSIGN_HASH;
3349 if (!(left->op_private & OPpLVAL_INTRO)) {
3352 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3353 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3354 if (curop->op_type == OP_GV) {
3355 GV *gv = cGVOPx_gv(curop);
3356 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3358 SvCUR(gv) = PL_generation;
3360 else if (curop->op_type == OP_PADSV ||
3361 curop->op_type == OP_PADAV ||
3362 curop->op_type == OP_PADHV ||
3363 curop->op_type == OP_PADANY) {
3364 SV **svp = AvARRAY(PL_comppad_name);
3365 SV *sv = svp[curop->op_targ];
3366 if (SvCUR(sv) == PL_generation)
3368 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3370 else if (curop->op_type == OP_RV2CV)
3372 else if (curop->op_type == OP_RV2SV ||
3373 curop->op_type == OP_RV2AV ||
3374 curop->op_type == OP_RV2HV ||
3375 curop->op_type == OP_RV2GV) {
3376 if (lastop->op_type != OP_GV) /* funny deref? */
3379 else if (curop->op_type == OP_PUSHRE) {
3380 if (((PMOP*)curop)->op_pmreplroot) {
3381 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3382 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3384 SvCUR(gv) = PL_generation;
3393 o->op_private |= OPpASSIGN_COMMON;
3395 if (right && right->op_type == OP_SPLIT) {
3397 if ((tmpop = ((LISTOP*)right)->op_first) &&
3398 tmpop->op_type == OP_PUSHRE)
3400 PMOP *pm = (PMOP*)tmpop;
3401 if (left->op_type == OP_RV2AV &&
3402 !(left->op_private & OPpLVAL_INTRO) &&
3403 !(o->op_private & OPpASSIGN_COMMON) )
3405 tmpop = ((UNOP*)left)->op_first;
3406 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3408 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3409 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3411 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3412 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3414 pm->op_pmflags |= PMf_ONCE;
3415 tmpop = cUNOPo->op_first; /* to list (nulled) */
3416 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3417 tmpop->op_sibling = Nullop; /* don't free split */
3418 right->op_next = tmpop->op_next; /* fix starting loc */
3419 op_free(o); /* blow off assign */
3420 right->op_flags &= ~OPf_WANT;
3421 /* "I don't know and I don't care." */
3426 if (PL_modcount < 10000 &&
3427 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3429 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3431 sv_setiv(sv, PL_modcount+1);
3439 right = newOP(OP_UNDEF, 0);
3440 if (right->op_type == OP_READLINE) {
3441 right->op_flags |= OPf_STACKED;
3442 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3445 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3446 o = newBINOP(OP_SASSIGN, flags,
3447 scalar(right), mod(scalar(left), OP_SASSIGN) );
3459 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3462 U32 seq = intro_my();
3465 NewOp(1101, cop, 1, COP);
3466 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3467 cop->op_type = OP_DBSTATE;
3468 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3471 cop->op_type = OP_NEXTSTATE;
3472 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3474 cop->op_flags = flags;
3475 cop->op_private = (PL_hints & HINT_BYTE);
3477 cop->op_private |= NATIVE_HINTS;
3479 PL_compiling.op_private = cop->op_private;
3480 cop->op_next = (OP*)cop;
3483 cop->cop_label = label;
3484 PL_hints |= HINT_BLOCK_SCOPE;
3487 cop->cop_arybase = PL_curcop->cop_arybase;
3488 if (specialWARN(PL_curcop->cop_warnings))
3489 cop->cop_warnings = PL_curcop->cop_warnings ;
3491 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3494 if (PL_copline == NOLINE)
3495 CopLINE_set(cop, CopLINE(PL_curcop));
3497 CopLINE_set(cop, PL_copline);
3498 PL_copline = NOLINE;
3501 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXXXX share in a pvtable? */
3503 CopFILEGV_set(cop, (GV*)SvREFCNT_inc(CopFILEGV(PL_curcop)));
3505 CopSTASH_set(cop, PL_curstash);
3507 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3508 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3509 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3510 (void)SvIOK_on(*svp);
3511 SvIVX(*svp) = PTR2IV(cop);
3515 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3518 /* "Introduce" my variables to visible status. */
3526 if (! PL_min_intro_pending)
3527 return PL_cop_seqmax;
3529 svp = AvARRAY(PL_comppad_name);
3530 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3531 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3532 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3533 SvNVX(sv) = (NV)PL_cop_seqmax;
3536 PL_min_intro_pending = 0;
3537 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3538 return PL_cop_seqmax++;
3542 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3544 return new_logop(type, flags, &first, &other);
3548 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3553 OP *first = *firstp;
3554 OP *other = *otherp;
3556 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3557 return newBINOP(type, flags, scalar(first), scalar(other));
3559 scalarboolean(first);
3560 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3561 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3562 if (type == OP_AND || type == OP_OR) {
3568 first = *firstp = cUNOPo->op_first;
3570 first->op_next = o->op_next;
3571 cUNOPo->op_first = Nullop;
3575 if (first->op_type == OP_CONST) {
3576 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3577 Perl_warner(aTHX_ WARN_BAREWORD, "Bareword found in conditional");
3578 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3589 else if (first->op_type == OP_WANTARRAY) {
3595 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3596 OP *k1 = ((UNOP*)first)->op_first;
3597 OP *k2 = k1->op_sibling;
3599 switch (first->op_type)
3602 if (k2 && k2->op_type == OP_READLINE
3603 && (k2->op_flags & OPf_STACKED)
3604 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3606 warnop = k2->op_type;
3611 if (k1->op_type == OP_READDIR
3612 || k1->op_type == OP_GLOB
3613 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3614 || k1->op_type == OP_EACH)
3616 warnop = ((k1->op_type == OP_NULL)
3617 ? k1->op_targ : k1->op_type);
3622 line_t oldline = CopLINE(PL_curcop);
3623 CopLINE_set(PL_curcop, PL_copline);
3624 Perl_warner(aTHX_ WARN_MISC,
3625 "Value of %s%s can be \"0\"; test with defined()",
3627 ((warnop == OP_READLINE || warnop == OP_GLOB)
3628 ? " construct" : "() operator"));
3629 CopLINE_set(PL_curcop, oldline);
3636 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3637 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3639 NewOp(1101, logop, 1, LOGOP);
3641 logop->op_type = type;
3642 logop->op_ppaddr = PL_ppaddr[type];
3643 logop->op_first = first;
3644 logop->op_flags = flags | OPf_KIDS;
3645 logop->op_other = LINKLIST(other);
3646 logop->op_private = 1 | (flags >> 8);
3648 /* establish postfix order */
3649 logop->op_next = LINKLIST(first);
3650 first->op_next = (OP*)logop;
3651 first->op_sibling = other;
3653 o = newUNOP(OP_NULL, 0, (OP*)logop);
3660 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3668 return newLOGOP(OP_AND, 0, first, trueop);
3670 return newLOGOP(OP_OR, 0, first, falseop);
3672 scalarboolean(first);
3673 if (first->op_type == OP_CONST) {
3674 if (SvTRUE(((SVOP*)first)->op_sv)) {
3685 else if (first->op_type == OP_WANTARRAY) {
3689 NewOp(1101, logop, 1, LOGOP);
3690 logop->op_type = OP_COND_EXPR;
3691 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3692 logop->op_first = first;
3693 logop->op_flags = flags | OPf_KIDS;
3694 logop->op_private = 1 | (flags >> 8);
3695 logop->op_other = LINKLIST(trueop);
3696 logop->op_next = LINKLIST(falseop);
3699 /* establish postfix order */
3700 start = LINKLIST(first);
3701 first->op_next = (OP*)logop;
3703 first->op_sibling = trueop;
3704 trueop->op_sibling = falseop;
3705 o = newUNOP(OP_NULL, 0, (OP*)logop);
3707 trueop->op_next = falseop->op_next = o;
3714 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3723 NewOp(1101, range, 1, LOGOP);
3725 range->op_type = OP_RANGE;
3726 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3727 range->op_first = left;
3728 range->op_flags = OPf_KIDS;
3729 leftstart = LINKLIST(left);
3730 range->op_other = LINKLIST(right);
3731 range->op_private = 1 | (flags >> 8);
3733 left->op_sibling = right;
3735 range->op_next = (OP*)range;
3736 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3737 flop = newUNOP(OP_FLOP, 0, flip);
3738 o = newUNOP(OP_NULL, 0, flop);
3740 range->op_next = leftstart;
3742 left->op_next = flip;
3743 right->op_next = flop;
3745 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3746 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3747 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3748 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3750 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3751 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3754 if (!flip->op_private || !flop->op_private)
3755 linklist(o); /* blow off optimizer unless constant */
3761 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3766 int once = block && block->op_flags & OPf_SPECIAL &&
3767 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3770 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3771 return block; /* do {} while 0 does once */
3772 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3773 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3774 expr = newUNOP(OP_DEFINED, 0,
3775 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3776 } else if (expr->op_flags & OPf_KIDS) {
3777 OP *k1 = ((UNOP*)expr)->op_first;
3778 OP *k2 = (k1) ? k1->op_sibling : NULL;
3779 switch (expr->op_type) {
3781 if (k2 && k2->op_type == OP_READLINE
3782 && (k2->op_flags & OPf_STACKED)
3783 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3784 expr = newUNOP(OP_DEFINED, 0, expr);
3788 if (k1->op_type == OP_READDIR
3789 || k1->op_type == OP_GLOB
3790 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3791 || k1->op_type == OP_EACH)
3792 expr = newUNOP(OP_DEFINED, 0, expr);
3798 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3799 o = new_logop(OP_AND, 0, &expr, &listop);
3802 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3804 if (once && o != listop)
3805 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3808 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3810 o->op_flags |= flags;
3812 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3817 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3827 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3828 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3829 expr = newUNOP(OP_DEFINED, 0,
3830 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3831 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3832 OP *k1 = ((UNOP*)expr)->op_first;
3833 OP *k2 = (k1) ? k1->op_sibling : NULL;
3834 switch (expr->op_type) {
3836 if (k2 && k2->op_type == OP_READLINE
3837 && (k2->op_flags & OPf_STACKED)
3838 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3839 expr = newUNOP(OP_DEFINED, 0, expr);
3843 if (k1->op_type == OP_READDIR
3844 || k1->op_type == OP_GLOB
3845 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3846 || k1->op_type == OP_EACH)
3847 expr = newUNOP(OP_DEFINED, 0, expr);
3853 block = newOP(OP_NULL, 0);
3855 block = scope(block);
3859 next = LINKLIST(cont);
3860 loopflags |= OPpLOOP_CONTINUE;
3863 OP *unstack = newOP(OP_UNSTACK, 0);
3866 cont = append_elem(OP_LINESEQ, cont, unstack);
3867 if ((line_t)whileline != NOLINE) {
3868 PL_copline = whileline;
3869 cont = append_elem(OP_LINESEQ, cont,
3870 newSTATEOP(0, Nullch, Nullop));
3874 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3875 redo = LINKLIST(listop);
3878 PL_copline = whileline;
3880 o = new_logop(OP_AND, 0, &expr, &listop);
3881 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3882 op_free(expr); /* oops, it's a while (0) */
3884 return Nullop; /* listop already freed by new_logop */
3887 ((LISTOP*)listop)->op_last->op_next = condop =
3888 (o == listop ? redo : LINKLIST(o));
3894 NewOp(1101,loop,1,LOOP);
3895 loop->op_type = OP_ENTERLOOP;
3896 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3897 loop->op_private = 0;
3898 loop->op_next = (OP*)loop;
3901 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3903 loop->op_redoop = redo;
3904 loop->op_lastop = o;
3905 o->op_private |= loopflags;
3908 loop->op_nextop = next;
3910 loop->op_nextop = o;
3912 o->op_flags |= flags;
3913 o->op_private |= (flags >> 8);
3918 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3926 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3927 sv->op_type = OP_RV2GV;
3928 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3930 else if (sv->op_type == OP_PADSV) { /* private variable */
3931 padoff = sv->op_targ;
3936 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3937 padoff = sv->op_targ;
3939 iterflags |= OPf_SPECIAL;
3944 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3948 padoff = find_threadsv("_");
3949 iterflags |= OPf_SPECIAL;
3951 sv = newGVOP(OP_GV, 0, PL_defgv);
3954 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3955 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3956 iterflags |= OPf_STACKED;
3958 else if (expr->op_type == OP_NULL &&
3959 (expr->op_flags & OPf_KIDS) &&
3960 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3962 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3963 * set the STACKED flag to indicate that these values are to be
3964 * treated as min/max values by 'pp_iterinit'.
3966 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3967 LOGOP* range = (LOGOP*) flip->op_first;
3968 OP* left = range->op_first;
3969 OP* right = left->op_sibling;
3972 range->op_flags &= ~OPf_KIDS;
3973 range->op_first = Nullop;
3975 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3976 listop->op_first->op_next = range->op_next;
3977 left->op_next = range->op_other;
3978 right->op_next = (OP*)listop;
3979 listop->op_next = listop->op_first;
3982 expr = (OP*)(listop);
3984 iterflags |= OPf_STACKED;
3987 expr = mod(force_list(expr), OP_GREPSTART);
3991 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3992 append_elem(OP_LIST, expr, scalar(sv))));
3993 assert(!loop->op_next);
3994 #ifdef PL_OP_SLAB_ALLOC
3997 NewOp(1234,tmp,1,LOOP);
3998 Copy(loop,tmp,1,LOOP);
4002 Renew(loop, 1, LOOP);
4004 loop->op_targ = padoff;
4005 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
4006 PL_copline = forline;
4007 return newSTATEOP(0, label, wop);
4011 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4017 if (type != OP_GOTO || label->op_type == OP_CONST) {
4018 /* "last()" means "last" */
4019 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4020 o = newOP(type, OPf_SPECIAL);
4022 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
4023 ? SvPVx(((SVOP*)label)->op_sv, n_a)
4029 if (label->op_type == OP_ENTERSUB)
4030 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4031 o = newUNOP(type, OPf_STACKED, label);
4033 PL_hints |= HINT_BLOCK_SCOPE;
4038 Perl_cv_undef(pTHX_ CV *cv)
4043 MUTEX_DESTROY(CvMUTEXP(cv));
4044 Safefree(CvMUTEXP(cv));
4047 #endif /* USE_THREADS */
4049 if (!CvXSUB(cv) && CvROOT(cv)) {
4051 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4052 Perl_croak(aTHX_ "Can't undef active subroutine");
4055 Perl_croak(aTHX_ "Can't undef active subroutine");
4056 #endif /* USE_THREADS */
4059 SAVEVPTR(PL_curpad);
4063 op_free(CvROOT(cv));
4064 CvROOT(cv) = Nullop;
4067 SvPOK_off((SV*)cv); /* forget prototype */
4069 SvREFCNT_dec(CvGV(cv));
4071 SvREFCNT_dec(CvOUTSIDE(cv));
4072 CvOUTSIDE(cv) = Nullcv;
4073 if (CvPADLIST(cv)) {
4074 /* may be during global destruction */
4075 if (SvREFCNT(CvPADLIST(cv))) {
4076 I32 i = AvFILLp(CvPADLIST(cv));
4078 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4079 SV* sv = svp ? *svp : Nullsv;
4082 if (sv == (SV*)PL_comppad_name)
4083 PL_comppad_name = Nullav;
4084 else if (sv == (SV*)PL_comppad) {
4085 PL_comppad = Nullav;
4086 PL_curpad = Null(SV**);
4090 SvREFCNT_dec((SV*)CvPADLIST(cv));
4092 CvPADLIST(cv) = Nullav;
4097 S_cv_dump(pTHX_ CV *cv)
4100 CV *outside = CvOUTSIDE(cv);
4101 AV* padlist = CvPADLIST(cv);
4108 PerlIO_printf(Perl_debug_log,
4109 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4111 (CvANON(cv) ? "ANON"
4112 : (cv == PL_main_cv) ? "MAIN"
4113 : CvUNIQUE(cv) ? "UNIQUE"
4114 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4117 : CvANON(outside) ? "ANON"
4118 : (outside == PL_main_cv) ? "MAIN"
4119 : CvUNIQUE(outside) ? "UNIQUE"
4120 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4125 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4126 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4127 pname = AvARRAY(pad_name);
4128 ppad = AvARRAY(pad);
4130 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4131 if (SvPOK(pname[ix]))
4132 PerlIO_printf(Perl_debug_log,
4133 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4134 (int)ix, PTR2UV(ppad[ix]),
4135 SvFAKE(pname[ix]) ? "FAKE " : "",
4137 (IV)I_32(SvNVX(pname[ix])),
4140 #endif /* DEBUGGING */
4144 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4149 AV* protopadlist = CvPADLIST(proto);
4150 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4151 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4152 SV** pname = AvARRAY(protopad_name);
4153 SV** ppad = AvARRAY(protopad);
4154 I32 fname = AvFILLp(protopad_name);
4155 I32 fpad = AvFILLp(protopad);
4159 assert(!CvUNIQUE(proto));
4163 SAVESPTR(PL_comppad_name);
4164 SAVESPTR(PL_compcv);
4166 cv = PL_compcv = (CV*)NEWSV(1104,0);
4167 sv_upgrade((SV *)cv, SvTYPE(proto));
4168 CvFLAGS(cv) = CvFLAGS(proto) & ~CVf_CLONE;
4172 New(666, CvMUTEXP(cv), 1, perl_mutex);
4173 MUTEX_INIT(CvMUTEXP(cv));
4175 #endif /* USE_THREADS */
4176 CvFILE(cv) = CvFILE(proto);
4177 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4178 CvSTASH(cv) = CvSTASH(proto);
4179 CvROOT(cv) = CvROOT(proto);
4180 CvSTART(cv) = CvSTART(proto);
4182 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4185 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4187 PL_comppad_name = newAV();
4188 for (ix = fname; ix >= 0; ix--)
4189 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4191 PL_comppad = newAV();
4193 comppadlist = newAV();
4194 AvREAL_off(comppadlist);
4195 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4196 av_store(comppadlist, 1, (SV*)PL_comppad);
4197 CvPADLIST(cv) = comppadlist;
4198 av_fill(PL_comppad, AvFILLp(protopad));
4199 PL_curpad = AvARRAY(PL_comppad);
4201 av = newAV(); /* will be @_ */
4203 av_store(PL_comppad, 0, (SV*)av);
4204 AvFLAGS(av) = AVf_REIFY;
4206 for (ix = fpad; ix > 0; ix--) {
4207 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4208 if (namesv && namesv != &PL_sv_undef) {
4209 char *name = SvPVX(namesv); /* XXX */
4210 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4211 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4212 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4214 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4216 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4218 else { /* our own lexical */
4221 /* anon code -- we'll come back for it */
4222 sv = SvREFCNT_inc(ppad[ix]);
4224 else if (*name == '@')
4226 else if (*name == '%')
4235 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4236 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4239 SV* sv = NEWSV(0,0);
4245 /* Now that vars are all in place, clone nested closures. */
4247 for (ix = fpad; ix > 0; ix--) {
4248 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4250 && namesv != &PL_sv_undef
4251 && !(SvFLAGS(namesv) & SVf_FAKE)
4252 && *SvPVX(namesv) == '&'
4253 && CvCLONE(ppad[ix]))
4255 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4256 SvREFCNT_dec(ppad[ix]);
4259 PL_curpad[ix] = (SV*)kid;
4263 #ifdef DEBUG_CLOSURES
4264 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4266 PerlIO_printf(Perl_debug_log, " from:\n");
4268 PerlIO_printf(Perl_debug_log, " to:\n");
4277 Perl_cv_clone(pTHX_ CV *proto)
4280 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4281 cv = cv_clone2(proto, CvOUTSIDE(proto));
4282 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4287 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4291 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4292 SV* msg = sv_newmortal();
4296 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4297 sv_setpv(msg, "Prototype mismatch:");
4299 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4301 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4302 sv_catpv(msg, " vs ");
4304 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4306 sv_catpv(msg, "none");
4307 Perl_warner(aTHX_ WARN_PROTOTYPE, "%"SVf, msg);
4312 Perl_cv_const_sv(pTHX_ CV *cv)
4314 if (!cv || !SvPOK(cv) || SvCUR(cv))
4316 return op_const_sv(CvSTART(cv), cv);
4320 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4327 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4328 o = cLISTOPo->op_first->op_sibling;
4330 for (; o; o = o->op_next) {
4331 OPCODE type = o->op_type;
4333 if (sv && o->op_next == o)
4335 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4337 if (type == OP_LEAVESUB || type == OP_RETURN)
4341 if (type == OP_CONST && cSVOPo->op_sv)
4343 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4344 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4345 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4346 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4358 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4368 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4372 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4374 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4378 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4385 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4389 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4390 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4391 SV *sv = sv_newmortal();
4392 Perl_sv_setpvf(aTHX_ sv, "__ANON__[%s:%"IVdf"]",
4393 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4398 gv = gv_fetchpv(name ? name : (aname ? aname : "__ANON__"),
4399 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4409 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4410 maximum a prototype before. */
4411 if (SvTYPE(gv) > SVt_NULL) {
4412 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4413 && ckWARN_d(WARN_PROTOTYPE))
4415 Perl_warner(aTHX_ WARN_PROTOTYPE, "Runaway prototype");
4417 cv_ckproto((CV*)gv, NULL, ps);
4420 sv_setpv((SV*)gv, ps);
4422 sv_setiv((SV*)gv, -1);
4423 SvREFCNT_dec(PL_compcv);
4424 cv = PL_compcv = NULL;
4425 PL_sub_generation++;
4429 if (!name || GvCVGEN(gv))
4431 else if ((cv = GvCV(gv))) {
4432 cv_ckproto(cv, gv, ps);
4433 /* already defined (or promised)? */
4434 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4436 bool const_changed = TRUE;
4437 if (!block && !attrs) {
4438 /* just a "sub foo;" when &foo is already defined */
4439 SAVEFREESV(PL_compcv);
4442 /* ahem, death to those who redefine active sort subs */
4443 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4444 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4447 if ((const_sv = cv_const_sv(cv)))
4448 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4449 if ((const_sv || const_changed) && ckWARN(WARN_REDEFINE))
4451 line_t oldline = CopLINE(PL_curcop);
4452 CopLINE_set(PL_curcop, PL_copline);
4453 Perl_warner(aTHX_ WARN_REDEFINE,
4454 const_sv ? "Constant subroutine %s redefined"
4455 : "Subroutine %s redefined", name);
4456 CopLINE_set(PL_curcop, oldline);
4467 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4468 * before we clobber PL_compcv.
4472 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4473 stash = GvSTASH(CvGV(cv));
4474 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4475 stash = CvSTASH(cv);
4477 stash = PL_curstash;
4480 /* possibly about to re-define existing subr -- ignore old cv */
4481 rcv = (SV*)PL_compcv;
4482 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4483 stash = GvSTASH(gv);
4485 stash = PL_curstash;
4487 apply_attrs(stash, rcv, attrs);
4489 if (cv) { /* must reuse cv if autoloaded */
4491 /* got here with just attrs -- work done, so bug out */
4492 SAVEFREESV(PL_compcv);
4496 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4497 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4498 CvOUTSIDE(PL_compcv) = 0;
4499 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4500 CvPADLIST(PL_compcv) = 0;
4501 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4502 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4503 SvREFCNT_dec(PL_compcv);
4510 PL_sub_generation++;
4513 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4514 CvFILE(cv) = CopFILE(PL_curcop);
4515 CvSTASH(cv) = PL_curstash;
4518 if (!CvMUTEXP(cv)) {
4519 New(666, CvMUTEXP(cv), 1, perl_mutex);
4520 MUTEX_INIT(CvMUTEXP(cv));
4522 #endif /* USE_THREADS */
4525 sv_setpv((SV*)cv, ps);
4527 if (PL_error_count) {
4531 char *s = strrchr(name, ':');
4533 if (strEQ(s, "BEGIN")) {
4535 "BEGIN not safe after errors--compilation aborted";
4536 if (PL_in_eval & EVAL_KEEPERR)
4537 Perl_croak(aTHX_ not_safe);
4539 /* force display of errors found but not reported */
4540 sv_catpv(ERRSV, not_safe);
4541 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4548 PL_copline = NOLINE;
4553 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4554 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4557 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4560 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4562 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4563 OpREFCNT_set(CvROOT(cv), 1);
4564 CvSTART(cv) = LINKLIST(CvROOT(cv));
4565 CvROOT(cv)->op_next = 0;
4568 /* now that optimizer has done its work, adjust pad values */
4570 SV **namep = AvARRAY(PL_comppad_name);
4571 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4574 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4577 * The only things that a clonable function needs in its
4578 * pad are references to outer lexicals and anonymous subs.
4579 * The rest are created anew during cloning.
4581 if (!((namesv = namep[ix]) != Nullsv &&
4582 namesv != &PL_sv_undef &&
4584 *SvPVX(namesv) == '&')))
4586 SvREFCNT_dec(PL_curpad[ix]);
4587 PL_curpad[ix] = Nullsv;
4592 AV *av = newAV(); /* Will be @_ */
4594 av_store(PL_comppad, 0, (SV*)av);
4595 AvFLAGS(av) = AVf_REIFY;
4597 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4598 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4600 if (!SvPADMY(PL_curpad[ix]))
4601 SvPADTMP_on(PL_curpad[ix]);
4605 if (name || aname) {
4607 char *tname = (name ? name : aname);
4609 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4610 SV *sv = NEWSV(0,0);
4611 SV *tmpstr = sv_newmortal();
4612 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4616 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4618 (long)PL_subline, (long)CopLINE(PL_curcop));
4619 gv_efullname3(tmpstr, gv, Nullch);
4620 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4621 hv = GvHVn(db_postponed);
4622 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4623 && (pcv = GvCV(db_postponed)))
4629 call_sv((SV*)pcv, G_DISCARD);
4633 if ((s = strrchr(tname,':')))
4638 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4641 if (strEQ(s, "BEGIN")) {
4642 I32 oldscope = PL_scopestack_ix;
4644 SAVECOPFILE(&PL_compiling);
4645 SAVECOPLINE(&PL_compiling);
4647 sv_setsv(PL_rs, PL_nrs);
4650 PL_beginav = newAV();
4651 DEBUG_x( dump_sub(gv) );
4652 av_push(PL_beginav, SvREFCNT_inc(cv));
4654 call_list(oldscope, PL_beginav);
4656 PL_curcop = &PL_compiling;
4657 PL_compiling.op_private = PL_hints;
4660 else if (strEQ(s, "END") && !PL_error_count) {
4663 DEBUG_x( dump_sub(gv) );
4664 av_unshift(PL_endav, 1);
4665 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4668 else if (strEQ(s, "CHECK") && !PL_error_count) {
4670 PL_checkav = newAV();
4671 DEBUG_x( dump_sub(gv) );
4672 if (PL_main_start && ckWARN(WARN_VOID))
4673 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4674 av_unshift(PL_checkav, 1);
4675 av_store(PL_checkav, 0, SvREFCNT_inc(cv));
4678 else if (strEQ(s, "INIT") && !PL_error_count) {
4680 PL_initav = newAV();
4681 DEBUG_x( dump_sub(gv) );
4682 if (PL_main_start && ckWARN(WARN_VOID))
4683 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4684 av_push(PL_initav, SvREFCNT_inc(cv));
4690 PL_copline = NOLINE;
4695 /* XXX unsafe for threads if eval_owner isn't held */
4697 =for apidoc newCONSTSUB
4699 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4700 eligible for inlining at compile-time.
4706 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4711 SAVECOPLINE(PL_curcop);
4714 CopLINE_set(PL_curcop, PL_copline);
4715 PL_hints &= ~HINT_BLOCK_SCOPE;
4718 SAVESPTR(PL_curstash);
4719 SAVECOPSTASH(PL_curcop);
4720 PL_curstash = stash;
4722 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4724 CopSTASH(PL_curcop) = stash;
4729 start_subparse(FALSE, 0),
4730 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4731 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4733 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4740 =for apidoc U||newXS
4742 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4748 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4751 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4754 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4756 /* just a cached method */
4760 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4761 /* already defined (or promised) */
4762 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4763 && HvNAME(GvSTASH(CvGV(cv)))
4764 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4765 line_t oldline = CopLINE(PL_curcop);
4766 if (PL_copline != NOLINE)
4767 CopLINE_set(PL_curcop, PL_copline);
4768 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4769 CopLINE_set(PL_curcop, oldline);
4776 if (cv) /* must reuse cv if autoloaded */
4779 cv = (CV*)NEWSV(1105,0);
4780 sv_upgrade((SV *)cv, SVt_PVCV);
4784 PL_sub_generation++;
4787 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4789 New(666, CvMUTEXP(cv), 1, perl_mutex);
4790 MUTEX_INIT(CvMUTEXP(cv));
4792 #endif /* USE_THREADS */
4793 (void)gv_fetchfile(filename);
4794 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4795 an external constant string */
4796 CvXSUB(cv) = subaddr;
4799 char *s = strrchr(name,':');
4805 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4808 if (strEQ(s, "BEGIN")) {
4810 PL_beginav = newAV();
4811 av_push(PL_beginav, SvREFCNT_inc(cv));
4814 else if (strEQ(s, "END")) {
4817 av_unshift(PL_endav, 1);
4818 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4821 else if (strEQ(s, "CHECK")) {
4823 PL_checkav = newAV();
4824 if (PL_main_start && ckWARN(WARN_VOID))
4825 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4826 av_unshift(PL_checkav, 1);
4827 av_store(PL_checkav, 0, SvREFCNT_inc(cv));
4830 else if (strEQ(s, "INIT")) {
4832 PL_initav = newAV();
4833 if (PL_main_start && ckWARN(WARN_VOID))
4834 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4835 av_push(PL_initav, SvREFCNT_inc(cv));
4847 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4857 name = SvPVx(cSVOPo->op_sv, n_a);
4860 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4862 if ((cv = GvFORM(gv))) {
4863 if (ckWARN(WARN_REDEFINE)) {
4864 line_t oldline = CopLINE(PL_curcop);
4866 CopLINE_set(PL_curcop, PL_copline);
4867 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4868 CopLINE_set(PL_curcop, oldline);
4874 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4875 CvFILE(cv) = CopFILE(PL_curcop);
4877 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4878 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4879 SvPADTMP_on(PL_curpad[ix]);
4882 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4883 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4884 OpREFCNT_set(CvROOT(cv), 1);
4885 CvSTART(cv) = LINKLIST(CvROOT(cv));
4886 CvROOT(cv)->op_next = 0;
4889 PL_copline = NOLINE;
4894 Perl_newANONLIST(pTHX_ OP *o)
4896 return newUNOP(OP_REFGEN, 0,
4897 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4901 Perl_newANONHASH(pTHX_ OP *o)
4903 return newUNOP(OP_REFGEN, 0,
4904 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4908 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4910 return newANONATTRSUB(floor, proto, Nullop, block);
4914 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4916 return newUNOP(OP_REFGEN, 0,
4917 newSVOP(OP_ANONCODE, 0,
4918 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4922 Perl_oopsAV(pTHX_ OP *o)
4924 switch (o->op_type) {
4926 o->op_type = OP_PADAV;
4927 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4928 return ref(o, OP_RV2AV);
4931 o->op_type = OP_RV2AV;
4932 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4937 if (ckWARN_d(WARN_INTERNAL))
4938 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4945 Perl_oopsHV(pTHX_ OP *o)
4949 switch (o->op_type) {
4952 o->op_type = OP_PADHV;
4953 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4954 return ref(o, OP_RV2HV);
4958 o->op_type = OP_RV2HV;
4959 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4964 if (ckWARN_d(WARN_INTERNAL))
4965 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
4972 Perl_newAVREF(pTHX_ OP *o)
4974 if (o->op_type == OP_PADANY) {
4975 o->op_type = OP_PADAV;
4976 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4979 return newUNOP(OP_RV2AV, 0, scalar(o));
4983 Perl_newGVREF(pTHX_ I32 type, OP *o)
4985 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4986 return newUNOP(OP_NULL, 0, o);
4987 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4991 Perl_newHVREF(pTHX_ OP *o)
4993 if (o->op_type == OP_PADANY) {
4994 o->op_type = OP_PADHV;
4995 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4998 return newUNOP(OP_RV2HV, 0, scalar(o));
5002 Perl_oopsCV(pTHX_ OP *o)
5004 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5010 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5012 return newUNOP(OP_RV2CV, flags, scalar(o));
5016 Perl_newSVREF(pTHX_ OP *o)
5018 if (o->op_type == OP_PADANY) {
5019 o->op_type = OP_PADSV;
5020 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5023 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
5024 o->op_flags |= OPpDONE_SVREF;
5027 return newUNOP(OP_RV2SV, 0, scalar(o));
5030 /* Check routines. */
5033 Perl_ck_anoncode(pTHX_ OP *o)
5038 name = NEWSV(1106,0);
5039 sv_upgrade(name, SVt_PVNV);
5040 sv_setpvn(name, "&", 1);
5043 ix = pad_alloc(o->op_type, SVs_PADMY);
5044 av_store(PL_comppad_name, ix, name);
5045 av_store(PL_comppad, ix, cSVOPo->op_sv);
5046 SvPADMY_on(cSVOPo->op_sv);
5047 cSVOPo->op_sv = Nullsv;
5048 cSVOPo->op_targ = ix;
5053 Perl_ck_bitop(pTHX_ OP *o)
5055 o->op_private = PL_hints;
5060 Perl_ck_concat(pTHX_ OP *o)
5062 if (cUNOPo->op_first->op_type == OP_CONCAT)
5063 o->op_flags |= OPf_STACKED;
5068 Perl_ck_spair(pTHX_ OP *o)
5070 if (o->op_flags & OPf_KIDS) {
5073 OPCODE type = o->op_type;
5074 o = modkids(ck_fun(o), type);
5075 kid = cUNOPo->op_first;
5076 newop = kUNOP->op_first->op_sibling;
5078 (newop->op_sibling ||
5079 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5080 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5081 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5085 op_free(kUNOP->op_first);
5086 kUNOP->op_first = newop;
5088 o->op_ppaddr = PL_ppaddr[++o->op_type];
5093 Perl_ck_delete(pTHX_ OP *o)
5097 if (o->op_flags & OPf_KIDS) {
5098 OP *kid = cUNOPo->op_first;
5099 switch (kid->op_type) {
5101 o->op_flags |= OPf_SPECIAL;
5104 o->op_private |= OPpSLICE;
5107 o->op_flags |= OPf_SPECIAL;
5112 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5113 PL_op_desc[o->op_type]);
5121 Perl_ck_eof(pTHX_ OP *o)
5123 I32 type = o->op_type;
5125 if (o->op_flags & OPf_KIDS) {
5126 if (cLISTOPo->op_first->op_type == OP_STUB) {
5128 o = newUNOP(type, OPf_SPECIAL,
5129 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5137 Perl_ck_eval(pTHX_ OP *o)
5139 PL_hints |= HINT_BLOCK_SCOPE;
5140 if (o->op_flags & OPf_KIDS) {
5141 SVOP *kid = (SVOP*)cUNOPo->op_first;
5144 o->op_flags &= ~OPf_KIDS;
5147 else if (kid->op_type == OP_LINESEQ) {
5150 kid->op_next = o->op_next;
5151 cUNOPo->op_first = 0;
5154 NewOp(1101, enter, 1, LOGOP);
5155 enter->op_type = OP_ENTERTRY;
5156 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5157 enter->op_private = 0;
5159 /* establish postfix order */
5160 enter->op_next = (OP*)enter;
5162 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5163 o->op_type = OP_LEAVETRY;
5164 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5165 enter->op_other = o;
5173 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5175 o->op_targ = (PADOFFSET)PL_hints;
5180 Perl_ck_exit(pTHX_ OP *o)
5183 HV *table = GvHV(PL_hintgv);
5185 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
5186 if (svp && *svp && SvTRUE(*svp))
5187 o->op_private |= OPpEXIT_VMSISH;
5194 Perl_ck_exec(pTHX_ OP *o)
5197 if (o->op_flags & OPf_STACKED) {
5199 kid = cUNOPo->op_first->op_sibling;
5200 if (kid->op_type == OP_RV2GV)
5209 Perl_ck_exists(pTHX_ OP *o)
5212 if (o->op_flags & OPf_KIDS) {
5213 OP *kid = cUNOPo->op_first;
5214 if (kid->op_type == OP_ENTERSUB) {
5215 (void) ref(kid, o->op_type);
5216 if (kid->op_type != OP_RV2CV && !PL_error_count)
5217 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5218 PL_op_desc[o->op_type]);
5219 o->op_private |= OPpEXISTS_SUB;
5221 else if (kid->op_type == OP_AELEM)
5222 o->op_flags |= OPf_SPECIAL;
5223 else if (kid->op_type != OP_HELEM)
5224 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5225 PL_op_desc[o->op_type]);
5233 Perl_ck_gvconst(pTHX_ register OP *o)
5235 o = fold_constants(o);
5236 if (o->op_type == OP_CONST)
5243 Perl_ck_rvconst(pTHX_ register OP *o)
5246 SVOP *kid = (SVOP*)cUNOPo->op_first;
5248 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5249 if (kid->op_type == OP_CONST) {
5253 SV *kidsv = kid->op_sv;
5256 /* Is it a constant from cv_const_sv()? */
5257 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5258 SV *rsv = SvRV(kidsv);
5259 int svtype = SvTYPE(rsv);
5260 char *badtype = Nullch;
5262 switch (o->op_type) {
5264 if (svtype > SVt_PVMG)
5265 badtype = "a SCALAR";
5268 if (svtype != SVt_PVAV)
5269 badtype = "an ARRAY";
5272 if (svtype != SVt_PVHV) {
5273 if (svtype == SVt_PVAV) { /* pseudohash? */
5274 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5275 if (ksv && SvROK(*ksv)
5276 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5285 if (svtype != SVt_PVCV)
5290 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5293 name = SvPV(kidsv, n_a);
5294 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5295 char *badthing = Nullch;
5296 switch (o->op_type) {
5298 badthing = "a SCALAR";
5301 badthing = "an ARRAY";
5304 badthing = "a HASH";
5309 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5313 * This is a little tricky. We only want to add the symbol if we
5314 * didn't add it in the lexer. Otherwise we get duplicate strict
5315 * warnings. But if we didn't add it in the lexer, we must at
5316 * least pretend like we wanted to add it even if it existed before,
5317 * or we get possible typo warnings. OPpCONST_ENTERED says
5318 * whether the lexer already added THIS instance of this symbol.
5320 iscv = (o->op_type == OP_RV2CV) * 2;
5322 gv = gv_fetchpv(name,
5323 iscv | !(kid->op_private & OPpCONST_ENTERED),
5326 : o->op_type == OP_RV2SV
5328 : o->op_type == OP_RV2AV
5330 : o->op_type == OP_RV2HV
5333 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5335 kid->op_type = OP_GV;
5336 SvREFCNT_dec(kid->op_sv);
5338 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5339 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5341 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5343 kid->op_sv = SvREFCNT_inc(gv);
5345 kid->op_ppaddr = PL_ppaddr[OP_GV];
5352 Perl_ck_ftst(pTHX_ OP *o)
5355 I32 type = o->op_type;
5357 if (o->op_flags & OPf_REF) {
5360 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5361 SVOP *kid = (SVOP*)cUNOPo->op_first;
5363 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5365 OP *newop = newGVOP(type, OPf_REF,
5366 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5373 if (type == OP_FTTTY)
5374 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5377 o = newUNOP(type, 0, newDEFSVOP());
5380 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5382 if (PL_hints & HINT_LOCALE)
5383 o->op_private |= OPpLOCALE;
5390 Perl_ck_fun(pTHX_ OP *o)
5397 int type = o->op_type;
5398 register I32 oa = PL_opargs[type] >> OASHIFT;
5400 if (o->op_flags & OPf_STACKED) {
5401 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5404 return no_fh_allowed(o);
5407 if (o->op_flags & OPf_KIDS) {
5409 tokid = &cLISTOPo->op_first;
5410 kid = cLISTOPo->op_first;
5411 if (kid->op_type == OP_PUSHMARK ||
5412 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5414 tokid = &kid->op_sibling;
5415 kid = kid->op_sibling;
5417 if (!kid && PL_opargs[type] & OA_DEFGV)
5418 *tokid = kid = newDEFSVOP();
5422 sibl = kid->op_sibling;
5425 /* list seen where single (scalar) arg expected? */
5426 if (numargs == 1 && !(oa >> 4)
5427 && kid->op_type == OP_LIST && type != OP_SCALAR)
5429 return too_many_arguments(o,PL_op_desc[type]);
5442 if (kid->op_type == OP_CONST &&
5443 (kid->op_private & OPpCONST_BARE))
5445 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5446 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5447 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5448 if (ckWARN(WARN_DEPRECATED))
5449 Perl_warner(aTHX_ WARN_DEPRECATED,
5450 "Array @%s missing the @ in argument %"IVdf" of %s()",
5451 name, (IV)numargs, PL_op_desc[type]);
5454 kid->op_sibling = sibl;
5457 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5458 bad_type(numargs, "array", PL_op_desc[type], kid);
5462 if (kid->op_type == OP_CONST &&
5463 (kid->op_private & OPpCONST_BARE))
5465 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5466 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5467 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5468 if (ckWARN(WARN_DEPRECATED))
5469 Perl_warner(aTHX_ WARN_DEPRECATED,
5470 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5471 name, (IV)numargs, PL_op_desc[type]);
5474 kid->op_sibling = sibl;
5477 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5478 bad_type(numargs, "hash", PL_op_desc[type], kid);
5483 OP *newop = newUNOP(OP_NULL, 0, kid);
5484 kid->op_sibling = 0;
5486 newop->op_next = newop;
5488 kid->op_sibling = sibl;
5493 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5494 if (kid->op_type == OP_CONST &&
5495 (kid->op_private & OPpCONST_BARE))
5497 OP *newop = newGVOP(OP_GV, 0,
5498 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5503 else if (kid->op_type == OP_READLINE) {
5504 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5505 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5508 I32 flags = OPf_SPECIAL;
5512 /* is this op a FH constructor? */
5513 if (is_handle_constructor(o,numargs)) {
5514 char *name = Nullch;
5518 /* Set a flag to tell rv2gv to vivify
5519 * need to "prove" flag does not mean something
5520 * else already - NI-S 1999/05/07
5523 if (kid->op_type == OP_PADSV) {
5524 SV **namep = av_fetch(PL_comppad_name,
5526 if (namep && *namep)
5527 name = SvPV(*namep, len);
5529 else if (kid->op_type == OP_RV2SV
5530 && kUNOP->op_first->op_type == OP_GV)
5532 GV *gv = cGVOPx_gv(kUNOP->op_first);
5534 len = GvNAMELEN(gv);
5536 else if (kid->op_type == OP_AELEM
5537 || kid->op_type == OP_HELEM)
5539 name = "__ANONIO__";
5545 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5546 namesv = PL_curpad[targ];
5547 (void)SvUPGRADE(namesv, SVt_PV);
5549 sv_setpvn(namesv, "$", 1);
5550 sv_catpvn(namesv, name, len);
5553 kid->op_sibling = 0;
5554 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5555 kid->op_targ = targ;
5556 kid->op_private |= priv;
5558 kid->op_sibling = sibl;
5564 mod(scalar(kid), type);
5568 tokid = &kid->op_sibling;
5569 kid = kid->op_sibling;
5571 o->op_private |= numargs;
5573 return too_many_arguments(o,PL_op_desc[o->op_type]);
5576 else if (PL_opargs[type] & OA_DEFGV) {
5578 return newUNOP(type, 0, newDEFSVOP());
5582 while (oa & OA_OPTIONAL)
5584 if (oa && oa != OA_LIST)
5585 return too_few_arguments(o,PL_op_desc[o->op_type]);
5591 Perl_ck_glob(pTHX_ OP *o)
5596 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5597 append_elem(OP_GLOB, o, newDEFSVOP());
5599 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5600 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5602 #if !defined(PERL_EXTERNAL_GLOB)
5603 /* XXX this can be tightened up and made more failsafe. */
5606 Perl_load_module(aTHX_ 0, newSVpvn("File::Glob", 10), Nullsv,
5607 /* null-terminated import list */
5608 newSVpvn(":globally", 9), Nullsv);
5609 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5612 #endif /* PERL_EXTERNAL_GLOB */
5614 if (gv && GvIMPORTED_CV(gv)) {
5615 append_elem(OP_GLOB, o,
5616 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5617 o->op_type = OP_LIST;
5618 o->op_ppaddr = PL_ppaddr[OP_LIST];
5619 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5620 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5621 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5622 append_elem(OP_LIST, o,
5623 scalar(newUNOP(OP_RV2CV, 0,
5624 newGVOP(OP_GV, 0, gv)))));
5625 o = newUNOP(OP_NULL, 0, ck_subr(o));
5626 o->op_targ = OP_GLOB; /* hint at what it used to be */
5629 gv = newGVgen("main");
5631 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5637 Perl_ck_grep(pTHX_ OP *o)
5641 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5643 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5644 NewOp(1101, gwop, 1, LOGOP);
5646 if (o->op_flags & OPf_STACKED) {
5649 kid = cLISTOPo->op_first->op_sibling;
5650 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5653 kid->op_next = (OP*)gwop;
5654 o->op_flags &= ~OPf_STACKED;
5656 kid = cLISTOPo->op_first->op_sibling;
5657 if (type == OP_MAPWHILE)
5664 kid = cLISTOPo->op_first->op_sibling;
5665 if (kid->op_type != OP_NULL)
5666 Perl_croak(aTHX_ "panic: ck_grep");
5667 kid = kUNOP->op_first;
5669 gwop->op_type = type;
5670 gwop->op_ppaddr = PL_ppaddr[type];
5671 gwop->op_first = listkids(o);
5672 gwop->op_flags |= OPf_KIDS;
5673 gwop->op_private = 1;
5674 gwop->op_other = LINKLIST(kid);
5675 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5676 kid->op_next = (OP*)gwop;
5678 kid = cLISTOPo->op_first->op_sibling;
5679 if (!kid || !kid->op_sibling)
5680 return too_few_arguments(o,PL_op_desc[o->op_type]);
5681 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5682 mod(kid, OP_GREPSTART);
5688 Perl_ck_index(pTHX_ OP *o)
5690 if (o->op_flags & OPf_KIDS) {
5691 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5693 kid = kid->op_sibling; /* get past "big" */
5694 if (kid && kid->op_type == OP_CONST)
5695 fbm_compile(((SVOP*)kid)->op_sv, 0);
5701 Perl_ck_lengthconst(pTHX_ OP *o)
5703 /* XXX length optimization goes here */
5708 Perl_ck_lfun(pTHX_ OP *o)
5710 OPCODE type = o->op_type;
5711 return modkids(ck_fun(o), type);
5715 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5718 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5719 switch (cUNOPo->op_first->op_type) {
5721 break; /* Globals via GV can be undef */
5723 case OP_AASSIGN: /* Is this a good idea? */
5724 Perl_warner(aTHX_ WARN_DEPRECATED,
5725 "defined(@array) is deprecated");
5726 Perl_warner(aTHX_ WARN_DEPRECATED,
5727 "\t(Maybe you should just omit the defined()?)\n");
5730 break; /* Globals via GV can be undef */
5732 Perl_warner(aTHX_ WARN_DEPRECATED,
5733 "defined(%%hash) is deprecated");
5734 Perl_warner(aTHX_ WARN_DEPRECATED,
5735 "\t(Maybe you should just omit the defined()?)\n");
5746 Perl_ck_rfun(pTHX_ OP *o)
5748 OPCODE type = o->op_type;
5749 return refkids(ck_fun(o), type);
5753 Perl_ck_listiob(pTHX_ OP *o)
5757 kid = cLISTOPo->op_first;
5760 kid = cLISTOPo->op_first;
5762 if (kid->op_type == OP_PUSHMARK)
5763 kid = kid->op_sibling;
5764 if (kid && o->op_flags & OPf_STACKED)
5765 kid = kid->op_sibling;
5766 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5767 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5768 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5769 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5770 cLISTOPo->op_first->op_sibling = kid;
5771 cLISTOPo->op_last = kid;
5772 kid = kid->op_sibling;
5777 append_elem(o->op_type, o, newDEFSVOP());
5783 if (PL_hints & HINT_LOCALE)
5784 o->op_private |= OPpLOCALE;
5791 Perl_ck_fun_locale(pTHX_ OP *o)
5797 if (PL_hints & HINT_LOCALE)
5798 o->op_private |= OPpLOCALE;
5805 Perl_ck_sassign(pTHX_ OP *o)
5807 OP *kid = cLISTOPo->op_first;
5808 /* has a disposable target? */
5809 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5810 && !(kid->op_flags & OPf_STACKED)
5811 /* Cannot steal the second time! */
5812 && !(kid->op_private & OPpTARGET_MY))
5814 OP *kkid = kid->op_sibling;
5816 /* Can just relocate the target. */
5817 if (kkid && kkid->op_type == OP_PADSV
5818 && !(kkid->op_private & OPpLVAL_INTRO))
5820 kid->op_targ = kkid->op_targ;
5822 /* Now we do not need PADSV and SASSIGN. */
5823 kid->op_sibling = o->op_sibling; /* NULL */
5824 cLISTOPo->op_first = NULL;
5827 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5835 Perl_ck_scmp(pTHX_ OP *o)
5839 if (PL_hints & HINT_LOCALE)
5840 o->op_private |= OPpLOCALE;
5847 Perl_ck_match(pTHX_ OP *o)
5849 o->op_private |= OPpRUNTIME;
5854 Perl_ck_method(pTHX_ OP *o)
5856 OP *kid = cUNOPo->op_first;
5857 if (kid->op_type == OP_CONST) {
5858 SV* sv = kSVOP->op_sv;
5859 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5861 (void)SvUPGRADE(sv, SVt_PVIV);
5863 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5864 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5865 kSVOP->op_sv = Nullsv;
5874 Perl_ck_null(pTHX_ OP *o)
5880 Perl_ck_open(pTHX_ OP *o)
5882 HV *table = GvHV(PL_hintgv);
5886 svp = hv_fetch(table, "open_IN", 7, FALSE);
5888 mode = mode_from_discipline(*svp);
5889 if (mode & O_BINARY)
5890 o->op_private |= OPpOPEN_IN_RAW;
5891 else if (mode & O_TEXT)
5892 o->op_private |= OPpOPEN_IN_CRLF;
5895 svp = hv_fetch(table, "open_OUT", 8, FALSE);
5897 mode = mode_from_discipline(*svp);
5898 if (mode & O_BINARY)
5899 o->op_private |= OPpOPEN_OUT_RAW;
5900 else if (mode & O_TEXT)
5901 o->op_private |= OPpOPEN_OUT_CRLF;
5904 if (o->op_type == OP_BACKTICK)
5910 Perl_ck_repeat(pTHX_ OP *o)
5912 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5913 o->op_private |= OPpREPEAT_DOLIST;
5914 cBINOPo->op_first = force_list(cBINOPo->op_first);
5922 Perl_ck_require(pTHX_ OP *o)
5924 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5925 SVOP *kid = (SVOP*)cUNOPo->op_first;
5927 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5929 for (s = SvPVX(kid->op_sv); *s; s++) {
5930 if (*s == ':' && s[1] == ':') {
5932 Move(s+2, s+1, strlen(s+2)+1, char);
5933 --SvCUR(kid->op_sv);
5936 if (SvREADONLY(kid->op_sv)) {
5937 SvREADONLY_off(kid->op_sv);
5938 sv_catpvn(kid->op_sv, ".pm", 3);
5939 SvREADONLY_on(kid->op_sv);
5942 sv_catpvn(kid->op_sv, ".pm", 3);
5950 Perl_ck_retarget(pTHX_ OP *o)
5952 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5959 Perl_ck_select(pTHX_ OP *o)
5962 if (o->op_flags & OPf_KIDS) {
5963 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5964 if (kid && kid->op_sibling) {
5965 o->op_type = OP_SSELECT;
5966 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5968 return fold_constants(o);
5972 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5973 if (kid && kid->op_type == OP_RV2GV)
5974 kid->op_private &= ~HINT_STRICT_REFS;
5979 Perl_ck_shift(pTHX_ OP *o)
5981 I32 type = o->op_type;
5983 if (!(o->op_flags & OPf_KIDS)) {
5988 if (!CvUNIQUE(PL_compcv)) {
5989 argop = newOP(OP_PADAV, OPf_REF);
5990 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5993 argop = newUNOP(OP_RV2AV, 0,
5994 scalar(newGVOP(OP_GV, 0,
5995 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5998 argop = newUNOP(OP_RV2AV, 0,
5999 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
6000 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6001 #endif /* USE_THREADS */
6002 return newUNOP(type, 0, scalar(argop));
6004 return scalar(modkids(ck_fun(o), type));
6008 Perl_ck_sort(pTHX_ OP *o)
6013 if (PL_hints & HINT_LOCALE)
6014 o->op_private |= OPpLOCALE;
6017 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
6019 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6020 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
6022 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
6024 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
6026 if (kid->op_type == OP_SCOPE) {
6030 else if (kid->op_type == OP_LEAVE) {
6031 if (o->op_type == OP_SORT) {
6032 null(kid); /* wipe out leave */
6035 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
6036 if (k->op_next == kid)
6038 /* don't descend into loops */
6039 else if (k->op_type == OP_ENTERLOOP
6040 || k->op_type == OP_ENTERITER)
6042 k = cLOOPx(k)->op_lastop;
6047 kid->op_next = 0; /* just disconnect the leave */
6048 k = kLISTOP->op_first;
6053 if (o->op_type == OP_SORT) {
6054 /* provide scalar context for comparison function/block */
6060 o->op_flags |= OPf_SPECIAL;
6062 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
6065 firstkid = firstkid->op_sibling;
6068 /* provide list context for arguments */
6069 if (o->op_type == OP_SORT)
6076 S_simplify_sort(pTHX_ OP *o)
6079 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6083 if (!(o->op_flags & OPf_STACKED))
6085 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
6086 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
6087 kid = kUNOP->op_first; /* get past null */
6088 if (kid->op_type != OP_SCOPE)
6090 kid = kLISTOP->op_last; /* get past scope */
6091 switch(kid->op_type) {
6099 k = kid; /* remember this node*/
6100 if (kBINOP->op_first->op_type != OP_RV2SV)
6102 kid = kBINOP->op_first; /* get past cmp */
6103 if (kUNOP->op_first->op_type != OP_GV)
6105 kid = kUNOP->op_first; /* get past rv2sv */
6107 if (GvSTASH(gv) != PL_curstash)
6109 if (strEQ(GvNAME(gv), "a"))
6111 else if (strEQ(GvNAME(gv), "b"))
6115 kid = k; /* back to cmp */
6116 if (kBINOP->op_last->op_type != OP_RV2SV)
6118 kid = kBINOP->op_last; /* down to 2nd arg */
6119 if (kUNOP->op_first->op_type != OP_GV)
6121 kid = kUNOP->op_first; /* get past rv2sv */
6123 if (GvSTASH(gv) != PL_curstash
6125 ? strNE(GvNAME(gv), "a")
6126 : strNE(GvNAME(gv), "b")))
6128 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6130 o->op_private |= OPpSORT_REVERSE;
6131 if (k->op_type == OP_NCMP)
6132 o->op_private |= OPpSORT_NUMERIC;
6133 if (k->op_type == OP_I_NCMP)
6134 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6135 kid = cLISTOPo->op_first->op_sibling;
6136 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6137 op_free(kid); /* then delete it */
6138 cLISTOPo->op_children--;
6142 Perl_ck_split(pTHX_ OP *o)
6146 if (o->op_flags & OPf_STACKED)
6147 return no_fh_allowed(o);
6149 kid = cLISTOPo->op_first;
6150 if (kid->op_type != OP_NULL)
6151 Perl_croak(aTHX_ "panic: ck_split");
6152 kid = kid->op_sibling;
6153 op_free(cLISTOPo->op_first);
6154 cLISTOPo->op_first = kid;
6156 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6157 cLISTOPo->op_last = kid; /* There was only one element previously */
6160 if (kid->op_type != OP_MATCH) {
6161 OP *sibl = kid->op_sibling;
6162 kid->op_sibling = 0;
6163 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6164 if (cLISTOPo->op_first == cLISTOPo->op_last)
6165 cLISTOPo->op_last = kid;
6166 cLISTOPo->op_first = kid;
6167 kid->op_sibling = sibl;
6170 kid->op_type = OP_PUSHRE;
6171 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6174 if (!kid->op_sibling)
6175 append_elem(OP_SPLIT, o, newDEFSVOP());
6177 kid = kid->op_sibling;
6180 if (!kid->op_sibling)
6181 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6183 kid = kid->op_sibling;
6186 if (kid->op_sibling)
6187 return too_many_arguments(o,PL_op_desc[o->op_type]);
6193 Perl_ck_join(pTHX_ OP *o)
6195 if (ckWARN(WARN_SYNTAX)) {
6196 OP *kid = cLISTOPo->op_first->op_sibling;
6197 if (kid && kid->op_type == OP_MATCH) {
6198 char *pmstr = "STRING";
6199 if (kPMOP->op_pmregexp)
6200 pmstr = kPMOP->op_pmregexp->precomp;
6201 Perl_warner(aTHX_ WARN_SYNTAX,
6202 "/%s/ should probably be written as \"%s\"",
6210 Perl_ck_subr(pTHX_ OP *o)
6213 OP *prev = ((cUNOPo->op_first->op_sibling)
6214 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6215 OP *o2 = prev->op_sibling;
6224 o->op_private |= OPpENTERSUB_HASTARG;
6225 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6226 if (cvop->op_type == OP_RV2CV) {
6228 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6229 null(cvop); /* disable rv2cv */
6230 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6231 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6232 GV *gv = cGVOPx_gv(tmpop);
6235 tmpop->op_private |= OPpEARLY_CV;
6236 else if (SvPOK(cv)) {
6237 namegv = CvANON(cv) ? gv : CvGV(cv);
6238 proto = SvPV((SV*)cv, n_a);
6242 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6243 if (o2->op_type == OP_CONST)
6244 o2->op_private &= ~OPpCONST_STRICT;
6245 else if (o2->op_type == OP_LIST) {
6246 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6247 if (o && o->op_type == OP_CONST)
6248 o->op_private &= ~OPpCONST_STRICT;
6251 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6252 if (PERLDB_SUB && PL_curstash != PL_debstash)
6253 o->op_private |= OPpENTERSUB_DB;
6254 while (o2 != cvop) {
6258 return too_many_arguments(o, gv_ename(namegv));
6276 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6278 arg == 1 ? "block or sub {}" : "sub {}",
6279 gv_ename(namegv), o2);
6282 /* '*' allows any scalar type, including bareword */
6285 if (o2->op_type == OP_RV2GV)
6286 goto wrapref; /* autoconvert GLOB -> GLOBref */
6287 else if (o2->op_type == OP_CONST)
6288 o2->op_private &= ~OPpCONST_STRICT;
6289 else if (o2->op_type == OP_ENTERSUB) {
6290 /* accidental subroutine, revert to bareword */
6291 OP *gvop = ((UNOP*)o2)->op_first;
6292 if (gvop && gvop->op_type == OP_NULL) {
6293 gvop = ((UNOP*)gvop)->op_first;
6295 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6298 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6299 (gvop = ((UNOP*)gvop)->op_first) &&
6300 gvop->op_type == OP_GV)
6302 GV *gv = cGVOPx_gv(gvop);
6303 OP *sibling = o2->op_sibling;
6304 SV *n = newSVpvn("",0);
6306 gv_fullname3(n, gv, "");
6307 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6308 sv_chop(n, SvPVX(n)+6);
6309 o2 = newSVOP(OP_CONST, 0, n);
6310 prev->op_sibling = o2;
6311 o2->op_sibling = sibling;
6323 if (o2->op_type != OP_RV2GV)
6324 bad_type(arg, "symbol", gv_ename(namegv), o2);
6327 if (o2->op_type != OP_ENTERSUB)
6328 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6331 if (o2->op_type != OP_RV2SV
6332 && o2->op_type != OP_PADSV
6333 && o2->op_type != OP_HELEM
6334 && o2->op_type != OP_AELEM
6335 && o2->op_type != OP_THREADSV)
6337 bad_type(arg, "scalar", gv_ename(namegv), o2);
6341 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6342 bad_type(arg, "array", gv_ename(namegv), o2);
6345 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6346 bad_type(arg, "hash", gv_ename(namegv), o2);
6350 OP* sib = kid->op_sibling;
6351 kid->op_sibling = 0;
6352 o2 = newUNOP(OP_REFGEN, 0, kid);
6353 o2->op_sibling = sib;
6354 prev->op_sibling = o2;
6365 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6366 gv_ename(namegv), SvPV((SV*)cv, n_a));
6371 mod(o2, OP_ENTERSUB);
6373 o2 = o2->op_sibling;
6375 if (proto && !optional &&
6376 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6377 return too_few_arguments(o, gv_ename(namegv));
6382 Perl_ck_svconst(pTHX_ OP *o)
6384 SvREADONLY_on(cSVOPo->op_sv);
6389 Perl_ck_trunc(pTHX_ OP *o)
6391 if (o->op_flags & OPf_KIDS) {
6392 SVOP *kid = (SVOP*)cUNOPo->op_first;
6394 if (kid->op_type == OP_NULL)
6395 kid = (SVOP*)kid->op_sibling;
6396 if (kid && kid->op_type == OP_CONST &&
6397 (kid->op_private & OPpCONST_BARE))
6399 o->op_flags |= OPf_SPECIAL;
6400 kid->op_private &= ~OPpCONST_STRICT;
6406 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6409 Perl_peep(pTHX_ register OP *o)
6412 register OP* oldop = 0;
6414 OP *last_composite = Nullop;
6416 if (!o || o->op_seq)
6420 SAVEVPTR(PL_curcop);
6421 for (; o; o = o->op_next) {
6427 switch (o->op_type) {
6431 PL_curcop = ((COP*)o); /* for warnings */
6432 o->op_seq = PL_op_seqmax++;
6433 last_composite = Nullop;
6437 if (cSVOPo->op_private & OPpCONST_STRICT)
6438 no_bareword_allowed(o);
6440 /* Relocate sv to the pad for thread safety.
6441 * Despite being a "constant", the SV is written to,
6442 * for reference counts, sv_upgrade() etc. */
6444 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6445 if (SvPADTMP(cSVOPo->op_sv)) {
6446 /* If op_sv is already a PADTMP then it is being used by
6447 * another pad, so make a copy. */
6448 sv_setsv(PL_curpad[ix],cSVOPo->op_sv);
6449 SvREADONLY_on(PL_curpad[ix]);
6450 SvREFCNT_dec(cSVOPo->op_sv);
6453 SvREFCNT_dec(PL_curpad[ix]);
6454 SvPADTMP_on(cSVOPo->op_sv);
6455 PL_curpad[ix] = cSVOPo->op_sv;
6457 cSVOPo->op_sv = Nullsv;
6461 o->op_seq = PL_op_seqmax++;
6465 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6466 if (o->op_next->op_private & OPpTARGET_MY) {
6467 if (o->op_flags & OPf_STACKED) /* chained concats */
6468 goto ignore_optimization;
6470 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6471 o->op_targ = o->op_next->op_targ;
6472 o->op_next->op_targ = 0;
6473 o->op_private |= OPpTARGET_MY;
6478 ignore_optimization:
6479 o->op_seq = PL_op_seqmax++;
6482 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6483 o->op_seq = PL_op_seqmax++;
6484 break; /* Scalar stub must produce undef. List stub is noop */
6488 if (o->op_targ == OP_NEXTSTATE
6489 || o->op_targ == OP_DBSTATE
6490 || o->op_targ == OP_SETSTATE)
6492 PL_curcop = ((COP*)o);
6499 if (oldop && o->op_next) {
6500 oldop->op_next = o->op_next;
6503 o->op_seq = PL_op_seqmax++;
6507 if (o->op_next->op_type == OP_RV2SV) {
6508 if (!(o->op_next->op_private & OPpDEREF)) {
6510 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6512 o->op_next = o->op_next->op_next;
6513 o->op_type = OP_GVSV;
6514 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6517 else if (o->op_next->op_type == OP_RV2AV) {
6518 OP* pop = o->op_next->op_next;
6520 if (pop->op_type == OP_CONST &&
6521 (PL_op = pop->op_next) &&
6522 pop->op_next->op_type == OP_AELEM &&
6523 !(pop->op_next->op_private &
6524 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6525 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6533 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6534 o->op_next = pop->op_next->op_next;
6535 o->op_type = OP_AELEMFAST;
6536 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6537 o->op_private = (U8)i;
6542 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6544 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6545 /* XXX could check prototype here instead of just carping */
6546 SV *sv = sv_newmortal();
6547 gv_efullname3(sv, gv, Nullch);
6548 Perl_warner(aTHX_ WARN_PROTOTYPE,
6549 "%s() called too early to check prototype",
6554 o->op_seq = PL_op_seqmax++;
6565 o->op_seq = PL_op_seqmax++;
6566 while (cLOGOP->op_other->op_type == OP_NULL)
6567 cLOGOP->op_other = cLOGOP->op_other->op_next;
6568 peep(cLOGOP->op_other);
6572 o->op_seq = PL_op_seqmax++;
6573 peep(cLOOP->op_redoop);
6574 peep(cLOOP->op_nextop);
6575 peep(cLOOP->op_lastop);
6581 o->op_seq = PL_op_seqmax++;
6582 peep(cPMOP->op_pmreplstart);
6586 o->op_seq = PL_op_seqmax++;
6587 if (ckWARN(WARN_SYNTAX) && o->op_next
6588 && o->op_next->op_type == OP_NEXTSTATE) {
6589 if (o->op_next->op_sibling &&
6590 o->op_next->op_sibling->op_type != OP_EXIT &&
6591 o->op_next->op_sibling->op_type != OP_WARN &&
6592 o->op_next->op_sibling->op_type != OP_DIE) {
6593 line_t oldline = CopLINE(PL_curcop);
6595 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6596 Perl_warner(aTHX_ WARN_EXEC,
6597 "Statement unlikely to be reached");
6598 Perl_warner(aTHX_ WARN_EXEC,
6599 "\t(Maybe you meant system() when you said exec()?)\n");
6600 CopLINE_set(PL_curcop, oldline);
6609 SV **svp, **indsvp, *sv;
6614 o->op_seq = PL_op_seqmax++;
6615 if ((o->op_private & (OPpLVAL_INTRO))
6616 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6618 rop = (UNOP*)((BINOP*)o)->op_first;
6619 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6621 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6622 if (!SvOBJECT(lexname))
6624 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6625 if (!fields || !GvHV(*fields))
6627 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6628 key = SvPV(*svp, keylen);
6629 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6631 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6632 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6634 ind = SvIV(*indsvp);
6636 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6637 rop->op_type = OP_RV2AV;
6638 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6639 o->op_type = OP_AELEM;
6640 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6642 if (SvREADONLY(*svp))
6644 SvFLAGS(sv) |= (SvFLAGS(*svp)
6645 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6655 SV **svp, **indsvp, *sv;
6659 SVOP *first_key_op, *key_op;
6661 o->op_seq = PL_op_seqmax++;
6662 if ((o->op_private & (OPpLVAL_INTRO))
6663 /* I bet there's always a pushmark... */
6664 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
6665 /* hmmm, no optimization if list contains only one key. */
6667 rop = (UNOP*)((LISTOP*)o)->op_last;
6668 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6670 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6671 if (!SvOBJECT(lexname))
6673 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6674 if (!fields || !GvHV(*fields))
6676 /* Again guessing that the pushmark can be jumped over.... */
6677 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
6678 ->op_first->op_sibling;
6679 /* Check that the key list contains only constants. */
6680 for (key_op = first_key_op; key_op;
6681 key_op = (SVOP*)key_op->op_sibling)
6682 if (key_op->op_type != OP_CONST)
6686 rop->op_type = OP_RV2AV;
6687 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6688 o->op_type = OP_ASLICE;
6689 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
6690 for (key_op = first_key_op; key_op;
6691 key_op = (SVOP*)key_op->op_sibling) {
6692 svp = cSVOPx_svp(key_op);
6693 key = SvPV(*svp, keylen);
6694 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6696 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
6697 "in variable %s of type %s",
6698 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6700 ind = SvIV(*indsvp);
6702 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6704 if (SvREADONLY(*svp))
6706 SvFLAGS(sv) |= (SvFLAGS(*svp)
6707 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6716 if (!(o->op_flags & OPf_WANT)
6717 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6721 o->op_seq = PL_op_seqmax++;
6725 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6726 o->op_seq = PL_op_seqmax++;
6732 if (last_composite) {
6733 OP *r = last_composite;
6735 while (r->op_sibling)
6738 || (r->op_next->op_type == OP_LIST
6739 && r->op_next->op_next == o))
6741 if (last_composite->op_type == OP_RV2AV)
6742 yyerror("Lvalue subs returning arrays not implemented yet");
6744 yyerror("Lvalue subs returning hashes not implemented yet");
6751 o->op_seq = PL_op_seqmax++;