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
22 /* #define PL_OP_SLAB_ALLOC */
24 #ifdef PL_OP_SLAB_ALLOC
25 #define SLAB_SIZE 8192
26 static char *PL_OpPtr = NULL;
27 static int PL_OpSpace = 0;
28 #define NewOp(m,var,c,type) do { if ((PL_OpSpace -= c*sizeof(type)) >= 0) \
29 var = (type *)(PL_OpPtr -= c*sizeof(type)); \
31 var = (type *) Slab_Alloc(m,c*sizeof(type)); \
35 S_Slab_Alloc(pTHX_ int m, size_t sz)
37 Newz(m,PL_OpPtr,SLAB_SIZE,char);
38 PL_OpSpace = SLAB_SIZE - sz;
39 return PL_OpPtr += PL_OpSpace;
43 #define NewOp(m, var, c, type) Newz(m, var, c, type)
46 * In the following definition, the ", Nullop" is just to make the compiler
47 * think the expression is of the right type: croak actually does a Siglongjmp.
49 #define CHECKOP(type,o) \
50 ((PL_op_mask && PL_op_mask[type]) \
51 ? ( op_free((OP*)o), \
52 Perl_croak(aTHX_ "%s trapped by operation mask", PL_op_desc[type]), \
54 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
56 #define PAD_MAX 999999999
59 S_gv_ename(pTHX_ GV *gv)
62 SV* tmpsv = sv_newmortal();
63 gv_efullname3(tmpsv, gv, Nullch);
64 return SvPV(tmpsv,n_a);
68 S_no_fh_allowed(pTHX_ OP *o)
70 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
71 PL_op_desc[o->op_type]));
76 S_too_few_arguments(pTHX_ OP *o, char *name)
78 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
83 S_too_many_arguments(pTHX_ OP *o, char *name)
85 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
90 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
92 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
93 (int)n, name, t, PL_op_desc[kid->op_type]));
97 S_no_bareword_allowed(pTHX_ OP *o)
99 Perl_warn(aTHX_ "Bareword \"%s\" not allowed while \"strict subs\" in use",
100 SvPV_nolen(cSVOPo->op_sv));
104 /* "register" allocation */
107 Perl_pad_allocmy(pTHX_ char *name)
115 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
116 name[1] == '_' && (int)strlen(name) > 2))
118 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
119 /* 1999-02-27 mjd@plover.com */
121 p = strchr(name, '\0');
122 /* The next block assumes the buffer is at least 205 chars
123 long. At present, it's always at least 256 chars. */
125 strcpy(name+200, "...");
131 /* Move everything else down one character */
132 for (; p-name > 2; p--)
134 name[2] = toCTRL(name[1]);
137 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
139 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
140 SV **svp = AvARRAY(PL_comppad_name);
141 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
143 && sv != &PL_sv_undef
144 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
145 && strEQ(name, SvPVX(sv)))
147 Perl_warner(aTHX_ WARN_UNSAFE,
148 "\"my\" variable %s masks earlier declaration in same %s",
149 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
154 off = pad_alloc(OP_PADSV, SVs_PADMY);
156 sv_upgrade(sv, SVt_PVNV);
158 if (PL_in_my_stash) {
160 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"my\"",
163 (void)SvUPGRADE(sv, SVt_PVMG);
164 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
167 av_store(PL_comppad_name, off, sv);
168 SvNVX(sv) = (NV)PAD_MAX;
169 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
170 if (!PL_min_intro_pending)
171 PL_min_intro_pending = off;
172 PL_max_intro_pending = off;
174 av_store(PL_comppad, off, (SV*)newAV());
175 else if (*name == '%')
176 av_store(PL_comppad, off, (SV*)newHV());
177 SvPADMY_on(PL_curpad[off]);
181 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
184 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
185 I32 cx_ix, I32 saweval, U32 flags)
192 register PERL_CONTEXT *cx;
194 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
195 AV *curlist = CvPADLIST(cv);
196 SV **svp = av_fetch(curlist, 0, FALSE);
199 if (!svp || *svp == &PL_sv_undef)
202 svp = AvARRAY(curname);
203 for (off = AvFILLp(curname); off > 0; off--) {
204 if ((sv = svp[off]) &&
205 sv != &PL_sv_undef &&
207 seq > I_32(SvNVX(sv)) &&
208 strEQ(SvPVX(sv), name))
219 return 0; /* don't clone from inactive stack frame */
223 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
224 oldsv = *av_fetch(oldpad, off, TRUE);
225 if (!newoff) { /* Not a mere clone operation. */
226 SV *namesv = NEWSV(1103,0);
227 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
228 sv_upgrade(namesv, SVt_PVNV);
229 sv_setpv(namesv, name);
230 av_store(PL_comppad_name, newoff, namesv);
231 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
232 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
233 SvFAKE_on(namesv); /* A ref, not a real var */
234 if (SvOBJECT(sv)) { /* A typed var */
236 (void)SvUPGRADE(namesv, SVt_PVMG);
237 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
240 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
241 /* "It's closures all the way down." */
242 CvCLONE_on(PL_compcv);
244 if (CvANON(PL_compcv))
245 oldsv = Nullsv; /* no need to keep ref */
250 bcv && bcv != cv && !CvCLONE(bcv);
251 bcv = CvOUTSIDE(bcv))
256 if (ckWARN(WARN_CLOSURE)
257 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
259 Perl_warner(aTHX_ WARN_CLOSURE,
260 "Variable \"%s\" may be unavailable",
268 else if (!CvUNIQUE(PL_compcv)) {
269 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
270 Perl_warner(aTHX_ WARN_CLOSURE,
271 "Variable \"%s\" will not stay shared", name);
274 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
280 if (flags & FINDLEX_NOSEARCH)
283 /* Nothing in current lexical context--try eval's context, if any.
284 * This is necessary to let the perldb get at lexically scoped variables.
285 * XXX This will also probably interact badly with eval tree caching.
288 for (i = cx_ix; i >= 0; i--) {
290 switch (CxTYPE(cx)) {
292 if (i == 0 && saweval) {
293 seq = cxstack[saweval].blk_oldcop->cop_seq;
294 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
298 switch (cx->blk_eval.old_op_type) {
304 /* require must have its own scope */
312 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
313 saweval = i; /* so we know where we were called from */
316 seq = cxstack[saweval].blk_oldcop->cop_seq;
317 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
325 Perl_pad_findmy(pTHX_ char *name)
331 SV **svp = AvARRAY(PL_comppad_name);
332 U32 seq = PL_cop_seqmax;
338 * Special case to get lexical (and hence per-thread) @_.
339 * XXX I need to find out how to tell at parse-time whether use
340 * of @_ should refer to a lexical (from a sub) or defgv (global
341 * scope and maybe weird sub-ish things like formats). See
342 * startsub in perly.y. It's possible that @_ could be lexical
343 * (at least from subs) even in non-threaded perl.
345 if (strEQ(name, "@_"))
346 return 0; /* success. (NOT_IN_PAD indicates failure) */
347 #endif /* USE_THREADS */
349 /* The one we're looking for is probably just before comppad_name_fill. */
350 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
351 if ((sv = svp[off]) &&
352 sv != &PL_sv_undef &&
355 seq > I_32(SvNVX(sv)))) &&
356 strEQ(SvPVX(sv), name))
359 return (PADOFFSET)off;
360 pendoff = off; /* this pending def. will override import */
364 outside = CvOUTSIDE(PL_compcv);
366 /* Check if if we're compiling an eval'', and adjust seq to be the
367 * eval's seq number. This depends on eval'' having a non-null
368 * CvOUTSIDE() while it is being compiled. The eval'' itself is
369 * identified by CvEVAL being true and CvGV being null. */
370 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
371 cx = &cxstack[cxstack_ix];
373 seq = cx->blk_oldcop->cop_seq;
376 /* See if it's in a nested scope */
377 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
379 /* If there is a pending local definition, this new alias must die */
381 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
382 return off; /* pad_findlex returns 0 for failure...*/
384 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
388 Perl_pad_leavemy(pTHX_ I32 fill)
392 SV **svp = AvARRAY(PL_comppad_name);
394 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
395 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
396 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
397 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
400 /* "Deintroduce" my variables that are leaving with this scope. */
401 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
402 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
403 SvIVX(sv) = PL_cop_seqmax;
408 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
414 if (AvARRAY(PL_comppad) != PL_curpad)
415 Perl_croak(aTHX_ "panic: pad_alloc");
416 if (PL_pad_reset_pending)
418 if (tmptype & SVs_PADMY) {
420 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
421 } while (SvPADBUSY(sv)); /* need a fresh one */
422 retval = AvFILLp(PL_comppad);
425 SV **names = AvARRAY(PL_comppad_name);
426 SSize_t names_fill = AvFILLp(PL_comppad_name);
429 * "foreach" index vars temporarily become aliases to non-"my"
430 * values. Thus we must skip, not just pad values that are
431 * marked as current pad values, but also those with names.
433 if (++PL_padix <= names_fill &&
434 (sv = names[PL_padix]) && sv != &PL_sv_undef)
436 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
437 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
442 SvFLAGS(sv) |= tmptype;
443 PL_curpad = AvARRAY(PL_comppad);
445 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
446 (unsigned long) thr, (unsigned long) PL_curpad,
447 (long) retval, PL_op_name[optype]));
449 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
450 (unsigned long) PL_curpad,
451 (long) retval, PL_op_name[optype]));
452 #endif /* USE_THREADS */
453 return (PADOFFSET)retval;
457 Perl_pad_sv(pTHX_ PADOFFSET po)
461 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
462 (unsigned long) thr, (unsigned long) PL_curpad, po));
465 Perl_croak(aTHX_ "panic: pad_sv po");
466 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
467 (unsigned long) PL_curpad, po));
468 #endif /* USE_THREADS */
469 return PL_curpad[po]; /* eventually we'll turn this into a macro */
473 Perl_pad_free(pTHX_ PADOFFSET po)
478 if (AvARRAY(PL_comppad) != PL_curpad)
479 Perl_croak(aTHX_ "panic: pad_free curpad");
481 Perl_croak(aTHX_ "panic: pad_free po");
483 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
484 (unsigned long) thr, (unsigned long) PL_curpad, po));
486 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
487 (unsigned long) PL_curpad, po));
488 #endif /* USE_THREADS */
489 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
490 SvPADTMP_off(PL_curpad[po]);
491 if ((I32)po < PL_padix)
496 Perl_pad_swipe(pTHX_ PADOFFSET po)
499 if (AvARRAY(PL_comppad) != PL_curpad)
500 Perl_croak(aTHX_ "panic: pad_swipe curpad");
502 Perl_croak(aTHX_ "panic: pad_swipe po");
504 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
505 (unsigned long) thr, (unsigned long) PL_curpad, po));
507 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
508 (unsigned long) PL_curpad, po));
509 #endif /* USE_THREADS */
510 SvPADTMP_off(PL_curpad[po]);
511 PL_curpad[po] = NEWSV(1107,0);
512 SvPADTMP_on(PL_curpad[po]);
513 if ((I32)po < PL_padix)
517 /* XXX pad_reset() is currently disabled because it results in serious bugs.
518 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
519 * on the stack by OPs that use them, there are several ways to get an alias
520 * to a shared TARG. Such an alias will change randomly and unpredictably.
521 * We avoid doing this until we can think of a Better Way.
526 #ifdef USE_BROKEN_PAD_RESET
530 if (AvARRAY(PL_comppad) != PL_curpad)
531 Perl_croak(aTHX_ "panic: pad_reset curpad");
533 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
534 (unsigned long) thr, (unsigned long) PL_curpad));
536 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
537 (unsigned long) PL_curpad));
538 #endif /* USE_THREADS */
539 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
540 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
541 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
542 SvPADTMP_off(PL_curpad[po]);
544 PL_padix = PL_padix_floor;
547 PL_pad_reset_pending = FALSE;
551 /* find_threadsv is not reentrant */
553 Perl_find_threadsv(pTHX_ const char *name)
559 /* We currently only handle names of a single character */
560 p = strchr(PL_threadsv_names, *name);
563 key = p - PL_threadsv_names;
564 MUTEX_LOCK(&thr->mutex);
565 svp = av_fetch(thr->threadsv, key, FALSE);
567 MUTEX_UNLOCK(&thr->mutex);
569 SV *sv = NEWSV(0, 0);
570 av_store(thr->threadsv, key, sv);
571 thr->threadsvp = AvARRAY(thr->threadsv);
572 MUTEX_UNLOCK(&thr->mutex);
574 * Some magic variables used to be automagically initialised
575 * in gv_fetchpv. Those which are now per-thread magicals get
576 * initialised here instead.
582 sv_setpv(sv, "\034");
583 sv_magic(sv, 0, 0, name, 1);
588 PL_sawampersand = TRUE;
602 /* XXX %! tied to Errno.pm needs to be added here.
603 * See gv_fetchpv(). */
607 sv_magic(sv, 0, 0, name, 1);
609 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
610 "find_threadsv: new SV %p for $%s%c\n",
611 sv, (*name < 32) ? "^" : "",
612 (*name < 32) ? toCTRL(*name) : *name));
616 #endif /* USE_THREADS */
621 Perl_op_free(pTHX_ OP *o)
623 register OP *kid, *nextkid;
626 if (!o || o->op_seq == (U16)-1)
629 if (o->op_flags & OPf_KIDS) {
630 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
631 nextkid = kid->op_sibling; /* Get before next freeing kid */
639 /* COP* is not cleared by op_clear() so that we may track line
640 * numbers etc even after null() */
641 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
646 #ifdef PL_OP_SLAB_ALLOC
647 if ((char *) o == PL_OpPtr)
656 S_op_clear(pTHX_ OP *o)
658 switch (o->op_type) {
659 case OP_NULL: /* Was holding old type, if any. */
660 case OP_ENTEREVAL: /* Was holding hints. */
662 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
668 if (!(o->op_flags & OPf_SPECIAL))
671 #endif /* USE_THREADS */
673 if (!(o->op_flags & OPf_REF)
674 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
680 SvREFCNT_dec(cGVOPo->op_gv);
681 cGVOPo->op_gv = Nullgv;
684 SvREFCNT_dec(cSVOPo->op_sv);
685 cSVOPo->op_sv = Nullsv;
691 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
695 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
696 SvREFCNT_dec(cSVOPo->op_sv);
697 cSVOPo->op_sv = Nullsv;
700 Safefree(cPVOPo->op_pv);
701 cPVOPo->op_pv = Nullch;
705 op_free(cPMOPo->op_pmreplroot);
706 cPMOPo->op_pmreplroot = Nullop;
711 ReREFCNT_dec(cPMOPo->op_pmregexp);
712 cPMOPo->op_pmregexp = (REGEXP*)NULL;
717 pad_free(o->op_targ);
721 S_cop_free(pTHX_ COP* cop)
723 Safefree(cop->cop_label);
724 SvREFCNT_dec(cop->cop_filegv);
725 if (! specialWARN(cop->cop_warnings))
726 SvREFCNT_dec(cop->cop_warnings);
732 if (o->op_type == OP_NULL)
735 o->op_targ = o->op_type;
736 o->op_type = OP_NULL;
737 o->op_ppaddr = PL_ppaddr[OP_NULL];
740 /* Contextualizers */
742 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
745 Perl_linklist(pTHX_ OP *o)
752 /* establish postfix order */
753 if (cUNOPo->op_first) {
754 o->op_next = LINKLIST(cUNOPo->op_first);
755 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
757 kid->op_next = LINKLIST(kid->op_sibling);
769 Perl_scalarkids(pTHX_ OP *o)
772 if (o && o->op_flags & OPf_KIDS) {
773 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
780 S_scalarboolean(pTHX_ OP *o)
782 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
784 if (ckWARN(WARN_SYNTAX)) {
785 line_t oldline = PL_curcop->cop_line;
787 if (PL_copline != NOLINE)
788 PL_curcop->cop_line = PL_copline;
789 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
790 PL_curcop->cop_line = oldline;
797 Perl_scalar(pTHX_ OP *o)
801 /* assumes no premature commitment */
802 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
803 || o->op_type == OP_RETURN)
806 if ((o->op_private & OPpTARGET_MY)
807 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
808 return scalar(o); /* As if inside SASSIGN */
810 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
812 switch (o->op_type) {
814 if (o->op_private & OPpREPEAT_DOLIST)
815 null(((LISTOP*)cBINOPo->op_first)->op_first);
816 scalar(cBINOPo->op_first);
821 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
825 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
826 if (!kPMOP->op_pmreplroot)
827 deprecate("implicit split to @_");
835 if (o->op_flags & OPf_KIDS) {
836 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
842 kid = cLISTOPo->op_first;
844 while (kid = kid->op_sibling) {
850 WITH_THR(PL_curcop = &PL_compiling);
855 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
861 WITH_THR(PL_curcop = &PL_compiling);
868 Perl_scalarvoid(pTHX_ OP *o)
875 if (o->op_type == OP_NEXTSTATE
876 || o->op_type == OP_SETSTATE
877 || o->op_type == OP_DBSTATE
878 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
879 || o->op_targ == OP_SETSTATE
880 || o->op_targ == OP_DBSTATE)))
883 PL_curcop = (COP*)o; /* for warning below */
886 /* assumes no premature commitment */
887 want = o->op_flags & OPf_WANT;
888 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
889 || o->op_type == OP_RETURN)
892 if ((o->op_private & OPpTARGET_MY)
893 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
894 return scalar(o); /* As if inside SASSIGN */
896 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
898 switch (o->op_type) {
900 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
904 if (o->op_flags & OPf_STACKED)
908 if (o->op_private == 4)
979 if (!(o->op_private & OPpLVAL_INTRO))
980 useless = PL_op_desc[o->op_type];
987 if (!(o->op_private & OPpLVAL_INTRO) &&
988 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
989 useless = "a variable";
994 if (cSVOPo->op_private & OPpCONST_STRICT)
995 no_bareword_allowed(o);
998 if (ckWARN(WARN_VOID)) {
999 useless = "a constant";
1000 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1002 else if (SvPOK(sv)) {
1003 if (strnEQ(SvPVX(sv), "di", 2) ||
1004 strnEQ(SvPVX(sv), "ds", 2) ||
1005 strnEQ(SvPVX(sv), "ig", 2))
1010 null(o); /* don't execute or even remember it */
1014 o->op_type = OP_PREINC; /* pre-increment is faster */
1015 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1019 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1020 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1026 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1031 if (o->op_flags & OPf_STACKED)
1039 if (!(o->op_flags & OPf_KIDS))
1048 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1055 /* all requires must return a boolean value */
1056 o->op_flags &= ~OPf_WANT;
1059 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1060 if (!kPMOP->op_pmreplroot)
1061 deprecate("implicit split to @_");
1067 if (ckWARN(WARN_VOID))
1068 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1074 Perl_listkids(pTHX_ OP *o)
1077 if (o && o->op_flags & OPf_KIDS) {
1078 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1085 Perl_list(pTHX_ OP *o)
1089 /* assumes no premature commitment */
1090 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1091 || o->op_type == OP_RETURN)
1094 if ((o->op_private & OPpTARGET_MY)
1095 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
1096 return o; /* As if inside SASSIGN */
1098 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1100 switch (o->op_type) {
1103 list(cBINOPo->op_first);
1108 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1116 if (!(o->op_flags & OPf_KIDS))
1118 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1119 list(cBINOPo->op_first);
1120 return gen_constant_list(o);
1127 kid = cLISTOPo->op_first;
1129 while (kid = kid->op_sibling) {
1130 if (kid->op_sibling)
1135 WITH_THR(PL_curcop = &PL_compiling);
1139 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1140 if (kid->op_sibling)
1145 WITH_THR(PL_curcop = &PL_compiling);
1148 /* all requires must return a boolean value */
1149 o->op_flags &= ~OPf_WANT;
1156 Perl_scalarseq(pTHX_ OP *o)
1161 if (o->op_type == OP_LINESEQ ||
1162 o->op_type == OP_SCOPE ||
1163 o->op_type == OP_LEAVE ||
1164 o->op_type == OP_LEAVETRY)
1167 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1168 if (kid->op_sibling) {
1172 PL_curcop = &PL_compiling;
1174 o->op_flags &= ~OPf_PARENS;
1175 if (PL_hints & HINT_BLOCK_SCOPE)
1176 o->op_flags |= OPf_PARENS;
1179 o = newOP(OP_STUB, 0);
1184 S_modkids(pTHX_ OP *o, I32 type)
1187 if (o && o->op_flags & OPf_KIDS) {
1188 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1195 Perl_mod(pTHX_ OP *o, I32 type)
1202 if (!o || PL_error_count)
1205 if ((o->op_private & OPpTARGET_MY)
1206 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
1209 switch (o->op_type) {
1214 if (!(o->op_private & (OPpCONST_ARYBASE)))
1216 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1217 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1221 SAVEI32(PL_compiling.cop_arybase);
1222 PL_compiling.cop_arybase = 0;
1224 else if (type == OP_REFGEN)
1227 Perl_croak(aTHX_ "That use of $[ is unsupported");
1230 if (o->op_flags & OPf_PARENS)
1234 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1235 !(o->op_flags & OPf_STACKED)) {
1236 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1237 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1238 assert(cUNOPo->op_first->op_type == OP_NULL);
1239 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1245 /* grep, foreach, subcalls, refgen */
1246 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1248 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1249 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1250 ? "do block" : PL_op_desc[o->op_type]),
1251 type ? PL_op_desc[type] : "local"));
1265 case OP_RIGHT_SHIFT:
1274 if (!(o->op_flags & OPf_STACKED))
1280 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1286 if (!type && cUNOPo->op_first->op_type != OP_GV)
1287 Perl_croak(aTHX_ "Can't localize through a reference");
1288 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1289 PL_modcount = 10000;
1290 return o; /* Treat \(@foo) like ordinary list. */
1294 if (scalar_mod_type(o, type))
1296 ref(cUNOPo->op_first, o->op_type);
1305 PL_modcount = 10000;
1308 if (!type && cUNOPo->op_first->op_type != OP_GV)
1309 Perl_croak(aTHX_ "Can't localize through a reference");
1310 ref(cUNOPo->op_first, o->op_type);
1314 PL_hints |= HINT_BLOCK_SCOPE;
1324 PL_modcount = 10000;
1325 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1326 return o; /* Treat \(@foo) like ordinary list. */
1327 if (scalar_mod_type(o, type))
1333 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1334 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1339 PL_modcount++; /* XXX ??? */
1341 #endif /* USE_THREADS */
1347 if (type != OP_SASSIGN)
1351 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1357 pad_free(o->op_targ);
1358 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1359 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1360 if (o->op_flags & OPf_KIDS)
1361 mod(cBINOPo->op_first->op_sibling, type);
1366 ref(cBINOPo->op_first, o->op_type);
1367 if (type == OP_ENTERSUB &&
1368 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1369 o->op_private |= OPpLVAL_DEFER;
1376 if (o->op_flags & OPf_KIDS)
1377 mod(cLISTOPo->op_last, type);
1381 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1383 else if (!(o->op_flags & OPf_KIDS))
1385 if (o->op_targ != OP_LIST) {
1386 mod(cBINOPo->op_first, type);
1391 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1395 o->op_flags |= OPf_MOD;
1397 if (type == OP_AASSIGN || type == OP_SASSIGN)
1398 o->op_flags |= OPf_SPECIAL|OPf_REF;
1400 o->op_private |= OPpLVAL_INTRO;
1401 o->op_flags &= ~OPf_SPECIAL;
1402 PL_hints |= HINT_BLOCK_SCOPE;
1404 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1405 o->op_flags |= OPf_REF;
1410 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1414 if (o->op_type == OP_RV2GV)
1438 case OP_RIGHT_SHIFT:
1457 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1459 switch (o->op_type) {
1467 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1480 Perl_refkids(pTHX_ OP *o, I32 type)
1483 if (o && o->op_flags & OPf_KIDS) {
1484 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1491 Perl_ref(pTHX_ OP *o, I32 type)
1495 if (!o || PL_error_count)
1498 switch (o->op_type) {
1500 if ((type == OP_DEFINED || type == OP_LOCK) &&
1501 !(o->op_flags & OPf_STACKED)) {
1502 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1503 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1504 assert(cUNOPo->op_first->op_type == OP_NULL);
1505 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1506 o->op_flags |= OPf_SPECIAL;
1511 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1515 if (type == OP_DEFINED)
1516 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1517 ref(cUNOPo->op_first, o->op_type);
1520 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1521 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1522 : type == OP_RV2HV ? OPpDEREF_HV
1524 o->op_flags |= OPf_MOD;
1529 o->op_flags |= OPf_MOD; /* XXX ??? */
1534 o->op_flags |= OPf_REF;
1537 if (type == OP_DEFINED)
1538 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1539 ref(cUNOPo->op_first, o->op_type);
1544 o->op_flags |= OPf_REF;
1549 if (!(o->op_flags & OPf_KIDS))
1551 ref(cBINOPo->op_first, type);
1555 ref(cBINOPo->op_first, o->op_type);
1556 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1557 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1558 : type == OP_RV2HV ? OPpDEREF_HV
1560 o->op_flags |= OPf_MOD;
1568 if (!(o->op_flags & OPf_KIDS))
1570 ref(cLISTOPo->op_last, type);
1580 S_dup_attrlist(pTHX_ OP *o)
1584 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1585 * where the first kid is OP_PUSHMARK and the remaining ones
1586 * are OP_CONST. We need to push the OP_CONST values.
1588 if (o->op_type == OP_CONST)
1589 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1591 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1592 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1593 if (o->op_type == OP_CONST)
1594 rop = append_elem(OP_LIST, rop,
1595 newSVOP(OP_CONST, o->op_flags,
1596 SvREFCNT_inc(cSVOPo->op_sv)));
1603 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1605 OP *modname; /* for 'use' */
1608 /* fake up C<use attributes $pkg,$rv,@attrs> */
1609 ENTER; /* need to protect against side-effects of 'use' */
1611 if (stash && HvNAME(stash))
1612 stashsv = newSVpv(HvNAME(stash), 0);
1614 stashsv = &PL_sv_no;
1615 #define ATTRSMODULE "attributes"
1616 modname = newSVOP(OP_CONST, 0,
1617 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1));
1618 modname->op_private |= OPpCONST_BARE;
1619 /* that flag is required to make 'use' work right */
1620 utilize(1, start_subparse(FALSE, 0),
1621 Nullop, /* version */
1623 prepend_elem(OP_LIST,
1624 newSVOP(OP_CONST, 0, stashsv),
1625 prepend_elem(OP_LIST,
1626 newSVOP(OP_CONST, 0, newRV(target)),
1627 dup_attrlist(attrs))));
1632 S_my_kid(pTHX_ OP *o, OP *attrs)
1637 if (!o || PL_error_count)
1641 if (type == OP_LIST) {
1642 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1644 } else if (type == OP_UNDEF) {
1646 } else if (type != OP_PADSV &&
1649 type != OP_PUSHMARK)
1651 yyerror(Perl_form(aTHX_ "Can't declare %s in my", PL_op_desc[o->op_type]));
1654 else if (attrs && type != OP_PUSHMARK) {
1659 /* check for C<my Dog $spot> when deciding package */
1660 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1661 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1662 stash = SvSTASH(*namesvp);
1664 stash = PL_curstash;
1665 padsv = PAD_SV(o->op_targ);
1666 apply_attrs(stash, padsv, attrs);
1668 o->op_flags |= OPf_MOD;
1669 o->op_private |= OPpLVAL_INTRO;
1674 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1676 if (o->op_flags & OPf_PARENS)
1679 PL_in_my_stash = Nullhv;
1682 return my_kid(o, attrs);
1686 Perl_my(pTHX_ OP *o)
1688 return my_kid(o, Nullop);
1692 Perl_sawparens(pTHX_ OP *o)
1695 o->op_flags |= OPf_PARENS;
1700 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1705 if (ckWARN(WARN_UNSAFE) &&
1706 (left->op_type == OP_RV2AV ||
1707 left->op_type == OP_RV2HV ||
1708 left->op_type == OP_PADAV ||
1709 left->op_type == OP_PADHV)) {
1710 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1711 right->op_type == OP_TRANS)
1712 ? right->op_type : OP_MATCH];
1713 char *sample = ((left->op_type == OP_RV2AV ||
1714 left->op_type == OP_PADAV)
1715 ? "@array" : "%hash");
1716 Perl_warner(aTHX_ WARN_UNSAFE,
1717 "Applying %s to %s will act on scalar(%s)",
1718 desc, sample, sample);
1721 if (right->op_type == OP_MATCH ||
1722 right->op_type == OP_SUBST ||
1723 right->op_type == OP_TRANS) {
1724 right->op_flags |= OPf_STACKED;
1725 if (right->op_type != OP_MATCH)
1726 left = mod(left, right->op_type);
1727 if (right->op_type == OP_TRANS)
1728 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1730 o = prepend_elem(right->op_type, scalar(left), right);
1732 return newUNOP(OP_NOT, 0, scalar(o));
1736 return bind_match(type, left,
1737 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1741 Perl_invert(pTHX_ OP *o)
1745 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1746 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1750 Perl_scope(pTHX_ OP *o)
1753 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1754 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1755 o->op_type = OP_LEAVE;
1756 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1759 if (o->op_type == OP_LINESEQ) {
1761 o->op_type = OP_SCOPE;
1762 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1763 kid = ((LISTOP*)o)->op_first;
1764 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1765 kid->op_type = OP_SETSTATE;
1766 kid->op_ppaddr = PL_ppaddr[OP_SETSTATE];
1770 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1777 Perl_save_hints(pTHX)
1780 SAVESPTR(GvHV(PL_hintgv));
1781 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1782 SAVEFREESV(GvHV(PL_hintgv));
1786 Perl_block_start(pTHX_ int full)
1789 int retval = PL_savestack_ix;
1791 SAVEI32(PL_comppad_name_floor);
1793 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1794 PL_comppad_name_floor = PL_comppad_name_fill;
1796 PL_comppad_name_floor = 0;
1798 SAVEI32(PL_min_intro_pending);
1799 SAVEI32(PL_max_intro_pending);
1800 PL_min_intro_pending = 0;
1801 SAVEI32(PL_comppad_name_fill);
1802 SAVEI32(PL_padix_floor);
1803 PL_padix_floor = PL_padix;
1804 PL_pad_reset_pending = FALSE;
1806 PL_hints &= ~HINT_BLOCK_SCOPE;
1807 SAVEPPTR(PL_compiling.cop_warnings);
1808 if (! specialWARN(PL_compiling.cop_warnings)) {
1809 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1810 SAVEFREESV(PL_compiling.cop_warnings) ;
1818 Perl_block_end(pTHX_ I32 floor, OP *seq)
1821 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1822 OP* retval = scalarseq(seq);
1824 PL_pad_reset_pending = FALSE;
1825 PL_compiling.op_private = PL_hints;
1827 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1828 pad_leavemy(PL_comppad_name_fill);
1837 OP *o = newOP(OP_THREADSV, 0);
1838 o->op_targ = find_threadsv("_");
1841 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1842 #endif /* USE_THREADS */
1846 Perl_newPROG(pTHX_ OP *o)
1852 PL_eval_root = newUNOP(OP_LEAVEEVAL,
1853 ((PL_in_eval & EVAL_KEEPERR)
1854 ? OPf_SPECIAL : 0), o);
1855 PL_eval_start = linklist(PL_eval_root);
1856 PL_eval_root->op_next = 0;
1857 peep(PL_eval_start);
1862 PL_main_root = scope(sawparens(scalarvoid(o)));
1863 PL_curcop = &PL_compiling;
1864 PL_main_start = LINKLIST(PL_main_root);
1865 PL_main_root->op_next = 0;
1866 peep(PL_main_start);
1869 /* Register with debugger */
1871 CV *cv = get_cv("DB::postponed", FALSE);
1875 XPUSHs((SV*)PL_compiling.cop_filegv);
1877 call_sv((SV*)cv, G_DISCARD);
1884 Perl_localize(pTHX_ OP *o, I32 lex)
1886 if (o->op_flags & OPf_PARENS)
1890 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1892 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1893 if (*s == ';' || *s == '=')
1894 Perl_warner(aTHX_ WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1895 lex ? "my" : "local");
1899 PL_in_my_stash = Nullhv;
1903 return mod(o, OP_NULL); /* a bit kludgey */
1907 Perl_jmaybe(pTHX_ OP *o)
1909 if (o->op_type == OP_LIST) {
1912 o2 = newOP(OP_THREADSV, 0);
1913 o2->op_targ = find_threadsv(";");
1915 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1916 #endif /* USE_THREADS */
1917 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1923 Perl_fold_constants(pTHX_ register OP *o)
1927 I32 type = o->op_type;
1930 if (PL_opargs[type] & OA_RETSCALAR)
1932 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
1933 o->op_targ = pad_alloc(type, SVs_PADTMP);
1935 /* integerize op, unless it happens to be C<-foo>.
1936 * XXX should pp_i_negate() do magic string negation instead? */
1937 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
1938 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
1939 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
1941 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1944 if (!(PL_opargs[type] & OA_FOLDCONST))
1949 /* XXX might want a ck_negate() for this */
1950 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
1963 if (o->op_private & OPpLOCALE)
1968 goto nope; /* Don't try to run w/ errors */
1970 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1971 if ((curop->op_type != OP_CONST ||
1972 (curop->op_private & OPpCONST_BARE)) &&
1973 curop->op_type != OP_LIST &&
1974 curop->op_type != OP_SCALAR &&
1975 curop->op_type != OP_NULL &&
1976 curop->op_type != OP_PUSHMARK)
1982 curop = LINKLIST(o);
1986 sv = *(PL_stack_sp--);
1987 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1988 pad_swipe(o->op_targ);
1989 else if (SvTEMP(sv)) { /* grab mortal temp? */
1990 (void)SvREFCNT_inc(sv);
1994 if (type == OP_RV2GV)
1995 return newGVOP(OP_GV, 0, (GV*)sv);
1997 /* try to smush double to int, but don't smush -2.0 to -2 */
1998 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2002 if ((NV)iv == SvNV(sv)) {
2007 SvIOK_off(sv); /* undo SvIV() damage */
2009 return newSVOP(OP_CONST, 0, sv);
2013 if (!(PL_opargs[type] & OA_OTHERINT))
2016 if (!(PL_hints & HINT_INTEGER)) {
2017 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
2020 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2021 if (curop->op_type == OP_CONST) {
2022 if (SvIOK(((SVOP*)curop)->op_sv))
2026 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2030 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2037 Perl_gen_constant_list(pTHX_ register OP *o)
2041 I32 oldtmps_floor = PL_tmps_floor;
2045 return o; /* Don't attempt to run with errors */
2047 PL_op = curop = LINKLIST(o);
2053 PL_tmps_floor = oldtmps_floor;
2055 o->op_type = OP_RV2AV;
2056 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2057 curop = ((UNOP*)o)->op_first;
2058 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2065 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2070 if (!o || o->op_type != OP_LIST)
2071 o = newLISTOP(OP_LIST, 0, o, Nullop);
2073 o->op_flags &= ~OPf_WANT;
2075 if (!(PL_opargs[type] & OA_MARK))
2076 null(cLISTOPo->op_first);
2079 o->op_ppaddr = PL_ppaddr[type];
2080 o->op_flags |= flags;
2082 o = CHECKOP(type, o);
2083 if (o->op_type != type)
2086 if (cLISTOPo->op_children < 7) {
2087 /* XXX do we really need to do this if we're done appending?? */
2088 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2090 cLISTOPo->op_last = last; /* in case check substituted last arg */
2093 return fold_constants(o);
2096 /* List constructors */
2099 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2107 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
2108 return newLISTOP(type, 0, first, last);
2110 if (first->op_flags & OPf_KIDS)
2111 ((LISTOP*)first)->op_last->op_sibling = last;
2113 first->op_flags |= OPf_KIDS;
2114 ((LISTOP*)first)->op_first = last;
2116 ((LISTOP*)first)->op_last = last;
2117 ((LISTOP*)first)->op_children++;
2122 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2130 if (first->op_type != type)
2131 return prepend_elem(type, (OP*)first, (OP*)last);
2133 if (last->op_type != type)
2134 return append_elem(type, (OP*)first, (OP*)last);
2136 first->op_last->op_sibling = last->op_first;
2137 first->op_last = last->op_last;
2138 first->op_children += last->op_children;
2139 if (first->op_children)
2140 first->op_flags |= OPf_KIDS;
2142 #ifdef PL_OP_SLAB_ALLOC
2150 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2158 if (last->op_type == type) {
2159 if (type == OP_LIST) { /* already a PUSHMARK there */
2160 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2161 ((LISTOP*)last)->op_first->op_sibling = first;
2164 if (!(last->op_flags & OPf_KIDS)) {
2165 ((LISTOP*)last)->op_last = first;
2166 last->op_flags |= OPf_KIDS;
2168 first->op_sibling = ((LISTOP*)last)->op_first;
2169 ((LISTOP*)last)->op_first = first;
2171 ((LISTOP*)last)->op_children++;
2175 return newLISTOP(type, 0, first, last);
2181 Perl_newNULLLIST(pTHX)
2183 return newOP(OP_STUB, 0);
2187 Perl_force_list(pTHX_ OP *o)
2189 if (!o || o->op_type != OP_LIST)
2190 o = newLISTOP(OP_LIST, 0, o, Nullop);
2196 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2200 NewOp(1101, listop, 1, LISTOP);
2202 listop->op_type = type;
2203 listop->op_ppaddr = PL_ppaddr[type];
2204 listop->op_children = (first != 0) + (last != 0);
2205 listop->op_flags = flags;
2209 else if (!first && last)
2212 first->op_sibling = last;
2213 listop->op_first = first;
2214 listop->op_last = last;
2215 if (type == OP_LIST) {
2217 pushop = newOP(OP_PUSHMARK, 0);
2218 pushop->op_sibling = first;
2219 listop->op_first = pushop;
2220 listop->op_flags |= OPf_KIDS;
2222 listop->op_last = pushop;
2224 else if (listop->op_children)
2225 listop->op_flags |= OPf_KIDS;
2231 Perl_newOP(pTHX_ I32 type, I32 flags)
2234 NewOp(1101, o, 1, OP);
2236 o->op_ppaddr = PL_ppaddr[type];
2237 o->op_flags = flags;
2240 o->op_private = 0 + (flags >> 8);
2241 if (PL_opargs[type] & OA_RETSCALAR)
2243 if (PL_opargs[type] & OA_TARGET)
2244 o->op_targ = pad_alloc(type, SVs_PADTMP);
2245 return CHECKOP(type, o);
2249 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2254 first = newOP(OP_STUB, 0);
2255 if (PL_opargs[type] & OA_MARK)
2256 first = force_list(first);
2258 NewOp(1101, unop, 1, UNOP);
2259 unop->op_type = type;
2260 unop->op_ppaddr = PL_ppaddr[type];
2261 unop->op_first = first;
2262 unop->op_flags = flags | OPf_KIDS;
2263 unop->op_private = 1 | (flags >> 8);
2264 unop = (UNOP*) CHECKOP(type, unop);
2268 return fold_constants((OP *) unop);
2272 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2275 NewOp(1101, binop, 1, BINOP);
2278 first = newOP(OP_NULL, 0);
2280 binop->op_type = type;
2281 binop->op_ppaddr = PL_ppaddr[type];
2282 binop->op_first = first;
2283 binop->op_flags = flags | OPf_KIDS;
2286 binop->op_private = 1 | (flags >> 8);
2289 binop->op_private = 2 | (flags >> 8);
2290 first->op_sibling = last;
2293 binop = (BINOP*)CHECKOP(type, binop);
2294 if (binop->op_next || binop->op_type != type)
2297 binop->op_last = binop->op_first->op_sibling;
2299 return fold_constants((OP *)binop);
2303 utf8compare(const void *a, const void *b)
2306 for (i = 0; i < 10; i++) {
2307 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2309 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2316 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2318 SV *tstr = ((SVOP*)expr)->op_sv;
2319 SV *rstr = ((SVOP*)repl)->op_sv;
2322 register U8 *t = (U8*)SvPV(tstr, tlen);
2323 register U8 *r = (U8*)SvPV(rstr, rlen);
2329 register short *tbl;
2331 complement = o->op_private & OPpTRANS_COMPLEMENT;
2332 del = o->op_private & OPpTRANS_DELETE;
2333 squash = o->op_private & OPpTRANS_SQUASH;
2335 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2336 SV* listsv = newSVpvn("# comment\n",10);
2338 U8* tend = t + tlen;
2339 U8* rend = r + rlen;
2355 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2356 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2362 New(1109, cp, tlen, U8*);
2364 transv = newSVpvn("",0);
2373 qsort(cp, i, sizeof(U8*), utf8compare);
2374 for (j = 0; j < i; j++) {
2376 UV val = utf8_to_uv(s, &ulen);
2378 diff = val - nextmin;
2380 t = uv_to_utf8(tmpbuf,nextmin);
2381 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2383 t = uv_to_utf8(tmpbuf, val - 1);
2384 sv_catpvn(transv, "\377", 1);
2385 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2389 val = utf8_to_uv(s+1, &ulen);
2393 t = uv_to_utf8(tmpbuf,nextmin);
2394 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2395 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2396 sv_catpvn(transv, "\377", 1);
2397 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2398 t = (U8*)SvPVX(transv);
2399 tlen = SvCUR(transv);
2402 else if (!rlen && !del) {
2403 r = t; rlen = tlen; rend = tend;
2406 if (to_utf && from_utf) { /* only counting characters */
2407 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2408 o->op_private |= OPpTRANS_IDENTICAL;
2410 else { /* straight latin-1 translation */
2411 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2412 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2413 o->op_private |= OPpTRANS_IDENTICAL;
2417 while (t < tend || tfirst <= tlast) {
2418 /* see if we need more "t" chars */
2419 if (tfirst > tlast) {
2420 tfirst = (I32)utf8_to_uv(t, &ulen);
2422 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2423 tlast = (I32)utf8_to_uv(++t, &ulen);
2430 /* now see if we need more "r" chars */
2431 if (rfirst > rlast) {
2433 rfirst = (I32)utf8_to_uv(r, &ulen);
2435 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2436 rlast = (I32)utf8_to_uv(++r, &ulen);
2445 rfirst = rlast = 0xffffffff;
2449 /* now see which range will peter our first, if either. */
2450 tdiff = tlast - tfirst;
2451 rdiff = rlast - rfirst;
2458 if (rfirst == 0xffffffff) {
2459 diff = tdiff; /* oops, pretend rdiff is infinite */
2461 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2463 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\tXXXX\n", tfirst);
2467 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2469 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2471 if (rfirst + diff > max)
2472 max = rfirst + diff;
2477 else if (rfirst <= 0x800)
2478 grows |= (tfirst < 0x80);
2479 else if (rfirst <= 0x10000)
2480 grows |= (tfirst < 0x800);
2481 else if (rfirst <= 0x200000)
2482 grows |= (tfirst < 0x10000);
2483 else if (rfirst <= 0x4000000)
2484 grows |= (tfirst < 0x200000);
2485 else if (rfirst <= 0x80000000)
2486 grows |= (tfirst < 0x4000000);
2498 else if (max > 0xff)
2503 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2504 SvREFCNT_dec(listsv);
2506 SvREFCNT_dec(transv);
2508 if (!del && havefinal)
2509 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2511 if (grows && to_utf)
2512 o->op_private |= OPpTRANS_GROWS;
2519 tbl = (short*)cPVOPo->op_pv;
2521 Zero(tbl, 256, short);
2522 for (i = 0; i < tlen; i++)
2524 for (i = 0, j = 0; i < 256; i++) {
2540 if (!rlen && !del) {
2543 o->op_private |= OPpTRANS_IDENTICAL;
2545 for (i = 0; i < 256; i++)
2547 for (i = 0, j = 0; i < tlen; i++,j++) {
2550 if (tbl[t[i]] == -1)
2556 if (tbl[t[i]] == -1)
2567 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2572 NewOp(1101, pmop, 1, PMOP);
2573 pmop->op_type = type;
2574 pmop->op_ppaddr = PL_ppaddr[type];
2575 pmop->op_flags = flags;
2576 pmop->op_private = 0 | (flags >> 8);
2578 if (PL_hints & HINT_RE_TAINT)
2579 pmop->op_pmpermflags |= PMf_RETAINT;
2580 if (PL_hints & HINT_LOCALE)
2581 pmop->op_pmpermflags |= PMf_LOCALE;
2582 pmop->op_pmflags = pmop->op_pmpermflags;
2584 /* link into pm list */
2585 if (type != OP_TRANS && PL_curstash) {
2586 pmop->op_pmnext = HvPMROOT(PL_curstash);
2587 HvPMROOT(PL_curstash) = pmop;
2594 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2599 I32 repl_has_vars = 0;
2601 if (o->op_type == OP_TRANS)
2602 return pmtrans(o, expr, repl);
2604 PL_hints |= HINT_BLOCK_SCOPE;
2607 if (expr->op_type == OP_CONST) {
2609 SV *pat = ((SVOP*)expr)->op_sv;
2610 char *p = SvPV(pat, plen);
2611 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2612 sv_setpvn(pat, "\\s+", 3);
2613 p = SvPV(pat, plen);
2614 pm->op_pmflags |= PMf_SKIPWHITE;
2616 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2617 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2618 pm->op_pmflags |= PMf_WHITE;
2622 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2623 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2625 : OP_REGCMAYBE),0,expr);
2627 NewOp(1101, rcop, 1, LOGOP);
2628 rcop->op_type = OP_REGCOMP;
2629 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2630 rcop->op_first = scalar(expr);
2631 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2632 ? (OPf_SPECIAL | OPf_KIDS)
2634 rcop->op_private = 1;
2637 /* establish postfix order */
2638 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2640 rcop->op_next = expr;
2641 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2644 rcop->op_next = LINKLIST(expr);
2645 expr->op_next = (OP*)rcop;
2648 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2653 if (pm->op_pmflags & PMf_EVAL) {
2655 if (PL_curcop->cop_line < PL_multi_end)
2656 PL_curcop->cop_line = PL_multi_end;
2659 else if (repl->op_type == OP_THREADSV
2660 && strchr("&`'123456789+",
2661 PL_threadsv_names[repl->op_targ]))
2665 #endif /* USE_THREADS */
2666 else if (repl->op_type == OP_CONST)
2670 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2671 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2673 if (curop->op_type == OP_THREADSV) {
2675 if (strchr("&`'123456789+", curop->op_private))
2679 if (curop->op_type == OP_GV) {
2680 GV *gv = ((GVOP*)curop)->op_gv;
2682 if (strchr("&`'123456789+", *GvENAME(gv)))
2685 #endif /* USE_THREADS */
2686 else if (curop->op_type == OP_RV2CV)
2688 else if (curop->op_type == OP_RV2SV ||
2689 curop->op_type == OP_RV2AV ||
2690 curop->op_type == OP_RV2HV ||
2691 curop->op_type == OP_RV2GV) {
2692 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2695 else if (curop->op_type == OP_PADSV ||
2696 curop->op_type == OP_PADAV ||
2697 curop->op_type == OP_PADHV ||
2698 curop->op_type == OP_PADANY) {
2701 else if (curop->op_type == OP_PUSHRE)
2702 ; /* Okay here, dangerous in newASSIGNOP */
2711 && (!pm->op_pmregexp
2712 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2713 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2714 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2715 prepend_elem(o->op_type, scalar(repl), o);
2718 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2719 pm->op_pmflags |= PMf_MAYBE_CONST;
2720 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2722 NewOp(1101, rcop, 1, LOGOP);
2723 rcop->op_type = OP_SUBSTCONT;
2724 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2725 rcop->op_first = scalar(repl);
2726 rcop->op_flags |= OPf_KIDS;
2727 rcop->op_private = 1;
2730 /* establish postfix order */
2731 rcop->op_next = LINKLIST(repl);
2732 repl->op_next = (OP*)rcop;
2734 pm->op_pmreplroot = scalar((OP*)rcop);
2735 pm->op_pmreplstart = LINKLIST(rcop);
2744 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2747 NewOp(1101, svop, 1, SVOP);
2748 svop->op_type = type;
2749 svop->op_ppaddr = PL_ppaddr[type];
2751 svop->op_next = (OP*)svop;
2752 svop->op_flags = flags;
2753 if (PL_opargs[type] & OA_RETSCALAR)
2755 if (PL_opargs[type] & OA_TARGET)
2756 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2757 return CHECKOP(type, svop);
2761 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
2765 NewOp(1101, gvop, 1, GVOP);
2766 gvop->op_type = type;
2767 gvop->op_ppaddr = PL_ppaddr[type];
2768 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2769 gvop->op_next = (OP*)gvop;
2770 gvop->op_flags = flags;
2771 if (PL_opargs[type] & OA_RETSCALAR)
2773 if (PL_opargs[type] & OA_TARGET)
2774 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2775 return CHECKOP(type, gvop);
2779 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
2782 NewOp(1101, pvop, 1, PVOP);
2783 pvop->op_type = type;
2784 pvop->op_ppaddr = PL_ppaddr[type];
2786 pvop->op_next = (OP*)pvop;
2787 pvop->op_flags = flags;
2788 if (PL_opargs[type] & OA_RETSCALAR)
2790 if (PL_opargs[type] & OA_TARGET)
2791 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2792 return CHECKOP(type, pvop);
2796 Perl_package(pTHX_ OP *o)
2801 save_hptr(&PL_curstash);
2802 save_item(PL_curstname);
2807 name = SvPV(sv, len);
2808 PL_curstash = gv_stashpvn(name,len,TRUE);
2809 sv_setpvn(PL_curstname, name, len);
2813 sv_setpv(PL_curstname,"<none>");
2814 PL_curstash = Nullhv;
2816 PL_hints |= HINT_BLOCK_SCOPE;
2817 PL_copline = NOLINE;
2822 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
2831 if (id->op_type != OP_CONST)
2832 Perl_croak(aTHX_ "Module name must be constant");
2836 if(version != Nullop) {
2837 SV *vesv = ((SVOP*)version)->op_sv;
2839 if (arg == Nullop && !SvNIOK(vesv)) {
2845 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2846 Perl_croak(aTHX_ "Version number must be constant number");
2848 /* Make copy of id so we don't free it twice */
2849 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2851 /* Fake up a method call to VERSION */
2852 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2853 append_elem(OP_LIST,
2854 prepend_elem(OP_LIST, pack, list(version)),
2855 newSVOP(OP_METHOD_NAMED, 0,
2856 newSVpvn("VERSION", 7))));
2860 /* Fake up an import/unimport */
2861 if (arg && arg->op_type == OP_STUB)
2862 imop = arg; /* no import on explicit () */
2863 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2864 imop = Nullop; /* use 5.0; */
2867 /* Make copy of id so we don't free it twice */
2868 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2869 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2870 append_elem(OP_LIST,
2871 prepend_elem(OP_LIST, pack, list(arg)),
2872 newSVOP(OP_METHOD_NAMED, 0,
2873 aver ? newSVpvn("import", 6)
2874 : newSVpvn("unimport", 8))));
2877 /* Fake up a require, handle override, if any */
2878 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2879 if (!(gv && GvIMPORTED_CV(gv)))
2880 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2882 if (gv && GvIMPORTED_CV(gv)) {
2883 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2884 append_elem(OP_LIST, id,
2885 scalar(newUNOP(OP_RV2CV, 0,
2890 rqop = newUNOP(OP_REQUIRE, 0, id);
2893 /* Fake up the BEGIN {}, which does its thing immediately. */
2895 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
2898 append_elem(OP_LINESEQ,
2899 append_elem(OP_LINESEQ,
2900 newSTATEOP(0, Nullch, rqop),
2901 newSTATEOP(0, Nullch, veop)),
2902 newSTATEOP(0, Nullch, imop) ));
2904 PL_copline = NOLINE;
2909 Perl_dofile(pTHX_ OP *term)
2914 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2915 if (!(gv && GvIMPORTED_CV(gv)))
2916 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2918 if (gv && GvIMPORTED_CV(gv)) {
2919 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2920 append_elem(OP_LIST, term,
2921 scalar(newUNOP(OP_RV2CV, 0,
2926 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2932 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
2934 return newBINOP(OP_LSLICE, flags,
2935 list(force_list(subscript)),
2936 list(force_list(listval)) );
2940 S_list_assignment(pTHX_ register OP *o)
2945 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2946 o = cUNOPo->op_first;
2948 if (o->op_type == OP_COND_EXPR) {
2949 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
2950 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
2955 yyerror("Assignment to both a list and a scalar");
2959 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2960 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2961 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2964 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2967 if (o->op_type == OP_RV2SV)
2974 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
2979 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2980 return newLOGOP(optype, 0,
2981 mod(scalar(left), optype),
2982 newUNOP(OP_SASSIGN, 0, scalar(right)));
2985 return newBINOP(optype, OPf_STACKED,
2986 mod(scalar(left), optype), scalar(right));
2990 if (list_assignment(left)) {
2993 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2994 left = mod(left, OP_AASSIGN);
3002 o = newBINOP(OP_AASSIGN, flags,
3003 list(force_list(right)),
3004 list(force_list(left)) );
3005 o->op_private = 0 | (flags >> 8);
3006 if (!(left->op_private & OPpLVAL_INTRO)) {
3010 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3011 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3012 if (curop->op_type == OP_GV) {
3013 GV *gv = ((GVOP*)curop)->op_gv;
3014 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3016 SvCUR(gv) = PL_generation;
3018 else if (curop->op_type == OP_PADSV ||
3019 curop->op_type == OP_PADAV ||
3020 curop->op_type == OP_PADHV ||
3021 curop->op_type == OP_PADANY) {
3022 SV **svp = AvARRAY(PL_comppad_name);
3023 SV *sv = svp[curop->op_targ];
3024 if (SvCUR(sv) == PL_generation)
3026 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3028 else if (curop->op_type == OP_RV2CV)
3030 else if (curop->op_type == OP_RV2SV ||
3031 curop->op_type == OP_RV2AV ||
3032 curop->op_type == OP_RV2HV ||
3033 curop->op_type == OP_RV2GV) {
3034 if (lastop->op_type != OP_GV) /* funny deref? */
3037 else if (curop->op_type == OP_PUSHRE) {
3038 if (((PMOP*)curop)->op_pmreplroot) {
3039 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3040 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3042 SvCUR(gv) = PL_generation;
3051 o->op_private = OPpASSIGN_COMMON;
3053 if (right && right->op_type == OP_SPLIT) {
3055 if ((tmpop = ((LISTOP*)right)->op_first) &&
3056 tmpop->op_type == OP_PUSHRE)
3058 PMOP *pm = (PMOP*)tmpop;
3059 if (left->op_type == OP_RV2AV &&
3060 !(left->op_private & OPpLVAL_INTRO) &&
3061 !(o->op_private & OPpASSIGN_COMMON) )
3063 tmpop = ((UNOP*)left)->op_first;
3064 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3065 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
3066 pm->op_pmflags |= PMf_ONCE;
3067 tmpop = cUNOPo->op_first; /* to list (nulled) */
3068 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3069 tmpop->op_sibling = Nullop; /* don't free split */
3070 right->op_next = tmpop->op_next; /* fix starting loc */
3071 op_free(o); /* blow off assign */
3072 right->op_flags &= ~OPf_WANT;
3073 /* "I don't know and I don't care." */
3078 if (PL_modcount < 10000 &&
3079 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3081 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3083 sv_setiv(sv, PL_modcount+1);
3091 right = newOP(OP_UNDEF, 0);
3092 if (right->op_type == OP_READLINE) {
3093 right->op_flags |= OPf_STACKED;
3094 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3097 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3098 o = newBINOP(OP_SASSIGN, flags,
3099 scalar(right), mod(scalar(left), OP_SASSIGN) );
3111 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3114 U32 seq = intro_my();
3117 NewOp(1101, cop, 1, COP);
3118 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
3119 cop->op_type = OP_DBSTATE;
3120 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3123 cop->op_type = OP_NEXTSTATE;
3124 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3126 cop->op_flags = flags;
3127 cop->op_private = (PL_hints & HINT_UTF8);
3129 cop->op_private |= NATIVE_HINTS;
3131 PL_compiling.op_private = cop->op_private;
3132 cop->op_next = (OP*)cop;
3135 cop->cop_label = label;
3136 PL_hints |= HINT_BLOCK_SCOPE;
3139 cop->cop_arybase = PL_curcop->cop_arybase;
3140 if (specialWARN(PL_curcop->cop_warnings))
3141 cop->cop_warnings = PL_curcop->cop_warnings ;
3143 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3146 if (PL_copline == NOLINE)
3147 cop->cop_line = PL_curcop->cop_line;
3149 cop->cop_line = PL_copline;
3150 PL_copline = NOLINE;
3152 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
3153 cop->cop_stash = PL_curstash;
3155 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3156 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
3157 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3158 (void)SvIOK_on(*svp);
3160 SvSTASH(*svp) = (HV*)cop;
3164 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3167 /* "Introduce" my variables to visible status. */
3175 if (! PL_min_intro_pending)
3176 return PL_cop_seqmax;
3178 svp = AvARRAY(PL_comppad_name);
3179 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3180 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3181 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3182 SvNVX(sv) = (NV)PL_cop_seqmax;
3185 PL_min_intro_pending = 0;
3186 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3187 return PL_cop_seqmax++;
3191 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3193 return new_logop(type, flags, &first, &other);
3197 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3202 OP *first = *firstp;
3203 OP *other = *otherp;
3205 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3206 return newBINOP(type, flags, scalar(first), scalar(other));
3208 scalarboolean(first);
3209 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3210 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3211 if (type == OP_AND || type == OP_OR) {
3217 first = *firstp = cUNOPo->op_first;
3219 first->op_next = o->op_next;
3220 cUNOPo->op_first = Nullop;
3224 if (first->op_type == OP_CONST) {
3225 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3226 Perl_warner(aTHX_ WARN_PRECEDENCE, "Probable precedence problem on %s",
3228 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3239 else if (first->op_type == OP_WANTARRAY) {
3245 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3246 OP *k1 = ((UNOP*)first)->op_first;
3247 OP *k2 = k1->op_sibling;
3249 switch (first->op_type)
3252 if (k2 && k2->op_type == OP_READLINE
3253 && (k2->op_flags & OPf_STACKED)
3254 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3255 warnop = k2->op_type;
3259 if (k1->op_type == OP_READDIR
3260 || k1->op_type == OP_GLOB
3261 || k1->op_type == OP_EACH)
3262 warnop = k1->op_type;
3266 line_t oldline = PL_curcop->cop_line;
3267 PL_curcop->cop_line = PL_copline;
3268 Perl_warner(aTHX_ WARN_UNSAFE,
3269 "Value of %s%s can be \"0\"; test with defined()",
3271 ((warnop == OP_READLINE || warnop == OP_GLOB)
3272 ? " construct" : "() operator"));
3273 PL_curcop->cop_line = oldline;
3280 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3281 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3283 NewOp(1101, logop, 1, LOGOP);
3285 logop->op_type = type;
3286 logop->op_ppaddr = PL_ppaddr[type];
3287 logop->op_first = first;
3288 logop->op_flags = flags | OPf_KIDS;
3289 logop->op_other = LINKLIST(other);
3290 logop->op_private = 1 | (flags >> 8);
3292 /* establish postfix order */
3293 logop->op_next = LINKLIST(first);
3294 first->op_next = (OP*)logop;
3295 first->op_sibling = other;
3297 o = newUNOP(OP_NULL, 0, (OP*)logop);
3304 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3312 return newLOGOP(OP_AND, 0, first, trueop);
3314 return newLOGOP(OP_OR, 0, first, falseop);
3316 scalarboolean(first);
3317 if (first->op_type == OP_CONST) {
3318 if (SvTRUE(((SVOP*)first)->op_sv)) {
3329 else if (first->op_type == OP_WANTARRAY) {
3333 NewOp(1101, logop, 1, LOGOP);
3334 logop->op_type = OP_COND_EXPR;
3335 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3336 logop->op_first = first;
3337 logop->op_flags = flags | OPf_KIDS;
3338 logop->op_private = 1 | (flags >> 8);
3339 logop->op_other = LINKLIST(trueop);
3340 logop->op_next = LINKLIST(falseop);
3343 /* establish postfix order */
3344 start = LINKLIST(first);
3345 first->op_next = (OP*)logop;
3347 first->op_sibling = trueop;
3348 trueop->op_sibling = falseop;
3349 o = newUNOP(OP_NULL, 0, (OP*)logop);
3351 trueop->op_next = falseop->op_next = o;
3358 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3367 NewOp(1101, range, 1, LOGOP);
3369 range->op_type = OP_RANGE;
3370 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3371 range->op_first = left;
3372 range->op_flags = OPf_KIDS;
3373 leftstart = LINKLIST(left);
3374 range->op_other = LINKLIST(right);
3375 range->op_private = 1 | (flags >> 8);
3377 left->op_sibling = right;
3379 range->op_next = (OP*)range;
3380 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3381 flop = newUNOP(OP_FLOP, 0, flip);
3382 o = newUNOP(OP_NULL, 0, flop);
3384 range->op_next = leftstart;
3386 left->op_next = flip;
3387 right->op_next = flop;
3389 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3390 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3391 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3392 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3394 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3395 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3398 if (!flip->op_private || !flop->op_private)
3399 linklist(o); /* blow off optimizer unless constant */
3405 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3410 int once = block && block->op_flags & OPf_SPECIAL &&
3411 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3414 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3415 return block; /* do {} while 0 does once */
3416 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3417 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3418 expr = newUNOP(OP_DEFINED, 0,
3419 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3420 } else if (expr->op_flags & OPf_KIDS) {
3421 OP *k1 = ((UNOP*)expr)->op_first;
3422 OP *k2 = (k1) ? k1->op_sibling : NULL;
3423 switch (expr->op_type) {
3425 if (k2 && k2->op_type == OP_READLINE
3426 && (k2->op_flags & OPf_STACKED)
3427 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3428 expr = newUNOP(OP_DEFINED, 0, expr);
3432 if (k1->op_type == OP_READDIR
3433 || k1->op_type == OP_GLOB
3434 || k1->op_type == OP_EACH)
3435 expr = newUNOP(OP_DEFINED, 0, expr);
3441 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3442 o = new_logop(OP_AND, 0, &expr, &listop);
3445 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3447 if (once && o != listop)
3448 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3451 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3453 o->op_flags |= flags;
3455 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3460 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3469 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3470 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3471 expr = newUNOP(OP_DEFINED, 0,
3472 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3473 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3474 OP *k1 = ((UNOP*)expr)->op_first;
3475 OP *k2 = (k1) ? k1->op_sibling : NULL;
3476 switch (expr->op_type) {
3478 if (k2 && k2->op_type == OP_READLINE
3479 && (k2->op_flags & OPf_STACKED)
3480 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3481 expr = newUNOP(OP_DEFINED, 0, expr);
3485 if (k1->op_type == OP_READDIR
3486 || k1->op_type == OP_GLOB
3487 || k1->op_type == OP_EACH)
3488 expr = newUNOP(OP_DEFINED, 0, expr);
3494 block = newOP(OP_NULL, 0);
3497 next = LINKLIST(cont);
3499 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3500 if ((line_t)whileline != NOLINE) {
3501 PL_copline = whileline;
3502 cont = append_elem(OP_LINESEQ, cont,
3503 newSTATEOP(0, Nullch, Nullop));
3507 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3508 redo = LINKLIST(listop);
3511 PL_copline = whileline;
3513 o = new_logop(OP_AND, 0, &expr, &listop);
3514 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3515 op_free(expr); /* oops, it's a while (0) */
3517 return Nullop; /* listop already freed by new_logop */
3520 ((LISTOP*)listop)->op_last->op_next = condop =
3521 (o == listop ? redo : LINKLIST(o));
3529 NewOp(1101,loop,1,LOOP);
3530 loop->op_type = OP_ENTERLOOP;
3531 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3532 loop->op_private = 0;
3533 loop->op_next = (OP*)loop;
3536 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3538 loop->op_redoop = redo;
3539 loop->op_lastop = o;
3542 loop->op_nextop = next;
3544 loop->op_nextop = o;
3546 o->op_flags |= flags;
3547 o->op_private |= (flags >> 8);
3552 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3561 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3562 sv->op_type = OP_RV2GV;
3563 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3565 else if (sv->op_type == OP_PADSV) { /* private variable */
3566 padoff = sv->op_targ;
3570 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3571 padoff = sv->op_targ;
3572 iterflags |= OPf_SPECIAL;
3577 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3581 padoff = find_threadsv("_");
3582 iterflags |= OPf_SPECIAL;
3584 sv = newGVOP(OP_GV, 0, PL_defgv);
3587 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3588 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3589 iterflags |= OPf_STACKED;
3591 else if (expr->op_type == OP_NULL &&
3592 (expr->op_flags & OPf_KIDS) &&
3593 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3595 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3596 * set the STACKED flag to indicate that these values are to be
3597 * treated as min/max values by 'pp_iterinit'.
3599 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3600 LOGOP* range = (LOGOP*) flip->op_first;
3601 OP* left = range->op_first;
3602 OP* right = left->op_sibling;
3605 range->op_flags &= ~OPf_KIDS;
3606 range->op_first = Nullop;
3608 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3609 listop->op_first->op_next = range->op_next;
3610 left->op_next = range->op_other;
3611 right->op_next = (OP*)listop;
3612 listop->op_next = listop->op_first;
3615 expr = (OP*)(listop);
3617 iterflags |= OPf_STACKED;
3620 expr = mod(force_list(expr), OP_GREPSTART);
3624 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3625 append_elem(OP_LIST, expr, scalar(sv))));
3626 assert(!loop->op_next);
3627 #ifdef PL_OP_SLAB_ALLOC
3628 NewOp(1234,tmp,1,LOOP);
3629 Copy(loop,tmp,1,LOOP);
3632 Renew(loop, 1, LOOP);
3634 loop->op_targ = padoff;
3635 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3636 PL_copline = forline;
3637 return newSTATEOP(0, label, wop);
3641 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3647 if (type != OP_GOTO || label->op_type == OP_CONST) {
3648 /* "last()" means "last" */
3649 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3650 o = newOP(type, OPf_SPECIAL);
3652 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3653 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3659 if (label->op_type == OP_ENTERSUB)
3660 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3661 o = newUNOP(type, OPf_STACKED, label);
3663 PL_hints |= HINT_BLOCK_SCOPE;
3668 Perl_cv_undef(pTHX_ CV *cv)
3673 MUTEX_DESTROY(CvMUTEXP(cv));
3674 Safefree(CvMUTEXP(cv));
3677 #endif /* USE_THREADS */
3679 if (!CvXSUB(cv) && CvROOT(cv)) {
3681 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3682 Perl_croak(aTHX_ "Can't undef active subroutine");
3685 Perl_croak(aTHX_ "Can't undef active subroutine");
3686 #endif /* USE_THREADS */
3689 SAVESPTR(PL_curpad);
3693 op_free(CvROOT(cv));
3694 CvROOT(cv) = Nullop;
3697 SvPOK_off((SV*)cv); /* forget prototype */
3699 SvREFCNT_dec(CvGV(cv));
3701 SvREFCNT_dec(CvOUTSIDE(cv));
3702 CvOUTSIDE(cv) = Nullcv;
3703 if (CvPADLIST(cv)) {
3704 /* may be during global destruction */
3705 if (SvREFCNT(CvPADLIST(cv))) {
3706 I32 i = AvFILLp(CvPADLIST(cv));
3708 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3709 SV* sv = svp ? *svp : Nullsv;
3712 if (sv == (SV*)PL_comppad_name)
3713 PL_comppad_name = Nullav;
3714 else if (sv == (SV*)PL_comppad) {
3715 PL_comppad = Nullav;
3716 PL_curpad = Null(SV**);
3720 SvREFCNT_dec((SV*)CvPADLIST(cv));
3722 CvPADLIST(cv) = Nullav;
3726 #ifdef DEBUG_CLOSURES
3730 CV *outside = CvOUTSIDE(cv);
3731 AV* padlist = CvPADLIST(cv);
3738 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3740 (CvANON(cv) ? "ANON"
3741 : (cv == PL_main_cv) ? "MAIN"
3742 : CvUNIQUE(cv) ? "UNIQUE"
3743 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3746 : CvANON(outside) ? "ANON"
3747 : (outside == PL_main_cv) ? "MAIN"
3748 : CvUNIQUE(outside) ? "UNIQUE"
3749 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3754 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3755 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3756 pname = AvARRAY(pad_name);
3757 ppad = AvARRAY(pad);
3759 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3760 if (SvPOK(pname[ix]))
3761 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3763 SvFAKE(pname[ix]) ? "FAKE " : "",
3765 (long)I_32(SvNVX(pname[ix])),
3766 (long)SvIVX(pname[ix]));
3769 #endif /* DEBUG_CLOSURES */
3772 S_cv_clone2(pTHX_ CV *proto, CV *outside)
3777 AV* protopadlist = CvPADLIST(proto);
3778 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3779 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3780 SV** pname = AvARRAY(protopad_name);
3781 SV** ppad = AvARRAY(protopad);
3782 I32 fname = AvFILLp(protopad_name);
3783 I32 fpad = AvFILLp(protopad);
3787 assert(!CvUNIQUE(proto));
3790 SAVESPTR(PL_curpad);
3791 SAVESPTR(PL_comppad);
3792 SAVESPTR(PL_comppad_name);
3793 SAVESPTR(PL_compcv);
3795 cv = PL_compcv = (CV*)NEWSV(1104,0);
3796 sv_upgrade((SV *)cv, SvTYPE(proto));
3802 New(666, CvMUTEXP(cv), 1, perl_mutex);
3803 MUTEX_INIT(CvMUTEXP(cv));
3805 #endif /* USE_THREADS */
3806 CvFILEGV(cv) = CvFILEGV(proto);
3807 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3808 CvSTASH(cv) = CvSTASH(proto);
3809 CvROOT(cv) = CvROOT(proto);
3810 CvSTART(cv) = CvSTART(proto);
3812 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3815 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3817 PL_comppad_name = newAV();
3818 for (ix = fname; ix >= 0; ix--)
3819 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3821 PL_comppad = newAV();
3823 comppadlist = newAV();
3824 AvREAL_off(comppadlist);
3825 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3826 av_store(comppadlist, 1, (SV*)PL_comppad);
3827 CvPADLIST(cv) = comppadlist;
3828 av_fill(PL_comppad, AvFILLp(protopad));
3829 PL_curpad = AvARRAY(PL_comppad);
3831 av = newAV(); /* will be @_ */
3833 av_store(PL_comppad, 0, (SV*)av);
3834 AvFLAGS(av) = AVf_REIFY;
3836 for (ix = fpad; ix > 0; ix--) {
3837 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3838 if (namesv && namesv != &PL_sv_undef) {
3839 char *name = SvPVX(namesv); /* XXX */
3840 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3841 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3842 CvOUTSIDE(cv), cxstack_ix, 0, 0);
3844 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3846 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
3848 else { /* our own lexical */
3851 /* anon code -- we'll come back for it */
3852 sv = SvREFCNT_inc(ppad[ix]);
3854 else if (*name == '@')
3856 else if (*name == '%')
3866 SV* sv = NEWSV(0,0);
3872 /* Now that vars are all in place, clone nested closures. */
3874 for (ix = fpad; ix > 0; ix--) {
3875 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3877 && namesv != &PL_sv_undef
3878 && !(SvFLAGS(namesv) & SVf_FAKE)
3879 && *SvPVX(namesv) == '&'
3880 && CvCLONE(ppad[ix]))
3882 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3883 SvREFCNT_dec(ppad[ix]);
3886 PL_curpad[ix] = (SV*)kid;
3890 #ifdef DEBUG_CLOSURES
3891 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3893 PerlIO_printf(Perl_debug_log, " from:\n");
3895 PerlIO_printf(Perl_debug_log, " to:\n");
3904 Perl_cv_clone(pTHX_ CV *proto)
3907 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3908 cv = cv_clone2(proto, CvOUTSIDE(proto));
3909 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3914 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
3918 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_UNSAFE)) {
3919 SV* msg = sv_newmortal();
3923 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3924 sv_setpv(msg, "Prototype mismatch:");
3926 Perl_sv_catpvf(aTHX_ msg, " sub %_", name);
3928 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
3929 sv_catpv(msg, " vs ");
3931 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
3933 sv_catpv(msg, "none");
3934 Perl_warner(aTHX_ WARN_UNSAFE, "%_", msg);
3939 Perl_cv_const_sv(pTHX_ CV *cv)
3941 if (!cv || !SvPOK(cv) || SvCUR(cv))
3943 return op_const_sv(CvSTART(cv), cv);
3947 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
3954 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3955 o = cLISTOPo->op_first->op_sibling;
3957 for (; o; o = o->op_next) {
3958 OPCODE type = o->op_type;
3960 if (sv && o->op_next == o)
3962 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3964 if (type == OP_LEAVESUB || type == OP_RETURN)
3968 if (type == OP_CONST)
3970 else if (type == OP_PADSV && cv) {
3971 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3972 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3973 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3985 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
3995 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
3999 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4001 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4005 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4009 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4010 GV *gv = gv_fetchpv(name ? name : "__ANON__",
4011 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4013 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4024 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4025 maximum a prototype before. */
4026 if (SvTYPE(gv) > SVt_NULL) {
4027 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4028 && ckWARN_d(WARN_UNSAFE))
4030 Perl_warner(aTHX_ WARN_UNSAFE, "Runaway prototype");
4032 cv_ckproto((CV*)gv, NULL, ps);
4035 sv_setpv((SV*)gv, ps);
4037 sv_setiv((SV*)gv, -1);
4038 SvREFCNT_dec(PL_compcv);
4039 cv = PL_compcv = NULL;
4040 PL_sub_generation++;
4044 if (!name || GvCVGEN(gv))
4046 else if (cv = GvCV(gv)) {
4047 cv_ckproto(cv, gv, ps);
4048 /* already defined (or promised)? */
4049 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4051 bool const_changed = TRUE;
4052 if (!block && !attrs) {
4053 /* just a "sub foo;" when &foo is already defined */
4054 SAVEFREESV(PL_compcv);
4057 /* ahem, death to those who redefine active sort subs */
4058 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4059 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4062 if(const_sv = cv_const_sv(cv))
4063 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4064 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
4065 && !(CvGV(cv) && GvSTASH(CvGV(cv))
4066 && HvNAME(GvSTASH(CvGV(cv)))
4067 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
4069 line_t oldline = PL_curcop->cop_line;
4070 PL_curcop->cop_line = PL_copline;
4071 Perl_warner(aTHX_ WARN_REDEFINE,
4072 const_sv ? "Constant subroutine %s redefined"
4073 : "Subroutine %s redefined", name);
4074 PL_curcop->cop_line = oldline;
4085 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4086 * before we clobber PL_compcv.
4090 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4091 stash = GvSTASH(CvGV(cv));
4092 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4093 stash = CvSTASH(cv);
4095 stash = PL_curstash;
4098 /* possibly about to re-define existing subr -- ignore old cv */
4099 rcv = (SV*)PL_compcv;
4100 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4101 stash = GvSTASH(gv);
4103 stash = PL_curstash;
4105 apply_attrs(stash, rcv, attrs);
4107 if (cv) { /* must reuse cv if autoloaded */
4109 /* got here with just attrs -- work done, so bug out */
4110 SAVEFREESV(PL_compcv);
4114 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4115 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4116 CvOUTSIDE(PL_compcv) = 0;
4117 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4118 CvPADLIST(PL_compcv) = 0;
4119 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4120 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4121 SvREFCNT_dec(PL_compcv);
4128 PL_sub_generation++;
4131 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4132 CvFILEGV(cv) = PL_curcop->cop_filegv;
4133 CvSTASH(cv) = PL_curstash;
4136 if (!CvMUTEXP(cv)) {
4137 New(666, CvMUTEXP(cv), 1, perl_mutex);
4138 MUTEX_INIT(CvMUTEXP(cv));
4140 #endif /* USE_THREADS */
4143 sv_setpv((SV*)cv, ps);
4145 if (PL_error_count) {
4149 char *s = strrchr(name, ':');
4151 if (strEQ(s, "BEGIN")) {
4153 "BEGIN not safe after errors--compilation aborted";
4154 if (PL_in_eval & EVAL_KEEPERR)
4155 Perl_croak(aTHX_ not_safe);
4157 /* force display of errors found but not reported */
4158 sv_catpv(ERRSV, not_safe);
4159 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4166 PL_copline = NOLINE;
4171 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4172 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4175 SV **namep = AvARRAY(PL_comppad_name);
4176 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4179 if (SvIMMORTAL(PL_curpad[ix]))
4182 * The only things that a clonable function needs in its
4183 * pad are references to outer lexicals and anonymous subs.
4184 * The rest are created anew during cloning.
4186 if (!((namesv = namep[ix]) != Nullsv &&
4187 namesv != &PL_sv_undef &&
4189 *SvPVX(namesv) == '&')))
4191 SvREFCNT_dec(PL_curpad[ix]);
4192 PL_curpad[ix] = Nullsv;
4197 AV *av = newAV(); /* Will be @_ */
4199 av_store(PL_comppad, 0, (SV*)av);
4200 AvFLAGS(av) = AVf_REIFY;
4202 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4203 if (SvIMMORTAL(PL_curpad[ix]))
4205 if (!SvPADMY(PL_curpad[ix]))
4206 SvPADTMP_on(PL_curpad[ix]);
4210 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4211 CvSTART(cv) = LINKLIST(CvROOT(cv));
4212 CvROOT(cv)->op_next = 0;
4218 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4219 SV *sv = NEWSV(0,0);
4220 SV *tmpstr = sv_newmortal();
4221 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4225 Perl_sv_setpvf(aTHX_ sv, "%_:%ld-%ld",
4226 GvSV(PL_curcop->cop_filegv),
4227 (long)PL_subline, (long)PL_curcop->cop_line);
4228 gv_efullname3(tmpstr, gv, Nullch);
4229 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4230 hv = GvHVn(db_postponed);
4231 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4232 && (cv = GvCV(db_postponed))) {
4237 call_sv((SV*)cv, G_DISCARD);
4241 if ((s = strrchr(name,':')))
4245 if (strEQ(s, "BEGIN")) {
4246 I32 oldscope = PL_scopestack_ix;
4248 SAVESPTR(PL_compiling.cop_filegv);
4249 SAVEI16(PL_compiling.cop_line);
4251 sv_setsv(PL_rs, PL_nrs);
4254 PL_beginav = newAV();
4255 DEBUG_x( dump_sub(gv) );
4256 av_push(PL_beginav, (SV *)cv);
4258 call_list(oldscope, PL_beginav);
4260 PL_curcop = &PL_compiling;
4261 PL_compiling.op_private = PL_hints;
4264 else if (strEQ(s, "END") && !PL_error_count) {
4267 av_unshift(PL_endav, 1);
4268 av_store(PL_endav, 0, (SV *)cv);
4271 else if (strEQ(s, "INIT") && !PL_error_count) {
4273 PL_initav = newAV();
4274 av_push(PL_initav, SvREFCNT_inc(cv));
4280 PL_copline = NOLINE;
4285 /* XXX unsafe for threads if eval_owner isn't held */
4287 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4290 U32 oldhints = PL_hints;
4291 HV *old_cop_stash = PL_curcop->cop_stash;
4292 HV *old_curstash = PL_curstash;
4293 line_t oldline = PL_curcop->cop_line;
4294 PL_curcop->cop_line = PL_copline;
4296 PL_hints &= ~HINT_BLOCK_SCOPE;
4298 PL_curstash = PL_curcop->cop_stash = stash;
4301 start_subparse(FALSE, 0),
4302 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4303 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4305 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4308 PL_hints = oldhints;
4309 PL_curcop->cop_stash = old_cop_stash;
4310 PL_curstash = old_curstash;
4311 PL_curcop->cop_line = oldline;
4315 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4318 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4321 if (cv = (name ? GvCV(gv) : Nullcv)) {
4323 /* just a cached method */
4327 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4328 /* already defined (or promised) */
4329 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4330 && HvNAME(GvSTASH(CvGV(cv)))
4331 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4332 line_t oldline = PL_curcop->cop_line;
4333 if (PL_copline != NOLINE)
4334 PL_curcop->cop_line = PL_copline;
4335 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4336 PL_curcop->cop_line = oldline;
4343 if (cv) /* must reuse cv if autoloaded */
4346 cv = (CV*)NEWSV(1105,0);
4347 sv_upgrade((SV *)cv, SVt_PVCV);
4351 PL_sub_generation++;
4354 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4356 New(666, CvMUTEXP(cv), 1, perl_mutex);
4357 MUTEX_INIT(CvMUTEXP(cv));
4359 #endif /* USE_THREADS */
4360 CvFILEGV(cv) = gv_fetchfile(filename);
4361 CvXSUB(cv) = subaddr;
4364 char *s = strrchr(name,':');
4369 if (strEQ(s, "BEGIN")) {
4371 PL_beginav = newAV();
4372 av_push(PL_beginav, (SV *)cv);
4375 else if (strEQ(s, "END")) {
4378 av_unshift(PL_endav, 1);
4379 av_store(PL_endav, 0, (SV *)cv);
4382 else if (strEQ(s, "INIT")) {
4384 PL_initav = newAV();
4385 av_push(PL_initav, (SV *)cv);
4396 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4406 name = SvPVx(cSVOPo->op_sv, n_a);
4409 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4411 if (cv = GvFORM(gv)) {
4412 if (ckWARN(WARN_REDEFINE)) {
4413 line_t oldline = PL_curcop->cop_line;
4415 PL_curcop->cop_line = PL_copline;
4416 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4417 PL_curcop->cop_line = oldline;
4423 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4424 CvFILEGV(cv) = PL_curcop->cop_filegv;
4426 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4427 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4428 SvPADTMP_on(PL_curpad[ix]);
4431 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4432 CvSTART(cv) = LINKLIST(CvROOT(cv));
4433 CvROOT(cv)->op_next = 0;
4436 PL_copline = NOLINE;
4441 Perl_newANONLIST(pTHX_ OP *o)
4443 return newUNOP(OP_REFGEN, 0,
4444 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4448 Perl_newANONHASH(pTHX_ OP *o)
4450 return newUNOP(OP_REFGEN, 0,
4451 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4455 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4457 return newANONATTRSUB(floor, proto, Nullop, block);
4461 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4463 return newUNOP(OP_REFGEN, 0,
4464 newSVOP(OP_ANONCODE, 0,
4465 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4469 Perl_oopsAV(pTHX_ OP *o)
4471 switch (o->op_type) {
4473 o->op_type = OP_PADAV;
4474 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4475 return ref(o, OP_RV2AV);
4478 o->op_type = OP_RV2AV;
4479 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4484 if (ckWARN_d(WARN_INTERNAL))
4485 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4492 Perl_oopsHV(pTHX_ OP *o)
4496 switch (o->op_type) {
4499 o->op_type = OP_PADHV;
4500 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4501 return ref(o, OP_RV2HV);
4505 o->op_type = OP_RV2HV;
4506 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4511 if (ckWARN_d(WARN_INTERNAL))
4512 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
4519 Perl_newAVREF(pTHX_ OP *o)
4521 if (o->op_type == OP_PADANY) {
4522 o->op_type = OP_PADAV;
4523 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4526 return newUNOP(OP_RV2AV, 0, scalar(o));
4530 Perl_newGVREF(pTHX_ I32 type, OP *o)
4532 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4533 return newUNOP(OP_NULL, 0, o);
4534 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4538 Perl_newHVREF(pTHX_ OP *o)
4540 if (o->op_type == OP_PADANY) {
4541 o->op_type = OP_PADHV;
4542 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4545 return newUNOP(OP_RV2HV, 0, scalar(o));
4549 Perl_oopsCV(pTHX_ OP *o)
4551 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4557 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4559 return newUNOP(OP_RV2CV, flags, scalar(o));
4563 Perl_newSVREF(pTHX_ OP *o)
4565 if (o->op_type == OP_PADANY) {
4566 o->op_type = OP_PADSV;
4567 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4570 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4571 o->op_flags |= OPpDONE_SVREF;
4574 return newUNOP(OP_RV2SV, 0, scalar(o));
4577 /* Check routines. */
4580 Perl_ck_anoncode(pTHX_ OP *o)
4585 name = NEWSV(1106,0);
4586 sv_upgrade(name, SVt_PVNV);
4587 sv_setpvn(name, "&", 1);
4590 ix = pad_alloc(o->op_type, SVs_PADMY);
4591 av_store(PL_comppad_name, ix, name);
4592 av_store(PL_comppad, ix, cSVOPo->op_sv);
4593 SvPADMY_on(cSVOPo->op_sv);
4594 cSVOPo->op_sv = Nullsv;
4595 cSVOPo->op_targ = ix;
4600 Perl_ck_bitop(pTHX_ OP *o)
4602 o->op_private = PL_hints;
4607 Perl_ck_concat(pTHX_ OP *o)
4609 if (cUNOPo->op_first->op_type == OP_CONCAT)
4610 o->op_flags |= OPf_STACKED;
4615 Perl_ck_spair(pTHX_ OP *o)
4617 if (o->op_flags & OPf_KIDS) {
4620 OPCODE type = o->op_type;
4621 o = modkids(ck_fun(o), type);
4622 kid = cUNOPo->op_first;
4623 newop = kUNOP->op_first->op_sibling;
4625 (newop->op_sibling ||
4626 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4627 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4628 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4632 op_free(kUNOP->op_first);
4633 kUNOP->op_first = newop;
4635 o->op_ppaddr = PL_ppaddr[++o->op_type];
4640 Perl_ck_delete(pTHX_ OP *o)
4644 if (o->op_flags & OPf_KIDS) {
4645 OP *kid = cUNOPo->op_first;
4646 if (kid->op_type == OP_HSLICE)
4647 o->op_private |= OPpSLICE;
4648 else if (kid->op_type != OP_HELEM)
4649 Perl_croak(aTHX_ "%s argument is not a HASH element or slice",
4650 PL_op_desc[o->op_type]);
4657 Perl_ck_eof(pTHX_ OP *o)
4659 I32 type = o->op_type;
4661 if (o->op_flags & OPf_KIDS) {
4662 if (cLISTOPo->op_first->op_type == OP_STUB) {
4664 o = newUNOP(type, OPf_SPECIAL,
4665 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4673 Perl_ck_eval(pTHX_ OP *o)
4675 PL_hints |= HINT_BLOCK_SCOPE;
4676 if (o->op_flags & OPf_KIDS) {
4677 SVOP *kid = (SVOP*)cUNOPo->op_first;
4680 o->op_flags &= ~OPf_KIDS;
4683 else if (kid->op_type == OP_LINESEQ) {
4686 kid->op_next = o->op_next;
4687 cUNOPo->op_first = 0;
4690 NewOp(1101, enter, 1, LOGOP);
4691 enter->op_type = OP_ENTERTRY;
4692 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4693 enter->op_private = 0;
4695 /* establish postfix order */
4696 enter->op_next = (OP*)enter;
4698 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4699 o->op_type = OP_LEAVETRY;
4700 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4701 enter->op_other = o;
4709 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4711 o->op_targ = (PADOFFSET)PL_hints;
4716 Perl_ck_exec(pTHX_ OP *o)
4719 if (o->op_flags & OPf_STACKED) {
4721 kid = cUNOPo->op_first->op_sibling;
4722 if (kid->op_type == OP_RV2GV)
4731 Perl_ck_exists(pTHX_ OP *o)
4734 if (o->op_flags & OPf_KIDS) {
4735 OP *kid = cUNOPo->op_first;
4736 if (kid->op_type != OP_HELEM)
4737 Perl_croak(aTHX_ "%s argument is not a HASH element", PL_op_desc[o->op_type]);
4745 Perl_ck_gvconst(pTHX_ register OP *o)
4747 o = fold_constants(o);
4748 if (o->op_type == OP_CONST)
4755 Perl_ck_rvconst(pTHX_ register OP *o)
4758 SVOP *kid = (SVOP*)cUNOPo->op_first;
4760 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4761 if (kid->op_type == OP_CONST) {
4765 SV *kidsv = kid->op_sv;
4768 /* Is it a constant from cv_const_sv()? */
4769 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4770 SV *rsv = SvRV(kidsv);
4771 int svtype = SvTYPE(rsv);
4772 char *badtype = Nullch;
4774 switch (o->op_type) {
4776 if (svtype > SVt_PVMG)
4777 badtype = "a SCALAR";
4780 if (svtype != SVt_PVAV)
4781 badtype = "an ARRAY";
4784 if (svtype != SVt_PVHV) {
4785 if (svtype == SVt_PVAV) { /* pseudohash? */
4786 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4787 if (ksv && SvROK(*ksv)
4788 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4797 if (svtype != SVt_PVCV)
4802 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
4805 name = SvPV(kidsv, n_a);
4806 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4807 char *badthing = Nullch;
4808 switch (o->op_type) {
4810 badthing = "a SCALAR";
4813 badthing = "an ARRAY";
4816 badthing = "a HASH";
4821 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4825 * This is a little tricky. We only want to add the symbol if we
4826 * didn't add it in the lexer. Otherwise we get duplicate strict
4827 * warnings. But if we didn't add it in the lexer, we must at
4828 * least pretend like we wanted to add it even if it existed before,
4829 * or we get possible typo warnings. OPpCONST_ENTERED says
4830 * whether the lexer already added THIS instance of this symbol.
4832 iscv = (o->op_type == OP_RV2CV) * 2;
4834 gv = gv_fetchpv(name,
4835 iscv | !(kid->op_private & OPpCONST_ENTERED),
4838 : o->op_type == OP_RV2SV
4840 : o->op_type == OP_RV2AV
4842 : o->op_type == OP_RV2HV
4845 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4847 kid->op_type = OP_GV;
4848 SvREFCNT_dec(kid->op_sv);
4849 kid->op_sv = SvREFCNT_inc(gv);
4850 kid->op_ppaddr = PL_ppaddr[OP_GV];
4857 Perl_ck_ftst(pTHX_ OP *o)
4860 I32 type = o->op_type;
4862 if (o->op_flags & OPf_REF)
4865 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4866 SVOP *kid = (SVOP*)cUNOPo->op_first;
4868 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4870 OP *newop = newGVOP(type, OPf_REF,
4871 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4878 if (type == OP_FTTTY)
4879 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4882 return newUNOP(type, 0, newDEFSVOP());
4888 Perl_ck_fun(pTHX_ OP *o)
4895 int type = o->op_type;
4896 register I32 oa = PL_opargs[type] >> OASHIFT;
4898 if (o->op_flags & OPf_STACKED) {
4899 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4902 return no_fh_allowed(o);
4905 if (o->op_flags & OPf_KIDS) {
4907 tokid = &cLISTOPo->op_first;
4908 kid = cLISTOPo->op_first;
4909 if (kid->op_type == OP_PUSHMARK ||
4910 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4912 tokid = &kid->op_sibling;
4913 kid = kid->op_sibling;
4915 if (!kid && PL_opargs[type] & OA_DEFGV)
4916 *tokid = kid = newDEFSVOP();
4920 sibl = kid->op_sibling;
4923 /* list seen where single (scalar) arg expected? */
4924 if (numargs == 1 && !(oa >> 4)
4925 && kid->op_type == OP_LIST && type != OP_SCALAR)
4927 return too_many_arguments(o,PL_op_desc[type]);
4940 if (kid->op_type == OP_CONST &&
4941 (kid->op_private & OPpCONST_BARE))
4943 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4944 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4945 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4947 if (ckWARN(WARN_SYNTAX))
4948 Perl_warner(aTHX_ WARN_SYNTAX,
4949 "Array @%s missing the @ in argument %" PERL_PRId64 " of %s()",
4950 name, (IV)numargs, PL_op_desc[type]);
4952 if (ckWARN(WARN_SYNTAX))
4953 Perl_warner(aTHX_ WARN_SYNTAX,
4954 "Array @%s missing the @ in argument %ld of %s()",
4955 name, (long)numargs, PL_op_desc[type]);
4959 kid->op_sibling = sibl;
4962 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4963 bad_type(numargs, "array", PL_op_desc[type], kid);
4967 if (kid->op_type == OP_CONST &&
4968 (kid->op_private & OPpCONST_BARE))
4970 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4971 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4972 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4974 if (ckWARN(WARN_SYNTAX))
4975 Perl_warner(aTHX_ WARN_SYNTAX,
4976 "Hash %%%s missing the %% in argument %" PERL_PRId64 " of %s()",
4977 name, (IV)numargs, PL_op_desc[type]);
4979 if (ckWARN(WARN_SYNTAX))
4980 Perl_warner(aTHX_ WARN_SYNTAX,
4981 "Hash %%%s missing the %% in argument %ld of %s()",
4982 name, (long)numargs, PL_op_desc[type]);
4986 kid->op_sibling = sibl;
4989 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4990 bad_type(numargs, "hash", PL_op_desc[type], kid);
4995 OP *newop = newUNOP(OP_NULL, 0, kid);
4996 kid->op_sibling = 0;
4998 newop->op_next = newop;
5000 kid->op_sibling = sibl;
5005 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5006 if (kid->op_type == OP_CONST &&
5007 (kid->op_private & OPpCONST_BARE))
5009 OP *newop = newGVOP(OP_GV, 0,
5010 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5015 else if (kid->op_type == OP_READLINE) {
5016 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5017 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5020 I32 flags = OPf_SPECIAL;
5022 /* is this op a FH constructor? */
5023 if (is_handle_constructor(o,numargs)) {
5025 /* Set a flag to tell rv2gv to vivify
5026 * need to "prove" flag does not mean something
5027 * else already - NI-S 1999/05/07
5031 /* Helps with open($array[$n],...)
5032 but is too simplistic - need to do selectively
5037 kid->op_sibling = 0;
5038 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5040 kid->op_private |= priv;
5043 kid->op_sibling = sibl;
5049 mod(scalar(kid), type);
5053 tokid = &kid->op_sibling;
5054 kid = kid->op_sibling;
5056 o->op_private |= numargs;
5058 return too_many_arguments(o,PL_op_desc[o->op_type]);
5061 else if (PL_opargs[type] & OA_DEFGV) {
5063 return newUNOP(type, 0, newDEFSVOP());
5067 while (oa & OA_OPTIONAL)
5069 if (oa && oa != OA_LIST)
5070 return too_few_arguments(o,PL_op_desc[o->op_type]);
5076 Perl_ck_glob(pTHX_ OP *o)
5080 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5081 append_elem(OP_GLOB, o, newDEFSVOP());
5083 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5084 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5086 if (gv && GvIMPORTED_CV(gv)) {
5087 append_elem(OP_GLOB, o,
5088 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5089 o->op_type = OP_LIST;
5090 o->op_ppaddr = PL_ppaddr[OP_LIST];
5091 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5092 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5093 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5094 append_elem(OP_LIST, o,
5095 scalar(newUNOP(OP_RV2CV, 0,
5096 newGVOP(OP_GV, 0, gv)))));
5097 o = newUNOP(OP_NULL, 0, ck_subr(o));
5098 o->op_targ = OP_GLOB; /* hint at what it used to be */
5101 gv = newGVgen("main");
5103 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5109 Perl_ck_grep(pTHX_ OP *o)
5113 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5115 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5116 NewOp(1101, gwop, 1, LOGOP);
5118 if (o->op_flags & OPf_STACKED) {
5121 kid = cLISTOPo->op_first->op_sibling;
5122 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5125 kid->op_next = (OP*)gwop;
5126 o->op_flags &= ~OPf_STACKED;
5128 kid = cLISTOPo->op_first->op_sibling;
5129 if (type == OP_MAPWHILE)
5136 kid = cLISTOPo->op_first->op_sibling;
5137 if (kid->op_type != OP_NULL)
5138 Perl_croak(aTHX_ "panic: ck_grep");
5139 kid = kUNOP->op_first;
5141 gwop->op_type = type;
5142 gwop->op_ppaddr = PL_ppaddr[type];
5143 gwop->op_first = listkids(o);
5144 gwop->op_flags |= OPf_KIDS;
5145 gwop->op_private = 1;
5146 gwop->op_other = LINKLIST(kid);
5147 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5148 kid->op_next = (OP*)gwop;
5150 kid = cLISTOPo->op_first->op_sibling;
5151 if (!kid || !kid->op_sibling)
5152 return too_few_arguments(o,PL_op_desc[o->op_type]);
5153 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5154 mod(kid, OP_GREPSTART);
5160 Perl_ck_index(pTHX_ OP *o)
5162 if (o->op_flags & OPf_KIDS) {
5163 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5165 kid = kid->op_sibling; /* get past "big" */
5166 if (kid && kid->op_type == OP_CONST)
5167 fbm_compile(((SVOP*)kid)->op_sv, 0);
5173 Perl_ck_lengthconst(pTHX_ OP *o)
5175 /* XXX length optimization goes here */
5180 Perl_ck_lfun(pTHX_ OP *o)
5182 OPCODE type = o->op_type;
5183 return modkids(ck_fun(o), type);
5187 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5190 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5191 switch (cUNOPo->op_first->op_type) {
5193 break; /* Globals via GV can be undef */
5195 case OP_AASSIGN: /* Is this a good idea? */
5196 Perl_warner(aTHX_ WARN_DEPRECATED,
5197 "defined(@array) is deprecated");
5198 Perl_warner(aTHX_ WARN_DEPRECATED,
5199 "(Maybe you should just omit the defined()?)\n");
5202 break; /* Globals via GV can be undef */
5204 Perl_warner(aTHX_ WARN_DEPRECATED,
5205 "defined(%hash) is deprecated");
5206 Perl_warner(aTHX_ WARN_DEPRECATED,
5207 "(Maybe you should just omit the defined()?)\n");
5218 Perl_ck_rfun(pTHX_ OP *o)
5220 OPCODE type = o->op_type;
5221 return refkids(ck_fun(o), type);
5225 Perl_ck_listiob(pTHX_ OP *o)
5229 kid = cLISTOPo->op_first;
5232 kid = cLISTOPo->op_first;
5234 if (kid->op_type == OP_PUSHMARK)
5235 kid = kid->op_sibling;
5236 if (kid && o->op_flags & OPf_STACKED)
5237 kid = kid->op_sibling;
5238 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5239 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5240 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5241 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5242 cLISTOPo->op_first->op_sibling = kid;
5243 cLISTOPo->op_last = kid;
5244 kid = kid->op_sibling;
5249 append_elem(o->op_type, o, newDEFSVOP());
5255 if (PL_hints & HINT_LOCALE)
5256 o->op_private |= OPpLOCALE;
5263 Perl_ck_fun_locale(pTHX_ OP *o)
5269 if (PL_hints & HINT_LOCALE)
5270 o->op_private |= OPpLOCALE;
5277 Perl_ck_sassign(pTHX_ OP *o)
5279 OP *kid = cLISTOPo->op_first;
5280 /* has a disposable target? */
5281 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5282 && !(kid->op_flags & OPf_STACKED))
5284 OP *kkid = kid->op_sibling;
5286 /* Can just relocate the target. */
5287 if (kkid && kkid->op_type == OP_PADSV
5288 && !(kkid->op_private & OPpLVAL_INTRO))
5290 /* Concat has problems if target is equal to right arg. */
5291 if (kid->op_type == OP_CONCAT
5292 && kLISTOP->op_first->op_sibling->op_type == OP_PADSV
5293 && kLISTOP->op_first->op_sibling->op_targ == kkid->op_targ)
5297 if (kid->op_type == OP_JOIN) {
5298 /* do_join has problems the arguments coincide with target.
5299 In fact the second argument *can* safely coincide,
5300 but ignore=pessimize this rare occasion. */
5301 OP *arg = kLISTOP->op_first->op_sibling; /* Skip PUSHMARK */
5304 if (arg->op_type == OP_PADSV
5305 && arg->op_targ == kkid->op_targ)
5307 arg = arg->op_sibling;
5310 kid->op_targ = kkid->op_targ;
5311 /* Now we do not need PADSV and SASSIGN. */
5312 kid->op_sibling = o->op_sibling; /* NULL */
5313 cLISTOPo->op_first = NULL;
5316 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5324 Perl_ck_scmp(pTHX_ OP *o)
5328 if (PL_hints & HINT_LOCALE)
5329 o->op_private |= OPpLOCALE;
5336 Perl_ck_match(pTHX_ OP *o)
5338 o->op_private |= OPpRUNTIME;
5343 Perl_ck_method(pTHX_ OP *o)
5345 OP *kid = cUNOPo->op_first;
5346 if (kid->op_type == OP_CONST) {
5347 SV* sv = kSVOP->op_sv;
5348 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5350 sv_upgrade(sv, SVt_PVIV);
5352 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5353 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5354 kSVOP->op_sv = Nullsv;
5363 Perl_ck_null(pTHX_ OP *o)
5369 Perl_ck_repeat(pTHX_ OP *o)
5371 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5372 o->op_private |= OPpREPEAT_DOLIST;
5373 cBINOPo->op_first = force_list(cBINOPo->op_first);
5381 Perl_ck_require(pTHX_ OP *o)
5383 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5384 SVOP *kid = (SVOP*)cUNOPo->op_first;
5386 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5388 for (s = SvPVX(kid->op_sv); *s; s++) {
5389 if (*s == ':' && s[1] == ':') {
5391 Move(s+2, s+1, strlen(s+2)+1, char);
5392 --SvCUR(kid->op_sv);
5395 sv_catpvn(kid->op_sv, ".pm", 3);
5403 Perl_ck_retarget(pTHX_ OP *o)
5405 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5412 Perl_ck_select(pTHX_ OP *o)
5415 if (o->op_flags & OPf_KIDS) {
5416 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5417 if (kid && kid->op_sibling) {
5418 o->op_type = OP_SSELECT;
5419 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5421 return fold_constants(o);
5425 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5426 if (kid && kid->op_type == OP_RV2GV)
5427 kid->op_private &= ~HINT_STRICT_REFS;
5432 Perl_ck_shift(pTHX_ OP *o)
5434 I32 type = o->op_type;
5436 if (!(o->op_flags & OPf_KIDS)) {
5441 if (!CvUNIQUE(PL_compcv)) {
5442 argop = newOP(OP_PADAV, OPf_REF);
5443 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5446 argop = newUNOP(OP_RV2AV, 0,
5447 scalar(newGVOP(OP_GV, 0,
5448 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5451 argop = newUNOP(OP_RV2AV, 0,
5452 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5453 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5454 #endif /* USE_THREADS */
5455 return newUNOP(type, 0, scalar(argop));
5457 return scalar(modkids(ck_fun(o), type));
5461 Perl_ck_sort(pTHX_ OP *o)
5465 if (PL_hints & HINT_LOCALE)
5466 o->op_private |= OPpLOCALE;
5469 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5471 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5472 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5474 kid = kUNOP->op_first; /* get past null */
5476 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5478 if (kid->op_type == OP_SCOPE) {
5482 else if (kid->op_type == OP_LEAVE) {
5483 if (o->op_type == OP_SORT) {
5484 null(kid); /* wipe out leave */
5487 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5488 if (k->op_next == kid)
5493 kid->op_next = 0; /* just disconnect the leave */
5494 k = kLISTOP->op_first;
5498 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5499 if (o->op_type == OP_SORT)
5503 o->op_flags |= OPf_SPECIAL;
5505 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5506 null(cLISTOPo->op_first->op_sibling);
5513 S_simplify_sort(pTHX_ OP *o)
5516 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5519 if (!(o->op_flags & OPf_STACKED))
5521 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5522 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5523 kid = kUNOP->op_first; /* get past null */
5524 if (kid->op_type != OP_SCOPE)
5526 kid = kLISTOP->op_last; /* get past scope */
5527 switch(kid->op_type) {
5535 k = kid; /* remember this node*/
5536 if (kBINOP->op_first->op_type != OP_RV2SV)
5538 kid = kBINOP->op_first; /* get past cmp */
5539 if (kUNOP->op_first->op_type != OP_GV)
5541 kid = kUNOP->op_first; /* get past rv2sv */
5542 if (GvSTASH(kGVOP->op_gv) != PL_curstash)
5544 if (strEQ(GvNAME(kGVOP->op_gv), "a"))
5546 else if(strEQ(GvNAME(kGVOP->op_gv), "b"))
5550 kid = k; /* back to cmp */
5551 if (kBINOP->op_last->op_type != OP_RV2SV)
5553 kid = kBINOP->op_last; /* down to 2nd arg */
5554 if (kUNOP->op_first->op_type != OP_GV)
5556 kid = kUNOP->op_first; /* get past rv2sv */
5557 if (GvSTASH(kGVOP->op_gv) != PL_curstash
5559 ? strNE(GvNAME(kGVOP->op_gv), "a")
5560 : strNE(GvNAME(kGVOP->op_gv), "b")))
5562 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5564 o->op_private |= OPpSORT_REVERSE;
5565 if (k->op_type == OP_NCMP)
5566 o->op_private |= OPpSORT_NUMERIC;
5567 if (k->op_type == OP_I_NCMP)
5568 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5569 kid = cLISTOPo->op_first->op_sibling;
5570 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
5571 op_free(kid); /* then delete it */
5572 cLISTOPo->op_children--;
5576 Perl_ck_split(pTHX_ OP *o)
5580 if (o->op_flags & OPf_STACKED)
5581 return no_fh_allowed(o);
5583 kid = cLISTOPo->op_first;
5584 if (kid->op_type != OP_NULL)
5585 Perl_croak(aTHX_ "panic: ck_split");
5586 kid = kid->op_sibling;
5587 op_free(cLISTOPo->op_first);
5588 cLISTOPo->op_first = kid;
5590 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5591 cLISTOPo->op_last = kid; /* There was only one element previously */
5594 if (kid->op_type != OP_MATCH) {
5595 OP *sibl = kid->op_sibling;
5596 kid->op_sibling = 0;
5597 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5598 if (cLISTOPo->op_first == cLISTOPo->op_last)
5599 cLISTOPo->op_last = kid;
5600 cLISTOPo->op_first = kid;
5601 kid->op_sibling = sibl;
5604 kid->op_type = OP_PUSHRE;
5605 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5608 if (!kid->op_sibling)
5609 append_elem(OP_SPLIT, o, newDEFSVOP());
5611 kid = kid->op_sibling;
5614 if (!kid->op_sibling)
5615 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5617 kid = kid->op_sibling;
5620 if (kid->op_sibling)
5621 return too_many_arguments(o,PL_op_desc[o->op_type]);
5627 Perl_ck_subr(pTHX_ OP *o)
5630 OP *prev = ((cUNOPo->op_first->op_sibling)
5631 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5632 OP *o2 = prev->op_sibling;
5641 o->op_private |= OPpENTERSUB_HASTARG;
5642 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5643 if (cvop->op_type == OP_RV2CV) {
5645 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5646 null(cvop); /* disable rv2cv */
5647 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5648 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
5649 cv = GvCVu(tmpop->op_sv);
5651 tmpop->op_private |= OPpEARLY_CV;
5652 else if (SvPOK(cv)) {
5653 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5654 proto = SvPV((SV*)cv, n_a);
5658 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
5659 if (o2->op_type == OP_CONST)
5660 o2->op_private &= ~OPpCONST_STRICT;
5661 else if (o2->op_type == OP_LIST) {
5662 OP *o = ((UNOP*)o2)->op_first->op_sibling;
5663 if (o && o->op_type == OP_CONST)
5664 o->op_private &= ~OPpCONST_STRICT;
5667 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5668 if (PERLDB_SUB && PL_curstash != PL_debstash)
5669 o->op_private |= OPpENTERSUB_DB;
5670 while (o2 != cvop) {
5674 return too_many_arguments(o, gv_ename(namegv));
5692 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5693 bad_type(arg, "block", gv_ename(namegv), o2);
5696 /* '*' allows any scalar type, including bareword */
5699 if (o2->op_type == OP_RV2GV)
5700 goto wrapref; /* autoconvert GLOB -> GLOBref */
5701 else if (o2->op_type == OP_CONST)
5702 o2->op_private &= ~OPpCONST_STRICT;
5703 else if (o2->op_type == OP_ENTERSUB) {
5704 /* accidental subroutine, revert to bareword */
5705 OP *gvop = ((UNOP*)o2)->op_first;
5706 if (gvop && gvop->op_type == OP_NULL) {
5707 gvop = ((UNOP*)gvop)->op_first;
5709 for (; gvop->op_sibling; gvop = gvop->op_sibling)
5712 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
5713 (gvop = ((UNOP*)gvop)->op_first) &&
5714 gvop->op_type == OP_GV)
5716 GV *gv = (GV*)((SVOP*)gvop)->op_sv;
5717 OP *sibling = o2->op_sibling;
5718 SV *n = newSVpvn("",0);
5720 gv_fullname3(n, gv, "");
5721 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
5722 sv_chop(n, SvPVX(n)+6);
5723 o2 = newSVOP(OP_CONST, 0, n);
5724 prev->op_sibling = o2;
5725 o2->op_sibling = sibling;
5737 if (o2->op_type != OP_RV2GV)
5738 bad_type(arg, "symbol", gv_ename(namegv), o2);
5741 if (o2->op_type != OP_RV2CV)
5742 bad_type(arg, "sub", gv_ename(namegv), o2);
5745 if (o2->op_type != OP_RV2SV
5746 && o2->op_type != OP_PADSV
5747 && o2->op_type != OP_HELEM
5748 && o2->op_type != OP_AELEM
5749 && o2->op_type != OP_THREADSV)
5751 bad_type(arg, "scalar", gv_ename(namegv), o2);
5755 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5756 bad_type(arg, "array", gv_ename(namegv), o2);
5759 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5760 bad_type(arg, "hash", gv_ename(namegv), o2);
5764 OP* sib = kid->op_sibling;
5765 kid->op_sibling = 0;
5766 o2 = newUNOP(OP_REFGEN, 0, kid);
5767 o2->op_sibling = sib;
5768 prev->op_sibling = o2;
5779 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
5780 gv_ename(namegv), SvPV((SV*)cv, n_a));
5785 mod(o2, OP_ENTERSUB);
5787 o2 = o2->op_sibling;
5789 if (proto && !optional &&
5790 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5791 return too_few_arguments(o, gv_ename(namegv));
5796 Perl_ck_svconst(pTHX_ OP *o)
5798 SvREADONLY_on(cSVOPo->op_sv);
5803 Perl_ck_trunc(pTHX_ OP *o)
5805 if (o->op_flags & OPf_KIDS) {
5806 SVOP *kid = (SVOP*)cUNOPo->op_first;
5808 if (kid->op_type == OP_NULL)
5809 kid = (SVOP*)kid->op_sibling;
5810 if (kid && kid->op_type == OP_CONST &&
5811 (kid->op_private & OPpCONST_BARE))
5813 o->op_flags |= OPf_SPECIAL;
5814 kid->op_private &= ~OPpCONST_STRICT;
5820 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5823 Perl_peep(pTHX_ register OP *o)
5826 register OP* oldop = 0;
5829 if (!o || o->op_seq)
5833 SAVESPTR(PL_curcop);
5834 for (; o; o = o->op_next) {
5840 switch (o->op_type) {
5844 PL_curcop = ((COP*)o); /* for warnings */
5845 o->op_seq = PL_op_seqmax++;
5849 if (cSVOPo->op_private & OPpCONST_STRICT)
5850 no_bareword_allowed(o);
5856 if ( o->op_next && o->op_next->op_type == OP_STRINGIFY
5857 && !(o->op_next->op_private & OPpTARGET_MY) )
5859 o->op_seq = PL_op_seqmax++;
5864 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
5865 if (o->op_next->op_private & OPpTARGET_MY) {
5866 if ((o->op_flags & OPf_STACKED) /* chained concats */
5867 || (o->op_type == OP_CONCAT
5868 /* Concat has problems if target is equal to right arg. */
5869 && (((LISTOP*)o)->op_first->op_sibling->op_type
5871 && (((LISTOP*)o)->op_first->op_sibling->op_targ
5872 == o->op_next->op_targ))) {
5873 goto ignore_optimization;
5875 o->op_targ = o->op_next->op_targ;
5876 o->op_private |= OPpTARGET_MY;
5881 ignore_optimization:
5882 o->op_seq = PL_op_seqmax++;
5885 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5886 o->op_seq = PL_op_seqmax++;
5887 break; /* Scalar stub must produce undef. List stub is noop */
5891 if (o->op_targ == OP_NEXTSTATE
5892 || o->op_targ == OP_DBSTATE
5893 || o->op_targ == OP_SETSTATE)
5895 PL_curcop = ((COP*)o);
5902 if (oldop && o->op_next) {
5903 oldop->op_next = o->op_next;
5906 o->op_seq = PL_op_seqmax++;
5910 if (o->op_next->op_type == OP_RV2SV) {
5911 if (!(o->op_next->op_private & OPpDEREF)) {
5913 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5914 o->op_next = o->op_next->op_next;
5915 o->op_type = OP_GVSV;
5916 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5919 else if (o->op_next->op_type == OP_RV2AV) {
5920 OP* pop = o->op_next->op_next;
5922 if (pop->op_type == OP_CONST &&
5923 (PL_op = pop->op_next) &&
5924 pop->op_next->op_type == OP_AELEM &&
5925 !(pop->op_next->op_private &
5926 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5927 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5934 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5935 o->op_next = pop->op_next->op_next;
5936 o->op_type = OP_AELEMFAST;
5937 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5938 o->op_private = (U8)i;
5939 GvAVn(((GVOP*)o)->op_gv);
5942 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_UNSAFE)) {
5943 GV *gv = cGVOPo->op_gv;
5944 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
5945 /* XXX could check prototype here instead of just carping */
5946 SV *sv = sv_newmortal();
5947 gv_efullname3(sv, gv, Nullch);
5948 Perl_warner(aTHX_ WARN_UNSAFE,
5949 "%s() called too early to check prototype",
5954 o->op_seq = PL_op_seqmax++;
5965 o->op_seq = PL_op_seqmax++;
5966 while (cLOGOP->op_other->op_type == OP_NULL)
5967 cLOGOP->op_other = cLOGOP->op_other->op_next;
5968 peep(cLOGOP->op_other);
5972 o->op_seq = PL_op_seqmax++;
5973 peep(cLOOP->op_redoop);
5974 peep(cLOOP->op_nextop);
5975 peep(cLOOP->op_lastop);
5981 o->op_seq = PL_op_seqmax++;
5982 peep(cPMOP->op_pmreplstart);
5986 o->op_seq = PL_op_seqmax++;
5987 if (ckWARN(WARN_SYNTAX) && o->op_next
5988 && o->op_next->op_type == OP_NEXTSTATE) {
5989 if (o->op_next->op_sibling &&
5990 o->op_next->op_sibling->op_type != OP_EXIT &&
5991 o->op_next->op_sibling->op_type != OP_WARN &&
5992 o->op_next->op_sibling->op_type != OP_DIE) {
5993 line_t oldline = PL_curcop->cop_line;
5995 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5996 Perl_warner(aTHX_ WARN_SYNTAX, "Statement unlikely to be reached");
5997 Perl_warner(aTHX_ WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5998 PL_curcop->cop_line = oldline;
6012 if ((o->op_private & (OPpLVAL_INTRO))
6013 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6015 rop = (UNOP*)((BINOP*)o)->op_first;
6016 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6018 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6019 if (!SvOBJECT(lexname))
6021 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6022 if (!fields || !GvHV(*fields))
6024 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
6025 key = SvPV(*svp, keylen);
6026 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6028 Perl_croak(aTHX_ "No such field \"%s\" in variable %s of type %s",
6029 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6031 ind = SvIV(*indsvp);
6033 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6034 rop->op_type = OP_RV2AV;
6035 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6036 o->op_type = OP_AELEM;
6037 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6039 *svp = newSViv(ind);
6044 o->op_seq = PL_op_seqmax++;