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;
788 SvREFCNT_dec(cSVOPo->op_sv);
789 cSVOPo->op_sv = Nullsv;
795 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
799 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
800 SvREFCNT_dec(cSVOPo->op_sv);
801 cSVOPo->op_sv = Nullsv;
804 Safefree(cPVOPo->op_pv);
805 cPVOPo->op_pv = Nullch;
809 op_free(cPMOPo->op_pmreplroot);
813 if ((PADOFFSET)cPMOPo->op_pmreplroot) {
815 GV *gv = (GV*)PL_curpad[(PADOFFSET)cPMOPo->op_pmreplroot];
816 pad_swipe((PADOFFSET)cPMOPo->op_pmreplroot);
817 /* No GvIN_PAD_off(gv) here, because other references may still
818 * exist on the pad */
823 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
829 cPMOPo->op_pmreplroot = Nullop;
830 ReREFCNT_dec(cPMOPo->op_pmregexp);
831 cPMOPo->op_pmregexp = (REGEXP*)NULL;
835 if (o->op_targ > 0) {
836 pad_free(o->op_targ);
842 S_cop_free(pTHX_ COP* cop)
844 Safefree(cop->cop_label);
846 Safefree(CopFILE(cop)); /* XXXXX share in a pvtable? */
847 Safefree(CopSTASHPV(cop)); /* XXXXX share in a pvtable? */
849 /* NOTE: COP.cop_stash is not refcounted */
850 SvREFCNT_dec(CopFILEGV(cop));
852 if (! specialWARN(cop->cop_warnings))
853 SvREFCNT_dec(cop->cop_warnings);
859 if (o->op_type == OP_NULL)
862 o->op_targ = o->op_type;
863 o->op_type = OP_NULL;
864 o->op_ppaddr = PL_ppaddr[OP_NULL];
867 /* Contextualizers */
869 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
872 Perl_linklist(pTHX_ OP *o)
879 /* establish postfix order */
880 if (cUNOPo->op_first) {
881 o->op_next = LINKLIST(cUNOPo->op_first);
882 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
884 kid->op_next = LINKLIST(kid->op_sibling);
896 Perl_scalarkids(pTHX_ OP *o)
899 if (o && o->op_flags & OPf_KIDS) {
900 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
907 S_scalarboolean(pTHX_ OP *o)
909 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
911 if (ckWARN(WARN_SYNTAX)) {
912 line_t oldline = CopLINE(PL_curcop);
914 if (PL_copline != NOLINE)
915 CopLINE_set(PL_curcop, PL_copline);
916 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
917 CopLINE_set(PL_curcop, oldline);
924 Perl_scalar(pTHX_ OP *o)
928 /* assumes no premature commitment */
929 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
930 || o->op_type == OP_RETURN)
935 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
937 switch (o->op_type) {
939 if (o->op_private & OPpREPEAT_DOLIST)
940 null(((LISTOP*)cBINOPo->op_first)->op_first);
941 scalar(cBINOPo->op_first);
946 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
950 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
951 if (!kPMOP->op_pmreplroot)
952 deprecate("implicit split to @_");
960 if (o->op_flags & OPf_KIDS) {
961 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
967 kid = cLISTOPo->op_first;
969 while ((kid = kid->op_sibling)) {
975 WITH_THR(PL_curcop = &PL_compiling);
980 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
986 WITH_THR(PL_curcop = &PL_compiling);
993 Perl_scalarvoid(pTHX_ OP *o)
1000 if (o->op_type == OP_NEXTSTATE
1001 || o->op_type == OP_SETSTATE
1002 || o->op_type == OP_DBSTATE
1003 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1004 || o->op_targ == OP_SETSTATE
1005 || o->op_targ == OP_DBSTATE)))
1008 PL_curcop = (COP*)o; /* for warning below */
1011 /* assumes no premature commitment */
1012 want = o->op_flags & OPf_WANT;
1013 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
1014 || o->op_type == OP_RETURN)
1019 if ((o->op_private & OPpTARGET_MY)
1020 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1022 return scalar(o); /* As if inside SASSIGN */
1025 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1027 switch (o->op_type) {
1029 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1033 if (o->op_flags & OPf_STACKED)
1037 if (o->op_private == 4)
1079 case OP_GETSOCKNAME:
1080 case OP_GETPEERNAME:
1085 case OP_GETPRIORITY:
1108 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1109 useless = PL_op_desc[o->op_type];
1116 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1117 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1118 useless = "a variable";
1123 if (cSVOPo->op_private & OPpCONST_STRICT)
1124 no_bareword_allowed(o);
1127 if (ckWARN(WARN_VOID)) {
1128 useless = "a constant";
1129 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1131 else if (SvPOK(sv)) {
1132 if (strnEQ(SvPVX(sv), "di", 2) ||
1133 strnEQ(SvPVX(sv), "ds", 2) ||
1134 strnEQ(SvPVX(sv), "ig", 2))
1139 null(o); /* don't execute or even remember it */
1143 o->op_type = OP_PREINC; /* pre-increment is faster */
1144 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1148 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1149 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1155 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1160 if (o->op_flags & OPf_STACKED)
1168 if (!(o->op_flags & OPf_KIDS))
1177 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1184 /* all requires must return a boolean value */
1185 o->op_flags &= ~OPf_WANT;
1188 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1189 if (!kPMOP->op_pmreplroot)
1190 deprecate("implicit split to @_");
1196 if (ckWARN(WARN_VOID))
1197 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1203 Perl_listkids(pTHX_ OP *o)
1206 if (o && o->op_flags & OPf_KIDS) {
1207 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1214 Perl_list(pTHX_ OP *o)
1218 /* assumes no premature commitment */
1219 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1220 || o->op_type == OP_RETURN)
1225 if ((o->op_private & OPpTARGET_MY)
1226 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1228 return o; /* As if inside SASSIGN */
1231 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1233 switch (o->op_type) {
1236 list(cBINOPo->op_first);
1241 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1249 if (!(o->op_flags & OPf_KIDS))
1251 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1252 list(cBINOPo->op_first);
1253 return gen_constant_list(o);
1260 kid = cLISTOPo->op_first;
1262 while ((kid = kid->op_sibling)) {
1263 if (kid->op_sibling)
1268 WITH_THR(PL_curcop = &PL_compiling);
1272 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1273 if (kid->op_sibling)
1278 WITH_THR(PL_curcop = &PL_compiling);
1281 /* all requires must return a boolean value */
1282 o->op_flags &= ~OPf_WANT;
1289 Perl_scalarseq(pTHX_ OP *o)
1294 if (o->op_type == OP_LINESEQ ||
1295 o->op_type == OP_SCOPE ||
1296 o->op_type == OP_LEAVE ||
1297 o->op_type == OP_LEAVETRY)
1300 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1301 if (kid->op_sibling) {
1305 PL_curcop = &PL_compiling;
1307 o->op_flags &= ~OPf_PARENS;
1308 if (PL_hints & HINT_BLOCK_SCOPE)
1309 o->op_flags |= OPf_PARENS;
1312 o = newOP(OP_STUB, 0);
1317 S_modkids(pTHX_ OP *o, I32 type)
1320 if (o && o->op_flags & OPf_KIDS) {
1321 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1328 Perl_mod(pTHX_ OP *o, I32 type)
1334 if (!o || PL_error_count)
1337 if ((o->op_private & OPpTARGET_MY)
1338 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1343 switch (o->op_type) {
1348 if (!(o->op_private & (OPpCONST_ARYBASE)))
1350 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1351 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1355 SAVEI32(PL_compiling.cop_arybase);
1356 PL_compiling.cop_arybase = 0;
1358 else if (type == OP_REFGEN)
1361 Perl_croak(aTHX_ "That use of $[ is unsupported");
1364 if (o->op_flags & OPf_PARENS)
1368 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1369 !(o->op_flags & OPf_STACKED)) {
1370 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1371 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1372 assert(cUNOPo->op_first->op_type == OP_NULL);
1373 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1376 else { /* lvalue subroutine call */
1377 o->op_private |= OPpLVAL_INTRO;
1378 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1379 /* Backward compatibility mode: */
1380 o->op_private |= OPpENTERSUB_INARGS;
1383 else { /* Compile-time error message: */
1384 OP *kid = cUNOPo->op_first;
1388 if (kid->op_type == OP_PUSHMARK)
1390 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1392 "panic: unexpected lvalue entersub "
1393 "args: type/targ %ld:%ld",
1394 (long)kid->op_type,kid->op_targ);
1395 kid = kLISTOP->op_first;
1397 while (kid->op_sibling)
1398 kid = kid->op_sibling;
1399 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1401 if (kid->op_type == OP_METHOD_NAMED
1402 || kid->op_type == OP_METHOD)
1406 if (kid->op_sibling || kid->op_next != kid) {
1407 yyerror("panic: unexpected optree near method call");
1411 NewOp(1101, newop, 1, UNOP);
1412 newop->op_type = OP_RV2CV;
1413 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1414 newop->op_first = Nullop;
1415 newop->op_next = (OP*)newop;
1416 kid->op_sibling = (OP*)newop;
1417 newop->op_private |= OPpLVAL_INTRO;
1421 if (kid->op_type != OP_RV2CV)
1423 "panic: unexpected lvalue entersub "
1424 "entry via type/targ %ld:%ld",
1425 (long)kid->op_type,kid->op_targ);
1426 kid->op_private |= OPpLVAL_INTRO;
1427 break; /* Postpone until runtime */
1431 kid = kUNOP->op_first;
1432 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1433 kid = kUNOP->op_first;
1434 if (kid->op_type == OP_NULL)
1436 "Unexpected constant lvalue entersub "
1437 "entry via type/targ %ld:%ld",
1438 (long)kid->op_type,kid->op_targ);
1439 if (kid->op_type != OP_GV) {
1440 /* Restore RV2CV to check lvalueness */
1442 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1443 okid->op_next = kid->op_next;
1444 kid->op_next = okid;
1447 okid->op_next = Nullop;
1448 okid->op_type = OP_RV2CV;
1450 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1451 okid->op_private |= OPpLVAL_INTRO;
1455 cv = GvCV(kGVOP_gv);
1465 /* grep, foreach, subcalls, refgen */
1466 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1468 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1469 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1471 : (o->op_type == OP_ENTERSUB
1472 ? "non-lvalue subroutine call"
1473 : PL_op_desc[o->op_type])),
1474 type ? PL_op_desc[type] : "local"));
1488 case OP_RIGHT_SHIFT:
1497 if (!(o->op_flags & OPf_STACKED))
1503 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1509 if (!type && cUNOPo->op_first->op_type != OP_GV)
1510 Perl_croak(aTHX_ "Can't localize through a reference");
1511 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1512 PL_modcount = 10000;
1513 return o; /* Treat \(@foo) like ordinary list. */
1517 if (scalar_mod_type(o, type))
1519 ref(cUNOPo->op_first, o->op_type);
1528 PL_modcount = 10000;
1531 if (!type && cUNOPo->op_first->op_type != OP_GV)
1532 Perl_croak(aTHX_ "Can't localize through a reference");
1533 ref(cUNOPo->op_first, o->op_type);
1537 PL_hints |= HINT_BLOCK_SCOPE;
1547 PL_modcount = 10000;
1548 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1549 return o; /* Treat \(@foo) like ordinary list. */
1550 if (scalar_mod_type(o, type))
1556 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1557 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1562 PL_modcount++; /* XXX ??? */
1564 #endif /* USE_THREADS */
1570 if (type != OP_SASSIGN)
1574 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1580 pad_free(o->op_targ);
1581 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1582 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1583 if (o->op_flags & OPf_KIDS)
1584 mod(cBINOPo->op_first->op_sibling, type);
1589 ref(cBINOPo->op_first, o->op_type);
1590 if (type == OP_ENTERSUB &&
1591 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1592 o->op_private |= OPpLVAL_DEFER;
1599 if (o->op_flags & OPf_KIDS)
1600 mod(cLISTOPo->op_last, type);
1604 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1606 else if (!(o->op_flags & OPf_KIDS))
1608 if (o->op_targ != OP_LIST) {
1609 mod(cBINOPo->op_first, type);
1614 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1618 o->op_flags |= OPf_MOD;
1620 if (type == OP_AASSIGN || type == OP_SASSIGN)
1621 o->op_flags |= OPf_SPECIAL|OPf_REF;
1623 o->op_private |= OPpLVAL_INTRO;
1624 o->op_flags &= ~OPf_SPECIAL;
1625 PL_hints |= HINT_BLOCK_SCOPE;
1627 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1628 o->op_flags |= OPf_REF;
1633 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1637 if (o->op_type == OP_RV2GV)
1661 case OP_RIGHT_SHIFT:
1680 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1682 switch (o->op_type) {
1690 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1703 Perl_refkids(pTHX_ OP *o, I32 type)
1706 if (o && o->op_flags & OPf_KIDS) {
1707 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1714 Perl_ref(pTHX_ OP *o, I32 type)
1718 if (!o || PL_error_count)
1721 switch (o->op_type) {
1723 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1724 !(o->op_flags & OPf_STACKED)) {
1725 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1726 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1727 assert(cUNOPo->op_first->op_type == OP_NULL);
1728 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1729 o->op_flags |= OPf_SPECIAL;
1734 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1738 if (type == OP_DEFINED)
1739 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1740 ref(cUNOPo->op_first, o->op_type);
1743 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1744 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1745 : type == OP_RV2HV ? OPpDEREF_HV
1747 o->op_flags |= OPf_MOD;
1752 o->op_flags |= OPf_MOD; /* XXX ??? */
1757 o->op_flags |= OPf_REF;
1760 if (type == OP_DEFINED)
1761 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1762 ref(cUNOPo->op_first, o->op_type);
1767 o->op_flags |= OPf_REF;
1772 if (!(o->op_flags & OPf_KIDS))
1774 ref(cBINOPo->op_first, type);
1778 ref(cBINOPo->op_first, o->op_type);
1779 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1780 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1781 : type == OP_RV2HV ? OPpDEREF_HV
1783 o->op_flags |= OPf_MOD;
1791 if (!(o->op_flags & OPf_KIDS))
1793 ref(cLISTOPo->op_last, type);
1803 S_dup_attrlist(pTHX_ OP *o)
1807 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1808 * where the first kid is OP_PUSHMARK and the remaining ones
1809 * are OP_CONST. We need to push the OP_CONST values.
1811 if (o->op_type == OP_CONST)
1812 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1814 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1815 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1816 if (o->op_type == OP_CONST)
1817 rop = append_elem(OP_LIST, rop,
1818 newSVOP(OP_CONST, o->op_flags,
1819 SvREFCNT_inc(cSVOPo->op_sv)));
1826 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1830 /* fake up C<use attributes $pkg,$rv,@attrs> */
1831 ENTER; /* need to protect against side-effects of 'use' */
1833 if (stash && HvNAME(stash))
1834 stashsv = newSVpv(HvNAME(stash), 0);
1836 stashsv = &PL_sv_no;
1838 #define ATTRSMODULE "attributes"
1840 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1841 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1843 prepend_elem(OP_LIST,
1844 newSVOP(OP_CONST, 0, stashsv),
1845 prepend_elem(OP_LIST,
1846 newSVOP(OP_CONST, 0,
1848 dup_attrlist(attrs))));
1853 S_my_kid(pTHX_ OP *o, OP *attrs)
1858 if (!o || PL_error_count)
1862 if (type == OP_LIST) {
1863 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1865 } else if (type == OP_UNDEF) {
1867 } else if (type == OP_RV2SV || /* "our" declaration */
1869 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1870 o->op_private |= OPpOUR_INTRO;
1872 } else if (type != OP_PADSV &&
1875 type != OP_PUSHMARK)
1877 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1878 PL_op_desc[o->op_type],
1879 PL_in_my == KEY_our ? "our" : "my"));
1882 else if (attrs && type != OP_PUSHMARK) {
1888 PL_in_my_stash = Nullhv;
1890 /* check for C<my Dog $spot> when deciding package */
1891 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1892 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1893 stash = SvSTASH(*namesvp);
1895 stash = PL_curstash;
1896 padsv = PAD_SV(o->op_targ);
1897 apply_attrs(stash, padsv, attrs);
1899 o->op_flags |= OPf_MOD;
1900 o->op_private |= OPpLVAL_INTRO;
1905 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1907 if (o->op_flags & OPf_PARENS)
1911 o = my_kid(o, attrs);
1913 PL_in_my_stash = Nullhv;
1918 Perl_my(pTHX_ OP *o)
1920 return my_kid(o, Nullop);
1924 Perl_sawparens(pTHX_ OP *o)
1927 o->op_flags |= OPf_PARENS;
1932 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1937 if (ckWARN(WARN_MISC) &&
1938 (left->op_type == OP_RV2AV ||
1939 left->op_type == OP_RV2HV ||
1940 left->op_type == OP_PADAV ||
1941 left->op_type == OP_PADHV)) {
1942 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1943 right->op_type == OP_TRANS)
1944 ? right->op_type : OP_MATCH];
1945 const char *sample = ((left->op_type == OP_RV2AV ||
1946 left->op_type == OP_PADAV)
1947 ? "@array" : "%hash");
1948 Perl_warner(aTHX_ WARN_MISC,
1949 "Applying %s to %s will act on scalar(%s)",
1950 desc, sample, sample);
1953 if (right->op_type == OP_MATCH ||
1954 right->op_type == OP_SUBST ||
1955 right->op_type == OP_TRANS) {
1956 right->op_flags |= OPf_STACKED;
1957 if (right->op_type != OP_MATCH)
1958 left = mod(left, right->op_type);
1959 if (right->op_type == OP_TRANS)
1960 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1962 o = prepend_elem(right->op_type, scalar(left), right);
1964 return newUNOP(OP_NOT, 0, scalar(o));
1968 return bind_match(type, left,
1969 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1973 Perl_invert(pTHX_ OP *o)
1977 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1978 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1982 Perl_scope(pTHX_ OP *o)
1985 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1986 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1987 o->op_type = OP_LEAVE;
1988 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1991 if (o->op_type == OP_LINESEQ) {
1993 o->op_type = OP_SCOPE;
1994 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1995 kid = ((LISTOP*)o)->op_first;
1996 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2000 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
2007 Perl_save_hints(pTHX)
2010 SAVESPTR(GvHV(PL_hintgv));
2011 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
2012 SAVEFREESV(GvHV(PL_hintgv));
2016 Perl_block_start(pTHX_ int full)
2019 int retval = PL_savestack_ix;
2021 SAVEI32(PL_comppad_name_floor);
2022 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
2024 PL_comppad_name_fill = PL_comppad_name_floor;
2025 if (PL_comppad_name_floor < 0)
2026 PL_comppad_name_floor = 0;
2027 SAVEI32(PL_min_intro_pending);
2028 SAVEI32(PL_max_intro_pending);
2029 PL_min_intro_pending = 0;
2030 SAVEI32(PL_comppad_name_fill);
2031 SAVEI32(PL_padix_floor);
2032 PL_padix_floor = PL_padix;
2033 PL_pad_reset_pending = FALSE;
2035 PL_hints &= ~HINT_BLOCK_SCOPE;
2036 SAVESPTR(PL_compiling.cop_warnings);
2037 if (! specialWARN(PL_compiling.cop_warnings)) {
2038 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2039 SAVEFREESV(PL_compiling.cop_warnings) ;
2045 Perl_block_end(pTHX_ I32 floor, OP *seq)
2048 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2049 OP* retval = scalarseq(seq);
2051 PL_pad_reset_pending = FALSE;
2052 PL_compiling.op_private = PL_hints;
2054 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2055 pad_leavemy(PL_comppad_name_fill);
2064 OP *o = newOP(OP_THREADSV, 0);
2065 o->op_targ = find_threadsv("_");
2068 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2069 #endif /* USE_THREADS */
2073 Perl_newPROG(pTHX_ OP *o)
2079 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2080 ((PL_in_eval & EVAL_KEEPERR)
2081 ? OPf_SPECIAL : 0), o);
2082 PL_eval_start = linklist(PL_eval_root);
2083 PL_eval_root->op_private |= OPpREFCOUNTED;
2084 OpREFCNT_set(PL_eval_root, 1);
2085 PL_eval_root->op_next = 0;
2086 peep(PL_eval_start);
2091 PL_main_root = scope(sawparens(scalarvoid(o)));
2092 PL_curcop = &PL_compiling;
2093 PL_main_start = LINKLIST(PL_main_root);
2094 PL_main_root->op_private |= OPpREFCOUNTED;
2095 OpREFCNT_set(PL_main_root, 1);
2096 PL_main_root->op_next = 0;
2097 peep(PL_main_start);
2100 /* Register with debugger */
2102 CV *cv = get_cv("DB::postponed", FALSE);
2106 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2108 call_sv((SV*)cv, G_DISCARD);
2115 Perl_localize(pTHX_ OP *o, I32 lex)
2117 if (o->op_flags & OPf_PARENS)
2121 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2123 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2124 if (*s == ';' || *s == '=')
2125 Perl_warner(aTHX_ WARN_PARENTHESIS,
2126 "Parentheses missing around \"%s\" list",
2127 lex ? (PL_in_my == KEY_our ? "our" : "my") : "local");
2133 o = mod(o, OP_NULL); /* a bit kludgey */
2135 PL_in_my_stash = Nullhv;
2140 Perl_jmaybe(pTHX_ OP *o)
2142 if (o->op_type == OP_LIST) {
2145 o2 = newOP(OP_THREADSV, 0);
2146 o2->op_targ = find_threadsv(";");
2148 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2149 #endif /* USE_THREADS */
2150 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2156 Perl_fold_constants(pTHX_ register OP *o)
2160 I32 type = o->op_type;
2163 if (PL_opargs[type] & OA_RETSCALAR)
2165 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2166 o->op_targ = pad_alloc(type, SVs_PADTMP);
2168 /* integerize op, unless it happens to be C<-foo>.
2169 * XXX should pp_i_negate() do magic string negation instead? */
2170 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2171 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2172 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2174 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2177 if (!(PL_opargs[type] & OA_FOLDCONST))
2182 /* XXX might want a ck_negate() for this */
2183 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2196 if (o->op_private & OPpLOCALE)
2201 goto nope; /* Don't try to run w/ errors */
2203 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2204 if ((curop->op_type != OP_CONST ||
2205 (curop->op_private & OPpCONST_BARE)) &&
2206 curop->op_type != OP_LIST &&
2207 curop->op_type != OP_SCALAR &&
2208 curop->op_type != OP_NULL &&
2209 curop->op_type != OP_PUSHMARK)
2215 curop = LINKLIST(o);
2219 sv = *(PL_stack_sp--);
2220 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2221 pad_swipe(o->op_targ);
2222 else if (SvTEMP(sv)) { /* grab mortal temp? */
2223 (void)SvREFCNT_inc(sv);
2227 if (type == OP_RV2GV)
2228 return newGVOP(OP_GV, 0, (GV*)sv);
2230 /* try to smush double to int, but don't smush -2.0 to -2 */
2231 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2235 if ((NV)iv == SvNV(sv)) {
2240 SvIOK_off(sv); /* undo SvIV() damage */
2242 return newSVOP(OP_CONST, 0, sv);
2246 if (!(PL_opargs[type] & OA_OTHERINT))
2249 if (!(PL_hints & HINT_INTEGER)) {
2250 if (type == OP_MODULO
2251 || type == OP_DIVIDE
2252 || !(o->op_flags & OPf_KIDS))
2257 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2258 if (curop->op_type == OP_CONST) {
2259 if (SvIOK(((SVOP*)curop)->op_sv))
2263 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2267 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2274 Perl_gen_constant_list(pTHX_ register OP *o)
2278 I32 oldtmps_floor = PL_tmps_floor;
2282 return o; /* Don't attempt to run with errors */
2284 PL_op = curop = LINKLIST(o);
2291 PL_tmps_floor = oldtmps_floor;
2293 o->op_type = OP_RV2AV;
2294 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2295 curop = ((UNOP*)o)->op_first;
2296 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2303 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2308 if (!o || o->op_type != OP_LIST)
2309 o = newLISTOP(OP_LIST, 0, o, Nullop);
2311 o->op_flags &= ~OPf_WANT;
2313 if (!(PL_opargs[type] & OA_MARK))
2314 null(cLISTOPo->op_first);
2317 o->op_ppaddr = PL_ppaddr[type];
2318 o->op_flags |= flags;
2320 o = CHECKOP(type, o);
2321 if (o->op_type != type)
2324 if (cLISTOPo->op_children < 7) {
2325 /* XXX do we really need to do this if we're done appending?? */
2326 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2328 cLISTOPo->op_last = last; /* in case check substituted last arg */
2331 return fold_constants(o);
2334 /* List constructors */
2337 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2345 if (first->op_type != type
2346 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2348 return newLISTOP(type, 0, first, last);
2351 if (first->op_flags & OPf_KIDS)
2352 ((LISTOP*)first)->op_last->op_sibling = last;
2354 first->op_flags |= OPf_KIDS;
2355 ((LISTOP*)first)->op_first = last;
2357 ((LISTOP*)first)->op_last = last;
2358 ((LISTOP*)first)->op_children++;
2363 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2371 if (first->op_type != type)
2372 return prepend_elem(type, (OP*)first, (OP*)last);
2374 if (last->op_type != type)
2375 return append_elem(type, (OP*)first, (OP*)last);
2377 first->op_last->op_sibling = last->op_first;
2378 first->op_last = last->op_last;
2379 first->op_children += last->op_children;
2380 if (first->op_children)
2381 first->op_flags |= OPf_KIDS;
2383 #ifdef PL_OP_SLAB_ALLOC
2391 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2399 if (last->op_type == type) {
2400 if (type == OP_LIST) { /* already a PUSHMARK there */
2401 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2402 ((LISTOP*)last)->op_first->op_sibling = first;
2405 if (!(last->op_flags & OPf_KIDS)) {
2406 ((LISTOP*)last)->op_last = first;
2407 last->op_flags |= OPf_KIDS;
2409 first->op_sibling = ((LISTOP*)last)->op_first;
2410 ((LISTOP*)last)->op_first = first;
2412 ((LISTOP*)last)->op_children++;
2416 return newLISTOP(type, 0, first, last);
2422 Perl_newNULLLIST(pTHX)
2424 return newOP(OP_STUB, 0);
2428 Perl_force_list(pTHX_ OP *o)
2430 if (!o || o->op_type != OP_LIST)
2431 o = newLISTOP(OP_LIST, 0, o, Nullop);
2437 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2441 NewOp(1101, listop, 1, LISTOP);
2443 listop->op_type = type;
2444 listop->op_ppaddr = PL_ppaddr[type];
2445 listop->op_children = (first != 0) + (last != 0);
2446 listop->op_flags = flags;
2450 else if (!first && last)
2453 first->op_sibling = last;
2454 listop->op_first = first;
2455 listop->op_last = last;
2456 if (type == OP_LIST) {
2458 pushop = newOP(OP_PUSHMARK, 0);
2459 pushop->op_sibling = first;
2460 listop->op_first = pushop;
2461 listop->op_flags |= OPf_KIDS;
2463 listop->op_last = pushop;
2465 else if (listop->op_children)
2466 listop->op_flags |= OPf_KIDS;
2472 Perl_newOP(pTHX_ I32 type, I32 flags)
2475 NewOp(1101, o, 1, OP);
2477 o->op_ppaddr = PL_ppaddr[type];
2478 o->op_flags = flags;
2481 o->op_private = 0 + (flags >> 8);
2482 if (PL_opargs[type] & OA_RETSCALAR)
2484 if (PL_opargs[type] & OA_TARGET)
2485 o->op_targ = pad_alloc(type, SVs_PADTMP);
2486 return CHECKOP(type, o);
2490 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2495 first = newOP(OP_STUB, 0);
2496 if (PL_opargs[type] & OA_MARK)
2497 first = force_list(first);
2499 NewOp(1101, unop, 1, UNOP);
2500 unop->op_type = type;
2501 unop->op_ppaddr = PL_ppaddr[type];
2502 unop->op_first = first;
2503 unop->op_flags = flags | OPf_KIDS;
2504 unop->op_private = 1 | (flags >> 8);
2505 unop = (UNOP*) CHECKOP(type, unop);
2509 return fold_constants((OP *) unop);
2513 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2516 NewOp(1101, binop, 1, BINOP);
2519 first = newOP(OP_NULL, 0);
2521 binop->op_type = type;
2522 binop->op_ppaddr = PL_ppaddr[type];
2523 binop->op_first = first;
2524 binop->op_flags = flags | OPf_KIDS;
2527 binop->op_private = 1 | (flags >> 8);
2530 binop->op_private = 2 | (flags >> 8);
2531 first->op_sibling = last;
2534 binop = (BINOP*)CHECKOP(type, binop);
2535 if (binop->op_next || binop->op_type != type)
2538 binop->op_last = binop->op_first->op_sibling;
2540 return fold_constants((OP *)binop);
2544 utf8compare(const void *a, const void *b)
2547 for (i = 0; i < 10; i++) {
2548 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2550 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2557 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2559 SV *tstr = ((SVOP*)expr)->op_sv;
2560 SV *rstr = ((SVOP*)repl)->op_sv;
2563 register U8 *t = (U8*)SvPV(tstr, tlen);
2564 register U8 *r = (U8*)SvPV(rstr, rlen);
2570 register short *tbl;
2572 complement = o->op_private & OPpTRANS_COMPLEMENT;
2573 del = o->op_private & OPpTRANS_DELETE;
2574 squash = o->op_private & OPpTRANS_SQUASH;
2576 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2577 SV* listsv = newSVpvn("# comment\n",10);
2579 U8* tend = t + tlen;
2580 U8* rend = r + rlen;
2595 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2596 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2599 U8 tmpbuf[UTF8_MAXLEN];
2602 New(1109, cp, tlen, U8*);
2604 transv = newSVpvn("",0);
2613 qsort(cp, i, sizeof(U8*), utf8compare);
2614 for (j = 0; j < i; j++) {
2616 UV val = utf8_to_uv(s, &ulen);
2618 diff = val - nextmin;
2620 t = uv_to_utf8(tmpbuf,nextmin);
2621 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2623 t = uv_to_utf8(tmpbuf, val - 1);
2624 sv_catpvn(transv, "\377", 1);
2625 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2629 val = utf8_to_uv(s+1, &ulen);
2633 t = uv_to_utf8(tmpbuf,nextmin);
2634 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2635 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2636 sv_catpvn(transv, "\377", 1);
2637 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2638 t = (U8*)SvPVX(transv);
2639 tlen = SvCUR(transv);
2642 else if (!rlen && !del) {
2643 r = t; rlen = tlen; rend = tend;
2646 if (to_utf && from_utf) { /* only counting characters */
2647 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2648 o->op_private |= OPpTRANS_IDENTICAL;
2650 else { /* straight latin-1 translation */
2651 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2652 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2653 o->op_private |= OPpTRANS_IDENTICAL;
2657 while (t < tend || tfirst <= tlast) {
2658 /* see if we need more "t" chars */
2659 if (tfirst > tlast) {
2660 tfirst = (I32)utf8_to_uv(t, &ulen);
2662 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2663 tlast = (I32)utf8_to_uv(++t, &ulen);
2670 /* now see if we need more "r" chars */
2671 if (rfirst > rlast) {
2673 rfirst = (I32)utf8_to_uv(r, &ulen);
2675 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2676 rlast = (I32)utf8_to_uv(++r, &ulen);
2685 rfirst = rlast = 0xffffffff;
2689 /* now see which range will peter our first, if either. */
2690 tdiff = tlast - tfirst;
2691 rdiff = rlast - rfirst;
2698 if (rfirst == 0xffffffff) {
2699 diff = tdiff; /* oops, pretend rdiff is infinite */
2701 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2702 (long)tfirst, (long)tlast);
2704 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2708 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2709 (long)tfirst, (long)(tfirst + diff),
2712 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2713 (long)tfirst, (long)rfirst);
2715 if (rfirst + diff > max)
2716 max = rfirst + diff;
2721 else if (rfirst <= 0x800)
2722 grows |= (tfirst < 0x80);
2723 else if (rfirst <= 0x10000)
2724 grows |= (tfirst < 0x800);
2725 else if (rfirst <= 0x200000)
2726 grows |= (tfirst < 0x10000);
2727 else if (rfirst <= 0x4000000)
2728 grows |= (tfirst < 0x200000);
2729 else if (rfirst <= 0x80000000)
2730 grows |= (tfirst < 0x4000000);
2742 else if (max > 0xff)
2747 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2748 SvREFCNT_dec(listsv);
2750 SvREFCNT_dec(transv);
2752 if (!del && havefinal)
2753 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
2754 newSVuv((UV)final), 0);
2756 if (grows && to_utf)
2757 o->op_private |= OPpTRANS_GROWS;
2764 tbl = (short*)cPVOPo->op_pv;
2766 Zero(tbl, 256, short);
2767 for (i = 0; i < tlen; i++)
2769 for (i = 0, j = 0; i < 256; i++) {
2785 if (!rlen && !del) {
2788 o->op_private |= OPpTRANS_IDENTICAL;
2790 for (i = 0; i < 256; i++)
2792 for (i = 0, j = 0; i < tlen; i++,j++) {
2795 if (tbl[t[i]] == -1)
2801 if (tbl[t[i]] == -1)
2812 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2817 NewOp(1101, pmop, 1, PMOP);
2818 pmop->op_type = type;
2819 pmop->op_ppaddr = PL_ppaddr[type];
2820 pmop->op_flags = flags;
2821 pmop->op_private = 0 | (flags >> 8);
2823 if (PL_hints & HINT_RE_TAINT)
2824 pmop->op_pmpermflags |= PMf_RETAINT;
2825 if (PL_hints & HINT_LOCALE)
2826 pmop->op_pmpermflags |= PMf_LOCALE;
2827 pmop->op_pmflags = pmop->op_pmpermflags;
2829 /* link into pm list */
2830 if (type != OP_TRANS && PL_curstash) {
2831 pmop->op_pmnext = HvPMROOT(PL_curstash);
2832 HvPMROOT(PL_curstash) = pmop;
2839 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2844 I32 repl_has_vars = 0;
2846 if (o->op_type == OP_TRANS)
2847 return pmtrans(o, expr, repl);
2849 PL_hints |= HINT_BLOCK_SCOPE;
2852 if (expr->op_type == OP_CONST) {
2854 SV *pat = ((SVOP*)expr)->op_sv;
2855 char *p = SvPV(pat, plen);
2856 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2857 sv_setpvn(pat, "\\s+", 3);
2858 p = SvPV(pat, plen);
2859 pm->op_pmflags |= PMf_SKIPWHITE;
2861 if ((PL_hints & HINT_UTF8) || (SvUTF8(pat) && !(PL_hints & HINT_BYTE)))
2862 pm->op_pmdynflags |= PMdf_UTF8;
2863 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2864 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2865 pm->op_pmflags |= PMf_WHITE;
2869 if (PL_hints & HINT_UTF8)
2870 pm->op_pmdynflags |= PMdf_UTF8;
2871 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2872 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2874 : OP_REGCMAYBE),0,expr);
2876 NewOp(1101, rcop, 1, LOGOP);
2877 rcop->op_type = OP_REGCOMP;
2878 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2879 rcop->op_first = scalar(expr);
2880 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2881 ? (OPf_SPECIAL | OPf_KIDS)
2883 rcop->op_private = 1;
2886 /* establish postfix order */
2887 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2889 rcop->op_next = expr;
2890 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2893 rcop->op_next = LINKLIST(expr);
2894 expr->op_next = (OP*)rcop;
2897 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2902 if (pm->op_pmflags & PMf_EVAL) {
2904 if (CopLINE(PL_curcop) < PL_multi_end)
2905 CopLINE_set(PL_curcop, PL_multi_end);
2908 else if (repl->op_type == OP_THREADSV
2909 && strchr("&`'123456789+",
2910 PL_threadsv_names[repl->op_targ]))
2914 #endif /* USE_THREADS */
2915 else if (repl->op_type == OP_CONST)
2919 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2920 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2922 if (curop->op_type == OP_THREADSV) {
2924 if (strchr("&`'123456789+", curop->op_private))
2928 if (curop->op_type == OP_GV) {
2929 GV *gv = cGVOPx_gv(curop);
2931 if (strchr("&`'123456789+", *GvENAME(gv)))
2934 #endif /* USE_THREADS */
2935 else if (curop->op_type == OP_RV2CV)
2937 else if (curop->op_type == OP_RV2SV ||
2938 curop->op_type == OP_RV2AV ||
2939 curop->op_type == OP_RV2HV ||
2940 curop->op_type == OP_RV2GV) {
2941 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2944 else if (curop->op_type == OP_PADSV ||
2945 curop->op_type == OP_PADAV ||
2946 curop->op_type == OP_PADHV ||
2947 curop->op_type == OP_PADANY) {
2950 else if (curop->op_type == OP_PUSHRE)
2951 ; /* Okay here, dangerous in newASSIGNOP */
2960 && (!pm->op_pmregexp
2961 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2962 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2963 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2964 prepend_elem(o->op_type, scalar(repl), o);
2967 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2968 pm->op_pmflags |= PMf_MAYBE_CONST;
2969 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2971 NewOp(1101, rcop, 1, LOGOP);
2972 rcop->op_type = OP_SUBSTCONT;
2973 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2974 rcop->op_first = scalar(repl);
2975 rcop->op_flags |= OPf_KIDS;
2976 rcop->op_private = 1;
2979 /* establish postfix order */
2980 rcop->op_next = LINKLIST(repl);
2981 repl->op_next = (OP*)rcop;
2983 pm->op_pmreplroot = scalar((OP*)rcop);
2984 pm->op_pmreplstart = LINKLIST(rcop);
2993 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2996 NewOp(1101, svop, 1, SVOP);
2997 svop->op_type = type;
2998 svop->op_ppaddr = PL_ppaddr[type];
3000 svop->op_next = (OP*)svop;
3001 svop->op_flags = flags;
3002 if (PL_opargs[type] & OA_RETSCALAR)
3004 if (PL_opargs[type] & OA_TARGET)
3005 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3006 return CHECKOP(type, svop);
3010 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3013 NewOp(1101, padop, 1, PADOP);
3014 padop->op_type = type;
3015 padop->op_ppaddr = PL_ppaddr[type];
3016 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3017 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3018 PL_curpad[padop->op_padix] = sv;
3020 padop->op_next = (OP*)padop;
3021 padop->op_flags = flags;
3022 if (PL_opargs[type] & OA_RETSCALAR)
3024 if (PL_opargs[type] & OA_TARGET)
3025 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3026 return CHECKOP(type, padop);
3030 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3035 return newPADOP(type, flags, SvREFCNT_inc(gv));
3037 return newSVOP(type, flags, SvREFCNT_inc(gv));
3042 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3045 NewOp(1101, pvop, 1, PVOP);
3046 pvop->op_type = type;
3047 pvop->op_ppaddr = PL_ppaddr[type];
3049 pvop->op_next = (OP*)pvop;
3050 pvop->op_flags = flags;
3051 if (PL_opargs[type] & OA_RETSCALAR)
3053 if (PL_opargs[type] & OA_TARGET)
3054 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3055 return CHECKOP(type, pvop);
3059 Perl_package(pTHX_ OP *o)
3064 save_hptr(&PL_curstash);
3065 save_item(PL_curstname);
3070 name = SvPV(sv, len);
3071 PL_curstash = gv_stashpvn(name,len,TRUE);
3072 sv_setpvn(PL_curstname, name, len);
3076 sv_setpv(PL_curstname,"<none>");
3077 PL_curstash = Nullhv;
3079 PL_hints |= HINT_BLOCK_SCOPE;
3080 PL_copline = NOLINE;
3085 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3093 if (id->op_type != OP_CONST)
3094 Perl_croak(aTHX_ "Module name must be constant");
3098 if (version != Nullop) {
3099 SV *vesv = ((SVOP*)version)->op_sv;
3101 if (arg == Nullop && !SvNIOKp(vesv)) {
3108 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3109 Perl_croak(aTHX_ "Version number must be constant number");
3111 /* Make copy of id so we don't free it twice */
3112 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3114 /* Fake up a method call to VERSION */
3115 meth = newSVpvn("VERSION",7);
3116 sv_upgrade(meth, SVt_PVIV);
3117 (void)SvIOK_on(meth);
3118 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3119 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3120 append_elem(OP_LIST,
3121 prepend_elem(OP_LIST, pack, list(version)),
3122 newSVOP(OP_METHOD_NAMED, 0, meth)));
3126 /* Fake up an import/unimport */
3127 if (arg && arg->op_type == OP_STUB)
3128 imop = arg; /* no import on explicit () */
3129 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3130 imop = Nullop; /* use 5.0; */
3135 /* Make copy of id so we don't free it twice */
3136 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3138 /* Fake up a method call to import/unimport */
3139 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);;
3140 sv_upgrade(meth, SVt_PVIV);
3141 (void)SvIOK_on(meth);
3142 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3143 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3144 append_elem(OP_LIST,
3145 prepend_elem(OP_LIST, pack, list(arg)),
3146 newSVOP(OP_METHOD_NAMED, 0, meth)));
3149 /* Fake up a require, handle override, if any */
3150 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3151 if (!(gv && GvIMPORTED_CV(gv)))
3152 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3154 if (gv && GvIMPORTED_CV(gv)) {
3155 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3156 append_elem(OP_LIST, id,
3157 scalar(newUNOP(OP_RV2CV, 0,
3162 rqop = newUNOP(OP_REQUIRE, 0, id);
3165 /* Fake up the BEGIN {}, which does its thing immediately. */
3167 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3170 append_elem(OP_LINESEQ,
3171 append_elem(OP_LINESEQ,
3172 newSTATEOP(0, Nullch, rqop),
3173 newSTATEOP(0, Nullch, veop)),
3174 newSTATEOP(0, Nullch, imop) ));
3176 PL_hints |= HINT_BLOCK_SCOPE;
3177 PL_copline = NOLINE;
3182 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3185 va_start(args, ver);
3186 vload_module(flags, name, ver, &args);
3190 #ifdef PERL_IMPLICIT_CONTEXT
3192 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3196 va_start(args, ver);
3197 vload_module(flags, name, ver, &args);
3203 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3205 OP *modname, *veop, *imop;
3207 modname = newSVOP(OP_CONST, 0, name);
3208 modname->op_private |= OPpCONST_BARE;
3210 veop = newSVOP(OP_CONST, 0, ver);
3214 if (flags & PERL_LOADMOD_NOIMPORT) {
3215 imop = sawparens(newNULLLIST());
3217 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3218 imop = va_arg(*args, OP*);
3223 sv = va_arg(*args, SV*);
3225 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3226 sv = va_arg(*args, SV*);
3230 line_t ocopline = PL_copline;
3231 int oexpect = PL_expect;
3233 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3234 veop, modname, imop);
3235 PL_expect = oexpect;
3236 PL_copline = ocopline;
3241 Perl_dofile(pTHX_ OP *term)
3246 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3247 if (!(gv && GvIMPORTED_CV(gv)))
3248 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3250 if (gv && GvIMPORTED_CV(gv)) {
3251 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3252 append_elem(OP_LIST, term,
3253 scalar(newUNOP(OP_RV2CV, 0,
3258 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3264 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3266 return newBINOP(OP_LSLICE, flags,
3267 list(force_list(subscript)),
3268 list(force_list(listval)) );
3272 S_list_assignment(pTHX_ register OP *o)
3277 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3278 o = cUNOPo->op_first;
3280 if (o->op_type == OP_COND_EXPR) {
3281 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3282 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3287 yyerror("Assignment to both a list and a scalar");
3291 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3292 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3293 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3296 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3299 if (o->op_type == OP_RV2SV)
3306 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3311 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3312 return newLOGOP(optype, 0,
3313 mod(scalar(left), optype),
3314 newUNOP(OP_SASSIGN, 0, scalar(right)));
3317 return newBINOP(optype, OPf_STACKED,
3318 mod(scalar(left), optype), scalar(right));
3322 if (list_assignment(left)) {
3327 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3328 left = mod(left, OP_AASSIGN);
3336 curop = list(force_list(left));
3337 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3338 o->op_private = 0 | (flags >> 8);
3339 for (curop = ((LISTOP*)curop)->op_first;
3340 curop; curop = curop->op_sibling)
3342 if (curop->op_type == OP_RV2HV &&
3343 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3344 o->op_private |= OPpASSIGN_HASH;
3348 if (!(left->op_private & OPpLVAL_INTRO)) {
3351 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3352 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3353 if (curop->op_type == OP_GV) {
3354 GV *gv = cGVOPx_gv(curop);
3355 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3357 SvCUR(gv) = PL_generation;
3359 else if (curop->op_type == OP_PADSV ||
3360 curop->op_type == OP_PADAV ||
3361 curop->op_type == OP_PADHV ||
3362 curop->op_type == OP_PADANY) {
3363 SV **svp = AvARRAY(PL_comppad_name);
3364 SV *sv = svp[curop->op_targ];
3365 if (SvCUR(sv) == PL_generation)
3367 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3369 else if (curop->op_type == OP_RV2CV)
3371 else if (curop->op_type == OP_RV2SV ||
3372 curop->op_type == OP_RV2AV ||
3373 curop->op_type == OP_RV2HV ||
3374 curop->op_type == OP_RV2GV) {
3375 if (lastop->op_type != OP_GV) /* funny deref? */
3378 else if (curop->op_type == OP_PUSHRE) {
3379 if (((PMOP*)curop)->op_pmreplroot) {
3380 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3381 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3383 SvCUR(gv) = PL_generation;
3392 o->op_private |= OPpASSIGN_COMMON;
3394 if (right && right->op_type == OP_SPLIT) {
3396 if ((tmpop = ((LISTOP*)right)->op_first) &&
3397 tmpop->op_type == OP_PUSHRE)
3399 PMOP *pm = (PMOP*)tmpop;
3400 if (left->op_type == OP_RV2AV &&
3401 !(left->op_private & OPpLVAL_INTRO) &&
3402 !(o->op_private & OPpASSIGN_COMMON) )
3404 tmpop = ((UNOP*)left)->op_first;
3405 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3407 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3408 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3410 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3411 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3413 pm->op_pmflags |= PMf_ONCE;
3414 tmpop = cUNOPo->op_first; /* to list (nulled) */
3415 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3416 tmpop->op_sibling = Nullop; /* don't free split */
3417 right->op_next = tmpop->op_next; /* fix starting loc */
3418 op_free(o); /* blow off assign */
3419 right->op_flags &= ~OPf_WANT;
3420 /* "I don't know and I don't care." */
3425 if (PL_modcount < 10000 &&
3426 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3428 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3430 sv_setiv(sv, PL_modcount+1);
3438 right = newOP(OP_UNDEF, 0);
3439 if (right->op_type == OP_READLINE) {
3440 right->op_flags |= OPf_STACKED;
3441 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3444 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3445 o = newBINOP(OP_SASSIGN, flags,
3446 scalar(right), mod(scalar(left), OP_SASSIGN) );
3458 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3461 U32 seq = intro_my();
3464 NewOp(1101, cop, 1, COP);
3465 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3466 cop->op_type = OP_DBSTATE;
3467 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3470 cop->op_type = OP_NEXTSTATE;
3471 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3473 cop->op_flags = flags;
3474 cop->op_private = (PL_hints & HINT_BYTE);
3476 cop->op_private |= NATIVE_HINTS;
3478 PL_compiling.op_private = cop->op_private;
3479 cop->op_next = (OP*)cop;
3482 cop->cop_label = label;
3483 PL_hints |= HINT_BLOCK_SCOPE;
3486 cop->cop_arybase = PL_curcop->cop_arybase;
3487 if (specialWARN(PL_curcop->cop_warnings))
3488 cop->cop_warnings = PL_curcop->cop_warnings ;
3490 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3493 if (PL_copline == NOLINE)
3494 CopLINE_set(cop, CopLINE(PL_curcop));
3496 CopLINE_set(cop, PL_copline);
3497 PL_copline = NOLINE;
3500 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXXXX share in a pvtable? */
3502 CopFILEGV_set(cop, (GV*)SvREFCNT_inc(CopFILEGV(PL_curcop)));
3504 CopSTASH_set(cop, PL_curstash);
3506 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3507 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3508 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3509 (void)SvIOK_on(*svp);
3510 SvIVX(*svp) = PTR2IV(cop);
3514 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3517 /* "Introduce" my variables to visible status. */
3525 if (! PL_min_intro_pending)
3526 return PL_cop_seqmax;
3528 svp = AvARRAY(PL_comppad_name);
3529 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3530 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3531 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3532 SvNVX(sv) = (NV)PL_cop_seqmax;
3535 PL_min_intro_pending = 0;
3536 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3537 return PL_cop_seqmax++;
3541 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3543 return new_logop(type, flags, &first, &other);
3547 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3552 OP *first = *firstp;
3553 OP *other = *otherp;
3555 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3556 return newBINOP(type, flags, scalar(first), scalar(other));
3558 scalarboolean(first);
3559 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3560 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3561 if (type == OP_AND || type == OP_OR) {
3567 first = *firstp = cUNOPo->op_first;
3569 first->op_next = o->op_next;
3570 cUNOPo->op_first = Nullop;
3574 if (first->op_type == OP_CONST) {
3575 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3576 Perl_warner(aTHX_ WARN_BAREWORD, "Bareword found in conditional");
3577 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3588 else if (first->op_type == OP_WANTARRAY) {
3594 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3595 OP *k1 = ((UNOP*)first)->op_first;
3596 OP *k2 = k1->op_sibling;
3598 switch (first->op_type)
3601 if (k2 && k2->op_type == OP_READLINE
3602 && (k2->op_flags & OPf_STACKED)
3603 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3605 warnop = k2->op_type;
3610 if (k1->op_type == OP_READDIR
3611 || k1->op_type == OP_GLOB
3612 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3613 || k1->op_type == OP_EACH)
3615 warnop = ((k1->op_type == OP_NULL)
3616 ? k1->op_targ : k1->op_type);
3621 line_t oldline = CopLINE(PL_curcop);
3622 CopLINE_set(PL_curcop, PL_copline);
3623 Perl_warner(aTHX_ WARN_MISC,
3624 "Value of %s%s can be \"0\"; test with defined()",
3626 ((warnop == OP_READLINE || warnop == OP_GLOB)
3627 ? " construct" : "() operator"));
3628 CopLINE_set(PL_curcop, oldline);
3635 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3636 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3638 NewOp(1101, logop, 1, LOGOP);
3640 logop->op_type = type;
3641 logop->op_ppaddr = PL_ppaddr[type];
3642 logop->op_first = first;
3643 logop->op_flags = flags | OPf_KIDS;
3644 logop->op_other = LINKLIST(other);
3645 logop->op_private = 1 | (flags >> 8);
3647 /* establish postfix order */
3648 logop->op_next = LINKLIST(first);
3649 first->op_next = (OP*)logop;
3650 first->op_sibling = other;
3652 o = newUNOP(OP_NULL, 0, (OP*)logop);
3659 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3667 return newLOGOP(OP_AND, 0, first, trueop);
3669 return newLOGOP(OP_OR, 0, first, falseop);
3671 scalarboolean(first);
3672 if (first->op_type == OP_CONST) {
3673 if (SvTRUE(((SVOP*)first)->op_sv)) {
3684 else if (first->op_type == OP_WANTARRAY) {
3688 NewOp(1101, logop, 1, LOGOP);
3689 logop->op_type = OP_COND_EXPR;
3690 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3691 logop->op_first = first;
3692 logop->op_flags = flags | OPf_KIDS;
3693 logop->op_private = 1 | (flags >> 8);
3694 logop->op_other = LINKLIST(trueop);
3695 logop->op_next = LINKLIST(falseop);
3698 /* establish postfix order */
3699 start = LINKLIST(first);
3700 first->op_next = (OP*)logop;
3702 first->op_sibling = trueop;
3703 trueop->op_sibling = falseop;
3704 o = newUNOP(OP_NULL, 0, (OP*)logop);
3706 trueop->op_next = falseop->op_next = o;
3713 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3722 NewOp(1101, range, 1, LOGOP);
3724 range->op_type = OP_RANGE;
3725 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3726 range->op_first = left;
3727 range->op_flags = OPf_KIDS;
3728 leftstart = LINKLIST(left);
3729 range->op_other = LINKLIST(right);
3730 range->op_private = 1 | (flags >> 8);
3732 left->op_sibling = right;
3734 range->op_next = (OP*)range;
3735 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3736 flop = newUNOP(OP_FLOP, 0, flip);
3737 o = newUNOP(OP_NULL, 0, flop);
3739 range->op_next = leftstart;
3741 left->op_next = flip;
3742 right->op_next = flop;
3744 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3745 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3746 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3747 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3749 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3750 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3753 if (!flip->op_private || !flop->op_private)
3754 linklist(o); /* blow off optimizer unless constant */
3760 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3765 int once = block && block->op_flags & OPf_SPECIAL &&
3766 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3769 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3770 return block; /* do {} while 0 does once */
3771 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3772 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3773 expr = newUNOP(OP_DEFINED, 0,
3774 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3775 } else if (expr->op_flags & OPf_KIDS) {
3776 OP *k1 = ((UNOP*)expr)->op_first;
3777 OP *k2 = (k1) ? k1->op_sibling : NULL;
3778 switch (expr->op_type) {
3780 if (k2 && k2->op_type == OP_READLINE
3781 && (k2->op_flags & OPf_STACKED)
3782 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3783 expr = newUNOP(OP_DEFINED, 0, expr);
3787 if (k1->op_type == OP_READDIR
3788 || k1->op_type == OP_GLOB
3789 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3790 || k1->op_type == OP_EACH)
3791 expr = newUNOP(OP_DEFINED, 0, expr);
3797 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3798 o = new_logop(OP_AND, 0, &expr, &listop);
3801 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3803 if (once && o != listop)
3804 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3807 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3809 o->op_flags |= flags;
3811 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3816 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3826 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3827 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3828 expr = newUNOP(OP_DEFINED, 0,
3829 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3830 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3831 OP *k1 = ((UNOP*)expr)->op_first;
3832 OP *k2 = (k1) ? k1->op_sibling : NULL;
3833 switch (expr->op_type) {
3835 if (k2 && k2->op_type == OP_READLINE
3836 && (k2->op_flags & OPf_STACKED)
3837 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3838 expr = newUNOP(OP_DEFINED, 0, expr);
3842 if (k1->op_type == OP_READDIR
3843 || k1->op_type == OP_GLOB
3844 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3845 || k1->op_type == OP_EACH)
3846 expr = newUNOP(OP_DEFINED, 0, expr);
3852 block = newOP(OP_NULL, 0);
3854 block = scope(block);
3858 next = LINKLIST(cont);
3859 loopflags |= OPpLOOP_CONTINUE;
3862 OP *unstack = newOP(OP_UNSTACK, 0);
3865 cont = append_elem(OP_LINESEQ, cont, unstack);
3866 if ((line_t)whileline != NOLINE) {
3867 PL_copline = whileline;
3868 cont = append_elem(OP_LINESEQ, cont,
3869 newSTATEOP(0, Nullch, Nullop));
3873 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3874 redo = LINKLIST(listop);
3877 PL_copline = whileline;
3879 o = new_logop(OP_AND, 0, &expr, &listop);
3880 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3881 op_free(expr); /* oops, it's a while (0) */
3883 return Nullop; /* listop already freed by new_logop */
3886 ((LISTOP*)listop)->op_last->op_next = condop =
3887 (o == listop ? redo : LINKLIST(o));
3893 NewOp(1101,loop,1,LOOP);
3894 loop->op_type = OP_ENTERLOOP;
3895 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3896 loop->op_private = 0;
3897 loop->op_next = (OP*)loop;
3900 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3902 loop->op_redoop = redo;
3903 loop->op_lastop = o;
3904 o->op_private |= loopflags;
3907 loop->op_nextop = next;
3909 loop->op_nextop = o;
3911 o->op_flags |= flags;
3912 o->op_private |= (flags >> 8);
3917 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3925 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3926 sv->op_type = OP_RV2GV;
3927 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3929 else if (sv->op_type == OP_PADSV) { /* private variable */
3930 padoff = sv->op_targ;
3935 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3936 padoff = sv->op_targ;
3938 iterflags |= OPf_SPECIAL;
3943 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3947 padoff = find_threadsv("_");
3948 iterflags |= OPf_SPECIAL;
3950 sv = newGVOP(OP_GV, 0, PL_defgv);
3953 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3954 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3955 iterflags |= OPf_STACKED;
3957 else if (expr->op_type == OP_NULL &&
3958 (expr->op_flags & OPf_KIDS) &&
3959 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3961 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3962 * set the STACKED flag to indicate that these values are to be
3963 * treated as min/max values by 'pp_iterinit'.
3965 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3966 LOGOP* range = (LOGOP*) flip->op_first;
3967 OP* left = range->op_first;
3968 OP* right = left->op_sibling;
3971 range->op_flags &= ~OPf_KIDS;
3972 range->op_first = Nullop;
3974 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3975 listop->op_first->op_next = range->op_next;
3976 left->op_next = range->op_other;
3977 right->op_next = (OP*)listop;
3978 listop->op_next = listop->op_first;
3981 expr = (OP*)(listop);
3983 iterflags |= OPf_STACKED;
3986 expr = mod(force_list(expr), OP_GREPSTART);
3990 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3991 append_elem(OP_LIST, expr, scalar(sv))));
3992 assert(!loop->op_next);
3993 #ifdef PL_OP_SLAB_ALLOC
3996 NewOp(1234,tmp,1,LOOP);
3997 Copy(loop,tmp,1,LOOP);
4001 Renew(loop, 1, LOOP);
4003 loop->op_targ = padoff;
4004 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
4005 PL_copline = forline;
4006 return newSTATEOP(0, label, wop);
4010 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4016 if (type != OP_GOTO || label->op_type == OP_CONST) {
4017 /* "last()" means "last" */
4018 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4019 o = newOP(type, OPf_SPECIAL);
4021 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
4022 ? SvPVx(((SVOP*)label)->op_sv, n_a)
4028 if (label->op_type == OP_ENTERSUB)
4029 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4030 o = newUNOP(type, OPf_STACKED, label);
4032 PL_hints |= HINT_BLOCK_SCOPE;
4037 Perl_cv_undef(pTHX_ CV *cv)
4042 MUTEX_DESTROY(CvMUTEXP(cv));
4043 Safefree(CvMUTEXP(cv));
4046 #endif /* USE_THREADS */
4048 if (!CvXSUB(cv) && CvROOT(cv)) {
4050 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4051 Perl_croak(aTHX_ "Can't undef active subroutine");
4054 Perl_croak(aTHX_ "Can't undef active subroutine");
4055 #endif /* USE_THREADS */
4058 SAVEVPTR(PL_curpad);
4062 op_free(CvROOT(cv));
4063 CvROOT(cv) = Nullop;
4066 SvPOK_off((SV*)cv); /* forget prototype */
4068 SvREFCNT_dec(CvGV(cv));
4070 SvREFCNT_dec(CvOUTSIDE(cv));
4071 CvOUTSIDE(cv) = Nullcv;
4072 if (CvPADLIST(cv)) {
4073 /* may be during global destruction */
4074 if (SvREFCNT(CvPADLIST(cv))) {
4075 I32 i = AvFILLp(CvPADLIST(cv));
4077 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4078 SV* sv = svp ? *svp : Nullsv;
4081 if (sv == (SV*)PL_comppad_name)
4082 PL_comppad_name = Nullav;
4083 else if (sv == (SV*)PL_comppad) {
4084 PL_comppad = Nullav;
4085 PL_curpad = Null(SV**);
4089 SvREFCNT_dec((SV*)CvPADLIST(cv));
4091 CvPADLIST(cv) = Nullav;
4096 S_cv_dump(pTHX_ CV *cv)
4099 CV *outside = CvOUTSIDE(cv);
4100 AV* padlist = CvPADLIST(cv);
4107 PerlIO_printf(Perl_debug_log,
4108 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4110 (CvANON(cv) ? "ANON"
4111 : (cv == PL_main_cv) ? "MAIN"
4112 : CvUNIQUE(cv) ? "UNIQUE"
4113 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4116 : CvANON(outside) ? "ANON"
4117 : (outside == PL_main_cv) ? "MAIN"
4118 : CvUNIQUE(outside) ? "UNIQUE"
4119 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4124 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4125 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4126 pname = AvARRAY(pad_name);
4127 ppad = AvARRAY(pad);
4129 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4130 if (SvPOK(pname[ix]))
4131 PerlIO_printf(Perl_debug_log,
4132 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4133 (int)ix, PTR2UV(ppad[ix]),
4134 SvFAKE(pname[ix]) ? "FAKE " : "",
4136 (IV)I_32(SvNVX(pname[ix])),
4139 #endif /* DEBUGGING */
4143 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4148 AV* protopadlist = CvPADLIST(proto);
4149 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4150 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4151 SV** pname = AvARRAY(protopad_name);
4152 SV** ppad = AvARRAY(protopad);
4153 I32 fname = AvFILLp(protopad_name);
4154 I32 fpad = AvFILLp(protopad);
4158 assert(!CvUNIQUE(proto));
4162 SAVESPTR(PL_comppad_name);
4163 SAVESPTR(PL_compcv);
4165 cv = PL_compcv = (CV*)NEWSV(1104,0);
4166 sv_upgrade((SV *)cv, SvTYPE(proto));
4167 CvFLAGS(cv) = CvFLAGS(proto) & ~CVf_CLONE;
4171 New(666, CvMUTEXP(cv), 1, perl_mutex);
4172 MUTEX_INIT(CvMUTEXP(cv));
4174 #endif /* USE_THREADS */
4175 CvFILE(cv) = CvFILE(proto);
4176 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4177 CvSTASH(cv) = CvSTASH(proto);
4178 CvROOT(cv) = CvROOT(proto);
4179 CvSTART(cv) = CvSTART(proto);
4181 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4184 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4186 PL_comppad_name = newAV();
4187 for (ix = fname; ix >= 0; ix--)
4188 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4190 PL_comppad = newAV();
4192 comppadlist = newAV();
4193 AvREAL_off(comppadlist);
4194 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4195 av_store(comppadlist, 1, (SV*)PL_comppad);
4196 CvPADLIST(cv) = comppadlist;
4197 av_fill(PL_comppad, AvFILLp(protopad));
4198 PL_curpad = AvARRAY(PL_comppad);
4200 av = newAV(); /* will be @_ */
4202 av_store(PL_comppad, 0, (SV*)av);
4203 AvFLAGS(av) = AVf_REIFY;
4205 for (ix = fpad; ix > 0; ix--) {
4206 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4207 if (namesv && namesv != &PL_sv_undef) {
4208 char *name = SvPVX(namesv); /* XXX */
4209 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4210 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4211 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4213 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4215 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4217 else { /* our own lexical */
4220 /* anon code -- we'll come back for it */
4221 sv = SvREFCNT_inc(ppad[ix]);
4223 else if (*name == '@')
4225 else if (*name == '%')
4234 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4235 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4238 SV* sv = NEWSV(0,0);
4244 /* Now that vars are all in place, clone nested closures. */
4246 for (ix = fpad; ix > 0; ix--) {
4247 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4249 && namesv != &PL_sv_undef
4250 && !(SvFLAGS(namesv) & SVf_FAKE)
4251 && *SvPVX(namesv) == '&'
4252 && CvCLONE(ppad[ix]))
4254 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4255 SvREFCNT_dec(ppad[ix]);
4258 PL_curpad[ix] = (SV*)kid;
4262 #ifdef DEBUG_CLOSURES
4263 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4265 PerlIO_printf(Perl_debug_log, " from:\n");
4267 PerlIO_printf(Perl_debug_log, " to:\n");
4276 Perl_cv_clone(pTHX_ CV *proto)
4279 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4280 cv = cv_clone2(proto, CvOUTSIDE(proto));
4281 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4286 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4290 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4291 SV* msg = sv_newmortal();
4295 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4296 sv_setpv(msg, "Prototype mismatch:");
4298 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4300 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4301 sv_catpv(msg, " vs ");
4303 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4305 sv_catpv(msg, "none");
4306 Perl_warner(aTHX_ WARN_PROTOTYPE, "%"SVf, msg);
4311 Perl_cv_const_sv(pTHX_ CV *cv)
4313 if (!cv || !SvPOK(cv) || SvCUR(cv))
4315 return op_const_sv(CvSTART(cv), cv);
4319 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4326 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4327 o = cLISTOPo->op_first->op_sibling;
4329 for (; o; o = o->op_next) {
4330 OPCODE type = o->op_type;
4332 if (sv && o->op_next == o)
4334 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4336 if (type == OP_LEAVESUB || type == OP_RETURN)
4340 if (type == OP_CONST && cSVOPo->op_sv)
4342 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4343 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4344 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4345 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4357 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4367 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4371 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4373 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4377 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4384 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4388 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4389 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4390 SV *sv = sv_newmortal();
4391 Perl_sv_setpvf(aTHX_ sv, "__ANON__[%s:%"IVdf"]",
4392 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4397 gv = gv_fetchpv(name ? name : (aname ? aname : "__ANON__"),
4398 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4408 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4409 maximum a prototype before. */
4410 if (SvTYPE(gv) > SVt_NULL) {
4411 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4412 && ckWARN_d(WARN_PROTOTYPE))
4414 Perl_warner(aTHX_ WARN_PROTOTYPE, "Runaway prototype");
4416 cv_ckproto((CV*)gv, NULL, ps);
4419 sv_setpv((SV*)gv, ps);
4421 sv_setiv((SV*)gv, -1);
4422 SvREFCNT_dec(PL_compcv);
4423 cv = PL_compcv = NULL;
4424 PL_sub_generation++;
4428 if (!name || GvCVGEN(gv))
4430 else if ((cv = GvCV(gv))) {
4431 cv_ckproto(cv, gv, ps);
4432 /* already defined (or promised)? */
4433 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4435 bool const_changed = TRUE;
4436 if (!block && !attrs) {
4437 /* just a "sub foo;" when &foo is already defined */
4438 SAVEFREESV(PL_compcv);
4441 /* ahem, death to those who redefine active sort subs */
4442 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4443 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4446 if ((const_sv = cv_const_sv(cv)))
4447 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4448 if ((const_sv || const_changed) && ckWARN(WARN_REDEFINE))
4450 line_t oldline = CopLINE(PL_curcop);
4451 CopLINE_set(PL_curcop, PL_copline);
4452 Perl_warner(aTHX_ WARN_REDEFINE,
4453 const_sv ? "Constant subroutine %s redefined"
4454 : "Subroutine %s redefined", name);
4455 CopLINE_set(PL_curcop, oldline);
4466 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4467 * before we clobber PL_compcv.
4471 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4472 stash = GvSTASH(CvGV(cv));
4473 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4474 stash = CvSTASH(cv);
4476 stash = PL_curstash;
4479 /* possibly about to re-define existing subr -- ignore old cv */
4480 rcv = (SV*)PL_compcv;
4481 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4482 stash = GvSTASH(gv);
4484 stash = PL_curstash;
4486 apply_attrs(stash, rcv, attrs);
4488 if (cv) { /* must reuse cv if autoloaded */
4490 /* got here with just attrs -- work done, so bug out */
4491 SAVEFREESV(PL_compcv);
4495 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4496 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4497 CvOUTSIDE(PL_compcv) = 0;
4498 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4499 CvPADLIST(PL_compcv) = 0;
4500 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4501 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4502 SvREFCNT_dec(PL_compcv);
4509 PL_sub_generation++;
4512 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4513 CvFILE(cv) = CopFILE(PL_curcop);
4514 CvSTASH(cv) = PL_curstash;
4517 if (!CvMUTEXP(cv)) {
4518 New(666, CvMUTEXP(cv), 1, perl_mutex);
4519 MUTEX_INIT(CvMUTEXP(cv));
4521 #endif /* USE_THREADS */
4524 sv_setpv((SV*)cv, ps);
4526 if (PL_error_count) {
4530 char *s = strrchr(name, ':');
4532 if (strEQ(s, "BEGIN")) {
4534 "BEGIN not safe after errors--compilation aborted";
4535 if (PL_in_eval & EVAL_KEEPERR)
4536 Perl_croak(aTHX_ not_safe);
4538 /* force display of errors found but not reported */
4539 sv_catpv(ERRSV, not_safe);
4540 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4547 PL_copline = NOLINE;
4552 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4553 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4556 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4559 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4561 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4562 OpREFCNT_set(CvROOT(cv), 1);
4563 CvSTART(cv) = LINKLIST(CvROOT(cv));
4564 CvROOT(cv)->op_next = 0;
4567 /* now that optimizer has done its work, adjust pad values */
4569 SV **namep = AvARRAY(PL_comppad_name);
4570 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4573 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4576 * The only things that a clonable function needs in its
4577 * pad are references to outer lexicals and anonymous subs.
4578 * The rest are created anew during cloning.
4580 if (!((namesv = namep[ix]) != Nullsv &&
4581 namesv != &PL_sv_undef &&
4583 *SvPVX(namesv) == '&')))
4585 SvREFCNT_dec(PL_curpad[ix]);
4586 PL_curpad[ix] = Nullsv;
4591 AV *av = newAV(); /* Will be @_ */
4593 av_store(PL_comppad, 0, (SV*)av);
4594 AvFLAGS(av) = AVf_REIFY;
4596 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4597 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4599 if (!SvPADMY(PL_curpad[ix]))
4600 SvPADTMP_on(PL_curpad[ix]);
4604 if (name || aname) {
4606 char *tname = (name ? name : aname);
4608 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4609 SV *sv = NEWSV(0,0);
4610 SV *tmpstr = sv_newmortal();
4611 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4615 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4617 (long)PL_subline, (long)CopLINE(PL_curcop));
4618 gv_efullname3(tmpstr, gv, Nullch);
4619 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4620 hv = GvHVn(db_postponed);
4621 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4622 && (pcv = GvCV(db_postponed)))
4628 call_sv((SV*)pcv, G_DISCARD);
4632 if ((s = strrchr(tname,':')))
4637 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4640 if (strEQ(s, "BEGIN")) {
4641 I32 oldscope = PL_scopestack_ix;
4643 SAVECOPFILE(&PL_compiling);
4644 SAVECOPLINE(&PL_compiling);
4646 sv_setsv(PL_rs, PL_nrs);
4649 PL_beginav = newAV();
4650 DEBUG_x( dump_sub(gv) );
4651 av_push(PL_beginav, SvREFCNT_inc(cv));
4653 call_list(oldscope, PL_beginav);
4655 PL_curcop = &PL_compiling;
4656 PL_compiling.op_private = PL_hints;
4659 else if (strEQ(s, "END") && !PL_error_count) {
4662 DEBUG_x( dump_sub(gv) );
4663 av_unshift(PL_endav, 1);
4664 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4667 else if (strEQ(s, "CHECK") && !PL_error_count) {
4669 PL_checkav = newAV();
4670 DEBUG_x( dump_sub(gv) );
4671 if (PL_main_start && ckWARN(WARN_VOID))
4672 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4673 av_unshift(PL_checkav, 1);
4674 av_store(PL_checkav, 0, SvREFCNT_inc(cv));
4677 else if (strEQ(s, "INIT") && !PL_error_count) {
4679 PL_initav = newAV();
4680 DEBUG_x( dump_sub(gv) );
4681 if (PL_main_start && ckWARN(WARN_VOID))
4682 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4683 av_push(PL_initav, SvREFCNT_inc(cv));
4689 PL_copline = NOLINE;
4694 /* XXX unsafe for threads if eval_owner isn't held */
4696 =for apidoc newCONSTSUB
4698 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4699 eligible for inlining at compile-time.
4705 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4710 SAVECOPLINE(PL_curcop);
4713 CopLINE_set(PL_curcop, PL_copline);
4714 PL_hints &= ~HINT_BLOCK_SCOPE;
4717 SAVESPTR(PL_curstash);
4718 SAVECOPSTASH(PL_curcop);
4719 PL_curstash = stash;
4721 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4723 CopSTASH(PL_curcop) = stash;
4728 start_subparse(FALSE, 0),
4729 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4730 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4732 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4739 =for apidoc U||newXS
4741 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4747 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4750 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4753 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4755 /* just a cached method */
4759 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4760 /* already defined (or promised) */
4761 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4762 && HvNAME(GvSTASH(CvGV(cv)))
4763 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4764 line_t oldline = CopLINE(PL_curcop);
4765 if (PL_copline != NOLINE)
4766 CopLINE_set(PL_curcop, PL_copline);
4767 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4768 CopLINE_set(PL_curcop, oldline);
4775 if (cv) /* must reuse cv if autoloaded */
4778 cv = (CV*)NEWSV(1105,0);
4779 sv_upgrade((SV *)cv, SVt_PVCV);
4783 PL_sub_generation++;
4786 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4788 New(666, CvMUTEXP(cv), 1, perl_mutex);
4789 MUTEX_INIT(CvMUTEXP(cv));
4791 #endif /* USE_THREADS */
4792 (void)gv_fetchfile(filename);
4793 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4794 an external constant string */
4795 CvXSUB(cv) = subaddr;
4798 char *s = strrchr(name,':');
4804 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4807 if (strEQ(s, "BEGIN")) {
4809 PL_beginav = newAV();
4810 av_push(PL_beginav, SvREFCNT_inc(cv));
4813 else if (strEQ(s, "END")) {
4816 av_unshift(PL_endav, 1);
4817 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4820 else if (strEQ(s, "CHECK")) {
4822 PL_checkav = newAV();
4823 if (PL_main_start && ckWARN(WARN_VOID))
4824 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4825 av_unshift(PL_checkav, 1);
4826 av_store(PL_checkav, 0, SvREFCNT_inc(cv));
4829 else if (strEQ(s, "INIT")) {
4831 PL_initav = newAV();
4832 if (PL_main_start && ckWARN(WARN_VOID))
4833 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4834 av_push(PL_initav, SvREFCNT_inc(cv));
4846 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4856 name = SvPVx(cSVOPo->op_sv, n_a);
4859 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4861 if ((cv = GvFORM(gv))) {
4862 if (ckWARN(WARN_REDEFINE)) {
4863 line_t oldline = CopLINE(PL_curcop);
4865 CopLINE_set(PL_curcop, PL_copline);
4866 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4867 CopLINE_set(PL_curcop, oldline);
4873 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4874 CvFILE(cv) = CopFILE(PL_curcop);
4876 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4877 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4878 SvPADTMP_on(PL_curpad[ix]);
4881 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4882 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4883 OpREFCNT_set(CvROOT(cv), 1);
4884 CvSTART(cv) = LINKLIST(CvROOT(cv));
4885 CvROOT(cv)->op_next = 0;
4888 PL_copline = NOLINE;
4893 Perl_newANONLIST(pTHX_ OP *o)
4895 return newUNOP(OP_REFGEN, 0,
4896 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4900 Perl_newANONHASH(pTHX_ OP *o)
4902 return newUNOP(OP_REFGEN, 0,
4903 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4907 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4909 return newANONATTRSUB(floor, proto, Nullop, block);
4913 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4915 return newUNOP(OP_REFGEN, 0,
4916 newSVOP(OP_ANONCODE, 0,
4917 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4921 Perl_oopsAV(pTHX_ OP *o)
4923 switch (o->op_type) {
4925 o->op_type = OP_PADAV;
4926 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4927 return ref(o, OP_RV2AV);
4930 o->op_type = OP_RV2AV;
4931 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4936 if (ckWARN_d(WARN_INTERNAL))
4937 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4944 Perl_oopsHV(pTHX_ OP *o)
4948 switch (o->op_type) {
4951 o->op_type = OP_PADHV;
4952 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4953 return ref(o, OP_RV2HV);
4957 o->op_type = OP_RV2HV;
4958 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4963 if (ckWARN_d(WARN_INTERNAL))
4964 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
4971 Perl_newAVREF(pTHX_ OP *o)
4973 if (o->op_type == OP_PADANY) {
4974 o->op_type = OP_PADAV;
4975 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4978 return newUNOP(OP_RV2AV, 0, scalar(o));
4982 Perl_newGVREF(pTHX_ I32 type, OP *o)
4984 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4985 return newUNOP(OP_NULL, 0, o);
4986 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4990 Perl_newHVREF(pTHX_ OP *o)
4992 if (o->op_type == OP_PADANY) {
4993 o->op_type = OP_PADHV;
4994 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4997 return newUNOP(OP_RV2HV, 0, scalar(o));
5001 Perl_oopsCV(pTHX_ OP *o)
5003 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5009 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5011 return newUNOP(OP_RV2CV, flags, scalar(o));
5015 Perl_newSVREF(pTHX_ OP *o)
5017 if (o->op_type == OP_PADANY) {
5018 o->op_type = OP_PADSV;
5019 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5022 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
5023 o->op_flags |= OPpDONE_SVREF;
5026 return newUNOP(OP_RV2SV, 0, scalar(o));
5029 /* Check routines. */
5032 Perl_ck_anoncode(pTHX_ OP *o)
5037 name = NEWSV(1106,0);
5038 sv_upgrade(name, SVt_PVNV);
5039 sv_setpvn(name, "&", 1);
5042 ix = pad_alloc(o->op_type, SVs_PADMY);
5043 av_store(PL_comppad_name, ix, name);
5044 av_store(PL_comppad, ix, cSVOPo->op_sv);
5045 SvPADMY_on(cSVOPo->op_sv);
5046 cSVOPo->op_sv = Nullsv;
5047 cSVOPo->op_targ = ix;
5052 Perl_ck_bitop(pTHX_ OP *o)
5054 o->op_private = PL_hints;
5059 Perl_ck_concat(pTHX_ OP *o)
5061 if (cUNOPo->op_first->op_type == OP_CONCAT)
5062 o->op_flags |= OPf_STACKED;
5067 Perl_ck_spair(pTHX_ OP *o)
5069 if (o->op_flags & OPf_KIDS) {
5072 OPCODE type = o->op_type;
5073 o = modkids(ck_fun(o), type);
5074 kid = cUNOPo->op_first;
5075 newop = kUNOP->op_first->op_sibling;
5077 (newop->op_sibling ||
5078 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5079 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5080 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5084 op_free(kUNOP->op_first);
5085 kUNOP->op_first = newop;
5087 o->op_ppaddr = PL_ppaddr[++o->op_type];
5092 Perl_ck_delete(pTHX_ OP *o)
5096 if (o->op_flags & OPf_KIDS) {
5097 OP *kid = cUNOPo->op_first;
5098 switch (kid->op_type) {
5100 o->op_flags |= OPf_SPECIAL;
5103 o->op_private |= OPpSLICE;
5106 o->op_flags |= OPf_SPECIAL;
5111 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5112 PL_op_desc[o->op_type]);
5120 Perl_ck_eof(pTHX_ OP *o)
5122 I32 type = o->op_type;
5124 if (o->op_flags & OPf_KIDS) {
5125 if (cLISTOPo->op_first->op_type == OP_STUB) {
5127 o = newUNOP(type, OPf_SPECIAL,
5128 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5136 Perl_ck_eval(pTHX_ OP *o)
5138 PL_hints |= HINT_BLOCK_SCOPE;
5139 if (o->op_flags & OPf_KIDS) {
5140 SVOP *kid = (SVOP*)cUNOPo->op_first;
5143 o->op_flags &= ~OPf_KIDS;
5146 else if (kid->op_type == OP_LINESEQ) {
5149 kid->op_next = o->op_next;
5150 cUNOPo->op_first = 0;
5153 NewOp(1101, enter, 1, LOGOP);
5154 enter->op_type = OP_ENTERTRY;
5155 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5156 enter->op_private = 0;
5158 /* establish postfix order */
5159 enter->op_next = (OP*)enter;
5161 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5162 o->op_type = OP_LEAVETRY;
5163 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5164 enter->op_other = o;
5172 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5174 o->op_targ = (PADOFFSET)PL_hints;
5179 Perl_ck_exit(pTHX_ OP *o)
5182 HV *table = GvHV(PL_hintgv);
5184 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
5185 if (svp && *svp && SvTRUE(*svp))
5186 o->op_private |= OPpEXIT_VMSISH;
5193 Perl_ck_exec(pTHX_ OP *o)
5196 if (o->op_flags & OPf_STACKED) {
5198 kid = cUNOPo->op_first->op_sibling;
5199 if (kid->op_type == OP_RV2GV)
5208 Perl_ck_exists(pTHX_ OP *o)
5211 if (o->op_flags & OPf_KIDS) {
5212 OP *kid = cUNOPo->op_first;
5213 if (kid->op_type == OP_ENTERSUB) {
5214 (void) ref(kid, o->op_type);
5215 if (kid->op_type != OP_RV2CV && !PL_error_count)
5216 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5217 PL_op_desc[o->op_type]);
5218 o->op_private |= OPpEXISTS_SUB;
5220 else if (kid->op_type == OP_AELEM)
5221 o->op_flags |= OPf_SPECIAL;
5222 else if (kid->op_type != OP_HELEM)
5223 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5224 PL_op_desc[o->op_type]);
5232 Perl_ck_gvconst(pTHX_ register OP *o)
5234 o = fold_constants(o);
5235 if (o->op_type == OP_CONST)
5242 Perl_ck_rvconst(pTHX_ register OP *o)
5245 SVOP *kid = (SVOP*)cUNOPo->op_first;
5247 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5248 if (kid->op_type == OP_CONST) {
5252 SV *kidsv = kid->op_sv;
5255 /* Is it a constant from cv_const_sv()? */
5256 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5257 SV *rsv = SvRV(kidsv);
5258 int svtype = SvTYPE(rsv);
5259 char *badtype = Nullch;
5261 switch (o->op_type) {
5263 if (svtype > SVt_PVMG)
5264 badtype = "a SCALAR";
5267 if (svtype != SVt_PVAV)
5268 badtype = "an ARRAY";
5271 if (svtype != SVt_PVHV) {
5272 if (svtype == SVt_PVAV) { /* pseudohash? */
5273 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5274 if (ksv && SvROK(*ksv)
5275 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5284 if (svtype != SVt_PVCV)
5289 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5292 name = SvPV(kidsv, n_a);
5293 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5294 char *badthing = Nullch;
5295 switch (o->op_type) {
5297 badthing = "a SCALAR";
5300 badthing = "an ARRAY";
5303 badthing = "a HASH";
5308 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5312 * This is a little tricky. We only want to add the symbol if we
5313 * didn't add it in the lexer. Otherwise we get duplicate strict
5314 * warnings. But if we didn't add it in the lexer, we must at
5315 * least pretend like we wanted to add it even if it existed before,
5316 * or we get possible typo warnings. OPpCONST_ENTERED says
5317 * whether the lexer already added THIS instance of this symbol.
5319 iscv = (o->op_type == OP_RV2CV) * 2;
5321 gv = gv_fetchpv(name,
5322 iscv | !(kid->op_private & OPpCONST_ENTERED),
5325 : o->op_type == OP_RV2SV
5327 : o->op_type == OP_RV2AV
5329 : o->op_type == OP_RV2HV
5332 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5334 kid->op_type = OP_GV;
5335 SvREFCNT_dec(kid->op_sv);
5337 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5338 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5340 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5342 kid->op_sv = SvREFCNT_inc(gv);
5344 kid->op_ppaddr = PL_ppaddr[OP_GV];
5351 Perl_ck_ftst(pTHX_ OP *o)
5354 I32 type = o->op_type;
5356 if (o->op_flags & OPf_REF) {
5359 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5360 SVOP *kid = (SVOP*)cUNOPo->op_first;
5362 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5364 OP *newop = newGVOP(type, OPf_REF,
5365 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5372 if (type == OP_FTTTY)
5373 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5376 o = newUNOP(type, 0, newDEFSVOP());
5379 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5381 if (PL_hints & HINT_LOCALE)
5382 o->op_private |= OPpLOCALE;
5389 Perl_ck_fun(pTHX_ OP *o)
5396 int type = o->op_type;
5397 register I32 oa = PL_opargs[type] >> OASHIFT;
5399 if (o->op_flags & OPf_STACKED) {
5400 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5403 return no_fh_allowed(o);
5406 if (o->op_flags & OPf_KIDS) {
5408 tokid = &cLISTOPo->op_first;
5409 kid = cLISTOPo->op_first;
5410 if (kid->op_type == OP_PUSHMARK ||
5411 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5413 tokid = &kid->op_sibling;
5414 kid = kid->op_sibling;
5416 if (!kid && PL_opargs[type] & OA_DEFGV)
5417 *tokid = kid = newDEFSVOP();
5421 sibl = kid->op_sibling;
5424 /* list seen where single (scalar) arg expected? */
5425 if (numargs == 1 && !(oa >> 4)
5426 && kid->op_type == OP_LIST && type != OP_SCALAR)
5428 return too_many_arguments(o,PL_op_desc[type]);
5441 if (kid->op_type == OP_CONST &&
5442 (kid->op_private & OPpCONST_BARE))
5444 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5445 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5446 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5447 if (ckWARN(WARN_DEPRECATED))
5448 Perl_warner(aTHX_ WARN_DEPRECATED,
5449 "Array @%s missing the @ in argument %"IVdf" of %s()",
5450 name, (IV)numargs, PL_op_desc[type]);
5453 kid->op_sibling = sibl;
5456 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5457 bad_type(numargs, "array", PL_op_desc[type], kid);
5461 if (kid->op_type == OP_CONST &&
5462 (kid->op_private & OPpCONST_BARE))
5464 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5465 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5466 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5467 if (ckWARN(WARN_DEPRECATED))
5468 Perl_warner(aTHX_ WARN_DEPRECATED,
5469 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5470 name, (IV)numargs, PL_op_desc[type]);
5473 kid->op_sibling = sibl;
5476 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5477 bad_type(numargs, "hash", PL_op_desc[type], kid);
5482 OP *newop = newUNOP(OP_NULL, 0, kid);
5483 kid->op_sibling = 0;
5485 newop->op_next = newop;
5487 kid->op_sibling = sibl;
5492 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5493 if (kid->op_type == OP_CONST &&
5494 (kid->op_private & OPpCONST_BARE))
5496 OP *newop = newGVOP(OP_GV, 0,
5497 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5502 else if (kid->op_type == OP_READLINE) {
5503 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5504 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5507 I32 flags = OPf_SPECIAL;
5511 /* is this op a FH constructor? */
5512 if (is_handle_constructor(o,numargs)) {
5513 char *name = Nullch;
5517 /* Set a flag to tell rv2gv to vivify
5518 * need to "prove" flag does not mean something
5519 * else already - NI-S 1999/05/07
5522 if (kid->op_type == OP_PADSV) {
5523 SV **namep = av_fetch(PL_comppad_name,
5525 if (namep && *namep)
5526 name = SvPV(*namep, len);
5528 else if (kid->op_type == OP_RV2SV
5529 && kUNOP->op_first->op_type == OP_GV)
5531 GV *gv = cGVOPx_gv(kUNOP->op_first);
5533 len = GvNAMELEN(gv);
5535 else if (kid->op_type == OP_AELEM
5536 || kid->op_type == OP_HELEM)
5538 name = "__ANONIO__";
5544 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5545 namesv = PL_curpad[targ];
5546 (void)SvUPGRADE(namesv, SVt_PV);
5548 sv_setpvn(namesv, "$", 1);
5549 sv_catpvn(namesv, name, len);
5552 kid->op_sibling = 0;
5553 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5554 kid->op_targ = targ;
5555 kid->op_private |= priv;
5557 kid->op_sibling = sibl;
5563 mod(scalar(kid), type);
5567 tokid = &kid->op_sibling;
5568 kid = kid->op_sibling;
5570 o->op_private |= numargs;
5572 return too_many_arguments(o,PL_op_desc[o->op_type]);
5575 else if (PL_opargs[type] & OA_DEFGV) {
5577 return newUNOP(type, 0, newDEFSVOP());
5581 while (oa & OA_OPTIONAL)
5583 if (oa && oa != OA_LIST)
5584 return too_few_arguments(o,PL_op_desc[o->op_type]);
5590 Perl_ck_glob(pTHX_ OP *o)
5595 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5596 append_elem(OP_GLOB, o, newDEFSVOP());
5598 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5599 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5601 #if !defined(PERL_EXTERNAL_GLOB)
5602 /* XXX this can be tightened up and made more failsafe. */
5605 Perl_load_module(aTHX_ 0, newSVpvn("File::Glob", 10), Nullsv,
5606 /* null-terminated import list */
5607 newSVpvn(":globally", 9), Nullsv);
5608 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5611 #endif /* PERL_EXTERNAL_GLOB */
5613 if (gv && GvIMPORTED_CV(gv)) {
5614 append_elem(OP_GLOB, o,
5615 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5616 o->op_type = OP_LIST;
5617 o->op_ppaddr = PL_ppaddr[OP_LIST];
5618 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5619 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5620 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5621 append_elem(OP_LIST, o,
5622 scalar(newUNOP(OP_RV2CV, 0,
5623 newGVOP(OP_GV, 0, gv)))));
5624 o = newUNOP(OP_NULL, 0, ck_subr(o));
5625 o->op_targ = OP_GLOB; /* hint at what it used to be */
5628 gv = newGVgen("main");
5630 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5636 Perl_ck_grep(pTHX_ OP *o)
5640 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5642 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5643 NewOp(1101, gwop, 1, LOGOP);
5645 if (o->op_flags & OPf_STACKED) {
5648 kid = cLISTOPo->op_first->op_sibling;
5649 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5652 kid->op_next = (OP*)gwop;
5653 o->op_flags &= ~OPf_STACKED;
5655 kid = cLISTOPo->op_first->op_sibling;
5656 if (type == OP_MAPWHILE)
5663 kid = cLISTOPo->op_first->op_sibling;
5664 if (kid->op_type != OP_NULL)
5665 Perl_croak(aTHX_ "panic: ck_grep");
5666 kid = kUNOP->op_first;
5668 gwop->op_type = type;
5669 gwop->op_ppaddr = PL_ppaddr[type];
5670 gwop->op_first = listkids(o);
5671 gwop->op_flags |= OPf_KIDS;
5672 gwop->op_private = 1;
5673 gwop->op_other = LINKLIST(kid);
5674 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5675 kid->op_next = (OP*)gwop;
5677 kid = cLISTOPo->op_first->op_sibling;
5678 if (!kid || !kid->op_sibling)
5679 return too_few_arguments(o,PL_op_desc[o->op_type]);
5680 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5681 mod(kid, OP_GREPSTART);
5687 Perl_ck_index(pTHX_ OP *o)
5689 if (o->op_flags & OPf_KIDS) {
5690 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5692 kid = kid->op_sibling; /* get past "big" */
5693 if (kid && kid->op_type == OP_CONST)
5694 fbm_compile(((SVOP*)kid)->op_sv, 0);
5700 Perl_ck_lengthconst(pTHX_ OP *o)
5702 /* XXX length optimization goes here */
5707 Perl_ck_lfun(pTHX_ OP *o)
5709 OPCODE type = o->op_type;
5710 return modkids(ck_fun(o), type);
5714 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5717 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5718 switch (cUNOPo->op_first->op_type) {
5720 break; /* Globals via GV can be undef */
5722 case OP_AASSIGN: /* Is this a good idea? */
5723 Perl_warner(aTHX_ WARN_DEPRECATED,
5724 "defined(@array) is deprecated");
5725 Perl_warner(aTHX_ WARN_DEPRECATED,
5726 "\t(Maybe you should just omit the defined()?)\n");
5729 break; /* Globals via GV can be undef */
5731 Perl_warner(aTHX_ WARN_DEPRECATED,
5732 "defined(%%hash) is deprecated");
5733 Perl_warner(aTHX_ WARN_DEPRECATED,
5734 "\t(Maybe you should just omit the defined()?)\n");
5745 Perl_ck_rfun(pTHX_ OP *o)
5747 OPCODE type = o->op_type;
5748 return refkids(ck_fun(o), type);
5752 Perl_ck_listiob(pTHX_ OP *o)
5756 kid = cLISTOPo->op_first;
5759 kid = cLISTOPo->op_first;
5761 if (kid->op_type == OP_PUSHMARK)
5762 kid = kid->op_sibling;
5763 if (kid && o->op_flags & OPf_STACKED)
5764 kid = kid->op_sibling;
5765 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5766 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5767 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5768 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5769 cLISTOPo->op_first->op_sibling = kid;
5770 cLISTOPo->op_last = kid;
5771 kid = kid->op_sibling;
5776 append_elem(o->op_type, o, newDEFSVOP());
5782 if (PL_hints & HINT_LOCALE)
5783 o->op_private |= OPpLOCALE;
5790 Perl_ck_fun_locale(pTHX_ OP *o)
5796 if (PL_hints & HINT_LOCALE)
5797 o->op_private |= OPpLOCALE;
5804 Perl_ck_sassign(pTHX_ OP *o)
5806 OP *kid = cLISTOPo->op_first;
5807 /* has a disposable target? */
5808 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5809 && !(kid->op_flags & OPf_STACKED)
5810 /* Cannot steal the second time! */
5811 && !(kid->op_private & OPpTARGET_MY))
5813 OP *kkid = kid->op_sibling;
5815 /* Can just relocate the target. */
5816 if (kkid && kkid->op_type == OP_PADSV
5817 && !(kkid->op_private & OPpLVAL_INTRO))
5819 kid->op_targ = kkid->op_targ;
5821 /* Now we do not need PADSV and SASSIGN. */
5822 kid->op_sibling = o->op_sibling; /* NULL */
5823 cLISTOPo->op_first = NULL;
5826 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5834 Perl_ck_scmp(pTHX_ OP *o)
5838 if (PL_hints & HINT_LOCALE)
5839 o->op_private |= OPpLOCALE;
5846 Perl_ck_match(pTHX_ OP *o)
5848 o->op_private |= OPpRUNTIME;
5853 Perl_ck_method(pTHX_ OP *o)
5855 OP *kid = cUNOPo->op_first;
5856 if (kid->op_type == OP_CONST) {
5857 SV* sv = kSVOP->op_sv;
5858 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5860 (void)SvUPGRADE(sv, SVt_PVIV);
5862 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5863 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5864 kSVOP->op_sv = Nullsv;
5873 Perl_ck_null(pTHX_ OP *o)
5879 Perl_ck_open(pTHX_ OP *o)
5881 HV *table = GvHV(PL_hintgv);
5885 svp = hv_fetch(table, "open_IN", 7, FALSE);
5887 mode = mode_from_discipline(*svp);
5888 if (mode & O_BINARY)
5889 o->op_private |= OPpOPEN_IN_RAW;
5890 else if (mode & O_TEXT)
5891 o->op_private |= OPpOPEN_IN_CRLF;
5894 svp = hv_fetch(table, "open_OUT", 8, FALSE);
5896 mode = mode_from_discipline(*svp);
5897 if (mode & O_BINARY)
5898 o->op_private |= OPpOPEN_OUT_RAW;
5899 else if (mode & O_TEXT)
5900 o->op_private |= OPpOPEN_OUT_CRLF;
5903 if (o->op_type == OP_BACKTICK)
5909 Perl_ck_repeat(pTHX_ OP *o)
5911 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5912 o->op_private |= OPpREPEAT_DOLIST;
5913 cBINOPo->op_first = force_list(cBINOPo->op_first);
5921 Perl_ck_require(pTHX_ OP *o)
5923 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5924 SVOP *kid = (SVOP*)cUNOPo->op_first;
5926 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5928 for (s = SvPVX(kid->op_sv); *s; s++) {
5929 if (*s == ':' && s[1] == ':') {
5931 Move(s+2, s+1, strlen(s+2)+1, char);
5932 --SvCUR(kid->op_sv);
5935 if (SvREADONLY(kid->op_sv)) {
5936 SvREADONLY_off(kid->op_sv);
5937 sv_catpvn(kid->op_sv, ".pm", 3);
5938 SvREADONLY_on(kid->op_sv);
5941 sv_catpvn(kid->op_sv, ".pm", 3);
5949 Perl_ck_retarget(pTHX_ OP *o)
5951 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5958 Perl_ck_select(pTHX_ OP *o)
5961 if (o->op_flags & OPf_KIDS) {
5962 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5963 if (kid && kid->op_sibling) {
5964 o->op_type = OP_SSELECT;
5965 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5967 return fold_constants(o);
5971 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5972 if (kid && kid->op_type == OP_RV2GV)
5973 kid->op_private &= ~HINT_STRICT_REFS;
5978 Perl_ck_shift(pTHX_ OP *o)
5980 I32 type = o->op_type;
5982 if (!(o->op_flags & OPf_KIDS)) {
5987 if (!CvUNIQUE(PL_compcv)) {
5988 argop = newOP(OP_PADAV, OPf_REF);
5989 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5992 argop = newUNOP(OP_RV2AV, 0,
5993 scalar(newGVOP(OP_GV, 0,
5994 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5997 argop = newUNOP(OP_RV2AV, 0,
5998 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5999 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6000 #endif /* USE_THREADS */
6001 return newUNOP(type, 0, scalar(argop));
6003 return scalar(modkids(ck_fun(o), type));
6007 Perl_ck_sort(pTHX_ OP *o)
6012 if (PL_hints & HINT_LOCALE)
6013 o->op_private |= OPpLOCALE;
6016 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
6018 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6019 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
6021 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
6023 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
6025 if (kid->op_type == OP_SCOPE) {
6029 else if (kid->op_type == OP_LEAVE) {
6030 if (o->op_type == OP_SORT) {
6031 null(kid); /* wipe out leave */
6034 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
6035 if (k->op_next == kid)
6037 /* don't descend into loops */
6038 else if (k->op_type == OP_ENTERLOOP
6039 || k->op_type == OP_ENTERITER)
6041 k = cLOOPx(k)->op_lastop;
6046 kid->op_next = 0; /* just disconnect the leave */
6047 k = kLISTOP->op_first;
6052 if (o->op_type == OP_SORT) {
6053 /* provide scalar context for comparison function/block */
6059 o->op_flags |= OPf_SPECIAL;
6061 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
6064 firstkid = firstkid->op_sibling;
6067 /* provide list context for arguments */
6068 if (o->op_type == OP_SORT)
6075 S_simplify_sort(pTHX_ OP *o)
6078 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6082 if (!(o->op_flags & OPf_STACKED))
6084 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
6085 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
6086 kid = kUNOP->op_first; /* get past null */
6087 if (kid->op_type != OP_SCOPE)
6089 kid = kLISTOP->op_last; /* get past scope */
6090 switch(kid->op_type) {
6098 k = kid; /* remember this node*/
6099 if (kBINOP->op_first->op_type != OP_RV2SV)
6101 kid = kBINOP->op_first; /* get past cmp */
6102 if (kUNOP->op_first->op_type != OP_GV)
6104 kid = kUNOP->op_first; /* get past rv2sv */
6106 if (GvSTASH(gv) != PL_curstash)
6108 if (strEQ(GvNAME(gv), "a"))
6110 else if (strEQ(GvNAME(gv), "b"))
6114 kid = k; /* back to cmp */
6115 if (kBINOP->op_last->op_type != OP_RV2SV)
6117 kid = kBINOP->op_last; /* down to 2nd arg */
6118 if (kUNOP->op_first->op_type != OP_GV)
6120 kid = kUNOP->op_first; /* get past rv2sv */
6122 if (GvSTASH(gv) != PL_curstash
6124 ? strNE(GvNAME(gv), "a")
6125 : strNE(GvNAME(gv), "b")))
6127 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6129 o->op_private |= OPpSORT_REVERSE;
6130 if (k->op_type == OP_NCMP)
6131 o->op_private |= OPpSORT_NUMERIC;
6132 if (k->op_type == OP_I_NCMP)
6133 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6134 kid = cLISTOPo->op_first->op_sibling;
6135 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6136 op_free(kid); /* then delete it */
6137 cLISTOPo->op_children--;
6141 Perl_ck_split(pTHX_ OP *o)
6145 if (o->op_flags & OPf_STACKED)
6146 return no_fh_allowed(o);
6148 kid = cLISTOPo->op_first;
6149 if (kid->op_type != OP_NULL)
6150 Perl_croak(aTHX_ "panic: ck_split");
6151 kid = kid->op_sibling;
6152 op_free(cLISTOPo->op_first);
6153 cLISTOPo->op_first = kid;
6155 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6156 cLISTOPo->op_last = kid; /* There was only one element previously */
6159 if (kid->op_type != OP_MATCH) {
6160 OP *sibl = kid->op_sibling;
6161 kid->op_sibling = 0;
6162 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6163 if (cLISTOPo->op_first == cLISTOPo->op_last)
6164 cLISTOPo->op_last = kid;
6165 cLISTOPo->op_first = kid;
6166 kid->op_sibling = sibl;
6169 kid->op_type = OP_PUSHRE;
6170 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6173 if (!kid->op_sibling)
6174 append_elem(OP_SPLIT, o, newDEFSVOP());
6176 kid = kid->op_sibling;
6179 if (!kid->op_sibling)
6180 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6182 kid = kid->op_sibling;
6185 if (kid->op_sibling)
6186 return too_many_arguments(o,PL_op_desc[o->op_type]);
6192 Perl_ck_join(pTHX_ OP *o)
6194 if (ckWARN(WARN_SYNTAX)) {
6195 OP *kid = cLISTOPo->op_first->op_sibling;
6196 if (kid && kid->op_type == OP_MATCH) {
6197 char *pmstr = "STRING";
6198 if (kPMOP->op_pmregexp)
6199 pmstr = kPMOP->op_pmregexp->precomp;
6200 Perl_warner(aTHX_ WARN_SYNTAX,
6201 "/%s/ should probably be written as \"%s\"",
6209 Perl_ck_subr(pTHX_ OP *o)
6212 OP *prev = ((cUNOPo->op_first->op_sibling)
6213 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6214 OP *o2 = prev->op_sibling;
6223 o->op_private |= OPpENTERSUB_HASTARG;
6224 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6225 if (cvop->op_type == OP_RV2CV) {
6227 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6228 null(cvop); /* disable rv2cv */
6229 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6230 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6231 GV *gv = cGVOPx_gv(tmpop);
6234 tmpop->op_private |= OPpEARLY_CV;
6235 else if (SvPOK(cv)) {
6236 namegv = CvANON(cv) ? gv : CvGV(cv);
6237 proto = SvPV((SV*)cv, n_a);
6241 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6242 if (o2->op_type == OP_CONST)
6243 o2->op_private &= ~OPpCONST_STRICT;
6244 else if (o2->op_type == OP_LIST) {
6245 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6246 if (o && o->op_type == OP_CONST)
6247 o->op_private &= ~OPpCONST_STRICT;
6250 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6251 if (PERLDB_SUB && PL_curstash != PL_debstash)
6252 o->op_private |= OPpENTERSUB_DB;
6253 while (o2 != cvop) {
6257 return too_many_arguments(o, gv_ename(namegv));
6275 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6277 arg == 1 ? "block or sub {}" : "sub {}",
6278 gv_ename(namegv), o2);
6281 /* '*' allows any scalar type, including bareword */
6284 if (o2->op_type == OP_RV2GV)
6285 goto wrapref; /* autoconvert GLOB -> GLOBref */
6286 else if (o2->op_type == OP_CONST)
6287 o2->op_private &= ~OPpCONST_STRICT;
6288 else if (o2->op_type == OP_ENTERSUB) {
6289 /* accidental subroutine, revert to bareword */
6290 OP *gvop = ((UNOP*)o2)->op_first;
6291 if (gvop && gvop->op_type == OP_NULL) {
6292 gvop = ((UNOP*)gvop)->op_first;
6294 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6297 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6298 (gvop = ((UNOP*)gvop)->op_first) &&
6299 gvop->op_type == OP_GV)
6301 GV *gv = cGVOPx_gv(gvop);
6302 OP *sibling = o2->op_sibling;
6303 SV *n = newSVpvn("",0);
6305 gv_fullname3(n, gv, "");
6306 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6307 sv_chop(n, SvPVX(n)+6);
6308 o2 = newSVOP(OP_CONST, 0, n);
6309 prev->op_sibling = o2;
6310 o2->op_sibling = sibling;
6322 if (o2->op_type != OP_RV2GV)
6323 bad_type(arg, "symbol", gv_ename(namegv), o2);
6326 if (o2->op_type != OP_ENTERSUB)
6327 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6330 if (o2->op_type != OP_RV2SV
6331 && o2->op_type != OP_PADSV
6332 && o2->op_type != OP_HELEM
6333 && o2->op_type != OP_AELEM
6334 && o2->op_type != OP_THREADSV)
6336 bad_type(arg, "scalar", gv_ename(namegv), o2);
6340 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6341 bad_type(arg, "array", gv_ename(namegv), o2);
6344 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6345 bad_type(arg, "hash", gv_ename(namegv), o2);
6349 OP* sib = kid->op_sibling;
6350 kid->op_sibling = 0;
6351 o2 = newUNOP(OP_REFGEN, 0, kid);
6352 o2->op_sibling = sib;
6353 prev->op_sibling = o2;
6364 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6365 gv_ename(namegv), SvPV((SV*)cv, n_a));
6370 mod(o2, OP_ENTERSUB);
6372 o2 = o2->op_sibling;
6374 if (proto && !optional &&
6375 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6376 return too_few_arguments(o, gv_ename(namegv));
6381 Perl_ck_svconst(pTHX_ OP *o)
6383 SvREADONLY_on(cSVOPo->op_sv);
6388 Perl_ck_trunc(pTHX_ OP *o)
6390 if (o->op_flags & OPf_KIDS) {
6391 SVOP *kid = (SVOP*)cUNOPo->op_first;
6393 if (kid->op_type == OP_NULL)
6394 kid = (SVOP*)kid->op_sibling;
6395 if (kid && kid->op_type == OP_CONST &&
6396 (kid->op_private & OPpCONST_BARE))
6398 o->op_flags |= OPf_SPECIAL;
6399 kid->op_private &= ~OPpCONST_STRICT;
6405 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6408 Perl_peep(pTHX_ register OP *o)
6411 register OP* oldop = 0;
6413 OP *last_composite = Nullop;
6415 if (!o || o->op_seq)
6419 SAVEVPTR(PL_curcop);
6420 for (; o; o = o->op_next) {
6426 switch (o->op_type) {
6430 PL_curcop = ((COP*)o); /* for warnings */
6431 o->op_seq = PL_op_seqmax++;
6432 last_composite = Nullop;
6436 if (cSVOPo->op_private & OPpCONST_STRICT)
6437 no_bareword_allowed(o);
6439 /* Relocate sv to the pad for thread safety.
6440 * Despite being a "constant", the SV is written to,
6441 * for reference counts, sv_upgrade() etc. */
6443 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6444 if (SvPADTMP(cSVOPo->op_sv)) {
6445 /* If op_sv is already a PADTMP then it is being used by
6446 * another pad, so make a copy. */
6447 sv_setsv(PL_curpad[ix],cSVOPo->op_sv);
6448 SvREADONLY_on(PL_curpad[ix]);
6449 SvREFCNT_dec(cSVOPo->op_sv);
6452 SvREFCNT_dec(PL_curpad[ix]);
6453 SvPADTMP_on(cSVOPo->op_sv);
6454 PL_curpad[ix] = cSVOPo->op_sv;
6456 cSVOPo->op_sv = Nullsv;
6460 o->op_seq = PL_op_seqmax++;
6464 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6465 if (o->op_next->op_private & OPpTARGET_MY) {
6466 if (o->op_flags & OPf_STACKED) /* chained concats */
6467 goto ignore_optimization;
6469 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6470 o->op_targ = o->op_next->op_targ;
6471 o->op_next->op_targ = 0;
6472 o->op_private |= OPpTARGET_MY;
6477 ignore_optimization:
6478 o->op_seq = PL_op_seqmax++;
6481 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6482 o->op_seq = PL_op_seqmax++;
6483 break; /* Scalar stub must produce undef. List stub is noop */
6487 if (o->op_targ == OP_NEXTSTATE
6488 || o->op_targ == OP_DBSTATE
6489 || o->op_targ == OP_SETSTATE)
6491 PL_curcop = ((COP*)o);
6498 if (oldop && o->op_next) {
6499 oldop->op_next = o->op_next;
6502 o->op_seq = PL_op_seqmax++;
6506 if (o->op_next->op_type == OP_RV2SV) {
6507 if (!(o->op_next->op_private & OPpDEREF)) {
6509 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6511 o->op_next = o->op_next->op_next;
6512 o->op_type = OP_GVSV;
6513 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6516 else if (o->op_next->op_type == OP_RV2AV) {
6517 OP* pop = o->op_next->op_next;
6519 if (pop->op_type == OP_CONST &&
6520 (PL_op = pop->op_next) &&
6521 pop->op_next->op_type == OP_AELEM &&
6522 !(pop->op_next->op_private &
6523 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6524 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6532 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6533 o->op_next = pop->op_next->op_next;
6534 o->op_type = OP_AELEMFAST;
6535 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6536 o->op_private = (U8)i;
6541 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6543 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6544 /* XXX could check prototype here instead of just carping */
6545 SV *sv = sv_newmortal();
6546 gv_efullname3(sv, gv, Nullch);
6547 Perl_warner(aTHX_ WARN_PROTOTYPE,
6548 "%s() called too early to check prototype",
6553 o->op_seq = PL_op_seqmax++;
6564 o->op_seq = PL_op_seqmax++;
6565 while (cLOGOP->op_other->op_type == OP_NULL)
6566 cLOGOP->op_other = cLOGOP->op_other->op_next;
6567 peep(cLOGOP->op_other);
6571 o->op_seq = PL_op_seqmax++;
6572 peep(cLOOP->op_redoop);
6573 peep(cLOOP->op_nextop);
6574 peep(cLOOP->op_lastop);
6580 o->op_seq = PL_op_seqmax++;
6581 peep(cPMOP->op_pmreplstart);
6585 o->op_seq = PL_op_seqmax++;
6586 if (ckWARN(WARN_SYNTAX) && o->op_next
6587 && o->op_next->op_type == OP_NEXTSTATE) {
6588 if (o->op_next->op_sibling &&
6589 o->op_next->op_sibling->op_type != OP_EXIT &&
6590 o->op_next->op_sibling->op_type != OP_WARN &&
6591 o->op_next->op_sibling->op_type != OP_DIE) {
6592 line_t oldline = CopLINE(PL_curcop);
6594 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6595 Perl_warner(aTHX_ WARN_EXEC,
6596 "Statement unlikely to be reached");
6597 Perl_warner(aTHX_ WARN_EXEC,
6598 "\t(Maybe you meant system() when you said exec()?)\n");
6599 CopLINE_set(PL_curcop, oldline);
6608 SV **svp, **indsvp, *sv;
6613 o->op_seq = PL_op_seqmax++;
6614 if ((o->op_private & (OPpLVAL_INTRO))
6615 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6617 rop = (UNOP*)((BINOP*)o)->op_first;
6618 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6620 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6621 if (!SvOBJECT(lexname))
6623 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6624 if (!fields || !GvHV(*fields))
6626 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6627 key = SvPV(*svp, keylen);
6628 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6630 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6631 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6633 ind = SvIV(*indsvp);
6635 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6636 rop->op_type = OP_RV2AV;
6637 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6638 o->op_type = OP_AELEM;
6639 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6641 if (SvREADONLY(*svp))
6643 SvFLAGS(sv) |= (SvFLAGS(*svp)
6644 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6654 SV **svp, **indsvp, *sv;
6658 SVOP *first_key_op, *key_op;
6660 o->op_seq = PL_op_seqmax++;
6661 if ((o->op_private & (OPpLVAL_INTRO))
6662 /* I bet there's always a pushmark... */
6663 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
6664 /* hmmm, no optimization if list contains only one key. */
6666 rop = (UNOP*)((LISTOP*)o)->op_last;
6667 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6669 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6670 if (!SvOBJECT(lexname))
6672 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6673 if (!fields || !GvHV(*fields))
6675 /* Again guessing that the pushmark can be jumped over.... */
6676 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
6677 ->op_first->op_sibling;
6678 /* Check that the key list contains only constants. */
6679 for (key_op = first_key_op; key_op;
6680 key_op = (SVOP*)key_op->op_sibling)
6681 if (key_op->op_type != OP_CONST)
6685 rop->op_type = OP_RV2AV;
6686 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6687 o->op_type = OP_ASLICE;
6688 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
6689 for (key_op = first_key_op; key_op;
6690 key_op = (SVOP*)key_op->op_sibling) {
6691 svp = cSVOPx_svp(key_op);
6692 key = SvPV(*svp, keylen);
6693 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6695 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
6696 "in variable %s of type %s",
6697 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6699 ind = SvIV(*indsvp);
6701 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6703 if (SvREADONLY(*svp))
6705 SvFLAGS(sv) |= (SvFLAGS(*svp)
6706 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6715 if (!(o->op_flags & OPf_WANT)
6716 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6720 o->op_seq = PL_op_seqmax++;
6724 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6725 o->op_seq = PL_op_seqmax++;
6731 if (last_composite) {
6732 OP *r = last_composite;
6734 while (r->op_sibling)
6737 || (r->op_next->op_type == OP_LIST
6738 && r->op_next->op_next == o))
6740 if (last_composite->op_type == OP_RV2AV)
6741 yyerror("Lvalue subs returning arrays not implemented yet");
6743 yyerror("Lvalue subs returning hashes not implemented yet");
6750 o->op_seq = PL_op_seqmax++;