3 * Copyright (c) 1991-1999, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
23 #define CHECKCALL this->*PL_check
25 #define CHECKCALL *PL_check
28 /* #define PL_OP_SLAB_ALLOC */
30 #ifdef PL_OP_SLAB_ALLOC
31 #define SLAB_SIZE 8192
32 static char *PL_OpPtr = NULL;
33 static int PL_OpSpace = 0;
34 #define NewOp(m,var,c,type) do { if ((PL_OpSpace -= c*sizeof(type)) >= 0) \
35 var = (type *)(PL_OpPtr -= c*sizeof(type)); \
37 var = (type *) Slab_Alloc(m,c*sizeof(type)); \
41 S_Slab_Alloc(pTHX_ int m, size_t sz)
43 Newz(m,PL_OpPtr,SLAB_SIZE,char);
44 PL_OpSpace = SLAB_SIZE - sz;
45 return PL_OpPtr += PL_OpSpace;
49 #define NewOp(m, var, c, type) Newz(m, var, c, type)
52 * In the following definition, the ", Nullop" is just to make the compiler
53 * think the expression is of the right type: croak actually does a Siglongjmp.
55 #define CHECKOP(type,o) \
56 ((PL_op_mask && PL_op_mask[type]) \
57 ? ( op_free((OP*)o), \
58 Perl_croak(aTHX_ "%s trapped by operation mask", PL_op_desc[type]), \
60 : (CHECKCALL[type])(aTHX_ (OP*)o))
62 #define PAD_MAX 999999999
65 S_gv_ename(pTHX_ GV *gv)
68 SV* tmpsv = sv_newmortal();
69 gv_efullname3(tmpsv, gv, Nullch);
70 return SvPV(tmpsv,n_a);
74 S_no_fh_allowed(pTHX_ OP *o)
76 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
77 PL_op_desc[o->op_type]));
82 S_too_few_arguments(pTHX_ OP *o, char *name)
84 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
89 S_too_many_arguments(pTHX_ OP *o, char *name)
91 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
96 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
98 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
99 (int)n, name, t, PL_op_desc[kid->op_type]));
103 S_no_bareword_allowed(pTHX_ OP *o)
105 Perl_warn(aTHX_ "Bareword \"%s\" not allowed while \"strict subs\" in use",
106 SvPV_nolen(cSVOPo->op_sv));
111 Perl_assertref(pTHX_ OP *o)
113 int type = o->op_type;
114 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
115 yyerror(Perl_form(aTHX_ "Can't use subscript on %s", PL_op_desc[type]));
116 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
118 SV *msg = sv_2mortal(
119 Perl_newSVpvf(aTHX_ "(Did you mean $ or @ instead of %c?)\n",
120 type == OP_ENTERSUB ? '&' : '%'));
121 if (PL_in_eval & EVAL_WARNONLY)
122 Perl_warn(aTHX_ "%_", msg);
124 sv_catsv(GvSV(PL_errgv), msg);
126 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
131 /* "register" allocation */
134 Perl_pad_allocmy(pTHX_ char *name)
142 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
143 name[1] == '_' && (int)strlen(name) > 2))
145 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
146 /* 1999-02-27 mjd@plover.com */
148 p = strchr(name, '\0');
149 /* The next block assumes the buffer is at least 205 chars
150 long. At present, it's always at least 256 chars. */
152 strcpy(name+200, "...");
158 /* Move everything else down one character */
159 for (; p-name > 2; p--)
161 name[2] = toCTRL(name[1]);
164 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
166 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
167 SV **svp = AvARRAY(PL_comppad_name);
168 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
170 && sv != &PL_sv_undef
171 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
172 && strEQ(name, SvPVX(sv)))
174 Perl_warner(aTHX_ WARN_UNSAFE,
175 "\"my\" variable %s masks earlier declaration in same %s",
176 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
181 off = pad_alloc(OP_PADSV, SVs_PADMY);
183 sv_upgrade(sv, SVt_PVNV);
185 if (PL_in_my_stash) {
187 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"my\"",
190 (void)SvUPGRADE(sv, SVt_PVMG);
191 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
194 av_store(PL_comppad_name, off, sv);
195 SvNVX(sv) = (NV)PAD_MAX;
196 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
197 if (!PL_min_intro_pending)
198 PL_min_intro_pending = off;
199 PL_max_intro_pending = off;
201 av_store(PL_comppad, off, (SV*)newAV());
202 else if (*name == '%')
203 av_store(PL_comppad, off, (SV*)newHV());
204 SvPADMY_on(PL_curpad[off]);
208 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
211 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
212 I32 cx_ix, I32 saweval, U32 flags)
219 register PERL_CONTEXT *cx;
221 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
222 AV *curlist = CvPADLIST(cv);
223 SV **svp = av_fetch(curlist, 0, FALSE);
226 if (!svp || *svp == &PL_sv_undef)
229 svp = AvARRAY(curname);
230 for (off = AvFILLp(curname); off > 0; off--) {
231 if ((sv = svp[off]) &&
232 sv != &PL_sv_undef &&
234 seq > I_32(SvNVX(sv)) &&
235 strEQ(SvPVX(sv), name))
246 return 0; /* don't clone from inactive stack frame */
250 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
251 oldsv = *av_fetch(oldpad, off, TRUE);
252 if (!newoff) { /* Not a mere clone operation. */
253 SV *namesv = NEWSV(1103,0);
254 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
255 sv_upgrade(namesv, SVt_PVNV);
256 sv_setpv(namesv, name);
257 av_store(PL_comppad_name, newoff, namesv);
258 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
259 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
260 SvFAKE_on(namesv); /* A ref, not a real var */
261 if (SvOBJECT(sv)) { /* A typed var */
263 (void)SvUPGRADE(namesv, SVt_PVMG);
264 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
267 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
268 /* "It's closures all the way down." */
269 CvCLONE_on(PL_compcv);
271 if (CvANON(PL_compcv))
272 oldsv = Nullsv; /* no need to keep ref */
277 bcv && bcv != cv && !CvCLONE(bcv);
278 bcv = CvOUTSIDE(bcv))
283 if (ckWARN(WARN_CLOSURE)
284 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
286 Perl_warner(aTHX_ WARN_CLOSURE,
287 "Variable \"%s\" may be unavailable",
295 else if (!CvUNIQUE(PL_compcv)) {
296 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
297 Perl_warner(aTHX_ WARN_CLOSURE,
298 "Variable \"%s\" will not stay shared", name);
301 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
307 if (flags & FINDLEX_NOSEARCH)
310 /* Nothing in current lexical context--try eval's context, if any.
311 * This is necessary to let the perldb get at lexically scoped variables.
312 * XXX This will also probably interact badly with eval tree caching.
315 for (i = cx_ix; i >= 0; i--) {
317 switch (CxTYPE(cx)) {
319 if (i == 0 && saweval) {
320 seq = cxstack[saweval].blk_oldcop->cop_seq;
321 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
325 switch (cx->blk_eval.old_op_type) {
331 /* require must have its own scope */
339 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
340 saweval = i; /* so we know where we were called from */
343 seq = cxstack[saweval].blk_oldcop->cop_seq;
344 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
352 Perl_pad_findmy(pTHX_ char *name)
358 SV **svp = AvARRAY(PL_comppad_name);
359 U32 seq = PL_cop_seqmax;
365 * Special case to get lexical (and hence per-thread) @_.
366 * XXX I need to find out how to tell at parse-time whether use
367 * of @_ should refer to a lexical (from a sub) or defgv (global
368 * scope and maybe weird sub-ish things like formats). See
369 * startsub in perly.y. It's possible that @_ could be lexical
370 * (at least from subs) even in non-threaded perl.
372 if (strEQ(name, "@_"))
373 return 0; /* success. (NOT_IN_PAD indicates failure) */
374 #endif /* USE_THREADS */
376 /* The one we're looking for is probably just before comppad_name_fill. */
377 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
378 if ((sv = svp[off]) &&
379 sv != &PL_sv_undef &&
382 seq > I_32(SvNVX(sv)))) &&
383 strEQ(SvPVX(sv), name))
386 return (PADOFFSET)off;
387 pendoff = off; /* this pending def. will override import */
391 outside = CvOUTSIDE(PL_compcv);
393 /* Check if if we're compiling an eval'', and adjust seq to be the
394 * eval's seq number. This depends on eval'' having a non-null
395 * CvOUTSIDE() while it is being compiled. The eval'' itself is
396 * identified by CvEVAL being true and CvGV being null. */
397 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
398 cx = &cxstack[cxstack_ix];
400 seq = cx->blk_oldcop->cop_seq;
403 /* See if it's in a nested scope */
404 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
406 /* If there is a pending local definition, this new alias must die */
408 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
409 return off; /* pad_findlex returns 0 for failure...*/
411 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
415 Perl_pad_leavemy(pTHX_ I32 fill)
419 SV **svp = AvARRAY(PL_comppad_name);
421 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
422 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
423 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
424 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
427 /* "Deintroduce" my variables that are leaving with this scope. */
428 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
429 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
430 SvIVX(sv) = PL_cop_seqmax;
435 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
441 if (AvARRAY(PL_comppad) != PL_curpad)
442 Perl_croak(aTHX_ "panic: pad_alloc");
443 if (PL_pad_reset_pending)
445 if (tmptype & SVs_PADMY) {
447 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
448 } while (SvPADBUSY(sv)); /* need a fresh one */
449 retval = AvFILLp(PL_comppad);
452 SV **names = AvARRAY(PL_comppad_name);
453 SSize_t names_fill = AvFILLp(PL_comppad_name);
456 * "foreach" index vars temporarily become aliases to non-"my"
457 * values. Thus we must skip, not just pad values that are
458 * marked as current pad values, but also those with names.
460 if (++PL_padix <= names_fill &&
461 (sv = names[PL_padix]) && sv != &PL_sv_undef)
463 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
464 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
469 SvFLAGS(sv) |= tmptype;
470 PL_curpad = AvARRAY(PL_comppad);
472 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
473 (unsigned long) thr, (unsigned long) PL_curpad,
474 (long) retval, PL_op_name[optype]));
476 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
477 (unsigned long) PL_curpad,
478 (long) retval, PL_op_name[optype]));
479 #endif /* USE_THREADS */
480 return (PADOFFSET)retval;
484 Perl_pad_sv(pTHX_ PADOFFSET po)
488 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
489 (unsigned long) thr, (unsigned long) PL_curpad, po));
492 Perl_croak(aTHX_ "panic: pad_sv po");
493 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
494 (unsigned long) PL_curpad, po));
495 #endif /* USE_THREADS */
496 return PL_curpad[po]; /* eventually we'll turn this into a macro */
500 Perl_pad_free(pTHX_ PADOFFSET po)
505 if (AvARRAY(PL_comppad) != PL_curpad)
506 Perl_croak(aTHX_ "panic: pad_free curpad");
508 Perl_croak(aTHX_ "panic: pad_free po");
510 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
511 (unsigned long) thr, (unsigned long) PL_curpad, po));
513 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
514 (unsigned long) PL_curpad, po));
515 #endif /* USE_THREADS */
516 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
517 SvPADTMP_off(PL_curpad[po]);
518 if ((I32)po < PL_padix)
523 Perl_pad_swipe(pTHX_ PADOFFSET po)
526 if (AvARRAY(PL_comppad) != PL_curpad)
527 Perl_croak(aTHX_ "panic: pad_swipe curpad");
529 Perl_croak(aTHX_ "panic: pad_swipe po");
531 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
532 (unsigned long) thr, (unsigned long) PL_curpad, po));
534 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
535 (unsigned long) PL_curpad, po));
536 #endif /* USE_THREADS */
537 SvPADTMP_off(PL_curpad[po]);
538 PL_curpad[po] = NEWSV(1107,0);
539 SvPADTMP_on(PL_curpad[po]);
540 if ((I32)po < PL_padix)
544 /* XXX pad_reset() is currently disabled because it results in serious bugs.
545 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
546 * on the stack by OPs that use them, there are several ways to get an alias
547 * to a shared TARG. Such an alias will change randomly and unpredictably.
548 * We avoid doing this until we can think of a Better Way.
553 #ifdef USE_BROKEN_PAD_RESET
557 if (AvARRAY(PL_comppad) != PL_curpad)
558 Perl_croak(aTHX_ "panic: pad_reset curpad");
560 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
561 (unsigned long) thr, (unsigned long) PL_curpad));
563 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
564 (unsigned long) PL_curpad));
565 #endif /* USE_THREADS */
566 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
567 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
568 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
569 SvPADTMP_off(PL_curpad[po]);
571 PL_padix = PL_padix_floor;
574 PL_pad_reset_pending = FALSE;
578 /* find_threadsv is not reentrant */
580 Perl_find_threadsv(pTHX_ const char *name)
586 /* We currently only handle names of a single character */
587 p = strchr(PL_threadsv_names, *name);
590 key = p - PL_threadsv_names;
591 MUTEX_LOCK(&thr->mutex);
592 svp = av_fetch(thr->threadsv, key, FALSE);
594 MUTEX_UNLOCK(&thr->mutex);
596 SV *sv = NEWSV(0, 0);
597 av_store(thr->threadsv, key, sv);
598 thr->threadsvp = AvARRAY(thr->threadsv);
599 MUTEX_UNLOCK(&thr->mutex);
601 * Some magic variables used to be automagically initialised
602 * in gv_fetchpv. Those which are now per-thread magicals get
603 * initialised here instead.
609 sv_setpv(sv, "\034");
610 sv_magic(sv, 0, 0, name, 1);
615 PL_sawampersand = TRUE;
629 /* XXX %! tied to Errno.pm needs to be added here.
630 * See gv_fetchpv(). */
634 sv_magic(sv, 0, 0, name, 1);
636 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
637 "find_threadsv: new SV %p for $%s%c\n",
638 sv, (*name < 32) ? "^" : "",
639 (*name < 32) ? toCTRL(*name) : *name));
643 #endif /* USE_THREADS */
648 Perl_op_free(pTHX_ OP *o)
650 register OP *kid, *nextkid;
652 if (!o || o->op_seq == (U16)-1)
655 if (o->op_flags & OPf_KIDS) {
656 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
657 nextkid = kid->op_sibling; /* Get before next freeing kid */
662 switch (o->op_type) {
664 o->op_targ = 0; /* Was holding old type, if any. */
667 o->op_targ = 0; /* Was holding hints. */
671 if (!(o->op_flags & OPf_SPECIAL))
675 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
677 #endif /* USE_THREADS */
679 if (!(o->op_flags & OPf_REF)
680 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
686 SvREFCNT_dec(cGVOPo->op_gv);
689 o->op_targ = 0; /* Was holding old type. */
696 SvREFCNT_dec(cSVOPo->op_sv);
702 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
706 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
707 SvREFCNT_dec(cSVOPo->op_sv);
709 Safefree(cPVOPo->op_pv);
712 op_free(cPMOPo->op_pmreplroot);
717 ReREFCNT_dec(cPMOPo->op_pmregexp);
722 pad_free(o->op_targ);
724 #ifdef PL_OP_SLAB_ALLOC
725 if ((char *) o == PL_OpPtr)
734 S_cop_free(pTHX_ COP* cop)
736 Safefree(cop->cop_label);
737 SvREFCNT_dec(cop->cop_filegv);
738 if (! specialWARN(cop->cop_warnings))
739 SvREFCNT_dec(cop->cop_warnings);
745 if (o->op_type == OP_NEXTSTATE || o->op_type == OP_DBSTATE)
747 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
748 pad_free(o->op_targ);
749 o->op_targ = o->op_type;
750 o->op_type = OP_NULL;
751 o->op_ppaddr = PL_ppaddr[OP_NULL];
754 /* Contextualizers */
756 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
759 Perl_linklist(pTHX_ OP *o)
766 /* establish postfix order */
767 if (cUNOPo->op_first) {
768 o->op_next = LINKLIST(cUNOPo->op_first);
769 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
771 kid->op_next = LINKLIST(kid->op_sibling);
783 Perl_scalarkids(pTHX_ OP *o)
786 if (o && o->op_flags & OPf_KIDS) {
787 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
794 S_scalarboolean(pTHX_ OP *o)
796 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
798 if (ckWARN(WARN_SYNTAX)) {
799 line_t oldline = PL_curcop->cop_line;
801 if (PL_copline != NOLINE)
802 PL_curcop->cop_line = PL_copline;
803 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
804 PL_curcop->cop_line = oldline;
811 Perl_scalar(pTHX_ OP *o)
815 /* assumes no premature commitment */
816 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
817 || o->op_type == OP_RETURN)
820 if ((o->op_private & OPpTARGET_MY)
821 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
822 return scalar(o); /* As if inside SASSIGN */
824 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
826 switch (o->op_type) {
828 if (o->op_private & OPpREPEAT_DOLIST)
829 null(((LISTOP*)cBINOPo->op_first)->op_first);
830 scalar(cBINOPo->op_first);
835 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
839 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
840 if (!kPMOP->op_pmreplroot)
841 deprecate("implicit split to @_");
849 if (o->op_flags & OPf_KIDS) {
850 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
856 kid = cLISTOPo->op_first;
858 while (kid = kid->op_sibling) {
864 WITH_THR(PL_curcop = &PL_compiling);
869 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
875 WITH_THR(PL_curcop = &PL_compiling);
882 Perl_scalarvoid(pTHX_ OP *o)
889 if (o->op_type == OP_NEXTSTATE || o->op_type == OP_DBSTATE ||
890 (o->op_type == OP_NULL &&
891 (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)))
894 PL_curcop = (COP*)o; /* for warning below */
897 /* assumes no premature commitment */
898 want = o->op_flags & OPf_WANT;
899 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
900 || o->op_type == OP_RETURN)
903 if ((o->op_private & OPpTARGET_MY)
904 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
905 return scalar(o); /* As if inside SASSIGN */
907 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
909 switch (o->op_type) {
911 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
915 if (o->op_flags & OPf_STACKED)
919 if (o->op_private == 4)
990 if (!(o->op_private & OPpLVAL_INTRO))
991 useless = PL_op_desc[o->op_type];
998 if (!(o->op_private & OPpLVAL_INTRO) &&
999 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1000 useless = "a variable";
1005 if (cSVOPo->op_private & OPpCONST_STRICT)
1006 no_bareword_allowed(o);
1009 if (ckWARN(WARN_VOID)) {
1010 useless = "a constant";
1011 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1013 else if (SvPOK(sv)) {
1014 if (strnEQ(SvPVX(sv), "di", 2) ||
1015 strnEQ(SvPVX(sv), "ds", 2) ||
1016 strnEQ(SvPVX(sv), "ig", 2))
1021 null(o); /* don't execute a constant */
1022 SvREFCNT_dec(sv); /* don't even remember it */
1026 o->op_type = OP_PREINC; /* pre-increment is faster */
1027 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1031 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1032 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1038 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1043 if (o->op_flags & OPf_STACKED)
1051 if (!(o->op_flags & OPf_KIDS))
1060 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1067 /* all requires must return a boolean value */
1068 o->op_flags &= ~OPf_WANT;
1071 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1072 if (!kPMOP->op_pmreplroot)
1073 deprecate("implicit split to @_");
1079 if (ckWARN(WARN_VOID))
1080 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1086 Perl_listkids(pTHX_ OP *o)
1089 if (o && o->op_flags & OPf_KIDS) {
1090 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1097 Perl_list(pTHX_ OP *o)
1101 /* assumes no premature commitment */
1102 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1103 || o->op_type == OP_RETURN)
1106 if ((o->op_private & OPpTARGET_MY)
1107 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
1108 return o; /* As if inside SASSIGN */
1110 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1112 switch (o->op_type) {
1115 list(cBINOPo->op_first);
1120 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1128 if (!(o->op_flags & OPf_KIDS))
1130 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1131 list(cBINOPo->op_first);
1132 return gen_constant_list(o);
1139 kid = cLISTOPo->op_first;
1141 while (kid = kid->op_sibling) {
1142 if (kid->op_sibling)
1147 WITH_THR(PL_curcop = &PL_compiling);
1151 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1152 if (kid->op_sibling)
1157 WITH_THR(PL_curcop = &PL_compiling);
1160 /* all requires must return a boolean value */
1161 o->op_flags &= ~OPf_WANT;
1168 Perl_scalarseq(pTHX_ OP *o)
1173 if (o->op_type == OP_LINESEQ ||
1174 o->op_type == OP_SCOPE ||
1175 o->op_type == OP_LEAVE ||
1176 o->op_type == OP_LEAVETRY)
1179 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1180 if (kid->op_sibling) {
1184 PL_curcop = &PL_compiling;
1186 o->op_flags &= ~OPf_PARENS;
1187 if (PL_hints & HINT_BLOCK_SCOPE)
1188 o->op_flags |= OPf_PARENS;
1191 o = newOP(OP_STUB, 0);
1196 S_modkids(pTHX_ OP *o, I32 type)
1199 if (o && o->op_flags & OPf_KIDS) {
1200 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1207 Perl_mod(pTHX_ OP *o, I32 type)
1214 if (!o || PL_error_count)
1217 if ((o->op_private & OPpTARGET_MY)
1218 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
1221 switch (o->op_type) {
1226 if (!(o->op_private & (OPpCONST_ARYBASE)))
1228 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1229 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1233 SAVEI32(PL_compiling.cop_arybase);
1234 PL_compiling.cop_arybase = 0;
1236 else if (type == OP_REFGEN)
1239 Perl_croak(aTHX_ "That use of $[ is unsupported");
1242 if (o->op_flags & OPf_PARENS)
1246 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1247 !(o->op_flags & OPf_STACKED)) {
1248 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1249 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1250 assert(cUNOPo->op_first->op_type == OP_NULL);
1251 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1257 /* grep, foreach, subcalls, refgen */
1258 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1260 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1261 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1262 ? "do block" : PL_op_desc[o->op_type]),
1263 type ? PL_op_desc[type] : "local"));
1277 case OP_RIGHT_SHIFT:
1286 if (!(o->op_flags & OPf_STACKED))
1292 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1298 if (!type && cUNOPo->op_first->op_type != OP_GV)
1299 Perl_croak(aTHX_ "Can't localize through a reference");
1300 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1301 PL_modcount = 10000;
1302 return o; /* Treat \(@foo) like ordinary list. */
1306 if (scalar_mod_type(o, type))
1308 ref(cUNOPo->op_first, o->op_type);
1317 PL_modcount = 10000;
1320 if (!type && cUNOPo->op_first->op_type != OP_GV)
1321 Perl_croak(aTHX_ "Can't localize through a reference");
1322 ref(cUNOPo->op_first, o->op_type);
1326 PL_hints |= HINT_BLOCK_SCOPE;
1336 PL_modcount = 10000;
1337 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1338 return o; /* Treat \(@foo) like ordinary list. */
1339 if (scalar_mod_type(o, type))
1345 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1346 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1351 PL_modcount++; /* XXX ??? */
1353 #endif /* USE_THREADS */
1359 if (type != OP_SASSIGN)
1363 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1369 pad_free(o->op_targ);
1370 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1371 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1372 if (o->op_flags & OPf_KIDS)
1373 mod(cBINOPo->op_first->op_sibling, type);
1378 ref(cBINOPo->op_first, o->op_type);
1379 if (type == OP_ENTERSUB &&
1380 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1381 o->op_private |= OPpLVAL_DEFER;
1388 if (o->op_flags & OPf_KIDS)
1389 mod(cLISTOPo->op_last, type);
1393 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1395 else if (!(o->op_flags & OPf_KIDS))
1397 if (o->op_targ != OP_LIST) {
1398 mod(cBINOPo->op_first, type);
1403 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1407 o->op_flags |= OPf_MOD;
1409 if (type == OP_AASSIGN || type == OP_SASSIGN)
1410 o->op_flags |= OPf_SPECIAL|OPf_REF;
1412 o->op_private |= OPpLVAL_INTRO;
1413 o->op_flags &= ~OPf_SPECIAL;
1414 PL_hints |= HINT_BLOCK_SCOPE;
1416 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1417 o->op_flags |= OPf_REF;
1422 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1426 if (o->op_type == OP_RV2GV)
1450 case OP_RIGHT_SHIFT:
1469 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1471 switch (o->op_type) {
1479 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1492 Perl_refkids(pTHX_ OP *o, I32 type)
1495 if (o && o->op_flags & OPf_KIDS) {
1496 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1503 Perl_ref(pTHX_ OP *o, I32 type)
1507 if (!o || PL_error_count)
1510 switch (o->op_type) {
1512 if ((type == OP_DEFINED || type == OP_LOCK) &&
1513 !(o->op_flags & OPf_STACKED)) {
1514 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1515 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1516 assert(cUNOPo->op_first->op_type == OP_NULL);
1517 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1518 o->op_flags |= OPf_SPECIAL;
1523 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1527 if (type == OP_DEFINED)
1528 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1529 ref(cUNOPo->op_first, o->op_type);
1532 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1533 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1534 : type == OP_RV2HV ? OPpDEREF_HV
1536 o->op_flags |= OPf_MOD;
1541 o->op_flags |= OPf_MOD; /* XXX ??? */
1546 o->op_flags |= OPf_REF;
1549 if (type == OP_DEFINED)
1550 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1551 ref(cUNOPo->op_first, o->op_type);
1556 o->op_flags |= OPf_REF;
1561 if (!(o->op_flags & OPf_KIDS))
1563 ref(cBINOPo->op_first, type);
1567 ref(cBINOPo->op_first, o->op_type);
1568 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1569 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1570 : type == OP_RV2HV ? OPpDEREF_HV
1572 o->op_flags |= OPf_MOD;
1580 if (!(o->op_flags & OPf_KIDS))
1582 ref(cLISTOPo->op_last, type);
1592 Perl_my(pTHX_ OP *o)
1597 if (!o || PL_error_count)
1601 if (type == OP_LIST) {
1602 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1604 } else if (type == OP_UNDEF) {
1606 } else if (type != OP_PADSV &&
1609 type != OP_PUSHMARK)
1611 yyerror(Perl_form(aTHX_ "Can't declare %s in my", PL_op_desc[o->op_type]));
1614 o->op_flags |= OPf_MOD;
1615 o->op_private |= OPpLVAL_INTRO;
1620 Perl_sawparens(pTHX_ OP *o)
1623 o->op_flags |= OPf_PARENS;
1628 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1633 if (ckWARN(WARN_UNSAFE) &&
1634 (left->op_type == OP_RV2AV ||
1635 left->op_type == OP_RV2HV ||
1636 left->op_type == OP_PADAV ||
1637 left->op_type == OP_PADHV)) {
1638 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1639 right->op_type == OP_TRANS)
1640 ? right->op_type : OP_MATCH];
1641 char *sample = ((left->op_type == OP_RV2AV ||
1642 left->op_type == OP_PADAV)
1643 ? "@array" : "%hash");
1644 Perl_warner(aTHX_ WARN_UNSAFE,
1645 "Applying %s to %s will act on scalar(%s)",
1646 desc, sample, sample);
1649 if (right->op_type == OP_MATCH ||
1650 right->op_type == OP_SUBST ||
1651 right->op_type == OP_TRANS) {
1652 right->op_flags |= OPf_STACKED;
1653 if (right->op_type != OP_MATCH)
1654 left = mod(left, right->op_type);
1655 if (right->op_type == OP_TRANS)
1656 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1658 o = prepend_elem(right->op_type, scalar(left), right);
1660 return newUNOP(OP_NOT, 0, scalar(o));
1664 return bind_match(type, left,
1665 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1669 Perl_invert(pTHX_ OP *o)
1673 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1674 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1678 Perl_scope(pTHX_ OP *o)
1681 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1682 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1683 o->op_type = OP_LEAVE;
1684 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1687 if (o->op_type == OP_LINESEQ) {
1689 o->op_type = OP_SCOPE;
1690 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1691 kid = ((LISTOP*)o)->op_first;
1692 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1693 if (kid->op_targ > 0)
1694 pad_free(kid->op_targ);
1695 kid->op_targ = kid->op_type;
1696 kid->op_type = OP_SETSTATE;
1697 kid->op_ppaddr = PL_ppaddr[OP_SETSTATE];
1701 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1708 Perl_save_hints(pTHX)
1711 SAVESPTR(GvHV(PL_hintgv));
1712 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1713 SAVEFREESV(GvHV(PL_hintgv));
1717 Perl_block_start(pTHX_ int full)
1720 int retval = PL_savestack_ix;
1722 SAVEI32(PL_comppad_name_floor);
1724 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1725 PL_comppad_name_floor = PL_comppad_name_fill;
1727 PL_comppad_name_floor = 0;
1729 SAVEI32(PL_min_intro_pending);
1730 SAVEI32(PL_max_intro_pending);
1731 PL_min_intro_pending = 0;
1732 SAVEI32(PL_comppad_name_fill);
1733 SAVEI32(PL_padix_floor);
1734 PL_padix_floor = PL_padix;
1735 PL_pad_reset_pending = FALSE;
1737 PL_hints &= ~HINT_BLOCK_SCOPE;
1738 SAVEPPTR(PL_compiling.cop_warnings);
1739 if (! specialWARN(PL_compiling.cop_warnings)) {
1740 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1741 SAVEFREESV(PL_compiling.cop_warnings) ;
1749 Perl_block_end(pTHX_ I32 floor, OP *seq)
1752 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1753 OP* retval = scalarseq(seq);
1755 PL_pad_reset_pending = FALSE;
1756 PL_compiling.op_private = PL_hints;
1758 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1759 pad_leavemy(PL_comppad_name_fill);
1768 OP *o = newOP(OP_THREADSV, 0);
1769 o->op_targ = find_threadsv("_");
1772 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1773 #endif /* USE_THREADS */
1777 Perl_newPROG(pTHX_ OP *o)
1783 PL_eval_root = newUNOP(OP_LEAVEEVAL,
1784 ((PL_in_eval & EVAL_KEEPERR)
1785 ? OPf_SPECIAL : 0), o);
1786 PL_eval_start = linklist(PL_eval_root);
1787 PL_eval_root->op_next = 0;
1788 peep(PL_eval_start);
1793 PL_main_root = scope(sawparens(scalarvoid(o)));
1794 PL_curcop = &PL_compiling;
1795 PL_main_start = LINKLIST(PL_main_root);
1796 PL_main_root->op_next = 0;
1797 peep(PL_main_start);
1800 /* Register with debugger */
1802 CV *cv = get_cv("DB::postponed", FALSE);
1806 XPUSHs((SV*)PL_compiling.cop_filegv);
1808 call_sv((SV*)cv, G_DISCARD);
1815 Perl_localize(pTHX_ OP *o, I32 lex)
1817 if (o->op_flags & OPf_PARENS)
1821 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1823 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1824 if (*s == ';' || *s == '=')
1825 Perl_warner(aTHX_ WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1826 lex ? "my" : "local");
1830 PL_in_my_stash = Nullhv;
1834 return mod(o, OP_NULL); /* a bit kludgey */
1838 Perl_jmaybe(pTHX_ OP *o)
1840 if (o->op_type == OP_LIST) {
1843 o2 = newOP(OP_THREADSV, 0);
1844 o2->op_targ = find_threadsv(";");
1846 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1847 #endif /* USE_THREADS */
1848 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1854 Perl_fold_constants(pTHX_ register OP *o)
1858 I32 type = o->op_type;
1861 if (PL_opargs[type] & OA_RETSCALAR)
1863 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
1864 o->op_targ = pad_alloc(type, SVs_PADTMP);
1866 /* integerize op, unless it happens to be C<-foo>.
1867 * XXX should pp_i_negate() do magic string negation instead? */
1868 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
1869 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
1870 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
1872 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1875 if (!(PL_opargs[type] & OA_FOLDCONST))
1880 /* XXX might want a ck_negate() for this */
1881 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
1894 if (o->op_private & OPpLOCALE)
1899 goto nope; /* Don't try to run w/ errors */
1901 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1902 if (curop->op_type != OP_CONST &&
1903 curop->op_type != OP_LIST &&
1904 curop->op_type != OP_SCALAR &&
1905 curop->op_type != OP_NULL &&
1906 curop->op_type != OP_PUSHMARK)
1912 curop = LINKLIST(o);
1916 sv = *(PL_stack_sp--);
1917 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1918 pad_swipe(o->op_targ);
1919 else if (SvTEMP(sv)) { /* grab mortal temp? */
1920 (void)SvREFCNT_inc(sv);
1924 if (type == OP_RV2GV)
1925 return newGVOP(OP_GV, 0, (GV*)sv);
1927 /* try to smush double to int, but don't smush -2.0 to -2 */
1928 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1932 if ((NV)iv == SvNV(sv)) {
1937 SvIOK_off(sv); /* undo SvIV() damage */
1939 return newSVOP(OP_CONST, 0, sv);
1943 if (!(PL_opargs[type] & OA_OTHERINT))
1946 if (!(PL_hints & HINT_INTEGER)) {
1947 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1950 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1951 if (curop->op_type == OP_CONST) {
1952 if (SvIOK(((SVOP*)curop)->op_sv))
1956 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1960 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1967 Perl_gen_constant_list(pTHX_ register OP *o)
1971 I32 oldtmps_floor = PL_tmps_floor;
1975 return o; /* Don't attempt to run with errors */
1977 PL_op = curop = LINKLIST(o);
1983 PL_tmps_floor = oldtmps_floor;
1985 o->op_type = OP_RV2AV;
1986 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1987 curop = ((UNOP*)o)->op_first;
1988 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1995 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2000 if (!o || o->op_type != OP_LIST)
2001 o = newLISTOP(OP_LIST, 0, o, Nullop);
2003 o->op_flags &= ~OPf_WANT;
2005 if (!(PL_opargs[type] & OA_MARK))
2006 null(cLISTOPo->op_first);
2009 o->op_ppaddr = PL_ppaddr[type];
2010 o->op_flags |= flags;
2012 o = CHECKOP(type, o);
2013 if (o->op_type != type)
2016 if (cLISTOPo->op_children < 7) {
2017 /* XXX do we really need to do this if we're done appending?? */
2018 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2020 cLISTOPo->op_last = last; /* in case check substituted last arg */
2023 return fold_constants(o);
2026 /* List constructors */
2029 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2037 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
2038 return newLISTOP(type, 0, first, last);
2040 if (first->op_flags & OPf_KIDS)
2041 ((LISTOP*)first)->op_last->op_sibling = last;
2043 first->op_flags |= OPf_KIDS;
2044 ((LISTOP*)first)->op_first = last;
2046 ((LISTOP*)first)->op_last = last;
2047 ((LISTOP*)first)->op_children++;
2052 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2060 if (first->op_type != type)
2061 return prepend_elem(type, (OP*)first, (OP*)last);
2063 if (last->op_type != type)
2064 return append_elem(type, (OP*)first, (OP*)last);
2066 first->op_last->op_sibling = last->op_first;
2067 first->op_last = last->op_last;
2068 first->op_children += last->op_children;
2069 if (first->op_children)
2070 first->op_flags |= OPf_KIDS;
2072 #ifdef PL_OP_SLAB_ALLOC
2080 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2088 if (last->op_type == type) {
2089 if (type == OP_LIST) { /* already a PUSHMARK there */
2090 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2091 ((LISTOP*)last)->op_first->op_sibling = first;
2094 if (!(last->op_flags & OPf_KIDS)) {
2095 ((LISTOP*)last)->op_last = first;
2096 last->op_flags |= OPf_KIDS;
2098 first->op_sibling = ((LISTOP*)last)->op_first;
2099 ((LISTOP*)last)->op_first = first;
2101 ((LISTOP*)last)->op_children++;
2105 return newLISTOP(type, 0, first, last);
2111 Perl_newNULLLIST(pTHX)
2113 return newOP(OP_STUB, 0);
2117 Perl_force_list(pTHX_ OP *o)
2119 if (!o || o->op_type != OP_LIST)
2120 o = newLISTOP(OP_LIST, 0, o, Nullop);
2126 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2130 NewOp(1101, listop, 1, LISTOP);
2132 listop->op_type = type;
2133 listop->op_ppaddr = PL_ppaddr[type];
2134 listop->op_children = (first != 0) + (last != 0);
2135 listop->op_flags = flags;
2139 else if (!first && last)
2142 first->op_sibling = last;
2143 listop->op_first = first;
2144 listop->op_last = last;
2145 if (type == OP_LIST) {
2147 pushop = newOP(OP_PUSHMARK, 0);
2148 pushop->op_sibling = first;
2149 listop->op_first = pushop;
2150 listop->op_flags |= OPf_KIDS;
2152 listop->op_last = pushop;
2154 else if (listop->op_children)
2155 listop->op_flags |= OPf_KIDS;
2161 Perl_newOP(pTHX_ I32 type, I32 flags)
2164 NewOp(1101, o, 1, OP);
2166 o->op_ppaddr = PL_ppaddr[type];
2167 o->op_flags = flags;
2170 o->op_private = 0 + (flags >> 8);
2171 if (PL_opargs[type] & OA_RETSCALAR)
2173 if (PL_opargs[type] & OA_TARGET)
2174 o->op_targ = pad_alloc(type, SVs_PADTMP);
2175 return CHECKOP(type, o);
2179 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2184 first = newOP(OP_STUB, 0);
2185 if (PL_opargs[type] & OA_MARK)
2186 first = force_list(first);
2188 NewOp(1101, unop, 1, UNOP);
2189 unop->op_type = type;
2190 unop->op_ppaddr = PL_ppaddr[type];
2191 unop->op_first = first;
2192 unop->op_flags = flags | OPf_KIDS;
2193 unop->op_private = 1 | (flags >> 8);
2194 unop = (UNOP*) CHECKOP(type, unop);
2198 return fold_constants((OP *) unop);
2202 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2205 NewOp(1101, binop, 1, BINOP);
2208 first = newOP(OP_NULL, 0);
2210 binop->op_type = type;
2211 binop->op_ppaddr = PL_ppaddr[type];
2212 binop->op_first = first;
2213 binop->op_flags = flags | OPf_KIDS;
2216 binop->op_private = 1 | (flags >> 8);
2219 binop->op_private = 2 | (flags >> 8);
2220 first->op_sibling = last;
2223 binop = (BINOP*)CHECKOP(type, binop);
2224 if (binop->op_next || binop->op_type != type)
2227 binop->op_last = binop->op_first->op_sibling;
2229 return fold_constants((OP *)binop);
2233 utf8compare(const void *a, const void *b)
2236 for (i = 0; i < 10; i++) {
2237 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2239 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2246 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2248 SV *tstr = ((SVOP*)expr)->op_sv;
2249 SV *rstr = ((SVOP*)repl)->op_sv;
2252 register U8 *t = (U8*)SvPV(tstr, tlen);
2253 register U8 *r = (U8*)SvPV(rstr, rlen);
2259 register short *tbl;
2261 complement = o->op_private & OPpTRANS_COMPLEMENT;
2262 del = o->op_private & OPpTRANS_DELETE;
2263 squash = o->op_private & OPpTRANS_SQUASH;
2265 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2266 SV* listsv = newSVpvn("# comment\n",10);
2268 U8* tend = t + tlen;
2269 U8* rend = r + rlen;
2285 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2286 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2292 New(1109, cp, tlen, U8*);
2294 transv = newSVpvn("",0);
2303 qsort(cp, i, sizeof(U8*), utf8compare);
2304 for (j = 0; j < i; j++) {
2306 UV val = utf8_to_uv(s, &ulen);
2308 diff = val - nextmin;
2310 t = uv_to_utf8(tmpbuf,nextmin);
2311 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2313 t = uv_to_utf8(tmpbuf, val - 1);
2314 sv_catpvn(transv, "\377", 1);
2315 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2319 val = utf8_to_uv(s+1, &ulen);
2323 t = uv_to_utf8(tmpbuf,nextmin);
2324 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2325 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2326 sv_catpvn(transv, "\377", 1);
2327 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2328 t = (U8*)SvPVX(transv);
2329 tlen = SvCUR(transv);
2332 else if (!rlen && !del) {
2333 r = t; rlen = tlen; rend = tend;
2336 if (to_utf && from_utf) { /* only counting characters */
2337 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2338 o->op_private |= OPpTRANS_IDENTICAL;
2340 else { /* straight latin-1 translation */
2341 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2342 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2343 o->op_private |= OPpTRANS_IDENTICAL;
2347 while (t < tend || tfirst <= tlast) {
2348 /* see if we need more "t" chars */
2349 if (tfirst > tlast) {
2350 tfirst = (I32)utf8_to_uv(t, &ulen);
2352 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2353 tlast = (I32)utf8_to_uv(++t, &ulen);
2360 /* now see if we need more "r" chars */
2361 if (rfirst > rlast) {
2363 rfirst = (I32)utf8_to_uv(r, &ulen);
2365 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2366 rlast = (I32)utf8_to_uv(++r, &ulen);
2375 rfirst = rlast = 0xffffffff;
2379 /* now see which range will peter our first, if either. */
2380 tdiff = tlast - tfirst;
2381 rdiff = rlast - rfirst;
2388 if (rfirst == 0xffffffff) {
2389 diff = tdiff; /* oops, pretend rdiff is infinite */
2391 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2393 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\tXXXX\n", tfirst);
2397 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2399 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2401 if (rfirst + diff > max)
2402 max = rfirst + diff;
2407 else if (rfirst <= 0x800)
2408 grows |= (tfirst < 0x80);
2409 else if (rfirst <= 0x10000)
2410 grows |= (tfirst < 0x800);
2411 else if (rfirst <= 0x200000)
2412 grows |= (tfirst < 0x10000);
2413 else if (rfirst <= 0x4000000)
2414 grows |= (tfirst < 0x200000);
2415 else if (rfirst <= 0x80000000)
2416 grows |= (tfirst < 0x4000000);
2428 else if (max > 0xff)
2433 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2434 SvREFCNT_dec(listsv);
2436 SvREFCNT_dec(transv);
2438 if (!del && havefinal)
2439 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2441 if (grows && to_utf)
2442 o->op_private |= OPpTRANS_GROWS;
2449 tbl = (short*)cPVOPo->op_pv;
2451 Zero(tbl, 256, short);
2452 for (i = 0; i < tlen; i++)
2454 for (i = 0, j = 0; i < 256; i++) {
2470 if (!rlen && !del) {
2473 o->op_private |= OPpTRANS_IDENTICAL;
2475 for (i = 0; i < 256; i++)
2477 for (i = 0, j = 0; i < tlen; i++,j++) {
2480 if (tbl[t[i]] == -1)
2486 if (tbl[t[i]] == -1)
2497 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2502 NewOp(1101, pmop, 1, PMOP);
2503 pmop->op_type = type;
2504 pmop->op_ppaddr = PL_ppaddr[type];
2505 pmop->op_flags = flags;
2506 pmop->op_private = 0 | (flags >> 8);
2508 if (PL_hints & HINT_RE_TAINT)
2509 pmop->op_pmpermflags |= PMf_RETAINT;
2510 if (PL_hints & HINT_LOCALE)
2511 pmop->op_pmpermflags |= PMf_LOCALE;
2512 pmop->op_pmflags = pmop->op_pmpermflags;
2514 /* link into pm list */
2515 if (type != OP_TRANS && PL_curstash) {
2516 pmop->op_pmnext = HvPMROOT(PL_curstash);
2517 HvPMROOT(PL_curstash) = pmop;
2524 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2529 I32 repl_has_vars = 0;
2531 if (o->op_type == OP_TRANS)
2532 return pmtrans(o, expr, repl);
2534 PL_hints |= HINT_BLOCK_SCOPE;
2537 if (expr->op_type == OP_CONST) {
2539 SV *pat = ((SVOP*)expr)->op_sv;
2540 char *p = SvPV(pat, plen);
2541 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2542 sv_setpvn(pat, "\\s+", 3);
2543 p = SvPV(pat, plen);
2544 pm->op_pmflags |= PMf_SKIPWHITE;
2546 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2547 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2548 pm->op_pmflags |= PMf_WHITE;
2552 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2553 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2555 : OP_REGCMAYBE),0,expr);
2557 NewOp(1101, rcop, 1, LOGOP);
2558 rcop->op_type = OP_REGCOMP;
2559 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2560 rcop->op_first = scalar(expr);
2561 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2562 ? (OPf_SPECIAL | OPf_KIDS)
2564 rcop->op_private = 1;
2567 /* establish postfix order */
2568 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2570 rcop->op_next = expr;
2571 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2574 rcop->op_next = LINKLIST(expr);
2575 expr->op_next = (OP*)rcop;
2578 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2583 if (pm->op_pmflags & PMf_EVAL) {
2585 if (PL_curcop->cop_line < PL_multi_end)
2586 PL_curcop->cop_line = PL_multi_end;
2589 else if (repl->op_type == OP_THREADSV
2590 && strchr("&`'123456789+",
2591 PL_threadsv_names[repl->op_targ]))
2595 #endif /* USE_THREADS */
2596 else if (repl->op_type == OP_CONST)
2600 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2601 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2603 if (curop->op_type == OP_THREADSV) {
2605 if (strchr("&`'123456789+", curop->op_private))
2609 if (curop->op_type == OP_GV) {
2610 GV *gv = ((GVOP*)curop)->op_gv;
2612 if (strchr("&`'123456789+", *GvENAME(gv)))
2615 #endif /* USE_THREADS */
2616 else if (curop->op_type == OP_RV2CV)
2618 else if (curop->op_type == OP_RV2SV ||
2619 curop->op_type == OP_RV2AV ||
2620 curop->op_type == OP_RV2HV ||
2621 curop->op_type == OP_RV2GV) {
2622 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2625 else if (curop->op_type == OP_PADSV ||
2626 curop->op_type == OP_PADAV ||
2627 curop->op_type == OP_PADHV ||
2628 curop->op_type == OP_PADANY) {
2631 else if (curop->op_type == OP_PUSHRE)
2632 ; /* Okay here, dangerous in newASSIGNOP */
2641 && (!pm->op_pmregexp
2642 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2643 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2644 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2645 prepend_elem(o->op_type, scalar(repl), o);
2648 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2649 pm->op_pmflags |= PMf_MAYBE_CONST;
2650 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2652 NewOp(1101, rcop, 1, LOGOP);
2653 rcop->op_type = OP_SUBSTCONT;
2654 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2655 rcop->op_first = scalar(repl);
2656 rcop->op_flags |= OPf_KIDS;
2657 rcop->op_private = 1;
2660 /* establish postfix order */
2661 rcop->op_next = LINKLIST(repl);
2662 repl->op_next = (OP*)rcop;
2664 pm->op_pmreplroot = scalar((OP*)rcop);
2665 pm->op_pmreplstart = LINKLIST(rcop);
2674 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2677 NewOp(1101, svop, 1, SVOP);
2678 svop->op_type = type;
2679 svop->op_ppaddr = PL_ppaddr[type];
2681 svop->op_next = (OP*)svop;
2682 svop->op_flags = flags;
2683 if (PL_opargs[type] & OA_RETSCALAR)
2685 if (PL_opargs[type] & OA_TARGET)
2686 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2687 return CHECKOP(type, svop);
2691 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
2695 NewOp(1101, gvop, 1, GVOP);
2696 gvop->op_type = type;
2697 gvop->op_ppaddr = PL_ppaddr[type];
2698 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2699 gvop->op_next = (OP*)gvop;
2700 gvop->op_flags = flags;
2701 if (PL_opargs[type] & OA_RETSCALAR)
2703 if (PL_opargs[type] & OA_TARGET)
2704 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2705 return CHECKOP(type, gvop);
2709 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
2712 NewOp(1101, pvop, 1, PVOP);
2713 pvop->op_type = type;
2714 pvop->op_ppaddr = PL_ppaddr[type];
2716 pvop->op_next = (OP*)pvop;
2717 pvop->op_flags = flags;
2718 if (PL_opargs[type] & OA_RETSCALAR)
2720 if (PL_opargs[type] & OA_TARGET)
2721 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2722 return CHECKOP(type, pvop);
2726 Perl_package(pTHX_ OP *o)
2731 save_hptr(&PL_curstash);
2732 save_item(PL_curstname);
2737 name = SvPV(sv, len);
2738 PL_curstash = gv_stashpvn(name,len,TRUE);
2739 sv_setpvn(PL_curstname, name, len);
2743 sv_setpv(PL_curstname,"<none>");
2744 PL_curstash = Nullhv;
2746 PL_hints |= HINT_BLOCK_SCOPE;
2747 PL_copline = NOLINE;
2752 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
2761 if (id->op_type != OP_CONST)
2762 Perl_croak(aTHX_ "Module name must be constant");
2766 if(version != Nullop) {
2767 SV *vesv = ((SVOP*)version)->op_sv;
2769 if (arg == Nullop && !SvNIOK(vesv)) {
2776 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2777 Perl_croak(aTHX_ "Version number must be constant number");
2779 /* Make copy of id so we don't free it twice */
2780 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2782 /* Fake up a method call to VERSION */
2783 meth = newSVOP(OP_CONST, 0, newSVpvn("VERSION", 7));
2784 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2785 append_elem(OP_LIST,
2786 prepend_elem(OP_LIST, pack, list(version)),
2787 newUNOP(OP_METHOD, 0, meth)));
2791 /* Fake up an import/unimport */
2792 if (arg && arg->op_type == OP_STUB)
2793 imop = arg; /* no import on explicit () */
2794 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2795 imop = Nullop; /* use 5.0; */
2798 /* Make copy of id so we don't free it twice */
2799 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2800 meth = newSVOP(OP_CONST, 0,
2802 ? newSVpvn("import", 6)
2803 : newSVpvn("unimport", 8)
2805 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2806 append_elem(OP_LIST,
2807 prepend_elem(OP_LIST, pack, list(arg)),
2808 newUNOP(OP_METHOD, 0, meth)));
2811 /* Fake up a require, handle override, if any */
2812 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2813 if (!(gv && GvIMPORTED_CV(gv)))
2814 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2816 if (gv && GvIMPORTED_CV(gv)) {
2817 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2818 append_elem(OP_LIST, id,
2819 scalar(newUNOP(OP_RV2CV, 0,
2824 rqop = newUNOP(OP_REQUIRE, 0, id);
2827 /* Fake up the BEGIN {}, which does its thing immediately. */
2829 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
2831 append_elem(OP_LINESEQ,
2832 append_elem(OP_LINESEQ,
2833 newSTATEOP(0, Nullch, rqop),
2834 newSTATEOP(0, Nullch, veop)),
2835 newSTATEOP(0, Nullch, imop) ));
2837 PL_copline = NOLINE;
2842 Perl_dofile(pTHX_ OP *term)
2847 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2848 if (!(gv && GvIMPORTED_CV(gv)))
2849 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2851 if (gv && GvIMPORTED_CV(gv)) {
2852 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2853 append_elem(OP_LIST, term,
2854 scalar(newUNOP(OP_RV2CV, 0,
2859 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2865 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
2867 return newBINOP(OP_LSLICE, flags,
2868 list(force_list(subscript)),
2869 list(force_list(listval)) );
2873 S_list_assignment(pTHX_ register OP *o)
2878 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2879 o = cUNOPo->op_first;
2881 if (o->op_type == OP_COND_EXPR) {
2882 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
2883 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
2888 yyerror("Assignment to both a list and a scalar");
2892 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2893 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2894 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2897 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2900 if (o->op_type == OP_RV2SV)
2907 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
2912 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2913 return newLOGOP(optype, 0,
2914 mod(scalar(left), optype),
2915 newUNOP(OP_SASSIGN, 0, scalar(right)));
2918 return newBINOP(optype, OPf_STACKED,
2919 mod(scalar(left), optype), scalar(right));
2923 if (list_assignment(left)) {
2926 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2927 left = mod(left, OP_AASSIGN);
2935 o = newBINOP(OP_AASSIGN, flags,
2936 list(force_list(right)),
2937 list(force_list(left)) );
2938 o->op_private = 0 | (flags >> 8);
2939 if (!(left->op_private & OPpLVAL_INTRO)) {
2943 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2944 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2945 if (curop->op_type == OP_GV) {
2946 GV *gv = ((GVOP*)curop)->op_gv;
2947 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2949 SvCUR(gv) = PL_generation;
2951 else if (curop->op_type == OP_PADSV ||
2952 curop->op_type == OP_PADAV ||
2953 curop->op_type == OP_PADHV ||
2954 curop->op_type == OP_PADANY) {
2955 SV **svp = AvARRAY(PL_comppad_name);
2956 SV *sv = svp[curop->op_targ];
2957 if (SvCUR(sv) == PL_generation)
2959 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2961 else if (curop->op_type == OP_RV2CV)
2963 else if (curop->op_type == OP_RV2SV ||
2964 curop->op_type == OP_RV2AV ||
2965 curop->op_type == OP_RV2HV ||
2966 curop->op_type == OP_RV2GV) {
2967 if (lastop->op_type != OP_GV) /* funny deref? */
2970 else if (curop->op_type == OP_PUSHRE) {
2971 if (((PMOP*)curop)->op_pmreplroot) {
2972 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2973 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2975 SvCUR(gv) = PL_generation;
2984 o->op_private = OPpASSIGN_COMMON;
2986 if (right && right->op_type == OP_SPLIT) {
2988 if ((tmpop = ((LISTOP*)right)->op_first) &&
2989 tmpop->op_type == OP_PUSHRE)
2991 PMOP *pm = (PMOP*)tmpop;
2992 if (left->op_type == OP_RV2AV &&
2993 !(left->op_private & OPpLVAL_INTRO) &&
2994 !(o->op_private & OPpASSIGN_COMMON) )
2996 tmpop = ((UNOP*)left)->op_first;
2997 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2998 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2999 pm->op_pmflags |= PMf_ONCE;
3000 tmpop = cUNOPo->op_first; /* to list (nulled) */
3001 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3002 tmpop->op_sibling = Nullop; /* don't free split */
3003 right->op_next = tmpop->op_next; /* fix starting loc */
3004 op_free(o); /* blow off assign */
3005 right->op_flags &= ~OPf_WANT;
3006 /* "I don't know and I don't care." */
3011 if (PL_modcount < 10000 &&
3012 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3014 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3016 sv_setiv(sv, PL_modcount+1);
3024 right = newOP(OP_UNDEF, 0);
3025 if (right->op_type == OP_READLINE) {
3026 right->op_flags |= OPf_STACKED;
3027 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3030 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3031 o = newBINOP(OP_SASSIGN, flags,
3032 scalar(right), mod(scalar(left), OP_SASSIGN) );
3044 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3047 U32 seq = intro_my();
3050 NewOp(1101, cop, 1, COP);
3051 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
3052 cop->op_type = OP_DBSTATE;
3053 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3056 cop->op_type = OP_NEXTSTATE;
3057 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3059 cop->op_flags = flags;
3060 cop->op_private = (PL_hints & HINT_UTF8);
3062 cop->op_private |= NATIVE_HINTS;
3064 PL_compiling.op_private = cop->op_private;
3065 cop->op_next = (OP*)cop;
3068 cop->cop_label = label;
3069 PL_hints |= HINT_BLOCK_SCOPE;
3072 cop->cop_arybase = PL_curcop->cop_arybase;
3073 if (specialWARN(PL_curcop->cop_warnings))
3074 cop->cop_warnings = PL_curcop->cop_warnings ;
3076 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3079 if (PL_copline == NOLINE)
3080 cop->cop_line = PL_curcop->cop_line;
3082 cop->cop_line = PL_copline;
3083 PL_copline = NOLINE;
3085 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
3086 cop->cop_stash = PL_curstash;
3088 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3089 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
3090 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3091 (void)SvIOK_on(*svp);
3093 SvSTASH(*svp) = (HV*)cop;
3097 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3100 /* "Introduce" my variables to visible status. */
3108 if (! PL_min_intro_pending)
3109 return PL_cop_seqmax;
3111 svp = AvARRAY(PL_comppad_name);
3112 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3113 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3114 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3115 SvNVX(sv) = (NV)PL_cop_seqmax;
3118 PL_min_intro_pending = 0;
3119 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3120 return PL_cop_seqmax++;
3124 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3126 return new_logop(type, flags, &first, &other);
3130 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3135 OP *first = *firstp;
3136 OP *other = *otherp;
3138 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3139 return newBINOP(type, flags, scalar(first), scalar(other));
3141 scalarboolean(first);
3142 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3143 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3144 if (type == OP_AND || type == OP_OR) {
3150 first = *firstp = cUNOPo->op_first;
3152 first->op_next = o->op_next;
3153 cUNOPo->op_first = Nullop;
3157 if (first->op_type == OP_CONST) {
3158 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3159 Perl_warner(aTHX_ WARN_PRECEDENCE, "Probable precedence problem on %s",
3161 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3172 else if (first->op_type == OP_WANTARRAY) {
3178 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3179 OP *k1 = ((UNOP*)first)->op_first;
3180 OP *k2 = k1->op_sibling;
3182 switch (first->op_type)
3185 if (k2 && k2->op_type == OP_READLINE
3186 && (k2->op_flags & OPf_STACKED)
3187 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3188 warnop = k2->op_type;
3192 if (k1->op_type == OP_READDIR
3193 || k1->op_type == OP_GLOB
3194 || k1->op_type == OP_EACH)
3195 warnop = k1->op_type;
3199 line_t oldline = PL_curcop->cop_line;
3200 PL_curcop->cop_line = PL_copline;
3201 Perl_warner(aTHX_ WARN_UNSAFE,
3202 "Value of %s%s can be \"0\"; test with defined()",
3204 ((warnop == OP_READLINE || warnop == OP_GLOB)
3205 ? " construct" : "() operator"));
3206 PL_curcop->cop_line = oldline;
3213 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3214 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3216 NewOp(1101, logop, 1, LOGOP);
3218 logop->op_type = type;
3219 logop->op_ppaddr = PL_ppaddr[type];
3220 logop->op_first = first;
3221 logop->op_flags = flags | OPf_KIDS;
3222 logop->op_other = LINKLIST(other);
3223 logop->op_private = 1 | (flags >> 8);
3225 /* establish postfix order */
3226 logop->op_next = LINKLIST(first);
3227 first->op_next = (OP*)logop;
3228 first->op_sibling = other;
3230 o = newUNOP(OP_NULL, 0, (OP*)logop);
3237 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3245 return newLOGOP(OP_AND, 0, first, trueop);
3247 return newLOGOP(OP_OR, 0, first, falseop);
3249 scalarboolean(first);
3250 if (first->op_type == OP_CONST) {
3251 if (SvTRUE(((SVOP*)first)->op_sv)) {
3262 else if (first->op_type == OP_WANTARRAY) {
3266 NewOp(1101, logop, 1, LOGOP);
3267 logop->op_type = OP_COND_EXPR;
3268 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3269 logop->op_first = first;
3270 logop->op_flags = flags | OPf_KIDS;
3271 logop->op_private = 1 | (flags >> 8);
3272 logop->op_other = LINKLIST(trueop);
3273 logop->op_next = LINKLIST(falseop);
3276 /* establish postfix order */
3277 start = LINKLIST(first);
3278 first->op_next = (OP*)logop;
3280 first->op_sibling = trueop;
3281 trueop->op_sibling = falseop;
3282 o = newUNOP(OP_NULL, 0, (OP*)logop);
3284 trueop->op_next = falseop->op_next = o;
3291 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3300 NewOp(1101, range, 1, LOGOP);
3302 range->op_type = OP_RANGE;
3303 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3304 range->op_first = left;
3305 range->op_flags = OPf_KIDS;
3306 leftstart = LINKLIST(left);
3307 range->op_other = LINKLIST(right);
3308 range->op_private = 1 | (flags >> 8);
3310 left->op_sibling = right;
3312 range->op_next = (OP*)range;
3313 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3314 flop = newUNOP(OP_FLOP, 0, flip);
3315 o = newUNOP(OP_NULL, 0, flop);
3317 range->op_next = leftstart;
3319 left->op_next = flip;
3320 right->op_next = flop;
3322 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3323 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3324 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3325 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3327 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3328 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3331 if (!flip->op_private || !flop->op_private)
3332 linklist(o); /* blow off optimizer unless constant */
3338 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3343 int once = block && block->op_flags & OPf_SPECIAL &&
3344 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3347 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3348 return block; /* do {} while 0 does once */
3349 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3350 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3351 expr = newUNOP(OP_DEFINED, 0,
3352 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3353 } else if (expr->op_flags & OPf_KIDS) {
3354 OP *k1 = ((UNOP*)expr)->op_first;
3355 OP *k2 = (k1) ? k1->op_sibling : NULL;
3356 switch (expr->op_type) {
3358 if (k2 && k2->op_type == OP_READLINE
3359 && (k2->op_flags & OPf_STACKED)
3360 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3361 expr = newUNOP(OP_DEFINED, 0, expr);
3365 if (k1->op_type == OP_READDIR
3366 || k1->op_type == OP_GLOB
3367 || k1->op_type == OP_EACH)
3368 expr = newUNOP(OP_DEFINED, 0, expr);
3374 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3375 o = new_logop(OP_AND, 0, &expr, &listop);
3378 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3380 if (once && o != listop)
3381 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3384 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3386 o->op_flags |= flags;
3388 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3393 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3402 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3403 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3404 expr = newUNOP(OP_DEFINED, 0,
3405 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3406 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3407 OP *k1 = ((UNOP*)expr)->op_first;
3408 OP *k2 = (k1) ? k1->op_sibling : NULL;
3409 switch (expr->op_type) {
3411 if (k2 && k2->op_type == OP_READLINE
3412 && (k2->op_flags & OPf_STACKED)
3413 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3414 expr = newUNOP(OP_DEFINED, 0, expr);
3418 if (k1->op_type == OP_READDIR
3419 || k1->op_type == OP_GLOB
3420 || k1->op_type == OP_EACH)
3421 expr = newUNOP(OP_DEFINED, 0, expr);
3427 block = newOP(OP_NULL, 0);
3430 next = LINKLIST(cont);
3432 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3433 if ((line_t)whileline != NOLINE) {
3434 PL_copline = whileline;
3435 cont = append_elem(OP_LINESEQ, cont,
3436 newSTATEOP(0, Nullch, Nullop));
3440 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3441 redo = LINKLIST(listop);
3444 PL_copline = whileline;
3446 o = new_logop(OP_AND, 0, &expr, &listop);
3447 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3448 op_free(expr); /* oops, it's a while (0) */
3450 return Nullop; /* listop already freed by new_logop */
3453 ((LISTOP*)listop)->op_last->op_next = condop =
3454 (o == listop ? redo : LINKLIST(o));
3462 NewOp(1101,loop,1,LOOP);
3463 loop->op_type = OP_ENTERLOOP;
3464 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3465 loop->op_private = 0;
3466 loop->op_next = (OP*)loop;
3469 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3471 loop->op_redoop = redo;
3472 loop->op_lastop = o;
3475 loop->op_nextop = next;
3477 loop->op_nextop = o;
3479 o->op_flags |= flags;
3480 o->op_private |= (flags >> 8);
3485 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3494 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3495 sv->op_type = OP_RV2GV;
3496 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3498 else if (sv->op_type == OP_PADSV) { /* private variable */
3499 padoff = sv->op_targ;
3503 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3504 padoff = sv->op_targ;
3505 iterflags |= OPf_SPECIAL;
3510 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3514 padoff = find_threadsv("_");
3515 iterflags |= OPf_SPECIAL;
3517 sv = newGVOP(OP_GV, 0, PL_defgv);
3520 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3521 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3522 iterflags |= OPf_STACKED;
3524 else if (expr->op_type == OP_NULL &&
3525 (expr->op_flags & OPf_KIDS) &&
3526 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3528 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3529 * set the STACKED flag to indicate that these values are to be
3530 * treated as min/max values by 'pp_iterinit'.
3532 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3533 LOGOP* range = (LOGOP*) flip->op_first;
3534 OP* left = range->op_first;
3535 OP* right = left->op_sibling;
3538 range->op_flags &= ~OPf_KIDS;
3539 range->op_first = Nullop;
3541 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3542 listop->op_first->op_next = range->op_next;
3543 left->op_next = range->op_other;
3544 right->op_next = (OP*)listop;
3545 listop->op_next = listop->op_first;
3548 expr = (OP*)(listop);
3550 iterflags |= OPf_STACKED;
3553 expr = mod(force_list(expr), OP_GREPSTART);
3557 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3558 append_elem(OP_LIST, expr, scalar(sv))));
3559 assert(!loop->op_next);
3560 #ifdef PL_OP_SLAB_ALLOC
3561 NewOp(1234,tmp,1,LOOP);
3562 Copy(loop,tmp,1,LOOP);
3565 Renew(loop, 1, LOOP);
3567 loop->op_targ = padoff;
3568 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3569 PL_copline = forline;
3570 return newSTATEOP(0, label, wop);
3574 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3580 if (type != OP_GOTO || label->op_type == OP_CONST) {
3581 /* "last()" means "last" */
3582 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3583 o = newOP(type, OPf_SPECIAL);
3585 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3586 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3592 if (label->op_type == OP_ENTERSUB)
3593 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3594 o = newUNOP(type, OPf_STACKED, label);
3596 PL_hints |= HINT_BLOCK_SCOPE;
3601 Perl_cv_undef(pTHX_ CV *cv)
3606 MUTEX_DESTROY(CvMUTEXP(cv));
3607 Safefree(CvMUTEXP(cv));
3610 #endif /* USE_THREADS */
3612 if (!CvXSUB(cv) && CvROOT(cv)) {
3614 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3615 Perl_croak(aTHX_ "Can't undef active subroutine");
3618 Perl_croak(aTHX_ "Can't undef active subroutine");
3619 #endif /* USE_THREADS */
3622 SAVESPTR(PL_curpad);
3626 op_free(CvROOT(cv));
3627 CvROOT(cv) = Nullop;
3630 SvPOK_off((SV*)cv); /* forget prototype */
3632 SvREFCNT_dec(CvGV(cv));
3634 SvREFCNT_dec(CvOUTSIDE(cv));
3635 CvOUTSIDE(cv) = Nullcv;
3636 if (CvPADLIST(cv)) {
3637 /* may be during global destruction */
3638 if (SvREFCNT(CvPADLIST(cv))) {
3639 I32 i = AvFILLp(CvPADLIST(cv));
3641 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3642 SV* sv = svp ? *svp : Nullsv;
3645 if (sv == (SV*)PL_comppad_name)
3646 PL_comppad_name = Nullav;
3647 else if (sv == (SV*)PL_comppad) {
3648 PL_comppad = Nullav;
3649 PL_curpad = Null(SV**);
3653 SvREFCNT_dec((SV*)CvPADLIST(cv));
3655 CvPADLIST(cv) = Nullav;
3659 #ifdef DEBUG_CLOSURES
3663 CV *outside = CvOUTSIDE(cv);
3664 AV* padlist = CvPADLIST(cv);
3671 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3673 (CvANON(cv) ? "ANON"
3674 : (cv == PL_main_cv) ? "MAIN"
3675 : CvUNIQUE(cv) ? "UNIQUE"
3676 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3679 : CvANON(outside) ? "ANON"
3680 : (outside == PL_main_cv) ? "MAIN"
3681 : CvUNIQUE(outside) ? "UNIQUE"
3682 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3687 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3688 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3689 pname = AvARRAY(pad_name);
3690 ppad = AvARRAY(pad);
3692 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3693 if (SvPOK(pname[ix]))
3694 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3696 SvFAKE(pname[ix]) ? "FAKE " : "",
3698 (long)I_32(SvNVX(pname[ix])),
3699 (long)SvIVX(pname[ix]));
3702 #endif /* DEBUG_CLOSURES */
3705 S_cv_clone2(pTHX_ CV *proto, CV *outside)
3710 AV* protopadlist = CvPADLIST(proto);
3711 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3712 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3713 SV** pname = AvARRAY(protopad_name);
3714 SV** ppad = AvARRAY(protopad);
3715 I32 fname = AvFILLp(protopad_name);
3716 I32 fpad = AvFILLp(protopad);
3720 assert(!CvUNIQUE(proto));
3723 SAVESPTR(PL_curpad);
3724 SAVESPTR(PL_comppad);
3725 SAVESPTR(PL_comppad_name);
3726 SAVESPTR(PL_compcv);
3728 cv = PL_compcv = (CV*)NEWSV(1104,0);
3729 sv_upgrade((SV *)cv, SvTYPE(proto));
3735 New(666, CvMUTEXP(cv), 1, perl_mutex);
3736 MUTEX_INIT(CvMUTEXP(cv));
3738 #endif /* USE_THREADS */
3739 CvFILEGV(cv) = CvFILEGV(proto);
3740 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3741 CvSTASH(cv) = CvSTASH(proto);
3742 CvROOT(cv) = CvROOT(proto);
3743 CvSTART(cv) = CvSTART(proto);
3745 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3748 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3750 PL_comppad_name = newAV();
3751 for (ix = fname; ix >= 0; ix--)
3752 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3754 PL_comppad = newAV();
3756 comppadlist = newAV();
3757 AvREAL_off(comppadlist);
3758 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3759 av_store(comppadlist, 1, (SV*)PL_comppad);
3760 CvPADLIST(cv) = comppadlist;
3761 av_fill(PL_comppad, AvFILLp(protopad));
3762 PL_curpad = AvARRAY(PL_comppad);
3764 av = newAV(); /* will be @_ */
3766 av_store(PL_comppad, 0, (SV*)av);
3767 AvFLAGS(av) = AVf_REIFY;
3769 for (ix = fpad; ix > 0; ix--) {
3770 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3771 if (namesv && namesv != &PL_sv_undef) {
3772 char *name = SvPVX(namesv); /* XXX */
3773 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3774 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3775 CvOUTSIDE(cv), cxstack_ix, 0, 0);
3777 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3779 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
3781 else { /* our own lexical */
3784 /* anon code -- we'll come back for it */
3785 sv = SvREFCNT_inc(ppad[ix]);
3787 else if (*name == '@')
3789 else if (*name == '%')
3799 SV* sv = NEWSV(0,0);
3805 /* Now that vars are all in place, clone nested closures. */
3807 for (ix = fpad; ix > 0; ix--) {
3808 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3810 && namesv != &PL_sv_undef
3811 && !(SvFLAGS(namesv) & SVf_FAKE)
3812 && *SvPVX(namesv) == '&'
3813 && CvCLONE(ppad[ix]))
3815 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3816 SvREFCNT_dec(ppad[ix]);
3819 PL_curpad[ix] = (SV*)kid;
3823 #ifdef DEBUG_CLOSURES
3824 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3826 PerlIO_printf(Perl_debug_log, " from:\n");
3828 PerlIO_printf(Perl_debug_log, " to:\n");
3837 Perl_cv_clone(pTHX_ CV *proto)
3840 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3841 cv = cv_clone2(proto, CvOUTSIDE(proto));
3842 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3847 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
3851 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_UNSAFE)) {
3852 SV* msg = sv_newmortal();
3856 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3857 sv_setpv(msg, "Prototype mismatch:");
3859 Perl_sv_catpvf(aTHX_ msg, " sub %_", name);
3861 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
3862 sv_catpv(msg, " vs ");
3864 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
3866 sv_catpv(msg, "none");
3867 Perl_warner(aTHX_ WARN_UNSAFE, "%_", msg);
3872 Perl_cv_const_sv(pTHX_ CV *cv)
3874 if (!cv || !SvPOK(cv) || SvCUR(cv))
3876 return op_const_sv(CvSTART(cv), cv);
3880 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
3887 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3888 o = cLISTOPo->op_first->op_sibling;
3890 for (; o; o = o->op_next) {
3891 OPCODE type = o->op_type;
3893 if(sv && o->op_next == o)
3895 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3897 if (type == OP_LEAVESUB || type == OP_RETURN)
3901 if (type == OP_CONST)
3903 else if (type == OP_PADSV && cv) {
3904 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3905 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3906 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3918 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
3922 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3923 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3924 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3925 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3934 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3935 maximum a prototype before. */
3936 if (SvTYPE(gv) > SVt_NULL) {
3937 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
3938 && ckWARN_d(WARN_UNSAFE))
3940 Perl_warner(aTHX_ WARN_UNSAFE, "Runaway prototype");
3942 cv_ckproto((CV*)gv, NULL, ps);
3945 sv_setpv((SV*)gv, ps);
3947 sv_setiv((SV*)gv, -1);
3948 SvREFCNT_dec(PL_compcv);
3949 cv = PL_compcv = NULL;
3950 PL_sub_generation++;
3954 if (!name || GvCVGEN(gv))
3956 else if (cv = GvCV(gv)) {
3957 cv_ckproto(cv, gv, ps);
3958 /* already defined (or promised)? */
3959 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3961 bool const_changed = TRUE;
3963 /* just a "sub foo;" when &foo is already defined */
3964 SAVEFREESV(PL_compcv);
3967 /* ahem, death to those who redefine active sort subs */
3968 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3969 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
3970 if(const_sv = cv_const_sv(cv))
3971 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3972 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3973 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3974 && HvNAME(GvSTASH(CvGV(cv)))
3975 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3977 line_t oldline = PL_curcop->cop_line;
3978 PL_curcop->cop_line = PL_copline;
3979 Perl_warner(aTHX_ WARN_REDEFINE,
3980 const_sv ? "Constant subroutine %s redefined"
3981 : "Subroutine %s redefined", name);
3982 PL_curcop->cop_line = oldline;
3988 if (cv) { /* must reuse cv if autoloaded */
3990 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3991 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3992 CvOUTSIDE(PL_compcv) = 0;
3993 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3994 CvPADLIST(PL_compcv) = 0;
3995 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3996 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3997 SvREFCNT_dec(PL_compcv);
4004 PL_sub_generation++;
4007 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4008 CvFILEGV(cv) = PL_curcop->cop_filegv;
4009 CvSTASH(cv) = PL_curstash;
4012 if (!CvMUTEXP(cv)) {
4013 New(666, CvMUTEXP(cv), 1, perl_mutex);
4014 MUTEX_INIT(CvMUTEXP(cv));
4016 #endif /* USE_THREADS */
4019 sv_setpv((SV*)cv, ps);
4021 if (PL_error_count) {
4025 char *s = strrchr(name, ':');
4027 if (strEQ(s, "BEGIN")) {
4029 "BEGIN not safe after errors--compilation aborted";
4030 if (PL_in_eval & EVAL_KEEPERR)
4031 Perl_croak(aTHX_ not_safe);
4033 /* force display of errors found but not reported */
4034 sv_catpv(ERRSV, not_safe);
4035 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4042 PL_copline = NOLINE;
4047 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4048 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4051 SV **namep = AvARRAY(PL_comppad_name);
4052 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4055 if (SvIMMORTAL(PL_curpad[ix]))
4058 * The only things that a clonable function needs in its
4059 * pad are references to outer lexicals and anonymous subs.
4060 * The rest are created anew during cloning.
4062 if (!((namesv = namep[ix]) != Nullsv &&
4063 namesv != &PL_sv_undef &&
4065 *SvPVX(namesv) == '&')))
4067 SvREFCNT_dec(PL_curpad[ix]);
4068 PL_curpad[ix] = Nullsv;
4073 AV *av = newAV(); /* Will be @_ */
4075 av_store(PL_comppad, 0, (SV*)av);
4076 AvFLAGS(av) = AVf_REIFY;
4078 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4079 if (SvIMMORTAL(PL_curpad[ix]))
4081 if (!SvPADMY(PL_curpad[ix]))
4082 SvPADTMP_on(PL_curpad[ix]);
4086 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4087 CvSTART(cv) = LINKLIST(CvROOT(cv));
4088 CvROOT(cv)->op_next = 0;
4094 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4095 SV *sv = NEWSV(0,0);
4096 SV *tmpstr = sv_newmortal();
4097 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4101 Perl_sv_setpvf(aTHX_ sv, "%_:%ld-%ld",
4102 GvSV(PL_curcop->cop_filegv),
4103 (long)PL_subline, (long)PL_curcop->cop_line);
4104 gv_efullname3(tmpstr, gv, Nullch);
4105 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4106 hv = GvHVn(db_postponed);
4107 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4108 && (cv = GvCV(db_postponed))) {
4113 call_sv((SV*)cv, G_DISCARD);
4117 if ((s = strrchr(name,':')))
4121 if (strEQ(s, "BEGIN")) {
4122 I32 oldscope = PL_scopestack_ix;
4124 SAVESPTR(PL_compiling.cop_filegv);
4125 SAVEI16(PL_compiling.cop_line);
4127 sv_setsv(PL_rs, PL_nrs);
4130 PL_beginav = newAV();
4131 DEBUG_x( dump_sub(gv) );
4132 av_push(PL_beginav, (SV *)cv);
4134 call_list(oldscope, PL_beginav);
4136 PL_curcop = &PL_compiling;
4137 PL_compiling.op_private = PL_hints;
4140 else if (strEQ(s, "END") && !PL_error_count) {
4143 av_unshift(PL_endav, 1);
4144 av_store(PL_endav, 0, (SV *)cv);
4147 else if (strEQ(s, "INIT") && !PL_error_count) {
4149 PL_initav = newAV();
4150 av_push(PL_initav, SvREFCNT_inc(cv));
4156 PL_copline = NOLINE;
4161 /* XXX unsafe for threads if eval_owner isn't held */
4163 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4166 U32 oldhints = PL_hints;
4167 HV *old_cop_stash = PL_curcop->cop_stash;
4168 HV *old_curstash = PL_curstash;
4169 line_t oldline = PL_curcop->cop_line;
4170 PL_curcop->cop_line = PL_copline;
4172 PL_hints &= ~HINT_BLOCK_SCOPE;
4174 PL_curstash = PL_curcop->cop_stash = stash;
4177 start_subparse(FALSE, 0),
4178 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4179 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4180 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4183 PL_hints = oldhints;
4184 PL_curcop->cop_stash = old_cop_stash;
4185 PL_curstash = old_curstash;
4186 PL_curcop->cop_line = oldline;
4190 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4193 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4196 if (cv = (name ? GvCV(gv) : Nullcv)) {
4198 /* just a cached method */
4202 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4203 /* already defined (or promised) */
4204 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4205 && HvNAME(GvSTASH(CvGV(cv)))
4206 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4207 line_t oldline = PL_curcop->cop_line;
4208 if (PL_copline != NOLINE)
4209 PL_curcop->cop_line = PL_copline;
4210 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4211 PL_curcop->cop_line = oldline;
4218 if (cv) /* must reuse cv if autoloaded */
4221 cv = (CV*)NEWSV(1105,0);
4222 sv_upgrade((SV *)cv, SVt_PVCV);
4226 PL_sub_generation++;
4229 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4231 New(666, CvMUTEXP(cv), 1, perl_mutex);
4232 MUTEX_INIT(CvMUTEXP(cv));
4234 #endif /* USE_THREADS */
4235 CvFILEGV(cv) = gv_fetchfile(filename);
4236 CvXSUB(cv) = subaddr;
4239 char *s = strrchr(name,':');
4244 if (strEQ(s, "BEGIN")) {
4246 PL_beginav = newAV();
4247 av_push(PL_beginav, (SV *)cv);
4250 else if (strEQ(s, "END")) {
4253 av_unshift(PL_endav, 1);
4254 av_store(PL_endav, 0, (SV *)cv);
4257 else if (strEQ(s, "INIT")) {
4259 PL_initav = newAV();
4260 av_push(PL_initav, (SV *)cv);
4271 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4281 name = SvPVx(cSVOPo->op_sv, n_a);
4284 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4286 if (cv = GvFORM(gv)) {
4287 if (ckWARN(WARN_REDEFINE)) {
4288 line_t oldline = PL_curcop->cop_line;
4290 PL_curcop->cop_line = PL_copline;
4291 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4292 PL_curcop->cop_line = oldline;
4298 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4299 CvFILEGV(cv) = PL_curcop->cop_filegv;
4301 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4302 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4303 SvPADTMP_on(PL_curpad[ix]);
4306 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4307 CvSTART(cv) = LINKLIST(CvROOT(cv));
4308 CvROOT(cv)->op_next = 0;
4311 PL_copline = NOLINE;
4316 Perl_newANONLIST(pTHX_ OP *o)
4318 return newUNOP(OP_REFGEN, 0,
4319 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4323 Perl_newANONHASH(pTHX_ OP *o)
4325 return newUNOP(OP_REFGEN, 0,
4326 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4330 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4332 return newUNOP(OP_REFGEN, 0,
4333 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4337 Perl_oopsAV(pTHX_ OP *o)
4339 switch (o->op_type) {
4341 o->op_type = OP_PADAV;
4342 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4343 return ref(o, OP_RV2AV);
4346 o->op_type = OP_RV2AV;
4347 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4352 if (ckWARN_d(WARN_INTERNAL))
4353 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4360 Perl_oopsHV(pTHX_ OP *o)
4364 switch (o->op_type) {
4367 o->op_type = OP_PADHV;
4368 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4369 return ref(o, OP_RV2HV);
4373 o->op_type = OP_RV2HV;
4374 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4379 if (ckWARN_d(WARN_INTERNAL))
4380 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
4387 Perl_newAVREF(pTHX_ OP *o)
4389 if (o->op_type == OP_PADANY) {
4390 o->op_type = OP_PADAV;
4391 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4394 return newUNOP(OP_RV2AV, 0, scalar(o));
4398 Perl_newGVREF(pTHX_ I32 type, OP *o)
4400 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4401 return newUNOP(OP_NULL, 0, o);
4402 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4406 Perl_newHVREF(pTHX_ OP *o)
4408 if (o->op_type == OP_PADANY) {
4409 o->op_type = OP_PADHV;
4410 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4413 return newUNOP(OP_RV2HV, 0, scalar(o));
4417 Perl_oopsCV(pTHX_ OP *o)
4419 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4425 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4427 return newUNOP(OP_RV2CV, flags, scalar(o));
4431 Perl_newSVREF(pTHX_ OP *o)
4433 if (o->op_type == OP_PADANY) {
4434 o->op_type = OP_PADSV;
4435 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4438 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4439 o->op_flags |= OPpDONE_SVREF;
4442 return newUNOP(OP_RV2SV, 0, scalar(o));
4445 /* Check routines. */
4448 Perl_ck_anoncode(pTHX_ OP *o)
4453 name = NEWSV(1106,0);
4454 sv_upgrade(name, SVt_PVNV);
4455 sv_setpvn(name, "&", 1);
4458 ix = pad_alloc(o->op_type, SVs_PADMY);
4459 av_store(PL_comppad_name, ix, name);
4460 av_store(PL_comppad, ix, cSVOPo->op_sv);
4461 SvPADMY_on(cSVOPo->op_sv);
4462 cSVOPo->op_sv = Nullsv;
4463 cSVOPo->op_targ = ix;
4468 Perl_ck_bitop(pTHX_ OP *o)
4470 o->op_private = PL_hints;
4475 Perl_ck_concat(pTHX_ OP *o)
4477 if (cUNOPo->op_first->op_type == OP_CONCAT)
4478 o->op_flags |= OPf_STACKED;
4483 Perl_ck_spair(pTHX_ OP *o)
4485 if (o->op_flags & OPf_KIDS) {
4488 OPCODE type = o->op_type;
4489 o = modkids(ck_fun(o), type);
4490 kid = cUNOPo->op_first;
4491 newop = kUNOP->op_first->op_sibling;
4493 (newop->op_sibling ||
4494 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4495 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4496 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4500 op_free(kUNOP->op_first);
4501 kUNOP->op_first = newop;
4503 o->op_ppaddr = PL_ppaddr[++o->op_type];
4508 Perl_ck_delete(pTHX_ OP *o)
4512 if (o->op_flags & OPf_KIDS) {
4513 OP *kid = cUNOPo->op_first;
4514 if (kid->op_type == OP_HSLICE)
4515 o->op_private |= OPpSLICE;
4516 else if (kid->op_type != OP_HELEM)
4517 Perl_croak(aTHX_ "%s argument is not a HASH element or slice",
4518 PL_op_desc[o->op_type]);
4525 Perl_ck_eof(pTHX_ OP *o)
4527 I32 type = o->op_type;
4529 if (o->op_flags & OPf_KIDS) {
4530 if (cLISTOPo->op_first->op_type == OP_STUB) {
4532 o = newUNOP(type, OPf_SPECIAL,
4533 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4541 Perl_ck_eval(pTHX_ OP *o)
4543 PL_hints |= HINT_BLOCK_SCOPE;
4544 if (o->op_flags & OPf_KIDS) {
4545 SVOP *kid = (SVOP*)cUNOPo->op_first;
4548 o->op_flags &= ~OPf_KIDS;
4551 else if (kid->op_type == OP_LINESEQ) {
4554 kid->op_next = o->op_next;
4555 cUNOPo->op_first = 0;
4558 NewOp(1101, enter, 1, LOGOP);
4559 enter->op_type = OP_ENTERTRY;
4560 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4561 enter->op_private = 0;
4563 /* establish postfix order */
4564 enter->op_next = (OP*)enter;
4566 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4567 o->op_type = OP_LEAVETRY;
4568 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4569 enter->op_other = o;
4577 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4579 o->op_targ = (PADOFFSET)PL_hints;
4584 Perl_ck_exec(pTHX_ OP *o)
4587 if (o->op_flags & OPf_STACKED) {
4589 kid = cUNOPo->op_first->op_sibling;
4590 if (kid->op_type == OP_RV2GV)
4599 Perl_ck_exists(pTHX_ OP *o)
4602 if (o->op_flags & OPf_KIDS) {
4603 OP *kid = cUNOPo->op_first;
4604 if (kid->op_type != OP_HELEM)
4605 Perl_croak(aTHX_ "%s argument is not a HASH element", PL_op_desc[o->op_type]);
4613 Perl_ck_gvconst(pTHX_ register OP *o)
4615 o = fold_constants(o);
4616 if (o->op_type == OP_CONST)
4623 Perl_ck_rvconst(pTHX_ register OP *o)
4626 SVOP *kid = (SVOP*)cUNOPo->op_first;
4628 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4629 if (kid->op_type == OP_CONST) {
4633 SV *kidsv = kid->op_sv;
4636 /* Is it a constant from cv_const_sv()? */
4637 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4638 SV *rsv = SvRV(kidsv);
4639 int svtype = SvTYPE(rsv);
4640 char *badtype = Nullch;
4642 switch (o->op_type) {
4644 if (svtype > SVt_PVMG)
4645 badtype = "a SCALAR";
4648 if (svtype != SVt_PVAV)
4649 badtype = "an ARRAY";
4652 if (svtype != SVt_PVHV) {
4653 if (svtype == SVt_PVAV) { /* pseudohash? */
4654 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4655 if (ksv && SvROK(*ksv)
4656 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4665 if (svtype != SVt_PVCV)
4670 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
4673 name = SvPV(kidsv, n_a);
4674 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4675 char *badthing = Nullch;
4676 switch (o->op_type) {
4678 badthing = "a SCALAR";
4681 badthing = "an ARRAY";
4684 badthing = "a HASH";
4689 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4693 * This is a little tricky. We only want to add the symbol if we
4694 * didn't add it in the lexer. Otherwise we get duplicate strict
4695 * warnings. But if we didn't add it in the lexer, we must at
4696 * least pretend like we wanted to add it even if it existed before,
4697 * or we get possible typo warnings. OPpCONST_ENTERED says
4698 * whether the lexer already added THIS instance of this symbol.
4700 iscv = (o->op_type == OP_RV2CV) * 2;
4702 gv = gv_fetchpv(name,
4703 iscv | !(kid->op_private & OPpCONST_ENTERED),
4706 : o->op_type == OP_RV2SV
4708 : o->op_type == OP_RV2AV
4710 : o->op_type == OP_RV2HV
4713 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4715 kid->op_type = OP_GV;
4716 SvREFCNT_dec(kid->op_sv);
4717 kid->op_sv = SvREFCNT_inc(gv);
4718 kid->op_ppaddr = PL_ppaddr[OP_GV];
4725 Perl_ck_ftst(pTHX_ OP *o)
4728 I32 type = o->op_type;
4730 if (o->op_flags & OPf_REF)
4733 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4734 SVOP *kid = (SVOP*)cUNOPo->op_first;
4736 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4738 OP *newop = newGVOP(type, OPf_REF,
4739 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4746 if (type == OP_FTTTY)
4747 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4750 return newUNOP(type, 0, newDEFSVOP());
4756 Perl_ck_fun(pTHX_ OP *o)
4763 int type = o->op_type;
4764 register I32 oa = PL_opargs[type] >> OASHIFT;
4766 if (o->op_flags & OPf_STACKED) {
4767 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4770 return no_fh_allowed(o);
4773 if (o->op_flags & OPf_KIDS) {
4775 tokid = &cLISTOPo->op_first;
4776 kid = cLISTOPo->op_first;
4777 if (kid->op_type == OP_PUSHMARK ||
4778 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4780 tokid = &kid->op_sibling;
4781 kid = kid->op_sibling;
4783 if (!kid && PL_opargs[type] & OA_DEFGV)
4784 *tokid = kid = newDEFSVOP();
4788 sibl = kid->op_sibling;
4791 /* list seen where single (scalar) arg expected? */
4792 if (numargs == 1 && !(oa >> 4)
4793 && kid->op_type == OP_LIST && type != OP_SCALAR)
4795 return too_many_arguments(o,PL_op_desc[type]);
4808 if (kid->op_type == OP_CONST &&
4809 (kid->op_private & OPpCONST_BARE))
4811 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4812 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4813 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4814 if (ckWARN(WARN_SYNTAX))
4815 Perl_warner(aTHX_ WARN_SYNTAX,
4816 "Array @%s missing the @ in argument %ld of %s()",
4817 name, (long)numargs, PL_op_desc[type]);
4820 kid->op_sibling = sibl;
4823 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4824 bad_type(numargs, "array", PL_op_desc[type], kid);
4828 if (kid->op_type == OP_CONST &&
4829 (kid->op_private & OPpCONST_BARE))
4831 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4832 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4833 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4834 if (ckWARN(WARN_SYNTAX))
4835 Perl_warner(aTHX_ WARN_SYNTAX,
4836 "Hash %%%s missing the %% in argument %ld of %s()",
4837 name, (long)numargs, PL_op_desc[type]);
4840 kid->op_sibling = sibl;
4843 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4844 bad_type(numargs, "hash", PL_op_desc[type], kid);
4849 OP *newop = newUNOP(OP_NULL, 0, kid);
4850 kid->op_sibling = 0;
4852 newop->op_next = newop;
4854 kid->op_sibling = sibl;
4859 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4860 if (kid->op_type == OP_CONST &&
4861 (kid->op_private & OPpCONST_BARE))
4863 OP *newop = newGVOP(OP_GV, 0,
4864 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4869 else if (kid->op_type == OP_READLINE) {
4870 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4871 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4874 I32 flags = OPf_SPECIAL;
4876 /* is this op a FH constructor? */
4877 if (is_handle_constructor(o,numargs)) {
4879 /* Set a flag to tell rv2gv to vivify
4880 * need to "prove" flag does not mean something
4881 * else already - NI-S 1999/05/07
4885 /* Helps with open($array[$n],...)
4886 but is too simplistic - need to do selectively
4891 kid->op_sibling = 0;
4892 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
4894 kid->op_private |= priv;
4897 kid->op_sibling = sibl;
4903 mod(scalar(kid), type);
4907 tokid = &kid->op_sibling;
4908 kid = kid->op_sibling;
4910 o->op_private |= numargs;
4912 return too_many_arguments(o,PL_op_desc[o->op_type]);
4915 else if (PL_opargs[type] & OA_DEFGV) {
4917 return newUNOP(type, 0, newDEFSVOP());
4921 while (oa & OA_OPTIONAL)
4923 if (oa && oa != OA_LIST)
4924 return too_few_arguments(o,PL_op_desc[o->op_type]);
4930 Perl_ck_glob(pTHX_ OP *o)
4934 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4935 append_elem(OP_GLOB, o, newDEFSVOP());
4937 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4938 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4940 if (gv && GvIMPORTED_CV(gv)) {
4941 append_elem(OP_GLOB, o,
4942 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
4943 o->op_type = OP_LIST;
4944 o->op_ppaddr = PL_ppaddr[OP_LIST];
4945 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4946 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4947 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4948 append_elem(OP_LIST, o,
4949 scalar(newUNOP(OP_RV2CV, 0,
4950 newGVOP(OP_GV, 0, gv)))));
4951 o = newUNOP(OP_NULL, 0, ck_subr(o));
4952 o->op_targ = OP_GLOB; /* hint at what it used to be */
4955 gv = newGVgen("main");
4957 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4963 Perl_ck_grep(pTHX_ OP *o)
4967 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4969 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4970 NewOp(1101, gwop, 1, LOGOP);
4972 if (o->op_flags & OPf_STACKED) {
4975 kid = cLISTOPo->op_first->op_sibling;
4976 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4979 kid->op_next = (OP*)gwop;
4980 o->op_flags &= ~OPf_STACKED;
4982 kid = cLISTOPo->op_first->op_sibling;
4983 if (type == OP_MAPWHILE)
4990 kid = cLISTOPo->op_first->op_sibling;
4991 if (kid->op_type != OP_NULL)
4992 Perl_croak(aTHX_ "panic: ck_grep");
4993 kid = kUNOP->op_first;
4995 gwop->op_type = type;
4996 gwop->op_ppaddr = PL_ppaddr[type];
4997 gwop->op_first = listkids(o);
4998 gwop->op_flags |= OPf_KIDS;
4999 gwop->op_private = 1;
5000 gwop->op_other = LINKLIST(kid);
5001 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5002 kid->op_next = (OP*)gwop;
5004 kid = cLISTOPo->op_first->op_sibling;
5005 if (!kid || !kid->op_sibling)
5006 return too_few_arguments(o,PL_op_desc[o->op_type]);
5007 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5008 mod(kid, OP_GREPSTART);
5014 Perl_ck_index(pTHX_ OP *o)
5016 if (o->op_flags & OPf_KIDS) {
5017 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5019 kid = kid->op_sibling; /* get past "big" */
5020 if (kid && kid->op_type == OP_CONST)
5021 fbm_compile(((SVOP*)kid)->op_sv, 0);
5027 Perl_ck_lengthconst(pTHX_ OP *o)
5029 /* XXX length optimization goes here */
5034 Perl_ck_lfun(pTHX_ OP *o)
5036 OPCODE type = o->op_type;
5037 return modkids(ck_fun(o), type);
5041 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5044 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5045 switch (cUNOPo->op_first->op_type) {
5048 case OP_AASSIGN: /* Is this a good idea? */
5049 Perl_warner(aTHX_ WARN_DEPRECATED,
5050 "defined(@array) is deprecated");
5051 Perl_warner(aTHX_ WARN_DEPRECATED,
5052 "(Maybe you should just omit the defined()?)\n");
5056 Perl_warner(aTHX_ WARN_DEPRECATED,
5057 "defined(%hash) is deprecated");
5058 Perl_warner(aTHX_ WARN_DEPRECATED,
5059 "(Maybe you should just omit the defined()?)\n");
5070 Perl_ck_rfun(pTHX_ OP *o)
5072 OPCODE type = o->op_type;
5073 return refkids(ck_fun(o), type);
5077 Perl_ck_listiob(pTHX_ OP *o)
5081 kid = cLISTOPo->op_first;
5084 kid = cLISTOPo->op_first;
5086 if (kid->op_type == OP_PUSHMARK)
5087 kid = kid->op_sibling;
5088 if (kid && o->op_flags & OPf_STACKED)
5089 kid = kid->op_sibling;
5090 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5091 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5092 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5093 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5094 cLISTOPo->op_first->op_sibling = kid;
5095 cLISTOPo->op_last = kid;
5096 kid = kid->op_sibling;
5101 append_elem(o->op_type, o, newDEFSVOP());
5107 if (PL_hints & HINT_LOCALE)
5108 o->op_private |= OPpLOCALE;
5115 Perl_ck_fun_locale(pTHX_ OP *o)
5121 if (PL_hints & HINT_LOCALE)
5122 o->op_private |= OPpLOCALE;
5129 Perl_ck_sassign(pTHX_ OP *o)
5131 OP *kid = cLISTOPo->op_first;
5132 /* has a disposable target? */
5133 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5134 && !(kid->op_flags & OPf_STACKED))
5136 OP *kkid = kid->op_sibling;
5138 /* Can just relocate the target. */
5139 if (kkid && kkid->op_type == OP_PADSV) {
5140 /* Concat has problems if target is equal to right arg. */
5141 if (kid->op_type == OP_CONCAT
5142 && kLISTOP->op_first->op_sibling->op_type == OP_PADSV
5143 && kLISTOP->op_first->op_sibling->op_targ == kkid->op_targ)
5147 kid->op_targ = kkid->op_targ;
5148 /* Now we do not need PADSV and SASSIGN. */
5149 kid->op_sibling = o->op_sibling; /* NULL */
5150 cLISTOPo->op_first = NULL;
5153 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5161 Perl_ck_scmp(pTHX_ OP *o)
5165 if (PL_hints & HINT_LOCALE)
5166 o->op_private |= OPpLOCALE;
5173 Perl_ck_match(pTHX_ OP *o)
5175 o->op_private |= OPpRUNTIME;
5180 Perl_ck_null(pTHX_ OP *o)
5186 Perl_ck_repeat(pTHX_ OP *o)
5188 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5189 o->op_private |= OPpREPEAT_DOLIST;
5190 cBINOPo->op_first = force_list(cBINOPo->op_first);
5198 Perl_ck_require(pTHX_ OP *o)
5200 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5201 SVOP *kid = (SVOP*)cUNOPo->op_first;
5203 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5205 for (s = SvPVX(kid->op_sv); *s; s++) {
5206 if (*s == ':' && s[1] == ':') {
5208 Move(s+2, s+1, strlen(s+2)+1, char);
5209 --SvCUR(kid->op_sv);
5212 sv_catpvn(kid->op_sv, ".pm", 3);
5220 Perl_ck_retarget(pTHX_ OP *o)
5222 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5229 Perl_ck_select(pTHX_ OP *o)
5232 if (o->op_flags & OPf_KIDS) {
5233 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5234 if (kid && kid->op_sibling) {
5235 o->op_type = OP_SSELECT;
5236 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5238 return fold_constants(o);
5242 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5243 if (kid && kid->op_type == OP_RV2GV)
5244 kid->op_private &= ~HINT_STRICT_REFS;
5249 Perl_ck_shift(pTHX_ OP *o)
5251 I32 type = o->op_type;
5253 if (!(o->op_flags & OPf_KIDS)) {
5258 if (!CvUNIQUE(PL_compcv)) {
5259 argop = newOP(OP_PADAV, OPf_REF);
5260 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5263 argop = newUNOP(OP_RV2AV, 0,
5264 scalar(newGVOP(OP_GV, 0,
5265 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5268 argop = newUNOP(OP_RV2AV, 0,
5269 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5270 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5271 #endif /* USE_THREADS */
5272 return newUNOP(type, 0, scalar(argop));
5274 return scalar(modkids(ck_fun(o), type));
5278 Perl_ck_sort(pTHX_ OP *o)
5282 if (PL_hints & HINT_LOCALE)
5283 o->op_private |= OPpLOCALE;
5286 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5288 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5289 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5291 kid = kUNOP->op_first; /* get past null */
5293 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5295 if (kid->op_type == OP_SCOPE) {
5299 else if (kid->op_type == OP_LEAVE) {
5300 if (o->op_type == OP_SORT) {
5301 null(kid); /* wipe out leave */
5304 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5305 if (k->op_next == kid)
5310 kid->op_next = 0; /* just disconnect the leave */
5311 k = kLISTOP->op_first;
5315 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5316 if (o->op_type == OP_SORT)
5320 o->op_flags |= OPf_SPECIAL;
5322 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5323 null(cLISTOPo->op_first->op_sibling);
5330 S_simplify_sort(pTHX_ OP *o)
5333 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5336 if (!(o->op_flags & OPf_STACKED))
5338 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5339 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5340 kid = kUNOP->op_first; /* get past null */
5341 if (kid->op_type != OP_SCOPE)
5343 kid = kLISTOP->op_last; /* get past scope */
5344 switch(kid->op_type) {
5352 k = kid; /* remember this node*/
5353 if (kBINOP->op_first->op_type != OP_RV2SV)
5355 kid = kBINOP->op_first; /* get past cmp */
5356 if (kUNOP->op_first->op_type != OP_GV)
5358 kid = kUNOP->op_first; /* get past rv2sv */
5359 if (GvSTASH(kGVOP->op_gv) != PL_curstash)
5361 if (strEQ(GvNAME(kGVOP->op_gv), "a"))
5363 else if(strEQ(GvNAME(kGVOP->op_gv), "b"))
5367 kid = k; /* back to cmp */
5368 if (kBINOP->op_last->op_type != OP_RV2SV)
5370 kid = kBINOP->op_last; /* down to 2nd arg */
5371 if (kUNOP->op_first->op_type != OP_GV)
5373 kid = kUNOP->op_first; /* get past rv2sv */
5374 if (GvSTASH(kGVOP->op_gv) != PL_curstash
5376 ? strNE(GvNAME(kGVOP->op_gv), "a")
5377 : strNE(GvNAME(kGVOP->op_gv), "b")))
5379 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5381 o->op_private |= OPpSORT_REVERSE;
5382 if (k->op_type == OP_NCMP)
5383 o->op_private |= OPpSORT_NUMERIC;
5384 if (k->op_type == OP_I_NCMP)
5385 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5386 op_free(cLISTOPo->op_first->op_sibling); /* delete comparison block */
5387 cLISTOPo->op_first->op_sibling = cLISTOPo->op_last;
5388 cLISTOPo->op_children = 1;
5392 Perl_ck_split(pTHX_ OP *o)
5396 if (o->op_flags & OPf_STACKED)
5397 return no_fh_allowed(o);
5399 kid = cLISTOPo->op_first;
5400 if (kid->op_type != OP_NULL)
5401 Perl_croak(aTHX_ "panic: ck_split");
5402 kid = kid->op_sibling;
5403 op_free(cLISTOPo->op_first);
5404 cLISTOPo->op_first = kid;
5406 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5407 cLISTOPo->op_last = kid; /* There was only one element previously */
5410 if (kid->op_type != OP_MATCH) {
5411 OP *sibl = kid->op_sibling;
5412 kid->op_sibling = 0;
5413 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5414 if (cLISTOPo->op_first == cLISTOPo->op_last)
5415 cLISTOPo->op_last = kid;
5416 cLISTOPo->op_first = kid;
5417 kid->op_sibling = sibl;
5420 kid->op_type = OP_PUSHRE;
5421 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5424 if (!kid->op_sibling)
5425 append_elem(OP_SPLIT, o, newDEFSVOP());
5427 kid = kid->op_sibling;
5430 if (!kid->op_sibling)
5431 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5433 kid = kid->op_sibling;
5436 if (kid->op_sibling)
5437 return too_many_arguments(o,PL_op_desc[o->op_type]);
5443 Perl_ck_subr(pTHX_ OP *o)
5446 OP *prev = ((cUNOPo->op_first->op_sibling)
5447 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5448 OP *o2 = prev->op_sibling;
5457 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5458 if (cvop->op_type == OP_RV2CV) {
5460 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5461 null(cvop); /* disable rv2cv */
5462 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5463 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
5464 cv = GvCVu(tmpop->op_sv);
5466 tmpop->op_private |= OPpEARLY_CV;
5467 else if (SvPOK(cv)) {
5468 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5469 proto = SvPV((SV*)cv, n_a);
5473 else if (cvop->op_type == OP_METHOD) {
5474 if (o2->op_type == OP_CONST)
5475 o2->op_private &= ~OPpCONST_STRICT;
5476 else if (o2->op_type == OP_LIST) {
5477 OP *o = ((UNOP*)o2)->op_first->op_sibling;
5478 if (o && o->op_type == OP_CONST)
5479 o->op_private &= ~OPpCONST_STRICT;
5482 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5483 if (PERLDB_SUB && PL_curstash != PL_debstash)
5484 o->op_private |= OPpENTERSUB_DB;
5485 while (o2 != cvop) {
5489 return too_many_arguments(o, gv_ename(namegv));
5507 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5508 bad_type(arg, "block", gv_ename(namegv), o2);
5511 /* '*' allows any scalar type, including bareword */
5514 if (o2->op_type == OP_RV2GV)
5515 goto wrapref; /* autoconvert GLOB -> GLOBref */
5516 else if (o2->op_type == OP_CONST)
5517 o2->op_private &= ~OPpCONST_STRICT;
5518 else if (o2->op_type == OP_ENTERSUB) {
5519 /* accidental subroutine, revert to bareword */
5520 OP *gvop = ((UNOP*)o2)->op_first;
5521 if (gvop && gvop->op_type == OP_NULL) {
5522 gvop = ((UNOP*)gvop)->op_first;
5524 for (; gvop->op_sibling; gvop = gvop->op_sibling)
5527 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
5528 (gvop = ((UNOP*)gvop)->op_first) &&
5529 gvop->op_type == OP_GV)
5531 GV *gv = (GV*)((SVOP*)gvop)->op_sv;
5532 OP *sibling = o2->op_sibling;
5533 SV *n = newSVpvn("",0);
5535 gv_fullname3(n, gv, "");
5536 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
5537 sv_chop(n, SvPVX(n)+6);
5538 o2 = newSVOP(OP_CONST, 0, n);
5539 prev->op_sibling = o2;
5540 o2->op_sibling = sibling;
5552 if (o2->op_type != OP_RV2GV)
5553 bad_type(arg, "symbol", gv_ename(namegv), o2);
5556 if (o2->op_type != OP_RV2CV)
5557 bad_type(arg, "sub", gv_ename(namegv), o2);
5560 if (o2->op_type != OP_RV2SV
5561 && o2->op_type != OP_PADSV
5562 && o2->op_type != OP_HELEM
5563 && o2->op_type != OP_AELEM
5564 && o2->op_type != OP_THREADSV)
5566 bad_type(arg, "scalar", gv_ename(namegv), o2);
5570 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5571 bad_type(arg, "array", gv_ename(namegv), o2);
5574 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5575 bad_type(arg, "hash", gv_ename(namegv), o2);
5579 OP* sib = kid->op_sibling;
5580 kid->op_sibling = 0;
5581 o2 = newUNOP(OP_REFGEN, 0, kid);
5582 o2->op_sibling = sib;
5583 prev->op_sibling = o2;
5594 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
5595 gv_ename(namegv), SvPV((SV*)cv, n_a));
5600 mod(o2, OP_ENTERSUB);
5602 o2 = o2->op_sibling;
5604 if (proto && !optional &&
5605 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5606 return too_few_arguments(o, gv_ename(namegv));
5611 Perl_ck_svconst(pTHX_ OP *o)
5613 SvREADONLY_on(cSVOPo->op_sv);
5618 Perl_ck_trunc(pTHX_ OP *o)
5620 if (o->op_flags & OPf_KIDS) {
5621 SVOP *kid = (SVOP*)cUNOPo->op_first;
5623 if (kid->op_type == OP_NULL)
5624 kid = (SVOP*)kid->op_sibling;
5625 if (kid && kid->op_type == OP_CONST &&
5626 (kid->op_private & OPpCONST_BARE))
5628 o->op_flags |= OPf_SPECIAL;
5629 kid->op_private &= ~OPpCONST_STRICT;
5635 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5638 Perl_peep(pTHX_ register OP *o)
5641 register OP* oldop = 0;
5644 if (!o || o->op_seq)
5648 SAVESPTR(PL_curcop);
5649 for (; o; o = o->op_next) {
5655 switch (o->op_type) {
5658 PL_curcop = ((COP*)o); /* for warnings */
5659 o->op_seq = PL_op_seqmax++;
5663 if (cSVOPo->op_private & OPpCONST_STRICT)
5664 no_bareword_allowed(o);
5670 if ( o->op_next && o->op_next->op_type == OP_STRINGIFY
5671 && !(o->op_next->op_private & OPpTARGET_MY) )
5673 o->op_seq = PL_op_seqmax++;
5678 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
5679 if (o->op_next->op_private & OPpTARGET_MY) {
5680 if ((o->op_flags & OPf_STACKED) /* chained concats */
5681 || (o->op_type == OP_CONCAT
5682 /* Concat has problems if target is equal to right arg. */
5683 && (((LISTOP*)o)->op_first->op_sibling->op_type
5685 && (((LISTOP*)o)->op_first->op_sibling->op_targ
5686 == o->op_next->op_targ))) {
5687 goto ignore_optimization;
5689 o->op_targ = o->op_next->op_targ;
5694 ignore_optimization:
5695 o->op_seq = PL_op_seqmax++;
5698 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5699 o->op_seq = PL_op_seqmax++;
5700 break; /* Scalar stub must produce undef. List stub is noop */
5704 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5705 PL_curcop = ((COP*)o);
5711 if (oldop && o->op_next) {
5712 oldop->op_next = o->op_next;
5715 o->op_seq = PL_op_seqmax++;
5719 if (o->op_next->op_type == OP_RV2SV) {
5720 if (!(o->op_next->op_private & OPpDEREF)) {
5722 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5723 o->op_next = o->op_next->op_next;
5724 o->op_type = OP_GVSV;
5725 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5728 else if (o->op_next->op_type == OP_RV2AV) {
5729 OP* pop = o->op_next->op_next;
5731 if (pop->op_type == OP_CONST &&
5732 (PL_op = pop->op_next) &&
5733 pop->op_next->op_type == OP_AELEM &&
5734 !(pop->op_next->op_private &
5735 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5736 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5740 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5744 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5745 o->op_next = pop->op_next->op_next;
5746 o->op_type = OP_AELEMFAST;
5747 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5748 o->op_private = (U8)i;
5749 GvAVn(((GVOP*)o)->op_gv);
5752 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_UNSAFE)) {
5753 GV *gv = cGVOPo->op_gv;
5754 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
5755 /* XXX could check prototype here instead of just carping */
5756 SV *sv = sv_newmortal();
5757 gv_efullname3(sv, gv, Nullch);
5758 Perl_warner(aTHX_ WARN_UNSAFE,
5759 "%s() called too early to check prototype",
5764 o->op_seq = PL_op_seqmax++;
5773 o->op_seq = PL_op_seqmax++;
5774 while (cLOGOP->op_other->op_type == OP_NULL)
5775 cLOGOP->op_other = cLOGOP->op_other->op_next;
5776 peep(cLOGOP->op_other);
5780 o->op_seq = PL_op_seqmax++;
5781 peep(cLOOP->op_redoop);
5782 peep(cLOOP->op_nextop);
5783 peep(cLOOP->op_lastop);
5789 o->op_seq = PL_op_seqmax++;
5790 peep(cPMOP->op_pmreplstart);
5794 o->op_seq = PL_op_seqmax++;
5795 if (ckWARN(WARN_SYNTAX) && o->op_next
5796 && o->op_next->op_type == OP_NEXTSTATE) {
5797 if (o->op_next->op_sibling &&
5798 o->op_next->op_sibling->op_type != OP_EXIT &&
5799 o->op_next->op_sibling->op_type != OP_WARN &&
5800 o->op_next->op_sibling->op_type != OP_DIE) {
5801 line_t oldline = PL_curcop->cop_line;
5803 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5804 Perl_warner(aTHX_ WARN_SYNTAX, "Statement unlikely to be reached");
5805 Perl_warner(aTHX_ WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5806 PL_curcop->cop_line = oldline;
5820 if ((o->op_private & (OPpLVAL_INTRO))
5821 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5823 rop = (UNOP*)((BINOP*)o)->op_first;
5824 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5826 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5827 if (!SvOBJECT(lexname))
5829 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5830 if (!fields || !GvHV(*fields))
5832 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5833 key = SvPV(*svp, keylen);
5834 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5836 Perl_croak(aTHX_ "No such field \"%s\" in variable %s of type %s",
5837 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5839 ind = SvIV(*indsvp);
5841 Perl_croak(aTHX_ "Bad index while coercing array into hash");
5842 rop->op_type = OP_RV2AV;
5843 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5844 o->op_type = OP_AELEM;
5845 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5847 *svp = newSViv(ind);
5852 o->op_seq = PL_op_seqmax++;