3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
23 /* #define PL_OP_SLAB_ALLOC */
25 #ifdef PL_OP_SLAB_ALLOC
26 #define SLAB_SIZE 8192
27 static char *PL_OpPtr = NULL;
28 static int PL_OpSpace = 0;
29 #define NewOp(m,var,c,type) do { if ((PL_OpSpace -= c*sizeof(type)) >= 0) \
30 var = (type *)(PL_OpPtr -= c*sizeof(type)); \
32 var = (type *) Slab_Alloc(m,c*sizeof(type)); \
36 S_Slab_Alloc(pTHX_ int m, size_t sz)
38 Newz(m,PL_OpPtr,SLAB_SIZE,char);
39 PL_OpSpace = SLAB_SIZE - sz;
40 return PL_OpPtr += PL_OpSpace;
44 #define NewOp(m, var, c, type) Newz(m, var, c, type)
47 * In the following definition, the ", Nullop" is just to make the compiler
48 * think the expression is of the right type: croak actually does a Siglongjmp.
50 #define CHECKOP(type,o) \
51 ((PL_op_mask && PL_op_mask[type]) \
52 ? ( op_free((OP*)o), \
53 Perl_croak(aTHX_ "%s trapped by operation mask", PL_op_desc[type]), \
55 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
57 #define PAD_MAX 999999999
60 S_gv_ename(pTHX_ GV *gv)
63 SV* tmpsv = sv_newmortal();
64 gv_efullname3(tmpsv, gv, Nullch);
65 return SvPV(tmpsv,n_a);
69 S_no_fh_allowed(pTHX_ OP *o)
71 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
72 PL_op_desc[o->op_type]));
77 S_too_few_arguments(pTHX_ OP *o, char *name)
79 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
84 S_too_many_arguments(pTHX_ OP *o, char *name)
86 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
91 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
93 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
94 (int)n, name, t, PL_op_desc[kid->op_type]));
98 S_no_bareword_allowed(pTHX_ OP *o)
100 qerror(Perl_mess(aTHX_
101 "Bareword \"%s\" not allowed while \"strict subs\" in use",
102 SvPV_nolen(cSVOPo_sv)));
105 /* "register" allocation */
108 Perl_pad_allocmy(pTHX_ char *name)
114 if (!(PL_in_my == KEY_our ||
116 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
117 (name[1] == '_' && (int)strlen(name) > 2)))
119 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
120 /* 1999-02-27 mjd@plover.com */
122 p = strchr(name, '\0');
123 /* The next block assumes the buffer is at least 205 chars
124 long. At present, it's always at least 256 chars. */
126 strcpy(name+200, "...");
132 /* Move everything else down one character */
133 for (; p-name > 2; p--)
135 name[2] = toCTRL(name[1]);
138 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
140 if (ckWARN(WARN_MISC) && AvFILLp(PL_comppad_name) >= 0) {
141 SV **svp = AvARRAY(PL_comppad_name);
142 HV *ourstash = (PL_curstash ? PL_curstash : PL_defstash);
143 PADOFFSET top = AvFILLp(PL_comppad_name);
144 for (off = top; off > PL_comppad_name_floor; off--) {
146 && sv != &PL_sv_undef
147 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
148 && (PL_in_my != KEY_our
149 || ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash))
150 && strEQ(name, SvPVX(sv)))
152 Perl_warner(aTHX_ WARN_MISC,
153 "\"%s\" variable %s masks earlier declaration in same %s",
154 (PL_in_my == KEY_our ? "our" : "my"),
156 (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
161 if (PL_in_my == KEY_our) {
164 && sv != &PL_sv_undef
165 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
166 && ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash)
167 && strEQ(name, SvPVX(sv)))
169 Perl_warner(aTHX_ WARN_MISC,
170 "\"our\" variable %s redeclared", name);
171 Perl_warner(aTHX_ WARN_MISC,
172 "\t(Did you mean \"local\" instead of \"our\"?)\n");
175 } while ( off-- > 0 );
178 off = pad_alloc(OP_PADSV, SVs_PADMY);
180 sv_upgrade(sv, SVt_PVNV);
182 if (PL_in_my_stash) {
184 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"%s\"",
185 name, PL_in_my == KEY_our ? "our" : "my"));
187 (void)SvUPGRADE(sv, SVt_PVMG);
188 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
191 if (PL_in_my == KEY_our) {
192 (void)SvUPGRADE(sv, SVt_PVGV);
193 GvSTASH(sv) = (HV*)SvREFCNT_inc(PL_curstash ? (SV*)PL_curstash : (SV*)PL_defstash);
194 SvFLAGS(sv) |= SVpad_OUR;
196 av_store(PL_comppad_name, off, sv);
197 SvNVX(sv) = (NV)PAD_MAX;
198 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
199 if (!PL_min_intro_pending)
200 PL_min_intro_pending = off;
201 PL_max_intro_pending = off;
203 av_store(PL_comppad, off, (SV*)newAV());
204 else if (*name == '%')
205 av_store(PL_comppad, off, (SV*)newHV());
206 SvPADMY_on(PL_curpad[off]);
211 S_pad_addlex(pTHX_ SV *proto_namesv)
213 SV *namesv = NEWSV(1103,0);
214 PADOFFSET newoff = pad_alloc(OP_PADSV, SVs_PADMY);
215 sv_upgrade(namesv, SVt_PVNV);
216 sv_setpv(namesv, SvPVX(proto_namesv));
217 av_store(PL_comppad_name, newoff, namesv);
218 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
219 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
220 SvFAKE_on(namesv); /* A ref, not a real var */
221 if (SvFLAGS(proto_namesv) & SVpad_OUR) { /* An "our" variable */
222 SvFLAGS(namesv) |= SVpad_OUR;
223 (void)SvUPGRADE(namesv, SVt_PVGV);
224 GvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)GvSTASH(proto_namesv));
226 if (SvOBJECT(proto_namesv)) { /* A typed var */
228 (void)SvUPGRADE(namesv, SVt_PVMG);
229 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(proto_namesv));
235 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
238 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
239 I32 cx_ix, I32 saweval, U32 flags)
246 register PERL_CONTEXT *cx;
248 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
249 AV *curlist = CvPADLIST(cv);
250 SV **svp = av_fetch(curlist, 0, FALSE);
253 if (!svp || *svp == &PL_sv_undef)
256 svp = AvARRAY(curname);
257 for (off = AvFILLp(curname); off > 0; off--) {
258 if ((sv = svp[off]) &&
259 sv != &PL_sv_undef &&
261 seq > I_32(SvNVX(sv)) &&
262 strEQ(SvPVX(sv), name))
273 return 0; /* don't clone from inactive stack frame */
277 oldpad = (AV*)AvARRAY(curlist)[depth];
278 oldsv = *av_fetch(oldpad, off, TRUE);
279 if (!newoff) { /* Not a mere clone operation. */
280 newoff = pad_addlex(sv);
281 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
282 /* "It's closures all the way down." */
283 CvCLONE_on(PL_compcv);
285 if (CvANON(PL_compcv))
286 oldsv = Nullsv; /* no need to keep ref */
291 bcv && bcv != cv && !CvCLONE(bcv);
292 bcv = CvOUTSIDE(bcv))
295 /* install the missing pad entry in intervening
296 * nested subs and mark them cloneable.
297 * XXX fix pad_foo() to not use globals */
298 AV *ocomppad_name = PL_comppad_name;
299 AV *ocomppad = PL_comppad;
300 SV **ocurpad = PL_curpad;
301 AV *padlist = CvPADLIST(bcv);
302 PL_comppad_name = (AV*)AvARRAY(padlist)[0];
303 PL_comppad = (AV*)AvARRAY(padlist)[1];
304 PL_curpad = AvARRAY(PL_comppad);
306 PL_comppad_name = ocomppad_name;
307 PL_comppad = ocomppad;
312 if (ckWARN(WARN_CLOSURE)
313 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
315 Perl_warner(aTHX_ WARN_CLOSURE,
316 "Variable \"%s\" may be unavailable",
324 else if (!CvUNIQUE(PL_compcv)) {
325 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv)
326 && !(SvFLAGS(sv) & SVpad_OUR))
328 Perl_warner(aTHX_ WARN_CLOSURE,
329 "Variable \"%s\" will not stay shared", name);
333 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
339 if (flags & FINDLEX_NOSEARCH)
342 /* Nothing in current lexical context--try eval's context, if any.
343 * This is necessary to let the perldb get at lexically scoped variables.
344 * XXX This will also probably interact badly with eval tree caching.
347 for (i = cx_ix; i >= 0; i--) {
349 switch (CxTYPE(cx)) {
351 if (i == 0 && saweval) {
352 seq = cxstack[saweval].blk_oldcop->cop_seq;
353 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
357 switch (cx->blk_eval.old_op_type) {
364 /* require/do must have their own scope */
373 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
374 saweval = i; /* so we know where we were called from */
377 seq = cxstack[saweval].blk_oldcop->cop_seq;
378 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
386 Perl_pad_findmy(pTHX_ char *name)
392 SV **svp = AvARRAY(PL_comppad_name);
393 U32 seq = PL_cop_seqmax;
399 * Special case to get lexical (and hence per-thread) @_.
400 * XXX I need to find out how to tell at parse-time whether use
401 * of @_ should refer to a lexical (from a sub) or defgv (global
402 * scope and maybe weird sub-ish things like formats). See
403 * startsub in perly.y. It's possible that @_ could be lexical
404 * (at least from subs) even in non-threaded perl.
406 if (strEQ(name, "@_"))
407 return 0; /* success. (NOT_IN_PAD indicates failure) */
408 #endif /* USE_THREADS */
410 /* The one we're looking for is probably just before comppad_name_fill. */
411 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
412 if ((sv = svp[off]) &&
413 sv != &PL_sv_undef &&
416 seq > I_32(SvNVX(sv)))) &&
417 strEQ(SvPVX(sv), name))
419 if (SvIVX(sv) || SvFLAGS(sv) & SVpad_OUR)
420 return (PADOFFSET)off;
421 pendoff = off; /* this pending def. will override import */
425 outside = CvOUTSIDE(PL_compcv);
427 /* Check if if we're compiling an eval'', and adjust seq to be the
428 * eval's seq number. This depends on eval'' having a non-null
429 * CvOUTSIDE() while it is being compiled. The eval'' itself is
430 * identified by CvEVAL being true and CvGV being null. */
431 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
432 cx = &cxstack[cxstack_ix];
434 seq = cx->blk_oldcop->cop_seq;
437 /* See if it's in a nested scope */
438 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
440 /* If there is a pending local definition, this new alias must die */
442 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
443 return off; /* pad_findlex returns 0 for failure...*/
445 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
449 Perl_pad_leavemy(pTHX_ I32 fill)
453 SV **svp = AvARRAY(PL_comppad_name);
455 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
456 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
457 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
458 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
461 /* "Deintroduce" my variables that are leaving with this scope. */
462 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
463 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
464 SvIVX(sv) = PL_cop_seqmax;
469 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
475 if (AvARRAY(PL_comppad) != PL_curpad)
476 Perl_croak(aTHX_ "panic: pad_alloc");
477 if (PL_pad_reset_pending)
479 if (tmptype & SVs_PADMY) {
481 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
482 } while (SvPADBUSY(sv)); /* need a fresh one */
483 retval = AvFILLp(PL_comppad);
486 SV **names = AvARRAY(PL_comppad_name);
487 SSize_t names_fill = AvFILLp(PL_comppad_name);
490 * "foreach" index vars temporarily become aliases to non-"my"
491 * values. Thus we must skip, not just pad values that are
492 * marked as current pad values, but also those with names.
494 if (++PL_padix <= names_fill &&
495 (sv = names[PL_padix]) && sv != &PL_sv_undef)
497 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
498 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)) &&
499 !IS_PADGV(sv) && !IS_PADCONST(sv))
504 SvFLAGS(sv) |= tmptype;
505 PL_curpad = AvARRAY(PL_comppad);
507 DEBUG_X(PerlIO_printf(Perl_debug_log,
508 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
509 PTR2UV(thr), PTR2UV(PL_curpad),
510 (long) retval, PL_op_name[optype]));
512 DEBUG_X(PerlIO_printf(Perl_debug_log,
513 "Pad 0x%"UVxf" alloc %ld for %s\n",
515 (long) retval, PL_op_name[optype]));
516 #endif /* USE_THREADS */
517 return (PADOFFSET)retval;
521 Perl_pad_sv(pTHX_ PADOFFSET po)
525 DEBUG_X(PerlIO_printf(Perl_debug_log,
526 "0x%"UVxf" Pad 0x%"UVxf" sv %"IVdf"\n",
527 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
530 Perl_croak(aTHX_ "panic: pad_sv po");
531 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %"IVdf"\n",
532 PTR2UV(PL_curpad), (IV)po));
533 #endif /* USE_THREADS */
534 return PL_curpad[po]; /* eventually we'll turn this into a macro */
538 Perl_pad_free(pTHX_ PADOFFSET po)
543 if (AvARRAY(PL_comppad) != PL_curpad)
544 Perl_croak(aTHX_ "panic: pad_free curpad");
546 Perl_croak(aTHX_ "panic: pad_free po");
548 DEBUG_X(PerlIO_printf(Perl_debug_log,
549 "0x%"UVxf" Pad 0x%"UVxf" free %"IVdf"\n",
550 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
552 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %"IVdf"\n",
553 PTR2UV(PL_curpad), (IV)po));
554 #endif /* USE_THREADS */
555 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
556 SvPADTMP_off(PL_curpad[po]);
558 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
561 if ((I32)po < PL_padix)
566 Perl_pad_swipe(pTHX_ PADOFFSET po)
569 if (AvARRAY(PL_comppad) != PL_curpad)
570 Perl_croak(aTHX_ "panic: pad_swipe curpad");
572 Perl_croak(aTHX_ "panic: pad_swipe po");
574 DEBUG_X(PerlIO_printf(Perl_debug_log,
575 "0x%"UVxf" Pad 0x%"UVxf" swipe %"IVdf"\n",
576 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
578 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %"IVdf"\n",
579 PTR2UV(PL_curpad), (IV)po));
580 #endif /* USE_THREADS */
581 SvPADTMP_off(PL_curpad[po]);
582 PL_curpad[po] = NEWSV(1107,0);
583 SvPADTMP_on(PL_curpad[po]);
584 if ((I32)po < PL_padix)
588 /* XXX pad_reset() is currently disabled because it results in serious bugs.
589 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
590 * on the stack by OPs that use them, there are several ways to get an alias
591 * to a shared TARG. Such an alias will change randomly and unpredictably.
592 * We avoid doing this until we can think of a Better Way.
597 #ifdef USE_BROKEN_PAD_RESET
601 if (AvARRAY(PL_comppad) != PL_curpad)
602 Perl_croak(aTHX_ "panic: pad_reset curpad");
604 DEBUG_X(PerlIO_printf(Perl_debug_log,
605 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
606 PTR2UV(thr), PTR2UV(PL_curpad)));
608 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
610 #endif /* USE_THREADS */
611 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
612 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
613 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
614 SvPADTMP_off(PL_curpad[po]);
616 PL_padix = PL_padix_floor;
619 PL_pad_reset_pending = FALSE;
623 /* find_threadsv is not reentrant */
625 Perl_find_threadsv(pTHX_ const char *name)
631 /* We currently only handle names of a single character */
632 p = strchr(PL_threadsv_names, *name);
635 key = p - PL_threadsv_names;
636 MUTEX_LOCK(&thr->mutex);
637 svp = av_fetch(thr->threadsv, key, FALSE);
639 MUTEX_UNLOCK(&thr->mutex);
641 SV *sv = NEWSV(0, 0);
642 av_store(thr->threadsv, key, sv);
643 thr->threadsvp = AvARRAY(thr->threadsv);
644 MUTEX_UNLOCK(&thr->mutex);
646 * Some magic variables used to be automagically initialised
647 * in gv_fetchpv. Those which are now per-thread magicals get
648 * initialised here instead.
654 sv_setpv(sv, "\034");
655 sv_magic(sv, 0, 0, name, 1);
660 PL_sawampersand = TRUE;
674 /* XXX %! tied to Errno.pm needs to be added here.
675 * See gv_fetchpv(). */
679 sv_magic(sv, 0, 0, name, 1);
681 DEBUG_S(PerlIO_printf(Perl_error_log,
682 "find_threadsv: new SV %p for $%s%c\n",
683 sv, (*name < 32) ? "^" : "",
684 (*name < 32) ? toCTRL(*name) : *name));
688 #endif /* USE_THREADS */
693 Perl_op_free(pTHX_ OP *o)
695 register OP *kid, *nextkid;
698 if (!o || o->op_seq == (U16)-1)
701 if (o->op_private & OPpREFCOUNTED) {
702 switch (o->op_type) {
710 if (OpREFCNT_dec(o)) {
721 if (o->op_flags & OPf_KIDS) {
722 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
723 nextkid = kid->op_sibling; /* Get before next freeing kid */
731 /* COP* is not cleared by op_clear() so that we may track line
732 * numbers etc even after null() */
733 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
738 #ifdef PL_OP_SLAB_ALLOC
739 if ((char *) o == PL_OpPtr)
748 S_op_clear(pTHX_ OP *o)
750 switch (o->op_type) {
751 case OP_NULL: /* Was holding old type, if any. */
752 case OP_ENTEREVAL: /* Was holding hints. */
754 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
760 if (!(o->op_flags & OPf_SPECIAL))
763 #endif /* USE_THREADS */
765 if (!(o->op_flags & OPf_REF)
766 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
773 if (cPADOPo->op_padix > 0) {
776 pad_swipe(cPADOPo->op_padix);
777 /* No GvIN_PAD_off(gv) here, because other references may still
778 * exist on the pad */
781 cPADOPo->op_padix = 0;
784 SvREFCNT_dec(cSVOPo->op_sv);
785 cSVOPo->op_sv = Nullsv;
788 case OP_METHOD_NAMED:
790 SvREFCNT_dec(cSVOPo->op_sv);
791 cSVOPo->op_sv = Nullsv;
797 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
801 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
802 SvREFCNT_dec(cSVOPo->op_sv);
803 cSVOPo->op_sv = Nullsv;
806 Safefree(cPVOPo->op_pv);
807 cPVOPo->op_pv = Nullch;
811 op_free(cPMOPo->op_pmreplroot);
815 if ((PADOFFSET)cPMOPo->op_pmreplroot) {
817 GV *gv = (GV*)PL_curpad[(PADOFFSET)cPMOPo->op_pmreplroot];
818 pad_swipe((PADOFFSET)cPMOPo->op_pmreplroot);
819 /* No GvIN_PAD_off(gv) here, because other references may still
820 * exist on the pad */
825 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
831 cPMOPo->op_pmreplroot = Nullop;
832 ReREFCNT_dec(cPMOPo->op_pmregexp);
833 cPMOPo->op_pmregexp = (REGEXP*)NULL;
837 if (o->op_targ > 0) {
838 pad_free(o->op_targ);
844 S_cop_free(pTHX_ COP* cop)
846 Safefree(cop->cop_label);
848 Safefree(CopFILE(cop)); /* XXX share in a pvtable? */
849 Safefree(CopSTASHPV(cop)); /* XXX share in a pvtable? */
851 /* NOTE: COP.cop_stash is not refcounted */
852 SvREFCNT_dec(CopFILEGV(cop));
854 if (! specialWARN(cop->cop_warnings))
855 SvREFCNT_dec(cop->cop_warnings);
861 if (o->op_type == OP_NULL)
864 o->op_targ = o->op_type;
865 o->op_type = OP_NULL;
866 o->op_ppaddr = PL_ppaddr[OP_NULL];
869 /* Contextualizers */
871 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
874 Perl_linklist(pTHX_ OP *o)
881 /* establish postfix order */
882 if (cUNOPo->op_first) {
883 o->op_next = LINKLIST(cUNOPo->op_first);
884 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
886 kid->op_next = LINKLIST(kid->op_sibling);
898 Perl_scalarkids(pTHX_ OP *o)
901 if (o && o->op_flags & OPf_KIDS) {
902 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
909 S_scalarboolean(pTHX_ OP *o)
911 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
913 if (ckWARN(WARN_SYNTAX)) {
914 line_t oldline = CopLINE(PL_curcop);
916 if (PL_copline != NOLINE)
917 CopLINE_set(PL_curcop, PL_copline);
918 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
919 CopLINE_set(PL_curcop, oldline);
926 Perl_scalar(pTHX_ OP *o)
930 /* assumes no premature commitment */
931 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
932 || o->op_type == OP_RETURN)
937 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
939 switch (o->op_type) {
941 if (o->op_private & OPpREPEAT_DOLIST)
942 null(((LISTOP*)cBINOPo->op_first)->op_first);
943 scalar(cBINOPo->op_first);
948 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
952 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
953 if (!kPMOP->op_pmreplroot)
954 deprecate("implicit split to @_");
962 if (o->op_flags & OPf_KIDS) {
963 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
969 kid = cLISTOPo->op_first;
971 while ((kid = kid->op_sibling)) {
977 WITH_THR(PL_curcop = &PL_compiling);
982 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
988 WITH_THR(PL_curcop = &PL_compiling);
995 Perl_scalarvoid(pTHX_ OP *o)
1002 if (o->op_type == OP_NEXTSTATE
1003 || o->op_type == OP_SETSTATE
1004 || o->op_type == OP_DBSTATE
1005 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1006 || o->op_targ == OP_SETSTATE
1007 || o->op_targ == OP_DBSTATE)))
1010 PL_curcop = (COP*)o; /* for warning below */
1013 /* assumes no premature commitment */
1014 want = o->op_flags & OPf_WANT;
1015 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
1016 || o->op_type == OP_RETURN)
1021 if ((o->op_private & OPpTARGET_MY)
1022 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1024 return scalar(o); /* As if inside SASSIGN */
1027 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1029 switch (o->op_type) {
1031 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1035 if (o->op_flags & OPf_STACKED)
1039 if (o->op_private == 4)
1081 case OP_GETSOCKNAME:
1082 case OP_GETPEERNAME:
1087 case OP_GETPRIORITY:
1110 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1111 useless = PL_op_desc[o->op_type];
1118 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1119 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1120 useless = "a variable";
1125 if (cSVOPo->op_private & OPpCONST_STRICT)
1126 no_bareword_allowed(o);
1129 if (ckWARN(WARN_VOID)) {
1130 useless = "a constant";
1131 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1133 else if (SvPOK(sv)) {
1134 if (strnEQ(SvPVX(sv), "di", 2) ||
1135 strnEQ(SvPVX(sv), "ds", 2) ||
1136 strnEQ(SvPVX(sv), "ig", 2))
1141 null(o); /* don't execute or even remember it */
1145 o->op_type = OP_PREINC; /* pre-increment is faster */
1146 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1150 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1151 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1157 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1162 if (o->op_flags & OPf_STACKED)
1169 if (!(o->op_flags & OPf_KIDS))
1178 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1185 /* all requires must return a boolean value */
1186 o->op_flags &= ~OPf_WANT;
1191 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1192 if (!kPMOP->op_pmreplroot)
1193 deprecate("implicit split to @_");
1199 if (ckWARN(WARN_VOID))
1200 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1206 Perl_listkids(pTHX_ OP *o)
1209 if (o && o->op_flags & OPf_KIDS) {
1210 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1217 Perl_list(pTHX_ OP *o)
1221 /* assumes no premature commitment */
1222 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1223 || o->op_type == OP_RETURN)
1228 if ((o->op_private & OPpTARGET_MY)
1229 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1231 return o; /* As if inside SASSIGN */
1234 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1236 switch (o->op_type) {
1239 list(cBINOPo->op_first);
1244 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1252 if (!(o->op_flags & OPf_KIDS))
1254 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1255 list(cBINOPo->op_first);
1256 return gen_constant_list(o);
1263 kid = cLISTOPo->op_first;
1265 while ((kid = kid->op_sibling)) {
1266 if (kid->op_sibling)
1271 WITH_THR(PL_curcop = &PL_compiling);
1275 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1276 if (kid->op_sibling)
1281 WITH_THR(PL_curcop = &PL_compiling);
1284 /* all requires must return a boolean value */
1285 o->op_flags &= ~OPf_WANT;
1292 Perl_scalarseq(pTHX_ OP *o)
1297 if (o->op_type == OP_LINESEQ ||
1298 o->op_type == OP_SCOPE ||
1299 o->op_type == OP_LEAVE ||
1300 o->op_type == OP_LEAVETRY)
1303 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1304 if (kid->op_sibling) {
1308 PL_curcop = &PL_compiling;
1310 o->op_flags &= ~OPf_PARENS;
1311 if (PL_hints & HINT_BLOCK_SCOPE)
1312 o->op_flags |= OPf_PARENS;
1315 o = newOP(OP_STUB, 0);
1320 S_modkids(pTHX_ OP *o, I32 type)
1323 if (o && o->op_flags & OPf_KIDS) {
1324 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1331 Perl_mod(pTHX_ OP *o, I32 type)
1337 if (!o || PL_error_count)
1340 if ((o->op_private & OPpTARGET_MY)
1341 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1346 switch (o->op_type) {
1351 if (!(o->op_private & (OPpCONST_ARYBASE)))
1353 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1354 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1358 SAVEI32(PL_compiling.cop_arybase);
1359 PL_compiling.cop_arybase = 0;
1361 else if (type == OP_REFGEN)
1364 Perl_croak(aTHX_ "That use of $[ is unsupported");
1367 if (o->op_flags & OPf_PARENS)
1371 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1372 !(o->op_flags & OPf_STACKED)) {
1373 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1374 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1375 assert(cUNOPo->op_first->op_type == OP_NULL);
1376 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1379 else { /* lvalue subroutine call */
1380 o->op_private |= OPpLVAL_INTRO;
1381 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1382 /* Backward compatibility mode: */
1383 o->op_private |= OPpENTERSUB_INARGS;
1386 else { /* Compile-time error message: */
1387 OP *kid = cUNOPo->op_first;
1391 if (kid->op_type == OP_PUSHMARK)
1393 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1395 "panic: unexpected lvalue entersub "
1396 "args: type/targ %ld:%ld",
1397 (long)kid->op_type,kid->op_targ);
1398 kid = kLISTOP->op_first;
1400 while (kid->op_sibling)
1401 kid = kid->op_sibling;
1402 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1404 if (kid->op_type == OP_METHOD_NAMED
1405 || kid->op_type == OP_METHOD)
1409 if (kid->op_sibling || kid->op_next != kid) {
1410 yyerror("panic: unexpected optree near method call");
1414 NewOp(1101, newop, 1, UNOP);
1415 newop->op_type = OP_RV2CV;
1416 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1417 newop->op_first = Nullop;
1418 newop->op_next = (OP*)newop;
1419 kid->op_sibling = (OP*)newop;
1420 newop->op_private |= OPpLVAL_INTRO;
1424 if (kid->op_type != OP_RV2CV)
1426 "panic: unexpected lvalue entersub "
1427 "entry via type/targ %ld:%ld",
1428 (long)kid->op_type,kid->op_targ);
1429 kid->op_private |= OPpLVAL_INTRO;
1430 break; /* Postpone until runtime */
1434 kid = kUNOP->op_first;
1435 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1436 kid = kUNOP->op_first;
1437 if (kid->op_type == OP_NULL)
1439 "Unexpected constant lvalue entersub "
1440 "entry via type/targ %ld:%ld",
1441 (long)kid->op_type,kid->op_targ);
1442 if (kid->op_type != OP_GV) {
1443 /* Restore RV2CV to check lvalueness */
1445 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1446 okid->op_next = kid->op_next;
1447 kid->op_next = okid;
1450 okid->op_next = Nullop;
1451 okid->op_type = OP_RV2CV;
1453 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1454 okid->op_private |= OPpLVAL_INTRO;
1458 cv = GvCV(kGVOP_gv);
1468 /* grep, foreach, subcalls, refgen */
1469 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1471 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1472 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1474 : (o->op_type == OP_ENTERSUB
1475 ? "non-lvalue subroutine call"
1476 : PL_op_desc[o->op_type])),
1477 type ? PL_op_desc[type] : "local"));
1491 case OP_RIGHT_SHIFT:
1500 if (!(o->op_flags & OPf_STACKED))
1506 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1512 if (!type && cUNOPo->op_first->op_type != OP_GV)
1513 Perl_croak(aTHX_ "Can't localize through a reference");
1514 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1515 PL_modcount = 10000;
1516 return o; /* Treat \(@foo) like ordinary list. */
1520 if (scalar_mod_type(o, type))
1522 ref(cUNOPo->op_first, o->op_type);
1531 PL_modcount = 10000;
1534 if (!type && cUNOPo->op_first->op_type != OP_GV)
1535 Perl_croak(aTHX_ "Can't localize through a reference");
1536 ref(cUNOPo->op_first, o->op_type);
1540 PL_hints |= HINT_BLOCK_SCOPE;
1550 PL_modcount = 10000;
1551 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1552 return o; /* Treat \(@foo) like ordinary list. */
1553 if (scalar_mod_type(o, type))
1559 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1560 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1565 PL_modcount++; /* XXX ??? */
1567 #endif /* USE_THREADS */
1573 if (type != OP_SASSIGN)
1577 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1583 pad_free(o->op_targ);
1584 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1585 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1586 if (o->op_flags & OPf_KIDS)
1587 mod(cBINOPo->op_first->op_sibling, type);
1592 ref(cBINOPo->op_first, o->op_type);
1593 if (type == OP_ENTERSUB &&
1594 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1595 o->op_private |= OPpLVAL_DEFER;
1602 if (o->op_flags & OPf_KIDS)
1603 mod(cLISTOPo->op_last, type);
1607 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1609 else if (!(o->op_flags & OPf_KIDS))
1611 if (o->op_targ != OP_LIST) {
1612 mod(cBINOPo->op_first, type);
1617 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1621 o->op_flags |= OPf_MOD;
1623 if (type == OP_AASSIGN || type == OP_SASSIGN)
1624 o->op_flags |= OPf_SPECIAL|OPf_REF;
1626 o->op_private |= OPpLVAL_INTRO;
1627 o->op_flags &= ~OPf_SPECIAL;
1628 PL_hints |= HINT_BLOCK_SCOPE;
1630 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1631 o->op_flags |= OPf_REF;
1636 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1640 if (o->op_type == OP_RV2GV)
1664 case OP_RIGHT_SHIFT:
1683 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1685 switch (o->op_type) {
1693 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1706 Perl_refkids(pTHX_ OP *o, I32 type)
1709 if (o && o->op_flags & OPf_KIDS) {
1710 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1717 Perl_ref(pTHX_ OP *o, I32 type)
1721 if (!o || PL_error_count)
1724 switch (o->op_type) {
1726 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1727 !(o->op_flags & OPf_STACKED)) {
1728 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1729 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1730 assert(cUNOPo->op_first->op_type == OP_NULL);
1731 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1732 o->op_flags |= OPf_SPECIAL;
1737 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1741 if (type == OP_DEFINED)
1742 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1743 ref(cUNOPo->op_first, o->op_type);
1746 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1747 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1748 : type == OP_RV2HV ? OPpDEREF_HV
1750 o->op_flags |= OPf_MOD;
1755 o->op_flags |= OPf_MOD; /* XXX ??? */
1760 o->op_flags |= OPf_REF;
1763 if (type == OP_DEFINED)
1764 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1765 ref(cUNOPo->op_first, o->op_type);
1770 o->op_flags |= OPf_REF;
1775 if (!(o->op_flags & OPf_KIDS))
1777 ref(cBINOPo->op_first, type);
1781 ref(cBINOPo->op_first, o->op_type);
1782 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1783 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1784 : type == OP_RV2HV ? OPpDEREF_HV
1786 o->op_flags |= OPf_MOD;
1794 if (!(o->op_flags & OPf_KIDS))
1796 ref(cLISTOPo->op_last, type);
1806 S_dup_attrlist(pTHX_ OP *o)
1810 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1811 * where the first kid is OP_PUSHMARK and the remaining ones
1812 * are OP_CONST. We need to push the OP_CONST values.
1814 if (o->op_type == OP_CONST)
1815 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1817 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1818 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1819 if (o->op_type == OP_CONST)
1820 rop = append_elem(OP_LIST, rop,
1821 newSVOP(OP_CONST, o->op_flags,
1822 SvREFCNT_inc(cSVOPo->op_sv)));
1829 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1833 /* fake up C<use attributes $pkg,$rv,@attrs> */
1834 ENTER; /* need to protect against side-effects of 'use' */
1836 if (stash && HvNAME(stash))
1837 stashsv = newSVpv(HvNAME(stash), 0);
1839 stashsv = &PL_sv_no;
1841 #define ATTRSMODULE "attributes"
1843 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1844 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1846 prepend_elem(OP_LIST,
1847 newSVOP(OP_CONST, 0, stashsv),
1848 prepend_elem(OP_LIST,
1849 newSVOP(OP_CONST, 0,
1851 dup_attrlist(attrs))));
1856 Perl_apply_attrs_string(pTHX_ char *stashpv, CV *cv,
1857 char *attrstr, STRLEN len)
1862 len = strlen(attrstr);
1866 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
1868 char *sstr = attrstr;
1869 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
1870 attrs = append_elem(OP_LIST, attrs,
1871 newSVOP(OP_CONST, 0,
1872 newSVpvn(sstr, attrstr-sstr)));
1876 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1877 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1878 Nullsv, prepend_elem(OP_LIST,
1879 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
1880 prepend_elem(OP_LIST,
1881 newSVOP(OP_CONST, 0,
1887 S_my_kid(pTHX_ OP *o, OP *attrs)
1892 if (!o || PL_error_count)
1896 if (type == OP_LIST) {
1897 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1899 } else if (type == OP_UNDEF) {
1901 } else if (type == OP_RV2SV || /* "our" declaration */
1903 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1904 o->op_private |= OPpOUR_INTRO;
1906 } else if (type != OP_PADSV &&
1909 type != OP_PUSHMARK)
1911 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1912 PL_op_desc[o->op_type],
1913 PL_in_my == KEY_our ? "our" : "my"));
1916 else if (attrs && type != OP_PUSHMARK) {
1922 PL_in_my_stash = Nullhv;
1924 /* check for C<my Dog $spot> when deciding package */
1925 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1926 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1927 stash = SvSTASH(*namesvp);
1929 stash = PL_curstash;
1930 padsv = PAD_SV(o->op_targ);
1931 apply_attrs(stash, padsv, attrs);
1933 o->op_flags |= OPf_MOD;
1934 o->op_private |= OPpLVAL_INTRO;
1939 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1941 if (o->op_flags & OPf_PARENS)
1945 o = my_kid(o, attrs);
1947 PL_in_my_stash = Nullhv;
1952 Perl_my(pTHX_ OP *o)
1954 return my_kid(o, Nullop);
1958 Perl_sawparens(pTHX_ OP *o)
1961 o->op_flags |= OPf_PARENS;
1966 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1971 if (ckWARN(WARN_MISC) &&
1972 (left->op_type == OP_RV2AV ||
1973 left->op_type == OP_RV2HV ||
1974 left->op_type == OP_PADAV ||
1975 left->op_type == OP_PADHV)) {
1976 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1977 right->op_type == OP_TRANS)
1978 ? right->op_type : OP_MATCH];
1979 const char *sample = ((left->op_type == OP_RV2AV ||
1980 left->op_type == OP_PADAV)
1981 ? "@array" : "%hash");
1982 Perl_warner(aTHX_ WARN_MISC,
1983 "Applying %s to %s will act on scalar(%s)",
1984 desc, sample, sample);
1987 if (!(right->op_flags & OPf_STACKED) &&
1988 (right->op_type == OP_MATCH ||
1989 right->op_type == OP_SUBST ||
1990 right->op_type == OP_TRANS)) {
1991 right->op_flags |= OPf_STACKED;
1992 if (right->op_type != OP_MATCH &&
1993 ! (right->op_type == OP_TRANS &&
1994 right->op_private & OPpTRANS_IDENTICAL))
1995 left = mod(left, right->op_type);
1996 if (right->op_type == OP_TRANS)
1997 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1999 o = prepend_elem(right->op_type, scalar(left), right);
2001 return newUNOP(OP_NOT, 0, scalar(o));
2005 return bind_match(type, left,
2006 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
2010 Perl_invert(pTHX_ OP *o)
2014 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
2015 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2019 Perl_scope(pTHX_ OP *o)
2022 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2023 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2024 o->op_type = OP_LEAVE;
2025 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2028 if (o->op_type == OP_LINESEQ) {
2030 o->op_type = OP_SCOPE;
2031 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2032 kid = ((LISTOP*)o)->op_first;
2033 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2037 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
2044 Perl_save_hints(pTHX)
2047 SAVESPTR(GvHV(PL_hintgv));
2048 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
2049 SAVEFREESV(GvHV(PL_hintgv));
2053 Perl_block_start(pTHX_ int full)
2056 int retval = PL_savestack_ix;
2058 SAVEI32(PL_comppad_name_floor);
2059 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
2061 PL_comppad_name_fill = PL_comppad_name_floor;
2062 if (PL_comppad_name_floor < 0)
2063 PL_comppad_name_floor = 0;
2064 SAVEI32(PL_min_intro_pending);
2065 SAVEI32(PL_max_intro_pending);
2066 PL_min_intro_pending = 0;
2067 SAVEI32(PL_comppad_name_fill);
2068 SAVEI32(PL_padix_floor);
2069 PL_padix_floor = PL_padix;
2070 PL_pad_reset_pending = FALSE;
2072 PL_hints &= ~HINT_BLOCK_SCOPE;
2073 SAVESPTR(PL_compiling.cop_warnings);
2074 if (! specialWARN(PL_compiling.cop_warnings)) {
2075 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2076 SAVEFREESV(PL_compiling.cop_warnings) ;
2082 Perl_block_end(pTHX_ I32 floor, OP *seq)
2085 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2086 OP* retval = scalarseq(seq);
2088 PL_pad_reset_pending = FALSE;
2089 PL_compiling.op_private = PL_hints;
2091 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2092 pad_leavemy(PL_comppad_name_fill);
2101 OP *o = newOP(OP_THREADSV, 0);
2102 o->op_targ = find_threadsv("_");
2105 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2106 #endif /* USE_THREADS */
2110 Perl_newPROG(pTHX_ OP *o)
2116 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2117 ((PL_in_eval & EVAL_KEEPERR)
2118 ? OPf_SPECIAL : 0), o);
2119 PL_eval_start = linklist(PL_eval_root);
2120 PL_eval_root->op_private |= OPpREFCOUNTED;
2121 OpREFCNT_set(PL_eval_root, 1);
2122 PL_eval_root->op_next = 0;
2123 peep(PL_eval_start);
2128 PL_main_root = scope(sawparens(scalarvoid(o)));
2129 PL_curcop = &PL_compiling;
2130 PL_main_start = LINKLIST(PL_main_root);
2131 PL_main_root->op_private |= OPpREFCOUNTED;
2132 OpREFCNT_set(PL_main_root, 1);
2133 PL_main_root->op_next = 0;
2134 peep(PL_main_start);
2137 /* Register with debugger */
2139 CV *cv = get_cv("DB::postponed", FALSE);
2143 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2145 call_sv((SV*)cv, G_DISCARD);
2152 Perl_localize(pTHX_ OP *o, I32 lex)
2154 if (o->op_flags & OPf_PARENS)
2158 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2160 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2161 if (*s == ';' || *s == '=')
2162 Perl_warner(aTHX_ WARN_PARENTHESIS,
2163 "Parentheses missing around \"%s\" list",
2164 lex ? (PL_in_my == KEY_our ? "our" : "my") : "local");
2170 o = mod(o, OP_NULL); /* a bit kludgey */
2172 PL_in_my_stash = Nullhv;
2177 Perl_jmaybe(pTHX_ OP *o)
2179 if (o->op_type == OP_LIST) {
2182 o2 = newOP(OP_THREADSV, 0);
2183 o2->op_targ = find_threadsv(";");
2185 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2186 #endif /* USE_THREADS */
2187 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2193 Perl_fold_constants(pTHX_ register OP *o)
2197 I32 type = o->op_type;
2200 if (PL_opargs[type] & OA_RETSCALAR)
2202 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2203 o->op_targ = pad_alloc(type, SVs_PADTMP);
2205 /* integerize op, unless it happens to be C<-foo>.
2206 * XXX should pp_i_negate() do magic string negation instead? */
2207 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2208 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2209 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2211 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2214 if (!(PL_opargs[type] & OA_FOLDCONST))
2219 /* XXX might want a ck_negate() for this */
2220 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2233 if (o->op_private & OPpLOCALE)
2238 goto nope; /* Don't try to run w/ errors */
2240 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2241 if ((curop->op_type != OP_CONST ||
2242 (curop->op_private & OPpCONST_BARE)) &&
2243 curop->op_type != OP_LIST &&
2244 curop->op_type != OP_SCALAR &&
2245 curop->op_type != OP_NULL &&
2246 curop->op_type != OP_PUSHMARK)
2252 curop = LINKLIST(o);
2256 sv = *(PL_stack_sp--);
2257 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2258 pad_swipe(o->op_targ);
2259 else if (SvTEMP(sv)) { /* grab mortal temp? */
2260 (void)SvREFCNT_inc(sv);
2264 if (type == OP_RV2GV)
2265 return newGVOP(OP_GV, 0, (GV*)sv);
2267 /* try to smush double to int, but don't smush -2.0 to -2 */
2268 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2272 if ((NV)iv == SvNV(sv)) {
2277 SvIOK_off(sv); /* undo SvIV() damage */
2279 return newSVOP(OP_CONST, 0, sv);
2283 if (!(PL_opargs[type] & OA_OTHERINT))
2286 if (!(PL_hints & HINT_INTEGER)) {
2287 if (type == OP_MODULO
2288 || type == OP_DIVIDE
2289 || !(o->op_flags & OPf_KIDS))
2294 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2295 if (curop->op_type == OP_CONST) {
2296 if (SvIOK(((SVOP*)curop)->op_sv))
2300 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2304 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2311 Perl_gen_constant_list(pTHX_ register OP *o)
2315 I32 oldtmps_floor = PL_tmps_floor;
2319 return o; /* Don't attempt to run with errors */
2321 PL_op = curop = LINKLIST(o);
2328 PL_tmps_floor = oldtmps_floor;
2330 o->op_type = OP_RV2AV;
2331 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2332 curop = ((UNOP*)o)->op_first;
2333 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2340 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2345 if (!o || o->op_type != OP_LIST)
2346 o = newLISTOP(OP_LIST, 0, o, Nullop);
2348 o->op_flags &= ~OPf_WANT;
2350 if (!(PL_opargs[type] & OA_MARK))
2351 null(cLISTOPo->op_first);
2354 o->op_ppaddr = PL_ppaddr[type];
2355 o->op_flags |= flags;
2357 o = CHECKOP(type, o);
2358 if (o->op_type != type)
2361 if (cLISTOPo->op_children < 7) {
2362 /* XXX do we really need to do this if we're done appending?? */
2363 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2365 cLISTOPo->op_last = last; /* in case check substituted last arg */
2368 return fold_constants(o);
2371 /* List constructors */
2374 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2382 if (first->op_type != type
2383 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2385 return newLISTOP(type, 0, first, last);
2388 if (first->op_flags & OPf_KIDS)
2389 ((LISTOP*)first)->op_last->op_sibling = last;
2391 first->op_flags |= OPf_KIDS;
2392 ((LISTOP*)first)->op_first = last;
2394 ((LISTOP*)first)->op_last = last;
2395 ((LISTOP*)first)->op_children++;
2400 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2408 if (first->op_type != type)
2409 return prepend_elem(type, (OP*)first, (OP*)last);
2411 if (last->op_type != type)
2412 return append_elem(type, (OP*)first, (OP*)last);
2414 first->op_last->op_sibling = last->op_first;
2415 first->op_last = last->op_last;
2416 first->op_children += last->op_children;
2417 if (first->op_children)
2418 first->op_flags |= OPf_KIDS;
2420 #ifdef PL_OP_SLAB_ALLOC
2428 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2436 if (last->op_type == type) {
2437 if (type == OP_LIST) { /* already a PUSHMARK there */
2438 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2439 ((LISTOP*)last)->op_first->op_sibling = first;
2442 if (!(last->op_flags & OPf_KIDS)) {
2443 ((LISTOP*)last)->op_last = first;
2444 last->op_flags |= OPf_KIDS;
2446 first->op_sibling = ((LISTOP*)last)->op_first;
2447 ((LISTOP*)last)->op_first = first;
2449 ((LISTOP*)last)->op_children++;
2453 return newLISTOP(type, 0, first, last);
2459 Perl_newNULLLIST(pTHX)
2461 return newOP(OP_STUB, 0);
2465 Perl_force_list(pTHX_ OP *o)
2467 if (!o || o->op_type != OP_LIST)
2468 o = newLISTOP(OP_LIST, 0, o, Nullop);
2474 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2478 NewOp(1101, listop, 1, LISTOP);
2480 listop->op_type = type;
2481 listop->op_ppaddr = PL_ppaddr[type];
2482 listop->op_children = (first != 0) + (last != 0);
2483 listop->op_flags = flags;
2487 else if (!first && last)
2490 first->op_sibling = last;
2491 listop->op_first = first;
2492 listop->op_last = last;
2493 if (type == OP_LIST) {
2495 pushop = newOP(OP_PUSHMARK, 0);
2496 pushop->op_sibling = first;
2497 listop->op_first = pushop;
2498 listop->op_flags |= OPf_KIDS;
2500 listop->op_last = pushop;
2502 else if (listop->op_children)
2503 listop->op_flags |= OPf_KIDS;
2509 Perl_newOP(pTHX_ I32 type, I32 flags)
2512 NewOp(1101, o, 1, OP);
2514 o->op_ppaddr = PL_ppaddr[type];
2515 o->op_flags = flags;
2518 o->op_private = 0 + (flags >> 8);
2519 if (PL_opargs[type] & OA_RETSCALAR)
2521 if (PL_opargs[type] & OA_TARGET)
2522 o->op_targ = pad_alloc(type, SVs_PADTMP);
2523 return CHECKOP(type, o);
2527 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2532 first = newOP(OP_STUB, 0);
2533 if (PL_opargs[type] & OA_MARK)
2534 first = force_list(first);
2536 NewOp(1101, unop, 1, UNOP);
2537 unop->op_type = type;
2538 unop->op_ppaddr = PL_ppaddr[type];
2539 unop->op_first = first;
2540 unop->op_flags = flags | OPf_KIDS;
2541 unop->op_private = 1 | (flags >> 8);
2542 unop = (UNOP*) CHECKOP(type, unop);
2546 return fold_constants((OP *) unop);
2550 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2553 NewOp(1101, binop, 1, BINOP);
2556 first = newOP(OP_NULL, 0);
2558 binop->op_type = type;
2559 binop->op_ppaddr = PL_ppaddr[type];
2560 binop->op_first = first;
2561 binop->op_flags = flags | OPf_KIDS;
2564 binop->op_private = 1 | (flags >> 8);
2567 binop->op_private = 2 | (flags >> 8);
2568 first->op_sibling = last;
2571 binop = (BINOP*)CHECKOP(type, binop);
2572 if (binop->op_next || binop->op_type != type)
2575 binop->op_last = binop->op_first->op_sibling;
2577 return fold_constants((OP *)binop);
2581 utf8compare(const void *a, const void *b)
2584 for (i = 0; i < 10; i++) {
2585 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2587 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2594 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2596 SV *tstr = ((SVOP*)expr)->op_sv;
2597 SV *rstr = ((SVOP*)repl)->op_sv;
2600 register U8 *t = (U8*)SvPV(tstr, tlen);
2601 register U8 *r = (U8*)SvPV(rstr, rlen);
2607 register short *tbl;
2609 complement = o->op_private & OPpTRANS_COMPLEMENT;
2610 del = o->op_private & OPpTRANS_DELETE;
2611 squash = o->op_private & OPpTRANS_SQUASH;
2614 o->op_private |= OPpTRANS_FROM_UTF;
2617 o->op_private |= OPpTRANS_TO_UTF;
2619 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2620 SV* listsv = newSVpvn("# comment\n",10);
2622 U8* tend = t + tlen;
2623 U8* rend = r + rlen;
2638 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2639 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2642 U8 tmpbuf[UTF8_MAXLEN];
2645 New(1109, cp, tlen, U8*);
2647 transv = newSVpvn("",0);
2656 qsort(cp, i, sizeof(U8*), utf8compare);
2657 for (j = 0; j < i; j++) {
2659 UV val = utf8_to_uv(s, &ulen, 0);
2661 diff = val - nextmin;
2663 t = uv_to_utf8(tmpbuf,nextmin);
2664 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2666 t = uv_to_utf8(tmpbuf, val - 1);
2667 sv_catpvn(transv, "\377", 1);
2668 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2672 val = utf8_to_uv(s+1, &ulen, 0);
2676 t = uv_to_utf8(tmpbuf,nextmin);
2677 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2678 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2679 sv_catpvn(transv, "\377", 1);
2680 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2681 t = (U8*)SvPVX(transv);
2682 tlen = SvCUR(transv);
2685 else if (!rlen && !del) {
2686 r = t; rlen = tlen; rend = tend;
2690 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
2692 o->op_private |= OPpTRANS_IDENTICAL;
2696 while (t < tend || tfirst <= tlast) {
2697 /* see if we need more "t" chars */
2698 if (tfirst > tlast) {
2699 tfirst = (I32)utf8_to_uv(t, &ulen, 0);
2701 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2702 tlast = (I32)utf8_to_uv(++t, &ulen, 0);
2709 /* now see if we need more "r" chars */
2710 if (rfirst > rlast) {
2712 rfirst = (I32)utf8_to_uv(r, &ulen, 0);
2714 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2715 rlast = (I32)utf8_to_uv(++r, &ulen, 0);
2724 rfirst = rlast = 0xffffffff;
2728 /* now see which range will peter our first, if either. */
2729 tdiff = tlast - tfirst;
2730 rdiff = rlast - rfirst;
2737 if (rfirst == 0xffffffff) {
2738 diff = tdiff; /* oops, pretend rdiff is infinite */
2740 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2741 (long)tfirst, (long)tlast);
2743 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2747 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2748 (long)tfirst, (long)(tfirst + diff),
2751 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2752 (long)tfirst, (long)rfirst);
2754 if (rfirst + diff > max)
2755 max = rfirst + diff;
2760 else if (rfirst <= 0x800)
2761 grows |= (tfirst < 0x80);
2762 else if (rfirst <= 0x10000)
2763 grows |= (tfirst < 0x800);
2764 else if (rfirst <= 0x200000)
2765 grows |= (tfirst < 0x10000);
2766 else if (rfirst <= 0x4000000)
2767 grows |= (tfirst < 0x200000);
2768 else if (rfirst <= 0x80000000)
2769 grows |= (tfirst < 0x4000000);
2781 else if (max > 0xff)
2786 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2787 SvREFCNT_dec(listsv);
2789 SvREFCNT_dec(transv);
2791 if (!del && havefinal)
2792 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
2793 newSVuv((UV)final), 0);
2795 if (grows && to_utf)
2796 o->op_private |= OPpTRANS_GROWS;
2803 tbl = (short*)cPVOPo->op_pv;
2805 Zero(tbl, 256, short);
2806 for (i = 0; i < tlen; i++)
2808 for (i = 0, j = 0; i < 256; i++) {
2824 if (!rlen && !del) {
2827 o->op_private |= OPpTRANS_IDENTICAL;
2829 for (i = 0; i < 256; i++)
2831 for (i = 0, j = 0; i < tlen; i++,j++) {
2834 if (tbl[t[i]] == -1)
2840 if (tbl[t[i]] == -1)
2851 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2856 NewOp(1101, pmop, 1, PMOP);
2857 pmop->op_type = type;
2858 pmop->op_ppaddr = PL_ppaddr[type];
2859 pmop->op_flags = flags;
2860 pmop->op_private = 0 | (flags >> 8);
2862 if (PL_hints & HINT_RE_TAINT)
2863 pmop->op_pmpermflags |= PMf_RETAINT;
2864 if (PL_hints & HINT_LOCALE)
2865 pmop->op_pmpermflags |= PMf_LOCALE;
2866 pmop->op_pmflags = pmop->op_pmpermflags;
2868 /* link into pm list */
2869 if (type != OP_TRANS && PL_curstash) {
2870 pmop->op_pmnext = HvPMROOT(PL_curstash);
2871 HvPMROOT(PL_curstash) = pmop;
2878 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2883 I32 repl_has_vars = 0;
2885 if (o->op_type == OP_TRANS)
2886 return pmtrans(o, expr, repl);
2888 PL_hints |= HINT_BLOCK_SCOPE;
2891 if (expr->op_type == OP_CONST) {
2893 SV *pat = ((SVOP*)expr)->op_sv;
2894 char *p = SvPV(pat, plen);
2895 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2896 sv_setpvn(pat, "\\s+", 3);
2897 p = SvPV(pat, plen);
2898 pm->op_pmflags |= PMf_SKIPWHITE;
2900 if ((PL_hints & HINT_UTF8) || (SvUTF8(pat) && !(PL_hints & HINT_BYTE)))
2901 pm->op_pmdynflags |= PMdf_UTF8;
2902 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2903 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2904 pm->op_pmflags |= PMf_WHITE;
2908 if (PL_hints & HINT_UTF8)
2909 pm->op_pmdynflags |= PMdf_UTF8;
2910 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2911 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2913 : OP_REGCMAYBE),0,expr);
2915 NewOp(1101, rcop, 1, LOGOP);
2916 rcop->op_type = OP_REGCOMP;
2917 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2918 rcop->op_first = scalar(expr);
2919 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2920 ? (OPf_SPECIAL | OPf_KIDS)
2922 rcop->op_private = 1;
2925 /* establish postfix order */
2926 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2928 rcop->op_next = expr;
2929 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2932 rcop->op_next = LINKLIST(expr);
2933 expr->op_next = (OP*)rcop;
2936 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2941 if (pm->op_pmflags & PMf_EVAL) {
2943 if (CopLINE(PL_curcop) < PL_multi_end)
2944 CopLINE_set(PL_curcop, PL_multi_end);
2947 else if (repl->op_type == OP_THREADSV
2948 && strchr("&`'123456789+",
2949 PL_threadsv_names[repl->op_targ]))
2953 #endif /* USE_THREADS */
2954 else if (repl->op_type == OP_CONST)
2958 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2959 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2961 if (curop->op_type == OP_THREADSV) {
2963 if (strchr("&`'123456789+", curop->op_private))
2967 if (curop->op_type == OP_GV) {
2968 GV *gv = cGVOPx_gv(curop);
2970 if (strchr("&`'123456789+", *GvENAME(gv)))
2973 #endif /* USE_THREADS */
2974 else if (curop->op_type == OP_RV2CV)
2976 else if (curop->op_type == OP_RV2SV ||
2977 curop->op_type == OP_RV2AV ||
2978 curop->op_type == OP_RV2HV ||
2979 curop->op_type == OP_RV2GV) {
2980 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2983 else if (curop->op_type == OP_PADSV ||
2984 curop->op_type == OP_PADAV ||
2985 curop->op_type == OP_PADHV ||
2986 curop->op_type == OP_PADANY) {
2989 else if (curop->op_type == OP_PUSHRE)
2990 ; /* Okay here, dangerous in newASSIGNOP */
2999 && (!pm->op_pmregexp
3000 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
3001 pm->op_pmflags |= PMf_CONST; /* const for long enough */
3002 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
3003 prepend_elem(o->op_type, scalar(repl), o);
3006 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
3007 pm->op_pmflags |= PMf_MAYBE_CONST;
3008 pm->op_pmpermflags |= PMf_MAYBE_CONST;
3010 NewOp(1101, rcop, 1, LOGOP);
3011 rcop->op_type = OP_SUBSTCONT;
3012 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3013 rcop->op_first = scalar(repl);
3014 rcop->op_flags |= OPf_KIDS;
3015 rcop->op_private = 1;
3018 /* establish postfix order */
3019 rcop->op_next = LINKLIST(repl);
3020 repl->op_next = (OP*)rcop;
3022 pm->op_pmreplroot = scalar((OP*)rcop);
3023 pm->op_pmreplstart = LINKLIST(rcop);
3032 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3035 NewOp(1101, svop, 1, SVOP);
3036 svop->op_type = type;
3037 svop->op_ppaddr = PL_ppaddr[type];
3039 svop->op_next = (OP*)svop;
3040 svop->op_flags = flags;
3041 if (PL_opargs[type] & OA_RETSCALAR)
3043 if (PL_opargs[type] & OA_TARGET)
3044 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3045 return CHECKOP(type, svop);
3049 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3052 NewOp(1101, padop, 1, PADOP);
3053 padop->op_type = type;
3054 padop->op_ppaddr = PL_ppaddr[type];
3055 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3056 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3057 PL_curpad[padop->op_padix] = sv;
3059 padop->op_next = (OP*)padop;
3060 padop->op_flags = flags;
3061 if (PL_opargs[type] & OA_RETSCALAR)
3063 if (PL_opargs[type] & OA_TARGET)
3064 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3065 return CHECKOP(type, padop);
3069 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3074 return newPADOP(type, flags, SvREFCNT_inc(gv));
3076 return newSVOP(type, flags, SvREFCNT_inc(gv));
3081 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3084 NewOp(1101, pvop, 1, PVOP);
3085 pvop->op_type = type;
3086 pvop->op_ppaddr = PL_ppaddr[type];
3088 pvop->op_next = (OP*)pvop;
3089 pvop->op_flags = flags;
3090 if (PL_opargs[type] & OA_RETSCALAR)
3092 if (PL_opargs[type] & OA_TARGET)
3093 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3094 return CHECKOP(type, pvop);
3098 Perl_package(pTHX_ OP *o)
3103 save_hptr(&PL_curstash);
3104 save_item(PL_curstname);
3109 name = SvPV(sv, len);
3110 PL_curstash = gv_stashpvn(name,len,TRUE);
3111 sv_setpvn(PL_curstname, name, len);
3115 sv_setpv(PL_curstname,"<none>");
3116 PL_curstash = Nullhv;
3118 PL_hints |= HINT_BLOCK_SCOPE;
3119 PL_copline = NOLINE;
3124 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3132 if (id->op_type != OP_CONST)
3133 Perl_croak(aTHX_ "Module name must be constant");
3137 if (version != Nullop) {
3138 SV *vesv = ((SVOP*)version)->op_sv;
3140 if (arg == Nullop && !SvNIOKp(vesv)) {
3147 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3148 Perl_croak(aTHX_ "Version number must be constant number");
3150 /* Make copy of id so we don't free it twice */
3151 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3153 /* Fake up a method call to VERSION */
3154 meth = newSVpvn("VERSION",7);
3155 sv_upgrade(meth, SVt_PVIV);
3156 (void)SvIOK_on(meth);
3157 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3158 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3159 append_elem(OP_LIST,
3160 prepend_elem(OP_LIST, pack, list(version)),
3161 newSVOP(OP_METHOD_NAMED, 0, meth)));
3165 /* Fake up an import/unimport */
3166 if (arg && arg->op_type == OP_STUB)
3167 imop = arg; /* no import on explicit () */
3168 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3169 imop = Nullop; /* use 5.0; */
3174 /* Make copy of id so we don't free it twice */
3175 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3177 /* Fake up a method call to import/unimport */
3178 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);;
3179 sv_upgrade(meth, SVt_PVIV);
3180 (void)SvIOK_on(meth);
3181 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3182 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3183 append_elem(OP_LIST,
3184 prepend_elem(OP_LIST, pack, list(arg)),
3185 newSVOP(OP_METHOD_NAMED, 0, meth)));
3188 /* Fake up a require, handle override, if any */
3189 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3190 if (!(gv && GvIMPORTED_CV(gv)))
3191 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3193 if (gv && GvIMPORTED_CV(gv)) {
3194 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3195 append_elem(OP_LIST, id,
3196 scalar(newUNOP(OP_RV2CV, 0,
3201 rqop = newUNOP(OP_REQUIRE, 0, id);
3204 /* Fake up the BEGIN {}, which does its thing immediately. */
3206 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3209 append_elem(OP_LINESEQ,
3210 append_elem(OP_LINESEQ,
3211 newSTATEOP(0, Nullch, rqop),
3212 newSTATEOP(0, Nullch, veop)),
3213 newSTATEOP(0, Nullch, imop) ));
3215 PL_hints |= HINT_BLOCK_SCOPE;
3216 PL_copline = NOLINE;
3221 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3224 va_start(args, ver);
3225 vload_module(flags, name, ver, &args);
3229 #ifdef PERL_IMPLICIT_CONTEXT
3231 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3235 va_start(args, ver);
3236 vload_module(flags, name, ver, &args);
3242 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3244 OP *modname, *veop, *imop;
3246 modname = newSVOP(OP_CONST, 0, name);
3247 modname->op_private |= OPpCONST_BARE;
3249 veop = newSVOP(OP_CONST, 0, ver);
3253 if (flags & PERL_LOADMOD_NOIMPORT) {
3254 imop = sawparens(newNULLLIST());
3256 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3257 imop = va_arg(*args, OP*);
3262 sv = va_arg(*args, SV*);
3264 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3265 sv = va_arg(*args, SV*);
3269 line_t ocopline = PL_copline;
3270 int oexpect = PL_expect;
3272 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3273 veop, modname, imop);
3274 PL_expect = oexpect;
3275 PL_copline = ocopline;
3280 Perl_dofile(pTHX_ OP *term)
3285 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3286 if (!(gv && GvIMPORTED_CV(gv)))
3287 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3289 if (gv && GvIMPORTED_CV(gv)) {
3290 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3291 append_elem(OP_LIST, term,
3292 scalar(newUNOP(OP_RV2CV, 0,
3297 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3303 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3305 return newBINOP(OP_LSLICE, flags,
3306 list(force_list(subscript)),
3307 list(force_list(listval)) );
3311 S_list_assignment(pTHX_ register OP *o)
3316 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3317 o = cUNOPo->op_first;
3319 if (o->op_type == OP_COND_EXPR) {
3320 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3321 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3326 yyerror("Assignment to both a list and a scalar");
3330 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3331 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3332 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3335 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3338 if (o->op_type == OP_RV2SV)
3345 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3350 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3351 return newLOGOP(optype, 0,
3352 mod(scalar(left), optype),
3353 newUNOP(OP_SASSIGN, 0, scalar(right)));
3356 return newBINOP(optype, OPf_STACKED,
3357 mod(scalar(left), optype), scalar(right));
3361 if (list_assignment(left)) {
3366 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3367 left = mod(left, OP_AASSIGN);
3375 curop = list(force_list(left));
3376 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3377 o->op_private = 0 | (flags >> 8);
3378 for (curop = ((LISTOP*)curop)->op_first;
3379 curop; curop = curop->op_sibling)
3381 if (curop->op_type == OP_RV2HV &&
3382 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3383 o->op_private |= OPpASSIGN_HASH;
3387 if (!(left->op_private & OPpLVAL_INTRO)) {
3390 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3391 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3392 if (curop->op_type == OP_GV) {
3393 GV *gv = cGVOPx_gv(curop);
3394 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3396 SvCUR(gv) = PL_generation;
3398 else if (curop->op_type == OP_PADSV ||
3399 curop->op_type == OP_PADAV ||
3400 curop->op_type == OP_PADHV ||
3401 curop->op_type == OP_PADANY) {
3402 SV **svp = AvARRAY(PL_comppad_name);
3403 SV *sv = svp[curop->op_targ];
3404 if (SvCUR(sv) == PL_generation)
3406 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3408 else if (curop->op_type == OP_RV2CV)
3410 else if (curop->op_type == OP_RV2SV ||
3411 curop->op_type == OP_RV2AV ||
3412 curop->op_type == OP_RV2HV ||
3413 curop->op_type == OP_RV2GV) {
3414 if (lastop->op_type != OP_GV) /* funny deref? */
3417 else if (curop->op_type == OP_PUSHRE) {
3418 if (((PMOP*)curop)->op_pmreplroot) {
3420 GV *gv = (GV*)PL_curpad[(PADOFFSET)((PMOP*)curop)->op_pmreplroot];
3422 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3424 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3426 SvCUR(gv) = PL_generation;
3435 o->op_private |= OPpASSIGN_COMMON;
3437 if (right && right->op_type == OP_SPLIT) {
3439 if ((tmpop = ((LISTOP*)right)->op_first) &&
3440 tmpop->op_type == OP_PUSHRE)
3442 PMOP *pm = (PMOP*)tmpop;
3443 if (left->op_type == OP_RV2AV &&
3444 !(left->op_private & OPpLVAL_INTRO) &&
3445 !(o->op_private & OPpASSIGN_COMMON) )
3447 tmpop = ((UNOP*)left)->op_first;
3448 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3450 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3451 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3453 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3454 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3456 pm->op_pmflags |= PMf_ONCE;
3457 tmpop = cUNOPo->op_first; /* to list (nulled) */
3458 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3459 tmpop->op_sibling = Nullop; /* don't free split */
3460 right->op_next = tmpop->op_next; /* fix starting loc */
3461 op_free(o); /* blow off assign */
3462 right->op_flags &= ~OPf_WANT;
3463 /* "I don't know and I don't care." */
3468 if (PL_modcount < 10000 &&
3469 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3471 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3473 sv_setiv(sv, PL_modcount+1);
3481 right = newOP(OP_UNDEF, 0);
3482 if (right->op_type == OP_READLINE) {
3483 right->op_flags |= OPf_STACKED;
3484 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3487 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3488 o = newBINOP(OP_SASSIGN, flags,
3489 scalar(right), mod(scalar(left), OP_SASSIGN) );
3501 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3504 U32 seq = intro_my();
3507 NewOp(1101, cop, 1, COP);
3508 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3509 cop->op_type = OP_DBSTATE;
3510 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3513 cop->op_type = OP_NEXTSTATE;
3514 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3516 cop->op_flags = flags;
3517 cop->op_private = (PL_hints & HINT_BYTE);
3519 cop->op_private |= NATIVE_HINTS;
3521 PL_compiling.op_private = cop->op_private;
3522 cop->op_next = (OP*)cop;
3525 cop->cop_label = label;
3526 PL_hints |= HINT_BLOCK_SCOPE;
3529 cop->cop_arybase = PL_curcop->cop_arybase;
3530 if (specialWARN(PL_curcop->cop_warnings))
3531 cop->cop_warnings = PL_curcop->cop_warnings ;
3533 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3536 if (PL_copline == NOLINE)
3537 CopLINE_set(cop, CopLINE(PL_curcop));
3539 CopLINE_set(cop, PL_copline);
3540 PL_copline = NOLINE;
3543 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
3545 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
3547 CopSTASH_set(cop, PL_curstash);
3549 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3550 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3551 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3552 (void)SvIOK_on(*svp);
3553 SvIVX(*svp) = PTR2IV(cop);
3557 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3560 /* "Introduce" my variables to visible status. */
3568 if (! PL_min_intro_pending)
3569 return PL_cop_seqmax;
3571 svp = AvARRAY(PL_comppad_name);
3572 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3573 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3574 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3575 SvNVX(sv) = (NV)PL_cop_seqmax;
3578 PL_min_intro_pending = 0;
3579 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3580 return PL_cop_seqmax++;
3584 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3586 return new_logop(type, flags, &first, &other);
3590 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3595 OP *first = *firstp;
3596 OP *other = *otherp;
3598 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3599 return newBINOP(type, flags, scalar(first), scalar(other));
3601 scalarboolean(first);
3602 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3603 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3604 if (type == OP_AND || type == OP_OR) {
3610 first = *firstp = cUNOPo->op_first;
3612 first->op_next = o->op_next;
3613 cUNOPo->op_first = Nullop;
3617 if (first->op_type == OP_CONST) {
3618 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3619 Perl_warner(aTHX_ WARN_BAREWORD, "Bareword found in conditional");
3620 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3631 else if (first->op_type == OP_WANTARRAY) {
3637 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3638 OP *k1 = ((UNOP*)first)->op_first;
3639 OP *k2 = k1->op_sibling;
3641 switch (first->op_type)
3644 if (k2 && k2->op_type == OP_READLINE
3645 && (k2->op_flags & OPf_STACKED)
3646 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3648 warnop = k2->op_type;
3653 if (k1->op_type == OP_READDIR
3654 || k1->op_type == OP_GLOB
3655 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3656 || k1->op_type == OP_EACH)
3658 warnop = ((k1->op_type == OP_NULL)
3659 ? k1->op_targ : k1->op_type);
3664 line_t oldline = CopLINE(PL_curcop);
3665 CopLINE_set(PL_curcop, PL_copline);
3666 Perl_warner(aTHX_ WARN_MISC,
3667 "Value of %s%s can be \"0\"; test with defined()",
3669 ((warnop == OP_READLINE || warnop == OP_GLOB)
3670 ? " construct" : "() operator"));
3671 CopLINE_set(PL_curcop, oldline);
3678 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3679 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3681 NewOp(1101, logop, 1, LOGOP);
3683 logop->op_type = type;
3684 logop->op_ppaddr = PL_ppaddr[type];
3685 logop->op_first = first;
3686 logop->op_flags = flags | OPf_KIDS;
3687 logop->op_other = LINKLIST(other);
3688 logop->op_private = 1 | (flags >> 8);
3690 /* establish postfix order */
3691 logop->op_next = LINKLIST(first);
3692 first->op_next = (OP*)logop;
3693 first->op_sibling = other;
3695 o = newUNOP(OP_NULL, 0, (OP*)logop);
3702 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3710 return newLOGOP(OP_AND, 0, first, trueop);
3712 return newLOGOP(OP_OR, 0, first, falseop);
3714 scalarboolean(first);
3715 if (first->op_type == OP_CONST) {
3716 if (SvTRUE(((SVOP*)first)->op_sv)) {
3727 else if (first->op_type == OP_WANTARRAY) {
3731 NewOp(1101, logop, 1, LOGOP);
3732 logop->op_type = OP_COND_EXPR;
3733 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3734 logop->op_first = first;
3735 logop->op_flags = flags | OPf_KIDS;
3736 logop->op_private = 1 | (flags >> 8);
3737 logop->op_other = LINKLIST(trueop);
3738 logop->op_next = LINKLIST(falseop);
3741 /* establish postfix order */
3742 start = LINKLIST(first);
3743 first->op_next = (OP*)logop;
3745 first->op_sibling = trueop;
3746 trueop->op_sibling = falseop;
3747 o = newUNOP(OP_NULL, 0, (OP*)logop);
3749 trueop->op_next = falseop->op_next = o;
3756 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3765 NewOp(1101, range, 1, LOGOP);
3767 range->op_type = OP_RANGE;
3768 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3769 range->op_first = left;
3770 range->op_flags = OPf_KIDS;
3771 leftstart = LINKLIST(left);
3772 range->op_other = LINKLIST(right);
3773 range->op_private = 1 | (flags >> 8);
3775 left->op_sibling = right;
3777 range->op_next = (OP*)range;
3778 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3779 flop = newUNOP(OP_FLOP, 0, flip);
3780 o = newUNOP(OP_NULL, 0, flop);
3782 range->op_next = leftstart;
3784 left->op_next = flip;
3785 right->op_next = flop;
3787 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3788 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3789 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3790 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3792 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3793 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3796 if (!flip->op_private || !flop->op_private)
3797 linklist(o); /* blow off optimizer unless constant */
3803 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3808 int once = block && block->op_flags & OPf_SPECIAL &&
3809 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3812 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3813 return block; /* do {} while 0 does once */
3814 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3815 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3816 expr = newUNOP(OP_DEFINED, 0,
3817 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3818 } else if (expr->op_flags & OPf_KIDS) {
3819 OP *k1 = ((UNOP*)expr)->op_first;
3820 OP *k2 = (k1) ? k1->op_sibling : NULL;
3821 switch (expr->op_type) {
3823 if (k2 && k2->op_type == OP_READLINE
3824 && (k2->op_flags & OPf_STACKED)
3825 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3826 expr = newUNOP(OP_DEFINED, 0, expr);
3830 if (k1->op_type == OP_READDIR
3831 || k1->op_type == OP_GLOB
3832 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3833 || k1->op_type == OP_EACH)
3834 expr = newUNOP(OP_DEFINED, 0, expr);
3840 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3841 o = new_logop(OP_AND, 0, &expr, &listop);
3844 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3846 if (once && o != listop)
3847 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3850 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3852 o->op_flags |= flags;
3854 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3859 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3869 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3870 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3871 expr = newUNOP(OP_DEFINED, 0,
3872 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3873 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3874 OP *k1 = ((UNOP*)expr)->op_first;
3875 OP *k2 = (k1) ? k1->op_sibling : NULL;
3876 switch (expr->op_type) {
3878 if (k2 && k2->op_type == OP_READLINE
3879 && (k2->op_flags & OPf_STACKED)
3880 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3881 expr = newUNOP(OP_DEFINED, 0, expr);
3885 if (k1->op_type == OP_READDIR
3886 || k1->op_type == OP_GLOB
3887 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3888 || k1->op_type == OP_EACH)
3889 expr = newUNOP(OP_DEFINED, 0, expr);
3895 block = newOP(OP_NULL, 0);
3897 block = scope(block);
3901 next = LINKLIST(cont);
3902 loopflags |= OPpLOOP_CONTINUE;
3905 OP *unstack = newOP(OP_UNSTACK, 0);
3908 cont = append_elem(OP_LINESEQ, cont, unstack);
3909 if ((line_t)whileline != NOLINE) {
3910 PL_copline = whileline;
3911 cont = append_elem(OP_LINESEQ, cont,
3912 newSTATEOP(0, Nullch, Nullop));
3916 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3917 redo = LINKLIST(listop);
3920 PL_copline = whileline;
3922 o = new_logop(OP_AND, 0, &expr, &listop);
3923 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3924 op_free(expr); /* oops, it's a while (0) */
3926 return Nullop; /* listop already freed by new_logop */
3929 ((LISTOP*)listop)->op_last->op_next = condop =
3930 (o == listop ? redo : LINKLIST(o));
3936 NewOp(1101,loop,1,LOOP);
3937 loop->op_type = OP_ENTERLOOP;
3938 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3939 loop->op_private = 0;
3940 loop->op_next = (OP*)loop;
3943 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3945 loop->op_redoop = redo;
3946 loop->op_lastop = o;
3947 o->op_private |= loopflags;
3950 loop->op_nextop = next;
3952 loop->op_nextop = o;
3954 o->op_flags |= flags;
3955 o->op_private |= (flags >> 8);
3960 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3968 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3969 sv->op_type = OP_RV2GV;
3970 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3972 else if (sv->op_type == OP_PADSV) { /* private variable */
3973 padoff = sv->op_targ;
3978 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3979 padoff = sv->op_targ;
3981 iterflags |= OPf_SPECIAL;
3986 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3990 padoff = find_threadsv("_");
3991 iterflags |= OPf_SPECIAL;
3993 sv = newGVOP(OP_GV, 0, PL_defgv);
3996 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3997 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3998 iterflags |= OPf_STACKED;
4000 else if (expr->op_type == OP_NULL &&
4001 (expr->op_flags & OPf_KIDS) &&
4002 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
4004 /* Basically turn for($x..$y) into the same as for($x,$y), but we
4005 * set the STACKED flag to indicate that these values are to be
4006 * treated as min/max values by 'pp_iterinit'.
4008 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
4009 LOGOP* range = (LOGOP*) flip->op_first;
4010 OP* left = range->op_first;
4011 OP* right = left->op_sibling;
4014 range->op_flags &= ~OPf_KIDS;
4015 range->op_first = Nullop;
4017 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
4018 listop->op_first->op_next = range->op_next;
4019 left->op_next = range->op_other;
4020 right->op_next = (OP*)listop;
4021 listop->op_next = listop->op_first;
4024 expr = (OP*)(listop);
4026 iterflags |= OPf_STACKED;
4029 expr = mod(force_list(expr), OP_GREPSTART);
4033 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
4034 append_elem(OP_LIST, expr, scalar(sv))));
4035 assert(!loop->op_next);
4036 #ifdef PL_OP_SLAB_ALLOC
4039 NewOp(1234,tmp,1,LOOP);
4040 Copy(loop,tmp,1,LOOP);
4044 Renew(loop, 1, LOOP);
4046 loop->op_targ = padoff;
4047 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
4048 PL_copline = forline;
4049 return newSTATEOP(0, label, wop);
4053 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4059 if (type != OP_GOTO || label->op_type == OP_CONST) {
4060 /* "last()" means "last" */
4061 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4062 o = newOP(type, OPf_SPECIAL);
4064 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
4065 ? SvPVx(((SVOP*)label)->op_sv, n_a)
4071 if (label->op_type == OP_ENTERSUB)
4072 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4073 o = newUNOP(type, OPf_STACKED, label);
4075 PL_hints |= HINT_BLOCK_SCOPE;
4080 Perl_cv_undef(pTHX_ CV *cv)
4085 MUTEX_DESTROY(CvMUTEXP(cv));
4086 Safefree(CvMUTEXP(cv));
4089 #endif /* USE_THREADS */
4091 if (!CvXSUB(cv) && CvROOT(cv)) {
4093 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4094 Perl_croak(aTHX_ "Can't undef active subroutine");
4097 Perl_croak(aTHX_ "Can't undef active subroutine");
4098 #endif /* USE_THREADS */
4101 SAVEVPTR(PL_curpad);
4105 op_free(CvROOT(cv));
4106 CvROOT(cv) = Nullop;
4109 SvPOK_off((SV*)cv); /* forget prototype */
4111 SvREFCNT_dec(CvGV(cv));
4113 SvREFCNT_dec(CvOUTSIDE(cv));
4114 CvOUTSIDE(cv) = Nullcv;
4115 if (CvPADLIST(cv)) {
4116 /* may be during global destruction */
4117 if (SvREFCNT(CvPADLIST(cv))) {
4118 I32 i = AvFILLp(CvPADLIST(cv));
4120 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4121 SV* sv = svp ? *svp : Nullsv;
4124 if (sv == (SV*)PL_comppad_name)
4125 PL_comppad_name = Nullav;
4126 else if (sv == (SV*)PL_comppad) {
4127 PL_comppad = Nullav;
4128 PL_curpad = Null(SV**);
4132 SvREFCNT_dec((SV*)CvPADLIST(cv));
4134 CvPADLIST(cv) = Nullav;
4139 S_cv_dump(pTHX_ CV *cv)
4142 CV *outside = CvOUTSIDE(cv);
4143 AV* padlist = CvPADLIST(cv);
4150 PerlIO_printf(Perl_debug_log,
4151 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4153 (CvANON(cv) ? "ANON"
4154 : (cv == PL_main_cv) ? "MAIN"
4155 : CvUNIQUE(cv) ? "UNIQUE"
4156 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4159 : CvANON(outside) ? "ANON"
4160 : (outside == PL_main_cv) ? "MAIN"
4161 : CvUNIQUE(outside) ? "UNIQUE"
4162 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4167 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4168 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4169 pname = AvARRAY(pad_name);
4170 ppad = AvARRAY(pad);
4172 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4173 if (SvPOK(pname[ix]))
4174 PerlIO_printf(Perl_debug_log,
4175 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4176 (int)ix, PTR2UV(ppad[ix]),
4177 SvFAKE(pname[ix]) ? "FAKE " : "",
4179 (IV)I_32(SvNVX(pname[ix])),
4182 #endif /* DEBUGGING */
4186 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4191 AV* protopadlist = CvPADLIST(proto);
4192 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4193 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4194 SV** pname = AvARRAY(protopad_name);
4195 SV** ppad = AvARRAY(protopad);
4196 I32 fname = AvFILLp(protopad_name);
4197 I32 fpad = AvFILLp(protopad);
4201 assert(!CvUNIQUE(proto));
4205 SAVESPTR(PL_comppad_name);
4206 SAVESPTR(PL_compcv);
4208 cv = PL_compcv = (CV*)NEWSV(1104,0);
4209 sv_upgrade((SV *)cv, SvTYPE(proto));
4210 CvFLAGS(cv) = CvFLAGS(proto) & ~CVf_CLONE;
4214 New(666, CvMUTEXP(cv), 1, perl_mutex);
4215 MUTEX_INIT(CvMUTEXP(cv));
4217 #endif /* USE_THREADS */
4218 CvFILE(cv) = CvFILE(proto);
4219 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4220 CvSTASH(cv) = CvSTASH(proto);
4221 CvROOT(cv) = CvROOT(proto);
4222 CvSTART(cv) = CvSTART(proto);
4224 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4227 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4229 PL_comppad_name = newAV();
4230 for (ix = fname; ix >= 0; ix--)
4231 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4233 PL_comppad = newAV();
4235 comppadlist = newAV();
4236 AvREAL_off(comppadlist);
4237 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4238 av_store(comppadlist, 1, (SV*)PL_comppad);
4239 CvPADLIST(cv) = comppadlist;
4240 av_fill(PL_comppad, AvFILLp(protopad));
4241 PL_curpad = AvARRAY(PL_comppad);
4243 av = newAV(); /* will be @_ */
4245 av_store(PL_comppad, 0, (SV*)av);
4246 AvFLAGS(av) = AVf_REIFY;
4248 for (ix = fpad; ix > 0; ix--) {
4249 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4250 if (namesv && namesv != &PL_sv_undef) {
4251 char *name = SvPVX(namesv); /* XXX */
4252 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4253 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4254 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4256 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4258 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4260 else { /* our own lexical */
4263 /* anon code -- we'll come back for it */
4264 sv = SvREFCNT_inc(ppad[ix]);
4266 else if (*name == '@')
4268 else if (*name == '%')
4277 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4278 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4281 SV* sv = NEWSV(0,0);
4287 /* Now that vars are all in place, clone nested closures. */
4289 for (ix = fpad; ix > 0; ix--) {
4290 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4292 && namesv != &PL_sv_undef
4293 && !(SvFLAGS(namesv) & SVf_FAKE)
4294 && *SvPVX(namesv) == '&'
4295 && CvCLONE(ppad[ix]))
4297 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4298 SvREFCNT_dec(ppad[ix]);
4301 PL_curpad[ix] = (SV*)kid;
4305 #ifdef DEBUG_CLOSURES
4306 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4308 PerlIO_printf(Perl_debug_log, " from:\n");
4310 PerlIO_printf(Perl_debug_log, " to:\n");
4319 Perl_cv_clone(pTHX_ CV *proto)
4322 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4323 cv = cv_clone2(proto, CvOUTSIDE(proto));
4324 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4329 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4333 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4334 SV* msg = sv_newmortal();
4338 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4339 sv_setpv(msg, "Prototype mismatch:");
4341 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4343 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4344 sv_catpv(msg, " vs ");
4346 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4348 sv_catpv(msg, "none");
4349 Perl_warner(aTHX_ WARN_PROTOTYPE, "%"SVf, msg);
4354 Perl_cv_const_sv(pTHX_ CV *cv)
4356 if (!cv || !SvPOK(cv) || SvCUR(cv))
4358 return op_const_sv(CvSTART(cv), cv);
4362 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4369 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4370 o = cLISTOPo->op_first->op_sibling;
4372 for (; o; o = o->op_next) {
4373 OPCODE type = o->op_type;
4375 if (sv && o->op_next == o)
4377 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4379 if (type == OP_LEAVESUB || type == OP_RETURN)
4383 if (type == OP_CONST && cSVOPo->op_sv)
4385 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4386 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4387 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4388 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4400 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4410 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4414 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4416 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4420 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4427 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4431 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4432 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4433 SV *sv = sv_newmortal();
4434 Perl_sv_setpvf(aTHX_ sv, "__ANON__[%s:%"IVdf"]",
4435 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4440 gv = gv_fetchpv(name ? name : (aname ? aname : "__ANON__"),
4441 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4451 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4452 maximum a prototype before. */
4453 if (SvTYPE(gv) > SVt_NULL) {
4454 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4455 && ckWARN_d(WARN_PROTOTYPE))
4457 Perl_warner(aTHX_ WARN_PROTOTYPE, "Runaway prototype");
4459 cv_ckproto((CV*)gv, NULL, ps);
4462 sv_setpv((SV*)gv, ps);
4464 sv_setiv((SV*)gv, -1);
4465 SvREFCNT_dec(PL_compcv);
4466 cv = PL_compcv = NULL;
4467 PL_sub_generation++;
4471 if (!name || GvCVGEN(gv))
4473 else if ((cv = GvCV(gv))) {
4474 bool exists = CvROOT(cv) || CvXSUB(cv);
4475 /* if the subroutine doesn't exist and wasn't pre-declared
4476 * with a prototype, assume it will be AUTOLOADed,
4477 * skipping the prototype check
4479 if (exists || SvPOK(cv))
4480 cv_ckproto(cv, gv, ps);
4481 /* already defined (or promised)? */
4482 if (exists || GvASSUMECV(gv)) {
4484 bool const_changed = TRUE;
4485 if (!block && !attrs) {
4486 /* just a "sub foo;" when &foo is already defined */
4487 SAVEFREESV(PL_compcv);
4490 /* ahem, death to those who redefine active sort subs */
4491 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4492 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4495 if ((const_sv = cv_const_sv(cv)))
4496 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4497 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE))
4499 line_t oldline = CopLINE(PL_curcop);
4500 CopLINE_set(PL_curcop, PL_copline);
4501 Perl_warner(aTHX_ WARN_REDEFINE,
4502 const_sv ? "Constant subroutine %s redefined"
4503 : "Subroutine %s redefined", name);
4504 CopLINE_set(PL_curcop, oldline);
4515 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4516 * before we clobber PL_compcv.
4520 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4521 stash = GvSTASH(CvGV(cv));
4522 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4523 stash = CvSTASH(cv);
4525 stash = PL_curstash;
4528 /* possibly about to re-define existing subr -- ignore old cv */
4529 rcv = (SV*)PL_compcv;
4530 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4531 stash = GvSTASH(gv);
4533 stash = PL_curstash;
4535 apply_attrs(stash, rcv, attrs);
4537 if (cv) { /* must reuse cv if autoloaded */
4539 /* got here with just attrs -- work done, so bug out */
4540 SAVEFREESV(PL_compcv);
4544 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4545 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4546 CvOUTSIDE(PL_compcv) = 0;
4547 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4548 CvPADLIST(PL_compcv) = 0;
4549 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4550 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4551 SvREFCNT_dec(PL_compcv);
4558 PL_sub_generation++;
4561 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4562 CvFILE(cv) = CopFILE(PL_curcop);
4563 CvSTASH(cv) = PL_curstash;
4566 if (!CvMUTEXP(cv)) {
4567 New(666, CvMUTEXP(cv), 1, perl_mutex);
4568 MUTEX_INIT(CvMUTEXP(cv));
4570 #endif /* USE_THREADS */
4573 sv_setpv((SV*)cv, ps);
4575 if (PL_error_count) {
4579 char *s = strrchr(name, ':');
4581 if (strEQ(s, "BEGIN")) {
4583 "BEGIN not safe after errors--compilation aborted";
4584 if (PL_in_eval & EVAL_KEEPERR)
4585 Perl_croak(aTHX_ not_safe);
4587 /* force display of errors found but not reported */
4588 sv_catpv(ERRSV, not_safe);
4589 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4596 PL_copline = NOLINE;
4601 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4602 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4605 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4608 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4610 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4611 OpREFCNT_set(CvROOT(cv), 1);
4612 CvSTART(cv) = LINKLIST(CvROOT(cv));
4613 CvROOT(cv)->op_next = 0;
4616 /* now that optimizer has done its work, adjust pad values */
4618 SV **namep = AvARRAY(PL_comppad_name);
4619 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4622 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4625 * The only things that a clonable function needs in its
4626 * pad are references to outer lexicals and anonymous subs.
4627 * The rest are created anew during cloning.
4629 if (!((namesv = namep[ix]) != Nullsv &&
4630 namesv != &PL_sv_undef &&
4632 *SvPVX(namesv) == '&')))
4634 SvREFCNT_dec(PL_curpad[ix]);
4635 PL_curpad[ix] = Nullsv;
4640 AV *av = newAV(); /* Will be @_ */
4642 av_store(PL_comppad, 0, (SV*)av);
4643 AvFLAGS(av) = AVf_REIFY;
4645 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4646 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4648 if (!SvPADMY(PL_curpad[ix]))
4649 SvPADTMP_on(PL_curpad[ix]);
4653 if (name || aname) {
4655 char *tname = (name ? name : aname);
4657 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4658 SV *sv = NEWSV(0,0);
4659 SV *tmpstr = sv_newmortal();
4660 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4664 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4666 (long)PL_subline, (long)CopLINE(PL_curcop));
4667 gv_efullname3(tmpstr, gv, Nullch);
4668 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4669 hv = GvHVn(db_postponed);
4670 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4671 && (pcv = GvCV(db_postponed)))
4677 call_sv((SV*)pcv, G_DISCARD);
4681 if ((s = strrchr(tname,':')))
4686 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4689 if (strEQ(s, "BEGIN")) {
4690 I32 oldscope = PL_scopestack_ix;
4692 SAVECOPFILE(&PL_compiling);
4693 SAVECOPLINE(&PL_compiling);
4695 sv_setsv(PL_rs, PL_nrs);
4698 PL_beginav = newAV();
4699 DEBUG_x( dump_sub(gv) );
4700 av_push(PL_beginav, (SV*)cv);
4701 GvCV(gv) = 0; /* cv has been hijacked */
4702 call_list(oldscope, PL_beginav);
4704 PL_curcop = &PL_compiling;
4705 PL_compiling.op_private = PL_hints;
4708 else if (strEQ(s, "END") && !PL_error_count) {
4711 DEBUG_x( dump_sub(gv) );
4712 av_unshift(PL_endav, 1);
4713 av_store(PL_endav, 0, (SV*)cv);
4714 GvCV(gv) = 0; /* cv has been hijacked */
4716 else if (strEQ(s, "CHECK") && !PL_error_count) {
4718 PL_checkav = newAV();
4719 DEBUG_x( dump_sub(gv) );
4720 if (PL_main_start && ckWARN(WARN_VOID))
4721 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4722 av_unshift(PL_checkav, 1);
4723 av_store(PL_checkav, 0, (SV*)cv);
4724 GvCV(gv) = 0; /* cv has been hijacked */
4726 else if (strEQ(s, "INIT") && !PL_error_count) {
4728 PL_initav = newAV();
4729 DEBUG_x( dump_sub(gv) );
4730 if (PL_main_start && ckWARN(WARN_VOID))
4731 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4732 av_push(PL_initav, (SV*)cv);
4733 GvCV(gv) = 0; /* cv has been hijacked */
4738 PL_copline = NOLINE;
4743 /* XXX unsafe for threads if eval_owner isn't held */
4745 =for apidoc newCONSTSUB
4747 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4748 eligible for inlining at compile-time.
4754 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4760 SAVECOPLINE(PL_curcop);
4761 CopLINE_set(PL_curcop, PL_copline);
4764 PL_hints &= ~HINT_BLOCK_SCOPE;
4767 SAVESPTR(PL_curstash);
4768 SAVECOPSTASH(PL_curcop);
4769 PL_curstash = stash;
4771 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4773 CopSTASH(PL_curcop) = stash;
4778 start_subparse(FALSE, 0),
4779 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4780 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4782 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4789 =for apidoc U||newXS
4791 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4797 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4800 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4803 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4805 /* just a cached method */
4809 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4810 /* already defined (or promised) */
4811 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4812 && HvNAME(GvSTASH(CvGV(cv)))
4813 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4814 line_t oldline = CopLINE(PL_curcop);
4815 if (PL_copline != NOLINE)
4816 CopLINE_set(PL_curcop, PL_copline);
4817 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4818 CopLINE_set(PL_curcop, oldline);
4825 if (cv) /* must reuse cv if autoloaded */
4828 cv = (CV*)NEWSV(1105,0);
4829 sv_upgrade((SV *)cv, SVt_PVCV);
4833 PL_sub_generation++;
4836 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4838 New(666, CvMUTEXP(cv), 1, perl_mutex);
4839 MUTEX_INIT(CvMUTEXP(cv));
4841 #endif /* USE_THREADS */
4842 (void)gv_fetchfile(filename);
4843 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4844 an external constant string */
4845 CvXSUB(cv) = subaddr;
4848 char *s = strrchr(name,':');
4854 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4857 if (strEQ(s, "BEGIN")) {
4859 PL_beginav = newAV();
4860 av_push(PL_beginav, (SV*)cv);
4861 GvCV(gv) = 0; /* cv has been hijacked */
4863 else if (strEQ(s, "END")) {
4866 av_unshift(PL_endav, 1);
4867 av_store(PL_endav, 0, (SV*)cv);
4868 GvCV(gv) = 0; /* cv has been hijacked */
4870 else if (strEQ(s, "CHECK")) {
4872 PL_checkav = newAV();
4873 if (PL_main_start && ckWARN(WARN_VOID))
4874 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4875 av_unshift(PL_checkav, 1);
4876 av_store(PL_checkav, 0, (SV*)cv);
4877 GvCV(gv) = 0; /* cv has been hijacked */
4879 else if (strEQ(s, "INIT")) {
4881 PL_initav = newAV();
4882 if (PL_main_start && ckWARN(WARN_VOID))
4883 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4884 av_push(PL_initav, (SV*)cv);
4885 GvCV(gv) = 0; /* cv has been hijacked */
4896 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4906 name = SvPVx(cSVOPo->op_sv, n_a);
4909 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4911 if ((cv = GvFORM(gv))) {
4912 if (ckWARN(WARN_REDEFINE)) {
4913 line_t oldline = CopLINE(PL_curcop);
4915 CopLINE_set(PL_curcop, PL_copline);
4916 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4917 CopLINE_set(PL_curcop, oldline);
4923 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4924 CvFILE(cv) = CopFILE(PL_curcop);
4926 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4927 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4928 SvPADTMP_on(PL_curpad[ix]);
4931 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4932 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4933 OpREFCNT_set(CvROOT(cv), 1);
4934 CvSTART(cv) = LINKLIST(CvROOT(cv));
4935 CvROOT(cv)->op_next = 0;
4938 PL_copline = NOLINE;
4943 Perl_newANONLIST(pTHX_ OP *o)
4945 return newUNOP(OP_REFGEN, 0,
4946 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4950 Perl_newANONHASH(pTHX_ OP *o)
4952 return newUNOP(OP_REFGEN, 0,
4953 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4957 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4959 return newANONATTRSUB(floor, proto, Nullop, block);
4963 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4965 return newUNOP(OP_REFGEN, 0,
4966 newSVOP(OP_ANONCODE, 0,
4967 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4971 Perl_oopsAV(pTHX_ OP *o)
4973 switch (o->op_type) {
4975 o->op_type = OP_PADAV;
4976 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4977 return ref(o, OP_RV2AV);
4980 o->op_type = OP_RV2AV;
4981 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4986 if (ckWARN_d(WARN_INTERNAL))
4987 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4994 Perl_oopsHV(pTHX_ OP *o)
4998 switch (o->op_type) {
5001 o->op_type = OP_PADHV;
5002 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5003 return ref(o, OP_RV2HV);
5007 o->op_type = OP_RV2HV;
5008 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
5013 if (ckWARN_d(WARN_INTERNAL))
5014 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
5021 Perl_newAVREF(pTHX_ OP *o)
5023 if (o->op_type == OP_PADANY) {
5024 o->op_type = OP_PADAV;
5025 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5028 return newUNOP(OP_RV2AV, 0, scalar(o));
5032 Perl_newGVREF(pTHX_ I32 type, OP *o)
5034 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
5035 return newUNOP(OP_NULL, 0, o);
5036 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
5040 Perl_newHVREF(pTHX_ OP *o)
5042 if (o->op_type == OP_PADANY) {
5043 o->op_type = OP_PADHV;
5044 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5047 return newUNOP(OP_RV2HV, 0, scalar(o));
5051 Perl_oopsCV(pTHX_ OP *o)
5053 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5059 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5061 return newUNOP(OP_RV2CV, flags, scalar(o));
5065 Perl_newSVREF(pTHX_ OP *o)
5067 if (o->op_type == OP_PADANY) {
5068 o->op_type = OP_PADSV;
5069 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5072 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
5073 o->op_flags |= OPpDONE_SVREF;
5076 return newUNOP(OP_RV2SV, 0, scalar(o));
5079 /* Check routines. */
5082 Perl_ck_anoncode(pTHX_ OP *o)
5087 name = NEWSV(1106,0);
5088 sv_upgrade(name, SVt_PVNV);
5089 sv_setpvn(name, "&", 1);
5092 ix = pad_alloc(o->op_type, SVs_PADMY);
5093 av_store(PL_comppad_name, ix, name);
5094 av_store(PL_comppad, ix, cSVOPo->op_sv);
5095 SvPADMY_on(cSVOPo->op_sv);
5096 cSVOPo->op_sv = Nullsv;
5097 cSVOPo->op_targ = ix;
5102 Perl_ck_bitop(pTHX_ OP *o)
5104 o->op_private = PL_hints;
5109 Perl_ck_concat(pTHX_ OP *o)
5111 if (cUNOPo->op_first->op_type == OP_CONCAT)
5112 o->op_flags |= OPf_STACKED;
5117 Perl_ck_spair(pTHX_ OP *o)
5119 if (o->op_flags & OPf_KIDS) {
5122 OPCODE type = o->op_type;
5123 o = modkids(ck_fun(o), type);
5124 kid = cUNOPo->op_first;
5125 newop = kUNOP->op_first->op_sibling;
5127 (newop->op_sibling ||
5128 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5129 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5130 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5134 op_free(kUNOP->op_first);
5135 kUNOP->op_first = newop;
5137 o->op_ppaddr = PL_ppaddr[++o->op_type];
5142 Perl_ck_delete(pTHX_ OP *o)
5146 if (o->op_flags & OPf_KIDS) {
5147 OP *kid = cUNOPo->op_first;
5148 switch (kid->op_type) {
5150 o->op_flags |= OPf_SPECIAL;
5153 o->op_private |= OPpSLICE;
5156 o->op_flags |= OPf_SPECIAL;
5161 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5162 PL_op_desc[o->op_type]);
5170 Perl_ck_eof(pTHX_ OP *o)
5172 I32 type = o->op_type;
5174 if (o->op_flags & OPf_KIDS) {
5175 if (cLISTOPo->op_first->op_type == OP_STUB) {
5177 o = newUNOP(type, OPf_SPECIAL,
5178 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5186 Perl_ck_eval(pTHX_ OP *o)
5188 PL_hints |= HINT_BLOCK_SCOPE;
5189 if (o->op_flags & OPf_KIDS) {
5190 SVOP *kid = (SVOP*)cUNOPo->op_first;
5193 o->op_flags &= ~OPf_KIDS;
5196 else if (kid->op_type == OP_LINESEQ) {
5199 kid->op_next = o->op_next;
5200 cUNOPo->op_first = 0;
5203 NewOp(1101, enter, 1, LOGOP);
5204 enter->op_type = OP_ENTERTRY;
5205 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5206 enter->op_private = 0;
5208 /* establish postfix order */
5209 enter->op_next = (OP*)enter;
5211 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5212 o->op_type = OP_LEAVETRY;
5213 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5214 enter->op_other = o;
5222 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5224 o->op_targ = (PADOFFSET)PL_hints;
5229 Perl_ck_exit(pTHX_ OP *o)
5232 HV *table = GvHV(PL_hintgv);
5234 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
5235 if (svp && *svp && SvTRUE(*svp))
5236 o->op_private |= OPpEXIT_VMSISH;
5243 Perl_ck_exec(pTHX_ OP *o)
5246 if (o->op_flags & OPf_STACKED) {
5248 kid = cUNOPo->op_first->op_sibling;
5249 if (kid->op_type == OP_RV2GV)
5258 Perl_ck_exists(pTHX_ OP *o)
5261 if (o->op_flags & OPf_KIDS) {
5262 OP *kid = cUNOPo->op_first;
5263 if (kid->op_type == OP_ENTERSUB) {
5264 (void) ref(kid, o->op_type);
5265 if (kid->op_type != OP_RV2CV && !PL_error_count)
5266 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5267 PL_op_desc[o->op_type]);
5268 o->op_private |= OPpEXISTS_SUB;
5270 else if (kid->op_type == OP_AELEM)
5271 o->op_flags |= OPf_SPECIAL;
5272 else if (kid->op_type != OP_HELEM)
5273 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5274 PL_op_desc[o->op_type]);
5282 Perl_ck_gvconst(pTHX_ register OP *o)
5284 o = fold_constants(o);
5285 if (o->op_type == OP_CONST)
5292 Perl_ck_rvconst(pTHX_ register OP *o)
5295 SVOP *kid = (SVOP*)cUNOPo->op_first;
5297 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5298 if (kid->op_type == OP_CONST) {
5302 SV *kidsv = kid->op_sv;
5305 /* Is it a constant from cv_const_sv()? */
5306 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5307 SV *rsv = SvRV(kidsv);
5308 int svtype = SvTYPE(rsv);
5309 char *badtype = Nullch;
5311 switch (o->op_type) {
5313 if (svtype > SVt_PVMG)
5314 badtype = "a SCALAR";
5317 if (svtype != SVt_PVAV)
5318 badtype = "an ARRAY";
5321 if (svtype != SVt_PVHV) {
5322 if (svtype == SVt_PVAV) { /* pseudohash? */
5323 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5324 if (ksv && SvROK(*ksv)
5325 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5334 if (svtype != SVt_PVCV)
5339 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5342 name = SvPV(kidsv, n_a);
5343 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5344 char *badthing = Nullch;
5345 switch (o->op_type) {
5347 badthing = "a SCALAR";
5350 badthing = "an ARRAY";
5353 badthing = "a HASH";
5358 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5362 * This is a little tricky. We only want to add the symbol if we
5363 * didn't add it in the lexer. Otherwise we get duplicate strict
5364 * warnings. But if we didn't add it in the lexer, we must at
5365 * least pretend like we wanted to add it even if it existed before,
5366 * or we get possible typo warnings. OPpCONST_ENTERED says
5367 * whether the lexer already added THIS instance of this symbol.
5369 iscv = (o->op_type == OP_RV2CV) * 2;
5371 gv = gv_fetchpv(name,
5372 iscv | !(kid->op_private & OPpCONST_ENTERED),
5375 : o->op_type == OP_RV2SV
5377 : o->op_type == OP_RV2AV
5379 : o->op_type == OP_RV2HV
5382 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5384 kid->op_type = OP_GV;
5385 SvREFCNT_dec(kid->op_sv);
5387 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5388 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5389 SvREFCNT_dec(PL_curpad[kPADOP->op_padix]);
5391 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5393 kid->op_sv = SvREFCNT_inc(gv);
5395 kid->op_ppaddr = PL_ppaddr[OP_GV];
5402 Perl_ck_ftst(pTHX_ OP *o)
5405 I32 type = o->op_type;
5407 if (o->op_flags & OPf_REF) {
5410 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5411 SVOP *kid = (SVOP*)cUNOPo->op_first;
5413 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5415 OP *newop = newGVOP(type, OPf_REF,
5416 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5423 if (type == OP_FTTTY)
5424 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5427 o = newUNOP(type, 0, newDEFSVOP());
5430 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5432 if (PL_hints & HINT_LOCALE)
5433 o->op_private |= OPpLOCALE;
5440 Perl_ck_fun(pTHX_ OP *o)
5447 int type = o->op_type;
5448 register I32 oa = PL_opargs[type] >> OASHIFT;
5450 if (o->op_flags & OPf_STACKED) {
5451 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5454 return no_fh_allowed(o);
5457 if (o->op_flags & OPf_KIDS) {
5459 tokid = &cLISTOPo->op_first;
5460 kid = cLISTOPo->op_first;
5461 if (kid->op_type == OP_PUSHMARK ||
5462 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5464 tokid = &kid->op_sibling;
5465 kid = kid->op_sibling;
5467 if (!kid && PL_opargs[type] & OA_DEFGV)
5468 *tokid = kid = newDEFSVOP();
5472 sibl = kid->op_sibling;
5475 /* list seen where single (scalar) arg expected? */
5476 if (numargs == 1 && !(oa >> 4)
5477 && kid->op_type == OP_LIST && type != OP_SCALAR)
5479 return too_many_arguments(o,PL_op_desc[type]);
5492 if (kid->op_type == OP_CONST &&
5493 (kid->op_private & OPpCONST_BARE))
5495 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5496 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5497 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5498 if (ckWARN(WARN_DEPRECATED))
5499 Perl_warner(aTHX_ WARN_DEPRECATED,
5500 "Array @%s missing the @ in argument %"IVdf" of %s()",
5501 name, (IV)numargs, PL_op_desc[type]);
5504 kid->op_sibling = sibl;
5507 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5508 bad_type(numargs, "array", PL_op_desc[type], kid);
5512 if (kid->op_type == OP_CONST &&
5513 (kid->op_private & OPpCONST_BARE))
5515 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5516 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5517 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5518 if (ckWARN(WARN_DEPRECATED))
5519 Perl_warner(aTHX_ WARN_DEPRECATED,
5520 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5521 name, (IV)numargs, PL_op_desc[type]);
5524 kid->op_sibling = sibl;
5527 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5528 bad_type(numargs, "hash", PL_op_desc[type], kid);
5533 OP *newop = newUNOP(OP_NULL, 0, kid);
5534 kid->op_sibling = 0;
5536 newop->op_next = newop;
5538 kid->op_sibling = sibl;
5543 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5544 if (kid->op_type == OP_CONST &&
5545 (kid->op_private & OPpCONST_BARE))
5547 OP *newop = newGVOP(OP_GV, 0,
5548 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5553 else if (kid->op_type == OP_READLINE) {
5554 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5555 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5558 I32 flags = OPf_SPECIAL;
5562 /* is this op a FH constructor? */
5563 if (is_handle_constructor(o,numargs)) {
5564 char *name = Nullch;
5568 /* Set a flag to tell rv2gv to vivify
5569 * need to "prove" flag does not mean something
5570 * else already - NI-S 1999/05/07
5573 if (kid->op_type == OP_PADSV) {
5574 SV **namep = av_fetch(PL_comppad_name,
5576 if (namep && *namep)
5577 name = SvPV(*namep, len);
5579 else if (kid->op_type == OP_RV2SV
5580 && kUNOP->op_first->op_type == OP_GV)
5582 GV *gv = cGVOPx_gv(kUNOP->op_first);
5584 len = GvNAMELEN(gv);
5586 else if (kid->op_type == OP_AELEM
5587 || kid->op_type == OP_HELEM)
5589 name = "__ANONIO__";
5595 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5596 namesv = PL_curpad[targ];
5597 (void)SvUPGRADE(namesv, SVt_PV);
5599 sv_setpvn(namesv, "$", 1);
5600 sv_catpvn(namesv, name, len);
5603 kid->op_sibling = 0;
5604 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5605 kid->op_targ = targ;
5606 kid->op_private |= priv;
5608 kid->op_sibling = sibl;
5614 mod(scalar(kid), type);
5618 tokid = &kid->op_sibling;
5619 kid = kid->op_sibling;
5621 o->op_private |= numargs;
5623 return too_many_arguments(o,PL_op_desc[o->op_type]);
5626 else if (PL_opargs[type] & OA_DEFGV) {
5628 return newUNOP(type, 0, newDEFSVOP());
5632 while (oa & OA_OPTIONAL)
5634 if (oa && oa != OA_LIST)
5635 return too_few_arguments(o,PL_op_desc[o->op_type]);
5641 Perl_ck_glob(pTHX_ OP *o)
5646 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5647 append_elem(OP_GLOB, o, newDEFSVOP());
5649 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5650 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5652 #if !defined(PERL_EXTERNAL_GLOB)
5653 /* XXX this can be tightened up and made more failsafe. */
5656 Perl_load_module(aTHX_ 0, newSVpvn("File::Glob", 10), Nullsv,
5657 /* null-terminated import list */
5658 newSVpvn(":globally", 9), Nullsv);
5659 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5662 #endif /* PERL_EXTERNAL_GLOB */
5664 if (gv && GvIMPORTED_CV(gv)) {
5665 append_elem(OP_GLOB, o,
5666 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5667 o->op_type = OP_LIST;
5668 o->op_ppaddr = PL_ppaddr[OP_LIST];
5669 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5670 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5671 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5672 append_elem(OP_LIST, o,
5673 scalar(newUNOP(OP_RV2CV, 0,
5674 newGVOP(OP_GV, 0, gv)))));
5675 o = newUNOP(OP_NULL, 0, ck_subr(o));
5676 o->op_targ = OP_GLOB; /* hint at what it used to be */
5679 gv = newGVgen("main");
5681 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5687 Perl_ck_grep(pTHX_ OP *o)
5691 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5693 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5694 NewOp(1101, gwop, 1, LOGOP);
5696 if (o->op_flags & OPf_STACKED) {
5699 kid = cLISTOPo->op_first->op_sibling;
5700 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5703 kid->op_next = (OP*)gwop;
5704 o->op_flags &= ~OPf_STACKED;
5706 kid = cLISTOPo->op_first->op_sibling;
5707 if (type == OP_MAPWHILE)
5714 kid = cLISTOPo->op_first->op_sibling;
5715 if (kid->op_type != OP_NULL)
5716 Perl_croak(aTHX_ "panic: ck_grep");
5717 kid = kUNOP->op_first;
5719 gwop->op_type = type;
5720 gwop->op_ppaddr = PL_ppaddr[type];
5721 gwop->op_first = listkids(o);
5722 gwop->op_flags |= OPf_KIDS;
5723 gwop->op_private = 1;
5724 gwop->op_other = LINKLIST(kid);
5725 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5726 kid->op_next = (OP*)gwop;
5728 kid = cLISTOPo->op_first->op_sibling;
5729 if (!kid || !kid->op_sibling)
5730 return too_few_arguments(o,PL_op_desc[o->op_type]);
5731 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5732 mod(kid, OP_GREPSTART);
5738 Perl_ck_index(pTHX_ OP *o)
5740 if (o->op_flags & OPf_KIDS) {
5741 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5743 kid = kid->op_sibling; /* get past "big" */
5744 if (kid && kid->op_type == OP_CONST)
5745 fbm_compile(((SVOP*)kid)->op_sv, 0);
5751 Perl_ck_lengthconst(pTHX_ OP *o)
5753 /* XXX length optimization goes here */
5758 Perl_ck_lfun(pTHX_ OP *o)
5760 OPCODE type = o->op_type;
5761 return modkids(ck_fun(o), type);
5765 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5768 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5769 switch (cUNOPo->op_first->op_type) {
5771 /* This is needed for
5772 if (defined %stash::)
5773 to work. Do not break Tk.
5775 break; /* Globals via GV can be undef */
5777 case OP_AASSIGN: /* Is this a good idea? */
5778 Perl_warner(aTHX_ WARN_DEPRECATED,
5779 "defined(@array) is deprecated");
5780 Perl_warner(aTHX_ WARN_DEPRECATED,
5781 "\t(Maybe you should just omit the defined()?)\n");
5784 /* This is needed for
5785 if (defined %stash::)
5786 to work. Do not break Tk.
5788 break; /* Globals via GV can be undef */
5790 Perl_warner(aTHX_ WARN_DEPRECATED,
5791 "defined(%%hash) is deprecated");
5792 Perl_warner(aTHX_ WARN_DEPRECATED,
5793 "\t(Maybe you should just omit the defined()?)\n");
5804 Perl_ck_rfun(pTHX_ OP *o)
5806 OPCODE type = o->op_type;
5807 return refkids(ck_fun(o), type);
5811 Perl_ck_listiob(pTHX_ OP *o)
5815 kid = cLISTOPo->op_first;
5818 kid = cLISTOPo->op_first;
5820 if (kid->op_type == OP_PUSHMARK)
5821 kid = kid->op_sibling;
5822 if (kid && o->op_flags & OPf_STACKED)
5823 kid = kid->op_sibling;
5824 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5825 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5826 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5827 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5828 cLISTOPo->op_first->op_sibling = kid;
5829 cLISTOPo->op_last = kid;
5830 kid = kid->op_sibling;
5835 append_elem(o->op_type, o, newDEFSVOP());
5841 if (PL_hints & HINT_LOCALE)
5842 o->op_private |= OPpLOCALE;
5849 Perl_ck_fun_locale(pTHX_ OP *o)
5855 if (PL_hints & HINT_LOCALE)
5856 o->op_private |= OPpLOCALE;
5863 Perl_ck_sassign(pTHX_ OP *o)
5865 OP *kid = cLISTOPo->op_first;
5866 /* has a disposable target? */
5867 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5868 && !(kid->op_flags & OPf_STACKED)
5869 /* Cannot steal the second time! */
5870 && !(kid->op_private & OPpTARGET_MY))
5872 OP *kkid = kid->op_sibling;
5874 /* Can just relocate the target. */
5875 if (kkid && kkid->op_type == OP_PADSV
5876 && !(kkid->op_private & OPpLVAL_INTRO))
5878 kid->op_targ = kkid->op_targ;
5880 /* Now we do not need PADSV and SASSIGN. */
5881 kid->op_sibling = o->op_sibling; /* NULL */
5882 cLISTOPo->op_first = NULL;
5885 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5893 Perl_ck_scmp(pTHX_ OP *o)
5897 if (PL_hints & HINT_LOCALE)
5898 o->op_private |= OPpLOCALE;
5905 Perl_ck_match(pTHX_ OP *o)
5907 o->op_private |= OPpRUNTIME;
5912 Perl_ck_method(pTHX_ OP *o)
5914 OP *kid = cUNOPo->op_first;
5915 if (kid->op_type == OP_CONST) {
5916 SV* sv = kSVOP->op_sv;
5917 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5919 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
5920 sv = newSVpvn_share(SvPVX(sv), SvCUR(sv), 0);
5923 kSVOP->op_sv = Nullsv;
5925 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5934 Perl_ck_null(pTHX_ OP *o)
5940 Perl_ck_open(pTHX_ OP *o)
5942 HV *table = GvHV(PL_hintgv);
5946 svp = hv_fetch(table, "open_IN", 7, FALSE);
5948 mode = mode_from_discipline(*svp);
5949 if (mode & O_BINARY)
5950 o->op_private |= OPpOPEN_IN_RAW;
5951 else if (mode & O_TEXT)
5952 o->op_private |= OPpOPEN_IN_CRLF;
5955 svp = hv_fetch(table, "open_OUT", 8, FALSE);
5957 mode = mode_from_discipline(*svp);
5958 if (mode & O_BINARY)
5959 o->op_private |= OPpOPEN_OUT_RAW;
5960 else if (mode & O_TEXT)
5961 o->op_private |= OPpOPEN_OUT_CRLF;
5964 if (o->op_type == OP_BACKTICK)
5970 Perl_ck_repeat(pTHX_ OP *o)
5972 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5973 o->op_private |= OPpREPEAT_DOLIST;
5974 cBINOPo->op_first = force_list(cBINOPo->op_first);
5982 Perl_ck_require(pTHX_ OP *o)
5984 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5985 SVOP *kid = (SVOP*)cUNOPo->op_first;
5987 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5989 for (s = SvPVX(kid->op_sv); *s; s++) {
5990 if (*s == ':' && s[1] == ':') {
5992 Move(s+2, s+1, strlen(s+2)+1, char);
5993 --SvCUR(kid->op_sv);
5996 if (SvREADONLY(kid->op_sv)) {
5997 SvREADONLY_off(kid->op_sv);
5998 sv_catpvn(kid->op_sv, ".pm", 3);
5999 SvREADONLY_on(kid->op_sv);
6002 sv_catpvn(kid->op_sv, ".pm", 3);
6010 Perl_ck_retarget(pTHX_ OP *o)
6012 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
6019 Perl_ck_select(pTHX_ OP *o)
6022 if (o->op_flags & OPf_KIDS) {
6023 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6024 if (kid && kid->op_sibling) {
6025 o->op_type = OP_SSELECT;
6026 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
6028 return fold_constants(o);
6032 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6033 if (kid && kid->op_type == OP_RV2GV)
6034 kid->op_private &= ~HINT_STRICT_REFS;
6039 Perl_ck_shift(pTHX_ OP *o)
6041 I32 type = o->op_type;
6043 if (!(o->op_flags & OPf_KIDS)) {
6048 if (!CvUNIQUE(PL_compcv)) {
6049 argop = newOP(OP_PADAV, OPf_REF);
6050 argop->op_targ = 0; /* PL_curpad[0] is @_ */
6053 argop = newUNOP(OP_RV2AV, 0,
6054 scalar(newGVOP(OP_GV, 0,
6055 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6058 argop = newUNOP(OP_RV2AV, 0,
6059 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
6060 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6061 #endif /* USE_THREADS */
6062 return newUNOP(type, 0, scalar(argop));
6064 return scalar(modkids(ck_fun(o), type));
6068 Perl_ck_sort(pTHX_ OP *o)
6073 if (PL_hints & HINT_LOCALE)
6074 o->op_private |= OPpLOCALE;
6077 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
6079 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6080 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
6082 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
6084 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
6086 if (kid->op_type == OP_SCOPE) {
6090 else if (kid->op_type == OP_LEAVE) {
6091 if (o->op_type == OP_SORT) {
6092 null(kid); /* wipe out leave */
6095 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
6096 if (k->op_next == kid)
6098 /* don't descend into loops */
6099 else if (k->op_type == OP_ENTERLOOP
6100 || k->op_type == OP_ENTERITER)
6102 k = cLOOPx(k)->op_lastop;
6107 kid->op_next = 0; /* just disconnect the leave */
6108 k = kLISTOP->op_first;
6113 if (o->op_type == OP_SORT) {
6114 /* provide scalar context for comparison function/block */
6120 o->op_flags |= OPf_SPECIAL;
6122 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
6125 firstkid = firstkid->op_sibling;
6128 /* provide list context for arguments */
6129 if (o->op_type == OP_SORT)
6136 S_simplify_sort(pTHX_ OP *o)
6139 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6143 if (!(o->op_flags & OPf_STACKED))
6145 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
6146 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
6147 kid = kUNOP->op_first; /* get past null */
6148 if (kid->op_type != OP_SCOPE)
6150 kid = kLISTOP->op_last; /* get past scope */
6151 switch(kid->op_type) {
6159 k = kid; /* remember this node*/
6160 if (kBINOP->op_first->op_type != OP_RV2SV)
6162 kid = kBINOP->op_first; /* get past cmp */
6163 if (kUNOP->op_first->op_type != OP_GV)
6165 kid = kUNOP->op_first; /* get past rv2sv */
6167 if (GvSTASH(gv) != PL_curstash)
6169 if (strEQ(GvNAME(gv), "a"))
6171 else if (strEQ(GvNAME(gv), "b"))
6175 kid = k; /* back to cmp */
6176 if (kBINOP->op_last->op_type != OP_RV2SV)
6178 kid = kBINOP->op_last; /* down to 2nd arg */
6179 if (kUNOP->op_first->op_type != OP_GV)
6181 kid = kUNOP->op_first; /* get past rv2sv */
6183 if (GvSTASH(gv) != PL_curstash
6185 ? strNE(GvNAME(gv), "a")
6186 : strNE(GvNAME(gv), "b")))
6188 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6190 o->op_private |= OPpSORT_REVERSE;
6191 if (k->op_type == OP_NCMP)
6192 o->op_private |= OPpSORT_NUMERIC;
6193 if (k->op_type == OP_I_NCMP)
6194 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6195 kid = cLISTOPo->op_first->op_sibling;
6196 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6197 op_free(kid); /* then delete it */
6198 cLISTOPo->op_children--;
6202 Perl_ck_split(pTHX_ OP *o)
6206 if (o->op_flags & OPf_STACKED)
6207 return no_fh_allowed(o);
6209 kid = cLISTOPo->op_first;
6210 if (kid->op_type != OP_NULL)
6211 Perl_croak(aTHX_ "panic: ck_split");
6212 kid = kid->op_sibling;
6213 op_free(cLISTOPo->op_first);
6214 cLISTOPo->op_first = kid;
6216 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6217 cLISTOPo->op_last = kid; /* There was only one element previously */
6220 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
6221 OP *sibl = kid->op_sibling;
6222 kid->op_sibling = 0;
6223 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6224 if (cLISTOPo->op_first == cLISTOPo->op_last)
6225 cLISTOPo->op_last = kid;
6226 cLISTOPo->op_first = kid;
6227 kid->op_sibling = sibl;
6230 kid->op_type = OP_PUSHRE;
6231 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6234 if (!kid->op_sibling)
6235 append_elem(OP_SPLIT, o, newDEFSVOP());
6237 kid = kid->op_sibling;
6240 if (!kid->op_sibling)
6241 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6243 kid = kid->op_sibling;
6246 if (kid->op_sibling)
6247 return too_many_arguments(o,PL_op_desc[o->op_type]);
6253 Perl_ck_join(pTHX_ OP *o)
6255 if (ckWARN(WARN_SYNTAX)) {
6256 OP *kid = cLISTOPo->op_first->op_sibling;
6257 if (kid && kid->op_type == OP_MATCH) {
6258 char *pmstr = "STRING";
6259 if (kPMOP->op_pmregexp)
6260 pmstr = kPMOP->op_pmregexp->precomp;
6261 Perl_warner(aTHX_ WARN_SYNTAX,
6262 "/%s/ should probably be written as \"%s\"",
6270 Perl_ck_subr(pTHX_ OP *o)
6273 OP *prev = ((cUNOPo->op_first->op_sibling)
6274 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6275 OP *o2 = prev->op_sibling;
6284 o->op_private |= OPpENTERSUB_HASTARG;
6285 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6286 if (cvop->op_type == OP_RV2CV) {
6288 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6289 null(cvop); /* disable rv2cv */
6290 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6291 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6292 GV *gv = cGVOPx_gv(tmpop);
6295 tmpop->op_private |= OPpEARLY_CV;
6296 else if (SvPOK(cv)) {
6297 namegv = CvANON(cv) ? gv : CvGV(cv);
6298 proto = SvPV((SV*)cv, n_a);
6302 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6303 if (o2->op_type == OP_CONST)
6304 o2->op_private &= ~OPpCONST_STRICT;
6305 else if (o2->op_type == OP_LIST) {
6306 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6307 if (o && o->op_type == OP_CONST)
6308 o->op_private &= ~OPpCONST_STRICT;
6311 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6312 if (PERLDB_SUB && PL_curstash != PL_debstash)
6313 o->op_private |= OPpENTERSUB_DB;
6314 while (o2 != cvop) {
6318 return too_many_arguments(o, gv_ename(namegv));
6336 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6338 arg == 1 ? "block or sub {}" : "sub {}",
6339 gv_ename(namegv), o2);
6342 /* '*' allows any scalar type, including bareword */
6345 if (o2->op_type == OP_RV2GV)
6346 goto wrapref; /* autoconvert GLOB -> GLOBref */
6347 else if (o2->op_type == OP_CONST)
6348 o2->op_private &= ~OPpCONST_STRICT;
6349 else if (o2->op_type == OP_ENTERSUB) {
6350 /* accidental subroutine, revert to bareword */
6351 OP *gvop = ((UNOP*)o2)->op_first;
6352 if (gvop && gvop->op_type == OP_NULL) {
6353 gvop = ((UNOP*)gvop)->op_first;
6355 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6358 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6359 (gvop = ((UNOP*)gvop)->op_first) &&
6360 gvop->op_type == OP_GV)
6362 GV *gv = cGVOPx_gv(gvop);
6363 OP *sibling = o2->op_sibling;
6364 SV *n = newSVpvn("",0);
6366 gv_fullname3(n, gv, "");
6367 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6368 sv_chop(n, SvPVX(n)+6);
6369 o2 = newSVOP(OP_CONST, 0, n);
6370 prev->op_sibling = o2;
6371 o2->op_sibling = sibling;
6383 if (o2->op_type != OP_RV2GV)
6384 bad_type(arg, "symbol", gv_ename(namegv), o2);
6387 if (o2->op_type != OP_ENTERSUB)
6388 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6391 if (o2->op_type != OP_RV2SV
6392 && o2->op_type != OP_PADSV
6393 && o2->op_type != OP_HELEM
6394 && o2->op_type != OP_AELEM
6395 && o2->op_type != OP_THREADSV)
6397 bad_type(arg, "scalar", gv_ename(namegv), o2);
6401 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6402 bad_type(arg, "array", gv_ename(namegv), o2);
6405 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6406 bad_type(arg, "hash", gv_ename(namegv), o2);
6410 OP* sib = kid->op_sibling;
6411 kid->op_sibling = 0;
6412 o2 = newUNOP(OP_REFGEN, 0, kid);
6413 o2->op_sibling = sib;
6414 prev->op_sibling = o2;
6425 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6426 gv_ename(namegv), SvPV((SV*)cv, n_a));
6431 mod(o2, OP_ENTERSUB);
6433 o2 = o2->op_sibling;
6435 if (proto && !optional &&
6436 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6437 return too_few_arguments(o, gv_ename(namegv));
6442 Perl_ck_svconst(pTHX_ OP *o)
6444 SvREADONLY_on(cSVOPo->op_sv);
6449 Perl_ck_trunc(pTHX_ OP *o)
6451 if (o->op_flags & OPf_KIDS) {
6452 SVOP *kid = (SVOP*)cUNOPo->op_first;
6454 if (kid->op_type == OP_NULL)
6455 kid = (SVOP*)kid->op_sibling;
6456 if (kid && kid->op_type == OP_CONST &&
6457 (kid->op_private & OPpCONST_BARE))
6459 o->op_flags |= OPf_SPECIAL;
6460 kid->op_private &= ~OPpCONST_STRICT;
6466 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6469 Perl_peep(pTHX_ register OP *o)
6472 register OP* oldop = 0;
6474 OP *last_composite = Nullop;
6476 if (!o || o->op_seq)
6480 SAVEVPTR(PL_curcop);
6481 for (; o; o = o->op_next) {
6487 switch (o->op_type) {
6491 PL_curcop = ((COP*)o); /* for warnings */
6492 o->op_seq = PL_op_seqmax++;
6493 last_composite = Nullop;
6497 if (cSVOPo->op_private & OPpCONST_STRICT)
6498 no_bareword_allowed(o);
6500 /* Relocate sv to the pad for thread safety.
6501 * Despite being a "constant", the SV is written to,
6502 * for reference counts, sv_upgrade() etc. */
6504 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6505 if (SvPADTMP(cSVOPo->op_sv)) {
6506 /* If op_sv is already a PADTMP then it is being used by
6507 * another pad, so make a copy. */
6508 sv_setsv(PL_curpad[ix],cSVOPo->op_sv);
6509 SvREADONLY_on(PL_curpad[ix]);
6510 SvREFCNT_dec(cSVOPo->op_sv);
6513 SvREFCNT_dec(PL_curpad[ix]);
6514 SvPADTMP_on(cSVOPo->op_sv);
6515 PL_curpad[ix] = cSVOPo->op_sv;
6517 cSVOPo->op_sv = Nullsv;
6521 o->op_seq = PL_op_seqmax++;
6525 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6526 if (o->op_next->op_private & OPpTARGET_MY) {
6527 if (o->op_flags & OPf_STACKED) /* chained concats */
6528 goto ignore_optimization;
6530 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6531 o->op_targ = o->op_next->op_targ;
6532 o->op_next->op_targ = 0;
6533 o->op_private |= OPpTARGET_MY;
6538 ignore_optimization:
6539 o->op_seq = PL_op_seqmax++;
6542 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6543 o->op_seq = PL_op_seqmax++;
6544 break; /* Scalar stub must produce undef. List stub is noop */
6548 if (o->op_targ == OP_NEXTSTATE
6549 || o->op_targ == OP_DBSTATE
6550 || o->op_targ == OP_SETSTATE)
6552 PL_curcop = ((COP*)o);
6559 if (oldop && o->op_next) {
6560 oldop->op_next = o->op_next;
6563 o->op_seq = PL_op_seqmax++;
6567 if (o->op_next->op_type == OP_RV2SV) {
6568 if (!(o->op_next->op_private & OPpDEREF)) {
6570 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6572 o->op_next = o->op_next->op_next;
6573 o->op_type = OP_GVSV;
6574 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6577 else if (o->op_next->op_type == OP_RV2AV) {
6578 OP* pop = o->op_next->op_next;
6580 if (pop->op_type == OP_CONST &&
6581 (PL_op = pop->op_next) &&
6582 pop->op_next->op_type == OP_AELEM &&
6583 !(pop->op_next->op_private &
6584 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6585 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6593 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6594 o->op_next = pop->op_next->op_next;
6595 o->op_type = OP_AELEMFAST;
6596 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6597 o->op_private = (U8)i;
6602 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6604 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6605 /* XXX could check prototype here instead of just carping */
6606 SV *sv = sv_newmortal();
6607 gv_efullname3(sv, gv, Nullch);
6608 Perl_warner(aTHX_ WARN_PROTOTYPE,
6609 "%s() called too early to check prototype",
6614 o->op_seq = PL_op_seqmax++;
6625 o->op_seq = PL_op_seqmax++;
6626 while (cLOGOP->op_other->op_type == OP_NULL)
6627 cLOGOP->op_other = cLOGOP->op_other->op_next;
6628 peep(cLOGOP->op_other);
6632 o->op_seq = PL_op_seqmax++;
6633 peep(cLOOP->op_redoop);
6634 peep(cLOOP->op_nextop);
6635 peep(cLOOP->op_lastop);
6641 o->op_seq = PL_op_seqmax++;
6642 peep(cPMOP->op_pmreplstart);
6646 o->op_seq = PL_op_seqmax++;
6647 if (ckWARN(WARN_SYNTAX) && o->op_next
6648 && o->op_next->op_type == OP_NEXTSTATE) {
6649 if (o->op_next->op_sibling &&
6650 o->op_next->op_sibling->op_type != OP_EXIT &&
6651 o->op_next->op_sibling->op_type != OP_WARN &&
6652 o->op_next->op_sibling->op_type != OP_DIE) {
6653 line_t oldline = CopLINE(PL_curcop);
6655 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6656 Perl_warner(aTHX_ WARN_EXEC,
6657 "Statement unlikely to be reached");
6658 Perl_warner(aTHX_ WARN_EXEC,
6659 "\t(Maybe you meant system() when you said exec()?)\n");
6660 CopLINE_set(PL_curcop, oldline);
6669 SV **svp, **indsvp, *sv;
6674 o->op_seq = PL_op_seqmax++;
6676 if (((BINOP*)o)->op_last->op_type != OP_CONST)
6679 /* Make the CONST have a shared SV */
6680 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6681 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv)) && !IS_PADCONST(sv)) {
6682 key = SvPV(sv, keylen);
6683 lexname = newSVpvn_share(key, keylen, 0);
6688 if ((o->op_private & (OPpLVAL_INTRO)))
6691 rop = (UNOP*)((BINOP*)o)->op_first;
6692 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6694 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6695 if (!SvOBJECT(lexname))
6697 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6698 if (!fields || !GvHV(*fields))
6700 key = SvPV(*svp, keylen);
6701 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6703 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6704 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6706 ind = SvIV(*indsvp);
6708 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6709 rop->op_type = OP_RV2AV;
6710 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6711 o->op_type = OP_AELEM;
6712 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6714 if (SvREADONLY(*svp))
6716 SvFLAGS(sv) |= (SvFLAGS(*svp)
6717 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6727 SV **svp, **indsvp, *sv;
6731 SVOP *first_key_op, *key_op;
6733 o->op_seq = PL_op_seqmax++;
6734 if ((o->op_private & (OPpLVAL_INTRO))
6735 /* I bet there's always a pushmark... */
6736 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
6737 /* hmmm, no optimization if list contains only one key. */
6739 rop = (UNOP*)((LISTOP*)o)->op_last;
6740 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6742 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6743 if (!SvOBJECT(lexname))
6745 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6746 if (!fields || !GvHV(*fields))
6748 /* Again guessing that the pushmark can be jumped over.... */
6749 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
6750 ->op_first->op_sibling;
6751 /* Check that the key list contains only constants. */
6752 for (key_op = first_key_op; key_op;
6753 key_op = (SVOP*)key_op->op_sibling)
6754 if (key_op->op_type != OP_CONST)
6758 rop->op_type = OP_RV2AV;
6759 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6760 o->op_type = OP_ASLICE;
6761 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
6762 for (key_op = first_key_op; key_op;
6763 key_op = (SVOP*)key_op->op_sibling) {
6764 svp = cSVOPx_svp(key_op);
6765 key = SvPV(*svp, keylen);
6766 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6768 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
6769 "in variable %s of type %s",
6770 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6772 ind = SvIV(*indsvp);
6774 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6776 if (SvREADONLY(*svp))
6778 SvFLAGS(sv) |= (SvFLAGS(*svp)
6779 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6788 if (!(o->op_flags & OPf_WANT)
6789 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6793 o->op_seq = PL_op_seqmax++;
6797 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6798 o->op_seq = PL_op_seqmax++;
6804 if (last_composite) {
6805 OP *r = last_composite;
6807 while (r->op_sibling)
6810 || (r->op_next->op_type == OP_LIST
6811 && r->op_next->op_next == o))
6813 if (last_composite->op_type == OP_RV2AV)
6814 yyerror("Lvalue subs returning arrays not implemented yet");
6816 yyerror("Lvalue subs returning hashes not implemented yet");
6823 o->op_seq = PL_op_seqmax++;