3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
23 /* #define PL_OP_SLAB_ALLOC */
25 #ifdef PL_OP_SLAB_ALLOC
26 #define SLAB_SIZE 8192
27 static char *PL_OpPtr = NULL;
28 static int PL_OpSpace = 0;
29 #define NewOp(m,var,c,type) do { if ((PL_OpSpace -= c*sizeof(type)) >= 0) \
30 var = (type *)(PL_OpPtr -= c*sizeof(type)); \
32 var = (type *) Slab_Alloc(m,c*sizeof(type)); \
36 S_Slab_Alloc(pTHX_ int m, size_t sz)
38 Newz(m,PL_OpPtr,SLAB_SIZE,char);
39 PL_OpSpace = SLAB_SIZE - sz;
40 return PL_OpPtr += PL_OpSpace;
44 #define NewOp(m, var, c, type) Newz(m, var, c, type)
47 * In the following definition, the ", Nullop" is just to make the compiler
48 * think the expression is of the right type: croak actually does a Siglongjmp.
50 #define CHECKOP(type,o) \
51 ((PL_op_mask && PL_op_mask[type]) \
52 ? ( op_free((OP*)o), \
53 Perl_croak(aTHX_ "%s trapped by operation mask", PL_op_desc[type]), \
55 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
57 #define PAD_MAX 999999999
60 S_gv_ename(pTHX_ GV *gv)
63 SV* tmpsv = sv_newmortal();
64 gv_efullname3(tmpsv, gv, Nullch);
65 return SvPV(tmpsv,n_a);
69 S_no_fh_allowed(pTHX_ OP *o)
71 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
72 PL_op_desc[o->op_type]));
77 S_too_few_arguments(pTHX_ OP *o, char *name)
79 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
84 S_too_many_arguments(pTHX_ OP *o, char *name)
86 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
91 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
93 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
94 (int)n, name, t, PL_op_desc[kid->op_type]));
98 S_no_bareword_allowed(pTHX_ OP *o)
100 qerror(Perl_mess(aTHX_
101 "Bareword \"%s\" not allowed while \"strict subs\" in use",
102 SvPV_nolen(cSVOPo_sv)));
105 /* "register" allocation */
108 Perl_pad_allocmy(pTHX_ char *name)
114 if (!(PL_in_my == KEY_our ||
116 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
117 (name[1] == '_' && (int)strlen(name) > 2)))
119 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
120 /* 1999-02-27 mjd@plover.com */
122 p = strchr(name, '\0');
123 /* The next block assumes the buffer is at least 205 chars
124 long. At present, it's always at least 256 chars. */
126 strcpy(name+200, "...");
132 /* Move everything else down one character */
133 for (; p-name > 2; p--)
135 name[2] = toCTRL(name[1]);
138 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
140 if (ckWARN(WARN_MISC) && AvFILLp(PL_comppad_name) >= 0) {
141 SV **svp = AvARRAY(PL_comppad_name);
142 HV *ourstash = (PL_curstash ? PL_curstash : PL_defstash);
143 PADOFFSET top = AvFILLp(PL_comppad_name);
144 for (off = top; off > PL_comppad_name_floor; off--) {
146 && sv != &PL_sv_undef
147 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
148 && (PL_in_my != KEY_our
149 || ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash))
150 && strEQ(name, SvPVX(sv)))
152 Perl_warner(aTHX_ WARN_MISC,
153 "\"%s\" variable %s masks earlier declaration in same %s",
154 (PL_in_my == KEY_our ? "our" : "my"),
156 (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
161 if (PL_in_my == KEY_our) {
164 && sv != &PL_sv_undef
165 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
166 && ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash)
167 && strEQ(name, SvPVX(sv)))
169 Perl_warner(aTHX_ WARN_MISC,
170 "\"our\" variable %s redeclared", name);
171 Perl_warner(aTHX_ WARN_MISC,
172 "\t(Did you mean \"local\" instead of \"our\"?)\n");
175 } while ( off-- > 0 );
178 off = pad_alloc(OP_PADSV, SVs_PADMY);
180 sv_upgrade(sv, SVt_PVNV);
182 if (PL_in_my_stash) {
184 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"%s\"",
185 name, PL_in_my == KEY_our ? "our" : "my"));
187 (void)SvUPGRADE(sv, SVt_PVMG);
188 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
191 if (PL_in_my == KEY_our) {
192 (void)SvUPGRADE(sv, SVt_PVGV);
193 GvSTASH(sv) = (HV*)SvREFCNT_inc(PL_curstash ? (SV*)PL_curstash : (SV*)PL_defstash);
194 SvFLAGS(sv) |= SVpad_OUR;
196 av_store(PL_comppad_name, off, sv);
197 SvNVX(sv) = (NV)PAD_MAX;
198 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
199 if (!PL_min_intro_pending)
200 PL_min_intro_pending = off;
201 PL_max_intro_pending = off;
203 av_store(PL_comppad, off, (SV*)newAV());
204 else if (*name == '%')
205 av_store(PL_comppad, off, (SV*)newHV());
206 SvPADMY_on(PL_curpad[off]);
211 S_pad_addlex(pTHX_ SV *proto_namesv)
213 SV *namesv = NEWSV(1103,0);
214 PADOFFSET newoff = pad_alloc(OP_PADSV, SVs_PADMY);
215 sv_upgrade(namesv, SVt_PVNV);
216 sv_setpv(namesv, SvPVX(proto_namesv));
217 av_store(PL_comppad_name, newoff, namesv);
218 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
219 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
220 SvFAKE_on(namesv); /* A ref, not a real var */
221 if (SvFLAGS(proto_namesv) & SVpad_OUR) { /* An "our" variable */
222 SvFLAGS(namesv) |= SVpad_OUR;
223 (void)SvUPGRADE(namesv, SVt_PVGV);
224 GvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)GvSTASH(proto_namesv));
226 if (SvOBJECT(proto_namesv)) { /* A typed var */
228 (void)SvUPGRADE(namesv, SVt_PVMG);
229 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(proto_namesv));
235 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
238 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
239 I32 cx_ix, I32 saweval, U32 flags)
246 register PERL_CONTEXT *cx;
248 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
249 AV *curlist = CvPADLIST(cv);
250 SV **svp = av_fetch(curlist, 0, FALSE);
253 if (!svp || *svp == &PL_sv_undef)
256 svp = AvARRAY(curname);
257 for (off = AvFILLp(curname); off > 0; off--) {
258 if ((sv = svp[off]) &&
259 sv != &PL_sv_undef &&
261 seq > I_32(SvNVX(sv)) &&
262 strEQ(SvPVX(sv), name))
273 return 0; /* don't clone from inactive stack frame */
277 oldpad = (AV*)AvARRAY(curlist)[depth];
278 oldsv = *av_fetch(oldpad, off, TRUE);
279 if (!newoff) { /* Not a mere clone operation. */
280 newoff = pad_addlex(sv);
281 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
282 /* "It's closures all the way down." */
283 CvCLONE_on(PL_compcv);
285 if (CvANON(PL_compcv))
286 oldsv = Nullsv; /* no need to keep ref */
291 bcv && bcv != cv && !CvCLONE(bcv);
292 bcv = CvOUTSIDE(bcv))
295 /* install the missing pad entry in intervening
296 * nested subs and mark them cloneable.
297 * XXX fix pad_foo() to not use globals */
298 AV *ocomppad_name = PL_comppad_name;
299 AV *ocomppad = PL_comppad;
300 SV **ocurpad = PL_curpad;
301 AV *padlist = CvPADLIST(bcv);
302 PL_comppad_name = (AV*)AvARRAY(padlist)[0];
303 PL_comppad = (AV*)AvARRAY(padlist)[1];
304 PL_curpad = AvARRAY(PL_comppad);
306 PL_comppad_name = ocomppad_name;
307 PL_comppad = ocomppad;
312 if (ckWARN(WARN_CLOSURE)
313 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
315 Perl_warner(aTHX_ WARN_CLOSURE,
316 "Variable \"%s\" may be unavailable",
324 else if (!CvUNIQUE(PL_compcv)) {
325 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv)
326 && !(SvFLAGS(sv) & SVpad_OUR))
328 Perl_warner(aTHX_ WARN_CLOSURE,
329 "Variable \"%s\" will not stay shared", name);
333 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
339 if (flags & FINDLEX_NOSEARCH)
342 /* Nothing in current lexical context--try eval's context, if any.
343 * This is necessary to let the perldb get at lexically scoped variables.
344 * XXX This will also probably interact badly with eval tree caching.
347 for (i = cx_ix; i >= 0; i--) {
349 switch (CxTYPE(cx)) {
351 if (i == 0 && saweval) {
352 seq = cxstack[saweval].blk_oldcop->cop_seq;
353 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
357 switch (cx->blk_eval.old_op_type) {
364 /* require/do must have their own scope */
373 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
374 saweval = i; /* so we know where we were called from */
377 seq = cxstack[saweval].blk_oldcop->cop_seq;
378 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
386 Perl_pad_findmy(pTHX_ char *name)
392 SV **svp = AvARRAY(PL_comppad_name);
393 U32 seq = PL_cop_seqmax;
399 * Special case to get lexical (and hence per-thread) @_.
400 * XXX I need to find out how to tell at parse-time whether use
401 * of @_ should refer to a lexical (from a sub) or defgv (global
402 * scope and maybe weird sub-ish things like formats). See
403 * startsub in perly.y. It's possible that @_ could be lexical
404 * (at least from subs) even in non-threaded perl.
406 if (strEQ(name, "@_"))
407 return 0; /* success. (NOT_IN_PAD indicates failure) */
408 #endif /* USE_THREADS */
410 /* The one we're looking for is probably just before comppad_name_fill. */
411 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
412 if ((sv = svp[off]) &&
413 sv != &PL_sv_undef &&
416 seq > I_32(SvNVX(sv)))) &&
417 strEQ(SvPVX(sv), name))
419 if (SvIVX(sv) || SvFLAGS(sv) & SVpad_OUR)
420 return (PADOFFSET)off;
421 pendoff = off; /* this pending def. will override import */
425 outside = CvOUTSIDE(PL_compcv);
427 /* Check if if we're compiling an eval'', and adjust seq to be the
428 * eval's seq number. This depends on eval'' having a non-null
429 * CvOUTSIDE() while it is being compiled. The eval'' itself is
430 * identified by CvEVAL being true and CvGV being null. */
431 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
432 cx = &cxstack[cxstack_ix];
434 seq = cx->blk_oldcop->cop_seq;
437 /* See if it's in a nested scope */
438 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
440 /* If there is a pending local definition, this new alias must die */
442 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
443 return off; /* pad_findlex returns 0 for failure...*/
445 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
449 Perl_pad_leavemy(pTHX_ I32 fill)
453 SV **svp = AvARRAY(PL_comppad_name);
455 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
456 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
457 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
458 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
461 /* "Deintroduce" my variables that are leaving with this scope. */
462 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
463 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
464 SvIVX(sv) = PL_cop_seqmax;
469 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
475 if (AvARRAY(PL_comppad) != PL_curpad)
476 Perl_croak(aTHX_ "panic: pad_alloc");
477 if (PL_pad_reset_pending)
479 if (tmptype & SVs_PADMY) {
481 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
482 } while (SvPADBUSY(sv)); /* need a fresh one */
483 retval = AvFILLp(PL_comppad);
486 SV **names = AvARRAY(PL_comppad_name);
487 SSize_t names_fill = AvFILLp(PL_comppad_name);
490 * "foreach" index vars temporarily become aliases to non-"my"
491 * values. Thus we must skip, not just pad values that are
492 * marked as current pad values, but also those with names.
494 if (++PL_padix <= names_fill &&
495 (sv = names[PL_padix]) && sv != &PL_sv_undef)
497 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
498 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)) &&
499 !IS_PADGV(sv) && !IS_PADCONST(sv))
504 SvFLAGS(sv) |= tmptype;
505 PL_curpad = AvARRAY(PL_comppad);
507 DEBUG_X(PerlIO_printf(Perl_debug_log,
508 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
509 PTR2UV(thr), PTR2UV(PL_curpad),
510 (long) retval, PL_op_name[optype]));
512 DEBUG_X(PerlIO_printf(Perl_debug_log,
513 "Pad 0x%"UVxf" alloc %ld for %s\n",
515 (long) retval, PL_op_name[optype]));
516 #endif /* USE_THREADS */
517 return (PADOFFSET)retval;
521 Perl_pad_sv(pTHX_ PADOFFSET po)
525 DEBUG_X(PerlIO_printf(Perl_debug_log,
526 "0x%"UVxf" Pad 0x%"UVxf" sv %"IVdf"\n",
527 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
530 Perl_croak(aTHX_ "panic: pad_sv po");
531 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %"IVdf"\n",
532 PTR2UV(PL_curpad), (IV)po));
533 #endif /* USE_THREADS */
534 return PL_curpad[po]; /* eventually we'll turn this into a macro */
538 Perl_pad_free(pTHX_ PADOFFSET po)
543 if (AvARRAY(PL_comppad) != PL_curpad)
544 Perl_croak(aTHX_ "panic: pad_free curpad");
546 Perl_croak(aTHX_ "panic: pad_free po");
548 DEBUG_X(PerlIO_printf(Perl_debug_log,
549 "0x%"UVxf" Pad 0x%"UVxf" free %"IVdf"\n",
550 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
552 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %"IVdf"\n",
553 PTR2UV(PL_curpad), (IV)po));
554 #endif /* USE_THREADS */
555 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
556 SvPADTMP_off(PL_curpad[po]);
558 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
561 if ((I32)po < PL_padix)
566 Perl_pad_swipe(pTHX_ PADOFFSET po)
569 if (AvARRAY(PL_comppad) != PL_curpad)
570 Perl_croak(aTHX_ "panic: pad_swipe curpad");
572 Perl_croak(aTHX_ "panic: pad_swipe po");
574 DEBUG_X(PerlIO_printf(Perl_debug_log,
575 "0x%"UVxf" Pad 0x%"UVxf" swipe %"IVdf"\n",
576 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
578 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %"IVdf"\n",
579 PTR2UV(PL_curpad), (IV)po));
580 #endif /* USE_THREADS */
581 SvPADTMP_off(PL_curpad[po]);
582 PL_curpad[po] = NEWSV(1107,0);
583 SvPADTMP_on(PL_curpad[po]);
584 if ((I32)po < PL_padix)
588 /* XXX pad_reset() is currently disabled because it results in serious bugs.
589 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
590 * on the stack by OPs that use them, there are several ways to get an alias
591 * to a shared TARG. Such an alias will change randomly and unpredictably.
592 * We avoid doing this until we can think of a Better Way.
597 #ifdef USE_BROKEN_PAD_RESET
601 if (AvARRAY(PL_comppad) != PL_curpad)
602 Perl_croak(aTHX_ "panic: pad_reset curpad");
604 DEBUG_X(PerlIO_printf(Perl_debug_log,
605 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
606 PTR2UV(thr), PTR2UV(PL_curpad)));
608 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
610 #endif /* USE_THREADS */
611 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
612 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
613 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
614 SvPADTMP_off(PL_curpad[po]);
616 PL_padix = PL_padix_floor;
619 PL_pad_reset_pending = FALSE;
623 /* find_threadsv is not reentrant */
625 Perl_find_threadsv(pTHX_ const char *name)
631 /* We currently only handle names of a single character */
632 p = strchr(PL_threadsv_names, *name);
635 key = p - PL_threadsv_names;
636 MUTEX_LOCK(&thr->mutex);
637 svp = av_fetch(thr->threadsv, key, FALSE);
639 MUTEX_UNLOCK(&thr->mutex);
641 SV *sv = NEWSV(0, 0);
642 av_store(thr->threadsv, key, sv);
643 thr->threadsvp = AvARRAY(thr->threadsv);
644 MUTEX_UNLOCK(&thr->mutex);
646 * Some magic variables used to be automagically initialised
647 * in gv_fetchpv. Those which are now per-thread magicals get
648 * initialised here instead.
654 sv_setpv(sv, "\034");
655 sv_magic(sv, 0, 0, name, 1);
660 PL_sawampersand = TRUE;
674 /* XXX %! tied to Errno.pm needs to be added here.
675 * See gv_fetchpv(). */
679 sv_magic(sv, 0, 0, name, 1);
681 DEBUG_S(PerlIO_printf(Perl_error_log,
682 "find_threadsv: new SV %p for $%s%c\n",
683 sv, (*name < 32) ? "^" : "",
684 (*name < 32) ? toCTRL(*name) : *name));
688 #endif /* USE_THREADS */
693 Perl_op_free(pTHX_ OP *o)
695 register OP *kid, *nextkid;
698 if (!o || o->op_seq == (U16)-1)
701 if (o->op_private & OPpREFCOUNTED) {
702 switch (o->op_type) {
710 if (OpREFCNT_dec(o)) {
721 if (o->op_flags & OPf_KIDS) {
722 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
723 nextkid = kid->op_sibling; /* Get before next freeing kid */
731 /* COP* is not cleared by op_clear() so that we may track line
732 * numbers etc even after null() */
733 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
738 #ifdef PL_OP_SLAB_ALLOC
739 if ((char *) o == PL_OpPtr)
748 S_op_clear(pTHX_ OP *o)
750 switch (o->op_type) {
751 case OP_NULL: /* Was holding old type, if any. */
752 case OP_ENTEREVAL: /* Was holding hints. */
754 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
760 if (!(o->op_flags & OPf_SPECIAL))
763 #endif /* USE_THREADS */
765 if (!(o->op_flags & OPf_REF)
766 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
773 if (cPADOPo->op_padix > 0) {
776 pad_swipe(cPADOPo->op_padix);
777 /* No GvIN_PAD_off(gv) here, because other references may still
778 * exist on the pad */
781 cPADOPo->op_padix = 0;
784 SvREFCNT_dec(cSVOPo->op_sv);
785 cSVOPo->op_sv = Nullsv;
788 case OP_METHOD_NAMED:
790 SvREFCNT_dec(cSVOPo->op_sv);
791 cSVOPo->op_sv = Nullsv;
797 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
801 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
802 SvREFCNT_dec(cSVOPo->op_sv);
803 cSVOPo->op_sv = Nullsv;
806 Safefree(cPVOPo->op_pv);
807 cPVOPo->op_pv = Nullch;
811 op_free(cPMOPo->op_pmreplroot);
815 if ((PADOFFSET)cPMOPo->op_pmreplroot) {
817 GV *gv = (GV*)PL_curpad[(PADOFFSET)cPMOPo->op_pmreplroot];
818 pad_swipe((PADOFFSET)cPMOPo->op_pmreplroot);
819 /* No GvIN_PAD_off(gv) here, because other references may still
820 * exist on the pad */
825 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
831 cPMOPo->op_pmreplroot = Nullop;
832 ReREFCNT_dec(cPMOPo->op_pmregexp);
833 cPMOPo->op_pmregexp = (REGEXP*)NULL;
837 if (o->op_targ > 0) {
838 pad_free(o->op_targ);
844 S_cop_free(pTHX_ COP* cop)
846 Safefree(cop->cop_label);
848 Safefree(CopFILE(cop)); /* XXX share in a pvtable? */
849 Safefree(CopSTASHPV(cop)); /* XXX share in a pvtable? */
851 /* NOTE: COP.cop_stash is not refcounted */
852 SvREFCNT_dec(CopFILEGV(cop));
854 if (! specialWARN(cop->cop_warnings))
855 SvREFCNT_dec(cop->cop_warnings);
861 if (o->op_type == OP_NULL)
864 o->op_targ = o->op_type;
865 o->op_type = OP_NULL;
866 o->op_ppaddr = PL_ppaddr[OP_NULL];
869 /* Contextualizers */
871 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
874 Perl_linklist(pTHX_ OP *o)
881 /* establish postfix order */
882 if (cUNOPo->op_first) {
883 o->op_next = LINKLIST(cUNOPo->op_first);
884 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
886 kid->op_next = LINKLIST(kid->op_sibling);
898 Perl_scalarkids(pTHX_ OP *o)
901 if (o && o->op_flags & OPf_KIDS) {
902 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
909 S_scalarboolean(pTHX_ OP *o)
911 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
913 if (ckWARN(WARN_SYNTAX)) {
914 line_t oldline = CopLINE(PL_curcop);
916 if (PL_copline != NOLINE)
917 CopLINE_set(PL_curcop, PL_copline);
918 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
919 CopLINE_set(PL_curcop, oldline);
926 Perl_scalar(pTHX_ OP *o)
930 /* assumes no premature commitment */
931 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
932 || o->op_type == OP_RETURN)
937 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
939 switch (o->op_type) {
941 if (o->op_private & OPpREPEAT_DOLIST)
942 null(((LISTOP*)cBINOPo->op_first)->op_first);
943 scalar(cBINOPo->op_first);
948 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
952 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
953 if (!kPMOP->op_pmreplroot)
954 deprecate("implicit split to @_");
962 if (o->op_flags & OPf_KIDS) {
963 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
969 kid = cLISTOPo->op_first;
971 while ((kid = kid->op_sibling)) {
977 WITH_THR(PL_curcop = &PL_compiling);
982 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
988 WITH_THR(PL_curcop = &PL_compiling);
995 Perl_scalarvoid(pTHX_ OP *o)
1002 if (o->op_type == OP_NEXTSTATE
1003 || o->op_type == OP_SETSTATE
1004 || o->op_type == OP_DBSTATE
1005 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1006 || o->op_targ == OP_SETSTATE
1007 || o->op_targ == OP_DBSTATE)))
1010 PL_curcop = (COP*)o; /* for warning below */
1013 /* assumes no premature commitment */
1014 want = o->op_flags & OPf_WANT;
1015 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
1016 || o->op_type == OP_RETURN)
1021 if ((o->op_private & OPpTARGET_MY)
1022 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1024 return scalar(o); /* As if inside SASSIGN */
1027 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1029 switch (o->op_type) {
1031 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1035 if (o->op_flags & OPf_STACKED)
1039 if (o->op_private == 4)
1081 case OP_GETSOCKNAME:
1082 case OP_GETPEERNAME:
1087 case OP_GETPRIORITY:
1110 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1111 useless = PL_op_desc[o->op_type];
1118 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1119 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1120 useless = "a variable";
1125 if (cSVOPo->op_private & OPpCONST_STRICT)
1126 no_bareword_allowed(o);
1129 if (ckWARN(WARN_VOID)) {
1130 useless = "a constant";
1131 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1133 else if (SvPOK(sv)) {
1134 if (strnEQ(SvPVX(sv), "di", 2) ||
1135 strnEQ(SvPVX(sv), "ds", 2) ||
1136 strnEQ(SvPVX(sv), "ig", 2))
1141 null(o); /* don't execute or even remember it */
1145 o->op_type = OP_PREINC; /* pre-increment is faster */
1146 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1150 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1151 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1157 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1162 if (o->op_flags & OPf_STACKED)
1169 if (!(o->op_flags & OPf_KIDS))
1178 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1185 /* all requires must return a boolean value */
1186 o->op_flags &= ~OPf_WANT;
1191 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1192 if (!kPMOP->op_pmreplroot)
1193 deprecate("implicit split to @_");
1199 if (ckWARN(WARN_VOID))
1200 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1206 Perl_listkids(pTHX_ OP *o)
1209 if (o && o->op_flags & OPf_KIDS) {
1210 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1217 Perl_list(pTHX_ OP *o)
1221 /* assumes no premature commitment */
1222 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1223 || o->op_type == OP_RETURN)
1228 if ((o->op_private & OPpTARGET_MY)
1229 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1231 return o; /* As if inside SASSIGN */
1234 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1236 switch (o->op_type) {
1239 list(cBINOPo->op_first);
1244 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1252 if (!(o->op_flags & OPf_KIDS))
1254 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1255 list(cBINOPo->op_first);
1256 return gen_constant_list(o);
1263 kid = cLISTOPo->op_first;
1265 while ((kid = kid->op_sibling)) {
1266 if (kid->op_sibling)
1271 WITH_THR(PL_curcop = &PL_compiling);
1275 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1276 if (kid->op_sibling)
1281 WITH_THR(PL_curcop = &PL_compiling);
1284 /* all requires must return a boolean value */
1285 o->op_flags &= ~OPf_WANT;
1292 Perl_scalarseq(pTHX_ OP *o)
1297 if (o->op_type == OP_LINESEQ ||
1298 o->op_type == OP_SCOPE ||
1299 o->op_type == OP_LEAVE ||
1300 o->op_type == OP_LEAVETRY)
1303 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1304 if (kid->op_sibling) {
1308 PL_curcop = &PL_compiling;
1310 o->op_flags &= ~OPf_PARENS;
1311 if (PL_hints & HINT_BLOCK_SCOPE)
1312 o->op_flags |= OPf_PARENS;
1315 o = newOP(OP_STUB, 0);
1320 S_modkids(pTHX_ OP *o, I32 type)
1323 if (o && o->op_flags & OPf_KIDS) {
1324 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1331 Perl_mod(pTHX_ OP *o, I32 type)
1337 if (!o || PL_error_count)
1340 if ((o->op_private & OPpTARGET_MY)
1341 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1346 switch (o->op_type) {
1351 if (!(o->op_private & (OPpCONST_ARYBASE)))
1353 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1354 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1358 SAVEI32(PL_compiling.cop_arybase);
1359 PL_compiling.cop_arybase = 0;
1361 else if (type == OP_REFGEN)
1364 Perl_croak(aTHX_ "That use of $[ is unsupported");
1367 if (o->op_flags & OPf_PARENS)
1371 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1372 !(o->op_flags & OPf_STACKED)) {
1373 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1374 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1375 assert(cUNOPo->op_first->op_type == OP_NULL);
1376 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1379 else { /* lvalue subroutine call */
1380 o->op_private |= OPpLVAL_INTRO;
1381 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1382 /* Backward compatibility mode: */
1383 o->op_private |= OPpENTERSUB_INARGS;
1386 else { /* Compile-time error message: */
1387 OP *kid = cUNOPo->op_first;
1391 if (kid->op_type == OP_PUSHMARK)
1393 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1395 "panic: unexpected lvalue entersub "
1396 "args: type/targ %ld:%ld",
1397 (long)kid->op_type,kid->op_targ);
1398 kid = kLISTOP->op_first;
1400 while (kid->op_sibling)
1401 kid = kid->op_sibling;
1402 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1404 if (kid->op_type == OP_METHOD_NAMED
1405 || kid->op_type == OP_METHOD)
1409 if (kid->op_sibling || kid->op_next != kid) {
1410 yyerror("panic: unexpected optree near method call");
1414 NewOp(1101, newop, 1, UNOP);
1415 newop->op_type = OP_RV2CV;
1416 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1417 newop->op_first = Nullop;
1418 newop->op_next = (OP*)newop;
1419 kid->op_sibling = (OP*)newop;
1420 newop->op_private |= OPpLVAL_INTRO;
1424 if (kid->op_type != OP_RV2CV)
1426 "panic: unexpected lvalue entersub "
1427 "entry via type/targ %ld:%ld",
1428 (long)kid->op_type,kid->op_targ);
1429 kid->op_private |= OPpLVAL_INTRO;
1430 break; /* Postpone until runtime */
1434 kid = kUNOP->op_first;
1435 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1436 kid = kUNOP->op_first;
1437 if (kid->op_type == OP_NULL)
1439 "Unexpected constant lvalue entersub "
1440 "entry via type/targ %ld:%ld",
1441 (long)kid->op_type,kid->op_targ);
1442 if (kid->op_type != OP_GV) {
1443 /* Restore RV2CV to check lvalueness */
1445 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1446 okid->op_next = kid->op_next;
1447 kid->op_next = okid;
1450 okid->op_next = Nullop;
1451 okid->op_type = OP_RV2CV;
1453 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1454 okid->op_private |= OPpLVAL_INTRO;
1458 cv = GvCV(kGVOP_gv);
1468 /* grep, foreach, subcalls, refgen */
1469 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1471 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1472 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1474 : (o->op_type == OP_ENTERSUB
1475 ? "non-lvalue subroutine call"
1476 : PL_op_desc[o->op_type])),
1477 type ? PL_op_desc[type] : "local"));
1491 case OP_RIGHT_SHIFT:
1500 if (!(o->op_flags & OPf_STACKED))
1506 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1512 if (!type && cUNOPo->op_first->op_type != OP_GV)
1513 Perl_croak(aTHX_ "Can't localize through a reference");
1514 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1515 PL_modcount = 10000;
1516 return o; /* Treat \(@foo) like ordinary list. */
1520 if (scalar_mod_type(o, type))
1522 ref(cUNOPo->op_first, o->op_type);
1531 PL_modcount = 10000;
1534 if (!type && cUNOPo->op_first->op_type != OP_GV)
1535 Perl_croak(aTHX_ "Can't localize through a reference");
1536 ref(cUNOPo->op_first, o->op_type);
1540 PL_hints |= HINT_BLOCK_SCOPE;
1550 PL_modcount = 10000;
1551 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1552 return o; /* Treat \(@foo) like ordinary list. */
1553 if (scalar_mod_type(o, type))
1559 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1560 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1565 PL_modcount++; /* XXX ??? */
1567 #endif /* USE_THREADS */
1573 if (type != OP_SASSIGN)
1577 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1583 pad_free(o->op_targ);
1584 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1585 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1586 if (o->op_flags & OPf_KIDS)
1587 mod(cBINOPo->op_first->op_sibling, type);
1592 ref(cBINOPo->op_first, o->op_type);
1593 if (type == OP_ENTERSUB &&
1594 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1595 o->op_private |= OPpLVAL_DEFER;
1602 if (o->op_flags & OPf_KIDS)
1603 mod(cLISTOPo->op_last, type);
1607 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1609 else if (!(o->op_flags & OPf_KIDS))
1611 if (o->op_targ != OP_LIST) {
1612 mod(cBINOPo->op_first, type);
1617 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1621 o->op_flags |= OPf_MOD;
1623 if (type == OP_AASSIGN || type == OP_SASSIGN)
1624 o->op_flags |= OPf_SPECIAL|OPf_REF;
1626 o->op_private |= OPpLVAL_INTRO;
1627 o->op_flags &= ~OPf_SPECIAL;
1628 PL_hints |= HINT_BLOCK_SCOPE;
1630 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1631 o->op_flags |= OPf_REF;
1636 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1640 if (o->op_type == OP_RV2GV)
1664 case OP_RIGHT_SHIFT:
1683 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1685 switch (o->op_type) {
1693 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1706 Perl_refkids(pTHX_ OP *o, I32 type)
1709 if (o && o->op_flags & OPf_KIDS) {
1710 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1717 Perl_ref(pTHX_ OP *o, I32 type)
1721 if (!o || PL_error_count)
1724 switch (o->op_type) {
1726 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1727 !(o->op_flags & OPf_STACKED)) {
1728 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1729 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1730 assert(cUNOPo->op_first->op_type == OP_NULL);
1731 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1732 o->op_flags |= OPf_SPECIAL;
1737 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1741 if (type == OP_DEFINED)
1742 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1743 ref(cUNOPo->op_first, o->op_type);
1746 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1747 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1748 : type == OP_RV2HV ? OPpDEREF_HV
1750 o->op_flags |= OPf_MOD;
1755 o->op_flags |= OPf_MOD; /* XXX ??? */
1760 o->op_flags |= OPf_REF;
1763 if (type == OP_DEFINED)
1764 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1765 ref(cUNOPo->op_first, o->op_type);
1770 o->op_flags |= OPf_REF;
1775 if (!(o->op_flags & OPf_KIDS))
1777 ref(cBINOPo->op_first, type);
1781 ref(cBINOPo->op_first, o->op_type);
1782 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1783 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1784 : type == OP_RV2HV ? OPpDEREF_HV
1786 o->op_flags |= OPf_MOD;
1794 if (!(o->op_flags & OPf_KIDS))
1796 ref(cLISTOPo->op_last, type);
1806 S_dup_attrlist(pTHX_ OP *o)
1810 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1811 * where the first kid is OP_PUSHMARK and the remaining ones
1812 * are OP_CONST. We need to push the OP_CONST values.
1814 if (o->op_type == OP_CONST)
1815 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1817 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1818 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1819 if (o->op_type == OP_CONST)
1820 rop = append_elem(OP_LIST, rop,
1821 newSVOP(OP_CONST, o->op_flags,
1822 SvREFCNT_inc(cSVOPo->op_sv)));
1829 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1833 /* fake up C<use attributes $pkg,$rv,@attrs> */
1834 ENTER; /* need to protect against side-effects of 'use' */
1836 if (stash && HvNAME(stash))
1837 stashsv = newSVpv(HvNAME(stash), 0);
1839 stashsv = &PL_sv_no;
1841 #define ATTRSMODULE "attributes"
1843 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1844 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1846 prepend_elem(OP_LIST,
1847 newSVOP(OP_CONST, 0, stashsv),
1848 prepend_elem(OP_LIST,
1849 newSVOP(OP_CONST, 0,
1851 dup_attrlist(attrs))));
1856 Perl_apply_attrs_string(pTHX_ char *stashpv, CV *cv,
1857 char *attrstr, STRLEN len)
1862 len = strlen(attrstr);
1866 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
1868 char *sstr = attrstr;
1869 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
1870 attrs = append_elem(OP_LIST, attrs,
1871 newSVOP(OP_CONST, 0,
1872 newSVpvn(sstr, attrstr-sstr)));
1876 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1877 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1878 Nullsv, prepend_elem(OP_LIST,
1879 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
1880 prepend_elem(OP_LIST,
1881 newSVOP(OP_CONST, 0,
1887 S_my_kid(pTHX_ OP *o, OP *attrs)
1892 if (!o || PL_error_count)
1896 if (type == OP_LIST) {
1897 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1899 } else if (type == OP_UNDEF) {
1901 } else if (type == OP_RV2SV || /* "our" declaration */
1903 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1904 o->op_private |= OPpOUR_INTRO;
1906 } else if (type != OP_PADSV &&
1909 type != OP_PUSHMARK)
1911 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1912 PL_op_desc[o->op_type],
1913 PL_in_my == KEY_our ? "our" : "my"));
1916 else if (attrs && type != OP_PUSHMARK) {
1922 PL_in_my_stash = Nullhv;
1924 /* check for C<my Dog $spot> when deciding package */
1925 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1926 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1927 stash = SvSTASH(*namesvp);
1929 stash = PL_curstash;
1930 padsv = PAD_SV(o->op_targ);
1931 apply_attrs(stash, padsv, attrs);
1933 o->op_flags |= OPf_MOD;
1934 o->op_private |= OPpLVAL_INTRO;
1939 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1941 if (o->op_flags & OPf_PARENS)
1945 o = my_kid(o, attrs);
1947 PL_in_my_stash = Nullhv;
1952 Perl_my(pTHX_ OP *o)
1954 return my_kid(o, Nullop);
1958 Perl_sawparens(pTHX_ OP *o)
1961 o->op_flags |= OPf_PARENS;
1966 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1971 if (ckWARN(WARN_MISC) &&
1972 (left->op_type == OP_RV2AV ||
1973 left->op_type == OP_RV2HV ||
1974 left->op_type == OP_PADAV ||
1975 left->op_type == OP_PADHV)) {
1976 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1977 right->op_type == OP_TRANS)
1978 ? right->op_type : OP_MATCH];
1979 const char *sample = ((left->op_type == OP_RV2AV ||
1980 left->op_type == OP_PADAV)
1981 ? "@array" : "%hash");
1982 Perl_warner(aTHX_ WARN_MISC,
1983 "Applying %s to %s will act on scalar(%s)",
1984 desc, sample, sample);
1987 if (!(right->op_flags & OPf_STACKED) &&
1988 (right->op_type == OP_MATCH ||
1989 right->op_type == OP_SUBST ||
1990 right->op_type == OP_TRANS)) {
1991 right->op_flags |= OPf_STACKED;
1992 if (right->op_type != OP_MATCH &&
1993 ! (right->op_type == OP_TRANS &&
1994 right->op_private & OPpTRANS_IDENTICAL))
1995 left = mod(left, right->op_type);
1996 if (right->op_type == OP_TRANS)
1997 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1999 o = prepend_elem(right->op_type, scalar(left), right);
2001 return newUNOP(OP_NOT, 0, scalar(o));
2005 return bind_match(type, left,
2006 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
2010 Perl_invert(pTHX_ OP *o)
2014 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
2015 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2019 Perl_scope(pTHX_ OP *o)
2022 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2023 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2024 o->op_type = OP_LEAVE;
2025 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2028 if (o->op_type == OP_LINESEQ) {
2030 o->op_type = OP_SCOPE;
2031 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2032 kid = ((LISTOP*)o)->op_first;
2033 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2037 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
2044 Perl_save_hints(pTHX)
2047 SAVESPTR(GvHV(PL_hintgv));
2048 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
2049 SAVEFREESV(GvHV(PL_hintgv));
2053 Perl_block_start(pTHX_ int full)
2056 int retval = PL_savestack_ix;
2058 SAVEI32(PL_comppad_name_floor);
2059 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
2061 PL_comppad_name_fill = PL_comppad_name_floor;
2062 if (PL_comppad_name_floor < 0)
2063 PL_comppad_name_floor = 0;
2064 SAVEI32(PL_min_intro_pending);
2065 SAVEI32(PL_max_intro_pending);
2066 PL_min_intro_pending = 0;
2067 SAVEI32(PL_comppad_name_fill);
2068 SAVEI32(PL_padix_floor);
2069 PL_padix_floor = PL_padix;
2070 PL_pad_reset_pending = FALSE;
2072 PL_hints &= ~HINT_BLOCK_SCOPE;
2073 SAVESPTR(PL_compiling.cop_warnings);
2074 if (! specialWARN(PL_compiling.cop_warnings)) {
2075 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2076 SAVEFREESV(PL_compiling.cop_warnings) ;
2082 Perl_block_end(pTHX_ I32 floor, OP *seq)
2085 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2086 OP* retval = scalarseq(seq);
2088 PL_pad_reset_pending = FALSE;
2089 PL_compiling.op_private = PL_hints;
2091 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2092 pad_leavemy(PL_comppad_name_fill);
2101 OP *o = newOP(OP_THREADSV, 0);
2102 o->op_targ = find_threadsv("_");
2105 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2106 #endif /* USE_THREADS */
2110 Perl_newPROG(pTHX_ OP *o)
2116 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2117 ((PL_in_eval & EVAL_KEEPERR)
2118 ? OPf_SPECIAL : 0), o);
2119 PL_eval_start = linklist(PL_eval_root);
2120 PL_eval_root->op_private |= OPpREFCOUNTED;
2121 OpREFCNT_set(PL_eval_root, 1);
2122 PL_eval_root->op_next = 0;
2123 peep(PL_eval_start);
2128 PL_main_root = scope(sawparens(scalarvoid(o)));
2129 PL_curcop = &PL_compiling;
2130 PL_main_start = LINKLIST(PL_main_root);
2131 PL_main_root->op_private |= OPpREFCOUNTED;
2132 OpREFCNT_set(PL_main_root, 1);
2133 PL_main_root->op_next = 0;
2134 peep(PL_main_start);
2137 /* Register with debugger */
2139 CV *cv = get_cv("DB::postponed", FALSE);
2143 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2145 call_sv((SV*)cv, G_DISCARD);
2152 Perl_localize(pTHX_ OP *o, I32 lex)
2154 if (o->op_flags & OPf_PARENS)
2158 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2160 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2161 if (*s == ';' || *s == '=')
2162 Perl_warner(aTHX_ WARN_PARENTHESIS,
2163 "Parentheses missing around \"%s\" list",
2164 lex ? (PL_in_my == KEY_our ? "our" : "my") : "local");
2170 o = mod(o, OP_NULL); /* a bit kludgey */
2172 PL_in_my_stash = Nullhv;
2177 Perl_jmaybe(pTHX_ OP *o)
2179 if (o->op_type == OP_LIST) {
2182 o2 = newOP(OP_THREADSV, 0);
2183 o2->op_targ = find_threadsv(";");
2185 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2186 #endif /* USE_THREADS */
2187 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2193 Perl_fold_constants(pTHX_ register OP *o)
2197 I32 type = o->op_type;
2200 if (PL_opargs[type] & OA_RETSCALAR)
2202 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2203 o->op_targ = pad_alloc(type, SVs_PADTMP);
2205 /* integerize op, unless it happens to be C<-foo>.
2206 * XXX should pp_i_negate() do magic string negation instead? */
2207 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2208 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2209 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2211 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2214 if (!(PL_opargs[type] & OA_FOLDCONST))
2219 /* XXX might want a ck_negate() for this */
2220 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2233 if (o->op_private & OPpLOCALE)
2238 goto nope; /* Don't try to run w/ errors */
2240 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2241 if ((curop->op_type != OP_CONST ||
2242 (curop->op_private & OPpCONST_BARE)) &&
2243 curop->op_type != OP_LIST &&
2244 curop->op_type != OP_SCALAR &&
2245 curop->op_type != OP_NULL &&
2246 curop->op_type != OP_PUSHMARK)
2252 curop = LINKLIST(o);
2256 sv = *(PL_stack_sp--);
2257 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2258 pad_swipe(o->op_targ);
2259 else if (SvTEMP(sv)) { /* grab mortal temp? */
2260 (void)SvREFCNT_inc(sv);
2264 if (type == OP_RV2GV)
2265 return newGVOP(OP_GV, 0, (GV*)sv);
2267 /* try to smush double to int, but don't smush -2.0 to -2 */
2268 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2272 if ((NV)iv == SvNV(sv)) {
2277 SvIOK_off(sv); /* undo SvIV() damage */
2279 return newSVOP(OP_CONST, 0, sv);
2283 if (!(PL_opargs[type] & OA_OTHERINT))
2286 if (!(PL_hints & HINT_INTEGER)) {
2287 if (type == OP_MODULO
2288 || type == OP_DIVIDE
2289 || !(o->op_flags & OPf_KIDS))
2294 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2295 if (curop->op_type == OP_CONST) {
2296 if (SvIOK(((SVOP*)curop)->op_sv))
2300 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2304 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2311 Perl_gen_constant_list(pTHX_ register OP *o)
2315 I32 oldtmps_floor = PL_tmps_floor;
2319 return o; /* Don't attempt to run with errors */
2321 PL_op = curop = LINKLIST(o);
2328 PL_tmps_floor = oldtmps_floor;
2330 o->op_type = OP_RV2AV;
2331 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2332 curop = ((UNOP*)o)->op_first;
2333 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2340 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2345 if (!o || o->op_type != OP_LIST)
2346 o = newLISTOP(OP_LIST, 0, o, Nullop);
2348 o->op_flags &= ~OPf_WANT;
2350 if (!(PL_opargs[type] & OA_MARK))
2351 null(cLISTOPo->op_first);
2354 o->op_ppaddr = PL_ppaddr[type];
2355 o->op_flags |= flags;
2357 o = CHECKOP(type, o);
2358 if (o->op_type != type)
2361 if (cLISTOPo->op_children < 7) {
2362 /* XXX do we really need to do this if we're done appending?? */
2363 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2365 cLISTOPo->op_last = last; /* in case check substituted last arg */
2368 return fold_constants(o);
2371 /* List constructors */
2374 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2382 if (first->op_type != type
2383 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2385 return newLISTOP(type, 0, first, last);
2388 if (first->op_flags & OPf_KIDS)
2389 ((LISTOP*)first)->op_last->op_sibling = last;
2391 first->op_flags |= OPf_KIDS;
2392 ((LISTOP*)first)->op_first = last;
2394 ((LISTOP*)first)->op_last = last;
2395 ((LISTOP*)first)->op_children++;
2400 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2408 if (first->op_type != type)
2409 return prepend_elem(type, (OP*)first, (OP*)last);
2411 if (last->op_type != type)
2412 return append_elem(type, (OP*)first, (OP*)last);
2414 first->op_last->op_sibling = last->op_first;
2415 first->op_last = last->op_last;
2416 first->op_children += last->op_children;
2417 if (first->op_children)
2418 first->op_flags |= OPf_KIDS;
2420 #ifdef PL_OP_SLAB_ALLOC
2428 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2436 if (last->op_type == type) {
2437 if (type == OP_LIST) { /* already a PUSHMARK there */
2438 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2439 ((LISTOP*)last)->op_first->op_sibling = first;
2442 if (!(last->op_flags & OPf_KIDS)) {
2443 ((LISTOP*)last)->op_last = first;
2444 last->op_flags |= OPf_KIDS;
2446 first->op_sibling = ((LISTOP*)last)->op_first;
2447 ((LISTOP*)last)->op_first = first;
2449 ((LISTOP*)last)->op_children++;
2453 return newLISTOP(type, 0, first, last);
2459 Perl_newNULLLIST(pTHX)
2461 return newOP(OP_STUB, 0);
2465 Perl_force_list(pTHX_ OP *o)
2467 if (!o || o->op_type != OP_LIST)
2468 o = newLISTOP(OP_LIST, 0, o, Nullop);
2474 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2478 NewOp(1101, listop, 1, LISTOP);
2480 listop->op_type = type;
2481 listop->op_ppaddr = PL_ppaddr[type];
2482 listop->op_children = (first != 0) + (last != 0);
2483 listop->op_flags = flags;
2487 else if (!first && last)
2490 first->op_sibling = last;
2491 listop->op_first = first;
2492 listop->op_last = last;
2493 if (type == OP_LIST) {
2495 pushop = newOP(OP_PUSHMARK, 0);
2496 pushop->op_sibling = first;
2497 listop->op_first = pushop;
2498 listop->op_flags |= OPf_KIDS;
2500 listop->op_last = pushop;
2502 else if (listop->op_children)
2503 listop->op_flags |= OPf_KIDS;
2509 Perl_newOP(pTHX_ I32 type, I32 flags)
2512 NewOp(1101, o, 1, OP);
2514 o->op_ppaddr = PL_ppaddr[type];
2515 o->op_flags = flags;
2518 o->op_private = 0 + (flags >> 8);
2519 if (PL_opargs[type] & OA_RETSCALAR)
2521 if (PL_opargs[type] & OA_TARGET)
2522 o->op_targ = pad_alloc(type, SVs_PADTMP);
2523 return CHECKOP(type, o);
2527 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2532 first = newOP(OP_STUB, 0);
2533 if (PL_opargs[type] & OA_MARK)
2534 first = force_list(first);
2536 NewOp(1101, unop, 1, UNOP);
2537 unop->op_type = type;
2538 unop->op_ppaddr = PL_ppaddr[type];
2539 unop->op_first = first;
2540 unop->op_flags = flags | OPf_KIDS;
2541 unop->op_private = 1 | (flags >> 8);
2542 unop = (UNOP*) CHECKOP(type, unop);
2546 return fold_constants((OP *) unop);
2550 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2553 NewOp(1101, binop, 1, BINOP);
2556 first = newOP(OP_NULL, 0);
2558 binop->op_type = type;
2559 binop->op_ppaddr = PL_ppaddr[type];
2560 binop->op_first = first;
2561 binop->op_flags = flags | OPf_KIDS;
2564 binop->op_private = 1 | (flags >> 8);
2567 binop->op_private = 2 | (flags >> 8);
2568 first->op_sibling = last;
2571 binop = (BINOP*)CHECKOP(type, binop);
2572 if (binop->op_next || binop->op_type != type)
2575 binop->op_last = binop->op_first->op_sibling;
2577 return fold_constants((OP *)binop);
2581 utf8compare(const void *a, const void *b)
2584 for (i = 0; i < 10; i++) {
2585 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2587 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2594 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2596 SV *tstr = ((SVOP*)expr)->op_sv;
2597 SV *rstr = ((SVOP*)repl)->op_sv;
2600 register U8 *t = (U8*)SvPV(tstr, tlen);
2601 register U8 *r = (U8*)SvPV(rstr, rlen);
2607 register short *tbl;
2609 complement = o->op_private & OPpTRANS_COMPLEMENT;
2610 del = o->op_private & OPpTRANS_DELETE;
2611 squash = o->op_private & OPpTRANS_SQUASH;
2614 o->op_private |= OPpTRANS_FROM_UTF;
2617 o->op_private |= OPpTRANS_TO_UTF;
2619 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2620 SV* listsv = newSVpvn("# comment\n",10);
2622 U8* tend = t + tlen;
2623 U8* rend = r + rlen;
2638 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2639 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2642 U8 tmpbuf[UTF8_MAXLEN];
2646 New(1109, cp, tlen, U8*);
2648 transv = newSVpvn("",0);
2657 qsort(cp, i, sizeof(U8*), utf8compare);
2658 for (j = 0; j < i; j++) {
2660 I32 cur = j < i ? cp[j+1] - s : tend - s;
2661 UV val = utf8_to_uv(s, cur, &ulen, 0);
2663 diff = val - nextmin;
2665 t = uv_to_utf8(tmpbuf,nextmin);
2666 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2668 t = uv_to_utf8(tmpbuf, val - 1);
2669 sv_catpvn(transv, "\377", 1);
2670 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2674 val = utf8_to_uv(s+1, cur - 1, &ulen, 0);
2678 t = uv_to_utf8(tmpbuf,nextmin);
2679 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2680 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2681 sv_catpvn(transv, "\377", 1);
2682 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2683 t = (U8*)SvPVX(transv);
2684 tlen = SvCUR(transv);
2687 else if (!rlen && !del) {
2688 r = t; rlen = tlen; rend = tend;
2692 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
2694 o->op_private |= OPpTRANS_IDENTICAL;
2698 while (t < tend || tfirst <= tlast) {
2699 /* see if we need more "t" chars */
2700 if (tfirst > tlast) {
2701 tfirst = (I32)utf8_to_uv(t, tend - t, &ulen, 0);
2703 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2705 tlast = (I32)utf8_to_uv(t, tend - t, &ulen, 0);
2712 /* now see if we need more "r" chars */
2713 if (rfirst > rlast) {
2715 rfirst = (I32)utf8_to_uv(r, rend - r, &ulen, 0);
2717 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2719 rlast = (I32)utf8_to_uv(r, rend - r, &ulen, 0);
2728 rfirst = rlast = 0xffffffff;
2732 /* now see which range will peter our first, if either. */
2733 tdiff = tlast - tfirst;
2734 rdiff = rlast - rfirst;
2741 if (rfirst == 0xffffffff) {
2742 diff = tdiff; /* oops, pretend rdiff is infinite */
2744 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2745 (long)tfirst, (long)tlast);
2747 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2751 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2752 (long)tfirst, (long)(tfirst + diff),
2755 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2756 (long)tfirst, (long)rfirst);
2758 if (rfirst + diff > max)
2759 max = rfirst + diff;
2764 else if (rfirst <= 0x800)
2765 grows |= (tfirst < 0x80);
2766 else if (rfirst <= 0x10000)
2767 grows |= (tfirst < 0x800);
2768 else if (rfirst <= 0x200000)
2769 grows |= (tfirst < 0x10000);
2770 else if (rfirst <= 0x4000000)
2771 grows |= (tfirst < 0x200000);
2772 else if (rfirst <= 0x80000000)
2773 grows |= (tfirst < 0x4000000);
2785 else if (max > 0xff)
2790 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2791 SvREFCNT_dec(listsv);
2793 SvREFCNT_dec(transv);
2795 if (!del && havefinal)
2796 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
2797 newSVuv((UV)final), 0);
2799 if (grows && to_utf)
2800 o->op_private |= OPpTRANS_GROWS;
2807 tbl = (short*)cPVOPo->op_pv;
2809 Zero(tbl, 256, short);
2810 for (i = 0; i < tlen; i++)
2812 for (i = 0, j = 0; i < 256; i++) {
2828 if (!rlen && !del) {
2831 o->op_private |= OPpTRANS_IDENTICAL;
2833 for (i = 0; i < 256; i++)
2835 for (i = 0, j = 0; i < tlen; i++,j++) {
2838 if (tbl[t[i]] == -1)
2844 if (tbl[t[i]] == -1)
2855 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2860 NewOp(1101, pmop, 1, PMOP);
2861 pmop->op_type = type;
2862 pmop->op_ppaddr = PL_ppaddr[type];
2863 pmop->op_flags = flags;
2864 pmop->op_private = 0 | (flags >> 8);
2866 if (PL_hints & HINT_RE_TAINT)
2867 pmop->op_pmpermflags |= PMf_RETAINT;
2868 if (PL_hints & HINT_LOCALE)
2869 pmop->op_pmpermflags |= PMf_LOCALE;
2870 pmop->op_pmflags = pmop->op_pmpermflags;
2872 /* link into pm list */
2873 if (type != OP_TRANS && PL_curstash) {
2874 pmop->op_pmnext = HvPMROOT(PL_curstash);
2875 HvPMROOT(PL_curstash) = pmop;
2882 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2887 I32 repl_has_vars = 0;
2889 if (o->op_type == OP_TRANS)
2890 return pmtrans(o, expr, repl);
2892 PL_hints |= HINT_BLOCK_SCOPE;
2895 if (expr->op_type == OP_CONST) {
2897 SV *pat = ((SVOP*)expr)->op_sv;
2898 char *p = SvPV(pat, plen);
2899 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2900 sv_setpvn(pat, "\\s+", 3);
2901 p = SvPV(pat, plen);
2902 pm->op_pmflags |= PMf_SKIPWHITE;
2904 if ((PL_hints & HINT_UTF8) || (SvUTF8(pat) && !(PL_hints & HINT_BYTE)))
2905 pm->op_pmdynflags |= PMdf_UTF8;
2906 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2907 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2908 pm->op_pmflags |= PMf_WHITE;
2912 if (PL_hints & HINT_UTF8)
2913 pm->op_pmdynflags |= PMdf_UTF8;
2914 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2915 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2917 : OP_REGCMAYBE),0,expr);
2919 NewOp(1101, rcop, 1, LOGOP);
2920 rcop->op_type = OP_REGCOMP;
2921 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2922 rcop->op_first = scalar(expr);
2923 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2924 ? (OPf_SPECIAL | OPf_KIDS)
2926 rcop->op_private = 1;
2929 /* establish postfix order */
2930 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2932 rcop->op_next = expr;
2933 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2936 rcop->op_next = LINKLIST(expr);
2937 expr->op_next = (OP*)rcop;
2940 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2945 if (pm->op_pmflags & PMf_EVAL) {
2947 if (CopLINE(PL_curcop) < PL_multi_end)
2948 CopLINE_set(PL_curcop, PL_multi_end);
2951 else if (repl->op_type == OP_THREADSV
2952 && strchr("&`'123456789+",
2953 PL_threadsv_names[repl->op_targ]))
2957 #endif /* USE_THREADS */
2958 else if (repl->op_type == OP_CONST)
2962 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2963 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2965 if (curop->op_type == OP_THREADSV) {
2967 if (strchr("&`'123456789+", curop->op_private))
2971 if (curop->op_type == OP_GV) {
2972 GV *gv = cGVOPx_gv(curop);
2974 if (strchr("&`'123456789+", *GvENAME(gv)))
2977 #endif /* USE_THREADS */
2978 else if (curop->op_type == OP_RV2CV)
2980 else if (curop->op_type == OP_RV2SV ||
2981 curop->op_type == OP_RV2AV ||
2982 curop->op_type == OP_RV2HV ||
2983 curop->op_type == OP_RV2GV) {
2984 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2987 else if (curop->op_type == OP_PADSV ||
2988 curop->op_type == OP_PADAV ||
2989 curop->op_type == OP_PADHV ||
2990 curop->op_type == OP_PADANY) {
2993 else if (curop->op_type == OP_PUSHRE)
2994 ; /* Okay here, dangerous in newASSIGNOP */
3003 && (!pm->op_pmregexp
3004 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
3005 pm->op_pmflags |= PMf_CONST; /* const for long enough */
3006 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
3007 prepend_elem(o->op_type, scalar(repl), o);
3010 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
3011 pm->op_pmflags |= PMf_MAYBE_CONST;
3012 pm->op_pmpermflags |= PMf_MAYBE_CONST;
3014 NewOp(1101, rcop, 1, LOGOP);
3015 rcop->op_type = OP_SUBSTCONT;
3016 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3017 rcop->op_first = scalar(repl);
3018 rcop->op_flags |= OPf_KIDS;
3019 rcop->op_private = 1;
3022 /* establish postfix order */
3023 rcop->op_next = LINKLIST(repl);
3024 repl->op_next = (OP*)rcop;
3026 pm->op_pmreplroot = scalar((OP*)rcop);
3027 pm->op_pmreplstart = LINKLIST(rcop);
3036 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3039 NewOp(1101, svop, 1, SVOP);
3040 svop->op_type = type;
3041 svop->op_ppaddr = PL_ppaddr[type];
3043 svop->op_next = (OP*)svop;
3044 svop->op_flags = flags;
3045 if (PL_opargs[type] & OA_RETSCALAR)
3047 if (PL_opargs[type] & OA_TARGET)
3048 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3049 return CHECKOP(type, svop);
3053 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3056 NewOp(1101, padop, 1, PADOP);
3057 padop->op_type = type;
3058 padop->op_ppaddr = PL_ppaddr[type];
3059 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3060 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3061 PL_curpad[padop->op_padix] = sv;
3063 padop->op_next = (OP*)padop;
3064 padop->op_flags = flags;
3065 if (PL_opargs[type] & OA_RETSCALAR)
3067 if (PL_opargs[type] & OA_TARGET)
3068 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3069 return CHECKOP(type, padop);
3073 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3078 return newPADOP(type, flags, SvREFCNT_inc(gv));
3080 return newSVOP(type, flags, SvREFCNT_inc(gv));
3085 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3088 NewOp(1101, pvop, 1, PVOP);
3089 pvop->op_type = type;
3090 pvop->op_ppaddr = PL_ppaddr[type];
3092 pvop->op_next = (OP*)pvop;
3093 pvop->op_flags = flags;
3094 if (PL_opargs[type] & OA_RETSCALAR)
3096 if (PL_opargs[type] & OA_TARGET)
3097 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3098 return CHECKOP(type, pvop);
3102 Perl_package(pTHX_ OP *o)
3107 save_hptr(&PL_curstash);
3108 save_item(PL_curstname);
3113 name = SvPV(sv, len);
3114 PL_curstash = gv_stashpvn(name,len,TRUE);
3115 sv_setpvn(PL_curstname, name, len);
3119 sv_setpv(PL_curstname,"<none>");
3120 PL_curstash = Nullhv;
3122 PL_hints |= HINT_BLOCK_SCOPE;
3123 PL_copline = NOLINE;
3128 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3136 if (id->op_type != OP_CONST)
3137 Perl_croak(aTHX_ "Module name must be constant");
3141 if (version != Nullop) {
3142 SV *vesv = ((SVOP*)version)->op_sv;
3144 if (arg == Nullop && !SvNIOKp(vesv)) {
3151 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3152 Perl_croak(aTHX_ "Version number must be constant number");
3154 /* Make copy of id so we don't free it twice */
3155 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3157 /* Fake up a method call to VERSION */
3158 meth = newSVpvn("VERSION",7);
3159 sv_upgrade(meth, SVt_PVIV);
3160 (void)SvIOK_on(meth);
3161 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3162 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3163 append_elem(OP_LIST,
3164 prepend_elem(OP_LIST, pack, list(version)),
3165 newSVOP(OP_METHOD_NAMED, 0, meth)));
3169 /* Fake up an import/unimport */
3170 if (arg && arg->op_type == OP_STUB)
3171 imop = arg; /* no import on explicit () */
3172 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3173 imop = Nullop; /* use 5.0; */
3178 /* Make copy of id so we don't free it twice */
3179 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3181 /* Fake up a method call to import/unimport */
3182 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);;
3183 sv_upgrade(meth, SVt_PVIV);
3184 (void)SvIOK_on(meth);
3185 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3186 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3187 append_elem(OP_LIST,
3188 prepend_elem(OP_LIST, pack, list(arg)),
3189 newSVOP(OP_METHOD_NAMED, 0, meth)));
3192 /* Fake up a require, handle override, if any */
3193 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3194 if (!(gv && GvIMPORTED_CV(gv)))
3195 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3197 if (gv && GvIMPORTED_CV(gv)) {
3198 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3199 append_elem(OP_LIST, id,
3200 scalar(newUNOP(OP_RV2CV, 0,
3205 rqop = newUNOP(OP_REQUIRE, 0, id);
3208 /* Fake up the BEGIN {}, which does its thing immediately. */
3210 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3213 append_elem(OP_LINESEQ,
3214 append_elem(OP_LINESEQ,
3215 newSTATEOP(0, Nullch, rqop),
3216 newSTATEOP(0, Nullch, veop)),
3217 newSTATEOP(0, Nullch, imop) ));
3219 PL_hints |= HINT_BLOCK_SCOPE;
3220 PL_copline = NOLINE;
3225 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3228 va_start(args, ver);
3229 vload_module(flags, name, ver, &args);
3233 #ifdef PERL_IMPLICIT_CONTEXT
3235 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3239 va_start(args, ver);
3240 vload_module(flags, name, ver, &args);
3246 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3248 OP *modname, *veop, *imop;
3250 modname = newSVOP(OP_CONST, 0, name);
3251 modname->op_private |= OPpCONST_BARE;
3253 veop = newSVOP(OP_CONST, 0, ver);
3257 if (flags & PERL_LOADMOD_NOIMPORT) {
3258 imop = sawparens(newNULLLIST());
3260 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3261 imop = va_arg(*args, OP*);
3266 sv = va_arg(*args, SV*);
3268 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3269 sv = va_arg(*args, SV*);
3273 line_t ocopline = PL_copline;
3274 int oexpect = PL_expect;
3276 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3277 veop, modname, imop);
3278 PL_expect = oexpect;
3279 PL_copline = ocopline;
3284 Perl_dofile(pTHX_ OP *term)
3289 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3290 if (!(gv && GvIMPORTED_CV(gv)))
3291 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3293 if (gv && GvIMPORTED_CV(gv)) {
3294 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3295 append_elem(OP_LIST, term,
3296 scalar(newUNOP(OP_RV2CV, 0,
3301 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3307 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3309 return newBINOP(OP_LSLICE, flags,
3310 list(force_list(subscript)),
3311 list(force_list(listval)) );
3315 S_list_assignment(pTHX_ register OP *o)
3320 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3321 o = cUNOPo->op_first;
3323 if (o->op_type == OP_COND_EXPR) {
3324 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3325 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3330 yyerror("Assignment to both a list and a scalar");
3334 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3335 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3336 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3339 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3342 if (o->op_type == OP_RV2SV)
3349 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3354 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3355 return newLOGOP(optype, 0,
3356 mod(scalar(left), optype),
3357 newUNOP(OP_SASSIGN, 0, scalar(right)));
3360 return newBINOP(optype, OPf_STACKED,
3361 mod(scalar(left), optype), scalar(right));
3365 if (list_assignment(left)) {
3370 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3371 left = mod(left, OP_AASSIGN);
3379 curop = list(force_list(left));
3380 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3381 o->op_private = 0 | (flags >> 8);
3382 for (curop = ((LISTOP*)curop)->op_first;
3383 curop; curop = curop->op_sibling)
3385 if (curop->op_type == OP_RV2HV &&
3386 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3387 o->op_private |= OPpASSIGN_HASH;
3391 if (!(left->op_private & OPpLVAL_INTRO)) {
3394 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3395 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3396 if (curop->op_type == OP_GV) {
3397 GV *gv = cGVOPx_gv(curop);
3398 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3400 SvCUR(gv) = PL_generation;
3402 else if (curop->op_type == OP_PADSV ||
3403 curop->op_type == OP_PADAV ||
3404 curop->op_type == OP_PADHV ||
3405 curop->op_type == OP_PADANY) {
3406 SV **svp = AvARRAY(PL_comppad_name);
3407 SV *sv = svp[curop->op_targ];
3408 if (SvCUR(sv) == PL_generation)
3410 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3412 else if (curop->op_type == OP_RV2CV)
3414 else if (curop->op_type == OP_RV2SV ||
3415 curop->op_type == OP_RV2AV ||
3416 curop->op_type == OP_RV2HV ||
3417 curop->op_type == OP_RV2GV) {
3418 if (lastop->op_type != OP_GV) /* funny deref? */
3421 else if (curop->op_type == OP_PUSHRE) {
3422 if (((PMOP*)curop)->op_pmreplroot) {
3424 GV *gv = (GV*)PL_curpad[(PADOFFSET)((PMOP*)curop)->op_pmreplroot];
3426 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3428 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3430 SvCUR(gv) = PL_generation;
3439 o->op_private |= OPpASSIGN_COMMON;
3441 if (right && right->op_type == OP_SPLIT) {
3443 if ((tmpop = ((LISTOP*)right)->op_first) &&
3444 tmpop->op_type == OP_PUSHRE)
3446 PMOP *pm = (PMOP*)tmpop;
3447 if (left->op_type == OP_RV2AV &&
3448 !(left->op_private & OPpLVAL_INTRO) &&
3449 !(o->op_private & OPpASSIGN_COMMON) )
3451 tmpop = ((UNOP*)left)->op_first;
3452 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3454 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3455 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3457 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3458 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3460 pm->op_pmflags |= PMf_ONCE;
3461 tmpop = cUNOPo->op_first; /* to list (nulled) */
3462 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3463 tmpop->op_sibling = Nullop; /* don't free split */
3464 right->op_next = tmpop->op_next; /* fix starting loc */
3465 op_free(o); /* blow off assign */
3466 right->op_flags &= ~OPf_WANT;
3467 /* "I don't know and I don't care." */
3472 if (PL_modcount < 10000 &&
3473 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3475 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3477 sv_setiv(sv, PL_modcount+1);
3485 right = newOP(OP_UNDEF, 0);
3486 if (right->op_type == OP_READLINE) {
3487 right->op_flags |= OPf_STACKED;
3488 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3491 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3492 o = newBINOP(OP_SASSIGN, flags,
3493 scalar(right), mod(scalar(left), OP_SASSIGN) );
3505 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3508 U32 seq = intro_my();
3511 NewOp(1101, cop, 1, COP);
3512 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3513 cop->op_type = OP_DBSTATE;
3514 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3517 cop->op_type = OP_NEXTSTATE;
3518 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3520 cop->op_flags = flags;
3521 cop->op_private = (PL_hints & HINT_BYTE);
3523 cop->op_private |= NATIVE_HINTS;
3525 PL_compiling.op_private = cop->op_private;
3526 cop->op_next = (OP*)cop;
3529 cop->cop_label = label;
3530 PL_hints |= HINT_BLOCK_SCOPE;
3533 cop->cop_arybase = PL_curcop->cop_arybase;
3534 if (specialWARN(PL_curcop->cop_warnings))
3535 cop->cop_warnings = PL_curcop->cop_warnings ;
3537 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3540 if (PL_copline == NOLINE)
3541 CopLINE_set(cop, CopLINE(PL_curcop));
3543 CopLINE_set(cop, PL_copline);
3544 PL_copline = NOLINE;
3547 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
3549 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
3551 CopSTASH_set(cop, PL_curstash);
3553 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3554 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3555 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3556 (void)SvIOK_on(*svp);
3557 SvIVX(*svp) = PTR2IV(cop);
3561 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3564 /* "Introduce" my variables to visible status. */
3572 if (! PL_min_intro_pending)
3573 return PL_cop_seqmax;
3575 svp = AvARRAY(PL_comppad_name);
3576 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3577 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3578 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3579 SvNVX(sv) = (NV)PL_cop_seqmax;
3582 PL_min_intro_pending = 0;
3583 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3584 return PL_cop_seqmax++;
3588 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3590 return new_logop(type, flags, &first, &other);
3594 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3599 OP *first = *firstp;
3600 OP *other = *otherp;
3602 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3603 return newBINOP(type, flags, scalar(first), scalar(other));
3605 scalarboolean(first);
3606 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3607 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3608 if (type == OP_AND || type == OP_OR) {
3614 first = *firstp = cUNOPo->op_first;
3616 first->op_next = o->op_next;
3617 cUNOPo->op_first = Nullop;
3621 if (first->op_type == OP_CONST) {
3622 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3623 Perl_warner(aTHX_ WARN_BAREWORD, "Bareword found in conditional");
3624 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3635 else if (first->op_type == OP_WANTARRAY) {
3641 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3642 OP *k1 = ((UNOP*)first)->op_first;
3643 OP *k2 = k1->op_sibling;
3645 switch (first->op_type)
3648 if (k2 && k2->op_type == OP_READLINE
3649 && (k2->op_flags & OPf_STACKED)
3650 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3652 warnop = k2->op_type;
3657 if (k1->op_type == OP_READDIR
3658 || k1->op_type == OP_GLOB
3659 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3660 || k1->op_type == OP_EACH)
3662 warnop = ((k1->op_type == OP_NULL)
3663 ? k1->op_targ : k1->op_type);
3668 line_t oldline = CopLINE(PL_curcop);
3669 CopLINE_set(PL_curcop, PL_copline);
3670 Perl_warner(aTHX_ WARN_MISC,
3671 "Value of %s%s can be \"0\"; test with defined()",
3673 ((warnop == OP_READLINE || warnop == OP_GLOB)
3674 ? " construct" : "() operator"));
3675 CopLINE_set(PL_curcop, oldline);
3682 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3683 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3685 NewOp(1101, logop, 1, LOGOP);
3687 logop->op_type = type;
3688 logop->op_ppaddr = PL_ppaddr[type];
3689 logop->op_first = first;
3690 logop->op_flags = flags | OPf_KIDS;
3691 logop->op_other = LINKLIST(other);
3692 logop->op_private = 1 | (flags >> 8);
3694 /* establish postfix order */
3695 logop->op_next = LINKLIST(first);
3696 first->op_next = (OP*)logop;
3697 first->op_sibling = other;
3699 o = newUNOP(OP_NULL, 0, (OP*)logop);
3706 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3714 return newLOGOP(OP_AND, 0, first, trueop);
3716 return newLOGOP(OP_OR, 0, first, falseop);
3718 scalarboolean(first);
3719 if (first->op_type == OP_CONST) {
3720 if (SvTRUE(((SVOP*)first)->op_sv)) {
3731 else if (first->op_type == OP_WANTARRAY) {
3735 NewOp(1101, logop, 1, LOGOP);
3736 logop->op_type = OP_COND_EXPR;
3737 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3738 logop->op_first = first;
3739 logop->op_flags = flags | OPf_KIDS;
3740 logop->op_private = 1 | (flags >> 8);
3741 logop->op_other = LINKLIST(trueop);
3742 logop->op_next = LINKLIST(falseop);
3745 /* establish postfix order */
3746 start = LINKLIST(first);
3747 first->op_next = (OP*)logop;
3749 first->op_sibling = trueop;
3750 trueop->op_sibling = falseop;
3751 o = newUNOP(OP_NULL, 0, (OP*)logop);
3753 trueop->op_next = falseop->op_next = o;
3760 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3769 NewOp(1101, range, 1, LOGOP);
3771 range->op_type = OP_RANGE;
3772 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3773 range->op_first = left;
3774 range->op_flags = OPf_KIDS;
3775 leftstart = LINKLIST(left);
3776 range->op_other = LINKLIST(right);
3777 range->op_private = 1 | (flags >> 8);
3779 left->op_sibling = right;
3781 range->op_next = (OP*)range;
3782 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3783 flop = newUNOP(OP_FLOP, 0, flip);
3784 o = newUNOP(OP_NULL, 0, flop);
3786 range->op_next = leftstart;
3788 left->op_next = flip;
3789 right->op_next = flop;
3791 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3792 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3793 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3794 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3796 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3797 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3800 if (!flip->op_private || !flop->op_private)
3801 linklist(o); /* blow off optimizer unless constant */
3807 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3812 int once = block && block->op_flags & OPf_SPECIAL &&
3813 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3816 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3817 return block; /* do {} while 0 does once */
3818 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3819 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3820 expr = newUNOP(OP_DEFINED, 0,
3821 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3822 } else if (expr->op_flags & OPf_KIDS) {
3823 OP *k1 = ((UNOP*)expr)->op_first;
3824 OP *k2 = (k1) ? k1->op_sibling : NULL;
3825 switch (expr->op_type) {
3827 if (k2 && k2->op_type == OP_READLINE
3828 && (k2->op_flags & OPf_STACKED)
3829 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3830 expr = newUNOP(OP_DEFINED, 0, expr);
3834 if (k1->op_type == OP_READDIR
3835 || k1->op_type == OP_GLOB
3836 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3837 || k1->op_type == OP_EACH)
3838 expr = newUNOP(OP_DEFINED, 0, expr);
3844 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3845 o = new_logop(OP_AND, 0, &expr, &listop);
3848 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3850 if (once && o != listop)
3851 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3854 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3856 o->op_flags |= flags;
3858 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3863 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3873 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3874 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3875 expr = newUNOP(OP_DEFINED, 0,
3876 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3877 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3878 OP *k1 = ((UNOP*)expr)->op_first;
3879 OP *k2 = (k1) ? k1->op_sibling : NULL;
3880 switch (expr->op_type) {
3882 if (k2 && k2->op_type == OP_READLINE
3883 && (k2->op_flags & OPf_STACKED)
3884 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3885 expr = newUNOP(OP_DEFINED, 0, expr);
3889 if (k1->op_type == OP_READDIR
3890 || k1->op_type == OP_GLOB
3891 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3892 || k1->op_type == OP_EACH)
3893 expr = newUNOP(OP_DEFINED, 0, expr);
3899 block = newOP(OP_NULL, 0);
3901 block = scope(block);
3905 next = LINKLIST(cont);
3906 loopflags |= OPpLOOP_CONTINUE;
3909 OP *unstack = newOP(OP_UNSTACK, 0);
3912 cont = append_elem(OP_LINESEQ, cont, unstack);
3913 if ((line_t)whileline != NOLINE) {
3914 PL_copline = whileline;
3915 cont = append_elem(OP_LINESEQ, cont,
3916 newSTATEOP(0, Nullch, Nullop));
3920 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3921 redo = LINKLIST(listop);
3924 PL_copline = whileline;
3926 o = new_logop(OP_AND, 0, &expr, &listop);
3927 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3928 op_free(expr); /* oops, it's a while (0) */
3930 return Nullop; /* listop already freed by new_logop */
3933 ((LISTOP*)listop)->op_last->op_next = condop =
3934 (o == listop ? redo : LINKLIST(o));
3940 NewOp(1101,loop,1,LOOP);
3941 loop->op_type = OP_ENTERLOOP;
3942 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3943 loop->op_private = 0;
3944 loop->op_next = (OP*)loop;
3947 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3949 loop->op_redoop = redo;
3950 loop->op_lastop = o;
3951 o->op_private |= loopflags;
3954 loop->op_nextop = next;
3956 loop->op_nextop = o;
3958 o->op_flags |= flags;
3959 o->op_private |= (flags >> 8);
3964 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3972 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3973 sv->op_type = OP_RV2GV;
3974 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3976 else if (sv->op_type == OP_PADSV) { /* private variable */
3977 padoff = sv->op_targ;
3982 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3983 padoff = sv->op_targ;
3985 iterflags |= OPf_SPECIAL;
3990 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3994 padoff = find_threadsv("_");
3995 iterflags |= OPf_SPECIAL;
3997 sv = newGVOP(OP_GV, 0, PL_defgv);
4000 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
4001 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
4002 iterflags |= OPf_STACKED;
4004 else if (expr->op_type == OP_NULL &&
4005 (expr->op_flags & OPf_KIDS) &&
4006 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
4008 /* Basically turn for($x..$y) into the same as for($x,$y), but we
4009 * set the STACKED flag to indicate that these values are to be
4010 * treated as min/max values by 'pp_iterinit'.
4012 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
4013 LOGOP* range = (LOGOP*) flip->op_first;
4014 OP* left = range->op_first;
4015 OP* right = left->op_sibling;
4018 range->op_flags &= ~OPf_KIDS;
4019 range->op_first = Nullop;
4021 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
4022 listop->op_first->op_next = range->op_next;
4023 left->op_next = range->op_other;
4024 right->op_next = (OP*)listop;
4025 listop->op_next = listop->op_first;
4028 expr = (OP*)(listop);
4030 iterflags |= OPf_STACKED;
4033 expr = mod(force_list(expr), OP_GREPSTART);
4037 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
4038 append_elem(OP_LIST, expr, scalar(sv))));
4039 assert(!loop->op_next);
4040 #ifdef PL_OP_SLAB_ALLOC
4043 NewOp(1234,tmp,1,LOOP);
4044 Copy(loop,tmp,1,LOOP);
4048 Renew(loop, 1, LOOP);
4050 loop->op_targ = padoff;
4051 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
4052 PL_copline = forline;
4053 return newSTATEOP(0, label, wop);
4057 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4063 if (type != OP_GOTO || label->op_type == OP_CONST) {
4064 /* "last()" means "last" */
4065 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4066 o = newOP(type, OPf_SPECIAL);
4068 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
4069 ? SvPVx(((SVOP*)label)->op_sv, n_a)
4075 if (label->op_type == OP_ENTERSUB)
4076 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4077 o = newUNOP(type, OPf_STACKED, label);
4079 PL_hints |= HINT_BLOCK_SCOPE;
4084 Perl_cv_undef(pTHX_ CV *cv)
4089 MUTEX_DESTROY(CvMUTEXP(cv));
4090 Safefree(CvMUTEXP(cv));
4093 #endif /* USE_THREADS */
4095 if (!CvXSUB(cv) && CvROOT(cv)) {
4097 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4098 Perl_croak(aTHX_ "Can't undef active subroutine");
4101 Perl_croak(aTHX_ "Can't undef active subroutine");
4102 #endif /* USE_THREADS */
4105 SAVEVPTR(PL_curpad);
4109 op_free(CvROOT(cv));
4110 CvROOT(cv) = Nullop;
4113 SvPOK_off((SV*)cv); /* forget prototype */
4115 SvREFCNT_dec(CvGV(cv));
4117 SvREFCNT_dec(CvOUTSIDE(cv));
4118 CvOUTSIDE(cv) = Nullcv;
4120 SvREFCNT_dec((SV*)CvXSUBANY(cv).any_ptr);
4123 if (CvPADLIST(cv)) {
4124 /* may be during global destruction */
4125 if (SvREFCNT(CvPADLIST(cv))) {
4126 I32 i = AvFILLp(CvPADLIST(cv));
4128 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4129 SV* sv = svp ? *svp : Nullsv;
4132 if (sv == (SV*)PL_comppad_name)
4133 PL_comppad_name = Nullav;
4134 else if (sv == (SV*)PL_comppad) {
4135 PL_comppad = Nullav;
4136 PL_curpad = Null(SV**);
4140 SvREFCNT_dec((SV*)CvPADLIST(cv));
4142 CvPADLIST(cv) = Nullav;
4147 S_cv_dump(pTHX_ CV *cv)
4150 CV *outside = CvOUTSIDE(cv);
4151 AV* padlist = CvPADLIST(cv);
4158 PerlIO_printf(Perl_debug_log,
4159 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4161 (CvANON(cv) ? "ANON"
4162 : (cv == PL_main_cv) ? "MAIN"
4163 : CvUNIQUE(cv) ? "UNIQUE"
4164 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4167 : CvANON(outside) ? "ANON"
4168 : (outside == PL_main_cv) ? "MAIN"
4169 : CvUNIQUE(outside) ? "UNIQUE"
4170 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4175 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4176 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4177 pname = AvARRAY(pad_name);
4178 ppad = AvARRAY(pad);
4180 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4181 if (SvPOK(pname[ix]))
4182 PerlIO_printf(Perl_debug_log,
4183 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4184 (int)ix, PTR2UV(ppad[ix]),
4185 SvFAKE(pname[ix]) ? "FAKE " : "",
4187 (IV)I_32(SvNVX(pname[ix])),
4190 #endif /* DEBUGGING */
4194 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4199 AV* protopadlist = CvPADLIST(proto);
4200 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4201 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4202 SV** pname = AvARRAY(protopad_name);
4203 SV** ppad = AvARRAY(protopad);
4204 I32 fname = AvFILLp(protopad_name);
4205 I32 fpad = AvFILLp(protopad);
4209 assert(!CvUNIQUE(proto));
4213 SAVESPTR(PL_comppad_name);
4214 SAVESPTR(PL_compcv);
4216 cv = PL_compcv = (CV*)NEWSV(1104,0);
4217 sv_upgrade((SV *)cv, SvTYPE(proto));
4218 CvFLAGS(cv) = CvFLAGS(proto) & ~CVf_CLONE;
4222 New(666, CvMUTEXP(cv), 1, perl_mutex);
4223 MUTEX_INIT(CvMUTEXP(cv));
4225 #endif /* USE_THREADS */
4226 CvFILE(cv) = CvFILE(proto);
4227 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4228 CvSTASH(cv) = CvSTASH(proto);
4229 CvROOT(cv) = CvROOT(proto);
4230 CvSTART(cv) = CvSTART(proto);
4232 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4235 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4237 PL_comppad_name = newAV();
4238 for (ix = fname; ix >= 0; ix--)
4239 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4241 PL_comppad = newAV();
4243 comppadlist = newAV();
4244 AvREAL_off(comppadlist);
4245 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4246 av_store(comppadlist, 1, (SV*)PL_comppad);
4247 CvPADLIST(cv) = comppadlist;
4248 av_fill(PL_comppad, AvFILLp(protopad));
4249 PL_curpad = AvARRAY(PL_comppad);
4251 av = newAV(); /* will be @_ */
4253 av_store(PL_comppad, 0, (SV*)av);
4254 AvFLAGS(av) = AVf_REIFY;
4256 for (ix = fpad; ix > 0; ix--) {
4257 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4258 if (namesv && namesv != &PL_sv_undef) {
4259 char *name = SvPVX(namesv); /* XXX */
4260 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4261 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4262 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4264 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4266 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4268 else { /* our own lexical */
4271 /* anon code -- we'll come back for it */
4272 sv = SvREFCNT_inc(ppad[ix]);
4274 else if (*name == '@')
4276 else if (*name == '%')
4285 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4286 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4289 SV* sv = NEWSV(0,0);
4295 /* Now that vars are all in place, clone nested closures. */
4297 for (ix = fpad; ix > 0; ix--) {
4298 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4300 && namesv != &PL_sv_undef
4301 && !(SvFLAGS(namesv) & SVf_FAKE)
4302 && *SvPVX(namesv) == '&'
4303 && CvCLONE(ppad[ix]))
4305 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4306 SvREFCNT_dec(ppad[ix]);
4309 PL_curpad[ix] = (SV*)kid;
4313 #ifdef DEBUG_CLOSURES
4314 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4316 PerlIO_printf(Perl_debug_log, " from:\n");
4318 PerlIO_printf(Perl_debug_log, " to:\n");
4325 SV* const_sv = op_const_sv(CvSTART(cv), cv);
4327 /* constant sub () { $x } closing over $x - see lib/constant.pm */
4329 cv = newCONSTSUB(CvSTASH(proto), 0, const_sv);
4336 Perl_cv_clone(pTHX_ CV *proto)
4339 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4340 cv = cv_clone2(proto, CvOUTSIDE(proto));
4341 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4346 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4350 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4351 SV* msg = sv_newmortal();
4355 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4356 sv_setpv(msg, "Prototype mismatch:");
4358 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4360 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4361 sv_catpv(msg, " vs ");
4363 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4365 sv_catpv(msg, "none");
4366 Perl_warner(aTHX_ WARN_PROTOTYPE, "%"SVf, msg);
4370 static void const_sv_xsub(pTHXo_ CV* cv);
4373 =for apidoc cv_const_sv
4375 If C<cv> is a constant sub eligible for inlining. returns the constant
4376 value returned by the sub. Otherwise, returns NULL.
4378 Constant subs can be created with C<newCONSTSUB> or as described in
4379 L<perlsub/"Constant Functions">.
4384 Perl_cv_const_sv(pTHX_ CV *cv)
4386 if (!cv || !CvCONST(cv))
4388 return (SV*)CvXSUBANY(cv).any_ptr;
4392 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4399 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4400 o = cLISTOPo->op_first->op_sibling;
4402 for (; o; o = o->op_next) {
4403 OPCODE type = o->op_type;
4405 if (sv && o->op_next == o)
4407 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4409 if (type == OP_DBSTATE)
4411 if (type == OP_LEAVESUB || type == OP_RETURN)
4415 if (type == OP_CONST && cSVOPo->op_sv)
4417 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4418 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4419 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4423 /* We get here only from cv_clone2() while creating a closure.
4424 Copy the const value here instead of in cv_clone2 so that
4425 SvREADONLY_on doesn't lead to problems when leaving
4430 if (!SvREADONLY(sv) && SvREFCNT(sv) > 1)
4442 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4452 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4456 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4458 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4462 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4469 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4474 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4475 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4476 SV *sv = sv_newmortal();
4477 Perl_sv_setpvf(aTHX_ sv, "__ANON__[%s:%"IVdf"]",
4478 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4483 gv = gv_fetchpv(name ? name : (aname ? aname : "__ANON__"),
4484 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4494 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4495 maximum a prototype before. */
4496 if (SvTYPE(gv) > SVt_NULL) {
4497 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4498 && ckWARN_d(WARN_PROTOTYPE))
4500 Perl_warner(aTHX_ WARN_PROTOTYPE, "Runaway prototype");
4502 cv_ckproto((CV*)gv, NULL, ps);
4505 sv_setpv((SV*)gv, ps);
4507 sv_setiv((SV*)gv, -1);
4508 SvREFCNT_dec(PL_compcv);
4509 cv = PL_compcv = NULL;
4510 PL_sub_generation++;
4514 cv = (!name || GvCVGEN(gv)) ? Nullcv : GvCV(gv);
4516 if (!block || !ps || *ps || attrs)
4519 const_sv = op_const_sv(block, Nullcv);
4522 bool exists = CvROOT(cv) || CvXSUB(cv);
4523 /* if the subroutine doesn't exist and wasn't pre-declared
4524 * with a prototype, assume it will be AUTOLOADed,
4525 * skipping the prototype check
4527 if (exists || SvPOK(cv))
4528 cv_ckproto(cv, gv, ps);
4529 /* already defined (or promised)? */
4530 if (exists || GvASSUMECV(gv)) {
4531 if (!block && !attrs) {
4532 /* just a "sub foo;" when &foo is already defined */
4533 SAVEFREESV(PL_compcv);
4536 /* ahem, death to those who redefine active sort subs */
4537 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4538 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4540 if (ckWARN(WARN_REDEFINE)
4542 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
4544 line_t oldline = CopLINE(PL_curcop);
4545 CopLINE_set(PL_curcop, PL_copline);
4546 Perl_warner(aTHX_ WARN_REDEFINE,
4547 CvCONST(cv) ? "Constant subroutine %s redefined"
4548 : "Subroutine %s redefined", name);
4549 CopLINE_set(PL_curcop, oldline);
4557 SvREFCNT_inc(const_sv);
4560 sv_setpv((SV*)cv, ""); /* prototype is "" */
4561 CvXSUBANY(cv).any_ptr = const_sv;
4562 CvXSUB(cv) = const_sv_xsub;
4564 /* XXX Does anybody care that CvFILE(cv) is blank? */
4568 cv = newCONSTSUB(NULL, name, const_sv);
4571 SvREFCNT_dec(PL_compcv);
4573 PL_sub_generation++;
4580 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4581 * before we clobber PL_compcv.
4585 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4586 stash = GvSTASH(CvGV(cv));
4587 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4588 stash = CvSTASH(cv);
4590 stash = PL_curstash;
4593 /* possibly about to re-define existing subr -- ignore old cv */
4594 rcv = (SV*)PL_compcv;
4595 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4596 stash = GvSTASH(gv);
4598 stash = PL_curstash;
4600 apply_attrs(stash, rcv, attrs);
4602 if (cv) { /* must reuse cv if autoloaded */
4604 /* got here with just attrs -- work done, so bug out */
4605 SAVEFREESV(PL_compcv);
4609 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4610 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4611 CvOUTSIDE(PL_compcv) = 0;
4612 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4613 CvPADLIST(PL_compcv) = 0;
4614 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4615 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4616 SvREFCNT_dec(PL_compcv);
4623 PL_sub_generation++;
4626 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4627 CvFILE(cv) = CopFILE(PL_curcop);
4628 CvSTASH(cv) = PL_curstash;
4631 if (!CvMUTEXP(cv)) {
4632 New(666, CvMUTEXP(cv), 1, perl_mutex);
4633 MUTEX_INIT(CvMUTEXP(cv));
4635 #endif /* USE_THREADS */
4638 sv_setpv((SV*)cv, ps);
4640 if (PL_error_count) {
4644 char *s = strrchr(name, ':');
4646 if (strEQ(s, "BEGIN")) {
4648 "BEGIN not safe after errors--compilation aborted";
4649 if (PL_in_eval & EVAL_KEEPERR)
4650 Perl_croak(aTHX_ not_safe);
4652 /* force display of errors found but not reported */
4653 sv_catpv(ERRSV, not_safe);
4654 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4662 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4663 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4666 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4669 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4671 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4672 OpREFCNT_set(CvROOT(cv), 1);
4673 CvSTART(cv) = LINKLIST(CvROOT(cv));
4674 CvROOT(cv)->op_next = 0;
4677 /* now that optimizer has done its work, adjust pad values */
4679 SV **namep = AvARRAY(PL_comppad_name);
4680 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4683 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4686 * The only things that a clonable function needs in its
4687 * pad are references to outer lexicals and anonymous subs.
4688 * The rest are created anew during cloning.
4690 if (!((namesv = namep[ix]) != Nullsv &&
4691 namesv != &PL_sv_undef &&
4693 *SvPVX(namesv) == '&')))
4695 SvREFCNT_dec(PL_curpad[ix]);
4696 PL_curpad[ix] = Nullsv;
4699 assert(!CvCONST(cv));
4700 if (ps && !*ps && op_const_sv(block, cv))
4704 AV *av = newAV(); /* Will be @_ */
4706 av_store(PL_comppad, 0, (SV*)av);
4707 AvFLAGS(av) = AVf_REIFY;
4709 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4710 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4712 if (!SvPADMY(PL_curpad[ix]))
4713 SvPADTMP_on(PL_curpad[ix]);
4717 if (name || aname) {
4719 char *tname = (name ? name : aname);
4721 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4722 SV *sv = NEWSV(0,0);
4723 SV *tmpstr = sv_newmortal();
4724 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4728 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4730 (long)PL_subline, (long)CopLINE(PL_curcop));
4731 gv_efullname3(tmpstr, gv, Nullch);
4732 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4733 hv = GvHVn(db_postponed);
4734 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4735 && (pcv = GvCV(db_postponed)))
4741 call_sv((SV*)pcv, G_DISCARD);
4745 if ((s = strrchr(tname,':')))
4750 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4753 if (strEQ(s, "BEGIN")) {
4754 I32 oldscope = PL_scopestack_ix;
4756 SAVECOPFILE(&PL_compiling);
4757 SAVECOPLINE(&PL_compiling);
4759 sv_setsv(PL_rs, PL_nrs);
4762 PL_beginav = newAV();
4763 DEBUG_x( dump_sub(gv) );
4764 av_push(PL_beginav, (SV*)cv);
4765 GvCV(gv) = 0; /* cv has been hijacked */
4766 call_list(oldscope, PL_beginav);
4768 PL_curcop = &PL_compiling;
4769 PL_compiling.op_private = PL_hints;
4772 else if (strEQ(s, "END") && !PL_error_count) {
4775 DEBUG_x( dump_sub(gv) );
4776 av_unshift(PL_endav, 1);
4777 av_store(PL_endav, 0, (SV*)cv);
4778 GvCV(gv) = 0; /* cv has been hijacked */
4780 else if (strEQ(s, "CHECK") && !PL_error_count) {
4782 PL_checkav = newAV();
4783 DEBUG_x( dump_sub(gv) );
4784 if (PL_main_start && ckWARN(WARN_VOID))
4785 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4786 av_unshift(PL_checkav, 1);
4787 av_store(PL_checkav, 0, (SV*)cv);
4788 GvCV(gv) = 0; /* cv has been hijacked */
4790 else if (strEQ(s, "INIT") && !PL_error_count) {
4792 PL_initav = newAV();
4793 DEBUG_x( dump_sub(gv) );
4794 if (PL_main_start && ckWARN(WARN_VOID))
4795 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4796 av_push(PL_initav, (SV*)cv);
4797 GvCV(gv) = 0; /* cv has been hijacked */
4802 PL_copline = NOLINE;
4807 /* XXX unsafe for threads if eval_owner isn't held */
4809 =for apidoc newCONSTSUB
4811 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4812 eligible for inlining at compile-time.
4818 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4825 SAVECOPLINE(PL_curcop);
4826 CopLINE_set(PL_curcop, PL_copline);
4829 PL_hints &= ~HINT_BLOCK_SCOPE;
4832 SAVESPTR(PL_curstash);
4833 SAVECOPSTASH(PL_curcop);
4834 PL_curstash = stash;
4836 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4838 CopSTASH(PL_curcop) = stash;
4842 cv = newXS(name, const_sv_xsub, __FILE__);
4843 CvXSUBANY(cv).any_ptr = sv;
4845 sv_setpv((SV*)cv, ""); /* prototype is "" */
4853 =for apidoc U||newXS
4855 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4861 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4864 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4867 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4869 /* just a cached method */
4873 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4874 /* already defined (or promised) */
4875 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4876 && HvNAME(GvSTASH(CvGV(cv)))
4877 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4878 line_t oldline = CopLINE(PL_curcop);
4879 if (PL_copline != NOLINE)
4880 CopLINE_set(PL_curcop, PL_copline);
4881 Perl_warner(aTHX_ WARN_REDEFINE,
4882 CvCONST(cv) ? "Constant subroutine %s redefined"
4883 : "Subroutine %s redefined"
4885 CopLINE_set(PL_curcop, oldline);
4892 if (cv) /* must reuse cv if autoloaded */
4895 cv = (CV*)NEWSV(1105,0);
4896 sv_upgrade((SV *)cv, SVt_PVCV);
4900 PL_sub_generation++;
4903 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4905 New(666, CvMUTEXP(cv), 1, perl_mutex);
4906 MUTEX_INIT(CvMUTEXP(cv));
4908 #endif /* USE_THREADS */
4909 (void)gv_fetchfile(filename);
4910 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4911 an external constant string */
4912 CvXSUB(cv) = subaddr;
4915 char *s = strrchr(name,':');
4921 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4924 if (strEQ(s, "BEGIN")) {
4926 PL_beginav = newAV();
4927 av_push(PL_beginav, (SV*)cv);
4928 GvCV(gv) = 0; /* cv has been hijacked */
4930 else if (strEQ(s, "END")) {
4933 av_unshift(PL_endav, 1);
4934 av_store(PL_endav, 0, (SV*)cv);
4935 GvCV(gv) = 0; /* cv has been hijacked */
4937 else if (strEQ(s, "CHECK")) {
4939 PL_checkav = newAV();
4940 if (PL_main_start && ckWARN(WARN_VOID))
4941 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4942 av_unshift(PL_checkav, 1);
4943 av_store(PL_checkav, 0, (SV*)cv);
4944 GvCV(gv) = 0; /* cv has been hijacked */
4946 else if (strEQ(s, "INIT")) {
4948 PL_initav = newAV();
4949 if (PL_main_start && ckWARN(WARN_VOID))
4950 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4951 av_push(PL_initav, (SV*)cv);
4952 GvCV(gv) = 0; /* cv has been hijacked */
4963 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4973 name = SvPVx(cSVOPo->op_sv, n_a);
4976 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4978 if ((cv = GvFORM(gv))) {
4979 if (ckWARN(WARN_REDEFINE)) {
4980 line_t oldline = CopLINE(PL_curcop);
4982 CopLINE_set(PL_curcop, PL_copline);
4983 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4984 CopLINE_set(PL_curcop, oldline);
4990 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4991 CvFILE(cv) = CopFILE(PL_curcop);
4993 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4994 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4995 SvPADTMP_on(PL_curpad[ix]);
4998 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4999 CvROOT(cv)->op_private |= OPpREFCOUNTED;
5000 OpREFCNT_set(CvROOT(cv), 1);
5001 CvSTART(cv) = LINKLIST(CvROOT(cv));
5002 CvROOT(cv)->op_next = 0;
5005 PL_copline = NOLINE;
5010 Perl_newANONLIST(pTHX_ OP *o)
5012 return newUNOP(OP_REFGEN, 0,
5013 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
5017 Perl_newANONHASH(pTHX_ OP *o)
5019 return newUNOP(OP_REFGEN, 0,
5020 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
5024 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
5026 return newANONATTRSUB(floor, proto, Nullop, block);
5030 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
5032 return newUNOP(OP_REFGEN, 0,
5033 newSVOP(OP_ANONCODE, 0,
5034 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
5038 Perl_oopsAV(pTHX_ OP *o)
5040 switch (o->op_type) {
5042 o->op_type = OP_PADAV;
5043 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5044 return ref(o, OP_RV2AV);
5047 o->op_type = OP_RV2AV;
5048 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
5053 if (ckWARN_d(WARN_INTERNAL))
5054 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
5061 Perl_oopsHV(pTHX_ OP *o)
5065 switch (o->op_type) {
5068 o->op_type = OP_PADHV;
5069 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5070 return ref(o, OP_RV2HV);
5074 o->op_type = OP_RV2HV;
5075 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
5080 if (ckWARN_d(WARN_INTERNAL))
5081 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
5088 Perl_newAVREF(pTHX_ OP *o)
5090 if (o->op_type == OP_PADANY) {
5091 o->op_type = OP_PADAV;
5092 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5095 return newUNOP(OP_RV2AV, 0, scalar(o));
5099 Perl_newGVREF(pTHX_ I32 type, OP *o)
5101 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
5102 return newUNOP(OP_NULL, 0, o);
5103 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
5107 Perl_newHVREF(pTHX_ OP *o)
5109 if (o->op_type == OP_PADANY) {
5110 o->op_type = OP_PADHV;
5111 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5114 return newUNOP(OP_RV2HV, 0, scalar(o));
5118 Perl_oopsCV(pTHX_ OP *o)
5120 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5126 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5128 return newUNOP(OP_RV2CV, flags, scalar(o));
5132 Perl_newSVREF(pTHX_ OP *o)
5134 if (o->op_type == OP_PADANY) {
5135 o->op_type = OP_PADSV;
5136 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5139 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
5140 o->op_flags |= OPpDONE_SVREF;
5143 return newUNOP(OP_RV2SV, 0, scalar(o));
5146 /* Check routines. */
5149 Perl_ck_anoncode(pTHX_ OP *o)
5154 name = NEWSV(1106,0);
5155 sv_upgrade(name, SVt_PVNV);
5156 sv_setpvn(name, "&", 1);
5159 ix = pad_alloc(o->op_type, SVs_PADMY);
5160 av_store(PL_comppad_name, ix, name);
5161 av_store(PL_comppad, ix, cSVOPo->op_sv);
5162 SvPADMY_on(cSVOPo->op_sv);
5163 cSVOPo->op_sv = Nullsv;
5164 cSVOPo->op_targ = ix;
5169 Perl_ck_bitop(pTHX_ OP *o)
5171 o->op_private = PL_hints;
5176 Perl_ck_concat(pTHX_ OP *o)
5178 if (cUNOPo->op_first->op_type == OP_CONCAT)
5179 o->op_flags |= OPf_STACKED;
5184 Perl_ck_spair(pTHX_ OP *o)
5186 if (o->op_flags & OPf_KIDS) {
5189 OPCODE type = o->op_type;
5190 o = modkids(ck_fun(o), type);
5191 kid = cUNOPo->op_first;
5192 newop = kUNOP->op_first->op_sibling;
5194 (newop->op_sibling ||
5195 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5196 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5197 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5201 op_free(kUNOP->op_first);
5202 kUNOP->op_first = newop;
5204 o->op_ppaddr = PL_ppaddr[++o->op_type];
5209 Perl_ck_delete(pTHX_ OP *o)
5213 if (o->op_flags & OPf_KIDS) {
5214 OP *kid = cUNOPo->op_first;
5215 switch (kid->op_type) {
5217 o->op_flags |= OPf_SPECIAL;
5220 o->op_private |= OPpSLICE;
5223 o->op_flags |= OPf_SPECIAL;
5228 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5229 PL_op_desc[o->op_type]);
5237 Perl_ck_eof(pTHX_ OP *o)
5239 I32 type = o->op_type;
5241 if (o->op_flags & OPf_KIDS) {
5242 if (cLISTOPo->op_first->op_type == OP_STUB) {
5244 o = newUNOP(type, OPf_SPECIAL,
5245 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5253 Perl_ck_eval(pTHX_ OP *o)
5255 PL_hints |= HINT_BLOCK_SCOPE;
5256 if (o->op_flags & OPf_KIDS) {
5257 SVOP *kid = (SVOP*)cUNOPo->op_first;
5260 o->op_flags &= ~OPf_KIDS;
5263 else if (kid->op_type == OP_LINESEQ) {
5266 kid->op_next = o->op_next;
5267 cUNOPo->op_first = 0;
5270 NewOp(1101, enter, 1, LOGOP);
5271 enter->op_type = OP_ENTERTRY;
5272 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5273 enter->op_private = 0;
5275 /* establish postfix order */
5276 enter->op_next = (OP*)enter;
5278 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5279 o->op_type = OP_LEAVETRY;
5280 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5281 enter->op_other = o;
5289 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5291 o->op_targ = (PADOFFSET)PL_hints;
5296 Perl_ck_exit(pTHX_ OP *o)
5299 HV *table = GvHV(PL_hintgv);
5301 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
5302 if (svp && *svp && SvTRUE(*svp))
5303 o->op_private |= OPpEXIT_VMSISH;
5310 Perl_ck_exec(pTHX_ OP *o)
5313 if (o->op_flags & OPf_STACKED) {
5315 kid = cUNOPo->op_first->op_sibling;
5316 if (kid->op_type == OP_RV2GV)
5325 Perl_ck_exists(pTHX_ OP *o)
5328 if (o->op_flags & OPf_KIDS) {
5329 OP *kid = cUNOPo->op_first;
5330 if (kid->op_type == OP_ENTERSUB) {
5331 (void) ref(kid, o->op_type);
5332 if (kid->op_type != OP_RV2CV && !PL_error_count)
5333 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5334 PL_op_desc[o->op_type]);
5335 o->op_private |= OPpEXISTS_SUB;
5337 else if (kid->op_type == OP_AELEM)
5338 o->op_flags |= OPf_SPECIAL;
5339 else if (kid->op_type != OP_HELEM)
5340 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5341 PL_op_desc[o->op_type]);
5349 Perl_ck_gvconst(pTHX_ register OP *o)
5351 o = fold_constants(o);
5352 if (o->op_type == OP_CONST)
5359 Perl_ck_rvconst(pTHX_ register OP *o)
5362 SVOP *kid = (SVOP*)cUNOPo->op_first;
5364 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5365 if (kid->op_type == OP_CONST) {
5369 SV *kidsv = kid->op_sv;
5372 /* Is it a constant from cv_const_sv()? */
5373 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5374 SV *rsv = SvRV(kidsv);
5375 int svtype = SvTYPE(rsv);
5376 char *badtype = Nullch;
5378 switch (o->op_type) {
5380 if (svtype > SVt_PVMG)
5381 badtype = "a SCALAR";
5384 if (svtype != SVt_PVAV)
5385 badtype = "an ARRAY";
5388 if (svtype != SVt_PVHV) {
5389 if (svtype == SVt_PVAV) { /* pseudohash? */
5390 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5391 if (ksv && SvROK(*ksv)
5392 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5401 if (svtype != SVt_PVCV)
5406 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5409 name = SvPV(kidsv, n_a);
5410 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5411 char *badthing = Nullch;
5412 switch (o->op_type) {
5414 badthing = "a SCALAR";
5417 badthing = "an ARRAY";
5420 badthing = "a HASH";
5425 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5429 * This is a little tricky. We only want to add the symbol if we
5430 * didn't add it in the lexer. Otherwise we get duplicate strict
5431 * warnings. But if we didn't add it in the lexer, we must at
5432 * least pretend like we wanted to add it even if it existed before,
5433 * or we get possible typo warnings. OPpCONST_ENTERED says
5434 * whether the lexer already added THIS instance of this symbol.
5436 iscv = (o->op_type == OP_RV2CV) * 2;
5438 gv = gv_fetchpv(name,
5439 iscv | !(kid->op_private & OPpCONST_ENTERED),
5442 : o->op_type == OP_RV2SV
5444 : o->op_type == OP_RV2AV
5446 : o->op_type == OP_RV2HV
5449 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5451 kid->op_type = OP_GV;
5452 SvREFCNT_dec(kid->op_sv);
5454 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5455 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5456 SvREFCNT_dec(PL_curpad[kPADOP->op_padix]);
5458 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5460 kid->op_sv = SvREFCNT_inc(gv);
5462 kid->op_ppaddr = PL_ppaddr[OP_GV];
5469 Perl_ck_ftst(pTHX_ OP *o)
5472 I32 type = o->op_type;
5474 if (o->op_flags & OPf_REF) {
5477 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5478 SVOP *kid = (SVOP*)cUNOPo->op_first;
5480 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5482 OP *newop = newGVOP(type, OPf_REF,
5483 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5490 if (type == OP_FTTTY)
5491 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5494 o = newUNOP(type, 0, newDEFSVOP());
5497 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5499 if (PL_hints & HINT_LOCALE)
5500 o->op_private |= OPpLOCALE;
5507 Perl_ck_fun(pTHX_ OP *o)
5514 int type = o->op_type;
5515 register I32 oa = PL_opargs[type] >> OASHIFT;
5517 if (o->op_flags & OPf_STACKED) {
5518 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5521 return no_fh_allowed(o);
5524 if (o->op_flags & OPf_KIDS) {
5526 tokid = &cLISTOPo->op_first;
5527 kid = cLISTOPo->op_first;
5528 if (kid->op_type == OP_PUSHMARK ||
5529 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5531 tokid = &kid->op_sibling;
5532 kid = kid->op_sibling;
5534 if (!kid && PL_opargs[type] & OA_DEFGV)
5535 *tokid = kid = newDEFSVOP();
5539 sibl = kid->op_sibling;
5542 /* list seen where single (scalar) arg expected? */
5543 if (numargs == 1 && !(oa >> 4)
5544 && kid->op_type == OP_LIST && type != OP_SCALAR)
5546 return too_many_arguments(o,PL_op_desc[type]);
5559 if (kid->op_type == OP_CONST &&
5560 (kid->op_private & OPpCONST_BARE))
5562 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5563 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5564 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5565 if (ckWARN(WARN_DEPRECATED))
5566 Perl_warner(aTHX_ WARN_DEPRECATED,
5567 "Array @%s missing the @ in argument %"IVdf" of %s()",
5568 name, (IV)numargs, PL_op_desc[type]);
5571 kid->op_sibling = sibl;
5574 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5575 bad_type(numargs, "array", PL_op_desc[type], kid);
5579 if (kid->op_type == OP_CONST &&
5580 (kid->op_private & OPpCONST_BARE))
5582 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5583 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5584 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5585 if (ckWARN(WARN_DEPRECATED))
5586 Perl_warner(aTHX_ WARN_DEPRECATED,
5587 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5588 name, (IV)numargs, PL_op_desc[type]);
5591 kid->op_sibling = sibl;
5594 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5595 bad_type(numargs, "hash", PL_op_desc[type], kid);
5600 OP *newop = newUNOP(OP_NULL, 0, kid);
5601 kid->op_sibling = 0;
5603 newop->op_next = newop;
5605 kid->op_sibling = sibl;
5610 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5611 if (kid->op_type == OP_CONST &&
5612 (kid->op_private & OPpCONST_BARE))
5614 OP *newop = newGVOP(OP_GV, 0,
5615 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5620 else if (kid->op_type == OP_READLINE) {
5621 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5622 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5625 I32 flags = OPf_SPECIAL;
5629 /* is this op a FH constructor? */
5630 if (is_handle_constructor(o,numargs)) {
5631 char *name = Nullch;
5635 /* Set a flag to tell rv2gv to vivify
5636 * need to "prove" flag does not mean something
5637 * else already - NI-S 1999/05/07
5640 if (kid->op_type == OP_PADSV) {
5641 SV **namep = av_fetch(PL_comppad_name,
5643 if (namep && *namep)
5644 name = SvPV(*namep, len);
5646 else if (kid->op_type == OP_RV2SV
5647 && kUNOP->op_first->op_type == OP_GV)
5649 GV *gv = cGVOPx_gv(kUNOP->op_first);
5651 len = GvNAMELEN(gv);
5653 else if (kid->op_type == OP_AELEM
5654 || kid->op_type == OP_HELEM)
5656 name = "__ANONIO__";
5662 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5663 namesv = PL_curpad[targ];
5664 (void)SvUPGRADE(namesv, SVt_PV);
5666 sv_setpvn(namesv, "$", 1);
5667 sv_catpvn(namesv, name, len);
5670 kid->op_sibling = 0;
5671 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5672 kid->op_targ = targ;
5673 kid->op_private |= priv;
5675 kid->op_sibling = sibl;
5681 mod(scalar(kid), type);
5685 tokid = &kid->op_sibling;
5686 kid = kid->op_sibling;
5688 o->op_private |= numargs;
5690 return too_many_arguments(o,PL_op_desc[o->op_type]);
5693 else if (PL_opargs[type] & OA_DEFGV) {
5695 return newUNOP(type, 0, newDEFSVOP());
5699 while (oa & OA_OPTIONAL)
5701 if (oa && oa != OA_LIST)
5702 return too_few_arguments(o,PL_op_desc[o->op_type]);
5708 Perl_ck_glob(pTHX_ OP *o)
5713 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5714 append_elem(OP_GLOB, o, newDEFSVOP());
5716 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5717 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5719 #if !defined(PERL_EXTERNAL_GLOB)
5720 /* XXX this can be tightened up and made more failsafe. */
5723 Perl_load_module(aTHX_ 0, newSVpvn("File::Glob", 10), Nullsv,
5724 /* null-terminated import list */
5725 newSVpvn(":globally", 9), Nullsv);
5726 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5729 #endif /* PERL_EXTERNAL_GLOB */
5731 if (gv && GvIMPORTED_CV(gv)) {
5732 append_elem(OP_GLOB, o,
5733 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5734 o->op_type = OP_LIST;
5735 o->op_ppaddr = PL_ppaddr[OP_LIST];
5736 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5737 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5738 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5739 append_elem(OP_LIST, o,
5740 scalar(newUNOP(OP_RV2CV, 0,
5741 newGVOP(OP_GV, 0, gv)))));
5742 o = newUNOP(OP_NULL, 0, ck_subr(o));
5743 o->op_targ = OP_GLOB; /* hint at what it used to be */
5746 gv = newGVgen("main");
5748 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5754 Perl_ck_grep(pTHX_ OP *o)
5758 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5760 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5761 NewOp(1101, gwop, 1, LOGOP);
5763 if (o->op_flags & OPf_STACKED) {
5766 kid = cLISTOPo->op_first->op_sibling;
5767 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5770 kid->op_next = (OP*)gwop;
5771 o->op_flags &= ~OPf_STACKED;
5773 kid = cLISTOPo->op_first->op_sibling;
5774 if (type == OP_MAPWHILE)
5781 kid = cLISTOPo->op_first->op_sibling;
5782 if (kid->op_type != OP_NULL)
5783 Perl_croak(aTHX_ "panic: ck_grep");
5784 kid = kUNOP->op_first;
5786 gwop->op_type = type;
5787 gwop->op_ppaddr = PL_ppaddr[type];
5788 gwop->op_first = listkids(o);
5789 gwop->op_flags |= OPf_KIDS;
5790 gwop->op_private = 1;
5791 gwop->op_other = LINKLIST(kid);
5792 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5793 kid->op_next = (OP*)gwop;
5795 kid = cLISTOPo->op_first->op_sibling;
5796 if (!kid || !kid->op_sibling)
5797 return too_few_arguments(o,PL_op_desc[o->op_type]);
5798 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5799 mod(kid, OP_GREPSTART);
5805 Perl_ck_index(pTHX_ OP *o)
5807 if (o->op_flags & OPf_KIDS) {
5808 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5810 kid = kid->op_sibling; /* get past "big" */
5811 if (kid && kid->op_type == OP_CONST)
5812 fbm_compile(((SVOP*)kid)->op_sv, 0);
5818 Perl_ck_lengthconst(pTHX_ OP *o)
5820 /* XXX length optimization goes here */
5825 Perl_ck_lfun(pTHX_ OP *o)
5827 OPCODE type = o->op_type;
5828 return modkids(ck_fun(o), type);
5832 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5835 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5836 switch (cUNOPo->op_first->op_type) {
5838 /* This is needed for
5839 if (defined %stash::)
5840 to work. Do not break Tk.
5842 break; /* Globals via GV can be undef */
5844 case OP_AASSIGN: /* Is this a good idea? */
5845 Perl_warner(aTHX_ WARN_DEPRECATED,
5846 "defined(@array) is deprecated");
5847 Perl_warner(aTHX_ WARN_DEPRECATED,
5848 "\t(Maybe you should just omit the defined()?)\n");
5851 /* This is needed for
5852 if (defined %stash::)
5853 to work. Do not break Tk.
5855 break; /* Globals via GV can be undef */
5857 Perl_warner(aTHX_ WARN_DEPRECATED,
5858 "defined(%%hash) is deprecated");
5859 Perl_warner(aTHX_ WARN_DEPRECATED,
5860 "\t(Maybe you should just omit the defined()?)\n");
5871 Perl_ck_rfun(pTHX_ OP *o)
5873 OPCODE type = o->op_type;
5874 return refkids(ck_fun(o), type);
5878 Perl_ck_listiob(pTHX_ OP *o)
5882 kid = cLISTOPo->op_first;
5885 kid = cLISTOPo->op_first;
5887 if (kid->op_type == OP_PUSHMARK)
5888 kid = kid->op_sibling;
5889 if (kid && o->op_flags & OPf_STACKED)
5890 kid = kid->op_sibling;
5891 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5892 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5893 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5894 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5895 cLISTOPo->op_first->op_sibling = kid;
5896 cLISTOPo->op_last = kid;
5897 kid = kid->op_sibling;
5902 append_elem(o->op_type, o, newDEFSVOP());
5908 if (PL_hints & HINT_LOCALE)
5909 o->op_private |= OPpLOCALE;
5916 Perl_ck_fun_locale(pTHX_ OP *o)
5922 if (PL_hints & HINT_LOCALE)
5923 o->op_private |= OPpLOCALE;
5930 Perl_ck_sassign(pTHX_ OP *o)
5932 OP *kid = cLISTOPo->op_first;
5933 /* has a disposable target? */
5934 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5935 && !(kid->op_flags & OPf_STACKED)
5936 /* Cannot steal the second time! */
5937 && !(kid->op_private & OPpTARGET_MY))
5939 OP *kkid = kid->op_sibling;
5941 /* Can just relocate the target. */
5942 if (kkid && kkid->op_type == OP_PADSV
5943 && !(kkid->op_private & OPpLVAL_INTRO))
5945 kid->op_targ = kkid->op_targ;
5947 /* Now we do not need PADSV and SASSIGN. */
5948 kid->op_sibling = o->op_sibling; /* NULL */
5949 cLISTOPo->op_first = NULL;
5952 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5960 Perl_ck_scmp(pTHX_ OP *o)
5964 if (PL_hints & HINT_LOCALE)
5965 o->op_private |= OPpLOCALE;
5972 Perl_ck_match(pTHX_ OP *o)
5974 o->op_private |= OPpRUNTIME;
5979 Perl_ck_method(pTHX_ OP *o)
5981 OP *kid = cUNOPo->op_first;
5982 if (kid->op_type == OP_CONST) {
5983 SV* sv = kSVOP->op_sv;
5984 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5986 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
5987 sv = newSVpvn_share(SvPVX(sv), SvCUR(sv), 0);
5990 kSVOP->op_sv = Nullsv;
5992 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
6001 Perl_ck_null(pTHX_ OP *o)
6007 Perl_ck_open(pTHX_ OP *o)
6009 HV *table = GvHV(PL_hintgv);
6013 svp = hv_fetch(table, "open_IN", 7, FALSE);
6015 mode = mode_from_discipline(*svp);
6016 if (mode & O_BINARY)
6017 o->op_private |= OPpOPEN_IN_RAW;
6018 else if (mode & O_TEXT)
6019 o->op_private |= OPpOPEN_IN_CRLF;
6022 svp = hv_fetch(table, "open_OUT", 8, FALSE);
6024 mode = mode_from_discipline(*svp);
6025 if (mode & O_BINARY)
6026 o->op_private |= OPpOPEN_OUT_RAW;
6027 else if (mode & O_TEXT)
6028 o->op_private |= OPpOPEN_OUT_CRLF;
6031 if (o->op_type == OP_BACKTICK)
6037 Perl_ck_repeat(pTHX_ OP *o)
6039 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
6040 o->op_private |= OPpREPEAT_DOLIST;
6041 cBINOPo->op_first = force_list(cBINOPo->op_first);
6049 Perl_ck_require(pTHX_ OP *o)
6051 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
6052 SVOP *kid = (SVOP*)cUNOPo->op_first;
6054 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6056 for (s = SvPVX(kid->op_sv); *s; s++) {
6057 if (*s == ':' && s[1] == ':') {
6059 Move(s+2, s+1, strlen(s+2)+1, char);
6060 --SvCUR(kid->op_sv);
6063 if (SvREADONLY(kid->op_sv)) {
6064 SvREADONLY_off(kid->op_sv);
6065 sv_catpvn(kid->op_sv, ".pm", 3);
6066 SvREADONLY_on(kid->op_sv);
6069 sv_catpvn(kid->op_sv, ".pm", 3);
6077 Perl_ck_retarget(pTHX_ OP *o)
6079 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
6086 Perl_ck_select(pTHX_ OP *o)
6089 if (o->op_flags & OPf_KIDS) {
6090 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6091 if (kid && kid->op_sibling) {
6092 o->op_type = OP_SSELECT;
6093 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
6095 return fold_constants(o);
6099 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6100 if (kid && kid->op_type == OP_RV2GV)
6101 kid->op_private &= ~HINT_STRICT_REFS;
6106 Perl_ck_shift(pTHX_ OP *o)
6108 I32 type = o->op_type;
6110 if (!(o->op_flags & OPf_KIDS)) {
6115 if (!CvUNIQUE(PL_compcv)) {
6116 argop = newOP(OP_PADAV, OPf_REF);
6117 argop->op_targ = 0; /* PL_curpad[0] is @_ */
6120 argop = newUNOP(OP_RV2AV, 0,
6121 scalar(newGVOP(OP_GV, 0,
6122 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6125 argop = newUNOP(OP_RV2AV, 0,
6126 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
6127 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6128 #endif /* USE_THREADS */
6129 return newUNOP(type, 0, scalar(argop));
6131 return scalar(modkids(ck_fun(o), type));
6135 Perl_ck_sort(pTHX_ OP *o)
6140 if (PL_hints & HINT_LOCALE)
6141 o->op_private |= OPpLOCALE;
6144 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
6146 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6147 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
6149 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
6151 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
6153 if (kid->op_type == OP_SCOPE) {
6157 else if (kid->op_type == OP_LEAVE) {
6158 if (o->op_type == OP_SORT) {
6159 null(kid); /* wipe out leave */
6162 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
6163 if (k->op_next == kid)
6165 /* don't descend into loops */
6166 else if (k->op_type == OP_ENTERLOOP
6167 || k->op_type == OP_ENTERITER)
6169 k = cLOOPx(k)->op_lastop;
6174 kid->op_next = 0; /* just disconnect the leave */
6175 k = kLISTOP->op_first;
6180 if (o->op_type == OP_SORT) {
6181 /* provide scalar context for comparison function/block */
6187 o->op_flags |= OPf_SPECIAL;
6189 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
6192 firstkid = firstkid->op_sibling;
6195 /* provide list context for arguments */
6196 if (o->op_type == OP_SORT)
6203 S_simplify_sort(pTHX_ OP *o)
6206 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6210 if (!(o->op_flags & OPf_STACKED))
6212 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
6213 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
6214 kid = kUNOP->op_first; /* get past null */
6215 if (kid->op_type != OP_SCOPE)
6217 kid = kLISTOP->op_last; /* get past scope */
6218 switch(kid->op_type) {
6226 k = kid; /* remember this node*/
6227 if (kBINOP->op_first->op_type != OP_RV2SV)
6229 kid = kBINOP->op_first; /* get past cmp */
6230 if (kUNOP->op_first->op_type != OP_GV)
6232 kid = kUNOP->op_first; /* get past rv2sv */
6234 if (GvSTASH(gv) != PL_curstash)
6236 if (strEQ(GvNAME(gv), "a"))
6238 else if (strEQ(GvNAME(gv), "b"))
6242 kid = k; /* back to cmp */
6243 if (kBINOP->op_last->op_type != OP_RV2SV)
6245 kid = kBINOP->op_last; /* down to 2nd arg */
6246 if (kUNOP->op_first->op_type != OP_GV)
6248 kid = kUNOP->op_first; /* get past rv2sv */
6250 if (GvSTASH(gv) != PL_curstash
6252 ? strNE(GvNAME(gv), "a")
6253 : strNE(GvNAME(gv), "b")))
6255 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6257 o->op_private |= OPpSORT_REVERSE;
6258 if (k->op_type == OP_NCMP)
6259 o->op_private |= OPpSORT_NUMERIC;
6260 if (k->op_type == OP_I_NCMP)
6261 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6262 kid = cLISTOPo->op_first->op_sibling;
6263 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6264 op_free(kid); /* then delete it */
6265 cLISTOPo->op_children--;
6269 Perl_ck_split(pTHX_ OP *o)
6273 if (o->op_flags & OPf_STACKED)
6274 return no_fh_allowed(o);
6276 kid = cLISTOPo->op_first;
6277 if (kid->op_type != OP_NULL)
6278 Perl_croak(aTHX_ "panic: ck_split");
6279 kid = kid->op_sibling;
6280 op_free(cLISTOPo->op_first);
6281 cLISTOPo->op_first = kid;
6283 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6284 cLISTOPo->op_last = kid; /* There was only one element previously */
6287 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
6288 OP *sibl = kid->op_sibling;
6289 kid->op_sibling = 0;
6290 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6291 if (cLISTOPo->op_first == cLISTOPo->op_last)
6292 cLISTOPo->op_last = kid;
6293 cLISTOPo->op_first = kid;
6294 kid->op_sibling = sibl;
6297 kid->op_type = OP_PUSHRE;
6298 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6301 if (!kid->op_sibling)
6302 append_elem(OP_SPLIT, o, newDEFSVOP());
6304 kid = kid->op_sibling;
6307 if (!kid->op_sibling)
6308 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6310 kid = kid->op_sibling;
6313 if (kid->op_sibling)
6314 return too_many_arguments(o,PL_op_desc[o->op_type]);
6320 Perl_ck_join(pTHX_ OP *o)
6322 if (ckWARN(WARN_SYNTAX)) {
6323 OP *kid = cLISTOPo->op_first->op_sibling;
6324 if (kid && kid->op_type == OP_MATCH) {
6325 char *pmstr = "STRING";
6326 if (kPMOP->op_pmregexp)
6327 pmstr = kPMOP->op_pmregexp->precomp;
6328 Perl_warner(aTHX_ WARN_SYNTAX,
6329 "/%s/ should probably be written as \"%s\"",
6337 Perl_ck_subr(pTHX_ OP *o)
6340 OP *prev = ((cUNOPo->op_first->op_sibling)
6341 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6342 OP *o2 = prev->op_sibling;
6351 o->op_private |= OPpENTERSUB_HASTARG;
6352 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6353 if (cvop->op_type == OP_RV2CV) {
6355 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6356 null(cvop); /* disable rv2cv */
6357 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6358 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6359 GV *gv = cGVOPx_gv(tmpop);
6362 tmpop->op_private |= OPpEARLY_CV;
6363 else if (SvPOK(cv)) {
6364 namegv = CvANON(cv) ? gv : CvGV(cv);
6365 proto = SvPV((SV*)cv, n_a);
6369 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6370 if (o2->op_type == OP_CONST)
6371 o2->op_private &= ~OPpCONST_STRICT;
6372 else if (o2->op_type == OP_LIST) {
6373 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6374 if (o && o->op_type == OP_CONST)
6375 o->op_private &= ~OPpCONST_STRICT;
6378 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6379 if (PERLDB_SUB && PL_curstash != PL_debstash)
6380 o->op_private |= OPpENTERSUB_DB;
6381 while (o2 != cvop) {
6385 return too_many_arguments(o, gv_ename(namegv));
6403 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6405 arg == 1 ? "block or sub {}" : "sub {}",
6406 gv_ename(namegv), o2);
6409 /* '*' allows any scalar type, including bareword */
6412 if (o2->op_type == OP_RV2GV)
6413 goto wrapref; /* autoconvert GLOB -> GLOBref */
6414 else if (o2->op_type == OP_CONST)
6415 o2->op_private &= ~OPpCONST_STRICT;
6416 else if (o2->op_type == OP_ENTERSUB) {
6417 /* accidental subroutine, revert to bareword */
6418 OP *gvop = ((UNOP*)o2)->op_first;
6419 if (gvop && gvop->op_type == OP_NULL) {
6420 gvop = ((UNOP*)gvop)->op_first;
6422 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6425 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6426 (gvop = ((UNOP*)gvop)->op_first) &&
6427 gvop->op_type == OP_GV)
6429 GV *gv = cGVOPx_gv(gvop);
6430 OP *sibling = o2->op_sibling;
6431 SV *n = newSVpvn("",0);
6433 gv_fullname3(n, gv, "");
6434 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6435 sv_chop(n, SvPVX(n)+6);
6436 o2 = newSVOP(OP_CONST, 0, n);
6437 prev->op_sibling = o2;
6438 o2->op_sibling = sibling;
6450 if (o2->op_type != OP_RV2GV)
6451 bad_type(arg, "symbol", gv_ename(namegv), o2);
6454 if (o2->op_type != OP_ENTERSUB)
6455 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6458 if (o2->op_type != OP_RV2SV
6459 && o2->op_type != OP_PADSV
6460 && o2->op_type != OP_HELEM
6461 && o2->op_type != OP_AELEM
6462 && o2->op_type != OP_THREADSV)
6464 bad_type(arg, "scalar", gv_ename(namegv), o2);
6468 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6469 bad_type(arg, "array", gv_ename(namegv), o2);
6472 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6473 bad_type(arg, "hash", gv_ename(namegv), o2);
6477 OP* sib = kid->op_sibling;
6478 kid->op_sibling = 0;
6479 o2 = newUNOP(OP_REFGEN, 0, kid);
6480 o2->op_sibling = sib;
6481 prev->op_sibling = o2;
6492 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6493 gv_ename(namegv), SvPV((SV*)cv, n_a));
6498 mod(o2, OP_ENTERSUB);
6500 o2 = o2->op_sibling;
6502 if (proto && !optional &&
6503 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6504 return too_few_arguments(o, gv_ename(namegv));
6509 Perl_ck_svconst(pTHX_ OP *o)
6511 SvREADONLY_on(cSVOPo->op_sv);
6516 Perl_ck_trunc(pTHX_ OP *o)
6518 if (o->op_flags & OPf_KIDS) {
6519 SVOP *kid = (SVOP*)cUNOPo->op_first;
6521 if (kid->op_type == OP_NULL)
6522 kid = (SVOP*)kid->op_sibling;
6523 if (kid && kid->op_type == OP_CONST &&
6524 (kid->op_private & OPpCONST_BARE))
6526 o->op_flags |= OPf_SPECIAL;
6527 kid->op_private &= ~OPpCONST_STRICT;
6534 Perl_ck_substr(pTHX_ OP *o)
6537 if ((o->op_flags & OPf_KIDS) && o->op_private == 4) {
6538 OP *kid = cLISTOPo->op_first;
6540 if (kid->op_type == OP_NULL)
6541 kid = kid->op_sibling;
6543 kid->op_flags |= OPf_MOD;
6549 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6552 Perl_peep(pTHX_ register OP *o)
6555 register OP* oldop = 0;
6557 OP *last_composite = Nullop;
6559 if (!o || o->op_seq)
6563 SAVEVPTR(PL_curcop);
6564 for (; o; o = o->op_next) {
6570 switch (o->op_type) {
6574 PL_curcop = ((COP*)o); /* for warnings */
6575 o->op_seq = PL_op_seqmax++;
6576 last_composite = Nullop;
6580 if (cSVOPo->op_private & OPpCONST_STRICT)
6581 no_bareword_allowed(o);
6583 /* Relocate sv to the pad for thread safety.
6584 * Despite being a "constant", the SV is written to,
6585 * for reference counts, sv_upgrade() etc. */
6587 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6588 if (SvPADTMP(cSVOPo->op_sv)) {
6589 /* If op_sv is already a PADTMP then it is being used by
6590 * some pad, so make a copy. */
6591 sv_setsv(PL_curpad[ix],cSVOPo->op_sv);
6592 SvREADONLY_on(PL_curpad[ix]);
6593 SvREFCNT_dec(cSVOPo->op_sv);
6596 SvREFCNT_dec(PL_curpad[ix]);
6597 SvPADTMP_on(cSVOPo->op_sv);
6598 PL_curpad[ix] = cSVOPo->op_sv;
6599 /* XXX I don't know how this isn't readonly already. */
6600 SvREADONLY_on(PL_curpad[ix]);
6602 cSVOPo->op_sv = Nullsv;
6606 o->op_seq = PL_op_seqmax++;
6610 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6611 if (o->op_next->op_private & OPpTARGET_MY) {
6612 if (o->op_flags & OPf_STACKED) /* chained concats */
6613 goto ignore_optimization;
6615 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6616 o->op_targ = o->op_next->op_targ;
6617 o->op_next->op_targ = 0;
6618 o->op_private |= OPpTARGET_MY;
6623 ignore_optimization:
6624 o->op_seq = PL_op_seqmax++;
6627 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6628 o->op_seq = PL_op_seqmax++;
6629 break; /* Scalar stub must produce undef. List stub is noop */
6633 if (o->op_targ == OP_NEXTSTATE
6634 || o->op_targ == OP_DBSTATE
6635 || o->op_targ == OP_SETSTATE)
6637 PL_curcop = ((COP*)o);
6644 if (oldop && o->op_next) {
6645 oldop->op_next = o->op_next;
6648 o->op_seq = PL_op_seqmax++;
6652 if (o->op_next->op_type == OP_RV2SV) {
6653 if (!(o->op_next->op_private & OPpDEREF)) {
6655 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6657 o->op_next = o->op_next->op_next;
6658 o->op_type = OP_GVSV;
6659 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6662 else if (o->op_next->op_type == OP_RV2AV) {
6663 OP* pop = o->op_next->op_next;
6665 if (pop->op_type == OP_CONST &&
6666 (PL_op = pop->op_next) &&
6667 pop->op_next->op_type == OP_AELEM &&
6668 !(pop->op_next->op_private &
6669 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6670 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6678 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6679 o->op_next = pop->op_next->op_next;
6680 o->op_type = OP_AELEMFAST;
6681 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6682 o->op_private = (U8)i;
6687 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6689 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6690 /* XXX could check prototype here instead of just carping */
6691 SV *sv = sv_newmortal();
6692 gv_efullname3(sv, gv, Nullch);
6693 Perl_warner(aTHX_ WARN_PROTOTYPE,
6694 "%s() called too early to check prototype",
6699 o->op_seq = PL_op_seqmax++;
6710 o->op_seq = PL_op_seqmax++;
6711 while (cLOGOP->op_other->op_type == OP_NULL)
6712 cLOGOP->op_other = cLOGOP->op_other->op_next;
6713 peep(cLOGOP->op_other);
6717 o->op_seq = PL_op_seqmax++;
6718 peep(cLOOP->op_redoop);
6719 peep(cLOOP->op_nextop);
6720 peep(cLOOP->op_lastop);
6726 o->op_seq = PL_op_seqmax++;
6727 peep(cPMOP->op_pmreplstart);
6731 o->op_seq = PL_op_seqmax++;
6732 if (ckWARN(WARN_SYNTAX) && o->op_next
6733 && o->op_next->op_type == OP_NEXTSTATE) {
6734 if (o->op_next->op_sibling &&
6735 o->op_next->op_sibling->op_type != OP_EXIT &&
6736 o->op_next->op_sibling->op_type != OP_WARN &&
6737 o->op_next->op_sibling->op_type != OP_DIE) {
6738 line_t oldline = CopLINE(PL_curcop);
6740 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6741 Perl_warner(aTHX_ WARN_EXEC,
6742 "Statement unlikely to be reached");
6743 Perl_warner(aTHX_ WARN_EXEC,
6744 "\t(Maybe you meant system() when you said exec()?)\n");
6745 CopLINE_set(PL_curcop, oldline);
6754 SV **svp, **indsvp, *sv;
6759 o->op_seq = PL_op_seqmax++;
6761 if (((BINOP*)o)->op_last->op_type != OP_CONST)
6764 /* Make the CONST have a shared SV */
6765 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6766 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv)) && !IS_PADCONST(sv)) {
6767 key = SvPV(sv, keylen);
6768 lexname = newSVpvn_share(key, keylen, 0);
6773 if ((o->op_private & (OPpLVAL_INTRO)))
6776 rop = (UNOP*)((BINOP*)o)->op_first;
6777 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6779 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6780 if (!SvOBJECT(lexname))
6782 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6783 if (!fields || !GvHV(*fields))
6785 key = SvPV(*svp, keylen);
6786 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6788 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6789 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6791 ind = SvIV(*indsvp);
6793 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6794 rop->op_type = OP_RV2AV;
6795 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6796 o->op_type = OP_AELEM;
6797 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6799 if (SvREADONLY(*svp))
6801 SvFLAGS(sv) |= (SvFLAGS(*svp)
6802 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6812 SV **svp, **indsvp, *sv;
6816 SVOP *first_key_op, *key_op;
6818 o->op_seq = PL_op_seqmax++;
6819 if ((o->op_private & (OPpLVAL_INTRO))
6820 /* I bet there's always a pushmark... */
6821 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
6822 /* hmmm, no optimization if list contains only one key. */
6824 rop = (UNOP*)((LISTOP*)o)->op_last;
6825 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6827 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6828 if (!SvOBJECT(lexname))
6830 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6831 if (!fields || !GvHV(*fields))
6833 /* Again guessing that the pushmark can be jumped over.... */
6834 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
6835 ->op_first->op_sibling;
6836 /* Check that the key list contains only constants. */
6837 for (key_op = first_key_op; key_op;
6838 key_op = (SVOP*)key_op->op_sibling)
6839 if (key_op->op_type != OP_CONST)
6843 rop->op_type = OP_RV2AV;
6844 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6845 o->op_type = OP_ASLICE;
6846 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
6847 for (key_op = first_key_op; key_op;
6848 key_op = (SVOP*)key_op->op_sibling) {
6849 svp = cSVOPx_svp(key_op);
6850 key = SvPV(*svp, keylen);
6851 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6853 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
6854 "in variable %s of type %s",
6855 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6857 ind = SvIV(*indsvp);
6859 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6861 if (SvREADONLY(*svp))
6863 SvFLAGS(sv) |= (SvFLAGS(*svp)
6864 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6873 if (!(o->op_flags & OPf_WANT)
6874 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6878 o->op_seq = PL_op_seqmax++;
6882 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6883 o->op_seq = PL_op_seqmax++;
6889 if (last_composite) {
6890 OP *r = last_composite;
6892 while (r->op_sibling)
6895 || (r->op_next->op_type == OP_LIST
6896 && r->op_next->op_next == o))
6898 if (last_composite->op_type == OP_RV2AV)
6899 yyerror("Lvalue subs returning arrays not implemented yet");
6901 yyerror("Lvalue subs returning hashes not implemented yet");
6908 o->op_seq = PL_op_seqmax++;
6918 /* Efficient sub that returns a constant scalar value. */
6920 const_sv_xsub(pTHXo_ CV* cv)
6924 ST(0) = sv_2mortal(SvREFCNT_inc((SV*)XSANY.any_ptr));