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 */
25 #ifdef PL_OP_SLAB_ALLOC
26 #define SLAB_SIZE 8192
27 static char *PL_OpPtr = NULL;
28 static int PL_OpSpace = 0;
29 #define NewOp(m,var,c,type) do { if ((PL_OpSpace -= c*sizeof(type)) >= 0) \
30 var = (type *)(PL_OpPtr -= c*sizeof(type)); \
32 var = (type *) Slab_Alloc(m,c*sizeof(type)); \
36 S_Slab_Alloc(pTHX_ int m, size_t sz)
38 Newz(m,PL_OpPtr,SLAB_SIZE,char);
39 PL_OpSpace = SLAB_SIZE - sz;
40 return PL_OpPtr += PL_OpSpace;
44 #define NewOp(m, var, c, type) Newz(m, var, c, type)
47 * In the following definition, the ", Nullop" is just to make the compiler
48 * think the expression is of the right type: croak actually does a Siglongjmp.
50 #define CHECKOP(type,o) \
51 ((PL_op_mask && PL_op_mask[type]) \
52 ? ( op_free((OP*)o), \
53 Perl_croak(aTHX_ "%s trapped by operation mask", PL_op_desc[type]), \
55 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
57 #define PAD_MAX 999999999
60 S_gv_ename(pTHX_ GV *gv)
63 SV* tmpsv = sv_newmortal();
64 gv_efullname3(tmpsv, gv, Nullch);
65 return SvPV(tmpsv,n_a);
69 S_no_fh_allowed(pTHX_ OP *o)
71 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
72 PL_op_desc[o->op_type]));
77 S_too_few_arguments(pTHX_ OP *o, char *name)
79 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
84 S_too_many_arguments(pTHX_ OP *o, char *name)
86 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
91 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
93 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
94 (int)n, name, t, PL_op_desc[kid->op_type]));
98 S_no_bareword_allowed(pTHX_ OP *o)
100 qerror(Perl_mess(aTHX_
101 "Bareword \"%s\" not allowed while \"strict subs\" in use",
102 SvPV_nolen(cSVOPo->op_sv)));
105 /* "register" allocation */
108 Perl_pad_allocmy(pTHX_ char *name)
115 PL_in_my == KEY_our ||
117 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
118 name[1] == '_' && (int)strlen(name) > 2 ))
120 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
121 /* 1999-02-27 mjd@plover.com */
123 p = strchr(name, '\0');
124 /* The next block assumes the buffer is at least 205 chars
125 long. At present, it's always at least 256 chars. */
127 strcpy(name+200, "...");
133 /* Move everything else down one character */
134 for (; p-name > 2; p--)
136 name[2] = toCTRL(name[1]);
139 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
141 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
142 SV **svp = AvARRAY(PL_comppad_name);
143 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
145 && sv != &PL_sv_undef
146 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
147 && strEQ(name, SvPVX(sv)))
149 Perl_warner(aTHX_ WARN_UNSAFE,
150 "\"%s\" variable %s masks earlier declaration in same %s",
151 (PL_in_my == KEY_our ? "our" : "my"),
153 (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
158 off = pad_alloc(OP_PADSV, SVs_PADMY);
160 sv_upgrade(sv, SVt_PVNV);
162 if (PL_in_my_stash) {
164 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"my\"",
167 (void)SvUPGRADE(sv, SVt_PVMG);
168 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
171 if (PL_in_my == KEY_our)
172 SvFLAGS(sv) |= SVpad_OUR;
173 av_store(PL_comppad_name, off, sv);
174 SvNVX(sv) = (NV)PAD_MAX;
175 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
176 if (!PL_min_intro_pending)
177 PL_min_intro_pending = off;
178 PL_max_intro_pending = off;
180 av_store(PL_comppad, off, (SV*)newAV());
181 else if (*name == '%')
182 av_store(PL_comppad, off, (SV*)newHV());
183 SvPADMY_on(PL_curpad[off]);
187 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
190 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
191 I32 cx_ix, I32 saweval, U32 flags)
198 register PERL_CONTEXT *cx;
200 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
201 AV *curlist = CvPADLIST(cv);
202 SV **svp = av_fetch(curlist, 0, FALSE);
205 if (!svp || *svp == &PL_sv_undef)
208 svp = AvARRAY(curname);
209 for (off = AvFILLp(curname); off > 0; off--) {
210 if ((sv = svp[off]) &&
211 sv != &PL_sv_undef &&
213 seq > I_32(SvNVX(sv)) &&
214 strEQ(SvPVX(sv), name))
225 return 0; /* don't clone from inactive stack frame */
229 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
230 oldsv = *av_fetch(oldpad, off, TRUE);
231 if (!newoff) { /* Not a mere clone operation. */
232 SV *namesv = NEWSV(1103,0);
233 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
234 sv_upgrade(namesv, SVt_PVNV);
235 sv_setpv(namesv, name);
236 av_store(PL_comppad_name, newoff, namesv);
237 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
238 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
239 SvFAKE_on(namesv); /* A ref, not a real var */
240 if (SvFLAGS(sv) & SVpad_OUR)/* An "our" variable */
241 SvFLAGS(namesv) |= SVpad_OUR;
242 if (SvOBJECT(sv)) { /* A typed var */
244 (void)SvUPGRADE(namesv, SVt_PVMG);
245 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
248 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
249 /* "It's closures all the way down." */
250 CvCLONE_on(PL_compcv);
252 if (CvANON(PL_compcv))
253 oldsv = Nullsv; /* no need to keep ref */
258 bcv && bcv != cv && !CvCLONE(bcv);
259 bcv = CvOUTSIDE(bcv))
264 if (ckWARN(WARN_CLOSURE)
265 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
267 Perl_warner(aTHX_ WARN_CLOSURE,
268 "Variable \"%s\" may be unavailable",
276 else if (!CvUNIQUE(PL_compcv)) {
277 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
278 Perl_warner(aTHX_ WARN_CLOSURE,
279 "Variable \"%s\" will not stay shared", name);
282 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
288 if (flags & FINDLEX_NOSEARCH)
291 /* Nothing in current lexical context--try eval's context, if any.
292 * This is necessary to let the perldb get at lexically scoped variables.
293 * XXX This will also probably interact badly with eval tree caching.
296 for (i = cx_ix; i >= 0; i--) {
298 switch (CxTYPE(cx)) {
300 if (i == 0 && saweval) {
301 seq = cxstack[saweval].blk_oldcop->cop_seq;
302 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
306 switch (cx->blk_eval.old_op_type) {
312 /* require must have its own scope */
320 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
321 saweval = i; /* so we know where we were called from */
324 seq = cxstack[saweval].blk_oldcop->cop_seq;
325 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
333 Perl_pad_findmy(pTHX_ char *name)
339 SV **svp = AvARRAY(PL_comppad_name);
340 U32 seq = PL_cop_seqmax;
346 * Special case to get lexical (and hence per-thread) @_.
347 * XXX I need to find out how to tell at parse-time whether use
348 * of @_ should refer to a lexical (from a sub) or defgv (global
349 * scope and maybe weird sub-ish things like formats). See
350 * startsub in perly.y. It's possible that @_ could be lexical
351 * (at least from subs) even in non-threaded perl.
353 if (strEQ(name, "@_"))
354 return 0; /* success. (NOT_IN_PAD indicates failure) */
355 #endif /* USE_THREADS */
357 /* The one we're looking for is probably just before comppad_name_fill. */
358 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
359 if ((sv = svp[off]) &&
360 sv != &PL_sv_undef &&
363 seq > I_32(SvNVX(sv)))) &&
364 strEQ(SvPVX(sv), name))
366 if (SvIVX(sv) || SvFLAGS(sv) & SVpad_OUR)
367 return (PADOFFSET)off;
368 pendoff = off; /* this pending def. will override import */
372 outside = CvOUTSIDE(PL_compcv);
374 /* Check if if we're compiling an eval'', and adjust seq to be the
375 * eval's seq number. This depends on eval'' having a non-null
376 * CvOUTSIDE() while it is being compiled. The eval'' itself is
377 * identified by CvEVAL being true and CvGV being null. */
378 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
379 cx = &cxstack[cxstack_ix];
381 seq = cx->blk_oldcop->cop_seq;
384 /* See if it's in a nested scope */
385 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
387 /* If there is a pending local definition, this new alias must die */
389 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
390 return off; /* pad_findlex returns 0 for failure...*/
392 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
396 Perl_pad_leavemy(pTHX_ I32 fill)
400 SV **svp = AvARRAY(PL_comppad_name);
402 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
403 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
404 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
405 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
408 /* "Deintroduce" my variables that are leaving with this scope. */
409 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
410 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
411 SvIVX(sv) = PL_cop_seqmax;
416 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
422 if (AvARRAY(PL_comppad) != PL_curpad)
423 Perl_croak(aTHX_ "panic: pad_alloc");
424 if (PL_pad_reset_pending)
426 if (tmptype & SVs_PADMY) {
428 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
429 } while (SvPADBUSY(sv)); /* need a fresh one */
430 retval = AvFILLp(PL_comppad);
433 SV **names = AvARRAY(PL_comppad_name);
434 SSize_t names_fill = AvFILLp(PL_comppad_name);
437 * "foreach" index vars temporarily become aliases to non-"my"
438 * values. Thus we must skip, not just pad values that are
439 * marked as current pad values, but also those with names.
441 if (++PL_padix <= names_fill &&
442 (sv = names[PL_padix]) && sv != &PL_sv_undef)
444 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
445 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
450 SvFLAGS(sv) |= tmptype;
451 PL_curpad = AvARRAY(PL_comppad);
453 DEBUG_X(PerlIO_printf(Perl_debug_log,
454 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
455 PTR2UV(thr), PTR2UV(PL_curpad),
456 (long) retval, PL_op_name[optype]));
458 DEBUG_X(PerlIO_printf(Perl_debug_log,
459 "Pad 0x%"UVxf" alloc %ld for %s\n",
461 (long) retval, PL_op_name[optype]));
462 #endif /* USE_THREADS */
463 return (PADOFFSET)retval;
467 Perl_pad_sv(pTHX_ PADOFFSET po)
471 DEBUG_X(PerlIO_printf(Perl_debug_log,
472 "0x%"UVxf" Pad 0x%"UVxf" sv %d\n",
473 PTR2UV(thr), PTR2UV(PL_curpad), po));
476 Perl_croak(aTHX_ "panic: pad_sv po");
477 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %d\n",
478 PTR2UV(PL_curpad), po));
479 #endif /* USE_THREADS */
480 return PL_curpad[po]; /* eventually we'll turn this into a macro */
484 Perl_pad_free(pTHX_ PADOFFSET po)
489 if (AvARRAY(PL_comppad) != PL_curpad)
490 Perl_croak(aTHX_ "panic: pad_free curpad");
492 Perl_croak(aTHX_ "panic: pad_free po");
494 DEBUG_X(PerlIO_printf(Perl_debug_log,
495 "0x%"UVxf" Pad 0x%"UVxf" free %d\n",
496 PTR2UV(thr), PTR2UV(PL_curpad), po));
498 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %d\n",
499 PTR2UV(PL_curpad), po));
500 #endif /* USE_THREADS */
501 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
502 SvPADTMP_off(PL_curpad[po]);
503 if ((I32)po < PL_padix)
508 Perl_pad_swipe(pTHX_ PADOFFSET po)
511 if (AvARRAY(PL_comppad) != PL_curpad)
512 Perl_croak(aTHX_ "panic: pad_swipe curpad");
514 Perl_croak(aTHX_ "panic: pad_swipe po");
516 DEBUG_X(PerlIO_printf(Perl_debug_log,
517 "0x%"UVxf" Pad 0x%"UVxf" swipe %d\n",
518 PTR2UV(thr), PTR2UV(PL_curpad), po));
520 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %d\n",
521 PTR2UV(PL_curpad), po));
522 #endif /* USE_THREADS */
523 SvPADTMP_off(PL_curpad[po]);
524 PL_curpad[po] = NEWSV(1107,0);
525 SvPADTMP_on(PL_curpad[po]);
526 if ((I32)po < PL_padix)
530 /* XXX pad_reset() is currently disabled because it results in serious bugs.
531 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
532 * on the stack by OPs that use them, there are several ways to get an alias
533 * to a shared TARG. Such an alias will change randomly and unpredictably.
534 * We avoid doing this until we can think of a Better Way.
539 #ifdef USE_BROKEN_PAD_RESET
543 if (AvARRAY(PL_comppad) != PL_curpad)
544 Perl_croak(aTHX_ "panic: pad_reset curpad");
546 DEBUG_X(PerlIO_printf(Perl_debug_log,
547 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
548 PTR2UV(thr), PTR2UV(PL_curpad)));
550 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
552 #endif /* USE_THREADS */
553 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
554 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
555 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
556 SvPADTMP_off(PL_curpad[po]);
558 PL_padix = PL_padix_floor;
561 PL_pad_reset_pending = FALSE;
565 /* find_threadsv is not reentrant */
567 Perl_find_threadsv(pTHX_ const char *name)
573 /* We currently only handle names of a single character */
574 p = strchr(PL_threadsv_names, *name);
577 key = p - PL_threadsv_names;
578 MUTEX_LOCK(&thr->mutex);
579 svp = av_fetch(thr->threadsv, key, FALSE);
581 MUTEX_UNLOCK(&thr->mutex);
583 SV *sv = NEWSV(0, 0);
584 av_store(thr->threadsv, key, sv);
585 thr->threadsvp = AvARRAY(thr->threadsv);
586 MUTEX_UNLOCK(&thr->mutex);
588 * Some magic variables used to be automagically initialised
589 * in gv_fetchpv. Those which are now per-thread magicals get
590 * initialised here instead.
596 sv_setpv(sv, "\034");
597 sv_magic(sv, 0, 0, name, 1);
602 PL_sawampersand = TRUE;
616 /* XXX %! tied to Errno.pm needs to be added here.
617 * See gv_fetchpv(). */
621 sv_magic(sv, 0, 0, name, 1);
623 DEBUG_S(PerlIO_printf(Perl_error_log,
624 "find_threadsv: new SV %p for $%s%c\n",
625 sv, (*name < 32) ? "^" : "",
626 (*name < 32) ? toCTRL(*name) : *name));
630 #endif /* USE_THREADS */
635 Perl_op_free(pTHX_ OP *o)
637 register OP *kid, *nextkid;
640 if (!o || o->op_seq == (U16)-1)
643 if (o->op_flags & OPf_KIDS) {
644 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
645 nextkid = kid->op_sibling; /* Get before next freeing kid */
653 /* COP* is not cleared by op_clear() so that we may track line
654 * numbers etc even after null() */
655 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
660 #ifdef PL_OP_SLAB_ALLOC
661 if ((char *) o == PL_OpPtr)
670 S_op_clear(pTHX_ OP *o)
672 switch (o->op_type) {
673 case OP_NULL: /* Was holding old type, if any. */
674 case OP_ENTEREVAL: /* Was holding hints. */
676 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
682 if (!(o->op_flags & OPf_SPECIAL))
685 #endif /* USE_THREADS */
687 if (!(o->op_flags & OPf_REF)
688 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
694 SvREFCNT_dec(cGVOPo->op_gv);
695 cGVOPo->op_gv = Nullgv;
698 SvREFCNT_dec(cSVOPo->op_sv);
699 cSVOPo->op_sv = Nullsv;
705 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
709 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
710 SvREFCNT_dec(cSVOPo->op_sv);
711 cSVOPo->op_sv = Nullsv;
714 Safefree(cPVOPo->op_pv);
715 cPVOPo->op_pv = Nullch;
719 op_free(cPMOPo->op_pmreplroot);
720 cPMOPo->op_pmreplroot = Nullop;
725 ReREFCNT_dec(cPMOPo->op_pmregexp);
726 cPMOPo->op_pmregexp = (REGEXP*)NULL;
731 pad_free(o->op_targ);
735 S_cop_free(pTHX_ COP* cop)
737 Safefree(cop->cop_label);
738 SvREFCNT_dec(cop->cop_filegv);
739 if (! specialWARN(cop->cop_warnings))
740 SvREFCNT_dec(cop->cop_warnings);
746 if (o->op_type == OP_NULL)
749 o->op_targ = o->op_type;
750 o->op_type = OP_NULL;
751 o->op_ppaddr = PL_ppaddr[OP_NULL];
754 /* Contextualizers */
756 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
759 Perl_linklist(pTHX_ OP *o)
766 /* establish postfix order */
767 if (cUNOPo->op_first) {
768 o->op_next = LINKLIST(cUNOPo->op_first);
769 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
771 kid->op_next = LINKLIST(kid->op_sibling);
783 Perl_scalarkids(pTHX_ OP *o)
786 if (o && o->op_flags & OPf_KIDS) {
787 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
794 S_scalarboolean(pTHX_ OP *o)
796 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
798 if (ckWARN(WARN_SYNTAX)) {
799 line_t oldline = PL_curcop->cop_line;
801 if (PL_copline != NOLINE)
802 PL_curcop->cop_line = PL_copline;
803 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
804 PL_curcop->cop_line = oldline;
811 Perl_scalar(pTHX_ OP *o)
815 /* assumes no premature commitment */
816 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
817 || o->op_type == OP_RETURN)
820 if ((o->op_private & OPpTARGET_MY)
821 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
822 return scalar(o); /* As if inside SASSIGN */
824 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
826 switch (o->op_type) {
828 if (o->op_private & OPpREPEAT_DOLIST)
829 null(((LISTOP*)cBINOPo->op_first)->op_first);
830 scalar(cBINOPo->op_first);
835 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
839 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
840 if (!kPMOP->op_pmreplroot)
841 deprecate("implicit split to @_");
849 if (o->op_flags & OPf_KIDS) {
850 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
856 kid = cLISTOPo->op_first;
858 while (kid = kid->op_sibling) {
864 WITH_THR(PL_curcop = &PL_compiling);
869 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
875 WITH_THR(PL_curcop = &PL_compiling);
882 Perl_scalarvoid(pTHX_ OP *o)
889 if (o->op_type == OP_NEXTSTATE
890 || o->op_type == OP_SETSTATE
891 || o->op_type == OP_DBSTATE
892 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
893 || o->op_targ == OP_SETSTATE
894 || o->op_targ == OP_DBSTATE)))
897 PL_curcop = (COP*)o; /* for warning below */
900 /* assumes no premature commitment */
901 want = o->op_flags & OPf_WANT;
902 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
903 || o->op_type == OP_RETURN)
906 if ((o->op_private & OPpTARGET_MY)
907 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
908 return scalar(o); /* As if inside SASSIGN */
910 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
912 switch (o->op_type) {
914 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
918 if (o->op_flags & OPf_STACKED)
922 if (o->op_private == 4)
993 if (!(o->op_private & OPpLVAL_INTRO))
994 useless = PL_op_desc[o->op_type];
1001 if (!(o->op_private & OPpLVAL_INTRO) &&
1002 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1003 useless = "a variable";
1008 if (cSVOPo->op_private & OPpCONST_STRICT)
1009 no_bareword_allowed(o);
1012 if (ckWARN(WARN_VOID)) {
1013 useless = "a constant";
1014 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1016 else if (SvPOK(sv)) {
1017 if (strnEQ(SvPVX(sv), "di", 2) ||
1018 strnEQ(SvPVX(sv), "ds", 2) ||
1019 strnEQ(SvPVX(sv), "ig", 2))
1024 null(o); /* don't execute or even remember it */
1028 o->op_type = OP_PREINC; /* pre-increment is faster */
1029 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1033 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1034 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1040 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1045 if (o->op_flags & OPf_STACKED)
1053 if (!(o->op_flags & OPf_KIDS))
1062 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1069 /* all requires must return a boolean value */
1070 o->op_flags &= ~OPf_WANT;
1073 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1074 if (!kPMOP->op_pmreplroot)
1075 deprecate("implicit split to @_");
1081 if (ckWARN(WARN_VOID))
1082 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1088 Perl_listkids(pTHX_ OP *o)
1091 if (o && o->op_flags & OPf_KIDS) {
1092 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1099 Perl_list(pTHX_ OP *o)
1103 /* assumes no premature commitment */
1104 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1105 || o->op_type == OP_RETURN)
1108 if ((o->op_private & OPpTARGET_MY)
1109 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
1110 return o; /* As if inside SASSIGN */
1112 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1114 switch (o->op_type) {
1117 list(cBINOPo->op_first);
1122 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1130 if (!(o->op_flags & OPf_KIDS))
1132 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1133 list(cBINOPo->op_first);
1134 return gen_constant_list(o);
1141 kid = cLISTOPo->op_first;
1143 while (kid = kid->op_sibling) {
1144 if (kid->op_sibling)
1149 WITH_THR(PL_curcop = &PL_compiling);
1153 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1154 if (kid->op_sibling)
1159 WITH_THR(PL_curcop = &PL_compiling);
1162 /* all requires must return a boolean value */
1163 o->op_flags &= ~OPf_WANT;
1170 Perl_scalarseq(pTHX_ OP *o)
1175 if (o->op_type == OP_LINESEQ ||
1176 o->op_type == OP_SCOPE ||
1177 o->op_type == OP_LEAVE ||
1178 o->op_type == OP_LEAVETRY)
1181 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1182 if (kid->op_sibling) {
1186 PL_curcop = &PL_compiling;
1188 o->op_flags &= ~OPf_PARENS;
1189 if (PL_hints & HINT_BLOCK_SCOPE)
1190 o->op_flags |= OPf_PARENS;
1193 o = newOP(OP_STUB, 0);
1198 S_modkids(pTHX_ OP *o, I32 type)
1201 if (o && o->op_flags & OPf_KIDS) {
1202 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1209 Perl_mod(pTHX_ OP *o, I32 type)
1216 if (!o || PL_error_count)
1219 if ((o->op_private & OPpTARGET_MY)
1220 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
1223 switch (o->op_type) {
1228 if (!(o->op_private & (OPpCONST_ARYBASE)))
1230 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1231 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1235 SAVEI32(PL_compiling.cop_arybase);
1236 PL_compiling.cop_arybase = 0;
1238 else if (type == OP_REFGEN)
1241 Perl_croak(aTHX_ "That use of $[ is unsupported");
1244 if (o->op_flags & OPf_PARENS)
1248 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1249 !(o->op_flags & OPf_STACKED)) {
1250 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1251 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1252 assert(cUNOPo->op_first->op_type == OP_NULL);
1253 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1256 else { /* lvalue subroutine call */
1257 o->op_private |= OPpLVAL_INTRO;
1258 if (type == OP_GREPSTART || type == OP_ENTERSUB) {
1259 /* Backward compatibility mode: */
1260 o->op_private |= OPpENTERSUB_INARGS;
1263 else { /* Compile-time error message: */
1264 OP *kid = cUNOPo->op_first;
1268 if (kid->op_type == OP_PUSHMARK)
1270 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1272 "panic: unexpected lvalue entersub "
1273 "args: type/targ %ld:%ld",
1274 (long)kid->op_type,kid->op_targ);
1275 kid = kLISTOP->op_first;
1277 while (kid->op_sibling)
1278 kid = kid->op_sibling;
1279 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1281 if (kid->op_type == OP_METHOD_NAMED
1282 || kid->op_type == OP_METHOD)
1286 if (kid->op_sibling || kid->op_next != kid) {
1287 yyerror("panic: unexpected optree near method call");
1291 NewOp(1101, newop, 1, OP);
1292 newop->op_type = OP_RV2CV;
1293 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1294 newop->op_next = newop;
1295 kid->op_sibling = newop;
1296 newop->op_private |= OPpLVAL_INTRO;
1300 if (kid->op_type != OP_RV2CV)
1302 "panic: unexpected lvalue entersub "
1303 "entry via type/targ %ld:%ld",
1304 (long)kid->op_type,kid->op_targ);
1305 kid->op_private |= OPpLVAL_INTRO;
1306 break; /* Postpone until runtime */
1310 kid = kUNOP->op_first;
1311 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1312 kid = kUNOP->op_first;
1313 if (kid->op_type == OP_NULL)
1315 "Unexpected constant lvalue entersub "
1316 "entry via type/targ %ld:%ld",
1317 (long)kid->op_type,kid->op_targ);
1318 if (kid->op_type != OP_GV) {
1319 /* Restore RV2CV to check lvalueness */
1321 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1322 okid->op_next = kid->op_next;
1323 kid->op_next = okid;
1326 okid->op_next = Nullop;
1327 okid->op_type = OP_RV2CV;
1329 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1330 okid->op_private |= OPpLVAL_INTRO;
1334 cv = GvCV(kGVOP->op_gv);
1344 /* grep, foreach, subcalls, refgen */
1345 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1347 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1348 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1350 : (o->op_type == OP_ENTERSUB
1351 ? "non-lvalue subroutine call"
1352 : PL_op_desc[o->op_type])),
1353 type ? PL_op_desc[type] : "local"));
1367 case OP_RIGHT_SHIFT:
1376 if (!(o->op_flags & OPf_STACKED))
1382 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1388 if (!type && cUNOPo->op_first->op_type != OP_GV)
1389 Perl_croak(aTHX_ "Can't localize through a reference");
1390 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1391 PL_modcount = 10000;
1392 return o; /* Treat \(@foo) like ordinary list. */
1396 if (scalar_mod_type(o, type))
1398 ref(cUNOPo->op_first, o->op_type);
1407 PL_modcount = 10000;
1410 if (!type && cUNOPo->op_first->op_type != OP_GV)
1411 Perl_croak(aTHX_ "Can't localize through a reference");
1412 ref(cUNOPo->op_first, o->op_type);
1416 PL_hints |= HINT_BLOCK_SCOPE;
1426 PL_modcount = 10000;
1427 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1428 return o; /* Treat \(@foo) like ordinary list. */
1429 if (scalar_mod_type(o, type))
1435 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1436 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1441 PL_modcount++; /* XXX ??? */
1443 #endif /* USE_THREADS */
1449 if (type != OP_SASSIGN)
1453 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1459 pad_free(o->op_targ);
1460 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1461 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1462 if (o->op_flags & OPf_KIDS)
1463 mod(cBINOPo->op_first->op_sibling, type);
1468 ref(cBINOPo->op_first, o->op_type);
1469 if (type == OP_ENTERSUB &&
1470 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1471 o->op_private |= OPpLVAL_DEFER;
1478 if (o->op_flags & OPf_KIDS)
1479 mod(cLISTOPo->op_last, type);
1483 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1485 else if (!(o->op_flags & OPf_KIDS))
1487 if (o->op_targ != OP_LIST) {
1488 mod(cBINOPo->op_first, type);
1493 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1497 o->op_flags |= OPf_MOD;
1499 if (type == OP_AASSIGN || type == OP_SASSIGN)
1500 o->op_flags |= OPf_SPECIAL|OPf_REF;
1502 o->op_private |= OPpLVAL_INTRO;
1503 o->op_flags &= ~OPf_SPECIAL;
1504 PL_hints |= HINT_BLOCK_SCOPE;
1506 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1507 o->op_flags |= OPf_REF;
1512 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1516 if (o->op_type == OP_RV2GV)
1540 case OP_RIGHT_SHIFT:
1559 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1561 switch (o->op_type) {
1569 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1582 Perl_refkids(pTHX_ OP *o, I32 type)
1585 if (o && o->op_flags & OPf_KIDS) {
1586 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1593 Perl_ref(pTHX_ OP *o, I32 type)
1597 if (!o || PL_error_count)
1600 switch (o->op_type) {
1602 if ((type == OP_DEFINED || type == OP_LOCK) &&
1603 !(o->op_flags & OPf_STACKED)) {
1604 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1605 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1606 assert(cUNOPo->op_first->op_type == OP_NULL);
1607 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1608 o->op_flags |= OPf_SPECIAL;
1613 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1617 if (type == OP_DEFINED)
1618 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1619 ref(cUNOPo->op_first, o->op_type);
1622 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1623 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1624 : type == OP_RV2HV ? OPpDEREF_HV
1626 o->op_flags |= OPf_MOD;
1631 o->op_flags |= OPf_MOD; /* XXX ??? */
1636 o->op_flags |= OPf_REF;
1639 if (type == OP_DEFINED)
1640 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1641 ref(cUNOPo->op_first, o->op_type);
1646 o->op_flags |= OPf_REF;
1651 if (!(o->op_flags & OPf_KIDS))
1653 ref(cBINOPo->op_first, type);
1657 ref(cBINOPo->op_first, o->op_type);
1658 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1659 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1660 : type == OP_RV2HV ? OPpDEREF_HV
1662 o->op_flags |= OPf_MOD;
1670 if (!(o->op_flags & OPf_KIDS))
1672 ref(cLISTOPo->op_last, type);
1682 S_dup_attrlist(pTHX_ OP *o)
1686 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1687 * where the first kid is OP_PUSHMARK and the remaining ones
1688 * are OP_CONST. We need to push the OP_CONST values.
1690 if (o->op_type == OP_CONST)
1691 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1693 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1694 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1695 if (o->op_type == OP_CONST)
1696 rop = append_elem(OP_LIST, rop,
1697 newSVOP(OP_CONST, o->op_flags,
1698 SvREFCNT_inc(cSVOPo->op_sv)));
1705 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1707 OP *modname; /* for 'use' */
1710 /* fake up C<use attributes $pkg,$rv,@attrs> */
1711 ENTER; /* need to protect against side-effects of 'use' */
1713 if (stash && HvNAME(stash))
1714 stashsv = newSVpv(HvNAME(stash), 0);
1716 stashsv = &PL_sv_no;
1717 #define ATTRSMODULE "attributes"
1718 modname = newSVOP(OP_CONST, 0,
1719 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1));
1720 modname->op_private |= OPpCONST_BARE;
1721 /* that flag is required to make 'use' work right */
1722 utilize(1, start_subparse(FALSE, 0),
1723 Nullop, /* version */
1725 prepend_elem(OP_LIST,
1726 newSVOP(OP_CONST, 0, stashsv),
1727 prepend_elem(OP_LIST,
1728 newSVOP(OP_CONST, 0, newRV(target)),
1729 dup_attrlist(attrs))));
1734 S_my_kid(pTHX_ OP *o, OP *attrs)
1739 if (!o || PL_error_count)
1743 if (type == OP_LIST) {
1744 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1746 } else if (type == OP_UNDEF) {
1748 } else if (type == OP_RV2SV || /* "our" declaration */
1750 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1752 } else if (type != OP_PADSV &&
1755 type != OP_PUSHMARK)
1757 yyerror(Perl_form(aTHX_ "Can't declare %s in my", PL_op_desc[o->op_type]));
1760 else if (attrs && type != OP_PUSHMARK) {
1765 /* check for C<my Dog $spot> when deciding package */
1766 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1767 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1768 stash = SvSTASH(*namesvp);
1770 stash = PL_curstash;
1771 padsv = PAD_SV(o->op_targ);
1772 apply_attrs(stash, padsv, attrs);
1774 o->op_flags |= OPf_MOD;
1775 o->op_private |= OPpLVAL_INTRO;
1780 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1782 if (o->op_flags & OPf_PARENS)
1785 PL_in_my_stash = Nullhv;
1788 return my_kid(o, attrs);
1792 Perl_my(pTHX_ OP *o)
1794 return my_kid(o, Nullop);
1798 Perl_sawparens(pTHX_ OP *o)
1801 o->op_flags |= OPf_PARENS;
1806 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1811 if (ckWARN(WARN_UNSAFE) &&
1812 (left->op_type == OP_RV2AV ||
1813 left->op_type == OP_RV2HV ||
1814 left->op_type == OP_PADAV ||
1815 left->op_type == OP_PADHV)) {
1816 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1817 right->op_type == OP_TRANS)
1818 ? right->op_type : OP_MATCH];
1819 char *sample = ((left->op_type == OP_RV2AV ||
1820 left->op_type == OP_PADAV)
1821 ? "@array" : "%hash");
1822 Perl_warner(aTHX_ WARN_UNSAFE,
1823 "Applying %s to %s will act on scalar(%s)",
1824 desc, sample, sample);
1827 if (right->op_type == OP_MATCH ||
1828 right->op_type == OP_SUBST ||
1829 right->op_type == OP_TRANS) {
1830 right->op_flags |= OPf_STACKED;
1831 if (right->op_type != OP_MATCH)
1832 left = mod(left, right->op_type);
1833 if (right->op_type == OP_TRANS)
1834 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1836 o = prepend_elem(right->op_type, scalar(left), right);
1838 return newUNOP(OP_NOT, 0, scalar(o));
1842 return bind_match(type, left,
1843 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1847 Perl_invert(pTHX_ OP *o)
1851 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1852 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1856 Perl_scope(pTHX_ OP *o)
1859 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1860 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1861 o->op_type = OP_LEAVE;
1862 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1865 if (o->op_type == OP_LINESEQ) {
1867 o->op_type = OP_SCOPE;
1868 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1869 kid = ((LISTOP*)o)->op_first;
1870 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
1874 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1881 Perl_save_hints(pTHX)
1884 SAVESPTR(GvHV(PL_hintgv));
1885 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1886 SAVEFREESV(GvHV(PL_hintgv));
1890 Perl_block_start(pTHX_ int full)
1893 int retval = PL_savestack_ix;
1895 SAVEI32(PL_comppad_name_floor);
1897 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1898 PL_comppad_name_floor = PL_comppad_name_fill;
1900 PL_comppad_name_floor = 0;
1902 SAVEI32(PL_min_intro_pending);
1903 SAVEI32(PL_max_intro_pending);
1904 PL_min_intro_pending = 0;
1905 SAVEI32(PL_comppad_name_fill);
1906 SAVEI32(PL_padix_floor);
1907 PL_padix_floor = PL_padix;
1908 PL_pad_reset_pending = FALSE;
1910 PL_hints &= ~HINT_BLOCK_SCOPE;
1911 SAVEPPTR(PL_compiling.cop_warnings);
1912 if (! specialWARN(PL_compiling.cop_warnings)) {
1913 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1914 SAVEFREESV(PL_compiling.cop_warnings) ;
1922 Perl_block_end(pTHX_ I32 floor, OP *seq)
1925 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1926 OP* retval = scalarseq(seq);
1928 PL_pad_reset_pending = FALSE;
1929 PL_compiling.op_private = PL_hints;
1931 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1932 pad_leavemy(PL_comppad_name_fill);
1941 OP *o = newOP(OP_THREADSV, 0);
1942 o->op_targ = find_threadsv("_");
1945 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1946 #endif /* USE_THREADS */
1950 Perl_newPROG(pTHX_ OP *o)
1956 PL_eval_root = newUNOP(OP_LEAVEEVAL,
1957 ((PL_in_eval & EVAL_KEEPERR)
1958 ? OPf_SPECIAL : 0), o);
1959 PL_eval_start = linklist(PL_eval_root);
1960 PL_eval_root->op_next = 0;
1961 peep(PL_eval_start);
1966 PL_main_root = scope(sawparens(scalarvoid(o)));
1967 PL_curcop = &PL_compiling;
1968 PL_main_start = LINKLIST(PL_main_root);
1969 PL_main_root->op_next = 0;
1970 peep(PL_main_start);
1973 /* Register with debugger */
1975 CV *cv = get_cv("DB::postponed", FALSE);
1979 XPUSHs((SV*)PL_compiling.cop_filegv);
1981 call_sv((SV*)cv, G_DISCARD);
1988 Perl_localize(pTHX_ OP *o, I32 lex)
1990 if (o->op_flags & OPf_PARENS)
1994 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1996 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1997 if (*s == ';' || *s == '=')
1998 Perl_warner(aTHX_ WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1999 lex ? "my" : "local");
2003 PL_in_my_stash = Nullhv;
2007 return mod(o, OP_NULL); /* a bit kludgey */
2011 Perl_jmaybe(pTHX_ OP *o)
2013 if (o->op_type == OP_LIST) {
2016 o2 = newOP(OP_THREADSV, 0);
2017 o2->op_targ = find_threadsv(";");
2019 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2020 #endif /* USE_THREADS */
2021 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2027 Perl_fold_constants(pTHX_ register OP *o)
2031 I32 type = o->op_type;
2034 if (PL_opargs[type] & OA_RETSCALAR)
2036 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2037 o->op_targ = pad_alloc(type, SVs_PADTMP);
2039 /* integerize op, unless it happens to be C<-foo>.
2040 * XXX should pp_i_negate() do magic string negation instead? */
2041 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2042 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2043 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2045 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2048 if (!(PL_opargs[type] & OA_FOLDCONST))
2053 /* XXX might want a ck_negate() for this */
2054 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2067 if (o->op_private & OPpLOCALE)
2072 goto nope; /* Don't try to run w/ errors */
2074 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2075 if ((curop->op_type != OP_CONST ||
2076 (curop->op_private & OPpCONST_BARE)) &&
2077 curop->op_type != OP_LIST &&
2078 curop->op_type != OP_SCALAR &&
2079 curop->op_type != OP_NULL &&
2080 curop->op_type != OP_PUSHMARK)
2086 curop = LINKLIST(o);
2090 sv = *(PL_stack_sp--);
2091 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2092 pad_swipe(o->op_targ);
2093 else if (SvTEMP(sv)) { /* grab mortal temp? */
2094 (void)SvREFCNT_inc(sv);
2098 if (type == OP_RV2GV)
2099 return newGVOP(OP_GV, 0, (GV*)sv);
2101 /* try to smush double to int, but don't smush -2.0 to -2 */
2102 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2106 if ((NV)iv == SvNV(sv)) {
2111 SvIOK_off(sv); /* undo SvIV() damage */
2113 return newSVOP(OP_CONST, 0, sv);
2117 if (!(PL_opargs[type] & OA_OTHERINT))
2120 if (!(PL_hints & HINT_INTEGER)) {
2121 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
2124 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2125 if (curop->op_type == OP_CONST) {
2126 if (SvIOK(((SVOP*)curop)->op_sv))
2130 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2134 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2141 Perl_gen_constant_list(pTHX_ register OP *o)
2145 I32 oldtmps_floor = PL_tmps_floor;
2149 return o; /* Don't attempt to run with errors */
2151 PL_op = curop = LINKLIST(o);
2157 PL_tmps_floor = oldtmps_floor;
2159 o->op_type = OP_RV2AV;
2160 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2161 curop = ((UNOP*)o)->op_first;
2162 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2169 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2174 if (!o || o->op_type != OP_LIST)
2175 o = newLISTOP(OP_LIST, 0, o, Nullop);
2177 o->op_flags &= ~OPf_WANT;
2179 if (!(PL_opargs[type] & OA_MARK))
2180 null(cLISTOPo->op_first);
2183 o->op_ppaddr = PL_ppaddr[type];
2184 o->op_flags |= flags;
2186 o = CHECKOP(type, o);
2187 if (o->op_type != type)
2190 if (cLISTOPo->op_children < 7) {
2191 /* XXX do we really need to do this if we're done appending?? */
2192 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2194 cLISTOPo->op_last = last; /* in case check substituted last arg */
2197 return fold_constants(o);
2200 /* List constructors */
2203 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2211 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
2212 return newLISTOP(type, 0, first, last);
2214 if (first->op_flags & OPf_KIDS)
2215 ((LISTOP*)first)->op_last->op_sibling = last;
2217 first->op_flags |= OPf_KIDS;
2218 ((LISTOP*)first)->op_first = last;
2220 ((LISTOP*)first)->op_last = last;
2221 ((LISTOP*)first)->op_children++;
2226 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2234 if (first->op_type != type)
2235 return prepend_elem(type, (OP*)first, (OP*)last);
2237 if (last->op_type != type)
2238 return append_elem(type, (OP*)first, (OP*)last);
2240 first->op_last->op_sibling = last->op_first;
2241 first->op_last = last->op_last;
2242 first->op_children += last->op_children;
2243 if (first->op_children)
2244 first->op_flags |= OPf_KIDS;
2246 #ifdef PL_OP_SLAB_ALLOC
2254 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2262 if (last->op_type == type) {
2263 if (type == OP_LIST) { /* already a PUSHMARK there */
2264 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2265 ((LISTOP*)last)->op_first->op_sibling = first;
2268 if (!(last->op_flags & OPf_KIDS)) {
2269 ((LISTOP*)last)->op_last = first;
2270 last->op_flags |= OPf_KIDS;
2272 first->op_sibling = ((LISTOP*)last)->op_first;
2273 ((LISTOP*)last)->op_first = first;
2275 ((LISTOP*)last)->op_children++;
2279 return newLISTOP(type, 0, first, last);
2285 Perl_newNULLLIST(pTHX)
2287 return newOP(OP_STUB, 0);
2291 Perl_force_list(pTHX_ OP *o)
2293 if (!o || o->op_type != OP_LIST)
2294 o = newLISTOP(OP_LIST, 0, o, Nullop);
2300 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2304 NewOp(1101, listop, 1, LISTOP);
2306 listop->op_type = type;
2307 listop->op_ppaddr = PL_ppaddr[type];
2308 listop->op_children = (first != 0) + (last != 0);
2309 listop->op_flags = flags;
2313 else if (!first && last)
2316 first->op_sibling = last;
2317 listop->op_first = first;
2318 listop->op_last = last;
2319 if (type == OP_LIST) {
2321 pushop = newOP(OP_PUSHMARK, 0);
2322 pushop->op_sibling = first;
2323 listop->op_first = pushop;
2324 listop->op_flags |= OPf_KIDS;
2326 listop->op_last = pushop;
2328 else if (listop->op_children)
2329 listop->op_flags |= OPf_KIDS;
2335 Perl_newOP(pTHX_ I32 type, I32 flags)
2338 NewOp(1101, o, 1, OP);
2340 o->op_ppaddr = PL_ppaddr[type];
2341 o->op_flags = flags;
2344 o->op_private = 0 + (flags >> 8);
2345 if (PL_opargs[type] & OA_RETSCALAR)
2347 if (PL_opargs[type] & OA_TARGET)
2348 o->op_targ = pad_alloc(type, SVs_PADTMP);
2349 return CHECKOP(type, o);
2353 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2358 first = newOP(OP_STUB, 0);
2359 if (PL_opargs[type] & OA_MARK)
2360 first = force_list(first);
2362 NewOp(1101, unop, 1, UNOP);
2363 unop->op_type = type;
2364 unop->op_ppaddr = PL_ppaddr[type];
2365 unop->op_first = first;
2366 unop->op_flags = flags | OPf_KIDS;
2367 unop->op_private = 1 | (flags >> 8);
2368 unop = (UNOP*) CHECKOP(type, unop);
2372 return fold_constants((OP *) unop);
2376 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2379 NewOp(1101, binop, 1, BINOP);
2382 first = newOP(OP_NULL, 0);
2384 binop->op_type = type;
2385 binop->op_ppaddr = PL_ppaddr[type];
2386 binop->op_first = first;
2387 binop->op_flags = flags | OPf_KIDS;
2390 binop->op_private = 1 | (flags >> 8);
2393 binop->op_private = 2 | (flags >> 8);
2394 first->op_sibling = last;
2397 binop = (BINOP*)CHECKOP(type, binop);
2398 if (binop->op_next || binop->op_type != type)
2401 binop->op_last = binop->op_first->op_sibling;
2403 return fold_constants((OP *)binop);
2407 utf8compare(const void *a, const void *b)
2410 for (i = 0; i < 10; i++) {
2411 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2413 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2420 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2422 SV *tstr = ((SVOP*)expr)->op_sv;
2423 SV *rstr = ((SVOP*)repl)->op_sv;
2426 register U8 *t = (U8*)SvPV(tstr, tlen);
2427 register U8 *r = (U8*)SvPV(rstr, rlen);
2433 register short *tbl;
2435 complement = o->op_private & OPpTRANS_COMPLEMENT;
2436 del = o->op_private & OPpTRANS_DELETE;
2437 squash = o->op_private & OPpTRANS_SQUASH;
2439 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2440 SV* listsv = newSVpvn("# comment\n",10);
2442 U8* tend = t + tlen;
2443 U8* rend = r + rlen;
2459 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2460 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2466 New(1109, cp, tlen, U8*);
2468 transv = newSVpvn("",0);
2477 qsort(cp, i, sizeof(U8*), utf8compare);
2478 for (j = 0; j < i; j++) {
2480 UV val = utf8_to_uv(s, &ulen);
2482 diff = val - nextmin;
2484 t = uv_to_utf8(tmpbuf,nextmin);
2485 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2487 t = uv_to_utf8(tmpbuf, val - 1);
2488 sv_catpvn(transv, "\377", 1);
2489 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2493 val = utf8_to_uv(s+1, &ulen);
2497 t = uv_to_utf8(tmpbuf,nextmin);
2498 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2499 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2500 sv_catpvn(transv, "\377", 1);
2501 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2502 t = (U8*)SvPVX(transv);
2503 tlen = SvCUR(transv);
2506 else if (!rlen && !del) {
2507 r = t; rlen = tlen; rend = tend;
2510 if (to_utf && from_utf) { /* only counting characters */
2511 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2512 o->op_private |= OPpTRANS_IDENTICAL;
2514 else { /* straight latin-1 translation */
2515 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2516 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2517 o->op_private |= OPpTRANS_IDENTICAL;
2521 while (t < tend || tfirst <= tlast) {
2522 /* see if we need more "t" chars */
2523 if (tfirst > tlast) {
2524 tfirst = (I32)utf8_to_uv(t, &ulen);
2526 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2527 tlast = (I32)utf8_to_uv(++t, &ulen);
2534 /* now see if we need more "r" chars */
2535 if (rfirst > rlast) {
2537 rfirst = (I32)utf8_to_uv(r, &ulen);
2539 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2540 rlast = (I32)utf8_to_uv(++r, &ulen);
2549 rfirst = rlast = 0xffffffff;
2553 /* now see which range will peter our first, if either. */
2554 tdiff = tlast - tfirst;
2555 rdiff = rlast - rfirst;
2562 if (rfirst == 0xffffffff) {
2563 diff = tdiff; /* oops, pretend rdiff is infinite */
2565 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2567 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\tXXXX\n", tfirst);
2571 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2573 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2575 if (rfirst + diff > max)
2576 max = rfirst + diff;
2581 else if (rfirst <= 0x800)
2582 grows |= (tfirst < 0x80);
2583 else if (rfirst <= 0x10000)
2584 grows |= (tfirst < 0x800);
2585 else if (rfirst <= 0x200000)
2586 grows |= (tfirst < 0x10000);
2587 else if (rfirst <= 0x4000000)
2588 grows |= (tfirst < 0x200000);
2589 else if (rfirst <= 0x80000000)
2590 grows |= (tfirst < 0x4000000);
2602 else if (max > 0xff)
2607 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2608 SvREFCNT_dec(listsv);
2610 SvREFCNT_dec(transv);
2612 if (!del && havefinal)
2613 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2615 if (grows && to_utf)
2616 o->op_private |= OPpTRANS_GROWS;
2623 tbl = (short*)cPVOPo->op_pv;
2625 Zero(tbl, 256, short);
2626 for (i = 0; i < tlen; i++)
2628 for (i = 0, j = 0; i < 256; i++) {
2644 if (!rlen && !del) {
2647 o->op_private |= OPpTRANS_IDENTICAL;
2649 for (i = 0; i < 256; i++)
2651 for (i = 0, j = 0; i < tlen; i++,j++) {
2654 if (tbl[t[i]] == -1)
2660 if (tbl[t[i]] == -1)
2671 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2676 NewOp(1101, pmop, 1, PMOP);
2677 pmop->op_type = type;
2678 pmop->op_ppaddr = PL_ppaddr[type];
2679 pmop->op_flags = flags;
2680 pmop->op_private = 0 | (flags >> 8);
2682 if (PL_hints & HINT_RE_TAINT)
2683 pmop->op_pmpermflags |= PMf_RETAINT;
2684 if (PL_hints & HINT_LOCALE)
2685 pmop->op_pmpermflags |= PMf_LOCALE;
2686 pmop->op_pmflags = pmop->op_pmpermflags;
2688 /* link into pm list */
2689 if (type != OP_TRANS && PL_curstash) {
2690 pmop->op_pmnext = HvPMROOT(PL_curstash);
2691 HvPMROOT(PL_curstash) = pmop;
2698 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2703 I32 repl_has_vars = 0;
2705 if (o->op_type == OP_TRANS)
2706 return pmtrans(o, expr, repl);
2708 PL_hints |= HINT_BLOCK_SCOPE;
2711 if (expr->op_type == OP_CONST) {
2713 SV *pat = ((SVOP*)expr)->op_sv;
2714 char *p = SvPV(pat, plen);
2715 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2716 sv_setpvn(pat, "\\s+", 3);
2717 p = SvPV(pat, plen);
2718 pm->op_pmflags |= PMf_SKIPWHITE;
2720 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2721 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2722 pm->op_pmflags |= PMf_WHITE;
2726 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2727 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2729 : OP_REGCMAYBE),0,expr);
2731 NewOp(1101, rcop, 1, LOGOP);
2732 rcop->op_type = OP_REGCOMP;
2733 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2734 rcop->op_first = scalar(expr);
2735 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2736 ? (OPf_SPECIAL | OPf_KIDS)
2738 rcop->op_private = 1;
2741 /* establish postfix order */
2742 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2744 rcop->op_next = expr;
2745 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2748 rcop->op_next = LINKLIST(expr);
2749 expr->op_next = (OP*)rcop;
2752 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2757 if (pm->op_pmflags & PMf_EVAL) {
2759 if (PL_curcop->cop_line < PL_multi_end)
2760 PL_curcop->cop_line = PL_multi_end;
2763 else if (repl->op_type == OP_THREADSV
2764 && strchr("&`'123456789+",
2765 PL_threadsv_names[repl->op_targ]))
2769 #endif /* USE_THREADS */
2770 else if (repl->op_type == OP_CONST)
2774 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2775 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2777 if (curop->op_type == OP_THREADSV) {
2779 if (strchr("&`'123456789+", curop->op_private))
2783 if (curop->op_type == OP_GV) {
2784 GV *gv = ((GVOP*)curop)->op_gv;
2786 if (strchr("&`'123456789+", *GvENAME(gv)))
2789 #endif /* USE_THREADS */
2790 else if (curop->op_type == OP_RV2CV)
2792 else if (curop->op_type == OP_RV2SV ||
2793 curop->op_type == OP_RV2AV ||
2794 curop->op_type == OP_RV2HV ||
2795 curop->op_type == OP_RV2GV) {
2796 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2799 else if (curop->op_type == OP_PADSV ||
2800 curop->op_type == OP_PADAV ||
2801 curop->op_type == OP_PADHV ||
2802 curop->op_type == OP_PADANY) {
2805 else if (curop->op_type == OP_PUSHRE)
2806 ; /* Okay here, dangerous in newASSIGNOP */
2815 && (!pm->op_pmregexp
2816 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2817 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2818 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2819 prepend_elem(o->op_type, scalar(repl), o);
2822 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2823 pm->op_pmflags |= PMf_MAYBE_CONST;
2824 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2826 NewOp(1101, rcop, 1, LOGOP);
2827 rcop->op_type = OP_SUBSTCONT;
2828 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2829 rcop->op_first = scalar(repl);
2830 rcop->op_flags |= OPf_KIDS;
2831 rcop->op_private = 1;
2834 /* establish postfix order */
2835 rcop->op_next = LINKLIST(repl);
2836 repl->op_next = (OP*)rcop;
2838 pm->op_pmreplroot = scalar((OP*)rcop);
2839 pm->op_pmreplstart = LINKLIST(rcop);
2848 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2851 NewOp(1101, svop, 1, SVOP);
2852 svop->op_type = type;
2853 svop->op_ppaddr = PL_ppaddr[type];
2855 svop->op_next = (OP*)svop;
2856 svop->op_flags = flags;
2857 if (PL_opargs[type] & OA_RETSCALAR)
2859 if (PL_opargs[type] & OA_TARGET)
2860 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2861 return CHECKOP(type, svop);
2865 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
2869 NewOp(1101, gvop, 1, GVOP);
2870 gvop->op_type = type;
2871 gvop->op_ppaddr = PL_ppaddr[type];
2872 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2873 gvop->op_next = (OP*)gvop;
2874 gvop->op_flags = flags;
2875 if (PL_opargs[type] & OA_RETSCALAR)
2877 if (PL_opargs[type] & OA_TARGET)
2878 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2879 return CHECKOP(type, gvop);
2883 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
2886 NewOp(1101, pvop, 1, PVOP);
2887 pvop->op_type = type;
2888 pvop->op_ppaddr = PL_ppaddr[type];
2890 pvop->op_next = (OP*)pvop;
2891 pvop->op_flags = flags;
2892 if (PL_opargs[type] & OA_RETSCALAR)
2894 if (PL_opargs[type] & OA_TARGET)
2895 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2896 return CHECKOP(type, pvop);
2900 Perl_package(pTHX_ OP *o)
2905 save_hptr(&PL_curstash);
2906 save_item(PL_curstname);
2911 name = SvPV(sv, len);
2912 PL_curstash = gv_stashpvn(name,len,TRUE);
2913 sv_setpvn(PL_curstname, name, len);
2917 sv_setpv(PL_curstname,"<none>");
2918 PL_curstash = Nullhv;
2920 PL_hints |= HINT_BLOCK_SCOPE;
2921 PL_copline = NOLINE;
2926 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
2935 if (id->op_type != OP_CONST)
2936 Perl_croak(aTHX_ "Module name must be constant");
2940 if(version != Nullop) {
2941 SV *vesv = ((SVOP*)version)->op_sv;
2943 if (arg == Nullop && !SvNIOK(vesv)) {
2949 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2950 Perl_croak(aTHX_ "Version number must be constant number");
2952 /* Make copy of id so we don't free it twice */
2953 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2955 /* Fake up a method call to VERSION */
2956 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2957 append_elem(OP_LIST,
2958 prepend_elem(OP_LIST, pack, list(version)),
2959 newSVOP(OP_METHOD_NAMED, 0,
2960 newSVpvn("VERSION", 7))));
2964 /* Fake up an import/unimport */
2965 if (arg && arg->op_type == OP_STUB)
2966 imop = arg; /* no import on explicit () */
2967 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2968 imop = Nullop; /* use 5.0; */
2971 /* Make copy of id so we don't free it twice */
2972 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2973 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2974 append_elem(OP_LIST,
2975 prepend_elem(OP_LIST, pack, list(arg)),
2976 newSVOP(OP_METHOD_NAMED, 0,
2977 aver ? newSVpvn("import", 6)
2978 : newSVpvn("unimport", 8))));
2981 /* Fake up a require, handle override, if any */
2982 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2983 if (!(gv && GvIMPORTED_CV(gv)))
2984 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2986 if (gv && GvIMPORTED_CV(gv)) {
2987 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2988 append_elem(OP_LIST, id,
2989 scalar(newUNOP(OP_RV2CV, 0,
2994 rqop = newUNOP(OP_REQUIRE, 0, id);
2997 /* Fake up the BEGIN {}, which does its thing immediately. */
2999 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3002 append_elem(OP_LINESEQ,
3003 append_elem(OP_LINESEQ,
3004 newSTATEOP(0, Nullch, rqop),
3005 newSTATEOP(0, Nullch, veop)),
3006 newSTATEOP(0, Nullch, imop) ));
3008 PL_hints |= HINT_BLOCK_SCOPE;
3009 PL_copline = NOLINE;
3014 Perl_dofile(pTHX_ OP *term)
3019 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3020 if (!(gv && GvIMPORTED_CV(gv)))
3021 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3023 if (gv && GvIMPORTED_CV(gv)) {
3024 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3025 append_elem(OP_LIST, term,
3026 scalar(newUNOP(OP_RV2CV, 0,
3031 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3037 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3039 return newBINOP(OP_LSLICE, flags,
3040 list(force_list(subscript)),
3041 list(force_list(listval)) );
3045 S_list_assignment(pTHX_ register OP *o)
3050 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3051 o = cUNOPo->op_first;
3053 if (o->op_type == OP_COND_EXPR) {
3054 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3055 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3060 yyerror("Assignment to both a list and a scalar");
3064 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3065 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3066 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3069 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3072 if (o->op_type == OP_RV2SV)
3079 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3084 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3085 return newLOGOP(optype, 0,
3086 mod(scalar(left), optype),
3087 newUNOP(OP_SASSIGN, 0, scalar(right)));
3090 return newBINOP(optype, OPf_STACKED,
3091 mod(scalar(left), optype), scalar(right));
3095 if (list_assignment(left)) {
3098 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3099 left = mod(left, OP_AASSIGN);
3107 o = newBINOP(OP_AASSIGN, flags,
3108 list(force_list(right)),
3109 list(force_list(left)) );
3110 o->op_private = 0 | (flags >> 8);
3111 if (!(left->op_private & OPpLVAL_INTRO)) {
3115 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3116 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3117 if (curop->op_type == OP_GV) {
3118 GV *gv = ((GVOP*)curop)->op_gv;
3119 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3121 SvCUR(gv) = PL_generation;
3123 else if (curop->op_type == OP_PADSV ||
3124 curop->op_type == OP_PADAV ||
3125 curop->op_type == OP_PADHV ||
3126 curop->op_type == OP_PADANY) {
3127 SV **svp = AvARRAY(PL_comppad_name);
3128 SV *sv = svp[curop->op_targ];
3129 if (SvCUR(sv) == PL_generation)
3131 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3133 else if (curop->op_type == OP_RV2CV)
3135 else if (curop->op_type == OP_RV2SV ||
3136 curop->op_type == OP_RV2AV ||
3137 curop->op_type == OP_RV2HV ||
3138 curop->op_type == OP_RV2GV) {
3139 if (lastop->op_type != OP_GV) /* funny deref? */
3142 else if (curop->op_type == OP_PUSHRE) {
3143 if (((PMOP*)curop)->op_pmreplroot) {
3144 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3145 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3147 SvCUR(gv) = PL_generation;
3156 o->op_private = OPpASSIGN_COMMON;
3158 if (right && right->op_type == OP_SPLIT) {
3160 if ((tmpop = ((LISTOP*)right)->op_first) &&
3161 tmpop->op_type == OP_PUSHRE)
3163 PMOP *pm = (PMOP*)tmpop;
3164 if (left->op_type == OP_RV2AV &&
3165 !(left->op_private & OPpLVAL_INTRO) &&
3166 !(o->op_private & OPpASSIGN_COMMON) )
3168 tmpop = ((UNOP*)left)->op_first;
3169 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3170 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
3171 pm->op_pmflags |= PMf_ONCE;
3172 tmpop = cUNOPo->op_first; /* to list (nulled) */
3173 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3174 tmpop->op_sibling = Nullop; /* don't free split */
3175 right->op_next = tmpop->op_next; /* fix starting loc */
3176 op_free(o); /* blow off assign */
3177 right->op_flags &= ~OPf_WANT;
3178 /* "I don't know and I don't care." */
3183 if (PL_modcount < 10000 &&
3184 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3186 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3188 sv_setiv(sv, PL_modcount+1);
3196 right = newOP(OP_UNDEF, 0);
3197 if (right->op_type == OP_READLINE) {
3198 right->op_flags |= OPf_STACKED;
3199 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3202 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3203 o = newBINOP(OP_SASSIGN, flags,
3204 scalar(right), mod(scalar(left), OP_SASSIGN) );
3216 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3219 U32 seq = intro_my();
3222 NewOp(1101, cop, 1, COP);
3223 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
3224 cop->op_type = OP_DBSTATE;
3225 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3228 cop->op_type = OP_NEXTSTATE;
3229 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3231 cop->op_flags = flags;
3232 cop->op_private = (PL_hints & HINT_UTF8);
3234 cop->op_private |= NATIVE_HINTS;
3236 PL_compiling.op_private = cop->op_private;
3237 cop->op_next = (OP*)cop;
3240 cop->cop_label = label;
3241 PL_hints |= HINT_BLOCK_SCOPE;
3244 cop->cop_arybase = PL_curcop->cop_arybase;
3245 if (specialWARN(PL_curcop->cop_warnings))
3246 cop->cop_warnings = PL_curcop->cop_warnings ;
3248 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3251 if (PL_copline == NOLINE)
3252 cop->cop_line = PL_curcop->cop_line;
3254 cop->cop_line = PL_copline;
3255 PL_copline = NOLINE;
3257 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
3258 cop->cop_stash = PL_curstash;
3260 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3261 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
3262 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3263 (void)SvIOK_on(*svp);
3265 SvSTASH(*svp) = (HV*)cop;
3269 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3272 /* "Introduce" my variables to visible status. */
3280 if (! PL_min_intro_pending)
3281 return PL_cop_seqmax;
3283 svp = AvARRAY(PL_comppad_name);
3284 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3285 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3286 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3287 SvNVX(sv) = (NV)PL_cop_seqmax;
3290 PL_min_intro_pending = 0;
3291 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3292 return PL_cop_seqmax++;
3296 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3298 return new_logop(type, flags, &first, &other);
3302 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3307 OP *first = *firstp;
3308 OP *other = *otherp;
3310 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3311 return newBINOP(type, flags, scalar(first), scalar(other));
3313 scalarboolean(first);
3314 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3315 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3316 if (type == OP_AND || type == OP_OR) {
3322 first = *firstp = cUNOPo->op_first;
3324 first->op_next = o->op_next;
3325 cUNOPo->op_first = Nullop;
3329 if (first->op_type == OP_CONST) {
3330 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3331 Perl_warner(aTHX_ WARN_PRECEDENCE, "Probable precedence problem on %s",
3333 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3344 else if (first->op_type == OP_WANTARRAY) {
3350 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3351 OP *k1 = ((UNOP*)first)->op_first;
3352 OP *k2 = k1->op_sibling;
3354 switch (first->op_type)
3357 if (k2 && k2->op_type == OP_READLINE
3358 && (k2->op_flags & OPf_STACKED)
3359 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3361 warnop = k2->op_type;
3366 if (k1->op_type == OP_READDIR
3367 || k1->op_type == OP_GLOB
3368 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3369 || k1->op_type == OP_EACH)
3371 warnop = ((k1->op_type == OP_NULL)
3372 ? k1->op_targ : k1->op_type);
3377 line_t oldline = PL_curcop->cop_line;
3378 PL_curcop->cop_line = PL_copline;
3379 Perl_warner(aTHX_ WARN_UNSAFE,
3380 "Value of %s%s can be \"0\"; test with defined()",
3382 ((warnop == OP_READLINE || warnop == OP_GLOB)
3383 ? " construct" : "() operator"));
3384 PL_curcop->cop_line = oldline;
3391 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3392 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3394 NewOp(1101, logop, 1, LOGOP);
3396 logop->op_type = type;
3397 logop->op_ppaddr = PL_ppaddr[type];
3398 logop->op_first = first;
3399 logop->op_flags = flags | OPf_KIDS;
3400 logop->op_other = LINKLIST(other);
3401 logop->op_private = 1 | (flags >> 8);
3403 /* establish postfix order */
3404 logop->op_next = LINKLIST(first);
3405 first->op_next = (OP*)logop;
3406 first->op_sibling = other;
3408 o = newUNOP(OP_NULL, 0, (OP*)logop);
3415 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3423 return newLOGOP(OP_AND, 0, first, trueop);
3425 return newLOGOP(OP_OR, 0, first, falseop);
3427 scalarboolean(first);
3428 if (first->op_type == OP_CONST) {
3429 if (SvTRUE(((SVOP*)first)->op_sv)) {
3440 else if (first->op_type == OP_WANTARRAY) {
3444 NewOp(1101, logop, 1, LOGOP);
3445 logop->op_type = OP_COND_EXPR;
3446 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3447 logop->op_first = first;
3448 logop->op_flags = flags | OPf_KIDS;
3449 logop->op_private = 1 | (flags >> 8);
3450 logop->op_other = LINKLIST(trueop);
3451 logop->op_next = LINKLIST(falseop);
3454 /* establish postfix order */
3455 start = LINKLIST(first);
3456 first->op_next = (OP*)logop;
3458 first->op_sibling = trueop;
3459 trueop->op_sibling = falseop;
3460 o = newUNOP(OP_NULL, 0, (OP*)logop);
3462 trueop->op_next = falseop->op_next = o;
3469 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3478 NewOp(1101, range, 1, LOGOP);
3480 range->op_type = OP_RANGE;
3481 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3482 range->op_first = left;
3483 range->op_flags = OPf_KIDS;
3484 leftstart = LINKLIST(left);
3485 range->op_other = LINKLIST(right);
3486 range->op_private = 1 | (flags >> 8);
3488 left->op_sibling = right;
3490 range->op_next = (OP*)range;
3491 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3492 flop = newUNOP(OP_FLOP, 0, flip);
3493 o = newUNOP(OP_NULL, 0, flop);
3495 range->op_next = leftstart;
3497 left->op_next = flip;
3498 right->op_next = flop;
3500 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3501 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3502 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3503 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3505 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3506 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3509 if (!flip->op_private || !flop->op_private)
3510 linklist(o); /* blow off optimizer unless constant */
3516 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3521 int once = block && block->op_flags & OPf_SPECIAL &&
3522 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3525 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3526 return block; /* do {} while 0 does once */
3527 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3528 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3529 expr = newUNOP(OP_DEFINED, 0,
3530 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3531 } else if (expr->op_flags & OPf_KIDS) {
3532 OP *k1 = ((UNOP*)expr)->op_first;
3533 OP *k2 = (k1) ? k1->op_sibling : NULL;
3534 switch (expr->op_type) {
3536 if (k2 && k2->op_type == OP_READLINE
3537 && (k2->op_flags & OPf_STACKED)
3538 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3539 expr = newUNOP(OP_DEFINED, 0, expr);
3543 if (k1->op_type == OP_READDIR
3544 || k1->op_type == OP_GLOB
3545 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3546 || k1->op_type == OP_EACH)
3547 expr = newUNOP(OP_DEFINED, 0, expr);
3553 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3554 o = new_logop(OP_AND, 0, &expr, &listop);
3557 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3559 if (once && o != listop)
3560 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3563 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3565 o->op_flags |= flags;
3567 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3572 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3581 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3582 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3583 expr = newUNOP(OP_DEFINED, 0,
3584 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3585 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3586 OP *k1 = ((UNOP*)expr)->op_first;
3587 OP *k2 = (k1) ? k1->op_sibling : NULL;
3588 switch (expr->op_type) {
3590 if (k2 && k2->op_type == OP_READLINE
3591 && (k2->op_flags & OPf_STACKED)
3592 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3593 expr = newUNOP(OP_DEFINED, 0, expr);
3597 if (k1->op_type == OP_READDIR
3598 || k1->op_type == OP_GLOB
3599 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3600 || k1->op_type == OP_EACH)
3601 expr = newUNOP(OP_DEFINED, 0, expr);
3607 block = newOP(OP_NULL, 0);
3610 next = LINKLIST(cont);
3612 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3613 if ((line_t)whileline != NOLINE) {
3614 PL_copline = whileline;
3615 cont = append_elem(OP_LINESEQ, cont,
3616 newSTATEOP(0, Nullch, Nullop));
3620 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3621 redo = LINKLIST(listop);
3624 PL_copline = whileline;
3626 o = new_logop(OP_AND, 0, &expr, &listop);
3627 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3628 op_free(expr); /* oops, it's a while (0) */
3630 return Nullop; /* listop already freed by new_logop */
3633 ((LISTOP*)listop)->op_last->op_next = condop =
3634 (o == listop ? redo : LINKLIST(o));
3642 NewOp(1101,loop,1,LOOP);
3643 loop->op_type = OP_ENTERLOOP;
3644 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3645 loop->op_private = 0;
3646 loop->op_next = (OP*)loop;
3649 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3651 loop->op_redoop = redo;
3652 loop->op_lastop = o;
3655 loop->op_nextop = next;
3657 loop->op_nextop = o;
3659 o->op_flags |= flags;
3660 o->op_private |= (flags >> 8);
3665 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3674 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3675 sv->op_type = OP_RV2GV;
3676 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3678 else if (sv->op_type == OP_PADSV) { /* private variable */
3679 padoff = sv->op_targ;
3683 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3684 padoff = sv->op_targ;
3685 iterflags |= OPf_SPECIAL;
3690 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3694 padoff = find_threadsv("_");
3695 iterflags |= OPf_SPECIAL;
3697 sv = newGVOP(OP_GV, 0, PL_defgv);
3700 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3701 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3702 iterflags |= OPf_STACKED;
3704 else if (expr->op_type == OP_NULL &&
3705 (expr->op_flags & OPf_KIDS) &&
3706 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3708 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3709 * set the STACKED flag to indicate that these values are to be
3710 * treated as min/max values by 'pp_iterinit'.
3712 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3713 LOGOP* range = (LOGOP*) flip->op_first;
3714 OP* left = range->op_first;
3715 OP* right = left->op_sibling;
3718 range->op_flags &= ~OPf_KIDS;
3719 range->op_first = Nullop;
3721 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3722 listop->op_first->op_next = range->op_next;
3723 left->op_next = range->op_other;
3724 right->op_next = (OP*)listop;
3725 listop->op_next = listop->op_first;
3728 expr = (OP*)(listop);
3730 iterflags |= OPf_STACKED;
3733 expr = mod(force_list(expr), OP_GREPSTART);
3737 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3738 append_elem(OP_LIST, expr, scalar(sv))));
3739 assert(!loop->op_next);
3740 #ifdef PL_OP_SLAB_ALLOC
3741 NewOp(1234,tmp,1,LOOP);
3742 Copy(loop,tmp,1,LOOP);
3745 Renew(loop, 1, LOOP);
3747 loop->op_targ = padoff;
3748 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3749 PL_copline = forline;
3750 return newSTATEOP(0, label, wop);
3754 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3760 if (type != OP_GOTO || label->op_type == OP_CONST) {
3761 /* "last()" means "last" */
3762 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3763 o = newOP(type, OPf_SPECIAL);
3765 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3766 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3772 if (label->op_type == OP_ENTERSUB)
3773 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3774 o = newUNOP(type, OPf_STACKED, label);
3776 PL_hints |= HINT_BLOCK_SCOPE;
3781 Perl_cv_undef(pTHX_ CV *cv)
3786 MUTEX_DESTROY(CvMUTEXP(cv));
3787 Safefree(CvMUTEXP(cv));
3790 #endif /* USE_THREADS */
3792 if (!CvXSUB(cv) && CvROOT(cv)) {
3794 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3795 Perl_croak(aTHX_ "Can't undef active subroutine");
3798 Perl_croak(aTHX_ "Can't undef active subroutine");
3799 #endif /* USE_THREADS */
3802 SAVESPTR(PL_curpad);
3806 op_free(CvROOT(cv));
3807 CvROOT(cv) = Nullop;
3810 SvPOK_off((SV*)cv); /* forget prototype */
3812 SvREFCNT_dec(CvGV(cv));
3814 SvREFCNT_dec(CvOUTSIDE(cv));
3815 CvOUTSIDE(cv) = Nullcv;
3816 if (CvPADLIST(cv)) {
3817 /* may be during global destruction */
3818 if (SvREFCNT(CvPADLIST(cv))) {
3819 I32 i = AvFILLp(CvPADLIST(cv));
3821 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3822 SV* sv = svp ? *svp : Nullsv;
3825 if (sv == (SV*)PL_comppad_name)
3826 PL_comppad_name = Nullav;
3827 else if (sv == (SV*)PL_comppad) {
3828 PL_comppad = Nullav;
3829 PL_curpad = Null(SV**);
3833 SvREFCNT_dec((SV*)CvPADLIST(cv));
3835 CvPADLIST(cv) = Nullav;
3839 #ifdef DEBUG_CLOSURES
3843 CV *outside = CvOUTSIDE(cv);
3844 AV* padlist = CvPADLIST(cv);
3851 PerlIO_printf(Perl_debug_log,
3852 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
3854 (CvANON(cv) ? "ANON"
3855 : (cv == PL_main_cv) ? "MAIN"
3856 : CvUNIQUE(cv) ? "UNIQUE"
3857 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3860 : CvANON(outside) ? "ANON"
3861 : (outside == PL_main_cv) ? "MAIN"
3862 : CvUNIQUE(outside) ? "UNIQUE"
3863 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3868 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3869 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3870 pname = AvARRAY(pad_name);
3871 ppad = AvARRAY(pad);
3873 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3874 if (SvPOK(pname[ix]))
3875 PerlIO_printf(Perl_debug_log,
3876 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
3877 ix, PTR2UV(ppad[ix]),
3878 SvFAKE(pname[ix]) ? "FAKE " : "",
3880 (IV)I_32(SvNVX(pname[ix])),
3884 #endif /* DEBUG_CLOSURES */
3887 S_cv_clone2(pTHX_ CV *proto, CV *outside)
3892 AV* protopadlist = CvPADLIST(proto);
3893 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3894 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3895 SV** pname = AvARRAY(protopad_name);
3896 SV** ppad = AvARRAY(protopad);
3897 I32 fname = AvFILLp(protopad_name);
3898 I32 fpad = AvFILLp(protopad);
3902 assert(!CvUNIQUE(proto));
3905 SAVESPTR(PL_curpad);
3906 SAVESPTR(PL_comppad);
3907 SAVESPTR(PL_comppad_name);
3908 SAVESPTR(PL_compcv);
3910 cv = PL_compcv = (CV*)NEWSV(1104,0);
3911 sv_upgrade((SV *)cv, SvTYPE(proto));
3917 New(666, CvMUTEXP(cv), 1, perl_mutex);
3918 MUTEX_INIT(CvMUTEXP(cv));
3920 #endif /* USE_THREADS */
3921 CvFILEGV(cv) = CvFILEGV(proto);
3922 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3923 CvSTASH(cv) = CvSTASH(proto);
3924 CvROOT(cv) = CvROOT(proto);
3925 CvSTART(cv) = CvSTART(proto);
3927 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3930 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3932 PL_comppad_name = newAV();
3933 for (ix = fname; ix >= 0; ix--)
3934 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3936 PL_comppad = newAV();
3938 comppadlist = newAV();
3939 AvREAL_off(comppadlist);
3940 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3941 av_store(comppadlist, 1, (SV*)PL_comppad);
3942 CvPADLIST(cv) = comppadlist;
3943 av_fill(PL_comppad, AvFILLp(protopad));
3944 PL_curpad = AvARRAY(PL_comppad);
3946 av = newAV(); /* will be @_ */
3948 av_store(PL_comppad, 0, (SV*)av);
3949 AvFLAGS(av) = AVf_REIFY;
3951 for (ix = fpad; ix > 0; ix--) {
3952 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3953 if (namesv && namesv != &PL_sv_undef) {
3954 char *name = SvPVX(namesv); /* XXX */
3955 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3956 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3957 CvOUTSIDE(cv), cxstack_ix, 0, 0);
3959 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3961 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
3963 else { /* our own lexical */
3966 /* anon code -- we'll come back for it */
3967 sv = SvREFCNT_inc(ppad[ix]);
3969 else if (*name == '@')
3971 else if (*name == '%')
3981 SV* sv = NEWSV(0,0);
3987 /* Now that vars are all in place, clone nested closures. */
3989 for (ix = fpad; ix > 0; ix--) {
3990 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3992 && namesv != &PL_sv_undef
3993 && !(SvFLAGS(namesv) & SVf_FAKE)
3994 && *SvPVX(namesv) == '&'
3995 && CvCLONE(ppad[ix]))
3997 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3998 SvREFCNT_dec(ppad[ix]);
4001 PL_curpad[ix] = (SV*)kid;
4005 #ifdef DEBUG_CLOSURES
4006 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4008 PerlIO_printf(Perl_debug_log, " from:\n");
4010 PerlIO_printf(Perl_debug_log, " to:\n");
4019 Perl_cv_clone(pTHX_ CV *proto)
4022 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
4023 cv = cv_clone2(proto, CvOUTSIDE(proto));
4024 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
4029 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4033 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_UNSAFE)) {
4034 SV* msg = sv_newmortal();
4038 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4039 sv_setpv(msg, "Prototype mismatch:");
4041 Perl_sv_catpvf(aTHX_ msg, " sub %_", name);
4043 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4044 sv_catpv(msg, " vs ");
4046 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4048 sv_catpv(msg, "none");
4049 Perl_warner(aTHX_ WARN_UNSAFE, "%_", msg);
4054 Perl_cv_const_sv(pTHX_ CV *cv)
4056 if (!cv || !SvPOK(cv) || SvCUR(cv))
4058 return op_const_sv(CvSTART(cv), cv);
4062 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4069 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4070 o = cLISTOPo->op_first->op_sibling;
4072 for (; o; o = o->op_next) {
4073 OPCODE type = o->op_type;
4075 if (sv && o->op_next == o)
4077 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4079 if (type == OP_LEAVESUB || type == OP_RETURN)
4083 if (type == OP_CONST)
4085 else if (type == OP_PADSV && cv) {
4086 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4087 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4088 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4100 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4110 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4114 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4116 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4120 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4124 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4125 GV *gv = gv_fetchpv(name ? name : "__ANON__",
4126 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4128 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4139 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4140 maximum a prototype before. */
4141 if (SvTYPE(gv) > SVt_NULL) {
4142 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4143 && ckWARN_d(WARN_UNSAFE))
4145 Perl_warner(aTHX_ WARN_UNSAFE, "Runaway prototype");
4147 cv_ckproto((CV*)gv, NULL, ps);
4150 sv_setpv((SV*)gv, ps);
4152 sv_setiv((SV*)gv, -1);
4153 SvREFCNT_dec(PL_compcv);
4154 cv = PL_compcv = NULL;
4155 PL_sub_generation++;
4159 if (!name || GvCVGEN(gv))
4161 else if (cv = GvCV(gv)) {
4162 cv_ckproto(cv, gv, ps);
4163 /* already defined (or promised)? */
4164 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4166 bool const_changed = TRUE;
4167 if (!block && !attrs) {
4168 /* just a "sub foo;" when &foo is already defined */
4169 SAVEFREESV(PL_compcv);
4172 /* ahem, death to those who redefine active sort subs */
4173 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4174 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4177 if(const_sv = cv_const_sv(cv))
4178 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4179 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
4180 && !(CvGV(cv) && GvSTASH(CvGV(cv))
4181 && HvNAME(GvSTASH(CvGV(cv)))
4182 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
4184 line_t oldline = PL_curcop->cop_line;
4185 PL_curcop->cop_line = PL_copline;
4186 Perl_warner(aTHX_ WARN_REDEFINE,
4187 const_sv ? "Constant subroutine %s redefined"
4188 : "Subroutine %s redefined", name);
4189 PL_curcop->cop_line = oldline;
4200 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4201 * before we clobber PL_compcv.
4205 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4206 stash = GvSTASH(CvGV(cv));
4207 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4208 stash = CvSTASH(cv);
4210 stash = PL_curstash;
4213 /* possibly about to re-define existing subr -- ignore old cv */
4214 rcv = (SV*)PL_compcv;
4215 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4216 stash = GvSTASH(gv);
4218 stash = PL_curstash;
4220 apply_attrs(stash, rcv, attrs);
4222 if (cv) { /* must reuse cv if autoloaded */
4224 /* got here with just attrs -- work done, so bug out */
4225 SAVEFREESV(PL_compcv);
4229 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4230 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4231 CvOUTSIDE(PL_compcv) = 0;
4232 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4233 CvPADLIST(PL_compcv) = 0;
4234 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4235 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4236 SvREFCNT_dec(PL_compcv);
4243 PL_sub_generation++;
4246 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4247 CvFILEGV(cv) = PL_curcop->cop_filegv;
4248 CvSTASH(cv) = PL_curstash;
4251 if (!CvMUTEXP(cv)) {
4252 New(666, CvMUTEXP(cv), 1, perl_mutex);
4253 MUTEX_INIT(CvMUTEXP(cv));
4255 #endif /* USE_THREADS */
4258 sv_setpv((SV*)cv, ps);
4260 if (PL_error_count) {
4264 char *s = strrchr(name, ':');
4266 if (strEQ(s, "BEGIN")) {
4268 "BEGIN not safe after errors--compilation aborted";
4269 if (PL_in_eval & EVAL_KEEPERR)
4270 Perl_croak(aTHX_ not_safe);
4272 /* force display of errors found but not reported */
4273 sv_catpv(ERRSV, not_safe);
4274 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4281 PL_copline = NOLINE;
4286 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4287 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4290 SV **namep = AvARRAY(PL_comppad_name);
4291 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4294 if (SvIMMORTAL(PL_curpad[ix]))
4297 * The only things that a clonable function needs in its
4298 * pad are references to outer lexicals and anonymous subs.
4299 * The rest are created anew during cloning.
4301 if (!((namesv = namep[ix]) != Nullsv &&
4302 namesv != &PL_sv_undef &&
4304 *SvPVX(namesv) == '&')))
4306 SvREFCNT_dec(PL_curpad[ix]);
4307 PL_curpad[ix] = Nullsv;
4312 AV *av = newAV(); /* Will be @_ */
4314 av_store(PL_comppad, 0, (SV*)av);
4315 AvFLAGS(av) = AVf_REIFY;
4317 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4318 if (SvIMMORTAL(PL_curpad[ix]))
4320 if (!SvPADMY(PL_curpad[ix]))
4321 SvPADTMP_on(PL_curpad[ix]);
4326 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4329 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4331 CvSTART(cv) = LINKLIST(CvROOT(cv));
4332 CvROOT(cv)->op_next = 0;
4338 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4339 SV *sv = NEWSV(0,0);
4340 SV *tmpstr = sv_newmortal();
4341 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4345 Perl_sv_setpvf(aTHX_ sv, "%_:%ld-%ld",
4346 GvSV(PL_curcop->cop_filegv),
4347 (long)PL_subline, (long)PL_curcop->cop_line);
4348 gv_efullname3(tmpstr, gv, Nullch);
4349 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4350 hv = GvHVn(db_postponed);
4351 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4352 && (cv = GvCV(db_postponed))) {
4357 call_sv((SV*)cv, G_DISCARD);
4361 if ((s = strrchr(name,':')))
4365 if (strEQ(s, "BEGIN")) {
4366 I32 oldscope = PL_scopestack_ix;
4368 SAVESPTR(PL_compiling.cop_filegv);
4369 SAVEI16(PL_compiling.cop_line);
4371 sv_setsv(PL_rs, PL_nrs);
4374 PL_beginav = newAV();
4375 DEBUG_x( dump_sub(gv) );
4376 av_push(PL_beginav, (SV *)cv);
4378 call_list(oldscope, PL_beginav);
4380 PL_curcop = &PL_compiling;
4381 PL_compiling.op_private = PL_hints;
4384 else if (strEQ(s, "END") && !PL_error_count) {
4387 av_unshift(PL_endav, 1);
4388 av_store(PL_endav, 0, (SV *)cv);
4391 else if (strEQ(s, "INIT") && !PL_error_count) {
4393 PL_initav = newAV();
4394 av_push(PL_initav, SvREFCNT_inc(cv));
4400 PL_copline = NOLINE;
4405 /* XXX unsafe for threads if eval_owner isn't held */
4407 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4410 U32 oldhints = PL_hints;
4411 HV *old_cop_stash = PL_curcop->cop_stash;
4412 HV *old_curstash = PL_curstash;
4413 line_t oldline = PL_curcop->cop_line;
4414 PL_curcop->cop_line = PL_copline;
4416 PL_hints &= ~HINT_BLOCK_SCOPE;
4418 PL_curstash = PL_curcop->cop_stash = stash;
4421 start_subparse(FALSE, 0),
4422 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4423 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4425 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4428 PL_hints = oldhints;
4429 PL_curcop->cop_stash = old_cop_stash;
4430 PL_curstash = old_curstash;
4431 PL_curcop->cop_line = oldline;
4435 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4438 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4441 if (cv = (name ? GvCV(gv) : Nullcv)) {
4443 /* just a cached method */
4447 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4448 /* already defined (or promised) */
4449 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4450 && HvNAME(GvSTASH(CvGV(cv)))
4451 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4452 line_t oldline = PL_curcop->cop_line;
4453 if (PL_copline != NOLINE)
4454 PL_curcop->cop_line = PL_copline;
4455 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4456 PL_curcop->cop_line = oldline;
4463 if (cv) /* must reuse cv if autoloaded */
4466 cv = (CV*)NEWSV(1105,0);
4467 sv_upgrade((SV *)cv, SVt_PVCV);
4471 PL_sub_generation++;
4474 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4476 New(666, CvMUTEXP(cv), 1, perl_mutex);
4477 MUTEX_INIT(CvMUTEXP(cv));
4479 #endif /* USE_THREADS */
4480 CvFILEGV(cv) = gv_fetchfile(filename);
4481 CvXSUB(cv) = subaddr;
4484 char *s = strrchr(name,':');
4489 if (strEQ(s, "BEGIN")) {
4491 PL_beginav = newAV();
4492 av_push(PL_beginav, (SV *)cv);
4495 else if (strEQ(s, "END")) {
4498 av_unshift(PL_endav, 1);
4499 av_store(PL_endav, 0, (SV *)cv);
4502 else if (strEQ(s, "INIT")) {
4504 PL_initav = newAV();
4505 av_push(PL_initav, (SV *)cv);
4516 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4526 name = SvPVx(cSVOPo->op_sv, n_a);
4529 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4531 if (cv = GvFORM(gv)) {
4532 if (ckWARN(WARN_REDEFINE)) {
4533 line_t oldline = PL_curcop->cop_line;
4535 PL_curcop->cop_line = PL_copline;
4536 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4537 PL_curcop->cop_line = oldline;
4543 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4544 CvFILEGV(cv) = PL_curcop->cop_filegv;
4546 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4547 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4548 SvPADTMP_on(PL_curpad[ix]);
4551 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4552 CvSTART(cv) = LINKLIST(CvROOT(cv));
4553 CvROOT(cv)->op_next = 0;
4556 PL_copline = NOLINE;
4561 Perl_newANONLIST(pTHX_ OP *o)
4563 return newUNOP(OP_REFGEN, 0,
4564 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4568 Perl_newANONHASH(pTHX_ OP *o)
4570 return newUNOP(OP_REFGEN, 0,
4571 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4575 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4577 return newANONATTRSUB(floor, proto, Nullop, block);
4581 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4583 return newUNOP(OP_REFGEN, 0,
4584 newSVOP(OP_ANONCODE, 0,
4585 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4589 Perl_oopsAV(pTHX_ OP *o)
4591 switch (o->op_type) {
4593 o->op_type = OP_PADAV;
4594 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4595 return ref(o, OP_RV2AV);
4598 o->op_type = OP_RV2AV;
4599 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4604 if (ckWARN_d(WARN_INTERNAL))
4605 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4612 Perl_oopsHV(pTHX_ OP *o)
4616 switch (o->op_type) {
4619 o->op_type = OP_PADHV;
4620 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4621 return ref(o, OP_RV2HV);
4625 o->op_type = OP_RV2HV;
4626 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4631 if (ckWARN_d(WARN_INTERNAL))
4632 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
4639 Perl_newAVREF(pTHX_ OP *o)
4641 if (o->op_type == OP_PADANY) {
4642 o->op_type = OP_PADAV;
4643 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4646 return newUNOP(OP_RV2AV, 0, scalar(o));
4650 Perl_newGVREF(pTHX_ I32 type, OP *o)
4652 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4653 return newUNOP(OP_NULL, 0, o);
4654 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4658 Perl_newHVREF(pTHX_ OP *o)
4660 if (o->op_type == OP_PADANY) {
4661 o->op_type = OP_PADHV;
4662 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4665 return newUNOP(OP_RV2HV, 0, scalar(o));
4669 Perl_oopsCV(pTHX_ OP *o)
4671 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4677 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4679 return newUNOP(OP_RV2CV, flags, scalar(o));
4683 Perl_newSVREF(pTHX_ OP *o)
4685 if (o->op_type == OP_PADANY) {
4686 o->op_type = OP_PADSV;
4687 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4690 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4691 o->op_flags |= OPpDONE_SVREF;
4694 return newUNOP(OP_RV2SV, 0, scalar(o));
4697 /* Check routines. */
4700 Perl_ck_anoncode(pTHX_ OP *o)
4705 name = NEWSV(1106,0);
4706 sv_upgrade(name, SVt_PVNV);
4707 sv_setpvn(name, "&", 1);
4710 ix = pad_alloc(o->op_type, SVs_PADMY);
4711 av_store(PL_comppad_name, ix, name);
4712 av_store(PL_comppad, ix, cSVOPo->op_sv);
4713 SvPADMY_on(cSVOPo->op_sv);
4714 cSVOPo->op_sv = Nullsv;
4715 cSVOPo->op_targ = ix;
4720 Perl_ck_bitop(pTHX_ OP *o)
4722 o->op_private = PL_hints;
4727 Perl_ck_concat(pTHX_ OP *o)
4729 if (cUNOPo->op_first->op_type == OP_CONCAT)
4730 o->op_flags |= OPf_STACKED;
4735 Perl_ck_spair(pTHX_ OP *o)
4737 if (o->op_flags & OPf_KIDS) {
4740 OPCODE type = o->op_type;
4741 o = modkids(ck_fun(o), type);
4742 kid = cUNOPo->op_first;
4743 newop = kUNOP->op_first->op_sibling;
4745 (newop->op_sibling ||
4746 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4747 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4748 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4752 op_free(kUNOP->op_first);
4753 kUNOP->op_first = newop;
4755 o->op_ppaddr = PL_ppaddr[++o->op_type];
4760 Perl_ck_delete(pTHX_ OP *o)
4764 if (o->op_flags & OPf_KIDS) {
4765 OP *kid = cUNOPo->op_first;
4766 if (kid->op_type == OP_HSLICE)
4767 o->op_private |= OPpSLICE;
4768 else if (kid->op_type != OP_HELEM)
4769 Perl_croak(aTHX_ "%s argument is not a HASH element or slice",
4770 PL_op_desc[o->op_type]);
4777 Perl_ck_eof(pTHX_ OP *o)
4779 I32 type = o->op_type;
4781 if (o->op_flags & OPf_KIDS) {
4782 if (cLISTOPo->op_first->op_type == OP_STUB) {
4784 o = newUNOP(type, OPf_SPECIAL,
4785 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4793 Perl_ck_eval(pTHX_ OP *o)
4795 PL_hints |= HINT_BLOCK_SCOPE;
4796 if (o->op_flags & OPf_KIDS) {
4797 SVOP *kid = (SVOP*)cUNOPo->op_first;
4800 o->op_flags &= ~OPf_KIDS;
4803 else if (kid->op_type == OP_LINESEQ) {
4806 kid->op_next = o->op_next;
4807 cUNOPo->op_first = 0;
4810 NewOp(1101, enter, 1, LOGOP);
4811 enter->op_type = OP_ENTERTRY;
4812 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4813 enter->op_private = 0;
4815 /* establish postfix order */
4816 enter->op_next = (OP*)enter;
4818 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4819 o->op_type = OP_LEAVETRY;
4820 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4821 enter->op_other = o;
4829 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4831 o->op_targ = (PADOFFSET)PL_hints;
4836 Perl_ck_exec(pTHX_ OP *o)
4839 if (o->op_flags & OPf_STACKED) {
4841 kid = cUNOPo->op_first->op_sibling;
4842 if (kid->op_type == OP_RV2GV)
4851 Perl_ck_exists(pTHX_ OP *o)
4854 if (o->op_flags & OPf_KIDS) {
4855 OP *kid = cUNOPo->op_first;
4856 if (kid->op_type != OP_HELEM)
4857 Perl_croak(aTHX_ "%s argument is not a HASH element", PL_op_desc[o->op_type]);
4865 Perl_ck_gvconst(pTHX_ register OP *o)
4867 o = fold_constants(o);
4868 if (o->op_type == OP_CONST)
4875 Perl_ck_rvconst(pTHX_ register OP *o)
4878 SVOP *kid = (SVOP*)cUNOPo->op_first;
4880 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4881 if (kid->op_type == OP_CONST) {
4885 SV *kidsv = kid->op_sv;
4888 /* Is it a constant from cv_const_sv()? */
4889 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4890 SV *rsv = SvRV(kidsv);
4891 int svtype = SvTYPE(rsv);
4892 char *badtype = Nullch;
4894 switch (o->op_type) {
4896 if (svtype > SVt_PVMG)
4897 badtype = "a SCALAR";
4900 if (svtype != SVt_PVAV)
4901 badtype = "an ARRAY";
4904 if (svtype != SVt_PVHV) {
4905 if (svtype == SVt_PVAV) { /* pseudohash? */
4906 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4907 if (ksv && SvROK(*ksv)
4908 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4917 if (svtype != SVt_PVCV)
4922 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
4925 name = SvPV(kidsv, n_a);
4926 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4927 char *badthing = Nullch;
4928 switch (o->op_type) {
4930 badthing = "a SCALAR";
4933 badthing = "an ARRAY";
4936 badthing = "a HASH";
4941 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4945 * This is a little tricky. We only want to add the symbol if we
4946 * didn't add it in the lexer. Otherwise we get duplicate strict
4947 * warnings. But if we didn't add it in the lexer, we must at
4948 * least pretend like we wanted to add it even if it existed before,
4949 * or we get possible typo warnings. OPpCONST_ENTERED says
4950 * whether the lexer already added THIS instance of this symbol.
4952 iscv = (o->op_type == OP_RV2CV) * 2;
4954 gv = gv_fetchpv(name,
4955 iscv | !(kid->op_private & OPpCONST_ENTERED),
4958 : o->op_type == OP_RV2SV
4960 : o->op_type == OP_RV2AV
4962 : o->op_type == OP_RV2HV
4965 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4967 kid->op_type = OP_GV;
4968 SvREFCNT_dec(kid->op_sv);
4969 kid->op_sv = SvREFCNT_inc(gv);
4970 kid->op_ppaddr = PL_ppaddr[OP_GV];
4977 Perl_ck_ftst(pTHX_ OP *o)
4980 I32 type = o->op_type;
4982 if (o->op_flags & OPf_REF)
4985 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4986 SVOP *kid = (SVOP*)cUNOPo->op_first;
4988 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4990 OP *newop = newGVOP(type, OPf_REF,
4991 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4998 if (type == OP_FTTTY)
4999 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5002 return newUNOP(type, 0, newDEFSVOP());
5008 Perl_ck_fun(pTHX_ OP *o)
5015 int type = o->op_type;
5016 register I32 oa = PL_opargs[type] >> OASHIFT;
5018 if (o->op_flags & OPf_STACKED) {
5019 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5022 return no_fh_allowed(o);
5025 if (o->op_flags & OPf_KIDS) {
5027 tokid = &cLISTOPo->op_first;
5028 kid = cLISTOPo->op_first;
5029 if (kid->op_type == OP_PUSHMARK ||
5030 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
5032 tokid = &kid->op_sibling;
5033 kid = kid->op_sibling;
5035 if (!kid && PL_opargs[type] & OA_DEFGV)
5036 *tokid = kid = newDEFSVOP();
5040 sibl = kid->op_sibling;
5043 /* list seen where single (scalar) arg expected? */
5044 if (numargs == 1 && !(oa >> 4)
5045 && kid->op_type == OP_LIST && type != OP_SCALAR)
5047 return too_many_arguments(o,PL_op_desc[type]);
5060 if (kid->op_type == OP_CONST &&
5061 (kid->op_private & OPpCONST_BARE))
5063 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5064 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5065 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5066 if (ckWARN(WARN_SYNTAX))
5067 Perl_warner(aTHX_ WARN_SYNTAX,
5068 "Array @%s missing the @ in argument %"IVdf" of %s()",
5069 name, (IV)numargs, PL_op_desc[type]);
5072 kid->op_sibling = sibl;
5075 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5076 bad_type(numargs, "array", PL_op_desc[type], kid);
5080 if (kid->op_type == OP_CONST &&
5081 (kid->op_private & OPpCONST_BARE))
5083 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5084 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5085 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5086 if (ckWARN(WARN_SYNTAX))
5087 Perl_warner(aTHX_ WARN_SYNTAX,
5088 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5089 name, (IV)numargs, PL_op_desc[type]);
5092 kid->op_sibling = sibl;
5095 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5096 bad_type(numargs, "hash", PL_op_desc[type], kid);
5101 OP *newop = newUNOP(OP_NULL, 0, kid);
5102 kid->op_sibling = 0;
5104 newop->op_next = newop;
5106 kid->op_sibling = sibl;
5111 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5112 if (kid->op_type == OP_CONST &&
5113 (kid->op_private & OPpCONST_BARE))
5115 OP *newop = newGVOP(OP_GV, 0,
5116 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5121 else if (kid->op_type == OP_READLINE) {
5122 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5123 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5126 I32 flags = OPf_SPECIAL;
5128 /* is this op a FH constructor? */
5129 if (is_handle_constructor(o,numargs)) {
5131 /* Set a flag to tell rv2gv to vivify
5132 * need to "prove" flag does not mean something
5133 * else already - NI-S 1999/05/07
5137 /* Helps with open($array[$n],...)
5138 but is too simplistic - need to do selectively
5143 kid->op_sibling = 0;
5144 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5146 kid->op_private |= priv;
5149 kid->op_sibling = sibl;
5155 mod(scalar(kid), type);
5159 tokid = &kid->op_sibling;
5160 kid = kid->op_sibling;
5162 o->op_private |= numargs;
5164 return too_many_arguments(o,PL_op_desc[o->op_type]);
5167 else if (PL_opargs[type] & OA_DEFGV) {
5169 return newUNOP(type, 0, newDEFSVOP());
5173 while (oa & OA_OPTIONAL)
5175 if (oa && oa != OA_LIST)
5176 return too_few_arguments(o,PL_op_desc[o->op_type]);
5182 Perl_ck_glob(pTHX_ OP *o)
5186 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5187 append_elem(OP_GLOB, o, newDEFSVOP());
5189 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5190 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5192 #if defined(PERL_INTERNAL_GLOB) && !defined(MINIPERL_BUILD)
5193 /* XXX this can be tightened up and made more failsafe. */
5195 OP *modname = newSVOP(OP_CONST, 0, newSVpvn("File::Glob", 10));
5196 modname->op_private |= OPpCONST_BARE;
5198 utilize(1, start_subparse(FALSE, 0), Nullop, modname,
5199 newSVOP(OP_CONST, 0, newSVpvn("globally", 8)));
5200 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5203 #endif /* PERL_INTERNAL_GLOB && !MINIPERL_BUILD */
5205 if (gv && GvIMPORTED_CV(gv)) {
5206 append_elem(OP_GLOB, o,
5207 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5208 o->op_type = OP_LIST;
5209 o->op_ppaddr = PL_ppaddr[OP_LIST];
5210 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5211 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5212 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5213 append_elem(OP_LIST, o,
5214 scalar(newUNOP(OP_RV2CV, 0,
5215 newGVOP(OP_GV, 0, gv)))));
5216 o = newUNOP(OP_NULL, 0, ck_subr(o));
5217 o->op_targ = OP_GLOB; /* hint at what it used to be */
5220 gv = newGVgen("main");
5222 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5228 Perl_ck_grep(pTHX_ OP *o)
5232 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5234 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5235 NewOp(1101, gwop, 1, LOGOP);
5237 if (o->op_flags & OPf_STACKED) {
5240 kid = cLISTOPo->op_first->op_sibling;
5241 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5244 kid->op_next = (OP*)gwop;
5245 o->op_flags &= ~OPf_STACKED;
5247 kid = cLISTOPo->op_first->op_sibling;
5248 if (type == OP_MAPWHILE)
5255 kid = cLISTOPo->op_first->op_sibling;
5256 if (kid->op_type != OP_NULL)
5257 Perl_croak(aTHX_ "panic: ck_grep");
5258 kid = kUNOP->op_first;
5260 gwop->op_type = type;
5261 gwop->op_ppaddr = PL_ppaddr[type];
5262 gwop->op_first = listkids(o);
5263 gwop->op_flags |= OPf_KIDS;
5264 gwop->op_private = 1;
5265 gwop->op_other = LINKLIST(kid);
5266 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5267 kid->op_next = (OP*)gwop;
5269 kid = cLISTOPo->op_first->op_sibling;
5270 if (!kid || !kid->op_sibling)
5271 return too_few_arguments(o,PL_op_desc[o->op_type]);
5272 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5273 mod(kid, OP_GREPSTART);
5279 Perl_ck_index(pTHX_ OP *o)
5281 if (o->op_flags & OPf_KIDS) {
5282 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5284 kid = kid->op_sibling; /* get past "big" */
5285 if (kid && kid->op_type == OP_CONST)
5286 fbm_compile(((SVOP*)kid)->op_sv, 0);
5292 Perl_ck_lengthconst(pTHX_ OP *o)
5294 /* XXX length optimization goes here */
5299 Perl_ck_lfun(pTHX_ OP *o)
5301 OPCODE type = o->op_type;
5302 return modkids(ck_fun(o), type);
5306 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5309 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5310 switch (cUNOPo->op_first->op_type) {
5312 break; /* Globals via GV can be undef */
5314 case OP_AASSIGN: /* Is this a good idea? */
5315 Perl_warner(aTHX_ WARN_DEPRECATED,
5316 "defined(@array) is deprecated");
5317 Perl_warner(aTHX_ WARN_DEPRECATED,
5318 "(Maybe you should just omit the defined()?)\n");
5321 break; /* Globals via GV can be undef */
5323 Perl_warner(aTHX_ WARN_DEPRECATED,
5324 "defined(%hash) is deprecated");
5325 Perl_warner(aTHX_ WARN_DEPRECATED,
5326 "(Maybe you should just omit the defined()?)\n");
5337 Perl_ck_rfun(pTHX_ OP *o)
5339 OPCODE type = o->op_type;
5340 return refkids(ck_fun(o), type);
5344 Perl_ck_listiob(pTHX_ OP *o)
5348 kid = cLISTOPo->op_first;
5351 kid = cLISTOPo->op_first;
5353 if (kid->op_type == OP_PUSHMARK)
5354 kid = kid->op_sibling;
5355 if (kid && o->op_flags & OPf_STACKED)
5356 kid = kid->op_sibling;
5357 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5358 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5359 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5360 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5361 cLISTOPo->op_first->op_sibling = kid;
5362 cLISTOPo->op_last = kid;
5363 kid = kid->op_sibling;
5368 append_elem(o->op_type, o, newDEFSVOP());
5374 if (PL_hints & HINT_LOCALE)
5375 o->op_private |= OPpLOCALE;
5382 Perl_ck_fun_locale(pTHX_ OP *o)
5388 if (PL_hints & HINT_LOCALE)
5389 o->op_private |= OPpLOCALE;
5396 Perl_ck_sassign(pTHX_ OP *o)
5398 OP *kid = cLISTOPo->op_first;
5399 /* has a disposable target? */
5400 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5401 && !(kid->op_flags & OPf_STACKED))
5403 OP *kkid = kid->op_sibling;
5405 /* Can just relocate the target. */
5406 if (kkid && kkid->op_type == OP_PADSV
5407 && !(kkid->op_private & OPpLVAL_INTRO))
5409 /* Concat has problems if target is equal to right arg. */
5410 if (kid->op_type == OP_CONCAT) {
5411 if (kLISTOP->op_first->op_sibling->op_type == OP_PADSV
5412 && kLISTOP->op_first->op_sibling->op_targ == kkid->op_targ)
5415 else if (kid->op_type == OP_JOIN) {
5416 /* do_join has problems if the arguments coincide with target.
5417 In fact the second argument *can* safely coincide,
5418 but ignore=pessimize this rare occasion. */
5419 OP *arg = kLISTOP->op_first->op_sibling; /* Skip PUSHMARK */
5422 if (arg->op_type == OP_PADSV
5423 && arg->op_targ == kkid->op_targ)
5425 arg = arg->op_sibling;
5428 else if (kid->op_type == OP_QUOTEMETA) {
5429 /* quotemeta has problems if the argument coincides with target. */
5430 if (kLISTOP->op_first->op_type == OP_PADSV
5431 && kLISTOP->op_first->op_targ == kkid->op_targ)
5434 kid->op_targ = kkid->op_targ;
5435 /* Now we do not need PADSV and SASSIGN. */
5436 kid->op_sibling = o->op_sibling; /* NULL */
5437 cLISTOPo->op_first = NULL;
5440 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5448 Perl_ck_scmp(pTHX_ OP *o)
5452 if (PL_hints & HINT_LOCALE)
5453 o->op_private |= OPpLOCALE;
5460 Perl_ck_match(pTHX_ OP *o)
5462 o->op_private |= OPpRUNTIME;
5467 Perl_ck_method(pTHX_ OP *o)
5469 OP *kid = cUNOPo->op_first;
5470 if (kid->op_type == OP_CONST) {
5471 SV* sv = kSVOP->op_sv;
5472 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5474 sv_upgrade(sv, SVt_PVIV);
5476 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5477 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5478 kSVOP->op_sv = Nullsv;
5487 Perl_ck_null(pTHX_ OP *o)
5493 Perl_ck_repeat(pTHX_ OP *o)
5495 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5496 o->op_private |= OPpREPEAT_DOLIST;
5497 cBINOPo->op_first = force_list(cBINOPo->op_first);
5505 Perl_ck_require(pTHX_ OP *o)
5507 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5508 SVOP *kid = (SVOP*)cUNOPo->op_first;
5510 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5512 for (s = SvPVX(kid->op_sv); *s; s++) {
5513 if (*s == ':' && s[1] == ':') {
5515 Move(s+2, s+1, strlen(s+2)+1, char);
5516 --SvCUR(kid->op_sv);
5519 sv_catpvn(kid->op_sv, ".pm", 3);
5527 Perl_ck_retarget(pTHX_ OP *o)
5529 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5536 Perl_ck_select(pTHX_ OP *o)
5539 if (o->op_flags & OPf_KIDS) {
5540 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5541 if (kid && kid->op_sibling) {
5542 o->op_type = OP_SSELECT;
5543 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5545 return fold_constants(o);
5549 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5550 if (kid && kid->op_type == OP_RV2GV)
5551 kid->op_private &= ~HINT_STRICT_REFS;
5556 Perl_ck_shift(pTHX_ OP *o)
5558 I32 type = o->op_type;
5560 if (!(o->op_flags & OPf_KIDS)) {
5565 if (!CvUNIQUE(PL_compcv)) {
5566 argop = newOP(OP_PADAV, OPf_REF);
5567 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5570 argop = newUNOP(OP_RV2AV, 0,
5571 scalar(newGVOP(OP_GV, 0,
5572 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5575 argop = newUNOP(OP_RV2AV, 0,
5576 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5577 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5578 #endif /* USE_THREADS */
5579 return newUNOP(type, 0, scalar(argop));
5581 return scalar(modkids(ck_fun(o), type));
5585 Perl_ck_sort(pTHX_ OP *o)
5589 if (PL_hints & HINT_LOCALE)
5590 o->op_private |= OPpLOCALE;
5593 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5595 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5596 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5598 kid = kUNOP->op_first; /* get past null */
5600 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5602 if (kid->op_type == OP_SCOPE) {
5606 else if (kid->op_type == OP_LEAVE) {
5607 if (o->op_type == OP_SORT) {
5608 null(kid); /* wipe out leave */
5611 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5612 if (k->op_next == kid)
5617 kid->op_next = 0; /* just disconnect the leave */
5618 k = kLISTOP->op_first;
5622 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5623 if (o->op_type == OP_SORT)
5627 o->op_flags |= OPf_SPECIAL;
5629 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5630 null(cLISTOPo->op_first->op_sibling);
5637 S_simplify_sort(pTHX_ OP *o)
5640 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5643 if (!(o->op_flags & OPf_STACKED))
5645 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5646 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5647 kid = kUNOP->op_first; /* get past null */
5648 if (kid->op_type != OP_SCOPE)
5650 kid = kLISTOP->op_last; /* get past scope */
5651 switch(kid->op_type) {
5659 k = kid; /* remember this node*/
5660 if (kBINOP->op_first->op_type != OP_RV2SV)
5662 kid = kBINOP->op_first; /* get past cmp */
5663 if (kUNOP->op_first->op_type != OP_GV)
5665 kid = kUNOP->op_first; /* get past rv2sv */
5666 if (GvSTASH(kGVOP->op_gv) != PL_curstash)
5668 if (strEQ(GvNAME(kGVOP->op_gv), "a"))
5670 else if(strEQ(GvNAME(kGVOP->op_gv), "b"))
5674 kid = k; /* back to cmp */
5675 if (kBINOP->op_last->op_type != OP_RV2SV)
5677 kid = kBINOP->op_last; /* down to 2nd arg */
5678 if (kUNOP->op_first->op_type != OP_GV)
5680 kid = kUNOP->op_first; /* get past rv2sv */
5681 if (GvSTASH(kGVOP->op_gv) != PL_curstash
5683 ? strNE(GvNAME(kGVOP->op_gv), "a")
5684 : strNE(GvNAME(kGVOP->op_gv), "b")))
5686 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5688 o->op_private |= OPpSORT_REVERSE;
5689 if (k->op_type == OP_NCMP)
5690 o->op_private |= OPpSORT_NUMERIC;
5691 if (k->op_type == OP_I_NCMP)
5692 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5693 kid = cLISTOPo->op_first->op_sibling;
5694 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
5695 op_free(kid); /* then delete it */
5696 cLISTOPo->op_children--;
5700 Perl_ck_split(pTHX_ OP *o)
5704 if (o->op_flags & OPf_STACKED)
5705 return no_fh_allowed(o);
5707 kid = cLISTOPo->op_first;
5708 if (kid->op_type != OP_NULL)
5709 Perl_croak(aTHX_ "panic: ck_split");
5710 kid = kid->op_sibling;
5711 op_free(cLISTOPo->op_first);
5712 cLISTOPo->op_first = kid;
5714 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5715 cLISTOPo->op_last = kid; /* There was only one element previously */
5718 if (kid->op_type != OP_MATCH) {
5719 OP *sibl = kid->op_sibling;
5720 kid->op_sibling = 0;
5721 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5722 if (cLISTOPo->op_first == cLISTOPo->op_last)
5723 cLISTOPo->op_last = kid;
5724 cLISTOPo->op_first = kid;
5725 kid->op_sibling = sibl;
5728 kid->op_type = OP_PUSHRE;
5729 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5732 if (!kid->op_sibling)
5733 append_elem(OP_SPLIT, o, newDEFSVOP());
5735 kid = kid->op_sibling;
5738 if (!kid->op_sibling)
5739 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5741 kid = kid->op_sibling;
5744 if (kid->op_sibling)
5745 return too_many_arguments(o,PL_op_desc[o->op_type]);
5751 Perl_ck_join(pTHX_ OP *o)
5753 if (ckWARN(WARN_SYNTAX)) {
5754 OP *kid = cLISTOPo->op_first->op_sibling;
5755 if (kid && kid->op_type == OP_MATCH) {
5756 char *pmstr = "STRING";
5757 if (kPMOP->op_pmregexp)
5758 pmstr = kPMOP->op_pmregexp->precomp;
5759 Perl_warner(aTHX_ WARN_SYNTAX,
5760 "/%s/ should probably be written as \"%s\"",
5768 Perl_ck_subr(pTHX_ OP *o)
5771 OP *prev = ((cUNOPo->op_first->op_sibling)
5772 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5773 OP *o2 = prev->op_sibling;
5782 o->op_private |= OPpENTERSUB_HASTARG;
5783 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5784 if (cvop->op_type == OP_RV2CV) {
5786 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5787 null(cvop); /* disable rv2cv */
5788 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5789 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
5790 cv = GvCVu(tmpop->op_sv);
5792 tmpop->op_private |= OPpEARLY_CV;
5793 else if (SvPOK(cv)) {
5794 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5795 proto = SvPV((SV*)cv, n_a);
5799 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
5800 if (o2->op_type == OP_CONST)
5801 o2->op_private &= ~OPpCONST_STRICT;
5802 else if (o2->op_type == OP_LIST) {
5803 OP *o = ((UNOP*)o2)->op_first->op_sibling;
5804 if (o && o->op_type == OP_CONST)
5805 o->op_private &= ~OPpCONST_STRICT;
5808 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5809 if (PERLDB_SUB && PL_curstash != PL_debstash)
5810 o->op_private |= OPpENTERSUB_DB;
5811 while (o2 != cvop) {
5815 return too_many_arguments(o, gv_ename(namegv));
5833 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5834 bad_type(arg, "block", gv_ename(namegv), o2);
5837 /* '*' allows any scalar type, including bareword */
5840 if (o2->op_type == OP_RV2GV)
5841 goto wrapref; /* autoconvert GLOB -> GLOBref */
5842 else if (o2->op_type == OP_CONST)
5843 o2->op_private &= ~OPpCONST_STRICT;
5844 else if (o2->op_type == OP_ENTERSUB) {
5845 /* accidental subroutine, revert to bareword */
5846 OP *gvop = ((UNOP*)o2)->op_first;
5847 if (gvop && gvop->op_type == OP_NULL) {
5848 gvop = ((UNOP*)gvop)->op_first;
5850 for (; gvop->op_sibling; gvop = gvop->op_sibling)
5853 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
5854 (gvop = ((UNOP*)gvop)->op_first) &&
5855 gvop->op_type == OP_GV)
5857 GV *gv = (GV*)((SVOP*)gvop)->op_sv;
5858 OP *sibling = o2->op_sibling;
5859 SV *n = newSVpvn("",0);
5861 gv_fullname3(n, gv, "");
5862 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
5863 sv_chop(n, SvPVX(n)+6);
5864 o2 = newSVOP(OP_CONST, 0, n);
5865 prev->op_sibling = o2;
5866 o2->op_sibling = sibling;
5878 if (o2->op_type != OP_RV2GV)
5879 bad_type(arg, "symbol", gv_ename(namegv), o2);
5882 if (o2->op_type != OP_RV2CV)
5883 bad_type(arg, "sub", gv_ename(namegv), o2);
5886 if (o2->op_type != OP_RV2SV
5887 && o2->op_type != OP_PADSV
5888 && o2->op_type != OP_HELEM
5889 && o2->op_type != OP_AELEM
5890 && o2->op_type != OP_THREADSV)
5892 bad_type(arg, "scalar", gv_ename(namegv), o2);
5896 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5897 bad_type(arg, "array", gv_ename(namegv), o2);
5900 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5901 bad_type(arg, "hash", gv_ename(namegv), o2);
5905 OP* sib = kid->op_sibling;
5906 kid->op_sibling = 0;
5907 o2 = newUNOP(OP_REFGEN, 0, kid);
5908 o2->op_sibling = sib;
5909 prev->op_sibling = o2;
5920 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
5921 gv_ename(namegv), SvPV((SV*)cv, n_a));
5926 mod(o2, OP_ENTERSUB);
5928 o2 = o2->op_sibling;
5930 if (proto && !optional &&
5931 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5932 return too_few_arguments(o, gv_ename(namegv));
5937 Perl_ck_svconst(pTHX_ OP *o)
5939 SvREADONLY_on(cSVOPo->op_sv);
5944 Perl_ck_trunc(pTHX_ OP *o)
5946 if (o->op_flags & OPf_KIDS) {
5947 SVOP *kid = (SVOP*)cUNOPo->op_first;
5949 if (kid->op_type == OP_NULL)
5950 kid = (SVOP*)kid->op_sibling;
5951 if (kid && kid->op_type == OP_CONST &&
5952 (kid->op_private & OPpCONST_BARE))
5954 o->op_flags |= OPf_SPECIAL;
5955 kid->op_private &= ~OPpCONST_STRICT;
5961 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5964 Perl_peep(pTHX_ register OP *o)
5967 register OP* oldop = 0;
5969 OP *last_composite = Nullop;
5971 if (!o || o->op_seq)
5975 SAVESPTR(PL_curcop);
5976 for (; o; o = o->op_next) {
5982 switch (o->op_type) {
5986 PL_curcop = ((COP*)o); /* for warnings */
5987 o->op_seq = PL_op_seqmax++;
5988 last_composite = Nullop;
5992 if (cSVOPo->op_private & OPpCONST_STRICT)
5993 no_bareword_allowed(o);
5999 if ( o->op_next && o->op_next->op_type == OP_STRINGIFY
6000 && !(o->op_next->op_private & OPpTARGET_MY) )
6002 o->op_seq = PL_op_seqmax++;
6007 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6008 if (o->op_next->op_private & OPpTARGET_MY) {
6009 if ((o->op_flags & OPf_STACKED) /* chained concats */
6010 || (o->op_type == OP_CONCAT
6011 /* Concat has problems if target is equal to right arg. */
6012 && (((LISTOP*)o)->op_first->op_sibling->op_type
6014 && (((LISTOP*)o)->op_first->op_sibling->op_targ
6015 == o->op_next->op_targ))) {
6016 goto ignore_optimization;
6019 o->op_targ = o->op_next->op_targ;
6020 o->op_private |= OPpTARGET_MY;
6025 ignore_optimization:
6026 o->op_seq = PL_op_seqmax++;
6029 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6030 o->op_seq = PL_op_seqmax++;
6031 break; /* Scalar stub must produce undef. List stub is noop */
6035 if (o->op_targ == OP_NEXTSTATE
6036 || o->op_targ == OP_DBSTATE
6037 || o->op_targ == OP_SETSTATE)
6039 PL_curcop = ((COP*)o);
6046 if (oldop && o->op_next) {
6047 oldop->op_next = o->op_next;
6050 o->op_seq = PL_op_seqmax++;
6054 if (o->op_next->op_type == OP_RV2SV) {
6055 if (!(o->op_next->op_private & OPpDEREF)) {
6057 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
6058 o->op_next = o->op_next->op_next;
6059 o->op_type = OP_GVSV;
6060 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6063 else if (o->op_next->op_type == OP_RV2AV) {
6064 OP* pop = o->op_next->op_next;
6066 if (pop->op_type == OP_CONST &&
6067 (PL_op = pop->op_next) &&
6068 pop->op_next->op_type == OP_AELEM &&
6069 !(pop->op_next->op_private &
6070 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6071 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6078 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6079 o->op_next = pop->op_next->op_next;
6080 o->op_type = OP_AELEMFAST;
6081 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6082 o->op_private = (U8)i;
6083 GvAVn(((GVOP*)o)->op_gv);
6086 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_UNSAFE)) {
6087 GV *gv = cGVOPo->op_gv;
6088 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6089 /* XXX could check prototype here instead of just carping */
6090 SV *sv = sv_newmortal();
6091 gv_efullname3(sv, gv, Nullch);
6092 Perl_warner(aTHX_ WARN_UNSAFE,
6093 "%s() called too early to check prototype",
6098 o->op_seq = PL_op_seqmax++;
6109 o->op_seq = PL_op_seqmax++;
6110 while (cLOGOP->op_other->op_type == OP_NULL)
6111 cLOGOP->op_other = cLOGOP->op_other->op_next;
6112 peep(cLOGOP->op_other);
6116 o->op_seq = PL_op_seqmax++;
6117 peep(cLOOP->op_redoop);
6118 peep(cLOOP->op_nextop);
6119 peep(cLOOP->op_lastop);
6125 o->op_seq = PL_op_seqmax++;
6126 peep(cPMOP->op_pmreplstart);
6130 o->op_seq = PL_op_seqmax++;
6131 if (ckWARN(WARN_SYNTAX) && o->op_next
6132 && o->op_next->op_type == OP_NEXTSTATE) {
6133 if (o->op_next->op_sibling &&
6134 o->op_next->op_sibling->op_type != OP_EXIT &&
6135 o->op_next->op_sibling->op_type != OP_WARN &&
6136 o->op_next->op_sibling->op_type != OP_DIE) {
6137 line_t oldline = PL_curcop->cop_line;
6139 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
6140 Perl_warner(aTHX_ WARN_SYNTAX, "Statement unlikely to be reached");
6141 Perl_warner(aTHX_ WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
6142 PL_curcop->cop_line = oldline;
6156 if ((o->op_private & (OPpLVAL_INTRO))
6157 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6159 rop = (UNOP*)((BINOP*)o)->op_first;
6160 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6162 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6163 if (!SvOBJECT(lexname))
6165 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6166 if (!fields || !GvHV(*fields))
6168 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
6169 key = SvPV(*svp, keylen);
6170 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6172 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6173 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6175 ind = SvIV(*indsvp);
6177 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6178 rop->op_type = OP_RV2AV;
6179 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6180 o->op_type = OP_AELEM;
6181 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6183 *svp = newSViv(ind);
6189 if (!(o->op_flags & OPf_WANT)
6190 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6194 o->op_seq = PL_op_seqmax++;
6198 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6199 o->op_seq = PL_op_seqmax++;
6205 if (last_composite) {
6206 OP *r = last_composite;
6208 while (r->op_sibling)
6211 || (r->op_next->op_type == OP_LIST
6212 && r->op_next->op_next == o))
6214 if (last_composite->op_type == OP_RV2AV)
6215 yyerror("Lvalue subs returning arrays not implemented yet");
6217 yyerror("Lvalue subs returning hashes not implemented yet");
6224 o->op_seq = PL_op_seqmax++;