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)) && !IS_PADGV(sv))
503 SvFLAGS(sv) |= tmptype;
504 PL_curpad = AvARRAY(PL_comppad);
506 DEBUG_X(PerlIO_printf(Perl_debug_log,
507 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
508 PTR2UV(thr), PTR2UV(PL_curpad),
509 (long) retval, PL_op_name[optype]));
511 DEBUG_X(PerlIO_printf(Perl_debug_log,
512 "Pad 0x%"UVxf" alloc %ld for %s\n",
514 (long) retval, PL_op_name[optype]));
515 #endif /* USE_THREADS */
516 return (PADOFFSET)retval;
520 Perl_pad_sv(pTHX_ PADOFFSET po)
524 DEBUG_X(PerlIO_printf(Perl_debug_log,
525 "0x%"UVxf" Pad 0x%"UVxf" sv %"IVdf"\n",
526 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
529 Perl_croak(aTHX_ "panic: pad_sv po");
530 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %"IVdf"\n",
531 PTR2UV(PL_curpad), (IV)po));
532 #endif /* USE_THREADS */
533 return PL_curpad[po]; /* eventually we'll turn this into a macro */
537 Perl_pad_free(pTHX_ PADOFFSET po)
542 if (AvARRAY(PL_comppad) != PL_curpad)
543 Perl_croak(aTHX_ "panic: pad_free curpad");
545 Perl_croak(aTHX_ "panic: pad_free po");
547 DEBUG_X(PerlIO_printf(Perl_debug_log,
548 "0x%"UVxf" Pad 0x%"UVxf" free %"IVdf"\n",
549 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
551 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %"IVdf"\n",
552 PTR2UV(PL_curpad), (IV)po));
553 #endif /* USE_THREADS */
554 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
555 SvPADTMP_off(PL_curpad[po]);
557 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
560 if ((I32)po < PL_padix)
565 Perl_pad_swipe(pTHX_ PADOFFSET po)
568 if (AvARRAY(PL_comppad) != PL_curpad)
569 Perl_croak(aTHX_ "panic: pad_swipe curpad");
571 Perl_croak(aTHX_ "panic: pad_swipe po");
573 DEBUG_X(PerlIO_printf(Perl_debug_log,
574 "0x%"UVxf" Pad 0x%"UVxf" swipe %"IVdf"\n",
575 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
577 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %"IVdf"\n",
578 PTR2UV(PL_curpad), (IV)po));
579 #endif /* USE_THREADS */
580 SvPADTMP_off(PL_curpad[po]);
581 PL_curpad[po] = NEWSV(1107,0);
582 SvPADTMP_on(PL_curpad[po]);
583 if ((I32)po < PL_padix)
587 /* XXX pad_reset() is currently disabled because it results in serious bugs.
588 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
589 * on the stack by OPs that use them, there are several ways to get an alias
590 * to a shared TARG. Such an alias will change randomly and unpredictably.
591 * We avoid doing this until we can think of a Better Way.
596 #ifdef USE_BROKEN_PAD_RESET
600 if (AvARRAY(PL_comppad) != PL_curpad)
601 Perl_croak(aTHX_ "panic: pad_reset curpad");
603 DEBUG_X(PerlIO_printf(Perl_debug_log,
604 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
605 PTR2UV(thr), PTR2UV(PL_curpad)));
607 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
609 #endif /* USE_THREADS */
610 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
611 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
612 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
613 SvPADTMP_off(PL_curpad[po]);
615 PL_padix = PL_padix_floor;
618 PL_pad_reset_pending = FALSE;
622 /* find_threadsv is not reentrant */
624 Perl_find_threadsv(pTHX_ const char *name)
630 /* We currently only handle names of a single character */
631 p = strchr(PL_threadsv_names, *name);
634 key = p - PL_threadsv_names;
635 MUTEX_LOCK(&thr->mutex);
636 svp = av_fetch(thr->threadsv, key, FALSE);
638 MUTEX_UNLOCK(&thr->mutex);
640 SV *sv = NEWSV(0, 0);
641 av_store(thr->threadsv, key, sv);
642 thr->threadsvp = AvARRAY(thr->threadsv);
643 MUTEX_UNLOCK(&thr->mutex);
645 * Some magic variables used to be automagically initialised
646 * in gv_fetchpv. Those which are now per-thread magicals get
647 * initialised here instead.
653 sv_setpv(sv, "\034");
654 sv_magic(sv, 0, 0, name, 1);
659 PL_sawampersand = TRUE;
673 /* XXX %! tied to Errno.pm needs to be added here.
674 * See gv_fetchpv(). */
678 sv_magic(sv, 0, 0, name, 1);
680 DEBUG_S(PerlIO_printf(Perl_error_log,
681 "find_threadsv: new SV %p for $%s%c\n",
682 sv, (*name < 32) ? "^" : "",
683 (*name < 32) ? toCTRL(*name) : *name));
687 #endif /* USE_THREADS */
692 Perl_op_free(pTHX_ OP *o)
694 register OP *kid, *nextkid;
697 if (!o || o->op_seq == (U16)-1)
700 if (o->op_private & OPpREFCOUNTED) {
701 switch (o->op_type) {
709 if (OpREFCNT_dec(o)) {
720 if (o->op_flags & OPf_KIDS) {
721 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
722 nextkid = kid->op_sibling; /* Get before next freeing kid */
730 /* COP* is not cleared by op_clear() so that we may track line
731 * numbers etc even after null() */
732 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
737 #ifdef PL_OP_SLAB_ALLOC
738 if ((char *) o == PL_OpPtr)
747 S_op_clear(pTHX_ OP *o)
749 switch (o->op_type) {
750 case OP_NULL: /* Was holding old type, if any. */
751 case OP_ENTEREVAL: /* Was holding hints. */
753 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
759 if (!(o->op_flags & OPf_SPECIAL))
762 #endif /* USE_THREADS */
764 if (!(o->op_flags & OPf_REF)
765 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
772 if (cPADOPo->op_padix > 0) {
775 pad_swipe(cPADOPo->op_padix);
776 /* No GvIN_PAD_off(gv) here, because other references may still
777 * exist on the pad */
780 cPADOPo->op_padix = 0;
783 SvREFCNT_dec(cSVOPo->op_sv);
784 cSVOPo->op_sv = Nullsv;
787 case OP_METHOD_NAMED:
789 SvREFCNT_dec(cSVOPo->op_sv);
790 cSVOPo->op_sv = Nullsv;
796 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
800 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
801 SvREFCNT_dec(cSVOPo->op_sv);
802 cSVOPo->op_sv = Nullsv;
805 Safefree(cPVOPo->op_pv);
806 cPVOPo->op_pv = Nullch;
810 op_free(cPMOPo->op_pmreplroot);
814 if ((PADOFFSET)cPMOPo->op_pmreplroot) {
816 GV *gv = (GV*)PL_curpad[(PADOFFSET)cPMOPo->op_pmreplroot];
817 pad_swipe((PADOFFSET)cPMOPo->op_pmreplroot);
818 /* No GvIN_PAD_off(gv) here, because other references may still
819 * exist on the pad */
824 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
830 cPMOPo->op_pmreplroot = Nullop;
831 ReREFCNT_dec(cPMOPo->op_pmregexp);
832 cPMOPo->op_pmregexp = (REGEXP*)NULL;
836 if (o->op_targ > 0) {
837 pad_free(o->op_targ);
843 S_cop_free(pTHX_ COP* cop)
845 Safefree(cop->cop_label);
847 Safefree(CopFILE(cop)); /* XXX share in a pvtable? */
848 Safefree(CopSTASHPV(cop)); /* XXX share in a pvtable? */
850 /* NOTE: COP.cop_stash is not refcounted */
851 SvREFCNT_dec(CopFILEGV(cop));
853 if (! specialWARN(cop->cop_warnings))
854 SvREFCNT_dec(cop->cop_warnings);
860 if (o->op_type == OP_NULL)
863 o->op_targ = o->op_type;
864 o->op_type = OP_NULL;
865 o->op_ppaddr = PL_ppaddr[OP_NULL];
868 /* Contextualizers */
870 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
873 Perl_linklist(pTHX_ OP *o)
880 /* establish postfix order */
881 if (cUNOPo->op_first) {
882 o->op_next = LINKLIST(cUNOPo->op_first);
883 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
885 kid->op_next = LINKLIST(kid->op_sibling);
897 Perl_scalarkids(pTHX_ OP *o)
900 if (o && o->op_flags & OPf_KIDS) {
901 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
908 S_scalarboolean(pTHX_ OP *o)
910 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
912 if (ckWARN(WARN_SYNTAX)) {
913 line_t oldline = CopLINE(PL_curcop);
915 if (PL_copline != NOLINE)
916 CopLINE_set(PL_curcop, PL_copline);
917 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
918 CopLINE_set(PL_curcop, oldline);
925 Perl_scalar(pTHX_ OP *o)
929 /* assumes no premature commitment */
930 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
931 || o->op_type == OP_RETURN)
936 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
938 switch (o->op_type) {
940 if (o->op_private & OPpREPEAT_DOLIST)
941 null(((LISTOP*)cBINOPo->op_first)->op_first);
942 scalar(cBINOPo->op_first);
947 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
951 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
952 if (!kPMOP->op_pmreplroot)
953 deprecate("implicit split to @_");
961 if (o->op_flags & OPf_KIDS) {
962 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
968 kid = cLISTOPo->op_first;
970 while ((kid = kid->op_sibling)) {
976 WITH_THR(PL_curcop = &PL_compiling);
981 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
987 WITH_THR(PL_curcop = &PL_compiling);
994 Perl_scalarvoid(pTHX_ OP *o)
1001 if (o->op_type == OP_NEXTSTATE
1002 || o->op_type == OP_SETSTATE
1003 || o->op_type == OP_DBSTATE
1004 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1005 || o->op_targ == OP_SETSTATE
1006 || o->op_targ == OP_DBSTATE)))
1009 PL_curcop = (COP*)o; /* for warning below */
1012 /* assumes no premature commitment */
1013 want = o->op_flags & OPf_WANT;
1014 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
1015 || o->op_type == OP_RETURN)
1020 if ((o->op_private & OPpTARGET_MY)
1021 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1023 return scalar(o); /* As if inside SASSIGN */
1026 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1028 switch (o->op_type) {
1030 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1034 if (o->op_flags & OPf_STACKED)
1038 if (o->op_private == 4)
1080 case OP_GETSOCKNAME:
1081 case OP_GETPEERNAME:
1086 case OP_GETPRIORITY:
1109 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1110 useless = PL_op_desc[o->op_type];
1117 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1118 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1119 useless = "a variable";
1124 if (cSVOPo->op_private & OPpCONST_STRICT)
1125 no_bareword_allowed(o);
1128 if (ckWARN(WARN_VOID)) {
1129 useless = "a constant";
1130 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1132 else if (SvPOK(sv)) {
1133 if (strnEQ(SvPVX(sv), "di", 2) ||
1134 strnEQ(SvPVX(sv), "ds", 2) ||
1135 strnEQ(SvPVX(sv), "ig", 2))
1140 null(o); /* don't execute or even remember it */
1144 o->op_type = OP_PREINC; /* pre-increment is faster */
1145 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1149 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1150 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1156 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1161 if (o->op_flags & OPf_STACKED)
1168 if (!(o->op_flags & OPf_KIDS))
1177 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1184 /* all requires must return a boolean value */
1185 o->op_flags &= ~OPf_WANT;
1190 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1191 if (!kPMOP->op_pmreplroot)
1192 deprecate("implicit split to @_");
1198 if (ckWARN(WARN_VOID))
1199 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1205 Perl_listkids(pTHX_ OP *o)
1208 if (o && o->op_flags & OPf_KIDS) {
1209 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1216 Perl_list(pTHX_ OP *o)
1220 /* assumes no premature commitment */
1221 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1222 || o->op_type == OP_RETURN)
1227 if ((o->op_private & OPpTARGET_MY)
1228 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1230 return o; /* As if inside SASSIGN */
1233 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1235 switch (o->op_type) {
1238 list(cBINOPo->op_first);
1243 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1251 if (!(o->op_flags & OPf_KIDS))
1253 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1254 list(cBINOPo->op_first);
1255 return gen_constant_list(o);
1262 kid = cLISTOPo->op_first;
1264 while ((kid = kid->op_sibling)) {
1265 if (kid->op_sibling)
1270 WITH_THR(PL_curcop = &PL_compiling);
1274 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1275 if (kid->op_sibling)
1280 WITH_THR(PL_curcop = &PL_compiling);
1283 /* all requires must return a boolean value */
1284 o->op_flags &= ~OPf_WANT;
1291 Perl_scalarseq(pTHX_ OP *o)
1296 if (o->op_type == OP_LINESEQ ||
1297 o->op_type == OP_SCOPE ||
1298 o->op_type == OP_LEAVE ||
1299 o->op_type == OP_LEAVETRY)
1302 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1303 if (kid->op_sibling) {
1307 PL_curcop = &PL_compiling;
1309 o->op_flags &= ~OPf_PARENS;
1310 if (PL_hints & HINT_BLOCK_SCOPE)
1311 o->op_flags |= OPf_PARENS;
1314 o = newOP(OP_STUB, 0);
1319 S_modkids(pTHX_ OP *o, I32 type)
1322 if (o && o->op_flags & OPf_KIDS) {
1323 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1330 Perl_mod(pTHX_ OP *o, I32 type)
1336 if (!o || PL_error_count)
1339 if ((o->op_private & OPpTARGET_MY)
1340 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1345 switch (o->op_type) {
1350 if (!(o->op_private & (OPpCONST_ARYBASE)))
1352 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1353 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1357 SAVEI32(PL_compiling.cop_arybase);
1358 PL_compiling.cop_arybase = 0;
1360 else if (type == OP_REFGEN)
1363 Perl_croak(aTHX_ "That use of $[ is unsupported");
1366 if (o->op_flags & OPf_PARENS)
1370 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1371 !(o->op_flags & OPf_STACKED)) {
1372 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1373 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1374 assert(cUNOPo->op_first->op_type == OP_NULL);
1375 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1378 else { /* lvalue subroutine call */
1379 o->op_private |= OPpLVAL_INTRO;
1380 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1381 /* Backward compatibility mode: */
1382 o->op_private |= OPpENTERSUB_INARGS;
1385 else { /* Compile-time error message: */
1386 OP *kid = cUNOPo->op_first;
1390 if (kid->op_type == OP_PUSHMARK)
1392 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1394 "panic: unexpected lvalue entersub "
1395 "args: type/targ %ld:%ld",
1396 (long)kid->op_type,kid->op_targ);
1397 kid = kLISTOP->op_first;
1399 while (kid->op_sibling)
1400 kid = kid->op_sibling;
1401 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1403 if (kid->op_type == OP_METHOD_NAMED
1404 || kid->op_type == OP_METHOD)
1408 if (kid->op_sibling || kid->op_next != kid) {
1409 yyerror("panic: unexpected optree near method call");
1413 NewOp(1101, newop, 1, UNOP);
1414 newop->op_type = OP_RV2CV;
1415 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1416 newop->op_first = Nullop;
1417 newop->op_next = (OP*)newop;
1418 kid->op_sibling = (OP*)newop;
1419 newop->op_private |= OPpLVAL_INTRO;
1423 if (kid->op_type != OP_RV2CV)
1425 "panic: unexpected lvalue entersub "
1426 "entry via type/targ %ld:%ld",
1427 (long)kid->op_type,kid->op_targ);
1428 kid->op_private |= OPpLVAL_INTRO;
1429 break; /* Postpone until runtime */
1433 kid = kUNOP->op_first;
1434 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1435 kid = kUNOP->op_first;
1436 if (kid->op_type == OP_NULL)
1438 "Unexpected constant lvalue entersub "
1439 "entry via type/targ %ld:%ld",
1440 (long)kid->op_type,kid->op_targ);
1441 if (kid->op_type != OP_GV) {
1442 /* Restore RV2CV to check lvalueness */
1444 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1445 okid->op_next = kid->op_next;
1446 kid->op_next = okid;
1449 okid->op_next = Nullop;
1450 okid->op_type = OP_RV2CV;
1452 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1453 okid->op_private |= OPpLVAL_INTRO;
1457 cv = GvCV(kGVOP_gv);
1467 /* grep, foreach, subcalls, refgen */
1468 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1470 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1471 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1473 : (o->op_type == OP_ENTERSUB
1474 ? "non-lvalue subroutine call"
1475 : PL_op_desc[o->op_type])),
1476 type ? PL_op_desc[type] : "local"));
1490 case OP_RIGHT_SHIFT:
1499 if (!(o->op_flags & OPf_STACKED))
1505 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1511 if (!type && cUNOPo->op_first->op_type != OP_GV)
1512 Perl_croak(aTHX_ "Can't localize through a reference");
1513 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1514 PL_modcount = 10000;
1515 return o; /* Treat \(@foo) like ordinary list. */
1519 if (scalar_mod_type(o, type))
1521 ref(cUNOPo->op_first, o->op_type);
1530 PL_modcount = 10000;
1533 if (!type && cUNOPo->op_first->op_type != OP_GV)
1534 Perl_croak(aTHX_ "Can't localize through a reference");
1535 ref(cUNOPo->op_first, o->op_type);
1539 PL_hints |= HINT_BLOCK_SCOPE;
1549 PL_modcount = 10000;
1550 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1551 return o; /* Treat \(@foo) like ordinary list. */
1552 if (scalar_mod_type(o, type))
1558 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1559 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1564 PL_modcount++; /* XXX ??? */
1566 #endif /* USE_THREADS */
1572 if (type != OP_SASSIGN)
1576 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1582 pad_free(o->op_targ);
1583 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1584 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1585 if (o->op_flags & OPf_KIDS)
1586 mod(cBINOPo->op_first->op_sibling, type);
1591 ref(cBINOPo->op_first, o->op_type);
1592 if (type == OP_ENTERSUB &&
1593 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1594 o->op_private |= OPpLVAL_DEFER;
1601 if (o->op_flags & OPf_KIDS)
1602 mod(cLISTOPo->op_last, type);
1606 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1608 else if (!(o->op_flags & OPf_KIDS))
1610 if (o->op_targ != OP_LIST) {
1611 mod(cBINOPo->op_first, type);
1616 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1620 o->op_flags |= OPf_MOD;
1622 if (type == OP_AASSIGN || type == OP_SASSIGN)
1623 o->op_flags |= OPf_SPECIAL|OPf_REF;
1625 o->op_private |= OPpLVAL_INTRO;
1626 o->op_flags &= ~OPf_SPECIAL;
1627 PL_hints |= HINT_BLOCK_SCOPE;
1629 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1630 o->op_flags |= OPf_REF;
1635 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1639 if (o->op_type == OP_RV2GV)
1663 case OP_RIGHT_SHIFT:
1682 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1684 switch (o->op_type) {
1692 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1705 Perl_refkids(pTHX_ OP *o, I32 type)
1708 if (o && o->op_flags & OPf_KIDS) {
1709 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1716 Perl_ref(pTHX_ OP *o, I32 type)
1720 if (!o || PL_error_count)
1723 switch (o->op_type) {
1725 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1726 !(o->op_flags & OPf_STACKED)) {
1727 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1728 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1729 assert(cUNOPo->op_first->op_type == OP_NULL);
1730 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1731 o->op_flags |= OPf_SPECIAL;
1736 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1740 if (type == OP_DEFINED)
1741 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1742 ref(cUNOPo->op_first, o->op_type);
1745 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1746 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1747 : type == OP_RV2HV ? OPpDEREF_HV
1749 o->op_flags |= OPf_MOD;
1754 o->op_flags |= OPf_MOD; /* XXX ??? */
1759 o->op_flags |= OPf_REF;
1762 if (type == OP_DEFINED)
1763 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1764 ref(cUNOPo->op_first, o->op_type);
1769 o->op_flags |= OPf_REF;
1774 if (!(o->op_flags & OPf_KIDS))
1776 ref(cBINOPo->op_first, type);
1780 ref(cBINOPo->op_first, o->op_type);
1781 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1782 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1783 : type == OP_RV2HV ? OPpDEREF_HV
1785 o->op_flags |= OPf_MOD;
1793 if (!(o->op_flags & OPf_KIDS))
1795 ref(cLISTOPo->op_last, type);
1805 S_dup_attrlist(pTHX_ OP *o)
1809 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1810 * where the first kid is OP_PUSHMARK and the remaining ones
1811 * are OP_CONST. We need to push the OP_CONST values.
1813 if (o->op_type == OP_CONST)
1814 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1816 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1817 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1818 if (o->op_type == OP_CONST)
1819 rop = append_elem(OP_LIST, rop,
1820 newSVOP(OP_CONST, o->op_flags,
1821 SvREFCNT_inc(cSVOPo->op_sv)));
1828 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1832 /* fake up C<use attributes $pkg,$rv,@attrs> */
1833 ENTER; /* need to protect against side-effects of 'use' */
1835 if (stash && HvNAME(stash))
1836 stashsv = newSVpv(HvNAME(stash), 0);
1838 stashsv = &PL_sv_no;
1840 #define ATTRSMODULE "attributes"
1842 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1843 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1845 prepend_elem(OP_LIST,
1846 newSVOP(OP_CONST, 0, stashsv),
1847 prepend_elem(OP_LIST,
1848 newSVOP(OP_CONST, 0,
1850 dup_attrlist(attrs))));
1855 Perl_apply_attrs_string(pTHX_ char *stashpv, CV *cv,
1856 char *attrstr, STRLEN len)
1861 len = strlen(attrstr);
1865 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
1867 char *sstr = attrstr;
1868 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
1869 attrs = append_elem(OP_LIST, attrs,
1870 newSVOP(OP_CONST, 0,
1871 newSVpvn(sstr, attrstr-sstr)));
1875 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1876 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1877 Nullsv, prepend_elem(OP_LIST,
1878 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
1879 prepend_elem(OP_LIST,
1880 newSVOP(OP_CONST, 0,
1886 S_my_kid(pTHX_ OP *o, OP *attrs)
1891 if (!o || PL_error_count)
1895 if (type == OP_LIST) {
1896 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1898 } else if (type == OP_UNDEF) {
1900 } else if (type == OP_RV2SV || /* "our" declaration */
1902 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1903 o->op_private |= OPpOUR_INTRO;
1905 } else if (type != OP_PADSV &&
1908 type != OP_PUSHMARK)
1910 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1911 PL_op_desc[o->op_type],
1912 PL_in_my == KEY_our ? "our" : "my"));
1915 else if (attrs && type != OP_PUSHMARK) {
1921 PL_in_my_stash = Nullhv;
1923 /* check for C<my Dog $spot> when deciding package */
1924 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1925 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1926 stash = SvSTASH(*namesvp);
1928 stash = PL_curstash;
1929 padsv = PAD_SV(o->op_targ);
1930 apply_attrs(stash, padsv, attrs);
1932 o->op_flags |= OPf_MOD;
1933 o->op_private |= OPpLVAL_INTRO;
1938 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1940 if (o->op_flags & OPf_PARENS)
1944 o = my_kid(o, attrs);
1946 PL_in_my_stash = Nullhv;
1951 Perl_my(pTHX_ OP *o)
1953 return my_kid(o, Nullop);
1957 Perl_sawparens(pTHX_ OP *o)
1960 o->op_flags |= OPf_PARENS;
1965 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1970 if (ckWARN(WARN_MISC) &&
1971 (left->op_type == OP_RV2AV ||
1972 left->op_type == OP_RV2HV ||
1973 left->op_type == OP_PADAV ||
1974 left->op_type == OP_PADHV)) {
1975 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1976 right->op_type == OP_TRANS)
1977 ? right->op_type : OP_MATCH];
1978 const char *sample = ((left->op_type == OP_RV2AV ||
1979 left->op_type == OP_PADAV)
1980 ? "@array" : "%hash");
1981 Perl_warner(aTHX_ WARN_MISC,
1982 "Applying %s to %s will act on scalar(%s)",
1983 desc, sample, sample);
1986 if (right->op_type == OP_MATCH ||
1987 right->op_type == OP_SUBST ||
1988 right->op_type == OP_TRANS) {
1989 right->op_flags |= OPf_STACKED;
1990 if (right->op_type != OP_MATCH)
1991 left = mod(left, right->op_type);
1992 if (right->op_type == OP_TRANS)
1993 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1995 o = prepend_elem(right->op_type, scalar(left), right);
1997 return newUNOP(OP_NOT, 0, scalar(o));
2001 return bind_match(type, left,
2002 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
2006 Perl_invert(pTHX_ OP *o)
2010 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
2011 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2015 Perl_scope(pTHX_ OP *o)
2018 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2019 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2020 o->op_type = OP_LEAVE;
2021 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2024 if (o->op_type == OP_LINESEQ) {
2026 o->op_type = OP_SCOPE;
2027 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2028 kid = ((LISTOP*)o)->op_first;
2029 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2033 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
2040 Perl_save_hints(pTHX)
2043 SAVESPTR(GvHV(PL_hintgv));
2044 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
2045 SAVEFREESV(GvHV(PL_hintgv));
2049 Perl_block_start(pTHX_ int full)
2052 int retval = PL_savestack_ix;
2054 SAVEI32(PL_comppad_name_floor);
2055 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
2057 PL_comppad_name_fill = PL_comppad_name_floor;
2058 if (PL_comppad_name_floor < 0)
2059 PL_comppad_name_floor = 0;
2060 SAVEI32(PL_min_intro_pending);
2061 SAVEI32(PL_max_intro_pending);
2062 PL_min_intro_pending = 0;
2063 SAVEI32(PL_comppad_name_fill);
2064 SAVEI32(PL_padix_floor);
2065 PL_padix_floor = PL_padix;
2066 PL_pad_reset_pending = FALSE;
2068 PL_hints &= ~HINT_BLOCK_SCOPE;
2069 SAVESPTR(PL_compiling.cop_warnings);
2070 if (! specialWARN(PL_compiling.cop_warnings)) {
2071 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2072 SAVEFREESV(PL_compiling.cop_warnings) ;
2078 Perl_block_end(pTHX_ I32 floor, OP *seq)
2081 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2082 OP* retval = scalarseq(seq);
2084 PL_pad_reset_pending = FALSE;
2085 PL_compiling.op_private = PL_hints;
2087 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2088 pad_leavemy(PL_comppad_name_fill);
2097 OP *o = newOP(OP_THREADSV, 0);
2098 o->op_targ = find_threadsv("_");
2101 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2102 #endif /* USE_THREADS */
2106 Perl_newPROG(pTHX_ OP *o)
2112 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2113 ((PL_in_eval & EVAL_KEEPERR)
2114 ? OPf_SPECIAL : 0), o);
2115 PL_eval_start = linklist(PL_eval_root);
2116 PL_eval_root->op_private |= OPpREFCOUNTED;
2117 OpREFCNT_set(PL_eval_root, 1);
2118 PL_eval_root->op_next = 0;
2119 peep(PL_eval_start);
2124 PL_main_root = scope(sawparens(scalarvoid(o)));
2125 PL_curcop = &PL_compiling;
2126 PL_main_start = LINKLIST(PL_main_root);
2127 PL_main_root->op_private |= OPpREFCOUNTED;
2128 OpREFCNT_set(PL_main_root, 1);
2129 PL_main_root->op_next = 0;
2130 peep(PL_main_start);
2133 /* Register with debugger */
2135 CV *cv = get_cv("DB::postponed", FALSE);
2139 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2141 call_sv((SV*)cv, G_DISCARD);
2148 Perl_localize(pTHX_ OP *o, I32 lex)
2150 if (o->op_flags & OPf_PARENS)
2154 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2156 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2157 if (*s == ';' || *s == '=')
2158 Perl_warner(aTHX_ WARN_PARENTHESIS,
2159 "Parentheses missing around \"%s\" list",
2160 lex ? (PL_in_my == KEY_our ? "our" : "my") : "local");
2166 o = mod(o, OP_NULL); /* a bit kludgey */
2168 PL_in_my_stash = Nullhv;
2173 Perl_jmaybe(pTHX_ OP *o)
2175 if (o->op_type == OP_LIST) {
2178 o2 = newOP(OP_THREADSV, 0);
2179 o2->op_targ = find_threadsv(";");
2181 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2182 #endif /* USE_THREADS */
2183 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2189 Perl_fold_constants(pTHX_ register OP *o)
2193 I32 type = o->op_type;
2196 if (PL_opargs[type] & OA_RETSCALAR)
2198 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2199 o->op_targ = pad_alloc(type, SVs_PADTMP);
2201 /* integerize op, unless it happens to be C<-foo>.
2202 * XXX should pp_i_negate() do magic string negation instead? */
2203 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2204 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2205 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2207 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2210 if (!(PL_opargs[type] & OA_FOLDCONST))
2215 /* XXX might want a ck_negate() for this */
2216 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2229 if (o->op_private & OPpLOCALE)
2234 goto nope; /* Don't try to run w/ errors */
2236 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2237 if ((curop->op_type != OP_CONST ||
2238 (curop->op_private & OPpCONST_BARE)) &&
2239 curop->op_type != OP_LIST &&
2240 curop->op_type != OP_SCALAR &&
2241 curop->op_type != OP_NULL &&
2242 curop->op_type != OP_PUSHMARK)
2248 curop = LINKLIST(o);
2252 sv = *(PL_stack_sp--);
2253 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2254 pad_swipe(o->op_targ);
2255 else if (SvTEMP(sv)) { /* grab mortal temp? */
2256 (void)SvREFCNT_inc(sv);
2260 if (type == OP_RV2GV)
2261 return newGVOP(OP_GV, 0, (GV*)sv);
2263 /* try to smush double to int, but don't smush -2.0 to -2 */
2264 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2268 if ((NV)iv == SvNV(sv)) {
2273 SvIOK_off(sv); /* undo SvIV() damage */
2275 return newSVOP(OP_CONST, 0, sv);
2279 if (!(PL_opargs[type] & OA_OTHERINT))
2282 if (!(PL_hints & HINT_INTEGER)) {
2283 if (type == OP_MODULO
2284 || type == OP_DIVIDE
2285 || !(o->op_flags & OPf_KIDS))
2290 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2291 if (curop->op_type == OP_CONST) {
2292 if (SvIOK(((SVOP*)curop)->op_sv))
2296 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2300 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2307 Perl_gen_constant_list(pTHX_ register OP *o)
2311 I32 oldtmps_floor = PL_tmps_floor;
2315 return o; /* Don't attempt to run with errors */
2317 PL_op = curop = LINKLIST(o);
2324 PL_tmps_floor = oldtmps_floor;
2326 o->op_type = OP_RV2AV;
2327 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2328 curop = ((UNOP*)o)->op_first;
2329 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2336 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2341 if (!o || o->op_type != OP_LIST)
2342 o = newLISTOP(OP_LIST, 0, o, Nullop);
2344 o->op_flags &= ~OPf_WANT;
2346 if (!(PL_opargs[type] & OA_MARK))
2347 null(cLISTOPo->op_first);
2350 o->op_ppaddr = PL_ppaddr[type];
2351 o->op_flags |= flags;
2353 o = CHECKOP(type, o);
2354 if (o->op_type != type)
2357 if (cLISTOPo->op_children < 7) {
2358 /* XXX do we really need to do this if we're done appending?? */
2359 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2361 cLISTOPo->op_last = last; /* in case check substituted last arg */
2364 return fold_constants(o);
2367 /* List constructors */
2370 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2378 if (first->op_type != type
2379 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2381 return newLISTOP(type, 0, first, last);
2384 if (first->op_flags & OPf_KIDS)
2385 ((LISTOP*)first)->op_last->op_sibling = last;
2387 first->op_flags |= OPf_KIDS;
2388 ((LISTOP*)first)->op_first = last;
2390 ((LISTOP*)first)->op_last = last;
2391 ((LISTOP*)first)->op_children++;
2396 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2404 if (first->op_type != type)
2405 return prepend_elem(type, (OP*)first, (OP*)last);
2407 if (last->op_type != type)
2408 return append_elem(type, (OP*)first, (OP*)last);
2410 first->op_last->op_sibling = last->op_first;
2411 first->op_last = last->op_last;
2412 first->op_children += last->op_children;
2413 if (first->op_children)
2414 first->op_flags |= OPf_KIDS;
2416 #ifdef PL_OP_SLAB_ALLOC
2424 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2432 if (last->op_type == type) {
2433 if (type == OP_LIST) { /* already a PUSHMARK there */
2434 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2435 ((LISTOP*)last)->op_first->op_sibling = first;
2438 if (!(last->op_flags & OPf_KIDS)) {
2439 ((LISTOP*)last)->op_last = first;
2440 last->op_flags |= OPf_KIDS;
2442 first->op_sibling = ((LISTOP*)last)->op_first;
2443 ((LISTOP*)last)->op_first = first;
2445 ((LISTOP*)last)->op_children++;
2449 return newLISTOP(type, 0, first, last);
2455 Perl_newNULLLIST(pTHX)
2457 return newOP(OP_STUB, 0);
2461 Perl_force_list(pTHX_ OP *o)
2463 if (!o || o->op_type != OP_LIST)
2464 o = newLISTOP(OP_LIST, 0, o, Nullop);
2470 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2474 NewOp(1101, listop, 1, LISTOP);
2476 listop->op_type = type;
2477 listop->op_ppaddr = PL_ppaddr[type];
2478 listop->op_children = (first != 0) + (last != 0);
2479 listop->op_flags = flags;
2483 else if (!first && last)
2486 first->op_sibling = last;
2487 listop->op_first = first;
2488 listop->op_last = last;
2489 if (type == OP_LIST) {
2491 pushop = newOP(OP_PUSHMARK, 0);
2492 pushop->op_sibling = first;
2493 listop->op_first = pushop;
2494 listop->op_flags |= OPf_KIDS;
2496 listop->op_last = pushop;
2498 else if (listop->op_children)
2499 listop->op_flags |= OPf_KIDS;
2505 Perl_newOP(pTHX_ I32 type, I32 flags)
2508 NewOp(1101, o, 1, OP);
2510 o->op_ppaddr = PL_ppaddr[type];
2511 o->op_flags = flags;
2514 o->op_private = 0 + (flags >> 8);
2515 if (PL_opargs[type] & OA_RETSCALAR)
2517 if (PL_opargs[type] & OA_TARGET)
2518 o->op_targ = pad_alloc(type, SVs_PADTMP);
2519 return CHECKOP(type, o);
2523 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2528 first = newOP(OP_STUB, 0);
2529 if (PL_opargs[type] & OA_MARK)
2530 first = force_list(first);
2532 NewOp(1101, unop, 1, UNOP);
2533 unop->op_type = type;
2534 unop->op_ppaddr = PL_ppaddr[type];
2535 unop->op_first = first;
2536 unop->op_flags = flags | OPf_KIDS;
2537 unop->op_private = 1 | (flags >> 8);
2538 unop = (UNOP*) CHECKOP(type, unop);
2542 return fold_constants((OP *) unop);
2546 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2549 NewOp(1101, binop, 1, BINOP);
2552 first = newOP(OP_NULL, 0);
2554 binop->op_type = type;
2555 binop->op_ppaddr = PL_ppaddr[type];
2556 binop->op_first = first;
2557 binop->op_flags = flags | OPf_KIDS;
2560 binop->op_private = 1 | (flags >> 8);
2563 binop->op_private = 2 | (flags >> 8);
2564 first->op_sibling = last;
2567 binop = (BINOP*)CHECKOP(type, binop);
2568 if (binop->op_next || binop->op_type != type)
2571 binop->op_last = binop->op_first->op_sibling;
2573 return fold_constants((OP *)binop);
2577 utf8compare(const void *a, const void *b)
2580 for (i = 0; i < 10; i++) {
2581 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2583 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2590 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2592 SV *tstr = ((SVOP*)expr)->op_sv;
2593 SV *rstr = ((SVOP*)repl)->op_sv;
2596 register U8 *t = (U8*)SvPV(tstr, tlen);
2597 register U8 *r = (U8*)SvPV(rstr, rlen);
2603 register short *tbl;
2605 complement = o->op_private & OPpTRANS_COMPLEMENT;
2606 del = o->op_private & OPpTRANS_DELETE;
2607 squash = o->op_private & OPpTRANS_SQUASH;
2610 o->op_private |= OPpTRANS_FROM_UTF;
2613 o->op_private |= OPpTRANS_TO_UTF;
2615 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2616 SV* listsv = newSVpvn("# comment\n",10);
2618 U8* tend = t + tlen;
2619 U8* rend = r + rlen;
2634 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2635 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2638 U8 tmpbuf[UTF8_MAXLEN];
2641 New(1109, cp, tlen, U8*);
2643 transv = newSVpvn("",0);
2652 qsort(cp, i, sizeof(U8*), utf8compare);
2653 for (j = 0; j < i; j++) {
2655 UV val = utf8_to_uv(s, &ulen);
2657 diff = val - nextmin;
2659 t = uv_to_utf8(tmpbuf,nextmin);
2660 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2662 t = uv_to_utf8(tmpbuf, val - 1);
2663 sv_catpvn(transv, "\377", 1);
2664 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2668 val = utf8_to_uv(s+1, &ulen);
2672 t = uv_to_utf8(tmpbuf,nextmin);
2673 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2674 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2675 sv_catpvn(transv, "\377", 1);
2676 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2677 t = (U8*)SvPVX(transv);
2678 tlen = SvCUR(transv);
2681 else if (!rlen && !del) {
2682 r = t; rlen = tlen; rend = tend;
2686 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
2687 o->op_private |= OPpTRANS_IDENTICAL;
2690 while (t < tend || tfirst <= tlast) {
2691 /* see if we need more "t" chars */
2692 if (tfirst > tlast) {
2693 tfirst = (I32)utf8_to_uv(t, &ulen);
2695 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2696 tlast = (I32)utf8_to_uv(++t, &ulen);
2703 /* now see if we need more "r" chars */
2704 if (rfirst > rlast) {
2706 rfirst = (I32)utf8_to_uv(r, &ulen);
2708 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2709 rlast = (I32)utf8_to_uv(++r, &ulen);
2718 rfirst = rlast = 0xffffffff;
2722 /* now see which range will peter our first, if either. */
2723 tdiff = tlast - tfirst;
2724 rdiff = rlast - rfirst;
2731 if (rfirst == 0xffffffff) {
2732 diff = tdiff; /* oops, pretend rdiff is infinite */
2734 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2735 (long)tfirst, (long)tlast);
2737 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2741 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2742 (long)tfirst, (long)(tfirst + diff),
2745 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2746 (long)tfirst, (long)rfirst);
2748 if (rfirst + diff > max)
2749 max = rfirst + diff;
2754 else if (rfirst <= 0x800)
2755 grows |= (tfirst < 0x80);
2756 else if (rfirst <= 0x10000)
2757 grows |= (tfirst < 0x800);
2758 else if (rfirst <= 0x200000)
2759 grows |= (tfirst < 0x10000);
2760 else if (rfirst <= 0x4000000)
2761 grows |= (tfirst < 0x200000);
2762 else if (rfirst <= 0x80000000)
2763 grows |= (tfirst < 0x4000000);
2775 else if (max > 0xff)
2780 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2781 SvREFCNT_dec(listsv);
2783 SvREFCNT_dec(transv);
2785 if (!del && havefinal)
2786 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
2787 newSVuv((UV)final), 0);
2789 if (grows && to_utf)
2790 o->op_private |= OPpTRANS_GROWS;
2797 tbl = (short*)cPVOPo->op_pv;
2799 Zero(tbl, 256, short);
2800 for (i = 0; i < tlen; i++)
2802 for (i = 0, j = 0; i < 256; i++) {
2818 if (!rlen && !del) {
2821 o->op_private |= OPpTRANS_IDENTICAL;
2823 for (i = 0; i < 256; i++)
2825 for (i = 0, j = 0; i < tlen; i++,j++) {
2828 if (tbl[t[i]] == -1)
2834 if (tbl[t[i]] == -1)
2845 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2850 NewOp(1101, pmop, 1, PMOP);
2851 pmop->op_type = type;
2852 pmop->op_ppaddr = PL_ppaddr[type];
2853 pmop->op_flags = flags;
2854 pmop->op_private = 0 | (flags >> 8);
2856 if (PL_hints & HINT_RE_TAINT)
2857 pmop->op_pmpermflags |= PMf_RETAINT;
2858 if (PL_hints & HINT_LOCALE)
2859 pmop->op_pmpermflags |= PMf_LOCALE;
2860 pmop->op_pmflags = pmop->op_pmpermflags;
2862 /* link into pm list */
2863 if (type != OP_TRANS && PL_curstash) {
2864 pmop->op_pmnext = HvPMROOT(PL_curstash);
2865 HvPMROOT(PL_curstash) = pmop;
2872 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2877 I32 repl_has_vars = 0;
2879 if (o->op_type == OP_TRANS)
2880 return pmtrans(o, expr, repl);
2882 PL_hints |= HINT_BLOCK_SCOPE;
2885 if (expr->op_type == OP_CONST) {
2887 SV *pat = ((SVOP*)expr)->op_sv;
2888 char *p = SvPV(pat, plen);
2889 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2890 sv_setpvn(pat, "\\s+", 3);
2891 p = SvPV(pat, plen);
2892 pm->op_pmflags |= PMf_SKIPWHITE;
2894 if ((PL_hints & HINT_UTF8) || (SvUTF8(pat) && !(PL_hints & HINT_BYTE)))
2895 pm->op_pmdynflags |= PMdf_UTF8;
2896 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2897 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2898 pm->op_pmflags |= PMf_WHITE;
2902 if (PL_hints & HINT_UTF8)
2903 pm->op_pmdynflags |= PMdf_UTF8;
2904 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2905 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2907 : OP_REGCMAYBE),0,expr);
2909 NewOp(1101, rcop, 1, LOGOP);
2910 rcop->op_type = OP_REGCOMP;
2911 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2912 rcop->op_first = scalar(expr);
2913 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2914 ? (OPf_SPECIAL | OPf_KIDS)
2916 rcop->op_private = 1;
2919 /* establish postfix order */
2920 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2922 rcop->op_next = expr;
2923 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2926 rcop->op_next = LINKLIST(expr);
2927 expr->op_next = (OP*)rcop;
2930 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2935 if (pm->op_pmflags & PMf_EVAL) {
2937 if (CopLINE(PL_curcop) < PL_multi_end)
2938 CopLINE_set(PL_curcop, PL_multi_end);
2941 else if (repl->op_type == OP_THREADSV
2942 && strchr("&`'123456789+",
2943 PL_threadsv_names[repl->op_targ]))
2947 #endif /* USE_THREADS */
2948 else if (repl->op_type == OP_CONST)
2952 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2953 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2955 if (curop->op_type == OP_THREADSV) {
2957 if (strchr("&`'123456789+", curop->op_private))
2961 if (curop->op_type == OP_GV) {
2962 GV *gv = cGVOPx_gv(curop);
2964 if (strchr("&`'123456789+", *GvENAME(gv)))
2967 #endif /* USE_THREADS */
2968 else if (curop->op_type == OP_RV2CV)
2970 else if (curop->op_type == OP_RV2SV ||
2971 curop->op_type == OP_RV2AV ||
2972 curop->op_type == OP_RV2HV ||
2973 curop->op_type == OP_RV2GV) {
2974 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2977 else if (curop->op_type == OP_PADSV ||
2978 curop->op_type == OP_PADAV ||
2979 curop->op_type == OP_PADHV ||
2980 curop->op_type == OP_PADANY) {
2983 else if (curop->op_type == OP_PUSHRE)
2984 ; /* Okay here, dangerous in newASSIGNOP */
2993 && (!pm->op_pmregexp
2994 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2995 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2996 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2997 prepend_elem(o->op_type, scalar(repl), o);
3000 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
3001 pm->op_pmflags |= PMf_MAYBE_CONST;
3002 pm->op_pmpermflags |= PMf_MAYBE_CONST;
3004 NewOp(1101, rcop, 1, LOGOP);
3005 rcop->op_type = OP_SUBSTCONT;
3006 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3007 rcop->op_first = scalar(repl);
3008 rcop->op_flags |= OPf_KIDS;
3009 rcop->op_private = 1;
3012 /* establish postfix order */
3013 rcop->op_next = LINKLIST(repl);
3014 repl->op_next = (OP*)rcop;
3016 pm->op_pmreplroot = scalar((OP*)rcop);
3017 pm->op_pmreplstart = LINKLIST(rcop);
3026 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3029 NewOp(1101, svop, 1, SVOP);
3030 svop->op_type = type;
3031 svop->op_ppaddr = PL_ppaddr[type];
3033 svop->op_next = (OP*)svop;
3034 svop->op_flags = flags;
3035 if (PL_opargs[type] & OA_RETSCALAR)
3037 if (PL_opargs[type] & OA_TARGET)
3038 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3039 return CHECKOP(type, svop);
3043 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3046 NewOp(1101, padop, 1, PADOP);
3047 padop->op_type = type;
3048 padop->op_ppaddr = PL_ppaddr[type];
3049 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3050 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3051 PL_curpad[padop->op_padix] = sv;
3053 padop->op_next = (OP*)padop;
3054 padop->op_flags = flags;
3055 if (PL_opargs[type] & OA_RETSCALAR)
3057 if (PL_opargs[type] & OA_TARGET)
3058 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3059 return CHECKOP(type, padop);
3063 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3068 return newPADOP(type, flags, SvREFCNT_inc(gv));
3070 return newSVOP(type, flags, SvREFCNT_inc(gv));
3075 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3078 NewOp(1101, pvop, 1, PVOP);
3079 pvop->op_type = type;
3080 pvop->op_ppaddr = PL_ppaddr[type];
3082 pvop->op_next = (OP*)pvop;
3083 pvop->op_flags = flags;
3084 if (PL_opargs[type] & OA_RETSCALAR)
3086 if (PL_opargs[type] & OA_TARGET)
3087 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3088 return CHECKOP(type, pvop);
3092 Perl_package(pTHX_ OP *o)
3097 save_hptr(&PL_curstash);
3098 save_item(PL_curstname);
3103 name = SvPV(sv, len);
3104 PL_curstash = gv_stashpvn(name,len,TRUE);
3105 sv_setpvn(PL_curstname, name, len);
3109 sv_setpv(PL_curstname,"<none>");
3110 PL_curstash = Nullhv;
3112 PL_hints |= HINT_BLOCK_SCOPE;
3113 PL_copline = NOLINE;
3118 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3126 if (id->op_type != OP_CONST)
3127 Perl_croak(aTHX_ "Module name must be constant");
3131 if (version != Nullop) {
3132 SV *vesv = ((SVOP*)version)->op_sv;
3134 if (arg == Nullop && !SvNIOKp(vesv)) {
3141 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3142 Perl_croak(aTHX_ "Version number must be constant number");
3144 /* Make copy of id so we don't free it twice */
3145 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3147 /* Fake up a method call to VERSION */
3148 meth = newSVpvn("VERSION",7);
3149 sv_upgrade(meth, SVt_PVIV);
3150 (void)SvIOK_on(meth);
3151 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3152 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3153 append_elem(OP_LIST,
3154 prepend_elem(OP_LIST, pack, list(version)),
3155 newSVOP(OP_METHOD_NAMED, 0, meth)));
3159 /* Fake up an import/unimport */
3160 if (arg && arg->op_type == OP_STUB)
3161 imop = arg; /* no import on explicit () */
3162 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3163 imop = Nullop; /* use 5.0; */
3168 /* Make copy of id so we don't free it twice */
3169 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3171 /* Fake up a method call to import/unimport */
3172 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);;
3173 sv_upgrade(meth, SVt_PVIV);
3174 (void)SvIOK_on(meth);
3175 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3176 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3177 append_elem(OP_LIST,
3178 prepend_elem(OP_LIST, pack, list(arg)),
3179 newSVOP(OP_METHOD_NAMED, 0, meth)));
3182 /* Fake up a require, handle override, if any */
3183 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3184 if (!(gv && GvIMPORTED_CV(gv)))
3185 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3187 if (gv && GvIMPORTED_CV(gv)) {
3188 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3189 append_elem(OP_LIST, id,
3190 scalar(newUNOP(OP_RV2CV, 0,
3195 rqop = newUNOP(OP_REQUIRE, 0, id);
3198 /* Fake up the BEGIN {}, which does its thing immediately. */
3200 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3203 append_elem(OP_LINESEQ,
3204 append_elem(OP_LINESEQ,
3205 newSTATEOP(0, Nullch, rqop),
3206 newSTATEOP(0, Nullch, veop)),
3207 newSTATEOP(0, Nullch, imop) ));
3209 PL_hints |= HINT_BLOCK_SCOPE;
3210 PL_copline = NOLINE;
3215 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3218 va_start(args, ver);
3219 vload_module(flags, name, ver, &args);
3223 #ifdef PERL_IMPLICIT_CONTEXT
3225 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3229 va_start(args, ver);
3230 vload_module(flags, name, ver, &args);
3236 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3238 OP *modname, *veop, *imop;
3240 modname = newSVOP(OP_CONST, 0, name);
3241 modname->op_private |= OPpCONST_BARE;
3243 veop = newSVOP(OP_CONST, 0, ver);
3247 if (flags & PERL_LOADMOD_NOIMPORT) {
3248 imop = sawparens(newNULLLIST());
3250 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3251 imop = va_arg(*args, OP*);
3256 sv = va_arg(*args, SV*);
3258 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3259 sv = va_arg(*args, SV*);
3263 line_t ocopline = PL_copline;
3264 int oexpect = PL_expect;
3266 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3267 veop, modname, imop);
3268 PL_expect = oexpect;
3269 PL_copline = ocopline;
3274 Perl_dofile(pTHX_ OP *term)
3279 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3280 if (!(gv && GvIMPORTED_CV(gv)))
3281 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3283 if (gv && GvIMPORTED_CV(gv)) {
3284 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3285 append_elem(OP_LIST, term,
3286 scalar(newUNOP(OP_RV2CV, 0,
3291 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3297 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3299 return newBINOP(OP_LSLICE, flags,
3300 list(force_list(subscript)),
3301 list(force_list(listval)) );
3305 S_list_assignment(pTHX_ register OP *o)
3310 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3311 o = cUNOPo->op_first;
3313 if (o->op_type == OP_COND_EXPR) {
3314 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3315 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3320 yyerror("Assignment to both a list and a scalar");
3324 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3325 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3326 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3329 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3332 if (o->op_type == OP_RV2SV)
3339 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3344 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3345 return newLOGOP(optype, 0,
3346 mod(scalar(left), optype),
3347 newUNOP(OP_SASSIGN, 0, scalar(right)));
3350 return newBINOP(optype, OPf_STACKED,
3351 mod(scalar(left), optype), scalar(right));
3355 if (list_assignment(left)) {
3360 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3361 left = mod(left, OP_AASSIGN);
3369 curop = list(force_list(left));
3370 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3371 o->op_private = 0 | (flags >> 8);
3372 for (curop = ((LISTOP*)curop)->op_first;
3373 curop; curop = curop->op_sibling)
3375 if (curop->op_type == OP_RV2HV &&
3376 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3377 o->op_private |= OPpASSIGN_HASH;
3381 if (!(left->op_private & OPpLVAL_INTRO)) {
3384 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3385 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3386 if (curop->op_type == OP_GV) {
3387 GV *gv = cGVOPx_gv(curop);
3388 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3390 SvCUR(gv) = PL_generation;
3392 else if (curop->op_type == OP_PADSV ||
3393 curop->op_type == OP_PADAV ||
3394 curop->op_type == OP_PADHV ||
3395 curop->op_type == OP_PADANY) {
3396 SV **svp = AvARRAY(PL_comppad_name);
3397 SV *sv = svp[curop->op_targ];
3398 if (SvCUR(sv) == PL_generation)
3400 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3402 else if (curop->op_type == OP_RV2CV)
3404 else if (curop->op_type == OP_RV2SV ||
3405 curop->op_type == OP_RV2AV ||
3406 curop->op_type == OP_RV2HV ||
3407 curop->op_type == OP_RV2GV) {
3408 if (lastop->op_type != OP_GV) /* funny deref? */
3411 else if (curop->op_type == OP_PUSHRE) {
3412 if (((PMOP*)curop)->op_pmreplroot) {
3413 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3414 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3416 SvCUR(gv) = PL_generation;
3425 o->op_private |= OPpASSIGN_COMMON;
3427 if (right && right->op_type == OP_SPLIT) {
3429 if ((tmpop = ((LISTOP*)right)->op_first) &&
3430 tmpop->op_type == OP_PUSHRE)
3432 PMOP *pm = (PMOP*)tmpop;
3433 if (left->op_type == OP_RV2AV &&
3434 !(left->op_private & OPpLVAL_INTRO) &&
3435 !(o->op_private & OPpASSIGN_COMMON) )
3437 tmpop = ((UNOP*)left)->op_first;
3438 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3440 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3441 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3443 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3444 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3446 pm->op_pmflags |= PMf_ONCE;
3447 tmpop = cUNOPo->op_first; /* to list (nulled) */
3448 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3449 tmpop->op_sibling = Nullop; /* don't free split */
3450 right->op_next = tmpop->op_next; /* fix starting loc */
3451 op_free(o); /* blow off assign */
3452 right->op_flags &= ~OPf_WANT;
3453 /* "I don't know and I don't care." */
3458 if (PL_modcount < 10000 &&
3459 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3461 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3463 sv_setiv(sv, PL_modcount+1);
3471 right = newOP(OP_UNDEF, 0);
3472 if (right->op_type == OP_READLINE) {
3473 right->op_flags |= OPf_STACKED;
3474 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3477 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3478 o = newBINOP(OP_SASSIGN, flags,
3479 scalar(right), mod(scalar(left), OP_SASSIGN) );
3491 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3494 U32 seq = intro_my();
3497 NewOp(1101, cop, 1, COP);
3498 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3499 cop->op_type = OP_DBSTATE;
3500 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3503 cop->op_type = OP_NEXTSTATE;
3504 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3506 cop->op_flags = flags;
3507 cop->op_private = (PL_hints & HINT_BYTE);
3509 cop->op_private |= NATIVE_HINTS;
3511 PL_compiling.op_private = cop->op_private;
3512 cop->op_next = (OP*)cop;
3515 cop->cop_label = label;
3516 PL_hints |= HINT_BLOCK_SCOPE;
3519 cop->cop_arybase = PL_curcop->cop_arybase;
3520 if (specialWARN(PL_curcop->cop_warnings))
3521 cop->cop_warnings = PL_curcop->cop_warnings ;
3523 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3526 if (PL_copline == NOLINE)
3527 CopLINE_set(cop, CopLINE(PL_curcop));
3529 CopLINE_set(cop, PL_copline);
3530 PL_copline = NOLINE;
3533 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
3535 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
3537 CopSTASH_set(cop, PL_curstash);
3539 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3540 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3541 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3542 (void)SvIOK_on(*svp);
3543 SvIVX(*svp) = PTR2IV(cop);
3547 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3550 /* "Introduce" my variables to visible status. */
3558 if (! PL_min_intro_pending)
3559 return PL_cop_seqmax;
3561 svp = AvARRAY(PL_comppad_name);
3562 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3563 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3564 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3565 SvNVX(sv) = (NV)PL_cop_seqmax;
3568 PL_min_intro_pending = 0;
3569 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3570 return PL_cop_seqmax++;
3574 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3576 return new_logop(type, flags, &first, &other);
3580 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3585 OP *first = *firstp;
3586 OP *other = *otherp;
3588 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3589 return newBINOP(type, flags, scalar(first), scalar(other));
3591 scalarboolean(first);
3592 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3593 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3594 if (type == OP_AND || type == OP_OR) {
3600 first = *firstp = cUNOPo->op_first;
3602 first->op_next = o->op_next;
3603 cUNOPo->op_first = Nullop;
3607 if (first->op_type == OP_CONST) {
3608 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3609 Perl_warner(aTHX_ WARN_BAREWORD, "Bareword found in conditional");
3610 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3621 else if (first->op_type == OP_WANTARRAY) {
3627 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3628 OP *k1 = ((UNOP*)first)->op_first;
3629 OP *k2 = k1->op_sibling;
3631 switch (first->op_type)
3634 if (k2 && k2->op_type == OP_READLINE
3635 && (k2->op_flags & OPf_STACKED)
3636 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3638 warnop = k2->op_type;
3643 if (k1->op_type == OP_READDIR
3644 || k1->op_type == OP_GLOB
3645 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3646 || k1->op_type == OP_EACH)
3648 warnop = ((k1->op_type == OP_NULL)
3649 ? k1->op_targ : k1->op_type);
3654 line_t oldline = CopLINE(PL_curcop);
3655 CopLINE_set(PL_curcop, PL_copline);
3656 Perl_warner(aTHX_ WARN_MISC,
3657 "Value of %s%s can be \"0\"; test with defined()",
3659 ((warnop == OP_READLINE || warnop == OP_GLOB)
3660 ? " construct" : "() operator"));
3661 CopLINE_set(PL_curcop, oldline);
3668 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3669 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3671 NewOp(1101, logop, 1, LOGOP);
3673 logop->op_type = type;
3674 logop->op_ppaddr = PL_ppaddr[type];
3675 logop->op_first = first;
3676 logop->op_flags = flags | OPf_KIDS;
3677 logop->op_other = LINKLIST(other);
3678 logop->op_private = 1 | (flags >> 8);
3680 /* establish postfix order */
3681 logop->op_next = LINKLIST(first);
3682 first->op_next = (OP*)logop;
3683 first->op_sibling = other;
3685 o = newUNOP(OP_NULL, 0, (OP*)logop);
3692 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3700 return newLOGOP(OP_AND, 0, first, trueop);
3702 return newLOGOP(OP_OR, 0, first, falseop);
3704 scalarboolean(first);
3705 if (first->op_type == OP_CONST) {
3706 if (SvTRUE(((SVOP*)first)->op_sv)) {
3717 else if (first->op_type == OP_WANTARRAY) {
3721 NewOp(1101, logop, 1, LOGOP);
3722 logop->op_type = OP_COND_EXPR;
3723 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3724 logop->op_first = first;
3725 logop->op_flags = flags | OPf_KIDS;
3726 logop->op_private = 1 | (flags >> 8);
3727 logop->op_other = LINKLIST(trueop);
3728 logop->op_next = LINKLIST(falseop);
3731 /* establish postfix order */
3732 start = LINKLIST(first);
3733 first->op_next = (OP*)logop;
3735 first->op_sibling = trueop;
3736 trueop->op_sibling = falseop;
3737 o = newUNOP(OP_NULL, 0, (OP*)logop);
3739 trueop->op_next = falseop->op_next = o;
3746 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3755 NewOp(1101, range, 1, LOGOP);
3757 range->op_type = OP_RANGE;
3758 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3759 range->op_first = left;
3760 range->op_flags = OPf_KIDS;
3761 leftstart = LINKLIST(left);
3762 range->op_other = LINKLIST(right);
3763 range->op_private = 1 | (flags >> 8);
3765 left->op_sibling = right;
3767 range->op_next = (OP*)range;
3768 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3769 flop = newUNOP(OP_FLOP, 0, flip);
3770 o = newUNOP(OP_NULL, 0, flop);
3772 range->op_next = leftstart;
3774 left->op_next = flip;
3775 right->op_next = flop;
3777 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3778 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3779 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3780 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3782 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3783 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3786 if (!flip->op_private || !flop->op_private)
3787 linklist(o); /* blow off optimizer unless constant */
3793 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3798 int once = block && block->op_flags & OPf_SPECIAL &&
3799 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3802 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3803 return block; /* do {} while 0 does once */
3804 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3805 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3806 expr = newUNOP(OP_DEFINED, 0,
3807 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3808 } else if (expr->op_flags & OPf_KIDS) {
3809 OP *k1 = ((UNOP*)expr)->op_first;
3810 OP *k2 = (k1) ? k1->op_sibling : NULL;
3811 switch (expr->op_type) {
3813 if (k2 && k2->op_type == OP_READLINE
3814 && (k2->op_flags & OPf_STACKED)
3815 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3816 expr = newUNOP(OP_DEFINED, 0, expr);
3820 if (k1->op_type == OP_READDIR
3821 || k1->op_type == OP_GLOB
3822 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3823 || k1->op_type == OP_EACH)
3824 expr = newUNOP(OP_DEFINED, 0, expr);
3830 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3831 o = new_logop(OP_AND, 0, &expr, &listop);
3834 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3836 if (once && o != listop)
3837 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3840 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3842 o->op_flags |= flags;
3844 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3849 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3859 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3860 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3861 expr = newUNOP(OP_DEFINED, 0,
3862 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3863 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3864 OP *k1 = ((UNOP*)expr)->op_first;
3865 OP *k2 = (k1) ? k1->op_sibling : NULL;
3866 switch (expr->op_type) {
3868 if (k2 && k2->op_type == OP_READLINE
3869 && (k2->op_flags & OPf_STACKED)
3870 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3871 expr = newUNOP(OP_DEFINED, 0, expr);
3875 if (k1->op_type == OP_READDIR
3876 || k1->op_type == OP_GLOB
3877 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3878 || k1->op_type == OP_EACH)
3879 expr = newUNOP(OP_DEFINED, 0, expr);
3885 block = newOP(OP_NULL, 0);
3887 block = scope(block);
3891 next = LINKLIST(cont);
3892 loopflags |= OPpLOOP_CONTINUE;
3895 OP *unstack = newOP(OP_UNSTACK, 0);
3898 cont = append_elem(OP_LINESEQ, cont, unstack);
3899 if ((line_t)whileline != NOLINE) {
3900 PL_copline = whileline;
3901 cont = append_elem(OP_LINESEQ, cont,
3902 newSTATEOP(0, Nullch, Nullop));
3906 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3907 redo = LINKLIST(listop);
3910 PL_copline = whileline;
3912 o = new_logop(OP_AND, 0, &expr, &listop);
3913 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3914 op_free(expr); /* oops, it's a while (0) */
3916 return Nullop; /* listop already freed by new_logop */
3919 ((LISTOP*)listop)->op_last->op_next = condop =
3920 (o == listop ? redo : LINKLIST(o));
3926 NewOp(1101,loop,1,LOOP);
3927 loop->op_type = OP_ENTERLOOP;
3928 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3929 loop->op_private = 0;
3930 loop->op_next = (OP*)loop;
3933 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3935 loop->op_redoop = redo;
3936 loop->op_lastop = o;
3937 o->op_private |= loopflags;
3940 loop->op_nextop = next;
3942 loop->op_nextop = o;
3944 o->op_flags |= flags;
3945 o->op_private |= (flags >> 8);
3950 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3958 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3959 sv->op_type = OP_RV2GV;
3960 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3962 else if (sv->op_type == OP_PADSV) { /* private variable */
3963 padoff = sv->op_targ;
3968 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3969 padoff = sv->op_targ;
3971 iterflags |= OPf_SPECIAL;
3976 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3980 padoff = find_threadsv("_");
3981 iterflags |= OPf_SPECIAL;
3983 sv = newGVOP(OP_GV, 0, PL_defgv);
3986 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3987 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3988 iterflags |= OPf_STACKED;
3990 else if (expr->op_type == OP_NULL &&
3991 (expr->op_flags & OPf_KIDS) &&
3992 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3994 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3995 * set the STACKED flag to indicate that these values are to be
3996 * treated as min/max values by 'pp_iterinit'.
3998 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3999 LOGOP* range = (LOGOP*) flip->op_first;
4000 OP* left = range->op_first;
4001 OP* right = left->op_sibling;
4004 range->op_flags &= ~OPf_KIDS;
4005 range->op_first = Nullop;
4007 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
4008 listop->op_first->op_next = range->op_next;
4009 left->op_next = range->op_other;
4010 right->op_next = (OP*)listop;
4011 listop->op_next = listop->op_first;
4014 expr = (OP*)(listop);
4016 iterflags |= OPf_STACKED;
4019 expr = mod(force_list(expr), OP_GREPSTART);
4023 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
4024 append_elem(OP_LIST, expr, scalar(sv))));
4025 assert(!loop->op_next);
4026 #ifdef PL_OP_SLAB_ALLOC
4029 NewOp(1234,tmp,1,LOOP);
4030 Copy(loop,tmp,1,LOOP);
4034 Renew(loop, 1, LOOP);
4036 loop->op_targ = padoff;
4037 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
4038 PL_copline = forline;
4039 return newSTATEOP(0, label, wop);
4043 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4049 if (type != OP_GOTO || label->op_type == OP_CONST) {
4050 /* "last()" means "last" */
4051 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4052 o = newOP(type, OPf_SPECIAL);
4054 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
4055 ? SvPVx(((SVOP*)label)->op_sv, n_a)
4061 if (label->op_type == OP_ENTERSUB)
4062 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4063 o = newUNOP(type, OPf_STACKED, label);
4065 PL_hints |= HINT_BLOCK_SCOPE;
4070 Perl_cv_undef(pTHX_ CV *cv)
4075 MUTEX_DESTROY(CvMUTEXP(cv));
4076 Safefree(CvMUTEXP(cv));
4079 #endif /* USE_THREADS */
4081 if (!CvXSUB(cv) && CvROOT(cv)) {
4083 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4084 Perl_croak(aTHX_ "Can't undef active subroutine");
4087 Perl_croak(aTHX_ "Can't undef active subroutine");
4088 #endif /* USE_THREADS */
4091 SAVEVPTR(PL_curpad);
4095 op_free(CvROOT(cv));
4096 CvROOT(cv) = Nullop;
4099 SvPOK_off((SV*)cv); /* forget prototype */
4101 SvREFCNT_dec(CvGV(cv));
4103 SvREFCNT_dec(CvOUTSIDE(cv));
4104 CvOUTSIDE(cv) = Nullcv;
4105 if (CvPADLIST(cv)) {
4106 /* may be during global destruction */
4107 if (SvREFCNT(CvPADLIST(cv))) {
4108 I32 i = AvFILLp(CvPADLIST(cv));
4110 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4111 SV* sv = svp ? *svp : Nullsv;
4114 if (sv == (SV*)PL_comppad_name)
4115 PL_comppad_name = Nullav;
4116 else if (sv == (SV*)PL_comppad) {
4117 PL_comppad = Nullav;
4118 PL_curpad = Null(SV**);
4122 SvREFCNT_dec((SV*)CvPADLIST(cv));
4124 CvPADLIST(cv) = Nullav;
4129 S_cv_dump(pTHX_ CV *cv)
4132 CV *outside = CvOUTSIDE(cv);
4133 AV* padlist = CvPADLIST(cv);
4140 PerlIO_printf(Perl_debug_log,
4141 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4143 (CvANON(cv) ? "ANON"
4144 : (cv == PL_main_cv) ? "MAIN"
4145 : CvUNIQUE(cv) ? "UNIQUE"
4146 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4149 : CvANON(outside) ? "ANON"
4150 : (outside == PL_main_cv) ? "MAIN"
4151 : CvUNIQUE(outside) ? "UNIQUE"
4152 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4157 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4158 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4159 pname = AvARRAY(pad_name);
4160 ppad = AvARRAY(pad);
4162 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4163 if (SvPOK(pname[ix]))
4164 PerlIO_printf(Perl_debug_log,
4165 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4166 (int)ix, PTR2UV(ppad[ix]),
4167 SvFAKE(pname[ix]) ? "FAKE " : "",
4169 (IV)I_32(SvNVX(pname[ix])),
4172 #endif /* DEBUGGING */
4176 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4181 AV* protopadlist = CvPADLIST(proto);
4182 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4183 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4184 SV** pname = AvARRAY(protopad_name);
4185 SV** ppad = AvARRAY(protopad);
4186 I32 fname = AvFILLp(protopad_name);
4187 I32 fpad = AvFILLp(protopad);
4191 assert(!CvUNIQUE(proto));
4195 SAVESPTR(PL_comppad_name);
4196 SAVESPTR(PL_compcv);
4198 cv = PL_compcv = (CV*)NEWSV(1104,0);
4199 sv_upgrade((SV *)cv, SvTYPE(proto));
4200 CvFLAGS(cv) = CvFLAGS(proto) & ~CVf_CLONE;
4204 New(666, CvMUTEXP(cv), 1, perl_mutex);
4205 MUTEX_INIT(CvMUTEXP(cv));
4207 #endif /* USE_THREADS */
4208 CvFILE(cv) = CvFILE(proto);
4209 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4210 CvSTASH(cv) = CvSTASH(proto);
4211 CvROOT(cv) = CvROOT(proto);
4212 CvSTART(cv) = CvSTART(proto);
4214 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4217 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4219 PL_comppad_name = newAV();
4220 for (ix = fname; ix >= 0; ix--)
4221 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4223 PL_comppad = newAV();
4225 comppadlist = newAV();
4226 AvREAL_off(comppadlist);
4227 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4228 av_store(comppadlist, 1, (SV*)PL_comppad);
4229 CvPADLIST(cv) = comppadlist;
4230 av_fill(PL_comppad, AvFILLp(protopad));
4231 PL_curpad = AvARRAY(PL_comppad);
4233 av = newAV(); /* will be @_ */
4235 av_store(PL_comppad, 0, (SV*)av);
4236 AvFLAGS(av) = AVf_REIFY;
4238 for (ix = fpad; ix > 0; ix--) {
4239 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4240 if (namesv && namesv != &PL_sv_undef) {
4241 char *name = SvPVX(namesv); /* XXX */
4242 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4243 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4244 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4246 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4248 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4250 else { /* our own lexical */
4253 /* anon code -- we'll come back for it */
4254 sv = SvREFCNT_inc(ppad[ix]);
4256 else if (*name == '@')
4258 else if (*name == '%')
4267 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4268 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4271 SV* sv = NEWSV(0,0);
4277 /* Now that vars are all in place, clone nested closures. */
4279 for (ix = fpad; ix > 0; ix--) {
4280 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4282 && namesv != &PL_sv_undef
4283 && !(SvFLAGS(namesv) & SVf_FAKE)
4284 && *SvPVX(namesv) == '&'
4285 && CvCLONE(ppad[ix]))
4287 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4288 SvREFCNT_dec(ppad[ix]);
4291 PL_curpad[ix] = (SV*)kid;
4295 #ifdef DEBUG_CLOSURES
4296 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4298 PerlIO_printf(Perl_debug_log, " from:\n");
4300 PerlIO_printf(Perl_debug_log, " to:\n");
4309 Perl_cv_clone(pTHX_ CV *proto)
4312 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4313 cv = cv_clone2(proto, CvOUTSIDE(proto));
4314 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4319 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4323 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4324 SV* msg = sv_newmortal();
4328 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4329 sv_setpv(msg, "Prototype mismatch:");
4331 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4333 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4334 sv_catpv(msg, " vs ");
4336 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4338 sv_catpv(msg, "none");
4339 Perl_warner(aTHX_ WARN_PROTOTYPE, "%"SVf, msg);
4344 Perl_cv_const_sv(pTHX_ CV *cv)
4346 if (!cv || !SvPOK(cv) || SvCUR(cv))
4348 return op_const_sv(CvSTART(cv), cv);
4352 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4359 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4360 o = cLISTOPo->op_first->op_sibling;
4362 for (; o; o = o->op_next) {
4363 OPCODE type = o->op_type;
4365 if (sv && o->op_next == o)
4367 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4369 if (type == OP_LEAVESUB || type == OP_RETURN)
4373 if (type == OP_CONST && cSVOPo->op_sv)
4375 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4376 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4377 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4378 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4390 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4400 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4404 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4406 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4410 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4417 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4421 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4422 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4423 SV *sv = sv_newmortal();
4424 Perl_sv_setpvf(aTHX_ sv, "__ANON__[%s:%"IVdf"]",
4425 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4430 gv = gv_fetchpv(name ? name : (aname ? aname : "__ANON__"),
4431 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4441 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4442 maximum a prototype before. */
4443 if (SvTYPE(gv) > SVt_NULL) {
4444 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4445 && ckWARN_d(WARN_PROTOTYPE))
4447 Perl_warner(aTHX_ WARN_PROTOTYPE, "Runaway prototype");
4449 cv_ckproto((CV*)gv, NULL, ps);
4452 sv_setpv((SV*)gv, ps);
4454 sv_setiv((SV*)gv, -1);
4455 SvREFCNT_dec(PL_compcv);
4456 cv = PL_compcv = NULL;
4457 PL_sub_generation++;
4461 if (!name || GvCVGEN(gv))
4463 else if ((cv = GvCV(gv))) {
4464 bool exists = CvROOT(cv) || CvXSUB(cv);
4465 /* if the subroutine doesn't exist and wasn't pre-declared
4466 * with a prototype, assume it will be AUTOLOADed,
4467 * skipping the prototype check
4469 if (exists || SvPOK(cv))
4470 cv_ckproto(cv, gv, ps);
4471 /* already defined (or promised)? */
4472 if (exists || GvASSUMECV(gv)) {
4474 bool const_changed = TRUE;
4475 if (!block && !attrs) {
4476 /* just a "sub foo;" when &foo is already defined */
4477 SAVEFREESV(PL_compcv);
4480 /* ahem, death to those who redefine active sort subs */
4481 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4482 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4485 if ((const_sv = cv_const_sv(cv)))
4486 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4487 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE))
4489 line_t oldline = CopLINE(PL_curcop);
4490 CopLINE_set(PL_curcop, PL_copline);
4491 Perl_warner(aTHX_ WARN_REDEFINE,
4492 const_sv ? "Constant subroutine %s redefined"
4493 : "Subroutine %s redefined", name);
4494 CopLINE_set(PL_curcop, oldline);
4505 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4506 * before we clobber PL_compcv.
4510 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4511 stash = GvSTASH(CvGV(cv));
4512 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4513 stash = CvSTASH(cv);
4515 stash = PL_curstash;
4518 /* possibly about to re-define existing subr -- ignore old cv */
4519 rcv = (SV*)PL_compcv;
4520 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4521 stash = GvSTASH(gv);
4523 stash = PL_curstash;
4525 apply_attrs(stash, rcv, attrs);
4527 if (cv) { /* must reuse cv if autoloaded */
4529 /* got here with just attrs -- work done, so bug out */
4530 SAVEFREESV(PL_compcv);
4534 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4535 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4536 CvOUTSIDE(PL_compcv) = 0;
4537 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4538 CvPADLIST(PL_compcv) = 0;
4539 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4540 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4541 SvREFCNT_dec(PL_compcv);
4548 PL_sub_generation++;
4551 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4552 CvFILE(cv) = CopFILE(PL_curcop);
4553 CvSTASH(cv) = PL_curstash;
4556 if (!CvMUTEXP(cv)) {
4557 New(666, CvMUTEXP(cv), 1, perl_mutex);
4558 MUTEX_INIT(CvMUTEXP(cv));
4560 #endif /* USE_THREADS */
4563 sv_setpv((SV*)cv, ps);
4565 if (PL_error_count) {
4569 char *s = strrchr(name, ':');
4571 if (strEQ(s, "BEGIN")) {
4573 "BEGIN not safe after errors--compilation aborted";
4574 if (PL_in_eval & EVAL_KEEPERR)
4575 Perl_croak(aTHX_ not_safe);
4577 /* force display of errors found but not reported */
4578 sv_catpv(ERRSV, not_safe);
4579 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4586 PL_copline = NOLINE;
4591 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4592 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4595 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4598 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4600 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4601 OpREFCNT_set(CvROOT(cv), 1);
4602 CvSTART(cv) = LINKLIST(CvROOT(cv));
4603 CvROOT(cv)->op_next = 0;
4606 /* now that optimizer has done its work, adjust pad values */
4608 SV **namep = AvARRAY(PL_comppad_name);
4609 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4612 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4615 * The only things that a clonable function needs in its
4616 * pad are references to outer lexicals and anonymous subs.
4617 * The rest are created anew during cloning.
4619 if (!((namesv = namep[ix]) != Nullsv &&
4620 namesv != &PL_sv_undef &&
4622 *SvPVX(namesv) == '&')))
4624 SvREFCNT_dec(PL_curpad[ix]);
4625 PL_curpad[ix] = Nullsv;
4630 AV *av = newAV(); /* Will be @_ */
4632 av_store(PL_comppad, 0, (SV*)av);
4633 AvFLAGS(av) = AVf_REIFY;
4635 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4636 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4638 if (!SvPADMY(PL_curpad[ix]))
4639 SvPADTMP_on(PL_curpad[ix]);
4643 if (name || aname) {
4645 char *tname = (name ? name : aname);
4647 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4648 SV *sv = NEWSV(0,0);
4649 SV *tmpstr = sv_newmortal();
4650 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4654 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4656 (long)PL_subline, (long)CopLINE(PL_curcop));
4657 gv_efullname3(tmpstr, gv, Nullch);
4658 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4659 hv = GvHVn(db_postponed);
4660 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4661 && (pcv = GvCV(db_postponed)))
4667 call_sv((SV*)pcv, G_DISCARD);
4671 if ((s = strrchr(tname,':')))
4676 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4679 if (strEQ(s, "BEGIN")) {
4680 I32 oldscope = PL_scopestack_ix;
4682 SAVECOPFILE(&PL_compiling);
4683 SAVECOPLINE(&PL_compiling);
4685 sv_setsv(PL_rs, PL_nrs);
4688 PL_beginav = newAV();
4689 DEBUG_x( dump_sub(gv) );
4690 av_push(PL_beginav, (SV*)cv);
4691 GvCV(gv) = 0; /* cv has been hijacked */
4692 call_list(oldscope, PL_beginav);
4694 PL_curcop = &PL_compiling;
4695 PL_compiling.op_private = PL_hints;
4698 else if (strEQ(s, "END") && !PL_error_count) {
4701 DEBUG_x( dump_sub(gv) );
4702 av_unshift(PL_endav, 1);
4703 av_store(PL_endav, 0, (SV*)cv);
4704 GvCV(gv) = 0; /* cv has been hijacked */
4706 else if (strEQ(s, "CHECK") && !PL_error_count) {
4708 PL_checkav = newAV();
4709 DEBUG_x( dump_sub(gv) );
4710 if (PL_main_start && ckWARN(WARN_VOID))
4711 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4712 av_unshift(PL_checkav, 1);
4713 av_store(PL_checkav, 0, (SV*)cv);
4714 GvCV(gv) = 0; /* cv has been hijacked */
4716 else if (strEQ(s, "INIT") && !PL_error_count) {
4718 PL_initav = 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 INIT block");
4722 av_push(PL_initav, (SV*)cv);
4723 GvCV(gv) = 0; /* cv has been hijacked */
4728 PL_copline = NOLINE;
4733 /* XXX unsafe for threads if eval_owner isn't held */
4735 =for apidoc newCONSTSUB
4737 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4738 eligible for inlining at compile-time.
4744 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4750 SAVECOPLINE(PL_curcop);
4751 CopLINE_set(PL_curcop, PL_copline);
4754 PL_hints &= ~HINT_BLOCK_SCOPE;
4757 SAVESPTR(PL_curstash);
4758 SAVECOPSTASH(PL_curcop);
4759 PL_curstash = stash;
4761 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4763 CopSTASH(PL_curcop) = stash;
4768 start_subparse(FALSE, 0),
4769 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4770 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4772 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4779 =for apidoc U||newXS
4781 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4787 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4790 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4793 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4795 /* just a cached method */
4799 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4800 /* already defined (or promised) */
4801 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4802 && HvNAME(GvSTASH(CvGV(cv)))
4803 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4804 line_t oldline = CopLINE(PL_curcop);
4805 if (PL_copline != NOLINE)
4806 CopLINE_set(PL_curcop, PL_copline);
4807 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4808 CopLINE_set(PL_curcop, oldline);
4815 if (cv) /* must reuse cv if autoloaded */
4818 cv = (CV*)NEWSV(1105,0);
4819 sv_upgrade((SV *)cv, SVt_PVCV);
4823 PL_sub_generation++;
4826 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4828 New(666, CvMUTEXP(cv), 1, perl_mutex);
4829 MUTEX_INIT(CvMUTEXP(cv));
4831 #endif /* USE_THREADS */
4832 (void)gv_fetchfile(filename);
4833 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4834 an external constant string */
4835 CvXSUB(cv) = subaddr;
4838 char *s = strrchr(name,':');
4844 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4847 if (strEQ(s, "BEGIN")) {
4849 PL_beginav = newAV();
4850 av_push(PL_beginav, (SV*)cv);
4851 GvCV(gv) = 0; /* cv has been hijacked */
4853 else if (strEQ(s, "END")) {
4856 av_unshift(PL_endav, 1);
4857 av_store(PL_endav, 0, (SV*)cv);
4858 GvCV(gv) = 0; /* cv has been hijacked */
4860 else if (strEQ(s, "CHECK")) {
4862 PL_checkav = newAV();
4863 if (PL_main_start && ckWARN(WARN_VOID))
4864 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4865 av_unshift(PL_checkav, 1);
4866 av_store(PL_checkav, 0, (SV*)cv);
4867 GvCV(gv) = 0; /* cv has been hijacked */
4869 else if (strEQ(s, "INIT")) {
4871 PL_initav = newAV();
4872 if (PL_main_start && ckWARN(WARN_VOID))
4873 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4874 av_push(PL_initav, (SV*)cv);
4875 GvCV(gv) = 0; /* cv has been hijacked */
4886 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4896 name = SvPVx(cSVOPo->op_sv, n_a);
4899 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4901 if ((cv = GvFORM(gv))) {
4902 if (ckWARN(WARN_REDEFINE)) {
4903 line_t oldline = CopLINE(PL_curcop);
4905 CopLINE_set(PL_curcop, PL_copline);
4906 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4907 CopLINE_set(PL_curcop, oldline);
4913 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4914 CvFILE(cv) = CopFILE(PL_curcop);
4916 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4917 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4918 SvPADTMP_on(PL_curpad[ix]);
4921 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4922 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4923 OpREFCNT_set(CvROOT(cv), 1);
4924 CvSTART(cv) = LINKLIST(CvROOT(cv));
4925 CvROOT(cv)->op_next = 0;
4928 PL_copline = NOLINE;
4933 Perl_newANONLIST(pTHX_ OP *o)
4935 return newUNOP(OP_REFGEN, 0,
4936 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4940 Perl_newANONHASH(pTHX_ OP *o)
4942 return newUNOP(OP_REFGEN, 0,
4943 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4947 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4949 return newANONATTRSUB(floor, proto, Nullop, block);
4953 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4955 return newUNOP(OP_REFGEN, 0,
4956 newSVOP(OP_ANONCODE, 0,
4957 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4961 Perl_oopsAV(pTHX_ OP *o)
4963 switch (o->op_type) {
4965 o->op_type = OP_PADAV;
4966 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4967 return ref(o, OP_RV2AV);
4970 o->op_type = OP_RV2AV;
4971 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4976 if (ckWARN_d(WARN_INTERNAL))
4977 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4984 Perl_oopsHV(pTHX_ OP *o)
4988 switch (o->op_type) {
4991 o->op_type = OP_PADHV;
4992 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4993 return ref(o, OP_RV2HV);
4997 o->op_type = OP_RV2HV;
4998 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
5003 if (ckWARN_d(WARN_INTERNAL))
5004 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
5011 Perl_newAVREF(pTHX_ OP *o)
5013 if (o->op_type == OP_PADANY) {
5014 o->op_type = OP_PADAV;
5015 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5018 return newUNOP(OP_RV2AV, 0, scalar(o));
5022 Perl_newGVREF(pTHX_ I32 type, OP *o)
5024 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
5025 return newUNOP(OP_NULL, 0, o);
5026 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
5030 Perl_newHVREF(pTHX_ OP *o)
5032 if (o->op_type == OP_PADANY) {
5033 o->op_type = OP_PADHV;
5034 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5037 return newUNOP(OP_RV2HV, 0, scalar(o));
5041 Perl_oopsCV(pTHX_ OP *o)
5043 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5049 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5051 return newUNOP(OP_RV2CV, flags, scalar(o));
5055 Perl_newSVREF(pTHX_ OP *o)
5057 if (o->op_type == OP_PADANY) {
5058 o->op_type = OP_PADSV;
5059 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5062 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
5063 o->op_flags |= OPpDONE_SVREF;
5066 return newUNOP(OP_RV2SV, 0, scalar(o));
5069 /* Check routines. */
5072 Perl_ck_anoncode(pTHX_ OP *o)
5077 name = NEWSV(1106,0);
5078 sv_upgrade(name, SVt_PVNV);
5079 sv_setpvn(name, "&", 1);
5082 ix = pad_alloc(o->op_type, SVs_PADMY);
5083 av_store(PL_comppad_name, ix, name);
5084 av_store(PL_comppad, ix, cSVOPo->op_sv);
5085 SvPADMY_on(cSVOPo->op_sv);
5086 cSVOPo->op_sv = Nullsv;
5087 cSVOPo->op_targ = ix;
5092 Perl_ck_bitop(pTHX_ OP *o)
5094 o->op_private = PL_hints;
5099 Perl_ck_concat(pTHX_ OP *o)
5101 if (cUNOPo->op_first->op_type == OP_CONCAT)
5102 o->op_flags |= OPf_STACKED;
5107 Perl_ck_spair(pTHX_ OP *o)
5109 if (o->op_flags & OPf_KIDS) {
5112 OPCODE type = o->op_type;
5113 o = modkids(ck_fun(o), type);
5114 kid = cUNOPo->op_first;
5115 newop = kUNOP->op_first->op_sibling;
5117 (newop->op_sibling ||
5118 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5119 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5120 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5124 op_free(kUNOP->op_first);
5125 kUNOP->op_first = newop;
5127 o->op_ppaddr = PL_ppaddr[++o->op_type];
5132 Perl_ck_delete(pTHX_ OP *o)
5136 if (o->op_flags & OPf_KIDS) {
5137 OP *kid = cUNOPo->op_first;
5138 switch (kid->op_type) {
5140 o->op_flags |= OPf_SPECIAL;
5143 o->op_private |= OPpSLICE;
5146 o->op_flags |= OPf_SPECIAL;
5151 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5152 PL_op_desc[o->op_type]);
5160 Perl_ck_eof(pTHX_ OP *o)
5162 I32 type = o->op_type;
5164 if (o->op_flags & OPf_KIDS) {
5165 if (cLISTOPo->op_first->op_type == OP_STUB) {
5167 o = newUNOP(type, OPf_SPECIAL,
5168 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5176 Perl_ck_eval(pTHX_ OP *o)
5178 PL_hints |= HINT_BLOCK_SCOPE;
5179 if (o->op_flags & OPf_KIDS) {
5180 SVOP *kid = (SVOP*)cUNOPo->op_first;
5183 o->op_flags &= ~OPf_KIDS;
5186 else if (kid->op_type == OP_LINESEQ) {
5189 kid->op_next = o->op_next;
5190 cUNOPo->op_first = 0;
5193 NewOp(1101, enter, 1, LOGOP);
5194 enter->op_type = OP_ENTERTRY;
5195 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5196 enter->op_private = 0;
5198 /* establish postfix order */
5199 enter->op_next = (OP*)enter;
5201 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5202 o->op_type = OP_LEAVETRY;
5203 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5204 enter->op_other = o;
5212 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5214 o->op_targ = (PADOFFSET)PL_hints;
5219 Perl_ck_exit(pTHX_ OP *o)
5222 HV *table = GvHV(PL_hintgv);
5224 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
5225 if (svp && *svp && SvTRUE(*svp))
5226 o->op_private |= OPpEXIT_VMSISH;
5233 Perl_ck_exec(pTHX_ OP *o)
5236 if (o->op_flags & OPf_STACKED) {
5238 kid = cUNOPo->op_first->op_sibling;
5239 if (kid->op_type == OP_RV2GV)
5248 Perl_ck_exists(pTHX_ OP *o)
5251 if (o->op_flags & OPf_KIDS) {
5252 OP *kid = cUNOPo->op_first;
5253 if (kid->op_type == OP_ENTERSUB) {
5254 (void) ref(kid, o->op_type);
5255 if (kid->op_type != OP_RV2CV && !PL_error_count)
5256 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5257 PL_op_desc[o->op_type]);
5258 o->op_private |= OPpEXISTS_SUB;
5260 else if (kid->op_type == OP_AELEM)
5261 o->op_flags |= OPf_SPECIAL;
5262 else if (kid->op_type != OP_HELEM)
5263 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5264 PL_op_desc[o->op_type]);
5272 Perl_ck_gvconst(pTHX_ register OP *o)
5274 o = fold_constants(o);
5275 if (o->op_type == OP_CONST)
5282 Perl_ck_rvconst(pTHX_ register OP *o)
5285 SVOP *kid = (SVOP*)cUNOPo->op_first;
5287 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5288 if (kid->op_type == OP_CONST) {
5292 SV *kidsv = kid->op_sv;
5295 /* Is it a constant from cv_const_sv()? */
5296 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5297 SV *rsv = SvRV(kidsv);
5298 int svtype = SvTYPE(rsv);
5299 char *badtype = Nullch;
5301 switch (o->op_type) {
5303 if (svtype > SVt_PVMG)
5304 badtype = "a SCALAR";
5307 if (svtype != SVt_PVAV)
5308 badtype = "an ARRAY";
5311 if (svtype != SVt_PVHV) {
5312 if (svtype == SVt_PVAV) { /* pseudohash? */
5313 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5314 if (ksv && SvROK(*ksv)
5315 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5324 if (svtype != SVt_PVCV)
5329 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5332 name = SvPV(kidsv, n_a);
5333 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5334 char *badthing = Nullch;
5335 switch (o->op_type) {
5337 badthing = "a SCALAR";
5340 badthing = "an ARRAY";
5343 badthing = "a HASH";
5348 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5352 * This is a little tricky. We only want to add the symbol if we
5353 * didn't add it in the lexer. Otherwise we get duplicate strict
5354 * warnings. But if we didn't add it in the lexer, we must at
5355 * least pretend like we wanted to add it even if it existed before,
5356 * or we get possible typo warnings. OPpCONST_ENTERED says
5357 * whether the lexer already added THIS instance of this symbol.
5359 iscv = (o->op_type == OP_RV2CV) * 2;
5361 gv = gv_fetchpv(name,
5362 iscv | !(kid->op_private & OPpCONST_ENTERED),
5365 : o->op_type == OP_RV2SV
5367 : o->op_type == OP_RV2AV
5369 : o->op_type == OP_RV2HV
5372 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5374 kid->op_type = OP_GV;
5375 SvREFCNT_dec(kid->op_sv);
5377 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5378 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5379 SvREFCNT_dec(PL_curpad[kPADOP->op_padix]);
5381 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5383 kid->op_sv = SvREFCNT_inc(gv);
5385 kid->op_ppaddr = PL_ppaddr[OP_GV];
5392 Perl_ck_ftst(pTHX_ OP *o)
5395 I32 type = o->op_type;
5397 if (o->op_flags & OPf_REF) {
5400 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5401 SVOP *kid = (SVOP*)cUNOPo->op_first;
5403 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5405 OP *newop = newGVOP(type, OPf_REF,
5406 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5413 if (type == OP_FTTTY)
5414 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5417 o = newUNOP(type, 0, newDEFSVOP());
5420 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5422 if (PL_hints & HINT_LOCALE)
5423 o->op_private |= OPpLOCALE;
5430 Perl_ck_fun(pTHX_ OP *o)
5437 int type = o->op_type;
5438 register I32 oa = PL_opargs[type] >> OASHIFT;
5440 if (o->op_flags & OPf_STACKED) {
5441 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5444 return no_fh_allowed(o);
5447 if (o->op_flags & OPf_KIDS) {
5449 tokid = &cLISTOPo->op_first;
5450 kid = cLISTOPo->op_first;
5451 if (kid->op_type == OP_PUSHMARK ||
5452 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5454 tokid = &kid->op_sibling;
5455 kid = kid->op_sibling;
5457 if (!kid && PL_opargs[type] & OA_DEFGV)
5458 *tokid = kid = newDEFSVOP();
5462 sibl = kid->op_sibling;
5465 /* list seen where single (scalar) arg expected? */
5466 if (numargs == 1 && !(oa >> 4)
5467 && kid->op_type == OP_LIST && type != OP_SCALAR)
5469 return too_many_arguments(o,PL_op_desc[type]);
5482 if (kid->op_type == OP_CONST &&
5483 (kid->op_private & OPpCONST_BARE))
5485 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5486 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5487 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5488 if (ckWARN(WARN_DEPRECATED))
5489 Perl_warner(aTHX_ WARN_DEPRECATED,
5490 "Array @%s missing the @ in argument %"IVdf" of %s()",
5491 name, (IV)numargs, PL_op_desc[type]);
5494 kid->op_sibling = sibl;
5497 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5498 bad_type(numargs, "array", PL_op_desc[type], kid);
5502 if (kid->op_type == OP_CONST &&
5503 (kid->op_private & OPpCONST_BARE))
5505 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5506 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5507 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5508 if (ckWARN(WARN_DEPRECATED))
5509 Perl_warner(aTHX_ WARN_DEPRECATED,
5510 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5511 name, (IV)numargs, PL_op_desc[type]);
5514 kid->op_sibling = sibl;
5517 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5518 bad_type(numargs, "hash", PL_op_desc[type], kid);
5523 OP *newop = newUNOP(OP_NULL, 0, kid);
5524 kid->op_sibling = 0;
5526 newop->op_next = newop;
5528 kid->op_sibling = sibl;
5533 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5534 if (kid->op_type == OP_CONST &&
5535 (kid->op_private & OPpCONST_BARE))
5537 OP *newop = newGVOP(OP_GV, 0,
5538 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5543 else if (kid->op_type == OP_READLINE) {
5544 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5545 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5548 I32 flags = OPf_SPECIAL;
5552 /* is this op a FH constructor? */
5553 if (is_handle_constructor(o,numargs)) {
5554 char *name = Nullch;
5558 /* Set a flag to tell rv2gv to vivify
5559 * need to "prove" flag does not mean something
5560 * else already - NI-S 1999/05/07
5563 if (kid->op_type == OP_PADSV) {
5564 SV **namep = av_fetch(PL_comppad_name,
5566 if (namep && *namep)
5567 name = SvPV(*namep, len);
5569 else if (kid->op_type == OP_RV2SV
5570 && kUNOP->op_first->op_type == OP_GV)
5572 GV *gv = cGVOPx_gv(kUNOP->op_first);
5574 len = GvNAMELEN(gv);
5576 else if (kid->op_type == OP_AELEM
5577 || kid->op_type == OP_HELEM)
5579 name = "__ANONIO__";
5585 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5586 namesv = PL_curpad[targ];
5587 (void)SvUPGRADE(namesv, SVt_PV);
5589 sv_setpvn(namesv, "$", 1);
5590 sv_catpvn(namesv, name, len);
5593 kid->op_sibling = 0;
5594 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5595 kid->op_targ = targ;
5596 kid->op_private |= priv;
5598 kid->op_sibling = sibl;
5604 mod(scalar(kid), type);
5608 tokid = &kid->op_sibling;
5609 kid = kid->op_sibling;
5611 o->op_private |= numargs;
5613 return too_many_arguments(o,PL_op_desc[o->op_type]);
5616 else if (PL_opargs[type] & OA_DEFGV) {
5618 return newUNOP(type, 0, newDEFSVOP());
5622 while (oa & OA_OPTIONAL)
5624 if (oa && oa != OA_LIST)
5625 return too_few_arguments(o,PL_op_desc[o->op_type]);
5631 Perl_ck_glob(pTHX_ OP *o)
5636 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5637 append_elem(OP_GLOB, o, newDEFSVOP());
5639 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5640 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5642 #if !defined(PERL_EXTERNAL_GLOB)
5643 /* XXX this can be tightened up and made more failsafe. */
5646 Perl_load_module(aTHX_ 0, newSVpvn("File::Glob", 10), Nullsv,
5647 /* null-terminated import list */
5648 newSVpvn(":globally", 9), Nullsv);
5649 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5652 #endif /* PERL_EXTERNAL_GLOB */
5654 if (gv && GvIMPORTED_CV(gv)) {
5655 append_elem(OP_GLOB, o,
5656 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5657 o->op_type = OP_LIST;
5658 o->op_ppaddr = PL_ppaddr[OP_LIST];
5659 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5660 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5661 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5662 append_elem(OP_LIST, o,
5663 scalar(newUNOP(OP_RV2CV, 0,
5664 newGVOP(OP_GV, 0, gv)))));
5665 o = newUNOP(OP_NULL, 0, ck_subr(o));
5666 o->op_targ = OP_GLOB; /* hint at what it used to be */
5669 gv = newGVgen("main");
5671 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5677 Perl_ck_grep(pTHX_ OP *o)
5681 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5683 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5684 NewOp(1101, gwop, 1, LOGOP);
5686 if (o->op_flags & OPf_STACKED) {
5689 kid = cLISTOPo->op_first->op_sibling;
5690 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5693 kid->op_next = (OP*)gwop;
5694 o->op_flags &= ~OPf_STACKED;
5696 kid = cLISTOPo->op_first->op_sibling;
5697 if (type == OP_MAPWHILE)
5704 kid = cLISTOPo->op_first->op_sibling;
5705 if (kid->op_type != OP_NULL)
5706 Perl_croak(aTHX_ "panic: ck_grep");
5707 kid = kUNOP->op_first;
5709 gwop->op_type = type;
5710 gwop->op_ppaddr = PL_ppaddr[type];
5711 gwop->op_first = listkids(o);
5712 gwop->op_flags |= OPf_KIDS;
5713 gwop->op_private = 1;
5714 gwop->op_other = LINKLIST(kid);
5715 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5716 kid->op_next = (OP*)gwop;
5718 kid = cLISTOPo->op_first->op_sibling;
5719 if (!kid || !kid->op_sibling)
5720 return too_few_arguments(o,PL_op_desc[o->op_type]);
5721 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5722 mod(kid, OP_GREPSTART);
5728 Perl_ck_index(pTHX_ OP *o)
5730 if (o->op_flags & OPf_KIDS) {
5731 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5733 kid = kid->op_sibling; /* get past "big" */
5734 if (kid && kid->op_type == OP_CONST)
5735 fbm_compile(((SVOP*)kid)->op_sv, 0);
5741 Perl_ck_lengthconst(pTHX_ OP *o)
5743 /* XXX length optimization goes here */
5748 Perl_ck_lfun(pTHX_ OP *o)
5750 OPCODE type = o->op_type;
5751 return modkids(ck_fun(o), type);
5755 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5758 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5759 switch (cUNOPo->op_first->op_type) {
5761 break; /* Globals via GV can be undef */
5763 case OP_AASSIGN: /* Is this a good idea? */
5764 Perl_warner(aTHX_ WARN_DEPRECATED,
5765 "defined(@array) is deprecated");
5766 Perl_warner(aTHX_ WARN_DEPRECATED,
5767 "\t(Maybe you should just omit the defined()?)\n");
5770 break; /* Globals via GV can be undef */
5772 Perl_warner(aTHX_ WARN_DEPRECATED,
5773 "defined(%%hash) is deprecated");
5774 Perl_warner(aTHX_ WARN_DEPRECATED,
5775 "\t(Maybe you should just omit the defined()?)\n");
5786 Perl_ck_rfun(pTHX_ OP *o)
5788 OPCODE type = o->op_type;
5789 return refkids(ck_fun(o), type);
5793 Perl_ck_listiob(pTHX_ OP *o)
5797 kid = cLISTOPo->op_first;
5800 kid = cLISTOPo->op_first;
5802 if (kid->op_type == OP_PUSHMARK)
5803 kid = kid->op_sibling;
5804 if (kid && o->op_flags & OPf_STACKED)
5805 kid = kid->op_sibling;
5806 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5807 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5808 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5809 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5810 cLISTOPo->op_first->op_sibling = kid;
5811 cLISTOPo->op_last = kid;
5812 kid = kid->op_sibling;
5817 append_elem(o->op_type, o, newDEFSVOP());
5823 if (PL_hints & HINT_LOCALE)
5824 o->op_private |= OPpLOCALE;
5831 Perl_ck_fun_locale(pTHX_ OP *o)
5837 if (PL_hints & HINT_LOCALE)
5838 o->op_private |= OPpLOCALE;
5845 Perl_ck_sassign(pTHX_ OP *o)
5847 OP *kid = cLISTOPo->op_first;
5848 /* has a disposable target? */
5849 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5850 && !(kid->op_flags & OPf_STACKED)
5851 /* Cannot steal the second time! */
5852 && !(kid->op_private & OPpTARGET_MY))
5854 OP *kkid = kid->op_sibling;
5856 /* Can just relocate the target. */
5857 if (kkid && kkid->op_type == OP_PADSV
5858 && !(kkid->op_private & OPpLVAL_INTRO))
5860 kid->op_targ = kkid->op_targ;
5862 /* Now we do not need PADSV and SASSIGN. */
5863 kid->op_sibling = o->op_sibling; /* NULL */
5864 cLISTOPo->op_first = NULL;
5867 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5875 Perl_ck_scmp(pTHX_ OP *o)
5879 if (PL_hints & HINT_LOCALE)
5880 o->op_private |= OPpLOCALE;
5887 Perl_ck_match(pTHX_ OP *o)
5889 o->op_private |= OPpRUNTIME;
5894 Perl_ck_method(pTHX_ OP *o)
5896 OP *kid = cUNOPo->op_first;
5897 if (kid->op_type == OP_CONST) {
5898 SV* sv = kSVOP->op_sv;
5899 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5901 (void)SvUPGRADE(sv, SVt_PVIV);
5903 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5904 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5905 kSVOP->op_sv = Nullsv;
5914 Perl_ck_null(pTHX_ OP *o)
5920 Perl_ck_open(pTHX_ OP *o)
5922 HV *table = GvHV(PL_hintgv);
5926 svp = hv_fetch(table, "open_IN", 7, FALSE);
5928 mode = mode_from_discipline(*svp);
5929 if (mode & O_BINARY)
5930 o->op_private |= OPpOPEN_IN_RAW;
5931 else if (mode & O_TEXT)
5932 o->op_private |= OPpOPEN_IN_CRLF;
5935 svp = hv_fetch(table, "open_OUT", 8, FALSE);
5937 mode = mode_from_discipline(*svp);
5938 if (mode & O_BINARY)
5939 o->op_private |= OPpOPEN_OUT_RAW;
5940 else if (mode & O_TEXT)
5941 o->op_private |= OPpOPEN_OUT_CRLF;
5944 if (o->op_type == OP_BACKTICK)
5950 Perl_ck_repeat(pTHX_ OP *o)
5952 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5953 o->op_private |= OPpREPEAT_DOLIST;
5954 cBINOPo->op_first = force_list(cBINOPo->op_first);
5962 Perl_ck_require(pTHX_ OP *o)
5964 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5965 SVOP *kid = (SVOP*)cUNOPo->op_first;
5967 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5969 for (s = SvPVX(kid->op_sv); *s; s++) {
5970 if (*s == ':' && s[1] == ':') {
5972 Move(s+2, s+1, strlen(s+2)+1, char);
5973 --SvCUR(kid->op_sv);
5976 if (SvREADONLY(kid->op_sv)) {
5977 SvREADONLY_off(kid->op_sv);
5978 sv_catpvn(kid->op_sv, ".pm", 3);
5979 SvREADONLY_on(kid->op_sv);
5982 sv_catpvn(kid->op_sv, ".pm", 3);
5990 Perl_ck_retarget(pTHX_ OP *o)
5992 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5999 Perl_ck_select(pTHX_ OP *o)
6002 if (o->op_flags & OPf_KIDS) {
6003 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6004 if (kid && kid->op_sibling) {
6005 o->op_type = OP_SSELECT;
6006 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
6008 return fold_constants(o);
6012 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6013 if (kid && kid->op_type == OP_RV2GV)
6014 kid->op_private &= ~HINT_STRICT_REFS;
6019 Perl_ck_shift(pTHX_ OP *o)
6021 I32 type = o->op_type;
6023 if (!(o->op_flags & OPf_KIDS)) {
6028 if (!CvUNIQUE(PL_compcv)) {
6029 argop = newOP(OP_PADAV, OPf_REF);
6030 argop->op_targ = 0; /* PL_curpad[0] is @_ */
6033 argop = newUNOP(OP_RV2AV, 0,
6034 scalar(newGVOP(OP_GV, 0,
6035 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6038 argop = newUNOP(OP_RV2AV, 0,
6039 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
6040 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6041 #endif /* USE_THREADS */
6042 return newUNOP(type, 0, scalar(argop));
6044 return scalar(modkids(ck_fun(o), type));
6048 Perl_ck_sort(pTHX_ OP *o)
6053 if (PL_hints & HINT_LOCALE)
6054 o->op_private |= OPpLOCALE;
6057 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
6059 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6060 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
6062 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
6064 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
6066 if (kid->op_type == OP_SCOPE) {
6070 else if (kid->op_type == OP_LEAVE) {
6071 if (o->op_type == OP_SORT) {
6072 null(kid); /* wipe out leave */
6075 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
6076 if (k->op_next == kid)
6078 /* don't descend into loops */
6079 else if (k->op_type == OP_ENTERLOOP
6080 || k->op_type == OP_ENTERITER)
6082 k = cLOOPx(k)->op_lastop;
6087 kid->op_next = 0; /* just disconnect the leave */
6088 k = kLISTOP->op_first;
6093 if (o->op_type == OP_SORT) {
6094 /* provide scalar context for comparison function/block */
6100 o->op_flags |= OPf_SPECIAL;
6102 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
6105 firstkid = firstkid->op_sibling;
6108 /* provide list context for arguments */
6109 if (o->op_type == OP_SORT)
6116 S_simplify_sort(pTHX_ OP *o)
6119 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6123 if (!(o->op_flags & OPf_STACKED))
6125 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
6126 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
6127 kid = kUNOP->op_first; /* get past null */
6128 if (kid->op_type != OP_SCOPE)
6130 kid = kLISTOP->op_last; /* get past scope */
6131 switch(kid->op_type) {
6139 k = kid; /* remember this node*/
6140 if (kBINOP->op_first->op_type != OP_RV2SV)
6142 kid = kBINOP->op_first; /* get past cmp */
6143 if (kUNOP->op_first->op_type != OP_GV)
6145 kid = kUNOP->op_first; /* get past rv2sv */
6147 if (GvSTASH(gv) != PL_curstash)
6149 if (strEQ(GvNAME(gv), "a"))
6151 else if (strEQ(GvNAME(gv), "b"))
6155 kid = k; /* back to cmp */
6156 if (kBINOP->op_last->op_type != OP_RV2SV)
6158 kid = kBINOP->op_last; /* down to 2nd arg */
6159 if (kUNOP->op_first->op_type != OP_GV)
6161 kid = kUNOP->op_first; /* get past rv2sv */
6163 if (GvSTASH(gv) != PL_curstash
6165 ? strNE(GvNAME(gv), "a")
6166 : strNE(GvNAME(gv), "b")))
6168 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6170 o->op_private |= OPpSORT_REVERSE;
6171 if (k->op_type == OP_NCMP)
6172 o->op_private |= OPpSORT_NUMERIC;
6173 if (k->op_type == OP_I_NCMP)
6174 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6175 kid = cLISTOPo->op_first->op_sibling;
6176 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6177 op_free(kid); /* then delete it */
6178 cLISTOPo->op_children--;
6182 Perl_ck_split(pTHX_ OP *o)
6186 if (o->op_flags & OPf_STACKED)
6187 return no_fh_allowed(o);
6189 kid = cLISTOPo->op_first;
6190 if (kid->op_type != OP_NULL)
6191 Perl_croak(aTHX_ "panic: ck_split");
6192 kid = kid->op_sibling;
6193 op_free(cLISTOPo->op_first);
6194 cLISTOPo->op_first = kid;
6196 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6197 cLISTOPo->op_last = kid; /* There was only one element previously */
6200 if (kid->op_type != OP_MATCH) {
6201 OP *sibl = kid->op_sibling;
6202 kid->op_sibling = 0;
6203 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6204 if (cLISTOPo->op_first == cLISTOPo->op_last)
6205 cLISTOPo->op_last = kid;
6206 cLISTOPo->op_first = kid;
6207 kid->op_sibling = sibl;
6210 kid->op_type = OP_PUSHRE;
6211 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6214 if (!kid->op_sibling)
6215 append_elem(OP_SPLIT, o, newDEFSVOP());
6217 kid = kid->op_sibling;
6220 if (!kid->op_sibling)
6221 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6223 kid = kid->op_sibling;
6226 if (kid->op_sibling)
6227 return too_many_arguments(o,PL_op_desc[o->op_type]);
6233 Perl_ck_join(pTHX_ OP *o)
6235 if (ckWARN(WARN_SYNTAX)) {
6236 OP *kid = cLISTOPo->op_first->op_sibling;
6237 if (kid && kid->op_type == OP_MATCH) {
6238 char *pmstr = "STRING";
6239 if (kPMOP->op_pmregexp)
6240 pmstr = kPMOP->op_pmregexp->precomp;
6241 Perl_warner(aTHX_ WARN_SYNTAX,
6242 "/%s/ should probably be written as \"%s\"",
6250 S_method_2entersub(pTHX_ OP *o, OP *o2, OP *svop)
6253 SV *method = ((SVOP*)svop)->op_sv;
6259 if (svop->op_type == OP_METHOD_NAMED) {
6260 methname = SvPV(method, methlen);
6266 if (o2->op_type == OP_CONST) {
6268 char *package = SvPV(((SVOP*)o2)->op_sv, len);
6269 stash = gv_stashpvn(package, len, FALSE);
6271 else if (o2->op_type == OP_PADSV) {
6272 /* my Dog $spot = shift; $spot->bark */
6273 SV *sv = *av_fetch(PL_comppad_name, o2->op_targ, FALSE);
6274 if (sv && SvOBJECT(sv)) {
6275 stash = SvSTASH(sv);
6285 /* -1 so cache globs are not created */
6286 /* XXX: support SUPER:: and UNIVERSAL, but not AUTOLOAD */
6287 if (!(stash && (gv = gv_fetchmeth(stash, methname, methlen, -1)) &&
6292 /* XXX: check entire @ISA tree for readonly-ness ? */
6293 if (GvSTASH(CvGV(GvCV(gv))) != stash) {
6296 gvp = (GV**)hv_fetch(stash, "ISA", 3, FALSE);
6297 av = (gvp && (isagv = *gvp) && isagv != (GV*)&PL_sv_undef) ?
6298 GvAV(isagv) : Nullav;
6300 if (isagv && av && !SvREADONLY((SV*)av)) {
6301 return Nullop; /* @ISA is not frozen */
6304 gv = CvGV(GvCV(gv)); /* point to the real gv */
6307 if (o2->op_type == OP_CONST) {
6308 /* remove bareword-ness of class name */
6309 o2->op_private &= ~(OPpCONST_BARE|OPpCONST_STRICT);
6312 for (mop = o2; mop->op_sibling->op_sibling; mop = mop->op_sibling) ;
6314 op_free(mop->op_sibling); /* loose OP_METHOD_NAMED */
6315 mop->op_sibling = scalar(newUNOP(OP_RV2CV, 0,
6316 newGVOP(OP_GV, 0, gv)));
6318 ((cUNOPo->op_first->op_sibling)
6319 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first->op_sibling = o2;
6325 Perl_ck_subr(pTHX_ OP *o)
6328 OP *prev = ((cUNOPo->op_first->op_sibling)
6329 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6330 OP *o2 = prev->op_sibling;
6339 o->op_private |= OPpENTERSUB_HASTARG;
6340 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6341 if (cvop->op_type == OP_RV2CV) {
6343 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6344 null(cvop); /* disable rv2cv */
6345 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6346 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6347 GV *gv = cGVOPx_gv(tmpop);
6350 tmpop->op_private |= OPpEARLY_CV;
6351 else if (SvPOK(cv)) {
6352 namegv = CvANON(cv) ? gv : CvGV(cv);
6353 proto = SvPV((SV*)cv, n_a);
6357 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6358 if ((PL_hints & HINT_CT_MRESOLVE) && /* use base qw(... +readonly) */
6359 (o2->op_type == OP_CONST || o2->op_type == OP_PADSV)) {
6361 if ((nop = method_2entersub(o, o2, cvop))) {
6365 if (o2->op_type == OP_CONST) {
6366 o2->op_private &= ~OPpCONST_STRICT;
6368 else if (o2->op_type == OP_LIST) {
6369 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6370 if (o && o->op_type == OP_CONST)
6371 o->op_private &= ~OPpCONST_STRICT;
6374 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6375 if (PERLDB_SUB && PL_curstash != PL_debstash)
6376 o->op_private |= OPpENTERSUB_DB;
6377 while (o2 != cvop) {
6381 return too_many_arguments(o, gv_ename(namegv));
6399 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6401 arg == 1 ? "block or sub {}" : "sub {}",
6402 gv_ename(namegv), o2);
6405 /* '*' allows any scalar type, including bareword */
6408 if (o2->op_type == OP_RV2GV)
6409 goto wrapref; /* autoconvert GLOB -> GLOBref */
6410 else if (o2->op_type == OP_CONST)
6411 o2->op_private &= ~OPpCONST_STRICT;
6412 else if (o2->op_type == OP_ENTERSUB) {
6413 /* accidental subroutine, revert to bareword */
6414 OP *gvop = ((UNOP*)o2)->op_first;
6415 if (gvop && gvop->op_type == OP_NULL) {
6416 gvop = ((UNOP*)gvop)->op_first;
6418 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6421 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6422 (gvop = ((UNOP*)gvop)->op_first) &&
6423 gvop->op_type == OP_GV)
6425 GV *gv = cGVOPx_gv(gvop);
6426 OP *sibling = o2->op_sibling;
6427 SV *n = newSVpvn("",0);
6429 gv_fullname3(n, gv, "");
6430 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6431 sv_chop(n, SvPVX(n)+6);
6432 o2 = newSVOP(OP_CONST, 0, n);
6433 prev->op_sibling = o2;
6434 o2->op_sibling = sibling;
6446 if (o2->op_type != OP_RV2GV)
6447 bad_type(arg, "symbol", gv_ename(namegv), o2);
6450 if (o2->op_type != OP_ENTERSUB)
6451 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6454 if (o2->op_type != OP_RV2SV
6455 && o2->op_type != OP_PADSV
6456 && o2->op_type != OP_HELEM
6457 && o2->op_type != OP_AELEM
6458 && o2->op_type != OP_THREADSV)
6460 bad_type(arg, "scalar", gv_ename(namegv), o2);
6464 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6465 bad_type(arg, "array", gv_ename(namegv), o2);
6468 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6469 bad_type(arg, "hash", gv_ename(namegv), o2);
6473 OP* sib = kid->op_sibling;
6474 kid->op_sibling = 0;
6475 o2 = newUNOP(OP_REFGEN, 0, kid);
6476 o2->op_sibling = sib;
6477 prev->op_sibling = o2;
6488 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6489 gv_ename(namegv), SvPV((SV*)cv, n_a));
6494 mod(o2, OP_ENTERSUB);
6496 o2 = o2->op_sibling;
6498 if (proto && !optional &&
6499 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6500 return too_few_arguments(o, gv_ename(namegv));
6505 Perl_ck_svconst(pTHX_ OP *o)
6507 SvREADONLY_on(cSVOPo->op_sv);
6512 Perl_ck_trunc(pTHX_ OP *o)
6514 if (o->op_flags & OPf_KIDS) {
6515 SVOP *kid = (SVOP*)cUNOPo->op_first;
6517 if (kid->op_type == OP_NULL)
6518 kid = (SVOP*)kid->op_sibling;
6519 if (kid && kid->op_type == OP_CONST &&
6520 (kid->op_private & OPpCONST_BARE))
6522 o->op_flags |= OPf_SPECIAL;
6523 kid->op_private &= ~OPpCONST_STRICT;
6529 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6532 Perl_peep(pTHX_ register OP *o)
6535 register OP* oldop = 0;
6537 OP *last_composite = Nullop;
6539 if (!o || o->op_seq)
6543 SAVEVPTR(PL_curcop);
6544 for (; o; o = o->op_next) {
6550 switch (o->op_type) {
6554 PL_curcop = ((COP*)o); /* for warnings */
6555 o->op_seq = PL_op_seqmax++;
6556 last_composite = Nullop;
6560 if (cSVOPo->op_private & OPpCONST_STRICT)
6561 no_bareword_allowed(o);
6563 /* Relocate sv to the pad for thread safety.
6564 * Despite being a "constant", the SV is written to,
6565 * for reference counts, sv_upgrade() etc. */
6567 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6568 if (SvPADTMP(cSVOPo->op_sv)) {
6569 /* If op_sv is already a PADTMP then it is being used by
6570 * another pad, so make a copy. */
6571 sv_setsv(PL_curpad[ix],cSVOPo->op_sv);
6572 SvREADONLY_on(PL_curpad[ix]);
6573 SvREFCNT_dec(cSVOPo->op_sv);
6576 SvREFCNT_dec(PL_curpad[ix]);
6577 SvPADTMP_on(cSVOPo->op_sv);
6578 PL_curpad[ix] = cSVOPo->op_sv;
6580 cSVOPo->op_sv = Nullsv;
6584 o->op_seq = PL_op_seqmax++;
6588 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6589 if (o->op_next->op_private & OPpTARGET_MY) {
6590 if (o->op_flags & OPf_STACKED) /* chained concats */
6591 goto ignore_optimization;
6593 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6594 o->op_targ = o->op_next->op_targ;
6595 o->op_next->op_targ = 0;
6596 o->op_private |= OPpTARGET_MY;
6601 ignore_optimization:
6602 o->op_seq = PL_op_seqmax++;
6605 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6606 o->op_seq = PL_op_seqmax++;
6607 break; /* Scalar stub must produce undef. List stub is noop */
6611 if (o->op_targ == OP_NEXTSTATE
6612 || o->op_targ == OP_DBSTATE
6613 || o->op_targ == OP_SETSTATE)
6615 PL_curcop = ((COP*)o);
6622 if (oldop && o->op_next) {
6623 oldop->op_next = o->op_next;
6626 o->op_seq = PL_op_seqmax++;
6630 if (o->op_next->op_type == OP_RV2SV) {
6631 if (!(o->op_next->op_private & OPpDEREF)) {
6633 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6635 o->op_next = o->op_next->op_next;
6636 o->op_type = OP_GVSV;
6637 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6640 else if (o->op_next->op_type == OP_RV2AV) {
6641 OP* pop = o->op_next->op_next;
6643 if (pop->op_type == OP_CONST &&
6644 (PL_op = pop->op_next) &&
6645 pop->op_next->op_type == OP_AELEM &&
6646 !(pop->op_next->op_private &
6647 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6648 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6656 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6657 o->op_next = pop->op_next->op_next;
6658 o->op_type = OP_AELEMFAST;
6659 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6660 o->op_private = (U8)i;
6665 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6667 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6668 /* XXX could check prototype here instead of just carping */
6669 SV *sv = sv_newmortal();
6670 gv_efullname3(sv, gv, Nullch);
6671 Perl_warner(aTHX_ WARN_PROTOTYPE,
6672 "%s() called too early to check prototype",
6677 o->op_seq = PL_op_seqmax++;
6688 o->op_seq = PL_op_seqmax++;
6689 while (cLOGOP->op_other->op_type == OP_NULL)
6690 cLOGOP->op_other = cLOGOP->op_other->op_next;
6691 peep(cLOGOP->op_other);
6695 o->op_seq = PL_op_seqmax++;
6696 peep(cLOOP->op_redoop);
6697 peep(cLOOP->op_nextop);
6698 peep(cLOOP->op_lastop);
6704 o->op_seq = PL_op_seqmax++;
6705 peep(cPMOP->op_pmreplstart);
6709 o->op_seq = PL_op_seqmax++;
6710 if (ckWARN(WARN_SYNTAX) && o->op_next
6711 && o->op_next->op_type == OP_NEXTSTATE) {
6712 if (o->op_next->op_sibling &&
6713 o->op_next->op_sibling->op_type != OP_EXIT &&
6714 o->op_next->op_sibling->op_type != OP_WARN &&
6715 o->op_next->op_sibling->op_type != OP_DIE) {
6716 line_t oldline = CopLINE(PL_curcop);
6718 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6719 Perl_warner(aTHX_ WARN_EXEC,
6720 "Statement unlikely to be reached");
6721 Perl_warner(aTHX_ WARN_EXEC,
6722 "\t(Maybe you meant system() when you said exec()?)\n");
6723 CopLINE_set(PL_curcop, oldline);
6732 SV **svp, **indsvp, *sv;
6737 o->op_seq = PL_op_seqmax++;
6738 if ((o->op_private & (OPpLVAL_INTRO))
6739 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6741 rop = (UNOP*)((BINOP*)o)->op_first;
6742 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6744 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6745 if (!SvOBJECT(lexname))
6747 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6748 if (!fields || !GvHV(*fields))
6750 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6751 key = SvPV(*svp, keylen);
6752 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6754 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6755 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6757 ind = SvIV(*indsvp);
6759 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6760 rop->op_type = OP_RV2AV;
6761 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6762 o->op_type = OP_AELEM;
6763 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6765 if (SvREADONLY(*svp))
6767 SvFLAGS(sv) |= (SvFLAGS(*svp)
6768 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6778 SV **svp, **indsvp, *sv;
6782 SVOP *first_key_op, *key_op;
6784 o->op_seq = PL_op_seqmax++;
6785 if ((o->op_private & (OPpLVAL_INTRO))
6786 /* I bet there's always a pushmark... */
6787 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
6788 /* hmmm, no optimization if list contains only one key. */
6790 rop = (UNOP*)((LISTOP*)o)->op_last;
6791 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6793 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6794 if (!SvOBJECT(lexname))
6796 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6797 if (!fields || !GvHV(*fields))
6799 /* Again guessing that the pushmark can be jumped over.... */
6800 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
6801 ->op_first->op_sibling;
6802 /* Check that the key list contains only constants. */
6803 for (key_op = first_key_op; key_op;
6804 key_op = (SVOP*)key_op->op_sibling)
6805 if (key_op->op_type != OP_CONST)
6809 rop->op_type = OP_RV2AV;
6810 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6811 o->op_type = OP_ASLICE;
6812 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
6813 for (key_op = first_key_op; key_op;
6814 key_op = (SVOP*)key_op->op_sibling) {
6815 svp = cSVOPx_svp(key_op);
6816 key = SvPV(*svp, keylen);
6817 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6819 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
6820 "in variable %s of type %s",
6821 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6823 ind = SvIV(*indsvp);
6825 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6827 if (SvREADONLY(*svp))
6829 SvFLAGS(sv) |= (SvFLAGS(*svp)
6830 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6839 if (!(o->op_flags & OPf_WANT)
6840 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6844 o->op_seq = PL_op_seqmax++;
6848 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6849 o->op_seq = PL_op_seqmax++;
6855 if (last_composite) {
6856 OP *r = last_composite;
6858 while (r->op_sibling)
6861 || (r->op_next->op_type == OP_LIST
6862 && r->op_next->op_next == o))
6864 if (last_composite->op_type == OP_RV2AV)
6865 yyerror("Lvalue subs returning arrays not implemented yet");
6867 yyerror("Lvalue subs returning hashes not implemented yet");
6874 o->op_seq = PL_op_seqmax++;