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)))
2688 o->op_private |= OPpTRANS_IDENTICAL;
2692 while (t < tend || tfirst <= tlast) {
2693 /* see if we need more "t" chars */
2694 if (tfirst > tlast) {
2695 tfirst = (I32)utf8_to_uv(t, &ulen);
2697 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2698 tlast = (I32)utf8_to_uv(++t, &ulen);
2705 /* now see if we need more "r" chars */
2706 if (rfirst > rlast) {
2708 rfirst = (I32)utf8_to_uv(r, &ulen);
2710 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2711 rlast = (I32)utf8_to_uv(++r, &ulen);
2720 rfirst = rlast = 0xffffffff;
2724 /* now see which range will peter our first, if either. */
2725 tdiff = tlast - tfirst;
2726 rdiff = rlast - rfirst;
2733 if (rfirst == 0xffffffff) {
2734 diff = tdiff; /* oops, pretend rdiff is infinite */
2736 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2737 (long)tfirst, (long)tlast);
2739 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2743 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2744 (long)tfirst, (long)(tfirst + diff),
2747 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2748 (long)tfirst, (long)rfirst);
2750 if (rfirst + diff > max)
2751 max = rfirst + diff;
2756 else if (rfirst <= 0x800)
2757 grows |= (tfirst < 0x80);
2758 else if (rfirst <= 0x10000)
2759 grows |= (tfirst < 0x800);
2760 else if (rfirst <= 0x200000)
2761 grows |= (tfirst < 0x10000);
2762 else if (rfirst <= 0x4000000)
2763 grows |= (tfirst < 0x200000);
2764 else if (rfirst <= 0x80000000)
2765 grows |= (tfirst < 0x4000000);
2777 else if (max > 0xff)
2782 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2783 SvREFCNT_dec(listsv);
2785 SvREFCNT_dec(transv);
2787 if (!del && havefinal)
2788 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
2789 newSVuv((UV)final), 0);
2791 if (grows && to_utf)
2792 o->op_private |= OPpTRANS_GROWS;
2799 tbl = (short*)cPVOPo->op_pv;
2801 Zero(tbl, 256, short);
2802 for (i = 0; i < tlen; i++)
2804 for (i = 0, j = 0; i < 256; i++) {
2820 if (!rlen && !del) {
2823 o->op_private |= OPpTRANS_IDENTICAL;
2825 for (i = 0; i < 256; i++)
2827 for (i = 0, j = 0; i < tlen; i++,j++) {
2830 if (tbl[t[i]] == -1)
2836 if (tbl[t[i]] == -1)
2847 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2852 NewOp(1101, pmop, 1, PMOP);
2853 pmop->op_type = type;
2854 pmop->op_ppaddr = PL_ppaddr[type];
2855 pmop->op_flags = flags;
2856 pmop->op_private = 0 | (flags >> 8);
2858 if (PL_hints & HINT_RE_TAINT)
2859 pmop->op_pmpermflags |= PMf_RETAINT;
2860 if (PL_hints & HINT_LOCALE)
2861 pmop->op_pmpermflags |= PMf_LOCALE;
2862 pmop->op_pmflags = pmop->op_pmpermflags;
2864 /* link into pm list */
2865 if (type != OP_TRANS && PL_curstash) {
2866 pmop->op_pmnext = HvPMROOT(PL_curstash);
2867 HvPMROOT(PL_curstash) = pmop;
2874 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2879 I32 repl_has_vars = 0;
2881 if (o->op_type == OP_TRANS)
2882 return pmtrans(o, expr, repl);
2884 PL_hints |= HINT_BLOCK_SCOPE;
2887 if (expr->op_type == OP_CONST) {
2889 SV *pat = ((SVOP*)expr)->op_sv;
2890 char *p = SvPV(pat, plen);
2891 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2892 sv_setpvn(pat, "\\s+", 3);
2893 p = SvPV(pat, plen);
2894 pm->op_pmflags |= PMf_SKIPWHITE;
2896 if ((PL_hints & HINT_UTF8) || (SvUTF8(pat) && !(PL_hints & HINT_BYTE)))
2897 pm->op_pmdynflags |= PMdf_UTF8;
2898 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2899 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2900 pm->op_pmflags |= PMf_WHITE;
2904 if (PL_hints & HINT_UTF8)
2905 pm->op_pmdynflags |= PMdf_UTF8;
2906 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2907 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2909 : OP_REGCMAYBE),0,expr);
2911 NewOp(1101, rcop, 1, LOGOP);
2912 rcop->op_type = OP_REGCOMP;
2913 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2914 rcop->op_first = scalar(expr);
2915 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2916 ? (OPf_SPECIAL | OPf_KIDS)
2918 rcop->op_private = 1;
2921 /* establish postfix order */
2922 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2924 rcop->op_next = expr;
2925 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2928 rcop->op_next = LINKLIST(expr);
2929 expr->op_next = (OP*)rcop;
2932 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2937 if (pm->op_pmflags & PMf_EVAL) {
2939 if (CopLINE(PL_curcop) < PL_multi_end)
2940 CopLINE_set(PL_curcop, PL_multi_end);
2943 else if (repl->op_type == OP_THREADSV
2944 && strchr("&`'123456789+",
2945 PL_threadsv_names[repl->op_targ]))
2949 #endif /* USE_THREADS */
2950 else if (repl->op_type == OP_CONST)
2954 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2955 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2957 if (curop->op_type == OP_THREADSV) {
2959 if (strchr("&`'123456789+", curop->op_private))
2963 if (curop->op_type == OP_GV) {
2964 GV *gv = cGVOPx_gv(curop);
2966 if (strchr("&`'123456789+", *GvENAME(gv)))
2969 #endif /* USE_THREADS */
2970 else if (curop->op_type == OP_RV2CV)
2972 else if (curop->op_type == OP_RV2SV ||
2973 curop->op_type == OP_RV2AV ||
2974 curop->op_type == OP_RV2HV ||
2975 curop->op_type == OP_RV2GV) {
2976 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2979 else if (curop->op_type == OP_PADSV ||
2980 curop->op_type == OP_PADAV ||
2981 curop->op_type == OP_PADHV ||
2982 curop->op_type == OP_PADANY) {
2985 else if (curop->op_type == OP_PUSHRE)
2986 ; /* Okay here, dangerous in newASSIGNOP */
2995 && (!pm->op_pmregexp
2996 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2997 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2998 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2999 prepend_elem(o->op_type, scalar(repl), o);
3002 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
3003 pm->op_pmflags |= PMf_MAYBE_CONST;
3004 pm->op_pmpermflags |= PMf_MAYBE_CONST;
3006 NewOp(1101, rcop, 1, LOGOP);
3007 rcop->op_type = OP_SUBSTCONT;
3008 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3009 rcop->op_first = scalar(repl);
3010 rcop->op_flags |= OPf_KIDS;
3011 rcop->op_private = 1;
3014 /* establish postfix order */
3015 rcop->op_next = LINKLIST(repl);
3016 repl->op_next = (OP*)rcop;
3018 pm->op_pmreplroot = scalar((OP*)rcop);
3019 pm->op_pmreplstart = LINKLIST(rcop);
3028 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3031 NewOp(1101, svop, 1, SVOP);
3032 svop->op_type = type;
3033 svop->op_ppaddr = PL_ppaddr[type];
3035 svop->op_next = (OP*)svop;
3036 svop->op_flags = flags;
3037 if (PL_opargs[type] & OA_RETSCALAR)
3039 if (PL_opargs[type] & OA_TARGET)
3040 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3041 return CHECKOP(type, svop);
3045 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3048 NewOp(1101, padop, 1, PADOP);
3049 padop->op_type = type;
3050 padop->op_ppaddr = PL_ppaddr[type];
3051 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3052 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3053 PL_curpad[padop->op_padix] = sv;
3055 padop->op_next = (OP*)padop;
3056 padop->op_flags = flags;
3057 if (PL_opargs[type] & OA_RETSCALAR)
3059 if (PL_opargs[type] & OA_TARGET)
3060 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3061 return CHECKOP(type, padop);
3065 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3070 return newPADOP(type, flags, SvREFCNT_inc(gv));
3072 return newSVOP(type, flags, SvREFCNT_inc(gv));
3077 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3080 NewOp(1101, pvop, 1, PVOP);
3081 pvop->op_type = type;
3082 pvop->op_ppaddr = PL_ppaddr[type];
3084 pvop->op_next = (OP*)pvop;
3085 pvop->op_flags = flags;
3086 if (PL_opargs[type] & OA_RETSCALAR)
3088 if (PL_opargs[type] & OA_TARGET)
3089 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3090 return CHECKOP(type, pvop);
3094 Perl_package(pTHX_ OP *o)
3099 save_hptr(&PL_curstash);
3100 save_item(PL_curstname);
3105 name = SvPV(sv, len);
3106 PL_curstash = gv_stashpvn(name,len,TRUE);
3107 sv_setpvn(PL_curstname, name, len);
3111 sv_setpv(PL_curstname,"<none>");
3112 PL_curstash = Nullhv;
3114 PL_hints |= HINT_BLOCK_SCOPE;
3115 PL_copline = NOLINE;
3120 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3128 if (id->op_type != OP_CONST)
3129 Perl_croak(aTHX_ "Module name must be constant");
3133 if (version != Nullop) {
3134 SV *vesv = ((SVOP*)version)->op_sv;
3136 if (arg == Nullop && !SvNIOKp(vesv)) {
3143 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3144 Perl_croak(aTHX_ "Version number must be constant number");
3146 /* Make copy of id so we don't free it twice */
3147 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3149 /* Fake up a method call to VERSION */
3150 meth = newSVpvn("VERSION",7);
3151 sv_upgrade(meth, SVt_PVIV);
3152 (void)SvIOK_on(meth);
3153 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3154 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3155 append_elem(OP_LIST,
3156 prepend_elem(OP_LIST, pack, list(version)),
3157 newSVOP(OP_METHOD_NAMED, 0, meth)));
3161 /* Fake up an import/unimport */
3162 if (arg && arg->op_type == OP_STUB)
3163 imop = arg; /* no import on explicit () */
3164 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3165 imop = Nullop; /* use 5.0; */
3170 /* Make copy of id so we don't free it twice */
3171 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3173 /* Fake up a method call to import/unimport */
3174 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);;
3175 sv_upgrade(meth, SVt_PVIV);
3176 (void)SvIOK_on(meth);
3177 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3178 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3179 append_elem(OP_LIST,
3180 prepend_elem(OP_LIST, pack, list(arg)),
3181 newSVOP(OP_METHOD_NAMED, 0, meth)));
3184 /* Fake up a require, handle override, if any */
3185 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3186 if (!(gv && GvIMPORTED_CV(gv)))
3187 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3189 if (gv && GvIMPORTED_CV(gv)) {
3190 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3191 append_elem(OP_LIST, id,
3192 scalar(newUNOP(OP_RV2CV, 0,
3197 rqop = newUNOP(OP_REQUIRE, 0, id);
3200 /* Fake up the BEGIN {}, which does its thing immediately. */
3202 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3205 append_elem(OP_LINESEQ,
3206 append_elem(OP_LINESEQ,
3207 newSTATEOP(0, Nullch, rqop),
3208 newSTATEOP(0, Nullch, veop)),
3209 newSTATEOP(0, Nullch, imop) ));
3211 PL_hints |= HINT_BLOCK_SCOPE;
3212 PL_copline = NOLINE;
3217 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3220 va_start(args, ver);
3221 vload_module(flags, name, ver, &args);
3225 #ifdef PERL_IMPLICIT_CONTEXT
3227 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3231 va_start(args, ver);
3232 vload_module(flags, name, ver, &args);
3238 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3240 OP *modname, *veop, *imop;
3242 modname = newSVOP(OP_CONST, 0, name);
3243 modname->op_private |= OPpCONST_BARE;
3245 veop = newSVOP(OP_CONST, 0, ver);
3249 if (flags & PERL_LOADMOD_NOIMPORT) {
3250 imop = sawparens(newNULLLIST());
3252 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3253 imop = va_arg(*args, OP*);
3258 sv = va_arg(*args, SV*);
3260 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3261 sv = va_arg(*args, SV*);
3265 line_t ocopline = PL_copline;
3266 int oexpect = PL_expect;
3268 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3269 veop, modname, imop);
3270 PL_expect = oexpect;
3271 PL_copline = ocopline;
3276 Perl_dofile(pTHX_ OP *term)
3281 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3282 if (!(gv && GvIMPORTED_CV(gv)))
3283 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3285 if (gv && GvIMPORTED_CV(gv)) {
3286 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3287 append_elem(OP_LIST, term,
3288 scalar(newUNOP(OP_RV2CV, 0,
3293 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3299 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3301 return newBINOP(OP_LSLICE, flags,
3302 list(force_list(subscript)),
3303 list(force_list(listval)) );
3307 S_list_assignment(pTHX_ register OP *o)
3312 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3313 o = cUNOPo->op_first;
3315 if (o->op_type == OP_COND_EXPR) {
3316 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3317 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3322 yyerror("Assignment to both a list and a scalar");
3326 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3327 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3328 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3331 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3334 if (o->op_type == OP_RV2SV)
3341 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3346 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3347 return newLOGOP(optype, 0,
3348 mod(scalar(left), optype),
3349 newUNOP(OP_SASSIGN, 0, scalar(right)));
3352 return newBINOP(optype, OPf_STACKED,
3353 mod(scalar(left), optype), scalar(right));
3357 if (list_assignment(left)) {
3362 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3363 left = mod(left, OP_AASSIGN);
3371 curop = list(force_list(left));
3372 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3373 o->op_private = 0 | (flags >> 8);
3374 for (curop = ((LISTOP*)curop)->op_first;
3375 curop; curop = curop->op_sibling)
3377 if (curop->op_type == OP_RV2HV &&
3378 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3379 o->op_private |= OPpASSIGN_HASH;
3383 if (!(left->op_private & OPpLVAL_INTRO)) {
3386 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3387 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3388 if (curop->op_type == OP_GV) {
3389 GV *gv = cGVOPx_gv(curop);
3390 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3392 SvCUR(gv) = PL_generation;
3394 else if (curop->op_type == OP_PADSV ||
3395 curop->op_type == OP_PADAV ||
3396 curop->op_type == OP_PADHV ||
3397 curop->op_type == OP_PADANY) {
3398 SV **svp = AvARRAY(PL_comppad_name);
3399 SV *sv = svp[curop->op_targ];
3400 if (SvCUR(sv) == PL_generation)
3402 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3404 else if (curop->op_type == OP_RV2CV)
3406 else if (curop->op_type == OP_RV2SV ||
3407 curop->op_type == OP_RV2AV ||
3408 curop->op_type == OP_RV2HV ||
3409 curop->op_type == OP_RV2GV) {
3410 if (lastop->op_type != OP_GV) /* funny deref? */
3413 else if (curop->op_type == OP_PUSHRE) {
3414 if (((PMOP*)curop)->op_pmreplroot) {
3415 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3416 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3418 SvCUR(gv) = PL_generation;
3427 o->op_private |= OPpASSIGN_COMMON;
3429 if (right && right->op_type == OP_SPLIT) {
3431 if ((tmpop = ((LISTOP*)right)->op_first) &&
3432 tmpop->op_type == OP_PUSHRE)
3434 PMOP *pm = (PMOP*)tmpop;
3435 if (left->op_type == OP_RV2AV &&
3436 !(left->op_private & OPpLVAL_INTRO) &&
3437 !(o->op_private & OPpASSIGN_COMMON) )
3439 tmpop = ((UNOP*)left)->op_first;
3440 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3442 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3443 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3445 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3446 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3448 pm->op_pmflags |= PMf_ONCE;
3449 tmpop = cUNOPo->op_first; /* to list (nulled) */
3450 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3451 tmpop->op_sibling = Nullop; /* don't free split */
3452 right->op_next = tmpop->op_next; /* fix starting loc */
3453 op_free(o); /* blow off assign */
3454 right->op_flags &= ~OPf_WANT;
3455 /* "I don't know and I don't care." */
3460 if (PL_modcount < 10000 &&
3461 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3463 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3465 sv_setiv(sv, PL_modcount+1);
3473 right = newOP(OP_UNDEF, 0);
3474 if (right->op_type == OP_READLINE) {
3475 right->op_flags |= OPf_STACKED;
3476 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3479 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3480 o = newBINOP(OP_SASSIGN, flags,
3481 scalar(right), mod(scalar(left), OP_SASSIGN) );
3493 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3496 U32 seq = intro_my();
3499 NewOp(1101, cop, 1, COP);
3500 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3501 cop->op_type = OP_DBSTATE;
3502 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3505 cop->op_type = OP_NEXTSTATE;
3506 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3508 cop->op_flags = flags;
3509 cop->op_private = (PL_hints & HINT_BYTE);
3511 cop->op_private |= NATIVE_HINTS;
3513 PL_compiling.op_private = cop->op_private;
3514 cop->op_next = (OP*)cop;
3517 cop->cop_label = label;
3518 PL_hints |= HINT_BLOCK_SCOPE;
3521 cop->cop_arybase = PL_curcop->cop_arybase;
3522 if (specialWARN(PL_curcop->cop_warnings))
3523 cop->cop_warnings = PL_curcop->cop_warnings ;
3525 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3528 if (PL_copline == NOLINE)
3529 CopLINE_set(cop, CopLINE(PL_curcop));
3531 CopLINE_set(cop, PL_copline);
3532 PL_copline = NOLINE;
3535 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
3537 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
3539 CopSTASH_set(cop, PL_curstash);
3541 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3542 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3543 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3544 (void)SvIOK_on(*svp);
3545 SvIVX(*svp) = PTR2IV(cop);
3549 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3552 /* "Introduce" my variables to visible status. */
3560 if (! PL_min_intro_pending)
3561 return PL_cop_seqmax;
3563 svp = AvARRAY(PL_comppad_name);
3564 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3565 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3566 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3567 SvNVX(sv) = (NV)PL_cop_seqmax;
3570 PL_min_intro_pending = 0;
3571 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3572 return PL_cop_seqmax++;
3576 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3578 return new_logop(type, flags, &first, &other);
3582 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3587 OP *first = *firstp;
3588 OP *other = *otherp;
3590 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3591 return newBINOP(type, flags, scalar(first), scalar(other));
3593 scalarboolean(first);
3594 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3595 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3596 if (type == OP_AND || type == OP_OR) {
3602 first = *firstp = cUNOPo->op_first;
3604 first->op_next = o->op_next;
3605 cUNOPo->op_first = Nullop;
3609 if (first->op_type == OP_CONST) {
3610 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3611 Perl_warner(aTHX_ WARN_BAREWORD, "Bareword found in conditional");
3612 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3623 else if (first->op_type == OP_WANTARRAY) {
3629 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3630 OP *k1 = ((UNOP*)first)->op_first;
3631 OP *k2 = k1->op_sibling;
3633 switch (first->op_type)
3636 if (k2 && k2->op_type == OP_READLINE
3637 && (k2->op_flags & OPf_STACKED)
3638 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3640 warnop = k2->op_type;
3645 if (k1->op_type == OP_READDIR
3646 || k1->op_type == OP_GLOB
3647 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3648 || k1->op_type == OP_EACH)
3650 warnop = ((k1->op_type == OP_NULL)
3651 ? k1->op_targ : k1->op_type);
3656 line_t oldline = CopLINE(PL_curcop);
3657 CopLINE_set(PL_curcop, PL_copline);
3658 Perl_warner(aTHX_ WARN_MISC,
3659 "Value of %s%s can be \"0\"; test with defined()",
3661 ((warnop == OP_READLINE || warnop == OP_GLOB)
3662 ? " construct" : "() operator"));
3663 CopLINE_set(PL_curcop, oldline);
3670 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3671 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3673 NewOp(1101, logop, 1, LOGOP);
3675 logop->op_type = type;
3676 logop->op_ppaddr = PL_ppaddr[type];
3677 logop->op_first = first;
3678 logop->op_flags = flags | OPf_KIDS;
3679 logop->op_other = LINKLIST(other);
3680 logop->op_private = 1 | (flags >> 8);
3682 /* establish postfix order */
3683 logop->op_next = LINKLIST(first);
3684 first->op_next = (OP*)logop;
3685 first->op_sibling = other;
3687 o = newUNOP(OP_NULL, 0, (OP*)logop);
3694 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3702 return newLOGOP(OP_AND, 0, first, trueop);
3704 return newLOGOP(OP_OR, 0, first, falseop);
3706 scalarboolean(first);
3707 if (first->op_type == OP_CONST) {
3708 if (SvTRUE(((SVOP*)first)->op_sv)) {
3719 else if (first->op_type == OP_WANTARRAY) {
3723 NewOp(1101, logop, 1, LOGOP);
3724 logop->op_type = OP_COND_EXPR;
3725 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3726 logop->op_first = first;
3727 logop->op_flags = flags | OPf_KIDS;
3728 logop->op_private = 1 | (flags >> 8);
3729 logop->op_other = LINKLIST(trueop);
3730 logop->op_next = LINKLIST(falseop);
3733 /* establish postfix order */
3734 start = LINKLIST(first);
3735 first->op_next = (OP*)logop;
3737 first->op_sibling = trueop;
3738 trueop->op_sibling = falseop;
3739 o = newUNOP(OP_NULL, 0, (OP*)logop);
3741 trueop->op_next = falseop->op_next = o;
3748 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3757 NewOp(1101, range, 1, LOGOP);
3759 range->op_type = OP_RANGE;
3760 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3761 range->op_first = left;
3762 range->op_flags = OPf_KIDS;
3763 leftstart = LINKLIST(left);
3764 range->op_other = LINKLIST(right);
3765 range->op_private = 1 | (flags >> 8);
3767 left->op_sibling = right;
3769 range->op_next = (OP*)range;
3770 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3771 flop = newUNOP(OP_FLOP, 0, flip);
3772 o = newUNOP(OP_NULL, 0, flop);
3774 range->op_next = leftstart;
3776 left->op_next = flip;
3777 right->op_next = flop;
3779 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3780 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3781 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3782 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3784 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3785 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3788 if (!flip->op_private || !flop->op_private)
3789 linklist(o); /* blow off optimizer unless constant */
3795 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3800 int once = block && block->op_flags & OPf_SPECIAL &&
3801 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3804 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3805 return block; /* do {} while 0 does once */
3806 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3807 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3808 expr = newUNOP(OP_DEFINED, 0,
3809 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3810 } else if (expr->op_flags & OPf_KIDS) {
3811 OP *k1 = ((UNOP*)expr)->op_first;
3812 OP *k2 = (k1) ? k1->op_sibling : NULL;
3813 switch (expr->op_type) {
3815 if (k2 && k2->op_type == OP_READLINE
3816 && (k2->op_flags & OPf_STACKED)
3817 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3818 expr = newUNOP(OP_DEFINED, 0, expr);
3822 if (k1->op_type == OP_READDIR
3823 || k1->op_type == OP_GLOB
3824 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3825 || k1->op_type == OP_EACH)
3826 expr = newUNOP(OP_DEFINED, 0, expr);
3832 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3833 o = new_logop(OP_AND, 0, &expr, &listop);
3836 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3838 if (once && o != listop)
3839 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3842 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3844 o->op_flags |= flags;
3846 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3851 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3861 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3862 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3863 expr = newUNOP(OP_DEFINED, 0,
3864 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3865 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3866 OP *k1 = ((UNOP*)expr)->op_first;
3867 OP *k2 = (k1) ? k1->op_sibling : NULL;
3868 switch (expr->op_type) {
3870 if (k2 && k2->op_type == OP_READLINE
3871 && (k2->op_flags & OPf_STACKED)
3872 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3873 expr = newUNOP(OP_DEFINED, 0, expr);
3877 if (k1->op_type == OP_READDIR
3878 || k1->op_type == OP_GLOB
3879 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3880 || k1->op_type == OP_EACH)
3881 expr = newUNOP(OP_DEFINED, 0, expr);
3887 block = newOP(OP_NULL, 0);
3889 block = scope(block);
3893 next = LINKLIST(cont);
3894 loopflags |= OPpLOOP_CONTINUE;
3897 OP *unstack = newOP(OP_UNSTACK, 0);
3900 cont = append_elem(OP_LINESEQ, cont, unstack);
3901 if ((line_t)whileline != NOLINE) {
3902 PL_copline = whileline;
3903 cont = append_elem(OP_LINESEQ, cont,
3904 newSTATEOP(0, Nullch, Nullop));
3908 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3909 redo = LINKLIST(listop);
3912 PL_copline = whileline;
3914 o = new_logop(OP_AND, 0, &expr, &listop);
3915 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3916 op_free(expr); /* oops, it's a while (0) */
3918 return Nullop; /* listop already freed by new_logop */
3921 ((LISTOP*)listop)->op_last->op_next = condop =
3922 (o == listop ? redo : LINKLIST(o));
3928 NewOp(1101,loop,1,LOOP);
3929 loop->op_type = OP_ENTERLOOP;
3930 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3931 loop->op_private = 0;
3932 loop->op_next = (OP*)loop;
3935 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3937 loop->op_redoop = redo;
3938 loop->op_lastop = o;
3939 o->op_private |= loopflags;
3942 loop->op_nextop = next;
3944 loop->op_nextop = o;
3946 o->op_flags |= flags;
3947 o->op_private |= (flags >> 8);
3952 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3960 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3961 sv->op_type = OP_RV2GV;
3962 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3964 else if (sv->op_type == OP_PADSV) { /* private variable */
3965 padoff = sv->op_targ;
3970 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3971 padoff = sv->op_targ;
3973 iterflags |= OPf_SPECIAL;
3978 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3982 padoff = find_threadsv("_");
3983 iterflags |= OPf_SPECIAL;
3985 sv = newGVOP(OP_GV, 0, PL_defgv);
3988 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3989 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3990 iterflags |= OPf_STACKED;
3992 else if (expr->op_type == OP_NULL &&
3993 (expr->op_flags & OPf_KIDS) &&
3994 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3996 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3997 * set the STACKED flag to indicate that these values are to be
3998 * treated as min/max values by 'pp_iterinit'.
4000 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
4001 LOGOP* range = (LOGOP*) flip->op_first;
4002 OP* left = range->op_first;
4003 OP* right = left->op_sibling;
4006 range->op_flags &= ~OPf_KIDS;
4007 range->op_first = Nullop;
4009 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
4010 listop->op_first->op_next = range->op_next;
4011 left->op_next = range->op_other;
4012 right->op_next = (OP*)listop;
4013 listop->op_next = listop->op_first;
4016 expr = (OP*)(listop);
4018 iterflags |= OPf_STACKED;
4021 expr = mod(force_list(expr), OP_GREPSTART);
4025 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
4026 append_elem(OP_LIST, expr, scalar(sv))));
4027 assert(!loop->op_next);
4028 #ifdef PL_OP_SLAB_ALLOC
4031 NewOp(1234,tmp,1,LOOP);
4032 Copy(loop,tmp,1,LOOP);
4036 Renew(loop, 1, LOOP);
4038 loop->op_targ = padoff;
4039 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
4040 PL_copline = forline;
4041 return newSTATEOP(0, label, wop);
4045 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4051 if (type != OP_GOTO || label->op_type == OP_CONST) {
4052 /* "last()" means "last" */
4053 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4054 o = newOP(type, OPf_SPECIAL);
4056 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
4057 ? SvPVx(((SVOP*)label)->op_sv, n_a)
4063 if (label->op_type == OP_ENTERSUB)
4064 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4065 o = newUNOP(type, OPf_STACKED, label);
4067 PL_hints |= HINT_BLOCK_SCOPE;
4072 Perl_cv_undef(pTHX_ CV *cv)
4077 MUTEX_DESTROY(CvMUTEXP(cv));
4078 Safefree(CvMUTEXP(cv));
4081 #endif /* USE_THREADS */
4083 if (!CvXSUB(cv) && CvROOT(cv)) {
4085 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4086 Perl_croak(aTHX_ "Can't undef active subroutine");
4089 Perl_croak(aTHX_ "Can't undef active subroutine");
4090 #endif /* USE_THREADS */
4093 SAVEVPTR(PL_curpad);
4097 op_free(CvROOT(cv));
4098 CvROOT(cv) = Nullop;
4101 SvPOK_off((SV*)cv); /* forget prototype */
4103 SvREFCNT_dec(CvGV(cv));
4105 SvREFCNT_dec(CvOUTSIDE(cv));
4106 CvOUTSIDE(cv) = Nullcv;
4107 if (CvPADLIST(cv)) {
4108 /* may be during global destruction */
4109 if (SvREFCNT(CvPADLIST(cv))) {
4110 I32 i = AvFILLp(CvPADLIST(cv));
4112 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4113 SV* sv = svp ? *svp : Nullsv;
4116 if (sv == (SV*)PL_comppad_name)
4117 PL_comppad_name = Nullav;
4118 else if (sv == (SV*)PL_comppad) {
4119 PL_comppad = Nullav;
4120 PL_curpad = Null(SV**);
4124 SvREFCNT_dec((SV*)CvPADLIST(cv));
4126 CvPADLIST(cv) = Nullav;
4131 S_cv_dump(pTHX_ CV *cv)
4134 CV *outside = CvOUTSIDE(cv);
4135 AV* padlist = CvPADLIST(cv);
4142 PerlIO_printf(Perl_debug_log,
4143 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4145 (CvANON(cv) ? "ANON"
4146 : (cv == PL_main_cv) ? "MAIN"
4147 : CvUNIQUE(cv) ? "UNIQUE"
4148 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4151 : CvANON(outside) ? "ANON"
4152 : (outside == PL_main_cv) ? "MAIN"
4153 : CvUNIQUE(outside) ? "UNIQUE"
4154 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4159 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4160 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4161 pname = AvARRAY(pad_name);
4162 ppad = AvARRAY(pad);
4164 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4165 if (SvPOK(pname[ix]))
4166 PerlIO_printf(Perl_debug_log,
4167 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4168 (int)ix, PTR2UV(ppad[ix]),
4169 SvFAKE(pname[ix]) ? "FAKE " : "",
4171 (IV)I_32(SvNVX(pname[ix])),
4174 #endif /* DEBUGGING */
4178 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4183 AV* protopadlist = CvPADLIST(proto);
4184 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4185 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4186 SV** pname = AvARRAY(protopad_name);
4187 SV** ppad = AvARRAY(protopad);
4188 I32 fname = AvFILLp(protopad_name);
4189 I32 fpad = AvFILLp(protopad);
4193 assert(!CvUNIQUE(proto));
4197 SAVESPTR(PL_comppad_name);
4198 SAVESPTR(PL_compcv);
4200 cv = PL_compcv = (CV*)NEWSV(1104,0);
4201 sv_upgrade((SV *)cv, SvTYPE(proto));
4202 CvFLAGS(cv) = CvFLAGS(proto) & ~CVf_CLONE;
4206 New(666, CvMUTEXP(cv), 1, perl_mutex);
4207 MUTEX_INIT(CvMUTEXP(cv));
4209 #endif /* USE_THREADS */
4210 CvFILE(cv) = CvFILE(proto);
4211 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4212 CvSTASH(cv) = CvSTASH(proto);
4213 CvROOT(cv) = CvROOT(proto);
4214 CvSTART(cv) = CvSTART(proto);
4216 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4219 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4221 PL_comppad_name = newAV();
4222 for (ix = fname; ix >= 0; ix--)
4223 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4225 PL_comppad = newAV();
4227 comppadlist = newAV();
4228 AvREAL_off(comppadlist);
4229 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4230 av_store(comppadlist, 1, (SV*)PL_comppad);
4231 CvPADLIST(cv) = comppadlist;
4232 av_fill(PL_comppad, AvFILLp(protopad));
4233 PL_curpad = AvARRAY(PL_comppad);
4235 av = newAV(); /* will be @_ */
4237 av_store(PL_comppad, 0, (SV*)av);
4238 AvFLAGS(av) = AVf_REIFY;
4240 for (ix = fpad; ix > 0; ix--) {
4241 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4242 if (namesv && namesv != &PL_sv_undef) {
4243 char *name = SvPVX(namesv); /* XXX */
4244 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4245 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4246 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4248 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4250 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4252 else { /* our own lexical */
4255 /* anon code -- we'll come back for it */
4256 sv = SvREFCNT_inc(ppad[ix]);
4258 else if (*name == '@')
4260 else if (*name == '%')
4269 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4270 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4273 SV* sv = NEWSV(0,0);
4279 /* Now that vars are all in place, clone nested closures. */
4281 for (ix = fpad; ix > 0; ix--) {
4282 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4284 && namesv != &PL_sv_undef
4285 && !(SvFLAGS(namesv) & SVf_FAKE)
4286 && *SvPVX(namesv) == '&'
4287 && CvCLONE(ppad[ix]))
4289 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4290 SvREFCNT_dec(ppad[ix]);
4293 PL_curpad[ix] = (SV*)kid;
4297 #ifdef DEBUG_CLOSURES
4298 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4300 PerlIO_printf(Perl_debug_log, " from:\n");
4302 PerlIO_printf(Perl_debug_log, " to:\n");
4311 Perl_cv_clone(pTHX_ CV *proto)
4314 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4315 cv = cv_clone2(proto, CvOUTSIDE(proto));
4316 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4321 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4325 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4326 SV* msg = sv_newmortal();
4330 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4331 sv_setpv(msg, "Prototype mismatch:");
4333 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4335 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4336 sv_catpv(msg, " vs ");
4338 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4340 sv_catpv(msg, "none");
4341 Perl_warner(aTHX_ WARN_PROTOTYPE, "%"SVf, msg);
4346 Perl_cv_const_sv(pTHX_ CV *cv)
4348 if (!cv || !SvPOK(cv) || SvCUR(cv))
4350 return op_const_sv(CvSTART(cv), cv);
4354 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4361 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4362 o = cLISTOPo->op_first->op_sibling;
4364 for (; o; o = o->op_next) {
4365 OPCODE type = o->op_type;
4367 if (sv && o->op_next == o)
4369 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4371 if (type == OP_LEAVESUB || type == OP_RETURN)
4375 if (type == OP_CONST && cSVOPo->op_sv)
4377 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4378 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4379 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4380 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4392 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4402 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4406 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4408 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4412 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4419 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4423 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4424 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4425 SV *sv = sv_newmortal();
4426 Perl_sv_setpvf(aTHX_ sv, "__ANON__[%s:%"IVdf"]",
4427 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4432 gv = gv_fetchpv(name ? name : (aname ? aname : "__ANON__"),
4433 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4443 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4444 maximum a prototype before. */
4445 if (SvTYPE(gv) > SVt_NULL) {
4446 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4447 && ckWARN_d(WARN_PROTOTYPE))
4449 Perl_warner(aTHX_ WARN_PROTOTYPE, "Runaway prototype");
4451 cv_ckproto((CV*)gv, NULL, ps);
4454 sv_setpv((SV*)gv, ps);
4456 sv_setiv((SV*)gv, -1);
4457 SvREFCNT_dec(PL_compcv);
4458 cv = PL_compcv = NULL;
4459 PL_sub_generation++;
4463 if (!name || GvCVGEN(gv))
4465 else if ((cv = GvCV(gv))) {
4466 bool exists = CvROOT(cv) || CvXSUB(cv);
4467 /* if the subroutine doesn't exist and wasn't pre-declared
4468 * with a prototype, assume it will be AUTOLOADed,
4469 * skipping the prototype check
4471 if (exists || SvPOK(cv))
4472 cv_ckproto(cv, gv, ps);
4473 /* already defined (or promised)? */
4474 if (exists || GvASSUMECV(gv)) {
4476 bool const_changed = TRUE;
4477 if (!block && !attrs) {
4478 /* just a "sub foo;" when &foo is already defined */
4479 SAVEFREESV(PL_compcv);
4482 /* ahem, death to those who redefine active sort subs */
4483 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4484 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4487 if ((const_sv = cv_const_sv(cv)))
4488 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4489 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE))
4491 line_t oldline = CopLINE(PL_curcop);
4492 CopLINE_set(PL_curcop, PL_copline);
4493 Perl_warner(aTHX_ WARN_REDEFINE,
4494 const_sv ? "Constant subroutine %s redefined"
4495 : "Subroutine %s redefined", name);
4496 CopLINE_set(PL_curcop, oldline);
4507 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4508 * before we clobber PL_compcv.
4512 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4513 stash = GvSTASH(CvGV(cv));
4514 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4515 stash = CvSTASH(cv);
4517 stash = PL_curstash;
4520 /* possibly about to re-define existing subr -- ignore old cv */
4521 rcv = (SV*)PL_compcv;
4522 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4523 stash = GvSTASH(gv);
4525 stash = PL_curstash;
4527 apply_attrs(stash, rcv, attrs);
4529 if (cv) { /* must reuse cv if autoloaded */
4531 /* got here with just attrs -- work done, so bug out */
4532 SAVEFREESV(PL_compcv);
4536 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4537 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4538 CvOUTSIDE(PL_compcv) = 0;
4539 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4540 CvPADLIST(PL_compcv) = 0;
4541 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4542 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4543 SvREFCNT_dec(PL_compcv);
4550 PL_sub_generation++;
4553 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4554 CvFILE(cv) = CopFILE(PL_curcop);
4555 CvSTASH(cv) = PL_curstash;
4558 if (!CvMUTEXP(cv)) {
4559 New(666, CvMUTEXP(cv), 1, perl_mutex);
4560 MUTEX_INIT(CvMUTEXP(cv));
4562 #endif /* USE_THREADS */
4565 sv_setpv((SV*)cv, ps);
4567 if (PL_error_count) {
4571 char *s = strrchr(name, ':');
4573 if (strEQ(s, "BEGIN")) {
4575 "BEGIN not safe after errors--compilation aborted";
4576 if (PL_in_eval & EVAL_KEEPERR)
4577 Perl_croak(aTHX_ not_safe);
4579 /* force display of errors found but not reported */
4580 sv_catpv(ERRSV, not_safe);
4581 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4588 PL_copline = NOLINE;
4593 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4594 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4597 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4600 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4602 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4603 OpREFCNT_set(CvROOT(cv), 1);
4604 CvSTART(cv) = LINKLIST(CvROOT(cv));
4605 CvROOT(cv)->op_next = 0;
4608 /* now that optimizer has done its work, adjust pad values */
4610 SV **namep = AvARRAY(PL_comppad_name);
4611 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4614 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4617 * The only things that a clonable function needs in its
4618 * pad are references to outer lexicals and anonymous subs.
4619 * The rest are created anew during cloning.
4621 if (!((namesv = namep[ix]) != Nullsv &&
4622 namesv != &PL_sv_undef &&
4624 *SvPVX(namesv) == '&')))
4626 SvREFCNT_dec(PL_curpad[ix]);
4627 PL_curpad[ix] = Nullsv;
4632 AV *av = newAV(); /* Will be @_ */
4634 av_store(PL_comppad, 0, (SV*)av);
4635 AvFLAGS(av) = AVf_REIFY;
4637 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4638 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4640 if (!SvPADMY(PL_curpad[ix]))
4641 SvPADTMP_on(PL_curpad[ix]);
4645 if (name || aname) {
4647 char *tname = (name ? name : aname);
4649 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4650 SV *sv = NEWSV(0,0);
4651 SV *tmpstr = sv_newmortal();
4652 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4656 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4658 (long)PL_subline, (long)CopLINE(PL_curcop));
4659 gv_efullname3(tmpstr, gv, Nullch);
4660 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4661 hv = GvHVn(db_postponed);
4662 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4663 && (pcv = GvCV(db_postponed)))
4669 call_sv((SV*)pcv, G_DISCARD);
4673 if ((s = strrchr(tname,':')))
4678 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4681 if (strEQ(s, "BEGIN")) {
4682 I32 oldscope = PL_scopestack_ix;
4684 SAVECOPFILE(&PL_compiling);
4685 SAVECOPLINE(&PL_compiling);
4687 sv_setsv(PL_rs, PL_nrs);
4690 PL_beginav = newAV();
4691 DEBUG_x( dump_sub(gv) );
4692 av_push(PL_beginav, (SV*)cv);
4693 GvCV(gv) = 0; /* cv has been hijacked */
4694 call_list(oldscope, PL_beginav);
4696 PL_curcop = &PL_compiling;
4697 PL_compiling.op_private = PL_hints;
4700 else if (strEQ(s, "END") && !PL_error_count) {
4703 DEBUG_x( dump_sub(gv) );
4704 av_unshift(PL_endav, 1);
4705 av_store(PL_endav, 0, (SV*)cv);
4706 GvCV(gv) = 0; /* cv has been hijacked */
4708 else if (strEQ(s, "CHECK") && !PL_error_count) {
4710 PL_checkav = newAV();
4711 DEBUG_x( dump_sub(gv) );
4712 if (PL_main_start && ckWARN(WARN_VOID))
4713 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4714 av_unshift(PL_checkav, 1);
4715 av_store(PL_checkav, 0, (SV*)cv);
4716 GvCV(gv) = 0; /* cv has been hijacked */
4718 else if (strEQ(s, "INIT") && !PL_error_count) {
4720 PL_initav = newAV();
4721 DEBUG_x( dump_sub(gv) );
4722 if (PL_main_start && ckWARN(WARN_VOID))
4723 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4724 av_push(PL_initav, (SV*)cv);
4725 GvCV(gv) = 0; /* cv has been hijacked */
4730 PL_copline = NOLINE;
4735 /* XXX unsafe for threads if eval_owner isn't held */
4737 =for apidoc newCONSTSUB
4739 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4740 eligible for inlining at compile-time.
4746 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4752 SAVECOPLINE(PL_curcop);
4753 CopLINE_set(PL_curcop, PL_copline);
4756 PL_hints &= ~HINT_BLOCK_SCOPE;
4759 SAVESPTR(PL_curstash);
4760 SAVECOPSTASH(PL_curcop);
4761 PL_curstash = stash;
4763 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4765 CopSTASH(PL_curcop) = stash;
4770 start_subparse(FALSE, 0),
4771 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4772 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4774 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4781 =for apidoc U||newXS
4783 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4789 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4792 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4795 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4797 /* just a cached method */
4801 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4802 /* already defined (or promised) */
4803 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4804 && HvNAME(GvSTASH(CvGV(cv)))
4805 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4806 line_t oldline = CopLINE(PL_curcop);
4807 if (PL_copline != NOLINE)
4808 CopLINE_set(PL_curcop, PL_copline);
4809 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4810 CopLINE_set(PL_curcop, oldline);
4817 if (cv) /* must reuse cv if autoloaded */
4820 cv = (CV*)NEWSV(1105,0);
4821 sv_upgrade((SV *)cv, SVt_PVCV);
4825 PL_sub_generation++;
4828 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4830 New(666, CvMUTEXP(cv), 1, perl_mutex);
4831 MUTEX_INIT(CvMUTEXP(cv));
4833 #endif /* USE_THREADS */
4834 (void)gv_fetchfile(filename);
4835 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4836 an external constant string */
4837 CvXSUB(cv) = subaddr;
4840 char *s = strrchr(name,':');
4846 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4849 if (strEQ(s, "BEGIN")) {
4851 PL_beginav = newAV();
4852 av_push(PL_beginav, (SV*)cv);
4853 GvCV(gv) = 0; /* cv has been hijacked */
4855 else if (strEQ(s, "END")) {
4858 av_unshift(PL_endav, 1);
4859 av_store(PL_endav, 0, (SV*)cv);
4860 GvCV(gv) = 0; /* cv has been hijacked */
4862 else if (strEQ(s, "CHECK")) {
4864 PL_checkav = newAV();
4865 if (PL_main_start && ckWARN(WARN_VOID))
4866 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4867 av_unshift(PL_checkav, 1);
4868 av_store(PL_checkav, 0, (SV*)cv);
4869 GvCV(gv) = 0; /* cv has been hijacked */
4871 else if (strEQ(s, "INIT")) {
4873 PL_initav = newAV();
4874 if (PL_main_start && ckWARN(WARN_VOID))
4875 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4876 av_push(PL_initav, (SV*)cv);
4877 GvCV(gv) = 0; /* cv has been hijacked */
4888 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4898 name = SvPVx(cSVOPo->op_sv, n_a);
4901 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4903 if ((cv = GvFORM(gv))) {
4904 if (ckWARN(WARN_REDEFINE)) {
4905 line_t oldline = CopLINE(PL_curcop);
4907 CopLINE_set(PL_curcop, PL_copline);
4908 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4909 CopLINE_set(PL_curcop, oldline);
4915 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4916 CvFILE(cv) = CopFILE(PL_curcop);
4918 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4919 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4920 SvPADTMP_on(PL_curpad[ix]);
4923 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4924 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4925 OpREFCNT_set(CvROOT(cv), 1);
4926 CvSTART(cv) = LINKLIST(CvROOT(cv));
4927 CvROOT(cv)->op_next = 0;
4930 PL_copline = NOLINE;
4935 Perl_newANONLIST(pTHX_ OP *o)
4937 return newUNOP(OP_REFGEN, 0,
4938 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4942 Perl_newANONHASH(pTHX_ OP *o)
4944 return newUNOP(OP_REFGEN, 0,
4945 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4949 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4951 return newANONATTRSUB(floor, proto, Nullop, block);
4955 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4957 return newUNOP(OP_REFGEN, 0,
4958 newSVOP(OP_ANONCODE, 0,
4959 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4963 Perl_oopsAV(pTHX_ OP *o)
4965 switch (o->op_type) {
4967 o->op_type = OP_PADAV;
4968 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4969 return ref(o, OP_RV2AV);
4972 o->op_type = OP_RV2AV;
4973 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4978 if (ckWARN_d(WARN_INTERNAL))
4979 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4986 Perl_oopsHV(pTHX_ OP *o)
4990 switch (o->op_type) {
4993 o->op_type = OP_PADHV;
4994 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4995 return ref(o, OP_RV2HV);
4999 o->op_type = OP_RV2HV;
5000 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
5005 if (ckWARN_d(WARN_INTERNAL))
5006 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
5013 Perl_newAVREF(pTHX_ OP *o)
5015 if (o->op_type == OP_PADANY) {
5016 o->op_type = OP_PADAV;
5017 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5020 return newUNOP(OP_RV2AV, 0, scalar(o));
5024 Perl_newGVREF(pTHX_ I32 type, OP *o)
5026 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
5027 return newUNOP(OP_NULL, 0, o);
5028 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
5032 Perl_newHVREF(pTHX_ OP *o)
5034 if (o->op_type == OP_PADANY) {
5035 o->op_type = OP_PADHV;
5036 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5039 return newUNOP(OP_RV2HV, 0, scalar(o));
5043 Perl_oopsCV(pTHX_ OP *o)
5045 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5051 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5053 return newUNOP(OP_RV2CV, flags, scalar(o));
5057 Perl_newSVREF(pTHX_ OP *o)
5059 if (o->op_type == OP_PADANY) {
5060 o->op_type = OP_PADSV;
5061 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5064 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
5065 o->op_flags |= OPpDONE_SVREF;
5068 return newUNOP(OP_RV2SV, 0, scalar(o));
5071 /* Check routines. */
5074 Perl_ck_anoncode(pTHX_ OP *o)
5079 name = NEWSV(1106,0);
5080 sv_upgrade(name, SVt_PVNV);
5081 sv_setpvn(name, "&", 1);
5084 ix = pad_alloc(o->op_type, SVs_PADMY);
5085 av_store(PL_comppad_name, ix, name);
5086 av_store(PL_comppad, ix, cSVOPo->op_sv);
5087 SvPADMY_on(cSVOPo->op_sv);
5088 cSVOPo->op_sv = Nullsv;
5089 cSVOPo->op_targ = ix;
5094 Perl_ck_bitop(pTHX_ OP *o)
5096 o->op_private = PL_hints;
5101 Perl_ck_concat(pTHX_ OP *o)
5103 if (cUNOPo->op_first->op_type == OP_CONCAT)
5104 o->op_flags |= OPf_STACKED;
5109 Perl_ck_spair(pTHX_ OP *o)
5111 if (o->op_flags & OPf_KIDS) {
5114 OPCODE type = o->op_type;
5115 o = modkids(ck_fun(o), type);
5116 kid = cUNOPo->op_first;
5117 newop = kUNOP->op_first->op_sibling;
5119 (newop->op_sibling ||
5120 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5121 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5122 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5126 op_free(kUNOP->op_first);
5127 kUNOP->op_first = newop;
5129 o->op_ppaddr = PL_ppaddr[++o->op_type];
5134 Perl_ck_delete(pTHX_ OP *o)
5138 if (o->op_flags & OPf_KIDS) {
5139 OP *kid = cUNOPo->op_first;
5140 switch (kid->op_type) {
5142 o->op_flags |= OPf_SPECIAL;
5145 o->op_private |= OPpSLICE;
5148 o->op_flags |= OPf_SPECIAL;
5153 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5154 PL_op_desc[o->op_type]);
5162 Perl_ck_eof(pTHX_ OP *o)
5164 I32 type = o->op_type;
5166 if (o->op_flags & OPf_KIDS) {
5167 if (cLISTOPo->op_first->op_type == OP_STUB) {
5169 o = newUNOP(type, OPf_SPECIAL,
5170 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5178 Perl_ck_eval(pTHX_ OP *o)
5180 PL_hints |= HINT_BLOCK_SCOPE;
5181 if (o->op_flags & OPf_KIDS) {
5182 SVOP *kid = (SVOP*)cUNOPo->op_first;
5185 o->op_flags &= ~OPf_KIDS;
5188 else if (kid->op_type == OP_LINESEQ) {
5191 kid->op_next = o->op_next;
5192 cUNOPo->op_first = 0;
5195 NewOp(1101, enter, 1, LOGOP);
5196 enter->op_type = OP_ENTERTRY;
5197 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5198 enter->op_private = 0;
5200 /* establish postfix order */
5201 enter->op_next = (OP*)enter;
5203 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5204 o->op_type = OP_LEAVETRY;
5205 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5206 enter->op_other = o;
5214 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5216 o->op_targ = (PADOFFSET)PL_hints;
5221 Perl_ck_exit(pTHX_ OP *o)
5224 HV *table = GvHV(PL_hintgv);
5226 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
5227 if (svp && *svp && SvTRUE(*svp))
5228 o->op_private |= OPpEXIT_VMSISH;
5235 Perl_ck_exec(pTHX_ OP *o)
5238 if (o->op_flags & OPf_STACKED) {
5240 kid = cUNOPo->op_first->op_sibling;
5241 if (kid->op_type == OP_RV2GV)
5250 Perl_ck_exists(pTHX_ OP *o)
5253 if (o->op_flags & OPf_KIDS) {
5254 OP *kid = cUNOPo->op_first;
5255 if (kid->op_type == OP_ENTERSUB) {
5256 (void) ref(kid, o->op_type);
5257 if (kid->op_type != OP_RV2CV && !PL_error_count)
5258 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5259 PL_op_desc[o->op_type]);
5260 o->op_private |= OPpEXISTS_SUB;
5262 else if (kid->op_type == OP_AELEM)
5263 o->op_flags |= OPf_SPECIAL;
5264 else if (kid->op_type != OP_HELEM)
5265 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5266 PL_op_desc[o->op_type]);
5274 Perl_ck_gvconst(pTHX_ register OP *o)
5276 o = fold_constants(o);
5277 if (o->op_type == OP_CONST)
5284 Perl_ck_rvconst(pTHX_ register OP *o)
5287 SVOP *kid = (SVOP*)cUNOPo->op_first;
5289 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5290 if (kid->op_type == OP_CONST) {
5294 SV *kidsv = kid->op_sv;
5297 /* Is it a constant from cv_const_sv()? */
5298 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5299 SV *rsv = SvRV(kidsv);
5300 int svtype = SvTYPE(rsv);
5301 char *badtype = Nullch;
5303 switch (o->op_type) {
5305 if (svtype > SVt_PVMG)
5306 badtype = "a SCALAR";
5309 if (svtype != SVt_PVAV)
5310 badtype = "an ARRAY";
5313 if (svtype != SVt_PVHV) {
5314 if (svtype == SVt_PVAV) { /* pseudohash? */
5315 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5316 if (ksv && SvROK(*ksv)
5317 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5326 if (svtype != SVt_PVCV)
5331 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5334 name = SvPV(kidsv, n_a);
5335 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5336 char *badthing = Nullch;
5337 switch (o->op_type) {
5339 badthing = "a SCALAR";
5342 badthing = "an ARRAY";
5345 badthing = "a HASH";
5350 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5354 * This is a little tricky. We only want to add the symbol if we
5355 * didn't add it in the lexer. Otherwise we get duplicate strict
5356 * warnings. But if we didn't add it in the lexer, we must at
5357 * least pretend like we wanted to add it even if it existed before,
5358 * or we get possible typo warnings. OPpCONST_ENTERED says
5359 * whether the lexer already added THIS instance of this symbol.
5361 iscv = (o->op_type == OP_RV2CV) * 2;
5363 gv = gv_fetchpv(name,
5364 iscv | !(kid->op_private & OPpCONST_ENTERED),
5367 : o->op_type == OP_RV2SV
5369 : o->op_type == OP_RV2AV
5371 : o->op_type == OP_RV2HV
5374 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5376 kid->op_type = OP_GV;
5377 SvREFCNT_dec(kid->op_sv);
5379 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5380 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5381 SvREFCNT_dec(PL_curpad[kPADOP->op_padix]);
5383 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5385 kid->op_sv = SvREFCNT_inc(gv);
5387 kid->op_ppaddr = PL_ppaddr[OP_GV];
5394 Perl_ck_ftst(pTHX_ OP *o)
5397 I32 type = o->op_type;
5399 if (o->op_flags & OPf_REF) {
5402 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5403 SVOP *kid = (SVOP*)cUNOPo->op_first;
5405 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5407 OP *newop = newGVOP(type, OPf_REF,
5408 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5415 if (type == OP_FTTTY)
5416 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5419 o = newUNOP(type, 0, newDEFSVOP());
5422 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5424 if (PL_hints & HINT_LOCALE)
5425 o->op_private |= OPpLOCALE;
5432 Perl_ck_fun(pTHX_ OP *o)
5439 int type = o->op_type;
5440 register I32 oa = PL_opargs[type] >> OASHIFT;
5442 if (o->op_flags & OPf_STACKED) {
5443 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5446 return no_fh_allowed(o);
5449 if (o->op_flags & OPf_KIDS) {
5451 tokid = &cLISTOPo->op_first;
5452 kid = cLISTOPo->op_first;
5453 if (kid->op_type == OP_PUSHMARK ||
5454 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5456 tokid = &kid->op_sibling;
5457 kid = kid->op_sibling;
5459 if (!kid && PL_opargs[type] & OA_DEFGV)
5460 *tokid = kid = newDEFSVOP();
5464 sibl = kid->op_sibling;
5467 /* list seen where single (scalar) arg expected? */
5468 if (numargs == 1 && !(oa >> 4)
5469 && kid->op_type == OP_LIST && type != OP_SCALAR)
5471 return too_many_arguments(o,PL_op_desc[type]);
5484 if (kid->op_type == OP_CONST &&
5485 (kid->op_private & OPpCONST_BARE))
5487 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5488 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5489 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5490 if (ckWARN(WARN_DEPRECATED))
5491 Perl_warner(aTHX_ WARN_DEPRECATED,
5492 "Array @%s missing the @ in argument %"IVdf" of %s()",
5493 name, (IV)numargs, PL_op_desc[type]);
5496 kid->op_sibling = sibl;
5499 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5500 bad_type(numargs, "array", PL_op_desc[type], kid);
5504 if (kid->op_type == OP_CONST &&
5505 (kid->op_private & OPpCONST_BARE))
5507 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5508 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5509 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5510 if (ckWARN(WARN_DEPRECATED))
5511 Perl_warner(aTHX_ WARN_DEPRECATED,
5512 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5513 name, (IV)numargs, PL_op_desc[type]);
5516 kid->op_sibling = sibl;
5519 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5520 bad_type(numargs, "hash", PL_op_desc[type], kid);
5525 OP *newop = newUNOP(OP_NULL, 0, kid);
5526 kid->op_sibling = 0;
5528 newop->op_next = newop;
5530 kid->op_sibling = sibl;
5535 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5536 if (kid->op_type == OP_CONST &&
5537 (kid->op_private & OPpCONST_BARE))
5539 OP *newop = newGVOP(OP_GV, 0,
5540 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5545 else if (kid->op_type == OP_READLINE) {
5546 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5547 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5550 I32 flags = OPf_SPECIAL;
5554 /* is this op a FH constructor? */
5555 if (is_handle_constructor(o,numargs)) {
5556 char *name = Nullch;
5560 /* Set a flag to tell rv2gv to vivify
5561 * need to "prove" flag does not mean something
5562 * else already - NI-S 1999/05/07
5565 if (kid->op_type == OP_PADSV) {
5566 SV **namep = av_fetch(PL_comppad_name,
5568 if (namep && *namep)
5569 name = SvPV(*namep, len);
5571 else if (kid->op_type == OP_RV2SV
5572 && kUNOP->op_first->op_type == OP_GV)
5574 GV *gv = cGVOPx_gv(kUNOP->op_first);
5576 len = GvNAMELEN(gv);
5578 else if (kid->op_type == OP_AELEM
5579 || kid->op_type == OP_HELEM)
5581 name = "__ANONIO__";
5587 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5588 namesv = PL_curpad[targ];
5589 (void)SvUPGRADE(namesv, SVt_PV);
5591 sv_setpvn(namesv, "$", 1);
5592 sv_catpvn(namesv, name, len);
5595 kid->op_sibling = 0;
5596 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5597 kid->op_targ = targ;
5598 kid->op_private |= priv;
5600 kid->op_sibling = sibl;
5606 mod(scalar(kid), type);
5610 tokid = &kid->op_sibling;
5611 kid = kid->op_sibling;
5613 o->op_private |= numargs;
5615 return too_many_arguments(o,PL_op_desc[o->op_type]);
5618 else if (PL_opargs[type] & OA_DEFGV) {
5620 return newUNOP(type, 0, newDEFSVOP());
5624 while (oa & OA_OPTIONAL)
5626 if (oa && oa != OA_LIST)
5627 return too_few_arguments(o,PL_op_desc[o->op_type]);
5633 Perl_ck_glob(pTHX_ OP *o)
5638 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5639 append_elem(OP_GLOB, o, newDEFSVOP());
5641 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5642 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5644 #if !defined(PERL_EXTERNAL_GLOB)
5645 /* XXX this can be tightened up and made more failsafe. */
5648 Perl_load_module(aTHX_ 0, newSVpvn("File::Glob", 10), Nullsv,
5649 /* null-terminated import list */
5650 newSVpvn(":globally", 9), Nullsv);
5651 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5654 #endif /* PERL_EXTERNAL_GLOB */
5656 if (gv && GvIMPORTED_CV(gv)) {
5657 append_elem(OP_GLOB, o,
5658 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5659 o->op_type = OP_LIST;
5660 o->op_ppaddr = PL_ppaddr[OP_LIST];
5661 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5662 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5663 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5664 append_elem(OP_LIST, o,
5665 scalar(newUNOP(OP_RV2CV, 0,
5666 newGVOP(OP_GV, 0, gv)))));
5667 o = newUNOP(OP_NULL, 0, ck_subr(o));
5668 o->op_targ = OP_GLOB; /* hint at what it used to be */
5671 gv = newGVgen("main");
5673 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5679 Perl_ck_grep(pTHX_ OP *o)
5683 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5685 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5686 NewOp(1101, gwop, 1, LOGOP);
5688 if (o->op_flags & OPf_STACKED) {
5691 kid = cLISTOPo->op_first->op_sibling;
5692 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5695 kid->op_next = (OP*)gwop;
5696 o->op_flags &= ~OPf_STACKED;
5698 kid = cLISTOPo->op_first->op_sibling;
5699 if (type == OP_MAPWHILE)
5706 kid = cLISTOPo->op_first->op_sibling;
5707 if (kid->op_type != OP_NULL)
5708 Perl_croak(aTHX_ "panic: ck_grep");
5709 kid = kUNOP->op_first;
5711 gwop->op_type = type;
5712 gwop->op_ppaddr = PL_ppaddr[type];
5713 gwop->op_first = listkids(o);
5714 gwop->op_flags |= OPf_KIDS;
5715 gwop->op_private = 1;
5716 gwop->op_other = LINKLIST(kid);
5717 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5718 kid->op_next = (OP*)gwop;
5720 kid = cLISTOPo->op_first->op_sibling;
5721 if (!kid || !kid->op_sibling)
5722 return too_few_arguments(o,PL_op_desc[o->op_type]);
5723 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5724 mod(kid, OP_GREPSTART);
5730 Perl_ck_index(pTHX_ OP *o)
5732 if (o->op_flags & OPf_KIDS) {
5733 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5735 kid = kid->op_sibling; /* get past "big" */
5736 if (kid && kid->op_type == OP_CONST)
5737 fbm_compile(((SVOP*)kid)->op_sv, 0);
5743 Perl_ck_lengthconst(pTHX_ OP *o)
5745 /* XXX length optimization goes here */
5750 Perl_ck_lfun(pTHX_ OP *o)
5752 OPCODE type = o->op_type;
5753 return modkids(ck_fun(o), type);
5757 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5760 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5761 switch (cUNOPo->op_first->op_type) {
5763 break; /* Globals via GV can be undef */
5765 case OP_AASSIGN: /* Is this a good idea? */
5766 Perl_warner(aTHX_ WARN_DEPRECATED,
5767 "defined(@array) is deprecated");
5768 Perl_warner(aTHX_ WARN_DEPRECATED,
5769 "\t(Maybe you should just omit the defined()?)\n");
5772 break; /* Globals via GV can be undef */
5774 Perl_warner(aTHX_ WARN_DEPRECATED,
5775 "defined(%%hash) is deprecated");
5776 Perl_warner(aTHX_ WARN_DEPRECATED,
5777 "\t(Maybe you should just omit the defined()?)\n");
5788 Perl_ck_rfun(pTHX_ OP *o)
5790 OPCODE type = o->op_type;
5791 return refkids(ck_fun(o), type);
5795 Perl_ck_listiob(pTHX_ OP *o)
5799 kid = cLISTOPo->op_first;
5802 kid = cLISTOPo->op_first;
5804 if (kid->op_type == OP_PUSHMARK)
5805 kid = kid->op_sibling;
5806 if (kid && o->op_flags & OPf_STACKED)
5807 kid = kid->op_sibling;
5808 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5809 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5810 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5811 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5812 cLISTOPo->op_first->op_sibling = kid;
5813 cLISTOPo->op_last = kid;
5814 kid = kid->op_sibling;
5819 append_elem(o->op_type, o, newDEFSVOP());
5825 if (PL_hints & HINT_LOCALE)
5826 o->op_private |= OPpLOCALE;
5833 Perl_ck_fun_locale(pTHX_ OP *o)
5839 if (PL_hints & HINT_LOCALE)
5840 o->op_private |= OPpLOCALE;
5847 Perl_ck_sassign(pTHX_ OP *o)
5849 OP *kid = cLISTOPo->op_first;
5850 /* has a disposable target? */
5851 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5852 && !(kid->op_flags & OPf_STACKED)
5853 /* Cannot steal the second time! */
5854 && !(kid->op_private & OPpTARGET_MY))
5856 OP *kkid = kid->op_sibling;
5858 /* Can just relocate the target. */
5859 if (kkid && kkid->op_type == OP_PADSV
5860 && !(kkid->op_private & OPpLVAL_INTRO))
5862 kid->op_targ = kkid->op_targ;
5864 /* Now we do not need PADSV and SASSIGN. */
5865 kid->op_sibling = o->op_sibling; /* NULL */
5866 cLISTOPo->op_first = NULL;
5869 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5877 Perl_ck_scmp(pTHX_ OP *o)
5881 if (PL_hints & HINT_LOCALE)
5882 o->op_private |= OPpLOCALE;
5889 Perl_ck_match(pTHX_ OP *o)
5891 o->op_private |= OPpRUNTIME;
5896 Perl_ck_method(pTHX_ OP *o)
5898 OP *kid = cUNOPo->op_first;
5899 if (kid->op_type == OP_CONST) {
5900 SV* sv = kSVOP->op_sv;
5901 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5903 (void)SvUPGRADE(sv, SVt_PVIV);
5905 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5906 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5907 kSVOP->op_sv = Nullsv;
5916 Perl_ck_null(pTHX_ OP *o)
5922 Perl_ck_open(pTHX_ OP *o)
5924 HV *table = GvHV(PL_hintgv);
5928 svp = hv_fetch(table, "open_IN", 7, FALSE);
5930 mode = mode_from_discipline(*svp);
5931 if (mode & O_BINARY)
5932 o->op_private |= OPpOPEN_IN_RAW;
5933 else if (mode & O_TEXT)
5934 o->op_private |= OPpOPEN_IN_CRLF;
5937 svp = hv_fetch(table, "open_OUT", 8, FALSE);
5939 mode = mode_from_discipline(*svp);
5940 if (mode & O_BINARY)
5941 o->op_private |= OPpOPEN_OUT_RAW;
5942 else if (mode & O_TEXT)
5943 o->op_private |= OPpOPEN_OUT_CRLF;
5946 if (o->op_type == OP_BACKTICK)
5952 Perl_ck_repeat(pTHX_ OP *o)
5954 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5955 o->op_private |= OPpREPEAT_DOLIST;
5956 cBINOPo->op_first = force_list(cBINOPo->op_first);
5964 Perl_ck_require(pTHX_ OP *o)
5966 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5967 SVOP *kid = (SVOP*)cUNOPo->op_first;
5969 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5971 for (s = SvPVX(kid->op_sv); *s; s++) {
5972 if (*s == ':' && s[1] == ':') {
5974 Move(s+2, s+1, strlen(s+2)+1, char);
5975 --SvCUR(kid->op_sv);
5978 if (SvREADONLY(kid->op_sv)) {
5979 SvREADONLY_off(kid->op_sv);
5980 sv_catpvn(kid->op_sv, ".pm", 3);
5981 SvREADONLY_on(kid->op_sv);
5984 sv_catpvn(kid->op_sv, ".pm", 3);
5992 Perl_ck_retarget(pTHX_ OP *o)
5994 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
6001 Perl_ck_select(pTHX_ OP *o)
6004 if (o->op_flags & OPf_KIDS) {
6005 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6006 if (kid && kid->op_sibling) {
6007 o->op_type = OP_SSELECT;
6008 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
6010 return fold_constants(o);
6014 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6015 if (kid && kid->op_type == OP_RV2GV)
6016 kid->op_private &= ~HINT_STRICT_REFS;
6021 Perl_ck_shift(pTHX_ OP *o)
6023 I32 type = o->op_type;
6025 if (!(o->op_flags & OPf_KIDS)) {
6030 if (!CvUNIQUE(PL_compcv)) {
6031 argop = newOP(OP_PADAV, OPf_REF);
6032 argop->op_targ = 0; /* PL_curpad[0] is @_ */
6035 argop = newUNOP(OP_RV2AV, 0,
6036 scalar(newGVOP(OP_GV, 0,
6037 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6040 argop = newUNOP(OP_RV2AV, 0,
6041 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
6042 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6043 #endif /* USE_THREADS */
6044 return newUNOP(type, 0, scalar(argop));
6046 return scalar(modkids(ck_fun(o), type));
6050 Perl_ck_sort(pTHX_ OP *o)
6055 if (PL_hints & HINT_LOCALE)
6056 o->op_private |= OPpLOCALE;
6059 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
6061 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6062 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
6064 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
6066 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
6068 if (kid->op_type == OP_SCOPE) {
6072 else if (kid->op_type == OP_LEAVE) {
6073 if (o->op_type == OP_SORT) {
6074 null(kid); /* wipe out leave */
6077 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
6078 if (k->op_next == kid)
6080 /* don't descend into loops */
6081 else if (k->op_type == OP_ENTERLOOP
6082 || k->op_type == OP_ENTERITER)
6084 k = cLOOPx(k)->op_lastop;
6089 kid->op_next = 0; /* just disconnect the leave */
6090 k = kLISTOP->op_first;
6095 if (o->op_type == OP_SORT) {
6096 /* provide scalar context for comparison function/block */
6102 o->op_flags |= OPf_SPECIAL;
6104 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
6107 firstkid = firstkid->op_sibling;
6110 /* provide list context for arguments */
6111 if (o->op_type == OP_SORT)
6118 S_simplify_sort(pTHX_ OP *o)
6121 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6125 if (!(o->op_flags & OPf_STACKED))
6127 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
6128 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
6129 kid = kUNOP->op_first; /* get past null */
6130 if (kid->op_type != OP_SCOPE)
6132 kid = kLISTOP->op_last; /* get past scope */
6133 switch(kid->op_type) {
6141 k = kid; /* remember this node*/
6142 if (kBINOP->op_first->op_type != OP_RV2SV)
6144 kid = kBINOP->op_first; /* get past cmp */
6145 if (kUNOP->op_first->op_type != OP_GV)
6147 kid = kUNOP->op_first; /* get past rv2sv */
6149 if (GvSTASH(gv) != PL_curstash)
6151 if (strEQ(GvNAME(gv), "a"))
6153 else if (strEQ(GvNAME(gv), "b"))
6157 kid = k; /* back to cmp */
6158 if (kBINOP->op_last->op_type != OP_RV2SV)
6160 kid = kBINOP->op_last; /* down to 2nd arg */
6161 if (kUNOP->op_first->op_type != OP_GV)
6163 kid = kUNOP->op_first; /* get past rv2sv */
6165 if (GvSTASH(gv) != PL_curstash
6167 ? strNE(GvNAME(gv), "a")
6168 : strNE(GvNAME(gv), "b")))
6170 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6172 o->op_private |= OPpSORT_REVERSE;
6173 if (k->op_type == OP_NCMP)
6174 o->op_private |= OPpSORT_NUMERIC;
6175 if (k->op_type == OP_I_NCMP)
6176 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6177 kid = cLISTOPo->op_first->op_sibling;
6178 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6179 op_free(kid); /* then delete it */
6180 cLISTOPo->op_children--;
6184 Perl_ck_split(pTHX_ OP *o)
6188 if (o->op_flags & OPf_STACKED)
6189 return no_fh_allowed(o);
6191 kid = cLISTOPo->op_first;
6192 if (kid->op_type != OP_NULL)
6193 Perl_croak(aTHX_ "panic: ck_split");
6194 kid = kid->op_sibling;
6195 op_free(cLISTOPo->op_first);
6196 cLISTOPo->op_first = kid;
6198 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6199 cLISTOPo->op_last = kid; /* There was only one element previously */
6202 if (kid->op_type != OP_MATCH) {
6203 OP *sibl = kid->op_sibling;
6204 kid->op_sibling = 0;
6205 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6206 if (cLISTOPo->op_first == cLISTOPo->op_last)
6207 cLISTOPo->op_last = kid;
6208 cLISTOPo->op_first = kid;
6209 kid->op_sibling = sibl;
6212 kid->op_type = OP_PUSHRE;
6213 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6216 if (!kid->op_sibling)
6217 append_elem(OP_SPLIT, o, newDEFSVOP());
6219 kid = kid->op_sibling;
6222 if (!kid->op_sibling)
6223 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6225 kid = kid->op_sibling;
6228 if (kid->op_sibling)
6229 return too_many_arguments(o,PL_op_desc[o->op_type]);
6235 Perl_ck_join(pTHX_ OP *o)
6237 if (ckWARN(WARN_SYNTAX)) {
6238 OP *kid = cLISTOPo->op_first->op_sibling;
6239 if (kid && kid->op_type == OP_MATCH) {
6240 char *pmstr = "STRING";
6241 if (kPMOP->op_pmregexp)
6242 pmstr = kPMOP->op_pmregexp->precomp;
6243 Perl_warner(aTHX_ WARN_SYNTAX,
6244 "/%s/ should probably be written as \"%s\"",
6252 Perl_ck_subr(pTHX_ OP *o)
6255 OP *prev = ((cUNOPo->op_first->op_sibling)
6256 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6257 OP *o2 = prev->op_sibling;
6266 o->op_private |= OPpENTERSUB_HASTARG;
6267 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6268 if (cvop->op_type == OP_RV2CV) {
6270 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6271 null(cvop); /* disable rv2cv */
6272 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6273 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6274 GV *gv = cGVOPx_gv(tmpop);
6277 tmpop->op_private |= OPpEARLY_CV;
6278 else if (SvPOK(cv)) {
6279 namegv = CvANON(cv) ? gv : CvGV(cv);
6280 proto = SvPV((SV*)cv, n_a);
6284 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6285 if (o2->op_type == OP_CONST)
6286 o2->op_private &= ~OPpCONST_STRICT;
6287 else if (o2->op_type == OP_LIST) {
6288 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6289 if (o && o->op_type == OP_CONST)
6290 o->op_private &= ~OPpCONST_STRICT;
6293 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6294 if (PERLDB_SUB && PL_curstash != PL_debstash)
6295 o->op_private |= OPpENTERSUB_DB;
6296 while (o2 != cvop) {
6300 return too_many_arguments(o, gv_ename(namegv));
6318 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6320 arg == 1 ? "block or sub {}" : "sub {}",
6321 gv_ename(namegv), o2);
6324 /* '*' allows any scalar type, including bareword */
6327 if (o2->op_type == OP_RV2GV)
6328 goto wrapref; /* autoconvert GLOB -> GLOBref */
6329 else if (o2->op_type == OP_CONST)
6330 o2->op_private &= ~OPpCONST_STRICT;
6331 else if (o2->op_type == OP_ENTERSUB) {
6332 /* accidental subroutine, revert to bareword */
6333 OP *gvop = ((UNOP*)o2)->op_first;
6334 if (gvop && gvop->op_type == OP_NULL) {
6335 gvop = ((UNOP*)gvop)->op_first;
6337 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6340 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6341 (gvop = ((UNOP*)gvop)->op_first) &&
6342 gvop->op_type == OP_GV)
6344 GV *gv = cGVOPx_gv(gvop);
6345 OP *sibling = o2->op_sibling;
6346 SV *n = newSVpvn("",0);
6348 gv_fullname3(n, gv, "");
6349 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6350 sv_chop(n, SvPVX(n)+6);
6351 o2 = newSVOP(OP_CONST, 0, n);
6352 prev->op_sibling = o2;
6353 o2->op_sibling = sibling;
6365 if (o2->op_type != OP_RV2GV)
6366 bad_type(arg, "symbol", gv_ename(namegv), o2);
6369 if (o2->op_type != OP_ENTERSUB)
6370 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6373 if (o2->op_type != OP_RV2SV
6374 && o2->op_type != OP_PADSV
6375 && o2->op_type != OP_HELEM
6376 && o2->op_type != OP_AELEM
6377 && o2->op_type != OP_THREADSV)
6379 bad_type(arg, "scalar", gv_ename(namegv), o2);
6383 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6384 bad_type(arg, "array", gv_ename(namegv), o2);
6387 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6388 bad_type(arg, "hash", gv_ename(namegv), o2);
6392 OP* sib = kid->op_sibling;
6393 kid->op_sibling = 0;
6394 o2 = newUNOP(OP_REFGEN, 0, kid);
6395 o2->op_sibling = sib;
6396 prev->op_sibling = o2;
6407 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6408 gv_ename(namegv), SvPV((SV*)cv, n_a));
6413 mod(o2, OP_ENTERSUB);
6415 o2 = o2->op_sibling;
6417 if (proto && !optional &&
6418 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6419 return too_few_arguments(o, gv_ename(namegv));
6424 Perl_ck_svconst(pTHX_ OP *o)
6426 SvREADONLY_on(cSVOPo->op_sv);
6431 Perl_ck_trunc(pTHX_ OP *o)
6433 if (o->op_flags & OPf_KIDS) {
6434 SVOP *kid = (SVOP*)cUNOPo->op_first;
6436 if (kid->op_type == OP_NULL)
6437 kid = (SVOP*)kid->op_sibling;
6438 if (kid && kid->op_type == OP_CONST &&
6439 (kid->op_private & OPpCONST_BARE))
6441 o->op_flags |= OPf_SPECIAL;
6442 kid->op_private &= ~OPpCONST_STRICT;
6448 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6451 Perl_peep(pTHX_ register OP *o)
6454 register OP* oldop = 0;
6456 OP *last_composite = Nullop;
6458 if (!o || o->op_seq)
6462 SAVEVPTR(PL_curcop);
6463 for (; o; o = o->op_next) {
6469 switch (o->op_type) {
6473 PL_curcop = ((COP*)o); /* for warnings */
6474 o->op_seq = PL_op_seqmax++;
6475 last_composite = Nullop;
6479 if (cSVOPo->op_private & OPpCONST_STRICT)
6480 no_bareword_allowed(o);
6482 /* Relocate sv to the pad for thread safety.
6483 * Despite being a "constant", the SV is written to,
6484 * for reference counts, sv_upgrade() etc. */
6486 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6487 if (SvPADTMP(cSVOPo->op_sv)) {
6488 /* If op_sv is already a PADTMP then it is being used by
6489 * another pad, so make a copy. */
6490 sv_setsv(PL_curpad[ix],cSVOPo->op_sv);
6491 SvREADONLY_on(PL_curpad[ix]);
6492 SvREFCNT_dec(cSVOPo->op_sv);
6495 SvREFCNT_dec(PL_curpad[ix]);
6496 SvPADTMP_on(cSVOPo->op_sv);
6497 PL_curpad[ix] = cSVOPo->op_sv;
6499 cSVOPo->op_sv = Nullsv;
6503 o->op_seq = PL_op_seqmax++;
6507 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6508 if (o->op_next->op_private & OPpTARGET_MY) {
6509 if (o->op_flags & OPf_STACKED) /* chained concats */
6510 goto ignore_optimization;
6512 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6513 o->op_targ = o->op_next->op_targ;
6514 o->op_next->op_targ = 0;
6515 o->op_private |= OPpTARGET_MY;
6520 ignore_optimization:
6521 o->op_seq = PL_op_seqmax++;
6524 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6525 o->op_seq = PL_op_seqmax++;
6526 break; /* Scalar stub must produce undef. List stub is noop */
6530 if (o->op_targ == OP_NEXTSTATE
6531 || o->op_targ == OP_DBSTATE
6532 || o->op_targ == OP_SETSTATE)
6534 PL_curcop = ((COP*)o);
6541 if (oldop && o->op_next) {
6542 oldop->op_next = o->op_next;
6545 o->op_seq = PL_op_seqmax++;
6549 if (o->op_next->op_type == OP_RV2SV) {
6550 if (!(o->op_next->op_private & OPpDEREF)) {
6552 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6554 o->op_next = o->op_next->op_next;
6555 o->op_type = OP_GVSV;
6556 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6559 else if (o->op_next->op_type == OP_RV2AV) {
6560 OP* pop = o->op_next->op_next;
6562 if (pop->op_type == OP_CONST &&
6563 (PL_op = pop->op_next) &&
6564 pop->op_next->op_type == OP_AELEM &&
6565 !(pop->op_next->op_private &
6566 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6567 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6575 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6576 o->op_next = pop->op_next->op_next;
6577 o->op_type = OP_AELEMFAST;
6578 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6579 o->op_private = (U8)i;
6584 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6586 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6587 /* XXX could check prototype here instead of just carping */
6588 SV *sv = sv_newmortal();
6589 gv_efullname3(sv, gv, Nullch);
6590 Perl_warner(aTHX_ WARN_PROTOTYPE,
6591 "%s() called too early to check prototype",
6596 o->op_seq = PL_op_seqmax++;
6607 o->op_seq = PL_op_seqmax++;
6608 while (cLOGOP->op_other->op_type == OP_NULL)
6609 cLOGOP->op_other = cLOGOP->op_other->op_next;
6610 peep(cLOGOP->op_other);
6614 o->op_seq = PL_op_seqmax++;
6615 peep(cLOOP->op_redoop);
6616 peep(cLOOP->op_nextop);
6617 peep(cLOOP->op_lastop);
6623 o->op_seq = PL_op_seqmax++;
6624 peep(cPMOP->op_pmreplstart);
6628 o->op_seq = PL_op_seqmax++;
6629 if (ckWARN(WARN_SYNTAX) && o->op_next
6630 && o->op_next->op_type == OP_NEXTSTATE) {
6631 if (o->op_next->op_sibling &&
6632 o->op_next->op_sibling->op_type != OP_EXIT &&
6633 o->op_next->op_sibling->op_type != OP_WARN &&
6634 o->op_next->op_sibling->op_type != OP_DIE) {
6635 line_t oldline = CopLINE(PL_curcop);
6637 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6638 Perl_warner(aTHX_ WARN_EXEC,
6639 "Statement unlikely to be reached");
6640 Perl_warner(aTHX_ WARN_EXEC,
6641 "\t(Maybe you meant system() when you said exec()?)\n");
6642 CopLINE_set(PL_curcop, oldline);
6651 SV **svp, **indsvp, *sv;
6656 o->op_seq = PL_op_seqmax++;
6657 if ((o->op_private & (OPpLVAL_INTRO))
6658 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6660 rop = (UNOP*)((BINOP*)o)->op_first;
6661 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6663 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6664 if (!SvOBJECT(lexname))
6666 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6667 if (!fields || !GvHV(*fields))
6669 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6670 key = SvPV(*svp, keylen);
6671 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6673 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6674 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6676 ind = SvIV(*indsvp);
6678 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6679 rop->op_type = OP_RV2AV;
6680 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6681 o->op_type = OP_AELEM;
6682 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6684 if (SvREADONLY(*svp))
6686 SvFLAGS(sv) |= (SvFLAGS(*svp)
6687 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6697 SV **svp, **indsvp, *sv;
6701 SVOP *first_key_op, *key_op;
6703 o->op_seq = PL_op_seqmax++;
6704 if ((o->op_private & (OPpLVAL_INTRO))
6705 /* I bet there's always a pushmark... */
6706 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
6707 /* hmmm, no optimization if list contains only one key. */
6709 rop = (UNOP*)((LISTOP*)o)->op_last;
6710 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6712 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6713 if (!SvOBJECT(lexname))
6715 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6716 if (!fields || !GvHV(*fields))
6718 /* Again guessing that the pushmark can be jumped over.... */
6719 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
6720 ->op_first->op_sibling;
6721 /* Check that the key list contains only constants. */
6722 for (key_op = first_key_op; key_op;
6723 key_op = (SVOP*)key_op->op_sibling)
6724 if (key_op->op_type != OP_CONST)
6728 rop->op_type = OP_RV2AV;
6729 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6730 o->op_type = OP_ASLICE;
6731 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
6732 for (key_op = first_key_op; key_op;
6733 key_op = (SVOP*)key_op->op_sibling) {
6734 svp = cSVOPx_svp(key_op);
6735 key = SvPV(*svp, keylen);
6736 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6738 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
6739 "in variable %s of type %s",
6740 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6742 ind = SvIV(*indsvp);
6744 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6746 if (SvREADONLY(*svp))
6748 SvFLAGS(sv) |= (SvFLAGS(*svp)
6749 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6758 if (!(o->op_flags & OPf_WANT)
6759 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6763 o->op_seq = PL_op_seqmax++;
6767 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6768 o->op_seq = PL_op_seqmax++;
6774 if (last_composite) {
6775 OP *r = last_composite;
6777 while (r->op_sibling)
6780 || (r->op_next->op_type == OP_LIST
6781 && r->op_next->op_next == o))
6783 if (last_composite->op_type == OP_RV2AV)
6784 yyerror("Lvalue subs returning arrays not implemented yet");
6786 yyerror("Lvalue subs returning hashes not implemented yet");
6793 o->op_seq = PL_op_seqmax++;