3 * Copyright (c) 1991-2001, 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
58 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
61 S_gv_ename(pTHX_ GV *gv)
64 SV* tmpsv = sv_newmortal();
65 gv_efullname3(tmpsv, gv, Nullch);
66 return SvPV(tmpsv,n_a);
70 S_no_fh_allowed(pTHX_ OP *o)
72 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
73 PL_op_desc[o->op_type]));
78 S_too_few_arguments(pTHX_ OP *o, char *name)
80 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
85 S_too_many_arguments(pTHX_ OP *o, char *name)
87 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
92 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
94 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
95 (int)n, name, t, PL_op_desc[kid->op_type]));
99 S_no_bareword_allowed(pTHX_ OP *o)
101 qerror(Perl_mess(aTHX_
102 "Bareword \"%s\" not allowed while \"strict subs\" in use",
103 SvPV_nolen(cSVOPo_sv)));
107 S_trlist_upgrade(pTHX_ U8** sp, U8** ep)
113 Newz(801, d, (e - s) * 2, U8);
117 if (*s < 0x80 || *s == 0xff)
121 *d++ = ((c >> 6) | 0xc0);
122 *d++ = ((c & 0x3f) | 0x80);
130 /* "register" allocation */
133 Perl_pad_allocmy(pTHX_ char *name)
138 if (!(PL_in_my == KEY_our ||
140 (PL_hints & HINT_UTF8 && UTF8_IS_START(name[1])) ||
141 (name[1] == '_' && (int)strlen(name) > 2)))
143 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
144 /* 1999-02-27 mjd@plover.com */
146 p = strchr(name, '\0');
147 /* The next block assumes the buffer is at least 205 chars
148 long. At present, it's always at least 256 chars. */
150 strcpy(name+200, "...");
156 /* Move everything else down one character */
157 for (; p-name > 2; p--)
159 name[2] = toCTRL(name[1]);
162 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
164 if (ckWARN(WARN_MISC) && AvFILLp(PL_comppad_name) >= 0) {
165 SV **svp = AvARRAY(PL_comppad_name);
166 HV *ourstash = (PL_curstash ? PL_curstash : PL_defstash);
167 PADOFFSET top = AvFILLp(PL_comppad_name);
168 for (off = top; off > PL_comppad_name_floor; off--) {
170 && sv != &PL_sv_undef
171 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
172 && (PL_in_my != KEY_our
173 || ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash))
174 && strEQ(name, SvPVX(sv)))
176 Perl_warner(aTHX_ WARN_MISC,
177 "\"%s\" variable %s masks earlier declaration in same %s",
178 (PL_in_my == KEY_our ? "our" : "my"),
180 (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
185 if (PL_in_my == KEY_our) {
188 && sv != &PL_sv_undef
189 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
190 && ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash)
191 && strEQ(name, SvPVX(sv)))
193 Perl_warner(aTHX_ WARN_MISC,
194 "\"our\" variable %s redeclared", name);
195 Perl_warner(aTHX_ WARN_MISC,
196 "\t(Did you mean \"local\" instead of \"our\"?)\n");
199 } while ( off-- > 0 );
202 off = pad_alloc(OP_PADSV, SVs_PADMY);
204 sv_upgrade(sv, SVt_PVNV);
206 if (PL_in_my_stash) {
208 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"%s\"",
209 name, PL_in_my == KEY_our ? "our" : "my"));
211 (void)SvUPGRADE(sv, SVt_PVMG);
212 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
215 if (PL_in_my == KEY_our) {
216 (void)SvUPGRADE(sv, SVt_PVGV);
217 GvSTASH(sv) = (HV*)SvREFCNT_inc(PL_curstash ? (SV*)PL_curstash : (SV*)PL_defstash);
218 SvFLAGS(sv) |= SVpad_OUR;
220 av_store(PL_comppad_name, off, sv);
221 SvNVX(sv) = (NV)PAD_MAX;
222 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
223 if (!PL_min_intro_pending)
224 PL_min_intro_pending = off;
225 PL_max_intro_pending = off;
227 av_store(PL_comppad, off, (SV*)newAV());
228 else if (*name == '%')
229 av_store(PL_comppad, off, (SV*)newHV());
230 SvPADMY_on(PL_curpad[off]);
235 S_pad_addlex(pTHX_ SV *proto_namesv)
237 SV *namesv = NEWSV(1103,0);
238 PADOFFSET newoff = pad_alloc(OP_PADSV, SVs_PADMY);
239 sv_upgrade(namesv, SVt_PVNV);
240 sv_setpv(namesv, SvPVX(proto_namesv));
241 av_store(PL_comppad_name, newoff, namesv);
242 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
243 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
244 SvFAKE_on(namesv); /* A ref, not a real var */
245 if (SvFLAGS(proto_namesv) & SVpad_OUR) { /* An "our" variable */
246 SvFLAGS(namesv) |= SVpad_OUR;
247 (void)SvUPGRADE(namesv, SVt_PVGV);
248 GvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)GvSTASH(proto_namesv));
250 if (SvOBJECT(proto_namesv)) { /* A typed var */
252 (void)SvUPGRADE(namesv, SVt_PVMG);
253 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(proto_namesv));
259 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
262 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
263 I32 cx_ix, I32 saweval, U32 flags)
269 register PERL_CONTEXT *cx;
271 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
272 AV *curlist = CvPADLIST(cv);
273 SV **svp = av_fetch(curlist, 0, FALSE);
276 if (!svp || *svp == &PL_sv_undef)
279 svp = AvARRAY(curname);
280 for (off = AvFILLp(curname); off > 0; off--) {
281 if ((sv = svp[off]) &&
282 sv != &PL_sv_undef &&
284 seq > I_32(SvNVX(sv)) &&
285 strEQ(SvPVX(sv), name))
296 return 0; /* don't clone from inactive stack frame */
300 oldpad = (AV*)AvARRAY(curlist)[depth];
301 oldsv = *av_fetch(oldpad, off, TRUE);
302 if (!newoff) { /* Not a mere clone operation. */
303 newoff = pad_addlex(sv);
304 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
305 /* "It's closures all the way down." */
306 CvCLONE_on(PL_compcv);
308 if (CvANON(PL_compcv))
309 oldsv = Nullsv; /* no need to keep ref */
314 bcv && bcv != cv && !CvCLONE(bcv);
315 bcv = CvOUTSIDE(bcv))
318 /* install the missing pad entry in intervening
319 * nested subs and mark them cloneable.
320 * XXX fix pad_foo() to not use globals */
321 AV *ocomppad_name = PL_comppad_name;
322 AV *ocomppad = PL_comppad;
323 SV **ocurpad = PL_curpad;
324 AV *padlist = CvPADLIST(bcv);
325 PL_comppad_name = (AV*)AvARRAY(padlist)[0];
326 PL_comppad = (AV*)AvARRAY(padlist)[1];
327 PL_curpad = AvARRAY(PL_comppad);
329 PL_comppad_name = ocomppad_name;
330 PL_comppad = ocomppad;
335 if (ckWARN(WARN_CLOSURE)
336 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
338 Perl_warner(aTHX_ WARN_CLOSURE,
339 "Variable \"%s\" may be unavailable",
347 else if (!CvUNIQUE(PL_compcv)) {
348 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv)
349 && !(SvFLAGS(sv) & SVpad_OUR))
351 Perl_warner(aTHX_ WARN_CLOSURE,
352 "Variable \"%s\" will not stay shared", name);
356 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
362 if (flags & FINDLEX_NOSEARCH)
365 /* Nothing in current lexical context--try eval's context, if any.
366 * This is necessary to let the perldb get at lexically scoped variables.
367 * XXX This will also probably interact badly with eval tree caching.
370 for (i = cx_ix; i >= 0; i--) {
372 switch (CxTYPE(cx)) {
374 if (i == 0 && saweval) {
375 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
379 switch (cx->blk_eval.old_op_type) {
381 if (CxREALEVAL(cx)) {
384 seq = cxstack[i].blk_oldcop->cop_seq;
385 startcv = cxstack[i].blk_eval.cv;
386 if (startcv && CvOUTSIDE(startcv)) {
387 off = pad_findlex(name, newoff, seq, CvOUTSIDE(startcv),
389 if (off) /* continue looking if not found here */
396 /* require/do must have their own scope */
405 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
406 saweval = i; /* so we know where we were called from */
407 seq = cxstack[i].blk_oldcop->cop_seq;
410 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
418 Perl_pad_findmy(pTHX_ char *name)
423 SV **svp = AvARRAY(PL_comppad_name);
424 U32 seq = PL_cop_seqmax;
430 * Special case to get lexical (and hence per-thread) @_.
431 * XXX I need to find out how to tell at parse-time whether use
432 * of @_ should refer to a lexical (from a sub) or defgv (global
433 * scope and maybe weird sub-ish things like formats). See
434 * startsub in perly.y. It's possible that @_ could be lexical
435 * (at least from subs) even in non-threaded perl.
437 if (strEQ(name, "@_"))
438 return 0; /* success. (NOT_IN_PAD indicates failure) */
439 #endif /* USE_THREADS */
441 /* The one we're looking for is probably just before comppad_name_fill. */
442 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
443 if ((sv = svp[off]) &&
444 sv != &PL_sv_undef &&
447 seq > I_32(SvNVX(sv)))) &&
448 strEQ(SvPVX(sv), name))
450 if (SvIVX(sv) || SvFLAGS(sv) & SVpad_OUR)
451 return (PADOFFSET)off;
452 pendoff = off; /* this pending def. will override import */
456 outside = CvOUTSIDE(PL_compcv);
458 /* Check if if we're compiling an eval'', and adjust seq to be the
459 * eval's seq number. This depends on eval'' having a non-null
460 * CvOUTSIDE() while it is being compiled. The eval'' itself is
461 * identified by CvEVAL being true and CvGV being null. */
462 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
463 cx = &cxstack[cxstack_ix];
465 seq = cx->blk_oldcop->cop_seq;
468 /* See if it's in a nested scope */
469 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
471 /* If there is a pending local definition, this new alias must die */
473 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
474 return off; /* pad_findlex returns 0 for failure...*/
476 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
480 Perl_pad_leavemy(pTHX_ I32 fill)
483 SV **svp = AvARRAY(PL_comppad_name);
485 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
486 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
487 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
488 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
491 /* "Deintroduce" my variables that are leaving with this scope. */
492 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
493 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
494 SvIVX(sv) = PL_cop_seqmax;
499 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
504 if (AvARRAY(PL_comppad) != PL_curpad)
505 Perl_croak(aTHX_ "panic: pad_alloc");
506 if (PL_pad_reset_pending)
508 if (tmptype & SVs_PADMY) {
510 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
511 } while (SvPADBUSY(sv)); /* need a fresh one */
512 retval = AvFILLp(PL_comppad);
515 SV **names = AvARRAY(PL_comppad_name);
516 SSize_t names_fill = AvFILLp(PL_comppad_name);
519 * "foreach" index vars temporarily become aliases to non-"my"
520 * values. Thus we must skip, not just pad values that are
521 * marked as current pad values, but also those with names.
523 if (++PL_padix <= names_fill &&
524 (sv = names[PL_padix]) && sv != &PL_sv_undef)
526 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
527 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)) && !IS_PADGV(sv))
532 SvFLAGS(sv) |= tmptype;
533 PL_curpad = AvARRAY(PL_comppad);
535 DEBUG_X(PerlIO_printf(Perl_debug_log,
536 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
537 PTR2UV(thr), PTR2UV(PL_curpad),
538 (long) retval, PL_op_name[optype]));
540 DEBUG_X(PerlIO_printf(Perl_debug_log,
541 "Pad 0x%"UVxf" alloc %ld for %s\n",
543 (long) retval, PL_op_name[optype]));
544 #endif /* USE_THREADS */
545 return (PADOFFSET)retval;
549 Perl_pad_sv(pTHX_ PADOFFSET po)
552 DEBUG_X(PerlIO_printf(Perl_debug_log,
553 "0x%"UVxf" Pad 0x%"UVxf" sv %"IVdf"\n",
554 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
557 Perl_croak(aTHX_ "panic: pad_sv po");
558 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %"IVdf"\n",
559 PTR2UV(PL_curpad), (IV)po));
560 #endif /* USE_THREADS */
561 return PL_curpad[po]; /* eventually we'll turn this into a macro */
565 Perl_pad_free(pTHX_ PADOFFSET po)
569 if (AvARRAY(PL_comppad) != PL_curpad)
570 Perl_croak(aTHX_ "panic: pad_free curpad");
572 Perl_croak(aTHX_ "panic: pad_free po");
574 DEBUG_X(PerlIO_printf(Perl_debug_log,
575 "0x%"UVxf" Pad 0x%"UVxf" free %"IVdf"\n",
576 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
578 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %"IVdf"\n",
579 PTR2UV(PL_curpad), (IV)po));
580 #endif /* USE_THREADS */
581 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
582 SvPADTMP_off(PL_curpad[po]);
584 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
587 if ((I32)po < PL_padix)
592 Perl_pad_swipe(pTHX_ PADOFFSET po)
594 if (AvARRAY(PL_comppad) != PL_curpad)
595 Perl_croak(aTHX_ "panic: pad_swipe curpad");
597 Perl_croak(aTHX_ "panic: pad_swipe po");
599 DEBUG_X(PerlIO_printf(Perl_debug_log,
600 "0x%"UVxf" Pad 0x%"UVxf" swipe %"IVdf"\n",
601 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
603 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %"IVdf"\n",
604 PTR2UV(PL_curpad), (IV)po));
605 #endif /* USE_THREADS */
606 SvPADTMP_off(PL_curpad[po]);
607 PL_curpad[po] = NEWSV(1107,0);
608 SvPADTMP_on(PL_curpad[po]);
609 if ((I32)po < PL_padix)
613 /* XXX pad_reset() is currently disabled because it results in serious bugs.
614 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
615 * on the stack by OPs that use them, there are several ways to get an alias
616 * to a shared TARG. Such an alias will change randomly and unpredictably.
617 * We avoid doing this until we can think of a Better Way.
622 #ifdef USE_BROKEN_PAD_RESET
625 if (AvARRAY(PL_comppad) != PL_curpad)
626 Perl_croak(aTHX_ "panic: pad_reset curpad");
628 DEBUG_X(PerlIO_printf(Perl_debug_log,
629 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
630 PTR2UV(thr), PTR2UV(PL_curpad)));
632 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
634 #endif /* USE_THREADS */
635 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
636 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
637 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
638 SvPADTMP_off(PL_curpad[po]);
640 PL_padix = PL_padix_floor;
643 PL_pad_reset_pending = FALSE;
647 /* find_threadsv is not reentrant */
649 Perl_find_threadsv(pTHX_ const char *name)
654 /* We currently only handle names of a single character */
655 p = strchr(PL_threadsv_names, *name);
658 key = p - PL_threadsv_names;
659 MUTEX_LOCK(&thr->mutex);
660 svp = av_fetch(thr->threadsv, key, FALSE);
662 MUTEX_UNLOCK(&thr->mutex);
664 SV *sv = NEWSV(0, 0);
665 av_store(thr->threadsv, key, sv);
666 thr->threadsvp = AvARRAY(thr->threadsv);
667 MUTEX_UNLOCK(&thr->mutex);
669 * Some magic variables used to be automagically initialised
670 * in gv_fetchpv. Those which are now per-thread magicals get
671 * initialised here instead.
677 sv_setpv(sv, "\034");
678 sv_magic(sv, 0, 0, name, 1);
683 PL_sawampersand = TRUE;
697 /* XXX %! tied to Errno.pm needs to be added here.
698 * See gv_fetchpv(). */
702 sv_magic(sv, 0, 0, name, 1);
704 DEBUG_S(PerlIO_printf(Perl_error_log,
705 "find_threadsv: new SV %p for $%s%c\n",
706 sv, (*name < 32) ? "^" : "",
707 (*name < 32) ? toCTRL(*name) : *name));
711 #endif /* USE_THREADS */
716 Perl_op_free(pTHX_ OP *o)
718 register OP *kid, *nextkid;
721 if (!o || o->op_seq == (U16)-1)
724 if (o->op_private & OPpREFCOUNTED) {
725 switch (o->op_type) {
733 if (OpREFCNT_dec(o)) {
744 if (o->op_flags & OPf_KIDS) {
745 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
746 nextkid = kid->op_sibling; /* Get before next freeing kid */
754 /* COP* is not cleared by op_clear() so that we may track line
755 * numbers etc even after null() */
756 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
761 #ifdef PL_OP_SLAB_ALLOC
762 if ((char *) o == PL_OpPtr)
771 S_op_clear(pTHX_ OP *o)
773 switch (o->op_type) {
774 case OP_NULL: /* Was holding old type, if any. */
775 case OP_ENTEREVAL: /* Was holding hints. */
777 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
783 if (!(o->op_flags & OPf_SPECIAL))
786 #endif /* USE_THREADS */
788 if (!(o->op_flags & OPf_REF)
789 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
796 if (cPADOPo->op_padix > 0) {
799 pad_swipe(cPADOPo->op_padix);
800 /* No GvIN_PAD_off(gv) here, because other references may still
801 * exist on the pad */
804 cPADOPo->op_padix = 0;
807 SvREFCNT_dec(cSVOPo->op_sv);
808 cSVOPo->op_sv = Nullsv;
811 case OP_METHOD_NAMED:
813 SvREFCNT_dec(cSVOPo->op_sv);
814 cSVOPo->op_sv = Nullsv;
820 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
824 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
825 SvREFCNT_dec(cSVOPo->op_sv);
826 cSVOPo->op_sv = Nullsv;
829 Safefree(cPVOPo->op_pv);
830 cPVOPo->op_pv = Nullch;
834 op_free(cPMOPo->op_pmreplroot);
838 if ((PADOFFSET)cPMOPo->op_pmreplroot) {
840 GV *gv = (GV*)PL_curpad[(PADOFFSET)cPMOPo->op_pmreplroot];
841 pad_swipe((PADOFFSET)cPMOPo->op_pmreplroot);
842 /* No GvIN_PAD_off(gv) here, because other references may still
843 * exist on the pad */
848 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
854 cPMOPo->op_pmreplroot = Nullop;
855 ReREFCNT_dec(cPMOPo->op_pmregexp);
856 cPMOPo->op_pmregexp = (REGEXP*)NULL;
860 if (o->op_targ > 0) {
861 pad_free(o->op_targ);
867 S_cop_free(pTHX_ COP* cop)
869 Safefree(cop->cop_label);
871 Safefree(CopFILE(cop)); /* XXX share in a pvtable? */
872 Safefree(CopSTASHPV(cop)); /* XXX share in a pvtable? */
874 /* NOTE: COP.cop_stash is not refcounted */
875 SvREFCNT_dec(CopFILEGV(cop));
877 if (! specialWARN(cop->cop_warnings))
878 SvREFCNT_dec(cop->cop_warnings);
884 if (o->op_type == OP_NULL)
887 o->op_targ = o->op_type;
888 o->op_type = OP_NULL;
889 o->op_ppaddr = PL_ppaddr[OP_NULL];
892 /* Contextualizers */
894 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
897 Perl_linklist(pTHX_ OP *o)
904 /* establish postfix order */
905 if (cUNOPo->op_first) {
906 o->op_next = LINKLIST(cUNOPo->op_first);
907 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
909 kid->op_next = LINKLIST(kid->op_sibling);
921 Perl_scalarkids(pTHX_ OP *o)
924 if (o && o->op_flags & OPf_KIDS) {
925 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
932 S_scalarboolean(pTHX_ OP *o)
934 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
935 if (ckWARN(WARN_SYNTAX)) {
936 line_t oldline = CopLINE(PL_curcop);
938 if (PL_copline != NOLINE)
939 CopLINE_set(PL_curcop, PL_copline);
940 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
941 CopLINE_set(PL_curcop, oldline);
948 Perl_scalar(pTHX_ OP *o)
952 /* assumes no premature commitment */
953 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
954 || o->op_type == OP_RETURN)
959 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
961 switch (o->op_type) {
963 if (o->op_private & OPpREPEAT_DOLIST)
964 null(((LISTOP*)cBINOPo->op_first)->op_first);
965 scalar(cBINOPo->op_first);
970 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
974 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
975 if (!kPMOP->op_pmreplroot)
976 deprecate("implicit split to @_");
984 if (o->op_flags & OPf_KIDS) {
985 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
991 kid = cLISTOPo->op_first;
993 while ((kid = kid->op_sibling)) {
999 WITH_THR(PL_curcop = &PL_compiling);
1004 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1005 if (kid->op_sibling)
1010 WITH_THR(PL_curcop = &PL_compiling);
1017 Perl_scalarvoid(pTHX_ OP *o)
1024 if (o->op_type == OP_NEXTSTATE
1025 || o->op_type == OP_SETSTATE
1026 || o->op_type == OP_DBSTATE
1027 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1028 || o->op_targ == OP_SETSTATE
1029 || o->op_targ == OP_DBSTATE)))
1030 PL_curcop = (COP*)o; /* for warning below */
1032 /* assumes no premature commitment */
1033 want = o->op_flags & OPf_WANT;
1034 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
1035 || o->op_type == OP_RETURN)
1040 if ((o->op_private & OPpTARGET_MY)
1041 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1043 return scalar(o); /* As if inside SASSIGN */
1046 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1048 switch (o->op_type) {
1050 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1054 if (o->op_flags & OPf_STACKED)
1058 if (o->op_private == 4)
1100 case OP_GETSOCKNAME:
1101 case OP_GETPEERNAME:
1106 case OP_GETPRIORITY:
1129 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1130 useless = PL_op_desc[o->op_type];
1137 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1138 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1139 useless = "a variable";
1144 if (cSVOPo->op_private & OPpCONST_STRICT)
1145 no_bareword_allowed(o);
1147 if (ckWARN(WARN_VOID)) {
1148 useless = "a constant";
1149 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1151 else if (SvPOK(sv)) {
1152 if (strnEQ(SvPVX(sv), "di", 2) ||
1153 strnEQ(SvPVX(sv), "ds", 2) ||
1154 strnEQ(SvPVX(sv), "ig", 2))
1159 null(o); /* don't execute or even remember it */
1163 o->op_type = OP_PREINC; /* pre-increment is faster */
1164 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1168 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1169 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1175 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1180 if (o->op_flags & OPf_STACKED)
1187 if (!(o->op_flags & OPf_KIDS))
1196 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1203 /* all requires must return a boolean value */
1204 o->op_flags &= ~OPf_WANT;
1209 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1210 if (!kPMOP->op_pmreplroot)
1211 deprecate("implicit split to @_");
1215 if (useless && ckWARN(WARN_VOID))
1216 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1221 Perl_listkids(pTHX_ OP *o)
1224 if (o && o->op_flags & OPf_KIDS) {
1225 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1232 Perl_list(pTHX_ OP *o)
1236 /* assumes no premature commitment */
1237 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1238 || o->op_type == OP_RETURN)
1243 if ((o->op_private & OPpTARGET_MY)
1244 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1246 return o; /* As if inside SASSIGN */
1249 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1251 switch (o->op_type) {
1254 list(cBINOPo->op_first);
1259 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1267 if (!(o->op_flags & OPf_KIDS))
1269 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1270 list(cBINOPo->op_first);
1271 return gen_constant_list(o);
1278 kid = cLISTOPo->op_first;
1280 while ((kid = kid->op_sibling)) {
1281 if (kid->op_sibling)
1286 WITH_THR(PL_curcop = &PL_compiling);
1290 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1291 if (kid->op_sibling)
1296 WITH_THR(PL_curcop = &PL_compiling);
1299 /* all requires must return a boolean value */
1300 o->op_flags &= ~OPf_WANT;
1307 Perl_scalarseq(pTHX_ OP *o)
1312 if (o->op_type == OP_LINESEQ ||
1313 o->op_type == OP_SCOPE ||
1314 o->op_type == OP_LEAVE ||
1315 o->op_type == OP_LEAVETRY)
1317 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1318 if (kid->op_sibling) {
1322 PL_curcop = &PL_compiling;
1324 o->op_flags &= ~OPf_PARENS;
1325 if (PL_hints & HINT_BLOCK_SCOPE)
1326 o->op_flags |= OPf_PARENS;
1329 o = newOP(OP_STUB, 0);
1334 S_modkids(pTHX_ OP *o, I32 type)
1337 if (o && o->op_flags & OPf_KIDS) {
1338 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1345 Perl_mod(pTHX_ OP *o, I32 type)
1350 if (!o || PL_error_count)
1353 if ((o->op_private & OPpTARGET_MY)
1354 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1359 switch (o->op_type) {
1364 if (!(o->op_private & (OPpCONST_ARYBASE)))
1366 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1367 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1371 SAVEI32(PL_compiling.cop_arybase);
1372 PL_compiling.cop_arybase = 0;
1374 else if (type == OP_REFGEN)
1377 Perl_croak(aTHX_ "That use of $[ is unsupported");
1380 if (o->op_flags & OPf_PARENS)
1384 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1385 !(o->op_flags & OPf_STACKED)) {
1386 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1387 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1388 assert(cUNOPo->op_first->op_type == OP_NULL);
1389 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1392 else { /* lvalue subroutine call */
1393 o->op_private |= OPpLVAL_INTRO;
1394 PL_modcount = RETURN_UNLIMITED_NUMBER;
1395 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1396 /* Backward compatibility mode: */
1397 o->op_private |= OPpENTERSUB_INARGS;
1400 else { /* Compile-time error message: */
1401 OP *kid = cUNOPo->op_first;
1405 if (kid->op_type == OP_PUSHMARK)
1407 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1409 "panic: unexpected lvalue entersub "
1410 "args: type/targ %ld:%ld",
1411 (long)kid->op_type,kid->op_targ);
1412 kid = kLISTOP->op_first;
1414 while (kid->op_sibling)
1415 kid = kid->op_sibling;
1416 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1418 if (kid->op_type == OP_METHOD_NAMED
1419 || kid->op_type == OP_METHOD)
1423 if (kid->op_sibling || kid->op_next != kid) {
1424 yyerror("panic: unexpected optree near method call");
1428 NewOp(1101, newop, 1, UNOP);
1429 newop->op_type = OP_RV2CV;
1430 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1431 newop->op_first = Nullop;
1432 newop->op_next = (OP*)newop;
1433 kid->op_sibling = (OP*)newop;
1434 newop->op_private |= OPpLVAL_INTRO;
1438 if (kid->op_type != OP_RV2CV)
1440 "panic: unexpected lvalue entersub "
1441 "entry via type/targ %ld:%ld",
1442 (long)kid->op_type,kid->op_targ);
1443 kid->op_private |= OPpLVAL_INTRO;
1444 break; /* Postpone until runtime */
1448 kid = kUNOP->op_first;
1449 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1450 kid = kUNOP->op_first;
1451 if (kid->op_type == OP_NULL)
1453 "Unexpected constant lvalue entersub "
1454 "entry via type/targ %ld:%ld",
1455 (long)kid->op_type,kid->op_targ);
1456 if (kid->op_type != OP_GV) {
1457 /* Restore RV2CV to check lvalueness */
1459 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1460 okid->op_next = kid->op_next;
1461 kid->op_next = okid;
1464 okid->op_next = Nullop;
1465 okid->op_type = OP_RV2CV;
1467 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1468 okid->op_private |= OPpLVAL_INTRO;
1472 cv = GvCV(kGVOP_gv);
1482 /* grep, foreach, subcalls, refgen */
1483 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1485 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1486 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1488 : (o->op_type == OP_ENTERSUB
1489 ? "non-lvalue subroutine call"
1490 : PL_op_desc[o->op_type])),
1491 type ? PL_op_desc[type] : "local"));
1505 case OP_RIGHT_SHIFT:
1514 if (!(o->op_flags & OPf_STACKED))
1520 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1526 if (!type && cUNOPo->op_first->op_type != OP_GV)
1527 Perl_croak(aTHX_ "Can't localize through a reference");
1528 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1529 PL_modcount = RETURN_UNLIMITED_NUMBER;
1530 return o; /* Treat \(@foo) like ordinary list. */
1534 if (scalar_mod_type(o, type))
1536 ref(cUNOPo->op_first, o->op_type);
1540 if (type == OP_LEAVESUBLV)
1541 o->op_private |= OPpMAYBE_LVSUB;
1547 PL_modcount = RETURN_UNLIMITED_NUMBER;
1550 if (!type && cUNOPo->op_first->op_type != OP_GV)
1551 Perl_croak(aTHX_ "Can't localize through a reference");
1552 ref(cUNOPo->op_first, o->op_type);
1556 PL_hints |= HINT_BLOCK_SCOPE;
1566 PL_modcount = RETURN_UNLIMITED_NUMBER;
1567 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1568 return o; /* Treat \(@foo) like ordinary list. */
1569 if (scalar_mod_type(o, type))
1571 if (type == OP_LEAVESUBLV)
1572 o->op_private |= OPpMAYBE_LVSUB;
1577 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1578 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1583 PL_modcount++; /* XXX ??? */
1585 #endif /* USE_THREADS */
1591 if (type != OP_SASSIGN)
1595 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1600 if (type == OP_LEAVESUBLV)
1601 o->op_private |= OPpMAYBE_LVSUB;
1603 pad_free(o->op_targ);
1604 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1605 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1606 if (o->op_flags & OPf_KIDS)
1607 mod(cBINOPo->op_first->op_sibling, type);
1612 ref(cBINOPo->op_first, o->op_type);
1613 if (type == OP_ENTERSUB &&
1614 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1615 o->op_private |= OPpLVAL_DEFER;
1616 if (type == OP_LEAVESUBLV)
1617 o->op_private |= OPpMAYBE_LVSUB;
1625 if (o->op_flags & OPf_KIDS)
1626 mod(cLISTOPo->op_last, type);
1630 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1632 else if (!(o->op_flags & OPf_KIDS))
1634 if (o->op_targ != OP_LIST) {
1635 mod(cBINOPo->op_first, type);
1640 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1645 if (type != OP_LEAVESUBLV)
1647 break; /* mod()ing was handled by ck_return() */
1649 if (type != OP_LEAVESUBLV)
1650 o->op_flags |= OPf_MOD;
1652 if (type == OP_AASSIGN || type == OP_SASSIGN)
1653 o->op_flags |= OPf_SPECIAL|OPf_REF;
1655 o->op_private |= OPpLVAL_INTRO;
1656 o->op_flags &= ~OPf_SPECIAL;
1657 PL_hints |= HINT_BLOCK_SCOPE;
1659 else if (type != OP_GREPSTART && type != OP_ENTERSUB
1660 && type != OP_LEAVESUBLV)
1661 o->op_flags |= OPf_REF;
1666 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1670 if (o->op_type == OP_RV2GV)
1694 case OP_RIGHT_SHIFT:
1713 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1715 switch (o->op_type) {
1723 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1736 Perl_refkids(pTHX_ OP *o, I32 type)
1739 if (o && o->op_flags & OPf_KIDS) {
1740 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1747 Perl_ref(pTHX_ OP *o, I32 type)
1751 if (!o || PL_error_count)
1754 switch (o->op_type) {
1756 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1757 !(o->op_flags & OPf_STACKED)) {
1758 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1759 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1760 assert(cUNOPo->op_first->op_type == OP_NULL);
1761 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1762 o->op_flags |= OPf_SPECIAL;
1767 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1771 if (type == OP_DEFINED)
1772 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1773 ref(cUNOPo->op_first, o->op_type);
1776 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1777 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1778 : type == OP_RV2HV ? OPpDEREF_HV
1780 o->op_flags |= OPf_MOD;
1785 o->op_flags |= OPf_MOD; /* XXX ??? */
1790 o->op_flags |= OPf_REF;
1793 if (type == OP_DEFINED)
1794 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1795 ref(cUNOPo->op_first, o->op_type);
1800 o->op_flags |= OPf_REF;
1805 if (!(o->op_flags & OPf_KIDS))
1807 ref(cBINOPo->op_first, type);
1811 ref(cBINOPo->op_first, o->op_type);
1812 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1813 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1814 : type == OP_RV2HV ? OPpDEREF_HV
1816 o->op_flags |= OPf_MOD;
1824 if (!(o->op_flags & OPf_KIDS))
1826 ref(cLISTOPo->op_last, type);
1836 S_dup_attrlist(pTHX_ OP *o)
1840 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1841 * where the first kid is OP_PUSHMARK and the remaining ones
1842 * are OP_CONST. We need to push the OP_CONST values.
1844 if (o->op_type == OP_CONST)
1845 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1847 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1848 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1849 if (o->op_type == OP_CONST)
1850 rop = append_elem(OP_LIST, rop,
1851 newSVOP(OP_CONST, o->op_flags,
1852 SvREFCNT_inc(cSVOPo->op_sv)));
1859 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1863 /* fake up C<use attributes $pkg,$rv,@attrs> */
1864 ENTER; /* need to protect against side-effects of 'use' */
1866 if (stash && HvNAME(stash))
1867 stashsv = newSVpv(HvNAME(stash), 0);
1869 stashsv = &PL_sv_no;
1871 #define ATTRSMODULE "attributes"
1873 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1874 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1876 prepend_elem(OP_LIST,
1877 newSVOP(OP_CONST, 0, stashsv),
1878 prepend_elem(OP_LIST,
1879 newSVOP(OP_CONST, 0,
1881 dup_attrlist(attrs))));
1886 Perl_apply_attrs_string(pTHX_ char *stashpv, CV *cv,
1887 char *attrstr, STRLEN len)
1892 len = strlen(attrstr);
1896 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
1898 char *sstr = attrstr;
1899 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
1900 attrs = append_elem(OP_LIST, attrs,
1901 newSVOP(OP_CONST, 0,
1902 newSVpvn(sstr, attrstr-sstr)));
1906 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1907 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1908 Nullsv, prepend_elem(OP_LIST,
1909 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
1910 prepend_elem(OP_LIST,
1911 newSVOP(OP_CONST, 0,
1917 S_my_kid(pTHX_ OP *o, OP *attrs)
1922 if (!o || PL_error_count)
1926 if (type == OP_LIST) {
1927 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1929 } else if (type == OP_UNDEF) {
1931 } else if (type == OP_RV2SV || /* "our" declaration */
1933 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1934 o->op_private |= OPpOUR_INTRO;
1936 } else if (type != OP_PADSV &&
1939 type != OP_PUSHMARK)
1941 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1942 PL_op_desc[o->op_type],
1943 PL_in_my == KEY_our ? "our" : "my"));
1946 else if (attrs && type != OP_PUSHMARK) {
1952 PL_in_my_stash = Nullhv;
1954 /* check for C<my Dog $spot> when deciding package */
1955 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1956 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1957 stash = SvSTASH(*namesvp);
1959 stash = PL_curstash;
1960 padsv = PAD_SV(o->op_targ);
1961 apply_attrs(stash, padsv, attrs);
1963 o->op_flags |= OPf_MOD;
1964 o->op_private |= OPpLVAL_INTRO;
1969 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1971 if (o->op_flags & OPf_PARENS)
1975 o = my_kid(o, attrs);
1977 PL_in_my_stash = Nullhv;
1982 Perl_my(pTHX_ OP *o)
1984 return my_kid(o, Nullop);
1988 Perl_sawparens(pTHX_ OP *o)
1991 o->op_flags |= OPf_PARENS;
1996 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2000 if (ckWARN(WARN_MISC) &&
2001 (left->op_type == OP_RV2AV ||
2002 left->op_type == OP_RV2HV ||
2003 left->op_type == OP_PADAV ||
2004 left->op_type == OP_PADHV)) {
2005 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
2006 right->op_type == OP_TRANS)
2007 ? right->op_type : OP_MATCH];
2008 const char *sample = ((left->op_type == OP_RV2AV ||
2009 left->op_type == OP_PADAV)
2010 ? "@array" : "%hash");
2011 Perl_warner(aTHX_ WARN_MISC,
2012 "Applying %s to %s will act on scalar(%s)",
2013 desc, sample, sample);
2016 if (!(right->op_flags & OPf_STACKED) &&
2017 (right->op_type == OP_MATCH ||
2018 right->op_type == OP_SUBST ||
2019 right->op_type == OP_TRANS)) {
2020 right->op_flags |= OPf_STACKED;
2021 if (right->op_type != OP_MATCH &&
2022 ! (right->op_type == OP_TRANS &&
2023 right->op_private & OPpTRANS_IDENTICAL))
2024 left = mod(left, right->op_type);
2025 if (right->op_type == OP_TRANS)
2026 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
2028 o = prepend_elem(right->op_type, scalar(left), right);
2030 return newUNOP(OP_NOT, 0, scalar(o));
2034 return bind_match(type, left,
2035 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
2039 Perl_invert(pTHX_ OP *o)
2043 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
2044 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2048 Perl_scope(pTHX_ OP *o)
2051 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2052 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2053 o->op_type = OP_LEAVE;
2054 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2057 if (o->op_type == OP_LINESEQ) {
2059 o->op_type = OP_SCOPE;
2060 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2061 kid = ((LISTOP*)o)->op_first;
2062 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2066 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
2073 Perl_save_hints(pTHX)
2076 SAVESPTR(GvHV(PL_hintgv));
2077 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
2078 SAVEFREESV(GvHV(PL_hintgv));
2082 Perl_block_start(pTHX_ int full)
2084 int retval = PL_savestack_ix;
2086 SAVEI32(PL_comppad_name_floor);
2087 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
2089 PL_comppad_name_fill = PL_comppad_name_floor;
2090 if (PL_comppad_name_floor < 0)
2091 PL_comppad_name_floor = 0;
2092 SAVEI32(PL_min_intro_pending);
2093 SAVEI32(PL_max_intro_pending);
2094 PL_min_intro_pending = 0;
2095 SAVEI32(PL_comppad_name_fill);
2096 SAVEI32(PL_padix_floor);
2097 PL_padix_floor = PL_padix;
2098 PL_pad_reset_pending = FALSE;
2100 PL_hints &= ~HINT_BLOCK_SCOPE;
2101 SAVESPTR(PL_compiling.cop_warnings);
2102 if (! specialWARN(PL_compiling.cop_warnings)) {
2103 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2104 SAVEFREESV(PL_compiling.cop_warnings) ;
2110 Perl_block_end(pTHX_ I32 floor, OP *seq)
2112 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2113 OP* retval = scalarseq(seq);
2115 PL_pad_reset_pending = FALSE;
2116 PL_compiling.op_private = PL_hints;
2118 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2119 pad_leavemy(PL_comppad_name_fill);
2128 OP *o = newOP(OP_THREADSV, 0);
2129 o->op_targ = find_threadsv("_");
2132 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2133 #endif /* USE_THREADS */
2137 Perl_newPROG(pTHX_ OP *o)
2142 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2143 ((PL_in_eval & EVAL_KEEPERR)
2144 ? OPf_SPECIAL : 0), o);
2145 PL_eval_start = linklist(PL_eval_root);
2146 PL_eval_root->op_private |= OPpREFCOUNTED;
2147 OpREFCNT_set(PL_eval_root, 1);
2148 PL_eval_root->op_next = 0;
2149 peep(PL_eval_start);
2154 PL_main_root = scope(sawparens(scalarvoid(o)));
2155 PL_curcop = &PL_compiling;
2156 PL_main_start = LINKLIST(PL_main_root);
2157 PL_main_root->op_private |= OPpREFCOUNTED;
2158 OpREFCNT_set(PL_main_root, 1);
2159 PL_main_root->op_next = 0;
2160 peep(PL_main_start);
2163 /* Register with debugger */
2165 CV *cv = get_cv("DB::postponed", FALSE);
2169 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2171 call_sv((SV*)cv, G_DISCARD);
2178 Perl_localize(pTHX_ OP *o, I32 lex)
2180 if (o->op_flags & OPf_PARENS)
2183 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2185 for (s = PL_bufptr; *s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s) || strchr("@$%, ",*s)); s++) ;
2186 if (*s == ';' || *s == '=')
2187 Perl_warner(aTHX_ WARN_PARENTHESIS,
2188 "Parentheses missing around \"%s\" list",
2189 lex ? (PL_in_my == KEY_our ? "our" : "my") : "local");
2195 o = mod(o, OP_NULL); /* a bit kludgey */
2197 PL_in_my_stash = Nullhv;
2202 Perl_jmaybe(pTHX_ OP *o)
2204 if (o->op_type == OP_LIST) {
2207 o2 = newOP(OP_THREADSV, 0);
2208 o2->op_targ = find_threadsv(";");
2210 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2211 #endif /* USE_THREADS */
2212 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2218 Perl_fold_constants(pTHX_ register OP *o)
2221 I32 type = o->op_type;
2224 if (PL_opargs[type] & OA_RETSCALAR)
2226 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2227 o->op_targ = pad_alloc(type, SVs_PADTMP);
2229 /* integerize op, unless it happens to be C<-foo>.
2230 * XXX should pp_i_negate() do magic string negation instead? */
2231 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2232 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2233 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2235 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2238 if (!(PL_opargs[type] & OA_FOLDCONST))
2243 /* XXX might want a ck_negate() for this */
2244 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2256 /* XXX what about the numeric ops? */
2257 if (PL_hints & HINT_LOCALE)
2262 goto nope; /* Don't try to run w/ errors */
2264 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2265 if ((curop->op_type != OP_CONST ||
2266 (curop->op_private & OPpCONST_BARE)) &&
2267 curop->op_type != OP_LIST &&
2268 curop->op_type != OP_SCALAR &&
2269 curop->op_type != OP_NULL &&
2270 curop->op_type != OP_PUSHMARK)
2276 curop = LINKLIST(o);
2280 sv = *(PL_stack_sp--);
2281 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2282 pad_swipe(o->op_targ);
2283 else if (SvTEMP(sv)) { /* grab mortal temp? */
2284 (void)SvREFCNT_inc(sv);
2288 if (type == OP_RV2GV)
2289 return newGVOP(OP_GV, 0, (GV*)sv);
2291 /* try to smush double to int, but don't smush -2.0 to -2 */
2292 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2296 if ((NV)iv == SvNV(sv)) {
2301 SvIOK_off(sv); /* undo SvIV() damage */
2303 return newSVOP(OP_CONST, 0, sv);
2307 if (!(PL_opargs[type] & OA_OTHERINT))
2310 if (!(PL_hints & HINT_INTEGER)) {
2311 if (type == OP_MODULO
2312 || type == OP_DIVIDE
2313 || !(o->op_flags & OPf_KIDS))
2318 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2319 if (curop->op_type == OP_CONST) {
2320 if (SvIOK(((SVOP*)curop)->op_sv))
2324 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2328 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2335 Perl_gen_constant_list(pTHX_ register OP *o)
2338 I32 oldtmps_floor = PL_tmps_floor;
2342 return o; /* Don't attempt to run with errors */
2344 PL_op = curop = LINKLIST(o);
2351 PL_tmps_floor = oldtmps_floor;
2353 o->op_type = OP_RV2AV;
2354 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2355 curop = ((UNOP*)o)->op_first;
2356 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2363 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2368 if (!o || o->op_type != OP_LIST)
2369 o = newLISTOP(OP_LIST, 0, o, Nullop);
2371 o->op_flags &= ~OPf_WANT;
2373 if (!(PL_opargs[type] & OA_MARK))
2374 null(cLISTOPo->op_first);
2377 o->op_ppaddr = PL_ppaddr[type];
2378 o->op_flags |= flags;
2380 o = CHECKOP(type, o);
2381 if (o->op_type != type)
2384 return fold_constants(o);
2387 /* List constructors */
2390 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2398 if (first->op_type != type
2399 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2401 return newLISTOP(type, 0, first, last);
2404 if (first->op_flags & OPf_KIDS)
2405 ((LISTOP*)first)->op_last->op_sibling = last;
2407 first->op_flags |= OPf_KIDS;
2408 ((LISTOP*)first)->op_first = last;
2410 ((LISTOP*)first)->op_last = last;
2415 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2423 if (first->op_type != type)
2424 return prepend_elem(type, (OP*)first, (OP*)last);
2426 if (last->op_type != type)
2427 return append_elem(type, (OP*)first, (OP*)last);
2429 first->op_last->op_sibling = last->op_first;
2430 first->op_last = last->op_last;
2431 first->op_flags |= (last->op_flags & OPf_KIDS);
2433 #ifdef PL_OP_SLAB_ALLOC
2441 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2449 if (last->op_type == type) {
2450 if (type == OP_LIST) { /* already a PUSHMARK there */
2451 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2452 ((LISTOP*)last)->op_first->op_sibling = first;
2455 if (!(last->op_flags & OPf_KIDS)) {
2456 ((LISTOP*)last)->op_last = first;
2457 last->op_flags |= OPf_KIDS;
2459 first->op_sibling = ((LISTOP*)last)->op_first;
2460 ((LISTOP*)last)->op_first = first;
2462 last->op_flags |= OPf_KIDS;
2466 return newLISTOP(type, 0, first, last);
2472 Perl_newNULLLIST(pTHX)
2474 return newOP(OP_STUB, 0);
2478 Perl_force_list(pTHX_ OP *o)
2480 if (!o || o->op_type != OP_LIST)
2481 o = newLISTOP(OP_LIST, 0, o, Nullop);
2487 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2491 NewOp(1101, listop, 1, LISTOP);
2493 listop->op_type = type;
2494 listop->op_ppaddr = PL_ppaddr[type];
2497 listop->op_flags = flags;
2501 else if (!first && last)
2504 first->op_sibling = last;
2505 listop->op_first = first;
2506 listop->op_last = last;
2507 if (type == OP_LIST) {
2509 pushop = newOP(OP_PUSHMARK, 0);
2510 pushop->op_sibling = first;
2511 listop->op_first = pushop;
2512 listop->op_flags |= OPf_KIDS;
2514 listop->op_last = pushop;
2521 Perl_newOP(pTHX_ I32 type, I32 flags)
2524 NewOp(1101, o, 1, OP);
2526 o->op_ppaddr = PL_ppaddr[type];
2527 o->op_flags = flags;
2530 o->op_private = 0 + (flags >> 8);
2531 if (PL_opargs[type] & OA_RETSCALAR)
2533 if (PL_opargs[type] & OA_TARGET)
2534 o->op_targ = pad_alloc(type, SVs_PADTMP);
2535 return CHECKOP(type, o);
2539 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2544 first = newOP(OP_STUB, 0);
2545 if (PL_opargs[type] & OA_MARK)
2546 first = force_list(first);
2548 NewOp(1101, unop, 1, UNOP);
2549 unop->op_type = type;
2550 unop->op_ppaddr = PL_ppaddr[type];
2551 unop->op_first = first;
2552 unop->op_flags = flags | OPf_KIDS;
2553 unop->op_private = 1 | (flags >> 8);
2554 unop = (UNOP*) CHECKOP(type, unop);
2558 return fold_constants((OP *) unop);
2562 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2565 NewOp(1101, binop, 1, BINOP);
2568 first = newOP(OP_NULL, 0);
2570 binop->op_type = type;
2571 binop->op_ppaddr = PL_ppaddr[type];
2572 binop->op_first = first;
2573 binop->op_flags = flags | OPf_KIDS;
2576 binop->op_private = 1 | (flags >> 8);
2579 binop->op_private = 2 | (flags >> 8);
2580 first->op_sibling = last;
2583 binop = (BINOP*)CHECKOP(type, binop);
2584 if (binop->op_next || binop->op_type != type)
2587 binop->op_last = binop->op_first->op_sibling;
2589 return fold_constants((OP *)binop);
2593 utf8compare(const void *a, const void *b)
2596 for (i = 0; i < 10; i++) {
2597 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2599 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2606 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2608 SV *tstr = ((SVOP*)expr)->op_sv;
2609 SV *rstr = ((SVOP*)repl)->op_sv;
2612 U8 *t = (U8*)SvPV(tstr, tlen);
2613 U8 *r = (U8*)SvPV(rstr, rlen);
2620 register short *tbl;
2622 PL_hints |= HINT_BLOCK_SCOPE;
2623 complement = o->op_private & OPpTRANS_COMPLEMENT;
2624 del = o->op_private & OPpTRANS_DELETE;
2625 squash = o->op_private & OPpTRANS_SQUASH;
2628 o->op_private |= OPpTRANS_FROM_UTF;
2631 o->op_private |= OPpTRANS_TO_UTF;
2633 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2634 SV* listsv = newSVpvn("# comment\n",10);
2636 U8* tend = t + tlen;
2637 U8* rend = r + rlen;
2651 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2652 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2653 U8* tsave = from_utf ? NULL : trlist_upgrade(&t, &tend);
2654 U8* rsave = to_utf ? NULL : trlist_upgrade(&r, &rend);
2657 U8 tmpbuf[UTF8_MAXLEN+1];
2661 New(1109, cp, tlen, U8*);
2663 transv = newSVpvn("",0);
2667 if (t < tend && *t == 0xff) {
2672 qsort(cp, i, sizeof(U8*), utf8compare);
2673 for (j = 0; j < i; j++) {
2675 I32 cur = j < i - 1 ? cp[j+1] - s : tend - s;
2676 UV val = utf8_to_uv(s, cur, &ulen, 0);
2678 diff = val - nextmin;
2680 t = uv_to_utf8(tmpbuf,nextmin);
2681 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2683 t = uv_to_utf8(tmpbuf, val - 1);
2684 sv_catpvn(transv, "\377", 1);
2685 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2688 if (s < tend && *s == 0xff)
2689 val = utf8_to_uv(s+1, cur - 1, &ulen, 0);
2693 t = uv_to_utf8(tmpbuf,nextmin);
2694 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2695 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2696 sv_catpvn(transv, "\377", 1);
2697 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2698 t = (U8*)SvPVX(transv);
2699 tlen = SvCUR(transv);
2703 else if (!rlen && !del) {
2704 r = t; rlen = tlen; rend = tend;
2708 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
2710 o->op_private |= OPpTRANS_IDENTICAL;
2714 while (t < tend || tfirst <= tlast) {
2715 /* see if we need more "t" chars */
2716 if (tfirst > tlast) {
2717 tfirst = (I32)utf8_to_uv(t, tend - t, &ulen, 0);
2719 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2721 tlast = (I32)utf8_to_uv(t, tend - t, &ulen, 0);
2728 /* now see if we need more "r" chars */
2729 if (rfirst > rlast) {
2731 rfirst = (I32)utf8_to_uv(r, rend - r, &ulen, 0);
2733 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2735 rlast = (I32)utf8_to_uv(r, rend - r, &ulen, 0);
2744 rfirst = rlast = 0xffffffff;
2748 /* now see which range will peter our first, if either. */
2749 tdiff = tlast - tfirst;
2750 rdiff = rlast - rfirst;
2757 if (rfirst == 0xffffffff) {
2758 diff = tdiff; /* oops, pretend rdiff is infinite */
2760 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2761 (long)tfirst, (long)tlast);
2763 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2767 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2768 (long)tfirst, (long)(tfirst + diff),
2771 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2772 (long)tfirst, (long)rfirst);
2774 if (rfirst + diff > max)
2775 max = rfirst + diff;
2778 grows = (UNISKIP(tfirst) < UNISKIP(rfirst));
2789 else if (max > 0xff)
2794 Safefree(cPVOPo->op_pv);
2795 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2796 SvREFCNT_dec(listsv);
2798 SvREFCNT_dec(transv);
2800 if (!del && havefinal)
2801 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
2802 newSVuv((UV)final), 0);
2805 o->op_private |= OPpTRANS_GROWS;
2817 tbl = (short*)cPVOPo->op_pv;
2819 Zero(tbl, 256, short);
2820 for (i = 0; i < tlen; i++)
2822 for (i = 0, j = 0; i < 256; i++) {
2833 if (i < 128 && r[j] >= 128)
2841 if (!rlen && !del) {
2844 o->op_private |= OPpTRANS_IDENTICAL;
2846 for (i = 0; i < 256; i++)
2848 for (i = 0, j = 0; i < tlen; i++,j++) {
2851 if (tbl[t[i]] == -1)
2857 if (tbl[t[i]] == -1) {
2858 if (t[i] < 128 && r[j] >= 128)
2865 o->op_private |= OPpTRANS_GROWS;
2873 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2877 NewOp(1101, pmop, 1, PMOP);
2878 pmop->op_type = type;
2879 pmop->op_ppaddr = PL_ppaddr[type];
2880 pmop->op_flags = flags;
2881 pmop->op_private = 0 | (flags >> 8);
2883 if (PL_hints & HINT_RE_TAINT)
2884 pmop->op_pmpermflags |= PMf_RETAINT;
2885 if (PL_hints & HINT_LOCALE)
2886 pmop->op_pmpermflags |= PMf_LOCALE;
2887 pmop->op_pmflags = pmop->op_pmpermflags;
2889 /* link into pm list */
2890 if (type != OP_TRANS && PL_curstash) {
2891 pmop->op_pmnext = HvPMROOT(PL_curstash);
2892 HvPMROOT(PL_curstash) = pmop;
2899 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2903 I32 repl_has_vars = 0;
2905 if (o->op_type == OP_TRANS)
2906 return pmtrans(o, expr, repl);
2908 PL_hints |= HINT_BLOCK_SCOPE;
2911 if (expr->op_type == OP_CONST) {
2913 SV *pat = ((SVOP*)expr)->op_sv;
2914 char *p = SvPV(pat, plen);
2915 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2916 sv_setpvn(pat, "\\s+", 3);
2917 p = SvPV(pat, plen);
2918 pm->op_pmflags |= PMf_SKIPWHITE;
2920 if ((PL_hints & HINT_UTF8) || DO_UTF8(pat))
2921 pm->op_pmdynflags |= PMdf_UTF8;
2922 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2923 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2924 pm->op_pmflags |= PMf_WHITE;
2928 if (PL_hints & HINT_UTF8)
2929 pm->op_pmdynflags |= PMdf_UTF8;
2930 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2931 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2933 : OP_REGCMAYBE),0,expr);
2935 NewOp(1101, rcop, 1, LOGOP);
2936 rcop->op_type = OP_REGCOMP;
2937 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2938 rcop->op_first = scalar(expr);
2939 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2940 ? (OPf_SPECIAL | OPf_KIDS)
2942 rcop->op_private = 1;
2945 /* establish postfix order */
2946 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2948 rcop->op_next = expr;
2949 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2952 rcop->op_next = LINKLIST(expr);
2953 expr->op_next = (OP*)rcop;
2956 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2961 if (pm->op_pmflags & PMf_EVAL) {
2963 if (CopLINE(PL_curcop) < PL_multi_end)
2964 CopLINE_set(PL_curcop, PL_multi_end);
2967 else if (repl->op_type == OP_THREADSV
2968 && strchr("&`'123456789+",
2969 PL_threadsv_names[repl->op_targ]))
2973 #endif /* USE_THREADS */
2974 else if (repl->op_type == OP_CONST)
2978 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2979 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2981 if (curop->op_type == OP_THREADSV) {
2983 if (strchr("&`'123456789+", curop->op_private))
2987 if (curop->op_type == OP_GV) {
2988 GV *gv = cGVOPx_gv(curop);
2990 if (strchr("&`'123456789+", *GvENAME(gv)))
2993 #endif /* USE_THREADS */
2994 else if (curop->op_type == OP_RV2CV)
2996 else if (curop->op_type == OP_RV2SV ||
2997 curop->op_type == OP_RV2AV ||
2998 curop->op_type == OP_RV2HV ||
2999 curop->op_type == OP_RV2GV) {
3000 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
3003 else if (curop->op_type == OP_PADSV ||
3004 curop->op_type == OP_PADAV ||
3005 curop->op_type == OP_PADHV ||
3006 curop->op_type == OP_PADANY) {
3009 else if (curop->op_type == OP_PUSHRE)
3010 ; /* Okay here, dangerous in newASSIGNOP */
3019 && (!pm->op_pmregexp
3020 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
3021 pm->op_pmflags |= PMf_CONST; /* const for long enough */
3022 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
3023 prepend_elem(o->op_type, scalar(repl), o);
3026 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
3027 pm->op_pmflags |= PMf_MAYBE_CONST;
3028 pm->op_pmpermflags |= PMf_MAYBE_CONST;
3030 NewOp(1101, rcop, 1, LOGOP);
3031 rcop->op_type = OP_SUBSTCONT;
3032 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3033 rcop->op_first = scalar(repl);
3034 rcop->op_flags |= OPf_KIDS;
3035 rcop->op_private = 1;
3038 /* establish postfix order */
3039 rcop->op_next = LINKLIST(repl);
3040 repl->op_next = (OP*)rcop;
3042 pm->op_pmreplroot = scalar((OP*)rcop);
3043 pm->op_pmreplstart = LINKLIST(rcop);
3052 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3055 NewOp(1101, svop, 1, SVOP);
3056 svop->op_type = type;
3057 svop->op_ppaddr = PL_ppaddr[type];
3059 svop->op_next = (OP*)svop;
3060 svop->op_flags = flags;
3061 if (PL_opargs[type] & OA_RETSCALAR)
3063 if (PL_opargs[type] & OA_TARGET)
3064 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3065 return CHECKOP(type, svop);
3069 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3072 NewOp(1101, padop, 1, PADOP);
3073 padop->op_type = type;
3074 padop->op_ppaddr = PL_ppaddr[type];
3075 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3076 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3077 PL_curpad[padop->op_padix] = sv;
3079 padop->op_next = (OP*)padop;
3080 padop->op_flags = flags;
3081 if (PL_opargs[type] & OA_RETSCALAR)
3083 if (PL_opargs[type] & OA_TARGET)
3084 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3085 return CHECKOP(type, padop);
3089 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3093 return newPADOP(type, flags, SvREFCNT_inc(gv));
3095 return newSVOP(type, flags, SvREFCNT_inc(gv));
3100 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3103 NewOp(1101, pvop, 1, PVOP);
3104 pvop->op_type = type;
3105 pvop->op_ppaddr = PL_ppaddr[type];
3107 pvop->op_next = (OP*)pvop;
3108 pvop->op_flags = flags;
3109 if (PL_opargs[type] & OA_RETSCALAR)
3111 if (PL_opargs[type] & OA_TARGET)
3112 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3113 return CHECKOP(type, pvop);
3117 Perl_package(pTHX_ OP *o)
3121 save_hptr(&PL_curstash);
3122 save_item(PL_curstname);
3127 name = SvPV(sv, len);
3128 PL_curstash = gv_stashpvn(name,len,TRUE);
3129 sv_setpvn(PL_curstname, name, len);
3133 sv_setpv(PL_curstname,"<none>");
3134 PL_curstash = Nullhv;
3136 PL_hints |= HINT_BLOCK_SCOPE;
3137 PL_copline = NOLINE;
3142 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3150 if (id->op_type != OP_CONST)
3151 Perl_croak(aTHX_ "Module name must be constant");
3155 if (version != Nullop) {
3156 SV *vesv = ((SVOP*)version)->op_sv;
3158 if (arg == Nullop && !SvNIOKp(vesv)) {
3165 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3166 Perl_croak(aTHX_ "Version number must be constant number");
3168 /* Make copy of id so we don't free it twice */
3169 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3171 /* Fake up a method call to VERSION */
3172 meth = newSVpvn("VERSION",7);
3173 sv_upgrade(meth, SVt_PVIV);
3174 (void)SvIOK_on(meth);
3175 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3176 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3177 append_elem(OP_LIST,
3178 prepend_elem(OP_LIST, pack, list(version)),
3179 newSVOP(OP_METHOD_NAMED, 0, meth)));
3183 /* Fake up an import/unimport */
3184 if (arg && arg->op_type == OP_STUB)
3185 imop = arg; /* no import on explicit () */
3186 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3187 imop = Nullop; /* use 5.0; */
3192 /* Make copy of id so we don't free it twice */
3193 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3195 /* Fake up a method call to import/unimport */
3196 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);;
3197 sv_upgrade(meth, SVt_PVIV);
3198 (void)SvIOK_on(meth);
3199 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3200 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3201 append_elem(OP_LIST,
3202 prepend_elem(OP_LIST, pack, list(arg)),
3203 newSVOP(OP_METHOD_NAMED, 0, meth)));
3206 /* Fake up a require, handle override, if any */
3207 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3208 if (!(gv && GvIMPORTED_CV(gv)))
3209 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3211 if (gv && GvIMPORTED_CV(gv)) {
3212 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3213 append_elem(OP_LIST, id,
3214 scalar(newUNOP(OP_RV2CV, 0,
3219 rqop = newUNOP(OP_REQUIRE, 0, id);
3222 /* Fake up the BEGIN {}, which does its thing immediately. */
3224 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3227 append_elem(OP_LINESEQ,
3228 append_elem(OP_LINESEQ,
3229 newSTATEOP(0, Nullch, rqop),
3230 newSTATEOP(0, Nullch, veop)),
3231 newSTATEOP(0, Nullch, imop) ));
3233 PL_hints |= HINT_BLOCK_SCOPE;
3234 PL_copline = NOLINE;
3239 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3242 va_start(args, ver);
3243 vload_module(flags, name, ver, &args);
3247 #ifdef PERL_IMPLICIT_CONTEXT
3249 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3253 va_start(args, ver);
3254 vload_module(flags, name, ver, &args);
3260 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3262 OP *modname, *veop, *imop;
3264 modname = newSVOP(OP_CONST, 0, name);
3265 modname->op_private |= OPpCONST_BARE;
3267 veop = newSVOP(OP_CONST, 0, ver);
3271 if (flags & PERL_LOADMOD_NOIMPORT) {
3272 imop = sawparens(newNULLLIST());
3274 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3275 imop = va_arg(*args, OP*);
3280 sv = va_arg(*args, SV*);
3282 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3283 sv = va_arg(*args, SV*);
3287 line_t ocopline = PL_copline;
3288 int oexpect = PL_expect;
3290 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3291 veop, modname, imop);
3292 PL_expect = oexpect;
3293 PL_copline = ocopline;
3298 Perl_dofile(pTHX_ OP *term)
3303 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3304 if (!(gv && GvIMPORTED_CV(gv)))
3305 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3307 if (gv && GvIMPORTED_CV(gv)) {
3308 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3309 append_elem(OP_LIST, term,
3310 scalar(newUNOP(OP_RV2CV, 0,
3315 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3321 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3323 return newBINOP(OP_LSLICE, flags,
3324 list(force_list(subscript)),
3325 list(force_list(listval)) );
3329 S_list_assignment(pTHX_ register OP *o)
3334 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3335 o = cUNOPo->op_first;
3337 if (o->op_type == OP_COND_EXPR) {
3338 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3339 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3344 yyerror("Assignment to both a list and a scalar");
3348 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3349 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3350 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3353 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3356 if (o->op_type == OP_RV2SV)
3363 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3368 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3369 return newLOGOP(optype, 0,
3370 mod(scalar(left), optype),
3371 newUNOP(OP_SASSIGN, 0, scalar(right)));
3374 return newBINOP(optype, OPf_STACKED,
3375 mod(scalar(left), optype), scalar(right));
3379 if (list_assignment(left)) {
3383 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3384 left = mod(left, OP_AASSIGN);
3392 curop = list(force_list(left));
3393 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3394 o->op_private = 0 | (flags >> 8);
3395 for (curop = ((LISTOP*)curop)->op_first;
3396 curop; curop = curop->op_sibling)
3398 if (curop->op_type == OP_RV2HV &&
3399 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3400 o->op_private |= OPpASSIGN_HASH;
3404 if (!(left->op_private & OPpLVAL_INTRO)) {
3407 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3408 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3409 if (curop->op_type == OP_GV) {
3410 GV *gv = cGVOPx_gv(curop);
3411 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3413 SvCUR(gv) = PL_generation;
3415 else if (curop->op_type == OP_PADSV ||
3416 curop->op_type == OP_PADAV ||
3417 curop->op_type == OP_PADHV ||
3418 curop->op_type == OP_PADANY) {
3419 SV **svp = AvARRAY(PL_comppad_name);
3420 SV *sv = svp[curop->op_targ];
3421 if (SvCUR(sv) == PL_generation)
3423 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3425 else if (curop->op_type == OP_RV2CV)
3427 else if (curop->op_type == OP_RV2SV ||
3428 curop->op_type == OP_RV2AV ||
3429 curop->op_type == OP_RV2HV ||
3430 curop->op_type == OP_RV2GV) {
3431 if (lastop->op_type != OP_GV) /* funny deref? */
3434 else if (curop->op_type == OP_PUSHRE) {
3435 if (((PMOP*)curop)->op_pmreplroot) {
3437 GV *gv = (GV*)PL_curpad[(PADOFFSET)((PMOP*)curop)->op_pmreplroot];
3439 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3441 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3443 SvCUR(gv) = PL_generation;
3452 o->op_private |= OPpASSIGN_COMMON;
3454 if (right && right->op_type == OP_SPLIT) {
3456 if ((tmpop = ((LISTOP*)right)->op_first) &&
3457 tmpop->op_type == OP_PUSHRE)
3459 PMOP *pm = (PMOP*)tmpop;
3460 if (left->op_type == OP_RV2AV &&
3461 !(left->op_private & OPpLVAL_INTRO) &&
3462 !(o->op_private & OPpASSIGN_COMMON) )
3464 tmpop = ((UNOP*)left)->op_first;
3465 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3467 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3468 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3470 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3471 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3473 pm->op_pmflags |= PMf_ONCE;
3474 tmpop = cUNOPo->op_first; /* to list (nulled) */
3475 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3476 tmpop->op_sibling = Nullop; /* don't free split */
3477 right->op_next = tmpop->op_next; /* fix starting loc */
3478 op_free(o); /* blow off assign */
3479 right->op_flags &= ~OPf_WANT;
3480 /* "I don't know and I don't care." */
3485 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
3486 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3488 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3490 sv_setiv(sv, PL_modcount+1);
3498 right = newOP(OP_UNDEF, 0);
3499 if (right->op_type == OP_READLINE) {
3500 right->op_flags |= OPf_STACKED;
3501 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3504 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3505 o = newBINOP(OP_SASSIGN, flags,
3506 scalar(right), mod(scalar(left), OP_SASSIGN) );
3518 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3520 U32 seq = intro_my();
3523 NewOp(1101, cop, 1, COP);
3524 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3525 cop->op_type = OP_DBSTATE;
3526 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3529 cop->op_type = OP_NEXTSTATE;
3530 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3532 cop->op_flags = flags;
3533 cop->op_private = (PL_hints & (HINT_BYTE|HINT_LOCALE));
3535 cop->op_private |= NATIVE_HINTS;
3537 PL_compiling.op_private = cop->op_private;
3538 cop->op_next = (OP*)cop;
3541 cop->cop_label = label;
3542 PL_hints |= HINT_BLOCK_SCOPE;
3545 cop->cop_arybase = PL_curcop->cop_arybase;
3546 if (specialWARN(PL_curcop->cop_warnings))
3547 cop->cop_warnings = PL_curcop->cop_warnings ;
3549 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3552 if (PL_copline == NOLINE)
3553 CopLINE_set(cop, CopLINE(PL_curcop));
3555 CopLINE_set(cop, PL_copline);
3556 PL_copline = NOLINE;
3559 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
3561 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
3563 CopSTASH_set(cop, PL_curstash);
3565 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3566 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3567 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3568 (void)SvIOK_on(*svp);
3569 SvIVX(*svp) = PTR2IV(cop);
3573 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3576 /* "Introduce" my variables to visible status. */
3584 if (! PL_min_intro_pending)
3585 return PL_cop_seqmax;
3587 svp = AvARRAY(PL_comppad_name);
3588 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3589 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3590 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3591 SvNVX(sv) = (NV)PL_cop_seqmax;
3594 PL_min_intro_pending = 0;
3595 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3596 return PL_cop_seqmax++;
3600 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3602 return new_logop(type, flags, &first, &other);
3606 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3610 OP *first = *firstp;
3611 OP *other = *otherp;
3613 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3614 return newBINOP(type, flags, scalar(first), scalar(other));
3616 scalarboolean(first);
3617 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3618 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3619 if (type == OP_AND || type == OP_OR) {
3625 first = *firstp = cUNOPo->op_first;
3627 first->op_next = o->op_next;
3628 cUNOPo->op_first = Nullop;
3632 if (first->op_type == OP_CONST) {
3633 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3634 Perl_warner(aTHX_ WARN_BAREWORD, "Bareword found in conditional");
3635 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3646 else if (first->op_type == OP_WANTARRAY) {
3652 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3653 OP *k1 = ((UNOP*)first)->op_first;
3654 OP *k2 = k1->op_sibling;
3656 switch (first->op_type)
3659 if (k2 && k2->op_type == OP_READLINE
3660 && (k2->op_flags & OPf_STACKED)
3661 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3663 warnop = k2->op_type;
3668 if (k1->op_type == OP_READDIR
3669 || k1->op_type == OP_GLOB
3670 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3671 || k1->op_type == OP_EACH)
3673 warnop = ((k1->op_type == OP_NULL)
3674 ? k1->op_targ : k1->op_type);
3679 line_t oldline = CopLINE(PL_curcop);
3680 CopLINE_set(PL_curcop, PL_copline);
3681 Perl_warner(aTHX_ WARN_MISC,
3682 "Value of %s%s can be \"0\"; test with defined()",
3684 ((warnop == OP_READLINE || warnop == OP_GLOB)
3685 ? " construct" : "() operator"));
3686 CopLINE_set(PL_curcop, oldline);
3693 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3694 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3696 NewOp(1101, logop, 1, LOGOP);
3698 logop->op_type = type;
3699 logop->op_ppaddr = PL_ppaddr[type];
3700 logop->op_first = first;
3701 logop->op_flags = flags | OPf_KIDS;
3702 logop->op_other = LINKLIST(other);
3703 logop->op_private = 1 | (flags >> 8);
3705 /* establish postfix order */
3706 logop->op_next = LINKLIST(first);
3707 first->op_next = (OP*)logop;
3708 first->op_sibling = other;
3710 o = newUNOP(OP_NULL, 0, (OP*)logop);
3717 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3724 return newLOGOP(OP_AND, 0, first, trueop);
3726 return newLOGOP(OP_OR, 0, first, falseop);
3728 scalarboolean(first);
3729 if (first->op_type == OP_CONST) {
3730 if (SvTRUE(((SVOP*)first)->op_sv)) {
3741 else if (first->op_type == OP_WANTARRAY) {
3745 NewOp(1101, logop, 1, LOGOP);
3746 logop->op_type = OP_COND_EXPR;
3747 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3748 logop->op_first = first;
3749 logop->op_flags = flags | OPf_KIDS;
3750 logop->op_private = 1 | (flags >> 8);
3751 logop->op_other = LINKLIST(trueop);
3752 logop->op_next = LINKLIST(falseop);
3755 /* establish postfix order */
3756 start = LINKLIST(first);
3757 first->op_next = (OP*)logop;
3759 first->op_sibling = trueop;
3760 trueop->op_sibling = falseop;
3761 o = newUNOP(OP_NULL, 0, (OP*)logop);
3763 trueop->op_next = falseop->op_next = o;
3770 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3778 NewOp(1101, range, 1, LOGOP);
3780 range->op_type = OP_RANGE;
3781 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3782 range->op_first = left;
3783 range->op_flags = OPf_KIDS;
3784 leftstart = LINKLIST(left);
3785 range->op_other = LINKLIST(right);
3786 range->op_private = 1 | (flags >> 8);
3788 left->op_sibling = right;
3790 range->op_next = (OP*)range;
3791 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3792 flop = newUNOP(OP_FLOP, 0, flip);
3793 o = newUNOP(OP_NULL, 0, flop);
3795 range->op_next = leftstart;
3797 left->op_next = flip;
3798 right->op_next = flop;
3800 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3801 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3802 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3803 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3805 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3806 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3809 if (!flip->op_private || !flop->op_private)
3810 linklist(o); /* blow off optimizer unless constant */
3816 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3820 int once = block && block->op_flags & OPf_SPECIAL &&
3821 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3824 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3825 return block; /* do {} while 0 does once */
3826 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3827 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3828 expr = newUNOP(OP_DEFINED, 0,
3829 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3830 } else if (expr->op_flags & OPf_KIDS) {
3831 OP *k1 = ((UNOP*)expr)->op_first;
3832 OP *k2 = (k1) ? k1->op_sibling : NULL;
3833 switch (expr->op_type) {
3835 if (k2 && k2->op_type == OP_READLINE
3836 && (k2->op_flags & OPf_STACKED)
3837 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3838 expr = newUNOP(OP_DEFINED, 0, expr);
3842 if (k1->op_type == OP_READDIR
3843 || k1->op_type == OP_GLOB
3844 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3845 || k1->op_type == OP_EACH)
3846 expr = newUNOP(OP_DEFINED, 0, expr);
3852 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3853 o = new_logop(OP_AND, 0, &expr, &listop);
3856 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3858 if (once && o != listop)
3859 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3862 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3864 o->op_flags |= flags;
3866 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3871 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3880 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3881 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3882 expr = newUNOP(OP_DEFINED, 0,
3883 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3884 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3885 OP *k1 = ((UNOP*)expr)->op_first;
3886 OP *k2 = (k1) ? k1->op_sibling : NULL;
3887 switch (expr->op_type) {
3889 if (k2 && k2->op_type == OP_READLINE
3890 && (k2->op_flags & OPf_STACKED)
3891 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3892 expr = newUNOP(OP_DEFINED, 0, expr);
3896 if (k1->op_type == OP_READDIR
3897 || k1->op_type == OP_GLOB
3898 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3899 || k1->op_type == OP_EACH)
3900 expr = newUNOP(OP_DEFINED, 0, expr);
3906 block = newOP(OP_NULL, 0);
3908 block = scope(block);
3912 next = LINKLIST(cont);
3915 OP *unstack = newOP(OP_UNSTACK, 0);
3918 cont = append_elem(OP_LINESEQ, cont, unstack);
3919 if ((line_t)whileline != NOLINE) {
3920 PL_copline = whileline;
3921 cont = append_elem(OP_LINESEQ, cont,
3922 newSTATEOP(0, Nullch, Nullop));
3926 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3927 redo = LINKLIST(listop);
3930 PL_copline = whileline;
3932 o = new_logop(OP_AND, 0, &expr, &listop);
3933 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3934 op_free(expr); /* oops, it's a while (0) */
3936 return Nullop; /* listop already freed by new_logop */
3939 ((LISTOP*)listop)->op_last->op_next = condop =
3940 (o == listop ? redo : LINKLIST(o));
3946 NewOp(1101,loop,1,LOOP);
3947 loop->op_type = OP_ENTERLOOP;
3948 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3949 loop->op_private = 0;
3950 loop->op_next = (OP*)loop;
3953 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3955 loop->op_redoop = redo;
3956 loop->op_lastop = o;
3957 o->op_private |= loopflags;
3960 loop->op_nextop = next;
3962 loop->op_nextop = o;
3964 o->op_flags |= flags;
3965 o->op_private |= (flags >> 8);
3970 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3978 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3979 sv->op_type = OP_RV2GV;
3980 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3982 else if (sv->op_type == OP_PADSV) { /* private variable */
3983 padoff = sv->op_targ;
3988 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3989 padoff = sv->op_targ;
3991 iterflags |= OPf_SPECIAL;
3996 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
4000 padoff = find_threadsv("_");
4001 iterflags |= OPf_SPECIAL;
4003 sv = newGVOP(OP_GV, 0, PL_defgv);
4006 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
4007 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
4008 iterflags |= OPf_STACKED;
4010 else if (expr->op_type == OP_NULL &&
4011 (expr->op_flags & OPf_KIDS) &&
4012 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
4014 /* Basically turn for($x..$y) into the same as for($x,$y), but we
4015 * set the STACKED flag to indicate that these values are to be
4016 * treated as min/max values by 'pp_iterinit'.
4018 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
4019 LOGOP* range = (LOGOP*) flip->op_first;
4020 OP* left = range->op_first;
4021 OP* right = left->op_sibling;
4024 range->op_flags &= ~OPf_KIDS;
4025 range->op_first = Nullop;
4027 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
4028 listop->op_first->op_next = range->op_next;
4029 left->op_next = range->op_other;
4030 right->op_next = (OP*)listop;
4031 listop->op_next = listop->op_first;
4034 expr = (OP*)(listop);
4036 iterflags |= OPf_STACKED;
4039 expr = mod(force_list(expr), OP_GREPSTART);
4043 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
4044 append_elem(OP_LIST, expr, scalar(sv))));
4045 assert(!loop->op_next);
4046 #ifdef PL_OP_SLAB_ALLOC
4049 NewOp(1234,tmp,1,LOOP);
4050 Copy(loop,tmp,1,LOOP);
4054 Renew(loop, 1, LOOP);
4056 loop->op_targ = padoff;
4057 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
4058 PL_copline = forline;
4059 return newSTATEOP(0, label, wop);
4063 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4068 if (type != OP_GOTO || label->op_type == OP_CONST) {
4069 /* "last()" means "last" */
4070 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4071 o = newOP(type, OPf_SPECIAL);
4073 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
4074 ? SvPVx(((SVOP*)label)->op_sv, n_a)
4080 if (label->op_type == OP_ENTERSUB)
4081 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4082 o = newUNOP(type, OPf_STACKED, label);
4084 PL_hints |= HINT_BLOCK_SCOPE;
4089 Perl_cv_undef(pTHX_ CV *cv)
4093 MUTEX_DESTROY(CvMUTEXP(cv));
4094 Safefree(CvMUTEXP(cv));
4097 #endif /* USE_THREADS */
4099 if (!CvXSUB(cv) && CvROOT(cv)) {
4101 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4102 Perl_croak(aTHX_ "Can't undef active subroutine");
4105 Perl_croak(aTHX_ "Can't undef active subroutine");
4106 #endif /* USE_THREADS */
4109 SAVEVPTR(PL_curpad);
4112 op_free(CvROOT(cv));
4113 CvROOT(cv) = Nullop;
4116 SvPOK_off((SV*)cv); /* forget prototype */
4118 /* Since closure prototypes have the same lifetime as the containing
4119 * CV, they don't hold a refcount on the outside CV. This avoids
4120 * the refcount loop between the outer CV (which keeps a refcount to
4121 * the closure prototype in the pad entry for pp_anoncode()) and the
4122 * closure prototype, and the ensuing memory leak. This does not
4123 * apply to closures generated within eval"", since eval"" CVs are
4124 * ephemeral. --GSAR */
4125 if (!CvANON(cv) || CvCLONED(cv)
4126 || (CvOUTSIDE(cv) && SvTYPE(CvOUTSIDE(cv)) == SVt_PVCV
4127 && CvEVAL(CvOUTSIDE(cv)) && !CvGV(CvOUTSIDE(cv))))
4129 SvREFCNT_dec(CvOUTSIDE(cv));
4131 CvOUTSIDE(cv) = Nullcv;
4132 if (CvPADLIST(cv)) {
4133 /* may be during global destruction */
4134 if (SvREFCNT(CvPADLIST(cv))) {
4135 I32 i = AvFILLp(CvPADLIST(cv));
4137 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4138 SV* sv = svp ? *svp : Nullsv;
4141 if (sv == (SV*)PL_comppad_name)
4142 PL_comppad_name = Nullav;
4143 else if (sv == (SV*)PL_comppad) {
4144 PL_comppad = Nullav;
4145 PL_curpad = Null(SV**);
4149 SvREFCNT_dec((SV*)CvPADLIST(cv));
4151 CvPADLIST(cv) = Nullav;
4157 S_cv_dump(pTHX_ CV *cv)
4160 CV *outside = CvOUTSIDE(cv);
4161 AV* padlist = CvPADLIST(cv);
4168 PerlIO_printf(Perl_debug_log,
4169 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4171 (CvANON(cv) ? "ANON"
4172 : (cv == PL_main_cv) ? "MAIN"
4173 : CvUNIQUE(cv) ? "UNIQUE"
4174 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4177 : CvANON(outside) ? "ANON"
4178 : (outside == PL_main_cv) ? "MAIN"
4179 : CvUNIQUE(outside) ? "UNIQUE"
4180 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4185 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4186 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4187 pname = AvARRAY(pad_name);
4188 ppad = AvARRAY(pad);
4190 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4191 if (SvPOK(pname[ix]))
4192 PerlIO_printf(Perl_debug_log,
4193 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4194 (int)ix, PTR2UV(ppad[ix]),
4195 SvFAKE(pname[ix]) ? "FAKE " : "",
4197 (IV)I_32(SvNVX(pname[ix])),
4200 #endif /* DEBUGGING */
4204 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4208 AV* protopadlist = CvPADLIST(proto);
4209 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4210 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4211 SV** pname = AvARRAY(protopad_name);
4212 SV** ppad = AvARRAY(protopad);
4213 I32 fname = AvFILLp(protopad_name);
4214 I32 fpad = AvFILLp(protopad);
4218 assert(!CvUNIQUE(proto));
4222 SAVESPTR(PL_comppad_name);
4223 SAVESPTR(PL_compcv);
4225 cv = PL_compcv = (CV*)NEWSV(1104,0);
4226 sv_upgrade((SV *)cv, SvTYPE(proto));
4227 CvFLAGS(cv) = CvFLAGS(proto) & ~CVf_CLONE;
4231 New(666, CvMUTEXP(cv), 1, perl_mutex);
4232 MUTEX_INIT(CvMUTEXP(cv));
4234 #endif /* USE_THREADS */
4235 CvFILE(cv) = CvFILE(proto);
4236 CvGV(cv) = CvGV(proto);
4237 CvSTASH(cv) = CvSTASH(proto);
4238 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
4239 CvSTART(cv) = CvSTART(proto);
4241 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4244 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4246 PL_comppad_name = newAV();
4247 for (ix = fname; ix >= 0; ix--)
4248 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4250 PL_comppad = newAV();
4252 comppadlist = newAV();
4253 AvREAL_off(comppadlist);
4254 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4255 av_store(comppadlist, 1, (SV*)PL_comppad);
4256 CvPADLIST(cv) = comppadlist;
4257 av_fill(PL_comppad, AvFILLp(protopad));
4258 PL_curpad = AvARRAY(PL_comppad);
4260 av = newAV(); /* will be @_ */
4262 av_store(PL_comppad, 0, (SV*)av);
4263 AvFLAGS(av) = AVf_REIFY;
4265 for (ix = fpad; ix > 0; ix--) {
4266 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4267 if (namesv && namesv != &PL_sv_undef) {
4268 char *name = SvPVX(namesv); /* XXX */
4269 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4270 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4271 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4273 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4275 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4277 else { /* our own lexical */
4280 /* anon code -- we'll come back for it */
4281 sv = SvREFCNT_inc(ppad[ix]);
4283 else if (*name == '@')
4285 else if (*name == '%')
4294 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4295 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4298 SV* sv = NEWSV(0,0);
4304 /* Now that vars are all in place, clone nested closures. */
4306 for (ix = fpad; ix > 0; ix--) {
4307 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4309 && namesv != &PL_sv_undef
4310 && !(SvFLAGS(namesv) & SVf_FAKE)
4311 && *SvPVX(namesv) == '&'
4312 && CvCLONE(ppad[ix]))
4314 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4315 SvREFCNT_dec(ppad[ix]);
4318 PL_curpad[ix] = (SV*)kid;
4322 #ifdef DEBUG_CLOSURES
4323 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4325 PerlIO_printf(Perl_debug_log, " from:\n");
4327 PerlIO_printf(Perl_debug_log, " to:\n");
4336 Perl_cv_clone(pTHX_ CV *proto)
4339 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4340 cv = cv_clone2(proto, CvOUTSIDE(proto));
4341 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4346 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4348 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4349 SV* msg = sv_newmortal();
4353 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4354 sv_setpv(msg, "Prototype mismatch:");
4356 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4358 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4359 sv_catpv(msg, " vs ");
4361 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4363 sv_catpv(msg, "none");
4364 Perl_warner(aTHX_ WARN_PROTOTYPE, "%"SVf, msg);
4369 Perl_cv_const_sv(pTHX_ CV *cv)
4371 if (!cv || !SvPOK(cv) || SvCUR(cv))
4373 return op_const_sv(CvSTART(cv), cv);
4377 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4384 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4385 o = cLISTOPo->op_first->op_sibling;
4387 for (; o; o = o->op_next) {
4388 OPCODE type = o->op_type;
4390 if (sv && o->op_next == o)
4392 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4394 if (type == OP_LEAVESUB || type == OP_RETURN)
4398 if (type == OP_CONST && cSVOPo->op_sv)
4400 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4401 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4402 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4403 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4415 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4425 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4429 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4431 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4435 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4441 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4445 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4446 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4447 SV *sv = sv_newmortal();
4448 Perl_sv_setpvf(aTHX_ sv, "__ANON__[%s:%"IVdf"]",
4449 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4454 gv = gv_fetchpv(name ? name : (aname ? aname : "__ANON__"),
4455 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4465 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4466 maximum a prototype before. */
4467 if (SvTYPE(gv) > SVt_NULL) {
4468 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4469 && ckWARN_d(WARN_PROTOTYPE))
4471 Perl_warner(aTHX_ WARN_PROTOTYPE, "Runaway prototype");
4473 cv_ckproto((CV*)gv, NULL, ps);
4476 sv_setpv((SV*)gv, ps);
4478 sv_setiv((SV*)gv, -1);
4479 SvREFCNT_dec(PL_compcv);
4480 cv = PL_compcv = NULL;
4481 PL_sub_generation++;
4485 if (!name || GvCVGEN(gv))
4487 else if ((cv = GvCV(gv))) {
4488 cv_ckproto(cv, gv, ps);
4489 /* already defined (or promised)? */
4490 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4492 bool const_changed = TRUE;
4493 if (!block && !attrs) {
4494 /* just a "sub foo;" when &foo is already defined */
4495 SAVEFREESV(PL_compcv);
4498 /* ahem, death to those who redefine active sort subs */
4499 if (PL_curstackinfo->si_type == PERLSI_SORT &&
4500 PL_sortcop == CvSTART(cv)) {
4502 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4506 if ((const_sv = cv_const_sv(cv)))
4507 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4508 if ((const_sv || const_changed) && ckWARN(WARN_REDEFINE))
4510 line_t oldline = CopLINE(PL_curcop);
4511 CopLINE_set(PL_curcop, PL_copline);
4512 Perl_warner(aTHX_ WARN_REDEFINE,
4513 const_sv ? "Constant subroutine %s redefined"
4514 : "Subroutine %s redefined", name);
4515 CopLINE_set(PL_curcop, oldline);
4526 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4527 * before we clobber PL_compcv.
4531 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4532 stash = GvSTASH(CvGV(cv));
4533 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4534 stash = CvSTASH(cv);
4536 stash = PL_curstash;
4539 /* possibly about to re-define existing subr -- ignore old cv */
4540 rcv = (SV*)PL_compcv;
4541 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4542 stash = GvSTASH(gv);
4544 stash = PL_curstash;
4546 apply_attrs(stash, rcv, attrs);
4548 if (cv) { /* must reuse cv if autoloaded */
4550 /* got here with just attrs -- work done, so bug out */
4551 SAVEFREESV(PL_compcv);
4555 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4556 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4557 CvOUTSIDE(PL_compcv) = 0;
4558 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4559 CvPADLIST(PL_compcv) = 0;
4560 /* inner references to PL_compcv must be fixed up ... */
4562 AV *padlist = CvPADLIST(cv);
4563 AV *comppad_name = (AV*)AvARRAY(padlist)[0];
4564 AV *comppad = (AV*)AvARRAY(padlist)[1];
4565 SV **namepad = AvARRAY(comppad_name);
4566 SV **curpad = AvARRAY(comppad);
4567 for (ix = AvFILLp(comppad_name); ix > 0; ix--) {
4568 SV *namesv = namepad[ix];
4569 if (namesv && namesv != &PL_sv_undef
4570 && *SvPVX(namesv) == '&')
4572 CV *innercv = (CV*)curpad[ix];
4573 if (CvOUTSIDE(innercv) == PL_compcv) {
4574 CvOUTSIDE(innercv) = cv;
4575 if (!CvANON(innercv) || CvCLONED(innercv)) {
4576 (void)SvREFCNT_inc(cv);
4577 SvREFCNT_dec(PL_compcv);
4583 /* ... before we throw it away */
4584 SvREFCNT_dec(PL_compcv);
4591 PL_sub_generation++;
4595 CvFILE(cv) = CopFILE(PL_curcop);
4596 CvSTASH(cv) = PL_curstash;
4599 if (!CvMUTEXP(cv)) {
4600 New(666, CvMUTEXP(cv), 1, perl_mutex);
4601 MUTEX_INIT(CvMUTEXP(cv));
4603 #endif /* USE_THREADS */
4606 sv_setpv((SV*)cv, ps);
4608 if (PL_error_count) {
4612 char *s = strrchr(name, ':');
4614 if (strEQ(s, "BEGIN")) {
4616 "BEGIN not safe after errors--compilation aborted";
4617 if (PL_in_eval & EVAL_KEEPERR)
4618 Perl_croak(aTHX_ not_safe);
4620 /* force display of errors found but not reported */
4621 sv_catpv(ERRSV, not_safe);
4622 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4629 PL_copline = NOLINE;
4634 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4635 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4638 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0,
4639 mod(scalarseq(block), OP_LEAVESUBLV));
4642 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4644 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4645 OpREFCNT_set(CvROOT(cv), 1);
4646 CvSTART(cv) = LINKLIST(CvROOT(cv));
4647 CvROOT(cv)->op_next = 0;
4650 /* now that optimizer has done its work, adjust pad values */
4652 SV **namep = AvARRAY(PL_comppad_name);
4653 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4656 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4659 * The only things that a clonable function needs in its
4660 * pad are references to outer lexicals and anonymous subs.
4661 * The rest are created anew during cloning.
4663 if (!((namesv = namep[ix]) != Nullsv &&
4664 namesv != &PL_sv_undef &&
4666 *SvPVX(namesv) == '&')))
4668 SvREFCNT_dec(PL_curpad[ix]);
4669 PL_curpad[ix] = Nullsv;
4674 AV *av = newAV(); /* Will be @_ */
4676 av_store(PL_comppad, 0, (SV*)av);
4677 AvFLAGS(av) = AVf_REIFY;
4679 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4680 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4682 if (!SvPADMY(PL_curpad[ix]))
4683 SvPADTMP_on(PL_curpad[ix]);
4687 /* If a potential closure prototype, don't keep a refcount on
4688 * outer CV, unless the latter happens to be a passing eval"".
4689 * This is okay as the lifetime of the prototype is tied to the
4690 * lifetime of the outer CV. Avoids memory leak due to reference
4692 if (!name && CvOUTSIDE(cv)
4693 && !(SvTYPE(CvOUTSIDE(cv)) == SVt_PVCV
4694 && CvEVAL(CvOUTSIDE(cv)) && !CvGV(CvOUTSIDE(cv))))
4696 SvREFCNT_dec(CvOUTSIDE(cv));
4699 if (name || aname) {
4701 char *tname = (name ? name : aname);
4703 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4704 SV *sv = NEWSV(0,0);
4705 SV *tmpstr = sv_newmortal();
4706 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4710 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4712 (long)PL_subline, (long)CopLINE(PL_curcop));
4713 gv_efullname3(tmpstr, gv, Nullch);
4714 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4715 hv = GvHVn(db_postponed);
4716 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4717 && (pcv = GvCV(db_postponed)))
4723 call_sv((SV*)pcv, G_DISCARD);
4727 if ((s = strrchr(tname,':')))
4732 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4735 if (strEQ(s, "BEGIN")) {
4736 I32 oldscope = PL_scopestack_ix;
4738 SAVECOPFILE(&PL_compiling);
4739 SAVECOPLINE(&PL_compiling);
4741 sv_setsv(PL_rs, PL_nrs);
4744 PL_beginav = newAV();
4745 DEBUG_x( dump_sub(gv) );
4746 av_push(PL_beginav, (SV*)cv);
4747 GvCV(gv) = 0; /* cv has been hijacked */
4748 call_list(oldscope, PL_beginav);
4750 PL_curcop = &PL_compiling;
4751 PL_compiling.op_private = PL_hints;
4754 else if (strEQ(s, "END") && !PL_error_count) {
4757 DEBUG_x( dump_sub(gv) );
4758 av_unshift(PL_endav, 1);
4759 av_store(PL_endav, 0, (SV*)cv);
4760 GvCV(gv) = 0; /* cv has been hijacked */
4762 else if (strEQ(s, "CHECK") && !PL_error_count) {
4764 PL_checkav = newAV();
4765 DEBUG_x( dump_sub(gv) );
4766 if (PL_main_start && ckWARN(WARN_VOID))
4767 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4768 av_unshift(PL_checkav, 1);
4769 av_store(PL_checkav, 0, (SV*)cv);
4770 GvCV(gv) = 0; /* cv has been hijacked */
4772 else if (strEQ(s, "INIT") && !PL_error_count) {
4774 PL_initav = newAV();
4775 DEBUG_x( dump_sub(gv) );
4776 if (PL_main_start && ckWARN(WARN_VOID))
4777 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4778 av_push(PL_initav, (SV*)cv);
4779 GvCV(gv) = 0; /* cv has been hijacked */
4784 PL_copline = NOLINE;
4789 /* XXX unsafe for threads if eval_owner isn't held */
4791 =for apidoc newCONSTSUB
4793 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4794 eligible for inlining at compile-time.
4800 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4805 SAVECOPLINE(PL_curcop);
4806 CopLINE_set(PL_curcop, PL_copline);
4809 PL_hints &= ~HINT_BLOCK_SCOPE;
4812 SAVESPTR(PL_curstash);
4813 SAVECOPSTASH(PL_curcop);
4814 PL_curstash = stash;
4816 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4818 CopSTASH(PL_curcop) = stash;
4823 start_subparse(FALSE, 0),
4824 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4825 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4827 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4834 =for apidoc U||newXS
4836 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4842 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4844 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4847 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4849 /* just a cached method */
4853 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4854 /* already defined (or promised) */
4855 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4856 && HvNAME(GvSTASH(CvGV(cv)))
4857 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4858 line_t oldline = CopLINE(PL_curcop);
4859 if (PL_copline != NOLINE)
4860 CopLINE_set(PL_curcop, PL_copline);
4861 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4862 CopLINE_set(PL_curcop, oldline);
4869 if (cv) /* must reuse cv if autoloaded */
4872 cv = (CV*)NEWSV(1105,0);
4873 sv_upgrade((SV *)cv, SVt_PVCV);
4877 PL_sub_generation++;
4882 New(666, CvMUTEXP(cv), 1, perl_mutex);
4883 MUTEX_INIT(CvMUTEXP(cv));
4885 #endif /* USE_THREADS */
4886 (void)gv_fetchfile(filename);
4887 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4888 an external constant string */
4889 CvXSUB(cv) = subaddr;
4892 char *s = strrchr(name,':');
4898 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4901 if (strEQ(s, "BEGIN")) {
4903 PL_beginav = newAV();
4904 av_push(PL_beginav, (SV*)cv);
4905 GvCV(gv) = 0; /* cv has been hijacked */
4907 else if (strEQ(s, "END")) {
4910 av_unshift(PL_endav, 1);
4911 av_store(PL_endav, 0, (SV*)cv);
4912 GvCV(gv) = 0; /* cv has been hijacked */
4914 else if (strEQ(s, "CHECK")) {
4916 PL_checkav = newAV();
4917 if (PL_main_start && ckWARN(WARN_VOID))
4918 Perl_warner(aTHX_ WARN_VOID, "Too late to run CHECK block");
4919 av_unshift(PL_checkav, 1);
4920 av_store(PL_checkav, 0, (SV*)cv);
4921 GvCV(gv) = 0; /* cv has been hijacked */
4923 else if (strEQ(s, "INIT")) {
4925 PL_initav = newAV();
4926 if (PL_main_start && ckWARN(WARN_VOID))
4927 Perl_warner(aTHX_ WARN_VOID, "Too late to run INIT block");
4928 av_push(PL_initav, (SV*)cv);
4929 GvCV(gv) = 0; /* cv has been hijacked */
4940 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4949 name = SvPVx(cSVOPo->op_sv, n_a);
4952 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4954 if ((cv = GvFORM(gv))) {
4955 if (ckWARN(WARN_REDEFINE)) {
4956 line_t oldline = CopLINE(PL_curcop);
4958 CopLINE_set(PL_curcop, PL_copline);
4959 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4960 CopLINE_set(PL_curcop, oldline);
4967 CvFILE(cv) = CopFILE(PL_curcop);
4969 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4970 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4971 SvPADTMP_on(PL_curpad[ix]);
4974 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4975 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4976 OpREFCNT_set(CvROOT(cv), 1);
4977 CvSTART(cv) = LINKLIST(CvROOT(cv));
4978 CvROOT(cv)->op_next = 0;
4981 PL_copline = NOLINE;
4986 Perl_newANONLIST(pTHX_ OP *o)
4988 return newUNOP(OP_REFGEN, 0,
4989 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4993 Perl_newANONHASH(pTHX_ OP *o)
4995 return newUNOP(OP_REFGEN, 0,
4996 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
5000 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
5002 return newANONATTRSUB(floor, proto, Nullop, block);
5006 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
5008 return newUNOP(OP_REFGEN, 0,
5009 newSVOP(OP_ANONCODE, 0,
5010 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
5014 Perl_oopsAV(pTHX_ OP *o)
5016 switch (o->op_type) {
5018 o->op_type = OP_PADAV;
5019 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5020 return ref(o, OP_RV2AV);
5023 o->op_type = OP_RV2AV;
5024 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
5029 if (ckWARN_d(WARN_INTERNAL))
5030 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
5037 Perl_oopsHV(pTHX_ OP *o)
5039 switch (o->op_type) {
5042 o->op_type = OP_PADHV;
5043 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5044 return ref(o, OP_RV2HV);
5048 o->op_type = OP_RV2HV;
5049 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
5054 if (ckWARN_d(WARN_INTERNAL))
5055 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
5062 Perl_newAVREF(pTHX_ OP *o)
5064 if (o->op_type == OP_PADANY) {
5065 o->op_type = OP_PADAV;
5066 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5069 return newUNOP(OP_RV2AV, 0, scalar(o));
5073 Perl_newGVREF(pTHX_ I32 type, OP *o)
5075 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
5076 return newUNOP(OP_NULL, 0, o);
5077 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
5081 Perl_newHVREF(pTHX_ OP *o)
5083 if (o->op_type == OP_PADANY) {
5084 o->op_type = OP_PADHV;
5085 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5088 return newUNOP(OP_RV2HV, 0, scalar(o));
5092 Perl_oopsCV(pTHX_ OP *o)
5094 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5100 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5102 return newUNOP(OP_RV2CV, flags, scalar(o));
5106 Perl_newSVREF(pTHX_ OP *o)
5108 if (o->op_type == OP_PADANY) {
5109 o->op_type = OP_PADSV;
5110 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5113 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
5114 o->op_flags |= OPpDONE_SVREF;
5117 return newUNOP(OP_RV2SV, 0, scalar(o));
5120 /* Check routines. */
5123 Perl_ck_anoncode(pTHX_ OP *o)
5128 name = NEWSV(1106,0);
5129 sv_upgrade(name, SVt_PVNV);
5130 sv_setpvn(name, "&", 1);
5133 ix = pad_alloc(o->op_type, SVs_PADMY);
5134 av_store(PL_comppad_name, ix, name);
5135 av_store(PL_comppad, ix, cSVOPo->op_sv);
5136 SvPADMY_on(cSVOPo->op_sv);
5137 cSVOPo->op_sv = Nullsv;
5138 cSVOPo->op_targ = ix;
5143 Perl_ck_bitop(pTHX_ OP *o)
5145 o->op_private = PL_hints;
5150 Perl_ck_concat(pTHX_ OP *o)
5152 if (cUNOPo->op_first->op_type == OP_CONCAT)
5153 o->op_flags |= OPf_STACKED;
5158 Perl_ck_spair(pTHX_ OP *o)
5160 if (o->op_flags & OPf_KIDS) {
5163 OPCODE type = o->op_type;
5164 o = modkids(ck_fun(o), type);
5165 kid = cUNOPo->op_first;
5166 newop = kUNOP->op_first->op_sibling;
5168 (newop->op_sibling ||
5169 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5170 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5171 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5175 op_free(kUNOP->op_first);
5176 kUNOP->op_first = newop;
5178 o->op_ppaddr = PL_ppaddr[++o->op_type];
5183 Perl_ck_delete(pTHX_ OP *o)
5187 if (o->op_flags & OPf_KIDS) {
5188 OP *kid = cUNOPo->op_first;
5189 switch (kid->op_type) {
5191 o->op_flags |= OPf_SPECIAL;
5194 o->op_private |= OPpSLICE;
5197 o->op_flags |= OPf_SPECIAL;
5202 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5203 PL_op_desc[o->op_type]);
5211 Perl_ck_eof(pTHX_ OP *o)
5213 I32 type = o->op_type;
5215 if (o->op_flags & OPf_KIDS) {
5216 if (cLISTOPo->op_first->op_type == OP_STUB) {
5218 o = newUNOP(type, OPf_SPECIAL,
5219 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5227 Perl_ck_eval(pTHX_ OP *o)
5229 PL_hints |= HINT_BLOCK_SCOPE;
5230 if (o->op_flags & OPf_KIDS) {
5231 SVOP *kid = (SVOP*)cUNOPo->op_first;
5234 o->op_flags &= ~OPf_KIDS;
5237 else if (kid->op_type == OP_LINESEQ) {
5240 kid->op_next = o->op_next;
5241 cUNOPo->op_first = 0;
5244 NewOp(1101, enter, 1, LOGOP);
5245 enter->op_type = OP_ENTERTRY;
5246 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5247 enter->op_private = 0;
5249 /* establish postfix order */
5250 enter->op_next = (OP*)enter;
5252 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5253 o->op_type = OP_LEAVETRY;
5254 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5255 enter->op_other = o;
5263 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5265 o->op_targ = (PADOFFSET)PL_hints;
5270 Perl_ck_exit(pTHX_ OP *o)
5273 HV *table = GvHV(PL_hintgv);
5275 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
5276 if (svp && *svp && SvTRUE(*svp))
5277 o->op_private |= OPpEXIT_VMSISH;
5284 Perl_ck_exec(pTHX_ OP *o)
5287 if (o->op_flags & OPf_STACKED) {
5289 kid = cUNOPo->op_first->op_sibling;
5290 if (kid->op_type == OP_RV2GV)
5299 Perl_ck_exists(pTHX_ OP *o)
5302 if (o->op_flags & OPf_KIDS) {
5303 OP *kid = cUNOPo->op_first;
5304 if (kid->op_type == OP_ENTERSUB) {
5305 (void) ref(kid, o->op_type);
5306 if (kid->op_type != OP_RV2CV && !PL_error_count)
5307 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5308 PL_op_desc[o->op_type]);
5309 o->op_private |= OPpEXISTS_SUB;
5311 else if (kid->op_type == OP_AELEM)
5312 o->op_flags |= OPf_SPECIAL;
5313 else if (kid->op_type != OP_HELEM)
5314 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5315 PL_op_desc[o->op_type]);
5323 Perl_ck_gvconst(pTHX_ register OP *o)
5325 o = fold_constants(o);
5326 if (o->op_type == OP_CONST)
5333 Perl_ck_rvconst(pTHX_ register OP *o)
5335 SVOP *kid = (SVOP*)cUNOPo->op_first;
5337 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5338 if (kid->op_type == OP_CONST) {
5342 SV *kidsv = kid->op_sv;
5345 /* Is it a constant from cv_const_sv()? */
5346 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5347 SV *rsv = SvRV(kidsv);
5348 int svtype = SvTYPE(rsv);
5349 char *badtype = Nullch;
5351 switch (o->op_type) {
5353 if (svtype > SVt_PVMG)
5354 badtype = "a SCALAR";
5357 if (svtype != SVt_PVAV)
5358 badtype = "an ARRAY";
5361 if (svtype != SVt_PVHV) {
5362 if (svtype == SVt_PVAV) { /* pseudohash? */
5363 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5364 if (ksv && SvROK(*ksv)
5365 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5374 if (svtype != SVt_PVCV)
5379 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5382 name = SvPV(kidsv, n_a);
5383 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5384 char *badthing = Nullch;
5385 switch (o->op_type) {
5387 badthing = "a SCALAR";
5390 badthing = "an ARRAY";
5393 badthing = "a HASH";
5398 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5402 * This is a little tricky. We only want to add the symbol if we
5403 * didn't add it in the lexer. Otherwise we get duplicate strict
5404 * warnings. But if we didn't add it in the lexer, we must at
5405 * least pretend like we wanted to add it even if it existed before,
5406 * or we get possible typo warnings. OPpCONST_ENTERED says
5407 * whether the lexer already added THIS instance of this symbol.
5409 iscv = (o->op_type == OP_RV2CV) * 2;
5411 gv = gv_fetchpv(name,
5412 iscv | !(kid->op_private & OPpCONST_ENTERED),
5415 : o->op_type == OP_RV2SV
5417 : o->op_type == OP_RV2AV
5419 : o->op_type == OP_RV2HV
5422 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5424 kid->op_type = OP_GV;
5425 SvREFCNT_dec(kid->op_sv);
5427 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5428 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5429 SvREFCNT_dec(PL_curpad[kPADOP->op_padix]);
5431 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5433 kid->op_sv = SvREFCNT_inc(gv);
5435 kid->op_private = 0;
5436 kid->op_ppaddr = PL_ppaddr[OP_GV];
5443 Perl_ck_ftst(pTHX_ OP *o)
5445 I32 type = o->op_type;
5447 if (o->op_flags & OPf_REF) {
5450 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5451 SVOP *kid = (SVOP*)cUNOPo->op_first;
5453 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5455 OP *newop = newGVOP(type, OPf_REF,
5456 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5463 if (type == OP_FTTTY)
5464 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5467 o = newUNOP(type, 0, newDEFSVOP());
5473 Perl_ck_fun(pTHX_ OP *o)
5479 int type = o->op_type;
5480 register I32 oa = PL_opargs[type] >> OASHIFT;
5482 if (o->op_flags & OPf_STACKED) {
5483 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5486 return no_fh_allowed(o);
5489 if (o->op_flags & OPf_KIDS) {
5491 tokid = &cLISTOPo->op_first;
5492 kid = cLISTOPo->op_first;
5493 if (kid->op_type == OP_PUSHMARK ||
5494 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5496 tokid = &kid->op_sibling;
5497 kid = kid->op_sibling;
5499 if (!kid && PL_opargs[type] & OA_DEFGV)
5500 *tokid = kid = newDEFSVOP();
5504 sibl = kid->op_sibling;
5507 /* list seen where single (scalar) arg expected? */
5508 if (numargs == 1 && !(oa >> 4)
5509 && kid->op_type == OP_LIST && type != OP_SCALAR)
5511 return too_many_arguments(o,PL_op_desc[type]);
5524 if (kid->op_type == OP_CONST &&
5525 (kid->op_private & OPpCONST_BARE))
5527 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5528 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5529 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5530 if (ckWARN(WARN_DEPRECATED))
5531 Perl_warner(aTHX_ WARN_DEPRECATED,
5532 "Array @%s missing the @ in argument %"IVdf" of %s()",
5533 name, (IV)numargs, PL_op_desc[type]);
5536 kid->op_sibling = sibl;
5539 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5540 bad_type(numargs, "array", PL_op_desc[type], kid);
5544 if (kid->op_type == OP_CONST &&
5545 (kid->op_private & OPpCONST_BARE))
5547 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5548 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5549 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5550 if (ckWARN(WARN_DEPRECATED))
5551 Perl_warner(aTHX_ WARN_DEPRECATED,
5552 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5553 name, (IV)numargs, PL_op_desc[type]);
5556 kid->op_sibling = sibl;
5559 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5560 bad_type(numargs, "hash", PL_op_desc[type], kid);
5565 OP *newop = newUNOP(OP_NULL, 0, kid);
5566 kid->op_sibling = 0;
5568 newop->op_next = newop;
5570 kid->op_sibling = sibl;
5575 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5576 if (kid->op_type == OP_CONST &&
5577 (kid->op_private & OPpCONST_BARE))
5579 OP *newop = newGVOP(OP_GV, 0,
5580 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5585 else if (kid->op_type == OP_READLINE) {
5586 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5587 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5590 I32 flags = OPf_SPECIAL;
5594 /* is this op a FH constructor? */
5595 if (is_handle_constructor(o,numargs)) {
5596 char *name = Nullch;
5600 /* Set a flag to tell rv2gv to vivify
5601 * need to "prove" flag does not mean something
5602 * else already - NI-S 1999/05/07
5605 if (kid->op_type == OP_PADSV) {
5606 SV **namep = av_fetch(PL_comppad_name,
5608 if (namep && *namep)
5609 name = SvPV(*namep, len);
5611 else if (kid->op_type == OP_RV2SV
5612 && kUNOP->op_first->op_type == OP_GV)
5614 GV *gv = cGVOPx_gv(kUNOP->op_first);
5616 len = GvNAMELEN(gv);
5618 else if (kid->op_type == OP_AELEM
5619 || kid->op_type == OP_HELEM)
5621 name = "__ANONIO__";
5627 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5628 namesv = PL_curpad[targ];
5629 (void)SvUPGRADE(namesv, SVt_PV);
5631 sv_setpvn(namesv, "$", 1);
5632 sv_catpvn(namesv, name, len);
5635 kid->op_sibling = 0;
5636 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5637 kid->op_targ = targ;
5638 kid->op_private |= priv;
5640 kid->op_sibling = sibl;
5646 mod(scalar(kid), type);
5650 tokid = &kid->op_sibling;
5651 kid = kid->op_sibling;
5653 o->op_private |= numargs;
5655 return too_many_arguments(o,PL_op_desc[o->op_type]);
5658 else if (PL_opargs[type] & OA_DEFGV) {
5660 return newUNOP(type, 0, newDEFSVOP());
5664 while (oa & OA_OPTIONAL)
5666 if (oa && oa != OA_LIST)
5667 return too_few_arguments(o,PL_op_desc[o->op_type]);
5673 Perl_ck_glob(pTHX_ OP *o)
5678 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5679 append_elem(OP_GLOB, o, newDEFSVOP());
5681 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5682 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5684 #if !defined(PERL_EXTERNAL_GLOB)
5685 /* XXX this can be tightened up and made more failsafe. */
5688 Perl_load_module(aTHX_ 0, newSVpvn("File::Glob", 10), Nullsv,
5689 /* null-terminated import list */
5690 newSVpvn(":globally", 9), Nullsv);
5691 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5694 #endif /* PERL_EXTERNAL_GLOB */
5696 if (gv && GvIMPORTED_CV(gv)) {
5697 append_elem(OP_GLOB, o,
5698 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5699 o->op_type = OP_LIST;
5700 o->op_ppaddr = PL_ppaddr[OP_LIST];
5701 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5702 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5703 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5704 append_elem(OP_LIST, o,
5705 scalar(newUNOP(OP_RV2CV, 0,
5706 newGVOP(OP_GV, 0, gv)))));
5707 o = newUNOP(OP_NULL, 0, ck_subr(o));
5708 o->op_targ = OP_GLOB; /* hint at what it used to be */
5711 gv = newGVgen("main");
5713 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5714 SvREFCNT_dec((SV*)gv); /* had excess refcnt */
5720 Perl_ck_grep(pTHX_ OP *o)
5724 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5726 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5727 NewOp(1101, gwop, 1, LOGOP);
5729 if (o->op_flags & OPf_STACKED) {
5732 kid = cLISTOPo->op_first->op_sibling;
5733 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5736 kid->op_next = (OP*)gwop;
5737 o->op_flags &= ~OPf_STACKED;
5739 kid = cLISTOPo->op_first->op_sibling;
5740 if (type == OP_MAPWHILE)
5747 kid = cLISTOPo->op_first->op_sibling;
5748 if (kid->op_type != OP_NULL)
5749 Perl_croak(aTHX_ "panic: ck_grep");
5750 kid = kUNOP->op_first;
5752 gwop->op_type = type;
5753 gwop->op_ppaddr = PL_ppaddr[type];
5754 gwop->op_first = listkids(o);
5755 gwop->op_flags |= OPf_KIDS;
5756 gwop->op_private = 1;
5757 gwop->op_other = LINKLIST(kid);
5758 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5759 kid->op_next = (OP*)gwop;
5761 kid = cLISTOPo->op_first->op_sibling;
5762 if (!kid || !kid->op_sibling)
5763 return too_few_arguments(o,PL_op_desc[o->op_type]);
5764 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5765 mod(kid, OP_GREPSTART);
5771 Perl_ck_index(pTHX_ OP *o)
5773 if (o->op_flags & OPf_KIDS) {
5774 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5776 kid = kid->op_sibling; /* get past "big" */
5777 if (kid && kid->op_type == OP_CONST)
5778 fbm_compile(((SVOP*)kid)->op_sv, 0);
5784 Perl_ck_lengthconst(pTHX_ OP *o)
5786 /* XXX length optimization goes here */
5791 Perl_ck_lfun(pTHX_ OP *o)
5793 OPCODE type = o->op_type;
5794 return modkids(ck_fun(o), type);
5798 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5800 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5801 switch (cUNOPo->op_first->op_type) {
5803 /* This is needed for
5804 if (defined %stash::)
5805 to work. Do not break Tk.
5807 break; /* Globals via GV can be undef */
5809 case OP_AASSIGN: /* Is this a good idea? */
5810 Perl_warner(aTHX_ WARN_DEPRECATED,
5811 "defined(@array) is deprecated");
5812 Perl_warner(aTHX_ WARN_DEPRECATED,
5813 "\t(Maybe you should just omit the defined()?)\n");
5816 /* This is needed for
5817 if (defined %stash::)
5818 to work. Do not break Tk.
5820 break; /* Globals via GV can be undef */
5822 Perl_warner(aTHX_ WARN_DEPRECATED,
5823 "defined(%%hash) is deprecated");
5824 Perl_warner(aTHX_ WARN_DEPRECATED,
5825 "\t(Maybe you should just omit the defined()?)\n");
5836 Perl_ck_rfun(pTHX_ OP *o)
5838 OPCODE type = o->op_type;
5839 return refkids(ck_fun(o), type);
5843 Perl_ck_listiob(pTHX_ OP *o)
5847 kid = cLISTOPo->op_first;
5850 kid = cLISTOPo->op_first;
5852 if (kid->op_type == OP_PUSHMARK)
5853 kid = kid->op_sibling;
5854 if (kid && o->op_flags & OPf_STACKED)
5855 kid = kid->op_sibling;
5856 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5857 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5858 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5859 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5860 cLISTOPo->op_first->op_sibling = kid;
5861 cLISTOPo->op_last = kid;
5862 kid = kid->op_sibling;
5867 append_elem(o->op_type, o, newDEFSVOP());
5873 Perl_ck_sassign(pTHX_ OP *o)
5875 OP *kid = cLISTOPo->op_first;
5876 /* has a disposable target? */
5877 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5878 && !(kid->op_flags & OPf_STACKED)
5879 /* Cannot steal the second time! */
5880 && !(kid->op_private & OPpTARGET_MY))
5882 OP *kkid = kid->op_sibling;
5884 /* Can just relocate the target. */
5885 if (kkid && kkid->op_type == OP_PADSV
5886 && !(kkid->op_private & OPpLVAL_INTRO))
5888 kid->op_targ = kkid->op_targ;
5890 /* Now we do not need PADSV and SASSIGN. */
5891 kid->op_sibling = o->op_sibling; /* NULL */
5892 cLISTOPo->op_first = NULL;
5895 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5903 Perl_ck_match(pTHX_ OP *o)
5905 o->op_private |= OPpRUNTIME;
5910 Perl_ck_method(pTHX_ OP *o)
5912 OP *kid = cUNOPo->op_first;
5913 if (kid->op_type == OP_CONST) {
5914 SV* sv = kSVOP->op_sv;
5915 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5917 (void)SvUPGRADE(sv, SVt_PVIV);
5919 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5920 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5921 kSVOP->op_sv = Nullsv;
5930 Perl_ck_null(pTHX_ OP *o)
5936 Perl_ck_open(pTHX_ OP *o)
5938 HV *table = GvHV(PL_hintgv);
5942 svp = hv_fetch(table, "open_IN", 7, FALSE);
5944 mode = mode_from_discipline(*svp);
5945 if (mode & O_BINARY)
5946 o->op_private |= OPpOPEN_IN_RAW;
5947 else if (mode & O_TEXT)
5948 o->op_private |= OPpOPEN_IN_CRLF;
5951 svp = hv_fetch(table, "open_OUT", 8, FALSE);
5953 mode = mode_from_discipline(*svp);
5954 if (mode & O_BINARY)
5955 o->op_private |= OPpOPEN_OUT_RAW;
5956 else if (mode & O_TEXT)
5957 o->op_private |= OPpOPEN_OUT_CRLF;
5960 if (o->op_type == OP_BACKTICK)
5966 Perl_ck_repeat(pTHX_ OP *o)
5968 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5969 o->op_private |= OPpREPEAT_DOLIST;
5970 cBINOPo->op_first = force_list(cBINOPo->op_first);
5978 Perl_ck_require(pTHX_ OP *o)
5980 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5981 SVOP *kid = (SVOP*)cUNOPo->op_first;
5983 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5985 for (s = SvPVX(kid->op_sv); *s; s++) {
5986 if (*s == ':' && s[1] == ':') {
5988 Move(s+2, s+1, strlen(s+2)+1, char);
5989 --SvCUR(kid->op_sv);
5992 if (SvREADONLY(kid->op_sv)) {
5993 SvREADONLY_off(kid->op_sv);
5994 sv_catpvn(kid->op_sv, ".pm", 3);
5995 SvREADONLY_on(kid->op_sv);
5998 sv_catpvn(kid->op_sv, ".pm", 3);
6005 Perl_ck_return(pTHX_ OP *o)
6008 if (CvLVALUE(PL_compcv)) {
6009 for (kid = cLISTOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
6010 mod(kid, OP_LEAVESUBLV);
6017 Perl_ck_retarget(pTHX_ OP *o)
6019 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
6026 Perl_ck_select(pTHX_ OP *o)
6029 if (o->op_flags & OPf_KIDS) {
6030 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6031 if (kid && kid->op_sibling) {
6032 o->op_type = OP_SSELECT;
6033 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
6035 return fold_constants(o);
6039 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6040 if (kid && kid->op_type == OP_RV2GV)
6041 kid->op_private &= ~HINT_STRICT_REFS;
6046 Perl_ck_shift(pTHX_ OP *o)
6048 I32 type = o->op_type;
6050 if (!(o->op_flags & OPf_KIDS)) {
6055 if (!CvUNIQUE(PL_compcv)) {
6056 argop = newOP(OP_PADAV, OPf_REF);
6057 argop->op_targ = 0; /* PL_curpad[0] is @_ */
6060 argop = newUNOP(OP_RV2AV, 0,
6061 scalar(newGVOP(OP_GV, 0,
6062 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6065 argop = newUNOP(OP_RV2AV, 0,
6066 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
6067 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6068 #endif /* USE_THREADS */
6069 return newUNOP(type, 0, scalar(argop));
6071 return scalar(modkids(ck_fun(o), type));
6075 Perl_ck_sort(pTHX_ OP *o)
6079 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
6081 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6082 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
6084 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
6086 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
6088 if (kid->op_type == OP_SCOPE) {
6092 else if (kid->op_type == OP_LEAVE) {
6093 if (o->op_type == OP_SORT) {
6094 null(kid); /* wipe out leave */
6097 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
6098 if (k->op_next == kid)
6100 /* don't descend into loops */
6101 else if (k->op_type == OP_ENTERLOOP
6102 || k->op_type == OP_ENTERITER)
6104 k = cLOOPx(k)->op_lastop;
6109 kid->op_next = 0; /* just disconnect the leave */
6110 k = kLISTOP->op_first;
6115 if (o->op_type == OP_SORT) {
6116 /* provide scalar context for comparison function/block */
6122 o->op_flags |= OPf_SPECIAL;
6124 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
6127 firstkid = firstkid->op_sibling;
6130 /* provide list context for arguments */
6131 if (o->op_type == OP_SORT)
6138 S_simplify_sort(pTHX_ OP *o)
6140 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6144 if (!(o->op_flags & OPf_STACKED))
6146 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
6147 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
6148 kid = kUNOP->op_first; /* get past null */
6149 if (kid->op_type != OP_SCOPE)
6151 kid = kLISTOP->op_last; /* get past scope */
6152 switch(kid->op_type) {
6160 k = kid; /* remember this node*/
6161 if (kBINOP->op_first->op_type != OP_RV2SV)
6163 kid = kBINOP->op_first; /* get past cmp */
6164 if (kUNOP->op_first->op_type != OP_GV)
6166 kid = kUNOP->op_first; /* get past rv2sv */
6168 if (GvSTASH(gv) != PL_curstash)
6170 if (strEQ(GvNAME(gv), "a"))
6172 else if (strEQ(GvNAME(gv), "b"))
6176 kid = k; /* back to cmp */
6177 if (kBINOP->op_last->op_type != OP_RV2SV)
6179 kid = kBINOP->op_last; /* down to 2nd arg */
6180 if (kUNOP->op_first->op_type != OP_GV)
6182 kid = kUNOP->op_first; /* get past rv2sv */
6184 if (GvSTASH(gv) != PL_curstash
6186 ? strNE(GvNAME(gv), "a")
6187 : strNE(GvNAME(gv), "b")))
6189 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6191 o->op_private |= OPpSORT_REVERSE;
6192 if (k->op_type == OP_NCMP)
6193 o->op_private |= OPpSORT_NUMERIC;
6194 if (k->op_type == OP_I_NCMP)
6195 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6196 kid = cLISTOPo->op_first->op_sibling;
6197 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6198 op_free(kid); /* then delete it */
6202 Perl_ck_split(pTHX_ OP *o)
6206 if (o->op_flags & OPf_STACKED)
6207 return no_fh_allowed(o);
6209 kid = cLISTOPo->op_first;
6210 if (kid->op_type != OP_NULL)
6211 Perl_croak(aTHX_ "panic: ck_split");
6212 kid = kid->op_sibling;
6213 op_free(cLISTOPo->op_first);
6214 cLISTOPo->op_first = kid;
6216 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6217 cLISTOPo->op_last = kid; /* There was only one element previously */
6220 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
6221 OP *sibl = kid->op_sibling;
6222 kid->op_sibling = 0;
6223 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6224 if (cLISTOPo->op_first == cLISTOPo->op_last)
6225 cLISTOPo->op_last = kid;
6226 cLISTOPo->op_first = kid;
6227 kid->op_sibling = sibl;
6230 kid->op_type = OP_PUSHRE;
6231 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6234 if (!kid->op_sibling)
6235 append_elem(OP_SPLIT, o, newDEFSVOP());
6237 kid = kid->op_sibling;
6240 if (!kid->op_sibling)
6241 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6243 kid = kid->op_sibling;
6246 if (kid->op_sibling)
6247 return too_many_arguments(o,PL_op_desc[o->op_type]);
6253 Perl_ck_join(pTHX_ OP *o)
6255 if (ckWARN(WARN_SYNTAX)) {
6256 OP *kid = cLISTOPo->op_first->op_sibling;
6257 if (kid && kid->op_type == OP_MATCH) {
6258 char *pmstr = "STRING";
6259 if (kPMOP->op_pmregexp)
6260 pmstr = kPMOP->op_pmregexp->precomp;
6261 Perl_warner(aTHX_ WARN_SYNTAX,
6262 "/%s/ should probably be written as \"%s\"",
6270 Perl_ck_subr(pTHX_ OP *o)
6272 OP *prev = ((cUNOPo->op_first->op_sibling)
6273 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6274 OP *o2 = prev->op_sibling;
6283 o->op_private |= OPpENTERSUB_HASTARG;
6284 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6285 if (cvop->op_type == OP_RV2CV) {
6287 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6288 null(cvop); /* disable rv2cv */
6289 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6290 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6291 GV *gv = cGVOPx_gv(tmpop);
6294 tmpop->op_private |= OPpEARLY_CV;
6295 else if (SvPOK(cv)) {
6296 namegv = CvANON(cv) ? gv : CvGV(cv);
6297 proto = SvPV((SV*)cv, n_a);
6301 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6302 if (o2->op_type == OP_CONST)
6303 o2->op_private &= ~OPpCONST_STRICT;
6304 else if (o2->op_type == OP_LIST) {
6305 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6306 if (o && o->op_type == OP_CONST)
6307 o->op_private &= ~OPpCONST_STRICT;
6310 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6311 if (PERLDB_SUB && PL_curstash != PL_debstash)
6312 o->op_private |= OPpENTERSUB_DB;
6313 while (o2 != cvop) {
6317 return too_many_arguments(o, gv_ename(namegv));
6335 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6337 arg == 1 ? "block or sub {}" : "sub {}",
6338 gv_ename(namegv), o2);
6341 /* '*' allows any scalar type, including bareword */
6344 if (o2->op_type == OP_RV2GV)
6345 goto wrapref; /* autoconvert GLOB -> GLOBref */
6346 else if (o2->op_type == OP_CONST)
6347 o2->op_private &= ~OPpCONST_STRICT;
6348 else if (o2->op_type == OP_ENTERSUB) {
6349 /* accidental subroutine, revert to bareword */
6350 OP *gvop = ((UNOP*)o2)->op_first;
6351 if (gvop && gvop->op_type == OP_NULL) {
6352 gvop = ((UNOP*)gvop)->op_first;
6354 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6357 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6358 (gvop = ((UNOP*)gvop)->op_first) &&
6359 gvop->op_type == OP_GV)
6361 GV *gv = cGVOPx_gv(gvop);
6362 OP *sibling = o2->op_sibling;
6363 SV *n = newSVpvn("",0);
6365 gv_fullname3(n, gv, "");
6366 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6367 sv_chop(n, SvPVX(n)+6);
6368 o2 = newSVOP(OP_CONST, 0, n);
6369 prev->op_sibling = o2;
6370 o2->op_sibling = sibling;
6382 if (o2->op_type != OP_RV2GV)
6383 bad_type(arg, "symbol", gv_ename(namegv), o2);
6386 if (o2->op_type != OP_ENTERSUB)
6387 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6390 if (o2->op_type != OP_RV2SV
6391 && o2->op_type != OP_PADSV
6392 && o2->op_type != OP_HELEM
6393 && o2->op_type != OP_AELEM
6394 && o2->op_type != OP_THREADSV)
6396 bad_type(arg, "scalar", gv_ename(namegv), o2);
6400 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6401 bad_type(arg, "array", gv_ename(namegv), o2);
6404 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6405 bad_type(arg, "hash", gv_ename(namegv), o2);
6409 OP* sib = kid->op_sibling;
6410 kid->op_sibling = 0;
6411 o2 = newUNOP(OP_REFGEN, 0, kid);
6412 o2->op_sibling = sib;
6413 prev->op_sibling = o2;
6424 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6425 gv_ename(namegv), SvPV((SV*)cv, n_a));
6430 mod(o2, OP_ENTERSUB);
6432 o2 = o2->op_sibling;
6434 if (proto && !optional &&
6435 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6436 return too_few_arguments(o, gv_ename(namegv));
6441 Perl_ck_svconst(pTHX_ OP *o)
6443 SvREADONLY_on(cSVOPo->op_sv);
6448 Perl_ck_trunc(pTHX_ OP *o)
6450 if (o->op_flags & OPf_KIDS) {
6451 SVOP *kid = (SVOP*)cUNOPo->op_first;
6453 if (kid->op_type == OP_NULL)
6454 kid = (SVOP*)kid->op_sibling;
6455 if (kid && kid->op_type == OP_CONST &&
6456 (kid->op_private & OPpCONST_BARE))
6458 o->op_flags |= OPf_SPECIAL;
6459 kid->op_private &= ~OPpCONST_STRICT;
6466 Perl_ck_substr(pTHX_ OP *o)
6469 if ((o->op_flags & OPf_KIDS) && o->op_private == 4) {
6470 OP *kid = cLISTOPo->op_first;
6472 if (kid->op_type == OP_NULL)
6473 kid = kid->op_sibling;
6475 kid->op_flags |= OPf_MOD;
6481 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6484 Perl_peep(pTHX_ register OP *o)
6486 register OP* oldop = 0;
6489 if (!o || o->op_seq)
6493 SAVEVPTR(PL_curcop);
6494 for (; o; o = o->op_next) {
6500 switch (o->op_type) {
6504 PL_curcop = ((COP*)o); /* for warnings */
6505 o->op_seq = PL_op_seqmax++;
6509 if (cSVOPo->op_private & OPpCONST_STRICT)
6510 no_bareword_allowed(o);
6512 /* Relocate sv to the pad for thread safety.
6513 * Despite being a "constant", the SV is written to,
6514 * for reference counts, sv_upgrade() etc. */
6516 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6517 if (SvPADTMP(cSVOPo->op_sv)) {
6518 /* If op_sv is already a PADTMP then it is being used by
6519 * another pad, so make a copy. */
6520 sv_setsv(PL_curpad[ix],cSVOPo->op_sv);
6521 SvREADONLY_on(PL_curpad[ix]);
6522 SvREFCNT_dec(cSVOPo->op_sv);
6525 SvREFCNT_dec(PL_curpad[ix]);
6526 SvPADTMP_on(cSVOPo->op_sv);
6527 PL_curpad[ix] = cSVOPo->op_sv;
6529 cSVOPo->op_sv = Nullsv;
6533 o->op_seq = PL_op_seqmax++;
6537 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6538 if (o->op_next->op_private & OPpTARGET_MY) {
6539 if (o->op_flags & OPf_STACKED) /* chained concats */
6540 goto ignore_optimization;
6542 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6543 o->op_targ = o->op_next->op_targ;
6544 o->op_next->op_targ = 0;
6545 o->op_private |= OPpTARGET_MY;
6550 ignore_optimization:
6551 o->op_seq = PL_op_seqmax++;
6554 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6555 o->op_seq = PL_op_seqmax++;
6556 break; /* Scalar stub must produce undef. List stub is noop */
6560 if (o->op_targ == OP_NEXTSTATE
6561 || o->op_targ == OP_DBSTATE
6562 || o->op_targ == OP_SETSTATE)
6564 PL_curcop = ((COP*)o);
6571 if (oldop && o->op_next) {
6572 oldop->op_next = o->op_next;
6575 o->op_seq = PL_op_seqmax++;
6579 if (o->op_next->op_type == OP_RV2SV) {
6580 if (!(o->op_next->op_private & OPpDEREF)) {
6582 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6584 o->op_next = o->op_next->op_next;
6585 o->op_type = OP_GVSV;
6586 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6589 else if (o->op_next->op_type == OP_RV2AV) {
6590 OP* pop = o->op_next->op_next;
6592 if (pop->op_type == OP_CONST &&
6593 (PL_op = pop->op_next) &&
6594 pop->op_next->op_type == OP_AELEM &&
6595 !(pop->op_next->op_private &
6596 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
6597 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6605 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6606 o->op_next = pop->op_next->op_next;
6607 o->op_type = OP_AELEMFAST;
6608 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6609 o->op_private = (U8)i;
6614 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6616 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6617 /* XXX could check prototype here instead of just carping */
6618 SV *sv = sv_newmortal();
6619 gv_efullname3(sv, gv, Nullch);
6620 Perl_warner(aTHX_ WARN_PROTOTYPE,
6621 "%s() called too early to check prototype",
6626 o->op_seq = PL_op_seqmax++;
6637 o->op_seq = PL_op_seqmax++;
6638 while (cLOGOP->op_other->op_type == OP_NULL)
6639 cLOGOP->op_other = cLOGOP->op_other->op_next;
6640 peep(cLOGOP->op_other);
6645 o->op_seq = PL_op_seqmax++;
6646 while (cLOOP->op_redoop->op_type == OP_NULL)
6647 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
6648 peep(cLOOP->op_redoop);
6649 while (cLOOP->op_nextop->op_type == OP_NULL)
6650 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
6651 peep(cLOOP->op_nextop);
6652 while (cLOOP->op_lastop->op_type == OP_NULL)
6653 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
6654 peep(cLOOP->op_lastop);
6660 o->op_seq = PL_op_seqmax++;
6661 while (cPMOP->op_pmreplstart &&
6662 cPMOP->op_pmreplstart->op_type == OP_NULL)
6663 cPMOP->op_pmreplstart = cPMOP->op_pmreplstart->op_next;
6664 peep(cPMOP->op_pmreplstart);
6668 o->op_seq = PL_op_seqmax++;
6669 if (ckWARN(WARN_SYNTAX) && o->op_next
6670 && o->op_next->op_type == OP_NEXTSTATE) {
6671 if (o->op_next->op_sibling &&
6672 o->op_next->op_sibling->op_type != OP_EXIT &&
6673 o->op_next->op_sibling->op_type != OP_WARN &&
6674 o->op_next->op_sibling->op_type != OP_DIE) {
6675 line_t oldline = CopLINE(PL_curcop);
6677 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6678 Perl_warner(aTHX_ WARN_EXEC,
6679 "Statement unlikely to be reached");
6680 Perl_warner(aTHX_ WARN_EXEC,
6681 "\t(Maybe you meant system() when you said exec()?)\n");
6682 CopLINE_set(PL_curcop, oldline);
6691 SV **svp, **indsvp, *sv;
6696 o->op_seq = PL_op_seqmax++;
6697 if ((o->op_private & (OPpLVAL_INTRO))
6698 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6700 rop = (UNOP*)((BINOP*)o)->op_first;
6701 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6703 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6704 if (!SvOBJECT(lexname))
6706 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6707 if (!fields || !GvHV(*fields))
6709 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6710 key = SvPV(*svp, keylen);
6711 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6713 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6714 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6716 ind = SvIV(*indsvp);
6718 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6719 rop->op_type = OP_RV2AV;
6720 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6721 o->op_type = OP_AELEM;
6722 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6724 if (SvREADONLY(*svp))
6726 SvFLAGS(sv) |= (SvFLAGS(*svp)
6727 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6737 SV **svp, **indsvp, *sv;
6741 SVOP *first_key_op, *key_op;
6743 o->op_seq = PL_op_seqmax++;
6744 if ((o->op_private & (OPpLVAL_INTRO))
6745 /* I bet there's always a pushmark... */
6746 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
6747 /* hmmm, no optimization if list contains only one key. */
6749 rop = (UNOP*)((LISTOP*)o)->op_last;
6750 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6752 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6753 if (!SvOBJECT(lexname))
6755 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6756 if (!fields || !GvHV(*fields))
6758 /* Again guessing that the pushmark can be jumped over.... */
6759 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
6760 ->op_first->op_sibling;
6761 /* Check that the key list contains only constants. */
6762 for (key_op = first_key_op; key_op;
6763 key_op = (SVOP*)key_op->op_sibling)
6764 if (key_op->op_type != OP_CONST)
6768 rop->op_type = OP_RV2AV;
6769 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6770 o->op_type = OP_ASLICE;
6771 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
6772 for (key_op = first_key_op; key_op;
6773 key_op = (SVOP*)key_op->op_sibling) {
6774 svp = cSVOPx_svp(key_op);
6775 key = SvPV(*svp, keylen);
6776 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6778 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
6779 "in variable %s of type %s",
6780 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6782 ind = SvIV(*indsvp);
6784 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6786 if (SvREADONLY(*svp))
6788 SvFLAGS(sv) |= (SvFLAGS(*svp)
6789 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
6797 o->op_seq = PL_op_seqmax++;