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);
856 if (! specialCopIO(cop->cop_io))
857 SvREFCNT_dec(cop->cop_io);
863 if (o->op_type == OP_NULL)
866 o->op_targ = o->op_type;
867 o->op_type = OP_NULL;
868 o->op_ppaddr = PL_ppaddr[OP_NULL];
871 /* Contextualizers */
873 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
876 Perl_linklist(pTHX_ OP *o)
883 /* establish postfix order */
884 if (cUNOPo->op_first) {
885 o->op_next = LINKLIST(cUNOPo->op_first);
886 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
888 kid->op_next = LINKLIST(kid->op_sibling);
900 Perl_scalarkids(pTHX_ OP *o)
903 if (o && o->op_flags & OPf_KIDS) {
904 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
911 S_scalarboolean(pTHX_ OP *o)
913 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
915 if (ckWARN(WARN_SYNTAX)) {
916 line_t oldline = CopLINE(PL_curcop);
918 if (PL_copline != NOLINE)
919 CopLINE_set(PL_curcop, PL_copline);
920 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
921 CopLINE_set(PL_curcop, oldline);
928 Perl_scalar(pTHX_ OP *o)
932 /* assumes no premature commitment */
933 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
934 || o->op_type == OP_RETURN)
939 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
941 switch (o->op_type) {
943 if (o->op_private & OPpREPEAT_DOLIST)
944 null(((LISTOP*)cBINOPo->op_first)->op_first);
945 scalar(cBINOPo->op_first);
950 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
954 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
955 if (!kPMOP->op_pmreplroot)
956 deprecate("implicit split to @_");
964 if (o->op_flags & OPf_KIDS) {
965 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
971 kid = cLISTOPo->op_first;
973 while ((kid = kid->op_sibling)) {
979 WITH_THR(PL_curcop = &PL_compiling);
984 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
990 WITH_THR(PL_curcop = &PL_compiling);
997 Perl_scalarvoid(pTHX_ OP *o)
1004 if (o->op_type == OP_NEXTSTATE
1005 || o->op_type == OP_SETSTATE
1006 || o->op_type == OP_DBSTATE
1007 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1008 || o->op_targ == OP_SETSTATE
1009 || o->op_targ == OP_DBSTATE)))
1012 PL_curcop = (COP*)o; /* for warning below */
1015 /* assumes no premature commitment */
1016 want = o->op_flags & OPf_WANT;
1017 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
1018 || o->op_type == OP_RETURN)
1023 if ((o->op_private & OPpTARGET_MY)
1024 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1026 return scalar(o); /* As if inside SASSIGN */
1029 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1031 switch (o->op_type) {
1033 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1037 if (o->op_flags & OPf_STACKED)
1041 if (o->op_private == 4)
1083 case OP_GETSOCKNAME:
1084 case OP_GETPEERNAME:
1089 case OP_GETPRIORITY:
1112 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1113 useless = PL_op_desc[o->op_type];
1120 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1121 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1122 useless = "a variable";
1127 if (cSVOPo->op_private & OPpCONST_STRICT)
1128 no_bareword_allowed(o);
1131 if (ckWARN(WARN_VOID)) {
1132 useless = "a constant";
1133 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1135 else if (SvPOK(sv)) {
1136 if (strnEQ(SvPVX(sv), "di", 2) ||
1137 strnEQ(SvPVX(sv), "ds", 2) ||
1138 strnEQ(SvPVX(sv), "ig", 2))
1143 null(o); /* don't execute or even remember it */
1147 o->op_type = OP_PREINC; /* pre-increment is faster */
1148 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1152 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1153 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1159 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1164 if (o->op_flags & OPf_STACKED)
1171 if (!(o->op_flags & OPf_KIDS))
1180 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1187 /* all requires must return a boolean value */
1188 o->op_flags &= ~OPf_WANT;
1193 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1194 if (!kPMOP->op_pmreplroot)
1195 deprecate("implicit split to @_");
1201 if (ckWARN(WARN_VOID))
1202 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1208 Perl_listkids(pTHX_ OP *o)
1211 if (o && o->op_flags & OPf_KIDS) {
1212 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1219 Perl_list(pTHX_ OP *o)
1223 /* assumes no premature commitment */
1224 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1225 || o->op_type == OP_RETURN)
1230 if ((o->op_private & OPpTARGET_MY)
1231 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1233 return o; /* As if inside SASSIGN */
1236 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1238 switch (o->op_type) {
1241 list(cBINOPo->op_first);
1246 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1254 if (!(o->op_flags & OPf_KIDS))
1256 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1257 list(cBINOPo->op_first);
1258 return gen_constant_list(o);
1265 kid = cLISTOPo->op_first;
1267 while ((kid = kid->op_sibling)) {
1268 if (kid->op_sibling)
1273 WITH_THR(PL_curcop = &PL_compiling);
1277 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1278 if (kid->op_sibling)
1283 WITH_THR(PL_curcop = &PL_compiling);
1286 /* all requires must return a boolean value */
1287 o->op_flags &= ~OPf_WANT;
1294 Perl_scalarseq(pTHX_ OP *o)
1299 if (o->op_type == OP_LINESEQ ||
1300 o->op_type == OP_SCOPE ||
1301 o->op_type == OP_LEAVE ||
1302 o->op_type == OP_LEAVETRY)
1305 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1306 if (kid->op_sibling) {
1310 PL_curcop = &PL_compiling;
1312 o->op_flags &= ~OPf_PARENS;
1313 if (PL_hints & HINT_BLOCK_SCOPE)
1314 o->op_flags |= OPf_PARENS;
1317 o = newOP(OP_STUB, 0);
1322 S_modkids(pTHX_ OP *o, I32 type)
1325 if (o && o->op_flags & OPf_KIDS) {
1326 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1333 Perl_mod(pTHX_ OP *o, I32 type)
1339 if (!o || PL_error_count)
1342 if ((o->op_private & OPpTARGET_MY)
1343 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1348 switch (o->op_type) {
1353 if (!(o->op_private & (OPpCONST_ARYBASE)))
1355 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1356 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1360 SAVEI32(PL_compiling.cop_arybase);
1361 PL_compiling.cop_arybase = 0;
1363 else if (type == OP_REFGEN)
1366 Perl_croak(aTHX_ "That use of $[ is unsupported");
1369 if (o->op_flags & OPf_PARENS)
1373 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1374 !(o->op_flags & OPf_STACKED)) {
1375 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1376 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1377 assert(cUNOPo->op_first->op_type == OP_NULL);
1378 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1381 else { /* lvalue subroutine call */
1382 o->op_private |= OPpLVAL_INTRO;
1383 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1384 /* Backward compatibility mode: */
1385 o->op_private |= OPpENTERSUB_INARGS;
1388 else { /* Compile-time error message: */
1389 OP *kid = cUNOPo->op_first;
1393 if (kid->op_type == OP_PUSHMARK)
1395 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1397 "panic: unexpected lvalue entersub "
1398 "args: type/targ %ld:%ld",
1399 (long)kid->op_type,kid->op_targ);
1400 kid = kLISTOP->op_first;
1402 while (kid->op_sibling)
1403 kid = kid->op_sibling;
1404 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1406 if (kid->op_type == OP_METHOD_NAMED
1407 || kid->op_type == OP_METHOD)
1411 if (kid->op_sibling || kid->op_next != kid) {
1412 yyerror("panic: unexpected optree near method call");
1416 NewOp(1101, newop, 1, UNOP);
1417 newop->op_type = OP_RV2CV;
1418 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1419 newop->op_first = Nullop;
1420 newop->op_next = (OP*)newop;
1421 kid->op_sibling = (OP*)newop;
1422 newop->op_private |= OPpLVAL_INTRO;
1426 if (kid->op_type != OP_RV2CV)
1428 "panic: unexpected lvalue entersub "
1429 "entry via type/targ %ld:%ld",
1430 (long)kid->op_type,kid->op_targ);
1431 kid->op_private |= OPpLVAL_INTRO;
1432 break; /* Postpone until runtime */
1436 kid = kUNOP->op_first;
1437 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1438 kid = kUNOP->op_first;
1439 if (kid->op_type == OP_NULL)
1441 "Unexpected constant lvalue entersub "
1442 "entry via type/targ %ld:%ld",
1443 (long)kid->op_type,kid->op_targ);
1444 if (kid->op_type != OP_GV) {
1445 /* Restore RV2CV to check lvalueness */
1447 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1448 okid->op_next = kid->op_next;
1449 kid->op_next = okid;
1452 okid->op_next = Nullop;
1453 okid->op_type = OP_RV2CV;
1455 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1456 okid->op_private |= OPpLVAL_INTRO;
1460 cv = GvCV(kGVOP_gv);
1470 /* grep, foreach, subcalls, refgen */
1471 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1473 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1474 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1476 : (o->op_type == OP_ENTERSUB
1477 ? "non-lvalue subroutine call"
1478 : PL_op_desc[o->op_type])),
1479 type ? PL_op_desc[type] : "local"));
1493 case OP_RIGHT_SHIFT:
1502 if (!(o->op_flags & OPf_STACKED))
1508 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1514 if (!type && cUNOPo->op_first->op_type != OP_GV)
1515 Perl_croak(aTHX_ "Can't localize through a reference");
1516 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1517 PL_modcount = 10000;
1518 return o; /* Treat \(@foo) like ordinary list. */
1522 if (scalar_mod_type(o, type))
1524 ref(cUNOPo->op_first, o->op_type);
1533 PL_modcount = 10000;
1536 if (!type && cUNOPo->op_first->op_type != OP_GV)
1537 Perl_croak(aTHX_ "Can't localize through a reference");
1538 ref(cUNOPo->op_first, o->op_type);
1542 PL_hints |= HINT_BLOCK_SCOPE;
1552 PL_modcount = 10000;
1553 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1554 return o; /* Treat \(@foo) like ordinary list. */
1555 if (scalar_mod_type(o, type))
1561 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1562 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1567 PL_modcount++; /* XXX ??? */
1569 #endif /* USE_THREADS */
1575 if (type != OP_SASSIGN)
1579 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1585 pad_free(o->op_targ);
1586 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1587 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1588 if (o->op_flags & OPf_KIDS)
1589 mod(cBINOPo->op_first->op_sibling, type);
1594 ref(cBINOPo->op_first, o->op_type);
1595 if (type == OP_ENTERSUB &&
1596 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1597 o->op_private |= OPpLVAL_DEFER;
1604 if (o->op_flags & OPf_KIDS)
1605 mod(cLISTOPo->op_last, type);
1609 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1611 else if (!(o->op_flags & OPf_KIDS))
1613 if (o->op_targ != OP_LIST) {
1614 mod(cBINOPo->op_first, type);
1619 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1623 o->op_flags |= OPf_MOD;
1625 if (type == OP_AASSIGN || type == OP_SASSIGN)
1626 o->op_flags |= OPf_SPECIAL|OPf_REF;
1628 o->op_private |= OPpLVAL_INTRO;
1629 o->op_flags &= ~OPf_SPECIAL;
1630 PL_hints |= HINT_BLOCK_SCOPE;
1632 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1633 o->op_flags |= OPf_REF;
1638 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1642 if (o->op_type == OP_RV2GV)
1666 case OP_RIGHT_SHIFT:
1685 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1687 switch (o->op_type) {
1695 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1708 Perl_refkids(pTHX_ OP *o, I32 type)
1711 if (o && o->op_flags & OPf_KIDS) {
1712 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1719 Perl_ref(pTHX_ OP *o, I32 type)
1723 if (!o || PL_error_count)
1726 switch (o->op_type) {
1728 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1729 !(o->op_flags & OPf_STACKED)) {
1730 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1731 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1732 assert(cUNOPo->op_first->op_type == OP_NULL);
1733 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1734 o->op_flags |= OPf_SPECIAL;
1739 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1743 if (type == OP_DEFINED)
1744 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1745 ref(cUNOPo->op_first, o->op_type);
1748 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1749 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1750 : type == OP_RV2HV ? OPpDEREF_HV
1752 o->op_flags |= OPf_MOD;
1757 o->op_flags |= OPf_MOD; /* XXX ??? */
1762 o->op_flags |= OPf_REF;
1765 if (type == OP_DEFINED)
1766 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1767 ref(cUNOPo->op_first, o->op_type);
1772 o->op_flags |= OPf_REF;
1777 if (!(o->op_flags & OPf_KIDS))
1779 ref(cBINOPo->op_first, type);
1783 ref(cBINOPo->op_first, o->op_type);
1784 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1785 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1786 : type == OP_RV2HV ? OPpDEREF_HV
1788 o->op_flags |= OPf_MOD;
1796 if (!(o->op_flags & OPf_KIDS))
1798 ref(cLISTOPo->op_last, type);
1808 S_dup_attrlist(pTHX_ OP *o)
1812 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1813 * where the first kid is OP_PUSHMARK and the remaining ones
1814 * are OP_CONST. We need to push the OP_CONST values.
1816 if (o->op_type == OP_CONST)
1817 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1819 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1820 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1821 if (o->op_type == OP_CONST)
1822 rop = append_elem(OP_LIST, rop,
1823 newSVOP(OP_CONST, o->op_flags,
1824 SvREFCNT_inc(cSVOPo->op_sv)));
1831 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1835 /* fake up C<use attributes $pkg,$rv,@attrs> */
1836 ENTER; /* need to protect against side-effects of 'use' */
1838 if (stash && HvNAME(stash))
1839 stashsv = newSVpv(HvNAME(stash), 0);
1841 stashsv = &PL_sv_no;
1843 #define ATTRSMODULE "attributes"
1845 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1846 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1848 prepend_elem(OP_LIST,
1849 newSVOP(OP_CONST, 0, stashsv),
1850 prepend_elem(OP_LIST,
1851 newSVOP(OP_CONST, 0,
1853 dup_attrlist(attrs))));
1858 Perl_apply_attrs_string(pTHX_ char *stashpv, CV *cv,
1859 char *attrstr, STRLEN len)
1864 len = strlen(attrstr);
1868 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
1870 char *sstr = attrstr;
1871 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
1872 attrs = append_elem(OP_LIST, attrs,
1873 newSVOP(OP_CONST, 0,
1874 newSVpvn(sstr, attrstr-sstr)));
1878 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1879 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1880 Nullsv, prepend_elem(OP_LIST,
1881 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
1882 prepend_elem(OP_LIST,
1883 newSVOP(OP_CONST, 0,
1889 S_my_kid(pTHX_ OP *o, OP *attrs)
1894 if (!o || PL_error_count)
1898 if (type == OP_LIST) {
1899 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1901 } else if (type == OP_UNDEF) {
1903 } else if (type == OP_RV2SV || /* "our" declaration */
1905 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1906 o->op_private |= OPpOUR_INTRO;
1908 } else if (type != OP_PADSV &&
1911 type != OP_PUSHMARK)
1913 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1914 PL_op_desc[o->op_type],
1915 PL_in_my == KEY_our ? "our" : "my"));
1918 else if (attrs && type != OP_PUSHMARK) {
1924 PL_in_my_stash = Nullhv;
1926 /* check for C<my Dog $spot> when deciding package */
1927 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1928 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1929 stash = SvSTASH(*namesvp);
1931 stash = PL_curstash;
1932 padsv = PAD_SV(o->op_targ);
1933 apply_attrs(stash, padsv, attrs);
1935 o->op_flags |= OPf_MOD;
1936 o->op_private |= OPpLVAL_INTRO;
1941 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1943 if (o->op_flags & OPf_PARENS)
1947 o = my_kid(o, attrs);
1949 PL_in_my_stash = Nullhv;
1954 Perl_my(pTHX_ OP *o)
1956 return my_kid(o, Nullop);
1960 Perl_sawparens(pTHX_ OP *o)
1963 o->op_flags |= OPf_PARENS;
1968 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1973 if (ckWARN(WARN_MISC) &&
1974 (left->op_type == OP_RV2AV ||
1975 left->op_type == OP_RV2HV ||
1976 left->op_type == OP_PADAV ||
1977 left->op_type == OP_PADHV)) {
1978 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1979 right->op_type == OP_TRANS)
1980 ? right->op_type : OP_MATCH];
1981 const char *sample = ((left->op_type == OP_RV2AV ||
1982 left->op_type == OP_PADAV)
1983 ? "@array" : "%hash");
1984 Perl_warner(aTHX_ WARN_MISC,
1985 "Applying %s to %s will act on scalar(%s)",
1986 desc, sample, sample);
1989 if (!(right->op_flags & OPf_STACKED) &&
1990 (right->op_type == OP_MATCH ||
1991 right->op_type == OP_SUBST ||
1992 right->op_type == OP_TRANS)) {
1993 right->op_flags |= OPf_STACKED;
1994 if (right->op_type != OP_MATCH &&
1995 ! (right->op_type == OP_TRANS &&
1996 right->op_private & OPpTRANS_IDENTICAL))
1997 left = mod(left, right->op_type);
1998 if (right->op_type == OP_TRANS)
1999 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
2001 o = prepend_elem(right->op_type, scalar(left), right);
2003 return newUNOP(OP_NOT, 0, scalar(o));
2007 return bind_match(type, left,
2008 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
2012 Perl_invert(pTHX_ OP *o)
2016 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
2017 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2021 Perl_scope(pTHX_ OP *o)
2024 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2025 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2026 o->op_type = OP_LEAVE;
2027 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2030 if (o->op_type == OP_LINESEQ) {
2032 o->op_type = OP_SCOPE;
2033 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2034 kid = ((LISTOP*)o)->op_first;
2035 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2039 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
2046 Perl_save_hints(pTHX)
2049 SAVESPTR(GvHV(PL_hintgv));
2050 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
2051 SAVEFREESV(GvHV(PL_hintgv));
2055 Perl_block_start(pTHX_ int full)
2058 int retval = PL_savestack_ix;
2060 SAVEI32(PL_comppad_name_floor);
2061 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
2063 PL_comppad_name_fill = PL_comppad_name_floor;
2064 if (PL_comppad_name_floor < 0)
2065 PL_comppad_name_floor = 0;
2066 SAVEI32(PL_min_intro_pending);
2067 SAVEI32(PL_max_intro_pending);
2068 PL_min_intro_pending = 0;
2069 SAVEI32(PL_comppad_name_fill);
2070 SAVEI32(PL_padix_floor);
2071 PL_padix_floor = PL_padix;
2072 PL_pad_reset_pending = FALSE;
2074 PL_hints &= ~HINT_BLOCK_SCOPE;
2075 SAVESPTR(PL_compiling.cop_warnings);
2076 if (! specialWARN(PL_compiling.cop_warnings)) {
2077 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2078 SAVEFREESV(PL_compiling.cop_warnings) ;
2080 SAVESPTR(PL_compiling.cop_io);
2081 if (! specialCopIO(PL_compiling.cop_io)) {
2082 PL_compiling.cop_io = newSVsv(PL_compiling.cop_io) ;
2083 SAVEFREESV(PL_compiling.cop_io) ;
2089 Perl_block_end(pTHX_ I32 floor, OP *seq)
2092 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2093 OP* retval = scalarseq(seq);
2095 PL_pad_reset_pending = FALSE;
2096 PL_compiling.op_private = PL_hints;
2098 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2099 pad_leavemy(PL_comppad_name_fill);
2108 OP *o = newOP(OP_THREADSV, 0);
2109 o->op_targ = find_threadsv("_");
2112 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2113 #endif /* USE_THREADS */
2117 Perl_newPROG(pTHX_ OP *o)
2123 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2124 ((PL_in_eval & EVAL_KEEPERR)
2125 ? OPf_SPECIAL : 0), o);
2126 PL_eval_start = linklist(PL_eval_root);
2127 PL_eval_root->op_private |= OPpREFCOUNTED;
2128 OpREFCNT_set(PL_eval_root, 1);
2129 PL_eval_root->op_next = 0;
2130 peep(PL_eval_start);
2135 PL_main_root = scope(sawparens(scalarvoid(o)));
2136 PL_curcop = &PL_compiling;
2137 PL_main_start = LINKLIST(PL_main_root);
2138 PL_main_root->op_private |= OPpREFCOUNTED;
2139 OpREFCNT_set(PL_main_root, 1);
2140 PL_main_root->op_next = 0;
2141 peep(PL_main_start);
2144 /* Register with debugger */
2146 CV *cv = get_cv("DB::postponed", FALSE);
2150 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2152 call_sv((SV*)cv, G_DISCARD);
2159 Perl_localize(pTHX_ OP *o, I32 lex)
2161 if (o->op_flags & OPf_PARENS)
2165 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2167 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2168 if (*s == ';' || *s == '=')
2169 Perl_warner(aTHX_ WARN_PARENTHESIS,
2170 "Parentheses missing around \"%s\" list",
2171 lex ? (PL_in_my == KEY_our ? "our" : "my") : "local");
2177 o = mod(o, OP_NULL); /* a bit kludgey */
2179 PL_in_my_stash = Nullhv;
2184 Perl_jmaybe(pTHX_ OP *o)
2186 if (o->op_type == OP_LIST) {
2189 o2 = newOP(OP_THREADSV, 0);
2190 o2->op_targ = find_threadsv(";");
2192 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2193 #endif /* USE_THREADS */
2194 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2200 Perl_fold_constants(pTHX_ register OP *o)
2204 I32 type = o->op_type;
2207 if (PL_opargs[type] & OA_RETSCALAR)
2209 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2210 o->op_targ = pad_alloc(type, SVs_PADTMP);
2212 /* integerize op, unless it happens to be C<-foo>.
2213 * XXX should pp_i_negate() do magic string negation instead? */
2214 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2215 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2216 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2218 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2221 if (!(PL_opargs[type] & OA_FOLDCONST))
2226 /* XXX might want a ck_negate() for this */
2227 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2240 if (o->op_private & OPpLOCALE)
2245 goto nope; /* Don't try to run w/ errors */
2247 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2248 if ((curop->op_type != OP_CONST ||
2249 (curop->op_private & OPpCONST_BARE)) &&
2250 curop->op_type != OP_LIST &&
2251 curop->op_type != OP_SCALAR &&
2252 curop->op_type != OP_NULL &&
2253 curop->op_type != OP_PUSHMARK)
2259 curop = LINKLIST(o);
2263 sv = *(PL_stack_sp--);
2264 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2265 pad_swipe(o->op_targ);
2266 else if (SvTEMP(sv)) { /* grab mortal temp? */
2267 (void)SvREFCNT_inc(sv);
2271 if (type == OP_RV2GV)
2272 return newGVOP(OP_GV, 0, (GV*)sv);
2274 /* try to smush double to int, but don't smush -2.0 to -2 */
2275 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2279 if ((NV)iv == SvNV(sv)) {
2284 SvIOK_off(sv); /* undo SvIV() damage */
2286 return newSVOP(OP_CONST, 0, sv);
2290 if (!(PL_opargs[type] & OA_OTHERINT))
2293 if (!(PL_hints & HINT_INTEGER)) {
2294 if (type == OP_MODULO
2295 || type == OP_DIVIDE
2296 || !(o->op_flags & OPf_KIDS))
2301 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2302 if (curop->op_type == OP_CONST) {
2303 if (SvIOK(((SVOP*)curop)->op_sv))
2307 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2311 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2318 Perl_gen_constant_list(pTHX_ register OP *o)
2322 I32 oldtmps_floor = PL_tmps_floor;
2326 return o; /* Don't attempt to run with errors */
2328 PL_op = curop = LINKLIST(o);
2335 PL_tmps_floor = oldtmps_floor;
2337 o->op_type = OP_RV2AV;
2338 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2339 curop = ((UNOP*)o)->op_first;
2340 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2347 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2352 if (!o || o->op_type != OP_LIST)
2353 o = newLISTOP(OP_LIST, 0, o, Nullop);
2355 o->op_flags &= ~OPf_WANT;
2357 if (!(PL_opargs[type] & OA_MARK))
2358 null(cLISTOPo->op_first);
2361 o->op_ppaddr = PL_ppaddr[type];
2362 o->op_flags |= flags;
2364 o = CHECKOP(type, o);
2365 if (o->op_type != type)
2368 if (cLISTOPo->op_children < 7) {
2369 /* XXX do we really need to do this if we're done appending?? */
2370 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2372 cLISTOPo->op_last = last; /* in case check substituted last arg */
2375 return fold_constants(o);
2378 /* List constructors */
2381 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2389 if (first->op_type != type
2390 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2392 return newLISTOP(type, 0, first, last);
2395 if (first->op_flags & OPf_KIDS)
2396 ((LISTOP*)first)->op_last->op_sibling = last;
2398 first->op_flags |= OPf_KIDS;
2399 ((LISTOP*)first)->op_first = last;
2401 ((LISTOP*)first)->op_last = last;
2402 ((LISTOP*)first)->op_children++;
2407 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2415 if (first->op_type != type)
2416 return prepend_elem(type, (OP*)first, (OP*)last);
2418 if (last->op_type != type)
2419 return append_elem(type, (OP*)first, (OP*)last);
2421 first->op_last->op_sibling = last->op_first;
2422 first->op_last = last->op_last;
2423 first->op_children += last->op_children;
2424 if (first->op_children)
2425 first->op_flags |= OPf_KIDS;
2427 #ifdef PL_OP_SLAB_ALLOC
2435 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2443 if (last->op_type == type) {
2444 if (type == OP_LIST) { /* already a PUSHMARK there */
2445 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2446 ((LISTOP*)last)->op_first->op_sibling = first;
2449 if (!(last->op_flags & OPf_KIDS)) {
2450 ((LISTOP*)last)->op_last = first;
2451 last->op_flags |= OPf_KIDS;
2453 first->op_sibling = ((LISTOP*)last)->op_first;
2454 ((LISTOP*)last)->op_first = first;
2456 ((LISTOP*)last)->op_children++;
2460 return newLISTOP(type, 0, first, last);
2466 Perl_newNULLLIST(pTHX)
2468 return newOP(OP_STUB, 0);
2472 Perl_force_list(pTHX_ OP *o)
2474 if (!o || o->op_type != OP_LIST)
2475 o = newLISTOP(OP_LIST, 0, o, Nullop);
2481 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2485 NewOp(1101, listop, 1, LISTOP);
2487 listop->op_type = type;
2488 listop->op_ppaddr = PL_ppaddr[type];
2489 listop->op_children = (first != 0) + (last != 0);
2490 listop->op_flags = flags;
2494 else if (!first && last)
2497 first->op_sibling = last;
2498 listop->op_first = first;
2499 listop->op_last = last;
2500 if (type == OP_LIST) {
2502 pushop = newOP(OP_PUSHMARK, 0);
2503 pushop->op_sibling = first;
2504 listop->op_first = pushop;
2505 listop->op_flags |= OPf_KIDS;
2507 listop->op_last = pushop;
2509 else if (listop->op_children)
2510 listop->op_flags |= OPf_KIDS;
2516 Perl_newOP(pTHX_ I32 type, I32 flags)
2519 NewOp(1101, o, 1, OP);
2521 o->op_ppaddr = PL_ppaddr[type];
2522 o->op_flags = flags;
2525 o->op_private = 0 + (flags >> 8);
2526 if (PL_opargs[type] & OA_RETSCALAR)
2528 if (PL_opargs[type] & OA_TARGET)
2529 o->op_targ = pad_alloc(type, SVs_PADTMP);
2530 return CHECKOP(type, o);
2534 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2539 first = newOP(OP_STUB, 0);
2540 if (PL_opargs[type] & OA_MARK)
2541 first = force_list(first);
2543 NewOp(1101, unop, 1, UNOP);
2544 unop->op_type = type;
2545 unop->op_ppaddr = PL_ppaddr[type];
2546 unop->op_first = first;
2547 unop->op_flags = flags | OPf_KIDS;
2548 unop->op_private = 1 | (flags >> 8);
2549 unop = (UNOP*) CHECKOP(type, unop);
2553 return fold_constants((OP *) unop);
2557 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2560 NewOp(1101, binop, 1, BINOP);
2563 first = newOP(OP_NULL, 0);
2565 binop->op_type = type;
2566 binop->op_ppaddr = PL_ppaddr[type];
2567 binop->op_first = first;
2568 binop->op_flags = flags | OPf_KIDS;
2571 binop->op_private = 1 | (flags >> 8);
2574 binop->op_private = 2 | (flags >> 8);
2575 first->op_sibling = last;
2578 binop = (BINOP*)CHECKOP(type, binop);
2579 if (binop->op_next || binop->op_type != type)
2582 binop->op_last = binop->op_first->op_sibling;
2584 return fold_constants((OP *)binop);
2588 utf8compare(const void *a, const void *b)
2591 for (i = 0; i < 10; i++) {
2592 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2594 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2601 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2603 SV *tstr = ((SVOP*)expr)->op_sv;
2604 SV *rstr = ((SVOP*)repl)->op_sv;
2607 register U8 *t = (U8*)SvPV(tstr, tlen);
2608 register U8 *r = (U8*)SvPV(rstr, rlen);
2614 register short *tbl;
2616 complement = o->op_private & OPpTRANS_COMPLEMENT;
2617 del = o->op_private & OPpTRANS_DELETE;
2618 squash = o->op_private & OPpTRANS_SQUASH;
2621 o->op_private |= OPpTRANS_FROM_UTF;
2624 o->op_private |= OPpTRANS_TO_UTF;
2626 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2627 SV* listsv = newSVpvn("# comment\n",10);
2629 U8* tend = t + tlen;
2630 U8* rend = r + rlen;
2645 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2646 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2649 U8 tmpbuf[UTF8_MAXLEN];
2653 New(1109, cp, tlen, U8*);
2655 transv = newSVpvn("",0);
2664 qsort(cp, i, sizeof(U8*), utf8compare);
2665 for (j = 0; j < i; j++) {
2667 I32 cur = j < i ? cp[j+1] - s : tend - s;
2668 UV val = utf8_to_uv(s, cur, &ulen, 0);
2670 diff = val - nextmin;
2672 t = uv_to_utf8(tmpbuf,nextmin);
2673 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2675 t = uv_to_utf8(tmpbuf, val - 1);
2676 sv_catpvn(transv, "\377", 1);
2677 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2681 val = utf8_to_uv(s+1, cur - 1, &ulen, 0);
2685 t = uv_to_utf8(tmpbuf,nextmin);
2686 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2687 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2688 sv_catpvn(transv, "\377", 1);
2689 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2690 t = (U8*)SvPVX(transv);
2691 tlen = SvCUR(transv);
2694 else if (!rlen && !del) {
2695 r = t; rlen = tlen; rend = tend;
2699 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
2701 o->op_private |= OPpTRANS_IDENTICAL;
2705 while (t < tend || tfirst <= tlast) {
2706 /* see if we need more "t" chars */
2707 if (tfirst > tlast) {
2708 tfirst = (I32)utf8_to_uv(t, tend - t, &ulen, 0);
2710 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2712 tlast = (I32)utf8_to_uv(t, tend - t, &ulen, 0);
2719 /* now see if we need more "r" chars */
2720 if (rfirst > rlast) {
2722 rfirst = (I32)utf8_to_uv(r, rend - r, &ulen, 0);
2724 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2726 rlast = (I32)utf8_to_uv(r, rend - r, &ulen, 0);
2735 rfirst = rlast = 0xffffffff;
2739 /* now see which range will peter our first, if either. */
2740 tdiff = tlast - tfirst;
2741 rdiff = rlast - rfirst;
2748 if (rfirst == 0xffffffff) {
2749 diff = tdiff; /* oops, pretend rdiff is infinite */
2751 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2752 (long)tfirst, (long)tlast);
2754 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2758 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2759 (long)tfirst, (long)(tfirst + diff),
2762 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2763 (long)tfirst, (long)rfirst);
2765 if (rfirst + diff > max)
2766 max = rfirst + diff;
2771 else if (rfirst <= 0x800)
2772 grows |= (tfirst < 0x80);
2773 else if (rfirst <= 0x10000)
2774 grows |= (tfirst < 0x800);
2775 else if (rfirst <= 0x200000)
2776 grows |= (tfirst < 0x10000);
2777 else if (rfirst <= 0x4000000)
2778 grows |= (tfirst < 0x200000);
2779 else if (rfirst <= 0x80000000)
2780 grows |= (tfirst < 0x4000000);
2792 else if (max > 0xff)
2797 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2798 SvREFCNT_dec(listsv);
2800 SvREFCNT_dec(transv);
2802 if (!del && havefinal)
2803 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
2804 newSVuv((UV)final), 0);
2806 if (grows && to_utf)
2807 o->op_private |= OPpTRANS_GROWS;
2814 tbl = (short*)cPVOPo->op_pv;
2816 Zero(tbl, 256, short);
2817 for (i = 0; i < tlen; i++)
2819 for (i = 0, j = 0; i < 256; i++) {
2835 if (!rlen && !del) {
2838 o->op_private |= OPpTRANS_IDENTICAL;
2840 for (i = 0; i < 256; i++)
2842 for (i = 0, j = 0; i < tlen; i++,j++) {
2845 if (tbl[t[i]] == -1)
2851 if (tbl[t[i]] == -1)
2862 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2867 NewOp(1101, pmop, 1, PMOP);
2868 pmop->op_type = type;
2869 pmop->op_ppaddr = PL_ppaddr[type];
2870 pmop->op_flags = flags;
2871 pmop->op_private = 0 | (flags >> 8);
2873 if (PL_hints & HINT_RE_TAINT)
2874 pmop->op_pmpermflags |= PMf_RETAINT;
2875 if (PL_hints & HINT_LOCALE)
2876 pmop->op_pmpermflags |= PMf_LOCALE;
2877 pmop->op_pmflags = pmop->op_pmpermflags;
2879 /* link into pm list */
2880 if (type != OP_TRANS && PL_curstash) {
2881 pmop->op_pmnext = HvPMROOT(PL_curstash);
2882 HvPMROOT(PL_curstash) = pmop;
2889 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2894 I32 repl_has_vars = 0;
2896 if (o->op_type == OP_TRANS)
2897 return pmtrans(o, expr, repl);
2899 PL_hints |= HINT_BLOCK_SCOPE;
2902 if (expr->op_type == OP_CONST) {
2904 SV *pat = ((SVOP*)expr)->op_sv;
2905 char *p = SvPV(pat, plen);
2906 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2907 sv_setpvn(pat, "\\s+", 3);
2908 p = SvPV(pat, plen);
2909 pm->op_pmflags |= PMf_SKIPWHITE;
2911 if ((PL_hints & HINT_UTF8) || (SvUTF8(pat) && !(PL_hints & HINT_BYTE)))
2912 pm->op_pmdynflags |= PMdf_UTF8;
2913 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2914 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2915 pm->op_pmflags |= PMf_WHITE;
2919 if (PL_hints & HINT_UTF8)
2920 pm->op_pmdynflags |= PMdf_UTF8;
2921 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2922 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2924 : OP_REGCMAYBE),0,expr);
2926 NewOp(1101, rcop, 1, LOGOP);
2927 rcop->op_type = OP_REGCOMP;
2928 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2929 rcop->op_first = scalar(expr);
2930 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2931 ? (OPf_SPECIAL | OPf_KIDS)
2933 rcop->op_private = 1;
2936 /* establish postfix order */
2937 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2939 rcop->op_next = expr;
2940 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2943 rcop->op_next = LINKLIST(expr);
2944 expr->op_next = (OP*)rcop;
2947 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2952 if (pm->op_pmflags & PMf_EVAL) {
2954 if (CopLINE(PL_curcop) < PL_multi_end)
2955 CopLINE_set(PL_curcop, PL_multi_end);
2958 else if (repl->op_type == OP_THREADSV
2959 && strchr("&`'123456789+",
2960 PL_threadsv_names[repl->op_targ]))
2964 #endif /* USE_THREADS */
2965 else if (repl->op_type == OP_CONST)
2969 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2970 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2972 if (curop->op_type == OP_THREADSV) {
2974 if (strchr("&`'123456789+", curop->op_private))
2978 if (curop->op_type == OP_GV) {
2979 GV *gv = cGVOPx_gv(curop);
2981 if (strchr("&`'123456789+", *GvENAME(gv)))
2984 #endif /* USE_THREADS */
2985 else if (curop->op_type == OP_RV2CV)
2987 else if (curop->op_type == OP_RV2SV ||
2988 curop->op_type == OP_RV2AV ||
2989 curop->op_type == OP_RV2HV ||
2990 curop->op_type == OP_RV2GV) {
2991 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2994 else if (curop->op_type == OP_PADSV ||
2995 curop->op_type == OP_PADAV ||
2996 curop->op_type == OP_PADHV ||
2997 curop->op_type == OP_PADANY) {
3000 else if (curop->op_type == OP_PUSHRE)
3001 ; /* Okay here, dangerous in newASSIGNOP */
3010 && (!pm->op_pmregexp
3011 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
3012 pm->op_pmflags |= PMf_CONST; /* const for long enough */
3013 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
3014 prepend_elem(o->op_type, scalar(repl), o);
3017 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
3018 pm->op_pmflags |= PMf_MAYBE_CONST;
3019 pm->op_pmpermflags |= PMf_MAYBE_CONST;
3021 NewOp(1101, rcop, 1, LOGOP);
3022 rcop->op_type = OP_SUBSTCONT;
3023 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3024 rcop->op_first = scalar(repl);
3025 rcop->op_flags |= OPf_KIDS;
3026 rcop->op_private = 1;
3029 /* establish postfix order */
3030 rcop->op_next = LINKLIST(repl);
3031 repl->op_next = (OP*)rcop;
3033 pm->op_pmreplroot = scalar((OP*)rcop);
3034 pm->op_pmreplstart = LINKLIST(rcop);
3043 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3046 NewOp(1101, svop, 1, SVOP);
3047 svop->op_type = type;
3048 svop->op_ppaddr = PL_ppaddr[type];
3050 svop->op_next = (OP*)svop;
3051 svop->op_flags = flags;
3052 if (PL_opargs[type] & OA_RETSCALAR)
3054 if (PL_opargs[type] & OA_TARGET)
3055 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3056 return CHECKOP(type, svop);
3060 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3063 NewOp(1101, padop, 1, PADOP);
3064 padop->op_type = type;
3065 padop->op_ppaddr = PL_ppaddr[type];
3066 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3067 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3068 PL_curpad[padop->op_padix] = sv;
3070 padop->op_next = (OP*)padop;
3071 padop->op_flags = flags;
3072 if (PL_opargs[type] & OA_RETSCALAR)
3074 if (PL_opargs[type] & OA_TARGET)
3075 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3076 return CHECKOP(type, padop);
3080 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3085 return newPADOP(type, flags, SvREFCNT_inc(gv));
3087 return newSVOP(type, flags, SvREFCNT_inc(gv));
3092 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3095 NewOp(1101, pvop, 1, PVOP);
3096 pvop->op_type = type;
3097 pvop->op_ppaddr = PL_ppaddr[type];
3099 pvop->op_next = (OP*)pvop;
3100 pvop->op_flags = flags;
3101 if (PL_opargs[type] & OA_RETSCALAR)
3103 if (PL_opargs[type] & OA_TARGET)
3104 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3105 return CHECKOP(type, pvop);
3109 Perl_package(pTHX_ OP *o)
3114 save_hptr(&PL_curstash);
3115 save_item(PL_curstname);
3120 name = SvPV(sv, len);
3121 PL_curstash = gv_stashpvn(name,len,TRUE);
3122 sv_setpvn(PL_curstname, name, len);
3126 sv_setpv(PL_curstname,"<none>");
3127 PL_curstash = Nullhv;
3129 PL_hints |= HINT_BLOCK_SCOPE;
3130 PL_copline = NOLINE;
3135 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3143 if (id->op_type != OP_CONST)
3144 Perl_croak(aTHX_ "Module name must be constant");
3148 if (version != Nullop) {
3149 SV *vesv = ((SVOP*)version)->op_sv;
3151 if (arg == Nullop && !SvNIOKp(vesv)) {
3158 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3159 Perl_croak(aTHX_ "Version number must be constant number");
3161 /* Make copy of id so we don't free it twice */
3162 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3164 /* Fake up a method call to VERSION */
3165 meth = newSVpvn("VERSION",7);
3166 sv_upgrade(meth, SVt_PVIV);
3167 (void)SvIOK_on(meth);
3168 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3169 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3170 append_elem(OP_LIST,
3171 prepend_elem(OP_LIST, pack, list(version)),
3172 newSVOP(OP_METHOD_NAMED, 0, meth)));
3176 /* Fake up an import/unimport */
3177 if (arg && arg->op_type == OP_STUB)
3178 imop = arg; /* no import on explicit () */
3179 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3180 imop = Nullop; /* use 5.0; */
3185 /* Make copy of id so we don't free it twice */
3186 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3188 /* Fake up a method call to import/unimport */
3189 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);;
3190 sv_upgrade(meth, SVt_PVIV);
3191 (void)SvIOK_on(meth);
3192 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3193 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3194 append_elem(OP_LIST,
3195 prepend_elem(OP_LIST, pack, list(arg)),
3196 newSVOP(OP_METHOD_NAMED, 0, meth)));
3199 /* Fake up a require, handle override, if any */
3200 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3201 if (!(gv && GvIMPORTED_CV(gv)))
3202 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3204 if (gv && GvIMPORTED_CV(gv)) {
3205 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3206 append_elem(OP_LIST, id,
3207 scalar(newUNOP(OP_RV2CV, 0,
3212 rqop = newUNOP(OP_REQUIRE, 0, id);
3215 /* Fake up the BEGIN {}, which does its thing immediately. */
3217 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3220 append_elem(OP_LINESEQ,
3221 append_elem(OP_LINESEQ,
3222 newSTATEOP(0, Nullch, rqop),
3223 newSTATEOP(0, Nullch, veop)),
3224 newSTATEOP(0, Nullch, imop) ));
3226 PL_hints |= HINT_BLOCK_SCOPE;
3227 PL_copline = NOLINE;
3232 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3235 va_start(args, ver);
3236 vload_module(flags, name, ver, &args);
3240 #ifdef PERL_IMPLICIT_CONTEXT
3242 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3246 va_start(args, ver);
3247 vload_module(flags, name, ver, &args);
3253 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3255 OP *modname, *veop, *imop;
3257 modname = newSVOP(OP_CONST, 0, name);
3258 modname->op_private |= OPpCONST_BARE;
3260 veop = newSVOP(OP_CONST, 0, ver);
3264 if (flags & PERL_LOADMOD_NOIMPORT) {
3265 imop = sawparens(newNULLLIST());
3267 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3268 imop = va_arg(*args, OP*);
3273 sv = va_arg(*args, SV*);
3275 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3276 sv = va_arg(*args, SV*);
3280 line_t ocopline = PL_copline;
3281 int oexpect = PL_expect;
3283 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3284 veop, modname, imop);
3285 PL_expect = oexpect;
3286 PL_copline = ocopline;
3291 Perl_dofile(pTHX_ OP *term)
3296 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3297 if (!(gv && GvIMPORTED_CV(gv)))
3298 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3300 if (gv && GvIMPORTED_CV(gv)) {
3301 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3302 append_elem(OP_LIST, term,
3303 scalar(newUNOP(OP_RV2CV, 0,
3308 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3314 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3316 return newBINOP(OP_LSLICE, flags,
3317 list(force_list(subscript)),
3318 list(force_list(listval)) );
3322 S_list_assignment(pTHX_ register OP *o)
3327 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3328 o = cUNOPo->op_first;
3330 if (o->op_type == OP_COND_EXPR) {
3331 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3332 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3337 yyerror("Assignment to both a list and a scalar");
3341 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3342 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3343 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3346 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3349 if (o->op_type == OP_RV2SV)
3356 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3361 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3362 return newLOGOP(optype, 0,
3363 mod(scalar(left), optype),
3364 newUNOP(OP_SASSIGN, 0, scalar(right)));
3367 return newBINOP(optype, OPf_STACKED,
3368 mod(scalar(left), optype), scalar(right));
3372 if (list_assignment(left)) {
3377 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3378 left = mod(left, OP_AASSIGN);
3386 curop = list(force_list(left));
3387 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3388 o->op_private = 0 | (flags >> 8);
3389 for (curop = ((LISTOP*)curop)->op_first;
3390 curop; curop = curop->op_sibling)
3392 if (curop->op_type == OP_RV2HV &&
3393 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3394 o->op_private |= OPpASSIGN_HASH;
3398 if (!(left->op_private & OPpLVAL_INTRO)) {
3401 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3402 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3403 if (curop->op_type == OP_GV) {
3404 GV *gv = cGVOPx_gv(curop);
3405 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3407 SvCUR(gv) = PL_generation;
3409 else if (curop->op_type == OP_PADSV ||
3410 curop->op_type == OP_PADAV ||
3411 curop->op_type == OP_PADHV ||
3412 curop->op_type == OP_PADANY) {
3413 SV **svp = AvARRAY(PL_comppad_name);
3414 SV *sv = svp[curop->op_targ];
3415 if (SvCUR(sv) == PL_generation)
3417 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3419 else if (curop->op_type == OP_RV2CV)
3421 else if (curop->op_type == OP_RV2SV ||
3422 curop->op_type == OP_RV2AV ||
3423 curop->op_type == OP_RV2HV ||
3424 curop->op_type == OP_RV2GV) {
3425 if (lastop->op_type != OP_GV) /* funny deref? */
3428 else if (curop->op_type == OP_PUSHRE) {
3429 if (((PMOP*)curop)->op_pmreplroot) {
3431 GV *gv = (GV*)PL_curpad[(PADOFFSET)((PMOP*)curop)->op_pmreplroot];
3433 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3435 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3437 SvCUR(gv) = PL_generation;
3446 o->op_private |= OPpASSIGN_COMMON;
3448 if (right && right->op_type == OP_SPLIT) {
3450 if ((tmpop = ((LISTOP*)right)->op_first) &&
3451 tmpop->op_type == OP_PUSHRE)
3453 PMOP *pm = (PMOP*)tmpop;
3454 if (left->op_type == OP_RV2AV &&
3455 !(left->op_private & OPpLVAL_INTRO) &&
3456 !(o->op_private & OPpASSIGN_COMMON) )
3458 tmpop = ((UNOP*)left)->op_first;
3459 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3461 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3462 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3464 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3465 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3467 pm->op_pmflags |= PMf_ONCE;
3468 tmpop = cUNOPo->op_first; /* to list (nulled) */
3469 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3470 tmpop->op_sibling = Nullop; /* don't free split */
3471 right->op_next = tmpop->op_next; /* fix starting loc */
3472 op_free(o); /* blow off assign */
3473 right->op_flags &= ~OPf_WANT;
3474 /* "I don't know and I don't care." */
3479 if (PL_modcount < 10000 &&
3480 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3482 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3484 sv_setiv(sv, PL_modcount+1);
3492 right = newOP(OP_UNDEF, 0);
3493 if (right->op_type == OP_READLINE) {
3494 right->op_flags |= OPf_STACKED;
3495 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3498 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3499 o = newBINOP(OP_SASSIGN, flags,
3500 scalar(right), mod(scalar(left), OP_SASSIGN) );
3512 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3515 U32 seq = intro_my();
3518 NewOp(1101, cop, 1, COP);
3519 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3520 cop->op_type = OP_DBSTATE;
3521 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3524 cop->op_type = OP_NEXTSTATE;
3525 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3527 cop->op_flags = flags;
3528 cop->op_private = (PL_hints & HINT_BYTE);
3530 cop->op_private |= NATIVE_HINTS;
3532 PL_compiling.op_private = cop->op_private;
3533 cop->op_next = (OP*)cop;
3536 cop->cop_label = label;
3537 PL_hints |= HINT_BLOCK_SCOPE;
3540 cop->cop_arybase = PL_curcop->cop_arybase;
3541 if (specialWARN(PL_curcop->cop_warnings))
3542 cop->cop_warnings = PL_curcop->cop_warnings ;
3544 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3545 if (specialCopIO(PL_curcop->cop_io))
3546 cop->cop_io = PL_curcop->cop_io;
3548 cop->cop_io = newSVsv(PL_curcop->cop_io) ;
3551 if (PL_copline == NOLINE)
3552 CopLINE_set(cop, CopLINE(PL_curcop));
3554 CopLINE_set(cop, PL_copline);
3555 PL_copline = NOLINE;
3558 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
3560 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
3562 CopSTASH_set(cop, PL_curstash);
3564 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3565 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3566 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3567 (void)SvIOK_on(*svp);
3568 SvIVX(*svp) = PTR2IV(cop);
3572 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3575 /* "Introduce" my variables to visible status. */
3583 if (! PL_min_intro_pending)
3584 return PL_cop_seqmax;
3586 svp = AvARRAY(PL_comppad_name);
3587 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3588 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3589 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3590 SvNVX(sv) = (NV)PL_cop_seqmax;
3593 PL_min_intro_pending = 0;
3594 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3595 return PL_cop_seqmax++;
3599 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3601 return new_logop(type, flags, &first, &other);
3605 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3610 OP *first = *firstp;
3611 OP *other = *otherp;
3613 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3614 return newBINOP(type, flags, scalar(first), scalar(other));
3616 scalarboolean(first);
3617 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3618 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3619 if (type == OP_AND || type == OP_OR) {
3625 first = *firstp = cUNOPo->op_first;
3627 first->op_next = o->op_next;
3628 cUNOPo->op_first = Nullop;
3632 if (first->op_type == OP_CONST) {
3633 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3634 Perl_warner(aTHX_ WARN_BAREWORD, "Bareword found in conditional");
3635 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3646 else if (first->op_type == OP_WANTARRAY) {
3652 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3653 OP *k1 = ((UNOP*)first)->op_first;
3654 OP *k2 = k1->op_sibling;
3656 switch (first->op_type)
3659 if (k2 && k2->op_type == OP_READLINE
3660 && (k2->op_flags & OPf_STACKED)
3661 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3663 warnop = k2->op_type;
3668 if (k1->op_type == OP_READDIR
3669 || k1->op_type == OP_GLOB
3670 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3671 || k1->op_type == OP_EACH)
3673 warnop = ((k1->op_type == OP_NULL)
3674 ? k1->op_targ : k1->op_type);
3679 line_t oldline = CopLINE(PL_curcop);
3680 CopLINE_set(PL_curcop, PL_copline);
3681 Perl_warner(aTHX_ WARN_MISC,
3682 "Value of %s%s can be \"0\"; test with defined()",
3684 ((warnop == OP_READLINE || warnop == OP_GLOB)
3685 ? " construct" : "() operator"));
3686 CopLINE_set(PL_curcop, oldline);
3693 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3694 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3696 NewOp(1101, logop, 1, LOGOP);
3698 logop->op_type = type;
3699 logop->op_ppaddr = PL_ppaddr[type];
3700 logop->op_first = first;
3701 logop->op_flags = flags | OPf_KIDS;
3702 logop->op_other = LINKLIST(other);
3703 logop->op_private = 1 | (flags >> 8);
3705 /* establish postfix order */
3706 logop->op_next = LINKLIST(first);
3707 first->op_next = (OP*)logop;
3708 first->op_sibling = other;
3710 o = newUNOP(OP_NULL, 0, (OP*)logop);
3717 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3725 return newLOGOP(OP_AND, 0, first, trueop);
3727 return newLOGOP(OP_OR, 0, first, falseop);
3729 scalarboolean(first);
3730 if (first->op_type == OP_CONST) {
3731 if (SvTRUE(((SVOP*)first)->op_sv)) {
3742 else if (first->op_type == OP_WANTARRAY) {
3746 NewOp(1101, logop, 1, LOGOP);
3747 logop->op_type = OP_COND_EXPR;
3748 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3749 logop->op_first = first;
3750 logop->op_flags = flags | OPf_KIDS;
3751 logop->op_private = 1 | (flags >> 8);
3752 logop->op_other = LINKLIST(trueop);
3753 logop->op_next = LINKLIST(falseop);
3756 /* establish postfix order */
3757 start = LINKLIST(first);
3758 first->op_next = (OP*)logop;
3760 first->op_sibling = trueop;
3761 trueop->op_sibling = falseop;
3762 o = newUNOP(OP_NULL, 0, (OP*)logop);
3764 trueop->op_next = falseop->op_next = o;
3771 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3780 NewOp(1101, range, 1, LOGOP);
3782 range->op_type = OP_RANGE;
3783 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3784 range->op_first = left;
3785 range->op_flags = OPf_KIDS;
3786 leftstart = LINKLIST(left);
3787 range->op_other = LINKLIST(right);
3788 range->op_private = 1 | (flags >> 8);
3790 left->op_sibling = right;
3792 range->op_next = (OP*)range;
3793 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3794 flop = newUNOP(OP_FLOP, 0, flip);
3795 o = newUNOP(OP_NULL, 0, flop);
3797 range->op_next = leftstart;
3799 left->op_next = flip;
3800 right->op_next = flop;
3802 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3803 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3804 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3805 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3807 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3808 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3811 if (!flip->op_private || !flop->op_private)
3812 linklist(o); /* blow off optimizer unless constant */
3818 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3823 int once = block && block->op_flags & OPf_SPECIAL &&
3824 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3827 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3828 return block; /* do {} while 0 does once */
3829 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3830 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3831 expr = newUNOP(OP_DEFINED, 0,
3832 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3833 } else if (expr->op_flags & OPf_KIDS) {
3834 OP *k1 = ((UNOP*)expr)->op_first;
3835 OP *k2 = (k1) ? k1->op_sibling : NULL;
3836 switch (expr->op_type) {
3838 if (k2 && k2->op_type == OP_READLINE
3839 && (k2->op_flags & OPf_STACKED)
3840 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3841 expr = newUNOP(OP_DEFINED, 0, expr);
3845 if (k1->op_type == OP_READDIR
3846 || k1->op_type == OP_GLOB
3847 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3848 || k1->op_type == OP_EACH)
3849 expr = newUNOP(OP_DEFINED, 0, expr);
3855 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3856 o = new_logop(OP_AND, 0, &expr, &listop);
3859 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3861 if (once && o != listop)
3862 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3865 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3867 o->op_flags |= flags;
3869 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3874 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3884 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3885 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3886 expr = newUNOP(OP_DEFINED, 0,
3887 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3888 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3889 OP *k1 = ((UNOP*)expr)->op_first;
3890 OP *k2 = (k1) ? k1->op_sibling : NULL;
3891 switch (expr->op_type) {
3893 if (k2 && k2->op_type == OP_READLINE
3894 && (k2->op_flags & OPf_STACKED)
3895 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3896 expr = newUNOP(OP_DEFINED, 0, expr);
3900 if (k1->op_type == OP_READDIR
3901 || k1->op_type == OP_GLOB
3902 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3903 || k1->op_type == OP_EACH)
3904 expr = newUNOP(OP_DEFINED, 0, expr);
3910 block = newOP(OP_NULL, 0);
3912 block = scope(block);
3916 next = LINKLIST(cont);
3917 loopflags |= OPpLOOP_CONTINUE;
3920 OP *unstack = newOP(OP_UNSTACK, 0);
3923 cont = append_elem(OP_LINESEQ, cont, unstack);
3924 if ((line_t)whileline != NOLINE) {
3925 PL_copline = whileline;
3926 cont = append_elem(OP_LINESEQ, cont,
3927 newSTATEOP(0, Nullch, Nullop));
3931 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3932 redo = LINKLIST(listop);
3935 PL_copline = whileline;
3937 o = new_logop(OP_AND, 0, &expr, &listop);
3938 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3939 op_free(expr); /* oops, it's a while (0) */
3941 return Nullop; /* listop already freed by new_logop */
3944 ((LISTOP*)listop)->op_last->op_next = condop =
3945 (o == listop ? redo : LINKLIST(o));
3951 NewOp(1101,loop,1,LOOP);
3952 loop->op_type = OP_ENTERLOOP;
3953 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3954 loop->op_private = 0;
3955 loop->op_next = (OP*)loop;
3958 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3960 loop->op_redoop = redo;
3961 loop->op_lastop = o;
3962 o->op_private |= loopflags;
3965 loop->op_nextop = next;
3967 loop->op_nextop = o;
3969 o->op_flags |= flags;
3970 o->op_private |= (flags >> 8);
3975 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3983 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3984 sv->op_type = OP_RV2GV;
3985 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3987 else if (sv->op_type == OP_PADSV) { /* private variable */
3988 padoff = sv->op_targ;
3993 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3994 padoff = sv->op_targ;
3996 iterflags |= OPf_SPECIAL;
4001 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
4005 padoff = find_threadsv("_");
4006 iterflags |= OPf_SPECIAL;
4008 sv = newGVOP(OP_GV, 0, PL_defgv);
4011 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
4012 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
4013 iterflags |= OPf_STACKED;
4015 else if (expr->op_type == OP_NULL &&
4016 (expr->op_flags & OPf_KIDS) &&
4017 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
4019 /* Basically turn for($x..$y) into the same as for($x,$y), but we
4020 * set the STACKED flag to indicate that these values are to be
4021 * treated as min/max values by 'pp_iterinit'.
4023 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
4024 LOGOP* range = (LOGOP*) flip->op_first;
4025 OP* left = range->op_first;
4026 OP* right = left->op_sibling;
4029 range->op_flags &= ~OPf_KIDS;
4030 range->op_first = Nullop;
4032 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
4033 listop->op_first->op_next = range->op_next;
4034 left->op_next = range->op_other;
4035 right->op_next = (OP*)listop;
4036 listop->op_next = listop->op_first;
4039 expr = (OP*)(listop);
4041 iterflags |= OPf_STACKED;
4044 expr = mod(force_list(expr), OP_GREPSTART);
4048 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
4049 append_elem(OP_LIST, expr, scalar(sv))));
4050 assert(!loop->op_next);
4051 #ifdef PL_OP_SLAB_ALLOC
4054 NewOp(1234,tmp,1,LOOP);
4055 Copy(loop,tmp,1,LOOP);
4059 Renew(loop, 1, LOOP);
4061 loop->op_targ = padoff;
4062 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
4063 PL_copline = forline;
4064 return newSTATEOP(0, label, wop);
4068 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4074 if (type != OP_GOTO || label->op_type == OP_CONST) {
4075 /* "last()" means "last" */
4076 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4077 o = newOP(type, OPf_SPECIAL);
4079 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
4080 ? SvPVx(((SVOP*)label)->op_sv, n_a)
4086 if (label->op_type == OP_ENTERSUB)
4087 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4088 o = newUNOP(type, OPf_STACKED, label);
4090 PL_hints |= HINT_BLOCK_SCOPE;
4095 Perl_cv_undef(pTHX_ CV *cv)
4100 MUTEX_DESTROY(CvMUTEXP(cv));
4101 Safefree(CvMUTEXP(cv));
4104 #endif /* USE_THREADS */
4106 if (!CvXSUB(cv) && CvROOT(cv)) {
4108 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4109 Perl_croak(aTHX_ "Can't undef active subroutine");
4112 Perl_croak(aTHX_ "Can't undef active subroutine");
4113 #endif /* USE_THREADS */
4116 SAVEVPTR(PL_curpad);
4120 op_free(CvROOT(cv));
4121 CvROOT(cv) = Nullop;
4124 SvPOK_off((SV*)cv); /* forget prototype */
4126 SvREFCNT_dec(CvGV(cv));
4128 SvREFCNT_dec(CvOUTSIDE(cv));
4129 CvOUTSIDE(cv) = Nullcv;
4131 SvREFCNT_dec((SV*)CvXSUBANY(cv).any_ptr);
4134 if (CvPADLIST(cv)) {
4135 /* may be during global destruction */
4136 if (SvREFCNT(CvPADLIST(cv))) {
4137 I32 i = AvFILLp(CvPADLIST(cv));
4139 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4140 SV* sv = svp ? *svp : Nullsv;
4143 if (sv == (SV*)PL_comppad_name)
4144 PL_comppad_name = Nullav;
4145 else if (sv == (SV*)PL_comppad) {
4146 PL_comppad = Nullav;
4147 PL_curpad = Null(SV**);
4151 SvREFCNT_dec((SV*)CvPADLIST(cv));
4153 CvPADLIST(cv) = Nullav;
4158 S_cv_dump(pTHX_ CV *cv)
4161 CV *outside = CvOUTSIDE(cv);
4162 AV* padlist = CvPADLIST(cv);
4169 PerlIO_printf(Perl_debug_log,
4170 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4172 (CvANON(cv) ? "ANON"
4173 : (cv == PL_main_cv) ? "MAIN"
4174 : CvUNIQUE(cv) ? "UNIQUE"
4175 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4178 : CvANON(outside) ? "ANON"
4179 : (outside == PL_main_cv) ? "MAIN"
4180 : CvUNIQUE(outside) ? "UNIQUE"
4181 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4186 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4187 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4188 pname = AvARRAY(pad_name);
4189 ppad = AvARRAY(pad);
4191 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4192 if (SvPOK(pname[ix]))
4193 PerlIO_printf(Perl_debug_log,
4194 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4195 (int)ix, PTR2UV(ppad[ix]),
4196 SvFAKE(pname[ix]) ? "FAKE " : "",
4198 (IV)I_32(SvNVX(pname[ix])),
4201 #endif /* DEBUGGING */
4205 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4210 AV* protopadlist = CvPADLIST(proto);
4211 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4212 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4213 SV** pname = AvARRAY(protopad_name);
4214 SV** ppad = AvARRAY(protopad);
4215 I32 fname = AvFILLp(protopad_name);
4216 I32 fpad = AvFILLp(protopad);
4220 assert(!CvUNIQUE(proto));
4224 SAVESPTR(PL_comppad_name);
4225 SAVESPTR(PL_compcv);
4227 cv = PL_compcv = (CV*)NEWSV(1104,0);
4228 sv_upgrade((SV *)cv, SvTYPE(proto));
4229 CvFLAGS(cv) = CvFLAGS(proto) & ~CVf_CLONE;
4233 New(666, CvMUTEXP(cv), 1, perl_mutex);
4234 MUTEX_INIT(CvMUTEXP(cv));
4236 #endif /* USE_THREADS */
4237 CvFILE(cv) = CvFILE(proto);
4238 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4239 CvSTASH(cv) = CvSTASH(proto);
4240 CvROOT(cv) = CvROOT(proto);
4241 CvSTART(cv) = CvSTART(proto);
4243 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4246 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4248 PL_comppad_name = newAV();
4249 for (ix = fname; ix >= 0; ix--)
4250 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4252 PL_comppad = newAV();
4254 comppadlist = newAV();
4255 AvREAL_off(comppadlist);
4256 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4257 av_store(comppadlist, 1, (SV*)PL_comppad);
4258 CvPADLIST(cv) = comppadlist;
4259 av_fill(PL_comppad, AvFILLp(protopad));
4260 PL_curpad = AvARRAY(PL_comppad);
4262 av = newAV(); /* will be @_ */
4264 av_store(PL_comppad, 0, (SV*)av);
4265 AvFLAGS(av) = AVf_REIFY;
4267 for (ix = fpad; ix > 0; ix--) {
4268 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4269 if (namesv && namesv != &PL_sv_undef) {
4270 char *name = SvPVX(namesv); /* XXX */
4271 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4272 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4273 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4275 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4277 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4279 else { /* our own lexical */
4282 /* anon code -- we'll come back for it */
4283 sv = SvREFCNT_inc(ppad[ix]);
4285 else if (*name == '@')
4287 else if (*name == '%')
4296 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4297 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4300 SV* sv = NEWSV(0,0);
4306 /* Now that vars are all in place, clone nested closures. */
4308 for (ix = fpad; ix > 0; ix--) {
4309 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4311 && namesv != &PL_sv_undef
4312 && !(SvFLAGS(namesv) & SVf_FAKE)
4313 && *SvPVX(namesv) == '&'
4314 && CvCLONE(ppad[ix]))
4316 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4317 SvREFCNT_dec(ppad[ix]);
4320 PL_curpad[ix] = (SV*)kid;
4324 #ifdef DEBUG_CLOSURES
4325 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4327 PerlIO_printf(Perl_debug_log, " from:\n");
4329 PerlIO_printf(Perl_debug_log, " to:\n");
4336 SV* const_sv = op_const_sv(CvSTART(cv), cv);
4338 /* constant sub () { $x } closing over $x - see lib/constant.pm */
4340 cv = newCONSTSUB(CvSTASH(proto), 0, const_sv);
4347 Perl_cv_clone(pTHX_ CV *proto)
4350 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4351 cv = cv_clone2(proto, CvOUTSIDE(proto));
4352 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4357 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4361 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4362 SV* msg = sv_newmortal();
4366 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4367 sv_setpv(msg, "Prototype mismatch:");
4369 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4371 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4372 sv_catpv(msg, " vs ");
4374 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4376 sv_catpv(msg, "none");
4377 Perl_warner(aTHX_ WARN_PROTOTYPE, "%"SVf, msg);
4381 static void const_sv_xsub(pTHXo_ CV* cv);
4384 =for apidoc cv_const_sv
4386 If C<cv> is a constant sub eligible for inlining. returns the constant
4387 value returned by the sub. Otherwise, returns NULL.
4389 Constant subs can be created with C<newCONSTSUB> or as described in
4390 L<perlsub/"Constant Functions">.
4395 Perl_cv_const_sv(pTHX_ CV *cv)
4397 if (!cv || !CvCONST(cv))
4399 return (SV*)CvXSUBANY(cv).any_ptr;
4403 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4410 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4411 o = cLISTOPo->op_first->op_sibling;
4413 for (; o; o = o->op_next) {
4414 OPCODE type = o->op_type;
4416 if (sv && o->op_next == o)
4418 if (o->op_next != o) {
4419 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4421 if (type == OP_DBSTATE)
4424 if (type == OP_LEAVESUB || type == OP_RETURN)
4428 if (type == OP_CONST && cSVOPo->op_sv)
4430 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4431 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4432 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4436 /* We get here only from cv_clone2() while creating a closure.
4437 Copy the const value here instead of in cv_clone2 so that
4438 SvREADONLY_on doesn't lead to problems when leaving
4443 if (!SvREADONLY(sv) && SvREFCNT(sv) > 1)
4455 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4465 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4469 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4471 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4475 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4482 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4487 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4488 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4489 SV *sv = sv_newmortal();
4490 Perl_sv_setpvf(aTHX_ sv, "__ANON__[%s:%"IVdf"]",
4491 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4496 gv = gv_fetchpv(name ? name : (aname ? aname : "__ANON__"),
4497 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4507 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4508 maximum a prototype before. */
4509 if (SvTYPE(gv) > SVt_NULL) {
4510 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4511 && ckWARN_d(WARN_PROTOTYPE))
4513 Perl_warner(aTHX_ WARN_PROTOTYPE, "Runaway prototype");
4515 cv_ckproto((CV*)gv, NULL, ps);
4518 sv_setpv((SV*)gv, ps);
4520 sv_setiv((SV*)gv, -1);
4521 SvREFCNT_dec(PL_compcv);
4522 cv = PL_compcv = NULL;
4523 PL_sub_generation++;
4527 cv = (!name || GvCVGEN(gv)) ? Nullcv : GvCV(gv);
4529 if (!block || !ps || *ps || attrs)
4532 const_sv = op_const_sv(block, Nullcv);
4535 bool exists = CvROOT(cv) || CvXSUB(cv);
4536 /* if the subroutine doesn't exist and wasn't pre-declared
4537 * with a prototype, assume it will be AUTOLOADed,
4538 * skipping the prototype check
4540 if (exists || SvPOK(cv))
4541 cv_ckproto(cv, gv, ps);
4542 /* already defined (or promised)? */
4543 if (exists || GvASSUMECV(gv)) {
4544 if (!block && !attrs) {
4545 /* just a "sub foo;" when &foo is already defined */
4546 SAVEFREESV(PL_compcv);
4549 /* ahem, death to those who redefine active sort subs */
4550 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4551 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4553 if (ckWARN(WARN_REDEFINE)
4555 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
4557 line_t oldline = CopLINE(PL_curcop);
4558 CopLINE_set(PL_curcop, PL_copline);
4559 Perl_warner(aTHX_ WARN_REDEFINE,
4560 CvCONST(cv) ? "Constant subroutine %s redefined"
4561 : "Subroutine %s redefined", name);
4562 CopLINE_set(PL_curcop, oldline);
4570 SvREFCNT_inc(const_sv);
4574 New(666, CvMUTEXP(cv), 1, perl_mutex);
4575 MUTEX_INIT(CvMUTEXP(cv));
4577 #endif /* USE_THREADS */
4578 sv_setpv((SV*)cv, ""); /* prototype is "" */
4579 CvXSUBANY(cv).any_ptr = const_sv;
4580 CvXSUB(cv) = const_sv_xsub;
4582 /* XXX Does anybody care that CvFILE(cv) is blank? */
4586 cv = newCONSTSUB(NULL, name, const_sv);
4589 SvREFCNT_dec(PL_compcv);
4591 PL_sub_generation++;
4598 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4599 * before we clobber PL_compcv.
4603 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4604 stash = GvSTASH(CvGV(cv));
4605 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4606 stash = CvSTASH(cv);
4608 stash = PL_curstash;
4611 /* possibly about to re-define existing subr -- ignore old cv */
4612 rcv = (SV*)PL_compcv;
4613 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4614 stash = GvSTASH(gv);
4616 stash = PL_curstash;
4618 apply_attrs(stash, rcv, attrs);
4620 if (cv) { /* must reuse cv if autoloaded */
4622 /* got here with just attrs -- work done, so bug out */
4623 SAVEFREESV(PL_compcv);
4627 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4628 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4629 CvOUTSIDE(PL_compcv) = 0;
4630 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4631 CvPADLIST(PL_compcv) = 0;
4632 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4633 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4634 SvREFCNT_dec(PL_compcv);
4641 PL_sub_generation++;
4644 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4645 CvFILE(cv) = CopFILE(PL_curcop);
4646 CvSTASH(cv) = PL_curstash;
4649 if (!CvMUTEXP(cv)) {
4650 New(666, CvMUTEXP(cv), 1, perl_mutex);
4651 MUTEX_INIT(CvMUTEXP(cv));
4653 #endif /* USE_THREADS */
4656 sv_setpv((SV*)cv, ps);
4658 if (PL_error_count) {
4662 char *s = strrchr(name, ':');
4664 if (strEQ(s, "BEGIN")) {
4666 "BEGIN not safe after errors--compilation aborted";
4667 if (PL_in_eval & EVAL_KEEPERR)
4668 Perl_croak(aTHX_ not_safe);
4670 /* force display of errors found but not reported */
4671 sv_catpv(ERRSV, not_safe);
4672 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4680 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4681 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4684 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4687 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4689 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4690 OpREFCNT_set(CvROOT(cv), 1);
4691 CvSTART(cv) = LINKLIST(CvROOT(cv));
4692 CvROOT(cv)->op_next = 0;
4695 /* now that optimizer has done its work, adjust pad values */
4697 SV **namep = AvARRAY(PL_comppad_name);
4698 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4701 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4704 * The only things that a clonable function needs in its
4705 * pad are references to outer lexicals and anonymous subs.
4706 * The rest are created anew during cloning.
4708 if (!((namesv = namep[ix]) != Nullsv &&
4709 namesv != &PL_sv_undef &&
4711 *SvPVX(namesv) == '&')))
4713 SvREFCNT_dec(PL_curpad[ix]);
4714 PL_curpad[ix] = Nullsv;
4717 assert(!CvCONST(cv));
4718 if (ps && !*ps && op_const_sv(block, cv))
4722 AV *av = newAV(); /* Will be @_ */
4724 av_store(PL_comppad, 0, (SV*)av);
4725 AvFLAGS(av) = AVf_REIFY;
4727 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4728 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4730 if (!SvPADMY(PL_curpad[ix]))
4731 SvPADTMP_on(PL_curpad[ix]);
4735 if (name || aname) {
4737 char *tname = (name ? name : aname);
4739 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4740 SV *sv = NEWSV(0,0);
4741 SV *tmpstr = sv_newmortal();
4742 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4746 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4748 (long)PL_subline, (long)CopLINE(PL_curcop));
4749 gv_efullname3(tmpstr, gv, Nullch);
4750 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4751 hv = GvHVn(db_postponed);
4752 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4753 && (pcv = GvCV(db_postponed)))
4759 call_sv((SV*)pcv, G_DISCARD);
4763 if ((s = strrchr(tname,':')))
4768 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4771 if (strEQ(s, "BEGIN")) {
4772 I32 oldscope = PL_scopestack_ix;
4774 SAVECOPFILE(&PL_compiling);
4775 SAVECOPLINE(&PL_compiling);
4777 sv_setsv(PL_rs, PL_nrs);
4780 PL_beginav = newAV();
4781 DEBUG_x( dump_sub(gv) );
4782 av_push(PL_beginav, (SV*)cv);
4783 GvCV(gv) = 0; /* cv has been hijacked */
4784 call_list(oldscope, PL_beginav);
4786 PL_curcop = &PL_compiling;
4787 PL_compiling.op_private = PL_hints;
4790 else if (strEQ(s, "END") && !PL_error_count) {
4793 DEBUG_x( dump_sub(gv) );
4794 av_unshift(PL_endav, 1);
4795 av_store(PL_endav, 0, (SV*)cv);
4796 GvCV(gv) = 0; /* cv has been hijacked */
4798 else if (strEQ(s, "CHECK") && !PL_error_count) {
4800 PL_checkav = newAV();
4801 DEBUG_x( dump_sub(gv) );
4802 if (PL_main_start && ckWARN(WARN_VOID))
4803 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4804 av_unshift(PL_checkav, 1);
4805 av_store(PL_checkav, 0, (SV*)cv);
4806 GvCV(gv) = 0; /* cv has been hijacked */
4808 else if (strEQ(s, "INIT") && !PL_error_count) {
4810 PL_initav = newAV();
4811 DEBUG_x( dump_sub(gv) );
4812 if (PL_main_start && ckWARN(WARN_VOID))
4813 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4814 av_push(PL_initav, (SV*)cv);
4815 GvCV(gv) = 0; /* cv has been hijacked */
4820 PL_copline = NOLINE;
4825 /* XXX unsafe for threads if eval_owner isn't held */
4827 =for apidoc newCONSTSUB
4829 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4830 eligible for inlining at compile-time.
4836 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4843 SAVECOPLINE(PL_curcop);
4844 CopLINE_set(PL_curcop, PL_copline);
4847 PL_hints &= ~HINT_BLOCK_SCOPE;
4850 SAVESPTR(PL_curstash);
4851 SAVECOPSTASH(PL_curcop);
4852 PL_curstash = stash;
4854 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4856 CopSTASH(PL_curcop) = stash;
4860 cv = newXS(name, const_sv_xsub, __FILE__);
4861 CvXSUBANY(cv).any_ptr = sv;
4863 sv_setpv((SV*)cv, ""); /* prototype is "" */
4871 =for apidoc U||newXS
4873 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4879 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4882 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4885 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4887 /* just a cached method */
4891 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4892 /* already defined (or promised) */
4893 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4894 && HvNAME(GvSTASH(CvGV(cv)))
4895 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4896 line_t oldline = CopLINE(PL_curcop);
4897 if (PL_copline != NOLINE)
4898 CopLINE_set(PL_curcop, PL_copline);
4899 Perl_warner(aTHX_ WARN_REDEFINE,
4900 CvCONST(cv) ? "Constant subroutine %s redefined"
4901 : "Subroutine %s redefined"
4903 CopLINE_set(PL_curcop, oldline);
4910 if (cv) /* must reuse cv if autoloaded */
4913 cv = (CV*)NEWSV(1105,0);
4914 sv_upgrade((SV *)cv, SVt_PVCV);
4918 PL_sub_generation++;
4921 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4923 New(666, CvMUTEXP(cv), 1, perl_mutex);
4924 MUTEX_INIT(CvMUTEXP(cv));
4926 #endif /* USE_THREADS */
4927 (void)gv_fetchfile(filename);
4928 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4929 an external constant string */
4930 CvXSUB(cv) = subaddr;
4933 char *s = strrchr(name,':');
4939 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4942 if (strEQ(s, "BEGIN")) {
4944 PL_beginav = newAV();
4945 av_push(PL_beginav, (SV*)cv);
4946 GvCV(gv) = 0; /* cv has been hijacked */
4948 else if (strEQ(s, "END")) {
4951 av_unshift(PL_endav, 1);
4952 av_store(PL_endav, 0, (SV*)cv);
4953 GvCV(gv) = 0; /* cv has been hijacked */
4955 else if (strEQ(s, "CHECK")) {
4957 PL_checkav = newAV();
4958 if (PL_main_start && ckWARN(WARN_VOID))
4959 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4960 av_unshift(PL_checkav, 1);
4961 av_store(PL_checkav, 0, (SV*)cv);
4962 GvCV(gv) = 0; /* cv has been hijacked */
4964 else if (strEQ(s, "INIT")) {
4966 PL_initav = newAV();
4967 if (PL_main_start && ckWARN(WARN_VOID))
4968 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4969 av_push(PL_initav, (SV*)cv);
4970 GvCV(gv) = 0; /* cv has been hijacked */
4981 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4991 name = SvPVx(cSVOPo->op_sv, n_a);
4994 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4996 if ((cv = GvFORM(gv))) {
4997 if (ckWARN(WARN_REDEFINE)) {
4998 line_t oldline = CopLINE(PL_curcop);
5000 CopLINE_set(PL_curcop, PL_copline);
5001 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
5002 CopLINE_set(PL_curcop, oldline);
5008 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
5009 CvFILE(cv) = CopFILE(PL_curcop);
5011 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
5012 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
5013 SvPADTMP_on(PL_curpad[ix]);
5016 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
5017 CvROOT(cv)->op_private |= OPpREFCOUNTED;
5018 OpREFCNT_set(CvROOT(cv), 1);
5019 CvSTART(cv) = LINKLIST(CvROOT(cv));
5020 CvROOT(cv)->op_next = 0;
5023 PL_copline = NOLINE;
5028 Perl_newANONLIST(pTHX_ OP *o)
5030 return newUNOP(OP_REFGEN, 0,
5031 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
5035 Perl_newANONHASH(pTHX_ OP *o)
5037 return newUNOP(OP_REFGEN, 0,
5038 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
5042 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
5044 return newANONATTRSUB(floor, proto, Nullop, block);
5048 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
5050 return newUNOP(OP_REFGEN, 0,
5051 newSVOP(OP_ANONCODE, 0,
5052 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
5056 Perl_oopsAV(pTHX_ OP *o)
5058 switch (o->op_type) {
5060 o->op_type = OP_PADAV;
5061 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5062 return ref(o, OP_RV2AV);
5065 o->op_type = OP_RV2AV;
5066 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
5071 if (ckWARN_d(WARN_INTERNAL))
5072 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
5079 Perl_oopsHV(pTHX_ OP *o)
5083 switch (o->op_type) {
5086 o->op_type = OP_PADHV;
5087 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5088 return ref(o, OP_RV2HV);
5092 o->op_type = OP_RV2HV;
5093 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
5098 if (ckWARN_d(WARN_INTERNAL))
5099 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
5106 Perl_newAVREF(pTHX_ OP *o)
5108 if (o->op_type == OP_PADANY) {
5109 o->op_type = OP_PADAV;
5110 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5113 return newUNOP(OP_RV2AV, 0, scalar(o));
5117 Perl_newGVREF(pTHX_ I32 type, OP *o)
5119 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
5120 return newUNOP(OP_NULL, 0, o);
5121 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
5125 Perl_newHVREF(pTHX_ OP *o)
5127 if (o->op_type == OP_PADANY) {
5128 o->op_type = OP_PADHV;
5129 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5132 return newUNOP(OP_RV2HV, 0, scalar(o));
5136 Perl_oopsCV(pTHX_ OP *o)
5138 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5144 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5146 return newUNOP(OP_RV2CV, flags, scalar(o));
5150 Perl_newSVREF(pTHX_ OP *o)
5152 if (o->op_type == OP_PADANY) {
5153 o->op_type = OP_PADSV;
5154 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5157 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
5158 o->op_flags |= OPpDONE_SVREF;
5161 return newUNOP(OP_RV2SV, 0, scalar(o));
5164 /* Check routines. */
5167 Perl_ck_anoncode(pTHX_ OP *o)
5172 name = NEWSV(1106,0);
5173 sv_upgrade(name, SVt_PVNV);
5174 sv_setpvn(name, "&", 1);
5177 ix = pad_alloc(o->op_type, SVs_PADMY);
5178 av_store(PL_comppad_name, ix, name);
5179 av_store(PL_comppad, ix, cSVOPo->op_sv);
5180 SvPADMY_on(cSVOPo->op_sv);
5181 cSVOPo->op_sv = Nullsv;
5182 cSVOPo->op_targ = ix;
5187 Perl_ck_bitop(pTHX_ OP *o)
5189 o->op_private = PL_hints;
5194 Perl_ck_concat(pTHX_ OP *o)
5196 if (cUNOPo->op_first->op_type == OP_CONCAT)
5197 o->op_flags |= OPf_STACKED;
5202 Perl_ck_spair(pTHX_ OP *o)
5204 if (o->op_flags & OPf_KIDS) {
5207 OPCODE type = o->op_type;
5208 o = modkids(ck_fun(o), type);
5209 kid = cUNOPo->op_first;
5210 newop = kUNOP->op_first->op_sibling;
5212 (newop->op_sibling ||
5213 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5214 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5215 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5219 op_free(kUNOP->op_first);
5220 kUNOP->op_first = newop;
5222 o->op_ppaddr = PL_ppaddr[++o->op_type];
5227 Perl_ck_delete(pTHX_ OP *o)
5231 if (o->op_flags & OPf_KIDS) {
5232 OP *kid = cUNOPo->op_first;
5233 switch (kid->op_type) {
5235 o->op_flags |= OPf_SPECIAL;
5238 o->op_private |= OPpSLICE;
5241 o->op_flags |= OPf_SPECIAL;
5246 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5247 PL_op_desc[o->op_type]);
5255 Perl_ck_eof(pTHX_ OP *o)
5257 I32 type = o->op_type;
5259 if (o->op_flags & OPf_KIDS) {
5260 if (cLISTOPo->op_first->op_type == OP_STUB) {
5262 o = newUNOP(type, OPf_SPECIAL,
5263 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5271 Perl_ck_eval(pTHX_ OP *o)
5273 PL_hints |= HINT_BLOCK_SCOPE;
5274 if (o->op_flags & OPf_KIDS) {
5275 SVOP *kid = (SVOP*)cUNOPo->op_first;
5278 o->op_flags &= ~OPf_KIDS;
5281 else if (kid->op_type == OP_LINESEQ) {
5284 kid->op_next = o->op_next;
5285 cUNOPo->op_first = 0;
5288 NewOp(1101, enter, 1, LOGOP);
5289 enter->op_type = OP_ENTERTRY;
5290 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5291 enter->op_private = 0;
5293 /* establish postfix order */
5294 enter->op_next = (OP*)enter;
5296 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5297 o->op_type = OP_LEAVETRY;
5298 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5299 enter->op_other = o;
5307 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5309 o->op_targ = (PADOFFSET)PL_hints;
5314 Perl_ck_exit(pTHX_ OP *o)
5317 HV *table = GvHV(PL_hintgv);
5319 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
5320 if (svp && *svp && SvTRUE(*svp))
5321 o->op_private |= OPpEXIT_VMSISH;
5328 Perl_ck_exec(pTHX_ OP *o)
5331 if (o->op_flags & OPf_STACKED) {
5333 kid = cUNOPo->op_first->op_sibling;
5334 if (kid->op_type == OP_RV2GV)
5343 Perl_ck_exists(pTHX_ OP *o)
5346 if (o->op_flags & OPf_KIDS) {
5347 OP *kid = cUNOPo->op_first;
5348 if (kid->op_type == OP_ENTERSUB) {
5349 (void) ref(kid, o->op_type);
5350 if (kid->op_type != OP_RV2CV && !PL_error_count)
5351 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5352 PL_op_desc[o->op_type]);
5353 o->op_private |= OPpEXISTS_SUB;
5355 else if (kid->op_type == OP_AELEM)
5356 o->op_flags |= OPf_SPECIAL;
5357 else if (kid->op_type != OP_HELEM)
5358 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5359 PL_op_desc[o->op_type]);
5367 Perl_ck_gvconst(pTHX_ register OP *o)
5369 o = fold_constants(o);
5370 if (o->op_type == OP_CONST)
5377 Perl_ck_rvconst(pTHX_ register OP *o)
5380 SVOP *kid = (SVOP*)cUNOPo->op_first;
5382 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5383 if (kid->op_type == OP_CONST) {
5387 SV *kidsv = kid->op_sv;
5390 /* Is it a constant from cv_const_sv()? */
5391 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5392 SV *rsv = SvRV(kidsv);
5393 int svtype = SvTYPE(rsv);
5394 char *badtype = Nullch;
5396 switch (o->op_type) {
5398 if (svtype > SVt_PVMG)
5399 badtype = "a SCALAR";
5402 if (svtype != SVt_PVAV)
5403 badtype = "an ARRAY";
5406 if (svtype != SVt_PVHV) {
5407 if (svtype == SVt_PVAV) { /* pseudohash? */
5408 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5409 if (ksv && SvROK(*ksv)
5410 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5419 if (svtype != SVt_PVCV)
5424 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5427 name = SvPV(kidsv, n_a);
5428 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5429 char *badthing = Nullch;
5430 switch (o->op_type) {
5432 badthing = "a SCALAR";
5435 badthing = "an ARRAY";
5438 badthing = "a HASH";
5443 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5447 * This is a little tricky. We only want to add the symbol if we
5448 * didn't add it in the lexer. Otherwise we get duplicate strict
5449 * warnings. But if we didn't add it in the lexer, we must at
5450 * least pretend like we wanted to add it even if it existed before,
5451 * or we get possible typo warnings. OPpCONST_ENTERED says
5452 * whether the lexer already added THIS instance of this symbol.
5454 iscv = (o->op_type == OP_RV2CV) * 2;
5456 gv = gv_fetchpv(name,
5457 iscv | !(kid->op_private & OPpCONST_ENTERED),
5460 : o->op_type == OP_RV2SV
5462 : o->op_type == OP_RV2AV
5464 : o->op_type == OP_RV2HV
5467 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5469 kid->op_type = OP_GV;
5470 SvREFCNT_dec(kid->op_sv);
5472 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5473 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5474 SvREFCNT_dec(PL_curpad[kPADOP->op_padix]);
5476 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5478 kid->op_sv = SvREFCNT_inc(gv);
5480 kid->op_ppaddr = PL_ppaddr[OP_GV];
5487 Perl_ck_ftst(pTHX_ OP *o)
5490 I32 type = o->op_type;
5492 if (o->op_flags & OPf_REF) {
5495 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5496 SVOP *kid = (SVOP*)cUNOPo->op_first;
5498 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5500 OP *newop = newGVOP(type, OPf_REF,
5501 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5508 if (type == OP_FTTTY)
5509 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5512 o = newUNOP(type, 0, newDEFSVOP());
5515 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5517 if (PL_hints & HINT_LOCALE)
5518 o->op_private |= OPpLOCALE;
5525 Perl_ck_fun(pTHX_ OP *o)
5532 int type = o->op_type;
5533 register I32 oa = PL_opargs[type] >> OASHIFT;
5535 if (o->op_flags & OPf_STACKED) {
5536 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5539 return no_fh_allowed(o);
5542 if (o->op_flags & OPf_KIDS) {
5544 tokid = &cLISTOPo->op_first;
5545 kid = cLISTOPo->op_first;
5546 if (kid->op_type == OP_PUSHMARK ||
5547 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5549 tokid = &kid->op_sibling;
5550 kid = kid->op_sibling;
5552 if (!kid && PL_opargs[type] & OA_DEFGV)
5553 *tokid = kid = newDEFSVOP();
5557 sibl = kid->op_sibling;
5560 /* list seen where single (scalar) arg expected? */
5561 if (numargs == 1 && !(oa >> 4)
5562 && kid->op_type == OP_LIST && type != OP_SCALAR)
5564 return too_many_arguments(o,PL_op_desc[type]);
5577 if (kid->op_type == OP_CONST &&
5578 (kid->op_private & OPpCONST_BARE))
5580 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5581 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5582 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5583 if (ckWARN(WARN_DEPRECATED))
5584 Perl_warner(aTHX_ WARN_DEPRECATED,
5585 "Array @%s missing the @ in argument %"IVdf" of %s()",
5586 name, (IV)numargs, PL_op_desc[type]);
5589 kid->op_sibling = sibl;
5592 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5593 bad_type(numargs, "array", PL_op_desc[type], kid);
5597 if (kid->op_type == OP_CONST &&
5598 (kid->op_private & OPpCONST_BARE))
5600 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5601 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5602 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5603 if (ckWARN(WARN_DEPRECATED))
5604 Perl_warner(aTHX_ WARN_DEPRECATED,
5605 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5606 name, (IV)numargs, PL_op_desc[type]);
5609 kid->op_sibling = sibl;
5612 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5613 bad_type(numargs, "hash", PL_op_desc[type], kid);
5618 OP *newop = newUNOP(OP_NULL, 0, kid);
5619 kid->op_sibling = 0;
5621 newop->op_next = newop;
5623 kid->op_sibling = sibl;
5628 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5629 if (kid->op_type == OP_CONST &&
5630 (kid->op_private & OPpCONST_BARE))
5632 OP *newop = newGVOP(OP_GV, 0,
5633 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5638 else if (kid->op_type == OP_READLINE) {
5639 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5640 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5643 I32 flags = OPf_SPECIAL;
5647 /* is this op a FH constructor? */
5648 if (is_handle_constructor(o,numargs)) {
5649 char *name = Nullch;
5653 /* Set a flag to tell rv2gv to vivify
5654 * need to "prove" flag does not mean something
5655 * else already - NI-S 1999/05/07
5658 if (kid->op_type == OP_PADSV) {
5659 SV **namep = av_fetch(PL_comppad_name,
5661 if (namep && *namep)
5662 name = SvPV(*namep, len);
5664 else if (kid->op_type == OP_RV2SV
5665 && kUNOP->op_first->op_type == OP_GV)
5667 GV *gv = cGVOPx_gv(kUNOP->op_first);
5669 len = GvNAMELEN(gv);
5671 else if (kid->op_type == OP_AELEM
5672 || kid->op_type == OP_HELEM)
5674 name = "__ANONIO__";
5680 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5681 namesv = PL_curpad[targ];
5682 (void)SvUPGRADE(namesv, SVt_PV);
5684 sv_setpvn(namesv, "$", 1);
5685 sv_catpvn(namesv, name, len);
5688 kid->op_sibling = 0;
5689 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5690 kid->op_targ = targ;
5691 kid->op_private |= priv;
5693 kid->op_sibling = sibl;
5699 mod(scalar(kid), type);
5703 tokid = &kid->op_sibling;
5704 kid = kid->op_sibling;
5706 o->op_private |= numargs;
5708 return too_many_arguments(o,PL_op_desc[o->op_type]);
5711 else if (PL_opargs[type] & OA_DEFGV) {
5713 return newUNOP(type, 0, newDEFSVOP());
5717 while (oa & OA_OPTIONAL)
5719 if (oa && oa != OA_LIST)
5720 return too_few_arguments(o,PL_op_desc[o->op_type]);
5726 Perl_ck_glob(pTHX_ OP *o)
5731 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5732 append_elem(OP_GLOB, o, newDEFSVOP());
5734 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5735 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5737 #if !defined(PERL_EXTERNAL_GLOB)
5738 /* XXX this can be tightened up and made more failsafe. */
5741 Perl_load_module(aTHX_ 0, newSVpvn("File::Glob", 10), Nullsv,
5742 /* null-terminated import list */
5743 newSVpvn(":globally", 9), Nullsv);
5744 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5747 #endif /* PERL_EXTERNAL_GLOB */
5749 if (gv && GvIMPORTED_CV(gv)) {
5750 append_elem(OP_GLOB, o,
5751 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5752 o->op_type = OP_LIST;
5753 o->op_ppaddr = PL_ppaddr[OP_LIST];
5754 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5755 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5756 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5757 append_elem(OP_LIST, o,
5758 scalar(newUNOP(OP_RV2CV, 0,
5759 newGVOP(OP_GV, 0, gv)))));
5760 o = newUNOP(OP_NULL, 0, ck_subr(o));
5761 o->op_targ = OP_GLOB; /* hint at what it used to be */
5764 gv = newGVgen("main");
5766 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5772 Perl_ck_grep(pTHX_ OP *o)
5776 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5778 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5779 NewOp(1101, gwop, 1, LOGOP);
5781 if (o->op_flags & OPf_STACKED) {
5784 kid = cLISTOPo->op_first->op_sibling;
5785 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5788 kid->op_next = (OP*)gwop;
5789 o->op_flags &= ~OPf_STACKED;
5791 kid = cLISTOPo->op_first->op_sibling;
5792 if (type == OP_MAPWHILE)
5799 kid = cLISTOPo->op_first->op_sibling;
5800 if (kid->op_type != OP_NULL)
5801 Perl_croak(aTHX_ "panic: ck_grep");
5802 kid = kUNOP->op_first;
5804 gwop->op_type = type;
5805 gwop->op_ppaddr = PL_ppaddr[type];
5806 gwop->op_first = listkids(o);
5807 gwop->op_flags |= OPf_KIDS;
5808 gwop->op_private = 1;
5809 gwop->op_other = LINKLIST(kid);
5810 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5811 kid->op_next = (OP*)gwop;
5813 kid = cLISTOPo->op_first->op_sibling;
5814 if (!kid || !kid->op_sibling)
5815 return too_few_arguments(o,PL_op_desc[o->op_type]);
5816 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5817 mod(kid, OP_GREPSTART);
5823 Perl_ck_index(pTHX_ OP *o)
5825 if (o->op_flags & OPf_KIDS) {
5826 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5828 kid = kid->op_sibling; /* get past "big" */
5829 if (kid && kid->op_type == OP_CONST)
5830 fbm_compile(((SVOP*)kid)->op_sv, 0);
5836 Perl_ck_lengthconst(pTHX_ OP *o)
5838 /* XXX length optimization goes here */
5843 Perl_ck_lfun(pTHX_ OP *o)
5845 OPCODE type = o->op_type;
5846 return modkids(ck_fun(o), type);
5850 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5853 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5854 switch (cUNOPo->op_first->op_type) {
5856 /* This is needed for
5857 if (defined %stash::)
5858 to work. Do not break Tk.
5860 break; /* Globals via GV can be undef */
5862 case OP_AASSIGN: /* Is this a good idea? */
5863 Perl_warner(aTHX_ WARN_DEPRECATED,
5864 "defined(@array) is deprecated");
5865 Perl_warner(aTHX_ WARN_DEPRECATED,
5866 "\t(Maybe you should just omit the defined()?)\n");
5869 /* This is needed for
5870 if (defined %stash::)
5871 to work. Do not break Tk.
5873 break; /* Globals via GV can be undef */
5875 Perl_warner(aTHX_ WARN_DEPRECATED,
5876 "defined(%%hash) is deprecated");
5877 Perl_warner(aTHX_ WARN_DEPRECATED,
5878 "\t(Maybe you should just omit the defined()?)\n");
5889 Perl_ck_rfun(pTHX_ OP *o)
5891 OPCODE type = o->op_type;
5892 return refkids(ck_fun(o), type);
5896 Perl_ck_listiob(pTHX_ OP *o)
5900 kid = cLISTOPo->op_first;
5903 kid = cLISTOPo->op_first;
5905 if (kid->op_type == OP_PUSHMARK)
5906 kid = kid->op_sibling;
5907 if (kid && o->op_flags & OPf_STACKED)
5908 kid = kid->op_sibling;
5909 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5910 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5911 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5912 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5913 cLISTOPo->op_first->op_sibling = kid;
5914 cLISTOPo->op_last = kid;
5915 kid = kid->op_sibling;
5920 append_elem(o->op_type, o, newDEFSVOP());
5926 if (PL_hints & HINT_LOCALE)
5927 o->op_private |= OPpLOCALE;
5934 Perl_ck_fun_locale(pTHX_ OP *o)
5940 if (PL_hints & HINT_LOCALE)
5941 o->op_private |= OPpLOCALE;
5948 Perl_ck_sassign(pTHX_ OP *o)
5950 OP *kid = cLISTOPo->op_first;
5951 /* has a disposable target? */
5952 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5953 && !(kid->op_flags & OPf_STACKED)
5954 /* Cannot steal the second time! */
5955 && !(kid->op_private & OPpTARGET_MY))
5957 OP *kkid = kid->op_sibling;
5959 /* Can just relocate the target. */
5960 if (kkid && kkid->op_type == OP_PADSV
5961 && !(kkid->op_private & OPpLVAL_INTRO))
5963 kid->op_targ = kkid->op_targ;
5965 /* Now we do not need PADSV and SASSIGN. */
5966 kid->op_sibling = o->op_sibling; /* NULL */
5967 cLISTOPo->op_first = NULL;
5970 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5978 Perl_ck_scmp(pTHX_ OP *o)
5982 if (PL_hints & HINT_LOCALE)
5983 o->op_private |= OPpLOCALE;
5990 Perl_ck_match(pTHX_ OP *o)
5992 o->op_private |= OPpRUNTIME;
5997 Perl_ck_method(pTHX_ OP *o)
5999 OP *kid = cUNOPo->op_first;
6000 if (kid->op_type == OP_CONST) {
6001 SV* sv = kSVOP->op_sv;
6002 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
6004 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
6005 sv = newSVpvn_share(SvPVX(sv), SvCUR(sv), 0);
6008 kSVOP->op_sv = Nullsv;
6010 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
6019 Perl_ck_null(pTHX_ OP *o)
6025 Perl_ck_open(pTHX_ OP *o)
6027 HV *table = GvHV(PL_hintgv);
6031 svp = hv_fetch(table, "open_IN", 7, FALSE);
6033 mode = mode_from_discipline(*svp);
6034 if (mode & O_BINARY)
6035 o->op_private |= OPpOPEN_IN_RAW;
6036 else if (mode & O_TEXT)
6037 o->op_private |= OPpOPEN_IN_CRLF;
6040 svp = hv_fetch(table, "open_OUT", 8, FALSE);
6042 mode = mode_from_discipline(*svp);
6043 if (mode & O_BINARY)
6044 o->op_private |= OPpOPEN_OUT_RAW;
6045 else if (mode & O_TEXT)
6046 o->op_private |= OPpOPEN_OUT_CRLF;
6049 if (o->op_type == OP_BACKTICK)
6055 Perl_ck_repeat(pTHX_ OP *o)
6057 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
6058 o->op_private |= OPpREPEAT_DOLIST;
6059 cBINOPo->op_first = force_list(cBINOPo->op_first);
6067 Perl_ck_require(pTHX_ OP *o)
6069 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
6070 SVOP *kid = (SVOP*)cUNOPo->op_first;
6072 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6074 for (s = SvPVX(kid->op_sv); *s; s++) {
6075 if (*s == ':' && s[1] == ':') {
6077 Move(s+2, s+1, strlen(s+2)+1, char);
6078 --SvCUR(kid->op_sv);
6081 if (SvREADONLY(kid->op_sv)) {
6082 SvREADONLY_off(kid->op_sv);
6083 sv_catpvn(kid->op_sv, ".pm", 3);
6084 SvREADONLY_on(kid->op_sv);
6087 sv_catpvn(kid->op_sv, ".pm", 3);
6095 Perl_ck_retarget(pTHX_ OP *o)
6097 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
6104 Perl_ck_select(pTHX_ OP *o)
6107 if (o->op_flags & OPf_KIDS) {
6108 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6109 if (kid && kid->op_sibling) {
6110 o->op_type = OP_SSELECT;
6111 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
6113 return fold_constants(o);
6117 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6118 if (kid && kid->op_type == OP_RV2GV)
6119 kid->op_private &= ~HINT_STRICT_REFS;
6124 Perl_ck_shift(pTHX_ OP *o)
6126 I32 type = o->op_type;
6128 if (!(o->op_flags & OPf_KIDS)) {
6133 if (!CvUNIQUE(PL_compcv)) {
6134 argop = newOP(OP_PADAV, OPf_REF);
6135 argop->op_targ = 0; /* PL_curpad[0] is @_ */
6138 argop = newUNOP(OP_RV2AV, 0,
6139 scalar(newGVOP(OP_GV, 0,
6140 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6143 argop = newUNOP(OP_RV2AV, 0,
6144 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
6145 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6146 #endif /* USE_THREADS */
6147 return newUNOP(type, 0, scalar(argop));
6149 return scalar(modkids(ck_fun(o), type));
6153 Perl_ck_sort(pTHX_ OP *o)
6158 if (PL_hints & HINT_LOCALE)
6159 o->op_private |= OPpLOCALE;
6162 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
6164 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6165 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
6167 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
6169 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
6171 if (kid->op_type == OP_SCOPE) {
6175 else if (kid->op_type == OP_LEAVE) {
6176 if (o->op_type == OP_SORT) {
6177 null(kid); /* wipe out leave */
6180 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
6181 if (k->op_next == kid)
6183 /* don't descend into loops */
6184 else if (k->op_type == OP_ENTERLOOP
6185 || k->op_type == OP_ENTERITER)
6187 k = cLOOPx(k)->op_lastop;
6192 kid->op_next = 0; /* just disconnect the leave */
6193 k = kLISTOP->op_first;
6198 if (o->op_type == OP_SORT) {
6199 /* provide scalar context for comparison function/block */
6205 o->op_flags |= OPf_SPECIAL;
6207 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
6210 firstkid = firstkid->op_sibling;
6213 /* provide list context for arguments */
6214 if (o->op_type == OP_SORT)
6221 S_simplify_sort(pTHX_ OP *o)
6224 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6228 if (!(o->op_flags & OPf_STACKED))
6230 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
6231 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
6232 kid = kUNOP->op_first; /* get past null */
6233 if (kid->op_type != OP_SCOPE)
6235 kid = kLISTOP->op_last; /* get past scope */
6236 switch(kid->op_type) {
6244 k = kid; /* remember this node*/
6245 if (kBINOP->op_first->op_type != OP_RV2SV)
6247 kid = kBINOP->op_first; /* get past cmp */
6248 if (kUNOP->op_first->op_type != OP_GV)
6250 kid = kUNOP->op_first; /* get past rv2sv */
6252 if (GvSTASH(gv) != PL_curstash)
6254 if (strEQ(GvNAME(gv), "a"))
6256 else if (strEQ(GvNAME(gv), "b"))
6260 kid = k; /* back to cmp */
6261 if (kBINOP->op_last->op_type != OP_RV2SV)
6263 kid = kBINOP->op_last; /* down to 2nd arg */
6264 if (kUNOP->op_first->op_type != OP_GV)
6266 kid = kUNOP->op_first; /* get past rv2sv */
6268 if (GvSTASH(gv) != PL_curstash
6270 ? strNE(GvNAME(gv), "a")
6271 : strNE(GvNAME(gv), "b")))
6273 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6275 o->op_private |= OPpSORT_REVERSE;
6276 if (k->op_type == OP_NCMP)
6277 o->op_private |= OPpSORT_NUMERIC;
6278 if (k->op_type == OP_I_NCMP)
6279 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6280 kid = cLISTOPo->op_first->op_sibling;
6281 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6282 op_free(kid); /* then delete it */
6283 cLISTOPo->op_children--;
6287 Perl_ck_split(pTHX_ OP *o)
6291 if (o->op_flags & OPf_STACKED)
6292 return no_fh_allowed(o);
6294 kid = cLISTOPo->op_first;
6295 if (kid->op_type != OP_NULL)
6296 Perl_croak(aTHX_ "panic: ck_split");
6297 kid = kid->op_sibling;
6298 op_free(cLISTOPo->op_first);
6299 cLISTOPo->op_first = kid;
6301 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6302 cLISTOPo->op_last = kid; /* There was only one element previously */
6305 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
6306 OP *sibl = kid->op_sibling;
6307 kid->op_sibling = 0;
6308 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6309 if (cLISTOPo->op_first == cLISTOPo->op_last)
6310 cLISTOPo->op_last = kid;
6311 cLISTOPo->op_first = kid;
6312 kid->op_sibling = sibl;
6315 kid->op_type = OP_PUSHRE;
6316 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6319 if (!kid->op_sibling)
6320 append_elem(OP_SPLIT, o, newDEFSVOP());
6322 kid = kid->op_sibling;
6325 if (!kid->op_sibling)
6326 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6328 kid = kid->op_sibling;
6331 if (kid->op_sibling)
6332 return too_many_arguments(o,PL_op_desc[o->op_type]);
6338 Perl_ck_join(pTHX_ OP *o)
6340 if (ckWARN(WARN_SYNTAX)) {
6341 OP *kid = cLISTOPo->op_first->op_sibling;
6342 if (kid && kid->op_type == OP_MATCH) {
6343 char *pmstr = "STRING";
6344 if (kPMOP->op_pmregexp)
6345 pmstr = kPMOP->op_pmregexp->precomp;
6346 Perl_warner(aTHX_ WARN_SYNTAX,
6347 "/%s/ should probably be written as \"%s\"",
6355 Perl_ck_subr(pTHX_ OP *o)
6358 OP *prev = ((cUNOPo->op_first->op_sibling)
6359 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6360 OP *o2 = prev->op_sibling;
6369 o->op_private |= OPpENTERSUB_HASTARG;
6370 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6371 if (cvop->op_type == OP_RV2CV) {
6373 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6374 null(cvop); /* disable rv2cv */
6375 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6376 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6377 GV *gv = cGVOPx_gv(tmpop);
6380 tmpop->op_private |= OPpEARLY_CV;
6381 else if (SvPOK(cv)) {
6382 namegv = CvANON(cv) ? gv : CvGV(cv);
6383 proto = SvPV((SV*)cv, n_a);
6387 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6388 if (o2->op_type == OP_CONST)
6389 o2->op_private &= ~OPpCONST_STRICT;
6390 else if (o2->op_type == OP_LIST) {
6391 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6392 if (o && o->op_type == OP_CONST)
6393 o->op_private &= ~OPpCONST_STRICT;
6396 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6397 if (PERLDB_SUB && PL_curstash != PL_debstash)
6398 o->op_private |= OPpENTERSUB_DB;
6399 while (o2 != cvop) {
6403 return too_many_arguments(o, gv_ename(namegv));
6421 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6423 arg == 1 ? "block or sub {}" : "sub {}",
6424 gv_ename(namegv), o2);
6427 /* '*' allows any scalar type, including bareword */
6430 if (o2->op_type == OP_RV2GV)
6431 goto wrapref; /* autoconvert GLOB -> GLOBref */
6432 else if (o2->op_type == OP_CONST)
6433 o2->op_private &= ~OPpCONST_STRICT;
6434 else if (o2->op_type == OP_ENTERSUB) {
6435 /* accidental subroutine, revert to bareword */
6436 OP *gvop = ((UNOP*)o2)->op_first;
6437 if (gvop && gvop->op_type == OP_NULL) {
6438 gvop = ((UNOP*)gvop)->op_first;
6440 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6443 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6444 (gvop = ((UNOP*)gvop)->op_first) &&
6445 gvop->op_type == OP_GV)
6447 GV *gv = cGVOPx_gv(gvop);
6448 OP *sibling = o2->op_sibling;
6449 SV *n = newSVpvn("",0);
6451 gv_fullname3(n, gv, "");
6452 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6453 sv_chop(n, SvPVX(n)+6);
6454 o2 = newSVOP(OP_CONST, 0, n);
6455 prev->op_sibling = o2;
6456 o2->op_sibling = sibling;
6468 if (o2->op_type != OP_RV2GV)
6469 bad_type(arg, "symbol", gv_ename(namegv), o2);
6472 if (o2->op_type != OP_ENTERSUB)
6473 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6476 if (o2->op_type != OP_RV2SV
6477 && o2->op_type != OP_PADSV
6478 && o2->op_type != OP_HELEM
6479 && o2->op_type != OP_AELEM
6480 && o2->op_type != OP_THREADSV)
6482 bad_type(arg, "scalar", gv_ename(namegv), o2);
6486 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6487 bad_type(arg, "array", gv_ename(namegv), o2);
6490 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6491 bad_type(arg, "hash", gv_ename(namegv), o2);
6495 OP* sib = kid->op_sibling;
6496 kid->op_sibling = 0;
6497 o2 = newUNOP(OP_REFGEN, 0, kid);
6498 o2->op_sibling = sib;
6499 prev->op_sibling = o2;
6510 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6511 gv_ename(namegv), SvPV((SV*)cv, n_a));
6516 mod(o2, OP_ENTERSUB);
6518 o2 = o2->op_sibling;
6520 if (proto && !optional &&
6521 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6522 return too_few_arguments(o, gv_ename(namegv));
6527 Perl_ck_svconst(pTHX_ OP *o)
6529 SvREADONLY_on(cSVOPo->op_sv);
6534 Perl_ck_trunc(pTHX_ OP *o)
6536 if (o->op_flags & OPf_KIDS) {
6537 SVOP *kid = (SVOP*)cUNOPo->op_first;
6539 if (kid->op_type == OP_NULL)
6540 kid = (SVOP*)kid->op_sibling;
6541 if (kid && kid->op_type == OP_CONST &&
6542 (kid->op_private & OPpCONST_BARE))
6544 o->op_flags |= OPf_SPECIAL;
6545 kid->op_private &= ~OPpCONST_STRICT;
6552 Perl_ck_substr(pTHX_ OP *o)
6555 if ((o->op_flags & OPf_KIDS) && o->op_private == 4) {
6556 OP *kid = cLISTOPo->op_first;
6558 if (kid->op_type == OP_NULL)
6559 kid = kid->op_sibling;
6561 kid->op_flags |= OPf_MOD;
6567 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6570 Perl_peep(pTHX_ register OP *o)
6573 register OP* oldop = 0;
6575 OP *last_composite = Nullop;
6577 if (!o || o->op_seq)
6581 SAVEVPTR(PL_curcop);
6582 for (; o; o = o->op_next) {
6588 switch (o->op_type) {
6592 PL_curcop = ((COP*)o); /* for warnings */
6593 o->op_seq = PL_op_seqmax++;
6594 last_composite = Nullop;
6598 if (cSVOPo->op_private & OPpCONST_STRICT)
6599 no_bareword_allowed(o);
6601 /* Relocate sv to the pad for thread safety.
6602 * Despite being a "constant", the SV is written to,
6603 * for reference counts, sv_upgrade() etc. */
6605 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6606 if (SvPADTMP(cSVOPo->op_sv)) {
6607 /* If op_sv is already a PADTMP then it is being used by
6608 * some pad, so make a copy. */
6609 sv_setsv(PL_curpad[ix],cSVOPo->op_sv);
6610 SvREADONLY_on(PL_curpad[ix]);
6611 SvREFCNT_dec(cSVOPo->op_sv);
6614 SvREFCNT_dec(PL_curpad[ix]);
6615 SvPADTMP_on(cSVOPo->op_sv);
6616 PL_curpad[ix] = cSVOPo->op_sv;
6617 /* XXX I don't know how this isn't readonly already. */
6618 SvREADONLY_on(PL_curpad[ix]);
6620 cSVOPo->op_sv = Nullsv;
6624 o->op_seq = PL_op_seqmax++;
6628 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6629 if (o->op_next->op_private & OPpTARGET_MY) {
6630 if (o->op_flags & OPf_STACKED) /* chained concats */
6631 goto ignore_optimization;
6633 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6634 o->op_targ = o->op_next->op_targ;
6635 o->op_next->op_targ = 0;
6636 o->op_private |= OPpTARGET_MY;
6641 ignore_optimization:
6642 o->op_seq = PL_op_seqmax++;
6645 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6646 o->op_seq = PL_op_seqmax++;
6647 break; /* Scalar stub must produce undef. List stub is noop */
6651 if (o->op_targ == OP_NEXTSTATE
6652 || o->op_targ == OP_DBSTATE
6653 || o->op_targ == OP_SETSTATE)
6655 PL_curcop = ((COP*)o);
6662 if (oldop && o->op_next) {
6663 oldop->op_next = o->op_next;
6666 o->op_seq = PL_op_seqmax++;
6670 if (o->op_next->op_type == OP_RV2SV) {
6671 if (!(o->op_next->op_private & OPpDEREF)) {
6673 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6675 o->op_next = o->op_next->op_next;
6676 o->op_type = OP_GVSV;
6677 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6680 else if (o->op_next->op_type == OP_RV2AV) {
6681 OP* pop = o->op_next->op_next;
6683 if (pop->op_type == OP_CONST &&
6684 (PL_op = pop->op_next) &&
6685 pop->op_next->op_type == OP_AELEM &&
6686 !(pop->op_next->op_private &
6687 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6688 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6696 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6697 o->op_next = pop->op_next->op_next;
6698 o->op_type = OP_AELEMFAST;
6699 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6700 o->op_private = (U8)i;
6705 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6707 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6708 /* XXX could check prototype here instead of just carping */
6709 SV *sv = sv_newmortal();
6710 gv_efullname3(sv, gv, Nullch);
6711 Perl_warner(aTHX_ WARN_PROTOTYPE,
6712 "%s() called too early to check prototype",
6717 o->op_seq = PL_op_seqmax++;
6728 o->op_seq = PL_op_seqmax++;
6729 while (cLOGOP->op_other->op_type == OP_NULL)
6730 cLOGOP->op_other = cLOGOP->op_other->op_next;
6731 peep(cLOGOP->op_other);
6735 o->op_seq = PL_op_seqmax++;
6736 peep(cLOOP->op_redoop);
6737 peep(cLOOP->op_nextop);
6738 peep(cLOOP->op_lastop);
6744 o->op_seq = PL_op_seqmax++;
6745 peep(cPMOP->op_pmreplstart);
6749 o->op_seq = PL_op_seqmax++;
6750 if (ckWARN(WARN_SYNTAX) && o->op_next
6751 && o->op_next->op_type == OP_NEXTSTATE) {
6752 if (o->op_next->op_sibling &&
6753 o->op_next->op_sibling->op_type != OP_EXIT &&
6754 o->op_next->op_sibling->op_type != OP_WARN &&
6755 o->op_next->op_sibling->op_type != OP_DIE) {
6756 line_t oldline = CopLINE(PL_curcop);
6758 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6759 Perl_warner(aTHX_ WARN_EXEC,
6760 "Statement unlikely to be reached");
6761 Perl_warner(aTHX_ WARN_EXEC,
6762 "\t(Maybe you meant system() when you said exec()?)\n");
6763 CopLINE_set(PL_curcop, oldline);
6772 SV **svp, **indsvp, *sv;
6777 o->op_seq = PL_op_seqmax++;
6779 if (((BINOP*)o)->op_last->op_type != OP_CONST)
6782 /* Make the CONST have a shared SV */
6783 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6784 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv)) && !IS_PADCONST(sv)) {
6785 key = SvPV(sv, keylen);
6786 lexname = newSVpvn_share(key, keylen, 0);
6791 if ((o->op_private & (OPpLVAL_INTRO)))
6794 rop = (UNOP*)((BINOP*)o)->op_first;
6795 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6797 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6798 if (!SvOBJECT(lexname))
6800 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6801 if (!fields || !GvHV(*fields))
6803 key = SvPV(*svp, keylen);
6804 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6806 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6807 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6809 ind = SvIV(*indsvp);
6811 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6812 rop->op_type = OP_RV2AV;
6813 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6814 o->op_type = OP_AELEM;
6815 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6817 if (SvREADONLY(*svp))
6819 SvFLAGS(sv) |= (SvFLAGS(*svp)
6820 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6830 SV **svp, **indsvp, *sv;
6834 SVOP *first_key_op, *key_op;
6836 o->op_seq = PL_op_seqmax++;
6837 if ((o->op_private & (OPpLVAL_INTRO))
6838 /* I bet there's always a pushmark... */
6839 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
6840 /* hmmm, no optimization if list contains only one key. */
6842 rop = (UNOP*)((LISTOP*)o)->op_last;
6843 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6845 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6846 if (!SvOBJECT(lexname))
6848 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6849 if (!fields || !GvHV(*fields))
6851 /* Again guessing that the pushmark can be jumped over.... */
6852 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
6853 ->op_first->op_sibling;
6854 /* Check that the key list contains only constants. */
6855 for (key_op = first_key_op; key_op;
6856 key_op = (SVOP*)key_op->op_sibling)
6857 if (key_op->op_type != OP_CONST)
6861 rop->op_type = OP_RV2AV;
6862 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6863 o->op_type = OP_ASLICE;
6864 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
6865 for (key_op = first_key_op; key_op;
6866 key_op = (SVOP*)key_op->op_sibling) {
6867 svp = cSVOPx_svp(key_op);
6868 key = SvPV(*svp, keylen);
6869 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6871 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
6872 "in variable %s of type %s",
6873 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6875 ind = SvIV(*indsvp);
6877 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6879 if (SvREADONLY(*svp))
6881 SvFLAGS(sv) |= (SvFLAGS(*svp)
6882 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6891 if (!(o->op_flags & OPf_WANT)
6892 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6896 o->op_seq = PL_op_seqmax++;
6900 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6901 o->op_seq = PL_op_seqmax++;
6907 if (last_composite) {
6908 OP *r = last_composite;
6910 while (r->op_sibling)
6913 || (r->op_next->op_type == OP_LIST
6914 && r->op_next->op_next == o))
6916 if (last_composite->op_type == OP_RV2AV)
6917 yyerror("Lvalue subs returning arrays not implemented yet");
6919 yyerror("Lvalue subs returning hashes not implemented yet");
6926 o->op_seq = PL_op_seqmax++;
6936 /* Efficient sub that returns a constant scalar value. */
6938 const_sv_xsub(pTHXo_ CV* cv)
6942 ST(0) = sv_2mortal(SvREFCNT_inc((SV*)XSANY.any_ptr));