3 * Copyright (c) 1991-1999, 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)
128 PL_in_my == KEY_our ||
130 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
131 name[1] == '_' && (int)strlen(name) > 2 ))
133 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
134 /* 1999-02-27 mjd@plover.com */
136 p = strchr(name, '\0');
137 /* The next block assumes the buffer is at least 205 chars
138 long. At present, it's always at least 256 chars. */
140 strcpy(name+200, "...");
146 /* Move everything else down one character */
147 for (; p-name > 2; p--)
149 name[2] = toCTRL(name[1]);
152 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
154 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
155 SV **svp = AvARRAY(PL_comppad_name);
156 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
158 && sv != &PL_sv_undef
159 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
160 && strEQ(name, SvPVX(sv)))
162 if (PL_in_my != KEY_our
163 || GvSTASH(sv) == (PL_curstash ? PL_curstash : PL_defstash))
165 Perl_warner(aTHX_ WARN_UNSAFE,
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"));
175 off = pad_alloc(OP_PADSV, SVs_PADMY);
177 sv_upgrade(sv, SVt_PVNV);
179 if (PL_in_my_stash) {
181 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"my\"",
184 (void)SvUPGRADE(sv, SVt_PVMG);
185 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
188 if (PL_in_my == KEY_our) {
189 (void)SvUPGRADE(sv, SVt_PVGV);
190 GvSTASH(sv) = (HV*)SvREFCNT_inc(PL_curstash ? PL_curstash : PL_defstash);
191 SvFLAGS(sv) |= SVpad_OUR;
193 av_store(PL_comppad_name, off, sv);
194 SvNVX(sv) = (NV)PAD_MAX;
195 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
196 if (!PL_min_intro_pending)
197 PL_min_intro_pending = off;
198 PL_max_intro_pending = off;
200 av_store(PL_comppad, off, (SV*)newAV());
201 else if (*name == '%')
202 av_store(PL_comppad, off, (SV*)newHV());
203 SvPADMY_on(PL_curpad[off]);
208 S_pad_addlex(pTHX_ SV *proto_namesv)
210 SV *namesv = NEWSV(1103,0);
211 PADOFFSET newoff = pad_alloc(OP_PADSV, SVs_PADMY);
212 sv_upgrade(namesv, SVt_PVNV);
213 sv_setpv(namesv, SvPVX(proto_namesv));
214 av_store(PL_comppad_name, newoff, namesv);
215 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
216 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
217 SvFAKE_on(namesv); /* A ref, not a real var */
218 if (SvFLAGS(proto_namesv) & SVpad_OUR) { /* An "our" variable */
219 SvFLAGS(namesv) |= SVpad_OUR;
220 (void)SvUPGRADE(namesv, SVt_PVGV);
221 GvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)GvSTASH(proto_namesv));
223 if (SvOBJECT(proto_namesv)) { /* A typed var */
225 (void)SvUPGRADE(namesv, SVt_PVMG);
226 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(proto_namesv));
232 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
235 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
236 I32 cx_ix, I32 saweval, U32 flags)
243 register PERL_CONTEXT *cx;
245 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
246 AV *curlist = CvPADLIST(cv);
247 SV **svp = av_fetch(curlist, 0, FALSE);
250 if (!svp || *svp == &PL_sv_undef)
253 svp = AvARRAY(curname);
254 for (off = AvFILLp(curname); off > 0; off--) {
255 if ((sv = svp[off]) &&
256 sv != &PL_sv_undef &&
258 seq > I_32(SvNVX(sv)) &&
259 strEQ(SvPVX(sv), name))
270 return 0; /* don't clone from inactive stack frame */
274 oldpad = (AV*)AvARRAY(curlist)[depth];
275 oldsv = *av_fetch(oldpad, off, TRUE);
276 if (!newoff) { /* Not a mere clone operation. */
277 newoff = pad_addlex(sv);
278 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
279 /* "It's closures all the way down." */
280 CvCLONE_on(PL_compcv);
282 if (CvANON(PL_compcv))
283 oldsv = Nullsv; /* no need to keep ref */
288 bcv && bcv != cv && !CvCLONE(bcv);
289 bcv = CvOUTSIDE(bcv))
292 /* install the missing pad entry in intervening
293 * nested subs and mark them cloneable.
294 * XXX fix pad_foo() to not use globals */
295 AV *ocomppad_name = PL_comppad_name;
296 AV *ocomppad = PL_comppad;
297 SV **ocurpad = PL_curpad;
298 AV *padlist = CvPADLIST(bcv);
299 PL_comppad_name = (AV*)AvARRAY(padlist)[0];
300 PL_comppad = (AV*)AvARRAY(padlist)[1];
301 PL_curpad = AvARRAY(PL_comppad);
303 PL_comppad_name = ocomppad_name;
304 PL_comppad = ocomppad;
309 if (ckWARN(WARN_CLOSURE)
310 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
312 Perl_warner(aTHX_ WARN_CLOSURE,
313 "Variable \"%s\" may be unavailable",
321 else if (!CvUNIQUE(PL_compcv)) {
322 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
323 Perl_warner(aTHX_ WARN_CLOSURE,
324 "Variable \"%s\" will not stay shared", name);
327 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
333 if (flags & FINDLEX_NOSEARCH)
336 /* Nothing in current lexical context--try eval's context, if any.
337 * This is necessary to let the perldb get at lexically scoped variables.
338 * XXX This will also probably interact badly with eval tree caching.
341 for (i = cx_ix; i >= 0; i--) {
343 switch (CxTYPE(cx)) {
345 if (i == 0 && saweval) {
346 seq = cxstack[saweval].blk_oldcop->cop_seq;
347 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
351 switch (cx->blk_eval.old_op_type) {
357 /* require must have its own scope */
366 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
367 saweval = i; /* so we know where we were called from */
370 seq = cxstack[saweval].blk_oldcop->cop_seq;
371 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
379 Perl_pad_findmy(pTHX_ char *name)
385 SV **svp = AvARRAY(PL_comppad_name);
386 U32 seq = PL_cop_seqmax;
392 * Special case to get lexical (and hence per-thread) @_.
393 * XXX I need to find out how to tell at parse-time whether use
394 * of @_ should refer to a lexical (from a sub) or defgv (global
395 * scope and maybe weird sub-ish things like formats). See
396 * startsub in perly.y. It's possible that @_ could be lexical
397 * (at least from subs) even in non-threaded perl.
399 if (strEQ(name, "@_"))
400 return 0; /* success. (NOT_IN_PAD indicates failure) */
401 #endif /* USE_THREADS */
403 /* The one we're looking for is probably just before comppad_name_fill. */
404 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
405 if ((sv = svp[off]) &&
406 sv != &PL_sv_undef &&
409 seq > I_32(SvNVX(sv)))) &&
410 strEQ(SvPVX(sv), name))
412 if (SvIVX(sv) || SvFLAGS(sv) & SVpad_OUR)
413 return (PADOFFSET)off;
414 pendoff = off; /* this pending def. will override import */
418 outside = CvOUTSIDE(PL_compcv);
420 /* Check if if we're compiling an eval'', and adjust seq to be the
421 * eval's seq number. This depends on eval'' having a non-null
422 * CvOUTSIDE() while it is being compiled. The eval'' itself is
423 * identified by CvEVAL being true and CvGV being null. */
424 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
425 cx = &cxstack[cxstack_ix];
427 seq = cx->blk_oldcop->cop_seq;
430 /* See if it's in a nested scope */
431 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
433 /* If there is a pending local definition, this new alias must die */
435 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
436 return off; /* pad_findlex returns 0 for failure...*/
438 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
442 Perl_pad_leavemy(pTHX_ I32 fill)
446 SV **svp = AvARRAY(PL_comppad_name);
448 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
449 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
450 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
451 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
454 /* "Deintroduce" my variables that are leaving with this scope. */
455 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
456 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
457 SvIVX(sv) = PL_cop_seqmax;
462 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
468 if (AvARRAY(PL_comppad) != PL_curpad)
469 Perl_croak(aTHX_ "panic: pad_alloc");
470 if (PL_pad_reset_pending)
472 if (tmptype & SVs_PADMY) {
474 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
475 } while (SvPADBUSY(sv)); /* need a fresh one */
476 retval = AvFILLp(PL_comppad);
479 SV **names = AvARRAY(PL_comppad_name);
480 SSize_t names_fill = AvFILLp(PL_comppad_name);
483 * "foreach" index vars temporarily become aliases to non-"my"
484 * values. Thus we must skip, not just pad values that are
485 * marked as current pad values, but also those with names.
487 if (++PL_padix <= names_fill &&
488 (sv = names[PL_padix]) && sv != &PL_sv_undef)
490 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
491 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)) && !IS_PADGV(sv))
496 SvFLAGS(sv) |= tmptype;
497 PL_curpad = AvARRAY(PL_comppad);
499 DEBUG_X(PerlIO_printf(Perl_debug_log,
500 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
501 PTR2UV(thr), PTR2UV(PL_curpad),
502 (long) retval, PL_op_name[optype]));
504 DEBUG_X(PerlIO_printf(Perl_debug_log,
505 "Pad 0x%"UVxf" alloc %ld for %s\n",
507 (long) retval, PL_op_name[optype]));
508 #endif /* USE_THREADS */
509 return (PADOFFSET)retval;
513 Perl_pad_sv(pTHX_ PADOFFSET po)
517 DEBUG_X(PerlIO_printf(Perl_debug_log,
518 "0x%"UVxf" Pad 0x%"UVxf" sv %"IVdf"\n",
519 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
522 Perl_croak(aTHX_ "panic: pad_sv po");
523 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %"IVdf"\n",
524 PTR2UV(PL_curpad), (IV)po));
525 #endif /* USE_THREADS */
526 return PL_curpad[po]; /* eventually we'll turn this into a macro */
530 Perl_pad_free(pTHX_ PADOFFSET po)
535 if (AvARRAY(PL_comppad) != PL_curpad)
536 Perl_croak(aTHX_ "panic: pad_free curpad");
538 Perl_croak(aTHX_ "panic: pad_free po");
540 DEBUG_X(PerlIO_printf(Perl_debug_log,
541 "0x%"UVxf" Pad 0x%"UVxf" free %"IVdf"\n",
542 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
544 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %"IVdf"\n",
545 PTR2UV(PL_curpad), (IV)po));
546 #endif /* USE_THREADS */
547 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
548 SvPADTMP_off(PL_curpad[po]);
550 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
553 if ((I32)po < PL_padix)
558 Perl_pad_swipe(pTHX_ PADOFFSET po)
561 if (AvARRAY(PL_comppad) != PL_curpad)
562 Perl_croak(aTHX_ "panic: pad_swipe curpad");
564 Perl_croak(aTHX_ "panic: pad_swipe po");
566 DEBUG_X(PerlIO_printf(Perl_debug_log,
567 "0x%"UVxf" Pad 0x%"UVxf" swipe %"IVdf"\n",
568 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
570 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %"IVdf"\n",
571 PTR2UV(PL_curpad), (IV)po));
572 #endif /* USE_THREADS */
573 SvPADTMP_off(PL_curpad[po]);
574 PL_curpad[po] = NEWSV(1107,0);
575 SvPADTMP_on(PL_curpad[po]);
576 if ((I32)po < PL_padix)
580 /* XXX pad_reset() is currently disabled because it results in serious bugs.
581 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
582 * on the stack by OPs that use them, there are several ways to get an alias
583 * to a shared TARG. Such an alias will change randomly and unpredictably.
584 * We avoid doing this until we can think of a Better Way.
589 #ifdef USE_BROKEN_PAD_RESET
593 if (AvARRAY(PL_comppad) != PL_curpad)
594 Perl_croak(aTHX_ "panic: pad_reset curpad");
596 DEBUG_X(PerlIO_printf(Perl_debug_log,
597 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
598 PTR2UV(thr), PTR2UV(PL_curpad)));
600 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
602 #endif /* USE_THREADS */
603 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
604 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
605 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
606 SvPADTMP_off(PL_curpad[po]);
608 PL_padix = PL_padix_floor;
611 PL_pad_reset_pending = FALSE;
615 /* find_threadsv is not reentrant */
617 Perl_find_threadsv(pTHX_ const char *name)
623 /* We currently only handle names of a single character */
624 p = strchr(PL_threadsv_names, *name);
627 key = p - PL_threadsv_names;
628 MUTEX_LOCK(&thr->mutex);
629 svp = av_fetch(thr->threadsv, key, FALSE);
631 MUTEX_UNLOCK(&thr->mutex);
633 SV *sv = NEWSV(0, 0);
634 av_store(thr->threadsv, key, sv);
635 thr->threadsvp = AvARRAY(thr->threadsv);
636 MUTEX_UNLOCK(&thr->mutex);
638 * Some magic variables used to be automagically initialised
639 * in gv_fetchpv. Those which are now per-thread magicals get
640 * initialised here instead.
646 sv_setpv(sv, "\034");
647 sv_magic(sv, 0, 0, name, 1);
652 PL_sawampersand = TRUE;
666 /* XXX %! tied to Errno.pm needs to be added here.
667 * See gv_fetchpv(). */
671 sv_magic(sv, 0, 0, name, 1);
673 DEBUG_S(PerlIO_printf(Perl_error_log,
674 "find_threadsv: new SV %p for $%s%c\n",
675 sv, (*name < 32) ? "^" : "",
676 (*name < 32) ? toCTRL(*name) : *name));
680 #endif /* USE_THREADS */
685 Perl_op_free(pTHX_ OP *o)
687 register OP *kid, *nextkid;
690 if (!o || o->op_seq == (U16)-1)
693 if (o->op_private & OPpREFCOUNTED) {
694 switch (o->op_type) {
702 if (OpREFCNT_dec(o)) {
713 if (o->op_flags & OPf_KIDS) {
714 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
715 nextkid = kid->op_sibling; /* Get before next freeing kid */
723 /* COP* is not cleared by op_clear() so that we may track line
724 * numbers etc even after null() */
725 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
730 #ifdef PL_OP_SLAB_ALLOC
731 if ((char *) o == PL_OpPtr)
740 S_op_clear(pTHX_ OP *o)
742 switch (o->op_type) {
743 case OP_NULL: /* Was holding old type, if any. */
744 case OP_ENTEREVAL: /* Was holding hints. */
746 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
752 if (!(o->op_flags & OPf_SPECIAL))
755 #endif /* USE_THREADS */
757 if (!(o->op_flags & OPf_REF)
758 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
765 if (cPADOPo->op_padix > 0) {
768 pad_swipe(cPADOPo->op_padix);
769 /* No GvIN_PAD_off(gv) here, because other references may still
770 * exist on the pad */
773 cPADOPo->op_padix = 0;
776 SvREFCNT_dec(cSVOPo->op_sv);
777 cSVOPo->op_sv = Nullsv;
781 SvREFCNT_dec(cSVOPo->op_sv);
782 cSVOPo->op_sv = Nullsv;
788 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
792 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
793 SvREFCNT_dec(cSVOPo->op_sv);
794 cSVOPo->op_sv = Nullsv;
797 Safefree(cPVOPo->op_pv);
798 cPVOPo->op_pv = Nullch;
802 op_free(cPMOPo->op_pmreplroot);
806 if ((PADOFFSET)cPMOPo->op_pmreplroot) {
808 GV *gv = (GV*)PL_curpad[(PADOFFSET)cPMOPo->op_pmreplroot];
809 pad_swipe((PADOFFSET)cPMOPo->op_pmreplroot);
810 /* No GvIN_PAD_off(gv) here, because other references may still
811 * exist on the pad */
816 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
822 cPMOPo->op_pmreplroot = Nullop;
823 ReREFCNT_dec(cPMOPo->op_pmregexp);
824 cPMOPo->op_pmregexp = (REGEXP*)NULL;
828 if (o->op_targ > 0) {
829 pad_free(o->op_targ);
835 S_cop_free(pTHX_ COP* cop)
837 Safefree(cop->cop_label);
839 Safefree(CopFILE(cop)); /* XXXXX share in a pvtable? */
840 Safefree(CopSTASHPV(cop)); /* XXXXX share in a pvtable? */
842 /* NOTE: COP.cop_stash is not refcounted */
843 SvREFCNT_dec(CopFILEGV(cop));
845 if (! specialWARN(cop->cop_warnings))
846 SvREFCNT_dec(cop->cop_warnings);
852 if (o->op_type == OP_NULL)
855 o->op_targ = o->op_type;
856 o->op_type = OP_NULL;
857 o->op_ppaddr = PL_ppaddr[OP_NULL];
860 /* Contextualizers */
862 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
865 Perl_linklist(pTHX_ OP *o)
872 /* establish postfix order */
873 if (cUNOPo->op_first) {
874 o->op_next = LINKLIST(cUNOPo->op_first);
875 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
877 kid->op_next = LINKLIST(kid->op_sibling);
889 Perl_scalarkids(pTHX_ OP *o)
892 if (o && o->op_flags & OPf_KIDS) {
893 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
900 S_scalarboolean(pTHX_ OP *o)
902 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
904 if (ckWARN(WARN_SYNTAX)) {
905 line_t oldline = CopLINE(PL_curcop);
907 if (PL_copline != NOLINE)
908 CopLINE_set(PL_curcop, PL_copline);
909 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
910 CopLINE_set(PL_curcop, oldline);
917 Perl_scalar(pTHX_ OP *o)
921 /* assumes no premature commitment */
922 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
923 || o->op_type == OP_RETURN)
928 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
930 switch (o->op_type) {
932 if (o->op_private & OPpREPEAT_DOLIST)
933 null(((LISTOP*)cBINOPo->op_first)->op_first);
934 scalar(cBINOPo->op_first);
939 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
943 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
944 if (!kPMOP->op_pmreplroot)
945 deprecate("implicit split to @_");
953 if (o->op_flags & OPf_KIDS) {
954 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
960 kid = cLISTOPo->op_first;
962 while (kid = kid->op_sibling) {
968 WITH_THR(PL_curcop = &PL_compiling);
973 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
979 WITH_THR(PL_curcop = &PL_compiling);
986 Perl_scalarvoid(pTHX_ OP *o)
993 if (o->op_type == OP_NEXTSTATE
994 || o->op_type == OP_SETSTATE
995 || o->op_type == OP_DBSTATE
996 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
997 || o->op_targ == OP_SETSTATE
998 || o->op_targ == OP_DBSTATE)))
1001 PL_curcop = (COP*)o; /* for warning below */
1004 /* assumes no premature commitment */
1005 want = o->op_flags & OPf_WANT;
1006 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
1007 || o->op_type == OP_RETURN)
1012 if ((o->op_private & OPpTARGET_MY)
1013 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1015 return scalar(o); /* As if inside SASSIGN */
1018 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1020 switch (o->op_type) {
1022 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1026 if (o->op_flags & OPf_STACKED)
1030 if (o->op_private == 4)
1072 case OP_GETSOCKNAME:
1073 case OP_GETPEERNAME:
1078 case OP_GETPRIORITY:
1101 if (!(o->op_private & OPpLVAL_INTRO))
1102 useless = PL_op_desc[o->op_type];
1109 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1110 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1111 useless = "a variable";
1116 if (cSVOPo->op_private & OPpCONST_STRICT)
1117 no_bareword_allowed(o);
1120 if (ckWARN(WARN_VOID)) {
1121 useless = "a constant";
1122 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1124 else if (SvPOK(sv)) {
1125 if (strnEQ(SvPVX(sv), "di", 2) ||
1126 strnEQ(SvPVX(sv), "ds", 2) ||
1127 strnEQ(SvPVX(sv), "ig", 2))
1132 null(o); /* don't execute or even remember it */
1136 o->op_type = OP_PREINC; /* pre-increment is faster */
1137 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1141 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1142 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1148 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1153 if (o->op_flags & OPf_STACKED)
1161 if (!(o->op_flags & OPf_KIDS))
1170 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1177 /* all requires must return a boolean value */
1178 o->op_flags &= ~OPf_WANT;
1181 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1182 if (!kPMOP->op_pmreplroot)
1183 deprecate("implicit split to @_");
1189 if (ckWARN(WARN_VOID))
1190 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1196 Perl_listkids(pTHX_ OP *o)
1199 if (o && o->op_flags & OPf_KIDS) {
1200 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1207 Perl_list(pTHX_ OP *o)
1211 /* assumes no premature commitment */
1212 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1213 || o->op_type == OP_RETURN)
1218 if ((o->op_private & OPpTARGET_MY)
1219 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1221 return o; /* As if inside SASSIGN */
1224 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1226 switch (o->op_type) {
1229 list(cBINOPo->op_first);
1234 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1242 if (!(o->op_flags & OPf_KIDS))
1244 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1245 list(cBINOPo->op_first);
1246 return gen_constant_list(o);
1253 kid = cLISTOPo->op_first;
1255 while (kid = kid->op_sibling) {
1256 if (kid->op_sibling)
1261 WITH_THR(PL_curcop = &PL_compiling);
1265 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1266 if (kid->op_sibling)
1271 WITH_THR(PL_curcop = &PL_compiling);
1274 /* all requires must return a boolean value */
1275 o->op_flags &= ~OPf_WANT;
1282 Perl_scalarseq(pTHX_ OP *o)
1287 if (o->op_type == OP_LINESEQ ||
1288 o->op_type == OP_SCOPE ||
1289 o->op_type == OP_LEAVE ||
1290 o->op_type == OP_LEAVETRY)
1293 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1294 if (kid->op_sibling) {
1298 PL_curcop = &PL_compiling;
1300 o->op_flags &= ~OPf_PARENS;
1301 if (PL_hints & HINT_BLOCK_SCOPE)
1302 o->op_flags |= OPf_PARENS;
1305 o = newOP(OP_STUB, 0);
1310 S_modkids(pTHX_ OP *o, I32 type)
1313 if (o && o->op_flags & OPf_KIDS) {
1314 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1321 Perl_mod(pTHX_ OP *o, I32 type)
1328 if (!o || PL_error_count)
1331 if ((o->op_private & OPpTARGET_MY)
1332 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1337 switch (o->op_type) {
1342 if (!(o->op_private & (OPpCONST_ARYBASE)))
1344 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1345 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1349 SAVEI32(PL_compiling.cop_arybase);
1350 PL_compiling.cop_arybase = 0;
1352 else if (type == OP_REFGEN)
1355 Perl_croak(aTHX_ "That use of $[ is unsupported");
1358 if (o->op_flags & OPf_PARENS)
1362 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1363 !(o->op_flags & OPf_STACKED)) {
1364 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1365 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1366 assert(cUNOPo->op_first->op_type == OP_NULL);
1367 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1370 else { /* lvalue subroutine call */
1371 o->op_private |= OPpLVAL_INTRO;
1372 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1373 /* Backward compatibility mode: */
1374 o->op_private |= OPpENTERSUB_INARGS;
1377 else { /* Compile-time error message: */
1378 OP *kid = cUNOPo->op_first;
1382 if (kid->op_type == OP_PUSHMARK)
1384 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1386 "panic: unexpected lvalue entersub "
1387 "args: type/targ %ld:%ld",
1388 (long)kid->op_type,kid->op_targ);
1389 kid = kLISTOP->op_first;
1391 while (kid->op_sibling)
1392 kid = kid->op_sibling;
1393 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1395 if (kid->op_type == OP_METHOD_NAMED
1396 || kid->op_type == OP_METHOD)
1400 if (kid->op_sibling || kid->op_next != kid) {
1401 yyerror("panic: unexpected optree near method call");
1405 NewOp(1101, newop, 1, OP);
1406 newop->op_type = OP_RV2CV;
1407 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1408 newop->op_next = newop;
1409 kid->op_sibling = newop;
1410 newop->op_private |= OPpLVAL_INTRO;
1414 if (kid->op_type != OP_RV2CV)
1416 "panic: unexpected lvalue entersub "
1417 "entry via type/targ %ld:%ld",
1418 (long)kid->op_type,kid->op_targ);
1419 kid->op_private |= OPpLVAL_INTRO;
1420 break; /* Postpone until runtime */
1424 kid = kUNOP->op_first;
1425 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1426 kid = kUNOP->op_first;
1427 if (kid->op_type == OP_NULL)
1429 "Unexpected constant lvalue entersub "
1430 "entry via type/targ %ld:%ld",
1431 (long)kid->op_type,kid->op_targ);
1432 if (kid->op_type != OP_GV) {
1433 /* Restore RV2CV to check lvalueness */
1435 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1436 okid->op_next = kid->op_next;
1437 kid->op_next = okid;
1440 okid->op_next = Nullop;
1441 okid->op_type = OP_RV2CV;
1443 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1444 okid->op_private |= OPpLVAL_INTRO;
1448 cv = GvCV(kGVOP_gv);
1458 /* grep, foreach, subcalls, refgen */
1459 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1461 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1462 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1464 : (o->op_type == OP_ENTERSUB
1465 ? "non-lvalue subroutine call"
1466 : PL_op_desc[o->op_type])),
1467 type ? PL_op_desc[type] : "local"));
1481 case OP_RIGHT_SHIFT:
1490 if (!(o->op_flags & OPf_STACKED))
1496 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1502 if (!type && cUNOPo->op_first->op_type != OP_GV)
1503 Perl_croak(aTHX_ "Can't localize through a reference");
1504 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1505 PL_modcount = 10000;
1506 return o; /* Treat \(@foo) like ordinary list. */
1510 if (scalar_mod_type(o, type))
1512 ref(cUNOPo->op_first, o->op_type);
1521 PL_modcount = 10000;
1524 if (!type && cUNOPo->op_first->op_type != OP_GV)
1525 Perl_croak(aTHX_ "Can't localize through a reference");
1526 ref(cUNOPo->op_first, o->op_type);
1530 PL_hints |= HINT_BLOCK_SCOPE;
1540 PL_modcount = 10000;
1541 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1542 return o; /* Treat \(@foo) like ordinary list. */
1543 if (scalar_mod_type(o, type))
1549 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1550 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1555 PL_modcount++; /* XXX ??? */
1557 #endif /* USE_THREADS */
1563 if (type != OP_SASSIGN)
1567 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1573 pad_free(o->op_targ);
1574 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1575 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1576 if (o->op_flags & OPf_KIDS)
1577 mod(cBINOPo->op_first->op_sibling, type);
1582 ref(cBINOPo->op_first, o->op_type);
1583 if (type == OP_ENTERSUB &&
1584 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1585 o->op_private |= OPpLVAL_DEFER;
1592 if (o->op_flags & OPf_KIDS)
1593 mod(cLISTOPo->op_last, type);
1597 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1599 else if (!(o->op_flags & OPf_KIDS))
1601 if (o->op_targ != OP_LIST) {
1602 mod(cBINOPo->op_first, type);
1607 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1611 o->op_flags |= OPf_MOD;
1613 if (type == OP_AASSIGN || type == OP_SASSIGN)
1614 o->op_flags |= OPf_SPECIAL|OPf_REF;
1616 o->op_private |= OPpLVAL_INTRO;
1617 o->op_flags &= ~OPf_SPECIAL;
1618 PL_hints |= HINT_BLOCK_SCOPE;
1620 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1621 o->op_flags |= OPf_REF;
1626 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1630 if (o->op_type == OP_RV2GV)
1654 case OP_RIGHT_SHIFT:
1673 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1675 switch (o->op_type) {
1683 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1696 Perl_refkids(pTHX_ OP *o, I32 type)
1699 if (o && o->op_flags & OPf_KIDS) {
1700 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1707 Perl_ref(pTHX_ OP *o, I32 type)
1711 if (!o || PL_error_count)
1714 switch (o->op_type) {
1716 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1717 !(o->op_flags & OPf_STACKED)) {
1718 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1719 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1720 assert(cUNOPo->op_first->op_type == OP_NULL);
1721 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1722 o->op_flags |= OPf_SPECIAL;
1727 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1731 if (type == OP_DEFINED)
1732 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1733 ref(cUNOPo->op_first, o->op_type);
1736 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1737 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1738 : type == OP_RV2HV ? OPpDEREF_HV
1740 o->op_flags |= OPf_MOD;
1745 o->op_flags |= OPf_MOD; /* XXX ??? */
1750 o->op_flags |= OPf_REF;
1753 if (type == OP_DEFINED)
1754 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1755 ref(cUNOPo->op_first, o->op_type);
1760 o->op_flags |= OPf_REF;
1765 if (!(o->op_flags & OPf_KIDS))
1767 ref(cBINOPo->op_first, type);
1771 ref(cBINOPo->op_first, o->op_type);
1772 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1773 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1774 : type == OP_RV2HV ? OPpDEREF_HV
1776 o->op_flags |= OPf_MOD;
1784 if (!(o->op_flags & OPf_KIDS))
1786 ref(cLISTOPo->op_last, type);
1796 S_dup_attrlist(pTHX_ OP *o)
1800 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1801 * where the first kid is OP_PUSHMARK and the remaining ones
1802 * are OP_CONST. We need to push the OP_CONST values.
1804 if (o->op_type == OP_CONST)
1805 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1807 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1808 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1809 if (o->op_type == OP_CONST)
1810 rop = append_elem(OP_LIST, rop,
1811 newSVOP(OP_CONST, o->op_flags,
1812 SvREFCNT_inc(cSVOPo->op_sv)));
1819 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1821 OP *modname; /* for 'use' */
1824 /* fake up C<use attributes $pkg,$rv,@attrs> */
1825 ENTER; /* need to protect against side-effects of 'use' */
1827 if (stash && HvNAME(stash))
1828 stashsv = newSVpv(HvNAME(stash), 0);
1830 stashsv = &PL_sv_no;
1831 #define ATTRSMODULE "attributes"
1832 modname = newSVOP(OP_CONST, 0,
1833 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1));
1834 modname->op_private |= OPpCONST_BARE;
1835 /* that flag is required to make 'use' work right */
1836 utilize(1, start_subparse(FALSE, 0),
1837 Nullop, /* version */
1839 prepend_elem(OP_LIST,
1840 newSVOP(OP_CONST, 0, stashsv),
1841 prepend_elem(OP_LIST,
1842 newSVOP(OP_CONST, 0, newRV(target)),
1843 dup_attrlist(attrs))));
1848 S_my_kid(pTHX_ OP *o, OP *attrs)
1853 if (!o || PL_error_count)
1857 if (type == OP_LIST) {
1858 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1860 } else if (type == OP_UNDEF) {
1862 } else if (type == OP_RV2SV || /* "our" declaration */
1864 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1865 o->op_private |= OPpOUR_INTRO;
1867 } else if (type != OP_PADSV &&
1870 type != OP_PUSHMARK)
1872 yyerror(Perl_form(aTHX_ "Can't declare %s in my", PL_op_desc[o->op_type]));
1875 else if (attrs && type != OP_PUSHMARK) {
1880 /* check for C<my Dog $spot> when deciding package */
1881 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1882 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1883 stash = SvSTASH(*namesvp);
1885 stash = PL_curstash;
1886 padsv = PAD_SV(o->op_targ);
1887 apply_attrs(stash, padsv, attrs);
1889 o->op_flags |= OPf_MOD;
1890 o->op_private |= OPpLVAL_INTRO;
1895 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1897 if (o->op_flags & OPf_PARENS)
1900 PL_in_my_stash = Nullhv;
1903 return my_kid(o, attrs);
1907 Perl_my(pTHX_ OP *o)
1909 return my_kid(o, Nullop);
1913 Perl_sawparens(pTHX_ OP *o)
1916 o->op_flags |= OPf_PARENS;
1921 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1926 if (ckWARN(WARN_UNSAFE) &&
1927 (left->op_type == OP_RV2AV ||
1928 left->op_type == OP_RV2HV ||
1929 left->op_type == OP_PADAV ||
1930 left->op_type == OP_PADHV)) {
1931 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1932 right->op_type == OP_TRANS)
1933 ? right->op_type : OP_MATCH];
1934 const char *sample = ((left->op_type == OP_RV2AV ||
1935 left->op_type == OP_PADAV)
1936 ? "@array" : "%hash");
1937 Perl_warner(aTHX_ WARN_UNSAFE,
1938 "Applying %s to %s will act on scalar(%s)",
1939 desc, sample, sample);
1942 if (right->op_type == OP_MATCH ||
1943 right->op_type == OP_SUBST ||
1944 right->op_type == OP_TRANS) {
1945 right->op_flags |= OPf_STACKED;
1946 if (right->op_type != OP_MATCH)
1947 left = mod(left, right->op_type);
1948 if (right->op_type == OP_TRANS)
1949 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1951 o = prepend_elem(right->op_type, scalar(left), right);
1953 return newUNOP(OP_NOT, 0, scalar(o));
1957 return bind_match(type, left,
1958 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1962 Perl_invert(pTHX_ OP *o)
1966 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1967 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1971 Perl_scope(pTHX_ OP *o)
1974 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1975 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1976 o->op_type = OP_LEAVE;
1977 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1980 if (o->op_type == OP_LINESEQ) {
1982 o->op_type = OP_SCOPE;
1983 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1984 kid = ((LISTOP*)o)->op_first;
1985 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
1989 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1996 Perl_save_hints(pTHX)
1999 SAVESPTR(GvHV(PL_hintgv));
2000 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
2001 SAVEFREESV(GvHV(PL_hintgv));
2005 Perl_block_start(pTHX_ int full)
2008 int retval = PL_savestack_ix;
2010 SAVEI32(PL_comppad_name_floor);
2012 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
2013 PL_comppad_name_floor = PL_comppad_name_fill;
2015 PL_comppad_name_floor = 0;
2017 SAVEI32(PL_min_intro_pending);
2018 SAVEI32(PL_max_intro_pending);
2019 PL_min_intro_pending = 0;
2020 SAVEI32(PL_comppad_name_fill);
2021 SAVEI32(PL_padix_floor);
2022 PL_padix_floor = PL_padix;
2023 PL_pad_reset_pending = FALSE;
2025 PL_hints &= ~HINT_BLOCK_SCOPE;
2026 SAVESPTR(PL_compiling.cop_warnings);
2027 if (! specialWARN(PL_compiling.cop_warnings)) {
2028 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2029 SAVEFREESV(PL_compiling.cop_warnings) ;
2037 Perl_block_end(pTHX_ I32 floor, OP *seq)
2040 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2041 OP* retval = scalarseq(seq);
2043 PL_pad_reset_pending = FALSE;
2044 PL_compiling.op_private = PL_hints;
2046 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2047 pad_leavemy(PL_comppad_name_fill);
2056 OP *o = newOP(OP_THREADSV, 0);
2057 o->op_targ = find_threadsv("_");
2060 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2061 #endif /* USE_THREADS */
2065 Perl_newPROG(pTHX_ OP *o)
2071 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2072 ((PL_in_eval & EVAL_KEEPERR)
2073 ? OPf_SPECIAL : 0), o);
2074 PL_eval_start = linklist(PL_eval_root);
2075 PL_eval_root->op_private |= OPpREFCOUNTED;
2076 OpREFCNT_set(PL_eval_root, 1);
2077 PL_eval_root->op_next = 0;
2078 peep(PL_eval_start);
2083 PL_main_root = scope(sawparens(scalarvoid(o)));
2084 PL_curcop = &PL_compiling;
2085 PL_main_start = LINKLIST(PL_main_root);
2086 PL_main_root->op_private |= OPpREFCOUNTED;
2087 OpREFCNT_set(PL_main_root, 1);
2088 PL_main_root->op_next = 0;
2089 peep(PL_main_start);
2092 /* Register with debugger */
2094 CV *cv = get_cv("DB::postponed", FALSE);
2098 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2100 call_sv((SV*)cv, G_DISCARD);
2107 Perl_localize(pTHX_ OP *o, I32 lex)
2109 if (o->op_flags & OPf_PARENS)
2113 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2115 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2116 if (*s == ';' || *s == '=')
2117 Perl_warner(aTHX_ WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
2118 lex ? "my" : "local");
2122 PL_in_my_stash = Nullhv;
2126 return mod(o, OP_NULL); /* a bit kludgey */
2130 Perl_jmaybe(pTHX_ OP *o)
2132 if (o->op_type == OP_LIST) {
2135 o2 = newOP(OP_THREADSV, 0);
2136 o2->op_targ = find_threadsv(";");
2138 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2139 #endif /* USE_THREADS */
2140 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2146 Perl_fold_constants(pTHX_ register OP *o)
2150 I32 type = o->op_type;
2153 if (PL_opargs[type] & OA_RETSCALAR)
2155 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2156 o->op_targ = pad_alloc(type, SVs_PADTMP);
2158 /* integerize op, unless it happens to be C<-foo>.
2159 * XXX should pp_i_negate() do magic string negation instead? */
2160 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2161 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2162 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2164 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2167 if (!(PL_opargs[type] & OA_FOLDCONST))
2172 /* XXX might want a ck_negate() for this */
2173 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2186 if (o->op_private & OPpLOCALE)
2191 goto nope; /* Don't try to run w/ errors */
2193 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2194 if ((curop->op_type != OP_CONST ||
2195 (curop->op_private & OPpCONST_BARE)) &&
2196 curop->op_type != OP_LIST &&
2197 curop->op_type != OP_SCALAR &&
2198 curop->op_type != OP_NULL &&
2199 curop->op_type != OP_PUSHMARK)
2205 curop = LINKLIST(o);
2209 sv = *(PL_stack_sp--);
2210 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2211 pad_swipe(o->op_targ);
2212 else if (SvTEMP(sv)) { /* grab mortal temp? */
2213 (void)SvREFCNT_inc(sv);
2217 if (type == OP_RV2GV)
2218 return newGVOP(OP_GV, 0, (GV*)sv);
2220 /* try to smush double to int, but don't smush -2.0 to -2 */
2221 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2225 if ((NV)iv == SvNV(sv)) {
2230 SvIOK_off(sv); /* undo SvIV() damage */
2232 return newSVOP(OP_CONST, 0, sv);
2236 if (!(PL_opargs[type] & OA_OTHERINT))
2239 if (!(PL_hints & HINT_INTEGER)) {
2240 if (type == OP_MODULO
2241 || type == OP_DIVIDE
2242 || !(o->op_flags & OPf_KIDS))
2247 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2248 if (curop->op_type == OP_CONST) {
2249 if (SvIOK(((SVOP*)curop)->op_sv))
2253 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2257 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2264 Perl_gen_constant_list(pTHX_ register OP *o)
2268 I32 oldtmps_floor = PL_tmps_floor;
2272 return o; /* Don't attempt to run with errors */
2274 PL_op = curop = LINKLIST(o);
2281 PL_tmps_floor = oldtmps_floor;
2283 o->op_type = OP_RV2AV;
2284 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2285 curop = ((UNOP*)o)->op_first;
2286 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2293 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2298 if (!o || o->op_type != OP_LIST)
2299 o = newLISTOP(OP_LIST, 0, o, Nullop);
2301 o->op_flags &= ~OPf_WANT;
2303 if (!(PL_opargs[type] & OA_MARK))
2304 null(cLISTOPo->op_first);
2307 o->op_ppaddr = PL_ppaddr[type];
2308 o->op_flags |= flags;
2310 o = CHECKOP(type, o);
2311 if (o->op_type != type)
2314 if (cLISTOPo->op_children < 7) {
2315 /* XXX do we really need to do this if we're done appending?? */
2316 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2318 cLISTOPo->op_last = last; /* in case check substituted last arg */
2321 return fold_constants(o);
2324 /* List constructors */
2327 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2335 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
2336 return newLISTOP(type, 0, first, last);
2338 if (first->op_flags & OPf_KIDS)
2339 ((LISTOP*)first)->op_last->op_sibling = last;
2341 first->op_flags |= OPf_KIDS;
2342 ((LISTOP*)first)->op_first = last;
2344 ((LISTOP*)first)->op_last = last;
2345 ((LISTOP*)first)->op_children++;
2350 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2358 if (first->op_type != type)
2359 return prepend_elem(type, (OP*)first, (OP*)last);
2361 if (last->op_type != type)
2362 return append_elem(type, (OP*)first, (OP*)last);
2364 first->op_last->op_sibling = last->op_first;
2365 first->op_last = last->op_last;
2366 first->op_children += last->op_children;
2367 if (first->op_children)
2368 first->op_flags |= OPf_KIDS;
2370 #ifdef PL_OP_SLAB_ALLOC
2378 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2386 if (last->op_type == type) {
2387 if (type == OP_LIST) { /* already a PUSHMARK there */
2388 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2389 ((LISTOP*)last)->op_first->op_sibling = first;
2392 if (!(last->op_flags & OPf_KIDS)) {
2393 ((LISTOP*)last)->op_last = first;
2394 last->op_flags |= OPf_KIDS;
2396 first->op_sibling = ((LISTOP*)last)->op_first;
2397 ((LISTOP*)last)->op_first = first;
2399 ((LISTOP*)last)->op_children++;
2403 return newLISTOP(type, 0, first, last);
2409 Perl_newNULLLIST(pTHX)
2411 return newOP(OP_STUB, 0);
2415 Perl_force_list(pTHX_ OP *o)
2417 if (!o || o->op_type != OP_LIST)
2418 o = newLISTOP(OP_LIST, 0, o, Nullop);
2424 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2428 NewOp(1101, listop, 1, LISTOP);
2430 listop->op_type = type;
2431 listop->op_ppaddr = PL_ppaddr[type];
2432 listop->op_children = (first != 0) + (last != 0);
2433 listop->op_flags = flags;
2437 else if (!first && last)
2440 first->op_sibling = last;
2441 listop->op_first = first;
2442 listop->op_last = last;
2443 if (type == OP_LIST) {
2445 pushop = newOP(OP_PUSHMARK, 0);
2446 pushop->op_sibling = first;
2447 listop->op_first = pushop;
2448 listop->op_flags |= OPf_KIDS;
2450 listop->op_last = pushop;
2452 else if (listop->op_children)
2453 listop->op_flags |= OPf_KIDS;
2459 Perl_newOP(pTHX_ I32 type, I32 flags)
2462 NewOp(1101, o, 1, OP);
2464 o->op_ppaddr = PL_ppaddr[type];
2465 o->op_flags = flags;
2468 o->op_private = 0 + (flags >> 8);
2469 if (PL_opargs[type] & OA_RETSCALAR)
2471 if (PL_opargs[type] & OA_TARGET)
2472 o->op_targ = pad_alloc(type, SVs_PADTMP);
2473 return CHECKOP(type, o);
2477 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2482 first = newOP(OP_STUB, 0);
2483 if (PL_opargs[type] & OA_MARK)
2484 first = force_list(first);
2486 NewOp(1101, unop, 1, UNOP);
2487 unop->op_type = type;
2488 unop->op_ppaddr = PL_ppaddr[type];
2489 unop->op_first = first;
2490 unop->op_flags = flags | OPf_KIDS;
2491 unop->op_private = 1 | (flags >> 8);
2492 unop = (UNOP*) CHECKOP(type, unop);
2496 return fold_constants((OP *) unop);
2500 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2503 NewOp(1101, binop, 1, BINOP);
2506 first = newOP(OP_NULL, 0);
2508 binop->op_type = type;
2509 binop->op_ppaddr = PL_ppaddr[type];
2510 binop->op_first = first;
2511 binop->op_flags = flags | OPf_KIDS;
2514 binop->op_private = 1 | (flags >> 8);
2517 binop->op_private = 2 | (flags >> 8);
2518 first->op_sibling = last;
2521 binop = (BINOP*)CHECKOP(type, binop);
2522 if (binop->op_next || binop->op_type != type)
2525 binop->op_last = binop->op_first->op_sibling;
2527 return fold_constants((OP *)binop);
2531 utf8compare(const void *a, const void *b)
2534 for (i = 0; i < 10; i++) {
2535 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2537 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2544 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2546 SV *tstr = ((SVOP*)expr)->op_sv;
2547 SV *rstr = ((SVOP*)repl)->op_sv;
2550 register U8 *t = (U8*)SvPV(tstr, tlen);
2551 register U8 *r = (U8*)SvPV(rstr, rlen);
2557 register short *tbl;
2559 complement = o->op_private & OPpTRANS_COMPLEMENT;
2560 del = o->op_private & OPpTRANS_DELETE;
2561 squash = o->op_private & OPpTRANS_SQUASH;
2563 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2564 SV* listsv = newSVpvn("# comment\n",10);
2566 U8* tend = t + tlen;
2567 U8* rend = r + rlen;
2583 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2584 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2590 New(1109, cp, tlen, U8*);
2592 transv = newSVpvn("",0);
2601 qsort(cp, i, sizeof(U8*), utf8compare);
2602 for (j = 0; j < i; j++) {
2604 UV val = utf8_to_uv(s, &ulen);
2606 diff = val - nextmin;
2608 t = uv_to_utf8(tmpbuf,nextmin);
2609 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2611 t = uv_to_utf8(tmpbuf, val - 1);
2612 sv_catpvn(transv, "\377", 1);
2613 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2617 val = utf8_to_uv(s+1, &ulen);
2621 t = uv_to_utf8(tmpbuf,nextmin);
2622 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2623 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2624 sv_catpvn(transv, "\377", 1);
2625 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2626 t = (U8*)SvPVX(transv);
2627 tlen = SvCUR(transv);
2630 else if (!rlen && !del) {
2631 r = t; rlen = tlen; rend = tend;
2634 if (to_utf && from_utf) { /* only counting characters */
2635 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2636 o->op_private |= OPpTRANS_IDENTICAL;
2638 else { /* straight latin-1 translation */
2639 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2640 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2641 o->op_private |= OPpTRANS_IDENTICAL;
2645 while (t < tend || tfirst <= tlast) {
2646 /* see if we need more "t" chars */
2647 if (tfirst > tlast) {
2648 tfirst = (I32)utf8_to_uv(t, &ulen);
2650 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2651 tlast = (I32)utf8_to_uv(++t, &ulen);
2658 /* now see if we need more "r" chars */
2659 if (rfirst > rlast) {
2661 rfirst = (I32)utf8_to_uv(r, &ulen);
2663 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2664 rlast = (I32)utf8_to_uv(++r, &ulen);
2673 rfirst = rlast = 0xffffffff;
2677 /* now see which range will peter our first, if either. */
2678 tdiff = tlast - tfirst;
2679 rdiff = rlast - rfirst;
2686 if (rfirst == 0xffffffff) {
2687 diff = tdiff; /* oops, pretend rdiff is infinite */
2689 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2691 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\tXXXX\n", tfirst);
2695 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2697 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2699 if (rfirst + diff > max)
2700 max = rfirst + diff;
2705 else if (rfirst <= 0x800)
2706 grows |= (tfirst < 0x80);
2707 else if (rfirst <= 0x10000)
2708 grows |= (tfirst < 0x800);
2709 else if (rfirst <= 0x200000)
2710 grows |= (tfirst < 0x10000);
2711 else if (rfirst <= 0x4000000)
2712 grows |= (tfirst < 0x200000);
2713 else if (rfirst <= 0x80000000)
2714 grows |= (tfirst < 0x4000000);
2726 else if (max > 0xff)
2731 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2732 SvREFCNT_dec(listsv);
2734 SvREFCNT_dec(transv);
2736 if (!del && havefinal)
2737 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2739 if (grows && to_utf)
2740 o->op_private |= OPpTRANS_GROWS;
2747 tbl = (short*)cPVOPo->op_pv;
2749 Zero(tbl, 256, short);
2750 for (i = 0; i < tlen; i++)
2752 for (i = 0, j = 0; i < 256; i++) {
2768 if (!rlen && !del) {
2771 o->op_private |= OPpTRANS_IDENTICAL;
2773 for (i = 0; i < 256; i++)
2775 for (i = 0, j = 0; i < tlen; i++,j++) {
2778 if (tbl[t[i]] == -1)
2784 if (tbl[t[i]] == -1)
2795 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2800 NewOp(1101, pmop, 1, PMOP);
2801 pmop->op_type = type;
2802 pmop->op_ppaddr = PL_ppaddr[type];
2803 pmop->op_flags = flags;
2804 pmop->op_private = 0 | (flags >> 8);
2806 if (PL_hints & HINT_RE_TAINT)
2807 pmop->op_pmpermflags |= PMf_RETAINT;
2808 if (PL_hints & HINT_LOCALE)
2809 pmop->op_pmpermflags |= PMf_LOCALE;
2810 pmop->op_pmflags = pmop->op_pmpermflags;
2812 /* link into pm list */
2813 if (type != OP_TRANS && PL_curstash) {
2814 pmop->op_pmnext = HvPMROOT(PL_curstash);
2815 HvPMROOT(PL_curstash) = pmop;
2822 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2827 I32 repl_has_vars = 0;
2829 if (o->op_type == OP_TRANS)
2830 return pmtrans(o, expr, repl);
2832 PL_hints |= HINT_BLOCK_SCOPE;
2835 if (expr->op_type == OP_CONST) {
2837 SV *pat = ((SVOP*)expr)->op_sv;
2838 char *p = SvPV(pat, plen);
2839 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2840 sv_setpvn(pat, "\\s+", 3);
2841 p = SvPV(pat, plen);
2842 pm->op_pmflags |= PMf_SKIPWHITE;
2844 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2845 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2846 pm->op_pmflags |= PMf_WHITE;
2850 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2851 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2853 : OP_REGCMAYBE),0,expr);
2855 NewOp(1101, rcop, 1, LOGOP);
2856 rcop->op_type = OP_REGCOMP;
2857 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2858 rcop->op_first = scalar(expr);
2859 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2860 ? (OPf_SPECIAL | OPf_KIDS)
2862 rcop->op_private = 1;
2865 /* establish postfix order */
2866 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2868 rcop->op_next = expr;
2869 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2872 rcop->op_next = LINKLIST(expr);
2873 expr->op_next = (OP*)rcop;
2876 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2881 if (pm->op_pmflags & PMf_EVAL) {
2883 if (CopLINE(PL_curcop) < PL_multi_end)
2884 CopLINE_set(PL_curcop, PL_multi_end);
2887 else if (repl->op_type == OP_THREADSV
2888 && strchr("&`'123456789+",
2889 PL_threadsv_names[repl->op_targ]))
2893 #endif /* USE_THREADS */
2894 else if (repl->op_type == OP_CONST)
2898 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2899 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2901 if (curop->op_type == OP_THREADSV) {
2903 if (strchr("&`'123456789+", curop->op_private))
2907 if (curop->op_type == OP_GV) {
2908 GV *gv = cGVOPx_gv(curop);
2910 if (strchr("&`'123456789+", *GvENAME(gv)))
2913 #endif /* USE_THREADS */
2914 else if (curop->op_type == OP_RV2CV)
2916 else if (curop->op_type == OP_RV2SV ||
2917 curop->op_type == OP_RV2AV ||
2918 curop->op_type == OP_RV2HV ||
2919 curop->op_type == OP_RV2GV) {
2920 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2923 else if (curop->op_type == OP_PADSV ||
2924 curop->op_type == OP_PADAV ||
2925 curop->op_type == OP_PADHV ||
2926 curop->op_type == OP_PADANY) {
2929 else if (curop->op_type == OP_PUSHRE)
2930 ; /* Okay here, dangerous in newASSIGNOP */
2939 && (!pm->op_pmregexp
2940 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2941 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2942 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2943 prepend_elem(o->op_type, scalar(repl), o);
2946 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2947 pm->op_pmflags |= PMf_MAYBE_CONST;
2948 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2950 NewOp(1101, rcop, 1, LOGOP);
2951 rcop->op_type = OP_SUBSTCONT;
2952 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2953 rcop->op_first = scalar(repl);
2954 rcop->op_flags |= OPf_KIDS;
2955 rcop->op_private = 1;
2958 /* establish postfix order */
2959 rcop->op_next = LINKLIST(repl);
2960 repl->op_next = (OP*)rcop;
2962 pm->op_pmreplroot = scalar((OP*)rcop);
2963 pm->op_pmreplstart = LINKLIST(rcop);
2972 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2975 NewOp(1101, svop, 1, SVOP);
2976 svop->op_type = type;
2977 svop->op_ppaddr = PL_ppaddr[type];
2979 svop->op_next = (OP*)svop;
2980 svop->op_flags = flags;
2981 if (PL_opargs[type] & OA_RETSCALAR)
2983 if (PL_opargs[type] & OA_TARGET)
2984 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2985 return CHECKOP(type, svop);
2989 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
2992 NewOp(1101, padop, 1, PADOP);
2993 padop->op_type = type;
2994 padop->op_ppaddr = PL_ppaddr[type];
2995 padop->op_padix = pad_alloc(type, SVs_PADTMP);
2996 SvREFCNT_dec(PL_curpad[padop->op_padix]);
2997 PL_curpad[padop->op_padix] = sv;
2999 padop->op_next = (OP*)padop;
3000 padop->op_flags = flags;
3001 if (PL_opargs[type] & OA_RETSCALAR)
3003 if (PL_opargs[type] & OA_TARGET)
3004 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3005 return CHECKOP(type, padop);
3009 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3014 return newPADOP(type, flags, SvREFCNT_inc(gv));
3016 return newSVOP(type, flags, SvREFCNT_inc(gv));
3021 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3024 NewOp(1101, pvop, 1, PVOP);
3025 pvop->op_type = type;
3026 pvop->op_ppaddr = PL_ppaddr[type];
3028 pvop->op_next = (OP*)pvop;
3029 pvop->op_flags = flags;
3030 if (PL_opargs[type] & OA_RETSCALAR)
3032 if (PL_opargs[type] & OA_TARGET)
3033 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3034 return CHECKOP(type, pvop);
3038 Perl_package(pTHX_ OP *o)
3043 save_hptr(&PL_curstash);
3044 save_item(PL_curstname);
3049 name = SvPV(sv, len);
3050 PL_curstash = gv_stashpvn(name,len,TRUE);
3051 sv_setpvn(PL_curstname, name, len);
3055 sv_setpv(PL_curstname,"<none>");
3056 PL_curstash = Nullhv;
3058 PL_hints |= HINT_BLOCK_SCOPE;
3059 PL_copline = NOLINE;
3064 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3073 if (id->op_type != OP_CONST)
3074 Perl_croak(aTHX_ "Module name must be constant");
3078 if(version != Nullop) {
3079 SV *vesv = ((SVOP*)version)->op_sv;
3081 if (arg == Nullop && !SvNIOK(vesv)) {
3087 if (version->op_type != OP_CONST || !SvNIOK(vesv))
3088 Perl_croak(aTHX_ "Version number must be constant number");
3090 /* Make copy of id so we don't free it twice */
3091 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3093 /* Fake up a method call to VERSION */
3094 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3095 append_elem(OP_LIST,
3096 prepend_elem(OP_LIST, pack, list(version)),
3097 newSVOP(OP_METHOD_NAMED, 0,
3098 newSVpvn("VERSION", 7))));
3102 /* Fake up an import/unimport */
3103 if (arg && arg->op_type == OP_STUB)
3104 imop = arg; /* no import on explicit () */
3105 else if(SvNIOK(((SVOP*)id)->op_sv)) {
3106 imop = Nullop; /* use 5.0; */
3109 /* Make copy of id so we don't free it twice */
3110 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3111 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3112 append_elem(OP_LIST,
3113 prepend_elem(OP_LIST, pack, list(arg)),
3114 newSVOP(OP_METHOD_NAMED, 0,
3115 aver ? newSVpvn("import", 6)
3116 : newSVpvn("unimport", 8))));
3119 /* Fake up a require, handle override, if any */
3120 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3121 if (!(gv && GvIMPORTED_CV(gv)))
3122 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3124 if (gv && GvIMPORTED_CV(gv)) {
3125 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3126 append_elem(OP_LIST, id,
3127 scalar(newUNOP(OP_RV2CV, 0,
3132 rqop = newUNOP(OP_REQUIRE, 0, id);
3135 /* Fake up the BEGIN {}, which does its thing immediately. */
3137 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3140 append_elem(OP_LINESEQ,
3141 append_elem(OP_LINESEQ,
3142 newSTATEOP(0, Nullch, rqop),
3143 newSTATEOP(0, Nullch, veop)),
3144 newSTATEOP(0, Nullch, imop) ));
3146 PL_hints |= HINT_BLOCK_SCOPE;
3147 PL_copline = NOLINE;
3152 Perl_dofile(pTHX_ OP *term)
3157 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3158 if (!(gv && GvIMPORTED_CV(gv)))
3159 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3161 if (gv && GvIMPORTED_CV(gv)) {
3162 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3163 append_elem(OP_LIST, term,
3164 scalar(newUNOP(OP_RV2CV, 0,
3169 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3175 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3177 return newBINOP(OP_LSLICE, flags,
3178 list(force_list(subscript)),
3179 list(force_list(listval)) );
3183 S_list_assignment(pTHX_ register OP *o)
3188 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3189 o = cUNOPo->op_first;
3191 if (o->op_type == OP_COND_EXPR) {
3192 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3193 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3198 yyerror("Assignment to both a list and a scalar");
3202 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3203 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3204 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3207 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3210 if (o->op_type == OP_RV2SV)
3217 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3222 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3223 return newLOGOP(optype, 0,
3224 mod(scalar(left), optype),
3225 newUNOP(OP_SASSIGN, 0, scalar(right)));
3228 return newBINOP(optype, OPf_STACKED,
3229 mod(scalar(left), optype), scalar(right));
3233 if (list_assignment(left)) {
3236 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3237 left = mod(left, OP_AASSIGN);
3245 o = newBINOP(OP_AASSIGN, flags,
3246 list(force_list(right)),
3247 list(force_list(left)) );
3248 o->op_private = 0 | (flags >> 8);
3249 if (!(left->op_private & OPpLVAL_INTRO)) {
3253 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3254 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3255 if (curop->op_type == OP_GV) {
3256 GV *gv = cGVOPx_gv(curop);
3257 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3259 SvCUR(gv) = PL_generation;
3261 else if (curop->op_type == OP_PADSV ||
3262 curop->op_type == OP_PADAV ||
3263 curop->op_type == OP_PADHV ||
3264 curop->op_type == OP_PADANY) {
3265 SV **svp = AvARRAY(PL_comppad_name);
3266 SV *sv = svp[curop->op_targ];
3267 if (SvCUR(sv) == PL_generation)
3269 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3271 else if (curop->op_type == OP_RV2CV)
3273 else if (curop->op_type == OP_RV2SV ||
3274 curop->op_type == OP_RV2AV ||
3275 curop->op_type == OP_RV2HV ||
3276 curop->op_type == OP_RV2GV) {
3277 if (lastop->op_type != OP_GV) /* funny deref? */
3280 else if (curop->op_type == OP_PUSHRE) {
3281 if (((PMOP*)curop)->op_pmreplroot) {
3282 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3283 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3285 SvCUR(gv) = PL_generation;
3294 o->op_private = OPpASSIGN_COMMON;
3296 if (right && right->op_type == OP_SPLIT) {
3298 if ((tmpop = ((LISTOP*)right)->op_first) &&
3299 tmpop->op_type == OP_PUSHRE)
3301 PMOP *pm = (PMOP*)tmpop;
3302 if (left->op_type == OP_RV2AV &&
3303 !(left->op_private & OPpLVAL_INTRO) &&
3304 !(o->op_private & OPpASSIGN_COMMON) )
3306 tmpop = ((UNOP*)left)->op_first;
3307 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3309 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3310 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3312 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3313 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3315 pm->op_pmflags |= PMf_ONCE;
3316 tmpop = cUNOPo->op_first; /* to list (nulled) */
3317 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3318 tmpop->op_sibling = Nullop; /* don't free split */
3319 right->op_next = tmpop->op_next; /* fix starting loc */
3320 op_free(o); /* blow off assign */
3321 right->op_flags &= ~OPf_WANT;
3322 /* "I don't know and I don't care." */
3327 if (PL_modcount < 10000 &&
3328 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3330 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3332 sv_setiv(sv, PL_modcount+1);
3340 right = newOP(OP_UNDEF, 0);
3341 if (right->op_type == OP_READLINE) {
3342 right->op_flags |= OPf_STACKED;
3343 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3346 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3347 o = newBINOP(OP_SASSIGN, flags,
3348 scalar(right), mod(scalar(left), OP_SASSIGN) );
3360 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3363 U32 seq = intro_my();
3366 NewOp(1101, cop, 1, COP);
3367 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3368 cop->op_type = OP_DBSTATE;
3369 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3372 cop->op_type = OP_NEXTSTATE;
3373 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3375 cop->op_flags = flags;
3376 cop->op_private = (PL_hints & HINT_UTF8);
3378 cop->op_private |= NATIVE_HINTS;
3380 PL_compiling.op_private = cop->op_private;
3381 cop->op_next = (OP*)cop;
3384 cop->cop_label = label;
3385 PL_hints |= HINT_BLOCK_SCOPE;
3388 cop->cop_arybase = PL_curcop->cop_arybase;
3389 if (specialWARN(PL_curcop->cop_warnings))
3390 cop->cop_warnings = PL_curcop->cop_warnings ;
3392 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3395 if (PL_copline == NOLINE)
3396 CopLINE_set(cop, CopLINE(PL_curcop));
3398 CopLINE_set(cop, PL_copline);
3399 PL_copline = NOLINE;
3402 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXXXX share in a pvtable? */
3404 CopFILEGV_set(cop, (GV*)SvREFCNT_inc(CopFILEGV(PL_curcop)));
3406 CopSTASH_set(cop, PL_curstash);
3408 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3409 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3410 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3411 (void)SvIOK_on(*svp);
3412 SvIVX(*svp) = PTR2IV(cop);
3416 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3419 /* "Introduce" my variables to visible status. */
3427 if (! PL_min_intro_pending)
3428 return PL_cop_seqmax;
3430 svp = AvARRAY(PL_comppad_name);
3431 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3432 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3433 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3434 SvNVX(sv) = (NV)PL_cop_seqmax;
3437 PL_min_intro_pending = 0;
3438 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3439 return PL_cop_seqmax++;
3443 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3445 return new_logop(type, flags, &first, &other);
3449 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3454 OP *first = *firstp;
3455 OP *other = *otherp;
3457 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3458 return newBINOP(type, flags, scalar(first), scalar(other));
3460 scalarboolean(first);
3461 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3462 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3463 if (type == OP_AND || type == OP_OR) {
3469 first = *firstp = cUNOPo->op_first;
3471 first->op_next = o->op_next;
3472 cUNOPo->op_first = Nullop;
3476 if (first->op_type == OP_CONST) {
3477 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3478 Perl_warner(aTHX_ WARN_PRECEDENCE, "Probable precedence problem on %s",
3480 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3491 else if (first->op_type == OP_WANTARRAY) {
3497 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3498 OP *k1 = ((UNOP*)first)->op_first;
3499 OP *k2 = k1->op_sibling;
3501 switch (first->op_type)
3504 if (k2 && k2->op_type == OP_READLINE
3505 && (k2->op_flags & OPf_STACKED)
3506 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3508 warnop = k2->op_type;
3513 if (k1->op_type == OP_READDIR
3514 || k1->op_type == OP_GLOB
3515 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3516 || k1->op_type == OP_EACH)
3518 warnop = ((k1->op_type == OP_NULL)
3519 ? k1->op_targ : k1->op_type);
3524 line_t oldline = CopLINE(PL_curcop);
3525 CopLINE_set(PL_curcop, PL_copline);
3526 Perl_warner(aTHX_ WARN_UNSAFE,
3527 "Value of %s%s can be \"0\"; test with defined()",
3529 ((warnop == OP_READLINE || warnop == OP_GLOB)
3530 ? " construct" : "() operator"));
3531 CopLINE_set(PL_curcop, oldline);
3538 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3539 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3541 NewOp(1101, logop, 1, LOGOP);
3543 logop->op_type = type;
3544 logop->op_ppaddr = PL_ppaddr[type];
3545 logop->op_first = first;
3546 logop->op_flags = flags | OPf_KIDS;
3547 logop->op_other = LINKLIST(other);
3548 logop->op_private = 1 | (flags >> 8);
3550 /* establish postfix order */
3551 logop->op_next = LINKLIST(first);
3552 first->op_next = (OP*)logop;
3553 first->op_sibling = other;
3555 o = newUNOP(OP_NULL, 0, (OP*)logop);
3562 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3570 return newLOGOP(OP_AND, 0, first, trueop);
3572 return newLOGOP(OP_OR, 0, first, falseop);
3574 scalarboolean(first);
3575 if (first->op_type == OP_CONST) {
3576 if (SvTRUE(((SVOP*)first)->op_sv)) {
3587 else if (first->op_type == OP_WANTARRAY) {
3591 NewOp(1101, logop, 1, LOGOP);
3592 logop->op_type = OP_COND_EXPR;
3593 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3594 logop->op_first = first;
3595 logop->op_flags = flags | OPf_KIDS;
3596 logop->op_private = 1 | (flags >> 8);
3597 logop->op_other = LINKLIST(trueop);
3598 logop->op_next = LINKLIST(falseop);
3601 /* establish postfix order */
3602 start = LINKLIST(first);
3603 first->op_next = (OP*)logop;
3605 first->op_sibling = trueop;
3606 trueop->op_sibling = falseop;
3607 o = newUNOP(OP_NULL, 0, (OP*)logop);
3609 trueop->op_next = falseop->op_next = o;
3616 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3625 NewOp(1101, range, 1, LOGOP);
3627 range->op_type = OP_RANGE;
3628 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3629 range->op_first = left;
3630 range->op_flags = OPf_KIDS;
3631 leftstart = LINKLIST(left);
3632 range->op_other = LINKLIST(right);
3633 range->op_private = 1 | (flags >> 8);
3635 left->op_sibling = right;
3637 range->op_next = (OP*)range;
3638 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3639 flop = newUNOP(OP_FLOP, 0, flip);
3640 o = newUNOP(OP_NULL, 0, flop);
3642 range->op_next = leftstart;
3644 left->op_next = flip;
3645 right->op_next = flop;
3647 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3648 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3649 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3650 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3652 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3653 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3656 if (!flip->op_private || !flop->op_private)
3657 linklist(o); /* blow off optimizer unless constant */
3663 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3668 int once = block && block->op_flags & OPf_SPECIAL &&
3669 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3672 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3673 return block; /* do {} while 0 does once */
3674 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3675 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3676 expr = newUNOP(OP_DEFINED, 0,
3677 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3678 } else if (expr->op_flags & OPf_KIDS) {
3679 OP *k1 = ((UNOP*)expr)->op_first;
3680 OP *k2 = (k1) ? k1->op_sibling : NULL;
3681 switch (expr->op_type) {
3683 if (k2 && k2->op_type == OP_READLINE
3684 && (k2->op_flags & OPf_STACKED)
3685 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3686 expr = newUNOP(OP_DEFINED, 0, expr);
3690 if (k1->op_type == OP_READDIR
3691 || k1->op_type == OP_GLOB
3692 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3693 || k1->op_type == OP_EACH)
3694 expr = newUNOP(OP_DEFINED, 0, expr);
3700 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3701 o = new_logop(OP_AND, 0, &expr, &listop);
3704 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3706 if (once && o != listop)
3707 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3710 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3712 o->op_flags |= flags;
3714 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3719 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3728 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3729 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3730 expr = newUNOP(OP_DEFINED, 0,
3731 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3732 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3733 OP *k1 = ((UNOP*)expr)->op_first;
3734 OP *k2 = (k1) ? k1->op_sibling : NULL;
3735 switch (expr->op_type) {
3737 if (k2 && k2->op_type == OP_READLINE
3738 && (k2->op_flags & OPf_STACKED)
3739 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3740 expr = newUNOP(OP_DEFINED, 0, expr);
3744 if (k1->op_type == OP_READDIR
3745 || k1->op_type == OP_GLOB
3746 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3747 || k1->op_type == OP_EACH)
3748 expr = newUNOP(OP_DEFINED, 0, expr);
3754 block = newOP(OP_NULL, 0);
3757 next = LINKLIST(cont);
3759 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3760 if ((line_t)whileline != NOLINE) {
3761 PL_copline = whileline;
3762 cont = append_elem(OP_LINESEQ, cont,
3763 newSTATEOP(0, Nullch, Nullop));
3767 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3768 redo = LINKLIST(listop);
3771 PL_copline = whileline;
3773 o = new_logop(OP_AND, 0, &expr, &listop);
3774 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3775 op_free(expr); /* oops, it's a while (0) */
3777 return Nullop; /* listop already freed by new_logop */
3780 ((LISTOP*)listop)->op_last->op_next = condop =
3781 (o == listop ? redo : LINKLIST(o));
3789 NewOp(1101,loop,1,LOOP);
3790 loop->op_type = OP_ENTERLOOP;
3791 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3792 loop->op_private = 0;
3793 loop->op_next = (OP*)loop;
3796 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3798 loop->op_redoop = redo;
3799 loop->op_lastop = o;
3802 loop->op_nextop = next;
3804 loop->op_nextop = o;
3806 o->op_flags |= flags;
3807 o->op_private |= (flags >> 8);
3812 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3821 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3822 sv->op_type = OP_RV2GV;
3823 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3825 else if (sv->op_type == OP_PADSV) { /* private variable */
3826 padoff = sv->op_targ;
3831 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3832 padoff = sv->op_targ;
3834 iterflags |= OPf_SPECIAL;
3839 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3843 padoff = find_threadsv("_");
3844 iterflags |= OPf_SPECIAL;
3846 sv = newGVOP(OP_GV, 0, PL_defgv);
3849 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3850 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3851 iterflags |= OPf_STACKED;
3853 else if (expr->op_type == OP_NULL &&
3854 (expr->op_flags & OPf_KIDS) &&
3855 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3857 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3858 * set the STACKED flag to indicate that these values are to be
3859 * treated as min/max values by 'pp_iterinit'.
3861 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3862 LOGOP* range = (LOGOP*) flip->op_first;
3863 OP* left = range->op_first;
3864 OP* right = left->op_sibling;
3867 range->op_flags &= ~OPf_KIDS;
3868 range->op_first = Nullop;
3870 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3871 listop->op_first->op_next = range->op_next;
3872 left->op_next = range->op_other;
3873 right->op_next = (OP*)listop;
3874 listop->op_next = listop->op_first;
3877 expr = (OP*)(listop);
3879 iterflags |= OPf_STACKED;
3882 expr = mod(force_list(expr), OP_GREPSTART);
3886 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3887 append_elem(OP_LIST, expr, scalar(sv))));
3888 assert(!loop->op_next);
3889 #ifdef PL_OP_SLAB_ALLOC
3890 NewOp(1234,tmp,1,LOOP);
3891 Copy(loop,tmp,1,LOOP);
3894 Renew(loop, 1, LOOP);
3896 loop->op_targ = padoff;
3897 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3898 PL_copline = forline;
3899 return newSTATEOP(0, label, wop);
3903 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3909 if (type != OP_GOTO || label->op_type == OP_CONST) {
3910 /* "last()" means "last" */
3911 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3912 o = newOP(type, OPf_SPECIAL);
3914 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3915 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3921 if (label->op_type == OP_ENTERSUB)
3922 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3923 o = newUNOP(type, OPf_STACKED, label);
3925 PL_hints |= HINT_BLOCK_SCOPE;
3930 Perl_cv_undef(pTHX_ CV *cv)
3935 MUTEX_DESTROY(CvMUTEXP(cv));
3936 Safefree(CvMUTEXP(cv));
3939 #endif /* USE_THREADS */
3941 if (!CvXSUB(cv) && CvROOT(cv)) {
3943 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3944 Perl_croak(aTHX_ "Can't undef active subroutine");
3947 Perl_croak(aTHX_ "Can't undef active subroutine");
3948 #endif /* USE_THREADS */
3951 SAVEVPTR(PL_curpad);
3955 op_free(CvROOT(cv));
3956 CvROOT(cv) = Nullop;
3959 SvPOK_off((SV*)cv); /* forget prototype */
3961 SvREFCNT_dec(CvGV(cv));
3963 SvREFCNT_dec(CvOUTSIDE(cv));
3964 CvOUTSIDE(cv) = Nullcv;
3965 if (CvPADLIST(cv)) {
3966 /* may be during global destruction */
3967 if (SvREFCNT(CvPADLIST(cv))) {
3968 I32 i = AvFILLp(CvPADLIST(cv));
3970 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3971 SV* sv = svp ? *svp : Nullsv;
3974 if (sv == (SV*)PL_comppad_name)
3975 PL_comppad_name = Nullav;
3976 else if (sv == (SV*)PL_comppad) {
3977 PL_comppad = Nullav;
3978 PL_curpad = Null(SV**);
3982 SvREFCNT_dec((SV*)CvPADLIST(cv));
3984 CvPADLIST(cv) = Nullav;
3989 S_cv_dump(pTHX_ CV *cv)
3992 CV *outside = CvOUTSIDE(cv);
3993 AV* padlist = CvPADLIST(cv);
4000 PerlIO_printf(Perl_debug_log,
4001 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4003 (CvANON(cv) ? "ANON"
4004 : (cv == PL_main_cv) ? "MAIN"
4005 : CvUNIQUE(cv) ? "UNIQUE"
4006 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4009 : CvANON(outside) ? "ANON"
4010 : (outside == PL_main_cv) ? "MAIN"
4011 : CvUNIQUE(outside) ? "UNIQUE"
4012 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4017 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4018 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4019 pname = AvARRAY(pad_name);
4020 ppad = AvARRAY(pad);
4022 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4023 if (SvPOK(pname[ix]))
4024 PerlIO_printf(Perl_debug_log,
4025 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4026 ix, PTR2UV(ppad[ix]),
4027 SvFAKE(pname[ix]) ? "FAKE " : "",
4029 (IV)I_32(SvNVX(pname[ix])),
4032 #endif /* DEBUGGING */
4036 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4041 AV* protopadlist = CvPADLIST(proto);
4042 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4043 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4044 SV** pname = AvARRAY(protopad_name);
4045 SV** ppad = AvARRAY(protopad);
4046 I32 fname = AvFILLp(protopad_name);
4047 I32 fpad = AvFILLp(protopad);
4051 assert(!CvUNIQUE(proto));
4054 SAVEVPTR(PL_curpad);
4055 SAVESPTR(PL_comppad);
4056 SAVESPTR(PL_comppad_name);
4057 SAVESPTR(PL_compcv);
4059 cv = PL_compcv = (CV*)NEWSV(1104,0);
4060 sv_upgrade((SV *)cv, SvTYPE(proto));
4066 New(666, CvMUTEXP(cv), 1, perl_mutex);
4067 MUTEX_INIT(CvMUTEXP(cv));
4069 #endif /* USE_THREADS */
4070 CvFILE(cv) = CvFILE(proto);
4071 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4072 CvSTASH(cv) = CvSTASH(proto);
4073 CvROOT(cv) = CvROOT(proto);
4074 CvSTART(cv) = CvSTART(proto);
4076 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4079 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4081 PL_comppad_name = newAV();
4082 for (ix = fname; ix >= 0; ix--)
4083 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4085 PL_comppad = newAV();
4087 comppadlist = newAV();
4088 AvREAL_off(comppadlist);
4089 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4090 av_store(comppadlist, 1, (SV*)PL_comppad);
4091 CvPADLIST(cv) = comppadlist;
4092 av_fill(PL_comppad, AvFILLp(protopad));
4093 PL_curpad = AvARRAY(PL_comppad);
4095 av = newAV(); /* will be @_ */
4097 av_store(PL_comppad, 0, (SV*)av);
4098 AvFLAGS(av) = AVf_REIFY;
4100 for (ix = fpad; ix > 0; ix--) {
4101 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4102 if (namesv && namesv != &PL_sv_undef) {
4103 char *name = SvPVX(namesv); /* XXX */
4104 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4105 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4106 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4108 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4110 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4112 else { /* our own lexical */
4115 /* anon code -- we'll come back for it */
4116 sv = SvREFCNT_inc(ppad[ix]);
4118 else if (*name == '@')
4120 else if (*name == '%')
4129 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4130 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4133 SV* sv = NEWSV(0,0);
4139 /* Now that vars are all in place, clone nested closures. */
4141 for (ix = fpad; ix > 0; ix--) {
4142 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4144 && namesv != &PL_sv_undef
4145 && !(SvFLAGS(namesv) & SVf_FAKE)
4146 && *SvPVX(namesv) == '&'
4147 && CvCLONE(ppad[ix]))
4149 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4150 SvREFCNT_dec(ppad[ix]);
4153 PL_curpad[ix] = (SV*)kid;
4157 #ifdef DEBUG_CLOSURES
4158 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4160 PerlIO_printf(Perl_debug_log, " from:\n");
4162 PerlIO_printf(Perl_debug_log, " to:\n");
4171 Perl_cv_clone(pTHX_ CV *proto)
4174 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4175 cv = cv_clone2(proto, CvOUTSIDE(proto));
4176 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4181 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4185 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_UNSAFE)) {
4186 SV* msg = sv_newmortal();
4190 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4191 sv_setpv(msg, "Prototype mismatch:");
4193 Perl_sv_catpvf(aTHX_ msg, " sub %_", name);
4195 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4196 sv_catpv(msg, " vs ");
4198 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4200 sv_catpv(msg, "none");
4201 Perl_warner(aTHX_ WARN_UNSAFE, "%_", msg);
4206 Perl_cv_const_sv(pTHX_ CV *cv)
4208 if (!cv || !SvPOK(cv) || SvCUR(cv))
4210 return op_const_sv(CvSTART(cv), cv);
4214 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4221 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4222 o = cLISTOPo->op_first->op_sibling;
4224 for (; o; o = o->op_next) {
4225 OPCODE type = o->op_type;
4227 if (sv && o->op_next == o)
4229 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4231 if (type == OP_LEAVESUB || type == OP_RETURN)
4235 if (type == OP_CONST && cSVOPo->op_sv)
4237 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4238 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4239 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4240 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4252 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4262 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4266 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4268 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4272 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4276 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4277 GV *gv = gv_fetchpv(name ? name : "__ANON__",
4278 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4280 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4291 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4292 maximum a prototype before. */
4293 if (SvTYPE(gv) > SVt_NULL) {
4294 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4295 && ckWARN_d(WARN_UNSAFE))
4297 Perl_warner(aTHX_ WARN_UNSAFE, "Runaway prototype");
4299 cv_ckproto((CV*)gv, NULL, ps);
4302 sv_setpv((SV*)gv, ps);
4304 sv_setiv((SV*)gv, -1);
4305 SvREFCNT_dec(PL_compcv);
4306 cv = PL_compcv = NULL;
4307 PL_sub_generation++;
4311 if (!name || GvCVGEN(gv))
4313 else if (cv = GvCV(gv)) {
4314 cv_ckproto(cv, gv, ps);
4315 /* already defined (or promised)? */
4316 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4318 bool const_changed = TRUE;
4319 if (!block && !attrs) {
4320 /* just a "sub foo;" when &foo is already defined */
4321 SAVEFREESV(PL_compcv);
4324 /* ahem, death to those who redefine active sort subs */
4325 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4326 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4329 if(const_sv = cv_const_sv(cv))
4330 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4331 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
4332 && !(CvGV(cv) && GvSTASH(CvGV(cv))
4333 && HvNAME(GvSTASH(CvGV(cv)))
4334 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
4336 line_t oldline = CopLINE(PL_curcop);
4337 CopLINE_set(PL_curcop, PL_copline);
4338 Perl_warner(aTHX_ WARN_REDEFINE,
4339 const_sv ? "Constant subroutine %s redefined"
4340 : "Subroutine %s redefined", name);
4341 CopLINE_set(PL_curcop, oldline);
4352 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4353 * before we clobber PL_compcv.
4357 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4358 stash = GvSTASH(CvGV(cv));
4359 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4360 stash = CvSTASH(cv);
4362 stash = PL_curstash;
4365 /* possibly about to re-define existing subr -- ignore old cv */
4366 rcv = (SV*)PL_compcv;
4367 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4368 stash = GvSTASH(gv);
4370 stash = PL_curstash;
4372 apply_attrs(stash, rcv, attrs);
4374 if (cv) { /* must reuse cv if autoloaded */
4376 /* got here with just attrs -- work done, so bug out */
4377 SAVEFREESV(PL_compcv);
4381 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4382 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4383 CvOUTSIDE(PL_compcv) = 0;
4384 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4385 CvPADLIST(PL_compcv) = 0;
4386 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4387 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4388 SvREFCNT_dec(PL_compcv);
4395 PL_sub_generation++;
4398 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4399 CvFILE(cv) = CopFILE(PL_curcop);
4400 CvSTASH(cv) = PL_curstash;
4403 if (!CvMUTEXP(cv)) {
4404 New(666, CvMUTEXP(cv), 1, perl_mutex);
4405 MUTEX_INIT(CvMUTEXP(cv));
4407 #endif /* USE_THREADS */
4410 sv_setpv((SV*)cv, ps);
4412 if (PL_error_count) {
4416 char *s = strrchr(name, ':');
4418 if (strEQ(s, "BEGIN")) {
4420 "BEGIN not safe after errors--compilation aborted";
4421 if (PL_in_eval & EVAL_KEEPERR)
4422 Perl_croak(aTHX_ not_safe);
4424 /* force display of errors found but not reported */
4425 sv_catpv(ERRSV, not_safe);
4426 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4433 PL_copline = NOLINE;
4438 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4439 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4442 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4445 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4447 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4448 OpREFCNT_set(CvROOT(cv), 1);
4449 CvSTART(cv) = LINKLIST(CvROOT(cv));
4450 CvROOT(cv)->op_next = 0;
4453 /* now that optimizer has done its work, adjust pad values */
4455 SV **namep = AvARRAY(PL_comppad_name);
4456 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4459 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4462 * The only things that a clonable function needs in its
4463 * pad are references to outer lexicals and anonymous subs.
4464 * The rest are created anew during cloning.
4466 if (!((namesv = namep[ix]) != Nullsv &&
4467 namesv != &PL_sv_undef &&
4469 *SvPVX(namesv) == '&')))
4471 SvREFCNT_dec(PL_curpad[ix]);
4472 PL_curpad[ix] = Nullsv;
4477 AV *av = newAV(); /* Will be @_ */
4479 av_store(PL_comppad, 0, (SV*)av);
4480 AvFLAGS(av) = AVf_REIFY;
4482 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4483 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4485 if (!SvPADMY(PL_curpad[ix]))
4486 SvPADTMP_on(PL_curpad[ix]);
4493 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4494 SV *sv = NEWSV(0,0);
4495 SV *tmpstr = sv_newmortal();
4496 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4500 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4502 (long)PL_subline, (long)CopLINE(PL_curcop));
4503 gv_efullname3(tmpstr, gv, Nullch);
4504 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4505 hv = GvHVn(db_postponed);
4506 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4507 && (cv = GvCV(db_postponed))) {
4512 call_sv((SV*)cv, G_DISCARD);
4516 if ((s = strrchr(name,':')))
4521 if (*s != 'B' && *s != 'E' && *s != 'S' && *s != 'I')
4524 if (strEQ(s, "BEGIN")) {
4525 I32 oldscope = PL_scopestack_ix;
4527 SAVECOPFILE(&PL_compiling);
4528 SAVECOPLINE(&PL_compiling);
4530 sv_setsv(PL_rs, PL_nrs);
4533 PL_beginav = newAV();
4534 DEBUG_x( dump_sub(gv) );
4535 av_push(PL_beginav, SvREFCNT_inc(cv));
4537 call_list(oldscope, PL_beginav);
4539 PL_curcop = &PL_compiling;
4540 PL_compiling.op_private = PL_hints;
4543 else if (strEQ(s, "END") && !PL_error_count) {
4546 DEBUG_x( dump_sub(gv) );
4547 av_unshift(PL_endav, 1);
4548 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4551 else if (strEQ(s, "STOP") && !PL_error_count) {
4553 PL_stopav = newAV();
4554 DEBUG_x( dump_sub(gv) );
4555 av_unshift(PL_stopav, 1);
4556 av_store(PL_stopav, 0, SvREFCNT_inc(cv));
4559 else if (strEQ(s, "INIT") && !PL_error_count) {
4561 PL_initav = newAV();
4562 DEBUG_x( dump_sub(gv) );
4563 av_push(PL_initav, SvREFCNT_inc(cv));
4569 PL_copline = NOLINE;
4574 /* XXX unsafe for threads if eval_owner isn't held */
4576 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4581 SAVECOPLINE(PL_curcop);
4584 CopLINE_set(PL_curcop, PL_copline);
4585 PL_hints &= ~HINT_BLOCK_SCOPE;
4588 SAVESPTR(PL_curstash);
4589 SAVECOPSTASH(PL_curcop);
4590 PL_curstash = stash;
4592 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4594 CopSTASH(PL_curcop) = stash;
4599 start_subparse(FALSE, 0),
4600 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4601 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4603 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4610 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4613 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4616 if (cv = (name ? GvCV(gv) : Nullcv)) {
4618 /* just a cached method */
4622 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4623 /* already defined (or promised) */
4624 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4625 && HvNAME(GvSTASH(CvGV(cv)))
4626 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4627 line_t oldline = CopLINE(PL_curcop);
4628 if (PL_copline != NOLINE)
4629 CopLINE_set(PL_curcop, PL_copline);
4630 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4631 CopLINE_set(PL_curcop, oldline);
4638 if (cv) /* must reuse cv if autoloaded */
4641 cv = (CV*)NEWSV(1105,0);
4642 sv_upgrade((SV *)cv, SVt_PVCV);
4646 PL_sub_generation++;
4649 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4651 New(666, CvMUTEXP(cv), 1, perl_mutex);
4652 MUTEX_INIT(CvMUTEXP(cv));
4654 #endif /* USE_THREADS */
4655 (void)gv_fetchfile(filename);
4656 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4657 an external constant string */
4658 CvXSUB(cv) = subaddr;
4661 char *s = strrchr(name,':');
4667 if (*s != 'B' && *s != 'E' && *s != 'S' && *s != 'I')
4670 if (strEQ(s, "BEGIN")) {
4672 PL_beginav = newAV();
4673 av_push(PL_beginav, SvREFCNT_inc(cv));
4676 else if (strEQ(s, "END")) {
4679 av_unshift(PL_endav, 1);
4680 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4683 else if (strEQ(s, "STOP")) {
4685 PL_stopav = newAV();
4686 av_unshift(PL_stopav, 1);
4687 av_store(PL_stopav, 0, SvREFCNT_inc(cv));
4690 else if (strEQ(s, "INIT")) {
4692 PL_initav = newAV();
4693 av_push(PL_initav, SvREFCNT_inc(cv));
4705 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4715 name = SvPVx(cSVOPo->op_sv, n_a);
4718 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4720 if (cv = GvFORM(gv)) {
4721 if (ckWARN(WARN_REDEFINE)) {
4722 line_t oldline = CopLINE(PL_curcop);
4724 CopLINE_set(PL_curcop, PL_copline);
4725 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4726 CopLINE_set(PL_curcop, oldline);
4732 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4733 CvFILE(cv) = CopFILE(PL_curcop);
4735 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4736 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4737 SvPADTMP_on(PL_curpad[ix]);
4740 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4741 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4742 OpREFCNT_set(CvROOT(cv), 1);
4743 CvSTART(cv) = LINKLIST(CvROOT(cv));
4744 CvROOT(cv)->op_next = 0;
4747 PL_copline = NOLINE;
4752 Perl_newANONLIST(pTHX_ OP *o)
4754 return newUNOP(OP_REFGEN, 0,
4755 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4759 Perl_newANONHASH(pTHX_ OP *o)
4761 return newUNOP(OP_REFGEN, 0,
4762 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4766 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4768 return newANONATTRSUB(floor, proto, Nullop, block);
4772 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4774 return newUNOP(OP_REFGEN, 0,
4775 newSVOP(OP_ANONCODE, 0,
4776 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4780 Perl_oopsAV(pTHX_ OP *o)
4782 switch (o->op_type) {
4784 o->op_type = OP_PADAV;
4785 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4786 return ref(o, OP_RV2AV);
4789 o->op_type = OP_RV2AV;
4790 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4795 if (ckWARN_d(WARN_INTERNAL))
4796 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4803 Perl_oopsHV(pTHX_ OP *o)
4807 switch (o->op_type) {
4810 o->op_type = OP_PADHV;
4811 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4812 return ref(o, OP_RV2HV);
4816 o->op_type = OP_RV2HV;
4817 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4822 if (ckWARN_d(WARN_INTERNAL))
4823 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
4830 Perl_newAVREF(pTHX_ OP *o)
4832 if (o->op_type == OP_PADANY) {
4833 o->op_type = OP_PADAV;
4834 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4837 return newUNOP(OP_RV2AV, 0, scalar(o));
4841 Perl_newGVREF(pTHX_ I32 type, OP *o)
4843 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4844 return newUNOP(OP_NULL, 0, o);
4845 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4849 Perl_newHVREF(pTHX_ OP *o)
4851 if (o->op_type == OP_PADANY) {
4852 o->op_type = OP_PADHV;
4853 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4856 return newUNOP(OP_RV2HV, 0, scalar(o));
4860 Perl_oopsCV(pTHX_ OP *o)
4862 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4868 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4870 return newUNOP(OP_RV2CV, flags, scalar(o));
4874 Perl_newSVREF(pTHX_ OP *o)
4876 if (o->op_type == OP_PADANY) {
4877 o->op_type = OP_PADSV;
4878 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4881 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4882 o->op_flags |= OPpDONE_SVREF;
4885 return newUNOP(OP_RV2SV, 0, scalar(o));
4888 /* Check routines. */
4891 Perl_ck_anoncode(pTHX_ OP *o)
4896 name = NEWSV(1106,0);
4897 sv_upgrade(name, SVt_PVNV);
4898 sv_setpvn(name, "&", 1);
4901 ix = pad_alloc(o->op_type, SVs_PADMY);
4902 av_store(PL_comppad_name, ix, name);
4903 av_store(PL_comppad, ix, cSVOPo->op_sv);
4904 SvPADMY_on(cSVOPo->op_sv);
4905 cSVOPo->op_sv = Nullsv;
4906 cSVOPo->op_targ = ix;
4911 Perl_ck_bitop(pTHX_ OP *o)
4913 o->op_private = PL_hints;
4918 Perl_ck_concat(pTHX_ OP *o)
4920 if (cUNOPo->op_first->op_type == OP_CONCAT)
4921 o->op_flags |= OPf_STACKED;
4926 Perl_ck_spair(pTHX_ OP *o)
4928 if (o->op_flags & OPf_KIDS) {
4931 OPCODE type = o->op_type;
4932 o = modkids(ck_fun(o), type);
4933 kid = cUNOPo->op_first;
4934 newop = kUNOP->op_first->op_sibling;
4936 (newop->op_sibling ||
4937 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4938 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4939 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4943 op_free(kUNOP->op_first);
4944 kUNOP->op_first = newop;
4946 o->op_ppaddr = PL_ppaddr[++o->op_type];
4951 Perl_ck_delete(pTHX_ OP *o)
4955 if (o->op_flags & OPf_KIDS) {
4956 OP *kid = cUNOPo->op_first;
4957 switch (kid->op_type) {
4959 o->op_flags |= OPf_SPECIAL;
4962 o->op_private |= OPpSLICE;
4965 o->op_flags |= OPf_SPECIAL;
4970 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
4971 PL_op_desc[o->op_type]);
4979 Perl_ck_eof(pTHX_ OP *o)
4981 I32 type = o->op_type;
4983 if (o->op_flags & OPf_KIDS) {
4984 if (cLISTOPo->op_first->op_type == OP_STUB) {
4986 o = newUNOP(type, OPf_SPECIAL,
4987 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4995 Perl_ck_eval(pTHX_ OP *o)
4997 PL_hints |= HINT_BLOCK_SCOPE;
4998 if (o->op_flags & OPf_KIDS) {
4999 SVOP *kid = (SVOP*)cUNOPo->op_first;
5002 o->op_flags &= ~OPf_KIDS;
5005 else if (kid->op_type == OP_LINESEQ) {
5008 kid->op_next = o->op_next;
5009 cUNOPo->op_first = 0;
5012 NewOp(1101, enter, 1, LOGOP);
5013 enter->op_type = OP_ENTERTRY;
5014 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5015 enter->op_private = 0;
5017 /* establish postfix order */
5018 enter->op_next = (OP*)enter;
5020 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5021 o->op_type = OP_LEAVETRY;
5022 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5023 enter->op_other = o;
5031 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5033 o->op_targ = (PADOFFSET)PL_hints;
5038 Perl_ck_exec(pTHX_ OP *o)
5041 if (o->op_flags & OPf_STACKED) {
5043 kid = cUNOPo->op_first->op_sibling;
5044 if (kid->op_type == OP_RV2GV)
5053 Perl_ck_exists(pTHX_ OP *o)
5056 if (o->op_flags & OPf_KIDS) {
5057 OP *kid = cUNOPo->op_first;
5058 if (kid->op_type == OP_ENTERSUB) {
5059 (void) ref(kid, o->op_type);
5060 if (kid->op_type != OP_RV2CV && !PL_error_count)
5061 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5062 PL_op_desc[o->op_type]);
5063 o->op_private |= OPpEXISTS_SUB;
5065 else if (kid->op_type == OP_AELEM)
5066 o->op_flags |= OPf_SPECIAL;
5067 else if (kid->op_type != OP_HELEM)
5068 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5069 PL_op_desc[o->op_type]);
5077 Perl_ck_gvconst(pTHX_ register OP *o)
5079 o = fold_constants(o);
5080 if (o->op_type == OP_CONST)
5087 Perl_ck_rvconst(pTHX_ register OP *o)
5090 SVOP *kid = (SVOP*)cUNOPo->op_first;
5092 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5093 if (kid->op_type == OP_CONST) {
5097 SV *kidsv = kid->op_sv;
5100 /* Is it a constant from cv_const_sv()? */
5101 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5102 SV *rsv = SvRV(kidsv);
5103 int svtype = SvTYPE(rsv);
5104 char *badtype = Nullch;
5106 switch (o->op_type) {
5108 if (svtype > SVt_PVMG)
5109 badtype = "a SCALAR";
5112 if (svtype != SVt_PVAV)
5113 badtype = "an ARRAY";
5116 if (svtype != SVt_PVHV) {
5117 if (svtype == SVt_PVAV) { /* pseudohash? */
5118 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5119 if (ksv && SvROK(*ksv)
5120 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5129 if (svtype != SVt_PVCV)
5134 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5137 name = SvPV(kidsv, n_a);
5138 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5139 char *badthing = Nullch;
5140 switch (o->op_type) {
5142 badthing = "a SCALAR";
5145 badthing = "an ARRAY";
5148 badthing = "a HASH";
5153 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5157 * This is a little tricky. We only want to add the symbol if we
5158 * didn't add it in the lexer. Otherwise we get duplicate strict
5159 * warnings. But if we didn't add it in the lexer, we must at
5160 * least pretend like we wanted to add it even if it existed before,
5161 * or we get possible typo warnings. OPpCONST_ENTERED says
5162 * whether the lexer already added THIS instance of this symbol.
5164 iscv = (o->op_type == OP_RV2CV) * 2;
5166 gv = gv_fetchpv(name,
5167 iscv | !(kid->op_private & OPpCONST_ENTERED),
5170 : o->op_type == OP_RV2SV
5172 : o->op_type == OP_RV2AV
5174 : o->op_type == OP_RV2HV
5177 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5179 kid->op_type = OP_GV;
5180 SvREFCNT_dec(kid->op_sv);
5182 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5183 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5185 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5187 kid->op_sv = SvREFCNT_inc(gv);
5189 kid->op_ppaddr = PL_ppaddr[OP_GV];
5196 Perl_ck_ftst(pTHX_ OP *o)
5199 I32 type = o->op_type;
5201 if (o->op_flags & OPf_REF) {
5204 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5205 SVOP *kid = (SVOP*)cUNOPo->op_first;
5207 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5209 OP *newop = newGVOP(type, OPf_REF,
5210 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5217 if (type == OP_FTTTY)
5218 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5221 o = newUNOP(type, 0, newDEFSVOP());
5224 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5226 if (PL_hints & HINT_LOCALE)
5227 o->op_private |= OPpLOCALE;
5234 Perl_ck_fun(pTHX_ OP *o)
5241 int type = o->op_type;
5242 register I32 oa = PL_opargs[type] >> OASHIFT;
5244 if (o->op_flags & OPf_STACKED) {
5245 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5248 return no_fh_allowed(o);
5251 if (o->op_flags & OPf_KIDS) {
5253 tokid = &cLISTOPo->op_first;
5254 kid = cLISTOPo->op_first;
5255 if (kid->op_type == OP_PUSHMARK ||
5256 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
5258 tokid = &kid->op_sibling;
5259 kid = kid->op_sibling;
5261 if (!kid && PL_opargs[type] & OA_DEFGV)
5262 *tokid = kid = newDEFSVOP();
5266 sibl = kid->op_sibling;
5269 /* list seen where single (scalar) arg expected? */
5270 if (numargs == 1 && !(oa >> 4)
5271 && kid->op_type == OP_LIST && type != OP_SCALAR)
5273 return too_many_arguments(o,PL_op_desc[type]);
5286 if (kid->op_type == OP_CONST &&
5287 (kid->op_private & OPpCONST_BARE))
5289 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5290 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5291 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5292 if (ckWARN(WARN_SYNTAX))
5293 Perl_warner(aTHX_ WARN_SYNTAX,
5294 "Array @%s missing the @ in argument %"IVdf" of %s()",
5295 name, (IV)numargs, PL_op_desc[type]);
5298 kid->op_sibling = sibl;
5301 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5302 bad_type(numargs, "array", PL_op_desc[type], kid);
5306 if (kid->op_type == OP_CONST &&
5307 (kid->op_private & OPpCONST_BARE))
5309 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5310 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5311 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5312 if (ckWARN(WARN_SYNTAX))
5313 Perl_warner(aTHX_ WARN_SYNTAX,
5314 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5315 name, (IV)numargs, PL_op_desc[type]);
5318 kid->op_sibling = sibl;
5321 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5322 bad_type(numargs, "hash", PL_op_desc[type], kid);
5327 OP *newop = newUNOP(OP_NULL, 0, kid);
5328 kid->op_sibling = 0;
5330 newop->op_next = newop;
5332 kid->op_sibling = sibl;
5337 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5338 if (kid->op_type == OP_CONST &&
5339 (kid->op_private & OPpCONST_BARE))
5341 OP *newop = newGVOP(OP_GV, 0,
5342 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5347 else if (kid->op_type == OP_READLINE) {
5348 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5349 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5352 I32 flags = OPf_SPECIAL;
5356 /* is this op a FH constructor? */
5357 if (is_handle_constructor(o,numargs)) {
5358 char *name = Nullch;
5362 /* Set a flag to tell rv2gv to vivify
5363 * need to "prove" flag does not mean something
5364 * else already - NI-S 1999/05/07
5367 if (kid->op_type == OP_PADSV) {
5368 SV **namep = av_fetch(PL_comppad_name,
5370 if (namep && *namep)
5371 name = SvPV(*namep, len);
5373 else if (kid->op_type == OP_RV2SV
5374 && kUNOP->op_first->op_type == OP_GV)
5376 GV *gv = cGVOPx_gv(kUNOP->op_first);
5378 len = GvNAMELEN(gv);
5382 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5383 namesv = PL_curpad[targ];
5384 SvUPGRADE(namesv, SVt_PV);
5386 sv_setpvn(namesv, "$", 1);
5387 sv_catpvn(namesv, name, len);
5390 kid->op_sibling = 0;
5391 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5392 kid->op_targ = targ;
5393 kid->op_private |= priv;
5395 kid->op_sibling = sibl;
5401 mod(scalar(kid), type);
5405 tokid = &kid->op_sibling;
5406 kid = kid->op_sibling;
5408 o->op_private |= numargs;
5410 return too_many_arguments(o,PL_op_desc[o->op_type]);
5413 else if (PL_opargs[type] & OA_DEFGV) {
5415 return newUNOP(type, 0, newDEFSVOP());
5419 while (oa & OA_OPTIONAL)
5421 if (oa && oa != OA_LIST)
5422 return too_few_arguments(o,PL_op_desc[o->op_type]);
5428 Perl_ck_glob(pTHX_ OP *o)
5432 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5433 append_elem(OP_GLOB, o, newDEFSVOP());
5435 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5436 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5438 #if !defined(PERL_EXTERNAL_GLOB)
5439 /* XXX this can be tightened up and made more failsafe. */
5441 OP *modname = newSVOP(OP_CONST, 0, newSVpvn("File::Glob", 10));
5442 modname->op_private |= OPpCONST_BARE;
5444 utilize(1, start_subparse(FALSE, 0), Nullop, modname,
5445 newSVOP(OP_CONST, 0, newSVpvn(":globally", 9)));
5446 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5449 #endif /* PERL_EXTERNAL_GLOB */
5451 if (gv && GvIMPORTED_CV(gv)) {
5452 append_elem(OP_GLOB, o,
5453 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5454 o->op_type = OP_LIST;
5455 o->op_ppaddr = PL_ppaddr[OP_LIST];
5456 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5457 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5458 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5459 append_elem(OP_LIST, o,
5460 scalar(newUNOP(OP_RV2CV, 0,
5461 newGVOP(OP_GV, 0, gv)))));
5462 o = newUNOP(OP_NULL, 0, ck_subr(o));
5463 o->op_targ = OP_GLOB; /* hint at what it used to be */
5466 gv = newGVgen("main");
5468 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5474 Perl_ck_grep(pTHX_ OP *o)
5478 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5480 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5481 NewOp(1101, gwop, 1, LOGOP);
5483 if (o->op_flags & OPf_STACKED) {
5486 kid = cLISTOPo->op_first->op_sibling;
5487 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5490 kid->op_next = (OP*)gwop;
5491 o->op_flags &= ~OPf_STACKED;
5493 kid = cLISTOPo->op_first->op_sibling;
5494 if (type == OP_MAPWHILE)
5501 kid = cLISTOPo->op_first->op_sibling;
5502 if (kid->op_type != OP_NULL)
5503 Perl_croak(aTHX_ "panic: ck_grep");
5504 kid = kUNOP->op_first;
5506 gwop->op_type = type;
5507 gwop->op_ppaddr = PL_ppaddr[type];
5508 gwop->op_first = listkids(o);
5509 gwop->op_flags |= OPf_KIDS;
5510 gwop->op_private = 1;
5511 gwop->op_other = LINKLIST(kid);
5512 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5513 kid->op_next = (OP*)gwop;
5515 kid = cLISTOPo->op_first->op_sibling;
5516 if (!kid || !kid->op_sibling)
5517 return too_few_arguments(o,PL_op_desc[o->op_type]);
5518 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5519 mod(kid, OP_GREPSTART);
5525 Perl_ck_index(pTHX_ OP *o)
5527 if (o->op_flags & OPf_KIDS) {
5528 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5530 kid = kid->op_sibling; /* get past "big" */
5531 if (kid && kid->op_type == OP_CONST)
5532 fbm_compile(((SVOP*)kid)->op_sv, 0);
5538 Perl_ck_lengthconst(pTHX_ OP *o)
5540 /* XXX length optimization goes here */
5545 Perl_ck_lfun(pTHX_ OP *o)
5547 OPCODE type = o->op_type;
5548 return modkids(ck_fun(o), type);
5552 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5555 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5556 switch (cUNOPo->op_first->op_type) {
5558 break; /* Globals via GV can be undef */
5560 case OP_AASSIGN: /* Is this a good idea? */
5561 Perl_warner(aTHX_ WARN_DEPRECATED,
5562 "defined(@array) is deprecated");
5563 Perl_warner(aTHX_ WARN_DEPRECATED,
5564 "(Maybe you should just omit the defined()?)\n");
5567 break; /* Globals via GV can be undef */
5569 Perl_warner(aTHX_ WARN_DEPRECATED,
5570 "defined(%hash) is deprecated");
5571 Perl_warner(aTHX_ WARN_DEPRECATED,
5572 "(Maybe you should just omit the defined()?)\n");
5583 Perl_ck_rfun(pTHX_ OP *o)
5585 OPCODE type = o->op_type;
5586 return refkids(ck_fun(o), type);
5590 Perl_ck_listiob(pTHX_ OP *o)
5594 kid = cLISTOPo->op_first;
5597 kid = cLISTOPo->op_first;
5599 if (kid->op_type == OP_PUSHMARK)
5600 kid = kid->op_sibling;
5601 if (kid && o->op_flags & OPf_STACKED)
5602 kid = kid->op_sibling;
5603 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5604 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5605 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5606 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5607 cLISTOPo->op_first->op_sibling = kid;
5608 cLISTOPo->op_last = kid;
5609 kid = kid->op_sibling;
5614 append_elem(o->op_type, o, newDEFSVOP());
5620 if (PL_hints & HINT_LOCALE)
5621 o->op_private |= OPpLOCALE;
5628 Perl_ck_fun_locale(pTHX_ OP *o)
5634 if (PL_hints & HINT_LOCALE)
5635 o->op_private |= OPpLOCALE;
5642 Perl_ck_sassign(pTHX_ OP *o)
5644 OP *kid = cLISTOPo->op_first;
5645 /* has a disposable target? */
5646 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5647 && !(kid->op_flags & OPf_STACKED))
5649 OP *kkid = kid->op_sibling;
5651 /* Can just relocate the target. */
5652 if (kkid && kkid->op_type == OP_PADSV
5653 && !(kkid->op_private & OPpLVAL_INTRO))
5655 kid->op_targ = kkid->op_targ;
5657 /* Now we do not need PADSV and SASSIGN. */
5658 kid->op_sibling = o->op_sibling; /* NULL */
5659 cLISTOPo->op_first = NULL;
5662 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5670 Perl_ck_scmp(pTHX_ OP *o)
5674 if (PL_hints & HINT_LOCALE)
5675 o->op_private |= OPpLOCALE;
5682 Perl_ck_match(pTHX_ OP *o)
5684 o->op_private |= OPpRUNTIME;
5689 Perl_ck_method(pTHX_ OP *o)
5691 OP *kid = cUNOPo->op_first;
5692 if (kid->op_type == OP_CONST) {
5693 SV* sv = kSVOP->op_sv;
5694 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5696 sv_upgrade(sv, SVt_PVIV);
5698 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5699 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5700 kSVOP->op_sv = Nullsv;
5709 Perl_ck_null(pTHX_ OP *o)
5715 Perl_ck_repeat(pTHX_ OP *o)
5717 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5718 o->op_private |= OPpREPEAT_DOLIST;
5719 cBINOPo->op_first = force_list(cBINOPo->op_first);
5727 Perl_ck_require(pTHX_ OP *o)
5729 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5730 SVOP *kid = (SVOP*)cUNOPo->op_first;
5732 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5734 for (s = SvPVX(kid->op_sv); *s; s++) {
5735 if (*s == ':' && s[1] == ':') {
5737 Move(s+2, s+1, strlen(s+2)+1, char);
5738 --SvCUR(kid->op_sv);
5741 sv_catpvn(kid->op_sv, ".pm", 3);
5749 Perl_ck_retarget(pTHX_ OP *o)
5751 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5758 Perl_ck_select(pTHX_ OP *o)
5761 if (o->op_flags & OPf_KIDS) {
5762 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5763 if (kid && kid->op_sibling) {
5764 o->op_type = OP_SSELECT;
5765 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5767 return fold_constants(o);
5771 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5772 if (kid && kid->op_type == OP_RV2GV)
5773 kid->op_private &= ~HINT_STRICT_REFS;
5778 Perl_ck_shift(pTHX_ OP *o)
5780 I32 type = o->op_type;
5782 if (!(o->op_flags & OPf_KIDS)) {
5787 if (!CvUNIQUE(PL_compcv)) {
5788 argop = newOP(OP_PADAV, OPf_REF);
5789 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5792 argop = newUNOP(OP_RV2AV, 0,
5793 scalar(newGVOP(OP_GV, 0,
5794 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5797 argop = newUNOP(OP_RV2AV, 0,
5798 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5799 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5800 #endif /* USE_THREADS */
5801 return newUNOP(type, 0, scalar(argop));
5803 return scalar(modkids(ck_fun(o), type));
5807 Perl_ck_sort(pTHX_ OP *o)
5811 if (PL_hints & HINT_LOCALE)
5812 o->op_private |= OPpLOCALE;
5815 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5817 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5818 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5820 kid = kUNOP->op_first; /* get past null */
5822 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5824 if (kid->op_type == OP_SCOPE) {
5828 else if (kid->op_type == OP_LEAVE) {
5829 if (o->op_type == OP_SORT) {
5830 null(kid); /* wipe out leave */
5833 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5834 if (k->op_next == kid)
5839 kid->op_next = 0; /* just disconnect the leave */
5840 k = kLISTOP->op_first;
5844 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5845 if (o->op_type == OP_SORT)
5849 o->op_flags |= OPf_SPECIAL;
5851 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5852 null(cLISTOPo->op_first->op_sibling);
5859 S_simplify_sort(pTHX_ OP *o)
5862 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5866 if (!(o->op_flags & OPf_STACKED))
5868 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5869 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5870 kid = kUNOP->op_first; /* get past null */
5871 if (kid->op_type != OP_SCOPE)
5873 kid = kLISTOP->op_last; /* get past scope */
5874 switch(kid->op_type) {
5882 k = kid; /* remember this node*/
5883 if (kBINOP->op_first->op_type != OP_RV2SV)
5885 kid = kBINOP->op_first; /* get past cmp */
5886 if (kUNOP->op_first->op_type != OP_GV)
5888 kid = kUNOP->op_first; /* get past rv2sv */
5890 if (GvSTASH(gv) != PL_curstash)
5892 if (strEQ(GvNAME(gv), "a"))
5894 else if(strEQ(GvNAME(gv), "b"))
5898 kid = k; /* back to cmp */
5899 if (kBINOP->op_last->op_type != OP_RV2SV)
5901 kid = kBINOP->op_last; /* down to 2nd arg */
5902 if (kUNOP->op_first->op_type != OP_GV)
5904 kid = kUNOP->op_first; /* get past rv2sv */
5906 if (GvSTASH(gv) != PL_curstash
5908 ? strNE(GvNAME(gv), "a")
5909 : strNE(GvNAME(gv), "b")))
5911 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5913 o->op_private |= OPpSORT_REVERSE;
5914 if (k->op_type == OP_NCMP)
5915 o->op_private |= OPpSORT_NUMERIC;
5916 if (k->op_type == OP_I_NCMP)
5917 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5918 kid = cLISTOPo->op_first->op_sibling;
5919 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
5920 op_free(kid); /* then delete it */
5921 cLISTOPo->op_children--;
5925 Perl_ck_split(pTHX_ OP *o)
5929 if (o->op_flags & OPf_STACKED)
5930 return no_fh_allowed(o);
5932 kid = cLISTOPo->op_first;
5933 if (kid->op_type != OP_NULL)
5934 Perl_croak(aTHX_ "panic: ck_split");
5935 kid = kid->op_sibling;
5936 op_free(cLISTOPo->op_first);
5937 cLISTOPo->op_first = kid;
5939 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5940 cLISTOPo->op_last = kid; /* There was only one element previously */
5943 if (kid->op_type != OP_MATCH) {
5944 OP *sibl = kid->op_sibling;
5945 kid->op_sibling = 0;
5946 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5947 if (cLISTOPo->op_first == cLISTOPo->op_last)
5948 cLISTOPo->op_last = kid;
5949 cLISTOPo->op_first = kid;
5950 kid->op_sibling = sibl;
5953 kid->op_type = OP_PUSHRE;
5954 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5957 if (!kid->op_sibling)
5958 append_elem(OP_SPLIT, o, newDEFSVOP());
5960 kid = kid->op_sibling;
5963 if (!kid->op_sibling)
5964 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5966 kid = kid->op_sibling;
5969 if (kid->op_sibling)
5970 return too_many_arguments(o,PL_op_desc[o->op_type]);
5976 Perl_ck_join(pTHX_ OP *o)
5978 if (ckWARN(WARN_SYNTAX)) {
5979 OP *kid = cLISTOPo->op_first->op_sibling;
5980 if (kid && kid->op_type == OP_MATCH) {
5981 char *pmstr = "STRING";
5982 if (kPMOP->op_pmregexp)
5983 pmstr = kPMOP->op_pmregexp->precomp;
5984 Perl_warner(aTHX_ WARN_SYNTAX,
5985 "/%s/ should probably be written as \"%s\"",
5993 Perl_ck_subr(pTHX_ OP *o)
5996 OP *prev = ((cUNOPo->op_first->op_sibling)
5997 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5998 OP *o2 = prev->op_sibling;
6007 o->op_private |= OPpENTERSUB_HASTARG;
6008 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6009 if (cvop->op_type == OP_RV2CV) {
6011 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6012 null(cvop); /* disable rv2cv */
6013 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6014 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6015 GV *gv = cGVOPx_gv(tmpop);
6018 tmpop->op_private |= OPpEARLY_CV;
6019 else if (SvPOK(cv)) {
6020 namegv = CvANON(cv) ? gv : CvGV(cv);
6021 proto = SvPV((SV*)cv, n_a);
6025 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6026 if (o2->op_type == OP_CONST)
6027 o2->op_private &= ~OPpCONST_STRICT;
6028 else if (o2->op_type == OP_LIST) {
6029 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6030 if (o && o->op_type == OP_CONST)
6031 o->op_private &= ~OPpCONST_STRICT;
6034 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6035 if (PERLDB_SUB && PL_curstash != PL_debstash)
6036 o->op_private |= OPpENTERSUB_DB;
6037 while (o2 != cvop) {
6041 return too_many_arguments(o, gv_ename(namegv));
6059 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6060 bad_type(arg, "block", gv_ename(namegv), o2);
6063 /* '*' allows any scalar type, including bareword */
6066 if (o2->op_type == OP_RV2GV)
6067 goto wrapref; /* autoconvert GLOB -> GLOBref */
6068 else if (o2->op_type == OP_CONST)
6069 o2->op_private &= ~OPpCONST_STRICT;
6070 else if (o2->op_type == OP_ENTERSUB) {
6071 /* accidental subroutine, revert to bareword */
6072 OP *gvop = ((UNOP*)o2)->op_first;
6073 if (gvop && gvop->op_type == OP_NULL) {
6074 gvop = ((UNOP*)gvop)->op_first;
6076 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6079 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6080 (gvop = ((UNOP*)gvop)->op_first) &&
6081 gvop->op_type == OP_GV)
6083 GV *gv = cGVOPx_gv(gvop);
6084 OP *sibling = o2->op_sibling;
6085 SV *n = newSVpvn("",0);
6087 gv_fullname3(n, gv, "");
6088 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6089 sv_chop(n, SvPVX(n)+6);
6090 o2 = newSVOP(OP_CONST, 0, n);
6091 prev->op_sibling = o2;
6092 o2->op_sibling = sibling;
6104 if (o2->op_type != OP_RV2GV)
6105 bad_type(arg, "symbol", gv_ename(namegv), o2);
6108 if (o2->op_type != OP_RV2CV)
6109 bad_type(arg, "sub", gv_ename(namegv), o2);
6112 if (o2->op_type != OP_RV2SV
6113 && o2->op_type != OP_PADSV
6114 && o2->op_type != OP_HELEM
6115 && o2->op_type != OP_AELEM
6116 && o2->op_type != OP_THREADSV)
6118 bad_type(arg, "scalar", gv_ename(namegv), o2);
6122 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6123 bad_type(arg, "array", gv_ename(namegv), o2);
6126 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6127 bad_type(arg, "hash", gv_ename(namegv), o2);
6131 OP* sib = kid->op_sibling;
6132 kid->op_sibling = 0;
6133 o2 = newUNOP(OP_REFGEN, 0, kid);
6134 o2->op_sibling = sib;
6135 prev->op_sibling = o2;
6146 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6147 gv_ename(namegv), SvPV((SV*)cv, n_a));
6152 mod(o2, OP_ENTERSUB);
6154 o2 = o2->op_sibling;
6156 if (proto && !optional &&
6157 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6158 return too_few_arguments(o, gv_ename(namegv));
6163 Perl_ck_svconst(pTHX_ OP *o)
6165 SvREADONLY_on(cSVOPo->op_sv);
6170 Perl_ck_trunc(pTHX_ OP *o)
6172 if (o->op_flags & OPf_KIDS) {
6173 SVOP *kid = (SVOP*)cUNOPo->op_first;
6175 if (kid->op_type == OP_NULL)
6176 kid = (SVOP*)kid->op_sibling;
6177 if (kid && kid->op_type == OP_CONST &&
6178 (kid->op_private & OPpCONST_BARE))
6180 o->op_flags |= OPf_SPECIAL;
6181 kid->op_private &= ~OPpCONST_STRICT;
6187 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6190 Perl_peep(pTHX_ register OP *o)
6193 register OP* oldop = 0;
6195 OP *last_composite = Nullop;
6197 if (!o || o->op_seq)
6201 SAVEVPTR(PL_curcop);
6202 for (; o; o = o->op_next) {
6208 switch (o->op_type) {
6212 PL_curcop = ((COP*)o); /* for warnings */
6213 o->op_seq = PL_op_seqmax++;
6214 last_composite = Nullop;
6218 if (cSVOPo->op_private & OPpCONST_STRICT)
6219 no_bareword_allowed(o);
6221 /* Relocate sv to the pad for thread safety.
6222 * Despite being a "constant", the SV is written to,
6223 * for reference counts, sv_upgrade() etc. */
6225 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6226 SvREFCNT_dec(PL_curpad[ix]);
6227 SvPADTMP_on(cSVOPo->op_sv);
6228 PL_curpad[ix] = cSVOPo->op_sv;
6229 cSVOPo->op_sv = Nullsv;
6241 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6242 if (o->op_next->op_private & OPpTARGET_MY) {
6243 if (o->op_flags & OPf_STACKED) /* chained concats */
6244 goto ignore_optimization;
6246 o->op_targ = o->op_next->op_targ;
6247 o->op_next->op_targ = 0;
6248 o->op_private |= OPpTARGET_MY;
6253 ignore_optimization:
6254 o->op_seq = PL_op_seqmax++;
6257 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6258 o->op_seq = PL_op_seqmax++;
6259 break; /* Scalar stub must produce undef. List stub is noop */
6263 if (o->op_targ == OP_NEXTSTATE
6264 || o->op_targ == OP_DBSTATE
6265 || o->op_targ == OP_SETSTATE)
6267 PL_curcop = ((COP*)o);
6274 if (oldop && o->op_next) {
6275 oldop->op_next = o->op_next;
6278 o->op_seq = PL_op_seqmax++;
6282 if (o->op_next->op_type == OP_RV2SV) {
6283 if (!(o->op_next->op_private & OPpDEREF)) {
6285 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
6286 o->op_next = o->op_next->op_next;
6287 o->op_type = OP_GVSV;
6288 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6291 else if (o->op_next->op_type == OP_RV2AV) {
6292 OP* pop = o->op_next->op_next;
6294 if (pop->op_type == OP_CONST &&
6295 (PL_op = pop->op_next) &&
6296 pop->op_next->op_type == OP_AELEM &&
6297 !(pop->op_next->op_private &
6298 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6299 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6307 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6308 o->op_next = pop->op_next->op_next;
6309 o->op_type = OP_AELEMFAST;
6310 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6311 o->op_private = (U8)i;
6316 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_UNSAFE)) {
6318 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6319 /* XXX could check prototype here instead of just carping */
6320 SV *sv = sv_newmortal();
6321 gv_efullname3(sv, gv, Nullch);
6322 Perl_warner(aTHX_ WARN_UNSAFE,
6323 "%s() called too early to check prototype",
6328 o->op_seq = PL_op_seqmax++;
6339 o->op_seq = PL_op_seqmax++;
6340 while (cLOGOP->op_other->op_type == OP_NULL)
6341 cLOGOP->op_other = cLOGOP->op_other->op_next;
6342 peep(cLOGOP->op_other);
6346 o->op_seq = PL_op_seqmax++;
6347 peep(cLOOP->op_redoop);
6348 peep(cLOOP->op_nextop);
6349 peep(cLOOP->op_lastop);
6355 o->op_seq = PL_op_seqmax++;
6356 peep(cPMOP->op_pmreplstart);
6360 o->op_seq = PL_op_seqmax++;
6361 if (ckWARN(WARN_SYNTAX) && o->op_next
6362 && o->op_next->op_type == OP_NEXTSTATE) {
6363 if (o->op_next->op_sibling &&
6364 o->op_next->op_sibling->op_type != OP_EXIT &&
6365 o->op_next->op_sibling->op_type != OP_WARN &&
6366 o->op_next->op_sibling->op_type != OP_DIE) {
6367 line_t oldline = CopLINE(PL_curcop);
6369 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6370 Perl_warner(aTHX_ WARN_SYNTAX, "Statement unlikely to be reached");
6371 Perl_warner(aTHX_ WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
6372 CopLINE_set(PL_curcop, oldline);
6386 if ((o->op_private & (OPpLVAL_INTRO))
6387 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6389 rop = (UNOP*)((BINOP*)o)->op_first;
6390 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6392 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6393 if (!SvOBJECT(lexname))
6395 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6396 if (!fields || !GvHV(*fields))
6398 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6399 key = SvPV(*svp, keylen);
6400 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6402 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6403 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6405 ind = SvIV(*indsvp);
6407 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6408 rop->op_type = OP_RV2AV;
6409 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6410 o->op_type = OP_AELEM;
6411 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6413 *svp = newSViv(ind);
6419 if (!(o->op_flags & OPf_WANT)
6420 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6424 o->op_seq = PL_op_seqmax++;
6428 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6429 o->op_seq = PL_op_seqmax++;
6435 if (last_composite) {
6436 OP *r = last_composite;
6438 while (r->op_sibling)
6441 || (r->op_next->op_type == OP_LIST
6442 && r->op_next->op_next == o))
6444 if (last_composite->op_type == OP_RV2AV)
6445 yyerror("Lvalue subs returning arrays not implemented yet");
6447 yyerror("Lvalue subs returning hashes not implemented yet");
6454 o->op_seq = PL_op_seqmax++;