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);
2011 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
2013 PL_comppad_name_fill = PL_comppad_name_floor;
2014 if (PL_comppad_name_floor < 0)
2015 PL_comppad_name_floor = 0;
2016 SAVEI32(PL_min_intro_pending);
2017 SAVEI32(PL_max_intro_pending);
2018 PL_min_intro_pending = 0;
2019 SAVEI32(PL_comppad_name_fill);
2020 SAVEI32(PL_padix_floor);
2021 PL_padix_floor = PL_padix;
2022 PL_pad_reset_pending = FALSE;
2024 PL_hints &= ~HINT_BLOCK_SCOPE;
2025 SAVESPTR(PL_compiling.cop_warnings);
2026 if (! specialWARN(PL_compiling.cop_warnings)) {
2027 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2028 SAVEFREESV(PL_compiling.cop_warnings) ;
2034 Perl_block_end(pTHX_ I32 floor, OP *seq)
2037 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2038 OP* retval = scalarseq(seq);
2040 PL_pad_reset_pending = FALSE;
2041 PL_compiling.op_private = PL_hints;
2043 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2044 pad_leavemy(PL_comppad_name_fill);
2053 OP *o = newOP(OP_THREADSV, 0);
2054 o->op_targ = find_threadsv("_");
2057 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2058 #endif /* USE_THREADS */
2062 Perl_newPROG(pTHX_ OP *o)
2068 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2069 ((PL_in_eval & EVAL_KEEPERR)
2070 ? OPf_SPECIAL : 0), o);
2071 PL_eval_start = linklist(PL_eval_root);
2072 PL_eval_root->op_private |= OPpREFCOUNTED;
2073 OpREFCNT_set(PL_eval_root, 1);
2074 PL_eval_root->op_next = 0;
2075 peep(PL_eval_start);
2080 PL_main_root = scope(sawparens(scalarvoid(o)));
2081 PL_curcop = &PL_compiling;
2082 PL_main_start = LINKLIST(PL_main_root);
2083 PL_main_root->op_private |= OPpREFCOUNTED;
2084 OpREFCNT_set(PL_main_root, 1);
2085 PL_main_root->op_next = 0;
2086 peep(PL_main_start);
2089 /* Register with debugger */
2091 CV *cv = get_cv("DB::postponed", FALSE);
2095 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2097 call_sv((SV*)cv, G_DISCARD);
2104 Perl_localize(pTHX_ OP *o, I32 lex)
2106 if (o->op_flags & OPf_PARENS)
2110 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2112 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2113 if (*s == ';' || *s == '=')
2114 Perl_warner(aTHX_ WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
2115 lex ? "my" : "local");
2119 PL_in_my_stash = Nullhv;
2123 return mod(o, OP_NULL); /* a bit kludgey */
2127 Perl_jmaybe(pTHX_ OP *o)
2129 if (o->op_type == OP_LIST) {
2132 o2 = newOP(OP_THREADSV, 0);
2133 o2->op_targ = find_threadsv(";");
2135 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2136 #endif /* USE_THREADS */
2137 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2143 Perl_fold_constants(pTHX_ register OP *o)
2147 I32 type = o->op_type;
2150 if (PL_opargs[type] & OA_RETSCALAR)
2152 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2153 o->op_targ = pad_alloc(type, SVs_PADTMP);
2155 /* integerize op, unless it happens to be C<-foo>.
2156 * XXX should pp_i_negate() do magic string negation instead? */
2157 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2158 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2159 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2161 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2164 if (!(PL_opargs[type] & OA_FOLDCONST))
2169 /* XXX might want a ck_negate() for this */
2170 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2183 if (o->op_private & OPpLOCALE)
2188 goto nope; /* Don't try to run w/ errors */
2190 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2191 if ((curop->op_type != OP_CONST ||
2192 (curop->op_private & OPpCONST_BARE)) &&
2193 curop->op_type != OP_LIST &&
2194 curop->op_type != OP_SCALAR &&
2195 curop->op_type != OP_NULL &&
2196 curop->op_type != OP_PUSHMARK)
2202 curop = LINKLIST(o);
2206 sv = *(PL_stack_sp--);
2207 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2208 pad_swipe(o->op_targ);
2209 else if (SvTEMP(sv)) { /* grab mortal temp? */
2210 (void)SvREFCNT_inc(sv);
2214 if (type == OP_RV2GV)
2215 return newGVOP(OP_GV, 0, (GV*)sv);
2217 /* try to smush double to int, but don't smush -2.0 to -2 */
2218 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2222 if ((NV)iv == SvNV(sv)) {
2227 SvIOK_off(sv); /* undo SvIV() damage */
2229 return newSVOP(OP_CONST, 0, sv);
2233 if (!(PL_opargs[type] & OA_OTHERINT))
2236 if (!(PL_hints & HINT_INTEGER)) {
2237 if (type == OP_MODULO
2238 || type == OP_DIVIDE
2239 || !(o->op_flags & OPf_KIDS))
2244 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2245 if (curop->op_type == OP_CONST) {
2246 if (SvIOK(((SVOP*)curop)->op_sv))
2250 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2254 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2261 Perl_gen_constant_list(pTHX_ register OP *o)
2265 I32 oldtmps_floor = PL_tmps_floor;
2269 return o; /* Don't attempt to run with errors */
2271 PL_op = curop = LINKLIST(o);
2278 PL_tmps_floor = oldtmps_floor;
2280 o->op_type = OP_RV2AV;
2281 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2282 curop = ((UNOP*)o)->op_first;
2283 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2290 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2295 if (!o || o->op_type != OP_LIST)
2296 o = newLISTOP(OP_LIST, 0, o, Nullop);
2298 o->op_flags &= ~OPf_WANT;
2300 if (!(PL_opargs[type] & OA_MARK))
2301 null(cLISTOPo->op_first);
2304 o->op_ppaddr = PL_ppaddr[type];
2305 o->op_flags |= flags;
2307 o = CHECKOP(type, o);
2308 if (o->op_type != type)
2311 if (cLISTOPo->op_children < 7) {
2312 /* XXX do we really need to do this if we're done appending?? */
2313 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2315 cLISTOPo->op_last = last; /* in case check substituted last arg */
2318 return fold_constants(o);
2321 /* List constructors */
2324 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2332 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
2333 return newLISTOP(type, 0, first, last);
2335 if (first->op_flags & OPf_KIDS)
2336 ((LISTOP*)first)->op_last->op_sibling = last;
2338 first->op_flags |= OPf_KIDS;
2339 ((LISTOP*)first)->op_first = last;
2341 ((LISTOP*)first)->op_last = last;
2342 ((LISTOP*)first)->op_children++;
2347 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2355 if (first->op_type != type)
2356 return prepend_elem(type, (OP*)first, (OP*)last);
2358 if (last->op_type != type)
2359 return append_elem(type, (OP*)first, (OP*)last);
2361 first->op_last->op_sibling = last->op_first;
2362 first->op_last = last->op_last;
2363 first->op_children += last->op_children;
2364 if (first->op_children)
2365 first->op_flags |= OPf_KIDS;
2367 #ifdef PL_OP_SLAB_ALLOC
2375 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2383 if (last->op_type == type) {
2384 if (type == OP_LIST) { /* already a PUSHMARK there */
2385 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2386 ((LISTOP*)last)->op_first->op_sibling = first;
2389 if (!(last->op_flags & OPf_KIDS)) {
2390 ((LISTOP*)last)->op_last = first;
2391 last->op_flags |= OPf_KIDS;
2393 first->op_sibling = ((LISTOP*)last)->op_first;
2394 ((LISTOP*)last)->op_first = first;
2396 ((LISTOP*)last)->op_children++;
2400 return newLISTOP(type, 0, first, last);
2406 Perl_newNULLLIST(pTHX)
2408 return newOP(OP_STUB, 0);
2412 Perl_force_list(pTHX_ OP *o)
2414 if (!o || o->op_type != OP_LIST)
2415 o = newLISTOP(OP_LIST, 0, o, Nullop);
2421 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2425 NewOp(1101, listop, 1, LISTOP);
2427 listop->op_type = type;
2428 listop->op_ppaddr = PL_ppaddr[type];
2429 listop->op_children = (first != 0) + (last != 0);
2430 listop->op_flags = flags;
2434 else if (!first && last)
2437 first->op_sibling = last;
2438 listop->op_first = first;
2439 listop->op_last = last;
2440 if (type == OP_LIST) {
2442 pushop = newOP(OP_PUSHMARK, 0);
2443 pushop->op_sibling = first;
2444 listop->op_first = pushop;
2445 listop->op_flags |= OPf_KIDS;
2447 listop->op_last = pushop;
2449 else if (listop->op_children)
2450 listop->op_flags |= OPf_KIDS;
2456 Perl_newOP(pTHX_ I32 type, I32 flags)
2459 NewOp(1101, o, 1, OP);
2461 o->op_ppaddr = PL_ppaddr[type];
2462 o->op_flags = flags;
2465 o->op_private = 0 + (flags >> 8);
2466 if (PL_opargs[type] & OA_RETSCALAR)
2468 if (PL_opargs[type] & OA_TARGET)
2469 o->op_targ = pad_alloc(type, SVs_PADTMP);
2470 return CHECKOP(type, o);
2474 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2479 first = newOP(OP_STUB, 0);
2480 if (PL_opargs[type] & OA_MARK)
2481 first = force_list(first);
2483 NewOp(1101, unop, 1, UNOP);
2484 unop->op_type = type;
2485 unop->op_ppaddr = PL_ppaddr[type];
2486 unop->op_first = first;
2487 unop->op_flags = flags | OPf_KIDS;
2488 unop->op_private = 1 | (flags >> 8);
2489 unop = (UNOP*) CHECKOP(type, unop);
2493 return fold_constants((OP *) unop);
2497 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2500 NewOp(1101, binop, 1, BINOP);
2503 first = newOP(OP_NULL, 0);
2505 binop->op_type = type;
2506 binop->op_ppaddr = PL_ppaddr[type];
2507 binop->op_first = first;
2508 binop->op_flags = flags | OPf_KIDS;
2511 binop->op_private = 1 | (flags >> 8);
2514 binop->op_private = 2 | (flags >> 8);
2515 first->op_sibling = last;
2518 binop = (BINOP*)CHECKOP(type, binop);
2519 if (binop->op_next || binop->op_type != type)
2522 binop->op_last = binop->op_first->op_sibling;
2524 return fold_constants((OP *)binop);
2528 utf8compare(const void *a, const void *b)
2531 for (i = 0; i < 10; i++) {
2532 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2534 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2541 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2543 SV *tstr = ((SVOP*)expr)->op_sv;
2544 SV *rstr = ((SVOP*)repl)->op_sv;
2547 register U8 *t = (U8*)SvPV(tstr, tlen);
2548 register U8 *r = (U8*)SvPV(rstr, rlen);
2554 register short *tbl;
2556 complement = o->op_private & OPpTRANS_COMPLEMENT;
2557 del = o->op_private & OPpTRANS_DELETE;
2558 squash = o->op_private & OPpTRANS_SQUASH;
2560 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2561 SV* listsv = newSVpvn("# comment\n",10);
2563 U8* tend = t + tlen;
2564 U8* rend = r + rlen;
2580 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2581 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2587 New(1109, cp, tlen, U8*);
2589 transv = newSVpvn("",0);
2598 qsort(cp, i, sizeof(U8*), utf8compare);
2599 for (j = 0; j < i; j++) {
2601 UV val = utf8_to_uv(s, &ulen);
2603 diff = val - nextmin;
2605 t = uv_to_utf8(tmpbuf,nextmin);
2606 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2608 t = uv_to_utf8(tmpbuf, val - 1);
2609 sv_catpvn(transv, "\377", 1);
2610 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2614 val = utf8_to_uv(s+1, &ulen);
2618 t = uv_to_utf8(tmpbuf,nextmin);
2619 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2620 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2621 sv_catpvn(transv, "\377", 1);
2622 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2623 t = (U8*)SvPVX(transv);
2624 tlen = SvCUR(transv);
2627 else if (!rlen && !del) {
2628 r = t; rlen = tlen; rend = tend;
2631 if (to_utf && from_utf) { /* only counting characters */
2632 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2633 o->op_private |= OPpTRANS_IDENTICAL;
2635 else { /* straight latin-1 translation */
2636 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2637 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2638 o->op_private |= OPpTRANS_IDENTICAL;
2642 while (t < tend || tfirst <= tlast) {
2643 /* see if we need more "t" chars */
2644 if (tfirst > tlast) {
2645 tfirst = (I32)utf8_to_uv(t, &ulen);
2647 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2648 tlast = (I32)utf8_to_uv(++t, &ulen);
2655 /* now see if we need more "r" chars */
2656 if (rfirst > rlast) {
2658 rfirst = (I32)utf8_to_uv(r, &ulen);
2660 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2661 rlast = (I32)utf8_to_uv(++r, &ulen);
2670 rfirst = rlast = 0xffffffff;
2674 /* now see which range will peter our first, if either. */
2675 tdiff = tlast - tfirst;
2676 rdiff = rlast - rfirst;
2683 if (rfirst == 0xffffffff) {
2684 diff = tdiff; /* oops, pretend rdiff is infinite */
2686 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2687 (long)tfirst, (long)tlast);
2689 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2693 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2694 (long)tfirst, (long)(tfirst + diff),
2697 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2698 (long)tfirst, (long)rfirst);
2700 if (rfirst + diff > max)
2701 max = rfirst + diff;
2706 else if (rfirst <= 0x800)
2707 grows |= (tfirst < 0x80);
2708 else if (rfirst <= 0x10000)
2709 grows |= (tfirst < 0x800);
2710 else if (rfirst <= 0x200000)
2711 grows |= (tfirst < 0x10000);
2712 else if (rfirst <= 0x4000000)
2713 grows |= (tfirst < 0x200000);
2714 else if (rfirst <= 0x80000000)
2715 grows |= (tfirst < 0x4000000);
2727 else if (max > 0xff)
2732 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2733 SvREFCNT_dec(listsv);
2735 SvREFCNT_dec(transv);
2737 if (!del && havefinal)
2738 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2740 if (grows && to_utf)
2741 o->op_private |= OPpTRANS_GROWS;
2748 tbl = (short*)cPVOPo->op_pv;
2750 Zero(tbl, 256, short);
2751 for (i = 0; i < tlen; i++)
2753 for (i = 0, j = 0; i < 256; i++) {
2769 if (!rlen && !del) {
2772 o->op_private |= OPpTRANS_IDENTICAL;
2774 for (i = 0; i < 256; i++)
2776 for (i = 0, j = 0; i < tlen; i++,j++) {
2779 if (tbl[t[i]] == -1)
2785 if (tbl[t[i]] == -1)
2796 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2801 NewOp(1101, pmop, 1, PMOP);
2802 pmop->op_type = type;
2803 pmop->op_ppaddr = PL_ppaddr[type];
2804 pmop->op_flags = flags;
2805 pmop->op_private = 0 | (flags >> 8);
2807 if (PL_hints & HINT_RE_TAINT)
2808 pmop->op_pmpermflags |= PMf_RETAINT;
2809 if (PL_hints & HINT_LOCALE)
2810 pmop->op_pmpermflags |= PMf_LOCALE;
2811 pmop->op_pmflags = pmop->op_pmpermflags;
2813 /* link into pm list */
2814 if (type != OP_TRANS && PL_curstash) {
2815 pmop->op_pmnext = HvPMROOT(PL_curstash);
2816 HvPMROOT(PL_curstash) = pmop;
2823 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2828 I32 repl_has_vars = 0;
2830 if (o->op_type == OP_TRANS)
2831 return pmtrans(o, expr, repl);
2833 PL_hints |= HINT_BLOCK_SCOPE;
2836 if (expr->op_type == OP_CONST) {
2838 SV *pat = ((SVOP*)expr)->op_sv;
2839 char *p = SvPV(pat, plen);
2840 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2841 sv_setpvn(pat, "\\s+", 3);
2842 p = SvPV(pat, plen);
2843 pm->op_pmflags |= PMf_SKIPWHITE;
2845 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2846 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2847 pm->op_pmflags |= PMf_WHITE;
2851 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2852 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2854 : OP_REGCMAYBE),0,expr);
2856 NewOp(1101, rcop, 1, LOGOP);
2857 rcop->op_type = OP_REGCOMP;
2858 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2859 rcop->op_first = scalar(expr);
2860 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2861 ? (OPf_SPECIAL | OPf_KIDS)
2863 rcop->op_private = 1;
2866 /* establish postfix order */
2867 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2869 rcop->op_next = expr;
2870 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2873 rcop->op_next = LINKLIST(expr);
2874 expr->op_next = (OP*)rcop;
2877 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2882 if (pm->op_pmflags & PMf_EVAL) {
2884 if (CopLINE(PL_curcop) < PL_multi_end)
2885 CopLINE_set(PL_curcop, PL_multi_end);
2888 else if (repl->op_type == OP_THREADSV
2889 && strchr("&`'123456789+",
2890 PL_threadsv_names[repl->op_targ]))
2894 #endif /* USE_THREADS */
2895 else if (repl->op_type == OP_CONST)
2899 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2900 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2902 if (curop->op_type == OP_THREADSV) {
2904 if (strchr("&`'123456789+", curop->op_private))
2908 if (curop->op_type == OP_GV) {
2909 GV *gv = cGVOPx_gv(curop);
2911 if (strchr("&`'123456789+", *GvENAME(gv)))
2914 #endif /* USE_THREADS */
2915 else if (curop->op_type == OP_RV2CV)
2917 else if (curop->op_type == OP_RV2SV ||
2918 curop->op_type == OP_RV2AV ||
2919 curop->op_type == OP_RV2HV ||
2920 curop->op_type == OP_RV2GV) {
2921 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2924 else if (curop->op_type == OP_PADSV ||
2925 curop->op_type == OP_PADAV ||
2926 curop->op_type == OP_PADHV ||
2927 curop->op_type == OP_PADANY) {
2930 else if (curop->op_type == OP_PUSHRE)
2931 ; /* Okay here, dangerous in newASSIGNOP */
2940 && (!pm->op_pmregexp
2941 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2942 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2943 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2944 prepend_elem(o->op_type, scalar(repl), o);
2947 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2948 pm->op_pmflags |= PMf_MAYBE_CONST;
2949 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2951 NewOp(1101, rcop, 1, LOGOP);
2952 rcop->op_type = OP_SUBSTCONT;
2953 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2954 rcop->op_first = scalar(repl);
2955 rcop->op_flags |= OPf_KIDS;
2956 rcop->op_private = 1;
2959 /* establish postfix order */
2960 rcop->op_next = LINKLIST(repl);
2961 repl->op_next = (OP*)rcop;
2963 pm->op_pmreplroot = scalar((OP*)rcop);
2964 pm->op_pmreplstart = LINKLIST(rcop);
2973 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2976 NewOp(1101, svop, 1, SVOP);
2977 svop->op_type = type;
2978 svop->op_ppaddr = PL_ppaddr[type];
2980 svop->op_next = (OP*)svop;
2981 svop->op_flags = flags;
2982 if (PL_opargs[type] & OA_RETSCALAR)
2984 if (PL_opargs[type] & OA_TARGET)
2985 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2986 return CHECKOP(type, svop);
2990 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
2993 NewOp(1101, padop, 1, PADOP);
2994 padop->op_type = type;
2995 padop->op_ppaddr = PL_ppaddr[type];
2996 padop->op_padix = pad_alloc(type, SVs_PADTMP);
2997 SvREFCNT_dec(PL_curpad[padop->op_padix]);
2998 PL_curpad[padop->op_padix] = sv;
3000 padop->op_next = (OP*)padop;
3001 padop->op_flags = flags;
3002 if (PL_opargs[type] & OA_RETSCALAR)
3004 if (PL_opargs[type] & OA_TARGET)
3005 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3006 return CHECKOP(type, padop);
3010 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3015 return newPADOP(type, flags, SvREFCNT_inc(gv));
3017 return newSVOP(type, flags, SvREFCNT_inc(gv));
3022 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3025 NewOp(1101, pvop, 1, PVOP);
3026 pvop->op_type = type;
3027 pvop->op_ppaddr = PL_ppaddr[type];
3029 pvop->op_next = (OP*)pvop;
3030 pvop->op_flags = flags;
3031 if (PL_opargs[type] & OA_RETSCALAR)
3033 if (PL_opargs[type] & OA_TARGET)
3034 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3035 return CHECKOP(type, pvop);
3039 Perl_package(pTHX_ OP *o)
3044 save_hptr(&PL_curstash);
3045 save_item(PL_curstname);
3050 name = SvPV(sv, len);
3051 PL_curstash = gv_stashpvn(name,len,TRUE);
3052 sv_setpvn(PL_curstname, name, len);
3056 sv_setpv(PL_curstname,"<none>");
3057 PL_curstash = Nullhv;
3059 PL_hints |= HINT_BLOCK_SCOPE;
3060 PL_copline = NOLINE;
3065 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3074 if (id->op_type != OP_CONST)
3075 Perl_croak(aTHX_ "Module name must be constant");
3079 if(version != Nullop) {
3080 SV *vesv = ((SVOP*)version)->op_sv;
3082 if (arg == Nullop && !SvNIOK(vesv)) {
3088 if (version->op_type != OP_CONST || !SvNIOK(vesv))
3089 Perl_croak(aTHX_ "Version number must be constant number");
3091 /* Make copy of id so we don't free it twice */
3092 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3094 /* Fake up a method call to VERSION */
3095 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3096 append_elem(OP_LIST,
3097 prepend_elem(OP_LIST, pack, list(version)),
3098 newSVOP(OP_METHOD_NAMED, 0,
3099 newSVpvn("VERSION", 7))));
3103 /* Fake up an import/unimport */
3104 if (arg && arg->op_type == OP_STUB)
3105 imop = arg; /* no import on explicit () */
3106 else if(SvNIOK(((SVOP*)id)->op_sv)) {
3107 imop = Nullop; /* use 5.0; */
3110 /* Make copy of id so we don't free it twice */
3111 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3112 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3113 append_elem(OP_LIST,
3114 prepend_elem(OP_LIST, pack, list(arg)),
3115 newSVOP(OP_METHOD_NAMED, 0,
3116 aver ? newSVpvn("import", 6)
3117 : newSVpvn("unimport", 8))));
3120 /* Fake up a require, handle override, if any */
3121 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3122 if (!(gv && GvIMPORTED_CV(gv)))
3123 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3125 if (gv && GvIMPORTED_CV(gv)) {
3126 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3127 append_elem(OP_LIST, id,
3128 scalar(newUNOP(OP_RV2CV, 0,
3133 rqop = newUNOP(OP_REQUIRE, 0, id);
3136 /* Fake up the BEGIN {}, which does its thing immediately. */
3138 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3141 append_elem(OP_LINESEQ,
3142 append_elem(OP_LINESEQ,
3143 newSTATEOP(0, Nullch, rqop),
3144 newSTATEOP(0, Nullch, veop)),
3145 newSTATEOP(0, Nullch, imop) ));
3147 PL_hints |= HINT_BLOCK_SCOPE;
3148 PL_copline = NOLINE;
3153 Perl_dofile(pTHX_ OP *term)
3158 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3159 if (!(gv && GvIMPORTED_CV(gv)))
3160 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3162 if (gv && GvIMPORTED_CV(gv)) {
3163 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3164 append_elem(OP_LIST, term,
3165 scalar(newUNOP(OP_RV2CV, 0,
3170 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3176 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3178 return newBINOP(OP_LSLICE, flags,
3179 list(force_list(subscript)),
3180 list(force_list(listval)) );
3184 S_list_assignment(pTHX_ register OP *o)
3189 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3190 o = cUNOPo->op_first;
3192 if (o->op_type == OP_COND_EXPR) {
3193 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3194 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3199 yyerror("Assignment to both a list and a scalar");
3203 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3204 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3205 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3208 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3211 if (o->op_type == OP_RV2SV)
3218 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3223 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3224 return newLOGOP(optype, 0,
3225 mod(scalar(left), optype),
3226 newUNOP(OP_SASSIGN, 0, scalar(right)));
3229 return newBINOP(optype, OPf_STACKED,
3230 mod(scalar(left), optype), scalar(right));
3234 if (list_assignment(left)) {
3237 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3238 left = mod(left, OP_AASSIGN);
3246 o = newBINOP(OP_AASSIGN, flags,
3247 list(force_list(right)),
3248 list(force_list(left)) );
3249 o->op_private = 0 | (flags >> 8);
3250 if (!(left->op_private & OPpLVAL_INTRO)) {
3254 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3255 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3256 if (curop->op_type == OP_GV) {
3257 GV *gv = cGVOPx_gv(curop);
3258 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3260 SvCUR(gv) = PL_generation;
3262 else if (curop->op_type == OP_PADSV ||
3263 curop->op_type == OP_PADAV ||
3264 curop->op_type == OP_PADHV ||
3265 curop->op_type == OP_PADANY) {
3266 SV **svp = AvARRAY(PL_comppad_name);
3267 SV *sv = svp[curop->op_targ];
3268 if (SvCUR(sv) == PL_generation)
3270 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3272 else if (curop->op_type == OP_RV2CV)
3274 else if (curop->op_type == OP_RV2SV ||
3275 curop->op_type == OP_RV2AV ||
3276 curop->op_type == OP_RV2HV ||
3277 curop->op_type == OP_RV2GV) {
3278 if (lastop->op_type != OP_GV) /* funny deref? */
3281 else if (curop->op_type == OP_PUSHRE) {
3282 if (((PMOP*)curop)->op_pmreplroot) {
3283 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3284 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3286 SvCUR(gv) = PL_generation;
3295 o->op_private = OPpASSIGN_COMMON;
3297 if (right && right->op_type == OP_SPLIT) {
3299 if ((tmpop = ((LISTOP*)right)->op_first) &&
3300 tmpop->op_type == OP_PUSHRE)
3302 PMOP *pm = (PMOP*)tmpop;
3303 if (left->op_type == OP_RV2AV &&
3304 !(left->op_private & OPpLVAL_INTRO) &&
3305 !(o->op_private & OPpASSIGN_COMMON) )
3307 tmpop = ((UNOP*)left)->op_first;
3308 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3310 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3311 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3313 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3314 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3316 pm->op_pmflags |= PMf_ONCE;
3317 tmpop = cUNOPo->op_first; /* to list (nulled) */
3318 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3319 tmpop->op_sibling = Nullop; /* don't free split */
3320 right->op_next = tmpop->op_next; /* fix starting loc */
3321 op_free(o); /* blow off assign */
3322 right->op_flags &= ~OPf_WANT;
3323 /* "I don't know and I don't care." */
3328 if (PL_modcount < 10000 &&
3329 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3331 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3333 sv_setiv(sv, PL_modcount+1);
3341 right = newOP(OP_UNDEF, 0);
3342 if (right->op_type == OP_READLINE) {
3343 right->op_flags |= OPf_STACKED;
3344 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3347 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3348 o = newBINOP(OP_SASSIGN, flags,
3349 scalar(right), mod(scalar(left), OP_SASSIGN) );
3361 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3364 U32 seq = intro_my();
3367 NewOp(1101, cop, 1, COP);
3368 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3369 cop->op_type = OP_DBSTATE;
3370 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3373 cop->op_type = OP_NEXTSTATE;
3374 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3376 cop->op_flags = flags;
3377 cop->op_private = (PL_hints & HINT_UTF8);
3379 cop->op_private |= NATIVE_HINTS;
3381 PL_compiling.op_private = cop->op_private;
3382 cop->op_next = (OP*)cop;
3385 cop->cop_label = label;
3386 PL_hints |= HINT_BLOCK_SCOPE;
3389 cop->cop_arybase = PL_curcop->cop_arybase;
3390 if (specialWARN(PL_curcop->cop_warnings))
3391 cop->cop_warnings = PL_curcop->cop_warnings ;
3393 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3396 if (PL_copline == NOLINE)
3397 CopLINE_set(cop, CopLINE(PL_curcop));
3399 CopLINE_set(cop, PL_copline);
3400 PL_copline = NOLINE;
3403 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXXXX share in a pvtable? */
3405 CopFILEGV_set(cop, (GV*)SvREFCNT_inc(CopFILEGV(PL_curcop)));
3407 CopSTASH_set(cop, PL_curstash);
3409 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3410 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3411 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3412 (void)SvIOK_on(*svp);
3413 SvIVX(*svp) = PTR2IV(cop);
3417 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3420 /* "Introduce" my variables to visible status. */
3428 if (! PL_min_intro_pending)
3429 return PL_cop_seqmax;
3431 svp = AvARRAY(PL_comppad_name);
3432 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3433 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3434 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3435 SvNVX(sv) = (NV)PL_cop_seqmax;
3438 PL_min_intro_pending = 0;
3439 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3440 return PL_cop_seqmax++;
3444 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3446 return new_logop(type, flags, &first, &other);
3450 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3455 OP *first = *firstp;
3456 OP *other = *otherp;
3458 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3459 return newBINOP(type, flags, scalar(first), scalar(other));
3461 scalarboolean(first);
3462 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3463 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3464 if (type == OP_AND || type == OP_OR) {
3470 first = *firstp = cUNOPo->op_first;
3472 first->op_next = o->op_next;
3473 cUNOPo->op_first = Nullop;
3477 if (first->op_type == OP_CONST) {
3478 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3479 Perl_warner(aTHX_ WARN_PRECEDENCE, "Probable precedence problem on %s",
3481 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3492 else if (first->op_type == OP_WANTARRAY) {
3498 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3499 OP *k1 = ((UNOP*)first)->op_first;
3500 OP *k2 = k1->op_sibling;
3502 switch (first->op_type)
3505 if (k2 && k2->op_type == OP_READLINE
3506 && (k2->op_flags & OPf_STACKED)
3507 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3509 warnop = k2->op_type;
3514 if (k1->op_type == OP_READDIR
3515 || k1->op_type == OP_GLOB
3516 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3517 || k1->op_type == OP_EACH)
3519 warnop = ((k1->op_type == OP_NULL)
3520 ? k1->op_targ : k1->op_type);
3525 line_t oldline = CopLINE(PL_curcop);
3526 CopLINE_set(PL_curcop, PL_copline);
3527 Perl_warner(aTHX_ WARN_UNSAFE,
3528 "Value of %s%s can be \"0\"; test with defined()",
3530 ((warnop == OP_READLINE || warnop == OP_GLOB)
3531 ? " construct" : "() operator"));
3532 CopLINE_set(PL_curcop, oldline);
3539 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3540 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3542 NewOp(1101, logop, 1, LOGOP);
3544 logop->op_type = type;
3545 logop->op_ppaddr = PL_ppaddr[type];
3546 logop->op_first = first;
3547 logop->op_flags = flags | OPf_KIDS;
3548 logop->op_other = LINKLIST(other);
3549 logop->op_private = 1 | (flags >> 8);
3551 /* establish postfix order */
3552 logop->op_next = LINKLIST(first);
3553 first->op_next = (OP*)logop;
3554 first->op_sibling = other;
3556 o = newUNOP(OP_NULL, 0, (OP*)logop);
3563 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3571 return newLOGOP(OP_AND, 0, first, trueop);
3573 return newLOGOP(OP_OR, 0, first, falseop);
3575 scalarboolean(first);
3576 if (first->op_type == OP_CONST) {
3577 if (SvTRUE(((SVOP*)first)->op_sv)) {
3588 else if (first->op_type == OP_WANTARRAY) {
3592 NewOp(1101, logop, 1, LOGOP);
3593 logop->op_type = OP_COND_EXPR;
3594 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3595 logop->op_first = first;
3596 logop->op_flags = flags | OPf_KIDS;
3597 logop->op_private = 1 | (flags >> 8);
3598 logop->op_other = LINKLIST(trueop);
3599 logop->op_next = LINKLIST(falseop);
3602 /* establish postfix order */
3603 start = LINKLIST(first);
3604 first->op_next = (OP*)logop;
3606 first->op_sibling = trueop;
3607 trueop->op_sibling = falseop;
3608 o = newUNOP(OP_NULL, 0, (OP*)logop);
3610 trueop->op_next = falseop->op_next = o;
3617 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3626 NewOp(1101, range, 1, LOGOP);
3628 range->op_type = OP_RANGE;
3629 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3630 range->op_first = left;
3631 range->op_flags = OPf_KIDS;
3632 leftstart = LINKLIST(left);
3633 range->op_other = LINKLIST(right);
3634 range->op_private = 1 | (flags >> 8);
3636 left->op_sibling = right;
3638 range->op_next = (OP*)range;
3639 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3640 flop = newUNOP(OP_FLOP, 0, flip);
3641 o = newUNOP(OP_NULL, 0, flop);
3643 range->op_next = leftstart;
3645 left->op_next = flip;
3646 right->op_next = flop;
3648 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3649 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3650 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3651 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3653 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3654 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3657 if (!flip->op_private || !flop->op_private)
3658 linklist(o); /* blow off optimizer unless constant */
3664 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3669 int once = block && block->op_flags & OPf_SPECIAL &&
3670 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3673 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3674 return block; /* do {} while 0 does once */
3675 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3676 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3677 expr = newUNOP(OP_DEFINED, 0,
3678 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3679 } else if (expr->op_flags & OPf_KIDS) {
3680 OP *k1 = ((UNOP*)expr)->op_first;
3681 OP *k2 = (k1) ? k1->op_sibling : NULL;
3682 switch (expr->op_type) {
3684 if (k2 && k2->op_type == OP_READLINE
3685 && (k2->op_flags & OPf_STACKED)
3686 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3687 expr = newUNOP(OP_DEFINED, 0, expr);
3691 if (k1->op_type == OP_READDIR
3692 || k1->op_type == OP_GLOB
3693 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3694 || k1->op_type == OP_EACH)
3695 expr = newUNOP(OP_DEFINED, 0, expr);
3701 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3702 o = new_logop(OP_AND, 0, &expr, &listop);
3705 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3707 if (once && o != listop)
3708 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3711 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3713 o->op_flags |= flags;
3715 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3720 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3729 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3730 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3731 expr = newUNOP(OP_DEFINED, 0,
3732 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3733 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3734 OP *k1 = ((UNOP*)expr)->op_first;
3735 OP *k2 = (k1) ? k1->op_sibling : NULL;
3736 switch (expr->op_type) {
3738 if (k2 && k2->op_type == OP_READLINE
3739 && (k2->op_flags & OPf_STACKED)
3740 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3741 expr = newUNOP(OP_DEFINED, 0, expr);
3745 if (k1->op_type == OP_READDIR
3746 || k1->op_type == OP_GLOB
3747 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3748 || k1->op_type == OP_EACH)
3749 expr = newUNOP(OP_DEFINED, 0, expr);
3755 block = newOP(OP_NULL, 0);
3757 block = scope(block);
3761 next = LINKLIST(cont);
3763 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3764 if ((line_t)whileline != NOLINE) {
3765 PL_copline = whileline;
3766 cont = append_elem(OP_LINESEQ, cont,
3767 newSTATEOP(0, Nullch, Nullop));
3771 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3772 redo = LINKLIST(listop);
3775 PL_copline = whileline;
3777 o = new_logop(OP_AND, 0, &expr, &listop);
3778 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3779 op_free(expr); /* oops, it's a while (0) */
3781 return Nullop; /* listop already freed by new_logop */
3784 ((LISTOP*)listop)->op_last->op_next = condop =
3785 (o == listop ? redo : LINKLIST(o));
3793 NewOp(1101,loop,1,LOOP);
3794 loop->op_type = OP_ENTERLOOP;
3795 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3796 loop->op_private = 0;
3797 loop->op_next = (OP*)loop;
3800 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3802 loop->op_redoop = redo;
3803 loop->op_lastop = o;
3806 loop->op_nextop = next;
3808 loop->op_nextop = o;
3810 o->op_flags |= flags;
3811 o->op_private |= (flags >> 8);
3816 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3825 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3826 sv->op_type = OP_RV2GV;
3827 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3829 else if (sv->op_type == OP_PADSV) { /* private variable */
3830 padoff = sv->op_targ;
3835 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3836 padoff = sv->op_targ;
3838 iterflags |= OPf_SPECIAL;
3843 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3847 padoff = find_threadsv("_");
3848 iterflags |= OPf_SPECIAL;
3850 sv = newGVOP(OP_GV, 0, PL_defgv);
3853 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3854 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3855 iterflags |= OPf_STACKED;
3857 else if (expr->op_type == OP_NULL &&
3858 (expr->op_flags & OPf_KIDS) &&
3859 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3861 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3862 * set the STACKED flag to indicate that these values are to be
3863 * treated as min/max values by 'pp_iterinit'.
3865 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3866 LOGOP* range = (LOGOP*) flip->op_first;
3867 OP* left = range->op_first;
3868 OP* right = left->op_sibling;
3871 range->op_flags &= ~OPf_KIDS;
3872 range->op_first = Nullop;
3874 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3875 listop->op_first->op_next = range->op_next;
3876 left->op_next = range->op_other;
3877 right->op_next = (OP*)listop;
3878 listop->op_next = listop->op_first;
3881 expr = (OP*)(listop);
3883 iterflags |= OPf_STACKED;
3886 expr = mod(force_list(expr), OP_GREPSTART);
3890 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3891 append_elem(OP_LIST, expr, scalar(sv))));
3892 assert(!loop->op_next);
3893 #ifdef PL_OP_SLAB_ALLOC
3894 NewOp(1234,tmp,1,LOOP);
3895 Copy(loop,tmp,1,LOOP);
3898 Renew(loop, 1, LOOP);
3900 loop->op_targ = padoff;
3901 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3902 PL_copline = forline;
3903 return newSTATEOP(0, label, wop);
3907 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3913 if (type != OP_GOTO || label->op_type == OP_CONST) {
3914 /* "last()" means "last" */
3915 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3916 o = newOP(type, OPf_SPECIAL);
3918 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3919 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3925 if (label->op_type == OP_ENTERSUB)
3926 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3927 o = newUNOP(type, OPf_STACKED, label);
3929 PL_hints |= HINT_BLOCK_SCOPE;
3934 Perl_cv_undef(pTHX_ CV *cv)
3939 MUTEX_DESTROY(CvMUTEXP(cv));
3940 Safefree(CvMUTEXP(cv));
3943 #endif /* USE_THREADS */
3945 if (!CvXSUB(cv) && CvROOT(cv)) {
3947 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3948 Perl_croak(aTHX_ "Can't undef active subroutine");
3951 Perl_croak(aTHX_ "Can't undef active subroutine");
3952 #endif /* USE_THREADS */
3955 SAVEVPTR(PL_curpad);
3959 op_free(CvROOT(cv));
3960 CvROOT(cv) = Nullop;
3963 SvPOK_off((SV*)cv); /* forget prototype */
3965 SvREFCNT_dec(CvGV(cv));
3967 SvREFCNT_dec(CvOUTSIDE(cv));
3968 CvOUTSIDE(cv) = Nullcv;
3969 if (CvPADLIST(cv)) {
3970 /* may be during global destruction */
3971 if (SvREFCNT(CvPADLIST(cv))) {
3972 I32 i = AvFILLp(CvPADLIST(cv));
3974 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3975 SV* sv = svp ? *svp : Nullsv;
3978 if (sv == (SV*)PL_comppad_name)
3979 PL_comppad_name = Nullav;
3980 else if (sv == (SV*)PL_comppad) {
3981 PL_comppad = Nullav;
3982 PL_curpad = Null(SV**);
3986 SvREFCNT_dec((SV*)CvPADLIST(cv));
3988 CvPADLIST(cv) = Nullav;
3993 S_cv_dump(pTHX_ CV *cv)
3996 CV *outside = CvOUTSIDE(cv);
3997 AV* padlist = CvPADLIST(cv);
4004 PerlIO_printf(Perl_debug_log,
4005 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4007 (CvANON(cv) ? "ANON"
4008 : (cv == PL_main_cv) ? "MAIN"
4009 : CvUNIQUE(cv) ? "UNIQUE"
4010 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4013 : CvANON(outside) ? "ANON"
4014 : (outside == PL_main_cv) ? "MAIN"
4015 : CvUNIQUE(outside) ? "UNIQUE"
4016 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4021 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4022 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4023 pname = AvARRAY(pad_name);
4024 ppad = AvARRAY(pad);
4026 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4027 if (SvPOK(pname[ix]))
4028 PerlIO_printf(Perl_debug_log,
4029 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4030 (int)ix, PTR2UV(ppad[ix]),
4031 SvFAKE(pname[ix]) ? "FAKE " : "",
4033 (IV)I_32(SvNVX(pname[ix])),
4036 #endif /* DEBUGGING */
4040 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4045 AV* protopadlist = CvPADLIST(proto);
4046 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4047 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4048 SV** pname = AvARRAY(protopad_name);
4049 SV** ppad = AvARRAY(protopad);
4050 I32 fname = AvFILLp(protopad_name);
4051 I32 fpad = AvFILLp(protopad);
4055 assert(!CvUNIQUE(proto));
4058 SAVEVPTR(PL_curpad);
4059 SAVESPTR(PL_comppad);
4060 SAVESPTR(PL_comppad_name);
4061 SAVESPTR(PL_compcv);
4063 cv = PL_compcv = (CV*)NEWSV(1104,0);
4064 sv_upgrade((SV *)cv, SvTYPE(proto));
4070 New(666, CvMUTEXP(cv), 1, perl_mutex);
4071 MUTEX_INIT(CvMUTEXP(cv));
4073 #endif /* USE_THREADS */
4074 CvFILE(cv) = CvFILE(proto);
4075 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4076 CvSTASH(cv) = CvSTASH(proto);
4077 CvROOT(cv) = CvROOT(proto);
4078 CvSTART(cv) = CvSTART(proto);
4080 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4083 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4085 PL_comppad_name = newAV();
4086 for (ix = fname; ix >= 0; ix--)
4087 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4089 PL_comppad = newAV();
4091 comppadlist = newAV();
4092 AvREAL_off(comppadlist);
4093 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4094 av_store(comppadlist, 1, (SV*)PL_comppad);
4095 CvPADLIST(cv) = comppadlist;
4096 av_fill(PL_comppad, AvFILLp(protopad));
4097 PL_curpad = AvARRAY(PL_comppad);
4099 av = newAV(); /* will be @_ */
4101 av_store(PL_comppad, 0, (SV*)av);
4102 AvFLAGS(av) = AVf_REIFY;
4104 for (ix = fpad; ix > 0; ix--) {
4105 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4106 if (namesv && namesv != &PL_sv_undef) {
4107 char *name = SvPVX(namesv); /* XXX */
4108 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4109 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4110 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4112 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4114 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4116 else { /* our own lexical */
4119 /* anon code -- we'll come back for it */
4120 sv = SvREFCNT_inc(ppad[ix]);
4122 else if (*name == '@')
4124 else if (*name == '%')
4133 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4134 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4137 SV* sv = NEWSV(0,0);
4143 /* Now that vars are all in place, clone nested closures. */
4145 for (ix = fpad; ix > 0; ix--) {
4146 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4148 && namesv != &PL_sv_undef
4149 && !(SvFLAGS(namesv) & SVf_FAKE)
4150 && *SvPVX(namesv) == '&'
4151 && CvCLONE(ppad[ix]))
4153 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4154 SvREFCNT_dec(ppad[ix]);
4157 PL_curpad[ix] = (SV*)kid;
4161 #ifdef DEBUG_CLOSURES
4162 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4164 PerlIO_printf(Perl_debug_log, " from:\n");
4166 PerlIO_printf(Perl_debug_log, " to:\n");
4175 Perl_cv_clone(pTHX_ CV *proto)
4178 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4179 cv = cv_clone2(proto, CvOUTSIDE(proto));
4180 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4185 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4189 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_UNSAFE)) {
4190 SV* msg = sv_newmortal();
4194 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4195 sv_setpv(msg, "Prototype mismatch:");
4197 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4199 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4200 sv_catpv(msg, " vs ");
4202 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4204 sv_catpv(msg, "none");
4205 Perl_warner(aTHX_ WARN_UNSAFE, "%"SVf, msg);
4210 Perl_cv_const_sv(pTHX_ CV *cv)
4212 if (!cv || !SvPOK(cv) || SvCUR(cv))
4214 return op_const_sv(CvSTART(cv), cv);
4218 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4225 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4226 o = cLISTOPo->op_first->op_sibling;
4228 for (; o; o = o->op_next) {
4229 OPCODE type = o->op_type;
4231 if (sv && o->op_next == o)
4233 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4235 if (type == OP_LEAVESUB || type == OP_RETURN)
4239 if (type == OP_CONST && cSVOPo->op_sv)
4241 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4242 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4243 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4244 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4256 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4266 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4270 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4272 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4276 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4280 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4281 GV *gv = gv_fetchpv(name ? name : "__ANON__",
4282 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4284 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4295 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4296 maximum a prototype before. */
4297 if (SvTYPE(gv) > SVt_NULL) {
4298 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4299 && ckWARN_d(WARN_UNSAFE))
4301 Perl_warner(aTHX_ WARN_UNSAFE, "Runaway prototype");
4303 cv_ckproto((CV*)gv, NULL, ps);
4306 sv_setpv((SV*)gv, ps);
4308 sv_setiv((SV*)gv, -1);
4309 SvREFCNT_dec(PL_compcv);
4310 cv = PL_compcv = NULL;
4311 PL_sub_generation++;
4315 if (!name || GvCVGEN(gv))
4317 else if (cv = GvCV(gv)) {
4318 cv_ckproto(cv, gv, ps);
4319 /* already defined (or promised)? */
4320 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4322 bool const_changed = TRUE;
4323 if (!block && !attrs) {
4324 /* just a "sub foo;" when &foo is already defined */
4325 SAVEFREESV(PL_compcv);
4328 /* ahem, death to those who redefine active sort subs */
4329 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4330 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4333 if(const_sv = cv_const_sv(cv))
4334 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4335 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
4336 && !(CvGV(cv) && GvSTASH(CvGV(cv))
4337 && HvNAME(GvSTASH(CvGV(cv)))
4338 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
4340 line_t oldline = CopLINE(PL_curcop);
4341 CopLINE_set(PL_curcop, PL_copline);
4342 Perl_warner(aTHX_ WARN_REDEFINE,
4343 const_sv ? "Constant subroutine %s redefined"
4344 : "Subroutine %s redefined", name);
4345 CopLINE_set(PL_curcop, oldline);
4356 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4357 * before we clobber PL_compcv.
4361 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4362 stash = GvSTASH(CvGV(cv));
4363 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4364 stash = CvSTASH(cv);
4366 stash = PL_curstash;
4369 /* possibly about to re-define existing subr -- ignore old cv */
4370 rcv = (SV*)PL_compcv;
4371 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4372 stash = GvSTASH(gv);
4374 stash = PL_curstash;
4376 apply_attrs(stash, rcv, attrs);
4378 if (cv) { /* must reuse cv if autoloaded */
4380 /* got here with just attrs -- work done, so bug out */
4381 SAVEFREESV(PL_compcv);
4385 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4386 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4387 CvOUTSIDE(PL_compcv) = 0;
4388 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4389 CvPADLIST(PL_compcv) = 0;
4390 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4391 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4392 SvREFCNT_dec(PL_compcv);
4399 PL_sub_generation++;
4402 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4403 CvFILE(cv) = CopFILE(PL_curcop);
4404 CvSTASH(cv) = PL_curstash;
4407 if (!CvMUTEXP(cv)) {
4408 New(666, CvMUTEXP(cv), 1, perl_mutex);
4409 MUTEX_INIT(CvMUTEXP(cv));
4411 #endif /* USE_THREADS */
4414 sv_setpv((SV*)cv, ps);
4416 if (PL_error_count) {
4420 char *s = strrchr(name, ':');
4422 if (strEQ(s, "BEGIN")) {
4424 "BEGIN not safe after errors--compilation aborted";
4425 if (PL_in_eval & EVAL_KEEPERR)
4426 Perl_croak(aTHX_ not_safe);
4428 /* force display of errors found but not reported */
4429 sv_catpv(ERRSV, not_safe);
4430 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4437 PL_copline = NOLINE;
4442 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4443 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4446 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4449 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4451 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4452 OpREFCNT_set(CvROOT(cv), 1);
4453 CvSTART(cv) = LINKLIST(CvROOT(cv));
4454 CvROOT(cv)->op_next = 0;
4457 /* now that optimizer has done its work, adjust pad values */
4459 SV **namep = AvARRAY(PL_comppad_name);
4460 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4463 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4466 * The only things that a clonable function needs in its
4467 * pad are references to outer lexicals and anonymous subs.
4468 * The rest are created anew during cloning.
4470 if (!((namesv = namep[ix]) != Nullsv &&
4471 namesv != &PL_sv_undef &&
4473 *SvPVX(namesv) == '&')))
4475 SvREFCNT_dec(PL_curpad[ix]);
4476 PL_curpad[ix] = Nullsv;
4481 AV *av = newAV(); /* Will be @_ */
4483 av_store(PL_comppad, 0, (SV*)av);
4484 AvFLAGS(av) = AVf_REIFY;
4486 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4487 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4489 if (!SvPADMY(PL_curpad[ix]))
4490 SvPADTMP_on(PL_curpad[ix]);
4497 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4498 SV *sv = NEWSV(0,0);
4499 SV *tmpstr = sv_newmortal();
4500 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4504 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4506 (long)PL_subline, (long)CopLINE(PL_curcop));
4507 gv_efullname3(tmpstr, gv, Nullch);
4508 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4509 hv = GvHVn(db_postponed);
4510 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4511 && (cv = GvCV(db_postponed))) {
4516 call_sv((SV*)cv, G_DISCARD);
4520 if ((s = strrchr(name,':')))
4525 if (*s != 'B' && *s != 'E' && *s != 'S' && *s != 'I')
4528 if (strEQ(s, "BEGIN")) {
4529 I32 oldscope = PL_scopestack_ix;
4531 SAVECOPFILE(&PL_compiling);
4532 SAVECOPLINE(&PL_compiling);
4534 sv_setsv(PL_rs, PL_nrs);
4537 PL_beginav = newAV();
4538 DEBUG_x( dump_sub(gv) );
4539 av_push(PL_beginav, SvREFCNT_inc(cv));
4541 call_list(oldscope, PL_beginav);
4543 PL_curcop = &PL_compiling;
4544 PL_compiling.op_private = PL_hints;
4547 else if (strEQ(s, "END") && !PL_error_count) {
4550 DEBUG_x( dump_sub(gv) );
4551 av_unshift(PL_endav, 1);
4552 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4555 else if (strEQ(s, "STOP") && !PL_error_count) {
4557 PL_stopav = newAV();
4558 DEBUG_x( dump_sub(gv) );
4559 av_unshift(PL_stopav, 1);
4560 av_store(PL_stopav, 0, SvREFCNT_inc(cv));
4563 else if (strEQ(s, "INIT") && !PL_error_count) {
4565 PL_initav = newAV();
4566 DEBUG_x( dump_sub(gv) );
4567 av_push(PL_initav, SvREFCNT_inc(cv));
4573 PL_copline = NOLINE;
4578 /* XXX unsafe for threads if eval_owner isn't held */
4580 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4585 SAVECOPLINE(PL_curcop);
4588 CopLINE_set(PL_curcop, PL_copline);
4589 PL_hints &= ~HINT_BLOCK_SCOPE;
4592 SAVESPTR(PL_curstash);
4593 SAVECOPSTASH(PL_curcop);
4594 PL_curstash = stash;
4596 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4598 CopSTASH(PL_curcop) = stash;
4603 start_subparse(FALSE, 0),
4604 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4605 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4607 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4614 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4617 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4620 if (cv = (name ? GvCV(gv) : Nullcv)) {
4622 /* just a cached method */
4626 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4627 /* already defined (or promised) */
4628 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4629 && HvNAME(GvSTASH(CvGV(cv)))
4630 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4631 line_t oldline = CopLINE(PL_curcop);
4632 if (PL_copline != NOLINE)
4633 CopLINE_set(PL_curcop, PL_copline);
4634 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4635 CopLINE_set(PL_curcop, oldline);
4642 if (cv) /* must reuse cv if autoloaded */
4645 cv = (CV*)NEWSV(1105,0);
4646 sv_upgrade((SV *)cv, SVt_PVCV);
4650 PL_sub_generation++;
4653 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4655 New(666, CvMUTEXP(cv), 1, perl_mutex);
4656 MUTEX_INIT(CvMUTEXP(cv));
4658 #endif /* USE_THREADS */
4659 (void)gv_fetchfile(filename);
4660 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4661 an external constant string */
4662 CvXSUB(cv) = subaddr;
4665 char *s = strrchr(name,':');
4671 if (*s != 'B' && *s != 'E' && *s != 'S' && *s != 'I')
4674 if (strEQ(s, "BEGIN")) {
4676 PL_beginav = newAV();
4677 av_push(PL_beginav, SvREFCNT_inc(cv));
4680 else if (strEQ(s, "END")) {
4683 av_unshift(PL_endav, 1);
4684 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4687 else if (strEQ(s, "STOP")) {
4689 PL_stopav = newAV();
4690 av_unshift(PL_stopav, 1);
4691 av_store(PL_stopav, 0, SvREFCNT_inc(cv));
4694 else if (strEQ(s, "INIT")) {
4696 PL_initav = newAV();
4697 av_push(PL_initav, SvREFCNT_inc(cv));
4709 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4719 name = SvPVx(cSVOPo->op_sv, n_a);
4722 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4724 if (cv = GvFORM(gv)) {
4725 if (ckWARN(WARN_REDEFINE)) {
4726 line_t oldline = CopLINE(PL_curcop);
4728 CopLINE_set(PL_curcop, PL_copline);
4729 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4730 CopLINE_set(PL_curcop, oldline);
4736 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4737 CvFILE(cv) = CopFILE(PL_curcop);
4739 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4740 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4741 SvPADTMP_on(PL_curpad[ix]);
4744 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4745 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4746 OpREFCNT_set(CvROOT(cv), 1);
4747 CvSTART(cv) = LINKLIST(CvROOT(cv));
4748 CvROOT(cv)->op_next = 0;
4751 PL_copline = NOLINE;
4756 Perl_newANONLIST(pTHX_ OP *o)
4758 return newUNOP(OP_REFGEN, 0,
4759 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4763 Perl_newANONHASH(pTHX_ OP *o)
4765 return newUNOP(OP_REFGEN, 0,
4766 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4770 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4772 return newANONATTRSUB(floor, proto, Nullop, block);
4776 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4778 return newUNOP(OP_REFGEN, 0,
4779 newSVOP(OP_ANONCODE, 0,
4780 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4784 Perl_oopsAV(pTHX_ OP *o)
4786 switch (o->op_type) {
4788 o->op_type = OP_PADAV;
4789 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4790 return ref(o, OP_RV2AV);
4793 o->op_type = OP_RV2AV;
4794 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4799 if (ckWARN_d(WARN_INTERNAL))
4800 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4807 Perl_oopsHV(pTHX_ OP *o)
4811 switch (o->op_type) {
4814 o->op_type = OP_PADHV;
4815 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4816 return ref(o, OP_RV2HV);
4820 o->op_type = OP_RV2HV;
4821 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4826 if (ckWARN_d(WARN_INTERNAL))
4827 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
4834 Perl_newAVREF(pTHX_ OP *o)
4836 if (o->op_type == OP_PADANY) {
4837 o->op_type = OP_PADAV;
4838 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4841 return newUNOP(OP_RV2AV, 0, scalar(o));
4845 Perl_newGVREF(pTHX_ I32 type, OP *o)
4847 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4848 return newUNOP(OP_NULL, 0, o);
4849 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4853 Perl_newHVREF(pTHX_ OP *o)
4855 if (o->op_type == OP_PADANY) {
4856 o->op_type = OP_PADHV;
4857 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4860 return newUNOP(OP_RV2HV, 0, scalar(o));
4864 Perl_oopsCV(pTHX_ OP *o)
4866 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4872 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4874 return newUNOP(OP_RV2CV, flags, scalar(o));
4878 Perl_newSVREF(pTHX_ OP *o)
4880 if (o->op_type == OP_PADANY) {
4881 o->op_type = OP_PADSV;
4882 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4885 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4886 o->op_flags |= OPpDONE_SVREF;
4889 return newUNOP(OP_RV2SV, 0, scalar(o));
4892 /* Check routines. */
4895 Perl_ck_anoncode(pTHX_ OP *o)
4900 name = NEWSV(1106,0);
4901 sv_upgrade(name, SVt_PVNV);
4902 sv_setpvn(name, "&", 1);
4905 ix = pad_alloc(o->op_type, SVs_PADMY);
4906 av_store(PL_comppad_name, ix, name);
4907 av_store(PL_comppad, ix, cSVOPo->op_sv);
4908 SvPADMY_on(cSVOPo->op_sv);
4909 cSVOPo->op_sv = Nullsv;
4910 cSVOPo->op_targ = ix;
4915 Perl_ck_bitop(pTHX_ OP *o)
4917 o->op_private = PL_hints;
4922 Perl_ck_concat(pTHX_ OP *o)
4924 if (cUNOPo->op_first->op_type == OP_CONCAT)
4925 o->op_flags |= OPf_STACKED;
4930 Perl_ck_spair(pTHX_ OP *o)
4932 if (o->op_flags & OPf_KIDS) {
4935 OPCODE type = o->op_type;
4936 o = modkids(ck_fun(o), type);
4937 kid = cUNOPo->op_first;
4938 newop = kUNOP->op_first->op_sibling;
4940 (newop->op_sibling ||
4941 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4942 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4943 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4947 op_free(kUNOP->op_first);
4948 kUNOP->op_first = newop;
4950 o->op_ppaddr = PL_ppaddr[++o->op_type];
4955 Perl_ck_delete(pTHX_ OP *o)
4959 if (o->op_flags & OPf_KIDS) {
4960 OP *kid = cUNOPo->op_first;
4961 switch (kid->op_type) {
4963 o->op_flags |= OPf_SPECIAL;
4966 o->op_private |= OPpSLICE;
4969 o->op_flags |= OPf_SPECIAL;
4974 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
4975 PL_op_desc[o->op_type]);
4983 Perl_ck_eof(pTHX_ OP *o)
4985 I32 type = o->op_type;
4987 if (o->op_flags & OPf_KIDS) {
4988 if (cLISTOPo->op_first->op_type == OP_STUB) {
4990 o = newUNOP(type, OPf_SPECIAL,
4991 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4999 Perl_ck_eval(pTHX_ OP *o)
5001 PL_hints |= HINT_BLOCK_SCOPE;
5002 if (o->op_flags & OPf_KIDS) {
5003 SVOP *kid = (SVOP*)cUNOPo->op_first;
5006 o->op_flags &= ~OPf_KIDS;
5009 else if (kid->op_type == OP_LINESEQ) {
5012 kid->op_next = o->op_next;
5013 cUNOPo->op_first = 0;
5016 NewOp(1101, enter, 1, LOGOP);
5017 enter->op_type = OP_ENTERTRY;
5018 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5019 enter->op_private = 0;
5021 /* establish postfix order */
5022 enter->op_next = (OP*)enter;
5024 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5025 o->op_type = OP_LEAVETRY;
5026 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5027 enter->op_other = o;
5035 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5037 o->op_targ = (PADOFFSET)PL_hints;
5042 Perl_ck_exec(pTHX_ OP *o)
5045 if (o->op_flags & OPf_STACKED) {
5047 kid = cUNOPo->op_first->op_sibling;
5048 if (kid->op_type == OP_RV2GV)
5057 Perl_ck_exists(pTHX_ OP *o)
5060 if (o->op_flags & OPf_KIDS) {
5061 OP *kid = cUNOPo->op_first;
5062 if (kid->op_type == OP_ENTERSUB) {
5063 (void) ref(kid, o->op_type);
5064 if (kid->op_type != OP_RV2CV && !PL_error_count)
5065 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5066 PL_op_desc[o->op_type]);
5067 o->op_private |= OPpEXISTS_SUB;
5069 else if (kid->op_type == OP_AELEM)
5070 o->op_flags |= OPf_SPECIAL;
5071 else if (kid->op_type != OP_HELEM)
5072 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5073 PL_op_desc[o->op_type]);
5081 Perl_ck_gvconst(pTHX_ register OP *o)
5083 o = fold_constants(o);
5084 if (o->op_type == OP_CONST)
5091 Perl_ck_rvconst(pTHX_ register OP *o)
5094 SVOP *kid = (SVOP*)cUNOPo->op_first;
5096 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5097 if (kid->op_type == OP_CONST) {
5101 SV *kidsv = kid->op_sv;
5104 /* Is it a constant from cv_const_sv()? */
5105 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5106 SV *rsv = SvRV(kidsv);
5107 int svtype = SvTYPE(rsv);
5108 char *badtype = Nullch;
5110 switch (o->op_type) {
5112 if (svtype > SVt_PVMG)
5113 badtype = "a SCALAR";
5116 if (svtype != SVt_PVAV)
5117 badtype = "an ARRAY";
5120 if (svtype != SVt_PVHV) {
5121 if (svtype == SVt_PVAV) { /* pseudohash? */
5122 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5123 if (ksv && SvROK(*ksv)
5124 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5133 if (svtype != SVt_PVCV)
5138 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5141 name = SvPV(kidsv, n_a);
5142 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5143 char *badthing = Nullch;
5144 switch (o->op_type) {
5146 badthing = "a SCALAR";
5149 badthing = "an ARRAY";
5152 badthing = "a HASH";
5157 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5161 * This is a little tricky. We only want to add the symbol if we
5162 * didn't add it in the lexer. Otherwise we get duplicate strict
5163 * warnings. But if we didn't add it in the lexer, we must at
5164 * least pretend like we wanted to add it even if it existed before,
5165 * or we get possible typo warnings. OPpCONST_ENTERED says
5166 * whether the lexer already added THIS instance of this symbol.
5168 iscv = (o->op_type == OP_RV2CV) * 2;
5170 gv = gv_fetchpv(name,
5171 iscv | !(kid->op_private & OPpCONST_ENTERED),
5174 : o->op_type == OP_RV2SV
5176 : o->op_type == OP_RV2AV
5178 : o->op_type == OP_RV2HV
5181 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5183 kid->op_type = OP_GV;
5184 SvREFCNT_dec(kid->op_sv);
5186 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5187 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5189 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5191 kid->op_sv = SvREFCNT_inc(gv);
5193 kid->op_ppaddr = PL_ppaddr[OP_GV];
5200 Perl_ck_ftst(pTHX_ OP *o)
5203 I32 type = o->op_type;
5205 if (o->op_flags & OPf_REF) {
5208 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5209 SVOP *kid = (SVOP*)cUNOPo->op_first;
5211 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5213 OP *newop = newGVOP(type, OPf_REF,
5214 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5221 if (type == OP_FTTTY)
5222 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5225 o = newUNOP(type, 0, newDEFSVOP());
5228 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5230 if (PL_hints & HINT_LOCALE)
5231 o->op_private |= OPpLOCALE;
5238 Perl_ck_fun(pTHX_ OP *o)
5245 int type = o->op_type;
5246 register I32 oa = PL_opargs[type] >> OASHIFT;
5248 if (o->op_flags & OPf_STACKED) {
5249 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5252 return no_fh_allowed(o);
5255 if (o->op_flags & OPf_KIDS) {
5257 tokid = &cLISTOPo->op_first;
5258 kid = cLISTOPo->op_first;
5259 if (kid->op_type == OP_PUSHMARK ||
5260 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
5262 tokid = &kid->op_sibling;
5263 kid = kid->op_sibling;
5265 if (!kid && PL_opargs[type] & OA_DEFGV)
5266 *tokid = kid = newDEFSVOP();
5270 sibl = kid->op_sibling;
5273 /* list seen where single (scalar) arg expected? */
5274 if (numargs == 1 && !(oa >> 4)
5275 && kid->op_type == OP_LIST && type != OP_SCALAR)
5277 return too_many_arguments(o,PL_op_desc[type]);
5290 if (kid->op_type == OP_CONST &&
5291 (kid->op_private & OPpCONST_BARE))
5293 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5294 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5295 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5296 if (ckWARN(WARN_SYNTAX))
5297 Perl_warner(aTHX_ WARN_SYNTAX,
5298 "Array @%s missing the @ in argument %"IVdf" of %s()",
5299 name, (IV)numargs, PL_op_desc[type]);
5302 kid->op_sibling = sibl;
5305 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5306 bad_type(numargs, "array", PL_op_desc[type], kid);
5310 if (kid->op_type == OP_CONST &&
5311 (kid->op_private & OPpCONST_BARE))
5313 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5314 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5315 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5316 if (ckWARN(WARN_SYNTAX))
5317 Perl_warner(aTHX_ WARN_SYNTAX,
5318 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5319 name, (IV)numargs, PL_op_desc[type]);
5322 kid->op_sibling = sibl;
5325 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5326 bad_type(numargs, "hash", PL_op_desc[type], kid);
5331 OP *newop = newUNOP(OP_NULL, 0, kid);
5332 kid->op_sibling = 0;
5334 newop->op_next = newop;
5336 kid->op_sibling = sibl;
5341 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5342 if (kid->op_type == OP_CONST &&
5343 (kid->op_private & OPpCONST_BARE))
5345 OP *newop = newGVOP(OP_GV, 0,
5346 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5351 else if (kid->op_type == OP_READLINE) {
5352 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5353 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5356 I32 flags = OPf_SPECIAL;
5360 /* is this op a FH constructor? */
5361 if (is_handle_constructor(o,numargs)) {
5362 char *name = Nullch;
5366 /* Set a flag to tell rv2gv to vivify
5367 * need to "prove" flag does not mean something
5368 * else already - NI-S 1999/05/07
5371 if (kid->op_type == OP_PADSV) {
5372 SV **namep = av_fetch(PL_comppad_name,
5374 if (namep && *namep)
5375 name = SvPV(*namep, len);
5377 else if (kid->op_type == OP_RV2SV
5378 && kUNOP->op_first->op_type == OP_GV)
5380 GV *gv = cGVOPx_gv(kUNOP->op_first);
5382 len = GvNAMELEN(gv);
5386 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5387 namesv = PL_curpad[targ];
5388 SvUPGRADE(namesv, SVt_PV);
5390 sv_setpvn(namesv, "$", 1);
5391 sv_catpvn(namesv, name, len);
5394 kid->op_sibling = 0;
5395 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5396 kid->op_targ = targ;
5397 kid->op_private |= priv;
5399 kid->op_sibling = sibl;
5405 mod(scalar(kid), type);
5409 tokid = &kid->op_sibling;
5410 kid = kid->op_sibling;
5412 o->op_private |= numargs;
5414 return too_many_arguments(o,PL_op_desc[o->op_type]);
5417 else if (PL_opargs[type] & OA_DEFGV) {
5419 return newUNOP(type, 0, newDEFSVOP());
5423 while (oa & OA_OPTIONAL)
5425 if (oa && oa != OA_LIST)
5426 return too_few_arguments(o,PL_op_desc[o->op_type]);
5432 Perl_ck_glob(pTHX_ OP *o)
5436 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5437 append_elem(OP_GLOB, o, newDEFSVOP());
5439 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5440 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5442 #if !defined(PERL_EXTERNAL_GLOB)
5443 /* XXX this can be tightened up and made more failsafe. */
5445 OP *modname = newSVOP(OP_CONST, 0, newSVpvn("File::Glob", 10));
5446 modname->op_private |= OPpCONST_BARE;
5448 utilize(1, start_subparse(FALSE, 0), Nullop, modname,
5449 newSVOP(OP_CONST, 0, newSVpvn(":globally", 9)));
5450 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5453 #endif /* PERL_EXTERNAL_GLOB */
5455 if (gv && GvIMPORTED_CV(gv)) {
5456 append_elem(OP_GLOB, o,
5457 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5458 o->op_type = OP_LIST;
5459 o->op_ppaddr = PL_ppaddr[OP_LIST];
5460 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5461 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5462 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5463 append_elem(OP_LIST, o,
5464 scalar(newUNOP(OP_RV2CV, 0,
5465 newGVOP(OP_GV, 0, gv)))));
5466 o = newUNOP(OP_NULL, 0, ck_subr(o));
5467 o->op_targ = OP_GLOB; /* hint at what it used to be */
5470 gv = newGVgen("main");
5472 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5478 Perl_ck_grep(pTHX_ OP *o)
5482 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5484 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5485 NewOp(1101, gwop, 1, LOGOP);
5487 if (o->op_flags & OPf_STACKED) {
5490 kid = cLISTOPo->op_first->op_sibling;
5491 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5494 kid->op_next = (OP*)gwop;
5495 o->op_flags &= ~OPf_STACKED;
5497 kid = cLISTOPo->op_first->op_sibling;
5498 if (type == OP_MAPWHILE)
5505 kid = cLISTOPo->op_first->op_sibling;
5506 if (kid->op_type != OP_NULL)
5507 Perl_croak(aTHX_ "panic: ck_grep");
5508 kid = kUNOP->op_first;
5510 gwop->op_type = type;
5511 gwop->op_ppaddr = PL_ppaddr[type];
5512 gwop->op_first = listkids(o);
5513 gwop->op_flags |= OPf_KIDS;
5514 gwop->op_private = 1;
5515 gwop->op_other = LINKLIST(kid);
5516 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5517 kid->op_next = (OP*)gwop;
5519 kid = cLISTOPo->op_first->op_sibling;
5520 if (!kid || !kid->op_sibling)
5521 return too_few_arguments(o,PL_op_desc[o->op_type]);
5522 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5523 mod(kid, OP_GREPSTART);
5529 Perl_ck_index(pTHX_ OP *o)
5531 if (o->op_flags & OPf_KIDS) {
5532 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5534 kid = kid->op_sibling; /* get past "big" */
5535 if (kid && kid->op_type == OP_CONST)
5536 fbm_compile(((SVOP*)kid)->op_sv, 0);
5542 Perl_ck_lengthconst(pTHX_ OP *o)
5544 /* XXX length optimization goes here */
5549 Perl_ck_lfun(pTHX_ OP *o)
5551 OPCODE type = o->op_type;
5552 return modkids(ck_fun(o), type);
5556 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5559 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5560 switch (cUNOPo->op_first->op_type) {
5562 break; /* Globals via GV can be undef */
5564 case OP_AASSIGN: /* Is this a good idea? */
5565 Perl_warner(aTHX_ WARN_DEPRECATED,
5566 "defined(@array) is deprecated");
5567 Perl_warner(aTHX_ WARN_DEPRECATED,
5568 "(Maybe you should just omit the defined()?)\n");
5571 break; /* Globals via GV can be undef */
5573 Perl_warner(aTHX_ WARN_DEPRECATED,
5574 "defined(%%hash) is deprecated");
5575 Perl_warner(aTHX_ WARN_DEPRECATED,
5576 "(Maybe you should just omit the defined()?)\n");
5587 Perl_ck_rfun(pTHX_ OP *o)
5589 OPCODE type = o->op_type;
5590 return refkids(ck_fun(o), type);
5594 Perl_ck_listiob(pTHX_ OP *o)
5598 kid = cLISTOPo->op_first;
5601 kid = cLISTOPo->op_first;
5603 if (kid->op_type == OP_PUSHMARK)
5604 kid = kid->op_sibling;
5605 if (kid && o->op_flags & OPf_STACKED)
5606 kid = kid->op_sibling;
5607 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5608 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5609 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5610 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5611 cLISTOPo->op_first->op_sibling = kid;
5612 cLISTOPo->op_last = kid;
5613 kid = kid->op_sibling;
5618 append_elem(o->op_type, o, newDEFSVOP());
5624 if (PL_hints & HINT_LOCALE)
5625 o->op_private |= OPpLOCALE;
5632 Perl_ck_fun_locale(pTHX_ OP *o)
5638 if (PL_hints & HINT_LOCALE)
5639 o->op_private |= OPpLOCALE;
5646 Perl_ck_sassign(pTHX_ OP *o)
5648 OP *kid = cLISTOPo->op_first;
5649 /* has a disposable target? */
5650 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5651 && !(kid->op_flags & OPf_STACKED))
5653 OP *kkid = kid->op_sibling;
5655 /* Can just relocate the target. */
5656 if (kkid && kkid->op_type == OP_PADSV
5657 && !(kkid->op_private & OPpLVAL_INTRO))
5659 kid->op_targ = kkid->op_targ;
5661 /* Now we do not need PADSV and SASSIGN. */
5662 kid->op_sibling = o->op_sibling; /* NULL */
5663 cLISTOPo->op_first = NULL;
5666 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5674 Perl_ck_scmp(pTHX_ OP *o)
5678 if (PL_hints & HINT_LOCALE)
5679 o->op_private |= OPpLOCALE;
5686 Perl_ck_match(pTHX_ OP *o)
5688 o->op_private |= OPpRUNTIME;
5693 Perl_ck_method(pTHX_ OP *o)
5695 OP *kid = cUNOPo->op_first;
5696 if (kid->op_type == OP_CONST) {
5697 SV* sv = kSVOP->op_sv;
5698 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5700 sv_upgrade(sv, SVt_PVIV);
5702 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5703 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5704 kSVOP->op_sv = Nullsv;
5713 Perl_ck_null(pTHX_ OP *o)
5719 Perl_ck_repeat(pTHX_ OP *o)
5721 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5722 o->op_private |= OPpREPEAT_DOLIST;
5723 cBINOPo->op_first = force_list(cBINOPo->op_first);
5731 Perl_ck_require(pTHX_ OP *o)
5733 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5734 SVOP *kid = (SVOP*)cUNOPo->op_first;
5736 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5738 for (s = SvPVX(kid->op_sv); *s; s++) {
5739 if (*s == ':' && s[1] == ':') {
5741 Move(s+2, s+1, strlen(s+2)+1, char);
5742 --SvCUR(kid->op_sv);
5745 sv_catpvn(kid->op_sv, ".pm", 3);
5753 Perl_ck_retarget(pTHX_ OP *o)
5755 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5762 Perl_ck_select(pTHX_ OP *o)
5765 if (o->op_flags & OPf_KIDS) {
5766 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5767 if (kid && kid->op_sibling) {
5768 o->op_type = OP_SSELECT;
5769 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5771 return fold_constants(o);
5775 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5776 if (kid && kid->op_type == OP_RV2GV)
5777 kid->op_private &= ~HINT_STRICT_REFS;
5782 Perl_ck_shift(pTHX_ OP *o)
5784 I32 type = o->op_type;
5786 if (!(o->op_flags & OPf_KIDS)) {
5791 if (!CvUNIQUE(PL_compcv)) {
5792 argop = newOP(OP_PADAV, OPf_REF);
5793 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5796 argop = newUNOP(OP_RV2AV, 0,
5797 scalar(newGVOP(OP_GV, 0,
5798 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5801 argop = newUNOP(OP_RV2AV, 0,
5802 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5803 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5804 #endif /* USE_THREADS */
5805 return newUNOP(type, 0, scalar(argop));
5807 return scalar(modkids(ck_fun(o), type));
5811 Perl_ck_sort(pTHX_ OP *o)
5815 if (PL_hints & HINT_LOCALE)
5816 o->op_private |= OPpLOCALE;
5819 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5821 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5822 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5824 kid = kUNOP->op_first; /* get past null */
5826 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5828 if (kid->op_type == OP_SCOPE) {
5832 else if (kid->op_type == OP_LEAVE) {
5833 if (o->op_type == OP_SORT) {
5834 null(kid); /* wipe out leave */
5837 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5838 if (k->op_next == kid)
5843 kid->op_next = 0; /* just disconnect the leave */
5844 k = kLISTOP->op_first;
5848 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5849 if (o->op_type == OP_SORT)
5853 o->op_flags |= OPf_SPECIAL;
5855 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5856 null(cLISTOPo->op_first->op_sibling);
5863 S_simplify_sort(pTHX_ OP *o)
5866 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5870 if (!(o->op_flags & OPf_STACKED))
5872 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5873 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5874 kid = kUNOP->op_first; /* get past null */
5875 if (kid->op_type != OP_SCOPE)
5877 kid = kLISTOP->op_last; /* get past scope */
5878 switch(kid->op_type) {
5886 k = kid; /* remember this node*/
5887 if (kBINOP->op_first->op_type != OP_RV2SV)
5889 kid = kBINOP->op_first; /* get past cmp */
5890 if (kUNOP->op_first->op_type != OP_GV)
5892 kid = kUNOP->op_first; /* get past rv2sv */
5894 if (GvSTASH(gv) != PL_curstash)
5896 if (strEQ(GvNAME(gv), "a"))
5898 else if(strEQ(GvNAME(gv), "b"))
5902 kid = k; /* back to cmp */
5903 if (kBINOP->op_last->op_type != OP_RV2SV)
5905 kid = kBINOP->op_last; /* down to 2nd arg */
5906 if (kUNOP->op_first->op_type != OP_GV)
5908 kid = kUNOP->op_first; /* get past rv2sv */
5910 if (GvSTASH(gv) != PL_curstash
5912 ? strNE(GvNAME(gv), "a")
5913 : strNE(GvNAME(gv), "b")))
5915 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5917 o->op_private |= OPpSORT_REVERSE;
5918 if (k->op_type == OP_NCMP)
5919 o->op_private |= OPpSORT_NUMERIC;
5920 if (k->op_type == OP_I_NCMP)
5921 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5922 kid = cLISTOPo->op_first->op_sibling;
5923 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
5924 op_free(kid); /* then delete it */
5925 cLISTOPo->op_children--;
5929 Perl_ck_split(pTHX_ OP *o)
5933 if (o->op_flags & OPf_STACKED)
5934 return no_fh_allowed(o);
5936 kid = cLISTOPo->op_first;
5937 if (kid->op_type != OP_NULL)
5938 Perl_croak(aTHX_ "panic: ck_split");
5939 kid = kid->op_sibling;
5940 op_free(cLISTOPo->op_first);
5941 cLISTOPo->op_first = kid;
5943 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5944 cLISTOPo->op_last = kid; /* There was only one element previously */
5947 if (kid->op_type != OP_MATCH) {
5948 OP *sibl = kid->op_sibling;
5949 kid->op_sibling = 0;
5950 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5951 if (cLISTOPo->op_first == cLISTOPo->op_last)
5952 cLISTOPo->op_last = kid;
5953 cLISTOPo->op_first = kid;
5954 kid->op_sibling = sibl;
5957 kid->op_type = OP_PUSHRE;
5958 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5961 if (!kid->op_sibling)
5962 append_elem(OP_SPLIT, o, newDEFSVOP());
5964 kid = kid->op_sibling;
5967 if (!kid->op_sibling)
5968 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5970 kid = kid->op_sibling;
5973 if (kid->op_sibling)
5974 return too_many_arguments(o,PL_op_desc[o->op_type]);
5980 Perl_ck_join(pTHX_ OP *o)
5982 if (ckWARN(WARN_SYNTAX)) {
5983 OP *kid = cLISTOPo->op_first->op_sibling;
5984 if (kid && kid->op_type == OP_MATCH) {
5985 char *pmstr = "STRING";
5986 if (kPMOP->op_pmregexp)
5987 pmstr = kPMOP->op_pmregexp->precomp;
5988 Perl_warner(aTHX_ WARN_SYNTAX,
5989 "/%s/ should probably be written as \"%s\"",
5997 Perl_ck_subr(pTHX_ OP *o)
6000 OP *prev = ((cUNOPo->op_first->op_sibling)
6001 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6002 OP *o2 = prev->op_sibling;
6011 o->op_private |= OPpENTERSUB_HASTARG;
6012 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6013 if (cvop->op_type == OP_RV2CV) {
6015 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6016 null(cvop); /* disable rv2cv */
6017 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6018 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6019 GV *gv = cGVOPx_gv(tmpop);
6022 tmpop->op_private |= OPpEARLY_CV;
6023 else if (SvPOK(cv)) {
6024 namegv = CvANON(cv) ? gv : CvGV(cv);
6025 proto = SvPV((SV*)cv, n_a);
6029 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6030 if (o2->op_type == OP_CONST)
6031 o2->op_private &= ~OPpCONST_STRICT;
6032 else if (o2->op_type == OP_LIST) {
6033 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6034 if (o && o->op_type == OP_CONST)
6035 o->op_private &= ~OPpCONST_STRICT;
6038 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6039 if (PERLDB_SUB && PL_curstash != PL_debstash)
6040 o->op_private |= OPpENTERSUB_DB;
6041 while (o2 != cvop) {
6045 return too_many_arguments(o, gv_ename(namegv));
6063 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6064 bad_type(arg, "block", gv_ename(namegv), o2);
6067 /* '*' allows any scalar type, including bareword */
6070 if (o2->op_type == OP_RV2GV)
6071 goto wrapref; /* autoconvert GLOB -> GLOBref */
6072 else if (o2->op_type == OP_CONST)
6073 o2->op_private &= ~OPpCONST_STRICT;
6074 else if (o2->op_type == OP_ENTERSUB) {
6075 /* accidental subroutine, revert to bareword */
6076 OP *gvop = ((UNOP*)o2)->op_first;
6077 if (gvop && gvop->op_type == OP_NULL) {
6078 gvop = ((UNOP*)gvop)->op_first;
6080 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6083 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6084 (gvop = ((UNOP*)gvop)->op_first) &&
6085 gvop->op_type == OP_GV)
6087 GV *gv = cGVOPx_gv(gvop);
6088 OP *sibling = o2->op_sibling;
6089 SV *n = newSVpvn("",0);
6091 gv_fullname3(n, gv, "");
6092 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6093 sv_chop(n, SvPVX(n)+6);
6094 o2 = newSVOP(OP_CONST, 0, n);
6095 prev->op_sibling = o2;
6096 o2->op_sibling = sibling;
6108 if (o2->op_type != OP_RV2GV)
6109 bad_type(arg, "symbol", gv_ename(namegv), o2);
6112 if (o2->op_type != OP_RV2CV)
6113 bad_type(arg, "sub", gv_ename(namegv), o2);
6116 if (o2->op_type != OP_RV2SV
6117 && o2->op_type != OP_PADSV
6118 && o2->op_type != OP_HELEM
6119 && o2->op_type != OP_AELEM
6120 && o2->op_type != OP_THREADSV)
6122 bad_type(arg, "scalar", gv_ename(namegv), o2);
6126 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6127 bad_type(arg, "array", gv_ename(namegv), o2);
6130 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6131 bad_type(arg, "hash", gv_ename(namegv), o2);
6135 OP* sib = kid->op_sibling;
6136 kid->op_sibling = 0;
6137 o2 = newUNOP(OP_REFGEN, 0, kid);
6138 o2->op_sibling = sib;
6139 prev->op_sibling = o2;
6150 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6151 gv_ename(namegv), SvPV((SV*)cv, n_a));
6156 mod(o2, OP_ENTERSUB);
6158 o2 = o2->op_sibling;
6160 if (proto && !optional &&
6161 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6162 return too_few_arguments(o, gv_ename(namegv));
6167 Perl_ck_svconst(pTHX_ OP *o)
6169 SvREADONLY_on(cSVOPo->op_sv);
6174 Perl_ck_trunc(pTHX_ OP *o)
6176 if (o->op_flags & OPf_KIDS) {
6177 SVOP *kid = (SVOP*)cUNOPo->op_first;
6179 if (kid->op_type == OP_NULL)
6180 kid = (SVOP*)kid->op_sibling;
6181 if (kid && kid->op_type == OP_CONST &&
6182 (kid->op_private & OPpCONST_BARE))
6184 o->op_flags |= OPf_SPECIAL;
6185 kid->op_private &= ~OPpCONST_STRICT;
6191 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6194 Perl_peep(pTHX_ register OP *o)
6197 register OP* oldop = 0;
6199 OP *last_composite = Nullop;
6201 if (!o || o->op_seq)
6205 SAVEVPTR(PL_curcop);
6206 for (; o; o = o->op_next) {
6212 switch (o->op_type) {
6216 PL_curcop = ((COP*)o); /* for warnings */
6217 o->op_seq = PL_op_seqmax++;
6218 last_composite = Nullop;
6222 if (cSVOPo->op_private & OPpCONST_STRICT)
6223 no_bareword_allowed(o);
6225 /* Relocate sv to the pad for thread safety.
6226 * Despite being a "constant", the SV is written to,
6227 * for reference counts, sv_upgrade() etc. */
6229 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6230 SvREFCNT_dec(PL_curpad[ix]);
6231 SvPADTMP_on(cSVOPo->op_sv);
6232 PL_curpad[ix] = cSVOPo->op_sv;
6233 cSVOPo->op_sv = Nullsv;
6245 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6246 if (o->op_next->op_private & OPpTARGET_MY) {
6247 if (o->op_flags & OPf_STACKED) /* chained concats */
6248 goto ignore_optimization;
6250 o->op_targ = o->op_next->op_targ;
6251 o->op_next->op_targ = 0;
6252 o->op_private |= OPpTARGET_MY;
6257 ignore_optimization:
6258 o->op_seq = PL_op_seqmax++;
6261 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6262 o->op_seq = PL_op_seqmax++;
6263 break; /* Scalar stub must produce undef. List stub is noop */
6267 if (o->op_targ == OP_NEXTSTATE
6268 || o->op_targ == OP_DBSTATE
6269 || o->op_targ == OP_SETSTATE)
6271 PL_curcop = ((COP*)o);
6278 if (oldop && o->op_next) {
6279 oldop->op_next = o->op_next;
6282 o->op_seq = PL_op_seqmax++;
6286 if (o->op_next->op_type == OP_RV2SV) {
6287 if (!(o->op_next->op_private & OPpDEREF)) {
6289 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
6290 o->op_next = o->op_next->op_next;
6291 o->op_type = OP_GVSV;
6292 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6295 else if (o->op_next->op_type == OP_RV2AV) {
6296 OP* pop = o->op_next->op_next;
6298 if (pop->op_type == OP_CONST &&
6299 (PL_op = pop->op_next) &&
6300 pop->op_next->op_type == OP_AELEM &&
6301 !(pop->op_next->op_private &
6302 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6303 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6311 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6312 o->op_next = pop->op_next->op_next;
6313 o->op_type = OP_AELEMFAST;
6314 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6315 o->op_private = (U8)i;
6320 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_UNSAFE)) {
6322 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6323 /* XXX could check prototype here instead of just carping */
6324 SV *sv = sv_newmortal();
6325 gv_efullname3(sv, gv, Nullch);
6326 Perl_warner(aTHX_ WARN_UNSAFE,
6327 "%s() called too early to check prototype",
6332 o->op_seq = PL_op_seqmax++;
6343 o->op_seq = PL_op_seqmax++;
6344 while (cLOGOP->op_other->op_type == OP_NULL)
6345 cLOGOP->op_other = cLOGOP->op_other->op_next;
6346 peep(cLOGOP->op_other);
6350 o->op_seq = PL_op_seqmax++;
6351 peep(cLOOP->op_redoop);
6352 peep(cLOOP->op_nextop);
6353 peep(cLOOP->op_lastop);
6359 o->op_seq = PL_op_seqmax++;
6360 peep(cPMOP->op_pmreplstart);
6364 o->op_seq = PL_op_seqmax++;
6365 if (ckWARN(WARN_SYNTAX) && o->op_next
6366 && o->op_next->op_type == OP_NEXTSTATE) {
6367 if (o->op_next->op_sibling &&
6368 o->op_next->op_sibling->op_type != OP_EXIT &&
6369 o->op_next->op_sibling->op_type != OP_WARN &&
6370 o->op_next->op_sibling->op_type != OP_DIE) {
6371 line_t oldline = CopLINE(PL_curcop);
6373 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6374 Perl_warner(aTHX_ WARN_EXEC,
6375 "Statement unlikely to be reached");
6376 Perl_warner(aTHX_ WARN_EXEC,
6377 "(Maybe you meant system() when you said exec()?)\n");
6378 CopLINE_set(PL_curcop, oldline);
6392 if ((o->op_private & (OPpLVAL_INTRO))
6393 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6395 rop = (UNOP*)((BINOP*)o)->op_first;
6396 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6398 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6399 if (!SvOBJECT(lexname))
6401 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6402 if (!fields || !GvHV(*fields))
6404 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6405 key = SvPV(*svp, keylen);
6406 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6408 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6409 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6411 ind = SvIV(*indsvp);
6413 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6414 rop->op_type = OP_RV2AV;
6415 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6416 o->op_type = OP_AELEM;
6417 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6419 *svp = newSViv(ind);
6425 if (!(o->op_flags & OPf_WANT)
6426 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6430 o->op_seq = PL_op_seqmax++;
6434 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6435 o->op_seq = PL_op_seqmax++;
6441 if (last_composite) {
6442 OP *r = last_composite;
6444 while (r->op_sibling)
6447 || (r->op_next->op_type == OP_LIST
6448 && r->op_next->op_next == o))
6450 if (last_composite->op_type == OP_RV2AV)
6451 yyerror("Lvalue subs returning arrays not implemented yet");
6453 yyerror("Lvalue subs returning hashes not implemented yet");
6460 o->op_seq = PL_op_seqmax++;