3 * Copyright (c) 1991-1999, 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 */
27 # define OP_REFCNT_LOCK NOOP
28 # define OP_REFCNT_UNLOCK NOOP
29 # define OpREFCNT_set(o,n) ((o)->op_targ = (n))
30 # define OpREFCNT_dec(o) (--(o)->op_targ)
32 # define OP_REFCNT_LOCK NOOP
33 # define OP_REFCNT_UNLOCK NOOP
34 # define OpREFCNT_set(o,n) NOOP
35 # define OpREFCNT_dec(o) 0
38 #ifdef PL_OP_SLAB_ALLOC
39 #define SLAB_SIZE 8192
40 static char *PL_OpPtr = NULL;
41 static int PL_OpSpace = 0;
42 #define NewOp(m,var,c,type) do { if ((PL_OpSpace -= c*sizeof(type)) >= 0) \
43 var = (type *)(PL_OpPtr -= c*sizeof(type)); \
45 var = (type *) Slab_Alloc(m,c*sizeof(type)); \
49 S_Slab_Alloc(pTHX_ int m, size_t sz)
51 Newz(m,PL_OpPtr,SLAB_SIZE,char);
52 PL_OpSpace = SLAB_SIZE - sz;
53 return PL_OpPtr += PL_OpSpace;
57 #define NewOp(m, var, c, type) Newz(m, var, c, type)
60 * In the following definition, the ", Nullop" is just to make the compiler
61 * think the expression is of the right type: croak actually does a Siglongjmp.
63 #define CHECKOP(type,o) \
64 ((PL_op_mask && PL_op_mask[type]) \
65 ? ( op_free((OP*)o), \
66 Perl_croak(aTHX_ "%s trapped by operation mask", PL_op_desc[type]), \
68 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
70 #define PAD_MAX 999999999
73 S_gv_ename(pTHX_ GV *gv)
76 SV* tmpsv = sv_newmortal();
77 gv_efullname3(tmpsv, gv, Nullch);
78 return SvPV(tmpsv,n_a);
82 S_no_fh_allowed(pTHX_ OP *o)
84 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
85 PL_op_desc[o->op_type]));
90 S_too_few_arguments(pTHX_ OP *o, char *name)
92 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
97 S_too_many_arguments(pTHX_ OP *o, char *name)
99 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
104 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
106 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
107 (int)n, name, t, PL_op_desc[kid->op_type]));
111 S_no_bareword_allowed(pTHX_ OP *o)
113 qerror(Perl_mess(aTHX_
114 "Bareword \"%s\" not allowed while \"strict subs\" in use",
115 SvPV_nolen(cSVOPo_sv)));
118 /* "register" allocation */
121 Perl_pad_allocmy(pTHX_ char *name)
128 PL_in_my == KEY_our ||
130 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
131 name[1] == '_' && (int)strlen(name) > 2 ))
133 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
134 /* 1999-02-27 mjd@plover.com */
136 p = strchr(name, '\0');
137 /* The next block assumes the buffer is at least 205 chars
138 long. At present, it's always at least 256 chars. */
140 strcpy(name+200, "...");
146 /* Move everything else down one character */
147 for (; p-name > 2; p--)
149 name[2] = toCTRL(name[1]);
152 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
154 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
155 SV **svp = AvARRAY(PL_comppad_name);
156 HV *ourstash = (PL_curstash ? PL_curstash : PL_defstash);
157 PADOFFSET top = AvFILLp(PL_comppad_name);
158 for (off = top; off > PL_comppad_name_floor; off--) {
160 && sv != &PL_sv_undef
161 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
162 && (PL_in_my != KEY_our
163 || ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash))
164 && strEQ(name, SvPVX(sv)))
166 Perl_warner(aTHX_ WARN_UNSAFE,
167 "\"%s\" variable %s masks earlier declaration in same %s",
168 (PL_in_my == KEY_our ? "our" : "my"),
170 (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
175 if (PL_in_my == KEY_our) {
176 while (off >= 0 && off <= top) {
178 && sv != &PL_sv_undef
179 && ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash)
180 && strEQ(name, SvPVX(sv)))
182 Perl_warner(aTHX_ WARN_UNSAFE,
183 "\"our\" variable %s redeclared", name);
184 Perl_warner(aTHX_ WARN_UNSAFE,
185 "(Did you mean \"local\" instead of \"our\"?)\n");
192 off = pad_alloc(OP_PADSV, SVs_PADMY);
194 sv_upgrade(sv, SVt_PVNV);
196 if (PL_in_my_stash) {
198 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"%s\"",
199 name, PL_in_my == KEY_our ? "our" : "my"));
201 (void)SvUPGRADE(sv, SVt_PVMG);
202 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
205 if (PL_in_my == KEY_our) {
206 (void)SvUPGRADE(sv, SVt_PVGV);
207 GvSTASH(sv) = (HV*)SvREFCNT_inc(PL_curstash ? PL_curstash : PL_defstash);
208 SvFLAGS(sv) |= SVpad_OUR;
210 av_store(PL_comppad_name, off, sv);
211 SvNVX(sv) = (NV)PAD_MAX;
212 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
213 if (!PL_min_intro_pending)
214 PL_min_intro_pending = off;
215 PL_max_intro_pending = off;
217 av_store(PL_comppad, off, (SV*)newAV());
218 else if (*name == '%')
219 av_store(PL_comppad, off, (SV*)newHV());
220 SvPADMY_on(PL_curpad[off]);
225 S_pad_addlex(pTHX_ SV *proto_namesv)
227 SV *namesv = NEWSV(1103,0);
228 PADOFFSET newoff = pad_alloc(OP_PADSV, SVs_PADMY);
229 sv_upgrade(namesv, SVt_PVNV);
230 sv_setpv(namesv, SvPVX(proto_namesv));
231 av_store(PL_comppad_name, newoff, namesv);
232 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
233 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
234 SvFAKE_on(namesv); /* A ref, not a real var */
235 if (SvFLAGS(proto_namesv) & SVpad_OUR) { /* An "our" variable */
236 SvFLAGS(namesv) |= SVpad_OUR;
237 (void)SvUPGRADE(namesv, SVt_PVGV);
238 GvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)GvSTASH(proto_namesv));
240 if (SvOBJECT(proto_namesv)) { /* A typed var */
242 (void)SvUPGRADE(namesv, SVt_PVMG);
243 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(proto_namesv));
249 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
252 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
253 I32 cx_ix, I32 saweval, U32 flags)
260 register PERL_CONTEXT *cx;
262 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
263 AV *curlist = CvPADLIST(cv);
264 SV **svp = av_fetch(curlist, 0, FALSE);
267 if (!svp || *svp == &PL_sv_undef)
270 svp = AvARRAY(curname);
271 for (off = AvFILLp(curname); off > 0; off--) {
272 if ((sv = svp[off]) &&
273 sv != &PL_sv_undef &&
275 seq > I_32(SvNVX(sv)) &&
276 strEQ(SvPVX(sv), name))
287 return 0; /* don't clone from inactive stack frame */
291 oldpad = (AV*)AvARRAY(curlist)[depth];
292 oldsv = *av_fetch(oldpad, off, TRUE);
293 if (!newoff) { /* Not a mere clone operation. */
294 newoff = pad_addlex(sv);
295 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
296 /* "It's closures all the way down." */
297 CvCLONE_on(PL_compcv);
299 if (CvANON(PL_compcv))
300 oldsv = Nullsv; /* no need to keep ref */
305 bcv && bcv != cv && !CvCLONE(bcv);
306 bcv = CvOUTSIDE(bcv))
309 /* install the missing pad entry in intervening
310 * nested subs and mark them cloneable.
311 * XXX fix pad_foo() to not use globals */
312 AV *ocomppad_name = PL_comppad_name;
313 AV *ocomppad = PL_comppad;
314 SV **ocurpad = PL_curpad;
315 AV *padlist = CvPADLIST(bcv);
316 PL_comppad_name = (AV*)AvARRAY(padlist)[0];
317 PL_comppad = (AV*)AvARRAY(padlist)[1];
318 PL_curpad = AvARRAY(PL_comppad);
320 PL_comppad_name = ocomppad_name;
321 PL_comppad = ocomppad;
326 if (ckWARN(WARN_CLOSURE)
327 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
329 Perl_warner(aTHX_ WARN_CLOSURE,
330 "Variable \"%s\" may be unavailable",
338 else if (!CvUNIQUE(PL_compcv)) {
339 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
340 Perl_warner(aTHX_ WARN_CLOSURE,
341 "Variable \"%s\" will not stay shared", name);
344 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
350 if (flags & FINDLEX_NOSEARCH)
353 /* Nothing in current lexical context--try eval's context, if any.
354 * This is necessary to let the perldb get at lexically scoped variables.
355 * XXX This will also probably interact badly with eval tree caching.
358 for (i = cx_ix; i >= 0; i--) {
360 switch (CxTYPE(cx)) {
362 if (i == 0 && saweval) {
363 seq = cxstack[saweval].blk_oldcop->cop_seq;
364 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
368 switch (cx->blk_eval.old_op_type) {
374 /* require must have its own scope */
383 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
384 saweval = i; /* so we know where we were called from */
387 seq = cxstack[saweval].blk_oldcop->cop_seq;
388 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
396 Perl_pad_findmy(pTHX_ char *name)
402 SV **svp = AvARRAY(PL_comppad_name);
403 U32 seq = PL_cop_seqmax;
409 * Special case to get lexical (and hence per-thread) @_.
410 * XXX I need to find out how to tell at parse-time whether use
411 * of @_ should refer to a lexical (from a sub) or defgv (global
412 * scope and maybe weird sub-ish things like formats). See
413 * startsub in perly.y. It's possible that @_ could be lexical
414 * (at least from subs) even in non-threaded perl.
416 if (strEQ(name, "@_"))
417 return 0; /* success. (NOT_IN_PAD indicates failure) */
418 #endif /* USE_THREADS */
420 /* The one we're looking for is probably just before comppad_name_fill. */
421 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
422 if ((sv = svp[off]) &&
423 sv != &PL_sv_undef &&
426 seq > I_32(SvNVX(sv)))) &&
427 strEQ(SvPVX(sv), name))
429 if (SvIVX(sv) || SvFLAGS(sv) & SVpad_OUR)
430 return (PADOFFSET)off;
431 pendoff = off; /* this pending def. will override import */
435 outside = CvOUTSIDE(PL_compcv);
437 /* Check if if we're compiling an eval'', and adjust seq to be the
438 * eval's seq number. This depends on eval'' having a non-null
439 * CvOUTSIDE() while it is being compiled. The eval'' itself is
440 * identified by CvEVAL being true and CvGV being null. */
441 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
442 cx = &cxstack[cxstack_ix];
444 seq = cx->blk_oldcop->cop_seq;
447 /* See if it's in a nested scope */
448 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
450 /* If there is a pending local definition, this new alias must die */
452 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
453 return off; /* pad_findlex returns 0 for failure...*/
455 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
459 Perl_pad_leavemy(pTHX_ I32 fill)
463 SV **svp = AvARRAY(PL_comppad_name);
465 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
466 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
467 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
468 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
471 /* "Deintroduce" my variables that are leaving with this scope. */
472 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
473 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
474 SvIVX(sv) = PL_cop_seqmax;
479 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
485 if (AvARRAY(PL_comppad) != PL_curpad)
486 Perl_croak(aTHX_ "panic: pad_alloc");
487 if (PL_pad_reset_pending)
489 if (tmptype & SVs_PADMY) {
491 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
492 } while (SvPADBUSY(sv)); /* need a fresh one */
493 retval = AvFILLp(PL_comppad);
496 SV **names = AvARRAY(PL_comppad_name);
497 SSize_t names_fill = AvFILLp(PL_comppad_name);
500 * "foreach" index vars temporarily become aliases to non-"my"
501 * values. Thus we must skip, not just pad values that are
502 * marked as current pad values, but also those with names.
504 if (++PL_padix <= names_fill &&
505 (sv = names[PL_padix]) && sv != &PL_sv_undef)
507 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
508 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)) && !IS_PADGV(sv))
513 SvFLAGS(sv) |= tmptype;
514 PL_curpad = AvARRAY(PL_comppad);
516 DEBUG_X(PerlIO_printf(Perl_debug_log,
517 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
518 PTR2UV(thr), PTR2UV(PL_curpad),
519 (long) retval, PL_op_name[optype]));
521 DEBUG_X(PerlIO_printf(Perl_debug_log,
522 "Pad 0x%"UVxf" alloc %ld for %s\n",
524 (long) retval, PL_op_name[optype]));
525 #endif /* USE_THREADS */
526 return (PADOFFSET)retval;
530 Perl_pad_sv(pTHX_ PADOFFSET po)
534 DEBUG_X(PerlIO_printf(Perl_debug_log,
535 "0x%"UVxf" Pad 0x%"UVxf" sv %"IVdf"\n",
536 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
539 Perl_croak(aTHX_ "panic: pad_sv po");
540 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %"IVdf"\n",
541 PTR2UV(PL_curpad), (IV)po));
542 #endif /* USE_THREADS */
543 return PL_curpad[po]; /* eventually we'll turn this into a macro */
547 Perl_pad_free(pTHX_ PADOFFSET po)
552 if (AvARRAY(PL_comppad) != PL_curpad)
553 Perl_croak(aTHX_ "panic: pad_free curpad");
555 Perl_croak(aTHX_ "panic: pad_free po");
557 DEBUG_X(PerlIO_printf(Perl_debug_log,
558 "0x%"UVxf" Pad 0x%"UVxf" free %"IVdf"\n",
559 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
561 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %"IVdf"\n",
562 PTR2UV(PL_curpad), (IV)po));
563 #endif /* USE_THREADS */
564 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
565 SvPADTMP_off(PL_curpad[po]);
567 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
570 if ((I32)po < PL_padix)
575 Perl_pad_swipe(pTHX_ PADOFFSET po)
578 if (AvARRAY(PL_comppad) != PL_curpad)
579 Perl_croak(aTHX_ "panic: pad_swipe curpad");
581 Perl_croak(aTHX_ "panic: pad_swipe po");
583 DEBUG_X(PerlIO_printf(Perl_debug_log,
584 "0x%"UVxf" Pad 0x%"UVxf" swipe %"IVdf"\n",
585 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
587 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %"IVdf"\n",
588 PTR2UV(PL_curpad), (IV)po));
589 #endif /* USE_THREADS */
590 SvPADTMP_off(PL_curpad[po]);
591 PL_curpad[po] = NEWSV(1107,0);
592 SvPADTMP_on(PL_curpad[po]);
593 if ((I32)po < PL_padix)
597 /* XXX pad_reset() is currently disabled because it results in serious bugs.
598 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
599 * on the stack by OPs that use them, there are several ways to get an alias
600 * to a shared TARG. Such an alias will change randomly and unpredictably.
601 * We avoid doing this until we can think of a Better Way.
606 #ifdef USE_BROKEN_PAD_RESET
610 if (AvARRAY(PL_comppad) != PL_curpad)
611 Perl_croak(aTHX_ "panic: pad_reset curpad");
613 DEBUG_X(PerlIO_printf(Perl_debug_log,
614 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
615 PTR2UV(thr), PTR2UV(PL_curpad)));
617 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
619 #endif /* USE_THREADS */
620 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
621 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
622 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
623 SvPADTMP_off(PL_curpad[po]);
625 PL_padix = PL_padix_floor;
628 PL_pad_reset_pending = FALSE;
632 /* find_threadsv is not reentrant */
634 Perl_find_threadsv(pTHX_ const char *name)
640 /* We currently only handle names of a single character */
641 p = strchr(PL_threadsv_names, *name);
644 key = p - PL_threadsv_names;
645 MUTEX_LOCK(&thr->mutex);
646 svp = av_fetch(thr->threadsv, key, FALSE);
648 MUTEX_UNLOCK(&thr->mutex);
650 SV *sv = NEWSV(0, 0);
651 av_store(thr->threadsv, key, sv);
652 thr->threadsvp = AvARRAY(thr->threadsv);
653 MUTEX_UNLOCK(&thr->mutex);
655 * Some magic variables used to be automagically initialised
656 * in gv_fetchpv. Those which are now per-thread magicals get
657 * initialised here instead.
663 sv_setpv(sv, "\034");
664 sv_magic(sv, 0, 0, name, 1);
669 PL_sawampersand = TRUE;
683 /* XXX %! tied to Errno.pm needs to be added here.
684 * See gv_fetchpv(). */
688 sv_magic(sv, 0, 0, name, 1);
690 DEBUG_S(PerlIO_printf(Perl_error_log,
691 "find_threadsv: new SV %p for $%s%c\n",
692 sv, (*name < 32) ? "^" : "",
693 (*name < 32) ? toCTRL(*name) : *name));
697 #endif /* USE_THREADS */
702 Perl_op_free(pTHX_ OP *o)
704 register OP *kid, *nextkid;
707 if (!o || o->op_seq == (U16)-1)
710 if (o->op_private & OPpREFCOUNTED) {
711 switch (o->op_type) {
719 if (OpREFCNT_dec(o)) {
730 if (o->op_flags & OPf_KIDS) {
731 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
732 nextkid = kid->op_sibling; /* Get before next freeing kid */
740 /* COP* is not cleared by op_clear() so that we may track line
741 * numbers etc even after null() */
742 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
747 #ifdef PL_OP_SLAB_ALLOC
748 if ((char *) o == PL_OpPtr)
757 S_op_clear(pTHX_ OP *o)
759 switch (o->op_type) {
760 case OP_NULL: /* Was holding old type, if any. */
761 case OP_ENTEREVAL: /* Was holding hints. */
763 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
769 if (!(o->op_flags & OPf_SPECIAL))
772 #endif /* USE_THREADS */
774 if (!(o->op_flags & OPf_REF)
775 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
782 if (cPADOPo->op_padix > 0) {
785 pad_swipe(cPADOPo->op_padix);
786 /* No GvIN_PAD_off(gv) here, because other references may still
787 * exist on the pad */
790 cPADOPo->op_padix = 0;
793 SvREFCNT_dec(cSVOPo->op_sv);
794 cSVOPo->op_sv = Nullsv;
798 SvREFCNT_dec(cSVOPo->op_sv);
799 cSVOPo->op_sv = Nullsv;
805 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
809 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
810 SvREFCNT_dec(cSVOPo->op_sv);
811 cSVOPo->op_sv = Nullsv;
814 Safefree(cPVOPo->op_pv);
815 cPVOPo->op_pv = Nullch;
819 op_free(cPMOPo->op_pmreplroot);
823 if ((PADOFFSET)cPMOPo->op_pmreplroot) {
825 GV *gv = (GV*)PL_curpad[(PADOFFSET)cPMOPo->op_pmreplroot];
826 pad_swipe((PADOFFSET)cPMOPo->op_pmreplroot);
827 /* No GvIN_PAD_off(gv) here, because other references may still
828 * exist on the pad */
833 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
839 cPMOPo->op_pmreplroot = Nullop;
840 ReREFCNT_dec(cPMOPo->op_pmregexp);
841 cPMOPo->op_pmregexp = (REGEXP*)NULL;
845 if (o->op_targ > 0) {
846 pad_free(o->op_targ);
852 S_cop_free(pTHX_ COP* cop)
854 Safefree(cop->cop_label);
856 Safefree(CopFILE(cop)); /* XXXXX share in a pvtable? */
857 Safefree(CopSTASHPV(cop)); /* XXXXX share in a pvtable? */
859 /* NOTE: COP.cop_stash is not refcounted */
860 SvREFCNT_dec(CopFILEGV(cop));
862 if (! specialWARN(cop->cop_warnings))
863 SvREFCNT_dec(cop->cop_warnings);
869 if (o->op_type == OP_NULL)
872 o->op_targ = o->op_type;
873 o->op_type = OP_NULL;
874 o->op_ppaddr = PL_ppaddr[OP_NULL];
877 /* Contextualizers */
879 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
882 Perl_linklist(pTHX_ OP *o)
889 /* establish postfix order */
890 if (cUNOPo->op_first) {
891 o->op_next = LINKLIST(cUNOPo->op_first);
892 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
894 kid->op_next = LINKLIST(kid->op_sibling);
906 Perl_scalarkids(pTHX_ OP *o)
909 if (o && o->op_flags & OPf_KIDS) {
910 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
917 S_scalarboolean(pTHX_ OP *o)
919 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
921 if (ckWARN(WARN_SYNTAX)) {
922 line_t oldline = CopLINE(PL_curcop);
924 if (PL_copline != NOLINE)
925 CopLINE_set(PL_curcop, PL_copline);
926 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
927 CopLINE_set(PL_curcop, oldline);
934 Perl_scalar(pTHX_ OP *o)
938 /* assumes no premature commitment */
939 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
940 || o->op_type == OP_RETURN)
945 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
947 switch (o->op_type) {
949 if (o->op_private & OPpREPEAT_DOLIST)
950 null(((LISTOP*)cBINOPo->op_first)->op_first);
951 scalar(cBINOPo->op_first);
956 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
960 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
961 if (!kPMOP->op_pmreplroot)
962 deprecate("implicit split to @_");
970 if (o->op_flags & OPf_KIDS) {
971 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
977 kid = cLISTOPo->op_first;
979 while (kid = kid->op_sibling) {
985 WITH_THR(PL_curcop = &PL_compiling);
990 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
996 WITH_THR(PL_curcop = &PL_compiling);
1003 Perl_scalarvoid(pTHX_ OP *o)
1010 if (o->op_type == OP_NEXTSTATE
1011 || o->op_type == OP_SETSTATE
1012 || o->op_type == OP_DBSTATE
1013 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1014 || o->op_targ == OP_SETSTATE
1015 || o->op_targ == OP_DBSTATE)))
1018 PL_curcop = (COP*)o; /* for warning below */
1021 /* assumes no premature commitment */
1022 want = o->op_flags & OPf_WANT;
1023 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
1024 || o->op_type == OP_RETURN)
1029 if ((o->op_private & OPpTARGET_MY)
1030 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1032 return scalar(o); /* As if inside SASSIGN */
1035 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1037 switch (o->op_type) {
1039 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1043 if (o->op_flags & OPf_STACKED)
1047 if (o->op_private == 4)
1089 case OP_GETSOCKNAME:
1090 case OP_GETPEERNAME:
1095 case OP_GETPRIORITY:
1118 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1119 useless = PL_op_desc[o->op_type];
1126 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1127 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1128 useless = "a variable";
1133 if (cSVOPo->op_private & OPpCONST_STRICT)
1134 no_bareword_allowed(o);
1137 if (ckWARN(WARN_VOID)) {
1138 useless = "a constant";
1139 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1141 else if (SvPOK(sv)) {
1142 if (strnEQ(SvPVX(sv), "di", 2) ||
1143 strnEQ(SvPVX(sv), "ds", 2) ||
1144 strnEQ(SvPVX(sv), "ig", 2))
1149 null(o); /* don't execute or even remember it */
1153 o->op_type = OP_PREINC; /* pre-increment is faster */
1154 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1158 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1159 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1165 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1170 if (o->op_flags & OPf_STACKED)
1178 if (!(o->op_flags & OPf_KIDS))
1187 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1194 /* all requires must return a boolean value */
1195 o->op_flags &= ~OPf_WANT;
1198 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1199 if (!kPMOP->op_pmreplroot)
1200 deprecate("implicit split to @_");
1206 if (ckWARN(WARN_VOID))
1207 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1213 Perl_listkids(pTHX_ OP *o)
1216 if (o && o->op_flags & OPf_KIDS) {
1217 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1224 Perl_list(pTHX_ OP *o)
1228 /* assumes no premature commitment */
1229 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1230 || o->op_type == OP_RETURN)
1235 if ((o->op_private & OPpTARGET_MY)
1236 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1238 return o; /* As if inside SASSIGN */
1241 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1243 switch (o->op_type) {
1246 list(cBINOPo->op_first);
1251 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1259 if (!(o->op_flags & OPf_KIDS))
1261 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1262 list(cBINOPo->op_first);
1263 return gen_constant_list(o);
1270 kid = cLISTOPo->op_first;
1272 while (kid = kid->op_sibling) {
1273 if (kid->op_sibling)
1278 WITH_THR(PL_curcop = &PL_compiling);
1282 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1283 if (kid->op_sibling)
1288 WITH_THR(PL_curcop = &PL_compiling);
1291 /* all requires must return a boolean value */
1292 o->op_flags &= ~OPf_WANT;
1299 Perl_scalarseq(pTHX_ OP *o)
1304 if (o->op_type == OP_LINESEQ ||
1305 o->op_type == OP_SCOPE ||
1306 o->op_type == OP_LEAVE ||
1307 o->op_type == OP_LEAVETRY)
1310 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1311 if (kid->op_sibling) {
1315 PL_curcop = &PL_compiling;
1317 o->op_flags &= ~OPf_PARENS;
1318 if (PL_hints & HINT_BLOCK_SCOPE)
1319 o->op_flags |= OPf_PARENS;
1322 o = newOP(OP_STUB, 0);
1327 S_modkids(pTHX_ OP *o, I32 type)
1330 if (o && o->op_flags & OPf_KIDS) {
1331 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1338 Perl_mod(pTHX_ OP *o, I32 type)
1345 if (!o || PL_error_count)
1348 if ((o->op_private & OPpTARGET_MY)
1349 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1354 switch (o->op_type) {
1359 if (!(o->op_private & (OPpCONST_ARYBASE)))
1361 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1362 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1366 SAVEI32(PL_compiling.cop_arybase);
1367 PL_compiling.cop_arybase = 0;
1369 else if (type == OP_REFGEN)
1372 Perl_croak(aTHX_ "That use of $[ is unsupported");
1375 if (o->op_flags & OPf_PARENS)
1379 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1380 !(o->op_flags & OPf_STACKED)) {
1381 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1382 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1383 assert(cUNOPo->op_first->op_type == OP_NULL);
1384 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1387 else { /* lvalue subroutine call */
1388 o->op_private |= OPpLVAL_INTRO;
1389 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1390 /* Backward compatibility mode: */
1391 o->op_private |= OPpENTERSUB_INARGS;
1394 else { /* Compile-time error message: */
1395 OP *kid = cUNOPo->op_first;
1399 if (kid->op_type == OP_PUSHMARK)
1401 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1403 "panic: unexpected lvalue entersub "
1404 "args: type/targ %ld:%ld",
1405 (long)kid->op_type,kid->op_targ);
1406 kid = kLISTOP->op_first;
1408 while (kid->op_sibling)
1409 kid = kid->op_sibling;
1410 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1412 if (kid->op_type == OP_METHOD_NAMED
1413 || kid->op_type == OP_METHOD)
1417 if (kid->op_sibling || kid->op_next != kid) {
1418 yyerror("panic: unexpected optree near method call");
1422 NewOp(1101, newop, 1, OP);
1423 newop->op_type = OP_RV2CV;
1424 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1425 newop->op_next = newop;
1426 kid->op_sibling = newop;
1427 newop->op_private |= OPpLVAL_INTRO;
1431 if (kid->op_type != OP_RV2CV)
1433 "panic: unexpected lvalue entersub "
1434 "entry via type/targ %ld:%ld",
1435 (long)kid->op_type,kid->op_targ);
1436 kid->op_private |= OPpLVAL_INTRO;
1437 break; /* Postpone until runtime */
1441 kid = kUNOP->op_first;
1442 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1443 kid = kUNOP->op_first;
1444 if (kid->op_type == OP_NULL)
1446 "Unexpected constant lvalue entersub "
1447 "entry via type/targ %ld:%ld",
1448 (long)kid->op_type,kid->op_targ);
1449 if (kid->op_type != OP_GV) {
1450 /* Restore RV2CV to check lvalueness */
1452 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1453 okid->op_next = kid->op_next;
1454 kid->op_next = okid;
1457 okid->op_next = Nullop;
1458 okid->op_type = OP_RV2CV;
1460 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1461 okid->op_private |= OPpLVAL_INTRO;
1465 cv = GvCV(kGVOP_gv);
1475 /* grep, foreach, subcalls, refgen */
1476 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1478 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1479 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1481 : (o->op_type == OP_ENTERSUB
1482 ? "non-lvalue subroutine call"
1483 : PL_op_desc[o->op_type])),
1484 type ? PL_op_desc[type] : "local"));
1498 case OP_RIGHT_SHIFT:
1507 if (!(o->op_flags & OPf_STACKED))
1513 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1519 if (!type && cUNOPo->op_first->op_type != OP_GV)
1520 Perl_croak(aTHX_ "Can't localize through a reference");
1521 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1522 PL_modcount = 10000;
1523 return o; /* Treat \(@foo) like ordinary list. */
1527 if (scalar_mod_type(o, type))
1529 ref(cUNOPo->op_first, o->op_type);
1538 PL_modcount = 10000;
1541 if (!type && cUNOPo->op_first->op_type != OP_GV)
1542 Perl_croak(aTHX_ "Can't localize through a reference");
1543 ref(cUNOPo->op_first, o->op_type);
1547 PL_hints |= HINT_BLOCK_SCOPE;
1557 PL_modcount = 10000;
1558 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1559 return o; /* Treat \(@foo) like ordinary list. */
1560 if (scalar_mod_type(o, type))
1566 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1567 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1572 PL_modcount++; /* XXX ??? */
1574 #endif /* USE_THREADS */
1580 if (type != OP_SASSIGN)
1584 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1590 pad_free(o->op_targ);
1591 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1592 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1593 if (o->op_flags & OPf_KIDS)
1594 mod(cBINOPo->op_first->op_sibling, type);
1599 ref(cBINOPo->op_first, o->op_type);
1600 if (type == OP_ENTERSUB &&
1601 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1602 o->op_private |= OPpLVAL_DEFER;
1609 if (o->op_flags & OPf_KIDS)
1610 mod(cLISTOPo->op_last, type);
1614 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1616 else if (!(o->op_flags & OPf_KIDS))
1618 if (o->op_targ != OP_LIST) {
1619 mod(cBINOPo->op_first, type);
1624 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1628 o->op_flags |= OPf_MOD;
1630 if (type == OP_AASSIGN || type == OP_SASSIGN)
1631 o->op_flags |= OPf_SPECIAL|OPf_REF;
1633 o->op_private |= OPpLVAL_INTRO;
1634 o->op_flags &= ~OPf_SPECIAL;
1635 PL_hints |= HINT_BLOCK_SCOPE;
1637 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1638 o->op_flags |= OPf_REF;
1643 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1647 if (o->op_type == OP_RV2GV)
1671 case OP_RIGHT_SHIFT:
1690 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1692 switch (o->op_type) {
1700 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1713 Perl_refkids(pTHX_ OP *o, I32 type)
1716 if (o && o->op_flags & OPf_KIDS) {
1717 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1724 Perl_ref(pTHX_ OP *o, I32 type)
1728 if (!o || PL_error_count)
1731 switch (o->op_type) {
1733 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1734 !(o->op_flags & OPf_STACKED)) {
1735 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1736 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1737 assert(cUNOPo->op_first->op_type == OP_NULL);
1738 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1739 o->op_flags |= OPf_SPECIAL;
1744 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1748 if (type == OP_DEFINED)
1749 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1750 ref(cUNOPo->op_first, o->op_type);
1753 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1754 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1755 : type == OP_RV2HV ? OPpDEREF_HV
1757 o->op_flags |= OPf_MOD;
1762 o->op_flags |= OPf_MOD; /* XXX ??? */
1767 o->op_flags |= OPf_REF;
1770 if (type == OP_DEFINED)
1771 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1772 ref(cUNOPo->op_first, o->op_type);
1777 o->op_flags |= OPf_REF;
1782 if (!(o->op_flags & OPf_KIDS))
1784 ref(cBINOPo->op_first, type);
1788 ref(cBINOPo->op_first, o->op_type);
1789 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1790 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1791 : type == OP_RV2HV ? OPpDEREF_HV
1793 o->op_flags |= OPf_MOD;
1801 if (!(o->op_flags & OPf_KIDS))
1803 ref(cLISTOPo->op_last, type);
1813 S_dup_attrlist(pTHX_ OP *o)
1817 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1818 * where the first kid is OP_PUSHMARK and the remaining ones
1819 * are OP_CONST. We need to push the OP_CONST values.
1821 if (o->op_type == OP_CONST)
1822 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1824 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1825 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1826 if (o->op_type == OP_CONST)
1827 rop = append_elem(OP_LIST, rop,
1828 newSVOP(OP_CONST, o->op_flags,
1829 SvREFCNT_inc(cSVOPo->op_sv)));
1836 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1838 OP *modname; /* for 'use' */
1841 /* fake up C<use attributes $pkg,$rv,@attrs> */
1842 ENTER; /* need to protect against side-effects of 'use' */
1844 if (stash && HvNAME(stash))
1845 stashsv = newSVpv(HvNAME(stash), 0);
1847 stashsv = &PL_sv_no;
1848 #define ATTRSMODULE "attributes"
1849 modname = newSVOP(OP_CONST, 0,
1850 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1));
1851 modname->op_private |= OPpCONST_BARE;
1852 /* that flag is required to make 'use' work right */
1853 utilize(1, start_subparse(FALSE, 0),
1854 Nullop, /* version */
1856 prepend_elem(OP_LIST,
1857 newSVOP(OP_CONST, 0, stashsv),
1858 prepend_elem(OP_LIST,
1859 newSVOP(OP_CONST, 0, newRV(target)),
1860 dup_attrlist(attrs))));
1865 S_my_kid(pTHX_ OP *o, OP *attrs)
1870 if (!o || PL_error_count)
1874 if (type == OP_LIST) {
1875 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1877 } else if (type == OP_UNDEF) {
1879 } else if (type == OP_RV2SV || /* "our" declaration */
1881 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1882 o->op_private |= OPpOUR_INTRO;
1884 } else if (type != OP_PADSV &&
1887 type != OP_PUSHMARK)
1889 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1890 PL_op_desc[o->op_type],
1891 PL_in_my == KEY_our ? "our" : "my"));
1894 else if (attrs && type != OP_PUSHMARK) {
1900 PL_in_my_stash = Nullhv;
1902 /* check for C<my Dog $spot> when deciding package */
1903 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1904 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1905 stash = SvSTASH(*namesvp);
1907 stash = PL_curstash;
1908 padsv = PAD_SV(o->op_targ);
1909 apply_attrs(stash, padsv, attrs);
1911 o->op_flags |= OPf_MOD;
1912 o->op_private |= OPpLVAL_INTRO;
1917 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1919 if (o->op_flags & OPf_PARENS)
1923 o = my_kid(o, attrs);
1925 PL_in_my_stash = Nullhv;
1930 Perl_my(pTHX_ OP *o)
1932 return my_kid(o, Nullop);
1936 Perl_sawparens(pTHX_ OP *o)
1939 o->op_flags |= OPf_PARENS;
1944 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1949 if (ckWARN(WARN_UNSAFE) &&
1950 (left->op_type == OP_RV2AV ||
1951 left->op_type == OP_RV2HV ||
1952 left->op_type == OP_PADAV ||
1953 left->op_type == OP_PADHV)) {
1954 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1955 right->op_type == OP_TRANS)
1956 ? right->op_type : OP_MATCH];
1957 const char *sample = ((left->op_type == OP_RV2AV ||
1958 left->op_type == OP_PADAV)
1959 ? "@array" : "%hash");
1960 Perl_warner(aTHX_ WARN_UNSAFE,
1961 "Applying %s to %s will act on scalar(%s)",
1962 desc, sample, sample);
1965 if (right->op_type == OP_MATCH ||
1966 right->op_type == OP_SUBST ||
1967 right->op_type == OP_TRANS) {
1968 right->op_flags |= OPf_STACKED;
1969 if (right->op_type != OP_MATCH)
1970 left = mod(left, right->op_type);
1971 if (right->op_type == OP_TRANS)
1972 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1974 o = prepend_elem(right->op_type, scalar(left), right);
1976 return newUNOP(OP_NOT, 0, scalar(o));
1980 return bind_match(type, left,
1981 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1985 Perl_invert(pTHX_ OP *o)
1989 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1990 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1994 Perl_scope(pTHX_ OP *o)
1997 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1998 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1999 o->op_type = OP_LEAVE;
2000 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2003 if (o->op_type == OP_LINESEQ) {
2005 o->op_type = OP_SCOPE;
2006 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2007 kid = ((LISTOP*)o)->op_first;
2008 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2012 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
2019 Perl_save_hints(pTHX)
2022 SAVESPTR(GvHV(PL_hintgv));
2023 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
2024 SAVEFREESV(GvHV(PL_hintgv));
2028 Perl_block_start(pTHX_ int full)
2031 int retval = PL_savestack_ix;
2033 SAVEI32(PL_comppad_name_floor);
2034 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
2036 PL_comppad_name_fill = PL_comppad_name_floor;
2037 if (PL_comppad_name_floor < 0)
2038 PL_comppad_name_floor = 0;
2039 SAVEI32(PL_min_intro_pending);
2040 SAVEI32(PL_max_intro_pending);
2041 PL_min_intro_pending = 0;
2042 SAVEI32(PL_comppad_name_fill);
2043 SAVEI32(PL_padix_floor);
2044 PL_padix_floor = PL_padix;
2045 PL_pad_reset_pending = FALSE;
2047 PL_hints &= ~HINT_BLOCK_SCOPE;
2048 SAVESPTR(PL_compiling.cop_warnings);
2049 if (! specialWARN(PL_compiling.cop_warnings)) {
2050 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2051 SAVEFREESV(PL_compiling.cop_warnings) ;
2057 Perl_block_end(pTHX_ I32 floor, OP *seq)
2060 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2061 OP* retval = scalarseq(seq);
2063 PL_pad_reset_pending = FALSE;
2064 PL_compiling.op_private = PL_hints;
2066 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2067 pad_leavemy(PL_comppad_name_fill);
2076 OP *o = newOP(OP_THREADSV, 0);
2077 o->op_targ = find_threadsv("_");
2080 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2081 #endif /* USE_THREADS */
2085 Perl_newPROG(pTHX_ OP *o)
2091 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2092 ((PL_in_eval & EVAL_KEEPERR)
2093 ? OPf_SPECIAL : 0), o);
2094 PL_eval_start = linklist(PL_eval_root);
2095 PL_eval_root->op_private |= OPpREFCOUNTED;
2096 OpREFCNT_set(PL_eval_root, 1);
2097 PL_eval_root->op_next = 0;
2098 peep(PL_eval_start);
2103 PL_main_root = scope(sawparens(scalarvoid(o)));
2104 PL_curcop = &PL_compiling;
2105 PL_main_start = LINKLIST(PL_main_root);
2106 PL_main_root->op_private |= OPpREFCOUNTED;
2107 OpREFCNT_set(PL_main_root, 1);
2108 PL_main_root->op_next = 0;
2109 peep(PL_main_start);
2112 /* Register with debugger */
2114 CV *cv = get_cv("DB::postponed", FALSE);
2118 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2120 call_sv((SV*)cv, G_DISCARD);
2127 Perl_localize(pTHX_ OP *o, I32 lex)
2129 if (o->op_flags & OPf_PARENS)
2133 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2135 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2136 if (*s == ';' || *s == '=')
2137 Perl_warner(aTHX_ WARN_PARENTHESIS,
2138 "Parentheses missing around \"%s\" list",
2139 lex ? (PL_in_my == KEY_our ? "our" : "my") : "local");
2145 o = mod(o, OP_NULL); /* a bit kludgey */
2147 PL_in_my_stash = Nullhv;
2152 Perl_jmaybe(pTHX_ OP *o)
2154 if (o->op_type == OP_LIST) {
2157 o2 = newOP(OP_THREADSV, 0);
2158 o2->op_targ = find_threadsv(";");
2160 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2161 #endif /* USE_THREADS */
2162 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2168 Perl_fold_constants(pTHX_ register OP *o)
2172 I32 type = o->op_type;
2175 if (PL_opargs[type] & OA_RETSCALAR)
2177 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2178 o->op_targ = pad_alloc(type, SVs_PADTMP);
2180 /* integerize op, unless it happens to be C<-foo>.
2181 * XXX should pp_i_negate() do magic string negation instead? */
2182 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2183 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2184 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2186 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2189 if (!(PL_opargs[type] & OA_FOLDCONST))
2194 /* XXX might want a ck_negate() for this */
2195 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2208 if (o->op_private & OPpLOCALE)
2213 goto nope; /* Don't try to run w/ errors */
2215 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2216 if ((curop->op_type != OP_CONST ||
2217 (curop->op_private & OPpCONST_BARE)) &&
2218 curop->op_type != OP_LIST &&
2219 curop->op_type != OP_SCALAR &&
2220 curop->op_type != OP_NULL &&
2221 curop->op_type != OP_PUSHMARK)
2227 curop = LINKLIST(o);
2231 sv = *(PL_stack_sp--);
2232 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2233 pad_swipe(o->op_targ);
2234 else if (SvTEMP(sv)) { /* grab mortal temp? */
2235 (void)SvREFCNT_inc(sv);
2239 if (type == OP_RV2GV)
2240 return newGVOP(OP_GV, 0, (GV*)sv);
2242 /* try to smush double to int, but don't smush -2.0 to -2 */
2243 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2247 if ((NV)iv == SvNV(sv)) {
2252 SvIOK_off(sv); /* undo SvIV() damage */
2254 return newSVOP(OP_CONST, 0, sv);
2258 if (!(PL_opargs[type] & OA_OTHERINT))
2261 if (!(PL_hints & HINT_INTEGER)) {
2262 if (type == OP_MODULO
2263 || type == OP_DIVIDE
2264 || !(o->op_flags & OPf_KIDS))
2269 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2270 if (curop->op_type == OP_CONST) {
2271 if (SvIOK(((SVOP*)curop)->op_sv))
2275 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2279 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2286 Perl_gen_constant_list(pTHX_ register OP *o)
2290 I32 oldtmps_floor = PL_tmps_floor;
2294 return o; /* Don't attempt to run with errors */
2296 PL_op = curop = LINKLIST(o);
2303 PL_tmps_floor = oldtmps_floor;
2305 o->op_type = OP_RV2AV;
2306 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2307 curop = ((UNOP*)o)->op_first;
2308 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2315 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2320 if (!o || o->op_type != OP_LIST)
2321 o = newLISTOP(OP_LIST, 0, o, Nullop);
2323 o->op_flags &= ~OPf_WANT;
2325 if (!(PL_opargs[type] & OA_MARK))
2326 null(cLISTOPo->op_first);
2329 o->op_ppaddr = PL_ppaddr[type];
2330 o->op_flags |= flags;
2332 o = CHECKOP(type, o);
2333 if (o->op_type != type)
2336 if (cLISTOPo->op_children < 7) {
2337 /* XXX do we really need to do this if we're done appending?? */
2338 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2340 cLISTOPo->op_last = last; /* in case check substituted last arg */
2343 return fold_constants(o);
2346 /* List constructors */
2349 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2357 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
2358 return newLISTOP(type, 0, first, last);
2360 if (first->op_flags & OPf_KIDS)
2361 ((LISTOP*)first)->op_last->op_sibling = last;
2363 first->op_flags |= OPf_KIDS;
2364 ((LISTOP*)first)->op_first = last;
2366 ((LISTOP*)first)->op_last = last;
2367 ((LISTOP*)first)->op_children++;
2372 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2380 if (first->op_type != type)
2381 return prepend_elem(type, (OP*)first, (OP*)last);
2383 if (last->op_type != type)
2384 return append_elem(type, (OP*)first, (OP*)last);
2386 first->op_last->op_sibling = last->op_first;
2387 first->op_last = last->op_last;
2388 first->op_children += last->op_children;
2389 if (first->op_children)
2390 first->op_flags |= OPf_KIDS;
2392 #ifdef PL_OP_SLAB_ALLOC
2400 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2408 if (last->op_type == type) {
2409 if (type == OP_LIST) { /* already a PUSHMARK there */
2410 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2411 ((LISTOP*)last)->op_first->op_sibling = first;
2414 if (!(last->op_flags & OPf_KIDS)) {
2415 ((LISTOP*)last)->op_last = first;
2416 last->op_flags |= OPf_KIDS;
2418 first->op_sibling = ((LISTOP*)last)->op_first;
2419 ((LISTOP*)last)->op_first = first;
2421 ((LISTOP*)last)->op_children++;
2425 return newLISTOP(type, 0, first, last);
2431 Perl_newNULLLIST(pTHX)
2433 return newOP(OP_STUB, 0);
2437 Perl_force_list(pTHX_ OP *o)
2439 if (!o || o->op_type != OP_LIST)
2440 o = newLISTOP(OP_LIST, 0, o, Nullop);
2446 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2450 NewOp(1101, listop, 1, LISTOP);
2452 listop->op_type = type;
2453 listop->op_ppaddr = PL_ppaddr[type];
2454 listop->op_children = (first != 0) + (last != 0);
2455 listop->op_flags = flags;
2459 else if (!first && last)
2462 first->op_sibling = last;
2463 listop->op_first = first;
2464 listop->op_last = last;
2465 if (type == OP_LIST) {
2467 pushop = newOP(OP_PUSHMARK, 0);
2468 pushop->op_sibling = first;
2469 listop->op_first = pushop;
2470 listop->op_flags |= OPf_KIDS;
2472 listop->op_last = pushop;
2474 else if (listop->op_children)
2475 listop->op_flags |= OPf_KIDS;
2481 Perl_newOP(pTHX_ I32 type, I32 flags)
2484 NewOp(1101, o, 1, OP);
2486 o->op_ppaddr = PL_ppaddr[type];
2487 o->op_flags = flags;
2490 o->op_private = 0 + (flags >> 8);
2491 if (PL_opargs[type] & OA_RETSCALAR)
2493 if (PL_opargs[type] & OA_TARGET)
2494 o->op_targ = pad_alloc(type, SVs_PADTMP);
2495 return CHECKOP(type, o);
2499 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2504 first = newOP(OP_STUB, 0);
2505 if (PL_opargs[type] & OA_MARK)
2506 first = force_list(first);
2508 NewOp(1101, unop, 1, UNOP);
2509 unop->op_type = type;
2510 unop->op_ppaddr = PL_ppaddr[type];
2511 unop->op_first = first;
2512 unop->op_flags = flags | OPf_KIDS;
2513 unop->op_private = 1 | (flags >> 8);
2514 unop = (UNOP*) CHECKOP(type, unop);
2518 return fold_constants((OP *) unop);
2522 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2525 NewOp(1101, binop, 1, BINOP);
2528 first = newOP(OP_NULL, 0);
2530 binop->op_type = type;
2531 binop->op_ppaddr = PL_ppaddr[type];
2532 binop->op_first = first;
2533 binop->op_flags = flags | OPf_KIDS;
2536 binop->op_private = 1 | (flags >> 8);
2539 binop->op_private = 2 | (flags >> 8);
2540 first->op_sibling = last;
2543 binop = (BINOP*)CHECKOP(type, binop);
2544 if (binop->op_next || binop->op_type != type)
2547 binop->op_last = binop->op_first->op_sibling;
2549 return fold_constants((OP *)binop);
2553 utf8compare(const void *a, const void *b)
2556 for (i = 0; i < 10; i++) {
2557 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2559 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2566 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2568 SV *tstr = ((SVOP*)expr)->op_sv;
2569 SV *rstr = ((SVOP*)repl)->op_sv;
2572 register U8 *t = (U8*)SvPV(tstr, tlen);
2573 register U8 *r = (U8*)SvPV(rstr, rlen);
2579 register short *tbl;
2581 complement = o->op_private & OPpTRANS_COMPLEMENT;
2582 del = o->op_private & OPpTRANS_DELETE;
2583 squash = o->op_private & OPpTRANS_SQUASH;
2585 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2586 SV* listsv = newSVpvn("# comment\n",10);
2588 U8* tend = t + tlen;
2589 U8* rend = r + rlen;
2605 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2606 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2612 New(1109, cp, tlen, U8*);
2614 transv = newSVpvn("",0);
2623 qsort(cp, i, sizeof(U8*), utf8compare);
2624 for (j = 0; j < i; j++) {
2626 UV val = utf8_to_uv(s, &ulen);
2628 diff = val - nextmin;
2630 t = uv_to_utf8(tmpbuf,nextmin);
2631 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2633 t = uv_to_utf8(tmpbuf, val - 1);
2634 sv_catpvn(transv, "\377", 1);
2635 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2639 val = utf8_to_uv(s+1, &ulen);
2643 t = uv_to_utf8(tmpbuf,nextmin);
2644 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2645 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2646 sv_catpvn(transv, "\377", 1);
2647 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2648 t = (U8*)SvPVX(transv);
2649 tlen = SvCUR(transv);
2652 else if (!rlen && !del) {
2653 r = t; rlen = tlen; rend = tend;
2656 if (to_utf && from_utf) { /* only counting characters */
2657 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2658 o->op_private |= OPpTRANS_IDENTICAL;
2660 else { /* straight latin-1 translation */
2661 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2662 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2663 o->op_private |= OPpTRANS_IDENTICAL;
2667 while (t < tend || tfirst <= tlast) {
2668 /* see if we need more "t" chars */
2669 if (tfirst > tlast) {
2670 tfirst = (I32)utf8_to_uv(t, &ulen);
2672 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2673 tlast = (I32)utf8_to_uv(++t, &ulen);
2680 /* now see if we need more "r" chars */
2681 if (rfirst > rlast) {
2683 rfirst = (I32)utf8_to_uv(r, &ulen);
2685 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2686 rlast = (I32)utf8_to_uv(++r, &ulen);
2695 rfirst = rlast = 0xffffffff;
2699 /* now see which range will peter our first, if either. */
2700 tdiff = tlast - tfirst;
2701 rdiff = rlast - rfirst;
2708 if (rfirst == 0xffffffff) {
2709 diff = tdiff; /* oops, pretend rdiff is infinite */
2711 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2712 (long)tfirst, (long)tlast);
2714 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2718 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2719 (long)tfirst, (long)(tfirst + diff),
2722 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2723 (long)tfirst, (long)rfirst);
2725 if (rfirst + diff > max)
2726 max = rfirst + diff;
2731 else if (rfirst <= 0x800)
2732 grows |= (tfirst < 0x80);
2733 else if (rfirst <= 0x10000)
2734 grows |= (tfirst < 0x800);
2735 else if (rfirst <= 0x200000)
2736 grows |= (tfirst < 0x10000);
2737 else if (rfirst <= 0x4000000)
2738 grows |= (tfirst < 0x200000);
2739 else if (rfirst <= 0x80000000)
2740 grows |= (tfirst < 0x4000000);
2752 else if (max > 0xff)
2757 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2758 SvREFCNT_dec(listsv);
2760 SvREFCNT_dec(transv);
2762 if (!del && havefinal)
2763 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2765 if (grows && to_utf)
2766 o->op_private |= OPpTRANS_GROWS;
2773 tbl = (short*)cPVOPo->op_pv;
2775 Zero(tbl, 256, short);
2776 for (i = 0; i < tlen; i++)
2778 for (i = 0, j = 0; i < 256; i++) {
2794 if (!rlen && !del) {
2797 o->op_private |= OPpTRANS_IDENTICAL;
2799 for (i = 0; i < 256; i++)
2801 for (i = 0, j = 0; i < tlen; i++,j++) {
2804 if (tbl[t[i]] == -1)
2810 if (tbl[t[i]] == -1)
2821 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2826 NewOp(1101, pmop, 1, PMOP);
2827 pmop->op_type = type;
2828 pmop->op_ppaddr = PL_ppaddr[type];
2829 pmop->op_flags = flags;
2830 pmop->op_private = 0 | (flags >> 8);
2832 if (PL_hints & HINT_RE_TAINT)
2833 pmop->op_pmpermflags |= PMf_RETAINT;
2834 if (PL_hints & HINT_LOCALE)
2835 pmop->op_pmpermflags |= PMf_LOCALE;
2836 pmop->op_pmflags = pmop->op_pmpermflags;
2838 /* link into pm list */
2839 if (type != OP_TRANS && PL_curstash) {
2840 pmop->op_pmnext = HvPMROOT(PL_curstash);
2841 HvPMROOT(PL_curstash) = pmop;
2848 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2853 I32 repl_has_vars = 0;
2855 if (o->op_type == OP_TRANS)
2856 return pmtrans(o, expr, repl);
2858 PL_hints |= HINT_BLOCK_SCOPE;
2861 if (expr->op_type == OP_CONST) {
2863 SV *pat = ((SVOP*)expr)->op_sv;
2864 char *p = SvPV(pat, plen);
2865 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2866 sv_setpvn(pat, "\\s+", 3);
2867 p = SvPV(pat, plen);
2868 pm->op_pmflags |= PMf_SKIPWHITE;
2870 if ((PL_hints & HINT_UTF8) || (SvUTF8(pat) && !(PL_hints & HINT_BYTE)))
2871 pm->op_pmdynflags |= PMdf_UTF8;
2872 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2873 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2874 pm->op_pmflags |= PMf_WHITE;
2878 if (PL_hints & HINT_UTF8)
2879 pm->op_pmdynflags |= PMdf_UTF8;
2880 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2881 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2883 : OP_REGCMAYBE),0,expr);
2885 NewOp(1101, rcop, 1, LOGOP);
2886 rcop->op_type = OP_REGCOMP;
2887 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2888 rcop->op_first = scalar(expr);
2889 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2890 ? (OPf_SPECIAL | OPf_KIDS)
2892 rcop->op_private = 1;
2895 /* establish postfix order */
2896 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2898 rcop->op_next = expr;
2899 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2902 rcop->op_next = LINKLIST(expr);
2903 expr->op_next = (OP*)rcop;
2906 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2911 if (pm->op_pmflags & PMf_EVAL) {
2913 if (CopLINE(PL_curcop) < PL_multi_end)
2914 CopLINE_set(PL_curcop, PL_multi_end);
2917 else if (repl->op_type == OP_THREADSV
2918 && strchr("&`'123456789+",
2919 PL_threadsv_names[repl->op_targ]))
2923 #endif /* USE_THREADS */
2924 else if (repl->op_type == OP_CONST)
2928 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2929 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2931 if (curop->op_type == OP_THREADSV) {
2933 if (strchr("&`'123456789+", curop->op_private))
2937 if (curop->op_type == OP_GV) {
2938 GV *gv = cGVOPx_gv(curop);
2940 if (strchr("&`'123456789+", *GvENAME(gv)))
2943 #endif /* USE_THREADS */
2944 else if (curop->op_type == OP_RV2CV)
2946 else if (curop->op_type == OP_RV2SV ||
2947 curop->op_type == OP_RV2AV ||
2948 curop->op_type == OP_RV2HV ||
2949 curop->op_type == OP_RV2GV) {
2950 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2953 else if (curop->op_type == OP_PADSV ||
2954 curop->op_type == OP_PADAV ||
2955 curop->op_type == OP_PADHV ||
2956 curop->op_type == OP_PADANY) {
2959 else if (curop->op_type == OP_PUSHRE)
2960 ; /* Okay here, dangerous in newASSIGNOP */
2969 && (!pm->op_pmregexp
2970 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2971 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2972 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2973 prepend_elem(o->op_type, scalar(repl), o);
2976 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2977 pm->op_pmflags |= PMf_MAYBE_CONST;
2978 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2980 NewOp(1101, rcop, 1, LOGOP);
2981 rcop->op_type = OP_SUBSTCONT;
2982 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2983 rcop->op_first = scalar(repl);
2984 rcop->op_flags |= OPf_KIDS;
2985 rcop->op_private = 1;
2988 /* establish postfix order */
2989 rcop->op_next = LINKLIST(repl);
2990 repl->op_next = (OP*)rcop;
2992 pm->op_pmreplroot = scalar((OP*)rcop);
2993 pm->op_pmreplstart = LINKLIST(rcop);
3002 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3005 NewOp(1101, svop, 1, SVOP);
3006 svop->op_type = type;
3007 svop->op_ppaddr = PL_ppaddr[type];
3009 svop->op_next = (OP*)svop;
3010 svop->op_flags = flags;
3011 if (PL_opargs[type] & OA_RETSCALAR)
3013 if (PL_opargs[type] & OA_TARGET)
3014 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3015 return CHECKOP(type, svop);
3019 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3022 NewOp(1101, padop, 1, PADOP);
3023 padop->op_type = type;
3024 padop->op_ppaddr = PL_ppaddr[type];
3025 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3026 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3027 PL_curpad[padop->op_padix] = sv;
3029 padop->op_next = (OP*)padop;
3030 padop->op_flags = flags;
3031 if (PL_opargs[type] & OA_RETSCALAR)
3033 if (PL_opargs[type] & OA_TARGET)
3034 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3035 return CHECKOP(type, padop);
3039 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3044 return newPADOP(type, flags, SvREFCNT_inc(gv));
3046 return newSVOP(type, flags, SvREFCNT_inc(gv));
3051 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3054 NewOp(1101, pvop, 1, PVOP);
3055 pvop->op_type = type;
3056 pvop->op_ppaddr = PL_ppaddr[type];
3058 pvop->op_next = (OP*)pvop;
3059 pvop->op_flags = flags;
3060 if (PL_opargs[type] & OA_RETSCALAR)
3062 if (PL_opargs[type] & OA_TARGET)
3063 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3064 return CHECKOP(type, pvop);
3068 Perl_package(pTHX_ OP *o)
3073 save_hptr(&PL_curstash);
3074 save_item(PL_curstname);
3079 name = SvPV(sv, len);
3080 PL_curstash = gv_stashpvn(name,len,TRUE);
3081 sv_setpvn(PL_curstname, name, len);
3085 sv_setpv(PL_curstname,"<none>");
3086 PL_curstash = Nullhv;
3088 PL_hints |= HINT_BLOCK_SCOPE;
3089 PL_copline = NOLINE;
3094 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3103 if (id->op_type != OP_CONST)
3104 Perl_croak(aTHX_ "Module name must be constant");
3108 if(version != Nullop) {
3109 SV *vesv = ((SVOP*)version)->op_sv;
3111 if (arg == Nullop && !SvNIOK(vesv)) {
3117 if (version->op_type != OP_CONST || !SvNIOK(vesv))
3118 Perl_croak(aTHX_ "Version number must be constant number");
3120 /* Make copy of id so we don't free it twice */
3121 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3123 /* Fake up a method call to VERSION */
3124 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3125 append_elem(OP_LIST,
3126 prepend_elem(OP_LIST, pack, list(version)),
3127 newSVOP(OP_METHOD_NAMED, 0,
3128 newSVpvn("VERSION", 7))));
3132 /* Fake up an import/unimport */
3133 if (arg && arg->op_type == OP_STUB)
3134 imop = arg; /* no import on explicit () */
3135 else if(SvNIOK(((SVOP*)id)->op_sv)) {
3136 imop = Nullop; /* use 5.0; */
3139 /* Make copy of id so we don't free it twice */
3140 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3141 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3142 append_elem(OP_LIST,
3143 prepend_elem(OP_LIST, pack, list(arg)),
3144 newSVOP(OP_METHOD_NAMED, 0,
3145 aver ? newSVpvn("import", 6)
3146 : newSVpvn("unimport", 8))));
3149 /* Fake up a require, handle override, if any */
3150 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3151 if (!(gv && GvIMPORTED_CV(gv)))
3152 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3154 if (gv && GvIMPORTED_CV(gv)) {
3155 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3156 append_elem(OP_LIST, id,
3157 scalar(newUNOP(OP_RV2CV, 0,
3162 rqop = newUNOP(OP_REQUIRE, 0, id);
3165 /* Fake up the BEGIN {}, which does its thing immediately. */
3167 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3170 append_elem(OP_LINESEQ,
3171 append_elem(OP_LINESEQ,
3172 newSTATEOP(0, Nullch, rqop),
3173 newSTATEOP(0, Nullch, veop)),
3174 newSTATEOP(0, Nullch, imop) ));
3176 PL_hints |= HINT_BLOCK_SCOPE;
3177 PL_copline = NOLINE;
3182 Perl_dofile(pTHX_ OP *term)
3187 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3188 if (!(gv && GvIMPORTED_CV(gv)))
3189 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3191 if (gv && GvIMPORTED_CV(gv)) {
3192 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3193 append_elem(OP_LIST, term,
3194 scalar(newUNOP(OP_RV2CV, 0,
3199 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3205 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3207 return newBINOP(OP_LSLICE, flags,
3208 list(force_list(subscript)),
3209 list(force_list(listval)) );
3213 S_list_assignment(pTHX_ register OP *o)
3218 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3219 o = cUNOPo->op_first;
3221 if (o->op_type == OP_COND_EXPR) {
3222 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3223 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3228 yyerror("Assignment to both a list and a scalar");
3232 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3233 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3234 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3237 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3240 if (o->op_type == OP_RV2SV)
3247 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3252 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3253 return newLOGOP(optype, 0,
3254 mod(scalar(left), optype),
3255 newUNOP(OP_SASSIGN, 0, scalar(right)));
3258 return newBINOP(optype, OPf_STACKED,
3259 mod(scalar(left), optype), scalar(right));
3263 if (list_assignment(left)) {
3266 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3267 left = mod(left, OP_AASSIGN);
3275 o = newBINOP(OP_AASSIGN, flags,
3276 list(force_list(right)),
3277 list(force_list(left)) );
3278 o->op_private = 0 | (flags >> 8);
3279 if (!(left->op_private & OPpLVAL_INTRO)) {
3283 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3284 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3285 if (curop->op_type == OP_GV) {
3286 GV *gv = cGVOPx_gv(curop);
3287 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3289 SvCUR(gv) = PL_generation;
3291 else if (curop->op_type == OP_PADSV ||
3292 curop->op_type == OP_PADAV ||
3293 curop->op_type == OP_PADHV ||
3294 curop->op_type == OP_PADANY) {
3295 SV **svp = AvARRAY(PL_comppad_name);
3296 SV *sv = svp[curop->op_targ];
3297 if (SvCUR(sv) == PL_generation)
3299 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3301 else if (curop->op_type == OP_RV2CV)
3303 else if (curop->op_type == OP_RV2SV ||
3304 curop->op_type == OP_RV2AV ||
3305 curop->op_type == OP_RV2HV ||
3306 curop->op_type == OP_RV2GV) {
3307 if (lastop->op_type != OP_GV) /* funny deref? */
3310 else if (curop->op_type == OP_PUSHRE) {
3311 if (((PMOP*)curop)->op_pmreplroot) {
3312 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3313 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3315 SvCUR(gv) = PL_generation;
3324 o->op_private = OPpASSIGN_COMMON;
3326 if (right && right->op_type == OP_SPLIT) {
3328 if ((tmpop = ((LISTOP*)right)->op_first) &&
3329 tmpop->op_type == OP_PUSHRE)
3331 PMOP *pm = (PMOP*)tmpop;
3332 if (left->op_type == OP_RV2AV &&
3333 !(left->op_private & OPpLVAL_INTRO) &&
3334 !(o->op_private & OPpASSIGN_COMMON) )
3336 tmpop = ((UNOP*)left)->op_first;
3337 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3339 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3340 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3342 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3343 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3345 pm->op_pmflags |= PMf_ONCE;
3346 tmpop = cUNOPo->op_first; /* to list (nulled) */
3347 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3348 tmpop->op_sibling = Nullop; /* don't free split */
3349 right->op_next = tmpop->op_next; /* fix starting loc */
3350 op_free(o); /* blow off assign */
3351 right->op_flags &= ~OPf_WANT;
3352 /* "I don't know and I don't care." */
3357 if (PL_modcount < 10000 &&
3358 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3360 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3362 sv_setiv(sv, PL_modcount+1);
3370 right = newOP(OP_UNDEF, 0);
3371 if (right->op_type == OP_READLINE) {
3372 right->op_flags |= OPf_STACKED;
3373 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3376 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3377 o = newBINOP(OP_SASSIGN, flags,
3378 scalar(right), mod(scalar(left), OP_SASSIGN) );
3390 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3393 U32 seq = intro_my();
3396 NewOp(1101, cop, 1, COP);
3397 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3398 cop->op_type = OP_DBSTATE;
3399 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3402 cop->op_type = OP_NEXTSTATE;
3403 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3405 cop->op_flags = flags;
3406 cop->op_private = (PL_hints & HINT_BYTE);
3408 cop->op_private |= NATIVE_HINTS;
3410 PL_compiling.op_private = cop->op_private;
3411 cop->op_next = (OP*)cop;
3414 cop->cop_label = label;
3415 PL_hints |= HINT_BLOCK_SCOPE;
3418 cop->cop_arybase = PL_curcop->cop_arybase;
3419 if (specialWARN(PL_curcop->cop_warnings))
3420 cop->cop_warnings = PL_curcop->cop_warnings ;
3422 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3425 if (PL_copline == NOLINE)
3426 CopLINE_set(cop, CopLINE(PL_curcop));
3428 CopLINE_set(cop, PL_copline);
3429 PL_copline = NOLINE;
3432 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXXXX share in a pvtable? */
3434 CopFILEGV_set(cop, (GV*)SvREFCNT_inc(CopFILEGV(PL_curcop)));
3436 CopSTASH_set(cop, PL_curstash);
3438 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3439 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3440 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3441 (void)SvIOK_on(*svp);
3442 SvIVX(*svp) = PTR2IV(cop);
3446 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3449 /* "Introduce" my variables to visible status. */
3457 if (! PL_min_intro_pending)
3458 return PL_cop_seqmax;
3460 svp = AvARRAY(PL_comppad_name);
3461 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3462 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3463 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3464 SvNVX(sv) = (NV)PL_cop_seqmax;
3467 PL_min_intro_pending = 0;
3468 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3469 return PL_cop_seqmax++;
3473 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3475 return new_logop(type, flags, &first, &other);
3479 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3484 OP *first = *firstp;
3485 OP *other = *otherp;
3487 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3488 return newBINOP(type, flags, scalar(first), scalar(other));
3490 scalarboolean(first);
3491 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3492 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3493 if (type == OP_AND || type == OP_OR) {
3499 first = *firstp = cUNOPo->op_first;
3501 first->op_next = o->op_next;
3502 cUNOPo->op_first = Nullop;
3506 if (first->op_type == OP_CONST) {
3507 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3508 Perl_warner(aTHX_ WARN_PRECEDENCE, "Probable precedence problem on %s",
3510 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3521 else if (first->op_type == OP_WANTARRAY) {
3527 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3528 OP *k1 = ((UNOP*)first)->op_first;
3529 OP *k2 = k1->op_sibling;
3531 switch (first->op_type)
3534 if (k2 && k2->op_type == OP_READLINE
3535 && (k2->op_flags & OPf_STACKED)
3536 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3538 warnop = k2->op_type;
3543 if (k1->op_type == OP_READDIR
3544 || k1->op_type == OP_GLOB
3545 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3546 || k1->op_type == OP_EACH)
3548 warnop = ((k1->op_type == OP_NULL)
3549 ? k1->op_targ : k1->op_type);
3554 line_t oldline = CopLINE(PL_curcop);
3555 CopLINE_set(PL_curcop, PL_copline);
3556 Perl_warner(aTHX_ WARN_UNSAFE,
3557 "Value of %s%s can be \"0\"; test with defined()",
3559 ((warnop == OP_READLINE || warnop == OP_GLOB)
3560 ? " construct" : "() operator"));
3561 CopLINE_set(PL_curcop, oldline);
3568 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3569 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3571 NewOp(1101, logop, 1, LOGOP);
3573 logop->op_type = type;
3574 logop->op_ppaddr = PL_ppaddr[type];
3575 logop->op_first = first;
3576 logop->op_flags = flags | OPf_KIDS;
3577 logop->op_other = LINKLIST(other);
3578 logop->op_private = 1 | (flags >> 8);
3580 /* establish postfix order */
3581 logop->op_next = LINKLIST(first);
3582 first->op_next = (OP*)logop;
3583 first->op_sibling = other;
3585 o = newUNOP(OP_NULL, 0, (OP*)logop);
3592 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3600 return newLOGOP(OP_AND, 0, first, trueop);
3602 return newLOGOP(OP_OR, 0, first, falseop);
3604 scalarboolean(first);
3605 if (first->op_type == OP_CONST) {
3606 if (SvTRUE(((SVOP*)first)->op_sv)) {
3617 else if (first->op_type == OP_WANTARRAY) {
3621 NewOp(1101, logop, 1, LOGOP);
3622 logop->op_type = OP_COND_EXPR;
3623 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3624 logop->op_first = first;
3625 logop->op_flags = flags | OPf_KIDS;
3626 logop->op_private = 1 | (flags >> 8);
3627 logop->op_other = LINKLIST(trueop);
3628 logop->op_next = LINKLIST(falseop);
3631 /* establish postfix order */
3632 start = LINKLIST(first);
3633 first->op_next = (OP*)logop;
3635 first->op_sibling = trueop;
3636 trueop->op_sibling = falseop;
3637 o = newUNOP(OP_NULL, 0, (OP*)logop);
3639 trueop->op_next = falseop->op_next = o;
3646 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3655 NewOp(1101, range, 1, LOGOP);
3657 range->op_type = OP_RANGE;
3658 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3659 range->op_first = left;
3660 range->op_flags = OPf_KIDS;
3661 leftstart = LINKLIST(left);
3662 range->op_other = LINKLIST(right);
3663 range->op_private = 1 | (flags >> 8);
3665 left->op_sibling = right;
3667 range->op_next = (OP*)range;
3668 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3669 flop = newUNOP(OP_FLOP, 0, flip);
3670 o = newUNOP(OP_NULL, 0, flop);
3672 range->op_next = leftstart;
3674 left->op_next = flip;
3675 right->op_next = flop;
3677 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3678 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3679 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3680 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3682 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3683 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3686 if (!flip->op_private || !flop->op_private)
3687 linklist(o); /* blow off optimizer unless constant */
3693 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3698 int once = block && block->op_flags & OPf_SPECIAL &&
3699 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3702 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3703 return block; /* do {} while 0 does once */
3704 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3705 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3706 expr = newUNOP(OP_DEFINED, 0,
3707 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3708 } else if (expr->op_flags & OPf_KIDS) {
3709 OP *k1 = ((UNOP*)expr)->op_first;
3710 OP *k2 = (k1) ? k1->op_sibling : NULL;
3711 switch (expr->op_type) {
3713 if (k2 && k2->op_type == OP_READLINE
3714 && (k2->op_flags & OPf_STACKED)
3715 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3716 expr = newUNOP(OP_DEFINED, 0, expr);
3720 if (k1->op_type == OP_READDIR
3721 || k1->op_type == OP_GLOB
3722 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3723 || k1->op_type == OP_EACH)
3724 expr = newUNOP(OP_DEFINED, 0, expr);
3730 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3731 o = new_logop(OP_AND, 0, &expr, &listop);
3734 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3736 if (once && o != listop)
3737 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3740 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3742 o->op_flags |= flags;
3744 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3749 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3758 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3759 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3760 expr = newUNOP(OP_DEFINED, 0,
3761 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3762 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3763 OP *k1 = ((UNOP*)expr)->op_first;
3764 OP *k2 = (k1) ? k1->op_sibling : NULL;
3765 switch (expr->op_type) {
3767 if (k2 && k2->op_type == OP_READLINE
3768 && (k2->op_flags & OPf_STACKED)
3769 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3770 expr = newUNOP(OP_DEFINED, 0, expr);
3774 if (k1->op_type == OP_READDIR
3775 || k1->op_type == OP_GLOB
3776 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3777 || k1->op_type == OP_EACH)
3778 expr = newUNOP(OP_DEFINED, 0, expr);
3784 block = newOP(OP_NULL, 0);
3786 block = scope(block);
3790 next = LINKLIST(cont);
3792 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3793 if ((line_t)whileline != NOLINE) {
3794 PL_copline = whileline;
3795 cont = append_elem(OP_LINESEQ, cont,
3796 newSTATEOP(0, Nullch, Nullop));
3800 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3801 redo = LINKLIST(listop);
3804 PL_copline = whileline;
3806 o = new_logop(OP_AND, 0, &expr, &listop);
3807 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3808 op_free(expr); /* oops, it's a while (0) */
3810 return Nullop; /* listop already freed by new_logop */
3813 ((LISTOP*)listop)->op_last->op_next = condop =
3814 (o == listop ? redo : LINKLIST(o));
3822 NewOp(1101,loop,1,LOOP);
3823 loop->op_type = OP_ENTERLOOP;
3824 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3825 loop->op_private = 0;
3826 loop->op_next = (OP*)loop;
3829 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3831 loop->op_redoop = redo;
3832 loop->op_lastop = o;
3835 loop->op_nextop = next;
3837 loop->op_nextop = o;
3839 o->op_flags |= flags;
3840 o->op_private |= (flags >> 8);
3845 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3854 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3855 sv->op_type = OP_RV2GV;
3856 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3858 else if (sv->op_type == OP_PADSV) { /* private variable */
3859 padoff = sv->op_targ;
3864 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3865 padoff = sv->op_targ;
3867 iterflags |= OPf_SPECIAL;
3872 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3876 padoff = find_threadsv("_");
3877 iterflags |= OPf_SPECIAL;
3879 sv = newGVOP(OP_GV, 0, PL_defgv);
3882 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3883 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3884 iterflags |= OPf_STACKED;
3886 else if (expr->op_type == OP_NULL &&
3887 (expr->op_flags & OPf_KIDS) &&
3888 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3890 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3891 * set the STACKED flag to indicate that these values are to be
3892 * treated as min/max values by 'pp_iterinit'.
3894 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3895 LOGOP* range = (LOGOP*) flip->op_first;
3896 OP* left = range->op_first;
3897 OP* right = left->op_sibling;
3900 range->op_flags &= ~OPf_KIDS;
3901 range->op_first = Nullop;
3903 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3904 listop->op_first->op_next = range->op_next;
3905 left->op_next = range->op_other;
3906 right->op_next = (OP*)listop;
3907 listop->op_next = listop->op_first;
3910 expr = (OP*)(listop);
3912 iterflags |= OPf_STACKED;
3915 expr = mod(force_list(expr), OP_GREPSTART);
3919 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3920 append_elem(OP_LIST, expr, scalar(sv))));
3921 assert(!loop->op_next);
3922 #ifdef PL_OP_SLAB_ALLOC
3923 NewOp(1234,tmp,1,LOOP);
3924 Copy(loop,tmp,1,LOOP);
3927 Renew(loop, 1, LOOP);
3929 loop->op_targ = padoff;
3930 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3931 PL_copline = forline;
3932 return newSTATEOP(0, label, wop);
3936 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3942 if (type != OP_GOTO || label->op_type == OP_CONST) {
3943 /* "last()" means "last" */
3944 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3945 o = newOP(type, OPf_SPECIAL);
3947 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3948 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3954 if (label->op_type == OP_ENTERSUB)
3955 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3956 o = newUNOP(type, OPf_STACKED, label);
3958 PL_hints |= HINT_BLOCK_SCOPE;
3963 Perl_cv_undef(pTHX_ CV *cv)
3968 MUTEX_DESTROY(CvMUTEXP(cv));
3969 Safefree(CvMUTEXP(cv));
3972 #endif /* USE_THREADS */
3974 if (!CvXSUB(cv) && CvROOT(cv)) {
3976 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3977 Perl_croak(aTHX_ "Can't undef active subroutine");
3980 Perl_croak(aTHX_ "Can't undef active subroutine");
3981 #endif /* USE_THREADS */
3984 SAVEVPTR(PL_curpad);
3988 op_free(CvROOT(cv));
3989 CvROOT(cv) = Nullop;
3992 SvPOK_off((SV*)cv); /* forget prototype */
3994 SvREFCNT_dec(CvGV(cv));
3996 SvREFCNT_dec(CvOUTSIDE(cv));
3997 CvOUTSIDE(cv) = Nullcv;
3998 if (CvPADLIST(cv)) {
3999 /* may be during global destruction */
4000 if (SvREFCNT(CvPADLIST(cv))) {
4001 I32 i = AvFILLp(CvPADLIST(cv));
4003 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4004 SV* sv = svp ? *svp : Nullsv;
4007 if (sv == (SV*)PL_comppad_name)
4008 PL_comppad_name = Nullav;
4009 else if (sv == (SV*)PL_comppad) {
4010 PL_comppad = Nullav;
4011 PL_curpad = Null(SV**);
4015 SvREFCNT_dec((SV*)CvPADLIST(cv));
4017 CvPADLIST(cv) = Nullav;
4022 S_cv_dump(pTHX_ CV *cv)
4025 CV *outside = CvOUTSIDE(cv);
4026 AV* padlist = CvPADLIST(cv);
4033 PerlIO_printf(Perl_debug_log,
4034 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4036 (CvANON(cv) ? "ANON"
4037 : (cv == PL_main_cv) ? "MAIN"
4038 : CvUNIQUE(cv) ? "UNIQUE"
4039 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4042 : CvANON(outside) ? "ANON"
4043 : (outside == PL_main_cv) ? "MAIN"
4044 : CvUNIQUE(outside) ? "UNIQUE"
4045 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4050 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4051 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4052 pname = AvARRAY(pad_name);
4053 ppad = AvARRAY(pad);
4055 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4056 if (SvPOK(pname[ix]))
4057 PerlIO_printf(Perl_debug_log,
4058 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4059 (int)ix, PTR2UV(ppad[ix]),
4060 SvFAKE(pname[ix]) ? "FAKE " : "",
4062 (IV)I_32(SvNVX(pname[ix])),
4065 #endif /* DEBUGGING */
4069 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4074 AV* protopadlist = CvPADLIST(proto);
4075 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4076 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4077 SV** pname = AvARRAY(protopad_name);
4078 SV** ppad = AvARRAY(protopad);
4079 I32 fname = AvFILLp(protopad_name);
4080 I32 fpad = AvFILLp(protopad);
4084 assert(!CvUNIQUE(proto));
4087 SAVEVPTR(PL_curpad);
4088 SAVESPTR(PL_comppad);
4089 SAVESPTR(PL_comppad_name);
4090 SAVESPTR(PL_compcv);
4092 cv = PL_compcv = (CV*)NEWSV(1104,0);
4093 sv_upgrade((SV *)cv, SvTYPE(proto));
4099 New(666, CvMUTEXP(cv), 1, perl_mutex);
4100 MUTEX_INIT(CvMUTEXP(cv));
4102 #endif /* USE_THREADS */
4103 CvFILE(cv) = CvFILE(proto);
4104 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4105 CvSTASH(cv) = CvSTASH(proto);
4106 CvROOT(cv) = CvROOT(proto);
4107 CvSTART(cv) = CvSTART(proto);
4109 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4112 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4114 PL_comppad_name = newAV();
4115 for (ix = fname; ix >= 0; ix--)
4116 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4118 PL_comppad = newAV();
4120 comppadlist = newAV();
4121 AvREAL_off(comppadlist);
4122 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4123 av_store(comppadlist, 1, (SV*)PL_comppad);
4124 CvPADLIST(cv) = comppadlist;
4125 av_fill(PL_comppad, AvFILLp(protopad));
4126 PL_curpad = AvARRAY(PL_comppad);
4128 av = newAV(); /* will be @_ */
4130 av_store(PL_comppad, 0, (SV*)av);
4131 AvFLAGS(av) = AVf_REIFY;
4133 for (ix = fpad; ix > 0; ix--) {
4134 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4135 if (namesv && namesv != &PL_sv_undef) {
4136 char *name = SvPVX(namesv); /* XXX */
4137 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4138 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4139 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4141 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4143 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4145 else { /* our own lexical */
4148 /* anon code -- we'll come back for it */
4149 sv = SvREFCNT_inc(ppad[ix]);
4151 else if (*name == '@')
4153 else if (*name == '%')
4162 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4163 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4166 SV* sv = NEWSV(0,0);
4172 /* Now that vars are all in place, clone nested closures. */
4174 for (ix = fpad; ix > 0; ix--) {
4175 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4177 && namesv != &PL_sv_undef
4178 && !(SvFLAGS(namesv) & SVf_FAKE)
4179 && *SvPVX(namesv) == '&'
4180 && CvCLONE(ppad[ix]))
4182 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4183 SvREFCNT_dec(ppad[ix]);
4186 PL_curpad[ix] = (SV*)kid;
4190 #ifdef DEBUG_CLOSURES
4191 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4193 PerlIO_printf(Perl_debug_log, " from:\n");
4195 PerlIO_printf(Perl_debug_log, " to:\n");
4204 Perl_cv_clone(pTHX_ CV *proto)
4207 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4208 cv = cv_clone2(proto, CvOUTSIDE(proto));
4209 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4214 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4218 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_UNSAFE)) {
4219 SV* msg = sv_newmortal();
4223 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4224 sv_setpv(msg, "Prototype mismatch:");
4226 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4228 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4229 sv_catpv(msg, " vs ");
4231 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4233 sv_catpv(msg, "none");
4234 Perl_warner(aTHX_ WARN_UNSAFE, "%"SVf, msg);
4239 Perl_cv_const_sv(pTHX_ CV *cv)
4241 if (!cv || !SvPOK(cv) || SvCUR(cv))
4243 return op_const_sv(CvSTART(cv), cv);
4247 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4254 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4255 o = cLISTOPo->op_first->op_sibling;
4257 for (; o; o = o->op_next) {
4258 OPCODE type = o->op_type;
4260 if (sv && o->op_next == o)
4262 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4264 if (type == OP_LEAVESUB || type == OP_RETURN)
4268 if (type == OP_CONST && cSVOPo->op_sv)
4270 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4271 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4272 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4273 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4285 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4295 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4299 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4301 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4305 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4309 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4310 GV *gv = gv_fetchpv(name ? name : "__ANON__",
4311 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4313 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4324 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4325 maximum a prototype before. */
4326 if (SvTYPE(gv) > SVt_NULL) {
4327 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4328 && ckWARN_d(WARN_UNSAFE))
4330 Perl_warner(aTHX_ WARN_UNSAFE, "Runaway prototype");
4332 cv_ckproto((CV*)gv, NULL, ps);
4335 sv_setpv((SV*)gv, ps);
4337 sv_setiv((SV*)gv, -1);
4338 SvREFCNT_dec(PL_compcv);
4339 cv = PL_compcv = NULL;
4340 PL_sub_generation++;
4344 if (!name || GvCVGEN(gv))
4346 else if (cv = GvCV(gv)) {
4347 cv_ckproto(cv, gv, ps);
4348 /* already defined (or promised)? */
4349 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4351 bool const_changed = TRUE;
4352 if (!block && !attrs) {
4353 /* just a "sub foo;" when &foo is already defined */
4354 SAVEFREESV(PL_compcv);
4357 /* ahem, death to those who redefine active sort subs */
4358 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4359 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4362 if(const_sv = cv_const_sv(cv))
4363 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4364 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
4365 && !(CvGV(cv) && GvSTASH(CvGV(cv))
4366 && HvNAME(GvSTASH(CvGV(cv)))
4367 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
4369 line_t oldline = CopLINE(PL_curcop);
4370 CopLINE_set(PL_curcop, PL_copline);
4371 Perl_warner(aTHX_ WARN_REDEFINE,
4372 const_sv ? "Constant subroutine %s redefined"
4373 : "Subroutine %s redefined", name);
4374 CopLINE_set(PL_curcop, oldline);
4385 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4386 * before we clobber PL_compcv.
4390 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4391 stash = GvSTASH(CvGV(cv));
4392 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4393 stash = CvSTASH(cv);
4395 stash = PL_curstash;
4398 /* possibly about to re-define existing subr -- ignore old cv */
4399 rcv = (SV*)PL_compcv;
4400 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4401 stash = GvSTASH(gv);
4403 stash = PL_curstash;
4405 apply_attrs(stash, rcv, attrs);
4407 if (cv) { /* must reuse cv if autoloaded */
4409 /* got here with just attrs -- work done, so bug out */
4410 SAVEFREESV(PL_compcv);
4414 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4415 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4416 CvOUTSIDE(PL_compcv) = 0;
4417 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4418 CvPADLIST(PL_compcv) = 0;
4419 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4420 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4421 SvREFCNT_dec(PL_compcv);
4428 PL_sub_generation++;
4431 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4432 CvFILE(cv) = CopFILE(PL_curcop);
4433 CvSTASH(cv) = PL_curstash;
4436 if (!CvMUTEXP(cv)) {
4437 New(666, CvMUTEXP(cv), 1, perl_mutex);
4438 MUTEX_INIT(CvMUTEXP(cv));
4440 #endif /* USE_THREADS */
4443 sv_setpv((SV*)cv, ps);
4445 if (PL_error_count) {
4449 char *s = strrchr(name, ':');
4451 if (strEQ(s, "BEGIN")) {
4453 "BEGIN not safe after errors--compilation aborted";
4454 if (PL_in_eval & EVAL_KEEPERR)
4455 Perl_croak(aTHX_ not_safe);
4457 /* force display of errors found but not reported */
4458 sv_catpv(ERRSV, not_safe);
4459 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4466 PL_copline = NOLINE;
4471 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4472 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4475 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4478 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4480 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4481 OpREFCNT_set(CvROOT(cv), 1);
4482 CvSTART(cv) = LINKLIST(CvROOT(cv));
4483 CvROOT(cv)->op_next = 0;
4486 /* now that optimizer has done its work, adjust pad values */
4488 SV **namep = AvARRAY(PL_comppad_name);
4489 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4492 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4495 * The only things that a clonable function needs in its
4496 * pad are references to outer lexicals and anonymous subs.
4497 * The rest are created anew during cloning.
4499 if (!((namesv = namep[ix]) != Nullsv &&
4500 namesv != &PL_sv_undef &&
4502 *SvPVX(namesv) == '&')))
4504 SvREFCNT_dec(PL_curpad[ix]);
4505 PL_curpad[ix] = Nullsv;
4510 AV *av = newAV(); /* Will be @_ */
4512 av_store(PL_comppad, 0, (SV*)av);
4513 AvFLAGS(av) = AVf_REIFY;
4515 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4516 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4518 if (!SvPADMY(PL_curpad[ix]))
4519 SvPADTMP_on(PL_curpad[ix]);
4526 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4527 SV *sv = NEWSV(0,0);
4528 SV *tmpstr = sv_newmortal();
4529 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4533 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4535 (long)PL_subline, (long)CopLINE(PL_curcop));
4536 gv_efullname3(tmpstr, gv, Nullch);
4537 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4538 hv = GvHVn(db_postponed);
4539 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4540 && (cv = GvCV(db_postponed))) {
4545 call_sv((SV*)cv, G_DISCARD);
4549 if ((s = strrchr(name,':')))
4554 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4557 if (strEQ(s, "BEGIN")) {
4558 I32 oldscope = PL_scopestack_ix;
4560 SAVECOPFILE(&PL_compiling);
4561 SAVECOPLINE(&PL_compiling);
4563 sv_setsv(PL_rs, PL_nrs);
4566 PL_beginav = newAV();
4567 DEBUG_x( dump_sub(gv) );
4568 av_push(PL_beginav, SvREFCNT_inc(cv));
4570 call_list(oldscope, PL_beginav);
4572 PL_curcop = &PL_compiling;
4573 PL_compiling.op_private = PL_hints;
4576 else if (strEQ(s, "END") && !PL_error_count) {
4579 DEBUG_x( dump_sub(gv) );
4580 av_unshift(PL_endav, 1);
4581 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4584 else if (strEQ(s, "CHECK") && !PL_error_count) {
4586 PL_checkav = newAV();
4587 DEBUG_x( dump_sub(gv) );
4588 av_unshift(PL_checkav, 1);
4589 av_store(PL_checkav, 0, SvREFCNT_inc(cv));
4592 else if (strEQ(s, "INIT") && !PL_error_count) {
4594 PL_initav = newAV();
4595 DEBUG_x( dump_sub(gv) );
4596 av_push(PL_initav, SvREFCNT_inc(cv));
4602 PL_copline = NOLINE;
4607 /* XXX unsafe for threads if eval_owner isn't held */
4609 =for apidoc newCONSTSUB
4611 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4612 eligible for inlining at compile-time.
4618 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4623 SAVECOPLINE(PL_curcop);
4626 CopLINE_set(PL_curcop, PL_copline);
4627 PL_hints &= ~HINT_BLOCK_SCOPE;
4630 SAVESPTR(PL_curstash);
4631 SAVECOPSTASH(PL_curcop);
4632 PL_curstash = stash;
4634 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4636 CopSTASH(PL_curcop) = stash;
4641 start_subparse(FALSE, 0),
4642 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4643 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4645 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4652 =for apidoc U||newXS
4654 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4660 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4663 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4666 if (cv = (name ? GvCV(gv) : Nullcv)) {
4668 /* just a cached method */
4672 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4673 /* already defined (or promised) */
4674 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4675 && HvNAME(GvSTASH(CvGV(cv)))
4676 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4677 line_t oldline = CopLINE(PL_curcop);
4678 if (PL_copline != NOLINE)
4679 CopLINE_set(PL_curcop, PL_copline);
4680 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4681 CopLINE_set(PL_curcop, oldline);
4688 if (cv) /* must reuse cv if autoloaded */
4691 cv = (CV*)NEWSV(1105,0);
4692 sv_upgrade((SV *)cv, SVt_PVCV);
4696 PL_sub_generation++;
4699 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4701 New(666, CvMUTEXP(cv), 1, perl_mutex);
4702 MUTEX_INIT(CvMUTEXP(cv));
4704 #endif /* USE_THREADS */
4705 (void)gv_fetchfile(filename);
4706 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4707 an external constant string */
4708 CvXSUB(cv) = subaddr;
4711 char *s = strrchr(name,':');
4717 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4720 if (strEQ(s, "BEGIN")) {
4722 PL_beginav = newAV();
4723 av_push(PL_beginav, SvREFCNT_inc(cv));
4726 else if (strEQ(s, "END")) {
4729 av_unshift(PL_endav, 1);
4730 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4733 else if (strEQ(s, "CHECK")) {
4735 PL_checkav = newAV();
4736 av_unshift(PL_checkav, 1);
4737 av_store(PL_checkav, 0, SvREFCNT_inc(cv));
4740 else if (strEQ(s, "INIT")) {
4742 PL_initav = newAV();
4743 av_push(PL_initav, SvREFCNT_inc(cv));
4755 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4765 name = SvPVx(cSVOPo->op_sv, n_a);
4768 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4770 if (cv = GvFORM(gv)) {
4771 if (ckWARN(WARN_REDEFINE)) {
4772 line_t oldline = CopLINE(PL_curcop);
4774 CopLINE_set(PL_curcop, PL_copline);
4775 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4776 CopLINE_set(PL_curcop, oldline);
4782 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4783 CvFILE(cv) = CopFILE(PL_curcop);
4785 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4786 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4787 SvPADTMP_on(PL_curpad[ix]);
4790 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4791 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4792 OpREFCNT_set(CvROOT(cv), 1);
4793 CvSTART(cv) = LINKLIST(CvROOT(cv));
4794 CvROOT(cv)->op_next = 0;
4797 PL_copline = NOLINE;
4802 Perl_newANONLIST(pTHX_ OP *o)
4804 return newUNOP(OP_REFGEN, 0,
4805 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4809 Perl_newANONHASH(pTHX_ OP *o)
4811 return newUNOP(OP_REFGEN, 0,
4812 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4816 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4818 return newANONATTRSUB(floor, proto, Nullop, block);
4822 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4824 return newUNOP(OP_REFGEN, 0,
4825 newSVOP(OP_ANONCODE, 0,
4826 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4830 Perl_oopsAV(pTHX_ OP *o)
4832 switch (o->op_type) {
4834 o->op_type = OP_PADAV;
4835 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4836 return ref(o, OP_RV2AV);
4839 o->op_type = OP_RV2AV;
4840 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4845 if (ckWARN_d(WARN_INTERNAL))
4846 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4853 Perl_oopsHV(pTHX_ OP *o)
4857 switch (o->op_type) {
4860 o->op_type = OP_PADHV;
4861 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4862 return ref(o, OP_RV2HV);
4866 o->op_type = OP_RV2HV;
4867 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4872 if (ckWARN_d(WARN_INTERNAL))
4873 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
4880 Perl_newAVREF(pTHX_ OP *o)
4882 if (o->op_type == OP_PADANY) {
4883 o->op_type = OP_PADAV;
4884 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4887 return newUNOP(OP_RV2AV, 0, scalar(o));
4891 Perl_newGVREF(pTHX_ I32 type, OP *o)
4893 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4894 return newUNOP(OP_NULL, 0, o);
4895 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4899 Perl_newHVREF(pTHX_ OP *o)
4901 if (o->op_type == OP_PADANY) {
4902 o->op_type = OP_PADHV;
4903 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4906 return newUNOP(OP_RV2HV, 0, scalar(o));
4910 Perl_oopsCV(pTHX_ OP *o)
4912 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4918 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4920 return newUNOP(OP_RV2CV, flags, scalar(o));
4924 Perl_newSVREF(pTHX_ OP *o)
4926 if (o->op_type == OP_PADANY) {
4927 o->op_type = OP_PADSV;
4928 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4931 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4932 o->op_flags |= OPpDONE_SVREF;
4935 return newUNOP(OP_RV2SV, 0, scalar(o));
4938 /* Check routines. */
4941 Perl_ck_anoncode(pTHX_ OP *o)
4946 name = NEWSV(1106,0);
4947 sv_upgrade(name, SVt_PVNV);
4948 sv_setpvn(name, "&", 1);
4951 ix = pad_alloc(o->op_type, SVs_PADMY);
4952 av_store(PL_comppad_name, ix, name);
4953 av_store(PL_comppad, ix, cSVOPo->op_sv);
4954 SvPADMY_on(cSVOPo->op_sv);
4955 cSVOPo->op_sv = Nullsv;
4956 cSVOPo->op_targ = ix;
4961 Perl_ck_bitop(pTHX_ OP *o)
4963 o->op_private = PL_hints;
4968 Perl_ck_concat(pTHX_ OP *o)
4970 if (cUNOPo->op_first->op_type == OP_CONCAT)
4971 o->op_flags |= OPf_STACKED;
4976 Perl_ck_spair(pTHX_ OP *o)
4978 if (o->op_flags & OPf_KIDS) {
4981 OPCODE type = o->op_type;
4982 o = modkids(ck_fun(o), type);
4983 kid = cUNOPo->op_first;
4984 newop = kUNOP->op_first->op_sibling;
4986 (newop->op_sibling ||
4987 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4988 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4989 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4993 op_free(kUNOP->op_first);
4994 kUNOP->op_first = newop;
4996 o->op_ppaddr = PL_ppaddr[++o->op_type];
5001 Perl_ck_delete(pTHX_ OP *o)
5005 if (o->op_flags & OPf_KIDS) {
5006 OP *kid = cUNOPo->op_first;
5007 switch (kid->op_type) {
5009 o->op_flags |= OPf_SPECIAL;
5012 o->op_private |= OPpSLICE;
5015 o->op_flags |= OPf_SPECIAL;
5020 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5021 PL_op_desc[o->op_type]);
5029 Perl_ck_eof(pTHX_ OP *o)
5031 I32 type = o->op_type;
5033 if (o->op_flags & OPf_KIDS) {
5034 if (cLISTOPo->op_first->op_type == OP_STUB) {
5036 o = newUNOP(type, OPf_SPECIAL,
5037 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5045 Perl_ck_eval(pTHX_ OP *o)
5047 PL_hints |= HINT_BLOCK_SCOPE;
5048 if (o->op_flags & OPf_KIDS) {
5049 SVOP *kid = (SVOP*)cUNOPo->op_first;
5052 o->op_flags &= ~OPf_KIDS;
5055 else if (kid->op_type == OP_LINESEQ) {
5058 kid->op_next = o->op_next;
5059 cUNOPo->op_first = 0;
5062 NewOp(1101, enter, 1, LOGOP);
5063 enter->op_type = OP_ENTERTRY;
5064 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5065 enter->op_private = 0;
5067 /* establish postfix order */
5068 enter->op_next = (OP*)enter;
5070 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5071 o->op_type = OP_LEAVETRY;
5072 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5073 enter->op_other = o;
5081 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5083 o->op_targ = (PADOFFSET)PL_hints;
5088 Perl_ck_exec(pTHX_ OP *o)
5091 if (o->op_flags & OPf_STACKED) {
5093 kid = cUNOPo->op_first->op_sibling;
5094 if (kid->op_type == OP_RV2GV)
5103 Perl_ck_exists(pTHX_ OP *o)
5106 if (o->op_flags & OPf_KIDS) {
5107 OP *kid = cUNOPo->op_first;
5108 if (kid->op_type == OP_ENTERSUB) {
5109 (void) ref(kid, o->op_type);
5110 if (kid->op_type != OP_RV2CV && !PL_error_count)
5111 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5112 PL_op_desc[o->op_type]);
5113 o->op_private |= OPpEXISTS_SUB;
5115 else if (kid->op_type == OP_AELEM)
5116 o->op_flags |= OPf_SPECIAL;
5117 else if (kid->op_type != OP_HELEM)
5118 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5119 PL_op_desc[o->op_type]);
5127 Perl_ck_gvconst(pTHX_ register OP *o)
5129 o = fold_constants(o);
5130 if (o->op_type == OP_CONST)
5137 Perl_ck_rvconst(pTHX_ register OP *o)
5140 SVOP *kid = (SVOP*)cUNOPo->op_first;
5142 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5143 if (kid->op_type == OP_CONST) {
5147 SV *kidsv = kid->op_sv;
5150 /* Is it a constant from cv_const_sv()? */
5151 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5152 SV *rsv = SvRV(kidsv);
5153 int svtype = SvTYPE(rsv);
5154 char *badtype = Nullch;
5156 switch (o->op_type) {
5158 if (svtype > SVt_PVMG)
5159 badtype = "a SCALAR";
5162 if (svtype != SVt_PVAV)
5163 badtype = "an ARRAY";
5166 if (svtype != SVt_PVHV) {
5167 if (svtype == SVt_PVAV) { /* pseudohash? */
5168 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5169 if (ksv && SvROK(*ksv)
5170 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5179 if (svtype != SVt_PVCV)
5184 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5187 name = SvPV(kidsv, n_a);
5188 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5189 char *badthing = Nullch;
5190 switch (o->op_type) {
5192 badthing = "a SCALAR";
5195 badthing = "an ARRAY";
5198 badthing = "a HASH";
5203 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5207 * This is a little tricky. We only want to add the symbol if we
5208 * didn't add it in the lexer. Otherwise we get duplicate strict
5209 * warnings. But if we didn't add it in the lexer, we must at
5210 * least pretend like we wanted to add it even if it existed before,
5211 * or we get possible typo warnings. OPpCONST_ENTERED says
5212 * whether the lexer already added THIS instance of this symbol.
5214 iscv = (o->op_type == OP_RV2CV) * 2;
5216 gv = gv_fetchpv(name,
5217 iscv | !(kid->op_private & OPpCONST_ENTERED),
5220 : o->op_type == OP_RV2SV
5222 : o->op_type == OP_RV2AV
5224 : o->op_type == OP_RV2HV
5227 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5229 kid->op_type = OP_GV;
5230 SvREFCNT_dec(kid->op_sv);
5232 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5233 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5235 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5237 kid->op_sv = SvREFCNT_inc(gv);
5239 kid->op_ppaddr = PL_ppaddr[OP_GV];
5246 Perl_ck_ftst(pTHX_ OP *o)
5249 I32 type = o->op_type;
5251 if (o->op_flags & OPf_REF) {
5254 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5255 SVOP *kid = (SVOP*)cUNOPo->op_first;
5257 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5259 OP *newop = newGVOP(type, OPf_REF,
5260 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5267 if (type == OP_FTTTY)
5268 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5271 o = newUNOP(type, 0, newDEFSVOP());
5274 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5276 if (PL_hints & HINT_LOCALE)
5277 o->op_private |= OPpLOCALE;
5284 Perl_ck_fun(pTHX_ OP *o)
5291 int type = o->op_type;
5292 register I32 oa = PL_opargs[type] >> OASHIFT;
5294 if (o->op_flags & OPf_STACKED) {
5295 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5298 return no_fh_allowed(o);
5301 if (o->op_flags & OPf_KIDS) {
5303 tokid = &cLISTOPo->op_first;
5304 kid = cLISTOPo->op_first;
5305 if (kid->op_type == OP_PUSHMARK ||
5306 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
5308 tokid = &kid->op_sibling;
5309 kid = kid->op_sibling;
5311 if (!kid && PL_opargs[type] & OA_DEFGV)
5312 *tokid = kid = newDEFSVOP();
5316 sibl = kid->op_sibling;
5319 /* list seen where single (scalar) arg expected? */
5320 if (numargs == 1 && !(oa >> 4)
5321 && kid->op_type == OP_LIST && type != OP_SCALAR)
5323 return too_many_arguments(o,PL_op_desc[type]);
5336 if (kid->op_type == OP_CONST &&
5337 (kid->op_private & OPpCONST_BARE))
5339 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5340 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5341 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5342 if (ckWARN(WARN_SYNTAX))
5343 Perl_warner(aTHX_ WARN_SYNTAX,
5344 "Array @%s missing the @ in argument %"IVdf" of %s()",
5345 name, (IV)numargs, PL_op_desc[type]);
5348 kid->op_sibling = sibl;
5351 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5352 bad_type(numargs, "array", PL_op_desc[type], kid);
5356 if (kid->op_type == OP_CONST &&
5357 (kid->op_private & OPpCONST_BARE))
5359 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5360 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5361 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5362 if (ckWARN(WARN_SYNTAX))
5363 Perl_warner(aTHX_ WARN_SYNTAX,
5364 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5365 name, (IV)numargs, PL_op_desc[type]);
5368 kid->op_sibling = sibl;
5371 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5372 bad_type(numargs, "hash", PL_op_desc[type], kid);
5377 OP *newop = newUNOP(OP_NULL, 0, kid);
5378 kid->op_sibling = 0;
5380 newop->op_next = newop;
5382 kid->op_sibling = sibl;
5387 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5388 if (kid->op_type == OP_CONST &&
5389 (kid->op_private & OPpCONST_BARE))
5391 OP *newop = newGVOP(OP_GV, 0,
5392 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5397 else if (kid->op_type == OP_READLINE) {
5398 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5399 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5402 I32 flags = OPf_SPECIAL;
5406 /* is this op a FH constructor? */
5407 if (is_handle_constructor(o,numargs)) {
5408 char *name = Nullch;
5412 /* Set a flag to tell rv2gv to vivify
5413 * need to "prove" flag does not mean something
5414 * else already - NI-S 1999/05/07
5417 if (kid->op_type == OP_PADSV) {
5418 SV **namep = av_fetch(PL_comppad_name,
5420 if (namep && *namep)
5421 name = SvPV(*namep, len);
5423 else if (kid->op_type == OP_RV2SV
5424 && kUNOP->op_first->op_type == OP_GV)
5426 GV *gv = cGVOPx_gv(kUNOP->op_first);
5428 len = GvNAMELEN(gv);
5432 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5433 namesv = PL_curpad[targ];
5434 SvUPGRADE(namesv, SVt_PV);
5436 sv_setpvn(namesv, "$", 1);
5437 sv_catpvn(namesv, name, len);
5440 kid->op_sibling = 0;
5441 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5442 kid->op_targ = targ;
5443 kid->op_private |= priv;
5445 kid->op_sibling = sibl;
5451 mod(scalar(kid), type);
5455 tokid = &kid->op_sibling;
5456 kid = kid->op_sibling;
5458 o->op_private |= numargs;
5460 return too_many_arguments(o,PL_op_desc[o->op_type]);
5463 else if (PL_opargs[type] & OA_DEFGV) {
5465 return newUNOP(type, 0, newDEFSVOP());
5469 while (oa & OA_OPTIONAL)
5471 if (oa && oa != OA_LIST)
5472 return too_few_arguments(o,PL_op_desc[o->op_type]);
5478 Perl_ck_glob(pTHX_ OP *o)
5482 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5483 append_elem(OP_GLOB, o, newDEFSVOP());
5485 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5486 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5488 #if !defined(PERL_EXTERNAL_GLOB)
5489 /* XXX this can be tightened up and made more failsafe. */
5491 OP *modname = newSVOP(OP_CONST, 0, newSVpvn("File::Glob", 10));
5492 modname->op_private |= OPpCONST_BARE;
5494 utilize(1, start_subparse(FALSE, 0), Nullop, modname,
5495 newSVOP(OP_CONST, 0, newSVpvn(":globally", 9)));
5496 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5499 #endif /* PERL_EXTERNAL_GLOB */
5501 if (gv && GvIMPORTED_CV(gv)) {
5502 append_elem(OP_GLOB, o,
5503 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5504 o->op_type = OP_LIST;
5505 o->op_ppaddr = PL_ppaddr[OP_LIST];
5506 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5507 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5508 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5509 append_elem(OP_LIST, o,
5510 scalar(newUNOP(OP_RV2CV, 0,
5511 newGVOP(OP_GV, 0, gv)))));
5512 o = newUNOP(OP_NULL, 0, ck_subr(o));
5513 o->op_targ = OP_GLOB; /* hint at what it used to be */
5516 gv = newGVgen("main");
5518 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5524 Perl_ck_grep(pTHX_ OP *o)
5528 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5530 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5531 NewOp(1101, gwop, 1, LOGOP);
5533 if (o->op_flags & OPf_STACKED) {
5536 kid = cLISTOPo->op_first->op_sibling;
5537 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5540 kid->op_next = (OP*)gwop;
5541 o->op_flags &= ~OPf_STACKED;
5543 kid = cLISTOPo->op_first->op_sibling;
5544 if (type == OP_MAPWHILE)
5551 kid = cLISTOPo->op_first->op_sibling;
5552 if (kid->op_type != OP_NULL)
5553 Perl_croak(aTHX_ "panic: ck_grep");
5554 kid = kUNOP->op_first;
5556 gwop->op_type = type;
5557 gwop->op_ppaddr = PL_ppaddr[type];
5558 gwop->op_first = listkids(o);
5559 gwop->op_flags |= OPf_KIDS;
5560 gwop->op_private = 1;
5561 gwop->op_other = LINKLIST(kid);
5562 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5563 kid->op_next = (OP*)gwop;
5565 kid = cLISTOPo->op_first->op_sibling;
5566 if (!kid || !kid->op_sibling)
5567 return too_few_arguments(o,PL_op_desc[o->op_type]);
5568 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5569 mod(kid, OP_GREPSTART);
5575 Perl_ck_index(pTHX_ OP *o)
5577 if (o->op_flags & OPf_KIDS) {
5578 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5580 kid = kid->op_sibling; /* get past "big" */
5581 if (kid && kid->op_type == OP_CONST)
5582 fbm_compile(((SVOP*)kid)->op_sv, 0);
5588 Perl_ck_lengthconst(pTHX_ OP *o)
5590 /* XXX length optimization goes here */
5595 Perl_ck_lfun(pTHX_ OP *o)
5597 OPCODE type = o->op_type;
5598 return modkids(ck_fun(o), type);
5602 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5605 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5606 switch (cUNOPo->op_first->op_type) {
5608 break; /* Globals via GV can be undef */
5610 case OP_AASSIGN: /* Is this a good idea? */
5611 Perl_warner(aTHX_ WARN_DEPRECATED,
5612 "defined(@array) is deprecated");
5613 Perl_warner(aTHX_ WARN_DEPRECATED,
5614 "(Maybe you should just omit the defined()?)\n");
5617 break; /* Globals via GV can be undef */
5619 Perl_warner(aTHX_ WARN_DEPRECATED,
5620 "defined(%%hash) is deprecated");
5621 Perl_warner(aTHX_ WARN_DEPRECATED,
5622 "(Maybe you should just omit the defined()?)\n");
5633 Perl_ck_rfun(pTHX_ OP *o)
5635 OPCODE type = o->op_type;
5636 return refkids(ck_fun(o), type);
5640 Perl_ck_listiob(pTHX_ OP *o)
5644 kid = cLISTOPo->op_first;
5647 kid = cLISTOPo->op_first;
5649 if (kid->op_type == OP_PUSHMARK)
5650 kid = kid->op_sibling;
5651 if (kid && o->op_flags & OPf_STACKED)
5652 kid = kid->op_sibling;
5653 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5654 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5655 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5656 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5657 cLISTOPo->op_first->op_sibling = kid;
5658 cLISTOPo->op_last = kid;
5659 kid = kid->op_sibling;
5664 append_elem(o->op_type, o, newDEFSVOP());
5670 if (PL_hints & HINT_LOCALE)
5671 o->op_private |= OPpLOCALE;
5678 Perl_ck_fun_locale(pTHX_ OP *o)
5684 if (PL_hints & HINT_LOCALE)
5685 o->op_private |= OPpLOCALE;
5692 Perl_ck_sassign(pTHX_ OP *o)
5694 OP *kid = cLISTOPo->op_first;
5695 /* has a disposable target? */
5696 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5697 && !(kid->op_flags & OPf_STACKED))
5699 OP *kkid = kid->op_sibling;
5701 /* Can just relocate the target. */
5702 if (kkid && kkid->op_type == OP_PADSV
5703 && !(kkid->op_private & OPpLVAL_INTRO))
5705 kid->op_targ = kkid->op_targ;
5707 /* Now we do not need PADSV and SASSIGN. */
5708 kid->op_sibling = o->op_sibling; /* NULL */
5709 cLISTOPo->op_first = NULL;
5712 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5720 Perl_ck_scmp(pTHX_ OP *o)
5724 if (PL_hints & HINT_LOCALE)
5725 o->op_private |= OPpLOCALE;
5732 Perl_ck_match(pTHX_ OP *o)
5734 o->op_private |= OPpRUNTIME;
5739 Perl_ck_method(pTHX_ OP *o)
5741 OP *kid = cUNOPo->op_first;
5742 if (kid->op_type == OP_CONST) {
5743 SV* sv = kSVOP->op_sv;
5744 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5746 sv_upgrade(sv, SVt_PVIV);
5748 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5749 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5750 kSVOP->op_sv = Nullsv;
5759 Perl_ck_null(pTHX_ OP *o)
5765 Perl_ck_repeat(pTHX_ OP *o)
5767 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5768 o->op_private |= OPpREPEAT_DOLIST;
5769 cBINOPo->op_first = force_list(cBINOPo->op_first);
5777 Perl_ck_require(pTHX_ OP *o)
5779 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5780 SVOP *kid = (SVOP*)cUNOPo->op_first;
5782 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5784 for (s = SvPVX(kid->op_sv); *s; s++) {
5785 if (*s == ':' && s[1] == ':') {
5787 Move(s+2, s+1, strlen(s+2)+1, char);
5788 --SvCUR(kid->op_sv);
5791 sv_catpvn(kid->op_sv, ".pm", 3);
5799 Perl_ck_retarget(pTHX_ OP *o)
5801 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5808 Perl_ck_select(pTHX_ OP *o)
5811 if (o->op_flags & OPf_KIDS) {
5812 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5813 if (kid && kid->op_sibling) {
5814 o->op_type = OP_SSELECT;
5815 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5817 return fold_constants(o);
5821 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5822 if (kid && kid->op_type == OP_RV2GV)
5823 kid->op_private &= ~HINT_STRICT_REFS;
5828 Perl_ck_shift(pTHX_ OP *o)
5830 I32 type = o->op_type;
5832 if (!(o->op_flags & OPf_KIDS)) {
5837 if (!CvUNIQUE(PL_compcv)) {
5838 argop = newOP(OP_PADAV, OPf_REF);
5839 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5842 argop = newUNOP(OP_RV2AV, 0,
5843 scalar(newGVOP(OP_GV, 0,
5844 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5847 argop = newUNOP(OP_RV2AV, 0,
5848 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5849 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5850 #endif /* USE_THREADS */
5851 return newUNOP(type, 0, scalar(argop));
5853 return scalar(modkids(ck_fun(o), type));
5857 Perl_ck_sort(pTHX_ OP *o)
5861 if (PL_hints & HINT_LOCALE)
5862 o->op_private |= OPpLOCALE;
5865 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5867 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5868 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5870 kid = kUNOP->op_first; /* get past null */
5872 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5874 if (kid->op_type == OP_SCOPE) {
5878 else if (kid->op_type == OP_LEAVE) {
5879 if (o->op_type == OP_SORT) {
5880 null(kid); /* wipe out leave */
5883 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5884 if (k->op_next == kid)
5889 kid->op_next = 0; /* just disconnect the leave */
5890 k = kLISTOP->op_first;
5894 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5895 if (o->op_type == OP_SORT)
5899 o->op_flags |= OPf_SPECIAL;
5901 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5902 null(cLISTOPo->op_first->op_sibling);
5909 S_simplify_sort(pTHX_ OP *o)
5912 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5916 if (!(o->op_flags & OPf_STACKED))
5918 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5919 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5920 kid = kUNOP->op_first; /* get past null */
5921 if (kid->op_type != OP_SCOPE)
5923 kid = kLISTOP->op_last; /* get past scope */
5924 switch(kid->op_type) {
5932 k = kid; /* remember this node*/
5933 if (kBINOP->op_first->op_type != OP_RV2SV)
5935 kid = kBINOP->op_first; /* get past cmp */
5936 if (kUNOP->op_first->op_type != OP_GV)
5938 kid = kUNOP->op_first; /* get past rv2sv */
5940 if (GvSTASH(gv) != PL_curstash)
5942 if (strEQ(GvNAME(gv), "a"))
5944 else if(strEQ(GvNAME(gv), "b"))
5948 kid = k; /* back to cmp */
5949 if (kBINOP->op_last->op_type != OP_RV2SV)
5951 kid = kBINOP->op_last; /* down to 2nd arg */
5952 if (kUNOP->op_first->op_type != OP_GV)
5954 kid = kUNOP->op_first; /* get past rv2sv */
5956 if (GvSTASH(gv) != PL_curstash
5958 ? strNE(GvNAME(gv), "a")
5959 : strNE(GvNAME(gv), "b")))
5961 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5963 o->op_private |= OPpSORT_REVERSE;
5964 if (k->op_type == OP_NCMP)
5965 o->op_private |= OPpSORT_NUMERIC;
5966 if (k->op_type == OP_I_NCMP)
5967 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5968 kid = cLISTOPo->op_first->op_sibling;
5969 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
5970 op_free(kid); /* then delete it */
5971 cLISTOPo->op_children--;
5975 Perl_ck_split(pTHX_ OP *o)
5979 if (o->op_flags & OPf_STACKED)
5980 return no_fh_allowed(o);
5982 kid = cLISTOPo->op_first;
5983 if (kid->op_type != OP_NULL)
5984 Perl_croak(aTHX_ "panic: ck_split");
5985 kid = kid->op_sibling;
5986 op_free(cLISTOPo->op_first);
5987 cLISTOPo->op_first = kid;
5989 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5990 cLISTOPo->op_last = kid; /* There was only one element previously */
5993 if (kid->op_type != OP_MATCH) {
5994 OP *sibl = kid->op_sibling;
5995 kid->op_sibling = 0;
5996 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5997 if (cLISTOPo->op_first == cLISTOPo->op_last)
5998 cLISTOPo->op_last = kid;
5999 cLISTOPo->op_first = kid;
6000 kid->op_sibling = sibl;
6003 kid->op_type = OP_PUSHRE;
6004 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6007 if (!kid->op_sibling)
6008 append_elem(OP_SPLIT, o, newDEFSVOP());
6010 kid = kid->op_sibling;
6013 if (!kid->op_sibling)
6014 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6016 kid = kid->op_sibling;
6019 if (kid->op_sibling)
6020 return too_many_arguments(o,PL_op_desc[o->op_type]);
6026 Perl_ck_join(pTHX_ OP *o)
6028 if (ckWARN(WARN_SYNTAX)) {
6029 OP *kid = cLISTOPo->op_first->op_sibling;
6030 if (kid && kid->op_type == OP_MATCH) {
6031 char *pmstr = "STRING";
6032 if (kPMOP->op_pmregexp)
6033 pmstr = kPMOP->op_pmregexp->precomp;
6034 Perl_warner(aTHX_ WARN_SYNTAX,
6035 "/%s/ should probably be written as \"%s\"",
6043 Perl_ck_subr(pTHX_ OP *o)
6046 OP *prev = ((cUNOPo->op_first->op_sibling)
6047 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6048 OP *o2 = prev->op_sibling;
6057 o->op_private |= OPpENTERSUB_HASTARG;
6058 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6059 if (cvop->op_type == OP_RV2CV) {
6061 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6062 null(cvop); /* disable rv2cv */
6063 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6064 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6065 GV *gv = cGVOPx_gv(tmpop);
6068 tmpop->op_private |= OPpEARLY_CV;
6069 else if (SvPOK(cv)) {
6070 namegv = CvANON(cv) ? gv : CvGV(cv);
6071 proto = SvPV((SV*)cv, n_a);
6075 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6076 if (o2->op_type == OP_CONST)
6077 o2->op_private &= ~OPpCONST_STRICT;
6078 else if (o2->op_type == OP_LIST) {
6079 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6080 if (o && o->op_type == OP_CONST)
6081 o->op_private &= ~OPpCONST_STRICT;
6084 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6085 if (PERLDB_SUB && PL_curstash != PL_debstash)
6086 o->op_private |= OPpENTERSUB_DB;
6087 while (o2 != cvop) {
6091 return too_many_arguments(o, gv_ename(namegv));
6109 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6110 bad_type(arg, "block", gv_ename(namegv), o2);
6113 /* '*' allows any scalar type, including bareword */
6116 if (o2->op_type == OP_RV2GV)
6117 goto wrapref; /* autoconvert GLOB -> GLOBref */
6118 else if (o2->op_type == OP_CONST)
6119 o2->op_private &= ~OPpCONST_STRICT;
6120 else if (o2->op_type == OP_ENTERSUB) {
6121 /* accidental subroutine, revert to bareword */
6122 OP *gvop = ((UNOP*)o2)->op_first;
6123 if (gvop && gvop->op_type == OP_NULL) {
6124 gvop = ((UNOP*)gvop)->op_first;
6126 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6129 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6130 (gvop = ((UNOP*)gvop)->op_first) &&
6131 gvop->op_type == OP_GV)
6133 GV *gv = cGVOPx_gv(gvop);
6134 OP *sibling = o2->op_sibling;
6135 SV *n = newSVpvn("",0);
6137 gv_fullname3(n, gv, "");
6138 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6139 sv_chop(n, SvPVX(n)+6);
6140 o2 = newSVOP(OP_CONST, 0, n);
6141 prev->op_sibling = o2;
6142 o2->op_sibling = sibling;
6154 if (o2->op_type != OP_RV2GV)
6155 bad_type(arg, "symbol", gv_ename(namegv), o2);
6158 if (o2->op_type != OP_RV2CV)
6159 bad_type(arg, "sub", gv_ename(namegv), o2);
6162 if (o2->op_type != OP_RV2SV
6163 && o2->op_type != OP_PADSV
6164 && o2->op_type != OP_HELEM
6165 && o2->op_type != OP_AELEM
6166 && o2->op_type != OP_THREADSV)
6168 bad_type(arg, "scalar", gv_ename(namegv), o2);
6172 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6173 bad_type(arg, "array", gv_ename(namegv), o2);
6176 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6177 bad_type(arg, "hash", gv_ename(namegv), o2);
6181 OP* sib = kid->op_sibling;
6182 kid->op_sibling = 0;
6183 o2 = newUNOP(OP_REFGEN, 0, kid);
6184 o2->op_sibling = sib;
6185 prev->op_sibling = o2;
6196 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6197 gv_ename(namegv), SvPV((SV*)cv, n_a));
6202 mod(o2, OP_ENTERSUB);
6204 o2 = o2->op_sibling;
6206 if (proto && !optional &&
6207 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6208 return too_few_arguments(o, gv_ename(namegv));
6213 Perl_ck_svconst(pTHX_ OP *o)
6215 SvREADONLY_on(cSVOPo->op_sv);
6220 Perl_ck_trunc(pTHX_ OP *o)
6222 if (o->op_flags & OPf_KIDS) {
6223 SVOP *kid = (SVOP*)cUNOPo->op_first;
6225 if (kid->op_type == OP_NULL)
6226 kid = (SVOP*)kid->op_sibling;
6227 if (kid && kid->op_type == OP_CONST &&
6228 (kid->op_private & OPpCONST_BARE))
6230 o->op_flags |= OPf_SPECIAL;
6231 kid->op_private &= ~OPpCONST_STRICT;
6237 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6240 Perl_peep(pTHX_ register OP *o)
6243 register OP* oldop = 0;
6245 OP *last_composite = Nullop;
6247 if (!o || o->op_seq)
6251 SAVEVPTR(PL_curcop);
6252 for (; o; o = o->op_next) {
6258 switch (o->op_type) {
6262 PL_curcop = ((COP*)o); /* for warnings */
6263 o->op_seq = PL_op_seqmax++;
6264 last_composite = Nullop;
6268 if (cSVOPo->op_private & OPpCONST_STRICT)
6269 no_bareword_allowed(o);
6271 /* Relocate sv to the pad for thread safety.
6272 * Despite being a "constant", the SV is written to,
6273 * for reference counts, sv_upgrade() etc. */
6275 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6276 SvREFCNT_dec(PL_curpad[ix]);
6277 SvPADTMP_on(cSVOPo->op_sv);
6278 PL_curpad[ix] = cSVOPo->op_sv;
6279 cSVOPo->op_sv = Nullsv;
6291 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6292 if (o->op_next->op_private & OPpTARGET_MY) {
6293 if (o->op_flags & OPf_STACKED) /* chained concats */
6294 goto ignore_optimization;
6296 o->op_targ = o->op_next->op_targ;
6297 o->op_next->op_targ = 0;
6298 o->op_private |= OPpTARGET_MY;
6303 ignore_optimization:
6304 o->op_seq = PL_op_seqmax++;
6307 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6308 o->op_seq = PL_op_seqmax++;
6309 break; /* Scalar stub must produce undef. List stub is noop */
6313 if (o->op_targ == OP_NEXTSTATE
6314 || o->op_targ == OP_DBSTATE
6315 || o->op_targ == OP_SETSTATE)
6317 PL_curcop = ((COP*)o);
6324 if (oldop && o->op_next) {
6325 oldop->op_next = o->op_next;
6328 o->op_seq = PL_op_seqmax++;
6332 if (o->op_next->op_type == OP_RV2SV) {
6333 if (!(o->op_next->op_private & OPpDEREF)) {
6335 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6337 o->op_next = o->op_next->op_next;
6338 o->op_type = OP_GVSV;
6339 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6342 else if (o->op_next->op_type == OP_RV2AV) {
6343 OP* pop = o->op_next->op_next;
6345 if (pop->op_type == OP_CONST &&
6346 (PL_op = pop->op_next) &&
6347 pop->op_next->op_type == OP_AELEM &&
6348 !(pop->op_next->op_private &
6349 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6350 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6358 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6359 o->op_next = pop->op_next->op_next;
6360 o->op_type = OP_AELEMFAST;
6361 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6362 o->op_private = (U8)i;
6367 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_UNSAFE)) {
6369 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6370 /* XXX could check prototype here instead of just carping */
6371 SV *sv = sv_newmortal();
6372 gv_efullname3(sv, gv, Nullch);
6373 Perl_warner(aTHX_ WARN_UNSAFE,
6374 "%s() called too early to check prototype",
6379 o->op_seq = PL_op_seqmax++;
6390 o->op_seq = PL_op_seqmax++;
6391 while (cLOGOP->op_other->op_type == OP_NULL)
6392 cLOGOP->op_other = cLOGOP->op_other->op_next;
6393 peep(cLOGOP->op_other);
6397 o->op_seq = PL_op_seqmax++;
6398 peep(cLOOP->op_redoop);
6399 peep(cLOOP->op_nextop);
6400 peep(cLOOP->op_lastop);
6406 o->op_seq = PL_op_seqmax++;
6407 peep(cPMOP->op_pmreplstart);
6411 o->op_seq = PL_op_seqmax++;
6412 if (ckWARN(WARN_SYNTAX) && o->op_next
6413 && o->op_next->op_type == OP_NEXTSTATE) {
6414 if (o->op_next->op_sibling &&
6415 o->op_next->op_sibling->op_type != OP_EXIT &&
6416 o->op_next->op_sibling->op_type != OP_WARN &&
6417 o->op_next->op_sibling->op_type != OP_DIE) {
6418 line_t oldline = CopLINE(PL_curcop);
6420 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6421 Perl_warner(aTHX_ WARN_EXEC,
6422 "Statement unlikely to be reached");
6423 Perl_warner(aTHX_ WARN_EXEC,
6424 "(Maybe you meant system() when you said exec()?)\n");
6425 CopLINE_set(PL_curcop, oldline);
6439 if ((o->op_private & (OPpLVAL_INTRO))
6440 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6442 rop = (UNOP*)((BINOP*)o)->op_first;
6443 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6445 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6446 if (!SvOBJECT(lexname))
6448 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6449 if (!fields || !GvHV(*fields))
6451 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6452 key = SvPV(*svp, keylen);
6453 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6455 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6456 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6458 ind = SvIV(*indsvp);
6460 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6461 rop->op_type = OP_RV2AV;
6462 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6463 o->op_type = OP_AELEM;
6464 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6466 *svp = newSViv(ind);
6472 if (!(o->op_flags & OPf_WANT)
6473 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6477 o->op_seq = PL_op_seqmax++;
6481 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6482 o->op_seq = PL_op_seqmax++;
6488 if (last_composite) {
6489 OP *r = last_composite;
6491 while (r->op_sibling)
6494 || (r->op_next->op_type == OP_LIST
6495 && r->op_next->op_next == o))
6497 if (last_composite->op_type == OP_RV2AV)
6498 yyerror("Lvalue subs returning arrays not implemented yet");
6500 yyerror("Lvalue subs returning hashes not implemented yet");
6507 o->op_seq = PL_op_seqmax++;