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 */
27 # define OP_REFCNT_LOCK NOOP
28 # define OP_REFCNT_UNLOCK NOOP
29 # define OpREFCNT_set(o,n) ((o)->op_targ = (n))
30 # define OpREFCNT_dec(o) (--(o)->op_targ)
32 # define OP_REFCNT_LOCK NOOP
33 # define OP_REFCNT_UNLOCK NOOP
34 # define OpREFCNT_set(o,n) NOOP
35 # define OpREFCNT_dec(o) 0
38 #ifdef PL_OP_SLAB_ALLOC
39 #define SLAB_SIZE 8192
40 static char *PL_OpPtr = NULL;
41 static int PL_OpSpace = 0;
42 #define NewOp(m,var,c,type) do { if ((PL_OpSpace -= c*sizeof(type)) >= 0) \
43 var = (type *)(PL_OpPtr -= c*sizeof(type)); \
45 var = (type *) Slab_Alloc(m,c*sizeof(type)); \
49 S_Slab_Alloc(pTHX_ int m, size_t sz)
51 Newz(m,PL_OpPtr,SLAB_SIZE,char);
52 PL_OpSpace = SLAB_SIZE - sz;
53 return PL_OpPtr += PL_OpSpace;
57 #define NewOp(m, var, c, type) Newz(m, var, c, type)
60 * In the following definition, the ", Nullop" is just to make the compiler
61 * think the expression is of the right type: croak actually does a Siglongjmp.
63 #define CHECKOP(type,o) \
64 ((PL_op_mask && PL_op_mask[type]) \
65 ? ( op_free((OP*)o), \
66 Perl_croak(aTHX_ "%s trapped by operation mask", PL_op_desc[type]), \
68 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
70 #define PAD_MAX 999999999
73 S_gv_ename(pTHX_ GV *gv)
76 SV* tmpsv = sv_newmortal();
77 gv_efullname3(tmpsv, gv, Nullch);
78 return SvPV(tmpsv,n_a);
82 S_no_fh_allowed(pTHX_ OP *o)
84 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
85 PL_op_desc[o->op_type]));
90 S_too_few_arguments(pTHX_ OP *o, char *name)
92 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
97 S_too_many_arguments(pTHX_ OP *o, char *name)
99 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
104 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
106 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
107 (int)n, name, t, PL_op_desc[kid->op_type]));
111 S_no_bareword_allowed(pTHX_ OP *o)
113 qerror(Perl_mess(aTHX_
114 "Bareword \"%s\" not allowed while \"strict subs\" in use",
115 SvPV_nolen(cSVOPo_sv)));
118 /* "register" allocation */
121 Perl_pad_allocmy(pTHX_ char *name)
127 if (!(PL_in_my == KEY_our ||
129 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
130 (name[1] == '_' && (int)strlen(name) > 2)))
132 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
133 /* 1999-02-27 mjd@plover.com */
135 p = strchr(name, '\0');
136 /* The next block assumes the buffer is at least 205 chars
137 long. At present, it's always at least 256 chars. */
139 strcpy(name+200, "...");
145 /* Move everything else down one character */
146 for (; p-name > 2; p--)
148 name[2] = toCTRL(name[1]);
151 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
153 if (ckWARN(WARN_MISC) && AvFILLp(PL_comppad_name) >= 0) {
154 SV **svp = AvARRAY(PL_comppad_name);
155 HV *ourstash = (PL_curstash ? PL_curstash : PL_defstash);
156 PADOFFSET top = AvFILLp(PL_comppad_name);
157 for (off = top; off > PL_comppad_name_floor; off--) {
159 && sv != &PL_sv_undef
160 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
161 && (PL_in_my != KEY_our
162 || ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash))
163 && strEQ(name, SvPVX(sv)))
165 Perl_warner(aTHX_ WARN_MISC,
166 "\"%s\" variable %s masks earlier declaration in same %s",
167 (PL_in_my == KEY_our ? "our" : "my"),
169 (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
174 if (PL_in_my == KEY_our) {
177 && sv != &PL_sv_undef
178 && ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash)
179 && strEQ(name, SvPVX(sv)))
181 Perl_warner(aTHX_ WARN_MISC,
182 "\"our\" variable %s redeclared", name);
183 Perl_warner(aTHX_ WARN_MISC,
184 "(Did you mean \"local\" instead of \"our\"?)\n");
191 off = pad_alloc(OP_PADSV, SVs_PADMY);
193 sv_upgrade(sv, SVt_PVNV);
195 if (PL_in_my_stash) {
197 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"%s\"",
198 name, PL_in_my == KEY_our ? "our" : "my"));
200 (void)SvUPGRADE(sv, SVt_PVMG);
201 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
204 if (PL_in_my == KEY_our) {
205 (void)SvUPGRADE(sv, SVt_PVGV);
206 GvSTASH(sv) = (HV*)SvREFCNT_inc(PL_curstash ? (SV*)PL_curstash : (SV*)PL_defstash);
207 SvFLAGS(sv) |= SVpad_OUR;
209 av_store(PL_comppad_name, off, sv);
210 SvNVX(sv) = (NV)PAD_MAX;
211 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
212 if (!PL_min_intro_pending)
213 PL_min_intro_pending = off;
214 PL_max_intro_pending = off;
216 av_store(PL_comppad, off, (SV*)newAV());
217 else if (*name == '%')
218 av_store(PL_comppad, off, (SV*)newHV());
219 SvPADMY_on(PL_curpad[off]);
224 S_pad_addlex(pTHX_ SV *proto_namesv)
226 SV *namesv = NEWSV(1103,0);
227 PADOFFSET newoff = pad_alloc(OP_PADSV, SVs_PADMY);
228 sv_upgrade(namesv, SVt_PVNV);
229 sv_setpv(namesv, SvPVX(proto_namesv));
230 av_store(PL_comppad_name, newoff, namesv);
231 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
232 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
233 SvFAKE_on(namesv); /* A ref, not a real var */
234 if (SvFLAGS(proto_namesv) & SVpad_OUR) { /* An "our" variable */
235 SvFLAGS(namesv) |= SVpad_OUR;
236 (void)SvUPGRADE(namesv, SVt_PVGV);
237 GvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)GvSTASH(proto_namesv));
239 if (SvOBJECT(proto_namesv)) { /* A typed var */
241 (void)SvUPGRADE(namesv, SVt_PVMG);
242 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(proto_namesv));
248 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
251 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
252 I32 cx_ix, I32 saweval, U32 flags)
259 register PERL_CONTEXT *cx;
261 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
262 AV *curlist = CvPADLIST(cv);
263 SV **svp = av_fetch(curlist, 0, FALSE);
266 if (!svp || *svp == &PL_sv_undef)
269 svp = AvARRAY(curname);
270 for (off = AvFILLp(curname); off > 0; off--) {
271 if ((sv = svp[off]) &&
272 sv != &PL_sv_undef &&
274 seq > I_32(SvNVX(sv)) &&
275 strEQ(SvPVX(sv), name))
286 return 0; /* don't clone from inactive stack frame */
290 oldpad = (AV*)AvARRAY(curlist)[depth];
291 oldsv = *av_fetch(oldpad, off, TRUE);
292 if (!newoff) { /* Not a mere clone operation. */
293 newoff = pad_addlex(sv);
294 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
295 /* "It's closures all the way down." */
296 CvCLONE_on(PL_compcv);
298 if (CvANON(PL_compcv))
299 oldsv = Nullsv; /* no need to keep ref */
304 bcv && bcv != cv && !CvCLONE(bcv);
305 bcv = CvOUTSIDE(bcv))
308 /* install the missing pad entry in intervening
309 * nested subs and mark them cloneable.
310 * XXX fix pad_foo() to not use globals */
311 AV *ocomppad_name = PL_comppad_name;
312 AV *ocomppad = PL_comppad;
313 SV **ocurpad = PL_curpad;
314 AV *padlist = CvPADLIST(bcv);
315 PL_comppad_name = (AV*)AvARRAY(padlist)[0];
316 PL_comppad = (AV*)AvARRAY(padlist)[1];
317 PL_curpad = AvARRAY(PL_comppad);
319 PL_comppad_name = ocomppad_name;
320 PL_comppad = ocomppad;
325 if (ckWARN(WARN_CLOSURE)
326 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
328 Perl_warner(aTHX_ WARN_CLOSURE,
329 "Variable \"%s\" may be unavailable",
337 else if (!CvUNIQUE(PL_compcv)) {
338 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
339 Perl_warner(aTHX_ WARN_CLOSURE,
340 "Variable \"%s\" will not stay shared", name);
343 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
349 if (flags & FINDLEX_NOSEARCH)
352 /* Nothing in current lexical context--try eval's context, if any.
353 * This is necessary to let the perldb get at lexically scoped variables.
354 * XXX This will also probably interact badly with eval tree caching.
357 for (i = cx_ix; i >= 0; i--) {
359 switch (CxTYPE(cx)) {
361 if (i == 0 && saweval) {
362 seq = cxstack[saweval].blk_oldcop->cop_seq;
363 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
367 switch (cx->blk_eval.old_op_type) {
373 /* require must have its own scope */
382 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
383 saweval = i; /* so we know where we were called from */
386 seq = cxstack[saweval].blk_oldcop->cop_seq;
387 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
395 Perl_pad_findmy(pTHX_ char *name)
401 SV **svp = AvARRAY(PL_comppad_name);
402 U32 seq = PL_cop_seqmax;
408 * Special case to get lexical (and hence per-thread) @_.
409 * XXX I need to find out how to tell at parse-time whether use
410 * of @_ should refer to a lexical (from a sub) or defgv (global
411 * scope and maybe weird sub-ish things like formats). See
412 * startsub in perly.y. It's possible that @_ could be lexical
413 * (at least from subs) even in non-threaded perl.
415 if (strEQ(name, "@_"))
416 return 0; /* success. (NOT_IN_PAD indicates failure) */
417 #endif /* USE_THREADS */
419 /* The one we're looking for is probably just before comppad_name_fill. */
420 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
421 if ((sv = svp[off]) &&
422 sv != &PL_sv_undef &&
425 seq > I_32(SvNVX(sv)))) &&
426 strEQ(SvPVX(sv), name))
428 if (SvIVX(sv) || SvFLAGS(sv) & SVpad_OUR)
429 return (PADOFFSET)off;
430 pendoff = off; /* this pending def. will override import */
434 outside = CvOUTSIDE(PL_compcv);
436 /* Check if if we're compiling an eval'', and adjust seq to be the
437 * eval's seq number. This depends on eval'' having a non-null
438 * CvOUTSIDE() while it is being compiled. The eval'' itself is
439 * identified by CvEVAL being true and CvGV being null. */
440 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
441 cx = &cxstack[cxstack_ix];
443 seq = cx->blk_oldcop->cop_seq;
446 /* See if it's in a nested scope */
447 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
449 /* If there is a pending local definition, this new alias must die */
451 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
452 return off; /* pad_findlex returns 0 for failure...*/
454 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
458 Perl_pad_leavemy(pTHX_ I32 fill)
462 SV **svp = AvARRAY(PL_comppad_name);
464 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
465 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
466 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
467 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
470 /* "Deintroduce" my variables that are leaving with this scope. */
471 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
472 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
473 SvIVX(sv) = PL_cop_seqmax;
478 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
484 if (AvARRAY(PL_comppad) != PL_curpad)
485 Perl_croak(aTHX_ "panic: pad_alloc");
486 if (PL_pad_reset_pending)
488 if (tmptype & SVs_PADMY) {
490 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
491 } while (SvPADBUSY(sv)); /* need a fresh one */
492 retval = AvFILLp(PL_comppad);
495 SV **names = AvARRAY(PL_comppad_name);
496 SSize_t names_fill = AvFILLp(PL_comppad_name);
499 * "foreach" index vars temporarily become aliases to non-"my"
500 * values. Thus we must skip, not just pad values that are
501 * marked as current pad values, but also those with names.
503 if (++PL_padix <= names_fill &&
504 (sv = names[PL_padix]) && sv != &PL_sv_undef)
506 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
507 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)) && !IS_PADGV(sv))
512 SvFLAGS(sv) |= tmptype;
513 PL_curpad = AvARRAY(PL_comppad);
515 DEBUG_X(PerlIO_printf(Perl_debug_log,
516 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
517 PTR2UV(thr), PTR2UV(PL_curpad),
518 (long) retval, PL_op_name[optype]));
520 DEBUG_X(PerlIO_printf(Perl_debug_log,
521 "Pad 0x%"UVxf" alloc %ld for %s\n",
523 (long) retval, PL_op_name[optype]));
524 #endif /* USE_THREADS */
525 return (PADOFFSET)retval;
529 Perl_pad_sv(pTHX_ PADOFFSET po)
533 DEBUG_X(PerlIO_printf(Perl_debug_log,
534 "0x%"UVxf" Pad 0x%"UVxf" sv %"IVdf"\n",
535 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
538 Perl_croak(aTHX_ "panic: pad_sv po");
539 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %"IVdf"\n",
540 PTR2UV(PL_curpad), (IV)po));
541 #endif /* USE_THREADS */
542 return PL_curpad[po]; /* eventually we'll turn this into a macro */
546 Perl_pad_free(pTHX_ PADOFFSET po)
551 if (AvARRAY(PL_comppad) != PL_curpad)
552 Perl_croak(aTHX_ "panic: pad_free curpad");
554 Perl_croak(aTHX_ "panic: pad_free po");
556 DEBUG_X(PerlIO_printf(Perl_debug_log,
557 "0x%"UVxf" Pad 0x%"UVxf" free %"IVdf"\n",
558 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
560 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %"IVdf"\n",
561 PTR2UV(PL_curpad), (IV)po));
562 #endif /* USE_THREADS */
563 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
564 SvPADTMP_off(PL_curpad[po]);
566 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
569 if ((I32)po < PL_padix)
574 Perl_pad_swipe(pTHX_ PADOFFSET po)
577 if (AvARRAY(PL_comppad) != PL_curpad)
578 Perl_croak(aTHX_ "panic: pad_swipe curpad");
580 Perl_croak(aTHX_ "panic: pad_swipe po");
582 DEBUG_X(PerlIO_printf(Perl_debug_log,
583 "0x%"UVxf" Pad 0x%"UVxf" swipe %"IVdf"\n",
584 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
586 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %"IVdf"\n",
587 PTR2UV(PL_curpad), (IV)po));
588 #endif /* USE_THREADS */
589 SvPADTMP_off(PL_curpad[po]);
590 PL_curpad[po] = NEWSV(1107,0);
591 SvPADTMP_on(PL_curpad[po]);
592 if ((I32)po < PL_padix)
596 /* XXX pad_reset() is currently disabled because it results in serious bugs.
597 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
598 * on the stack by OPs that use them, there are several ways to get an alias
599 * to a shared TARG. Such an alias will change randomly and unpredictably.
600 * We avoid doing this until we can think of a Better Way.
605 #ifdef USE_BROKEN_PAD_RESET
609 if (AvARRAY(PL_comppad) != PL_curpad)
610 Perl_croak(aTHX_ "panic: pad_reset curpad");
612 DEBUG_X(PerlIO_printf(Perl_debug_log,
613 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
614 PTR2UV(thr), PTR2UV(PL_curpad)));
616 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
618 #endif /* USE_THREADS */
619 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
620 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
621 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
622 SvPADTMP_off(PL_curpad[po]);
624 PL_padix = PL_padix_floor;
627 PL_pad_reset_pending = FALSE;
631 /* find_threadsv is not reentrant */
633 Perl_find_threadsv(pTHX_ const char *name)
639 /* We currently only handle names of a single character */
640 p = strchr(PL_threadsv_names, *name);
643 key = p - PL_threadsv_names;
644 MUTEX_LOCK(&thr->mutex);
645 svp = av_fetch(thr->threadsv, key, FALSE);
647 MUTEX_UNLOCK(&thr->mutex);
649 SV *sv = NEWSV(0, 0);
650 av_store(thr->threadsv, key, sv);
651 thr->threadsvp = AvARRAY(thr->threadsv);
652 MUTEX_UNLOCK(&thr->mutex);
654 * Some magic variables used to be automagically initialised
655 * in gv_fetchpv. Those which are now per-thread magicals get
656 * initialised here instead.
662 sv_setpv(sv, "\034");
663 sv_magic(sv, 0, 0, name, 1);
668 PL_sawampersand = TRUE;
682 /* XXX %! tied to Errno.pm needs to be added here.
683 * See gv_fetchpv(). */
687 sv_magic(sv, 0, 0, name, 1);
689 DEBUG_S(PerlIO_printf(Perl_error_log,
690 "find_threadsv: new SV %p for $%s%c\n",
691 sv, (*name < 32) ? "^" : "",
692 (*name < 32) ? toCTRL(*name) : *name));
696 #endif /* USE_THREADS */
701 Perl_op_free(pTHX_ OP *o)
703 register OP *kid, *nextkid;
706 if (!o || o->op_seq == (U16)-1)
709 if (o->op_private & OPpREFCOUNTED) {
710 switch (o->op_type) {
718 if (OpREFCNT_dec(o)) {
729 if (o->op_flags & OPf_KIDS) {
730 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
731 nextkid = kid->op_sibling; /* Get before next freeing kid */
739 /* COP* is not cleared by op_clear() so that we may track line
740 * numbers etc even after null() */
741 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
746 #ifdef PL_OP_SLAB_ALLOC
747 if ((char *) o == PL_OpPtr)
756 S_op_clear(pTHX_ OP *o)
758 switch (o->op_type) {
759 case OP_NULL: /* Was holding old type, if any. */
760 case OP_ENTEREVAL: /* Was holding hints. */
762 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
768 if (!(o->op_flags & OPf_SPECIAL))
771 #endif /* USE_THREADS */
773 if (!(o->op_flags & OPf_REF)
774 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
781 if (cPADOPo->op_padix > 0) {
784 pad_swipe(cPADOPo->op_padix);
785 /* No GvIN_PAD_off(gv) here, because other references may still
786 * exist on the pad */
789 cPADOPo->op_padix = 0;
792 SvREFCNT_dec(cSVOPo->op_sv);
793 cSVOPo->op_sv = Nullsv;
797 SvREFCNT_dec(cSVOPo->op_sv);
798 cSVOPo->op_sv = Nullsv;
804 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
808 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
809 SvREFCNT_dec(cSVOPo->op_sv);
810 cSVOPo->op_sv = Nullsv;
813 Safefree(cPVOPo->op_pv);
814 cPVOPo->op_pv = Nullch;
818 op_free(cPMOPo->op_pmreplroot);
822 if ((PADOFFSET)cPMOPo->op_pmreplroot) {
824 GV *gv = (GV*)PL_curpad[(PADOFFSET)cPMOPo->op_pmreplroot];
825 pad_swipe((PADOFFSET)cPMOPo->op_pmreplroot);
826 /* No GvIN_PAD_off(gv) here, because other references may still
827 * exist on the pad */
832 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
838 cPMOPo->op_pmreplroot = Nullop;
839 ReREFCNT_dec(cPMOPo->op_pmregexp);
840 cPMOPo->op_pmregexp = (REGEXP*)NULL;
844 if (o->op_targ > 0) {
845 pad_free(o->op_targ);
851 S_cop_free(pTHX_ COP* cop)
853 Safefree(cop->cop_label);
855 Safefree(CopFILE(cop)); /* XXXXX share in a pvtable? */
856 Safefree(CopSTASHPV(cop)); /* XXXXX share in a pvtable? */
858 /* NOTE: COP.cop_stash is not refcounted */
859 SvREFCNT_dec(CopFILEGV(cop));
861 if (! specialWARN(cop->cop_warnings))
862 SvREFCNT_dec(cop->cop_warnings);
868 if (o->op_type == OP_NULL)
871 o->op_targ = o->op_type;
872 o->op_type = OP_NULL;
873 o->op_ppaddr = PL_ppaddr[OP_NULL];
876 /* Contextualizers */
878 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
881 Perl_linklist(pTHX_ OP *o)
888 /* establish postfix order */
889 if (cUNOPo->op_first) {
890 o->op_next = LINKLIST(cUNOPo->op_first);
891 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
893 kid->op_next = LINKLIST(kid->op_sibling);
905 Perl_scalarkids(pTHX_ OP *o)
908 if (o && o->op_flags & OPf_KIDS) {
909 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
916 S_scalarboolean(pTHX_ OP *o)
918 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
920 if (ckWARN(WARN_SYNTAX)) {
921 line_t oldline = CopLINE(PL_curcop);
923 if (PL_copline != NOLINE)
924 CopLINE_set(PL_curcop, PL_copline);
925 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
926 CopLINE_set(PL_curcop, oldline);
933 Perl_scalar(pTHX_ OP *o)
937 /* assumes no premature commitment */
938 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
939 || o->op_type == OP_RETURN)
944 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
946 switch (o->op_type) {
948 if (o->op_private & OPpREPEAT_DOLIST)
949 null(((LISTOP*)cBINOPo->op_first)->op_first);
950 scalar(cBINOPo->op_first);
955 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
959 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
960 if (!kPMOP->op_pmreplroot)
961 deprecate("implicit split to @_");
969 if (o->op_flags & OPf_KIDS) {
970 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
976 kid = cLISTOPo->op_first;
978 while ((kid = kid->op_sibling)) {
984 WITH_THR(PL_curcop = &PL_compiling);
989 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
995 WITH_THR(PL_curcop = &PL_compiling);
1002 Perl_scalarvoid(pTHX_ OP *o)
1009 if (o->op_type == OP_NEXTSTATE
1010 || o->op_type == OP_SETSTATE
1011 || o->op_type == OP_DBSTATE
1012 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1013 || o->op_targ == OP_SETSTATE
1014 || o->op_targ == OP_DBSTATE)))
1017 PL_curcop = (COP*)o; /* for warning below */
1020 /* assumes no premature commitment */
1021 want = o->op_flags & OPf_WANT;
1022 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
1023 || o->op_type == OP_RETURN)
1028 if ((o->op_private & OPpTARGET_MY)
1029 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1031 return scalar(o); /* As if inside SASSIGN */
1034 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1036 switch (o->op_type) {
1038 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1042 if (o->op_flags & OPf_STACKED)
1046 if (o->op_private == 4)
1088 case OP_GETSOCKNAME:
1089 case OP_GETPEERNAME:
1094 case OP_GETPRIORITY:
1117 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1118 useless = PL_op_desc[o->op_type];
1125 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1126 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1127 useless = "a variable";
1132 if (cSVOPo->op_private & OPpCONST_STRICT)
1133 no_bareword_allowed(o);
1136 if (ckWARN(WARN_VOID)) {
1137 useless = "a constant";
1138 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1140 else if (SvPOK(sv)) {
1141 if (strnEQ(SvPVX(sv), "di", 2) ||
1142 strnEQ(SvPVX(sv), "ds", 2) ||
1143 strnEQ(SvPVX(sv), "ig", 2))
1148 null(o); /* don't execute or even remember it */
1152 o->op_type = OP_PREINC; /* pre-increment is faster */
1153 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1157 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1158 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1164 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1169 if (o->op_flags & OPf_STACKED)
1177 if (!(o->op_flags & OPf_KIDS))
1186 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1193 /* all requires must return a boolean value */
1194 o->op_flags &= ~OPf_WANT;
1197 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1198 if (!kPMOP->op_pmreplroot)
1199 deprecate("implicit split to @_");
1205 if (ckWARN(WARN_VOID))
1206 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1212 Perl_listkids(pTHX_ OP *o)
1215 if (o && o->op_flags & OPf_KIDS) {
1216 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1223 Perl_list(pTHX_ OP *o)
1227 /* assumes no premature commitment */
1228 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1229 || o->op_type == OP_RETURN)
1234 if ((o->op_private & OPpTARGET_MY)
1235 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1237 return o; /* As if inside SASSIGN */
1240 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1242 switch (o->op_type) {
1245 list(cBINOPo->op_first);
1250 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1258 if (!(o->op_flags & OPf_KIDS))
1260 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1261 list(cBINOPo->op_first);
1262 return gen_constant_list(o);
1269 kid = cLISTOPo->op_first;
1271 while ((kid = kid->op_sibling)) {
1272 if (kid->op_sibling)
1277 WITH_THR(PL_curcop = &PL_compiling);
1281 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1282 if (kid->op_sibling)
1287 WITH_THR(PL_curcop = &PL_compiling);
1290 /* all requires must return a boolean value */
1291 o->op_flags &= ~OPf_WANT;
1298 Perl_scalarseq(pTHX_ OP *o)
1303 if (o->op_type == OP_LINESEQ ||
1304 o->op_type == OP_SCOPE ||
1305 o->op_type == OP_LEAVE ||
1306 o->op_type == OP_LEAVETRY)
1309 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1310 if (kid->op_sibling) {
1314 PL_curcop = &PL_compiling;
1316 o->op_flags &= ~OPf_PARENS;
1317 if (PL_hints & HINT_BLOCK_SCOPE)
1318 o->op_flags |= OPf_PARENS;
1321 o = newOP(OP_STUB, 0);
1326 S_modkids(pTHX_ OP *o, I32 type)
1329 if (o && o->op_flags & OPf_KIDS) {
1330 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1337 Perl_mod(pTHX_ OP *o, I32 type)
1343 if (!o || PL_error_count)
1346 if ((o->op_private & OPpTARGET_MY)
1347 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1352 switch (o->op_type) {
1357 if (!(o->op_private & (OPpCONST_ARYBASE)))
1359 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1360 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1364 SAVEI32(PL_compiling.cop_arybase);
1365 PL_compiling.cop_arybase = 0;
1367 else if (type == OP_REFGEN)
1370 Perl_croak(aTHX_ "That use of $[ is unsupported");
1373 if (o->op_flags & OPf_PARENS)
1377 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1378 !(o->op_flags & OPf_STACKED)) {
1379 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1380 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1381 assert(cUNOPo->op_first->op_type == OP_NULL);
1382 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1385 else { /* lvalue subroutine call */
1386 o->op_private |= OPpLVAL_INTRO;
1387 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1388 /* Backward compatibility mode: */
1389 o->op_private |= OPpENTERSUB_INARGS;
1392 else { /* Compile-time error message: */
1393 OP *kid = cUNOPo->op_first;
1397 if (kid->op_type == OP_PUSHMARK)
1399 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1401 "panic: unexpected lvalue entersub "
1402 "args: type/targ %ld:%ld",
1403 (long)kid->op_type,kid->op_targ);
1404 kid = kLISTOP->op_first;
1406 while (kid->op_sibling)
1407 kid = kid->op_sibling;
1408 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1410 if (kid->op_type == OP_METHOD_NAMED
1411 || kid->op_type == OP_METHOD)
1415 if (kid->op_sibling || kid->op_next != kid) {
1416 yyerror("panic: unexpected optree near method call");
1420 NewOp(1101, newop, 1, UNOP);
1421 newop->op_type = OP_RV2CV;
1422 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1423 newop->op_first = Nullop;
1424 newop->op_next = (OP*)newop;
1425 kid->op_sibling = (OP*)newop;
1426 newop->op_private |= OPpLVAL_INTRO;
1430 if (kid->op_type != OP_RV2CV)
1432 "panic: unexpected lvalue entersub "
1433 "entry via type/targ %ld:%ld",
1434 (long)kid->op_type,kid->op_targ);
1435 kid->op_private |= OPpLVAL_INTRO;
1436 break; /* Postpone until runtime */
1440 kid = kUNOP->op_first;
1441 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1442 kid = kUNOP->op_first;
1443 if (kid->op_type == OP_NULL)
1445 "Unexpected constant lvalue entersub "
1446 "entry via type/targ %ld:%ld",
1447 (long)kid->op_type,kid->op_targ);
1448 if (kid->op_type != OP_GV) {
1449 /* Restore RV2CV to check lvalueness */
1451 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1452 okid->op_next = kid->op_next;
1453 kid->op_next = okid;
1456 okid->op_next = Nullop;
1457 okid->op_type = OP_RV2CV;
1459 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1460 okid->op_private |= OPpLVAL_INTRO;
1464 cv = GvCV(kGVOP_gv);
1474 /* grep, foreach, subcalls, refgen */
1475 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1477 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1478 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1480 : (o->op_type == OP_ENTERSUB
1481 ? "non-lvalue subroutine call"
1482 : PL_op_desc[o->op_type])),
1483 type ? PL_op_desc[type] : "local"));
1497 case OP_RIGHT_SHIFT:
1506 if (!(o->op_flags & OPf_STACKED))
1512 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1518 if (!type && cUNOPo->op_first->op_type != OP_GV)
1519 Perl_croak(aTHX_ "Can't localize through a reference");
1520 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1521 PL_modcount = 10000;
1522 return o; /* Treat \(@foo) like ordinary list. */
1526 if (scalar_mod_type(o, type))
1528 ref(cUNOPo->op_first, o->op_type);
1537 PL_modcount = 10000;
1540 if (!type && cUNOPo->op_first->op_type != OP_GV)
1541 Perl_croak(aTHX_ "Can't localize through a reference");
1542 ref(cUNOPo->op_first, o->op_type);
1546 PL_hints |= HINT_BLOCK_SCOPE;
1556 PL_modcount = 10000;
1557 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1558 return o; /* Treat \(@foo) like ordinary list. */
1559 if (scalar_mod_type(o, type))
1565 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1566 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1571 PL_modcount++; /* XXX ??? */
1573 #endif /* USE_THREADS */
1579 if (type != OP_SASSIGN)
1583 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1589 pad_free(o->op_targ);
1590 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1591 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1592 if (o->op_flags & OPf_KIDS)
1593 mod(cBINOPo->op_first->op_sibling, type);
1598 ref(cBINOPo->op_first, o->op_type);
1599 if (type == OP_ENTERSUB &&
1600 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1601 o->op_private |= OPpLVAL_DEFER;
1608 if (o->op_flags & OPf_KIDS)
1609 mod(cLISTOPo->op_last, type);
1613 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1615 else if (!(o->op_flags & OPf_KIDS))
1617 if (o->op_targ != OP_LIST) {
1618 mod(cBINOPo->op_first, type);
1623 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1627 o->op_flags |= OPf_MOD;
1629 if (type == OP_AASSIGN || type == OP_SASSIGN)
1630 o->op_flags |= OPf_SPECIAL|OPf_REF;
1632 o->op_private |= OPpLVAL_INTRO;
1633 o->op_flags &= ~OPf_SPECIAL;
1634 PL_hints |= HINT_BLOCK_SCOPE;
1636 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1637 o->op_flags |= OPf_REF;
1642 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1646 if (o->op_type == OP_RV2GV)
1670 case OP_RIGHT_SHIFT:
1689 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1691 switch (o->op_type) {
1699 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1712 Perl_refkids(pTHX_ OP *o, I32 type)
1715 if (o && o->op_flags & OPf_KIDS) {
1716 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1723 Perl_ref(pTHX_ OP *o, I32 type)
1727 if (!o || PL_error_count)
1730 switch (o->op_type) {
1732 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1733 !(o->op_flags & OPf_STACKED)) {
1734 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1735 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1736 assert(cUNOPo->op_first->op_type == OP_NULL);
1737 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1738 o->op_flags |= OPf_SPECIAL;
1743 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1747 if (type == OP_DEFINED)
1748 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1749 ref(cUNOPo->op_first, o->op_type);
1752 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1753 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1754 : type == OP_RV2HV ? OPpDEREF_HV
1756 o->op_flags |= OPf_MOD;
1761 o->op_flags |= OPf_MOD; /* XXX ??? */
1766 o->op_flags |= OPf_REF;
1769 if (type == OP_DEFINED)
1770 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1771 ref(cUNOPo->op_first, o->op_type);
1776 o->op_flags |= OPf_REF;
1781 if (!(o->op_flags & OPf_KIDS))
1783 ref(cBINOPo->op_first, type);
1787 ref(cBINOPo->op_first, o->op_type);
1788 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1789 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1790 : type == OP_RV2HV ? OPpDEREF_HV
1792 o->op_flags |= OPf_MOD;
1800 if (!(o->op_flags & OPf_KIDS))
1802 ref(cLISTOPo->op_last, type);
1812 S_dup_attrlist(pTHX_ OP *o)
1816 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1817 * where the first kid is OP_PUSHMARK and the remaining ones
1818 * are OP_CONST. We need to push the OP_CONST values.
1820 if (o->op_type == OP_CONST)
1821 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1823 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1824 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1825 if (o->op_type == OP_CONST)
1826 rop = append_elem(OP_LIST, rop,
1827 newSVOP(OP_CONST, o->op_flags,
1828 SvREFCNT_inc(cSVOPo->op_sv)));
1835 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1837 OP *modname; /* for 'use' */
1840 /* fake up C<use attributes $pkg,$rv,@attrs> */
1841 ENTER; /* need to protect against side-effects of 'use' */
1843 if (stash && HvNAME(stash))
1844 stashsv = newSVpv(HvNAME(stash), 0);
1846 stashsv = &PL_sv_no;
1847 #define ATTRSMODULE "attributes"
1848 modname = newSVOP(OP_CONST, 0,
1849 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1));
1850 modname->op_private |= OPpCONST_BARE;
1851 /* that flag is required to make 'use' work right */
1852 utilize(1, start_subparse(FALSE, 0),
1853 Nullop, /* version */
1855 prepend_elem(OP_LIST,
1856 newSVOP(OP_CONST, 0, stashsv),
1857 prepend_elem(OP_LIST,
1858 newSVOP(OP_CONST, 0, newRV(target)),
1859 dup_attrlist(attrs))));
1864 S_my_kid(pTHX_ OP *o, OP *attrs)
1869 if (!o || PL_error_count)
1873 if (type == OP_LIST) {
1874 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1876 } else if (type == OP_UNDEF) {
1878 } else if (type == OP_RV2SV || /* "our" declaration */
1880 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1881 o->op_private |= OPpOUR_INTRO;
1883 } else if (type != OP_PADSV &&
1886 type != OP_PUSHMARK)
1888 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1889 PL_op_desc[o->op_type],
1890 PL_in_my == KEY_our ? "our" : "my"));
1893 else if (attrs && type != OP_PUSHMARK) {
1899 PL_in_my_stash = Nullhv;
1901 /* check for C<my Dog $spot> when deciding package */
1902 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1903 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1904 stash = SvSTASH(*namesvp);
1906 stash = PL_curstash;
1907 padsv = PAD_SV(o->op_targ);
1908 apply_attrs(stash, padsv, attrs);
1910 o->op_flags |= OPf_MOD;
1911 o->op_private |= OPpLVAL_INTRO;
1916 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1918 if (o->op_flags & OPf_PARENS)
1922 o = my_kid(o, attrs);
1924 PL_in_my_stash = Nullhv;
1929 Perl_my(pTHX_ OP *o)
1931 return my_kid(o, Nullop);
1935 Perl_sawparens(pTHX_ OP *o)
1938 o->op_flags |= OPf_PARENS;
1943 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1948 if (ckWARN(WARN_MISC) &&
1949 (left->op_type == OP_RV2AV ||
1950 left->op_type == OP_RV2HV ||
1951 left->op_type == OP_PADAV ||
1952 left->op_type == OP_PADHV)) {
1953 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1954 right->op_type == OP_TRANS)
1955 ? right->op_type : OP_MATCH];
1956 const char *sample = ((left->op_type == OP_RV2AV ||
1957 left->op_type == OP_PADAV)
1958 ? "@array" : "%hash");
1959 Perl_warner(aTHX_ WARN_MISC,
1960 "Applying %s to %s will act on scalar(%s)",
1961 desc, sample, sample);
1964 if (right->op_type == OP_MATCH ||
1965 right->op_type == OP_SUBST ||
1966 right->op_type == OP_TRANS) {
1967 right->op_flags |= OPf_STACKED;
1968 if (right->op_type != OP_MATCH)
1969 left = mod(left, right->op_type);
1970 if (right->op_type == OP_TRANS)
1971 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1973 o = prepend_elem(right->op_type, scalar(left), right);
1975 return newUNOP(OP_NOT, 0, scalar(o));
1979 return bind_match(type, left,
1980 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1984 Perl_invert(pTHX_ OP *o)
1988 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1989 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1993 Perl_scope(pTHX_ OP *o)
1996 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1997 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1998 o->op_type = OP_LEAVE;
1999 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2002 if (o->op_type == OP_LINESEQ) {
2004 o->op_type = OP_SCOPE;
2005 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2006 kid = ((LISTOP*)o)->op_first;
2007 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2011 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
2018 Perl_save_hints(pTHX)
2021 SAVESPTR(GvHV(PL_hintgv));
2022 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
2023 SAVEFREESV(GvHV(PL_hintgv));
2027 Perl_block_start(pTHX_ int full)
2030 int retval = PL_savestack_ix;
2032 SAVEI32(PL_comppad_name_floor);
2033 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
2035 PL_comppad_name_fill = PL_comppad_name_floor;
2036 if (PL_comppad_name_floor < 0)
2037 PL_comppad_name_floor = 0;
2038 SAVEI32(PL_min_intro_pending);
2039 SAVEI32(PL_max_intro_pending);
2040 PL_min_intro_pending = 0;
2041 SAVEI32(PL_comppad_name_fill);
2042 SAVEI32(PL_padix_floor);
2043 PL_padix_floor = PL_padix;
2044 PL_pad_reset_pending = FALSE;
2046 PL_hints &= ~HINT_BLOCK_SCOPE;
2047 SAVESPTR(PL_compiling.cop_warnings);
2048 if (! specialWARN(PL_compiling.cop_warnings)) {
2049 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2050 SAVEFREESV(PL_compiling.cop_warnings) ;
2056 Perl_block_end(pTHX_ I32 floor, OP *seq)
2059 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2060 OP* retval = scalarseq(seq);
2062 PL_pad_reset_pending = FALSE;
2063 PL_compiling.op_private = PL_hints;
2065 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2066 pad_leavemy(PL_comppad_name_fill);
2075 OP *o = newOP(OP_THREADSV, 0);
2076 o->op_targ = find_threadsv("_");
2079 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2080 #endif /* USE_THREADS */
2084 Perl_newPROG(pTHX_ OP *o)
2090 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2091 ((PL_in_eval & EVAL_KEEPERR)
2092 ? OPf_SPECIAL : 0), o);
2093 PL_eval_start = linklist(PL_eval_root);
2094 PL_eval_root->op_private |= OPpREFCOUNTED;
2095 OpREFCNT_set(PL_eval_root, 1);
2096 PL_eval_root->op_next = 0;
2097 peep(PL_eval_start);
2102 PL_main_root = scope(sawparens(scalarvoid(o)));
2103 PL_curcop = &PL_compiling;
2104 PL_main_start = LINKLIST(PL_main_root);
2105 PL_main_root->op_private |= OPpREFCOUNTED;
2106 OpREFCNT_set(PL_main_root, 1);
2107 PL_main_root->op_next = 0;
2108 peep(PL_main_start);
2111 /* Register with debugger */
2113 CV *cv = get_cv("DB::postponed", FALSE);
2117 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2119 call_sv((SV*)cv, G_DISCARD);
2126 Perl_localize(pTHX_ OP *o, I32 lex)
2128 if (o->op_flags & OPf_PARENS)
2132 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2134 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2135 if (*s == ';' || *s == '=')
2136 Perl_warner(aTHX_ WARN_PARENTHESIS,
2137 "Parentheses missing around \"%s\" list",
2138 lex ? (PL_in_my == KEY_our ? "our" : "my") : "local");
2144 o = mod(o, OP_NULL); /* a bit kludgey */
2146 PL_in_my_stash = Nullhv;
2151 Perl_jmaybe(pTHX_ OP *o)
2153 if (o->op_type == OP_LIST) {
2156 o2 = newOP(OP_THREADSV, 0);
2157 o2->op_targ = find_threadsv(";");
2159 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2160 #endif /* USE_THREADS */
2161 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2167 Perl_fold_constants(pTHX_ register OP *o)
2171 I32 type = o->op_type;
2174 if (PL_opargs[type] & OA_RETSCALAR)
2176 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2177 o->op_targ = pad_alloc(type, SVs_PADTMP);
2179 /* integerize op, unless it happens to be C<-foo>.
2180 * XXX should pp_i_negate() do magic string negation instead? */
2181 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2182 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2183 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2185 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2188 if (!(PL_opargs[type] & OA_FOLDCONST))
2193 /* XXX might want a ck_negate() for this */
2194 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2207 if (o->op_private & OPpLOCALE)
2212 goto nope; /* Don't try to run w/ errors */
2214 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2215 if ((curop->op_type != OP_CONST ||
2216 (curop->op_private & OPpCONST_BARE)) &&
2217 curop->op_type != OP_LIST &&
2218 curop->op_type != OP_SCALAR &&
2219 curop->op_type != OP_NULL &&
2220 curop->op_type != OP_PUSHMARK)
2226 curop = LINKLIST(o);
2230 sv = *(PL_stack_sp--);
2231 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2232 pad_swipe(o->op_targ);
2233 else if (SvTEMP(sv)) { /* grab mortal temp? */
2234 (void)SvREFCNT_inc(sv);
2238 if (type == OP_RV2GV)
2239 return newGVOP(OP_GV, 0, (GV*)sv);
2241 /* try to smush double to int, but don't smush -2.0 to -2 */
2242 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2246 if ((NV)iv == SvNV(sv)) {
2251 SvIOK_off(sv); /* undo SvIV() damage */
2253 return newSVOP(OP_CONST, 0, sv);
2257 if (!(PL_opargs[type] & OA_OTHERINT))
2260 if (!(PL_hints & HINT_INTEGER)) {
2261 if (type == OP_MODULO
2262 || type == OP_DIVIDE
2263 || !(o->op_flags & OPf_KIDS))
2268 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2269 if (curop->op_type == OP_CONST) {
2270 if (SvIOK(((SVOP*)curop)->op_sv))
2274 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2278 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2285 Perl_gen_constant_list(pTHX_ register OP *o)
2289 I32 oldtmps_floor = PL_tmps_floor;
2293 return o; /* Don't attempt to run with errors */
2295 PL_op = curop = LINKLIST(o);
2302 PL_tmps_floor = oldtmps_floor;
2304 o->op_type = OP_RV2AV;
2305 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2306 curop = ((UNOP*)o)->op_first;
2307 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2314 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2319 if (!o || o->op_type != OP_LIST)
2320 o = newLISTOP(OP_LIST, 0, o, Nullop);
2322 o->op_flags &= ~OPf_WANT;
2324 if (!(PL_opargs[type] & OA_MARK))
2325 null(cLISTOPo->op_first);
2328 o->op_ppaddr = PL_ppaddr[type];
2329 o->op_flags |= flags;
2331 o = CHECKOP(type, o);
2332 if (o->op_type != type)
2335 if (cLISTOPo->op_children < 7) {
2336 /* XXX do we really need to do this if we're done appending?? */
2337 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2339 cLISTOPo->op_last = last; /* in case check substituted last arg */
2342 return fold_constants(o);
2345 /* List constructors */
2348 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2356 if (first->op_type != type
2357 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2359 return newLISTOP(type, 0, first, last);
2362 if (first->op_flags & OPf_KIDS)
2363 ((LISTOP*)first)->op_last->op_sibling = last;
2365 first->op_flags |= OPf_KIDS;
2366 ((LISTOP*)first)->op_first = last;
2368 ((LISTOP*)first)->op_last = last;
2369 ((LISTOP*)first)->op_children++;
2374 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2382 if (first->op_type != type)
2383 return prepend_elem(type, (OP*)first, (OP*)last);
2385 if (last->op_type != type)
2386 return append_elem(type, (OP*)first, (OP*)last);
2388 first->op_last->op_sibling = last->op_first;
2389 first->op_last = last->op_last;
2390 first->op_children += last->op_children;
2391 if (first->op_children)
2392 first->op_flags |= OPf_KIDS;
2394 #ifdef PL_OP_SLAB_ALLOC
2402 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2410 if (last->op_type == type) {
2411 if (type == OP_LIST) { /* already a PUSHMARK there */
2412 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2413 ((LISTOP*)last)->op_first->op_sibling = first;
2416 if (!(last->op_flags & OPf_KIDS)) {
2417 ((LISTOP*)last)->op_last = first;
2418 last->op_flags |= OPf_KIDS;
2420 first->op_sibling = ((LISTOP*)last)->op_first;
2421 ((LISTOP*)last)->op_first = first;
2423 ((LISTOP*)last)->op_children++;
2427 return newLISTOP(type, 0, first, last);
2433 Perl_newNULLLIST(pTHX)
2435 return newOP(OP_STUB, 0);
2439 Perl_force_list(pTHX_ OP *o)
2441 if (!o || o->op_type != OP_LIST)
2442 o = newLISTOP(OP_LIST, 0, o, Nullop);
2448 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2452 NewOp(1101, listop, 1, LISTOP);
2454 listop->op_type = type;
2455 listop->op_ppaddr = PL_ppaddr[type];
2456 listop->op_children = (first != 0) + (last != 0);
2457 listop->op_flags = flags;
2461 else if (!first && last)
2464 first->op_sibling = last;
2465 listop->op_first = first;
2466 listop->op_last = last;
2467 if (type == OP_LIST) {
2469 pushop = newOP(OP_PUSHMARK, 0);
2470 pushop->op_sibling = first;
2471 listop->op_first = pushop;
2472 listop->op_flags |= OPf_KIDS;
2474 listop->op_last = pushop;
2476 else if (listop->op_children)
2477 listop->op_flags |= OPf_KIDS;
2483 Perl_newOP(pTHX_ I32 type, I32 flags)
2486 NewOp(1101, o, 1, OP);
2488 o->op_ppaddr = PL_ppaddr[type];
2489 o->op_flags = flags;
2492 o->op_private = 0 + (flags >> 8);
2493 if (PL_opargs[type] & OA_RETSCALAR)
2495 if (PL_opargs[type] & OA_TARGET)
2496 o->op_targ = pad_alloc(type, SVs_PADTMP);
2497 return CHECKOP(type, o);
2501 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2506 first = newOP(OP_STUB, 0);
2507 if (PL_opargs[type] & OA_MARK)
2508 first = force_list(first);
2510 NewOp(1101, unop, 1, UNOP);
2511 unop->op_type = type;
2512 unop->op_ppaddr = PL_ppaddr[type];
2513 unop->op_first = first;
2514 unop->op_flags = flags | OPf_KIDS;
2515 unop->op_private = 1 | (flags >> 8);
2516 unop = (UNOP*) CHECKOP(type, unop);
2520 return fold_constants((OP *) unop);
2524 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2527 NewOp(1101, binop, 1, BINOP);
2530 first = newOP(OP_NULL, 0);
2532 binop->op_type = type;
2533 binop->op_ppaddr = PL_ppaddr[type];
2534 binop->op_first = first;
2535 binop->op_flags = flags | OPf_KIDS;
2538 binop->op_private = 1 | (flags >> 8);
2541 binop->op_private = 2 | (flags >> 8);
2542 first->op_sibling = last;
2545 binop = (BINOP*)CHECKOP(type, binop);
2546 if (binop->op_next || binop->op_type != type)
2549 binop->op_last = binop->op_first->op_sibling;
2551 return fold_constants((OP *)binop);
2555 utf8compare(const void *a, const void *b)
2558 for (i = 0; i < 10; i++) {
2559 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2561 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2568 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2570 SV *tstr = ((SVOP*)expr)->op_sv;
2571 SV *rstr = ((SVOP*)repl)->op_sv;
2574 register U8 *t = (U8*)SvPV(tstr, tlen);
2575 register U8 *r = (U8*)SvPV(rstr, rlen);
2581 register short *tbl;
2583 complement = o->op_private & OPpTRANS_COMPLEMENT;
2584 del = o->op_private & OPpTRANS_DELETE;
2585 squash = o->op_private & OPpTRANS_SQUASH;
2587 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2588 SV* listsv = newSVpvn("# comment\n",10);
2590 U8* tend = t + tlen;
2591 U8* rend = r + rlen;
2606 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2607 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2610 U8 tmpbuf[UTF8_MAXLEN];
2613 New(1109, cp, tlen, U8*);
2615 transv = newSVpvn("",0);
2624 qsort(cp, i, sizeof(U8*), utf8compare);
2625 for (j = 0; j < i; j++) {
2627 UV val = utf8_to_uv(s, &ulen);
2629 diff = val - nextmin;
2631 t = uv_to_utf8(tmpbuf,nextmin);
2632 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2634 t = uv_to_utf8(tmpbuf, val - 1);
2635 sv_catpvn(transv, "\377", 1);
2636 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2640 val = utf8_to_uv(s+1, &ulen);
2644 t = uv_to_utf8(tmpbuf,nextmin);
2645 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2646 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2647 sv_catpvn(transv, "\377", 1);
2648 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2649 t = (U8*)SvPVX(transv);
2650 tlen = SvCUR(transv);
2653 else if (!rlen && !del) {
2654 r = t; rlen = tlen; rend = tend;
2657 if (to_utf && from_utf) { /* only counting characters */
2658 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2659 o->op_private |= OPpTRANS_IDENTICAL;
2661 else { /* straight latin-1 translation */
2662 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2663 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2664 o->op_private |= OPpTRANS_IDENTICAL;
2668 while (t < tend || tfirst <= tlast) {
2669 /* see if we need more "t" chars */
2670 if (tfirst > tlast) {
2671 tfirst = (I32)utf8_to_uv(t, &ulen);
2673 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2674 tlast = (I32)utf8_to_uv(++t, &ulen);
2681 /* now see if we need more "r" chars */
2682 if (rfirst > rlast) {
2684 rfirst = (I32)utf8_to_uv(r, &ulen);
2686 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2687 rlast = (I32)utf8_to_uv(++r, &ulen);
2696 rfirst = rlast = 0xffffffff;
2700 /* now see which range will peter our first, if either. */
2701 tdiff = tlast - tfirst;
2702 rdiff = rlast - rfirst;
2709 if (rfirst == 0xffffffff) {
2710 diff = tdiff; /* oops, pretend rdiff is infinite */
2712 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2713 (long)tfirst, (long)tlast);
2715 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2719 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2720 (long)tfirst, (long)(tfirst + diff),
2723 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2724 (long)tfirst, (long)rfirst);
2726 if (rfirst + diff > max)
2727 max = rfirst + diff;
2732 else if (rfirst <= 0x800)
2733 grows |= (tfirst < 0x80);
2734 else if (rfirst <= 0x10000)
2735 grows |= (tfirst < 0x800);
2736 else if (rfirst <= 0x200000)
2737 grows |= (tfirst < 0x10000);
2738 else if (rfirst <= 0x4000000)
2739 grows |= (tfirst < 0x200000);
2740 else if (rfirst <= 0x80000000)
2741 grows |= (tfirst < 0x4000000);
2753 else if (max > 0xff)
2758 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2759 SvREFCNT_dec(listsv);
2761 SvREFCNT_dec(transv);
2763 if (!del && havefinal)
2764 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2766 if (grows && to_utf)
2767 o->op_private |= OPpTRANS_GROWS;
2774 tbl = (short*)cPVOPo->op_pv;
2776 Zero(tbl, 256, short);
2777 for (i = 0; i < tlen; i++)
2779 for (i = 0, j = 0; i < 256; i++) {
2795 if (!rlen && !del) {
2798 o->op_private |= OPpTRANS_IDENTICAL;
2800 for (i = 0; i < 256; i++)
2802 for (i = 0, j = 0; i < tlen; i++,j++) {
2805 if (tbl[t[i]] == -1)
2811 if (tbl[t[i]] == -1)
2822 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2827 NewOp(1101, pmop, 1, PMOP);
2828 pmop->op_type = type;
2829 pmop->op_ppaddr = PL_ppaddr[type];
2830 pmop->op_flags = flags;
2831 pmop->op_private = 0 | (flags >> 8);
2833 if (PL_hints & HINT_RE_TAINT)
2834 pmop->op_pmpermflags |= PMf_RETAINT;
2835 if (PL_hints & HINT_LOCALE)
2836 pmop->op_pmpermflags |= PMf_LOCALE;
2837 pmop->op_pmflags = pmop->op_pmpermflags;
2839 /* link into pm list */
2840 if (type != OP_TRANS && PL_curstash) {
2841 pmop->op_pmnext = HvPMROOT(PL_curstash);
2842 HvPMROOT(PL_curstash) = pmop;
2849 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2854 I32 repl_has_vars = 0;
2856 if (o->op_type == OP_TRANS)
2857 return pmtrans(o, expr, repl);
2859 PL_hints |= HINT_BLOCK_SCOPE;
2862 if (expr->op_type == OP_CONST) {
2864 SV *pat = ((SVOP*)expr)->op_sv;
2865 char *p = SvPV(pat, plen);
2866 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2867 sv_setpvn(pat, "\\s+", 3);
2868 p = SvPV(pat, plen);
2869 pm->op_pmflags |= PMf_SKIPWHITE;
2871 if ((PL_hints & HINT_UTF8) || (SvUTF8(pat) && !(PL_hints & HINT_BYTE)))
2872 pm->op_pmdynflags |= PMdf_UTF8;
2873 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2874 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2875 pm->op_pmflags |= PMf_WHITE;
2879 if (PL_hints & HINT_UTF8)
2880 pm->op_pmdynflags |= PMdf_UTF8;
2881 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2882 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2884 : OP_REGCMAYBE),0,expr);
2886 NewOp(1101, rcop, 1, LOGOP);
2887 rcop->op_type = OP_REGCOMP;
2888 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2889 rcop->op_first = scalar(expr);
2890 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2891 ? (OPf_SPECIAL | OPf_KIDS)
2893 rcop->op_private = 1;
2896 /* establish postfix order */
2897 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2899 rcop->op_next = expr;
2900 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2903 rcop->op_next = LINKLIST(expr);
2904 expr->op_next = (OP*)rcop;
2907 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2912 if (pm->op_pmflags & PMf_EVAL) {
2914 if (CopLINE(PL_curcop) < PL_multi_end)
2915 CopLINE_set(PL_curcop, PL_multi_end);
2918 else if (repl->op_type == OP_THREADSV
2919 && strchr("&`'123456789+",
2920 PL_threadsv_names[repl->op_targ]))
2924 #endif /* USE_THREADS */
2925 else if (repl->op_type == OP_CONST)
2929 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2930 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2932 if (curop->op_type == OP_THREADSV) {
2934 if (strchr("&`'123456789+", curop->op_private))
2938 if (curop->op_type == OP_GV) {
2939 GV *gv = cGVOPx_gv(curop);
2941 if (strchr("&`'123456789+", *GvENAME(gv)))
2944 #endif /* USE_THREADS */
2945 else if (curop->op_type == OP_RV2CV)
2947 else if (curop->op_type == OP_RV2SV ||
2948 curop->op_type == OP_RV2AV ||
2949 curop->op_type == OP_RV2HV ||
2950 curop->op_type == OP_RV2GV) {
2951 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2954 else if (curop->op_type == OP_PADSV ||
2955 curop->op_type == OP_PADAV ||
2956 curop->op_type == OP_PADHV ||
2957 curop->op_type == OP_PADANY) {
2960 else if (curop->op_type == OP_PUSHRE)
2961 ; /* Okay here, dangerous in newASSIGNOP */
2970 && (!pm->op_pmregexp
2971 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2972 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2973 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2974 prepend_elem(o->op_type, scalar(repl), o);
2977 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2978 pm->op_pmflags |= PMf_MAYBE_CONST;
2979 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2981 NewOp(1101, rcop, 1, LOGOP);
2982 rcop->op_type = OP_SUBSTCONT;
2983 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2984 rcop->op_first = scalar(repl);
2985 rcop->op_flags |= OPf_KIDS;
2986 rcop->op_private = 1;
2989 /* establish postfix order */
2990 rcop->op_next = LINKLIST(repl);
2991 repl->op_next = (OP*)rcop;
2993 pm->op_pmreplroot = scalar((OP*)rcop);
2994 pm->op_pmreplstart = LINKLIST(rcop);
3003 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3006 NewOp(1101, svop, 1, SVOP);
3007 svop->op_type = type;
3008 svop->op_ppaddr = PL_ppaddr[type];
3010 svop->op_next = (OP*)svop;
3011 svop->op_flags = flags;
3012 if (PL_opargs[type] & OA_RETSCALAR)
3014 if (PL_opargs[type] & OA_TARGET)
3015 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3016 return CHECKOP(type, svop);
3020 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3023 NewOp(1101, padop, 1, PADOP);
3024 padop->op_type = type;
3025 padop->op_ppaddr = PL_ppaddr[type];
3026 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3027 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3028 PL_curpad[padop->op_padix] = sv;
3030 padop->op_next = (OP*)padop;
3031 padop->op_flags = flags;
3032 if (PL_opargs[type] & OA_RETSCALAR)
3034 if (PL_opargs[type] & OA_TARGET)
3035 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3036 return CHECKOP(type, padop);
3040 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3045 return newPADOP(type, flags, SvREFCNT_inc(gv));
3047 return newSVOP(type, flags, SvREFCNT_inc(gv));
3052 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3055 NewOp(1101, pvop, 1, PVOP);
3056 pvop->op_type = type;
3057 pvop->op_ppaddr = PL_ppaddr[type];
3059 pvop->op_next = (OP*)pvop;
3060 pvop->op_flags = flags;
3061 if (PL_opargs[type] & OA_RETSCALAR)
3063 if (PL_opargs[type] & OA_TARGET)
3064 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3065 return CHECKOP(type, pvop);
3069 Perl_package(pTHX_ OP *o)
3074 save_hptr(&PL_curstash);
3075 save_item(PL_curstname);
3080 name = SvPV(sv, len);
3081 PL_curstash = gv_stashpvn(name,len,TRUE);
3082 sv_setpvn(PL_curstname, name, len);
3086 sv_setpv(PL_curstname,"<none>");
3087 PL_curstash = Nullhv;
3089 PL_hints |= HINT_BLOCK_SCOPE;
3090 PL_copline = NOLINE;
3095 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3103 if (id->op_type != OP_CONST)
3104 Perl_croak(aTHX_ "Module name must be constant");
3108 if (version != Nullop) {
3109 SV *vesv = ((SVOP*)version)->op_sv;
3111 if (arg == Nullop && !SvNIOKp(vesv)) {
3118 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3119 Perl_croak(aTHX_ "Version number must be constant number");
3121 /* Make copy of id so we don't free it twice */
3122 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3124 /* Fake up a method call to VERSION */
3125 meth = newSVpvn("VERSION",7);
3126 sv_upgrade(meth, SVt_PVIV);
3127 (void)SvIOK_on(meth);
3128 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3129 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3130 append_elem(OP_LIST,
3131 prepend_elem(OP_LIST, pack, list(version)),
3132 newSVOP(OP_METHOD_NAMED, 0, meth)));
3136 /* Fake up an import/unimport */
3137 if (arg && arg->op_type == OP_STUB)
3138 imop = arg; /* no import on explicit () */
3139 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3140 imop = Nullop; /* use 5.0; */
3145 /* Make copy of id so we don't free it twice */
3146 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3148 /* Fake up a method call to import/unimport */
3149 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);;
3150 sv_upgrade(meth, SVt_PVIV);
3151 (void)SvIOK_on(meth);
3152 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3153 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3154 append_elem(OP_LIST,
3155 prepend_elem(OP_LIST, pack, list(arg)),
3156 newSVOP(OP_METHOD_NAMED, 0, meth)));
3159 /* Fake up a require, handle override, if any */
3160 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3161 if (!(gv && GvIMPORTED_CV(gv)))
3162 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3164 if (gv && GvIMPORTED_CV(gv)) {
3165 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3166 append_elem(OP_LIST, id,
3167 scalar(newUNOP(OP_RV2CV, 0,
3172 rqop = newUNOP(OP_REQUIRE, 0, id);
3175 /* Fake up the BEGIN {}, which does its thing immediately. */
3177 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3180 append_elem(OP_LINESEQ,
3181 append_elem(OP_LINESEQ,
3182 newSTATEOP(0, Nullch, rqop),
3183 newSTATEOP(0, Nullch, veop)),
3184 newSTATEOP(0, Nullch, imop) ));
3186 PL_hints |= HINT_BLOCK_SCOPE;
3187 PL_copline = NOLINE;
3192 Perl_dofile(pTHX_ OP *term)
3197 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3198 if (!(gv && GvIMPORTED_CV(gv)))
3199 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3201 if (gv && GvIMPORTED_CV(gv)) {
3202 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3203 append_elem(OP_LIST, term,
3204 scalar(newUNOP(OP_RV2CV, 0,
3209 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3215 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3217 return newBINOP(OP_LSLICE, flags,
3218 list(force_list(subscript)),
3219 list(force_list(listval)) );
3223 S_list_assignment(pTHX_ register OP *o)
3228 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3229 o = cUNOPo->op_first;
3231 if (o->op_type == OP_COND_EXPR) {
3232 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3233 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3238 yyerror("Assignment to both a list and a scalar");
3242 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3243 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3244 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3247 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3250 if (o->op_type == OP_RV2SV)
3257 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3262 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3263 return newLOGOP(optype, 0,
3264 mod(scalar(left), optype),
3265 newUNOP(OP_SASSIGN, 0, scalar(right)));
3268 return newBINOP(optype, OPf_STACKED,
3269 mod(scalar(left), optype), scalar(right));
3273 if (list_assignment(left)) {
3278 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3279 left = mod(left, OP_AASSIGN);
3287 curop = list(force_list(left));
3288 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3289 o->op_private = 0 | (flags >> 8);
3290 for (curop = ((LISTOP*)curop)->op_first;
3291 curop; curop = curop->op_sibling)
3293 if (curop->op_type == OP_RV2HV &&
3294 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3295 o->op_private |= OPpASSIGN_HASH;
3299 if (!(left->op_private & OPpLVAL_INTRO)) {
3302 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3303 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3304 if (curop->op_type == OP_GV) {
3305 GV *gv = cGVOPx_gv(curop);
3306 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3308 SvCUR(gv) = PL_generation;
3310 else if (curop->op_type == OP_PADSV ||
3311 curop->op_type == OP_PADAV ||
3312 curop->op_type == OP_PADHV ||
3313 curop->op_type == OP_PADANY) {
3314 SV **svp = AvARRAY(PL_comppad_name);
3315 SV *sv = svp[curop->op_targ];
3316 if (SvCUR(sv) == PL_generation)
3318 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3320 else if (curop->op_type == OP_RV2CV)
3322 else if (curop->op_type == OP_RV2SV ||
3323 curop->op_type == OP_RV2AV ||
3324 curop->op_type == OP_RV2HV ||
3325 curop->op_type == OP_RV2GV) {
3326 if (lastop->op_type != OP_GV) /* funny deref? */
3329 else if (curop->op_type == OP_PUSHRE) {
3330 if (((PMOP*)curop)->op_pmreplroot) {
3331 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3332 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3334 SvCUR(gv) = PL_generation;
3343 o->op_private |= OPpASSIGN_COMMON;
3345 if (right && right->op_type == OP_SPLIT) {
3347 if ((tmpop = ((LISTOP*)right)->op_first) &&
3348 tmpop->op_type == OP_PUSHRE)
3350 PMOP *pm = (PMOP*)tmpop;
3351 if (left->op_type == OP_RV2AV &&
3352 !(left->op_private & OPpLVAL_INTRO) &&
3353 !(o->op_private & OPpASSIGN_COMMON) )
3355 tmpop = ((UNOP*)left)->op_first;
3356 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3358 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3359 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3361 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3362 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3364 pm->op_pmflags |= PMf_ONCE;
3365 tmpop = cUNOPo->op_first; /* to list (nulled) */
3366 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3367 tmpop->op_sibling = Nullop; /* don't free split */
3368 right->op_next = tmpop->op_next; /* fix starting loc */
3369 op_free(o); /* blow off assign */
3370 right->op_flags &= ~OPf_WANT;
3371 /* "I don't know and I don't care." */
3376 if (PL_modcount < 10000 &&
3377 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3379 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3381 sv_setiv(sv, PL_modcount+1);
3389 right = newOP(OP_UNDEF, 0);
3390 if (right->op_type == OP_READLINE) {
3391 right->op_flags |= OPf_STACKED;
3392 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3395 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3396 o = newBINOP(OP_SASSIGN, flags,
3397 scalar(right), mod(scalar(left), OP_SASSIGN) );
3409 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3412 U32 seq = intro_my();
3415 NewOp(1101, cop, 1, COP);
3416 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3417 cop->op_type = OP_DBSTATE;
3418 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3421 cop->op_type = OP_NEXTSTATE;
3422 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3424 cop->op_flags = flags;
3425 cop->op_private = (PL_hints & HINT_BYTE);
3427 cop->op_private |= NATIVE_HINTS;
3429 PL_compiling.op_private = cop->op_private;
3430 cop->op_next = (OP*)cop;
3433 cop->cop_label = label;
3434 PL_hints |= HINT_BLOCK_SCOPE;
3437 cop->cop_arybase = PL_curcop->cop_arybase;
3438 if (specialWARN(PL_curcop->cop_warnings))
3439 cop->cop_warnings = PL_curcop->cop_warnings ;
3441 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3444 if (PL_copline == NOLINE)
3445 CopLINE_set(cop, CopLINE(PL_curcop));
3447 CopLINE_set(cop, PL_copline);
3448 PL_copline = NOLINE;
3451 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXXXX share in a pvtable? */
3453 CopFILEGV_set(cop, (GV*)SvREFCNT_inc(CopFILEGV(PL_curcop)));
3455 CopSTASH_set(cop, PL_curstash);
3457 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3458 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3459 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3460 (void)SvIOK_on(*svp);
3461 SvIVX(*svp) = PTR2IV(cop);
3465 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3468 /* "Introduce" my variables to visible status. */
3476 if (! PL_min_intro_pending)
3477 return PL_cop_seqmax;
3479 svp = AvARRAY(PL_comppad_name);
3480 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3481 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3482 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3483 SvNVX(sv) = (NV)PL_cop_seqmax;
3486 PL_min_intro_pending = 0;
3487 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3488 return PL_cop_seqmax++;
3492 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3494 return new_logop(type, flags, &first, &other);
3498 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3503 OP *first = *firstp;
3504 OP *other = *otherp;
3506 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3507 return newBINOP(type, flags, scalar(first), scalar(other));
3509 scalarboolean(first);
3510 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3511 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3512 if (type == OP_AND || type == OP_OR) {
3518 first = *firstp = cUNOPo->op_first;
3520 first->op_next = o->op_next;
3521 cUNOPo->op_first = Nullop;
3525 if (first->op_type == OP_CONST) {
3526 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3527 Perl_warner(aTHX_ WARN_BAREWORD, "Bareword found in conditional");
3528 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3539 else if (first->op_type == OP_WANTARRAY) {
3545 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3546 OP *k1 = ((UNOP*)first)->op_first;
3547 OP *k2 = k1->op_sibling;
3549 switch (first->op_type)
3552 if (k2 && k2->op_type == OP_READLINE
3553 && (k2->op_flags & OPf_STACKED)
3554 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3556 warnop = k2->op_type;
3561 if (k1->op_type == OP_READDIR
3562 || k1->op_type == OP_GLOB
3563 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3564 || k1->op_type == OP_EACH)
3566 warnop = ((k1->op_type == OP_NULL)
3567 ? k1->op_targ : k1->op_type);
3572 line_t oldline = CopLINE(PL_curcop);
3573 CopLINE_set(PL_curcop, PL_copline);
3574 Perl_warner(aTHX_ WARN_MISC,
3575 "Value of %s%s can be \"0\"; test with defined()",
3577 ((warnop == OP_READLINE || warnop == OP_GLOB)
3578 ? " construct" : "() operator"));
3579 CopLINE_set(PL_curcop, oldline);
3586 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3587 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3589 NewOp(1101, logop, 1, LOGOP);
3591 logop->op_type = type;
3592 logop->op_ppaddr = PL_ppaddr[type];
3593 logop->op_first = first;
3594 logop->op_flags = flags | OPf_KIDS;
3595 logop->op_other = LINKLIST(other);
3596 logop->op_private = 1 | (flags >> 8);
3598 /* establish postfix order */
3599 logop->op_next = LINKLIST(first);
3600 first->op_next = (OP*)logop;
3601 first->op_sibling = other;
3603 o = newUNOP(OP_NULL, 0, (OP*)logop);
3610 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3618 return newLOGOP(OP_AND, 0, first, trueop);
3620 return newLOGOP(OP_OR, 0, first, falseop);
3622 scalarboolean(first);
3623 if (first->op_type == OP_CONST) {
3624 if (SvTRUE(((SVOP*)first)->op_sv)) {
3635 else if (first->op_type == OP_WANTARRAY) {
3639 NewOp(1101, logop, 1, LOGOP);
3640 logop->op_type = OP_COND_EXPR;
3641 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3642 logop->op_first = first;
3643 logop->op_flags = flags | OPf_KIDS;
3644 logop->op_private = 1 | (flags >> 8);
3645 logop->op_other = LINKLIST(trueop);
3646 logop->op_next = LINKLIST(falseop);
3649 /* establish postfix order */
3650 start = LINKLIST(first);
3651 first->op_next = (OP*)logop;
3653 first->op_sibling = trueop;
3654 trueop->op_sibling = falseop;
3655 o = newUNOP(OP_NULL, 0, (OP*)logop);
3657 trueop->op_next = falseop->op_next = o;
3664 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3673 NewOp(1101, range, 1, LOGOP);
3675 range->op_type = OP_RANGE;
3676 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3677 range->op_first = left;
3678 range->op_flags = OPf_KIDS;
3679 leftstart = LINKLIST(left);
3680 range->op_other = LINKLIST(right);
3681 range->op_private = 1 | (flags >> 8);
3683 left->op_sibling = right;
3685 range->op_next = (OP*)range;
3686 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3687 flop = newUNOP(OP_FLOP, 0, flip);
3688 o = newUNOP(OP_NULL, 0, flop);
3690 range->op_next = leftstart;
3692 left->op_next = flip;
3693 right->op_next = flop;
3695 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3696 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3697 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3698 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3700 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3701 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3704 if (!flip->op_private || !flop->op_private)
3705 linklist(o); /* blow off optimizer unless constant */
3711 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3716 int once = block && block->op_flags & OPf_SPECIAL &&
3717 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3720 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3721 return block; /* do {} while 0 does once */
3722 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3723 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3724 expr = newUNOP(OP_DEFINED, 0,
3725 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3726 } else if (expr->op_flags & OPf_KIDS) {
3727 OP *k1 = ((UNOP*)expr)->op_first;
3728 OP *k2 = (k1) ? k1->op_sibling : NULL;
3729 switch (expr->op_type) {
3731 if (k2 && k2->op_type == OP_READLINE
3732 && (k2->op_flags & OPf_STACKED)
3733 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3734 expr = newUNOP(OP_DEFINED, 0, expr);
3738 if (k1->op_type == OP_READDIR
3739 || k1->op_type == OP_GLOB
3740 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3741 || k1->op_type == OP_EACH)
3742 expr = newUNOP(OP_DEFINED, 0, expr);
3748 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3749 o = new_logop(OP_AND, 0, &expr, &listop);
3752 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3754 if (once && o != listop)
3755 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3758 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3760 o->op_flags |= flags;
3762 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3767 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3777 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3778 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3779 expr = newUNOP(OP_DEFINED, 0,
3780 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3781 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3782 OP *k1 = ((UNOP*)expr)->op_first;
3783 OP *k2 = (k1) ? k1->op_sibling : NULL;
3784 switch (expr->op_type) {
3786 if (k2 && k2->op_type == OP_READLINE
3787 && (k2->op_flags & OPf_STACKED)
3788 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3789 expr = newUNOP(OP_DEFINED, 0, expr);
3793 if (k1->op_type == OP_READDIR
3794 || k1->op_type == OP_GLOB
3795 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3796 || k1->op_type == OP_EACH)
3797 expr = newUNOP(OP_DEFINED, 0, expr);
3803 block = newOP(OP_NULL, 0);
3805 block = scope(block);
3809 next = LINKLIST(cont);
3810 loopflags |= OPpLOOP_CONTINUE;
3813 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3814 if ((line_t)whileline != NOLINE) {
3815 PL_copline = whileline;
3816 cont = append_elem(OP_LINESEQ, cont,
3817 newSTATEOP(0, Nullch, Nullop));
3821 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3822 redo = LINKLIST(listop);
3825 PL_copline = whileline;
3827 o = new_logop(OP_AND, 0, &expr, &listop);
3828 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3829 op_free(expr); /* oops, it's a while (0) */
3831 return Nullop; /* listop already freed by new_logop */
3834 ((LISTOP*)listop)->op_last->op_next = condop =
3835 (o == listop ? redo : LINKLIST(o));
3843 NewOp(1101,loop,1,LOOP);
3844 loop->op_type = OP_ENTERLOOP;
3845 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3846 loop->op_private = 0;
3847 loop->op_next = (OP*)loop;
3850 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3852 loop->op_redoop = redo;
3853 loop->op_lastop = o;
3854 o->op_private |= loopflags;
3857 loop->op_nextop = next;
3859 loop->op_nextop = o;
3861 o->op_flags |= flags;
3862 o->op_private |= (flags >> 8);
3867 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3875 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3876 sv->op_type = OP_RV2GV;
3877 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3879 else if (sv->op_type == OP_PADSV) { /* private variable */
3880 padoff = sv->op_targ;
3885 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3886 padoff = sv->op_targ;
3888 iterflags |= OPf_SPECIAL;
3893 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3897 padoff = find_threadsv("_");
3898 iterflags |= OPf_SPECIAL;
3900 sv = newGVOP(OP_GV, 0, PL_defgv);
3903 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3904 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3905 iterflags |= OPf_STACKED;
3907 else if (expr->op_type == OP_NULL &&
3908 (expr->op_flags & OPf_KIDS) &&
3909 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3911 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3912 * set the STACKED flag to indicate that these values are to be
3913 * treated as min/max values by 'pp_iterinit'.
3915 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3916 LOGOP* range = (LOGOP*) flip->op_first;
3917 OP* left = range->op_first;
3918 OP* right = left->op_sibling;
3921 range->op_flags &= ~OPf_KIDS;
3922 range->op_first = Nullop;
3924 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3925 listop->op_first->op_next = range->op_next;
3926 left->op_next = range->op_other;
3927 right->op_next = (OP*)listop;
3928 listop->op_next = listop->op_first;
3931 expr = (OP*)(listop);
3933 iterflags |= OPf_STACKED;
3936 expr = mod(force_list(expr), OP_GREPSTART);
3940 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3941 append_elem(OP_LIST, expr, scalar(sv))));
3942 assert(!loop->op_next);
3943 #ifdef PL_OP_SLAB_ALLOC
3946 NewOp(1234,tmp,1,LOOP);
3947 Copy(loop,tmp,1,LOOP);
3951 Renew(loop, 1, LOOP);
3953 loop->op_targ = padoff;
3954 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3955 PL_copline = forline;
3956 return newSTATEOP(0, label, wop);
3960 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3966 if (type != OP_GOTO || label->op_type == OP_CONST) {
3967 /* "last()" means "last" */
3968 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3969 o = newOP(type, OPf_SPECIAL);
3971 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3972 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3978 if (label->op_type == OP_ENTERSUB)
3979 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3980 o = newUNOP(type, OPf_STACKED, label);
3982 PL_hints |= HINT_BLOCK_SCOPE;
3987 Perl_cv_undef(pTHX_ CV *cv)
3992 MUTEX_DESTROY(CvMUTEXP(cv));
3993 Safefree(CvMUTEXP(cv));
3996 #endif /* USE_THREADS */
3998 if (!CvXSUB(cv) && CvROOT(cv)) {
4000 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4001 Perl_croak(aTHX_ "Can't undef active subroutine");
4004 Perl_croak(aTHX_ "Can't undef active subroutine");
4005 #endif /* USE_THREADS */
4008 SAVEVPTR(PL_curpad);
4012 op_free(CvROOT(cv));
4013 CvROOT(cv) = Nullop;
4016 SvPOK_off((SV*)cv); /* forget prototype */
4018 SvREFCNT_dec(CvGV(cv));
4020 SvREFCNT_dec(CvOUTSIDE(cv));
4021 CvOUTSIDE(cv) = Nullcv;
4022 if (CvPADLIST(cv)) {
4023 /* may be during global destruction */
4024 if (SvREFCNT(CvPADLIST(cv))) {
4025 I32 i = AvFILLp(CvPADLIST(cv));
4027 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4028 SV* sv = svp ? *svp : Nullsv;
4031 if (sv == (SV*)PL_comppad_name)
4032 PL_comppad_name = Nullav;
4033 else if (sv == (SV*)PL_comppad) {
4034 PL_comppad = Nullav;
4035 PL_curpad = Null(SV**);
4039 SvREFCNT_dec((SV*)CvPADLIST(cv));
4041 CvPADLIST(cv) = Nullav;
4046 S_cv_dump(pTHX_ CV *cv)
4049 CV *outside = CvOUTSIDE(cv);
4050 AV* padlist = CvPADLIST(cv);
4057 PerlIO_printf(Perl_debug_log,
4058 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4060 (CvANON(cv) ? "ANON"
4061 : (cv == PL_main_cv) ? "MAIN"
4062 : CvUNIQUE(cv) ? "UNIQUE"
4063 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4066 : CvANON(outside) ? "ANON"
4067 : (outside == PL_main_cv) ? "MAIN"
4068 : CvUNIQUE(outside) ? "UNIQUE"
4069 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4074 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4075 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4076 pname = AvARRAY(pad_name);
4077 ppad = AvARRAY(pad);
4079 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4080 if (SvPOK(pname[ix]))
4081 PerlIO_printf(Perl_debug_log,
4082 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4083 (int)ix, PTR2UV(ppad[ix]),
4084 SvFAKE(pname[ix]) ? "FAKE " : "",
4086 (IV)I_32(SvNVX(pname[ix])),
4089 #endif /* DEBUGGING */
4093 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4098 AV* protopadlist = CvPADLIST(proto);
4099 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4100 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4101 SV** pname = AvARRAY(protopad_name);
4102 SV** ppad = AvARRAY(protopad);
4103 I32 fname = AvFILLp(protopad_name);
4104 I32 fpad = AvFILLp(protopad);
4108 assert(!CvUNIQUE(proto));
4112 SAVESPTR(PL_comppad_name);
4113 SAVESPTR(PL_compcv);
4115 cv = PL_compcv = (CV*)NEWSV(1104,0);
4116 sv_upgrade((SV *)cv, SvTYPE(proto));
4122 New(666, CvMUTEXP(cv), 1, perl_mutex);
4123 MUTEX_INIT(CvMUTEXP(cv));
4125 #endif /* USE_THREADS */
4126 CvFILE(cv) = CvFILE(proto);
4127 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4128 CvSTASH(cv) = CvSTASH(proto);
4129 CvROOT(cv) = CvROOT(proto);
4130 CvSTART(cv) = CvSTART(proto);
4132 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4135 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4137 PL_comppad_name = newAV();
4138 for (ix = fname; ix >= 0; ix--)
4139 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4141 PL_comppad = newAV();
4143 comppadlist = newAV();
4144 AvREAL_off(comppadlist);
4145 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4146 av_store(comppadlist, 1, (SV*)PL_comppad);
4147 CvPADLIST(cv) = comppadlist;
4148 av_fill(PL_comppad, AvFILLp(protopad));
4149 PL_curpad = AvARRAY(PL_comppad);
4151 av = newAV(); /* will be @_ */
4153 av_store(PL_comppad, 0, (SV*)av);
4154 AvFLAGS(av) = AVf_REIFY;
4156 for (ix = fpad; ix > 0; ix--) {
4157 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4158 if (namesv && namesv != &PL_sv_undef) {
4159 char *name = SvPVX(namesv); /* XXX */
4160 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4161 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4162 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4164 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4166 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4168 else { /* our own lexical */
4171 /* anon code -- we'll come back for it */
4172 sv = SvREFCNT_inc(ppad[ix]);
4174 else if (*name == '@')
4176 else if (*name == '%')
4185 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4186 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4189 SV* sv = NEWSV(0,0);
4195 /* Now that vars are all in place, clone nested closures. */
4197 for (ix = fpad; ix > 0; ix--) {
4198 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4200 && namesv != &PL_sv_undef
4201 && !(SvFLAGS(namesv) & SVf_FAKE)
4202 && *SvPVX(namesv) == '&'
4203 && CvCLONE(ppad[ix]))
4205 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4206 SvREFCNT_dec(ppad[ix]);
4209 PL_curpad[ix] = (SV*)kid;
4213 #ifdef DEBUG_CLOSURES
4214 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4216 PerlIO_printf(Perl_debug_log, " from:\n");
4218 PerlIO_printf(Perl_debug_log, " to:\n");
4227 Perl_cv_clone(pTHX_ CV *proto)
4230 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4231 cv = cv_clone2(proto, CvOUTSIDE(proto));
4232 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4237 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4241 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4242 SV* msg = sv_newmortal();
4246 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4247 sv_setpv(msg, "Prototype mismatch:");
4249 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4251 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4252 sv_catpv(msg, " vs ");
4254 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4256 sv_catpv(msg, "none");
4257 Perl_warner(aTHX_ WARN_PROTOTYPE, "%"SVf, msg);
4262 Perl_cv_const_sv(pTHX_ CV *cv)
4264 if (!cv || !SvPOK(cv) || SvCUR(cv))
4266 return op_const_sv(CvSTART(cv), cv);
4270 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4277 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4278 o = cLISTOPo->op_first->op_sibling;
4280 for (; o; o = o->op_next) {
4281 OPCODE type = o->op_type;
4283 if (sv && o->op_next == o)
4285 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4287 if (type == OP_LEAVESUB || type == OP_RETURN)
4291 if (type == OP_CONST && cSVOPo->op_sv)
4293 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4294 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4295 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4296 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4308 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4318 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4322 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4324 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4328 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4335 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4339 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4340 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4341 SV *sv = sv_newmortal();
4342 Perl_sv_setpvf(aTHX_ sv, "__ANON__[%s:%"IVdf"]",
4343 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4348 gv = gv_fetchpv(name ? name : (aname ? aname : "__ANON__"),
4349 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4359 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4360 maximum a prototype before. */
4361 if (SvTYPE(gv) > SVt_NULL) {
4362 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4363 && ckWARN_d(WARN_PROTOTYPE))
4365 Perl_warner(aTHX_ WARN_PROTOTYPE, "Runaway prototype");
4367 cv_ckproto((CV*)gv, NULL, ps);
4370 sv_setpv((SV*)gv, ps);
4372 sv_setiv((SV*)gv, -1);
4373 SvREFCNT_dec(PL_compcv);
4374 cv = PL_compcv = NULL;
4375 PL_sub_generation++;
4379 if (!name || GvCVGEN(gv))
4381 else if ((cv = GvCV(gv))) {
4382 cv_ckproto(cv, gv, ps);
4383 /* already defined (or promised)? */
4384 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4386 bool const_changed = TRUE;
4387 if (!block && !attrs) {
4388 /* just a "sub foo;" when &foo is already defined */
4389 SAVEFREESV(PL_compcv);
4392 /* ahem, death to those who redefine active sort subs */
4393 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4394 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4397 if ((const_sv = cv_const_sv(cv)))
4398 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4399 if ((const_sv || const_changed) && ckWARN(WARN_REDEFINE))
4401 line_t oldline = CopLINE(PL_curcop);
4402 CopLINE_set(PL_curcop, PL_copline);
4403 Perl_warner(aTHX_ WARN_REDEFINE,
4404 const_sv ? "Constant subroutine %s redefined"
4405 : "Subroutine %s redefined", name);
4406 CopLINE_set(PL_curcop, oldline);
4417 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4418 * before we clobber PL_compcv.
4422 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4423 stash = GvSTASH(CvGV(cv));
4424 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4425 stash = CvSTASH(cv);
4427 stash = PL_curstash;
4430 /* possibly about to re-define existing subr -- ignore old cv */
4431 rcv = (SV*)PL_compcv;
4432 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4433 stash = GvSTASH(gv);
4435 stash = PL_curstash;
4437 apply_attrs(stash, rcv, attrs);
4439 if (cv) { /* must reuse cv if autoloaded */
4441 /* got here with just attrs -- work done, so bug out */
4442 SAVEFREESV(PL_compcv);
4446 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4447 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4448 CvOUTSIDE(PL_compcv) = 0;
4449 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4450 CvPADLIST(PL_compcv) = 0;
4451 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4452 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4453 SvREFCNT_dec(PL_compcv);
4460 PL_sub_generation++;
4463 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4464 CvFILE(cv) = CopFILE(PL_curcop);
4465 CvSTASH(cv) = PL_curstash;
4468 if (!CvMUTEXP(cv)) {
4469 New(666, CvMUTEXP(cv), 1, perl_mutex);
4470 MUTEX_INIT(CvMUTEXP(cv));
4472 #endif /* USE_THREADS */
4475 sv_setpv((SV*)cv, ps);
4477 if (PL_error_count) {
4481 char *s = strrchr(name, ':');
4483 if (strEQ(s, "BEGIN")) {
4485 "BEGIN not safe after errors--compilation aborted";
4486 if (PL_in_eval & EVAL_KEEPERR)
4487 Perl_croak(aTHX_ not_safe);
4489 /* force display of errors found but not reported */
4490 sv_catpv(ERRSV, not_safe);
4491 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4498 PL_copline = NOLINE;
4503 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4504 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4507 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4510 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4512 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4513 OpREFCNT_set(CvROOT(cv), 1);
4514 CvSTART(cv) = LINKLIST(CvROOT(cv));
4515 CvROOT(cv)->op_next = 0;
4518 /* now that optimizer has done its work, adjust pad values */
4520 SV **namep = AvARRAY(PL_comppad_name);
4521 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4524 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4527 * The only things that a clonable function needs in its
4528 * pad are references to outer lexicals and anonymous subs.
4529 * The rest are created anew during cloning.
4531 if (!((namesv = namep[ix]) != Nullsv &&
4532 namesv != &PL_sv_undef &&
4534 *SvPVX(namesv) == '&')))
4536 SvREFCNT_dec(PL_curpad[ix]);
4537 PL_curpad[ix] = Nullsv;
4542 AV *av = newAV(); /* Will be @_ */
4544 av_store(PL_comppad, 0, (SV*)av);
4545 AvFLAGS(av) = AVf_REIFY;
4547 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4548 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4550 if (!SvPADMY(PL_curpad[ix]))
4551 SvPADTMP_on(PL_curpad[ix]);
4555 if (name || aname) {
4557 char *tname = (name ? name : aname);
4559 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4560 SV *sv = NEWSV(0,0);
4561 SV *tmpstr = sv_newmortal();
4562 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4566 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4568 (long)PL_subline, (long)CopLINE(PL_curcop));
4569 gv_efullname3(tmpstr, gv, Nullch);
4570 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4571 hv = GvHVn(db_postponed);
4572 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4573 && (pcv = GvCV(db_postponed)))
4579 call_sv((SV*)pcv, G_DISCARD);
4583 if ((s = strrchr(tname,':')))
4588 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4591 if (strEQ(s, "BEGIN")) {
4592 I32 oldscope = PL_scopestack_ix;
4594 SAVECOPFILE(&PL_compiling);
4595 SAVECOPLINE(&PL_compiling);
4597 sv_setsv(PL_rs, PL_nrs);
4600 PL_beginav = newAV();
4601 DEBUG_x( dump_sub(gv) );
4602 av_push(PL_beginav, SvREFCNT_inc(cv));
4604 call_list(oldscope, PL_beginav);
4606 PL_curcop = &PL_compiling;
4607 PL_compiling.op_private = PL_hints;
4610 else if (strEQ(s, "END") && !PL_error_count) {
4613 DEBUG_x( dump_sub(gv) );
4614 av_unshift(PL_endav, 1);
4615 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4618 else if (strEQ(s, "CHECK") && !PL_error_count) {
4620 PL_checkav = newAV();
4621 DEBUG_x( dump_sub(gv) );
4622 av_unshift(PL_checkav, 1);
4623 av_store(PL_checkav, 0, SvREFCNT_inc(cv));
4626 else if (strEQ(s, "INIT") && !PL_error_count) {
4628 PL_initav = newAV();
4629 DEBUG_x( dump_sub(gv) );
4630 av_push(PL_initav, SvREFCNT_inc(cv));
4636 PL_copline = NOLINE;
4641 /* XXX unsafe for threads if eval_owner isn't held */
4643 =for apidoc newCONSTSUB
4645 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4646 eligible for inlining at compile-time.
4652 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4657 SAVECOPLINE(PL_curcop);
4660 CopLINE_set(PL_curcop, PL_copline);
4661 PL_hints &= ~HINT_BLOCK_SCOPE;
4664 SAVESPTR(PL_curstash);
4665 SAVECOPSTASH(PL_curcop);
4666 PL_curstash = stash;
4668 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4670 CopSTASH(PL_curcop) = stash;
4675 start_subparse(FALSE, 0),
4676 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4677 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4679 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4686 =for apidoc U||newXS
4688 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4694 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4697 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4700 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4702 /* just a cached method */
4706 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4707 /* already defined (or promised) */
4708 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4709 && HvNAME(GvSTASH(CvGV(cv)))
4710 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4711 line_t oldline = CopLINE(PL_curcop);
4712 if (PL_copline != NOLINE)
4713 CopLINE_set(PL_curcop, PL_copline);
4714 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4715 CopLINE_set(PL_curcop, oldline);
4722 if (cv) /* must reuse cv if autoloaded */
4725 cv = (CV*)NEWSV(1105,0);
4726 sv_upgrade((SV *)cv, SVt_PVCV);
4730 PL_sub_generation++;
4733 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4735 New(666, CvMUTEXP(cv), 1, perl_mutex);
4736 MUTEX_INIT(CvMUTEXP(cv));
4738 #endif /* USE_THREADS */
4739 (void)gv_fetchfile(filename);
4740 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4741 an external constant string */
4742 CvXSUB(cv) = subaddr;
4745 char *s = strrchr(name,':');
4751 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4754 if (strEQ(s, "BEGIN")) {
4756 PL_beginav = newAV();
4757 av_push(PL_beginav, SvREFCNT_inc(cv));
4760 else if (strEQ(s, "END")) {
4763 av_unshift(PL_endav, 1);
4764 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4767 else if (strEQ(s, "CHECK")) {
4769 PL_checkav = newAV();
4770 av_unshift(PL_checkav, 1);
4771 av_store(PL_checkav, 0, SvREFCNT_inc(cv));
4774 else if (strEQ(s, "INIT")) {
4776 PL_initav = newAV();
4777 av_push(PL_initav, SvREFCNT_inc(cv));
4789 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4799 name = SvPVx(cSVOPo->op_sv, n_a);
4802 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4804 if ((cv = GvFORM(gv))) {
4805 if (ckWARN(WARN_REDEFINE)) {
4806 line_t oldline = CopLINE(PL_curcop);
4808 CopLINE_set(PL_curcop, PL_copline);
4809 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4810 CopLINE_set(PL_curcop, oldline);
4816 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4817 CvFILE(cv) = CopFILE(PL_curcop);
4819 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4820 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4821 SvPADTMP_on(PL_curpad[ix]);
4824 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4825 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4826 OpREFCNT_set(CvROOT(cv), 1);
4827 CvSTART(cv) = LINKLIST(CvROOT(cv));
4828 CvROOT(cv)->op_next = 0;
4831 PL_copline = NOLINE;
4836 Perl_newANONLIST(pTHX_ OP *o)
4838 return newUNOP(OP_REFGEN, 0,
4839 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4843 Perl_newANONHASH(pTHX_ OP *o)
4845 return newUNOP(OP_REFGEN, 0,
4846 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4850 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4852 return newANONATTRSUB(floor, proto, Nullop, block);
4856 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4858 return newUNOP(OP_REFGEN, 0,
4859 newSVOP(OP_ANONCODE, 0,
4860 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4864 Perl_oopsAV(pTHX_ OP *o)
4866 switch (o->op_type) {
4868 o->op_type = OP_PADAV;
4869 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4870 return ref(o, OP_RV2AV);
4873 o->op_type = OP_RV2AV;
4874 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4879 if (ckWARN_d(WARN_INTERNAL))
4880 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4887 Perl_oopsHV(pTHX_ OP *o)
4891 switch (o->op_type) {
4894 o->op_type = OP_PADHV;
4895 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4896 return ref(o, OP_RV2HV);
4900 o->op_type = OP_RV2HV;
4901 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4906 if (ckWARN_d(WARN_INTERNAL))
4907 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
4914 Perl_newAVREF(pTHX_ OP *o)
4916 if (o->op_type == OP_PADANY) {
4917 o->op_type = OP_PADAV;
4918 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4921 return newUNOP(OP_RV2AV, 0, scalar(o));
4925 Perl_newGVREF(pTHX_ I32 type, OP *o)
4927 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4928 return newUNOP(OP_NULL, 0, o);
4929 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4933 Perl_newHVREF(pTHX_ OP *o)
4935 if (o->op_type == OP_PADANY) {
4936 o->op_type = OP_PADHV;
4937 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4940 return newUNOP(OP_RV2HV, 0, scalar(o));
4944 Perl_oopsCV(pTHX_ OP *o)
4946 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4952 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4954 return newUNOP(OP_RV2CV, flags, scalar(o));
4958 Perl_newSVREF(pTHX_ OP *o)
4960 if (o->op_type == OP_PADANY) {
4961 o->op_type = OP_PADSV;
4962 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4965 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4966 o->op_flags |= OPpDONE_SVREF;
4969 return newUNOP(OP_RV2SV, 0, scalar(o));
4972 /* Check routines. */
4975 Perl_ck_anoncode(pTHX_ OP *o)
4980 name = NEWSV(1106,0);
4981 sv_upgrade(name, SVt_PVNV);
4982 sv_setpvn(name, "&", 1);
4985 ix = pad_alloc(o->op_type, SVs_PADMY);
4986 av_store(PL_comppad_name, ix, name);
4987 av_store(PL_comppad, ix, cSVOPo->op_sv);
4988 SvPADMY_on(cSVOPo->op_sv);
4989 cSVOPo->op_sv = Nullsv;
4990 cSVOPo->op_targ = ix;
4995 Perl_ck_bitop(pTHX_ OP *o)
4997 o->op_private = PL_hints;
5002 Perl_ck_concat(pTHX_ OP *o)
5004 if (cUNOPo->op_first->op_type == OP_CONCAT)
5005 o->op_flags |= OPf_STACKED;
5010 Perl_ck_spair(pTHX_ OP *o)
5012 if (o->op_flags & OPf_KIDS) {
5015 OPCODE type = o->op_type;
5016 o = modkids(ck_fun(o), type);
5017 kid = cUNOPo->op_first;
5018 newop = kUNOP->op_first->op_sibling;
5020 (newop->op_sibling ||
5021 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5022 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5023 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5027 op_free(kUNOP->op_first);
5028 kUNOP->op_first = newop;
5030 o->op_ppaddr = PL_ppaddr[++o->op_type];
5035 Perl_ck_delete(pTHX_ OP *o)
5039 if (o->op_flags & OPf_KIDS) {
5040 OP *kid = cUNOPo->op_first;
5041 switch (kid->op_type) {
5043 o->op_flags |= OPf_SPECIAL;
5046 o->op_private |= OPpSLICE;
5049 o->op_flags |= OPf_SPECIAL;
5054 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5055 PL_op_desc[o->op_type]);
5063 Perl_ck_eof(pTHX_ OP *o)
5065 I32 type = o->op_type;
5067 if (o->op_flags & OPf_KIDS) {
5068 if (cLISTOPo->op_first->op_type == OP_STUB) {
5070 o = newUNOP(type, OPf_SPECIAL,
5071 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5079 Perl_ck_eval(pTHX_ OP *o)
5081 PL_hints |= HINT_BLOCK_SCOPE;
5082 if (o->op_flags & OPf_KIDS) {
5083 SVOP *kid = (SVOP*)cUNOPo->op_first;
5086 o->op_flags &= ~OPf_KIDS;
5089 else if (kid->op_type == OP_LINESEQ) {
5092 kid->op_next = o->op_next;
5093 cUNOPo->op_first = 0;
5096 NewOp(1101, enter, 1, LOGOP);
5097 enter->op_type = OP_ENTERTRY;
5098 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5099 enter->op_private = 0;
5101 /* establish postfix order */
5102 enter->op_next = (OP*)enter;
5104 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5105 o->op_type = OP_LEAVETRY;
5106 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5107 enter->op_other = o;
5115 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5117 o->op_targ = (PADOFFSET)PL_hints;
5122 Perl_ck_exec(pTHX_ OP *o)
5125 if (o->op_flags & OPf_STACKED) {
5127 kid = cUNOPo->op_first->op_sibling;
5128 if (kid->op_type == OP_RV2GV)
5137 Perl_ck_exists(pTHX_ OP *o)
5140 if (o->op_flags & OPf_KIDS) {
5141 OP *kid = cUNOPo->op_first;
5142 if (kid->op_type == OP_ENTERSUB) {
5143 (void) ref(kid, o->op_type);
5144 if (kid->op_type != OP_RV2CV && !PL_error_count)
5145 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5146 PL_op_desc[o->op_type]);
5147 o->op_private |= OPpEXISTS_SUB;
5149 else if (kid->op_type == OP_AELEM)
5150 o->op_flags |= OPf_SPECIAL;
5151 else if (kid->op_type != OP_HELEM)
5152 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5153 PL_op_desc[o->op_type]);
5161 Perl_ck_gvconst(pTHX_ register OP *o)
5163 o = fold_constants(o);
5164 if (o->op_type == OP_CONST)
5171 Perl_ck_rvconst(pTHX_ register OP *o)
5174 SVOP *kid = (SVOP*)cUNOPo->op_first;
5176 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5177 if (kid->op_type == OP_CONST) {
5181 SV *kidsv = kid->op_sv;
5184 /* Is it a constant from cv_const_sv()? */
5185 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5186 SV *rsv = SvRV(kidsv);
5187 int svtype = SvTYPE(rsv);
5188 char *badtype = Nullch;
5190 switch (o->op_type) {
5192 if (svtype > SVt_PVMG)
5193 badtype = "a SCALAR";
5196 if (svtype != SVt_PVAV)
5197 badtype = "an ARRAY";
5200 if (svtype != SVt_PVHV) {
5201 if (svtype == SVt_PVAV) { /* pseudohash? */
5202 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5203 if (ksv && SvROK(*ksv)
5204 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5213 if (svtype != SVt_PVCV)
5218 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5221 name = SvPV(kidsv, n_a);
5222 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5223 char *badthing = Nullch;
5224 switch (o->op_type) {
5226 badthing = "a SCALAR";
5229 badthing = "an ARRAY";
5232 badthing = "a HASH";
5237 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5241 * This is a little tricky. We only want to add the symbol if we
5242 * didn't add it in the lexer. Otherwise we get duplicate strict
5243 * warnings. But if we didn't add it in the lexer, we must at
5244 * least pretend like we wanted to add it even if it existed before,
5245 * or we get possible typo warnings. OPpCONST_ENTERED says
5246 * whether the lexer already added THIS instance of this symbol.
5248 iscv = (o->op_type == OP_RV2CV) * 2;
5250 gv = gv_fetchpv(name,
5251 iscv | !(kid->op_private & OPpCONST_ENTERED),
5254 : o->op_type == OP_RV2SV
5256 : o->op_type == OP_RV2AV
5258 : o->op_type == OP_RV2HV
5261 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5263 kid->op_type = OP_GV;
5264 SvREFCNT_dec(kid->op_sv);
5266 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5267 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5269 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5271 kid->op_sv = SvREFCNT_inc(gv);
5273 kid->op_ppaddr = PL_ppaddr[OP_GV];
5280 Perl_ck_ftst(pTHX_ OP *o)
5283 I32 type = o->op_type;
5285 if (o->op_flags & OPf_REF) {
5288 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5289 SVOP *kid = (SVOP*)cUNOPo->op_first;
5291 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5293 OP *newop = newGVOP(type, OPf_REF,
5294 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5301 if (type == OP_FTTTY)
5302 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5305 o = newUNOP(type, 0, newDEFSVOP());
5308 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5310 if (PL_hints & HINT_LOCALE)
5311 o->op_private |= OPpLOCALE;
5318 Perl_ck_fun(pTHX_ OP *o)
5325 int type = o->op_type;
5326 register I32 oa = PL_opargs[type] >> OASHIFT;
5328 if (o->op_flags & OPf_STACKED) {
5329 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5332 return no_fh_allowed(o);
5335 if (o->op_flags & OPf_KIDS) {
5337 tokid = &cLISTOPo->op_first;
5338 kid = cLISTOPo->op_first;
5339 if (kid->op_type == OP_PUSHMARK ||
5340 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5342 tokid = &kid->op_sibling;
5343 kid = kid->op_sibling;
5345 if (!kid && PL_opargs[type] & OA_DEFGV)
5346 *tokid = kid = newDEFSVOP();
5350 sibl = kid->op_sibling;
5353 /* list seen where single (scalar) arg expected? */
5354 if (numargs == 1 && !(oa >> 4)
5355 && kid->op_type == OP_LIST && type != OP_SCALAR)
5357 return too_many_arguments(o,PL_op_desc[type]);
5370 if (kid->op_type == OP_CONST &&
5371 (kid->op_private & OPpCONST_BARE))
5373 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5374 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5375 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5376 if (ckWARN(WARN_DEPRECATED))
5377 Perl_warner(aTHX_ WARN_DEPRECATED,
5378 "Array @%s missing the @ in argument %"IVdf" of %s()",
5379 name, (IV)numargs, PL_op_desc[type]);
5382 kid->op_sibling = sibl;
5385 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5386 bad_type(numargs, "array", PL_op_desc[type], kid);
5390 if (kid->op_type == OP_CONST &&
5391 (kid->op_private & OPpCONST_BARE))
5393 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5394 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5395 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5396 if (ckWARN(WARN_DEPRECATED))
5397 Perl_warner(aTHX_ WARN_DEPRECATED,
5398 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5399 name, (IV)numargs, PL_op_desc[type]);
5402 kid->op_sibling = sibl;
5405 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5406 bad_type(numargs, "hash", PL_op_desc[type], kid);
5411 OP *newop = newUNOP(OP_NULL, 0, kid);
5412 kid->op_sibling = 0;
5414 newop->op_next = newop;
5416 kid->op_sibling = sibl;
5421 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5422 if (kid->op_type == OP_CONST &&
5423 (kid->op_private & OPpCONST_BARE))
5425 OP *newop = newGVOP(OP_GV, 0,
5426 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5431 else if (kid->op_type == OP_READLINE) {
5432 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5433 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5436 I32 flags = OPf_SPECIAL;
5440 /* is this op a FH constructor? */
5441 if (is_handle_constructor(o,numargs)) {
5442 char *name = Nullch;
5446 /* Set a flag to tell rv2gv to vivify
5447 * need to "prove" flag does not mean something
5448 * else already - NI-S 1999/05/07
5451 if (kid->op_type == OP_PADSV) {
5452 SV **namep = av_fetch(PL_comppad_name,
5454 if (namep && *namep)
5455 name = SvPV(*namep, len);
5457 else if (kid->op_type == OP_RV2SV
5458 && kUNOP->op_first->op_type == OP_GV)
5460 GV *gv = cGVOPx_gv(kUNOP->op_first);
5462 len = GvNAMELEN(gv);
5466 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5467 namesv = PL_curpad[targ];
5468 (void)SvUPGRADE(namesv, SVt_PV);
5470 sv_setpvn(namesv, "$", 1);
5471 sv_catpvn(namesv, name, len);
5474 kid->op_sibling = 0;
5475 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5476 kid->op_targ = targ;
5477 kid->op_private |= priv;
5479 kid->op_sibling = sibl;
5485 mod(scalar(kid), type);
5489 tokid = &kid->op_sibling;
5490 kid = kid->op_sibling;
5492 o->op_private |= numargs;
5494 return too_many_arguments(o,PL_op_desc[o->op_type]);
5497 else if (PL_opargs[type] & OA_DEFGV) {
5499 return newUNOP(type, 0, newDEFSVOP());
5503 while (oa & OA_OPTIONAL)
5505 if (oa && oa != OA_LIST)
5506 return too_few_arguments(o,PL_op_desc[o->op_type]);
5512 Perl_ck_glob(pTHX_ OP *o)
5517 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5518 append_elem(OP_GLOB, o, newDEFSVOP());
5520 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5521 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5523 #if !defined(PERL_EXTERNAL_GLOB)
5524 /* XXX this can be tightened up and made more failsafe. */
5526 OP *modname = newSVOP(OP_CONST, 0, newSVpvn("File::Glob", 10));
5527 modname->op_private |= OPpCONST_BARE;
5529 utilize(1, start_subparse(FALSE, 0), Nullop, modname,
5530 newSVOP(OP_CONST, 0, newSVpvn(":globally", 9)));
5531 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5534 #endif /* PERL_EXTERNAL_GLOB */
5536 if (gv && GvIMPORTED_CV(gv)) {
5537 append_elem(OP_GLOB, o,
5538 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5539 o->op_type = OP_LIST;
5540 o->op_ppaddr = PL_ppaddr[OP_LIST];
5541 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5542 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5543 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5544 append_elem(OP_LIST, o,
5545 scalar(newUNOP(OP_RV2CV, 0,
5546 newGVOP(OP_GV, 0, gv)))));
5547 o = newUNOP(OP_NULL, 0, ck_subr(o));
5548 o->op_targ = OP_GLOB; /* hint at what it used to be */
5551 gv = newGVgen("main");
5553 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5559 Perl_ck_grep(pTHX_ OP *o)
5563 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5565 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5566 NewOp(1101, gwop, 1, LOGOP);
5568 if (o->op_flags & OPf_STACKED) {
5571 kid = cLISTOPo->op_first->op_sibling;
5572 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5575 kid->op_next = (OP*)gwop;
5576 o->op_flags &= ~OPf_STACKED;
5578 kid = cLISTOPo->op_first->op_sibling;
5579 if (type == OP_MAPWHILE)
5586 kid = cLISTOPo->op_first->op_sibling;
5587 if (kid->op_type != OP_NULL)
5588 Perl_croak(aTHX_ "panic: ck_grep");
5589 kid = kUNOP->op_first;
5591 gwop->op_type = type;
5592 gwop->op_ppaddr = PL_ppaddr[type];
5593 gwop->op_first = listkids(o);
5594 gwop->op_flags |= OPf_KIDS;
5595 gwop->op_private = 1;
5596 gwop->op_other = LINKLIST(kid);
5597 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5598 kid->op_next = (OP*)gwop;
5600 kid = cLISTOPo->op_first->op_sibling;
5601 if (!kid || !kid->op_sibling)
5602 return too_few_arguments(o,PL_op_desc[o->op_type]);
5603 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5604 mod(kid, OP_GREPSTART);
5610 Perl_ck_index(pTHX_ OP *o)
5612 if (o->op_flags & OPf_KIDS) {
5613 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5615 kid = kid->op_sibling; /* get past "big" */
5616 if (kid && kid->op_type == OP_CONST)
5617 fbm_compile(((SVOP*)kid)->op_sv, 0);
5623 Perl_ck_lengthconst(pTHX_ OP *o)
5625 /* XXX length optimization goes here */
5630 Perl_ck_lfun(pTHX_ OP *o)
5632 OPCODE type = o->op_type;
5633 return modkids(ck_fun(o), type);
5637 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5640 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5641 switch (cUNOPo->op_first->op_type) {
5643 break; /* Globals via GV can be undef */
5645 case OP_AASSIGN: /* Is this a good idea? */
5646 Perl_warner(aTHX_ WARN_DEPRECATED,
5647 "defined(@array) is deprecated");
5648 Perl_warner(aTHX_ WARN_DEPRECATED,
5649 "(Maybe you should just omit the defined()?)\n");
5652 break; /* Globals via GV can be undef */
5654 Perl_warner(aTHX_ WARN_DEPRECATED,
5655 "defined(%%hash) is deprecated");
5656 Perl_warner(aTHX_ WARN_DEPRECATED,
5657 "(Maybe you should just omit the defined()?)\n");
5668 Perl_ck_rfun(pTHX_ OP *o)
5670 OPCODE type = o->op_type;
5671 return refkids(ck_fun(o), type);
5675 Perl_ck_listiob(pTHX_ OP *o)
5679 kid = cLISTOPo->op_first;
5682 kid = cLISTOPo->op_first;
5684 if (kid->op_type == OP_PUSHMARK)
5685 kid = kid->op_sibling;
5686 if (kid && o->op_flags & OPf_STACKED)
5687 kid = kid->op_sibling;
5688 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5689 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5690 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5691 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5692 cLISTOPo->op_first->op_sibling = kid;
5693 cLISTOPo->op_last = kid;
5694 kid = kid->op_sibling;
5699 append_elem(o->op_type, o, newDEFSVOP());
5705 if (PL_hints & HINT_LOCALE)
5706 o->op_private |= OPpLOCALE;
5713 Perl_ck_fun_locale(pTHX_ OP *o)
5719 if (PL_hints & HINT_LOCALE)
5720 o->op_private |= OPpLOCALE;
5727 Perl_ck_sassign(pTHX_ OP *o)
5729 OP *kid = cLISTOPo->op_first;
5730 /* has a disposable target? */
5731 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5732 && !(kid->op_flags & OPf_STACKED)
5733 /* Cannot steal the second time! */
5734 && !(kid->op_private & OPpTARGET_MY))
5736 OP *kkid = kid->op_sibling;
5738 /* Can just relocate the target. */
5739 if (kkid && kkid->op_type == OP_PADSV
5740 && !(kkid->op_private & OPpLVAL_INTRO))
5742 kid->op_targ = kkid->op_targ;
5744 /* Now we do not need PADSV and SASSIGN. */
5745 kid->op_sibling = o->op_sibling; /* NULL */
5746 cLISTOPo->op_first = NULL;
5749 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5757 Perl_ck_scmp(pTHX_ OP *o)
5761 if (PL_hints & HINT_LOCALE)
5762 o->op_private |= OPpLOCALE;
5769 Perl_ck_match(pTHX_ OP *o)
5771 o->op_private |= OPpRUNTIME;
5776 Perl_ck_method(pTHX_ OP *o)
5778 OP *kid = cUNOPo->op_first;
5779 if (kid->op_type == OP_CONST) {
5780 SV* sv = kSVOP->op_sv;
5781 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5783 (void)SvUPGRADE(sv, SVt_PVIV);
5785 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5786 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5787 kSVOP->op_sv = Nullsv;
5796 Perl_ck_null(pTHX_ OP *o)
5802 Perl_ck_repeat(pTHX_ OP *o)
5804 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5805 o->op_private |= OPpREPEAT_DOLIST;
5806 cBINOPo->op_first = force_list(cBINOPo->op_first);
5814 Perl_ck_require(pTHX_ OP *o)
5816 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5817 SVOP *kid = (SVOP*)cUNOPo->op_first;
5819 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5821 for (s = SvPVX(kid->op_sv); *s; s++) {
5822 if (*s == ':' && s[1] == ':') {
5824 Move(s+2, s+1, strlen(s+2)+1, char);
5825 --SvCUR(kid->op_sv);
5828 sv_catpvn(kid->op_sv, ".pm", 3);
5836 Perl_ck_retarget(pTHX_ OP *o)
5838 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5845 Perl_ck_select(pTHX_ OP *o)
5848 if (o->op_flags & OPf_KIDS) {
5849 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5850 if (kid && kid->op_sibling) {
5851 o->op_type = OP_SSELECT;
5852 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5854 return fold_constants(o);
5858 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5859 if (kid && kid->op_type == OP_RV2GV)
5860 kid->op_private &= ~HINT_STRICT_REFS;
5865 Perl_ck_shift(pTHX_ OP *o)
5867 I32 type = o->op_type;
5869 if (!(o->op_flags & OPf_KIDS)) {
5874 if (!CvUNIQUE(PL_compcv)) {
5875 argop = newOP(OP_PADAV, OPf_REF);
5876 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5879 argop = newUNOP(OP_RV2AV, 0,
5880 scalar(newGVOP(OP_GV, 0,
5881 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5884 argop = newUNOP(OP_RV2AV, 0,
5885 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5886 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5887 #endif /* USE_THREADS */
5888 return newUNOP(type, 0, scalar(argop));
5890 return scalar(modkids(ck_fun(o), type));
5894 Perl_ck_sort(pTHX_ OP *o)
5898 if (PL_hints & HINT_LOCALE)
5899 o->op_private |= OPpLOCALE;
5902 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5904 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5905 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5907 kid = kUNOP->op_first; /* get past null */
5909 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5911 if (kid->op_type == OP_SCOPE) {
5915 else if (kid->op_type == OP_LEAVE) {
5916 if (o->op_type == OP_SORT) {
5917 null(kid); /* wipe out leave */
5920 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5921 if (k->op_next == kid)
5926 kid->op_next = 0; /* just disconnect the leave */
5927 k = kLISTOP->op_first;
5931 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5932 if (o->op_type == OP_SORT)
5936 o->op_flags |= OPf_SPECIAL;
5938 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5939 null(cLISTOPo->op_first->op_sibling);
5946 S_simplify_sort(pTHX_ OP *o)
5949 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5953 if (!(o->op_flags & OPf_STACKED))
5955 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5956 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5957 kid = kUNOP->op_first; /* get past null */
5958 if (kid->op_type != OP_SCOPE)
5960 kid = kLISTOP->op_last; /* get past scope */
5961 switch(kid->op_type) {
5969 k = kid; /* remember this node*/
5970 if (kBINOP->op_first->op_type != OP_RV2SV)
5972 kid = kBINOP->op_first; /* get past cmp */
5973 if (kUNOP->op_first->op_type != OP_GV)
5975 kid = kUNOP->op_first; /* get past rv2sv */
5977 if (GvSTASH(gv) != PL_curstash)
5979 if (strEQ(GvNAME(gv), "a"))
5981 else if (strEQ(GvNAME(gv), "b"))
5985 kid = k; /* back to cmp */
5986 if (kBINOP->op_last->op_type != OP_RV2SV)
5988 kid = kBINOP->op_last; /* down to 2nd arg */
5989 if (kUNOP->op_first->op_type != OP_GV)
5991 kid = kUNOP->op_first; /* get past rv2sv */
5993 if (GvSTASH(gv) != PL_curstash
5995 ? strNE(GvNAME(gv), "a")
5996 : strNE(GvNAME(gv), "b")))
5998 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6000 o->op_private |= OPpSORT_REVERSE;
6001 if (k->op_type == OP_NCMP)
6002 o->op_private |= OPpSORT_NUMERIC;
6003 if (k->op_type == OP_I_NCMP)
6004 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6005 kid = cLISTOPo->op_first->op_sibling;
6006 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6007 op_free(kid); /* then delete it */
6008 cLISTOPo->op_children--;
6012 Perl_ck_split(pTHX_ OP *o)
6016 if (o->op_flags & OPf_STACKED)
6017 return no_fh_allowed(o);
6019 kid = cLISTOPo->op_first;
6020 if (kid->op_type != OP_NULL)
6021 Perl_croak(aTHX_ "panic: ck_split");
6022 kid = kid->op_sibling;
6023 op_free(cLISTOPo->op_first);
6024 cLISTOPo->op_first = kid;
6026 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6027 cLISTOPo->op_last = kid; /* There was only one element previously */
6030 if (kid->op_type != OP_MATCH) {
6031 OP *sibl = kid->op_sibling;
6032 kid->op_sibling = 0;
6033 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6034 if (cLISTOPo->op_first == cLISTOPo->op_last)
6035 cLISTOPo->op_last = kid;
6036 cLISTOPo->op_first = kid;
6037 kid->op_sibling = sibl;
6040 kid->op_type = OP_PUSHRE;
6041 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6044 if (!kid->op_sibling)
6045 append_elem(OP_SPLIT, o, newDEFSVOP());
6047 kid = kid->op_sibling;
6050 if (!kid->op_sibling)
6051 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6053 kid = kid->op_sibling;
6056 if (kid->op_sibling)
6057 return too_many_arguments(o,PL_op_desc[o->op_type]);
6063 Perl_ck_join(pTHX_ OP *o)
6065 if (ckWARN(WARN_SYNTAX)) {
6066 OP *kid = cLISTOPo->op_first->op_sibling;
6067 if (kid && kid->op_type == OP_MATCH) {
6068 char *pmstr = "STRING";
6069 if (kPMOP->op_pmregexp)
6070 pmstr = kPMOP->op_pmregexp->precomp;
6071 Perl_warner(aTHX_ WARN_SYNTAX,
6072 "/%s/ should probably be written as \"%s\"",
6080 Perl_ck_subr(pTHX_ OP *o)
6083 OP *prev = ((cUNOPo->op_first->op_sibling)
6084 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6085 OP *o2 = prev->op_sibling;
6094 o->op_private |= OPpENTERSUB_HASTARG;
6095 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6096 if (cvop->op_type == OP_RV2CV) {
6098 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6099 null(cvop); /* disable rv2cv */
6100 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6101 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6102 GV *gv = cGVOPx_gv(tmpop);
6105 tmpop->op_private |= OPpEARLY_CV;
6106 else if (SvPOK(cv)) {
6107 namegv = CvANON(cv) ? gv : CvGV(cv);
6108 proto = SvPV((SV*)cv, n_a);
6112 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6113 if (o2->op_type == OP_CONST)
6114 o2->op_private &= ~OPpCONST_STRICT;
6115 else if (o2->op_type == OP_LIST) {
6116 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6117 if (o && o->op_type == OP_CONST)
6118 o->op_private &= ~OPpCONST_STRICT;
6121 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6122 if (PERLDB_SUB && PL_curstash != PL_debstash)
6123 o->op_private |= OPpENTERSUB_DB;
6124 while (o2 != cvop) {
6128 return too_many_arguments(o, gv_ename(namegv));
6146 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6147 bad_type(arg, "block", gv_ename(namegv), o2);
6150 /* '*' allows any scalar type, including bareword */
6153 if (o2->op_type == OP_RV2GV)
6154 goto wrapref; /* autoconvert GLOB -> GLOBref */
6155 else if (o2->op_type == OP_CONST)
6156 o2->op_private &= ~OPpCONST_STRICT;
6157 else if (o2->op_type == OP_ENTERSUB) {
6158 /* accidental subroutine, revert to bareword */
6159 OP *gvop = ((UNOP*)o2)->op_first;
6160 if (gvop && gvop->op_type == OP_NULL) {
6161 gvop = ((UNOP*)gvop)->op_first;
6163 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6166 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6167 (gvop = ((UNOP*)gvop)->op_first) &&
6168 gvop->op_type == OP_GV)
6170 GV *gv = cGVOPx_gv(gvop);
6171 OP *sibling = o2->op_sibling;
6172 SV *n = newSVpvn("",0);
6174 gv_fullname3(n, gv, "");
6175 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6176 sv_chop(n, SvPVX(n)+6);
6177 o2 = newSVOP(OP_CONST, 0, n);
6178 prev->op_sibling = o2;
6179 o2->op_sibling = sibling;
6191 if (o2->op_type != OP_RV2GV)
6192 bad_type(arg, "symbol", gv_ename(namegv), o2);
6195 if (o2->op_type != OP_RV2CV)
6196 bad_type(arg, "sub", gv_ename(namegv), o2);
6199 if (o2->op_type != OP_RV2SV
6200 && o2->op_type != OP_PADSV
6201 && o2->op_type != OP_HELEM
6202 && o2->op_type != OP_AELEM
6203 && o2->op_type != OP_THREADSV)
6205 bad_type(arg, "scalar", gv_ename(namegv), o2);
6209 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6210 bad_type(arg, "array", gv_ename(namegv), o2);
6213 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6214 bad_type(arg, "hash", gv_ename(namegv), o2);
6218 OP* sib = kid->op_sibling;
6219 kid->op_sibling = 0;
6220 o2 = newUNOP(OP_REFGEN, 0, kid);
6221 o2->op_sibling = sib;
6222 prev->op_sibling = o2;
6233 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6234 gv_ename(namegv), SvPV((SV*)cv, n_a));
6239 mod(o2, OP_ENTERSUB);
6241 o2 = o2->op_sibling;
6243 if (proto && !optional &&
6244 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6245 return too_few_arguments(o, gv_ename(namegv));
6250 Perl_ck_svconst(pTHX_ OP *o)
6252 SvREADONLY_on(cSVOPo->op_sv);
6257 Perl_ck_trunc(pTHX_ OP *o)
6259 if (o->op_flags & OPf_KIDS) {
6260 SVOP *kid = (SVOP*)cUNOPo->op_first;
6262 if (kid->op_type == OP_NULL)
6263 kid = (SVOP*)kid->op_sibling;
6264 if (kid && kid->op_type == OP_CONST &&
6265 (kid->op_private & OPpCONST_BARE))
6267 o->op_flags |= OPf_SPECIAL;
6268 kid->op_private &= ~OPpCONST_STRICT;
6274 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6277 Perl_peep(pTHX_ register OP *o)
6280 register OP* oldop = 0;
6282 OP *last_composite = Nullop;
6284 if (!o || o->op_seq)
6288 SAVEVPTR(PL_curcop);
6289 for (; o; o = o->op_next) {
6295 switch (o->op_type) {
6299 PL_curcop = ((COP*)o); /* for warnings */
6300 o->op_seq = PL_op_seqmax++;
6301 last_composite = Nullop;
6305 if (cSVOPo->op_private & OPpCONST_STRICT)
6306 no_bareword_allowed(o);
6308 /* Relocate sv to the pad for thread safety.
6309 * Despite being a "constant", the SV is written to,
6310 * for reference counts, sv_upgrade() etc. */
6312 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6313 SvREFCNT_dec(PL_curpad[ix]);
6314 SvPADTMP_on(cSVOPo->op_sv);
6315 PL_curpad[ix] = cSVOPo->op_sv;
6316 cSVOPo->op_sv = Nullsv;
6328 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6329 if (o->op_next->op_private & OPpTARGET_MY) {
6330 if (o->op_flags & OPf_STACKED) /* chained concats */
6331 goto ignore_optimization;
6333 o->op_targ = o->op_next->op_targ;
6334 o->op_next->op_targ = 0;
6335 o->op_private |= OPpTARGET_MY;
6340 ignore_optimization:
6341 o->op_seq = PL_op_seqmax++;
6344 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6345 o->op_seq = PL_op_seqmax++;
6346 break; /* Scalar stub must produce undef. List stub is noop */
6350 if (o->op_targ == OP_NEXTSTATE
6351 || o->op_targ == OP_DBSTATE
6352 || o->op_targ == OP_SETSTATE)
6354 PL_curcop = ((COP*)o);
6361 if (oldop && o->op_next) {
6362 oldop->op_next = o->op_next;
6365 o->op_seq = PL_op_seqmax++;
6369 if (o->op_next->op_type == OP_RV2SV) {
6370 if (!(o->op_next->op_private & OPpDEREF)) {
6372 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6374 o->op_next = o->op_next->op_next;
6375 o->op_type = OP_GVSV;
6376 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6379 else if (o->op_next->op_type == OP_RV2AV) {
6380 OP* pop = o->op_next->op_next;
6382 if (pop->op_type == OP_CONST &&
6383 (PL_op = pop->op_next) &&
6384 pop->op_next->op_type == OP_AELEM &&
6385 !(pop->op_next->op_private &
6386 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6387 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6395 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6396 o->op_next = pop->op_next->op_next;
6397 o->op_type = OP_AELEMFAST;
6398 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6399 o->op_private = (U8)i;
6404 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6406 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6407 /* XXX could check prototype here instead of just carping */
6408 SV *sv = sv_newmortal();
6409 gv_efullname3(sv, gv, Nullch);
6410 Perl_warner(aTHX_ WARN_PROTOTYPE,
6411 "%s() called too early to check prototype",
6416 o->op_seq = PL_op_seqmax++;
6427 o->op_seq = PL_op_seqmax++;
6428 while (cLOGOP->op_other->op_type == OP_NULL)
6429 cLOGOP->op_other = cLOGOP->op_other->op_next;
6430 peep(cLOGOP->op_other);
6434 o->op_seq = PL_op_seqmax++;
6435 peep(cLOOP->op_redoop);
6436 peep(cLOOP->op_nextop);
6437 peep(cLOOP->op_lastop);
6443 o->op_seq = PL_op_seqmax++;
6444 peep(cPMOP->op_pmreplstart);
6448 o->op_seq = PL_op_seqmax++;
6449 if (ckWARN(WARN_SYNTAX) && o->op_next
6450 && o->op_next->op_type == OP_NEXTSTATE) {
6451 if (o->op_next->op_sibling &&
6452 o->op_next->op_sibling->op_type != OP_EXIT &&
6453 o->op_next->op_sibling->op_type != OP_WARN &&
6454 o->op_next->op_sibling->op_type != OP_DIE) {
6455 line_t oldline = CopLINE(PL_curcop);
6457 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6458 Perl_warner(aTHX_ WARN_EXEC,
6459 "Statement unlikely to be reached");
6460 Perl_warner(aTHX_ WARN_EXEC,
6461 "(Maybe you meant system() when you said exec()?)\n");
6462 CopLINE_set(PL_curcop, oldline);
6471 SV **svp, **indsvp, *sv;
6476 o->op_seq = PL_op_seqmax++;
6477 if ((o->op_private & (OPpLVAL_INTRO))
6478 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6480 rop = (UNOP*)((BINOP*)o)->op_first;
6481 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6483 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6484 if (!SvOBJECT(lexname))
6486 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6487 if (!fields || !GvHV(*fields))
6489 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6490 key = SvPV(*svp, keylen);
6491 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6493 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6494 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6496 ind = SvIV(*indsvp);
6498 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6499 rop->op_type = OP_RV2AV;
6500 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6501 o->op_type = OP_AELEM;
6502 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6504 if (SvREADONLY(*svp))
6506 SvFLAGS(sv) |= (SvFLAGS(*svp)
6507 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6517 SV **svp, **indsvp, *sv;
6521 SVOP *first_key_op, *key_op;
6523 o->op_seq = PL_op_seqmax++;
6524 if ((o->op_private & (OPpLVAL_INTRO))
6525 /* I bet there's always a pushmark... */
6526 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
6527 /* hmmm, no optimization if list contains only one key. */
6529 rop = (UNOP*)((LISTOP*)o)->op_last;
6530 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6532 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6533 if (!SvOBJECT(lexname))
6535 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6536 if (!fields || !GvHV(*fields))
6538 /* Again guessing that the pushmark can be jumped over.... */
6539 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
6540 ->op_first->op_sibling;
6541 /* Check that the key list contains only constants. */
6542 for (key_op = first_key_op; key_op;
6543 key_op = (SVOP*)key_op->op_sibling)
6544 if (key_op->op_type != OP_CONST)
6548 rop->op_type = OP_RV2AV;
6549 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6550 o->op_type = OP_ASLICE;
6551 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
6552 for (key_op = first_key_op; key_op;
6553 key_op = (SVOP*)key_op->op_sibling) {
6554 svp = cSVOPx_svp(key_op);
6555 key = SvPV(*svp, keylen);
6556 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6558 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
6559 "in variable %s of type %s",
6560 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6562 ind = SvIV(*indsvp);
6564 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6566 if (SvREADONLY(*svp))
6568 SvFLAGS(sv) |= (SvFLAGS(*svp)
6569 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6578 if (!(o->op_flags & OPf_WANT)
6579 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6583 o->op_seq = PL_op_seqmax++;
6587 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6588 o->op_seq = PL_op_seqmax++;
6594 if (last_composite) {
6595 OP *r = last_composite;
6597 while (r->op_sibling)
6600 || (r->op_next->op_type == OP_LIST
6601 && r->op_next->op_next == o))
6603 if (last_composite->op_type == OP_RV2AV)
6604 yyerror("Lvalue subs returning arrays not implemented yet");
6606 yyerror("Lvalue subs returning hashes not implemented yet");
6613 o->op_seq = PL_op_seqmax++;