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)) && !IS_PADGV(sv))
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)))
723 pad_swipe(cPADOPo->op_padix);
724 /* No GvIN_PAD_off(gv) here, because other references may still
725 * exist on the pad */
728 cPADOPo->op_padix = 0;
730 SvREFCNT_dec(cGVOPo);
731 cSVOPo->op_sv = Nullsv;
735 SvREFCNT_dec(cSVOPo->op_sv);
736 cSVOPo->op_sv = Nullsv;
742 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
746 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
747 SvREFCNT_dec(cSVOPo->op_sv);
748 cSVOPo->op_sv = Nullsv;
751 Safefree(cPVOPo->op_pv);
752 cPVOPo->op_pv = Nullch;
756 op_free(cPMOPo->op_pmreplroot);
757 cPMOPo->op_pmreplroot = Nullop;
762 ReREFCNT_dec(cPMOPo->op_pmregexp);
763 cPMOPo->op_pmregexp = (REGEXP*)NULL;
767 if (o->op_targ > 0) {
768 pad_free(o->op_targ);
774 S_cop_free(pTHX_ COP* cop)
776 Safefree(cop->cop_label);
777 SvREFCNT_dec(CopFILEGV(cop));
778 if (! specialWARN(cop->cop_warnings))
779 SvREFCNT_dec(cop->cop_warnings);
785 if (o->op_type == OP_NULL)
788 o->op_targ = o->op_type;
789 o->op_type = OP_NULL;
790 o->op_ppaddr = PL_ppaddr[OP_NULL];
793 /* Contextualizers */
795 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
798 Perl_linklist(pTHX_ OP *o)
805 /* establish postfix order */
806 if (cUNOPo->op_first) {
807 o->op_next = LINKLIST(cUNOPo->op_first);
808 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
810 kid->op_next = LINKLIST(kid->op_sibling);
822 Perl_scalarkids(pTHX_ OP *o)
825 if (o && o->op_flags & OPf_KIDS) {
826 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
833 S_scalarboolean(pTHX_ OP *o)
835 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
837 if (ckWARN(WARN_SYNTAX)) {
838 line_t oldline = PL_curcop->cop_line;
840 if (PL_copline != NOLINE)
841 PL_curcop->cop_line = PL_copline;
842 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
843 PL_curcop->cop_line = oldline;
850 Perl_scalar(pTHX_ OP *o)
854 /* assumes no premature commitment */
855 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
856 || o->op_type == OP_RETURN)
861 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
863 switch (o->op_type) {
865 if (o->op_private & OPpREPEAT_DOLIST)
866 null(((LISTOP*)cBINOPo->op_first)->op_first);
867 scalar(cBINOPo->op_first);
872 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
876 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
877 if (!kPMOP->op_pmreplroot)
878 deprecate("implicit split to @_");
886 if (o->op_flags & OPf_KIDS) {
887 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
893 kid = cLISTOPo->op_first;
895 while (kid = kid->op_sibling) {
901 WITH_THR(PL_curcop = &PL_compiling);
906 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
912 WITH_THR(PL_curcop = &PL_compiling);
919 Perl_scalarvoid(pTHX_ OP *o)
926 if (o->op_type == OP_NEXTSTATE
927 || o->op_type == OP_SETSTATE
928 || o->op_type == OP_DBSTATE
929 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
930 || o->op_targ == OP_SETSTATE
931 || o->op_targ == OP_DBSTATE)))
934 PL_curcop = (COP*)o; /* for warning below */
937 /* assumes no premature commitment */
938 want = o->op_flags & OPf_WANT;
939 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
940 || o->op_type == OP_RETURN)
945 if ((o->op_private & OPpTARGET_MY)
946 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
948 return scalar(o); /* As if inside SASSIGN */
951 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
953 switch (o->op_type) {
955 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
959 if (o->op_flags & OPf_STACKED)
963 if (o->op_private == 4)
1005 case OP_GETSOCKNAME:
1006 case OP_GETPEERNAME:
1011 case OP_GETPRIORITY:
1034 if (!(o->op_private & OPpLVAL_INTRO))
1035 useless = PL_op_desc[o->op_type];
1042 if (!(o->op_private & OPpLVAL_INTRO) &&
1043 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1044 useless = "a variable";
1049 if (cSVOPo->op_private & OPpCONST_STRICT)
1050 no_bareword_allowed(o);
1053 if (ckWARN(WARN_VOID)) {
1054 useless = "a constant";
1055 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1057 else if (SvPOK(sv)) {
1058 if (strnEQ(SvPVX(sv), "di", 2) ||
1059 strnEQ(SvPVX(sv), "ds", 2) ||
1060 strnEQ(SvPVX(sv), "ig", 2))
1065 null(o); /* don't execute or even remember it */
1069 o->op_type = OP_PREINC; /* pre-increment is faster */
1070 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1074 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1075 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1081 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1086 if (o->op_flags & OPf_STACKED)
1094 if (!(o->op_flags & OPf_KIDS))
1103 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1110 /* all requires must return a boolean value */
1111 o->op_flags &= ~OPf_WANT;
1114 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1115 if (!kPMOP->op_pmreplroot)
1116 deprecate("implicit split to @_");
1122 if (ckWARN(WARN_VOID))
1123 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1129 Perl_listkids(pTHX_ OP *o)
1132 if (o && o->op_flags & OPf_KIDS) {
1133 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1140 Perl_list(pTHX_ OP *o)
1144 /* assumes no premature commitment */
1145 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1146 || o->op_type == OP_RETURN)
1151 if ((o->op_private & OPpTARGET_MY)
1152 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1154 return o; /* As if inside SASSIGN */
1157 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1159 switch (o->op_type) {
1162 list(cBINOPo->op_first);
1167 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1175 if (!(o->op_flags & OPf_KIDS))
1177 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1178 list(cBINOPo->op_first);
1179 return gen_constant_list(o);
1186 kid = cLISTOPo->op_first;
1188 while (kid = kid->op_sibling) {
1189 if (kid->op_sibling)
1194 WITH_THR(PL_curcop = &PL_compiling);
1198 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1199 if (kid->op_sibling)
1204 WITH_THR(PL_curcop = &PL_compiling);
1207 /* all requires must return a boolean value */
1208 o->op_flags &= ~OPf_WANT;
1215 Perl_scalarseq(pTHX_ OP *o)
1220 if (o->op_type == OP_LINESEQ ||
1221 o->op_type == OP_SCOPE ||
1222 o->op_type == OP_LEAVE ||
1223 o->op_type == OP_LEAVETRY)
1226 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1227 if (kid->op_sibling) {
1231 PL_curcop = &PL_compiling;
1233 o->op_flags &= ~OPf_PARENS;
1234 if (PL_hints & HINT_BLOCK_SCOPE)
1235 o->op_flags |= OPf_PARENS;
1238 o = newOP(OP_STUB, 0);
1243 S_modkids(pTHX_ OP *o, I32 type)
1246 if (o && o->op_flags & OPf_KIDS) {
1247 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1254 Perl_mod(pTHX_ OP *o, I32 type)
1261 if (!o || PL_error_count)
1264 if ((o->op_private & OPpTARGET_MY)
1265 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1270 switch (o->op_type) {
1275 if (!(o->op_private & (OPpCONST_ARYBASE)))
1277 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1278 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1282 SAVEI32(PL_compiling.cop_arybase);
1283 PL_compiling.cop_arybase = 0;
1285 else if (type == OP_REFGEN)
1288 Perl_croak(aTHX_ "That use of $[ is unsupported");
1291 if (o->op_flags & OPf_PARENS)
1295 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1296 !(o->op_flags & OPf_STACKED)) {
1297 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1298 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1299 assert(cUNOPo->op_first->op_type == OP_NULL);
1300 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1303 else { /* lvalue subroutine call */
1304 o->op_private |= OPpLVAL_INTRO;
1305 if (type == OP_GREPSTART || type == OP_ENTERSUB) {
1306 /* Backward compatibility mode: */
1307 o->op_private |= OPpENTERSUB_INARGS;
1310 else { /* Compile-time error message: */
1311 OP *kid = cUNOPo->op_first;
1315 if (kid->op_type == OP_PUSHMARK)
1317 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1319 "panic: unexpected lvalue entersub "
1320 "args: type/targ %ld:%ld",
1321 (long)kid->op_type,kid->op_targ);
1322 kid = kLISTOP->op_first;
1324 while (kid->op_sibling)
1325 kid = kid->op_sibling;
1326 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1328 if (kid->op_type == OP_METHOD_NAMED
1329 || kid->op_type == OP_METHOD)
1333 if (kid->op_sibling || kid->op_next != kid) {
1334 yyerror("panic: unexpected optree near method call");
1338 NewOp(1101, newop, 1, OP);
1339 newop->op_type = OP_RV2CV;
1340 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1341 newop->op_next = newop;
1342 kid->op_sibling = newop;
1343 newop->op_private |= OPpLVAL_INTRO;
1347 if (kid->op_type != OP_RV2CV)
1349 "panic: unexpected lvalue entersub "
1350 "entry via type/targ %ld:%ld",
1351 (long)kid->op_type,kid->op_targ);
1352 kid->op_private |= OPpLVAL_INTRO;
1353 break; /* Postpone until runtime */
1357 kid = kUNOP->op_first;
1358 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1359 kid = kUNOP->op_first;
1360 if (kid->op_type == OP_NULL)
1362 "Unexpected constant lvalue entersub "
1363 "entry via type/targ %ld:%ld",
1364 (long)kid->op_type,kid->op_targ);
1365 if (kid->op_type != OP_GV) {
1366 /* Restore RV2CV to check lvalueness */
1368 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1369 okid->op_next = kid->op_next;
1370 kid->op_next = okid;
1373 okid->op_next = Nullop;
1374 okid->op_type = OP_RV2CV;
1376 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1377 okid->op_private |= OPpLVAL_INTRO;
1391 /* grep, foreach, subcalls, refgen */
1392 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1394 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1395 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1397 : (o->op_type == OP_ENTERSUB
1398 ? "non-lvalue subroutine call"
1399 : PL_op_desc[o->op_type])),
1400 type ? PL_op_desc[type] : "local"));
1414 case OP_RIGHT_SHIFT:
1423 if (!(o->op_flags & OPf_STACKED))
1429 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1435 if (!type && cUNOPo->op_first->op_type != OP_GV)
1436 Perl_croak(aTHX_ "Can't localize through a reference");
1437 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1438 PL_modcount = 10000;
1439 return o; /* Treat \(@foo) like ordinary list. */
1443 if (scalar_mod_type(o, type))
1445 ref(cUNOPo->op_first, o->op_type);
1454 PL_modcount = 10000;
1457 if (!type && cUNOPo->op_first->op_type != OP_GV)
1458 Perl_croak(aTHX_ "Can't localize through a reference");
1459 ref(cUNOPo->op_first, o->op_type);
1463 PL_hints |= HINT_BLOCK_SCOPE;
1473 PL_modcount = 10000;
1474 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1475 return o; /* Treat \(@foo) like ordinary list. */
1476 if (scalar_mod_type(o, type))
1482 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1483 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1488 PL_modcount++; /* XXX ??? */
1490 #endif /* USE_THREADS */
1496 if (type != OP_SASSIGN)
1500 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1506 pad_free(o->op_targ);
1507 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1508 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1509 if (o->op_flags & OPf_KIDS)
1510 mod(cBINOPo->op_first->op_sibling, type);
1515 ref(cBINOPo->op_first, o->op_type);
1516 if (type == OP_ENTERSUB &&
1517 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1518 o->op_private |= OPpLVAL_DEFER;
1525 if (o->op_flags & OPf_KIDS)
1526 mod(cLISTOPo->op_last, type);
1530 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1532 else if (!(o->op_flags & OPf_KIDS))
1534 if (o->op_targ != OP_LIST) {
1535 mod(cBINOPo->op_first, type);
1540 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1544 o->op_flags |= OPf_MOD;
1546 if (type == OP_AASSIGN || type == OP_SASSIGN)
1547 o->op_flags |= OPf_SPECIAL|OPf_REF;
1549 o->op_private |= OPpLVAL_INTRO;
1550 o->op_flags &= ~OPf_SPECIAL;
1551 PL_hints |= HINT_BLOCK_SCOPE;
1553 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1554 o->op_flags |= OPf_REF;
1559 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1563 if (o->op_type == OP_RV2GV)
1587 case OP_RIGHT_SHIFT:
1606 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1608 switch (o->op_type) {
1616 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1629 Perl_refkids(pTHX_ OP *o, I32 type)
1632 if (o && o->op_flags & OPf_KIDS) {
1633 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1640 Perl_ref(pTHX_ OP *o, I32 type)
1644 if (!o || PL_error_count)
1647 switch (o->op_type) {
1649 if ((type == OP_DEFINED || type == OP_LOCK) &&
1650 !(o->op_flags & OPf_STACKED)) {
1651 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1652 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1653 assert(cUNOPo->op_first->op_type == OP_NULL);
1654 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1655 o->op_flags |= OPf_SPECIAL;
1660 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1664 if (type == OP_DEFINED)
1665 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1666 ref(cUNOPo->op_first, o->op_type);
1669 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1670 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1671 : type == OP_RV2HV ? OPpDEREF_HV
1673 o->op_flags |= OPf_MOD;
1678 o->op_flags |= OPf_MOD; /* XXX ??? */
1683 o->op_flags |= OPf_REF;
1686 if (type == OP_DEFINED)
1687 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1688 ref(cUNOPo->op_first, o->op_type);
1693 o->op_flags |= OPf_REF;
1698 if (!(o->op_flags & OPf_KIDS))
1700 ref(cBINOPo->op_first, type);
1704 ref(cBINOPo->op_first, o->op_type);
1705 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1706 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1707 : type == OP_RV2HV ? OPpDEREF_HV
1709 o->op_flags |= OPf_MOD;
1717 if (!(o->op_flags & OPf_KIDS))
1719 ref(cLISTOPo->op_last, type);
1729 S_dup_attrlist(pTHX_ OP *o)
1733 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1734 * where the first kid is OP_PUSHMARK and the remaining ones
1735 * are OP_CONST. We need to push the OP_CONST values.
1737 if (o->op_type == OP_CONST)
1738 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1740 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1741 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1742 if (o->op_type == OP_CONST)
1743 rop = append_elem(OP_LIST, rop,
1744 newSVOP(OP_CONST, o->op_flags,
1745 SvREFCNT_inc(cSVOPo->op_sv)));
1752 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1754 OP *modname; /* for 'use' */
1757 /* fake up C<use attributes $pkg,$rv,@attrs> */
1758 ENTER; /* need to protect against side-effects of 'use' */
1760 if (stash && HvNAME(stash))
1761 stashsv = newSVpv(HvNAME(stash), 0);
1763 stashsv = &PL_sv_no;
1764 #define ATTRSMODULE "attributes"
1765 modname = newSVOP(OP_CONST, 0,
1766 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1));
1767 modname->op_private |= OPpCONST_BARE;
1768 /* that flag is required to make 'use' work right */
1769 utilize(1, start_subparse(FALSE, 0),
1770 Nullop, /* version */
1772 prepend_elem(OP_LIST,
1773 newSVOP(OP_CONST, 0, stashsv),
1774 prepend_elem(OP_LIST,
1775 newSVOP(OP_CONST, 0, newRV(target)),
1776 dup_attrlist(attrs))));
1781 S_my_kid(pTHX_ OP *o, OP *attrs)
1786 if (!o || PL_error_count)
1790 if (type == OP_LIST) {
1791 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1793 } else if (type == OP_UNDEF) {
1795 } else if (type == OP_RV2SV || /* "our" declaration */
1797 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1799 } else if (type != OP_PADSV &&
1802 type != OP_PUSHMARK)
1804 yyerror(Perl_form(aTHX_ "Can't declare %s in my", PL_op_desc[o->op_type]));
1807 else if (attrs && type != OP_PUSHMARK) {
1812 /* check for C<my Dog $spot> when deciding package */
1813 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1814 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1815 stash = SvSTASH(*namesvp);
1817 stash = PL_curstash;
1818 padsv = PAD_SV(o->op_targ);
1819 apply_attrs(stash, padsv, attrs);
1821 o->op_flags |= OPf_MOD;
1822 o->op_private |= OPpLVAL_INTRO;
1827 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1829 if (o->op_flags & OPf_PARENS)
1832 PL_in_my_stash = Nullhv;
1835 return my_kid(o, attrs);
1839 Perl_my(pTHX_ OP *o)
1841 return my_kid(o, Nullop);
1845 Perl_sawparens(pTHX_ OP *o)
1848 o->op_flags |= OPf_PARENS;
1853 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1858 if (ckWARN(WARN_UNSAFE) &&
1859 (left->op_type == OP_RV2AV ||
1860 left->op_type == OP_RV2HV ||
1861 left->op_type == OP_PADAV ||
1862 left->op_type == OP_PADHV)) {
1863 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1864 right->op_type == OP_TRANS)
1865 ? right->op_type : OP_MATCH];
1866 const char *sample = ((left->op_type == OP_RV2AV ||
1867 left->op_type == OP_PADAV)
1868 ? "@array" : "%hash");
1869 Perl_warner(aTHX_ WARN_UNSAFE,
1870 "Applying %s to %s will act on scalar(%s)",
1871 desc, sample, sample);
1874 if (right->op_type == OP_MATCH ||
1875 right->op_type == OP_SUBST ||
1876 right->op_type == OP_TRANS) {
1877 right->op_flags |= OPf_STACKED;
1878 if (right->op_type != OP_MATCH)
1879 left = mod(left, right->op_type);
1880 if (right->op_type == OP_TRANS)
1881 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1883 o = prepend_elem(right->op_type, scalar(left), right);
1885 return newUNOP(OP_NOT, 0, scalar(o));
1889 return bind_match(type, left,
1890 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1894 Perl_invert(pTHX_ OP *o)
1898 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1899 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1903 Perl_scope(pTHX_ OP *o)
1906 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1907 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1908 o->op_type = OP_LEAVE;
1909 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1912 if (o->op_type == OP_LINESEQ) {
1914 o->op_type = OP_SCOPE;
1915 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1916 kid = ((LISTOP*)o)->op_first;
1917 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
1921 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1928 Perl_save_hints(pTHX)
1931 SAVESPTR(GvHV(PL_hintgv));
1932 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1933 SAVEFREESV(GvHV(PL_hintgv));
1937 Perl_block_start(pTHX_ int full)
1940 int retval = PL_savestack_ix;
1942 SAVEI32(PL_comppad_name_floor);
1944 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1945 PL_comppad_name_floor = PL_comppad_name_fill;
1947 PL_comppad_name_floor = 0;
1949 SAVEI32(PL_min_intro_pending);
1950 SAVEI32(PL_max_intro_pending);
1951 PL_min_intro_pending = 0;
1952 SAVEI32(PL_comppad_name_fill);
1953 SAVEI32(PL_padix_floor);
1954 PL_padix_floor = PL_padix;
1955 PL_pad_reset_pending = FALSE;
1957 PL_hints &= ~HINT_BLOCK_SCOPE;
1958 SAVEPPTR(PL_compiling.cop_warnings);
1959 if (! specialWARN(PL_compiling.cop_warnings)) {
1960 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1961 SAVEFREESV(PL_compiling.cop_warnings) ;
1969 Perl_block_end(pTHX_ I32 floor, OP *seq)
1972 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1973 OP* retval = scalarseq(seq);
1975 PL_pad_reset_pending = FALSE;
1976 PL_compiling.op_private = PL_hints;
1978 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1979 pad_leavemy(PL_comppad_name_fill);
1988 OP *o = newOP(OP_THREADSV, 0);
1989 o->op_targ = find_threadsv("_");
1992 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1993 #endif /* USE_THREADS */
1997 Perl_newPROG(pTHX_ OP *o)
2003 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2004 ((PL_in_eval & EVAL_KEEPERR)
2005 ? OPf_SPECIAL : 0), o);
2006 PL_eval_start = linklist(PL_eval_root);
2007 PL_eval_root->op_private |= OPpREFCOUNTED;
2008 OpREFCNT_set(PL_eval_root, 1);
2009 PL_eval_root->op_next = 0;
2010 peep(PL_eval_start);
2015 PL_main_root = scope(sawparens(scalarvoid(o)));
2016 PL_curcop = &PL_compiling;
2017 PL_main_start = LINKLIST(PL_main_root);
2018 PL_main_root->op_private |= OPpREFCOUNTED;
2019 OpREFCNT_set(PL_main_root, 1);
2020 PL_main_root->op_next = 0;
2021 peep(PL_main_start);
2024 /* Register with debugger */
2026 CV *cv = get_cv("DB::postponed", FALSE);
2030 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2032 call_sv((SV*)cv, G_DISCARD);
2039 Perl_localize(pTHX_ OP *o, I32 lex)
2041 if (o->op_flags & OPf_PARENS)
2045 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2047 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2048 if (*s == ';' || *s == '=')
2049 Perl_warner(aTHX_ WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
2050 lex ? "my" : "local");
2054 PL_in_my_stash = Nullhv;
2058 return mod(o, OP_NULL); /* a bit kludgey */
2062 Perl_jmaybe(pTHX_ OP *o)
2064 if (o->op_type == OP_LIST) {
2067 o2 = newOP(OP_THREADSV, 0);
2068 o2->op_targ = find_threadsv(";");
2070 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2071 #endif /* USE_THREADS */
2072 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2078 Perl_fold_constants(pTHX_ register OP *o)
2082 I32 type = o->op_type;
2085 if (PL_opargs[type] & OA_RETSCALAR)
2087 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2088 o->op_targ = pad_alloc(type, SVs_PADTMP);
2090 /* integerize op, unless it happens to be C<-foo>.
2091 * XXX should pp_i_negate() do magic string negation instead? */
2092 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2093 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2094 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2096 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2099 if (!(PL_opargs[type] & OA_FOLDCONST))
2104 /* XXX might want a ck_negate() for this */
2105 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2118 if (o->op_private & OPpLOCALE)
2123 goto nope; /* Don't try to run w/ errors */
2125 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2126 if ((curop->op_type != OP_CONST ||
2127 (curop->op_private & OPpCONST_BARE)) &&
2128 curop->op_type != OP_LIST &&
2129 curop->op_type != OP_SCALAR &&
2130 curop->op_type != OP_NULL &&
2131 curop->op_type != OP_PUSHMARK)
2137 curop = LINKLIST(o);
2141 sv = *(PL_stack_sp--);
2142 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2143 pad_swipe(o->op_targ);
2144 else if (SvTEMP(sv)) { /* grab mortal temp? */
2145 (void)SvREFCNT_inc(sv);
2149 if (type == OP_RV2GV)
2150 return newGVOP(OP_GV, 0, (GV*)sv);
2152 /* try to smush double to int, but don't smush -2.0 to -2 */
2153 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2157 if ((NV)iv == SvNV(sv)) {
2162 SvIOK_off(sv); /* undo SvIV() damage */
2164 return newSVOP(OP_CONST, 0, sv);
2168 if (!(PL_opargs[type] & OA_OTHERINT))
2171 if (!(PL_hints & HINT_INTEGER)) {
2172 if (type == OP_MODULO
2173 || type == OP_DIVIDE
2174 || !(o->op_flags & OPf_KIDS))
2179 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2180 if (curop->op_type == OP_CONST) {
2181 if (SvIOK(((SVOP*)curop)->op_sv))
2185 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2189 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2196 Perl_gen_constant_list(pTHX_ register OP *o)
2200 I32 oldtmps_floor = PL_tmps_floor;
2204 return o; /* Don't attempt to run with errors */
2206 PL_op = curop = LINKLIST(o);
2212 PL_tmps_floor = oldtmps_floor;
2214 o->op_type = OP_RV2AV;
2215 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2216 curop = ((UNOP*)o)->op_first;
2217 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2224 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2229 if (!o || o->op_type != OP_LIST)
2230 o = newLISTOP(OP_LIST, 0, o, Nullop);
2232 o->op_flags &= ~OPf_WANT;
2234 if (!(PL_opargs[type] & OA_MARK))
2235 null(cLISTOPo->op_first);
2238 o->op_ppaddr = PL_ppaddr[type];
2239 o->op_flags |= flags;
2241 o = CHECKOP(type, o);
2242 if (o->op_type != type)
2245 if (cLISTOPo->op_children < 7) {
2246 /* XXX do we really need to do this if we're done appending?? */
2247 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2249 cLISTOPo->op_last = last; /* in case check substituted last arg */
2252 return fold_constants(o);
2255 /* List constructors */
2258 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2266 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
2267 return newLISTOP(type, 0, first, last);
2269 if (first->op_flags & OPf_KIDS)
2270 ((LISTOP*)first)->op_last->op_sibling = last;
2272 first->op_flags |= OPf_KIDS;
2273 ((LISTOP*)first)->op_first = last;
2275 ((LISTOP*)first)->op_last = last;
2276 ((LISTOP*)first)->op_children++;
2281 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2289 if (first->op_type != type)
2290 return prepend_elem(type, (OP*)first, (OP*)last);
2292 if (last->op_type != type)
2293 return append_elem(type, (OP*)first, (OP*)last);
2295 first->op_last->op_sibling = last->op_first;
2296 first->op_last = last->op_last;
2297 first->op_children += last->op_children;
2298 if (first->op_children)
2299 first->op_flags |= OPf_KIDS;
2301 #ifdef PL_OP_SLAB_ALLOC
2309 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2317 if (last->op_type == type) {
2318 if (type == OP_LIST) { /* already a PUSHMARK there */
2319 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2320 ((LISTOP*)last)->op_first->op_sibling = first;
2323 if (!(last->op_flags & OPf_KIDS)) {
2324 ((LISTOP*)last)->op_last = first;
2325 last->op_flags |= OPf_KIDS;
2327 first->op_sibling = ((LISTOP*)last)->op_first;
2328 ((LISTOP*)last)->op_first = first;
2330 ((LISTOP*)last)->op_children++;
2334 return newLISTOP(type, 0, first, last);
2340 Perl_newNULLLIST(pTHX)
2342 return newOP(OP_STUB, 0);
2346 Perl_force_list(pTHX_ OP *o)
2348 if (!o || o->op_type != OP_LIST)
2349 o = newLISTOP(OP_LIST, 0, o, Nullop);
2355 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2359 NewOp(1101, listop, 1, LISTOP);
2361 listop->op_type = type;
2362 listop->op_ppaddr = PL_ppaddr[type];
2363 listop->op_children = (first != 0) + (last != 0);
2364 listop->op_flags = flags;
2368 else if (!first && last)
2371 first->op_sibling = last;
2372 listop->op_first = first;
2373 listop->op_last = last;
2374 if (type == OP_LIST) {
2376 pushop = newOP(OP_PUSHMARK, 0);
2377 pushop->op_sibling = first;
2378 listop->op_first = pushop;
2379 listop->op_flags |= OPf_KIDS;
2381 listop->op_last = pushop;
2383 else if (listop->op_children)
2384 listop->op_flags |= OPf_KIDS;
2390 Perl_newOP(pTHX_ I32 type, I32 flags)
2393 NewOp(1101, o, 1, OP);
2395 o->op_ppaddr = PL_ppaddr[type];
2396 o->op_flags = flags;
2399 o->op_private = 0 + (flags >> 8);
2400 if (PL_opargs[type] & OA_RETSCALAR)
2402 if (PL_opargs[type] & OA_TARGET)
2403 o->op_targ = pad_alloc(type, SVs_PADTMP);
2404 return CHECKOP(type, o);
2408 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2413 first = newOP(OP_STUB, 0);
2414 if (PL_opargs[type] & OA_MARK)
2415 first = force_list(first);
2417 NewOp(1101, unop, 1, UNOP);
2418 unop->op_type = type;
2419 unop->op_ppaddr = PL_ppaddr[type];
2420 unop->op_first = first;
2421 unop->op_flags = flags | OPf_KIDS;
2422 unop->op_private = 1 | (flags >> 8);
2423 unop = (UNOP*) CHECKOP(type, unop);
2427 return fold_constants((OP *) unop);
2431 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2434 NewOp(1101, binop, 1, BINOP);
2437 first = newOP(OP_NULL, 0);
2439 binop->op_type = type;
2440 binop->op_ppaddr = PL_ppaddr[type];
2441 binop->op_first = first;
2442 binop->op_flags = flags | OPf_KIDS;
2445 binop->op_private = 1 | (flags >> 8);
2448 binop->op_private = 2 | (flags >> 8);
2449 first->op_sibling = last;
2452 binop = (BINOP*)CHECKOP(type, binop);
2453 if (binop->op_next || binop->op_type != type)
2456 binop->op_last = binop->op_first->op_sibling;
2458 return fold_constants((OP *)binop);
2462 utf8compare(const void *a, const void *b)
2465 for (i = 0; i < 10; i++) {
2466 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2468 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2475 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2477 SV *tstr = ((SVOP*)expr)->op_sv;
2478 SV *rstr = ((SVOP*)repl)->op_sv;
2481 register U8 *t = (U8*)SvPV(tstr, tlen);
2482 register U8 *r = (U8*)SvPV(rstr, rlen);
2488 register short *tbl;
2490 complement = o->op_private & OPpTRANS_COMPLEMENT;
2491 del = o->op_private & OPpTRANS_DELETE;
2492 squash = o->op_private & OPpTRANS_SQUASH;
2494 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2495 SV* listsv = newSVpvn("# comment\n",10);
2497 U8* tend = t + tlen;
2498 U8* rend = r + rlen;
2514 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2515 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2521 New(1109, cp, tlen, U8*);
2523 transv = newSVpvn("",0);
2532 qsort(cp, i, sizeof(U8*), utf8compare);
2533 for (j = 0; j < i; j++) {
2535 UV val = utf8_to_uv(s, &ulen);
2537 diff = val - nextmin;
2539 t = uv_to_utf8(tmpbuf,nextmin);
2540 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2542 t = uv_to_utf8(tmpbuf, val - 1);
2543 sv_catpvn(transv, "\377", 1);
2544 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2548 val = utf8_to_uv(s+1, &ulen);
2552 t = uv_to_utf8(tmpbuf,nextmin);
2553 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2554 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2555 sv_catpvn(transv, "\377", 1);
2556 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2557 t = (U8*)SvPVX(transv);
2558 tlen = SvCUR(transv);
2561 else if (!rlen && !del) {
2562 r = t; rlen = tlen; rend = tend;
2565 if (to_utf && from_utf) { /* only counting characters */
2566 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2567 o->op_private |= OPpTRANS_IDENTICAL;
2569 else { /* straight latin-1 translation */
2570 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2571 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2572 o->op_private |= OPpTRANS_IDENTICAL;
2576 while (t < tend || tfirst <= tlast) {
2577 /* see if we need more "t" chars */
2578 if (tfirst > tlast) {
2579 tfirst = (I32)utf8_to_uv(t, &ulen);
2581 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2582 tlast = (I32)utf8_to_uv(++t, &ulen);
2589 /* now see if we need more "r" chars */
2590 if (rfirst > rlast) {
2592 rfirst = (I32)utf8_to_uv(r, &ulen);
2594 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2595 rlast = (I32)utf8_to_uv(++r, &ulen);
2604 rfirst = rlast = 0xffffffff;
2608 /* now see which range will peter our first, if either. */
2609 tdiff = tlast - tfirst;
2610 rdiff = rlast - rfirst;
2617 if (rfirst == 0xffffffff) {
2618 diff = tdiff; /* oops, pretend rdiff is infinite */
2620 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2622 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\tXXXX\n", tfirst);
2626 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2628 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2630 if (rfirst + diff > max)
2631 max = rfirst + diff;
2636 else if (rfirst <= 0x800)
2637 grows |= (tfirst < 0x80);
2638 else if (rfirst <= 0x10000)
2639 grows |= (tfirst < 0x800);
2640 else if (rfirst <= 0x200000)
2641 grows |= (tfirst < 0x10000);
2642 else if (rfirst <= 0x4000000)
2643 grows |= (tfirst < 0x200000);
2644 else if (rfirst <= 0x80000000)
2645 grows |= (tfirst < 0x4000000);
2657 else if (max > 0xff)
2662 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2663 SvREFCNT_dec(listsv);
2665 SvREFCNT_dec(transv);
2667 if (!del && havefinal)
2668 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2670 if (grows && to_utf)
2671 o->op_private |= OPpTRANS_GROWS;
2678 tbl = (short*)cPVOPo->op_pv;
2680 Zero(tbl, 256, short);
2681 for (i = 0; i < tlen; i++)
2683 for (i = 0, j = 0; i < 256; i++) {
2699 if (!rlen && !del) {
2702 o->op_private |= OPpTRANS_IDENTICAL;
2704 for (i = 0; i < 256; i++)
2706 for (i = 0, j = 0; i < tlen; i++,j++) {
2709 if (tbl[t[i]] == -1)
2715 if (tbl[t[i]] == -1)
2726 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2731 NewOp(1101, pmop, 1, PMOP);
2732 pmop->op_type = type;
2733 pmop->op_ppaddr = PL_ppaddr[type];
2734 pmop->op_flags = flags;
2735 pmop->op_private = 0 | (flags >> 8);
2737 if (PL_hints & HINT_RE_TAINT)
2738 pmop->op_pmpermflags |= PMf_RETAINT;
2739 if (PL_hints & HINT_LOCALE)
2740 pmop->op_pmpermflags |= PMf_LOCALE;
2741 pmop->op_pmflags = pmop->op_pmpermflags;
2743 /* link into pm list */
2744 if (type != OP_TRANS && PL_curstash) {
2745 pmop->op_pmnext = HvPMROOT(PL_curstash);
2746 HvPMROOT(PL_curstash) = pmop;
2753 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2758 I32 repl_has_vars = 0;
2760 if (o->op_type == OP_TRANS)
2761 return pmtrans(o, expr, repl);
2763 PL_hints |= HINT_BLOCK_SCOPE;
2766 if (expr->op_type == OP_CONST) {
2768 SV *pat = ((SVOP*)expr)->op_sv;
2769 char *p = SvPV(pat, plen);
2770 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2771 sv_setpvn(pat, "\\s+", 3);
2772 p = SvPV(pat, plen);
2773 pm->op_pmflags |= PMf_SKIPWHITE;
2775 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2776 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2777 pm->op_pmflags |= PMf_WHITE;
2781 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2782 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2784 : OP_REGCMAYBE),0,expr);
2786 NewOp(1101, rcop, 1, LOGOP);
2787 rcop->op_type = OP_REGCOMP;
2788 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2789 rcop->op_first = scalar(expr);
2790 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2791 ? (OPf_SPECIAL | OPf_KIDS)
2793 rcop->op_private = 1;
2796 /* establish postfix order */
2797 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2799 rcop->op_next = expr;
2800 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2803 rcop->op_next = LINKLIST(expr);
2804 expr->op_next = (OP*)rcop;
2807 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2812 if (pm->op_pmflags & PMf_EVAL) {
2814 if (PL_curcop->cop_line < PL_multi_end)
2815 PL_curcop->cop_line = PL_multi_end;
2818 else if (repl->op_type == OP_THREADSV
2819 && strchr("&`'123456789+",
2820 PL_threadsv_names[repl->op_targ]))
2824 #endif /* USE_THREADS */
2825 else if (repl->op_type == OP_CONST)
2829 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2830 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2832 if (curop->op_type == OP_THREADSV) {
2834 if (strchr("&`'123456789+", curop->op_private))
2838 if (curop->op_type == OP_GV) {
2839 GV *gv = cGVOPx(curop);
2841 if (strchr("&`'123456789+", *GvENAME(gv)))
2844 #endif /* USE_THREADS */
2845 else if (curop->op_type == OP_RV2CV)
2847 else if (curop->op_type == OP_RV2SV ||
2848 curop->op_type == OP_RV2AV ||
2849 curop->op_type == OP_RV2HV ||
2850 curop->op_type == OP_RV2GV) {
2851 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2854 else if (curop->op_type == OP_PADSV ||
2855 curop->op_type == OP_PADAV ||
2856 curop->op_type == OP_PADHV ||
2857 curop->op_type == OP_PADANY) {
2860 else if (curop->op_type == OP_PUSHRE)
2861 ; /* Okay here, dangerous in newASSIGNOP */
2870 && (!pm->op_pmregexp
2871 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2872 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2873 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2874 prepend_elem(o->op_type, scalar(repl), o);
2877 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2878 pm->op_pmflags |= PMf_MAYBE_CONST;
2879 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2881 NewOp(1101, rcop, 1, LOGOP);
2882 rcop->op_type = OP_SUBSTCONT;
2883 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2884 rcop->op_first = scalar(repl);
2885 rcop->op_flags |= OPf_KIDS;
2886 rcop->op_private = 1;
2889 /* establish postfix order */
2890 rcop->op_next = LINKLIST(repl);
2891 repl->op_next = (OP*)rcop;
2893 pm->op_pmreplroot = scalar((OP*)rcop);
2894 pm->op_pmreplstart = LINKLIST(rcop);
2903 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2906 NewOp(1101, svop, 1, SVOP);
2907 svop->op_type = type;
2908 svop->op_ppaddr = PL_ppaddr[type];
2910 svop->op_next = (OP*)svop;
2911 svop->op_flags = flags;
2912 if (PL_opargs[type] & OA_RETSCALAR)
2914 if (PL_opargs[type] & OA_TARGET)
2915 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2916 return CHECKOP(type, svop);
2920 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
2923 NewOp(1101, padop, 1, PADOP);
2924 padop->op_type = type;
2925 padop->op_ppaddr = PL_ppaddr[type];
2926 padop->op_padix = pad_alloc(type, SVs_PADTMP);
2927 PL_curpad[padop->op_padix] = sv;
2928 padop->op_next = (OP*)padop;
2929 padop->op_flags = flags;
2930 if (PL_opargs[type] & OA_RETSCALAR)
2932 if (PL_opargs[type] & OA_TARGET)
2933 padop->op_targ = pad_alloc(type, SVs_PADTMP);
2934 return CHECKOP(type, padop);
2938 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
2943 return newPADOP(type, flags, SvREFCNT_inc(gv));
2945 return newSVOP(type, flags, SvREFCNT_inc(gv));
2950 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
2953 NewOp(1101, pvop, 1, PVOP);
2954 pvop->op_type = type;
2955 pvop->op_ppaddr = PL_ppaddr[type];
2957 pvop->op_next = (OP*)pvop;
2958 pvop->op_flags = flags;
2959 if (PL_opargs[type] & OA_RETSCALAR)
2961 if (PL_opargs[type] & OA_TARGET)
2962 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2963 return CHECKOP(type, pvop);
2967 Perl_package(pTHX_ OP *o)
2972 save_hptr(&PL_curstash);
2973 save_item(PL_curstname);
2978 name = SvPV(sv, len);
2979 PL_curstash = gv_stashpvn(name,len,TRUE);
2980 sv_setpvn(PL_curstname, name, len);
2984 sv_setpv(PL_curstname,"<none>");
2985 PL_curstash = Nullhv;
2987 PL_hints |= HINT_BLOCK_SCOPE;
2988 PL_copline = NOLINE;
2993 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3002 if (id->op_type != OP_CONST)
3003 Perl_croak(aTHX_ "Module name must be constant");
3007 if(version != Nullop) {
3008 SV *vesv = ((SVOP*)version)->op_sv;
3010 if (arg == Nullop && !SvNIOK(vesv)) {
3016 if (version->op_type != OP_CONST || !SvNIOK(vesv))
3017 Perl_croak(aTHX_ "Version number must be constant number");
3019 /* Make copy of id so we don't free it twice */
3020 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3022 /* Fake up a method call to VERSION */
3023 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3024 append_elem(OP_LIST,
3025 prepend_elem(OP_LIST, pack, list(version)),
3026 newSVOP(OP_METHOD_NAMED, 0,
3027 newSVpvn("VERSION", 7))));
3031 /* Fake up an import/unimport */
3032 if (arg && arg->op_type == OP_STUB)
3033 imop = arg; /* no import on explicit () */
3034 else if(SvNIOK(((SVOP*)id)->op_sv)) {
3035 imop = Nullop; /* use 5.0; */
3038 /* Make copy of id so we don't free it twice */
3039 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3040 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3041 append_elem(OP_LIST,
3042 prepend_elem(OP_LIST, pack, list(arg)),
3043 newSVOP(OP_METHOD_NAMED, 0,
3044 aver ? newSVpvn("import", 6)
3045 : newSVpvn("unimport", 8))));
3048 /* Fake up a require, handle override, if any */
3049 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3050 if (!(gv && GvIMPORTED_CV(gv)))
3051 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3053 if (gv && GvIMPORTED_CV(gv)) {
3054 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3055 append_elem(OP_LIST, id,
3056 scalar(newUNOP(OP_RV2CV, 0,
3061 rqop = newUNOP(OP_REQUIRE, 0, id);
3064 /* Fake up the BEGIN {}, which does its thing immediately. */
3066 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3069 append_elem(OP_LINESEQ,
3070 append_elem(OP_LINESEQ,
3071 newSTATEOP(0, Nullch, rqop),
3072 newSTATEOP(0, Nullch, veop)),
3073 newSTATEOP(0, Nullch, imop) ));
3075 PL_hints |= HINT_BLOCK_SCOPE;
3076 PL_copline = NOLINE;
3081 Perl_dofile(pTHX_ OP *term)
3086 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3087 if (!(gv && GvIMPORTED_CV(gv)))
3088 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3090 if (gv && GvIMPORTED_CV(gv)) {
3091 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3092 append_elem(OP_LIST, term,
3093 scalar(newUNOP(OP_RV2CV, 0,
3098 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3104 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3106 return newBINOP(OP_LSLICE, flags,
3107 list(force_list(subscript)),
3108 list(force_list(listval)) );
3112 S_list_assignment(pTHX_ register OP *o)
3117 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3118 o = cUNOPo->op_first;
3120 if (o->op_type == OP_COND_EXPR) {
3121 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3122 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3127 yyerror("Assignment to both a list and a scalar");
3131 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3132 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3133 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3136 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3139 if (o->op_type == OP_RV2SV)
3146 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3151 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3152 return newLOGOP(optype, 0,
3153 mod(scalar(left), optype),
3154 newUNOP(OP_SASSIGN, 0, scalar(right)));
3157 return newBINOP(optype, OPf_STACKED,
3158 mod(scalar(left), optype), scalar(right));
3162 if (list_assignment(left)) {
3165 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3166 left = mod(left, OP_AASSIGN);
3174 o = newBINOP(OP_AASSIGN, flags,
3175 list(force_list(right)),
3176 list(force_list(left)) );
3177 o->op_private = 0 | (flags >> 8);
3178 if (!(left->op_private & OPpLVAL_INTRO)) {
3182 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3183 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3184 if (curop->op_type == OP_GV) {
3185 GV *gv = cGVOPx(curop);
3186 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3188 SvCUR(gv) = PL_generation;
3190 else if (curop->op_type == OP_PADSV ||
3191 curop->op_type == OP_PADAV ||
3192 curop->op_type == OP_PADHV ||
3193 curop->op_type == OP_PADANY) {
3194 SV **svp = AvARRAY(PL_comppad_name);
3195 SV *sv = svp[curop->op_targ];
3196 if (SvCUR(sv) == PL_generation)
3198 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3200 else if (curop->op_type == OP_RV2CV)
3202 else if (curop->op_type == OP_RV2SV ||
3203 curop->op_type == OP_RV2AV ||
3204 curop->op_type == OP_RV2HV ||
3205 curop->op_type == OP_RV2GV) {
3206 if (lastop->op_type != OP_GV) /* funny deref? */
3209 else if (curop->op_type == OP_PUSHRE) {
3210 if (((PMOP*)curop)->op_pmreplroot) {
3211 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3212 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3214 SvCUR(gv) = PL_generation;
3223 o->op_private = OPpASSIGN_COMMON;
3225 if (right && right->op_type == OP_SPLIT) {
3227 if ((tmpop = ((LISTOP*)right)->op_first) &&
3228 tmpop->op_type == OP_PUSHRE)
3230 PMOP *pm = (PMOP*)tmpop;
3231 if (left->op_type == OP_RV2AV &&
3232 !(left->op_private & OPpLVAL_INTRO) &&
3233 !(o->op_private & OPpASSIGN_COMMON) )
3235 tmpop = ((UNOP*)left)->op_first;
3236 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3237 pm->op_pmreplroot = (OP*)cGVOPx(tmpop);
3238 pm->op_pmflags |= PMf_ONCE;
3239 tmpop = cUNOPo->op_first; /* to list (nulled) */
3240 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3241 tmpop->op_sibling = Nullop; /* don't free split */
3242 right->op_next = tmpop->op_next; /* fix starting loc */
3243 op_free(o); /* blow off assign */
3244 right->op_flags &= ~OPf_WANT;
3245 /* "I don't know and I don't care." */
3250 if (PL_modcount < 10000 &&
3251 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3253 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3255 sv_setiv(sv, PL_modcount+1);
3263 right = newOP(OP_UNDEF, 0);
3264 if (right->op_type == OP_READLINE) {
3265 right->op_flags |= OPf_STACKED;
3266 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3269 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3270 o = newBINOP(OP_SASSIGN, flags,
3271 scalar(right), mod(scalar(left), OP_SASSIGN) );
3283 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3286 U32 seq = intro_my();
3289 NewOp(1101, cop, 1, COP);
3290 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
3291 cop->op_type = OP_DBSTATE;
3292 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3295 cop->op_type = OP_NEXTSTATE;
3296 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3298 cop->op_flags = flags;
3299 cop->op_private = (PL_hints & HINT_UTF8);
3301 cop->op_private |= NATIVE_HINTS;
3303 PL_compiling.op_private = cop->op_private;
3304 cop->op_next = (OP*)cop;
3307 cop->cop_label = label;
3308 PL_hints |= HINT_BLOCK_SCOPE;
3311 cop->cop_arybase = PL_curcop->cop_arybase;
3312 if (specialWARN(PL_curcop->cop_warnings))
3313 cop->cop_warnings = PL_curcop->cop_warnings ;
3315 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3318 if (PL_copline == NOLINE)
3319 cop->cop_line = PL_curcop->cop_line;
3321 cop->cop_line = PL_copline;
3322 PL_copline = NOLINE;
3324 CopFILEGV_set(cop, (GV*)SvREFCNT_inc(CopFILEGV(PL_curcop)));
3325 cop->cop_stash = PL_curstash;
3327 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3328 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3329 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3330 (void)SvIOK_on(*svp);
3332 SvSTASH(*svp) = (HV*)cop;
3336 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3339 /* "Introduce" my variables to visible status. */
3347 if (! PL_min_intro_pending)
3348 return PL_cop_seqmax;
3350 svp = AvARRAY(PL_comppad_name);
3351 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3352 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3353 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3354 SvNVX(sv) = (NV)PL_cop_seqmax;
3357 PL_min_intro_pending = 0;
3358 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3359 return PL_cop_seqmax++;
3363 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3365 return new_logop(type, flags, &first, &other);
3369 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3374 OP *first = *firstp;
3375 OP *other = *otherp;
3377 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3378 return newBINOP(type, flags, scalar(first), scalar(other));
3380 scalarboolean(first);
3381 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3382 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3383 if (type == OP_AND || type == OP_OR) {
3389 first = *firstp = cUNOPo->op_first;
3391 first->op_next = o->op_next;
3392 cUNOPo->op_first = Nullop;
3396 if (first->op_type == OP_CONST) {
3397 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3398 Perl_warner(aTHX_ WARN_PRECEDENCE, "Probable precedence problem on %s",
3400 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3411 else if (first->op_type == OP_WANTARRAY) {
3417 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3418 OP *k1 = ((UNOP*)first)->op_first;
3419 OP *k2 = k1->op_sibling;
3421 switch (first->op_type)
3424 if (k2 && k2->op_type == OP_READLINE
3425 && (k2->op_flags & OPf_STACKED)
3426 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3428 warnop = k2->op_type;
3433 if (k1->op_type == OP_READDIR
3434 || k1->op_type == OP_GLOB
3435 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3436 || k1->op_type == OP_EACH)
3438 warnop = ((k1->op_type == OP_NULL)
3439 ? k1->op_targ : k1->op_type);
3444 line_t oldline = PL_curcop->cop_line;
3445 PL_curcop->cop_line = PL_copline;
3446 Perl_warner(aTHX_ WARN_UNSAFE,
3447 "Value of %s%s can be \"0\"; test with defined()",
3449 ((warnop == OP_READLINE || warnop == OP_GLOB)
3450 ? " construct" : "() operator"));
3451 PL_curcop->cop_line = oldline;
3458 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3459 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3461 NewOp(1101, logop, 1, LOGOP);
3463 logop->op_type = type;
3464 logop->op_ppaddr = PL_ppaddr[type];
3465 logop->op_first = first;
3466 logop->op_flags = flags | OPf_KIDS;
3467 logop->op_other = LINKLIST(other);
3468 logop->op_private = 1 | (flags >> 8);
3470 /* establish postfix order */
3471 logop->op_next = LINKLIST(first);
3472 first->op_next = (OP*)logop;
3473 first->op_sibling = other;
3475 o = newUNOP(OP_NULL, 0, (OP*)logop);
3482 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3490 return newLOGOP(OP_AND, 0, first, trueop);
3492 return newLOGOP(OP_OR, 0, first, falseop);
3494 scalarboolean(first);
3495 if (first->op_type == OP_CONST) {
3496 if (SvTRUE(((SVOP*)first)->op_sv)) {
3507 else if (first->op_type == OP_WANTARRAY) {
3511 NewOp(1101, logop, 1, LOGOP);
3512 logop->op_type = OP_COND_EXPR;
3513 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3514 logop->op_first = first;
3515 logop->op_flags = flags | OPf_KIDS;
3516 logop->op_private = 1 | (flags >> 8);
3517 logop->op_other = LINKLIST(trueop);
3518 logop->op_next = LINKLIST(falseop);
3521 /* establish postfix order */
3522 start = LINKLIST(first);
3523 first->op_next = (OP*)logop;
3525 first->op_sibling = trueop;
3526 trueop->op_sibling = falseop;
3527 o = newUNOP(OP_NULL, 0, (OP*)logop);
3529 trueop->op_next = falseop->op_next = o;
3536 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3545 NewOp(1101, range, 1, LOGOP);
3547 range->op_type = OP_RANGE;
3548 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3549 range->op_first = left;
3550 range->op_flags = OPf_KIDS;
3551 leftstart = LINKLIST(left);
3552 range->op_other = LINKLIST(right);
3553 range->op_private = 1 | (flags >> 8);
3555 left->op_sibling = right;
3557 range->op_next = (OP*)range;
3558 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3559 flop = newUNOP(OP_FLOP, 0, flip);
3560 o = newUNOP(OP_NULL, 0, flop);
3562 range->op_next = leftstart;
3564 left->op_next = flip;
3565 right->op_next = flop;
3567 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3568 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3569 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3570 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3572 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3573 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3576 if (!flip->op_private || !flop->op_private)
3577 linklist(o); /* blow off optimizer unless constant */
3583 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3588 int once = block && block->op_flags & OPf_SPECIAL &&
3589 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3592 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3593 return block; /* do {} while 0 does once */
3594 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3595 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3596 expr = newUNOP(OP_DEFINED, 0,
3597 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3598 } else if (expr->op_flags & OPf_KIDS) {
3599 OP *k1 = ((UNOP*)expr)->op_first;
3600 OP *k2 = (k1) ? k1->op_sibling : NULL;
3601 switch (expr->op_type) {
3603 if (k2 && k2->op_type == OP_READLINE
3604 && (k2->op_flags & OPf_STACKED)
3605 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3606 expr = newUNOP(OP_DEFINED, 0, expr);
3610 if (k1->op_type == OP_READDIR
3611 || k1->op_type == OP_GLOB
3612 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3613 || k1->op_type == OP_EACH)
3614 expr = newUNOP(OP_DEFINED, 0, expr);
3620 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3621 o = new_logop(OP_AND, 0, &expr, &listop);
3624 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3626 if (once && o != listop)
3627 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3630 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3632 o->op_flags |= flags;
3634 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3639 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3648 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3649 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3650 expr = newUNOP(OP_DEFINED, 0,
3651 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3652 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3653 OP *k1 = ((UNOP*)expr)->op_first;
3654 OP *k2 = (k1) ? k1->op_sibling : NULL;
3655 switch (expr->op_type) {
3657 if (k2 && k2->op_type == OP_READLINE
3658 && (k2->op_flags & OPf_STACKED)
3659 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3660 expr = newUNOP(OP_DEFINED, 0, expr);
3664 if (k1->op_type == OP_READDIR
3665 || k1->op_type == OP_GLOB
3666 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3667 || k1->op_type == OP_EACH)
3668 expr = newUNOP(OP_DEFINED, 0, expr);
3674 block = newOP(OP_NULL, 0);
3677 next = LINKLIST(cont);
3679 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3680 if ((line_t)whileline != NOLINE) {
3681 PL_copline = whileline;
3682 cont = append_elem(OP_LINESEQ, cont,
3683 newSTATEOP(0, Nullch, Nullop));
3687 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3688 redo = LINKLIST(listop);
3691 PL_copline = whileline;
3693 o = new_logop(OP_AND, 0, &expr, &listop);
3694 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3695 op_free(expr); /* oops, it's a while (0) */
3697 return Nullop; /* listop already freed by new_logop */
3700 ((LISTOP*)listop)->op_last->op_next = condop =
3701 (o == listop ? redo : LINKLIST(o));
3709 NewOp(1101,loop,1,LOOP);
3710 loop->op_type = OP_ENTERLOOP;
3711 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3712 loop->op_private = 0;
3713 loop->op_next = (OP*)loop;
3716 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3718 loop->op_redoop = redo;
3719 loop->op_lastop = o;
3722 loop->op_nextop = next;
3724 loop->op_nextop = o;
3726 o->op_flags |= flags;
3727 o->op_private |= (flags >> 8);
3732 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3741 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3742 sv->op_type = OP_RV2GV;
3743 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3745 else if (sv->op_type == OP_PADSV) { /* private variable */
3746 padoff = sv->op_targ;
3751 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3752 padoff = sv->op_targ;
3754 iterflags |= OPf_SPECIAL;
3759 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3763 padoff = find_threadsv("_");
3764 iterflags |= OPf_SPECIAL;
3766 sv = newGVOP(OP_GV, 0, PL_defgv);
3769 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3770 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3771 iterflags |= OPf_STACKED;
3773 else if (expr->op_type == OP_NULL &&
3774 (expr->op_flags & OPf_KIDS) &&
3775 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3777 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3778 * set the STACKED flag to indicate that these values are to be
3779 * treated as min/max values by 'pp_iterinit'.
3781 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3782 LOGOP* range = (LOGOP*) flip->op_first;
3783 OP* left = range->op_first;
3784 OP* right = left->op_sibling;
3787 range->op_flags &= ~OPf_KIDS;
3788 range->op_first = Nullop;
3790 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3791 listop->op_first->op_next = range->op_next;
3792 left->op_next = range->op_other;
3793 right->op_next = (OP*)listop;
3794 listop->op_next = listop->op_first;
3797 expr = (OP*)(listop);
3799 iterflags |= OPf_STACKED;
3802 expr = mod(force_list(expr), OP_GREPSTART);
3806 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3807 append_elem(OP_LIST, expr, scalar(sv))));
3808 assert(!loop->op_next);
3809 #ifdef PL_OP_SLAB_ALLOC
3810 NewOp(1234,tmp,1,LOOP);
3811 Copy(loop,tmp,1,LOOP);
3814 Renew(loop, 1, LOOP);
3816 loop->op_targ = padoff;
3817 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3818 PL_copline = forline;
3819 return newSTATEOP(0, label, wop);
3823 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3829 if (type != OP_GOTO || label->op_type == OP_CONST) {
3830 /* "last()" means "last" */
3831 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3832 o = newOP(type, OPf_SPECIAL);
3834 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3835 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3841 if (label->op_type == OP_ENTERSUB)
3842 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3843 o = newUNOP(type, OPf_STACKED, label);
3845 PL_hints |= HINT_BLOCK_SCOPE;
3850 Perl_cv_undef(pTHX_ CV *cv)
3855 MUTEX_DESTROY(CvMUTEXP(cv));
3856 Safefree(CvMUTEXP(cv));
3859 #endif /* USE_THREADS */
3861 if (!CvXSUB(cv) && CvROOT(cv)) {
3863 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3864 Perl_croak(aTHX_ "Can't undef active subroutine");
3867 Perl_croak(aTHX_ "Can't undef active subroutine");
3868 #endif /* USE_THREADS */
3871 SAVESPTR(PL_curpad);
3875 op_free(CvROOT(cv));
3876 CvROOT(cv) = Nullop;
3879 SvPOK_off((SV*)cv); /* forget prototype */
3881 SvREFCNT_dec(CvGV(cv));
3883 SvREFCNT_dec(CvOUTSIDE(cv));
3884 CvOUTSIDE(cv) = Nullcv;
3885 if (CvPADLIST(cv)) {
3886 /* may be during global destruction */
3887 if (SvREFCNT(CvPADLIST(cv))) {
3888 I32 i = AvFILLp(CvPADLIST(cv));
3890 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3891 SV* sv = svp ? *svp : Nullsv;
3894 if (sv == (SV*)PL_comppad_name)
3895 PL_comppad_name = Nullav;
3896 else if (sv == (SV*)PL_comppad) {
3897 PL_comppad = Nullav;
3898 PL_curpad = Null(SV**);
3902 SvREFCNT_dec((SV*)CvPADLIST(cv));
3904 CvPADLIST(cv) = Nullav;
3910 S_cv_dump(pTHX_ CV *cv)
3912 CV *outside = CvOUTSIDE(cv);
3913 AV* padlist = CvPADLIST(cv);
3920 PerlIO_printf(Perl_debug_log,
3921 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
3923 (CvANON(cv) ? "ANON"
3924 : (cv == PL_main_cv) ? "MAIN"
3925 : CvUNIQUE(cv) ? "UNIQUE"
3926 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3929 : CvANON(outside) ? "ANON"
3930 : (outside == PL_main_cv) ? "MAIN"
3931 : CvUNIQUE(outside) ? "UNIQUE"
3932 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3937 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3938 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3939 pname = AvARRAY(pad_name);
3940 ppad = AvARRAY(pad);
3942 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3943 if (SvPOK(pname[ix]))
3944 PerlIO_printf(Perl_debug_log,
3945 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
3946 ix, PTR2UV(ppad[ix]),
3947 SvFAKE(pname[ix]) ? "FAKE " : "",
3949 (IV)I_32(SvNVX(pname[ix])),
3953 #endif /* DEBUGGING */
3956 S_cv_clone2(pTHX_ CV *proto, CV *outside)
3961 AV* protopadlist = CvPADLIST(proto);
3962 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3963 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3964 SV** pname = AvARRAY(protopad_name);
3965 SV** ppad = AvARRAY(protopad);
3966 I32 fname = AvFILLp(protopad_name);
3967 I32 fpad = AvFILLp(protopad);
3971 assert(!CvUNIQUE(proto));
3974 SAVESPTR(PL_curpad);
3975 SAVESPTR(PL_comppad);
3976 SAVESPTR(PL_comppad_name);
3977 SAVESPTR(PL_compcv);
3979 cv = PL_compcv = (CV*)NEWSV(1104,0);
3980 sv_upgrade((SV *)cv, SvTYPE(proto));
3986 New(666, CvMUTEXP(cv), 1, perl_mutex);
3987 MUTEX_INIT(CvMUTEXP(cv));
3989 #endif /* USE_THREADS */
3990 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3991 CvSTASH(cv) = CvSTASH(proto);
3992 CvROOT(cv) = CvROOT(proto);
3993 CvSTART(cv) = CvSTART(proto);
3995 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3998 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4000 PL_comppad_name = newAV();
4001 for (ix = fname; ix >= 0; ix--)
4002 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4004 PL_comppad = newAV();
4006 comppadlist = newAV();
4007 AvREAL_off(comppadlist);
4008 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4009 av_store(comppadlist, 1, (SV*)PL_comppad);
4010 CvPADLIST(cv) = comppadlist;
4011 av_fill(PL_comppad, AvFILLp(protopad));
4012 PL_curpad = AvARRAY(PL_comppad);
4014 av = newAV(); /* will be @_ */
4016 av_store(PL_comppad, 0, (SV*)av);
4017 AvFLAGS(av) = AVf_REIFY;
4019 for (ix = fpad; ix > 0; ix--) {
4020 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4021 if (namesv && namesv != &PL_sv_undef) {
4022 char *name = SvPVX(namesv); /* XXX */
4023 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4024 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4025 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4027 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4029 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4031 else { /* our own lexical */
4034 /* anon code -- we'll come back for it */
4035 sv = SvREFCNT_inc(ppad[ix]);
4037 else if (*name == '@')
4039 else if (*name == '%')
4048 else if (IS_PADGV(ppad[ix])) {
4049 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4052 SV* sv = NEWSV(0,0);
4058 /* Now that vars are all in place, clone nested closures. */
4060 for (ix = fpad; ix > 0; ix--) {
4061 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4063 && namesv != &PL_sv_undef
4064 && !(SvFLAGS(namesv) & SVf_FAKE)
4065 && *SvPVX(namesv) == '&'
4066 && CvCLONE(ppad[ix]))
4068 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4069 SvREFCNT_dec(ppad[ix]);
4072 PL_curpad[ix] = (SV*)kid;
4076 #ifdef DEBUG_CLOSURES
4077 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4079 PerlIO_printf(Perl_debug_log, " from:\n");
4081 PerlIO_printf(Perl_debug_log, " to:\n");
4090 Perl_cv_clone(pTHX_ CV *proto)
4093 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
4094 cv = cv_clone2(proto, CvOUTSIDE(proto));
4095 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
4100 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4104 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_UNSAFE)) {
4105 SV* msg = sv_newmortal();
4109 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4110 sv_setpv(msg, "Prototype mismatch:");
4112 Perl_sv_catpvf(aTHX_ msg, " sub %_", name);
4114 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4115 sv_catpv(msg, " vs ");
4117 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4119 sv_catpv(msg, "none");
4120 Perl_warner(aTHX_ WARN_UNSAFE, "%_", msg);
4125 Perl_cv_const_sv(pTHX_ CV *cv)
4127 if (!cv || !SvPOK(cv) || SvCUR(cv))
4129 return op_const_sv(CvSTART(cv), cv);
4133 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4140 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4141 o = cLISTOPo->op_first->op_sibling;
4143 for (; o; o = o->op_next) {
4144 OPCODE type = o->op_type;
4146 if (sv && o->op_next == o)
4148 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4150 if (type == OP_LEAVESUB || type == OP_RETURN)
4154 if (type == OP_CONST)
4156 else if (type == OP_PADSV && cv) {
4157 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4158 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4159 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4171 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4181 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4185 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4187 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4191 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4195 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4196 GV *gv = gv_fetchpv(name ? name : "__ANON__",
4197 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4199 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4210 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4211 maximum a prototype before. */
4212 if (SvTYPE(gv) > SVt_NULL) {
4213 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4214 && ckWARN_d(WARN_UNSAFE))
4216 Perl_warner(aTHX_ WARN_UNSAFE, "Runaway prototype");
4218 cv_ckproto((CV*)gv, NULL, ps);
4221 sv_setpv((SV*)gv, ps);
4223 sv_setiv((SV*)gv, -1);
4224 SvREFCNT_dec(PL_compcv);
4225 cv = PL_compcv = NULL;
4226 PL_sub_generation++;
4230 if (!name || GvCVGEN(gv))
4232 else if (cv = GvCV(gv)) {
4233 cv_ckproto(cv, gv, ps);
4234 /* already defined (or promised)? */
4235 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4237 bool const_changed = TRUE;
4238 if (!block && !attrs) {
4239 /* just a "sub foo;" when &foo is already defined */
4240 SAVEFREESV(PL_compcv);
4243 /* ahem, death to those who redefine active sort subs */
4244 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4245 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4248 if(const_sv = cv_const_sv(cv))
4249 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4250 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
4251 && !(CvGV(cv) && GvSTASH(CvGV(cv))
4252 && HvNAME(GvSTASH(CvGV(cv)))
4253 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
4255 line_t oldline = PL_curcop->cop_line;
4256 PL_curcop->cop_line = PL_copline;
4257 Perl_warner(aTHX_ WARN_REDEFINE,
4258 const_sv ? "Constant subroutine %s redefined"
4259 : "Subroutine %s redefined", name);
4260 PL_curcop->cop_line = oldline;
4271 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4272 * before we clobber PL_compcv.
4276 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4277 stash = GvSTASH(CvGV(cv));
4278 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4279 stash = CvSTASH(cv);
4281 stash = PL_curstash;
4284 /* possibly about to re-define existing subr -- ignore old cv */
4285 rcv = (SV*)PL_compcv;
4286 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4287 stash = GvSTASH(gv);
4289 stash = PL_curstash;
4291 apply_attrs(stash, rcv, attrs);
4293 if (cv) { /* must reuse cv if autoloaded */
4295 /* got here with just attrs -- work done, so bug out */
4296 SAVEFREESV(PL_compcv);
4300 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4301 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4302 CvOUTSIDE(PL_compcv) = 0;
4303 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4304 CvPADLIST(PL_compcv) = 0;
4305 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4306 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4307 SvREFCNT_dec(PL_compcv);
4314 PL_sub_generation++;
4317 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4318 CvSTASH(cv) = PL_curstash;
4321 if (!CvMUTEXP(cv)) {
4322 New(666, CvMUTEXP(cv), 1, perl_mutex);
4323 MUTEX_INIT(CvMUTEXP(cv));
4325 #endif /* USE_THREADS */
4328 sv_setpv((SV*)cv, ps);
4330 if (PL_error_count) {
4334 char *s = strrchr(name, ':');
4336 if (strEQ(s, "BEGIN")) {
4338 "BEGIN not safe after errors--compilation aborted";
4339 if (PL_in_eval & EVAL_KEEPERR)
4340 Perl_croak(aTHX_ not_safe);
4342 /* force display of errors found but not reported */
4343 sv_catpv(ERRSV, not_safe);
4344 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4351 PL_copline = NOLINE;
4356 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4357 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4360 SV **namep = AvARRAY(PL_comppad_name);
4361 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4364 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]))
4367 * The only things that a clonable function needs in its
4368 * pad are references to outer lexicals and anonymous subs.
4369 * The rest are created anew during cloning.
4371 if (!((namesv = namep[ix]) != Nullsv &&
4372 namesv != &PL_sv_undef &&
4374 *SvPVX(namesv) == '&')))
4376 SvREFCNT_dec(PL_curpad[ix]);
4377 PL_curpad[ix] = Nullsv;
4382 AV *av = newAV(); /* Will be @_ */
4384 av_store(PL_comppad, 0, (SV*)av);
4385 AvFLAGS(av) = AVf_REIFY;
4387 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4388 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]))
4390 if (!SvPADMY(PL_curpad[ix]))
4391 SvPADTMP_on(PL_curpad[ix]);
4396 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4399 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4401 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4402 OpREFCNT_set(CvROOT(cv), 1);
4403 CvSTART(cv) = LINKLIST(CvROOT(cv));
4404 CvROOT(cv)->op_next = 0;
4410 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4411 SV *sv = NEWSV(0,0);
4412 SV *tmpstr = sv_newmortal();
4413 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4417 Perl_sv_setpvf(aTHX_ sv, "%_:%ld-%ld",
4418 CopFILESV(PL_curcop),
4419 (long)PL_subline, (long)CopLINE(PL_curcop));
4420 gv_efullname3(tmpstr, gv, Nullch);
4421 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4422 hv = GvHVn(db_postponed);
4423 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4424 && (cv = GvCV(db_postponed))) {
4429 call_sv((SV*)cv, G_DISCARD);
4433 if ((s = strrchr(name,':')))
4437 if (strEQ(s, "BEGIN")) {
4438 I32 oldscope = PL_scopestack_ix;
4440 SAVESPTR(CopFILEGV(&PL_compiling));
4441 SAVEI16(PL_compiling.cop_line);
4443 sv_setsv(PL_rs, PL_nrs);
4446 PL_beginav = newAV();
4447 DEBUG_x( dump_sub(gv) );
4448 av_push(PL_beginav, (SV *)cv);
4450 call_list(oldscope, PL_beginav);
4452 PL_curcop = &PL_compiling;
4453 PL_compiling.op_private = PL_hints;
4456 else if (strEQ(s, "END") && !PL_error_count) {
4459 av_unshift(PL_endav, 1);
4460 av_store(PL_endav, 0, (SV *)cv);
4463 else if (strEQ(s, "STOP") && !PL_error_count) {
4465 PL_stopav = newAV();
4466 av_unshift(PL_stopav, 1);
4467 av_store(PL_stopav, 0, (SV *)cv);
4470 else if (strEQ(s, "INIT") && !PL_error_count) {
4472 PL_initav = newAV();
4473 av_push(PL_initav, SvREFCNT_inc(cv));
4479 PL_copline = NOLINE;
4484 /* XXX unsafe for threads if eval_owner isn't held */
4486 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4489 U32 oldhints = PL_hints;
4490 HV *old_cop_stash = PL_curcop->cop_stash;
4491 HV *old_curstash = PL_curstash;
4492 line_t oldline = PL_curcop->cop_line;
4493 PL_curcop->cop_line = PL_copline;
4495 PL_hints &= ~HINT_BLOCK_SCOPE;
4497 PL_curstash = PL_curcop->cop_stash = stash;
4500 start_subparse(FALSE, 0),
4501 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4502 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4504 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4507 PL_hints = oldhints;
4508 PL_curcop->cop_stash = old_cop_stash;
4509 PL_curstash = old_curstash;
4510 PL_curcop->cop_line = oldline;
4514 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4517 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4520 if (cv = (name ? GvCV(gv) : Nullcv)) {
4522 /* just a cached method */
4526 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4527 /* already defined (or promised) */
4528 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4529 && HvNAME(GvSTASH(CvGV(cv)))
4530 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4531 line_t oldline = PL_curcop->cop_line;
4532 if (PL_copline != NOLINE)
4533 PL_curcop->cop_line = PL_copline;
4534 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4535 PL_curcop->cop_line = oldline;
4542 if (cv) /* must reuse cv if autoloaded */
4545 cv = (CV*)NEWSV(1105,0);
4546 sv_upgrade((SV *)cv, SVt_PVCV);
4550 PL_sub_generation++;
4553 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4555 New(666, CvMUTEXP(cv), 1, perl_mutex);
4556 MUTEX_INIT(CvMUTEXP(cv));
4558 #endif /* USE_THREADS */
4559 (void)gv_fetchfile(filename);
4560 CvXSUB(cv) = subaddr;
4563 char *s = strrchr(name,':');
4568 if (strEQ(s, "BEGIN")) {
4570 PL_beginav = newAV();
4571 av_push(PL_beginav, (SV *)cv);
4574 else if (strEQ(s, "END")) {
4577 av_unshift(PL_endav, 1);
4578 av_store(PL_endav, 0, (SV *)cv);
4581 else if (strEQ(s, "STOP")) {
4583 PL_stopav = newAV();
4584 av_unshift(PL_stopav, 1);
4585 av_store(PL_stopav, 0, (SV *)cv);
4588 else if (strEQ(s, "INIT")) {
4590 PL_initav = newAV();
4591 av_push(PL_initav, (SV *)cv);
4602 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4612 name = SvPVx(cSVOPo->op_sv, n_a);
4615 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4617 if (cv = GvFORM(gv)) {
4618 if (ckWARN(WARN_REDEFINE)) {
4619 line_t oldline = PL_curcop->cop_line;
4621 PL_curcop->cop_line = PL_copline;
4622 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4623 PL_curcop->cop_line = oldline;
4629 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4631 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4632 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4633 SvPADTMP_on(PL_curpad[ix]);
4636 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4637 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4638 OpREFCNT_set(CvROOT(cv), 1);
4639 CvSTART(cv) = LINKLIST(CvROOT(cv));
4640 CvROOT(cv)->op_next = 0;
4643 PL_copline = NOLINE;
4648 Perl_newANONLIST(pTHX_ OP *o)
4650 return newUNOP(OP_REFGEN, 0,
4651 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4655 Perl_newANONHASH(pTHX_ OP *o)
4657 return newUNOP(OP_REFGEN, 0,
4658 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4662 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4664 return newANONATTRSUB(floor, proto, Nullop, block);
4668 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4670 return newUNOP(OP_REFGEN, 0,
4671 newSVOP(OP_ANONCODE, 0,
4672 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4676 Perl_oopsAV(pTHX_ OP *o)
4678 switch (o->op_type) {
4680 o->op_type = OP_PADAV;
4681 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4682 return ref(o, OP_RV2AV);
4685 o->op_type = OP_RV2AV;
4686 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4691 if (ckWARN_d(WARN_INTERNAL))
4692 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4699 Perl_oopsHV(pTHX_ OP *o)
4703 switch (o->op_type) {
4706 o->op_type = OP_PADHV;
4707 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4708 return ref(o, OP_RV2HV);
4712 o->op_type = OP_RV2HV;
4713 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4718 if (ckWARN_d(WARN_INTERNAL))
4719 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
4726 Perl_newAVREF(pTHX_ OP *o)
4728 if (o->op_type == OP_PADANY) {
4729 o->op_type = OP_PADAV;
4730 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4733 return newUNOP(OP_RV2AV, 0, scalar(o));
4737 Perl_newGVREF(pTHX_ I32 type, OP *o)
4739 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4740 return newUNOP(OP_NULL, 0, o);
4741 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4745 Perl_newHVREF(pTHX_ OP *o)
4747 if (o->op_type == OP_PADANY) {
4748 o->op_type = OP_PADHV;
4749 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4752 return newUNOP(OP_RV2HV, 0, scalar(o));
4756 Perl_oopsCV(pTHX_ OP *o)
4758 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4764 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4766 return newUNOP(OP_RV2CV, flags, scalar(o));
4770 Perl_newSVREF(pTHX_ OP *o)
4772 if (o->op_type == OP_PADANY) {
4773 o->op_type = OP_PADSV;
4774 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4777 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4778 o->op_flags |= OPpDONE_SVREF;
4781 return newUNOP(OP_RV2SV, 0, scalar(o));
4784 /* Check routines. */
4787 Perl_ck_anoncode(pTHX_ OP *o)
4792 name = NEWSV(1106,0);
4793 sv_upgrade(name, SVt_PVNV);
4794 sv_setpvn(name, "&", 1);
4797 ix = pad_alloc(o->op_type, SVs_PADMY);
4798 av_store(PL_comppad_name, ix, name);
4799 av_store(PL_comppad, ix, cSVOPo->op_sv);
4800 SvPADMY_on(cSVOPo->op_sv);
4801 cSVOPo->op_sv = Nullsv;
4802 cSVOPo->op_targ = ix;
4807 Perl_ck_bitop(pTHX_ OP *o)
4809 o->op_private = PL_hints;
4814 Perl_ck_concat(pTHX_ OP *o)
4816 if (cUNOPo->op_first->op_type == OP_CONCAT)
4817 o->op_flags |= OPf_STACKED;
4822 Perl_ck_spair(pTHX_ OP *o)
4824 if (o->op_flags & OPf_KIDS) {
4827 OPCODE type = o->op_type;
4828 o = modkids(ck_fun(o), type);
4829 kid = cUNOPo->op_first;
4830 newop = kUNOP->op_first->op_sibling;
4832 (newop->op_sibling ||
4833 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4834 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4835 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4839 op_free(kUNOP->op_first);
4840 kUNOP->op_first = newop;
4842 o->op_ppaddr = PL_ppaddr[++o->op_type];
4847 Perl_ck_delete(pTHX_ OP *o)
4851 if (o->op_flags & OPf_KIDS) {
4852 OP *kid = cUNOPo->op_first;
4853 if (kid->op_type == OP_HSLICE)
4854 o->op_private |= OPpSLICE;
4855 else if (kid->op_type != OP_HELEM)
4856 Perl_croak(aTHX_ "%s argument is not a HASH element or slice",
4857 PL_op_desc[o->op_type]);
4864 Perl_ck_eof(pTHX_ OP *o)
4866 I32 type = o->op_type;
4868 if (o->op_flags & OPf_KIDS) {
4869 if (cLISTOPo->op_first->op_type == OP_STUB) {
4871 o = newUNOP(type, OPf_SPECIAL,
4872 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4880 Perl_ck_eval(pTHX_ OP *o)
4882 PL_hints |= HINT_BLOCK_SCOPE;
4883 if (o->op_flags & OPf_KIDS) {
4884 SVOP *kid = (SVOP*)cUNOPo->op_first;
4887 o->op_flags &= ~OPf_KIDS;
4890 else if (kid->op_type == OP_LINESEQ) {
4893 kid->op_next = o->op_next;
4894 cUNOPo->op_first = 0;
4897 NewOp(1101, enter, 1, LOGOP);
4898 enter->op_type = OP_ENTERTRY;
4899 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4900 enter->op_private = 0;
4902 /* establish postfix order */
4903 enter->op_next = (OP*)enter;
4905 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4906 o->op_type = OP_LEAVETRY;
4907 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4908 enter->op_other = o;
4916 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4918 o->op_targ = (PADOFFSET)PL_hints;
4923 Perl_ck_exec(pTHX_ OP *o)
4926 if (o->op_flags & OPf_STACKED) {
4928 kid = cUNOPo->op_first->op_sibling;
4929 if (kid->op_type == OP_RV2GV)
4938 Perl_ck_exists(pTHX_ OP *o)
4941 if (o->op_flags & OPf_KIDS) {
4942 OP *kid = cUNOPo->op_first;
4943 if (kid->op_type != OP_HELEM)
4944 Perl_croak(aTHX_ "%s argument is not a HASH element", PL_op_desc[o->op_type]);
4952 Perl_ck_gvconst(pTHX_ register OP *o)
4954 o = fold_constants(o);
4955 if (o->op_type == OP_CONST)
4962 Perl_ck_rvconst(pTHX_ register OP *o)
4965 SVOP *kid = (SVOP*)cUNOPo->op_first;
4967 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4968 if (kid->op_type == OP_CONST) {
4972 SV *kidsv = kid->op_sv;
4975 /* Is it a constant from cv_const_sv()? */
4976 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4977 SV *rsv = SvRV(kidsv);
4978 int svtype = SvTYPE(rsv);
4979 char *badtype = Nullch;
4981 switch (o->op_type) {
4983 if (svtype > SVt_PVMG)
4984 badtype = "a SCALAR";
4987 if (svtype != SVt_PVAV)
4988 badtype = "an ARRAY";
4991 if (svtype != SVt_PVHV) {
4992 if (svtype == SVt_PVAV) { /* pseudohash? */
4993 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4994 if (ksv && SvROK(*ksv)
4995 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5004 if (svtype != SVt_PVCV)
5009 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5012 name = SvPV(kidsv, n_a);
5013 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5014 char *badthing = Nullch;
5015 switch (o->op_type) {
5017 badthing = "a SCALAR";
5020 badthing = "an ARRAY";
5023 badthing = "a HASH";
5028 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5032 * This is a little tricky. We only want to add the symbol if we
5033 * didn't add it in the lexer. Otherwise we get duplicate strict
5034 * warnings. But if we didn't add it in the lexer, we must at
5035 * least pretend like we wanted to add it even if it existed before,
5036 * or we get possible typo warnings. OPpCONST_ENTERED says
5037 * whether the lexer already added THIS instance of this symbol.
5039 iscv = (o->op_type == OP_RV2CV) * 2;
5041 gv = gv_fetchpv(name,
5042 iscv | !(kid->op_private & OPpCONST_ENTERED),
5045 : o->op_type == OP_RV2SV
5047 : o->op_type == OP_RV2AV
5049 : o->op_type == OP_RV2HV
5052 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5054 kid->op_type = OP_GV;
5055 SvREFCNT_dec(kid->op_sv);
5057 /* XXXXXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5058 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5060 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5062 kid->op_sv = SvREFCNT_inc(gv);
5064 kid->op_ppaddr = PL_ppaddr[OP_GV];
5071 Perl_ck_ftst(pTHX_ OP *o)
5074 I32 type = o->op_type;
5076 if (o->op_flags & OPf_REF)
5079 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5080 SVOP *kid = (SVOP*)cUNOPo->op_first;
5082 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5084 OP *newop = newGVOP(type, OPf_REF,
5085 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5092 if (type == OP_FTTTY)
5093 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5096 return newUNOP(type, 0, newDEFSVOP());
5102 Perl_ck_fun(pTHX_ OP *o)
5109 int type = o->op_type;
5110 register I32 oa = PL_opargs[type] >> OASHIFT;
5112 if (o->op_flags & OPf_STACKED) {
5113 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5116 return no_fh_allowed(o);
5119 if (o->op_flags & OPf_KIDS) {
5121 tokid = &cLISTOPo->op_first;
5122 kid = cLISTOPo->op_first;
5123 if (kid->op_type == OP_PUSHMARK ||
5124 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
5126 tokid = &kid->op_sibling;
5127 kid = kid->op_sibling;
5129 if (!kid && PL_opargs[type] & OA_DEFGV)
5130 *tokid = kid = newDEFSVOP();
5134 sibl = kid->op_sibling;
5137 /* list seen where single (scalar) arg expected? */
5138 if (numargs == 1 && !(oa >> 4)
5139 && kid->op_type == OP_LIST && type != OP_SCALAR)
5141 return too_many_arguments(o,PL_op_desc[type]);
5154 if (kid->op_type == OP_CONST &&
5155 (kid->op_private & OPpCONST_BARE))
5157 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5158 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5159 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5160 if (ckWARN(WARN_SYNTAX))
5161 Perl_warner(aTHX_ WARN_SYNTAX,
5162 "Array @%s missing the @ in argument %"IVdf" of %s()",
5163 name, (IV)numargs, PL_op_desc[type]);
5166 kid->op_sibling = sibl;
5169 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5170 bad_type(numargs, "array", PL_op_desc[type], kid);
5174 if (kid->op_type == OP_CONST &&
5175 (kid->op_private & OPpCONST_BARE))
5177 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5178 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5179 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5180 if (ckWARN(WARN_SYNTAX))
5181 Perl_warner(aTHX_ WARN_SYNTAX,
5182 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5183 name, (IV)numargs, PL_op_desc[type]);
5186 kid->op_sibling = sibl;
5189 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5190 bad_type(numargs, "hash", PL_op_desc[type], kid);
5195 OP *newop = newUNOP(OP_NULL, 0, kid);
5196 kid->op_sibling = 0;
5198 newop->op_next = newop;
5200 kid->op_sibling = sibl;
5205 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5206 if (kid->op_type == OP_CONST &&
5207 (kid->op_private & OPpCONST_BARE))
5209 OP *newop = newGVOP(OP_GV, 0,
5210 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5215 else if (kid->op_type == OP_READLINE) {
5216 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5217 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5220 I32 flags = OPf_SPECIAL;
5222 /* is this op a FH constructor? */
5223 if (is_handle_constructor(o,numargs)) {
5225 /* Set a flag to tell rv2gv to vivify
5226 * need to "prove" flag does not mean something
5227 * else already - NI-S 1999/05/07
5231 /* Helps with open($array[$n],...)
5232 but is too simplistic - need to do selectively
5237 kid->op_sibling = 0;
5238 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5240 kid->op_private |= priv;
5243 kid->op_sibling = sibl;
5249 mod(scalar(kid), type);
5253 tokid = &kid->op_sibling;
5254 kid = kid->op_sibling;
5256 o->op_private |= numargs;
5258 return too_many_arguments(o,PL_op_desc[o->op_type]);
5261 else if (PL_opargs[type] & OA_DEFGV) {
5263 return newUNOP(type, 0, newDEFSVOP());
5267 while (oa & OA_OPTIONAL)
5269 if (oa && oa != OA_LIST)
5270 return too_few_arguments(o,PL_op_desc[o->op_type]);
5276 Perl_ck_glob(pTHX_ OP *o)
5280 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5281 append_elem(OP_GLOB, o, newDEFSVOP());
5283 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5284 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5286 #if defined(PERL_INTERNAL_GLOB) && !defined(MINIPERL_BUILD)
5287 /* XXX this can be tightened up and made more failsafe. */
5289 OP *modname = newSVOP(OP_CONST, 0, newSVpvn("File::Glob", 10));
5290 modname->op_private |= OPpCONST_BARE;
5292 utilize(1, start_subparse(FALSE, 0), Nullop, modname,
5293 newSVOP(OP_CONST, 0, newSVpvn("globally", 8)));
5294 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5297 #endif /* PERL_INTERNAL_GLOB && !MINIPERL_BUILD */
5299 if (gv && GvIMPORTED_CV(gv)) {
5300 append_elem(OP_GLOB, o,
5301 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5302 o->op_type = OP_LIST;
5303 o->op_ppaddr = PL_ppaddr[OP_LIST];
5304 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5305 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5306 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5307 append_elem(OP_LIST, o,
5308 scalar(newUNOP(OP_RV2CV, 0,
5309 newGVOP(OP_GV, 0, gv)))));
5310 o = newUNOP(OP_NULL, 0, ck_subr(o));
5311 o->op_targ = OP_GLOB; /* hint at what it used to be */
5314 gv = newGVgen("main");
5316 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5322 Perl_ck_grep(pTHX_ OP *o)
5326 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5328 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5329 NewOp(1101, gwop, 1, LOGOP);
5331 if (o->op_flags & OPf_STACKED) {
5334 kid = cLISTOPo->op_first->op_sibling;
5335 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5338 kid->op_next = (OP*)gwop;
5339 o->op_flags &= ~OPf_STACKED;
5341 kid = cLISTOPo->op_first->op_sibling;
5342 if (type == OP_MAPWHILE)
5349 kid = cLISTOPo->op_first->op_sibling;
5350 if (kid->op_type != OP_NULL)
5351 Perl_croak(aTHX_ "panic: ck_grep");
5352 kid = kUNOP->op_first;
5354 gwop->op_type = type;
5355 gwop->op_ppaddr = PL_ppaddr[type];
5356 gwop->op_first = listkids(o);
5357 gwop->op_flags |= OPf_KIDS;
5358 gwop->op_private = 1;
5359 gwop->op_other = LINKLIST(kid);
5360 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5361 kid->op_next = (OP*)gwop;
5363 kid = cLISTOPo->op_first->op_sibling;
5364 if (!kid || !kid->op_sibling)
5365 return too_few_arguments(o,PL_op_desc[o->op_type]);
5366 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5367 mod(kid, OP_GREPSTART);
5373 Perl_ck_index(pTHX_ OP *o)
5375 if (o->op_flags & OPf_KIDS) {
5376 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5378 kid = kid->op_sibling; /* get past "big" */
5379 if (kid && kid->op_type == OP_CONST)
5380 fbm_compile(((SVOP*)kid)->op_sv, 0);
5386 Perl_ck_lengthconst(pTHX_ OP *o)
5388 /* XXX length optimization goes here */
5393 Perl_ck_lfun(pTHX_ OP *o)
5395 OPCODE type = o->op_type;
5396 return modkids(ck_fun(o), type);
5400 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5403 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5404 switch (cUNOPo->op_first->op_type) {
5406 break; /* Globals via GV can be undef */
5408 case OP_AASSIGN: /* Is this a good idea? */
5409 Perl_warner(aTHX_ WARN_DEPRECATED,
5410 "defined(@array) is deprecated");
5411 Perl_warner(aTHX_ WARN_DEPRECATED,
5412 "(Maybe you should just omit the defined()?)\n");
5415 break; /* Globals via GV can be undef */
5417 Perl_warner(aTHX_ WARN_DEPRECATED,
5418 "defined(%hash) is deprecated");
5419 Perl_warner(aTHX_ WARN_DEPRECATED,
5420 "(Maybe you should just omit the defined()?)\n");
5431 Perl_ck_rfun(pTHX_ OP *o)
5433 OPCODE type = o->op_type;
5434 return refkids(ck_fun(o), type);
5438 Perl_ck_listiob(pTHX_ OP *o)
5442 kid = cLISTOPo->op_first;
5445 kid = cLISTOPo->op_first;
5447 if (kid->op_type == OP_PUSHMARK)
5448 kid = kid->op_sibling;
5449 if (kid && o->op_flags & OPf_STACKED)
5450 kid = kid->op_sibling;
5451 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5452 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5453 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5454 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5455 cLISTOPo->op_first->op_sibling = kid;
5456 cLISTOPo->op_last = kid;
5457 kid = kid->op_sibling;
5462 append_elem(o->op_type, o, newDEFSVOP());
5468 if (PL_hints & HINT_LOCALE)
5469 o->op_private |= OPpLOCALE;
5476 Perl_ck_fun_locale(pTHX_ OP *o)
5482 if (PL_hints & HINT_LOCALE)
5483 o->op_private |= OPpLOCALE;
5490 Perl_ck_sassign(pTHX_ OP *o)
5492 OP *kid = cLISTOPo->op_first;
5493 /* has a disposable target? */
5494 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5495 && !(kid->op_flags & OPf_STACKED))
5497 OP *kkid = kid->op_sibling;
5499 /* Can just relocate the target. */
5500 if (kkid && kkid->op_type == OP_PADSV
5501 && !(kkid->op_private & OPpLVAL_INTRO))
5503 /* Concat has problems if target is equal to right arg. */
5504 if (kid->op_type == OP_CONCAT) {
5505 if (kLISTOP->op_first->op_sibling->op_type == OP_PADSV
5506 && kLISTOP->op_first->op_sibling->op_targ == kkid->op_targ)
5509 else if (kid->op_type == OP_JOIN) {
5510 /* do_join has problems if the arguments coincide with target.
5511 In fact the second argument *can* safely coincide,
5512 but ignore=pessimize this rare occasion. */
5513 OP *arg = kLISTOP->op_first->op_sibling; /* Skip PUSHMARK */
5516 if (arg->op_type == OP_PADSV
5517 && arg->op_targ == kkid->op_targ)
5519 arg = arg->op_sibling;
5522 else if (kid->op_type == OP_QUOTEMETA) {
5523 /* quotemeta has problems if the argument coincides with target. */
5524 if (kLISTOP->op_first->op_type == OP_PADSV
5525 && kLISTOP->op_first->op_targ == kkid->op_targ)
5528 kid->op_targ = kkid->op_targ;
5530 /* Now we do not need PADSV and SASSIGN. */
5531 kid->op_sibling = o->op_sibling; /* NULL */
5532 cLISTOPo->op_first = NULL;
5535 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5543 Perl_ck_scmp(pTHX_ OP *o)
5547 if (PL_hints & HINT_LOCALE)
5548 o->op_private |= OPpLOCALE;
5555 Perl_ck_match(pTHX_ OP *o)
5557 o->op_private |= OPpRUNTIME;
5562 Perl_ck_method(pTHX_ OP *o)
5564 OP *kid = cUNOPo->op_first;
5565 if (kid->op_type == OP_CONST) {
5566 SV* sv = kSVOP->op_sv;
5567 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5569 sv_upgrade(sv, SVt_PVIV);
5571 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5572 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5573 kSVOP->op_sv = Nullsv;
5582 Perl_ck_null(pTHX_ OP *o)
5588 Perl_ck_repeat(pTHX_ OP *o)
5590 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5591 o->op_private |= OPpREPEAT_DOLIST;
5592 cBINOPo->op_first = force_list(cBINOPo->op_first);
5600 Perl_ck_require(pTHX_ OP *o)
5602 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5603 SVOP *kid = (SVOP*)cUNOPo->op_first;
5605 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5607 for (s = SvPVX(kid->op_sv); *s; s++) {
5608 if (*s == ':' && s[1] == ':') {
5610 Move(s+2, s+1, strlen(s+2)+1, char);
5611 --SvCUR(kid->op_sv);
5614 sv_catpvn(kid->op_sv, ".pm", 3);
5622 Perl_ck_retarget(pTHX_ OP *o)
5624 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5631 Perl_ck_select(pTHX_ OP *o)
5634 if (o->op_flags & OPf_KIDS) {
5635 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5636 if (kid && kid->op_sibling) {
5637 o->op_type = OP_SSELECT;
5638 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5640 return fold_constants(o);
5644 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5645 if (kid && kid->op_type == OP_RV2GV)
5646 kid->op_private &= ~HINT_STRICT_REFS;
5651 Perl_ck_shift(pTHX_ OP *o)
5653 I32 type = o->op_type;
5655 if (!(o->op_flags & OPf_KIDS)) {
5660 if (!CvUNIQUE(PL_compcv)) {
5661 argop = newOP(OP_PADAV, OPf_REF);
5662 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5665 argop = newUNOP(OP_RV2AV, 0,
5666 scalar(newGVOP(OP_GV, 0,
5667 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5670 argop = newUNOP(OP_RV2AV, 0,
5671 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5672 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5673 #endif /* USE_THREADS */
5674 return newUNOP(type, 0, scalar(argop));
5676 return scalar(modkids(ck_fun(o), type));
5680 Perl_ck_sort(pTHX_ OP *o)
5684 if (PL_hints & HINT_LOCALE)
5685 o->op_private |= OPpLOCALE;
5688 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5690 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5691 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5693 kid = kUNOP->op_first; /* get past null */
5695 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5697 if (kid->op_type == OP_SCOPE) {
5701 else if (kid->op_type == OP_LEAVE) {
5702 if (o->op_type == OP_SORT) {
5703 null(kid); /* wipe out leave */
5706 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5707 if (k->op_next == kid)
5712 kid->op_next = 0; /* just disconnect the leave */
5713 k = kLISTOP->op_first;
5717 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5718 if (o->op_type == OP_SORT)
5722 o->op_flags |= OPf_SPECIAL;
5724 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5725 null(cLISTOPo->op_first->op_sibling);
5732 S_simplify_sort(pTHX_ OP *o)
5735 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5739 if (!(o->op_flags & OPf_STACKED))
5741 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5742 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5743 kid = kUNOP->op_first; /* get past null */
5744 if (kid->op_type != OP_SCOPE)
5746 kid = kLISTOP->op_last; /* get past scope */
5747 switch(kid->op_type) {
5755 k = kid; /* remember this node*/
5756 if (kBINOP->op_first->op_type != OP_RV2SV)
5758 kid = kBINOP->op_first; /* get past cmp */
5759 if (kUNOP->op_first->op_type != OP_GV)
5761 kid = kUNOP->op_first; /* get past rv2sv */
5763 if (GvSTASH(gv) != PL_curstash)
5765 if (strEQ(GvNAME(gv), "a"))
5767 else if(strEQ(GvNAME(gv), "b"))
5771 kid = k; /* back to cmp */
5772 if (kBINOP->op_last->op_type != OP_RV2SV)
5774 kid = kBINOP->op_last; /* down to 2nd arg */
5775 if (kUNOP->op_first->op_type != OP_GV)
5777 kid = kUNOP->op_first; /* get past rv2sv */
5779 if (GvSTASH(gv) != PL_curstash
5781 ? strNE(GvNAME(gv), "a")
5782 : strNE(GvNAME(gv), "b")))
5784 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5786 o->op_private |= OPpSORT_REVERSE;
5787 if (k->op_type == OP_NCMP)
5788 o->op_private |= OPpSORT_NUMERIC;
5789 if (k->op_type == OP_I_NCMP)
5790 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5791 kid = cLISTOPo->op_first->op_sibling;
5792 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
5793 op_free(kid); /* then delete it */
5794 cLISTOPo->op_children--;
5798 Perl_ck_split(pTHX_ OP *o)
5802 if (o->op_flags & OPf_STACKED)
5803 return no_fh_allowed(o);
5805 kid = cLISTOPo->op_first;
5806 if (kid->op_type != OP_NULL)
5807 Perl_croak(aTHX_ "panic: ck_split");
5808 kid = kid->op_sibling;
5809 op_free(cLISTOPo->op_first);
5810 cLISTOPo->op_first = kid;
5812 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5813 cLISTOPo->op_last = kid; /* There was only one element previously */
5816 if (kid->op_type != OP_MATCH) {
5817 OP *sibl = kid->op_sibling;
5818 kid->op_sibling = 0;
5819 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5820 if (cLISTOPo->op_first == cLISTOPo->op_last)
5821 cLISTOPo->op_last = kid;
5822 cLISTOPo->op_first = kid;
5823 kid->op_sibling = sibl;
5826 kid->op_type = OP_PUSHRE;
5827 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5830 if (!kid->op_sibling)
5831 append_elem(OP_SPLIT, o, newDEFSVOP());
5833 kid = kid->op_sibling;
5836 if (!kid->op_sibling)
5837 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5839 kid = kid->op_sibling;
5842 if (kid->op_sibling)
5843 return too_many_arguments(o,PL_op_desc[o->op_type]);
5849 Perl_ck_join(pTHX_ OP *o)
5851 if (ckWARN(WARN_SYNTAX)) {
5852 OP *kid = cLISTOPo->op_first->op_sibling;
5853 if (kid && kid->op_type == OP_MATCH) {
5854 char *pmstr = "STRING";
5855 if (kPMOP->op_pmregexp)
5856 pmstr = kPMOP->op_pmregexp->precomp;
5857 Perl_warner(aTHX_ WARN_SYNTAX,
5858 "/%s/ should probably be written as \"%s\"",
5866 Perl_ck_subr(pTHX_ OP *o)
5869 OP *prev = ((cUNOPo->op_first->op_sibling)
5870 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5871 OP *o2 = prev->op_sibling;
5880 o->op_private |= OPpENTERSUB_HASTARG;
5881 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5882 if (cvop->op_type == OP_RV2CV) {
5884 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5885 null(cvop); /* disable rv2cv */
5886 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5887 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
5888 GV *gv = cGVOPx(tmpop);
5891 tmpop->op_private |= OPpEARLY_CV;
5892 else if (SvPOK(cv)) {
5893 namegv = CvANON(cv) ? gv : CvGV(cv);
5894 proto = SvPV((SV*)cv, n_a);
5898 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
5899 if (o2->op_type == OP_CONST)
5900 o2->op_private &= ~OPpCONST_STRICT;
5901 else if (o2->op_type == OP_LIST) {
5902 OP *o = ((UNOP*)o2)->op_first->op_sibling;
5903 if (o && o->op_type == OP_CONST)
5904 o->op_private &= ~OPpCONST_STRICT;
5907 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5908 if (PERLDB_SUB && PL_curstash != PL_debstash)
5909 o->op_private |= OPpENTERSUB_DB;
5910 while (o2 != cvop) {
5914 return too_many_arguments(o, gv_ename(namegv));
5932 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5933 bad_type(arg, "block", gv_ename(namegv), o2);
5936 /* '*' allows any scalar type, including bareword */
5939 if (o2->op_type == OP_RV2GV)
5940 goto wrapref; /* autoconvert GLOB -> GLOBref */
5941 else if (o2->op_type == OP_CONST)
5942 o2->op_private &= ~OPpCONST_STRICT;
5943 else if (o2->op_type == OP_ENTERSUB) {
5944 /* accidental subroutine, revert to bareword */
5945 OP *gvop = ((UNOP*)o2)->op_first;
5946 if (gvop && gvop->op_type == OP_NULL) {
5947 gvop = ((UNOP*)gvop)->op_first;
5949 for (; gvop->op_sibling; gvop = gvop->op_sibling)
5952 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
5953 (gvop = ((UNOP*)gvop)->op_first) &&
5954 gvop->op_type == OP_GV)
5956 GV *gv = cGVOPx(gvop);
5957 OP *sibling = o2->op_sibling;
5958 SV *n = newSVpvn("",0);
5960 gv_fullname3(n, gv, "");
5961 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
5962 sv_chop(n, SvPVX(n)+6);
5963 o2 = newSVOP(OP_CONST, 0, n);
5964 prev->op_sibling = o2;
5965 o2->op_sibling = sibling;
5977 if (o2->op_type != OP_RV2GV)
5978 bad_type(arg, "symbol", gv_ename(namegv), o2);
5981 if (o2->op_type != OP_RV2CV)
5982 bad_type(arg, "sub", gv_ename(namegv), o2);
5985 if (o2->op_type != OP_RV2SV
5986 && o2->op_type != OP_PADSV
5987 && o2->op_type != OP_HELEM
5988 && o2->op_type != OP_AELEM
5989 && o2->op_type != OP_THREADSV)
5991 bad_type(arg, "scalar", gv_ename(namegv), o2);
5995 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5996 bad_type(arg, "array", gv_ename(namegv), o2);
5999 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6000 bad_type(arg, "hash", gv_ename(namegv), o2);
6004 OP* sib = kid->op_sibling;
6005 kid->op_sibling = 0;
6006 o2 = newUNOP(OP_REFGEN, 0, kid);
6007 o2->op_sibling = sib;
6008 prev->op_sibling = o2;
6019 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6020 gv_ename(namegv), SvPV((SV*)cv, n_a));
6025 mod(o2, OP_ENTERSUB);
6027 o2 = o2->op_sibling;
6029 if (proto && !optional &&
6030 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6031 return too_few_arguments(o, gv_ename(namegv));
6036 Perl_ck_svconst(pTHX_ OP *o)
6038 SvREADONLY_on(cSVOPo->op_sv);
6043 Perl_ck_trunc(pTHX_ OP *o)
6045 if (o->op_flags & OPf_KIDS) {
6046 SVOP *kid = (SVOP*)cUNOPo->op_first;
6048 if (kid->op_type == OP_NULL)
6049 kid = (SVOP*)kid->op_sibling;
6050 if (kid && kid->op_type == OP_CONST &&
6051 (kid->op_private & OPpCONST_BARE))
6053 o->op_flags |= OPf_SPECIAL;
6054 kid->op_private &= ~OPpCONST_STRICT;
6060 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6063 Perl_peep(pTHX_ register OP *o)
6066 register OP* oldop = 0;
6068 OP *last_composite = Nullop;
6070 if (!o || o->op_seq)
6074 SAVESPTR(PL_curcop);
6075 for (; o; o = o->op_next) {
6081 switch (o->op_type) {
6085 PL_curcop = ((COP*)o); /* for warnings */
6086 o->op_seq = PL_op_seqmax++;
6087 last_composite = Nullop;
6091 if (cSVOPo->op_private & OPpCONST_STRICT)
6092 no_bareword_allowed(o);
6098 if ( o->op_next && o->op_next->op_type == OP_STRINGIFY
6099 && !(o->op_next->op_private & OPpTARGET_MY) )
6101 o->op_seq = PL_op_seqmax++;
6106 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6107 if (o->op_next->op_private & OPpTARGET_MY) {
6108 if ((o->op_flags & OPf_STACKED) /* chained concats */
6109 || (o->op_type == OP_CONCAT
6110 /* Concat has problems if target is equal to right arg. */
6111 && (((LISTOP*)o)->op_first->op_sibling->op_type
6113 && (((LISTOP*)o)->op_first->op_sibling->op_targ
6114 == o->op_next->op_targ)))
6116 goto ignore_optimization;
6119 o->op_targ = o->op_next->op_targ;
6120 o->op_next->op_targ = 0;
6121 o->op_private |= OPpTARGET_MY;
6126 ignore_optimization:
6127 o->op_seq = PL_op_seqmax++;
6130 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6131 o->op_seq = PL_op_seqmax++;
6132 break; /* Scalar stub must produce undef. List stub is noop */
6136 if (o->op_targ == OP_NEXTSTATE
6137 || o->op_targ == OP_DBSTATE
6138 || o->op_targ == OP_SETSTATE)
6140 PL_curcop = ((COP*)o);
6147 if (oldop && o->op_next) {
6148 oldop->op_next = o->op_next;
6151 o->op_seq = PL_op_seqmax++;
6155 if (o->op_next->op_type == OP_RV2SV) {
6156 if (!(o->op_next->op_private & OPpDEREF)) {
6158 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
6159 o->op_next = o->op_next->op_next;
6160 o->op_type = OP_GVSV;
6161 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6164 else if (o->op_next->op_type == OP_RV2AV) {
6165 OP* pop = o->op_next->op_next;
6167 if (pop->op_type == OP_CONST &&
6168 (PL_op = pop->op_next) &&
6169 pop->op_next->op_type == OP_AELEM &&
6170 !(pop->op_next->op_private &
6171 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6172 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6180 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6181 o->op_next = pop->op_next->op_next;
6182 o->op_type = OP_AELEMFAST;
6183 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6184 o->op_private = (U8)i;
6189 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_UNSAFE)) {
6191 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6192 /* XXX could check prototype here instead of just carping */
6193 SV *sv = sv_newmortal();
6194 gv_efullname3(sv, gv, Nullch);
6195 Perl_warner(aTHX_ WARN_UNSAFE,
6196 "%s() called too early to check prototype",
6201 o->op_seq = PL_op_seqmax++;
6212 o->op_seq = PL_op_seqmax++;
6213 while (cLOGOP->op_other->op_type == OP_NULL)
6214 cLOGOP->op_other = cLOGOP->op_other->op_next;
6215 peep(cLOGOP->op_other);
6219 o->op_seq = PL_op_seqmax++;
6220 peep(cLOOP->op_redoop);
6221 peep(cLOOP->op_nextop);
6222 peep(cLOOP->op_lastop);
6228 o->op_seq = PL_op_seqmax++;
6229 peep(cPMOP->op_pmreplstart);
6233 o->op_seq = PL_op_seqmax++;
6234 if (ckWARN(WARN_SYNTAX) && o->op_next
6235 && o->op_next->op_type == OP_NEXTSTATE) {
6236 if (o->op_next->op_sibling &&
6237 o->op_next->op_sibling->op_type != OP_EXIT &&
6238 o->op_next->op_sibling->op_type != OP_WARN &&
6239 o->op_next->op_sibling->op_type != OP_DIE) {
6240 line_t oldline = PL_curcop->cop_line;
6242 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
6243 Perl_warner(aTHX_ WARN_SYNTAX, "Statement unlikely to be reached");
6244 Perl_warner(aTHX_ WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
6245 PL_curcop->cop_line = oldline;
6259 if ((o->op_private & (OPpLVAL_INTRO))
6260 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6262 rop = (UNOP*)((BINOP*)o)->op_first;
6263 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6265 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6266 if (!SvOBJECT(lexname))
6268 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6269 if (!fields || !GvHV(*fields))
6271 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
6272 key = SvPV(*svp, keylen);
6273 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6275 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6276 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6278 ind = SvIV(*indsvp);
6280 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6281 rop->op_type = OP_RV2AV;
6282 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6283 o->op_type = OP_AELEM;
6284 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6286 *svp = newSViv(ind);
6292 if (!(o->op_flags & OPf_WANT)
6293 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6297 o->op_seq = PL_op_seqmax++;
6301 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6302 o->op_seq = PL_op_seqmax++;
6308 if (last_composite) {
6309 OP *r = last_composite;
6311 while (r->op_sibling)
6314 || (r->op_next->op_type == OP_LIST
6315 && r->op_next->op_next == o))
6317 if (last_composite->op_type == OP_RV2AV)
6318 yyerror("Lvalue subs returning arrays not implemented yet");
6320 yyerror("Lvalue subs returning hashes not implemented yet");
6327 o->op_seq = PL_op_seqmax++;