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 */
26 #define OP_REFCNT_LOCK NOOP
27 #define OP_REFCNT_UNLOCK NOOP
28 #define OpREFCNT_set(o,n) NOOP
29 #define OpREFCNT_dec(o) 0
31 #ifdef PL_OP_SLAB_ALLOC
32 #define SLAB_SIZE 8192
33 static char *PL_OpPtr = NULL;
34 static int PL_OpSpace = 0;
35 #define NewOp(m,var,c,type) do { if ((PL_OpSpace -= c*sizeof(type)) >= 0) \
36 var = (type *)(PL_OpPtr -= c*sizeof(type)); \
38 var = (type *) Slab_Alloc(m,c*sizeof(type)); \
42 S_Slab_Alloc(pTHX_ int m, size_t sz)
44 Newz(m,PL_OpPtr,SLAB_SIZE,char);
45 PL_OpSpace = SLAB_SIZE - sz;
46 return PL_OpPtr += PL_OpSpace;
50 #define NewOp(m, var, c, type) Newz(m, var, c, type)
53 * In the following definition, the ", Nullop" is just to make the compiler
54 * think the expression is of the right type: croak actually does a Siglongjmp.
56 #define CHECKOP(type,o) \
57 ((PL_op_mask && PL_op_mask[type]) \
58 ? ( op_free((OP*)o), \
59 Perl_croak(aTHX_ "%s trapped by operation mask", PL_op_desc[type]), \
61 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
63 #define PAD_MAX 999999999
66 S_gv_ename(pTHX_ GV *gv)
69 SV* tmpsv = sv_newmortal();
70 gv_efullname3(tmpsv, gv, Nullch);
71 return SvPV(tmpsv,n_a);
75 S_no_fh_allowed(pTHX_ OP *o)
77 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
78 PL_op_desc[o->op_type]));
83 S_too_few_arguments(pTHX_ OP *o, char *name)
85 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
90 S_too_many_arguments(pTHX_ OP *o, char *name)
92 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
97 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
99 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
100 (int)n, name, t, PL_op_desc[kid->op_type]));
104 S_no_bareword_allowed(pTHX_ OP *o)
106 qerror(Perl_mess(aTHX_
107 "Bareword \"%s\" not allowed while \"strict subs\" in use",
108 SvPV_nolen(cSVOPo->op_sv)));
111 /* "register" allocation */
114 Perl_pad_allocmy(pTHX_ char *name)
121 PL_in_my == KEY_our ||
123 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
124 name[1] == '_' && (int)strlen(name) > 2 ))
126 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
127 /* 1999-02-27 mjd@plover.com */
129 p = strchr(name, '\0');
130 /* The next block assumes the buffer is at least 205 chars
131 long. At present, it's always at least 256 chars. */
133 strcpy(name+200, "...");
139 /* Move everything else down one character */
140 for (; p-name > 2; p--)
142 name[2] = toCTRL(name[1]);
145 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
147 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
148 SV **svp = AvARRAY(PL_comppad_name);
149 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
151 && sv != &PL_sv_undef
152 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
153 && strEQ(name, SvPVX(sv)))
155 Perl_warner(aTHX_ WARN_UNSAFE,
156 "\"%s\" variable %s masks earlier declaration in same %s",
157 (PL_in_my == KEY_our ? "our" : "my"),
159 (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
164 off = pad_alloc(OP_PADSV, SVs_PADMY);
166 sv_upgrade(sv, SVt_PVNV);
168 if (PL_in_my_stash) {
170 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"my\"",
173 (void)SvUPGRADE(sv, SVt_PVMG);
174 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
177 if (PL_in_my == KEY_our)
178 SvFLAGS(sv) |= SVpad_OUR;
179 av_store(PL_comppad_name, off, sv);
180 SvNVX(sv) = (NV)PAD_MAX;
181 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
182 if (!PL_min_intro_pending)
183 PL_min_intro_pending = off;
184 PL_max_intro_pending = off;
186 av_store(PL_comppad, off, (SV*)newAV());
187 else if (*name == '%')
188 av_store(PL_comppad, off, (SV*)newHV());
189 SvPADMY_on(PL_curpad[off]);
193 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
196 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
197 I32 cx_ix, I32 saweval, U32 flags)
204 register PERL_CONTEXT *cx;
206 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
207 AV *curlist = CvPADLIST(cv);
208 SV **svp = av_fetch(curlist, 0, FALSE);
211 if (!svp || *svp == &PL_sv_undef)
214 svp = AvARRAY(curname);
215 for (off = AvFILLp(curname); off > 0; off--) {
216 if ((sv = svp[off]) &&
217 sv != &PL_sv_undef &&
219 seq > I_32(SvNVX(sv)) &&
220 strEQ(SvPVX(sv), name))
231 return 0; /* don't clone from inactive stack frame */
235 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
236 oldsv = *av_fetch(oldpad, off, TRUE);
237 if (!newoff) { /* Not a mere clone operation. */
238 SV *namesv = NEWSV(1103,0);
239 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
240 sv_upgrade(namesv, SVt_PVNV);
241 sv_setpv(namesv, name);
242 av_store(PL_comppad_name, newoff, namesv);
243 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
244 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
245 SvFAKE_on(namesv); /* A ref, not a real var */
246 if (SvFLAGS(sv) & SVpad_OUR)/* An "our" variable */
247 SvFLAGS(namesv) |= SVpad_OUR;
248 if (SvOBJECT(sv)) { /* A typed var */
250 (void)SvUPGRADE(namesv, SVt_PVMG);
251 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
254 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
255 /* "It's closures all the way down." */
256 CvCLONE_on(PL_compcv);
258 if (CvANON(PL_compcv))
259 oldsv = Nullsv; /* no need to keep ref */
264 bcv && bcv != cv && !CvCLONE(bcv);
265 bcv = CvOUTSIDE(bcv))
270 if (ckWARN(WARN_CLOSURE)
271 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
273 Perl_warner(aTHX_ WARN_CLOSURE,
274 "Variable \"%s\" may be unavailable",
282 else if (!CvUNIQUE(PL_compcv)) {
283 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
284 Perl_warner(aTHX_ WARN_CLOSURE,
285 "Variable \"%s\" will not stay shared", name);
288 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
294 if (flags & FINDLEX_NOSEARCH)
297 /* Nothing in current lexical context--try eval's context, if any.
298 * This is necessary to let the perldb get at lexically scoped variables.
299 * XXX This will also probably interact badly with eval tree caching.
302 for (i = cx_ix; i >= 0; i--) {
304 switch (CxTYPE(cx)) {
306 if (i == 0 && saweval) {
307 seq = cxstack[saweval].blk_oldcop->cop_seq;
308 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
312 switch (cx->blk_eval.old_op_type) {
318 /* require must have its own scope */
326 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
327 saweval = i; /* so we know where we were called from */
330 seq = cxstack[saweval].blk_oldcop->cop_seq;
331 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
339 Perl_pad_findmy(pTHX_ char *name)
345 SV **svp = AvARRAY(PL_comppad_name);
346 U32 seq = PL_cop_seqmax;
352 * Special case to get lexical (and hence per-thread) @_.
353 * XXX I need to find out how to tell at parse-time whether use
354 * of @_ should refer to a lexical (from a sub) or defgv (global
355 * scope and maybe weird sub-ish things like formats). See
356 * startsub in perly.y. It's possible that @_ could be lexical
357 * (at least from subs) even in non-threaded perl.
359 if (strEQ(name, "@_"))
360 return 0; /* success. (NOT_IN_PAD indicates failure) */
361 #endif /* USE_THREADS */
363 /* The one we're looking for is probably just before comppad_name_fill. */
364 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
365 if ((sv = svp[off]) &&
366 sv != &PL_sv_undef &&
369 seq > I_32(SvNVX(sv)))) &&
370 strEQ(SvPVX(sv), name))
372 if (SvIVX(sv) || SvFLAGS(sv) & SVpad_OUR)
373 return (PADOFFSET)off;
374 pendoff = off; /* this pending def. will override import */
378 outside = CvOUTSIDE(PL_compcv);
380 /* Check if if we're compiling an eval'', and adjust seq to be the
381 * eval's seq number. This depends on eval'' having a non-null
382 * CvOUTSIDE() while it is being compiled. The eval'' itself is
383 * identified by CvEVAL being true and CvGV being null. */
384 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
385 cx = &cxstack[cxstack_ix];
387 seq = cx->blk_oldcop->cop_seq;
390 /* See if it's in a nested scope */
391 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
393 /* If there is a pending local definition, this new alias must die */
395 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
396 return off; /* pad_findlex returns 0 for failure...*/
398 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
402 Perl_pad_leavemy(pTHX_ I32 fill)
406 SV **svp = AvARRAY(PL_comppad_name);
408 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
409 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
410 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
411 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
414 /* "Deintroduce" my variables that are leaving with this scope. */
415 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
416 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
417 SvIVX(sv) = PL_cop_seqmax;
422 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
428 if (AvARRAY(PL_comppad) != PL_curpad)
429 Perl_croak(aTHX_ "panic: pad_alloc");
430 if (PL_pad_reset_pending)
432 if (tmptype & SVs_PADMY) {
434 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
435 } while (SvPADBUSY(sv)); /* need a fresh one */
436 retval = AvFILLp(PL_comppad);
439 SV **names = AvARRAY(PL_comppad_name);
440 SSize_t names_fill = AvFILLp(PL_comppad_name);
443 * "foreach" index vars temporarily become aliases to non-"my"
444 * values. Thus we must skip, not just pad values that are
445 * marked as current pad values, but also those with names.
447 if (++PL_padix <= names_fill &&
448 (sv = names[PL_padix]) && sv != &PL_sv_undef)
450 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
451 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
456 SvFLAGS(sv) |= tmptype;
457 PL_curpad = AvARRAY(PL_comppad);
459 DEBUG_X(PerlIO_printf(Perl_debug_log,
460 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
461 PTR2UV(thr), PTR2UV(PL_curpad),
462 (long) retval, PL_op_name[optype]));
464 DEBUG_X(PerlIO_printf(Perl_debug_log,
465 "Pad 0x%"UVxf" alloc %ld for %s\n",
467 (long) retval, PL_op_name[optype]));
468 #endif /* USE_THREADS */
469 return (PADOFFSET)retval;
473 Perl_pad_sv(pTHX_ PADOFFSET po)
477 DEBUG_X(PerlIO_printf(Perl_debug_log,
478 "0x%"UVxf" Pad 0x%"UVxf" sv %d\n",
479 PTR2UV(thr), PTR2UV(PL_curpad), po));
482 Perl_croak(aTHX_ "panic: pad_sv po");
483 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %d\n",
484 PTR2UV(PL_curpad), po));
485 #endif /* USE_THREADS */
486 return PL_curpad[po]; /* eventually we'll turn this into a macro */
490 Perl_pad_free(pTHX_ PADOFFSET po)
495 if (AvARRAY(PL_comppad) != PL_curpad)
496 Perl_croak(aTHX_ "panic: pad_free curpad");
498 Perl_croak(aTHX_ "panic: pad_free po");
500 DEBUG_X(PerlIO_printf(Perl_debug_log,
501 "0x%"UVxf" Pad 0x%"UVxf" free %d\n",
502 PTR2UV(thr), PTR2UV(PL_curpad), po));
504 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %d\n",
505 PTR2UV(PL_curpad), po));
506 #endif /* USE_THREADS */
507 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
508 SvPADTMP_off(PL_curpad[po]);
509 if ((I32)po < PL_padix)
514 Perl_pad_swipe(pTHX_ PADOFFSET po)
517 if (AvARRAY(PL_comppad) != PL_curpad)
518 Perl_croak(aTHX_ "panic: pad_swipe curpad");
520 Perl_croak(aTHX_ "panic: pad_swipe po");
522 DEBUG_X(PerlIO_printf(Perl_debug_log,
523 "0x%"UVxf" Pad 0x%"UVxf" swipe %d\n",
524 PTR2UV(thr), PTR2UV(PL_curpad), po));
526 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %d\n",
527 PTR2UV(PL_curpad), po));
528 #endif /* USE_THREADS */
529 SvPADTMP_off(PL_curpad[po]);
530 PL_curpad[po] = NEWSV(1107,0);
531 SvPADTMP_on(PL_curpad[po]);
532 if ((I32)po < PL_padix)
536 /* XXX pad_reset() is currently disabled because it results in serious bugs.
537 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
538 * on the stack by OPs that use them, there are several ways to get an alias
539 * to a shared TARG. Such an alias will change randomly and unpredictably.
540 * We avoid doing this until we can think of a Better Way.
545 #ifdef USE_BROKEN_PAD_RESET
549 if (AvARRAY(PL_comppad) != PL_curpad)
550 Perl_croak(aTHX_ "panic: pad_reset curpad");
552 DEBUG_X(PerlIO_printf(Perl_debug_log,
553 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
554 PTR2UV(thr), PTR2UV(PL_curpad)));
556 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
558 #endif /* USE_THREADS */
559 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
560 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
561 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
562 SvPADTMP_off(PL_curpad[po]);
564 PL_padix = PL_padix_floor;
567 PL_pad_reset_pending = FALSE;
571 /* find_threadsv is not reentrant */
573 Perl_find_threadsv(pTHX_ const char *name)
579 /* We currently only handle names of a single character */
580 p = strchr(PL_threadsv_names, *name);
583 key = p - PL_threadsv_names;
584 MUTEX_LOCK(&thr->mutex);
585 svp = av_fetch(thr->threadsv, key, FALSE);
587 MUTEX_UNLOCK(&thr->mutex);
589 SV *sv = NEWSV(0, 0);
590 av_store(thr->threadsv, key, sv);
591 thr->threadsvp = AvARRAY(thr->threadsv);
592 MUTEX_UNLOCK(&thr->mutex);
594 * Some magic variables used to be automagically initialised
595 * in gv_fetchpv. Those which are now per-thread magicals get
596 * initialised here instead.
602 sv_setpv(sv, "\034");
603 sv_magic(sv, 0, 0, name, 1);
608 PL_sawampersand = TRUE;
622 /* XXX %! tied to Errno.pm needs to be added here.
623 * See gv_fetchpv(). */
627 sv_magic(sv, 0, 0, name, 1);
629 DEBUG_S(PerlIO_printf(Perl_error_log,
630 "find_threadsv: new SV %p for $%s%c\n",
631 sv, (*name < 32) ? "^" : "",
632 (*name < 32) ? toCTRL(*name) : *name));
636 #endif /* USE_THREADS */
641 Perl_op_free(pTHX_ OP *o)
643 register OP *kid, *nextkid;
646 if (!o || o->op_seq == (U16)-1)
649 if (o->op_private & OPpREFCOUNTED) {
650 switch (o->op_type) {
658 if (OpREFCNT_dec(o)) {
669 if (o->op_flags & OPf_KIDS) {
670 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
671 nextkid = kid->op_sibling; /* Get before next freeing kid */
679 /* COP* is not cleared by op_clear() so that we may track line
680 * numbers etc even after null() */
681 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
686 #ifdef PL_OP_SLAB_ALLOC
687 if ((char *) o == PL_OpPtr)
696 S_op_clear(pTHX_ OP *o)
698 switch (o->op_type) {
699 case OP_NULL: /* Was holding old type, if any. */
700 case OP_ENTEREVAL: /* Was holding hints. */
702 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
708 if (!(o->op_flags & OPf_SPECIAL))
711 #endif /* USE_THREADS */
713 if (!(o->op_flags & OPf_REF)
714 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
722 SvREFCNT_dec(cGVOPo);
723 PL_curpad[cPADOPo->op_padix] = Nullsv;
725 pad_free(cPADOPo->op_padix);
726 cPADOPo->op_padix = 0;
728 SvREFCNT_dec(cGVOPo);
729 cSVOPo->op_sv = Nullsv;
733 SvREFCNT_dec(cSVOPo->op_sv);
734 cSVOPo->op_sv = Nullsv;
740 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
744 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
745 SvREFCNT_dec(cSVOPo->op_sv);
746 cSVOPo->op_sv = Nullsv;
749 Safefree(cPVOPo->op_pv);
750 cPVOPo->op_pv = Nullch;
754 op_free(cPMOPo->op_pmreplroot);
755 cPMOPo->op_pmreplroot = Nullop;
760 ReREFCNT_dec(cPMOPo->op_pmregexp);
761 cPMOPo->op_pmregexp = (REGEXP*)NULL;
766 pad_free(o->op_targ);
770 S_cop_free(pTHX_ COP* cop)
772 Safefree(cop->cop_label);
773 SvREFCNT_dec(CopFILEGV(cop));
774 if (! specialWARN(cop->cop_warnings))
775 SvREFCNT_dec(cop->cop_warnings);
781 if (o->op_type == OP_NULL)
784 o->op_targ = o->op_type;
785 o->op_type = OP_NULL;
786 o->op_ppaddr = PL_ppaddr[OP_NULL];
789 /* Contextualizers */
791 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
794 Perl_linklist(pTHX_ OP *o)
801 /* establish postfix order */
802 if (cUNOPo->op_first) {
803 o->op_next = LINKLIST(cUNOPo->op_first);
804 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
806 kid->op_next = LINKLIST(kid->op_sibling);
818 Perl_scalarkids(pTHX_ OP *o)
821 if (o && o->op_flags & OPf_KIDS) {
822 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
829 S_scalarboolean(pTHX_ OP *o)
831 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
833 if (ckWARN(WARN_SYNTAX)) {
834 line_t oldline = PL_curcop->cop_line;
836 if (PL_copline != NOLINE)
837 PL_curcop->cop_line = PL_copline;
838 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
839 PL_curcop->cop_line = oldline;
846 Perl_scalar(pTHX_ OP *o)
850 /* assumes no premature commitment */
851 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
852 || o->op_type == OP_RETURN)
855 if ((o->op_private & OPpTARGET_MY)
856 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
857 return scalar(o); /* As if inside SASSIGN */
859 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
861 switch (o->op_type) {
863 if (o->op_private & OPpREPEAT_DOLIST)
864 null(((LISTOP*)cBINOPo->op_first)->op_first);
865 scalar(cBINOPo->op_first);
870 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
874 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
875 if (!kPMOP->op_pmreplroot)
876 deprecate("implicit split to @_");
884 if (o->op_flags & OPf_KIDS) {
885 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
891 kid = cLISTOPo->op_first;
893 while (kid = kid->op_sibling) {
899 WITH_THR(PL_curcop = &PL_compiling);
904 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
910 WITH_THR(PL_curcop = &PL_compiling);
917 Perl_scalarvoid(pTHX_ OP *o)
924 if (o->op_type == OP_NEXTSTATE
925 || o->op_type == OP_SETSTATE
926 || o->op_type == OP_DBSTATE
927 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
928 || o->op_targ == OP_SETSTATE
929 || o->op_targ == OP_DBSTATE)))
932 PL_curcop = (COP*)o; /* for warning below */
935 /* assumes no premature commitment */
936 want = o->op_flags & OPf_WANT;
937 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
938 || o->op_type == OP_RETURN)
941 if ((o->op_private & OPpTARGET_MY)
942 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
943 return scalar(o); /* As if inside SASSIGN */
945 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
947 switch (o->op_type) {
949 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
953 if (o->op_flags & OPf_STACKED)
957 if (o->op_private == 4)
1000 case OP_GETPEERNAME:
1005 case OP_GETPRIORITY:
1028 if (!(o->op_private & OPpLVAL_INTRO))
1029 useless = PL_op_desc[o->op_type];
1036 if (!(o->op_private & OPpLVAL_INTRO) &&
1037 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1038 useless = "a variable";
1043 if (cSVOPo->op_private & OPpCONST_STRICT)
1044 no_bareword_allowed(o);
1047 if (ckWARN(WARN_VOID)) {
1048 useless = "a constant";
1049 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1051 else if (SvPOK(sv)) {
1052 if (strnEQ(SvPVX(sv), "di", 2) ||
1053 strnEQ(SvPVX(sv), "ds", 2) ||
1054 strnEQ(SvPVX(sv), "ig", 2))
1059 null(o); /* don't execute or even remember it */
1063 o->op_type = OP_PREINC; /* pre-increment is faster */
1064 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1068 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1069 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1075 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1080 if (o->op_flags & OPf_STACKED)
1088 if (!(o->op_flags & OPf_KIDS))
1097 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1104 /* all requires must return a boolean value */
1105 o->op_flags &= ~OPf_WANT;
1108 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1109 if (!kPMOP->op_pmreplroot)
1110 deprecate("implicit split to @_");
1116 if (ckWARN(WARN_VOID))
1117 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1123 Perl_listkids(pTHX_ OP *o)
1126 if (o && o->op_flags & OPf_KIDS) {
1127 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1134 Perl_list(pTHX_ OP *o)
1138 /* assumes no premature commitment */
1139 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1140 || o->op_type == OP_RETURN)
1143 if ((o->op_private & OPpTARGET_MY)
1144 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
1145 return o; /* As if inside SASSIGN */
1147 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1149 switch (o->op_type) {
1152 list(cBINOPo->op_first);
1157 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1165 if (!(o->op_flags & OPf_KIDS))
1167 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1168 list(cBINOPo->op_first);
1169 return gen_constant_list(o);
1176 kid = cLISTOPo->op_first;
1178 while (kid = kid->op_sibling) {
1179 if (kid->op_sibling)
1184 WITH_THR(PL_curcop = &PL_compiling);
1188 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1189 if (kid->op_sibling)
1194 WITH_THR(PL_curcop = &PL_compiling);
1197 /* all requires must return a boolean value */
1198 o->op_flags &= ~OPf_WANT;
1205 Perl_scalarseq(pTHX_ OP *o)
1210 if (o->op_type == OP_LINESEQ ||
1211 o->op_type == OP_SCOPE ||
1212 o->op_type == OP_LEAVE ||
1213 o->op_type == OP_LEAVETRY)
1216 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1217 if (kid->op_sibling) {
1221 PL_curcop = &PL_compiling;
1223 o->op_flags &= ~OPf_PARENS;
1224 if (PL_hints & HINT_BLOCK_SCOPE)
1225 o->op_flags |= OPf_PARENS;
1228 o = newOP(OP_STUB, 0);
1233 S_modkids(pTHX_ OP *o, I32 type)
1236 if (o && o->op_flags & OPf_KIDS) {
1237 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1244 Perl_mod(pTHX_ OP *o, I32 type)
1251 if (!o || PL_error_count)
1254 if ((o->op_private & OPpTARGET_MY)
1255 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
1258 switch (o->op_type) {
1263 if (!(o->op_private & (OPpCONST_ARYBASE)))
1265 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1266 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1270 SAVEI32(PL_compiling.cop_arybase);
1271 PL_compiling.cop_arybase = 0;
1273 else if (type == OP_REFGEN)
1276 Perl_croak(aTHX_ "That use of $[ is unsupported");
1279 if (o->op_flags & OPf_PARENS)
1283 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1284 !(o->op_flags & OPf_STACKED)) {
1285 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1286 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1287 assert(cUNOPo->op_first->op_type == OP_NULL);
1288 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1291 else { /* lvalue subroutine call */
1292 o->op_private |= OPpLVAL_INTRO;
1293 if (type == OP_GREPSTART || type == OP_ENTERSUB) {
1294 /* Backward compatibility mode: */
1295 o->op_private |= OPpENTERSUB_INARGS;
1298 else { /* Compile-time error message: */
1299 OP *kid = cUNOPo->op_first;
1303 if (kid->op_type == OP_PUSHMARK)
1305 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1307 "panic: unexpected lvalue entersub "
1308 "args: type/targ %ld:%ld",
1309 (long)kid->op_type,kid->op_targ);
1310 kid = kLISTOP->op_first;
1312 while (kid->op_sibling)
1313 kid = kid->op_sibling;
1314 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1316 if (kid->op_type == OP_METHOD_NAMED
1317 || kid->op_type == OP_METHOD)
1321 if (kid->op_sibling || kid->op_next != kid) {
1322 yyerror("panic: unexpected optree near method call");
1326 NewOp(1101, newop, 1, OP);
1327 newop->op_type = OP_RV2CV;
1328 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1329 newop->op_next = newop;
1330 kid->op_sibling = newop;
1331 newop->op_private |= OPpLVAL_INTRO;
1335 if (kid->op_type != OP_RV2CV)
1337 "panic: unexpected lvalue entersub "
1338 "entry via type/targ %ld:%ld",
1339 (long)kid->op_type,kid->op_targ);
1340 kid->op_private |= OPpLVAL_INTRO;
1341 break; /* Postpone until runtime */
1345 kid = kUNOP->op_first;
1346 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1347 kid = kUNOP->op_first;
1348 if (kid->op_type == OP_NULL)
1350 "Unexpected constant lvalue entersub "
1351 "entry via type/targ %ld:%ld",
1352 (long)kid->op_type,kid->op_targ);
1353 if (kid->op_type != OP_GV) {
1354 /* Restore RV2CV to check lvalueness */
1356 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1357 okid->op_next = kid->op_next;
1358 kid->op_next = okid;
1361 okid->op_next = Nullop;
1362 okid->op_type = OP_RV2CV;
1364 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1365 okid->op_private |= OPpLVAL_INTRO;
1379 /* grep, foreach, subcalls, refgen */
1380 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1382 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1383 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1385 : (o->op_type == OP_ENTERSUB
1386 ? "non-lvalue subroutine call"
1387 : PL_op_desc[o->op_type])),
1388 type ? PL_op_desc[type] : "local"));
1402 case OP_RIGHT_SHIFT:
1411 if (!(o->op_flags & OPf_STACKED))
1417 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1423 if (!type && cUNOPo->op_first->op_type != OP_GV)
1424 Perl_croak(aTHX_ "Can't localize through a reference");
1425 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1426 PL_modcount = 10000;
1427 return o; /* Treat \(@foo) like ordinary list. */
1431 if (scalar_mod_type(o, type))
1433 ref(cUNOPo->op_first, o->op_type);
1442 PL_modcount = 10000;
1445 if (!type && cUNOPo->op_first->op_type != OP_GV)
1446 Perl_croak(aTHX_ "Can't localize through a reference");
1447 ref(cUNOPo->op_first, o->op_type);
1451 PL_hints |= HINT_BLOCK_SCOPE;
1461 PL_modcount = 10000;
1462 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1463 return o; /* Treat \(@foo) like ordinary list. */
1464 if (scalar_mod_type(o, type))
1470 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1471 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1476 PL_modcount++; /* XXX ??? */
1478 #endif /* USE_THREADS */
1484 if (type != OP_SASSIGN)
1488 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1494 pad_free(o->op_targ);
1495 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1496 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1497 if (o->op_flags & OPf_KIDS)
1498 mod(cBINOPo->op_first->op_sibling, type);
1503 ref(cBINOPo->op_first, o->op_type);
1504 if (type == OP_ENTERSUB &&
1505 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1506 o->op_private |= OPpLVAL_DEFER;
1513 if (o->op_flags & OPf_KIDS)
1514 mod(cLISTOPo->op_last, type);
1518 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1520 else if (!(o->op_flags & OPf_KIDS))
1522 if (o->op_targ != OP_LIST) {
1523 mod(cBINOPo->op_first, type);
1528 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1532 o->op_flags |= OPf_MOD;
1534 if (type == OP_AASSIGN || type == OP_SASSIGN)
1535 o->op_flags |= OPf_SPECIAL|OPf_REF;
1537 o->op_private |= OPpLVAL_INTRO;
1538 o->op_flags &= ~OPf_SPECIAL;
1539 PL_hints |= HINT_BLOCK_SCOPE;
1541 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1542 o->op_flags |= OPf_REF;
1547 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1551 if (o->op_type == OP_RV2GV)
1575 case OP_RIGHT_SHIFT:
1594 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1596 switch (o->op_type) {
1604 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1617 Perl_refkids(pTHX_ OP *o, I32 type)
1620 if (o && o->op_flags & OPf_KIDS) {
1621 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1628 Perl_ref(pTHX_ OP *o, I32 type)
1632 if (!o || PL_error_count)
1635 switch (o->op_type) {
1637 if ((type == OP_DEFINED || type == OP_LOCK) &&
1638 !(o->op_flags & OPf_STACKED)) {
1639 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1640 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1641 assert(cUNOPo->op_first->op_type == OP_NULL);
1642 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1643 o->op_flags |= OPf_SPECIAL;
1648 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1652 if (type == OP_DEFINED)
1653 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1654 ref(cUNOPo->op_first, o->op_type);
1657 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1658 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1659 : type == OP_RV2HV ? OPpDEREF_HV
1661 o->op_flags |= OPf_MOD;
1666 o->op_flags |= OPf_MOD; /* XXX ??? */
1671 o->op_flags |= OPf_REF;
1674 if (type == OP_DEFINED)
1675 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1676 ref(cUNOPo->op_first, o->op_type);
1681 o->op_flags |= OPf_REF;
1686 if (!(o->op_flags & OPf_KIDS))
1688 ref(cBINOPo->op_first, type);
1692 ref(cBINOPo->op_first, o->op_type);
1693 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1694 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1695 : type == OP_RV2HV ? OPpDEREF_HV
1697 o->op_flags |= OPf_MOD;
1705 if (!(o->op_flags & OPf_KIDS))
1707 ref(cLISTOPo->op_last, type);
1717 S_dup_attrlist(pTHX_ OP *o)
1721 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1722 * where the first kid is OP_PUSHMARK and the remaining ones
1723 * are OP_CONST. We need to push the OP_CONST values.
1725 if (o->op_type == OP_CONST)
1726 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1728 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1729 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1730 if (o->op_type == OP_CONST)
1731 rop = append_elem(OP_LIST, rop,
1732 newSVOP(OP_CONST, o->op_flags,
1733 SvREFCNT_inc(cSVOPo->op_sv)));
1740 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1742 OP *modname; /* for 'use' */
1745 /* fake up C<use attributes $pkg,$rv,@attrs> */
1746 ENTER; /* need to protect against side-effects of 'use' */
1748 if (stash && HvNAME(stash))
1749 stashsv = newSVpv(HvNAME(stash), 0);
1751 stashsv = &PL_sv_no;
1752 #define ATTRSMODULE "attributes"
1753 modname = newSVOP(OP_CONST, 0,
1754 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1));
1755 modname->op_private |= OPpCONST_BARE;
1756 /* that flag is required to make 'use' work right */
1757 utilize(1, start_subparse(FALSE, 0),
1758 Nullop, /* version */
1760 prepend_elem(OP_LIST,
1761 newSVOP(OP_CONST, 0, stashsv),
1762 prepend_elem(OP_LIST,
1763 newSVOP(OP_CONST, 0, newRV(target)),
1764 dup_attrlist(attrs))));
1769 S_my_kid(pTHX_ OP *o, OP *attrs)
1774 if (!o || PL_error_count)
1778 if (type == OP_LIST) {
1779 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1781 } else if (type == OP_UNDEF) {
1783 } else if (type == OP_RV2SV || /* "our" declaration */
1785 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1787 } else if (type != OP_PADSV &&
1790 type != OP_PUSHMARK)
1792 yyerror(Perl_form(aTHX_ "Can't declare %s in my", PL_op_desc[o->op_type]));
1795 else if (attrs && type != OP_PUSHMARK) {
1800 /* check for C<my Dog $spot> when deciding package */
1801 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1802 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1803 stash = SvSTASH(*namesvp);
1805 stash = PL_curstash;
1806 padsv = PAD_SV(o->op_targ);
1807 apply_attrs(stash, padsv, attrs);
1809 o->op_flags |= OPf_MOD;
1810 o->op_private |= OPpLVAL_INTRO;
1815 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1817 if (o->op_flags & OPf_PARENS)
1820 PL_in_my_stash = Nullhv;
1823 return my_kid(o, attrs);
1827 Perl_my(pTHX_ OP *o)
1829 return my_kid(o, Nullop);
1833 Perl_sawparens(pTHX_ OP *o)
1836 o->op_flags |= OPf_PARENS;
1841 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1846 if (ckWARN(WARN_UNSAFE) &&
1847 (left->op_type == OP_RV2AV ||
1848 left->op_type == OP_RV2HV ||
1849 left->op_type == OP_PADAV ||
1850 left->op_type == OP_PADHV)) {
1851 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1852 right->op_type == OP_TRANS)
1853 ? right->op_type : OP_MATCH];
1854 const char *sample = ((left->op_type == OP_RV2AV ||
1855 left->op_type == OP_PADAV)
1856 ? "@array" : "%hash");
1857 Perl_warner(aTHX_ WARN_UNSAFE,
1858 "Applying %s to %s will act on scalar(%s)",
1859 desc, sample, sample);
1862 if (right->op_type == OP_MATCH ||
1863 right->op_type == OP_SUBST ||
1864 right->op_type == OP_TRANS) {
1865 right->op_flags |= OPf_STACKED;
1866 if (right->op_type != OP_MATCH)
1867 left = mod(left, right->op_type);
1868 if (right->op_type == OP_TRANS)
1869 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1871 o = prepend_elem(right->op_type, scalar(left), right);
1873 return newUNOP(OP_NOT, 0, scalar(o));
1877 return bind_match(type, left,
1878 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1882 Perl_invert(pTHX_ OP *o)
1886 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1887 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1891 Perl_scope(pTHX_ OP *o)
1894 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1895 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1896 o->op_type = OP_LEAVE;
1897 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1900 if (o->op_type == OP_LINESEQ) {
1902 o->op_type = OP_SCOPE;
1903 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1904 kid = ((LISTOP*)o)->op_first;
1905 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
1909 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1916 Perl_save_hints(pTHX)
1919 SAVESPTR(GvHV(PL_hintgv));
1920 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1921 SAVEFREESV(GvHV(PL_hintgv));
1925 Perl_block_start(pTHX_ int full)
1928 int retval = PL_savestack_ix;
1930 SAVEI32(PL_comppad_name_floor);
1932 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1933 PL_comppad_name_floor = PL_comppad_name_fill;
1935 PL_comppad_name_floor = 0;
1937 SAVEI32(PL_min_intro_pending);
1938 SAVEI32(PL_max_intro_pending);
1939 PL_min_intro_pending = 0;
1940 SAVEI32(PL_comppad_name_fill);
1941 SAVEI32(PL_padix_floor);
1942 PL_padix_floor = PL_padix;
1943 PL_pad_reset_pending = FALSE;
1945 PL_hints &= ~HINT_BLOCK_SCOPE;
1946 SAVEPPTR(PL_compiling.cop_warnings);
1947 if (! specialWARN(PL_compiling.cop_warnings)) {
1948 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1949 SAVEFREESV(PL_compiling.cop_warnings) ;
1957 Perl_block_end(pTHX_ I32 floor, OP *seq)
1960 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1961 OP* retval = scalarseq(seq);
1963 PL_pad_reset_pending = FALSE;
1964 PL_compiling.op_private = PL_hints;
1966 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1967 pad_leavemy(PL_comppad_name_fill);
1976 OP *o = newOP(OP_THREADSV, 0);
1977 o->op_targ = find_threadsv("_");
1980 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1981 #endif /* USE_THREADS */
1985 Perl_newPROG(pTHX_ OP *o)
1991 PL_eval_root = newUNOP(OP_LEAVEEVAL,
1992 ((PL_in_eval & EVAL_KEEPERR)
1993 ? OPf_SPECIAL : 0), o);
1994 PL_eval_start = linklist(PL_eval_root);
1995 PL_eval_root->op_private |= OPpREFCOUNTED;
1996 OpREFCNT_set(PL_eval_root, 1);
1997 PL_eval_root->op_next = 0;
1998 peep(PL_eval_start);
2003 PL_main_root = scope(sawparens(scalarvoid(o)));
2004 PL_curcop = &PL_compiling;
2005 PL_main_start = LINKLIST(PL_main_root);
2006 PL_main_root->op_private |= OPpREFCOUNTED;
2007 OpREFCNT_set(PL_main_root, 1);
2008 PL_main_root->op_next = 0;
2009 peep(PL_main_start);
2012 /* Register with debugger */
2014 CV *cv = get_cv("DB::postponed", FALSE);
2018 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2020 call_sv((SV*)cv, G_DISCARD);
2027 Perl_localize(pTHX_ OP *o, I32 lex)
2029 if (o->op_flags & OPf_PARENS)
2033 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2035 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2036 if (*s == ';' || *s == '=')
2037 Perl_warner(aTHX_ WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
2038 lex ? "my" : "local");
2042 PL_in_my_stash = Nullhv;
2046 return mod(o, OP_NULL); /* a bit kludgey */
2050 Perl_jmaybe(pTHX_ OP *o)
2052 if (o->op_type == OP_LIST) {
2055 o2 = newOP(OP_THREADSV, 0);
2056 o2->op_targ = find_threadsv(";");
2058 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2059 #endif /* USE_THREADS */
2060 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2066 Perl_fold_constants(pTHX_ register OP *o)
2070 I32 type = o->op_type;
2073 if (PL_opargs[type] & OA_RETSCALAR)
2075 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2076 o->op_targ = pad_alloc(type, SVs_PADTMP);
2078 /* integerize op, unless it happens to be C<-foo>.
2079 * XXX should pp_i_negate() do magic string negation instead? */
2080 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2081 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2082 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2084 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2087 if (!(PL_opargs[type] & OA_FOLDCONST))
2092 /* XXX might want a ck_negate() for this */
2093 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2106 if (o->op_private & OPpLOCALE)
2111 goto nope; /* Don't try to run w/ errors */
2113 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2114 if ((curop->op_type != OP_CONST ||
2115 (curop->op_private & OPpCONST_BARE)) &&
2116 curop->op_type != OP_LIST &&
2117 curop->op_type != OP_SCALAR &&
2118 curop->op_type != OP_NULL &&
2119 curop->op_type != OP_PUSHMARK)
2125 curop = LINKLIST(o);
2129 sv = *(PL_stack_sp--);
2130 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2131 pad_swipe(o->op_targ);
2132 else if (SvTEMP(sv)) { /* grab mortal temp? */
2133 (void)SvREFCNT_inc(sv);
2137 if (type == OP_RV2GV)
2138 return newGVOP(OP_GV, 0, (GV*)sv);
2140 /* try to smush double to int, but don't smush -2.0 to -2 */
2141 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2145 if ((NV)iv == SvNV(sv)) {
2150 SvIOK_off(sv); /* undo SvIV() damage */
2152 return newSVOP(OP_CONST, 0, sv);
2156 if (!(PL_opargs[type] & OA_OTHERINT))
2159 if (!(PL_hints & HINT_INTEGER)) {
2160 if (type == OP_MODULO
2161 || type == OP_DIVIDE
2162 || !(o->op_flags & OPf_KIDS))
2167 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2168 if (curop->op_type == OP_CONST) {
2169 if (SvIOK(((SVOP*)curop)->op_sv))
2173 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2177 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2184 Perl_gen_constant_list(pTHX_ register OP *o)
2188 I32 oldtmps_floor = PL_tmps_floor;
2192 return o; /* Don't attempt to run with errors */
2194 PL_op = curop = LINKLIST(o);
2200 PL_tmps_floor = oldtmps_floor;
2202 o->op_type = OP_RV2AV;
2203 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2204 curop = ((UNOP*)o)->op_first;
2205 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2212 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2217 if (!o || o->op_type != OP_LIST)
2218 o = newLISTOP(OP_LIST, 0, o, Nullop);
2220 o->op_flags &= ~OPf_WANT;
2222 if (!(PL_opargs[type] & OA_MARK))
2223 null(cLISTOPo->op_first);
2226 o->op_ppaddr = PL_ppaddr[type];
2227 o->op_flags |= flags;
2229 o = CHECKOP(type, o);
2230 if (o->op_type != type)
2233 if (cLISTOPo->op_children < 7) {
2234 /* XXX do we really need to do this if we're done appending?? */
2235 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2237 cLISTOPo->op_last = last; /* in case check substituted last arg */
2240 return fold_constants(o);
2243 /* List constructors */
2246 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2254 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
2255 return newLISTOP(type, 0, first, last);
2257 if (first->op_flags & OPf_KIDS)
2258 ((LISTOP*)first)->op_last->op_sibling = last;
2260 first->op_flags |= OPf_KIDS;
2261 ((LISTOP*)first)->op_first = last;
2263 ((LISTOP*)first)->op_last = last;
2264 ((LISTOP*)first)->op_children++;
2269 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2277 if (first->op_type != type)
2278 return prepend_elem(type, (OP*)first, (OP*)last);
2280 if (last->op_type != type)
2281 return append_elem(type, (OP*)first, (OP*)last);
2283 first->op_last->op_sibling = last->op_first;
2284 first->op_last = last->op_last;
2285 first->op_children += last->op_children;
2286 if (first->op_children)
2287 first->op_flags |= OPf_KIDS;
2289 #ifdef PL_OP_SLAB_ALLOC
2297 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2305 if (last->op_type == type) {
2306 if (type == OP_LIST) { /* already a PUSHMARK there */
2307 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2308 ((LISTOP*)last)->op_first->op_sibling = first;
2311 if (!(last->op_flags & OPf_KIDS)) {
2312 ((LISTOP*)last)->op_last = first;
2313 last->op_flags |= OPf_KIDS;
2315 first->op_sibling = ((LISTOP*)last)->op_first;
2316 ((LISTOP*)last)->op_first = first;
2318 ((LISTOP*)last)->op_children++;
2322 return newLISTOP(type, 0, first, last);
2328 Perl_newNULLLIST(pTHX)
2330 return newOP(OP_STUB, 0);
2334 Perl_force_list(pTHX_ OP *o)
2336 if (!o || o->op_type != OP_LIST)
2337 o = newLISTOP(OP_LIST, 0, o, Nullop);
2343 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2347 NewOp(1101, listop, 1, LISTOP);
2349 listop->op_type = type;
2350 listop->op_ppaddr = PL_ppaddr[type];
2351 listop->op_children = (first != 0) + (last != 0);
2352 listop->op_flags = flags;
2356 else if (!first && last)
2359 first->op_sibling = last;
2360 listop->op_first = first;
2361 listop->op_last = last;
2362 if (type == OP_LIST) {
2364 pushop = newOP(OP_PUSHMARK, 0);
2365 pushop->op_sibling = first;
2366 listop->op_first = pushop;
2367 listop->op_flags |= OPf_KIDS;
2369 listop->op_last = pushop;
2371 else if (listop->op_children)
2372 listop->op_flags |= OPf_KIDS;
2378 Perl_newOP(pTHX_ I32 type, I32 flags)
2381 NewOp(1101, o, 1, OP);
2383 o->op_ppaddr = PL_ppaddr[type];
2384 o->op_flags = flags;
2387 o->op_private = 0 + (flags >> 8);
2388 if (PL_opargs[type] & OA_RETSCALAR)
2390 if (PL_opargs[type] & OA_TARGET)
2391 o->op_targ = pad_alloc(type, SVs_PADTMP);
2392 return CHECKOP(type, o);
2396 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2401 first = newOP(OP_STUB, 0);
2402 if (PL_opargs[type] & OA_MARK)
2403 first = force_list(first);
2405 NewOp(1101, unop, 1, UNOP);
2406 unop->op_type = type;
2407 unop->op_ppaddr = PL_ppaddr[type];
2408 unop->op_first = first;
2409 unop->op_flags = flags | OPf_KIDS;
2410 unop->op_private = 1 | (flags >> 8);
2411 unop = (UNOP*) CHECKOP(type, unop);
2415 return fold_constants((OP *) unop);
2419 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2422 NewOp(1101, binop, 1, BINOP);
2425 first = newOP(OP_NULL, 0);
2427 binop->op_type = type;
2428 binop->op_ppaddr = PL_ppaddr[type];
2429 binop->op_first = first;
2430 binop->op_flags = flags | OPf_KIDS;
2433 binop->op_private = 1 | (flags >> 8);
2436 binop->op_private = 2 | (flags >> 8);
2437 first->op_sibling = last;
2440 binop = (BINOP*)CHECKOP(type, binop);
2441 if (binop->op_next || binop->op_type != type)
2444 binop->op_last = binop->op_first->op_sibling;
2446 return fold_constants((OP *)binop);
2450 utf8compare(const void *a, const void *b)
2453 for (i = 0; i < 10; i++) {
2454 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2456 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2463 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2465 SV *tstr = ((SVOP*)expr)->op_sv;
2466 SV *rstr = ((SVOP*)repl)->op_sv;
2469 register U8 *t = (U8*)SvPV(tstr, tlen);
2470 register U8 *r = (U8*)SvPV(rstr, rlen);
2476 register short *tbl;
2478 complement = o->op_private & OPpTRANS_COMPLEMENT;
2479 del = o->op_private & OPpTRANS_DELETE;
2480 squash = o->op_private & OPpTRANS_SQUASH;
2482 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2483 SV* listsv = newSVpvn("# comment\n",10);
2485 U8* tend = t + tlen;
2486 U8* rend = r + rlen;
2502 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2503 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2509 New(1109, cp, tlen, U8*);
2511 transv = newSVpvn("",0);
2520 qsort(cp, i, sizeof(U8*), utf8compare);
2521 for (j = 0; j < i; j++) {
2523 UV val = utf8_to_uv(s, &ulen);
2525 diff = val - nextmin;
2527 t = uv_to_utf8(tmpbuf,nextmin);
2528 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2530 t = uv_to_utf8(tmpbuf, val - 1);
2531 sv_catpvn(transv, "\377", 1);
2532 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2536 val = utf8_to_uv(s+1, &ulen);
2540 t = uv_to_utf8(tmpbuf,nextmin);
2541 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2542 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2543 sv_catpvn(transv, "\377", 1);
2544 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2545 t = (U8*)SvPVX(transv);
2546 tlen = SvCUR(transv);
2549 else if (!rlen && !del) {
2550 r = t; rlen = tlen; rend = tend;
2553 if (to_utf && from_utf) { /* only counting characters */
2554 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2555 o->op_private |= OPpTRANS_IDENTICAL;
2557 else { /* straight latin-1 translation */
2558 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2559 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2560 o->op_private |= OPpTRANS_IDENTICAL;
2564 while (t < tend || tfirst <= tlast) {
2565 /* see if we need more "t" chars */
2566 if (tfirst > tlast) {
2567 tfirst = (I32)utf8_to_uv(t, &ulen);
2569 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2570 tlast = (I32)utf8_to_uv(++t, &ulen);
2577 /* now see if we need more "r" chars */
2578 if (rfirst > rlast) {
2580 rfirst = (I32)utf8_to_uv(r, &ulen);
2582 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2583 rlast = (I32)utf8_to_uv(++r, &ulen);
2592 rfirst = rlast = 0xffffffff;
2596 /* now see which range will peter our first, if either. */
2597 tdiff = tlast - tfirst;
2598 rdiff = rlast - rfirst;
2605 if (rfirst == 0xffffffff) {
2606 diff = tdiff; /* oops, pretend rdiff is infinite */
2608 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2610 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\tXXXX\n", tfirst);
2614 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2616 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2618 if (rfirst + diff > max)
2619 max = rfirst + diff;
2624 else if (rfirst <= 0x800)
2625 grows |= (tfirst < 0x80);
2626 else if (rfirst <= 0x10000)
2627 grows |= (tfirst < 0x800);
2628 else if (rfirst <= 0x200000)
2629 grows |= (tfirst < 0x10000);
2630 else if (rfirst <= 0x4000000)
2631 grows |= (tfirst < 0x200000);
2632 else if (rfirst <= 0x80000000)
2633 grows |= (tfirst < 0x4000000);
2645 else if (max > 0xff)
2650 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2651 SvREFCNT_dec(listsv);
2653 SvREFCNT_dec(transv);
2655 if (!del && havefinal)
2656 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2658 if (grows && to_utf)
2659 o->op_private |= OPpTRANS_GROWS;
2666 tbl = (short*)cPVOPo->op_pv;
2668 Zero(tbl, 256, short);
2669 for (i = 0; i < tlen; i++)
2671 for (i = 0, j = 0; i < 256; i++) {
2687 if (!rlen && !del) {
2690 o->op_private |= OPpTRANS_IDENTICAL;
2692 for (i = 0; i < 256; i++)
2694 for (i = 0, j = 0; i < tlen; i++,j++) {
2697 if (tbl[t[i]] == -1)
2703 if (tbl[t[i]] == -1)
2714 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2719 NewOp(1101, pmop, 1, PMOP);
2720 pmop->op_type = type;
2721 pmop->op_ppaddr = PL_ppaddr[type];
2722 pmop->op_flags = flags;
2723 pmop->op_private = 0 | (flags >> 8);
2725 if (PL_hints & HINT_RE_TAINT)
2726 pmop->op_pmpermflags |= PMf_RETAINT;
2727 if (PL_hints & HINT_LOCALE)
2728 pmop->op_pmpermflags |= PMf_LOCALE;
2729 pmop->op_pmflags = pmop->op_pmpermflags;
2731 /* link into pm list */
2732 if (type != OP_TRANS && PL_curstash) {
2733 pmop->op_pmnext = HvPMROOT(PL_curstash);
2734 HvPMROOT(PL_curstash) = pmop;
2741 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2746 I32 repl_has_vars = 0;
2748 if (o->op_type == OP_TRANS)
2749 return pmtrans(o, expr, repl);
2751 PL_hints |= HINT_BLOCK_SCOPE;
2754 if (expr->op_type == OP_CONST) {
2756 SV *pat = ((SVOP*)expr)->op_sv;
2757 char *p = SvPV(pat, plen);
2758 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2759 sv_setpvn(pat, "\\s+", 3);
2760 p = SvPV(pat, plen);
2761 pm->op_pmflags |= PMf_SKIPWHITE;
2763 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2764 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2765 pm->op_pmflags |= PMf_WHITE;
2769 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2770 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2772 : OP_REGCMAYBE),0,expr);
2774 NewOp(1101, rcop, 1, LOGOP);
2775 rcop->op_type = OP_REGCOMP;
2776 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2777 rcop->op_first = scalar(expr);
2778 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2779 ? (OPf_SPECIAL | OPf_KIDS)
2781 rcop->op_private = 1;
2784 /* establish postfix order */
2785 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2787 rcop->op_next = expr;
2788 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2791 rcop->op_next = LINKLIST(expr);
2792 expr->op_next = (OP*)rcop;
2795 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2800 if (pm->op_pmflags & PMf_EVAL) {
2802 if (PL_curcop->cop_line < PL_multi_end)
2803 PL_curcop->cop_line = PL_multi_end;
2806 else if (repl->op_type == OP_THREADSV
2807 && strchr("&`'123456789+",
2808 PL_threadsv_names[repl->op_targ]))
2812 #endif /* USE_THREADS */
2813 else if (repl->op_type == OP_CONST)
2817 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2818 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2820 if (curop->op_type == OP_THREADSV) {
2822 if (strchr("&`'123456789+", curop->op_private))
2826 if (curop->op_type == OP_GV) {
2827 GV *gv = cGVOPx(curop);
2829 if (strchr("&`'123456789+", *GvENAME(gv)))
2832 #endif /* USE_THREADS */
2833 else if (curop->op_type == OP_RV2CV)
2835 else if (curop->op_type == OP_RV2SV ||
2836 curop->op_type == OP_RV2AV ||
2837 curop->op_type == OP_RV2HV ||
2838 curop->op_type == OP_RV2GV) {
2839 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2842 else if (curop->op_type == OP_PADSV ||
2843 curop->op_type == OP_PADAV ||
2844 curop->op_type == OP_PADHV ||
2845 curop->op_type == OP_PADANY) {
2848 else if (curop->op_type == OP_PUSHRE)
2849 ; /* Okay here, dangerous in newASSIGNOP */
2858 && (!pm->op_pmregexp
2859 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2860 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2861 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2862 prepend_elem(o->op_type, scalar(repl), o);
2865 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2866 pm->op_pmflags |= PMf_MAYBE_CONST;
2867 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2869 NewOp(1101, rcop, 1, LOGOP);
2870 rcop->op_type = OP_SUBSTCONT;
2871 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2872 rcop->op_first = scalar(repl);
2873 rcop->op_flags |= OPf_KIDS;
2874 rcop->op_private = 1;
2877 /* establish postfix order */
2878 rcop->op_next = LINKLIST(repl);
2879 repl->op_next = (OP*)rcop;
2881 pm->op_pmreplroot = scalar((OP*)rcop);
2882 pm->op_pmreplstart = LINKLIST(rcop);
2891 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2894 NewOp(1101, svop, 1, SVOP);
2895 svop->op_type = type;
2896 svop->op_ppaddr = PL_ppaddr[type];
2898 svop->op_next = (OP*)svop;
2899 svop->op_flags = flags;
2900 if (PL_opargs[type] & OA_RETSCALAR)
2902 if (PL_opargs[type] & OA_TARGET)
2903 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2904 return CHECKOP(type, svop);
2908 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
2911 NewOp(1101, padop, 1, PADOP);
2912 padop->op_type = type;
2913 padop->op_ppaddr = PL_ppaddr[type];
2914 padop->op_padix = pad_alloc(type, SVs_PADTMP);
2915 PL_curpad[padop->op_padix] = sv;
2916 padop->op_next = (OP*)padop;
2917 padop->op_flags = flags;
2918 if (PL_opargs[type] & OA_RETSCALAR)
2920 if (PL_opargs[type] & OA_TARGET)
2921 padop->op_targ = pad_alloc(type, SVs_PADTMP);
2922 return CHECKOP(type, padop);
2926 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
2930 return newPADOP(type, flags, SvREFCNT_inc(gv));
2932 return newSVOP(type, flags, SvREFCNT_inc(gv));
2937 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
2940 NewOp(1101, pvop, 1, PVOP);
2941 pvop->op_type = type;
2942 pvop->op_ppaddr = PL_ppaddr[type];
2944 pvop->op_next = (OP*)pvop;
2945 pvop->op_flags = flags;
2946 if (PL_opargs[type] & OA_RETSCALAR)
2948 if (PL_opargs[type] & OA_TARGET)
2949 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2950 return CHECKOP(type, pvop);
2954 Perl_package(pTHX_ OP *o)
2959 save_hptr(&PL_curstash);
2960 save_item(PL_curstname);
2965 name = SvPV(sv, len);
2966 PL_curstash = gv_stashpvn(name,len,TRUE);
2967 sv_setpvn(PL_curstname, name, len);
2971 sv_setpv(PL_curstname,"<none>");
2972 PL_curstash = Nullhv;
2974 PL_hints |= HINT_BLOCK_SCOPE;
2975 PL_copline = NOLINE;
2980 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
2989 if (id->op_type != OP_CONST)
2990 Perl_croak(aTHX_ "Module name must be constant");
2994 if(version != Nullop) {
2995 SV *vesv = ((SVOP*)version)->op_sv;
2997 if (arg == Nullop && !SvNIOK(vesv)) {
3003 if (version->op_type != OP_CONST || !SvNIOK(vesv))
3004 Perl_croak(aTHX_ "Version number must be constant number");
3006 /* Make copy of id so we don't free it twice */
3007 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3009 /* Fake up a method call to VERSION */
3010 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3011 append_elem(OP_LIST,
3012 prepend_elem(OP_LIST, pack, list(version)),
3013 newSVOP(OP_METHOD_NAMED, 0,
3014 newSVpvn("VERSION", 7))));
3018 /* Fake up an import/unimport */
3019 if (arg && arg->op_type == OP_STUB)
3020 imop = arg; /* no import on explicit () */
3021 else if(SvNIOK(((SVOP*)id)->op_sv)) {
3022 imop = Nullop; /* use 5.0; */
3025 /* Make copy of id so we don't free it twice */
3026 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3027 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3028 append_elem(OP_LIST,
3029 prepend_elem(OP_LIST, pack, list(arg)),
3030 newSVOP(OP_METHOD_NAMED, 0,
3031 aver ? newSVpvn("import", 6)
3032 : newSVpvn("unimport", 8))));
3035 /* Fake up a require, handle override, if any */
3036 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3037 if (!(gv && GvIMPORTED_CV(gv)))
3038 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3040 if (gv && GvIMPORTED_CV(gv)) {
3041 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3042 append_elem(OP_LIST, id,
3043 scalar(newUNOP(OP_RV2CV, 0,
3048 rqop = newUNOP(OP_REQUIRE, 0, id);
3051 /* Fake up the BEGIN {}, which does its thing immediately. */
3053 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3056 append_elem(OP_LINESEQ,
3057 append_elem(OP_LINESEQ,
3058 newSTATEOP(0, Nullch, rqop),
3059 newSTATEOP(0, Nullch, veop)),
3060 newSTATEOP(0, Nullch, imop) ));
3062 PL_hints |= HINT_BLOCK_SCOPE;
3063 PL_copline = NOLINE;
3068 Perl_dofile(pTHX_ OP *term)
3073 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3074 if (!(gv && GvIMPORTED_CV(gv)))
3075 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3077 if (gv && GvIMPORTED_CV(gv)) {
3078 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3079 append_elem(OP_LIST, term,
3080 scalar(newUNOP(OP_RV2CV, 0,
3085 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3091 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3093 return newBINOP(OP_LSLICE, flags,
3094 list(force_list(subscript)),
3095 list(force_list(listval)) );
3099 S_list_assignment(pTHX_ register OP *o)
3104 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3105 o = cUNOPo->op_first;
3107 if (o->op_type == OP_COND_EXPR) {
3108 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3109 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3114 yyerror("Assignment to both a list and a scalar");
3118 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3119 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3120 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3123 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3126 if (o->op_type == OP_RV2SV)
3133 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3138 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3139 return newLOGOP(optype, 0,
3140 mod(scalar(left), optype),
3141 newUNOP(OP_SASSIGN, 0, scalar(right)));
3144 return newBINOP(optype, OPf_STACKED,
3145 mod(scalar(left), optype), scalar(right));
3149 if (list_assignment(left)) {
3152 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3153 left = mod(left, OP_AASSIGN);
3161 o = newBINOP(OP_AASSIGN, flags,
3162 list(force_list(right)),
3163 list(force_list(left)) );
3164 o->op_private = 0 | (flags >> 8);
3165 if (!(left->op_private & OPpLVAL_INTRO)) {
3169 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3170 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3171 if (curop->op_type == OP_GV) {
3172 GV *gv = cGVOPx(curop);
3173 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3175 SvCUR(gv) = PL_generation;
3177 else if (curop->op_type == OP_PADSV ||
3178 curop->op_type == OP_PADAV ||
3179 curop->op_type == OP_PADHV ||
3180 curop->op_type == OP_PADANY) {
3181 SV **svp = AvARRAY(PL_comppad_name);
3182 SV *sv = svp[curop->op_targ];
3183 if (SvCUR(sv) == PL_generation)
3185 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3187 else if (curop->op_type == OP_RV2CV)
3189 else if (curop->op_type == OP_RV2SV ||
3190 curop->op_type == OP_RV2AV ||
3191 curop->op_type == OP_RV2HV ||
3192 curop->op_type == OP_RV2GV) {
3193 if (lastop->op_type != OP_GV) /* funny deref? */
3196 else if (curop->op_type == OP_PUSHRE) {
3197 if (((PMOP*)curop)->op_pmreplroot) {
3198 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3199 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3201 SvCUR(gv) = PL_generation;
3210 o->op_private = OPpASSIGN_COMMON;
3212 if (right && right->op_type == OP_SPLIT) {
3214 if ((tmpop = ((LISTOP*)right)->op_first) &&
3215 tmpop->op_type == OP_PUSHRE)
3217 PMOP *pm = (PMOP*)tmpop;
3218 if (left->op_type == OP_RV2AV &&
3219 !(left->op_private & OPpLVAL_INTRO) &&
3220 !(o->op_private & OPpASSIGN_COMMON) )
3222 tmpop = ((UNOP*)left)->op_first;
3223 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3224 pm->op_pmreplroot = (OP*)((SVOP*)tmpop)->op_sv; /* XXXXXX */
3225 pm->op_pmflags |= PMf_ONCE;
3226 tmpop = cUNOPo->op_first; /* to list (nulled) */
3227 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3228 tmpop->op_sibling = Nullop; /* don't free split */
3229 right->op_next = tmpop->op_next; /* fix starting loc */
3230 op_free(o); /* blow off assign */
3231 right->op_flags &= ~OPf_WANT;
3232 /* "I don't know and I don't care." */
3237 if (PL_modcount < 10000 &&
3238 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3240 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3242 sv_setiv(sv, PL_modcount+1);
3250 right = newOP(OP_UNDEF, 0);
3251 if (right->op_type == OP_READLINE) {
3252 right->op_flags |= OPf_STACKED;
3253 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3256 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3257 o = newBINOP(OP_SASSIGN, flags,
3258 scalar(right), mod(scalar(left), OP_SASSIGN) );
3270 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3273 U32 seq = intro_my();
3276 NewOp(1101, cop, 1, COP);
3277 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
3278 cop->op_type = OP_DBSTATE;
3279 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3282 cop->op_type = OP_NEXTSTATE;
3283 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3285 cop->op_flags = flags;
3286 cop->op_private = (PL_hints & HINT_UTF8);
3288 cop->op_private |= NATIVE_HINTS;
3290 PL_compiling.op_private = cop->op_private;
3291 cop->op_next = (OP*)cop;
3294 cop->cop_label = label;
3295 PL_hints |= HINT_BLOCK_SCOPE;
3298 cop->cop_arybase = PL_curcop->cop_arybase;
3299 if (specialWARN(PL_curcop->cop_warnings))
3300 cop->cop_warnings = PL_curcop->cop_warnings ;
3302 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3305 if (PL_copline == NOLINE)
3306 cop->cop_line = PL_curcop->cop_line;
3308 cop->cop_line = PL_copline;
3309 PL_copline = NOLINE;
3311 CopFILEGV_set(cop, (GV*)SvREFCNT_inc(CopFILEGV(PL_curcop)));
3312 cop->cop_stash = PL_curstash;
3314 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3315 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3316 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3317 (void)SvIOK_on(*svp);
3319 SvSTASH(*svp) = (HV*)cop;
3323 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3326 /* "Introduce" my variables to visible status. */
3334 if (! PL_min_intro_pending)
3335 return PL_cop_seqmax;
3337 svp = AvARRAY(PL_comppad_name);
3338 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3339 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3340 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3341 SvNVX(sv) = (NV)PL_cop_seqmax;
3344 PL_min_intro_pending = 0;
3345 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3346 return PL_cop_seqmax++;
3350 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3352 return new_logop(type, flags, &first, &other);
3356 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3361 OP *first = *firstp;
3362 OP *other = *otherp;
3364 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3365 return newBINOP(type, flags, scalar(first), scalar(other));
3367 scalarboolean(first);
3368 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3369 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3370 if (type == OP_AND || type == OP_OR) {
3376 first = *firstp = cUNOPo->op_first;
3378 first->op_next = o->op_next;
3379 cUNOPo->op_first = Nullop;
3383 if (first->op_type == OP_CONST) {
3384 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3385 Perl_warner(aTHX_ WARN_PRECEDENCE, "Probable precedence problem on %s",
3387 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3398 else if (first->op_type == OP_WANTARRAY) {
3404 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3405 OP *k1 = ((UNOP*)first)->op_first;
3406 OP *k2 = k1->op_sibling;
3408 switch (first->op_type)
3411 if (k2 && k2->op_type == OP_READLINE
3412 && (k2->op_flags & OPf_STACKED)
3413 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3415 warnop = k2->op_type;
3420 if (k1->op_type == OP_READDIR
3421 || k1->op_type == OP_GLOB
3422 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3423 || k1->op_type == OP_EACH)
3425 warnop = ((k1->op_type == OP_NULL)
3426 ? k1->op_targ : k1->op_type);
3431 line_t oldline = PL_curcop->cop_line;
3432 PL_curcop->cop_line = PL_copline;
3433 Perl_warner(aTHX_ WARN_UNSAFE,
3434 "Value of %s%s can be \"0\"; test with defined()",
3436 ((warnop == OP_READLINE || warnop == OP_GLOB)
3437 ? " construct" : "() operator"));
3438 PL_curcop->cop_line = oldline;
3445 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3446 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3448 NewOp(1101, logop, 1, LOGOP);
3450 logop->op_type = type;
3451 logop->op_ppaddr = PL_ppaddr[type];
3452 logop->op_first = first;
3453 logop->op_flags = flags | OPf_KIDS;
3454 logop->op_other = LINKLIST(other);
3455 logop->op_private = 1 | (flags >> 8);
3457 /* establish postfix order */
3458 logop->op_next = LINKLIST(first);
3459 first->op_next = (OP*)logop;
3460 first->op_sibling = other;
3462 o = newUNOP(OP_NULL, 0, (OP*)logop);
3469 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3477 return newLOGOP(OP_AND, 0, first, trueop);
3479 return newLOGOP(OP_OR, 0, first, falseop);
3481 scalarboolean(first);
3482 if (first->op_type == OP_CONST) {
3483 if (SvTRUE(((SVOP*)first)->op_sv)) {
3494 else if (first->op_type == OP_WANTARRAY) {
3498 NewOp(1101, logop, 1, LOGOP);
3499 logop->op_type = OP_COND_EXPR;
3500 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3501 logop->op_first = first;
3502 logop->op_flags = flags | OPf_KIDS;
3503 logop->op_private = 1 | (flags >> 8);
3504 logop->op_other = LINKLIST(trueop);
3505 logop->op_next = LINKLIST(falseop);
3508 /* establish postfix order */
3509 start = LINKLIST(first);
3510 first->op_next = (OP*)logop;
3512 first->op_sibling = trueop;
3513 trueop->op_sibling = falseop;
3514 o = newUNOP(OP_NULL, 0, (OP*)logop);
3516 trueop->op_next = falseop->op_next = o;
3523 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3532 NewOp(1101, range, 1, LOGOP);
3534 range->op_type = OP_RANGE;
3535 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3536 range->op_first = left;
3537 range->op_flags = OPf_KIDS;
3538 leftstart = LINKLIST(left);
3539 range->op_other = LINKLIST(right);
3540 range->op_private = 1 | (flags >> 8);
3542 left->op_sibling = right;
3544 range->op_next = (OP*)range;
3545 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3546 flop = newUNOP(OP_FLOP, 0, flip);
3547 o = newUNOP(OP_NULL, 0, flop);
3549 range->op_next = leftstart;
3551 left->op_next = flip;
3552 right->op_next = flop;
3554 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3555 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3556 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3557 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3559 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3560 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3563 if (!flip->op_private || !flop->op_private)
3564 linklist(o); /* blow off optimizer unless constant */
3570 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3575 int once = block && block->op_flags & OPf_SPECIAL &&
3576 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3579 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3580 return block; /* do {} while 0 does once */
3581 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3582 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3583 expr = newUNOP(OP_DEFINED, 0,
3584 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3585 } else if (expr->op_flags & OPf_KIDS) {
3586 OP *k1 = ((UNOP*)expr)->op_first;
3587 OP *k2 = (k1) ? k1->op_sibling : NULL;
3588 switch (expr->op_type) {
3590 if (k2 && k2->op_type == OP_READLINE
3591 && (k2->op_flags & OPf_STACKED)
3592 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3593 expr = newUNOP(OP_DEFINED, 0, expr);
3597 if (k1->op_type == OP_READDIR
3598 || k1->op_type == OP_GLOB
3599 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3600 || k1->op_type == OP_EACH)
3601 expr = newUNOP(OP_DEFINED, 0, expr);
3607 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3608 o = new_logop(OP_AND, 0, &expr, &listop);
3611 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3613 if (once && o != listop)
3614 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3617 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3619 o->op_flags |= flags;
3621 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3626 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3635 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3636 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3637 expr = newUNOP(OP_DEFINED, 0,
3638 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3639 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3640 OP *k1 = ((UNOP*)expr)->op_first;
3641 OP *k2 = (k1) ? k1->op_sibling : NULL;
3642 switch (expr->op_type) {
3644 if (k2 && k2->op_type == OP_READLINE
3645 && (k2->op_flags & OPf_STACKED)
3646 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3647 expr = newUNOP(OP_DEFINED, 0, expr);
3651 if (k1->op_type == OP_READDIR
3652 || k1->op_type == OP_GLOB
3653 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3654 || k1->op_type == OP_EACH)
3655 expr = newUNOP(OP_DEFINED, 0, expr);
3661 block = newOP(OP_NULL, 0);
3664 next = LINKLIST(cont);
3666 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3667 if ((line_t)whileline != NOLINE) {
3668 PL_copline = whileline;
3669 cont = append_elem(OP_LINESEQ, cont,
3670 newSTATEOP(0, Nullch, Nullop));
3674 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3675 redo = LINKLIST(listop);
3678 PL_copline = whileline;
3680 o = new_logop(OP_AND, 0, &expr, &listop);
3681 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3682 op_free(expr); /* oops, it's a while (0) */
3684 return Nullop; /* listop already freed by new_logop */
3687 ((LISTOP*)listop)->op_last->op_next = condop =
3688 (o == listop ? redo : LINKLIST(o));
3696 NewOp(1101,loop,1,LOOP);
3697 loop->op_type = OP_ENTERLOOP;
3698 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3699 loop->op_private = 0;
3700 loop->op_next = (OP*)loop;
3703 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3705 loop->op_redoop = redo;
3706 loop->op_lastop = o;
3709 loop->op_nextop = next;
3711 loop->op_nextop = o;
3713 o->op_flags |= flags;
3714 o->op_private |= (flags >> 8);
3719 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3728 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3729 sv->op_type = OP_RV2GV;
3730 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3732 else if (sv->op_type == OP_PADSV) { /* private variable */
3733 padoff = sv->op_targ;
3737 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3738 padoff = sv->op_targ;
3739 iterflags |= OPf_SPECIAL;
3744 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3748 padoff = find_threadsv("_");
3749 iterflags |= OPf_SPECIAL;
3751 sv = newGVOP(OP_GV, 0, PL_defgv);
3754 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3755 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3756 iterflags |= OPf_STACKED;
3758 else if (expr->op_type == OP_NULL &&
3759 (expr->op_flags & OPf_KIDS) &&
3760 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3762 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3763 * set the STACKED flag to indicate that these values are to be
3764 * treated as min/max values by 'pp_iterinit'.
3766 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3767 LOGOP* range = (LOGOP*) flip->op_first;
3768 OP* left = range->op_first;
3769 OP* right = left->op_sibling;
3772 range->op_flags &= ~OPf_KIDS;
3773 range->op_first = Nullop;
3775 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3776 listop->op_first->op_next = range->op_next;
3777 left->op_next = range->op_other;
3778 right->op_next = (OP*)listop;
3779 listop->op_next = listop->op_first;
3782 expr = (OP*)(listop);
3784 iterflags |= OPf_STACKED;
3787 expr = mod(force_list(expr), OP_GREPSTART);
3791 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3792 append_elem(OP_LIST, expr, scalar(sv))));
3793 assert(!loop->op_next);
3794 #ifdef PL_OP_SLAB_ALLOC
3795 NewOp(1234,tmp,1,LOOP);
3796 Copy(loop,tmp,1,LOOP);
3799 Renew(loop, 1, LOOP);
3801 loop->op_targ = padoff;
3802 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3803 PL_copline = forline;
3804 return newSTATEOP(0, label, wop);
3808 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3814 if (type != OP_GOTO || label->op_type == OP_CONST) {
3815 /* "last()" means "last" */
3816 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3817 o = newOP(type, OPf_SPECIAL);
3819 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3820 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3826 if (label->op_type == OP_ENTERSUB)
3827 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3828 o = newUNOP(type, OPf_STACKED, label);
3830 PL_hints |= HINT_BLOCK_SCOPE;
3835 Perl_cv_undef(pTHX_ CV *cv)
3840 MUTEX_DESTROY(CvMUTEXP(cv));
3841 Safefree(CvMUTEXP(cv));
3844 #endif /* USE_THREADS */
3846 if (!CvXSUB(cv) && CvROOT(cv)) {
3848 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3849 Perl_croak(aTHX_ "Can't undef active subroutine");
3852 Perl_croak(aTHX_ "Can't undef active subroutine");
3853 #endif /* USE_THREADS */
3856 SAVESPTR(PL_curpad);
3860 op_free(CvROOT(cv));
3861 CvROOT(cv) = Nullop;
3864 SvPOK_off((SV*)cv); /* forget prototype */
3866 SvREFCNT_dec(CvGV(cv));
3868 SvREFCNT_dec(CvOUTSIDE(cv));
3869 CvOUTSIDE(cv) = Nullcv;
3870 if (CvPADLIST(cv)) {
3871 /* may be during global destruction */
3872 if (SvREFCNT(CvPADLIST(cv))) {
3873 I32 i = AvFILLp(CvPADLIST(cv));
3875 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3876 SV* sv = svp ? *svp : Nullsv;
3879 if (sv == (SV*)PL_comppad_name)
3880 PL_comppad_name = Nullav;
3881 else if (sv == (SV*)PL_comppad) {
3882 PL_comppad = Nullav;
3883 PL_curpad = Null(SV**);
3887 SvREFCNT_dec((SV*)CvPADLIST(cv));
3889 CvPADLIST(cv) = Nullav;
3893 #ifdef DEBUG_CLOSURES
3897 CV *outside = CvOUTSIDE(cv);
3898 AV* padlist = CvPADLIST(cv);
3905 PerlIO_printf(Perl_debug_log,
3906 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
3908 (CvANON(cv) ? "ANON"
3909 : (cv == PL_main_cv) ? "MAIN"
3910 : CvUNIQUE(cv) ? "UNIQUE"
3911 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3914 : CvANON(outside) ? "ANON"
3915 : (outside == PL_main_cv) ? "MAIN"
3916 : CvUNIQUE(outside) ? "UNIQUE"
3917 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3922 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3923 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3924 pname = AvARRAY(pad_name);
3925 ppad = AvARRAY(pad);
3927 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3928 if (SvPOK(pname[ix]))
3929 PerlIO_printf(Perl_debug_log,
3930 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
3931 ix, PTR2UV(ppad[ix]),
3932 SvFAKE(pname[ix]) ? "FAKE " : "",
3934 (IV)I_32(SvNVX(pname[ix])),
3938 #endif /* DEBUG_CLOSURES */
3941 S_cv_clone2(pTHX_ CV *proto, CV *outside)
3946 AV* protopadlist = CvPADLIST(proto);
3947 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3948 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3949 SV** pname = AvARRAY(protopad_name);
3950 SV** ppad = AvARRAY(protopad);
3951 I32 fname = AvFILLp(protopad_name);
3952 I32 fpad = AvFILLp(protopad);
3956 assert(!CvUNIQUE(proto));
3959 SAVESPTR(PL_curpad);
3960 SAVESPTR(PL_comppad);
3961 SAVESPTR(PL_comppad_name);
3962 SAVESPTR(PL_compcv);
3964 cv = PL_compcv = (CV*)NEWSV(1104,0);
3965 sv_upgrade((SV *)cv, SvTYPE(proto));
3971 New(666, CvMUTEXP(cv), 1, perl_mutex);
3972 MUTEX_INIT(CvMUTEXP(cv));
3974 #endif /* USE_THREADS */
3975 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3976 CvSTASH(cv) = CvSTASH(proto);
3977 CvROOT(cv) = CvROOT(proto);
3978 CvSTART(cv) = CvSTART(proto);
3980 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3983 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3985 PL_comppad_name = newAV();
3986 for (ix = fname; ix >= 0; ix--)
3987 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3989 PL_comppad = newAV();
3991 comppadlist = newAV();
3992 AvREAL_off(comppadlist);
3993 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3994 av_store(comppadlist, 1, (SV*)PL_comppad);
3995 CvPADLIST(cv) = comppadlist;
3996 av_fill(PL_comppad, AvFILLp(protopad));
3997 PL_curpad = AvARRAY(PL_comppad);
3999 av = newAV(); /* will be @_ */
4001 av_store(PL_comppad, 0, (SV*)av);
4002 AvFLAGS(av) = AVf_REIFY;
4004 for (ix = fpad; ix > 0; ix--) {
4005 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4006 if (namesv && namesv != &PL_sv_undef) {
4007 char *name = SvPVX(namesv); /* XXX */
4008 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4009 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4010 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4012 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4014 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4016 else { /* our own lexical */
4019 /* anon code -- we'll come back for it */
4020 sv = SvREFCNT_inc(ppad[ix]);
4022 else if (*name == '@')
4024 else if (*name == '%')
4034 SV* sv = NEWSV(0,0);
4040 /* Now that vars are all in place, clone nested closures. */
4042 for (ix = fpad; ix > 0; ix--) {
4043 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4045 && namesv != &PL_sv_undef
4046 && !(SvFLAGS(namesv) & SVf_FAKE)
4047 && *SvPVX(namesv) == '&'
4048 && CvCLONE(ppad[ix]))
4050 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4051 SvREFCNT_dec(ppad[ix]);
4054 PL_curpad[ix] = (SV*)kid;
4058 #ifdef DEBUG_CLOSURES
4059 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4061 PerlIO_printf(Perl_debug_log, " from:\n");
4063 PerlIO_printf(Perl_debug_log, " to:\n");
4072 Perl_cv_clone(pTHX_ CV *proto)
4075 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
4076 cv = cv_clone2(proto, CvOUTSIDE(proto));
4077 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
4082 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4086 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_UNSAFE)) {
4087 SV* msg = sv_newmortal();
4091 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4092 sv_setpv(msg, "Prototype mismatch:");
4094 Perl_sv_catpvf(aTHX_ msg, " sub %_", name);
4096 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4097 sv_catpv(msg, " vs ");
4099 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4101 sv_catpv(msg, "none");
4102 Perl_warner(aTHX_ WARN_UNSAFE, "%_", msg);
4107 Perl_cv_const_sv(pTHX_ CV *cv)
4109 if (!cv || !SvPOK(cv) || SvCUR(cv))
4111 return op_const_sv(CvSTART(cv), cv);
4115 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4122 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4123 o = cLISTOPo->op_first->op_sibling;
4125 for (; o; o = o->op_next) {
4126 OPCODE type = o->op_type;
4128 if (sv && o->op_next == o)
4130 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4132 if (type == OP_LEAVESUB || type == OP_RETURN)
4136 if (type == OP_CONST)
4138 else if (type == OP_PADSV && cv) {
4139 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4140 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4141 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4153 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4163 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4167 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4169 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4173 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4177 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4178 GV *gv = gv_fetchpv(name ? name : "__ANON__",
4179 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4181 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4192 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4193 maximum a prototype before. */
4194 if (SvTYPE(gv) > SVt_NULL) {
4195 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4196 && ckWARN_d(WARN_UNSAFE))
4198 Perl_warner(aTHX_ WARN_UNSAFE, "Runaway prototype");
4200 cv_ckproto((CV*)gv, NULL, ps);
4203 sv_setpv((SV*)gv, ps);
4205 sv_setiv((SV*)gv, -1);
4206 SvREFCNT_dec(PL_compcv);
4207 cv = PL_compcv = NULL;
4208 PL_sub_generation++;
4212 if (!name || GvCVGEN(gv))
4214 else if (cv = GvCV(gv)) {
4215 cv_ckproto(cv, gv, ps);
4216 /* already defined (or promised)? */
4217 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4219 bool const_changed = TRUE;
4220 if (!block && !attrs) {
4221 /* just a "sub foo;" when &foo is already defined */
4222 SAVEFREESV(PL_compcv);
4225 /* ahem, death to those who redefine active sort subs */
4226 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4227 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4230 if(const_sv = cv_const_sv(cv))
4231 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4232 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
4233 && !(CvGV(cv) && GvSTASH(CvGV(cv))
4234 && HvNAME(GvSTASH(CvGV(cv)))
4235 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
4237 line_t oldline = PL_curcop->cop_line;
4238 PL_curcop->cop_line = PL_copline;
4239 Perl_warner(aTHX_ WARN_REDEFINE,
4240 const_sv ? "Constant subroutine %s redefined"
4241 : "Subroutine %s redefined", name);
4242 PL_curcop->cop_line = oldline;
4253 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4254 * before we clobber PL_compcv.
4258 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4259 stash = GvSTASH(CvGV(cv));
4260 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4261 stash = CvSTASH(cv);
4263 stash = PL_curstash;
4266 /* possibly about to re-define existing subr -- ignore old cv */
4267 rcv = (SV*)PL_compcv;
4268 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4269 stash = GvSTASH(gv);
4271 stash = PL_curstash;
4273 apply_attrs(stash, rcv, attrs);
4275 if (cv) { /* must reuse cv if autoloaded */
4277 /* got here with just attrs -- work done, so bug out */
4278 SAVEFREESV(PL_compcv);
4282 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4283 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4284 CvOUTSIDE(PL_compcv) = 0;
4285 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4286 CvPADLIST(PL_compcv) = 0;
4287 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4288 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4289 SvREFCNT_dec(PL_compcv);
4296 PL_sub_generation++;
4299 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4300 CvSTASH(cv) = PL_curstash;
4303 if (!CvMUTEXP(cv)) {
4304 New(666, CvMUTEXP(cv), 1, perl_mutex);
4305 MUTEX_INIT(CvMUTEXP(cv));
4307 #endif /* USE_THREADS */
4310 sv_setpv((SV*)cv, ps);
4312 if (PL_error_count) {
4316 char *s = strrchr(name, ':');
4318 if (strEQ(s, "BEGIN")) {
4320 "BEGIN not safe after errors--compilation aborted";
4321 if (PL_in_eval & EVAL_KEEPERR)
4322 Perl_croak(aTHX_ not_safe);
4324 /* force display of errors found but not reported */
4325 sv_catpv(ERRSV, not_safe);
4326 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4333 PL_copline = NOLINE;
4338 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4339 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4342 SV **namep = AvARRAY(PL_comppad_name);
4343 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4346 if (SvIMMORTAL(PL_curpad[ix]))
4349 * The only things that a clonable function needs in its
4350 * pad are references to outer lexicals and anonymous subs.
4351 * The rest are created anew during cloning.
4353 if (!((namesv = namep[ix]) != Nullsv &&
4354 namesv != &PL_sv_undef &&
4356 *SvPVX(namesv) == '&')))
4358 SvREFCNT_dec(PL_curpad[ix]);
4359 PL_curpad[ix] = Nullsv;
4364 AV *av = newAV(); /* Will be @_ */
4366 av_store(PL_comppad, 0, (SV*)av);
4367 AvFLAGS(av) = AVf_REIFY;
4369 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4370 if (SvIMMORTAL(PL_curpad[ix]))
4372 if (!SvPADMY(PL_curpad[ix]))
4373 SvPADTMP_on(PL_curpad[ix]);
4378 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4381 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4383 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4384 OpREFCNT_set(CvROOT(cv), 1);
4385 CvSTART(cv) = LINKLIST(CvROOT(cv));
4386 CvROOT(cv)->op_next = 0;
4392 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4393 SV *sv = NEWSV(0,0);
4394 SV *tmpstr = sv_newmortal();
4395 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4399 Perl_sv_setpvf(aTHX_ sv, "%_:%ld-%ld",
4400 CopFILESV(PL_curcop),
4401 (long)PL_subline, (long)CopLINE(PL_curcop));
4402 gv_efullname3(tmpstr, gv, Nullch);
4403 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4404 hv = GvHVn(db_postponed);
4405 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4406 && (cv = GvCV(db_postponed))) {
4411 call_sv((SV*)cv, G_DISCARD);
4415 if ((s = strrchr(name,':')))
4419 if (strEQ(s, "BEGIN")) {
4420 I32 oldscope = PL_scopestack_ix;
4422 SAVESPTR(CopFILEGV(&PL_compiling));
4423 SAVEI16(PL_compiling.cop_line);
4425 sv_setsv(PL_rs, PL_nrs);
4428 PL_beginav = newAV();
4429 DEBUG_x( dump_sub(gv) );
4430 av_push(PL_beginav, (SV *)cv);
4432 call_list(oldscope, PL_beginav);
4434 PL_curcop = &PL_compiling;
4435 PL_compiling.op_private = PL_hints;
4438 else if (strEQ(s, "END") && !PL_error_count) {
4441 av_unshift(PL_endav, 1);
4442 av_store(PL_endav, 0, (SV *)cv);
4445 else if (strEQ(s, "STOP") && !PL_error_count) {
4447 PL_stopav = newAV();
4448 av_unshift(PL_stopav, 1);
4449 av_store(PL_stopav, 0, (SV *)cv);
4452 else if (strEQ(s, "INIT") && !PL_error_count) {
4454 PL_initav = newAV();
4455 av_push(PL_initav, SvREFCNT_inc(cv));
4461 PL_copline = NOLINE;
4466 /* XXX unsafe for threads if eval_owner isn't held */
4468 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4471 U32 oldhints = PL_hints;
4472 HV *old_cop_stash = PL_curcop->cop_stash;
4473 HV *old_curstash = PL_curstash;
4474 line_t oldline = PL_curcop->cop_line;
4475 PL_curcop->cop_line = PL_copline;
4477 PL_hints &= ~HINT_BLOCK_SCOPE;
4479 PL_curstash = PL_curcop->cop_stash = stash;
4482 start_subparse(FALSE, 0),
4483 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4484 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4486 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4489 PL_hints = oldhints;
4490 PL_curcop->cop_stash = old_cop_stash;
4491 PL_curstash = old_curstash;
4492 PL_curcop->cop_line = oldline;
4496 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4499 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4502 if (cv = (name ? GvCV(gv) : Nullcv)) {
4504 /* just a cached method */
4508 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4509 /* already defined (or promised) */
4510 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4511 && HvNAME(GvSTASH(CvGV(cv)))
4512 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4513 line_t oldline = PL_curcop->cop_line;
4514 if (PL_copline != NOLINE)
4515 PL_curcop->cop_line = PL_copline;
4516 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4517 PL_curcop->cop_line = oldline;
4524 if (cv) /* must reuse cv if autoloaded */
4527 cv = (CV*)NEWSV(1105,0);
4528 sv_upgrade((SV *)cv, SVt_PVCV);
4532 PL_sub_generation++;
4535 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4537 New(666, CvMUTEXP(cv), 1, perl_mutex);
4538 MUTEX_INIT(CvMUTEXP(cv));
4540 #endif /* USE_THREADS */
4541 (void)gv_fetchfile(filename);
4542 CvXSUB(cv) = subaddr;
4545 char *s = strrchr(name,':');
4550 if (strEQ(s, "BEGIN")) {
4552 PL_beginav = newAV();
4553 av_push(PL_beginav, (SV *)cv);
4556 else if (strEQ(s, "END")) {
4559 av_unshift(PL_endav, 1);
4560 av_store(PL_endav, 0, (SV *)cv);
4563 else if (strEQ(s, "STOP")) {
4565 PL_stopav = newAV();
4566 av_unshift(PL_stopav, 1);
4567 av_store(PL_stopav, 0, (SV *)cv);
4570 else if (strEQ(s, "INIT")) {
4572 PL_initav = newAV();
4573 av_push(PL_initav, (SV *)cv);
4584 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4594 name = SvPVx(cSVOPo->op_sv, n_a);
4597 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4599 if (cv = GvFORM(gv)) {
4600 if (ckWARN(WARN_REDEFINE)) {
4601 line_t oldline = PL_curcop->cop_line;
4603 PL_curcop->cop_line = PL_copline;
4604 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4605 PL_curcop->cop_line = oldline;
4611 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4613 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4614 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4615 SvPADTMP_on(PL_curpad[ix]);
4618 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4619 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4620 OpREFCNT_set(CvROOT(cv), 1);
4621 CvSTART(cv) = LINKLIST(CvROOT(cv));
4622 CvROOT(cv)->op_next = 0;
4625 PL_copline = NOLINE;
4630 Perl_newANONLIST(pTHX_ OP *o)
4632 return newUNOP(OP_REFGEN, 0,
4633 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4637 Perl_newANONHASH(pTHX_ OP *o)
4639 return newUNOP(OP_REFGEN, 0,
4640 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4644 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4646 return newANONATTRSUB(floor, proto, Nullop, block);
4650 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4652 return newUNOP(OP_REFGEN, 0,
4653 newSVOP(OP_ANONCODE, 0,
4654 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4658 Perl_oopsAV(pTHX_ OP *o)
4660 switch (o->op_type) {
4662 o->op_type = OP_PADAV;
4663 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4664 return ref(o, OP_RV2AV);
4667 o->op_type = OP_RV2AV;
4668 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4673 if (ckWARN_d(WARN_INTERNAL))
4674 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4681 Perl_oopsHV(pTHX_ OP *o)
4685 switch (o->op_type) {
4688 o->op_type = OP_PADHV;
4689 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4690 return ref(o, OP_RV2HV);
4694 o->op_type = OP_RV2HV;
4695 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4700 if (ckWARN_d(WARN_INTERNAL))
4701 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
4708 Perl_newAVREF(pTHX_ OP *o)
4710 if (o->op_type == OP_PADANY) {
4711 o->op_type = OP_PADAV;
4712 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4715 return newUNOP(OP_RV2AV, 0, scalar(o));
4719 Perl_newGVREF(pTHX_ I32 type, OP *o)
4721 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4722 return newUNOP(OP_NULL, 0, o);
4723 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4727 Perl_newHVREF(pTHX_ OP *o)
4729 if (o->op_type == OP_PADANY) {
4730 o->op_type = OP_PADHV;
4731 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4734 return newUNOP(OP_RV2HV, 0, scalar(o));
4738 Perl_oopsCV(pTHX_ OP *o)
4740 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4746 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4748 return newUNOP(OP_RV2CV, flags, scalar(o));
4752 Perl_newSVREF(pTHX_ OP *o)
4754 if (o->op_type == OP_PADANY) {
4755 o->op_type = OP_PADSV;
4756 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4759 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4760 o->op_flags |= OPpDONE_SVREF;
4763 return newUNOP(OP_RV2SV, 0, scalar(o));
4766 /* Check routines. */
4769 Perl_ck_anoncode(pTHX_ OP *o)
4774 name = NEWSV(1106,0);
4775 sv_upgrade(name, SVt_PVNV);
4776 sv_setpvn(name, "&", 1);
4779 ix = pad_alloc(o->op_type, SVs_PADMY);
4780 av_store(PL_comppad_name, ix, name);
4781 av_store(PL_comppad, ix, cSVOPo->op_sv);
4782 SvPADMY_on(cSVOPo->op_sv);
4783 cSVOPo->op_sv = Nullsv;
4784 cSVOPo->op_targ = ix;
4789 Perl_ck_bitop(pTHX_ OP *o)
4791 o->op_private = PL_hints;
4796 Perl_ck_concat(pTHX_ OP *o)
4798 if (cUNOPo->op_first->op_type == OP_CONCAT)
4799 o->op_flags |= OPf_STACKED;
4804 Perl_ck_spair(pTHX_ OP *o)
4806 if (o->op_flags & OPf_KIDS) {
4809 OPCODE type = o->op_type;
4810 o = modkids(ck_fun(o), type);
4811 kid = cUNOPo->op_first;
4812 newop = kUNOP->op_first->op_sibling;
4814 (newop->op_sibling ||
4815 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4816 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4817 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4821 op_free(kUNOP->op_first);
4822 kUNOP->op_first = newop;
4824 o->op_ppaddr = PL_ppaddr[++o->op_type];
4829 Perl_ck_delete(pTHX_ OP *o)
4833 if (o->op_flags & OPf_KIDS) {
4834 OP *kid = cUNOPo->op_first;
4835 if (kid->op_type == OP_HSLICE)
4836 o->op_private |= OPpSLICE;
4837 else if (kid->op_type != OP_HELEM)
4838 Perl_croak(aTHX_ "%s argument is not a HASH element or slice",
4839 PL_op_desc[o->op_type]);
4846 Perl_ck_eof(pTHX_ OP *o)
4848 I32 type = o->op_type;
4850 if (o->op_flags & OPf_KIDS) {
4851 if (cLISTOPo->op_first->op_type == OP_STUB) {
4853 o = newUNOP(type, OPf_SPECIAL,
4854 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4862 Perl_ck_eval(pTHX_ OP *o)
4864 PL_hints |= HINT_BLOCK_SCOPE;
4865 if (o->op_flags & OPf_KIDS) {
4866 SVOP *kid = (SVOP*)cUNOPo->op_first;
4869 o->op_flags &= ~OPf_KIDS;
4872 else if (kid->op_type == OP_LINESEQ) {
4875 kid->op_next = o->op_next;
4876 cUNOPo->op_first = 0;
4879 NewOp(1101, enter, 1, LOGOP);
4880 enter->op_type = OP_ENTERTRY;
4881 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4882 enter->op_private = 0;
4884 /* establish postfix order */
4885 enter->op_next = (OP*)enter;
4887 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4888 o->op_type = OP_LEAVETRY;
4889 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4890 enter->op_other = o;
4898 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4900 o->op_targ = (PADOFFSET)PL_hints;
4905 Perl_ck_exec(pTHX_ OP *o)
4908 if (o->op_flags & OPf_STACKED) {
4910 kid = cUNOPo->op_first->op_sibling;
4911 if (kid->op_type == OP_RV2GV)
4920 Perl_ck_exists(pTHX_ OP *o)
4923 if (o->op_flags & OPf_KIDS) {
4924 OP *kid = cUNOPo->op_first;
4925 if (kid->op_type != OP_HELEM)
4926 Perl_croak(aTHX_ "%s argument is not a HASH element", PL_op_desc[o->op_type]);
4934 Perl_ck_gvconst(pTHX_ register OP *o)
4936 o = fold_constants(o);
4937 if (o->op_type == OP_CONST)
4944 Perl_ck_rvconst(pTHX_ register OP *o)
4947 SVOP *kid = (SVOP*)cUNOPo->op_first;
4949 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4950 if (kid->op_type == OP_CONST) {
4954 SV *kidsv = kid->op_sv;
4957 /* Is it a constant from cv_const_sv()? */
4958 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4959 SV *rsv = SvRV(kidsv);
4960 int svtype = SvTYPE(rsv);
4961 char *badtype = Nullch;
4963 switch (o->op_type) {
4965 if (svtype > SVt_PVMG)
4966 badtype = "a SCALAR";
4969 if (svtype != SVt_PVAV)
4970 badtype = "an ARRAY";
4973 if (svtype != SVt_PVHV) {
4974 if (svtype == SVt_PVAV) { /* pseudohash? */
4975 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4976 if (ksv && SvROK(*ksv)
4977 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4986 if (svtype != SVt_PVCV)
4991 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
4994 name = SvPV(kidsv, n_a);
4995 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4996 char *badthing = Nullch;
4997 switch (o->op_type) {
4999 badthing = "a SCALAR";
5002 badthing = "an ARRAY";
5005 badthing = "a HASH";
5010 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5014 * This is a little tricky. We only want to add the symbol if we
5015 * didn't add it in the lexer. Otherwise we get duplicate strict
5016 * warnings. But if we didn't add it in the lexer, we must at
5017 * least pretend like we wanted to add it even if it existed before,
5018 * or we get possible typo warnings. OPpCONST_ENTERED says
5019 * whether the lexer already added THIS instance of this symbol.
5021 iscv = (o->op_type == OP_RV2CV) * 2;
5023 gv = gv_fetchpv(name,
5024 iscv | !(kid->op_private & OPpCONST_ENTERED),
5027 : o->op_type == OP_RV2SV
5029 : o->op_type == OP_RV2AV
5031 : o->op_type == OP_RV2HV
5034 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5036 kid->op_type = OP_GV;
5037 SvREFCNT_dec(kid->op_sv);
5039 /* XXXXXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5040 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5041 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5043 kid->op_sv = SvREFCNT_inc(gv);
5045 kid->op_ppaddr = PL_ppaddr[OP_GV];
5052 Perl_ck_ftst(pTHX_ OP *o)
5055 I32 type = o->op_type;
5057 if (o->op_flags & OPf_REF)
5060 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5061 SVOP *kid = (SVOP*)cUNOPo->op_first;
5063 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5065 OP *newop = newGVOP(type, OPf_REF,
5066 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5073 if (type == OP_FTTTY)
5074 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5077 return newUNOP(type, 0, newDEFSVOP());
5083 Perl_ck_fun(pTHX_ OP *o)
5090 int type = o->op_type;
5091 register I32 oa = PL_opargs[type] >> OASHIFT;
5093 if (o->op_flags & OPf_STACKED) {
5094 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5097 return no_fh_allowed(o);
5100 if (o->op_flags & OPf_KIDS) {
5102 tokid = &cLISTOPo->op_first;
5103 kid = cLISTOPo->op_first;
5104 if (kid->op_type == OP_PUSHMARK ||
5105 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
5107 tokid = &kid->op_sibling;
5108 kid = kid->op_sibling;
5110 if (!kid && PL_opargs[type] & OA_DEFGV)
5111 *tokid = kid = newDEFSVOP();
5115 sibl = kid->op_sibling;
5118 /* list seen where single (scalar) arg expected? */
5119 if (numargs == 1 && !(oa >> 4)
5120 && kid->op_type == OP_LIST && type != OP_SCALAR)
5122 return too_many_arguments(o,PL_op_desc[type]);
5135 if (kid->op_type == OP_CONST &&
5136 (kid->op_private & OPpCONST_BARE))
5138 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5139 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5140 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5141 if (ckWARN(WARN_SYNTAX))
5142 Perl_warner(aTHX_ WARN_SYNTAX,
5143 "Array @%s missing the @ in argument %"IVdf" of %s()",
5144 name, (IV)numargs, PL_op_desc[type]);
5147 kid->op_sibling = sibl;
5150 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5151 bad_type(numargs, "array", PL_op_desc[type], kid);
5155 if (kid->op_type == OP_CONST &&
5156 (kid->op_private & OPpCONST_BARE))
5158 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5159 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5160 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5161 if (ckWARN(WARN_SYNTAX))
5162 Perl_warner(aTHX_ WARN_SYNTAX,
5163 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5164 name, (IV)numargs, PL_op_desc[type]);
5167 kid->op_sibling = sibl;
5170 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5171 bad_type(numargs, "hash", PL_op_desc[type], kid);
5176 OP *newop = newUNOP(OP_NULL, 0, kid);
5177 kid->op_sibling = 0;
5179 newop->op_next = newop;
5181 kid->op_sibling = sibl;
5186 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5187 if (kid->op_type == OP_CONST &&
5188 (kid->op_private & OPpCONST_BARE))
5190 OP *newop = newGVOP(OP_GV, 0,
5191 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5196 else if (kid->op_type == OP_READLINE) {
5197 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5198 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5201 I32 flags = OPf_SPECIAL;
5203 /* is this op a FH constructor? */
5204 if (is_handle_constructor(o,numargs)) {
5206 /* Set a flag to tell rv2gv to vivify
5207 * need to "prove" flag does not mean something
5208 * else already - NI-S 1999/05/07
5212 /* Helps with open($array[$n],...)
5213 but is too simplistic - need to do selectively
5218 kid->op_sibling = 0;
5219 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5221 kid->op_private |= priv;
5224 kid->op_sibling = sibl;
5230 mod(scalar(kid), type);
5234 tokid = &kid->op_sibling;
5235 kid = kid->op_sibling;
5237 o->op_private |= numargs;
5239 return too_many_arguments(o,PL_op_desc[o->op_type]);
5242 else if (PL_opargs[type] & OA_DEFGV) {
5244 return newUNOP(type, 0, newDEFSVOP());
5248 while (oa & OA_OPTIONAL)
5250 if (oa && oa != OA_LIST)
5251 return too_few_arguments(o,PL_op_desc[o->op_type]);
5257 Perl_ck_glob(pTHX_ OP *o)
5261 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5262 append_elem(OP_GLOB, o, newDEFSVOP());
5264 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5265 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5267 #if defined(PERL_INTERNAL_GLOB) && !defined(MINIPERL_BUILD)
5268 /* XXX this can be tightened up and made more failsafe. */
5270 OP *modname = newSVOP(OP_CONST, 0, newSVpvn("File::Glob", 10));
5271 modname->op_private |= OPpCONST_BARE;
5273 utilize(1, start_subparse(FALSE, 0), Nullop, modname,
5274 newSVOP(OP_CONST, 0, newSVpvn("globally", 8)));
5275 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5278 #endif /* PERL_INTERNAL_GLOB && !MINIPERL_BUILD */
5280 if (gv && GvIMPORTED_CV(gv)) {
5281 append_elem(OP_GLOB, o,
5282 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5283 o->op_type = OP_LIST;
5284 o->op_ppaddr = PL_ppaddr[OP_LIST];
5285 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5286 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5287 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5288 append_elem(OP_LIST, o,
5289 scalar(newUNOP(OP_RV2CV, 0,
5290 newGVOP(OP_GV, 0, gv)))));
5291 o = newUNOP(OP_NULL, 0, ck_subr(o));
5292 o->op_targ = OP_GLOB; /* hint at what it used to be */
5295 gv = newGVgen("main");
5297 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5303 Perl_ck_grep(pTHX_ OP *o)
5307 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5309 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5310 NewOp(1101, gwop, 1, LOGOP);
5312 if (o->op_flags & OPf_STACKED) {
5315 kid = cLISTOPo->op_first->op_sibling;
5316 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5319 kid->op_next = (OP*)gwop;
5320 o->op_flags &= ~OPf_STACKED;
5322 kid = cLISTOPo->op_first->op_sibling;
5323 if (type == OP_MAPWHILE)
5330 kid = cLISTOPo->op_first->op_sibling;
5331 if (kid->op_type != OP_NULL)
5332 Perl_croak(aTHX_ "panic: ck_grep");
5333 kid = kUNOP->op_first;
5335 gwop->op_type = type;
5336 gwop->op_ppaddr = PL_ppaddr[type];
5337 gwop->op_first = listkids(o);
5338 gwop->op_flags |= OPf_KIDS;
5339 gwop->op_private = 1;
5340 gwop->op_other = LINKLIST(kid);
5341 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5342 kid->op_next = (OP*)gwop;
5344 kid = cLISTOPo->op_first->op_sibling;
5345 if (!kid || !kid->op_sibling)
5346 return too_few_arguments(o,PL_op_desc[o->op_type]);
5347 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5348 mod(kid, OP_GREPSTART);
5354 Perl_ck_index(pTHX_ OP *o)
5356 if (o->op_flags & OPf_KIDS) {
5357 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5359 kid = kid->op_sibling; /* get past "big" */
5360 if (kid && kid->op_type == OP_CONST)
5361 fbm_compile(((SVOP*)kid)->op_sv, 0);
5367 Perl_ck_lengthconst(pTHX_ OP *o)
5369 /* XXX length optimization goes here */
5374 Perl_ck_lfun(pTHX_ OP *o)
5376 OPCODE type = o->op_type;
5377 return modkids(ck_fun(o), type);
5381 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5384 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5385 switch (cUNOPo->op_first->op_type) {
5387 break; /* Globals via GV can be undef */
5389 case OP_AASSIGN: /* Is this a good idea? */
5390 Perl_warner(aTHX_ WARN_DEPRECATED,
5391 "defined(@array) is deprecated");
5392 Perl_warner(aTHX_ WARN_DEPRECATED,
5393 "(Maybe you should just omit the defined()?)\n");
5396 break; /* Globals via GV can be undef */
5398 Perl_warner(aTHX_ WARN_DEPRECATED,
5399 "defined(%hash) is deprecated");
5400 Perl_warner(aTHX_ WARN_DEPRECATED,
5401 "(Maybe you should just omit the defined()?)\n");
5412 Perl_ck_rfun(pTHX_ OP *o)
5414 OPCODE type = o->op_type;
5415 return refkids(ck_fun(o), type);
5419 Perl_ck_listiob(pTHX_ OP *o)
5423 kid = cLISTOPo->op_first;
5426 kid = cLISTOPo->op_first;
5428 if (kid->op_type == OP_PUSHMARK)
5429 kid = kid->op_sibling;
5430 if (kid && o->op_flags & OPf_STACKED)
5431 kid = kid->op_sibling;
5432 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5433 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5434 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5435 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5436 cLISTOPo->op_first->op_sibling = kid;
5437 cLISTOPo->op_last = kid;
5438 kid = kid->op_sibling;
5443 append_elem(o->op_type, o, newDEFSVOP());
5449 if (PL_hints & HINT_LOCALE)
5450 o->op_private |= OPpLOCALE;
5457 Perl_ck_fun_locale(pTHX_ OP *o)
5463 if (PL_hints & HINT_LOCALE)
5464 o->op_private |= OPpLOCALE;
5471 Perl_ck_sassign(pTHX_ OP *o)
5473 OP *kid = cLISTOPo->op_first;
5474 /* has a disposable target? */
5475 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5476 && !(kid->op_flags & OPf_STACKED))
5478 OP *kkid = kid->op_sibling;
5480 /* Can just relocate the target. */
5481 if (kkid && kkid->op_type == OP_PADSV
5482 && !(kkid->op_private & OPpLVAL_INTRO))
5484 /* Concat has problems if target is equal to right arg. */
5485 if (kid->op_type == OP_CONCAT) {
5486 if (kLISTOP->op_first->op_sibling->op_type == OP_PADSV
5487 && kLISTOP->op_first->op_sibling->op_targ == kkid->op_targ)
5490 else if (kid->op_type == OP_JOIN) {
5491 /* do_join has problems if the arguments coincide with target.
5492 In fact the second argument *can* safely coincide,
5493 but ignore=pessimize this rare occasion. */
5494 OP *arg = kLISTOP->op_first->op_sibling; /* Skip PUSHMARK */
5497 if (arg->op_type == OP_PADSV
5498 && arg->op_targ == kkid->op_targ)
5500 arg = arg->op_sibling;
5503 else if (kid->op_type == OP_QUOTEMETA) {
5504 /* quotemeta has problems if the argument coincides with target. */
5505 if (kLISTOP->op_first->op_type == OP_PADSV
5506 && kLISTOP->op_first->op_targ == kkid->op_targ)
5509 kid->op_targ = kkid->op_targ;
5510 /* Now we do not need PADSV and SASSIGN. */
5511 kid->op_sibling = o->op_sibling; /* NULL */
5512 cLISTOPo->op_first = NULL;
5515 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5523 Perl_ck_scmp(pTHX_ OP *o)
5527 if (PL_hints & HINT_LOCALE)
5528 o->op_private |= OPpLOCALE;
5535 Perl_ck_match(pTHX_ OP *o)
5537 o->op_private |= OPpRUNTIME;
5542 Perl_ck_method(pTHX_ OP *o)
5544 OP *kid = cUNOPo->op_first;
5545 if (kid->op_type == OP_CONST) {
5546 SV* sv = kSVOP->op_sv;
5547 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5549 sv_upgrade(sv, SVt_PVIV);
5551 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5552 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5553 kSVOP->op_sv = Nullsv;
5562 Perl_ck_null(pTHX_ OP *o)
5568 Perl_ck_repeat(pTHX_ OP *o)
5570 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5571 o->op_private |= OPpREPEAT_DOLIST;
5572 cBINOPo->op_first = force_list(cBINOPo->op_first);
5580 Perl_ck_require(pTHX_ OP *o)
5582 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5583 SVOP *kid = (SVOP*)cUNOPo->op_first;
5585 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5587 for (s = SvPVX(kid->op_sv); *s; s++) {
5588 if (*s == ':' && s[1] == ':') {
5590 Move(s+2, s+1, strlen(s+2)+1, char);
5591 --SvCUR(kid->op_sv);
5594 sv_catpvn(kid->op_sv, ".pm", 3);
5602 Perl_ck_retarget(pTHX_ OP *o)
5604 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5611 Perl_ck_select(pTHX_ OP *o)
5614 if (o->op_flags & OPf_KIDS) {
5615 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5616 if (kid && kid->op_sibling) {
5617 o->op_type = OP_SSELECT;
5618 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5620 return fold_constants(o);
5624 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5625 if (kid && kid->op_type == OP_RV2GV)
5626 kid->op_private &= ~HINT_STRICT_REFS;
5631 Perl_ck_shift(pTHX_ OP *o)
5633 I32 type = o->op_type;
5635 if (!(o->op_flags & OPf_KIDS)) {
5640 if (!CvUNIQUE(PL_compcv)) {
5641 argop = newOP(OP_PADAV, OPf_REF);
5642 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5645 argop = newUNOP(OP_RV2AV, 0,
5646 scalar(newGVOP(OP_GV, 0,
5647 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5650 argop = newUNOP(OP_RV2AV, 0,
5651 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5652 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5653 #endif /* USE_THREADS */
5654 return newUNOP(type, 0, scalar(argop));
5656 return scalar(modkids(ck_fun(o), type));
5660 Perl_ck_sort(pTHX_ OP *o)
5664 if (PL_hints & HINT_LOCALE)
5665 o->op_private |= OPpLOCALE;
5668 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5670 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5671 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5673 kid = kUNOP->op_first; /* get past null */
5675 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5677 if (kid->op_type == OP_SCOPE) {
5681 else if (kid->op_type == OP_LEAVE) {
5682 if (o->op_type == OP_SORT) {
5683 null(kid); /* wipe out leave */
5686 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5687 if (k->op_next == kid)
5692 kid->op_next = 0; /* just disconnect the leave */
5693 k = kLISTOP->op_first;
5697 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5698 if (o->op_type == OP_SORT)
5702 o->op_flags |= OPf_SPECIAL;
5704 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5705 null(cLISTOPo->op_first->op_sibling);
5712 S_simplify_sort(pTHX_ OP *o)
5715 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5719 if (!(o->op_flags & OPf_STACKED))
5721 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5722 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5723 kid = kUNOP->op_first; /* get past null */
5724 if (kid->op_type != OP_SCOPE)
5726 kid = kLISTOP->op_last; /* get past scope */
5727 switch(kid->op_type) {
5735 k = kid; /* remember this node*/
5736 if (kBINOP->op_first->op_type != OP_RV2SV)
5738 kid = kBINOP->op_first; /* get past cmp */
5739 if (kUNOP->op_first->op_type != OP_GV)
5741 kid = kUNOP->op_first; /* get past rv2sv */
5743 if (GvSTASH(gv) != PL_curstash)
5745 if (strEQ(GvNAME(gv), "a"))
5747 else if(strEQ(GvNAME(gv), "b"))
5751 kid = k; /* back to cmp */
5752 if (kBINOP->op_last->op_type != OP_RV2SV)
5754 kid = kBINOP->op_last; /* down to 2nd arg */
5755 if (kUNOP->op_first->op_type != OP_GV)
5757 kid = kUNOP->op_first; /* get past rv2sv */
5759 if (GvSTASH(gv) != PL_curstash
5761 ? strNE(GvNAME(gv), "a")
5762 : strNE(GvNAME(gv), "b")))
5764 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5766 o->op_private |= OPpSORT_REVERSE;
5767 if (k->op_type == OP_NCMP)
5768 o->op_private |= OPpSORT_NUMERIC;
5769 if (k->op_type == OP_I_NCMP)
5770 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5771 kid = cLISTOPo->op_first->op_sibling;
5772 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
5773 op_free(kid); /* then delete it */
5774 cLISTOPo->op_children--;
5778 Perl_ck_split(pTHX_ OP *o)
5782 if (o->op_flags & OPf_STACKED)
5783 return no_fh_allowed(o);
5785 kid = cLISTOPo->op_first;
5786 if (kid->op_type != OP_NULL)
5787 Perl_croak(aTHX_ "panic: ck_split");
5788 kid = kid->op_sibling;
5789 op_free(cLISTOPo->op_first);
5790 cLISTOPo->op_first = kid;
5792 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5793 cLISTOPo->op_last = kid; /* There was only one element previously */
5796 if (kid->op_type != OP_MATCH) {
5797 OP *sibl = kid->op_sibling;
5798 kid->op_sibling = 0;
5799 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5800 if (cLISTOPo->op_first == cLISTOPo->op_last)
5801 cLISTOPo->op_last = kid;
5802 cLISTOPo->op_first = kid;
5803 kid->op_sibling = sibl;
5806 kid->op_type = OP_PUSHRE;
5807 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5810 if (!kid->op_sibling)
5811 append_elem(OP_SPLIT, o, newDEFSVOP());
5813 kid = kid->op_sibling;
5816 if (!kid->op_sibling)
5817 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5819 kid = kid->op_sibling;
5822 if (kid->op_sibling)
5823 return too_many_arguments(o,PL_op_desc[o->op_type]);
5829 Perl_ck_join(pTHX_ OP *o)
5831 if (ckWARN(WARN_SYNTAX)) {
5832 OP *kid = cLISTOPo->op_first->op_sibling;
5833 if (kid && kid->op_type == OP_MATCH) {
5834 char *pmstr = "STRING";
5835 if (kPMOP->op_pmregexp)
5836 pmstr = kPMOP->op_pmregexp->precomp;
5837 Perl_warner(aTHX_ WARN_SYNTAX,
5838 "/%s/ should probably be written as \"%s\"",
5846 Perl_ck_subr(pTHX_ OP *o)
5849 OP *prev = ((cUNOPo->op_first->op_sibling)
5850 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5851 OP *o2 = prev->op_sibling;
5860 o->op_private |= OPpENTERSUB_HASTARG;
5861 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5862 if (cvop->op_type == OP_RV2CV) {
5864 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5865 null(cvop); /* disable rv2cv */
5866 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5867 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
5868 GV *gv = cGVOPx(tmpop);
5871 tmpop->op_private |= OPpEARLY_CV;
5872 else if (SvPOK(cv)) {
5873 namegv = CvANON(cv) ? gv : CvGV(cv);
5874 proto = SvPV((SV*)cv, n_a);
5878 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
5879 if (o2->op_type == OP_CONST)
5880 o2->op_private &= ~OPpCONST_STRICT;
5881 else if (o2->op_type == OP_LIST) {
5882 OP *o = ((UNOP*)o2)->op_first->op_sibling;
5883 if (o && o->op_type == OP_CONST)
5884 o->op_private &= ~OPpCONST_STRICT;
5887 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5888 if (PERLDB_SUB && PL_curstash != PL_debstash)
5889 o->op_private |= OPpENTERSUB_DB;
5890 while (o2 != cvop) {
5894 return too_many_arguments(o, gv_ename(namegv));
5912 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5913 bad_type(arg, "block", gv_ename(namegv), o2);
5916 /* '*' allows any scalar type, including bareword */
5919 if (o2->op_type == OP_RV2GV)
5920 goto wrapref; /* autoconvert GLOB -> GLOBref */
5921 else if (o2->op_type == OP_CONST)
5922 o2->op_private &= ~OPpCONST_STRICT;
5923 else if (o2->op_type == OP_ENTERSUB) {
5924 /* accidental subroutine, revert to bareword */
5925 OP *gvop = ((UNOP*)o2)->op_first;
5926 if (gvop && gvop->op_type == OP_NULL) {
5927 gvop = ((UNOP*)gvop)->op_first;
5929 for (; gvop->op_sibling; gvop = gvop->op_sibling)
5932 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
5933 (gvop = ((UNOP*)gvop)->op_first) &&
5934 gvop->op_type == OP_GV)
5936 GV *gv = cGVOPx(gvop);
5937 OP *sibling = o2->op_sibling;
5938 SV *n = newSVpvn("",0);
5940 gv_fullname3(n, gv, "");
5941 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
5942 sv_chop(n, SvPVX(n)+6);
5943 o2 = newSVOP(OP_CONST, 0, n);
5944 prev->op_sibling = o2;
5945 o2->op_sibling = sibling;
5957 if (o2->op_type != OP_RV2GV)
5958 bad_type(arg, "symbol", gv_ename(namegv), o2);
5961 if (o2->op_type != OP_RV2CV)
5962 bad_type(arg, "sub", gv_ename(namegv), o2);
5965 if (o2->op_type != OP_RV2SV
5966 && o2->op_type != OP_PADSV
5967 && o2->op_type != OP_HELEM
5968 && o2->op_type != OP_AELEM
5969 && o2->op_type != OP_THREADSV)
5971 bad_type(arg, "scalar", gv_ename(namegv), o2);
5975 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5976 bad_type(arg, "array", gv_ename(namegv), o2);
5979 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5980 bad_type(arg, "hash", gv_ename(namegv), o2);
5984 OP* sib = kid->op_sibling;
5985 kid->op_sibling = 0;
5986 o2 = newUNOP(OP_REFGEN, 0, kid);
5987 o2->op_sibling = sib;
5988 prev->op_sibling = o2;
5999 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6000 gv_ename(namegv), SvPV((SV*)cv, n_a));
6005 mod(o2, OP_ENTERSUB);
6007 o2 = o2->op_sibling;
6009 if (proto && !optional &&
6010 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6011 return too_few_arguments(o, gv_ename(namegv));
6016 Perl_ck_svconst(pTHX_ OP *o)
6018 SvREADONLY_on(cSVOPo->op_sv);
6023 Perl_ck_trunc(pTHX_ OP *o)
6025 if (o->op_flags & OPf_KIDS) {
6026 SVOP *kid = (SVOP*)cUNOPo->op_first;
6028 if (kid->op_type == OP_NULL)
6029 kid = (SVOP*)kid->op_sibling;
6030 if (kid && kid->op_type == OP_CONST &&
6031 (kid->op_private & OPpCONST_BARE))
6033 o->op_flags |= OPf_SPECIAL;
6034 kid->op_private &= ~OPpCONST_STRICT;
6040 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6043 Perl_peep(pTHX_ register OP *o)
6046 register OP* oldop = 0;
6048 OP *last_composite = Nullop;
6050 if (!o || o->op_seq)
6054 SAVESPTR(PL_curcop);
6055 for (; o; o = o->op_next) {
6061 switch (o->op_type) {
6065 PL_curcop = ((COP*)o); /* for warnings */
6066 o->op_seq = PL_op_seqmax++;
6067 last_composite = Nullop;
6071 if (cSVOPo->op_private & OPpCONST_STRICT)
6072 no_bareword_allowed(o);
6078 if ( o->op_next && o->op_next->op_type == OP_STRINGIFY
6079 && !(o->op_next->op_private & OPpTARGET_MY) )
6081 o->op_seq = PL_op_seqmax++;
6086 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6087 if (o->op_next->op_private & OPpTARGET_MY) {
6088 if ((o->op_flags & OPf_STACKED) /* chained concats */
6089 || (o->op_type == OP_CONCAT
6090 /* Concat has problems if target is equal to right arg. */
6091 && (((LISTOP*)o)->op_first->op_sibling->op_type
6093 && (((LISTOP*)o)->op_first->op_sibling->op_targ
6094 == o->op_next->op_targ))) {
6095 goto ignore_optimization;
6098 o->op_targ = o->op_next->op_targ;
6099 o->op_private |= OPpTARGET_MY;
6104 ignore_optimization:
6105 o->op_seq = PL_op_seqmax++;
6108 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6109 o->op_seq = PL_op_seqmax++;
6110 break; /* Scalar stub must produce undef. List stub is noop */
6114 if (o->op_targ == OP_NEXTSTATE
6115 || o->op_targ == OP_DBSTATE
6116 || o->op_targ == OP_SETSTATE)
6118 PL_curcop = ((COP*)o);
6125 if (oldop && o->op_next) {
6126 oldop->op_next = o->op_next;
6129 o->op_seq = PL_op_seqmax++;
6133 if (o->op_next->op_type == OP_RV2SV) {
6134 if (!(o->op_next->op_private & OPpDEREF)) {
6136 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
6137 o->op_next = o->op_next->op_next;
6138 o->op_type = OP_GVSV;
6139 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6142 else if (o->op_next->op_type == OP_RV2AV) {
6143 OP* pop = o->op_next->op_next;
6145 if (pop->op_type == OP_CONST &&
6146 (PL_op = pop->op_next) &&
6147 pop->op_next->op_type == OP_AELEM &&
6148 !(pop->op_next->op_private &
6149 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6150 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6158 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6159 o->op_next = pop->op_next->op_next;
6160 o->op_type = OP_AELEMFAST;
6161 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6162 o->op_private = (U8)i;
6167 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_UNSAFE)) {
6169 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6170 /* XXX could check prototype here instead of just carping */
6171 SV *sv = sv_newmortal();
6172 gv_efullname3(sv, gv, Nullch);
6173 Perl_warner(aTHX_ WARN_UNSAFE,
6174 "%s() called too early to check prototype",
6179 o->op_seq = PL_op_seqmax++;
6190 o->op_seq = PL_op_seqmax++;
6191 while (cLOGOP->op_other->op_type == OP_NULL)
6192 cLOGOP->op_other = cLOGOP->op_other->op_next;
6193 peep(cLOGOP->op_other);
6197 o->op_seq = PL_op_seqmax++;
6198 peep(cLOOP->op_redoop);
6199 peep(cLOOP->op_nextop);
6200 peep(cLOOP->op_lastop);
6206 o->op_seq = PL_op_seqmax++;
6207 peep(cPMOP->op_pmreplstart);
6211 o->op_seq = PL_op_seqmax++;
6212 if (ckWARN(WARN_SYNTAX) && o->op_next
6213 && o->op_next->op_type == OP_NEXTSTATE) {
6214 if (o->op_next->op_sibling &&
6215 o->op_next->op_sibling->op_type != OP_EXIT &&
6216 o->op_next->op_sibling->op_type != OP_WARN &&
6217 o->op_next->op_sibling->op_type != OP_DIE) {
6218 line_t oldline = PL_curcop->cop_line;
6220 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
6221 Perl_warner(aTHX_ WARN_SYNTAX, "Statement unlikely to be reached");
6222 Perl_warner(aTHX_ WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
6223 PL_curcop->cop_line = oldline;
6237 if ((o->op_private & (OPpLVAL_INTRO))
6238 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6240 rop = (UNOP*)((BINOP*)o)->op_first;
6241 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6243 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6244 if (!SvOBJECT(lexname))
6246 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6247 if (!fields || !GvHV(*fields))
6249 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
6250 key = SvPV(*svp, keylen);
6251 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6253 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6254 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6256 ind = SvIV(*indsvp);
6258 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6259 rop->op_type = OP_RV2AV;
6260 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6261 o->op_type = OP_AELEM;
6262 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6264 *svp = newSViv(ind);
6270 if (!(o->op_flags & OPf_WANT)
6271 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6275 o->op_seq = PL_op_seqmax++;
6279 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6280 o->op_seq = PL_op_seqmax++;
6286 if (last_composite) {
6287 OP *r = last_composite;
6289 while (r->op_sibling)
6292 || (r->op_next->op_type == OP_LIST
6293 && r->op_next->op_next == o))
6295 if (last_composite->op_type == OP_RV2AV)
6296 yyerror("Lvalue subs returning arrays not implemented yet");
6298 yyerror("Lvalue subs returning hashes not implemented yet");
6305 o->op_seq = PL_op_seqmax++;