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;
653 if (!o || o->op_seq == (U16)-1)
656 if (o->op_flags & OPf_KIDS) {
657 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
658 nextkid = kid->op_sibling; /* Get before next freeing kid */
666 /* COP* is not cleared by op_clear() so that we may track line
667 * numbers etc even after null() */
668 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
673 #ifdef PL_OP_SLAB_ALLOC
674 if ((char *) o == PL_OpPtr)
683 S_op_clear(pTHX_ OP *o)
685 switch (o->op_type) {
686 case OP_NULL: /* Was holding old type, if any. */
687 case OP_ENTEREVAL: /* Was holding hints. */
689 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
695 if (!(o->op_flags & OPf_SPECIAL))
698 #endif /* USE_THREADS */
700 if (!(o->op_flags & OPf_REF)
701 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
707 SvREFCNT_dec(cGVOPo->op_gv);
708 cGVOPo->op_gv = Nullgv;
711 SvREFCNT_dec(cSVOPo->op_sv);
712 cSVOPo->op_sv = Nullsv;
718 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
722 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
723 SvREFCNT_dec(cSVOPo->op_sv);
724 cSVOPo->op_sv = Nullsv;
727 Safefree(cPVOPo->op_pv);
728 cPVOPo->op_pv = Nullch;
732 op_free(cPMOPo->op_pmreplroot);
733 cPMOPo->op_pmreplroot = Nullop;
738 ReREFCNT_dec(cPMOPo->op_pmregexp);
739 cPMOPo->op_pmregexp = (REGEXP*)NULL;
744 pad_free(o->op_targ);
748 S_cop_free(pTHX_ COP* cop)
750 Safefree(cop->cop_label);
751 SvREFCNT_dec(cop->cop_filegv);
752 if (! specialWARN(cop->cop_warnings))
753 SvREFCNT_dec(cop->cop_warnings);
759 if (o->op_type == OP_NULL)
762 o->op_targ = o->op_type;
763 o->op_type = OP_NULL;
764 o->op_ppaddr = PL_ppaddr[OP_NULL];
767 /* Contextualizers */
769 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
772 Perl_linklist(pTHX_ OP *o)
779 /* establish postfix order */
780 if (cUNOPo->op_first) {
781 o->op_next = LINKLIST(cUNOPo->op_first);
782 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
784 kid->op_next = LINKLIST(kid->op_sibling);
796 Perl_scalarkids(pTHX_ OP *o)
799 if (o && o->op_flags & OPf_KIDS) {
800 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
807 S_scalarboolean(pTHX_ OP *o)
809 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
811 if (ckWARN(WARN_SYNTAX)) {
812 line_t oldline = PL_curcop->cop_line;
814 if (PL_copline != NOLINE)
815 PL_curcop->cop_line = PL_copline;
816 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
817 PL_curcop->cop_line = oldline;
824 Perl_scalar(pTHX_ OP *o)
828 /* assumes no premature commitment */
829 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
830 || o->op_type == OP_RETURN)
833 if ((o->op_private & OPpTARGET_MY)
834 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
835 return scalar(o); /* As if inside SASSIGN */
837 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
839 switch (o->op_type) {
841 if (o->op_private & OPpREPEAT_DOLIST)
842 null(((LISTOP*)cBINOPo->op_first)->op_first);
843 scalar(cBINOPo->op_first);
848 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
852 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
853 if (!kPMOP->op_pmreplroot)
854 deprecate("implicit split to @_");
862 if (o->op_flags & OPf_KIDS) {
863 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
869 kid = cLISTOPo->op_first;
871 while (kid = kid->op_sibling) {
877 WITH_THR(PL_curcop = &PL_compiling);
882 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
888 WITH_THR(PL_curcop = &PL_compiling);
895 Perl_scalarvoid(pTHX_ OP *o)
902 if (o->op_type == OP_NEXTSTATE
903 || o->op_type == OP_SETSTATE
904 || o->op_type == OP_DBSTATE
905 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
906 || o->op_targ == OP_SETSTATE
907 || o->op_targ == OP_DBSTATE)))
910 PL_curcop = (COP*)o; /* for warning below */
913 /* assumes no premature commitment */
914 want = o->op_flags & OPf_WANT;
915 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
916 || o->op_type == OP_RETURN)
919 if ((o->op_private & OPpTARGET_MY)
920 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
921 return scalar(o); /* As if inside SASSIGN */
923 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
925 switch (o->op_type) {
927 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
931 if (o->op_flags & OPf_STACKED)
935 if (o->op_private == 4)
1006 if (!(o->op_private & OPpLVAL_INTRO))
1007 useless = PL_op_desc[o->op_type];
1014 if (!(o->op_private & OPpLVAL_INTRO) &&
1015 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1016 useless = "a variable";
1021 if (cSVOPo->op_private & OPpCONST_STRICT)
1022 no_bareword_allowed(o);
1025 if (ckWARN(WARN_VOID)) {
1026 useless = "a constant";
1027 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1029 else if (SvPOK(sv)) {
1030 if (strnEQ(SvPVX(sv), "di", 2) ||
1031 strnEQ(SvPVX(sv), "ds", 2) ||
1032 strnEQ(SvPVX(sv), "ig", 2))
1037 null(o); /* don't execute or even remember it */
1041 o->op_type = OP_PREINC; /* pre-increment is faster */
1042 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1046 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1047 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1053 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1058 if (o->op_flags & OPf_STACKED)
1066 if (!(o->op_flags & OPf_KIDS))
1075 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1082 /* all requires must return a boolean value */
1083 o->op_flags &= ~OPf_WANT;
1086 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1087 if (!kPMOP->op_pmreplroot)
1088 deprecate("implicit split to @_");
1094 if (ckWARN(WARN_VOID))
1095 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1101 Perl_listkids(pTHX_ OP *o)
1104 if (o && o->op_flags & OPf_KIDS) {
1105 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1112 Perl_list(pTHX_ OP *o)
1116 /* assumes no premature commitment */
1117 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1118 || o->op_type == OP_RETURN)
1121 if ((o->op_private & OPpTARGET_MY)
1122 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
1123 return o; /* As if inside SASSIGN */
1125 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1127 switch (o->op_type) {
1130 list(cBINOPo->op_first);
1135 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1143 if (!(o->op_flags & OPf_KIDS))
1145 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1146 list(cBINOPo->op_first);
1147 return gen_constant_list(o);
1154 kid = cLISTOPo->op_first;
1156 while (kid = kid->op_sibling) {
1157 if (kid->op_sibling)
1162 WITH_THR(PL_curcop = &PL_compiling);
1166 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1167 if (kid->op_sibling)
1172 WITH_THR(PL_curcop = &PL_compiling);
1175 /* all requires must return a boolean value */
1176 o->op_flags &= ~OPf_WANT;
1183 Perl_scalarseq(pTHX_ OP *o)
1188 if (o->op_type == OP_LINESEQ ||
1189 o->op_type == OP_SCOPE ||
1190 o->op_type == OP_LEAVE ||
1191 o->op_type == OP_LEAVETRY)
1194 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1195 if (kid->op_sibling) {
1199 PL_curcop = &PL_compiling;
1201 o->op_flags &= ~OPf_PARENS;
1202 if (PL_hints & HINT_BLOCK_SCOPE)
1203 o->op_flags |= OPf_PARENS;
1206 o = newOP(OP_STUB, 0);
1211 S_modkids(pTHX_ OP *o, I32 type)
1214 if (o && o->op_flags & OPf_KIDS) {
1215 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1222 Perl_mod(pTHX_ OP *o, I32 type)
1229 if (!o || PL_error_count)
1232 if ((o->op_private & OPpTARGET_MY)
1233 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
1236 switch (o->op_type) {
1241 if (!(o->op_private & (OPpCONST_ARYBASE)))
1243 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1244 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1248 SAVEI32(PL_compiling.cop_arybase);
1249 PL_compiling.cop_arybase = 0;
1251 else if (type == OP_REFGEN)
1254 Perl_croak(aTHX_ "That use of $[ is unsupported");
1257 if (o->op_flags & OPf_PARENS)
1261 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1262 !(o->op_flags & OPf_STACKED)) {
1263 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1264 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1265 assert(cUNOPo->op_first->op_type == OP_NULL);
1266 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1272 /* grep, foreach, subcalls, refgen */
1273 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1275 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1276 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1277 ? "do block" : PL_op_desc[o->op_type]),
1278 type ? PL_op_desc[type] : "local"));
1292 case OP_RIGHT_SHIFT:
1301 if (!(o->op_flags & OPf_STACKED))
1307 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1313 if (!type && cUNOPo->op_first->op_type != OP_GV)
1314 Perl_croak(aTHX_ "Can't localize through a reference");
1315 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1316 PL_modcount = 10000;
1317 return o; /* Treat \(@foo) like ordinary list. */
1321 if (scalar_mod_type(o, type))
1323 ref(cUNOPo->op_first, o->op_type);
1332 PL_modcount = 10000;
1335 if (!type && cUNOPo->op_first->op_type != OP_GV)
1336 Perl_croak(aTHX_ "Can't localize through a reference");
1337 ref(cUNOPo->op_first, o->op_type);
1341 PL_hints |= HINT_BLOCK_SCOPE;
1351 PL_modcount = 10000;
1352 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1353 return o; /* Treat \(@foo) like ordinary list. */
1354 if (scalar_mod_type(o, type))
1360 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1361 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1366 PL_modcount++; /* XXX ??? */
1368 #endif /* USE_THREADS */
1374 if (type != OP_SASSIGN)
1378 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1384 pad_free(o->op_targ);
1385 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1386 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1387 if (o->op_flags & OPf_KIDS)
1388 mod(cBINOPo->op_first->op_sibling, type);
1393 ref(cBINOPo->op_first, o->op_type);
1394 if (type == OP_ENTERSUB &&
1395 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1396 o->op_private |= OPpLVAL_DEFER;
1403 if (o->op_flags & OPf_KIDS)
1404 mod(cLISTOPo->op_last, type);
1408 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1410 else if (!(o->op_flags & OPf_KIDS))
1412 if (o->op_targ != OP_LIST) {
1413 mod(cBINOPo->op_first, type);
1418 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1422 o->op_flags |= OPf_MOD;
1424 if (type == OP_AASSIGN || type == OP_SASSIGN)
1425 o->op_flags |= OPf_SPECIAL|OPf_REF;
1427 o->op_private |= OPpLVAL_INTRO;
1428 o->op_flags &= ~OPf_SPECIAL;
1429 PL_hints |= HINT_BLOCK_SCOPE;
1431 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1432 o->op_flags |= OPf_REF;
1437 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1441 if (o->op_type == OP_RV2GV)
1465 case OP_RIGHT_SHIFT:
1484 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1486 switch (o->op_type) {
1494 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1507 Perl_refkids(pTHX_ OP *o, I32 type)
1510 if (o && o->op_flags & OPf_KIDS) {
1511 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1518 Perl_ref(pTHX_ OP *o, I32 type)
1522 if (!o || PL_error_count)
1525 switch (o->op_type) {
1527 if ((type == OP_DEFINED || type == OP_LOCK) &&
1528 !(o->op_flags & OPf_STACKED)) {
1529 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1530 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1531 assert(cUNOPo->op_first->op_type == OP_NULL);
1532 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1533 o->op_flags |= OPf_SPECIAL;
1538 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1542 if (type == OP_DEFINED)
1543 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1544 ref(cUNOPo->op_first, o->op_type);
1547 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1548 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1549 : type == OP_RV2HV ? OPpDEREF_HV
1551 o->op_flags |= OPf_MOD;
1556 o->op_flags |= OPf_MOD; /* XXX ??? */
1561 o->op_flags |= OPf_REF;
1564 if (type == OP_DEFINED)
1565 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1566 ref(cUNOPo->op_first, o->op_type);
1571 o->op_flags |= OPf_REF;
1576 if (!(o->op_flags & OPf_KIDS))
1578 ref(cBINOPo->op_first, type);
1582 ref(cBINOPo->op_first, o->op_type);
1583 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1584 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1585 : type == OP_RV2HV ? OPpDEREF_HV
1587 o->op_flags |= OPf_MOD;
1595 if (!(o->op_flags & OPf_KIDS))
1597 ref(cLISTOPo->op_last, type);
1607 Perl_my(pTHX_ OP *o)
1612 if (!o || PL_error_count)
1616 if (type == OP_LIST) {
1617 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1619 } else if (type == OP_UNDEF) {
1621 } else if (type != OP_PADSV &&
1624 type != OP_PUSHMARK)
1626 yyerror(Perl_form(aTHX_ "Can't declare %s in my", PL_op_desc[o->op_type]));
1629 o->op_flags |= OPf_MOD;
1630 o->op_private |= OPpLVAL_INTRO;
1635 Perl_sawparens(pTHX_ OP *o)
1638 o->op_flags |= OPf_PARENS;
1643 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1648 if (ckWARN(WARN_UNSAFE) &&
1649 (left->op_type == OP_RV2AV ||
1650 left->op_type == OP_RV2HV ||
1651 left->op_type == OP_PADAV ||
1652 left->op_type == OP_PADHV)) {
1653 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1654 right->op_type == OP_TRANS)
1655 ? right->op_type : OP_MATCH];
1656 char *sample = ((left->op_type == OP_RV2AV ||
1657 left->op_type == OP_PADAV)
1658 ? "@array" : "%hash");
1659 Perl_warner(aTHX_ WARN_UNSAFE,
1660 "Applying %s to %s will act on scalar(%s)",
1661 desc, sample, sample);
1664 if (right->op_type == OP_MATCH ||
1665 right->op_type == OP_SUBST ||
1666 right->op_type == OP_TRANS) {
1667 right->op_flags |= OPf_STACKED;
1668 if (right->op_type != OP_MATCH)
1669 left = mod(left, right->op_type);
1670 if (right->op_type == OP_TRANS)
1671 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1673 o = prepend_elem(right->op_type, scalar(left), right);
1675 return newUNOP(OP_NOT, 0, scalar(o));
1679 return bind_match(type, left,
1680 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1684 Perl_invert(pTHX_ OP *o)
1688 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1689 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1693 Perl_scope(pTHX_ OP *o)
1696 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1697 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1698 o->op_type = OP_LEAVE;
1699 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1702 if (o->op_type == OP_LINESEQ) {
1704 o->op_type = OP_SCOPE;
1705 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1706 kid = ((LISTOP*)o)->op_first;
1707 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1708 kid->op_type = OP_SETSTATE;
1709 kid->op_ppaddr = PL_ppaddr[OP_SETSTATE];
1713 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1720 Perl_save_hints(pTHX)
1723 SAVESPTR(GvHV(PL_hintgv));
1724 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1725 SAVEFREESV(GvHV(PL_hintgv));
1729 Perl_block_start(pTHX_ int full)
1732 int retval = PL_savestack_ix;
1734 SAVEI32(PL_comppad_name_floor);
1736 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1737 PL_comppad_name_floor = PL_comppad_name_fill;
1739 PL_comppad_name_floor = 0;
1741 SAVEI32(PL_min_intro_pending);
1742 SAVEI32(PL_max_intro_pending);
1743 PL_min_intro_pending = 0;
1744 SAVEI32(PL_comppad_name_fill);
1745 SAVEI32(PL_padix_floor);
1746 PL_padix_floor = PL_padix;
1747 PL_pad_reset_pending = FALSE;
1749 PL_hints &= ~HINT_BLOCK_SCOPE;
1750 SAVEPPTR(PL_compiling.cop_warnings);
1751 if (! specialWARN(PL_compiling.cop_warnings)) {
1752 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1753 SAVEFREESV(PL_compiling.cop_warnings) ;
1761 Perl_block_end(pTHX_ I32 floor, OP *seq)
1764 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1765 OP* retval = scalarseq(seq);
1767 PL_pad_reset_pending = FALSE;
1768 PL_compiling.op_private = PL_hints;
1770 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1771 pad_leavemy(PL_comppad_name_fill);
1780 OP *o = newOP(OP_THREADSV, 0);
1781 o->op_targ = find_threadsv("_");
1784 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1785 #endif /* USE_THREADS */
1789 Perl_newPROG(pTHX_ OP *o)
1795 PL_eval_root = newUNOP(OP_LEAVEEVAL,
1796 ((PL_in_eval & EVAL_KEEPERR)
1797 ? OPf_SPECIAL : 0), o);
1798 PL_eval_start = linklist(PL_eval_root);
1799 PL_eval_root->op_next = 0;
1800 peep(PL_eval_start);
1805 PL_main_root = scope(sawparens(scalarvoid(o)));
1806 PL_curcop = &PL_compiling;
1807 PL_main_start = LINKLIST(PL_main_root);
1808 PL_main_root->op_next = 0;
1809 peep(PL_main_start);
1812 /* Register with debugger */
1814 CV *cv = get_cv("DB::postponed", FALSE);
1818 XPUSHs((SV*)PL_compiling.cop_filegv);
1820 call_sv((SV*)cv, G_DISCARD);
1827 Perl_localize(pTHX_ OP *o, I32 lex)
1829 if (o->op_flags & OPf_PARENS)
1833 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1835 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1836 if (*s == ';' || *s == '=')
1837 Perl_warner(aTHX_ WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1838 lex ? "my" : "local");
1842 PL_in_my_stash = Nullhv;
1846 return mod(o, OP_NULL); /* a bit kludgey */
1850 Perl_jmaybe(pTHX_ OP *o)
1852 if (o->op_type == OP_LIST) {
1855 o2 = newOP(OP_THREADSV, 0);
1856 o2->op_targ = find_threadsv(";");
1858 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1859 #endif /* USE_THREADS */
1860 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1866 Perl_fold_constants(pTHX_ register OP *o)
1870 I32 type = o->op_type;
1873 if (PL_opargs[type] & OA_RETSCALAR)
1875 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
1876 o->op_targ = pad_alloc(type, SVs_PADTMP);
1878 /* integerize op, unless it happens to be C<-foo>.
1879 * XXX should pp_i_negate() do magic string negation instead? */
1880 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
1881 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
1882 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
1884 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1887 if (!(PL_opargs[type] & OA_FOLDCONST))
1892 /* XXX might want a ck_negate() for this */
1893 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
1906 if (o->op_private & OPpLOCALE)
1911 goto nope; /* Don't try to run w/ errors */
1913 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1914 if (curop->op_type != OP_CONST &&
1915 curop->op_type != OP_LIST &&
1916 curop->op_type != OP_SCALAR &&
1917 curop->op_type != OP_NULL &&
1918 curop->op_type != OP_PUSHMARK)
1924 curop = LINKLIST(o);
1928 sv = *(PL_stack_sp--);
1929 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1930 pad_swipe(o->op_targ);
1931 else if (SvTEMP(sv)) { /* grab mortal temp? */
1932 (void)SvREFCNT_inc(sv);
1936 if (type == OP_RV2GV)
1937 return newGVOP(OP_GV, 0, (GV*)sv);
1939 /* try to smush double to int, but don't smush -2.0 to -2 */
1940 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1944 if ((NV)iv == SvNV(sv)) {
1949 SvIOK_off(sv); /* undo SvIV() damage */
1951 return newSVOP(OP_CONST, 0, sv);
1955 if (!(PL_opargs[type] & OA_OTHERINT))
1958 if (!(PL_hints & HINT_INTEGER)) {
1959 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1962 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1963 if (curop->op_type == OP_CONST) {
1964 if (SvIOK(((SVOP*)curop)->op_sv))
1968 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1972 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1979 Perl_gen_constant_list(pTHX_ register OP *o)
1983 I32 oldtmps_floor = PL_tmps_floor;
1987 return o; /* Don't attempt to run with errors */
1989 PL_op = curop = LINKLIST(o);
1995 PL_tmps_floor = oldtmps_floor;
1997 o->op_type = OP_RV2AV;
1998 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1999 curop = ((UNOP*)o)->op_first;
2000 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2007 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2012 if (!o || o->op_type != OP_LIST)
2013 o = newLISTOP(OP_LIST, 0, o, Nullop);
2015 o->op_flags &= ~OPf_WANT;
2017 if (!(PL_opargs[type] & OA_MARK))
2018 null(cLISTOPo->op_first);
2021 o->op_ppaddr = PL_ppaddr[type];
2022 o->op_flags |= flags;
2024 o = CHECKOP(type, o);
2025 if (o->op_type != type)
2028 if (cLISTOPo->op_children < 7) {
2029 /* XXX do we really need to do this if we're done appending?? */
2030 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2032 cLISTOPo->op_last = last; /* in case check substituted last arg */
2035 return fold_constants(o);
2038 /* List constructors */
2041 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2049 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
2050 return newLISTOP(type, 0, first, last);
2052 if (first->op_flags & OPf_KIDS)
2053 ((LISTOP*)first)->op_last->op_sibling = last;
2055 first->op_flags |= OPf_KIDS;
2056 ((LISTOP*)first)->op_first = last;
2058 ((LISTOP*)first)->op_last = last;
2059 ((LISTOP*)first)->op_children++;
2064 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2072 if (first->op_type != type)
2073 return prepend_elem(type, (OP*)first, (OP*)last);
2075 if (last->op_type != type)
2076 return append_elem(type, (OP*)first, (OP*)last);
2078 first->op_last->op_sibling = last->op_first;
2079 first->op_last = last->op_last;
2080 first->op_children += last->op_children;
2081 if (first->op_children)
2082 first->op_flags |= OPf_KIDS;
2084 #ifdef PL_OP_SLAB_ALLOC
2092 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2100 if (last->op_type == type) {
2101 if (type == OP_LIST) { /* already a PUSHMARK there */
2102 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2103 ((LISTOP*)last)->op_first->op_sibling = first;
2106 if (!(last->op_flags & OPf_KIDS)) {
2107 ((LISTOP*)last)->op_last = first;
2108 last->op_flags |= OPf_KIDS;
2110 first->op_sibling = ((LISTOP*)last)->op_first;
2111 ((LISTOP*)last)->op_first = first;
2113 ((LISTOP*)last)->op_children++;
2117 return newLISTOP(type, 0, first, last);
2123 Perl_newNULLLIST(pTHX)
2125 return newOP(OP_STUB, 0);
2129 Perl_force_list(pTHX_ OP *o)
2131 if (!o || o->op_type != OP_LIST)
2132 o = newLISTOP(OP_LIST, 0, o, Nullop);
2138 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2142 NewOp(1101, listop, 1, LISTOP);
2144 listop->op_type = type;
2145 listop->op_ppaddr = PL_ppaddr[type];
2146 listop->op_children = (first != 0) + (last != 0);
2147 listop->op_flags = flags;
2151 else if (!first && last)
2154 first->op_sibling = last;
2155 listop->op_first = first;
2156 listop->op_last = last;
2157 if (type == OP_LIST) {
2159 pushop = newOP(OP_PUSHMARK, 0);
2160 pushop->op_sibling = first;
2161 listop->op_first = pushop;
2162 listop->op_flags |= OPf_KIDS;
2164 listop->op_last = pushop;
2166 else if (listop->op_children)
2167 listop->op_flags |= OPf_KIDS;
2173 Perl_newOP(pTHX_ I32 type, I32 flags)
2176 NewOp(1101, o, 1, OP);
2178 o->op_ppaddr = PL_ppaddr[type];
2179 o->op_flags = flags;
2182 o->op_private = 0 + (flags >> 8);
2183 if (PL_opargs[type] & OA_RETSCALAR)
2185 if (PL_opargs[type] & OA_TARGET)
2186 o->op_targ = pad_alloc(type, SVs_PADTMP);
2187 return CHECKOP(type, o);
2191 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2196 first = newOP(OP_STUB, 0);
2197 if (PL_opargs[type] & OA_MARK)
2198 first = force_list(first);
2200 NewOp(1101, unop, 1, UNOP);
2201 unop->op_type = type;
2202 unop->op_ppaddr = PL_ppaddr[type];
2203 unop->op_first = first;
2204 unop->op_flags = flags | OPf_KIDS;
2205 unop->op_private = 1 | (flags >> 8);
2206 unop = (UNOP*) CHECKOP(type, unop);
2210 return fold_constants((OP *) unop);
2214 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2217 NewOp(1101, binop, 1, BINOP);
2220 first = newOP(OP_NULL, 0);
2222 binop->op_type = type;
2223 binop->op_ppaddr = PL_ppaddr[type];
2224 binop->op_first = first;
2225 binop->op_flags = flags | OPf_KIDS;
2228 binop->op_private = 1 | (flags >> 8);
2231 binop->op_private = 2 | (flags >> 8);
2232 first->op_sibling = last;
2235 binop = (BINOP*)CHECKOP(type, binop);
2236 if (binop->op_next || binop->op_type != type)
2239 binop->op_last = binop->op_first->op_sibling;
2241 return fold_constants((OP *)binop);
2245 utf8compare(const void *a, const void *b)
2248 for (i = 0; i < 10; i++) {
2249 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2251 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2258 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2260 SV *tstr = ((SVOP*)expr)->op_sv;
2261 SV *rstr = ((SVOP*)repl)->op_sv;
2264 register U8 *t = (U8*)SvPV(tstr, tlen);
2265 register U8 *r = (U8*)SvPV(rstr, rlen);
2271 register short *tbl;
2273 complement = o->op_private & OPpTRANS_COMPLEMENT;
2274 del = o->op_private & OPpTRANS_DELETE;
2275 squash = o->op_private & OPpTRANS_SQUASH;
2277 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2278 SV* listsv = newSVpvn("# comment\n",10);
2280 U8* tend = t + tlen;
2281 U8* rend = r + rlen;
2297 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2298 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2304 New(1109, cp, tlen, U8*);
2306 transv = newSVpvn("",0);
2315 qsort(cp, i, sizeof(U8*), utf8compare);
2316 for (j = 0; j < i; j++) {
2318 UV val = utf8_to_uv(s, &ulen);
2320 diff = val - nextmin;
2322 t = uv_to_utf8(tmpbuf,nextmin);
2323 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2325 t = uv_to_utf8(tmpbuf, val - 1);
2326 sv_catpvn(transv, "\377", 1);
2327 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2331 val = utf8_to_uv(s+1, &ulen);
2335 t = uv_to_utf8(tmpbuf,nextmin);
2336 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2337 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2338 sv_catpvn(transv, "\377", 1);
2339 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2340 t = (U8*)SvPVX(transv);
2341 tlen = SvCUR(transv);
2344 else if (!rlen && !del) {
2345 r = t; rlen = tlen; rend = tend;
2348 if (to_utf && from_utf) { /* only counting characters */
2349 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2350 o->op_private |= OPpTRANS_IDENTICAL;
2352 else { /* straight latin-1 translation */
2353 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2354 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2355 o->op_private |= OPpTRANS_IDENTICAL;
2359 while (t < tend || tfirst <= tlast) {
2360 /* see if we need more "t" chars */
2361 if (tfirst > tlast) {
2362 tfirst = (I32)utf8_to_uv(t, &ulen);
2364 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2365 tlast = (I32)utf8_to_uv(++t, &ulen);
2372 /* now see if we need more "r" chars */
2373 if (rfirst > rlast) {
2375 rfirst = (I32)utf8_to_uv(r, &ulen);
2377 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2378 rlast = (I32)utf8_to_uv(++r, &ulen);
2387 rfirst = rlast = 0xffffffff;
2391 /* now see which range will peter our first, if either. */
2392 tdiff = tlast - tfirst;
2393 rdiff = rlast - rfirst;
2400 if (rfirst == 0xffffffff) {
2401 diff = tdiff; /* oops, pretend rdiff is infinite */
2403 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2405 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\tXXXX\n", tfirst);
2409 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2411 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2413 if (rfirst + diff > max)
2414 max = rfirst + diff;
2419 else if (rfirst <= 0x800)
2420 grows |= (tfirst < 0x80);
2421 else if (rfirst <= 0x10000)
2422 grows |= (tfirst < 0x800);
2423 else if (rfirst <= 0x200000)
2424 grows |= (tfirst < 0x10000);
2425 else if (rfirst <= 0x4000000)
2426 grows |= (tfirst < 0x200000);
2427 else if (rfirst <= 0x80000000)
2428 grows |= (tfirst < 0x4000000);
2440 else if (max > 0xff)
2445 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2446 SvREFCNT_dec(listsv);
2448 SvREFCNT_dec(transv);
2450 if (!del && havefinal)
2451 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2453 if (grows && to_utf)
2454 o->op_private |= OPpTRANS_GROWS;
2461 tbl = (short*)cPVOPo->op_pv;
2463 Zero(tbl, 256, short);
2464 for (i = 0; i < tlen; i++)
2466 for (i = 0, j = 0; i < 256; i++) {
2482 if (!rlen && !del) {
2485 o->op_private |= OPpTRANS_IDENTICAL;
2487 for (i = 0; i < 256; i++)
2489 for (i = 0, j = 0; i < tlen; i++,j++) {
2492 if (tbl[t[i]] == -1)
2498 if (tbl[t[i]] == -1)
2509 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2514 NewOp(1101, pmop, 1, PMOP);
2515 pmop->op_type = type;
2516 pmop->op_ppaddr = PL_ppaddr[type];
2517 pmop->op_flags = flags;
2518 pmop->op_private = 0 | (flags >> 8);
2520 if (PL_hints & HINT_RE_TAINT)
2521 pmop->op_pmpermflags |= PMf_RETAINT;
2522 if (PL_hints & HINT_LOCALE)
2523 pmop->op_pmpermflags |= PMf_LOCALE;
2524 pmop->op_pmflags = pmop->op_pmpermflags;
2526 /* link into pm list */
2527 if (type != OP_TRANS && PL_curstash) {
2528 pmop->op_pmnext = HvPMROOT(PL_curstash);
2529 HvPMROOT(PL_curstash) = pmop;
2536 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2541 I32 repl_has_vars = 0;
2543 if (o->op_type == OP_TRANS)
2544 return pmtrans(o, expr, repl);
2546 PL_hints |= HINT_BLOCK_SCOPE;
2549 if (expr->op_type == OP_CONST) {
2551 SV *pat = ((SVOP*)expr)->op_sv;
2552 char *p = SvPV(pat, plen);
2553 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2554 sv_setpvn(pat, "\\s+", 3);
2555 p = SvPV(pat, plen);
2556 pm->op_pmflags |= PMf_SKIPWHITE;
2558 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2559 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2560 pm->op_pmflags |= PMf_WHITE;
2564 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2565 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2567 : OP_REGCMAYBE),0,expr);
2569 NewOp(1101, rcop, 1, LOGOP);
2570 rcop->op_type = OP_REGCOMP;
2571 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2572 rcop->op_first = scalar(expr);
2573 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2574 ? (OPf_SPECIAL | OPf_KIDS)
2576 rcop->op_private = 1;
2579 /* establish postfix order */
2580 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2582 rcop->op_next = expr;
2583 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2586 rcop->op_next = LINKLIST(expr);
2587 expr->op_next = (OP*)rcop;
2590 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2595 if (pm->op_pmflags & PMf_EVAL) {
2597 if (PL_curcop->cop_line < PL_multi_end)
2598 PL_curcop->cop_line = PL_multi_end;
2601 else if (repl->op_type == OP_THREADSV
2602 && strchr("&`'123456789+",
2603 PL_threadsv_names[repl->op_targ]))
2607 #endif /* USE_THREADS */
2608 else if (repl->op_type == OP_CONST)
2612 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2613 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2615 if (curop->op_type == OP_THREADSV) {
2617 if (strchr("&`'123456789+", curop->op_private))
2621 if (curop->op_type == OP_GV) {
2622 GV *gv = ((GVOP*)curop)->op_gv;
2624 if (strchr("&`'123456789+", *GvENAME(gv)))
2627 #endif /* USE_THREADS */
2628 else if (curop->op_type == OP_RV2CV)
2630 else if (curop->op_type == OP_RV2SV ||
2631 curop->op_type == OP_RV2AV ||
2632 curop->op_type == OP_RV2HV ||
2633 curop->op_type == OP_RV2GV) {
2634 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2637 else if (curop->op_type == OP_PADSV ||
2638 curop->op_type == OP_PADAV ||
2639 curop->op_type == OP_PADHV ||
2640 curop->op_type == OP_PADANY) {
2643 else if (curop->op_type == OP_PUSHRE)
2644 ; /* Okay here, dangerous in newASSIGNOP */
2653 && (!pm->op_pmregexp
2654 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2655 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2656 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2657 prepend_elem(o->op_type, scalar(repl), o);
2660 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2661 pm->op_pmflags |= PMf_MAYBE_CONST;
2662 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2664 NewOp(1101, rcop, 1, LOGOP);
2665 rcop->op_type = OP_SUBSTCONT;
2666 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2667 rcop->op_first = scalar(repl);
2668 rcop->op_flags |= OPf_KIDS;
2669 rcop->op_private = 1;
2672 /* establish postfix order */
2673 rcop->op_next = LINKLIST(repl);
2674 repl->op_next = (OP*)rcop;
2676 pm->op_pmreplroot = scalar((OP*)rcop);
2677 pm->op_pmreplstart = LINKLIST(rcop);
2686 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2689 NewOp(1101, svop, 1, SVOP);
2690 svop->op_type = type;
2691 svop->op_ppaddr = PL_ppaddr[type];
2693 svop->op_next = (OP*)svop;
2694 svop->op_flags = flags;
2695 if (PL_opargs[type] & OA_RETSCALAR)
2697 if (PL_opargs[type] & OA_TARGET)
2698 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2699 return CHECKOP(type, svop);
2703 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
2707 NewOp(1101, gvop, 1, GVOP);
2708 gvop->op_type = type;
2709 gvop->op_ppaddr = PL_ppaddr[type];
2710 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2711 gvop->op_next = (OP*)gvop;
2712 gvop->op_flags = flags;
2713 if (PL_opargs[type] & OA_RETSCALAR)
2715 if (PL_opargs[type] & OA_TARGET)
2716 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2717 return CHECKOP(type, gvop);
2721 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
2724 NewOp(1101, pvop, 1, PVOP);
2725 pvop->op_type = type;
2726 pvop->op_ppaddr = PL_ppaddr[type];
2728 pvop->op_next = (OP*)pvop;
2729 pvop->op_flags = flags;
2730 if (PL_opargs[type] & OA_RETSCALAR)
2732 if (PL_opargs[type] & OA_TARGET)
2733 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2734 return CHECKOP(type, pvop);
2738 Perl_package(pTHX_ OP *o)
2743 save_hptr(&PL_curstash);
2744 save_item(PL_curstname);
2749 name = SvPV(sv, len);
2750 PL_curstash = gv_stashpvn(name,len,TRUE);
2751 sv_setpvn(PL_curstname, name, len);
2755 sv_setpv(PL_curstname,"<none>");
2756 PL_curstash = Nullhv;
2758 PL_hints |= HINT_BLOCK_SCOPE;
2759 PL_copline = NOLINE;
2764 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
2773 if (id->op_type != OP_CONST)
2774 Perl_croak(aTHX_ "Module name must be constant");
2778 if(version != Nullop) {
2779 SV *vesv = ((SVOP*)version)->op_sv;
2781 if (arg == Nullop && !SvNIOK(vesv)) {
2788 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2789 Perl_croak(aTHX_ "Version number must be constant number");
2791 /* Make copy of id so we don't free it twice */
2792 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2794 /* Fake up a method call to VERSION */
2795 meth = newSVOP(OP_CONST, 0, newSVpvn("VERSION", 7));
2796 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2797 append_elem(OP_LIST,
2798 prepend_elem(OP_LIST, pack, list(version)),
2799 newUNOP(OP_METHOD, 0, meth)));
2803 /* Fake up an import/unimport */
2804 if (arg && arg->op_type == OP_STUB)
2805 imop = arg; /* no import on explicit () */
2806 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2807 imop = Nullop; /* use 5.0; */
2810 /* Make copy of id so we don't free it twice */
2811 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2812 meth = newSVOP(OP_CONST, 0,
2814 ? newSVpvn("import", 6)
2815 : newSVpvn("unimport", 8)
2817 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2818 append_elem(OP_LIST,
2819 prepend_elem(OP_LIST, pack, list(arg)),
2820 newUNOP(OP_METHOD, 0, meth)));
2823 /* Fake up a require, handle override, if any */
2824 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2825 if (!(gv && GvIMPORTED_CV(gv)))
2826 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2828 if (gv && GvIMPORTED_CV(gv)) {
2829 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2830 append_elem(OP_LIST, id,
2831 scalar(newUNOP(OP_RV2CV, 0,
2836 rqop = newUNOP(OP_REQUIRE, 0, id);
2839 /* Fake up the BEGIN {}, which does its thing immediately. */
2841 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
2843 append_elem(OP_LINESEQ,
2844 append_elem(OP_LINESEQ,
2845 newSTATEOP(0, Nullch, rqop),
2846 newSTATEOP(0, Nullch, veop)),
2847 newSTATEOP(0, Nullch, imop) ));
2849 PL_copline = NOLINE;
2854 Perl_dofile(pTHX_ OP *term)
2859 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2860 if (!(gv && GvIMPORTED_CV(gv)))
2861 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2863 if (gv && GvIMPORTED_CV(gv)) {
2864 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2865 append_elem(OP_LIST, term,
2866 scalar(newUNOP(OP_RV2CV, 0,
2871 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2877 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
2879 return newBINOP(OP_LSLICE, flags,
2880 list(force_list(subscript)),
2881 list(force_list(listval)) );
2885 S_list_assignment(pTHX_ register OP *o)
2890 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2891 o = cUNOPo->op_first;
2893 if (o->op_type == OP_COND_EXPR) {
2894 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
2895 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
2900 yyerror("Assignment to both a list and a scalar");
2904 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2905 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2906 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2909 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2912 if (o->op_type == OP_RV2SV)
2919 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
2924 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2925 return newLOGOP(optype, 0,
2926 mod(scalar(left), optype),
2927 newUNOP(OP_SASSIGN, 0, scalar(right)));
2930 return newBINOP(optype, OPf_STACKED,
2931 mod(scalar(left), optype), scalar(right));
2935 if (list_assignment(left)) {
2938 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2939 left = mod(left, OP_AASSIGN);
2947 o = newBINOP(OP_AASSIGN, flags,
2948 list(force_list(right)),
2949 list(force_list(left)) );
2950 o->op_private = 0 | (flags >> 8);
2951 if (!(left->op_private & OPpLVAL_INTRO)) {
2955 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2956 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2957 if (curop->op_type == OP_GV) {
2958 GV *gv = ((GVOP*)curop)->op_gv;
2959 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2961 SvCUR(gv) = PL_generation;
2963 else if (curop->op_type == OP_PADSV ||
2964 curop->op_type == OP_PADAV ||
2965 curop->op_type == OP_PADHV ||
2966 curop->op_type == OP_PADANY) {
2967 SV **svp = AvARRAY(PL_comppad_name);
2968 SV *sv = svp[curop->op_targ];
2969 if (SvCUR(sv) == PL_generation)
2971 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2973 else if (curop->op_type == OP_RV2CV)
2975 else if (curop->op_type == OP_RV2SV ||
2976 curop->op_type == OP_RV2AV ||
2977 curop->op_type == OP_RV2HV ||
2978 curop->op_type == OP_RV2GV) {
2979 if (lastop->op_type != OP_GV) /* funny deref? */
2982 else if (curop->op_type == OP_PUSHRE) {
2983 if (((PMOP*)curop)->op_pmreplroot) {
2984 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2985 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2987 SvCUR(gv) = PL_generation;
2996 o->op_private = OPpASSIGN_COMMON;
2998 if (right && right->op_type == OP_SPLIT) {
3000 if ((tmpop = ((LISTOP*)right)->op_first) &&
3001 tmpop->op_type == OP_PUSHRE)
3003 PMOP *pm = (PMOP*)tmpop;
3004 if (left->op_type == OP_RV2AV &&
3005 !(left->op_private & OPpLVAL_INTRO) &&
3006 !(o->op_private & OPpASSIGN_COMMON) )
3008 tmpop = ((UNOP*)left)->op_first;
3009 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3010 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
3011 pm->op_pmflags |= PMf_ONCE;
3012 tmpop = cUNOPo->op_first; /* to list (nulled) */
3013 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3014 tmpop->op_sibling = Nullop; /* don't free split */
3015 right->op_next = tmpop->op_next; /* fix starting loc */
3016 op_free(o); /* blow off assign */
3017 right->op_flags &= ~OPf_WANT;
3018 /* "I don't know and I don't care." */
3023 if (PL_modcount < 10000 &&
3024 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3026 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3028 sv_setiv(sv, PL_modcount+1);
3036 right = newOP(OP_UNDEF, 0);
3037 if (right->op_type == OP_READLINE) {
3038 right->op_flags |= OPf_STACKED;
3039 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3042 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3043 o = newBINOP(OP_SASSIGN, flags,
3044 scalar(right), mod(scalar(left), OP_SASSIGN) );
3056 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3059 U32 seq = intro_my();
3062 NewOp(1101, cop, 1, COP);
3063 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
3064 cop->op_type = OP_DBSTATE;
3065 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3068 cop->op_type = OP_NEXTSTATE;
3069 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3071 cop->op_flags = flags;
3072 cop->op_private = (PL_hints & HINT_UTF8);
3074 cop->op_private |= NATIVE_HINTS;
3076 PL_compiling.op_private = cop->op_private;
3077 cop->op_next = (OP*)cop;
3080 cop->cop_label = label;
3081 PL_hints |= HINT_BLOCK_SCOPE;
3084 cop->cop_arybase = PL_curcop->cop_arybase;
3085 if (specialWARN(PL_curcop->cop_warnings))
3086 cop->cop_warnings = PL_curcop->cop_warnings ;
3088 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3091 if (PL_copline == NOLINE)
3092 cop->cop_line = PL_curcop->cop_line;
3094 cop->cop_line = PL_copline;
3095 PL_copline = NOLINE;
3097 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
3098 cop->cop_stash = PL_curstash;
3100 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3101 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
3102 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3103 (void)SvIOK_on(*svp);
3105 SvSTASH(*svp) = (HV*)cop;
3109 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3112 /* "Introduce" my variables to visible status. */
3120 if (! PL_min_intro_pending)
3121 return PL_cop_seqmax;
3123 svp = AvARRAY(PL_comppad_name);
3124 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3125 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3126 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3127 SvNVX(sv) = (NV)PL_cop_seqmax;
3130 PL_min_intro_pending = 0;
3131 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3132 return PL_cop_seqmax++;
3136 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3138 return new_logop(type, flags, &first, &other);
3142 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3147 OP *first = *firstp;
3148 OP *other = *otherp;
3150 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3151 return newBINOP(type, flags, scalar(first), scalar(other));
3153 scalarboolean(first);
3154 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3155 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3156 if (type == OP_AND || type == OP_OR) {
3162 first = *firstp = cUNOPo->op_first;
3164 first->op_next = o->op_next;
3165 cUNOPo->op_first = Nullop;
3169 if (first->op_type == OP_CONST) {
3170 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3171 Perl_warner(aTHX_ WARN_PRECEDENCE, "Probable precedence problem on %s",
3173 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3184 else if (first->op_type == OP_WANTARRAY) {
3190 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3191 OP *k1 = ((UNOP*)first)->op_first;
3192 OP *k2 = k1->op_sibling;
3194 switch (first->op_type)
3197 if (k2 && k2->op_type == OP_READLINE
3198 && (k2->op_flags & OPf_STACKED)
3199 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3200 warnop = k2->op_type;
3204 if (k1->op_type == OP_READDIR
3205 || k1->op_type == OP_GLOB
3206 || k1->op_type == OP_EACH)
3207 warnop = k1->op_type;
3211 line_t oldline = PL_curcop->cop_line;
3212 PL_curcop->cop_line = PL_copline;
3213 Perl_warner(aTHX_ WARN_UNSAFE,
3214 "Value of %s%s can be \"0\"; test with defined()",
3216 ((warnop == OP_READLINE || warnop == OP_GLOB)
3217 ? " construct" : "() operator"));
3218 PL_curcop->cop_line = oldline;
3225 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3226 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3228 NewOp(1101, logop, 1, LOGOP);
3230 logop->op_type = type;
3231 logop->op_ppaddr = PL_ppaddr[type];
3232 logop->op_first = first;
3233 logop->op_flags = flags | OPf_KIDS;
3234 logop->op_other = LINKLIST(other);
3235 logop->op_private = 1 | (flags >> 8);
3237 /* establish postfix order */
3238 logop->op_next = LINKLIST(first);
3239 first->op_next = (OP*)logop;
3240 first->op_sibling = other;
3242 o = newUNOP(OP_NULL, 0, (OP*)logop);
3249 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3257 return newLOGOP(OP_AND, 0, first, trueop);
3259 return newLOGOP(OP_OR, 0, first, falseop);
3261 scalarboolean(first);
3262 if (first->op_type == OP_CONST) {
3263 if (SvTRUE(((SVOP*)first)->op_sv)) {
3274 else if (first->op_type == OP_WANTARRAY) {
3278 NewOp(1101, logop, 1, LOGOP);
3279 logop->op_type = OP_COND_EXPR;
3280 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3281 logop->op_first = first;
3282 logop->op_flags = flags | OPf_KIDS;
3283 logop->op_private = 1 | (flags >> 8);
3284 logop->op_other = LINKLIST(trueop);
3285 logop->op_next = LINKLIST(falseop);
3288 /* establish postfix order */
3289 start = LINKLIST(first);
3290 first->op_next = (OP*)logop;
3292 first->op_sibling = trueop;
3293 trueop->op_sibling = falseop;
3294 o = newUNOP(OP_NULL, 0, (OP*)logop);
3296 trueop->op_next = falseop->op_next = o;
3303 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3312 NewOp(1101, range, 1, LOGOP);
3314 range->op_type = OP_RANGE;
3315 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3316 range->op_first = left;
3317 range->op_flags = OPf_KIDS;
3318 leftstart = LINKLIST(left);
3319 range->op_other = LINKLIST(right);
3320 range->op_private = 1 | (flags >> 8);
3322 left->op_sibling = right;
3324 range->op_next = (OP*)range;
3325 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3326 flop = newUNOP(OP_FLOP, 0, flip);
3327 o = newUNOP(OP_NULL, 0, flop);
3329 range->op_next = leftstart;
3331 left->op_next = flip;
3332 right->op_next = flop;
3334 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3335 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3336 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3337 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3339 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3340 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3343 if (!flip->op_private || !flop->op_private)
3344 linklist(o); /* blow off optimizer unless constant */
3350 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3355 int once = block && block->op_flags & OPf_SPECIAL &&
3356 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3359 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3360 return block; /* do {} while 0 does once */
3361 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3362 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3363 expr = newUNOP(OP_DEFINED, 0,
3364 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3365 } else if (expr->op_flags & OPf_KIDS) {
3366 OP *k1 = ((UNOP*)expr)->op_first;
3367 OP *k2 = (k1) ? k1->op_sibling : NULL;
3368 switch (expr->op_type) {
3370 if (k2 && k2->op_type == OP_READLINE
3371 && (k2->op_flags & OPf_STACKED)
3372 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3373 expr = newUNOP(OP_DEFINED, 0, expr);
3377 if (k1->op_type == OP_READDIR
3378 || k1->op_type == OP_GLOB
3379 || k1->op_type == OP_EACH)
3380 expr = newUNOP(OP_DEFINED, 0, expr);
3386 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3387 o = new_logop(OP_AND, 0, &expr, &listop);
3390 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3392 if (once && o != listop)
3393 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3396 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3398 o->op_flags |= flags;
3400 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3405 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3414 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3415 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3416 expr = newUNOP(OP_DEFINED, 0,
3417 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3418 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3419 OP *k1 = ((UNOP*)expr)->op_first;
3420 OP *k2 = (k1) ? k1->op_sibling : NULL;
3421 switch (expr->op_type) {
3423 if (k2 && k2->op_type == OP_READLINE
3424 && (k2->op_flags & OPf_STACKED)
3425 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3426 expr = newUNOP(OP_DEFINED, 0, expr);
3430 if (k1->op_type == OP_READDIR
3431 || k1->op_type == OP_GLOB
3432 || k1->op_type == OP_EACH)
3433 expr = newUNOP(OP_DEFINED, 0, expr);
3439 block = newOP(OP_NULL, 0);
3442 next = LINKLIST(cont);
3444 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3445 if ((line_t)whileline != NOLINE) {
3446 PL_copline = whileline;
3447 cont = append_elem(OP_LINESEQ, cont,
3448 newSTATEOP(0, Nullch, Nullop));
3452 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3453 redo = LINKLIST(listop);
3456 PL_copline = whileline;
3458 o = new_logop(OP_AND, 0, &expr, &listop);
3459 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3460 op_free(expr); /* oops, it's a while (0) */
3462 return Nullop; /* listop already freed by new_logop */
3465 ((LISTOP*)listop)->op_last->op_next = condop =
3466 (o == listop ? redo : LINKLIST(o));
3474 NewOp(1101,loop,1,LOOP);
3475 loop->op_type = OP_ENTERLOOP;
3476 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3477 loop->op_private = 0;
3478 loop->op_next = (OP*)loop;
3481 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3483 loop->op_redoop = redo;
3484 loop->op_lastop = o;
3487 loop->op_nextop = next;
3489 loop->op_nextop = o;
3491 o->op_flags |= flags;
3492 o->op_private |= (flags >> 8);
3497 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3506 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3507 sv->op_type = OP_RV2GV;
3508 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3510 else if (sv->op_type == OP_PADSV) { /* private variable */
3511 padoff = sv->op_targ;
3515 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3516 padoff = sv->op_targ;
3517 iterflags |= OPf_SPECIAL;
3522 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3526 padoff = find_threadsv("_");
3527 iterflags |= OPf_SPECIAL;
3529 sv = newGVOP(OP_GV, 0, PL_defgv);
3532 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3533 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3534 iterflags |= OPf_STACKED;
3536 else if (expr->op_type == OP_NULL &&
3537 (expr->op_flags & OPf_KIDS) &&
3538 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3540 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3541 * set the STACKED flag to indicate that these values are to be
3542 * treated as min/max values by 'pp_iterinit'.
3544 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3545 LOGOP* range = (LOGOP*) flip->op_first;
3546 OP* left = range->op_first;
3547 OP* right = left->op_sibling;
3550 range->op_flags &= ~OPf_KIDS;
3551 range->op_first = Nullop;
3553 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3554 listop->op_first->op_next = range->op_next;
3555 left->op_next = range->op_other;
3556 right->op_next = (OP*)listop;
3557 listop->op_next = listop->op_first;
3560 expr = (OP*)(listop);
3562 iterflags |= OPf_STACKED;
3565 expr = mod(force_list(expr), OP_GREPSTART);
3569 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3570 append_elem(OP_LIST, expr, scalar(sv))));
3571 assert(!loop->op_next);
3572 #ifdef PL_OP_SLAB_ALLOC
3573 NewOp(1234,tmp,1,LOOP);
3574 Copy(loop,tmp,1,LOOP);
3577 Renew(loop, 1, LOOP);
3579 loop->op_targ = padoff;
3580 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3581 PL_copline = forline;
3582 return newSTATEOP(0, label, wop);
3586 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3592 if (type != OP_GOTO || label->op_type == OP_CONST) {
3593 /* "last()" means "last" */
3594 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3595 o = newOP(type, OPf_SPECIAL);
3597 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3598 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3604 if (label->op_type == OP_ENTERSUB)
3605 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3606 o = newUNOP(type, OPf_STACKED, label);
3608 PL_hints |= HINT_BLOCK_SCOPE;
3613 Perl_cv_undef(pTHX_ CV *cv)
3618 MUTEX_DESTROY(CvMUTEXP(cv));
3619 Safefree(CvMUTEXP(cv));
3622 #endif /* USE_THREADS */
3624 if (!CvXSUB(cv) && CvROOT(cv)) {
3626 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3627 Perl_croak(aTHX_ "Can't undef active subroutine");
3630 Perl_croak(aTHX_ "Can't undef active subroutine");
3631 #endif /* USE_THREADS */
3634 SAVESPTR(PL_curpad);
3638 op_free(CvROOT(cv));
3639 CvROOT(cv) = Nullop;
3642 SvPOK_off((SV*)cv); /* forget prototype */
3644 SvREFCNT_dec(CvGV(cv));
3646 SvREFCNT_dec(CvOUTSIDE(cv));
3647 CvOUTSIDE(cv) = Nullcv;
3648 if (CvPADLIST(cv)) {
3649 /* may be during global destruction */
3650 if (SvREFCNT(CvPADLIST(cv))) {
3651 I32 i = AvFILLp(CvPADLIST(cv));
3653 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3654 SV* sv = svp ? *svp : Nullsv;
3657 if (sv == (SV*)PL_comppad_name)
3658 PL_comppad_name = Nullav;
3659 else if (sv == (SV*)PL_comppad) {
3660 PL_comppad = Nullav;
3661 PL_curpad = Null(SV**);
3665 SvREFCNT_dec((SV*)CvPADLIST(cv));
3667 CvPADLIST(cv) = Nullav;
3671 #ifdef DEBUG_CLOSURES
3675 CV *outside = CvOUTSIDE(cv);
3676 AV* padlist = CvPADLIST(cv);
3683 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3685 (CvANON(cv) ? "ANON"
3686 : (cv == PL_main_cv) ? "MAIN"
3687 : CvUNIQUE(cv) ? "UNIQUE"
3688 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3691 : CvANON(outside) ? "ANON"
3692 : (outside == PL_main_cv) ? "MAIN"
3693 : CvUNIQUE(outside) ? "UNIQUE"
3694 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3699 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3700 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3701 pname = AvARRAY(pad_name);
3702 ppad = AvARRAY(pad);
3704 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3705 if (SvPOK(pname[ix]))
3706 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3708 SvFAKE(pname[ix]) ? "FAKE " : "",
3710 (long)I_32(SvNVX(pname[ix])),
3711 (long)SvIVX(pname[ix]));
3714 #endif /* DEBUG_CLOSURES */
3717 S_cv_clone2(pTHX_ CV *proto, CV *outside)
3722 AV* protopadlist = CvPADLIST(proto);
3723 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3724 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3725 SV** pname = AvARRAY(protopad_name);
3726 SV** ppad = AvARRAY(protopad);
3727 I32 fname = AvFILLp(protopad_name);
3728 I32 fpad = AvFILLp(protopad);
3732 assert(!CvUNIQUE(proto));
3735 SAVESPTR(PL_curpad);
3736 SAVESPTR(PL_comppad);
3737 SAVESPTR(PL_comppad_name);
3738 SAVESPTR(PL_compcv);
3740 cv = PL_compcv = (CV*)NEWSV(1104,0);
3741 sv_upgrade((SV *)cv, SvTYPE(proto));
3747 New(666, CvMUTEXP(cv), 1, perl_mutex);
3748 MUTEX_INIT(CvMUTEXP(cv));
3750 #endif /* USE_THREADS */
3751 CvFILEGV(cv) = CvFILEGV(proto);
3752 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3753 CvSTASH(cv) = CvSTASH(proto);
3754 CvROOT(cv) = CvROOT(proto);
3755 CvSTART(cv) = CvSTART(proto);
3757 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3760 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3762 PL_comppad_name = newAV();
3763 for (ix = fname; ix >= 0; ix--)
3764 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3766 PL_comppad = newAV();
3768 comppadlist = newAV();
3769 AvREAL_off(comppadlist);
3770 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3771 av_store(comppadlist, 1, (SV*)PL_comppad);
3772 CvPADLIST(cv) = comppadlist;
3773 av_fill(PL_comppad, AvFILLp(protopad));
3774 PL_curpad = AvARRAY(PL_comppad);
3776 av = newAV(); /* will be @_ */
3778 av_store(PL_comppad, 0, (SV*)av);
3779 AvFLAGS(av) = AVf_REIFY;
3781 for (ix = fpad; ix > 0; ix--) {
3782 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3783 if (namesv && namesv != &PL_sv_undef) {
3784 char *name = SvPVX(namesv); /* XXX */
3785 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3786 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3787 CvOUTSIDE(cv), cxstack_ix, 0, 0);
3789 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3791 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
3793 else { /* our own lexical */
3796 /* anon code -- we'll come back for it */
3797 sv = SvREFCNT_inc(ppad[ix]);
3799 else if (*name == '@')
3801 else if (*name == '%')
3811 SV* sv = NEWSV(0,0);
3817 /* Now that vars are all in place, clone nested closures. */
3819 for (ix = fpad; ix > 0; ix--) {
3820 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3822 && namesv != &PL_sv_undef
3823 && !(SvFLAGS(namesv) & SVf_FAKE)
3824 && *SvPVX(namesv) == '&'
3825 && CvCLONE(ppad[ix]))
3827 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3828 SvREFCNT_dec(ppad[ix]);
3831 PL_curpad[ix] = (SV*)kid;
3835 #ifdef DEBUG_CLOSURES
3836 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3838 PerlIO_printf(Perl_debug_log, " from:\n");
3840 PerlIO_printf(Perl_debug_log, " to:\n");
3849 Perl_cv_clone(pTHX_ CV *proto)
3852 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3853 cv = cv_clone2(proto, CvOUTSIDE(proto));
3854 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3859 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
3863 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_UNSAFE)) {
3864 SV* msg = sv_newmortal();
3868 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3869 sv_setpv(msg, "Prototype mismatch:");
3871 Perl_sv_catpvf(aTHX_ msg, " sub %_", name);
3873 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
3874 sv_catpv(msg, " vs ");
3876 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
3878 sv_catpv(msg, "none");
3879 Perl_warner(aTHX_ WARN_UNSAFE, "%_", msg);
3884 Perl_cv_const_sv(pTHX_ CV *cv)
3886 if (!cv || !SvPOK(cv) || SvCUR(cv))
3888 return op_const_sv(CvSTART(cv), cv);
3892 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
3899 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3900 o = cLISTOPo->op_first->op_sibling;
3902 for (; o; o = o->op_next) {
3903 OPCODE type = o->op_type;
3905 if (sv && o->op_next == o)
3907 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3909 if (type == OP_LEAVESUB || type == OP_RETURN)
3913 if (type == OP_CONST)
3915 else if (type == OP_PADSV && cv) {
3916 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3917 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3918 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3930 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
3934 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3935 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3936 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3937 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3946 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3947 maximum a prototype before. */
3948 if (SvTYPE(gv) > SVt_NULL) {
3949 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
3950 && ckWARN_d(WARN_UNSAFE))
3952 Perl_warner(aTHX_ WARN_UNSAFE, "Runaway prototype");
3954 cv_ckproto((CV*)gv, NULL, ps);
3957 sv_setpv((SV*)gv, ps);
3959 sv_setiv((SV*)gv, -1);
3960 SvREFCNT_dec(PL_compcv);
3961 cv = PL_compcv = NULL;
3962 PL_sub_generation++;
3966 if (!name || GvCVGEN(gv))
3968 else if (cv = GvCV(gv)) {
3969 cv_ckproto(cv, gv, ps);
3970 /* already defined (or promised)? */
3971 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3973 bool const_changed = TRUE;
3975 /* just a "sub foo;" when &foo is already defined */
3976 SAVEFREESV(PL_compcv);
3979 /* ahem, death to those who redefine active sort subs */
3980 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3981 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
3982 if(const_sv = cv_const_sv(cv))
3983 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3984 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3985 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3986 && HvNAME(GvSTASH(CvGV(cv)))
3987 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3989 line_t oldline = PL_curcop->cop_line;
3990 PL_curcop->cop_line = PL_copline;
3991 Perl_warner(aTHX_ WARN_REDEFINE,
3992 const_sv ? "Constant subroutine %s redefined"
3993 : "Subroutine %s redefined", name);
3994 PL_curcop->cop_line = oldline;
4000 if (cv) { /* must reuse cv if autoloaded */
4002 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4003 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4004 CvOUTSIDE(PL_compcv) = 0;
4005 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4006 CvPADLIST(PL_compcv) = 0;
4007 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4008 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4009 SvREFCNT_dec(PL_compcv);
4016 PL_sub_generation++;
4019 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4020 CvFILEGV(cv) = PL_curcop->cop_filegv;
4021 CvSTASH(cv) = PL_curstash;
4024 if (!CvMUTEXP(cv)) {
4025 New(666, CvMUTEXP(cv), 1, perl_mutex);
4026 MUTEX_INIT(CvMUTEXP(cv));
4028 #endif /* USE_THREADS */
4031 sv_setpv((SV*)cv, ps);
4033 if (PL_error_count) {
4037 char *s = strrchr(name, ':');
4039 if (strEQ(s, "BEGIN")) {
4041 "BEGIN not safe after errors--compilation aborted";
4042 if (PL_in_eval & EVAL_KEEPERR)
4043 Perl_croak(aTHX_ not_safe);
4045 /* force display of errors found but not reported */
4046 sv_catpv(ERRSV, not_safe);
4047 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4054 PL_copline = NOLINE;
4059 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4060 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4063 SV **namep = AvARRAY(PL_comppad_name);
4064 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4067 if (SvIMMORTAL(PL_curpad[ix]))
4070 * The only things that a clonable function needs in its
4071 * pad are references to outer lexicals and anonymous subs.
4072 * The rest are created anew during cloning.
4074 if (!((namesv = namep[ix]) != Nullsv &&
4075 namesv != &PL_sv_undef &&
4077 *SvPVX(namesv) == '&')))
4079 SvREFCNT_dec(PL_curpad[ix]);
4080 PL_curpad[ix] = Nullsv;
4085 AV *av = newAV(); /* Will be @_ */
4087 av_store(PL_comppad, 0, (SV*)av);
4088 AvFLAGS(av) = AVf_REIFY;
4090 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4091 if (SvIMMORTAL(PL_curpad[ix]))
4093 if (!SvPADMY(PL_curpad[ix]))
4094 SvPADTMP_on(PL_curpad[ix]);
4098 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4099 CvSTART(cv) = LINKLIST(CvROOT(cv));
4100 CvROOT(cv)->op_next = 0;
4106 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4107 SV *sv = NEWSV(0,0);
4108 SV *tmpstr = sv_newmortal();
4109 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4113 Perl_sv_setpvf(aTHX_ sv, "%_:%ld-%ld",
4114 GvSV(PL_curcop->cop_filegv),
4115 (long)PL_subline, (long)PL_curcop->cop_line);
4116 gv_efullname3(tmpstr, gv, Nullch);
4117 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4118 hv = GvHVn(db_postponed);
4119 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4120 && (cv = GvCV(db_postponed))) {
4125 call_sv((SV*)cv, G_DISCARD);
4129 if ((s = strrchr(name,':')))
4133 if (strEQ(s, "BEGIN")) {
4134 I32 oldscope = PL_scopestack_ix;
4136 SAVESPTR(PL_compiling.cop_filegv);
4137 SAVEI16(PL_compiling.cop_line);
4139 sv_setsv(PL_rs, PL_nrs);
4142 PL_beginav = newAV();
4143 DEBUG_x( dump_sub(gv) );
4144 av_push(PL_beginav, (SV *)cv);
4146 call_list(oldscope, PL_beginav);
4148 PL_curcop = &PL_compiling;
4149 PL_compiling.op_private = PL_hints;
4152 else if (strEQ(s, "END") && !PL_error_count) {
4155 av_unshift(PL_endav, 1);
4156 av_store(PL_endav, 0, (SV *)cv);
4159 else if (strEQ(s, "INIT") && !PL_error_count) {
4161 PL_initav = newAV();
4162 av_push(PL_initav, SvREFCNT_inc(cv));
4168 PL_copline = NOLINE;
4173 /* XXX unsafe for threads if eval_owner isn't held */
4175 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4178 U32 oldhints = PL_hints;
4179 HV *old_cop_stash = PL_curcop->cop_stash;
4180 HV *old_curstash = PL_curstash;
4181 line_t oldline = PL_curcop->cop_line;
4182 PL_curcop->cop_line = PL_copline;
4184 PL_hints &= ~HINT_BLOCK_SCOPE;
4186 PL_curstash = PL_curcop->cop_stash = stash;
4189 start_subparse(FALSE, 0),
4190 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4191 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4192 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4195 PL_hints = oldhints;
4196 PL_curcop->cop_stash = old_cop_stash;
4197 PL_curstash = old_curstash;
4198 PL_curcop->cop_line = oldline;
4202 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4205 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4208 if (cv = (name ? GvCV(gv) : Nullcv)) {
4210 /* just a cached method */
4214 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4215 /* already defined (or promised) */
4216 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4217 && HvNAME(GvSTASH(CvGV(cv)))
4218 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4219 line_t oldline = PL_curcop->cop_line;
4220 if (PL_copline != NOLINE)
4221 PL_curcop->cop_line = PL_copline;
4222 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4223 PL_curcop->cop_line = oldline;
4230 if (cv) /* must reuse cv if autoloaded */
4233 cv = (CV*)NEWSV(1105,0);
4234 sv_upgrade((SV *)cv, SVt_PVCV);
4238 PL_sub_generation++;
4241 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4243 New(666, CvMUTEXP(cv), 1, perl_mutex);
4244 MUTEX_INIT(CvMUTEXP(cv));
4246 #endif /* USE_THREADS */
4247 CvFILEGV(cv) = gv_fetchfile(filename);
4248 CvXSUB(cv) = subaddr;
4251 char *s = strrchr(name,':');
4256 if (strEQ(s, "BEGIN")) {
4258 PL_beginav = newAV();
4259 av_push(PL_beginav, (SV *)cv);
4262 else if (strEQ(s, "END")) {
4265 av_unshift(PL_endav, 1);
4266 av_store(PL_endav, 0, (SV *)cv);
4269 else if (strEQ(s, "INIT")) {
4271 PL_initav = newAV();
4272 av_push(PL_initav, (SV *)cv);
4283 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4293 name = SvPVx(cSVOPo->op_sv, n_a);
4296 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4298 if (cv = GvFORM(gv)) {
4299 if (ckWARN(WARN_REDEFINE)) {
4300 line_t oldline = PL_curcop->cop_line;
4302 PL_curcop->cop_line = PL_copline;
4303 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4304 PL_curcop->cop_line = oldline;
4310 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4311 CvFILEGV(cv) = PL_curcop->cop_filegv;
4313 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4314 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4315 SvPADTMP_on(PL_curpad[ix]);
4318 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4319 CvSTART(cv) = LINKLIST(CvROOT(cv));
4320 CvROOT(cv)->op_next = 0;
4323 PL_copline = NOLINE;
4328 Perl_newANONLIST(pTHX_ OP *o)
4330 return newUNOP(OP_REFGEN, 0,
4331 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4335 Perl_newANONHASH(pTHX_ OP *o)
4337 return newUNOP(OP_REFGEN, 0,
4338 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4342 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4344 return newUNOP(OP_REFGEN, 0,
4345 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4349 Perl_oopsAV(pTHX_ OP *o)
4351 switch (o->op_type) {
4353 o->op_type = OP_PADAV;
4354 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4355 return ref(o, OP_RV2AV);
4358 o->op_type = OP_RV2AV;
4359 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4364 if (ckWARN_d(WARN_INTERNAL))
4365 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4372 Perl_oopsHV(pTHX_ OP *o)
4376 switch (o->op_type) {
4379 o->op_type = OP_PADHV;
4380 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4381 return ref(o, OP_RV2HV);
4385 o->op_type = OP_RV2HV;
4386 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4391 if (ckWARN_d(WARN_INTERNAL))
4392 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
4399 Perl_newAVREF(pTHX_ OP *o)
4401 if (o->op_type == OP_PADANY) {
4402 o->op_type = OP_PADAV;
4403 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4406 return newUNOP(OP_RV2AV, 0, scalar(o));
4410 Perl_newGVREF(pTHX_ I32 type, OP *o)
4412 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4413 return newUNOP(OP_NULL, 0, o);
4414 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4418 Perl_newHVREF(pTHX_ OP *o)
4420 if (o->op_type == OP_PADANY) {
4421 o->op_type = OP_PADHV;
4422 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4425 return newUNOP(OP_RV2HV, 0, scalar(o));
4429 Perl_oopsCV(pTHX_ OP *o)
4431 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4437 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4439 return newUNOP(OP_RV2CV, flags, scalar(o));
4443 Perl_newSVREF(pTHX_ OP *o)
4445 if (o->op_type == OP_PADANY) {
4446 o->op_type = OP_PADSV;
4447 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4450 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4451 o->op_flags |= OPpDONE_SVREF;
4454 return newUNOP(OP_RV2SV, 0, scalar(o));
4457 /* Check routines. */
4460 Perl_ck_anoncode(pTHX_ OP *o)
4465 name = NEWSV(1106,0);
4466 sv_upgrade(name, SVt_PVNV);
4467 sv_setpvn(name, "&", 1);
4470 ix = pad_alloc(o->op_type, SVs_PADMY);
4471 av_store(PL_comppad_name, ix, name);
4472 av_store(PL_comppad, ix, cSVOPo->op_sv);
4473 SvPADMY_on(cSVOPo->op_sv);
4474 cSVOPo->op_sv = Nullsv;
4475 cSVOPo->op_targ = ix;
4480 Perl_ck_bitop(pTHX_ OP *o)
4482 o->op_private = PL_hints;
4487 Perl_ck_concat(pTHX_ OP *o)
4489 if (cUNOPo->op_first->op_type == OP_CONCAT)
4490 o->op_flags |= OPf_STACKED;
4495 Perl_ck_spair(pTHX_ OP *o)
4497 if (o->op_flags & OPf_KIDS) {
4500 OPCODE type = o->op_type;
4501 o = modkids(ck_fun(o), type);
4502 kid = cUNOPo->op_first;
4503 newop = kUNOP->op_first->op_sibling;
4505 (newop->op_sibling ||
4506 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4507 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4508 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4512 op_free(kUNOP->op_first);
4513 kUNOP->op_first = newop;
4515 o->op_ppaddr = PL_ppaddr[++o->op_type];
4520 Perl_ck_delete(pTHX_ OP *o)
4524 if (o->op_flags & OPf_KIDS) {
4525 OP *kid = cUNOPo->op_first;
4526 if (kid->op_type == OP_HSLICE)
4527 o->op_private |= OPpSLICE;
4528 else if (kid->op_type != OP_HELEM)
4529 Perl_croak(aTHX_ "%s argument is not a HASH element or slice",
4530 PL_op_desc[o->op_type]);
4537 Perl_ck_eof(pTHX_ OP *o)
4539 I32 type = o->op_type;
4541 if (o->op_flags & OPf_KIDS) {
4542 if (cLISTOPo->op_first->op_type == OP_STUB) {
4544 o = newUNOP(type, OPf_SPECIAL,
4545 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4553 Perl_ck_eval(pTHX_ OP *o)
4555 PL_hints |= HINT_BLOCK_SCOPE;
4556 if (o->op_flags & OPf_KIDS) {
4557 SVOP *kid = (SVOP*)cUNOPo->op_first;
4560 o->op_flags &= ~OPf_KIDS;
4563 else if (kid->op_type == OP_LINESEQ) {
4566 kid->op_next = o->op_next;
4567 cUNOPo->op_first = 0;
4570 NewOp(1101, enter, 1, LOGOP);
4571 enter->op_type = OP_ENTERTRY;
4572 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4573 enter->op_private = 0;
4575 /* establish postfix order */
4576 enter->op_next = (OP*)enter;
4578 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4579 o->op_type = OP_LEAVETRY;
4580 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4581 enter->op_other = o;
4589 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4591 o->op_targ = (PADOFFSET)PL_hints;
4596 Perl_ck_exec(pTHX_ OP *o)
4599 if (o->op_flags & OPf_STACKED) {
4601 kid = cUNOPo->op_first->op_sibling;
4602 if (kid->op_type == OP_RV2GV)
4611 Perl_ck_exists(pTHX_ OP *o)
4614 if (o->op_flags & OPf_KIDS) {
4615 OP *kid = cUNOPo->op_first;
4616 if (kid->op_type != OP_HELEM)
4617 Perl_croak(aTHX_ "%s argument is not a HASH element", PL_op_desc[o->op_type]);
4625 Perl_ck_gvconst(pTHX_ register OP *o)
4627 o = fold_constants(o);
4628 if (o->op_type == OP_CONST)
4635 Perl_ck_rvconst(pTHX_ register OP *o)
4638 SVOP *kid = (SVOP*)cUNOPo->op_first;
4640 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4641 if (kid->op_type == OP_CONST) {
4645 SV *kidsv = kid->op_sv;
4648 /* Is it a constant from cv_const_sv()? */
4649 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4650 SV *rsv = SvRV(kidsv);
4651 int svtype = SvTYPE(rsv);
4652 char *badtype = Nullch;
4654 switch (o->op_type) {
4656 if (svtype > SVt_PVMG)
4657 badtype = "a SCALAR";
4660 if (svtype != SVt_PVAV)
4661 badtype = "an ARRAY";
4664 if (svtype != SVt_PVHV) {
4665 if (svtype == SVt_PVAV) { /* pseudohash? */
4666 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4667 if (ksv && SvROK(*ksv)
4668 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4677 if (svtype != SVt_PVCV)
4682 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
4685 name = SvPV(kidsv, n_a);
4686 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4687 char *badthing = Nullch;
4688 switch (o->op_type) {
4690 badthing = "a SCALAR";
4693 badthing = "an ARRAY";
4696 badthing = "a HASH";
4701 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4705 * This is a little tricky. We only want to add the symbol if we
4706 * didn't add it in the lexer. Otherwise we get duplicate strict
4707 * warnings. But if we didn't add it in the lexer, we must at
4708 * least pretend like we wanted to add it even if it existed before,
4709 * or we get possible typo warnings. OPpCONST_ENTERED says
4710 * whether the lexer already added THIS instance of this symbol.
4712 iscv = (o->op_type == OP_RV2CV) * 2;
4714 gv = gv_fetchpv(name,
4715 iscv | !(kid->op_private & OPpCONST_ENTERED),
4718 : o->op_type == OP_RV2SV
4720 : o->op_type == OP_RV2AV
4722 : o->op_type == OP_RV2HV
4725 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4727 kid->op_type = OP_GV;
4728 SvREFCNT_dec(kid->op_sv);
4729 kid->op_sv = SvREFCNT_inc(gv);
4730 kid->op_ppaddr = PL_ppaddr[OP_GV];
4737 Perl_ck_ftst(pTHX_ OP *o)
4740 I32 type = o->op_type;
4742 if (o->op_flags & OPf_REF)
4745 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4746 SVOP *kid = (SVOP*)cUNOPo->op_first;
4748 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4750 OP *newop = newGVOP(type, OPf_REF,
4751 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4758 if (type == OP_FTTTY)
4759 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4762 return newUNOP(type, 0, newDEFSVOP());
4768 Perl_ck_fun(pTHX_ OP *o)
4775 int type = o->op_type;
4776 register I32 oa = PL_opargs[type] >> OASHIFT;
4778 if (o->op_flags & OPf_STACKED) {
4779 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4782 return no_fh_allowed(o);
4785 if (o->op_flags & OPf_KIDS) {
4787 tokid = &cLISTOPo->op_first;
4788 kid = cLISTOPo->op_first;
4789 if (kid->op_type == OP_PUSHMARK ||
4790 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4792 tokid = &kid->op_sibling;
4793 kid = kid->op_sibling;
4795 if (!kid && PL_opargs[type] & OA_DEFGV)
4796 *tokid = kid = newDEFSVOP();
4800 sibl = kid->op_sibling;
4803 /* list seen where single (scalar) arg expected? */
4804 if (numargs == 1 && !(oa >> 4)
4805 && kid->op_type == OP_LIST && type != OP_SCALAR)
4807 return too_many_arguments(o,PL_op_desc[type]);
4820 if (kid->op_type == OP_CONST &&
4821 (kid->op_private & OPpCONST_BARE))
4823 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4824 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4825 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4826 if (ckWARN(WARN_SYNTAX))
4827 Perl_warner(aTHX_ WARN_SYNTAX,
4828 "Array @%s missing the @ in argument %ld of %s()",
4829 name, (long)numargs, PL_op_desc[type]);
4832 kid->op_sibling = sibl;
4835 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4836 bad_type(numargs, "array", PL_op_desc[type], kid);
4840 if (kid->op_type == OP_CONST &&
4841 (kid->op_private & OPpCONST_BARE))
4843 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4844 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4845 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4846 if (ckWARN(WARN_SYNTAX))
4847 Perl_warner(aTHX_ WARN_SYNTAX,
4848 "Hash %%%s missing the %% in argument %ld of %s()",
4849 name, (long)numargs, PL_op_desc[type]);
4852 kid->op_sibling = sibl;
4855 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4856 bad_type(numargs, "hash", PL_op_desc[type], kid);
4861 OP *newop = newUNOP(OP_NULL, 0, kid);
4862 kid->op_sibling = 0;
4864 newop->op_next = newop;
4866 kid->op_sibling = sibl;
4871 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4872 if (kid->op_type == OP_CONST &&
4873 (kid->op_private & OPpCONST_BARE))
4875 OP *newop = newGVOP(OP_GV, 0,
4876 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4881 else if (kid->op_type == OP_READLINE) {
4882 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4883 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4886 I32 flags = OPf_SPECIAL;
4888 /* is this op a FH constructor? */
4889 if (is_handle_constructor(o,numargs)) {
4891 /* Set a flag to tell rv2gv to vivify
4892 * need to "prove" flag does not mean something
4893 * else already - NI-S 1999/05/07
4897 /* Helps with open($array[$n],...)
4898 but is too simplistic - need to do selectively
4903 kid->op_sibling = 0;
4904 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
4906 kid->op_private |= priv;
4909 kid->op_sibling = sibl;
4915 mod(scalar(kid), type);
4919 tokid = &kid->op_sibling;
4920 kid = kid->op_sibling;
4922 o->op_private |= numargs;
4924 return too_many_arguments(o,PL_op_desc[o->op_type]);
4927 else if (PL_opargs[type] & OA_DEFGV) {
4929 return newUNOP(type, 0, newDEFSVOP());
4933 while (oa & OA_OPTIONAL)
4935 if (oa && oa != OA_LIST)
4936 return too_few_arguments(o,PL_op_desc[o->op_type]);
4942 Perl_ck_glob(pTHX_ OP *o)
4946 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4947 append_elem(OP_GLOB, o, newDEFSVOP());
4949 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4950 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4952 if (gv && GvIMPORTED_CV(gv)) {
4953 append_elem(OP_GLOB, o,
4954 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
4955 o->op_type = OP_LIST;
4956 o->op_ppaddr = PL_ppaddr[OP_LIST];
4957 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4958 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4959 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4960 append_elem(OP_LIST, o,
4961 scalar(newUNOP(OP_RV2CV, 0,
4962 newGVOP(OP_GV, 0, gv)))));
4963 o = newUNOP(OP_NULL, 0, ck_subr(o));
4964 o->op_targ = OP_GLOB; /* hint at what it used to be */
4967 gv = newGVgen("main");
4969 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4975 Perl_ck_grep(pTHX_ OP *o)
4979 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4981 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4982 NewOp(1101, gwop, 1, LOGOP);
4984 if (o->op_flags & OPf_STACKED) {
4987 kid = cLISTOPo->op_first->op_sibling;
4988 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4991 kid->op_next = (OP*)gwop;
4992 o->op_flags &= ~OPf_STACKED;
4994 kid = cLISTOPo->op_first->op_sibling;
4995 if (type == OP_MAPWHILE)
5002 kid = cLISTOPo->op_first->op_sibling;
5003 if (kid->op_type != OP_NULL)
5004 Perl_croak(aTHX_ "panic: ck_grep");
5005 kid = kUNOP->op_first;
5007 gwop->op_type = type;
5008 gwop->op_ppaddr = PL_ppaddr[type];
5009 gwop->op_first = listkids(o);
5010 gwop->op_flags |= OPf_KIDS;
5011 gwop->op_private = 1;
5012 gwop->op_other = LINKLIST(kid);
5013 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5014 kid->op_next = (OP*)gwop;
5016 kid = cLISTOPo->op_first->op_sibling;
5017 if (!kid || !kid->op_sibling)
5018 return too_few_arguments(o,PL_op_desc[o->op_type]);
5019 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5020 mod(kid, OP_GREPSTART);
5026 Perl_ck_index(pTHX_ OP *o)
5028 if (o->op_flags & OPf_KIDS) {
5029 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5031 kid = kid->op_sibling; /* get past "big" */
5032 if (kid && kid->op_type == OP_CONST)
5033 fbm_compile(((SVOP*)kid)->op_sv, 0);
5039 Perl_ck_lengthconst(pTHX_ OP *o)
5041 /* XXX length optimization goes here */
5046 Perl_ck_lfun(pTHX_ OP *o)
5048 OPCODE type = o->op_type;
5049 return modkids(ck_fun(o), type);
5053 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5056 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5057 switch (cUNOPo->op_first->op_type) {
5060 case OP_AASSIGN: /* Is this a good idea? */
5061 Perl_warner(aTHX_ WARN_DEPRECATED,
5062 "defined(@array) is deprecated");
5063 Perl_warner(aTHX_ WARN_DEPRECATED,
5064 "(Maybe you should just omit the defined()?)\n");
5068 Perl_warner(aTHX_ WARN_DEPRECATED,
5069 "defined(%hash) is deprecated");
5070 Perl_warner(aTHX_ WARN_DEPRECATED,
5071 "(Maybe you should just omit the defined()?)\n");
5082 Perl_ck_rfun(pTHX_ OP *o)
5084 OPCODE type = o->op_type;
5085 return refkids(ck_fun(o), type);
5089 Perl_ck_listiob(pTHX_ OP *o)
5093 kid = cLISTOPo->op_first;
5096 kid = cLISTOPo->op_first;
5098 if (kid->op_type == OP_PUSHMARK)
5099 kid = kid->op_sibling;
5100 if (kid && o->op_flags & OPf_STACKED)
5101 kid = kid->op_sibling;
5102 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5103 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5104 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5105 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5106 cLISTOPo->op_first->op_sibling = kid;
5107 cLISTOPo->op_last = kid;
5108 kid = kid->op_sibling;
5113 append_elem(o->op_type, o, newDEFSVOP());
5119 if (PL_hints & HINT_LOCALE)
5120 o->op_private |= OPpLOCALE;
5127 Perl_ck_fun_locale(pTHX_ OP *o)
5133 if (PL_hints & HINT_LOCALE)
5134 o->op_private |= OPpLOCALE;
5141 Perl_ck_sassign(pTHX_ OP *o)
5143 OP *kid = cLISTOPo->op_first;
5144 /* has a disposable target? */
5145 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5146 && !(kid->op_flags & OPf_STACKED))
5148 OP *kkid = kid->op_sibling;
5150 /* Can just relocate the target. */
5151 if (kkid && kkid->op_type == OP_PADSV) {
5152 /* Concat has problems if target is equal to right arg. */
5153 if (kid->op_type == OP_CONCAT
5154 && kLISTOP->op_first->op_sibling->op_type == OP_PADSV
5155 && kLISTOP->op_first->op_sibling->op_targ == kkid->op_targ)
5159 kid->op_targ = kkid->op_targ;
5160 /* Now we do not need PADSV and SASSIGN. */
5161 kid->op_sibling = o->op_sibling; /* NULL */
5162 cLISTOPo->op_first = NULL;
5165 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5173 Perl_ck_scmp(pTHX_ OP *o)
5177 if (PL_hints & HINT_LOCALE)
5178 o->op_private |= OPpLOCALE;
5185 Perl_ck_match(pTHX_ OP *o)
5187 o->op_private |= OPpRUNTIME;
5192 Perl_ck_null(pTHX_ OP *o)
5198 Perl_ck_repeat(pTHX_ OP *o)
5200 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5201 o->op_private |= OPpREPEAT_DOLIST;
5202 cBINOPo->op_first = force_list(cBINOPo->op_first);
5210 Perl_ck_require(pTHX_ OP *o)
5212 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5213 SVOP *kid = (SVOP*)cUNOPo->op_first;
5215 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5217 for (s = SvPVX(kid->op_sv); *s; s++) {
5218 if (*s == ':' && s[1] == ':') {
5220 Move(s+2, s+1, strlen(s+2)+1, char);
5221 --SvCUR(kid->op_sv);
5224 sv_catpvn(kid->op_sv, ".pm", 3);
5232 Perl_ck_retarget(pTHX_ OP *o)
5234 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5241 Perl_ck_select(pTHX_ OP *o)
5244 if (o->op_flags & OPf_KIDS) {
5245 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5246 if (kid && kid->op_sibling) {
5247 o->op_type = OP_SSELECT;
5248 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5250 return fold_constants(o);
5254 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5255 if (kid && kid->op_type == OP_RV2GV)
5256 kid->op_private &= ~HINT_STRICT_REFS;
5261 Perl_ck_shift(pTHX_ OP *o)
5263 I32 type = o->op_type;
5265 if (!(o->op_flags & OPf_KIDS)) {
5270 if (!CvUNIQUE(PL_compcv)) {
5271 argop = newOP(OP_PADAV, OPf_REF);
5272 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5275 argop = newUNOP(OP_RV2AV, 0,
5276 scalar(newGVOP(OP_GV, 0,
5277 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5280 argop = newUNOP(OP_RV2AV, 0,
5281 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5282 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5283 #endif /* USE_THREADS */
5284 return newUNOP(type, 0, scalar(argop));
5286 return scalar(modkids(ck_fun(o), type));
5290 Perl_ck_sort(pTHX_ OP *o)
5294 if (PL_hints & HINT_LOCALE)
5295 o->op_private |= OPpLOCALE;
5298 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5300 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5301 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5303 kid = kUNOP->op_first; /* get past null */
5305 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5307 if (kid->op_type == OP_SCOPE) {
5311 else if (kid->op_type == OP_LEAVE) {
5312 if (o->op_type == OP_SORT) {
5313 null(kid); /* wipe out leave */
5316 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5317 if (k->op_next == kid)
5322 kid->op_next = 0; /* just disconnect the leave */
5323 k = kLISTOP->op_first;
5327 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5328 if (o->op_type == OP_SORT)
5332 o->op_flags |= OPf_SPECIAL;
5334 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5335 null(cLISTOPo->op_first->op_sibling);
5342 S_simplify_sort(pTHX_ OP *o)
5345 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5348 if (!(o->op_flags & OPf_STACKED))
5350 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5351 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5352 kid = kUNOP->op_first; /* get past null */
5353 if (kid->op_type != OP_SCOPE)
5355 kid = kLISTOP->op_last; /* get past scope */
5356 switch(kid->op_type) {
5364 k = kid; /* remember this node*/
5365 if (kBINOP->op_first->op_type != OP_RV2SV)
5367 kid = kBINOP->op_first; /* get past cmp */
5368 if (kUNOP->op_first->op_type != OP_GV)
5370 kid = kUNOP->op_first; /* get past rv2sv */
5371 if (GvSTASH(kGVOP->op_gv) != PL_curstash)
5373 if (strEQ(GvNAME(kGVOP->op_gv), "a"))
5375 else if(strEQ(GvNAME(kGVOP->op_gv), "b"))
5379 kid = k; /* back to cmp */
5380 if (kBINOP->op_last->op_type != OP_RV2SV)
5382 kid = kBINOP->op_last; /* down to 2nd arg */
5383 if (kUNOP->op_first->op_type != OP_GV)
5385 kid = kUNOP->op_first; /* get past rv2sv */
5386 if (GvSTASH(kGVOP->op_gv) != PL_curstash
5388 ? strNE(GvNAME(kGVOP->op_gv), "a")
5389 : strNE(GvNAME(kGVOP->op_gv), "b")))
5391 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5393 o->op_private |= OPpSORT_REVERSE;
5394 if (k->op_type == OP_NCMP)
5395 o->op_private |= OPpSORT_NUMERIC;
5396 if (k->op_type == OP_I_NCMP)
5397 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5398 op_free(cLISTOPo->op_first->op_sibling); /* delete comparison block */
5399 cLISTOPo->op_first->op_sibling = cLISTOPo->op_last;
5400 cLISTOPo->op_children = 1;
5404 Perl_ck_split(pTHX_ OP *o)
5408 if (o->op_flags & OPf_STACKED)
5409 return no_fh_allowed(o);
5411 kid = cLISTOPo->op_first;
5412 if (kid->op_type != OP_NULL)
5413 Perl_croak(aTHX_ "panic: ck_split");
5414 kid = kid->op_sibling;
5415 op_free(cLISTOPo->op_first);
5416 cLISTOPo->op_first = kid;
5418 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5419 cLISTOPo->op_last = kid; /* There was only one element previously */
5422 if (kid->op_type != OP_MATCH) {
5423 OP *sibl = kid->op_sibling;
5424 kid->op_sibling = 0;
5425 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5426 if (cLISTOPo->op_first == cLISTOPo->op_last)
5427 cLISTOPo->op_last = kid;
5428 cLISTOPo->op_first = kid;
5429 kid->op_sibling = sibl;
5432 kid->op_type = OP_PUSHRE;
5433 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5436 if (!kid->op_sibling)
5437 append_elem(OP_SPLIT, o, newDEFSVOP());
5439 kid = kid->op_sibling;
5442 if (!kid->op_sibling)
5443 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5445 kid = kid->op_sibling;
5448 if (kid->op_sibling)
5449 return too_many_arguments(o,PL_op_desc[o->op_type]);
5455 Perl_ck_subr(pTHX_ OP *o)
5458 OP *prev = ((cUNOPo->op_first->op_sibling)
5459 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5460 OP *o2 = prev->op_sibling;
5469 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5470 if (cvop->op_type == OP_RV2CV) {
5472 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5473 null(cvop); /* disable rv2cv */
5474 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5475 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
5476 cv = GvCVu(tmpop->op_sv);
5478 tmpop->op_private |= OPpEARLY_CV;
5479 else if (SvPOK(cv)) {
5480 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5481 proto = SvPV((SV*)cv, n_a);
5485 else if (cvop->op_type == OP_METHOD) {
5486 if (o2->op_type == OP_CONST)
5487 o2->op_private &= ~OPpCONST_STRICT;
5488 else if (o2->op_type == OP_LIST) {
5489 OP *o = ((UNOP*)o2)->op_first->op_sibling;
5490 if (o && o->op_type == OP_CONST)
5491 o->op_private &= ~OPpCONST_STRICT;
5494 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5495 if (PERLDB_SUB && PL_curstash != PL_debstash)
5496 o->op_private |= OPpENTERSUB_DB;
5497 while (o2 != cvop) {
5501 return too_many_arguments(o, gv_ename(namegv));
5519 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5520 bad_type(arg, "block", gv_ename(namegv), o2);
5523 /* '*' allows any scalar type, including bareword */
5526 if (o2->op_type == OP_RV2GV)
5527 goto wrapref; /* autoconvert GLOB -> GLOBref */
5528 else if (o2->op_type == OP_CONST)
5529 o2->op_private &= ~OPpCONST_STRICT;
5530 else if (o2->op_type == OP_ENTERSUB) {
5531 /* accidental subroutine, revert to bareword */
5532 OP *gvop = ((UNOP*)o2)->op_first;
5533 if (gvop && gvop->op_type == OP_NULL) {
5534 gvop = ((UNOP*)gvop)->op_first;
5536 for (; gvop->op_sibling; gvop = gvop->op_sibling)
5539 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
5540 (gvop = ((UNOP*)gvop)->op_first) &&
5541 gvop->op_type == OP_GV)
5543 GV *gv = (GV*)((SVOP*)gvop)->op_sv;
5544 OP *sibling = o2->op_sibling;
5545 SV *n = newSVpvn("",0);
5547 gv_fullname3(n, gv, "");
5548 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
5549 sv_chop(n, SvPVX(n)+6);
5550 o2 = newSVOP(OP_CONST, 0, n);
5551 prev->op_sibling = o2;
5552 o2->op_sibling = sibling;
5564 if (o2->op_type != OP_RV2GV)
5565 bad_type(arg, "symbol", gv_ename(namegv), o2);
5568 if (o2->op_type != OP_RV2CV)
5569 bad_type(arg, "sub", gv_ename(namegv), o2);
5572 if (o2->op_type != OP_RV2SV
5573 && o2->op_type != OP_PADSV
5574 && o2->op_type != OP_HELEM
5575 && o2->op_type != OP_AELEM
5576 && o2->op_type != OP_THREADSV)
5578 bad_type(arg, "scalar", gv_ename(namegv), o2);
5582 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5583 bad_type(arg, "array", gv_ename(namegv), o2);
5586 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5587 bad_type(arg, "hash", gv_ename(namegv), o2);
5591 OP* sib = kid->op_sibling;
5592 kid->op_sibling = 0;
5593 o2 = newUNOP(OP_REFGEN, 0, kid);
5594 o2->op_sibling = sib;
5595 prev->op_sibling = o2;
5606 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
5607 gv_ename(namegv), SvPV((SV*)cv, n_a));
5612 mod(o2, OP_ENTERSUB);
5614 o2 = o2->op_sibling;
5616 if (proto && !optional &&
5617 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5618 return too_few_arguments(o, gv_ename(namegv));
5623 Perl_ck_svconst(pTHX_ OP *o)
5625 SvREADONLY_on(cSVOPo->op_sv);
5630 Perl_ck_trunc(pTHX_ OP *o)
5632 if (o->op_flags & OPf_KIDS) {
5633 SVOP *kid = (SVOP*)cUNOPo->op_first;
5635 if (kid->op_type == OP_NULL)
5636 kid = (SVOP*)kid->op_sibling;
5637 if (kid && kid->op_type == OP_CONST &&
5638 (kid->op_private & OPpCONST_BARE))
5640 o->op_flags |= OPf_SPECIAL;
5641 kid->op_private &= ~OPpCONST_STRICT;
5647 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5650 Perl_peep(pTHX_ register OP *o)
5653 register OP* oldop = 0;
5656 if (!o || o->op_seq)
5660 SAVESPTR(PL_curcop);
5661 for (; o; o = o->op_next) {
5667 switch (o->op_type) {
5671 PL_curcop = ((COP*)o); /* for warnings */
5672 o->op_seq = PL_op_seqmax++;
5676 if (cSVOPo->op_private & OPpCONST_STRICT)
5677 no_bareword_allowed(o);
5683 if ( o->op_next && o->op_next->op_type == OP_STRINGIFY
5684 && !(o->op_next->op_private & OPpTARGET_MY) )
5686 o->op_seq = PL_op_seqmax++;
5691 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
5692 if (o->op_next->op_private & OPpTARGET_MY) {
5693 if ((o->op_flags & OPf_STACKED) /* chained concats */
5694 || (o->op_type == OP_CONCAT
5695 /* Concat has problems if target is equal to right arg. */
5696 && (((LISTOP*)o)->op_first->op_sibling->op_type
5698 && (((LISTOP*)o)->op_first->op_sibling->op_targ
5699 == o->op_next->op_targ))) {
5700 goto ignore_optimization;
5702 o->op_targ = o->op_next->op_targ;
5707 ignore_optimization:
5708 o->op_seq = PL_op_seqmax++;
5711 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5712 o->op_seq = PL_op_seqmax++;
5713 break; /* Scalar stub must produce undef. List stub is noop */
5717 if (o->op_targ == OP_NEXTSTATE
5718 || o->op_targ == OP_DBSTATE
5719 || o->op_targ == OP_SETSTATE)
5721 PL_curcop = ((COP*)o);
5728 if (oldop && o->op_next) {
5729 oldop->op_next = o->op_next;
5732 o->op_seq = PL_op_seqmax++;
5736 if (o->op_next->op_type == OP_RV2SV) {
5737 if (!(o->op_next->op_private & OPpDEREF)) {
5739 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5740 o->op_next = o->op_next->op_next;
5741 o->op_type = OP_GVSV;
5742 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5745 else if (o->op_next->op_type == OP_RV2AV) {
5746 OP* pop = o->op_next->op_next;
5748 if (pop->op_type == OP_CONST &&
5749 (PL_op = pop->op_next) &&
5750 pop->op_next->op_type == OP_AELEM &&
5751 !(pop->op_next->op_private &
5752 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5753 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5760 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5761 o->op_next = pop->op_next->op_next;
5762 o->op_type = OP_AELEMFAST;
5763 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5764 o->op_private = (U8)i;
5765 GvAVn(((GVOP*)o)->op_gv);
5768 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_UNSAFE)) {
5769 GV *gv = cGVOPo->op_gv;
5770 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
5771 /* XXX could check prototype here instead of just carping */
5772 SV *sv = sv_newmortal();
5773 gv_efullname3(sv, gv, Nullch);
5774 Perl_warner(aTHX_ WARN_UNSAFE,
5775 "%s() called too early to check prototype",
5780 o->op_seq = PL_op_seqmax++;
5789 o->op_seq = PL_op_seqmax++;
5790 while (cLOGOP->op_other->op_type == OP_NULL)
5791 cLOGOP->op_other = cLOGOP->op_other->op_next;
5792 peep(cLOGOP->op_other);
5796 o->op_seq = PL_op_seqmax++;
5797 peep(cLOOP->op_redoop);
5798 peep(cLOOP->op_nextop);
5799 peep(cLOOP->op_lastop);
5805 o->op_seq = PL_op_seqmax++;
5806 peep(cPMOP->op_pmreplstart);
5810 o->op_seq = PL_op_seqmax++;
5811 if (ckWARN(WARN_SYNTAX) && o->op_next
5812 && o->op_next->op_type == OP_NEXTSTATE) {
5813 if (o->op_next->op_sibling &&
5814 o->op_next->op_sibling->op_type != OP_EXIT &&
5815 o->op_next->op_sibling->op_type != OP_WARN &&
5816 o->op_next->op_sibling->op_type != OP_DIE) {
5817 line_t oldline = PL_curcop->cop_line;
5819 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5820 Perl_warner(aTHX_ WARN_SYNTAX, "Statement unlikely to be reached");
5821 Perl_warner(aTHX_ WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5822 PL_curcop->cop_line = oldline;
5836 if ((o->op_private & (OPpLVAL_INTRO))
5837 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5839 rop = (UNOP*)((BINOP*)o)->op_first;
5840 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5842 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5843 if (!SvOBJECT(lexname))
5845 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5846 if (!fields || !GvHV(*fields))
5848 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5849 key = SvPV(*svp, keylen);
5850 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5852 Perl_croak(aTHX_ "No such field \"%s\" in variable %s of type %s",
5853 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5855 ind = SvIV(*indsvp);
5857 Perl_croak(aTHX_ "Bad index while coercing array into hash");
5858 rop->op_type = OP_RV2AV;
5859 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5860 o->op_type = OP_AELEM;
5861 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5863 *svp = newSViv(ind);
5868 o->op_seq = PL_op_seqmax++;