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)
418 SV **svp = AvARRAY(PL_comppad_name);
420 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
421 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
422 if ((sv = svp[off]) && sv != &PL_sv_undef)
423 Perl_warn(aTHX_ "%s never introduced", SvPVX(sv));
426 /* "Deintroduce" my variables that are leaving with this scope. */
427 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
428 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
429 SvIVX(sv) = PL_cop_seqmax;
434 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
440 if (AvARRAY(PL_comppad) != PL_curpad)
441 Perl_croak(aTHX_ "panic: pad_alloc");
442 if (PL_pad_reset_pending)
444 if (tmptype & SVs_PADMY) {
446 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
447 } while (SvPADBUSY(sv)); /* need a fresh one */
448 retval = AvFILLp(PL_comppad);
451 SV **names = AvARRAY(PL_comppad_name);
452 SSize_t names_fill = AvFILLp(PL_comppad_name);
455 * "foreach" index vars temporarily become aliases to non-"my"
456 * values. Thus we must skip, not just pad values that are
457 * marked as current pad values, but also those with names.
459 if (++PL_padix <= names_fill &&
460 (sv = names[PL_padix]) && sv != &PL_sv_undef)
462 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
463 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
468 SvFLAGS(sv) |= tmptype;
469 PL_curpad = AvARRAY(PL_comppad);
471 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
472 (unsigned long) thr, (unsigned long) PL_curpad,
473 (long) retval, PL_op_name[optype]));
475 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
476 (unsigned long) PL_curpad,
477 (long) retval, PL_op_name[optype]));
478 #endif /* USE_THREADS */
479 return (PADOFFSET)retval;
483 Perl_pad_sv(pTHX_ PADOFFSET po)
487 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
488 (unsigned long) thr, (unsigned long) PL_curpad, po));
491 Perl_croak(aTHX_ "panic: pad_sv po");
492 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
493 (unsigned long) PL_curpad, po));
494 #endif /* USE_THREADS */
495 return PL_curpad[po]; /* eventually we'll turn this into a macro */
499 Perl_pad_free(pTHX_ PADOFFSET po)
504 if (AvARRAY(PL_comppad) != PL_curpad)
505 Perl_croak(aTHX_ "panic: pad_free curpad");
507 Perl_croak(aTHX_ "panic: pad_free po");
509 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
510 (unsigned long) thr, (unsigned long) PL_curpad, po));
512 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
513 (unsigned long) PL_curpad, po));
514 #endif /* USE_THREADS */
515 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
516 SvPADTMP_off(PL_curpad[po]);
517 if ((I32)po < PL_padix)
522 Perl_pad_swipe(pTHX_ PADOFFSET po)
525 if (AvARRAY(PL_comppad) != PL_curpad)
526 Perl_croak(aTHX_ "panic: pad_swipe curpad");
528 Perl_croak(aTHX_ "panic: pad_swipe po");
530 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
531 (unsigned long) thr, (unsigned long) PL_curpad, po));
533 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
534 (unsigned long) PL_curpad, po));
535 #endif /* USE_THREADS */
536 SvPADTMP_off(PL_curpad[po]);
537 PL_curpad[po] = NEWSV(1107,0);
538 SvPADTMP_on(PL_curpad[po]);
539 if ((I32)po < PL_padix)
543 /* XXX pad_reset() is currently disabled because it results in serious bugs.
544 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
545 * on the stack by OPs that use them, there are several ways to get an alias
546 * to a shared TARG. Such an alias will change randomly and unpredictably.
547 * We avoid doing this until we can think of a Better Way.
552 #ifdef USE_BROKEN_PAD_RESET
556 if (AvARRAY(PL_comppad) != PL_curpad)
557 Perl_croak(aTHX_ "panic: pad_reset curpad");
559 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
560 (unsigned long) thr, (unsigned long) PL_curpad));
562 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
563 (unsigned long) PL_curpad));
564 #endif /* USE_THREADS */
565 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
566 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
567 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
568 SvPADTMP_off(PL_curpad[po]);
570 PL_padix = PL_padix_floor;
573 PL_pad_reset_pending = FALSE;
577 /* find_threadsv is not reentrant */
579 Perl_find_threadsv(pTHX_ const char *name)
585 /* We currently only handle names of a single character */
586 p = strchr(PL_threadsv_names, *name);
589 key = p - PL_threadsv_names;
590 MUTEX_LOCK(&thr->mutex);
591 svp = av_fetch(thr->threadsv, key, FALSE);
593 MUTEX_UNLOCK(&thr->mutex);
595 SV *sv = NEWSV(0, 0);
596 av_store(thr->threadsv, key, sv);
597 thr->threadsvp = AvARRAY(thr->threadsv);
598 MUTEX_UNLOCK(&thr->mutex);
600 * Some magic variables used to be automagically initialised
601 * in gv_fetchpv. Those which are now per-thread magicals get
602 * initialised here instead.
608 sv_setpv(sv, "\034");
609 sv_magic(sv, 0, 0, name, 1);
614 PL_sawampersand = TRUE;
628 /* XXX %! tied to Errno.pm needs to be added here.
629 * See gv_fetchpv(). */
633 sv_magic(sv, 0, 0, name, 1);
635 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
636 "find_threadsv: new SV %p for $%s%c\n",
637 sv, (*name < 32) ? "^" : "",
638 (*name < 32) ? toCTRL(*name) : *name));
642 #endif /* USE_THREADS */
647 Perl_op_free(pTHX_ OP *o)
649 register OP *kid, *nextkid;
651 if (!o || o->op_seq == (U16)-1)
654 if (o->op_flags & OPf_KIDS) {
655 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
656 nextkid = kid->op_sibling; /* Get before next freeing kid */
661 switch (o->op_type) {
663 o->op_targ = 0; /* Was holding old type, if any. */
666 o->op_targ = 0; /* Was holding hints. */
670 if (!(o->op_flags & OPf_SPECIAL))
674 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
676 #endif /* USE_THREADS */
678 if (!(o->op_flags & OPf_REF)
679 || (PL_check[o->op_type] != FUNC_NAME_TO_PTR(Perl_ck_ftst)))
685 SvREFCNT_dec(cGVOPo->op_gv);
692 SvREFCNT_dec(cSVOPo->op_sv);
698 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
702 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
703 SvREFCNT_dec(cSVOPo->op_sv);
705 Safefree(cPVOPo->op_pv);
708 op_free(cPMOPo->op_pmreplroot);
713 ReREFCNT_dec(cPMOPo->op_pmregexp);
718 pad_free(o->op_targ);
720 #ifdef PL_OP_SLAB_ALLOC
721 if ((char *) o == PL_OpPtr)
730 S_cop_free(pTHX_ COP* cop)
732 Safefree(cop->cop_label);
733 SvREFCNT_dec(cop->cop_filegv);
734 if (cop->cop_warnings != WARN_NONE && cop->cop_warnings != WARN_ALL)
735 SvREFCNT_dec(cop->cop_warnings);
741 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
742 pad_free(o->op_targ);
743 o->op_targ = o->op_type;
744 o->op_type = OP_NULL;
745 o->op_ppaddr = PL_ppaddr[OP_NULL];
748 /* Contextualizers */
750 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
753 Perl_linklist(pTHX_ OP *o)
760 /* establish postfix order */
761 if (cUNOPo->op_first) {
762 o->op_next = LINKLIST(cUNOPo->op_first);
763 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
765 kid->op_next = LINKLIST(kid->op_sibling);
777 Perl_scalarkids(pTHX_ OP *o)
780 if (o && o->op_flags & OPf_KIDS) {
781 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
788 S_scalarboolean(pTHX_ OP *o)
790 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
792 if (ckWARN(WARN_SYNTAX)) {
793 line_t oldline = PL_curcop->cop_line;
795 if (PL_copline != NOLINE)
796 PL_curcop->cop_line = PL_copline;
797 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
798 PL_curcop->cop_line = oldline;
805 Perl_scalar(pTHX_ OP *o)
809 /* assumes no premature commitment */
810 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
811 || o->op_type == OP_RETURN)
814 if ((o->op_private & OPpTARGET_MY)
815 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
816 return scalar(o); /* As if inside SASSIGN */
818 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
820 switch (o->op_type) {
822 if (o->op_private & OPpREPEAT_DOLIST)
823 null(((LISTOP*)cBINOPo->op_first)->op_first);
824 scalar(cBINOPo->op_first);
829 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
833 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
834 if (!kPMOP->op_pmreplroot)
835 deprecate("implicit split to @_");
843 if (o->op_flags & OPf_KIDS) {
844 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
850 kid = cLISTOPo->op_first;
852 while (kid = kid->op_sibling) {
858 WITH_THR(PL_curcop = &PL_compiling);
863 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
869 WITH_THR(PL_curcop = &PL_compiling);
876 Perl_scalarvoid(pTHX_ OP *o)
883 if (o->op_type == OP_NEXTSTATE || o->op_type == OP_DBSTATE ||
884 (o->op_type == OP_NULL &&
885 (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)))
888 PL_curcop = (COP*)o; /* for warning below */
891 /* assumes no premature commitment */
892 want = o->op_flags & OPf_WANT;
893 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
894 || o->op_type == OP_RETURN)
897 if ((o->op_private & OPpTARGET_MY)
898 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
899 return scalar(o); /* As if inside SASSIGN */
901 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
903 switch (o->op_type) {
905 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
909 if (o->op_flags & OPf_STACKED)
913 if (o->op_private == 4)
984 if (!(o->op_private & OPpLVAL_INTRO))
985 useless = PL_op_desc[o->op_type];
992 if (!(o->op_private & OPpLVAL_INTRO) &&
993 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
994 useless = "a variable";
999 if (cSVOPo->op_private & OPpCONST_STRICT)
1000 no_bareword_allowed(o);
1003 if (ckWARN(WARN_VOID)) {
1004 useless = "a constant";
1005 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1007 else if (SvPOK(sv)) {
1008 if (strnEQ(SvPVX(sv), "di", 2) ||
1009 strnEQ(SvPVX(sv), "ds", 2) ||
1010 strnEQ(SvPVX(sv), "ig", 2))
1015 null(o); /* don't execute a constant */
1016 SvREFCNT_dec(sv); /* don't even remember it */
1020 o->op_type = OP_PREINC; /* pre-increment is faster */
1021 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1025 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1026 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1032 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1037 if (o->op_flags & OPf_STACKED)
1045 if (!(o->op_flags & OPf_KIDS))
1054 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1061 /* all requires must return a boolean value */
1062 o->op_flags &= ~OPf_WANT;
1065 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1066 if (!kPMOP->op_pmreplroot)
1067 deprecate("implicit split to @_");
1073 if (ckWARN(WARN_VOID))
1074 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1080 Perl_listkids(pTHX_ OP *o)
1083 if (o && o->op_flags & OPf_KIDS) {
1084 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1091 Perl_list(pTHX_ OP *o)
1095 /* assumes no premature commitment */
1096 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1097 || o->op_type == OP_RETURN)
1100 if ((o->op_private & OPpTARGET_MY)
1101 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
1102 return o; /* As if inside SASSIGN */
1104 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1106 switch (o->op_type) {
1109 list(cBINOPo->op_first);
1114 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1122 if (!(o->op_flags & OPf_KIDS))
1124 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1125 list(cBINOPo->op_first);
1126 return gen_constant_list(o);
1133 kid = cLISTOPo->op_first;
1135 while (kid = kid->op_sibling) {
1136 if (kid->op_sibling)
1141 WITH_THR(PL_curcop = &PL_compiling);
1145 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1146 if (kid->op_sibling)
1151 WITH_THR(PL_curcop = &PL_compiling);
1154 /* all requires must return a boolean value */
1155 o->op_flags &= ~OPf_WANT;
1162 Perl_scalarseq(pTHX_ OP *o)
1167 if (o->op_type == OP_LINESEQ ||
1168 o->op_type == OP_SCOPE ||
1169 o->op_type == OP_LEAVE ||
1170 o->op_type == OP_LEAVETRY)
1173 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1174 if (kid->op_sibling) {
1178 PL_curcop = &PL_compiling;
1180 o->op_flags &= ~OPf_PARENS;
1181 if (PL_hints & HINT_BLOCK_SCOPE)
1182 o->op_flags |= OPf_PARENS;
1185 o = newOP(OP_STUB, 0);
1190 S_modkids(pTHX_ OP *o, I32 type)
1193 if (o && o->op_flags & OPf_KIDS) {
1194 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1201 Perl_mod(pTHX_ OP *o, I32 type)
1208 if (!o || PL_error_count)
1211 if ((o->op_private & OPpTARGET_MY)
1212 && (PL_opargs[o->op_type] & OA_TARGLEX)) /* OPp share the meaning */
1215 switch (o->op_type) {
1220 if (!(o->op_private & (OPpCONST_ARYBASE)))
1222 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1223 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1227 SAVEI32(PL_compiling.cop_arybase);
1228 PL_compiling.cop_arybase = 0;
1230 else if (type == OP_REFGEN)
1233 Perl_croak(aTHX_ "That use of $[ is unsupported");
1236 if (o->op_flags & OPf_PARENS)
1240 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1241 !(o->op_flags & OPf_STACKED)) {
1242 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1243 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1244 assert(cUNOPo->op_first->op_type == OP_NULL);
1245 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1251 /* grep, foreach, subcalls, refgen */
1252 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1254 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1255 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1256 ? "do block" : PL_op_desc[o->op_type]),
1257 type ? PL_op_desc[type] : "local"));
1271 case OP_RIGHT_SHIFT:
1280 if (!(o->op_flags & OPf_STACKED))
1286 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1292 if (!type && cUNOPo->op_first->op_type != OP_GV)
1293 Perl_croak(aTHX_ "Can't localize through a reference");
1294 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1295 PL_modcount = 10000;
1296 return o; /* Treat \(@foo) like ordinary list. */
1300 if (scalar_mod_type(o, type))
1302 ref(cUNOPo->op_first, o->op_type);
1311 PL_modcount = 10000;
1314 if (!type && cUNOPo->op_first->op_type != OP_GV)
1315 Perl_croak(aTHX_ "Can't localize through a reference");
1316 ref(cUNOPo->op_first, o->op_type);
1320 PL_hints |= HINT_BLOCK_SCOPE;
1330 PL_modcount = 10000;
1331 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1332 return o; /* Treat \(@foo) like ordinary list. */
1333 if (scalar_mod_type(o, type))
1339 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1340 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1345 PL_modcount++; /* XXX ??? */
1347 #endif /* USE_THREADS */
1353 if (type != OP_SASSIGN)
1357 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1363 pad_free(o->op_targ);
1364 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1365 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1366 if (o->op_flags & OPf_KIDS)
1367 mod(cBINOPo->op_first->op_sibling, type);
1372 ref(cBINOPo->op_first, o->op_type);
1373 if (type == OP_ENTERSUB &&
1374 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1375 o->op_private |= OPpLVAL_DEFER;
1382 if (o->op_flags & OPf_KIDS)
1383 mod(cLISTOPo->op_last, type);
1387 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1389 else if (!(o->op_flags & OPf_KIDS))
1391 if (o->op_targ != OP_LIST) {
1392 mod(cBINOPo->op_first, type);
1397 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1401 o->op_flags |= OPf_MOD;
1403 if (type == OP_AASSIGN || type == OP_SASSIGN)
1404 o->op_flags |= OPf_SPECIAL|OPf_REF;
1406 o->op_private |= OPpLVAL_INTRO;
1407 o->op_flags &= ~OPf_SPECIAL;
1408 PL_hints |= HINT_BLOCK_SCOPE;
1410 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1411 o->op_flags |= OPf_REF;
1416 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1420 if (o->op_type == OP_RV2GV)
1444 case OP_RIGHT_SHIFT:
1463 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1465 switch (o->op_type) {
1473 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1486 Perl_refkids(pTHX_ OP *o, I32 type)
1489 if (o && o->op_flags & OPf_KIDS) {
1490 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1497 Perl_ref(pTHX_ OP *o, I32 type)
1501 if (!o || PL_error_count)
1504 switch (o->op_type) {
1506 if ((type == OP_DEFINED || type == OP_LOCK) &&
1507 !(o->op_flags & OPf_STACKED)) {
1508 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1509 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1510 assert(cUNOPo->op_first->op_type == OP_NULL);
1511 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1512 o->op_flags |= OPf_SPECIAL;
1517 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1521 if (type == OP_DEFINED)
1522 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1523 ref(cUNOPo->op_first, o->op_type);
1526 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1527 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1528 : type == OP_RV2HV ? OPpDEREF_HV
1530 o->op_flags |= OPf_MOD;
1535 o->op_flags |= OPf_MOD; /* XXX ??? */
1540 o->op_flags |= OPf_REF;
1543 if (type == OP_DEFINED)
1544 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1545 ref(cUNOPo->op_first, o->op_type);
1550 o->op_flags |= OPf_REF;
1555 if (!(o->op_flags & OPf_KIDS))
1557 ref(cBINOPo->op_first, type);
1561 ref(cBINOPo->op_first, o->op_type);
1562 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1563 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1564 : type == OP_RV2HV ? OPpDEREF_HV
1566 o->op_flags |= OPf_MOD;
1574 if (!(o->op_flags & OPf_KIDS))
1576 ref(cLISTOPo->op_last, type);
1586 Perl_my(pTHX_ OP *o)
1591 if (!o || PL_error_count)
1595 if (type == OP_LIST) {
1596 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1598 } else if (type == OP_UNDEF) {
1600 } else if (type != OP_PADSV &&
1603 type != OP_PUSHMARK)
1605 yyerror(Perl_form(aTHX_ "Can't declare %s in my", PL_op_desc[o->op_type]));
1608 o->op_flags |= OPf_MOD;
1609 o->op_private |= OPpLVAL_INTRO;
1614 Perl_sawparens(pTHX_ OP *o)
1617 o->op_flags |= OPf_PARENS;
1622 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1627 if (ckWARN(WARN_UNSAFE) &&
1628 (left->op_type == OP_RV2AV ||
1629 left->op_type == OP_RV2HV ||
1630 left->op_type == OP_PADAV ||
1631 left->op_type == OP_PADHV)) {
1632 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1633 right->op_type == OP_TRANS)
1634 ? right->op_type : OP_MATCH];
1635 char *sample = ((left->op_type == OP_RV2AV ||
1636 left->op_type == OP_PADAV)
1637 ? "@array" : "%hash");
1638 Perl_warner(aTHX_ WARN_UNSAFE,
1639 "Applying %s to %s will act on scalar(%s)",
1640 desc, sample, sample);
1643 if (right->op_type == OP_MATCH ||
1644 right->op_type == OP_SUBST ||
1645 right->op_type == OP_TRANS) {
1646 right->op_flags |= OPf_STACKED;
1647 if (right->op_type != OP_MATCH)
1648 left = mod(left, right->op_type);
1649 if (right->op_type == OP_TRANS)
1650 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1652 o = prepend_elem(right->op_type, scalar(left), right);
1654 return newUNOP(OP_NOT, 0, scalar(o));
1658 return bind_match(type, left,
1659 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1663 Perl_invert(pTHX_ OP *o)
1667 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1668 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1672 Perl_scope(pTHX_ OP *o)
1675 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1676 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1677 o->op_type = OP_LEAVE;
1678 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1681 if (o->op_type == OP_LINESEQ) {
1683 o->op_type = OP_SCOPE;
1684 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1685 kid = ((LISTOP*)o)->op_first;
1686 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1687 cop_free((COP*)kid);
1692 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1699 Perl_save_hints(pTHX)
1702 SAVESPTR(GvHV(PL_hintgv));
1703 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1704 SAVEFREESV(GvHV(PL_hintgv));
1708 Perl_block_start(pTHX_ int full)
1711 int retval = PL_savestack_ix;
1713 SAVEI32(PL_comppad_name_floor);
1715 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1716 PL_comppad_name_floor = PL_comppad_name_fill;
1718 PL_comppad_name_floor = 0;
1720 SAVEI32(PL_min_intro_pending);
1721 SAVEI32(PL_max_intro_pending);
1722 PL_min_intro_pending = 0;
1723 SAVEI32(PL_comppad_name_fill);
1724 SAVEI32(PL_padix_floor);
1725 PL_padix_floor = PL_padix;
1726 PL_pad_reset_pending = FALSE;
1728 PL_hints &= ~HINT_BLOCK_SCOPE;
1729 SAVEPPTR(PL_compiling.cop_warnings);
1730 if (PL_compiling.cop_warnings != WARN_ALL &&
1731 PL_compiling.cop_warnings != WARN_NONE) {
1732 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1733 SAVEFREESV(PL_compiling.cop_warnings) ;
1741 Perl_block_end(pTHX_ I32 floor, OP *seq)
1744 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1745 OP* retval = scalarseq(seq);
1747 PL_pad_reset_pending = FALSE;
1748 PL_compiling.op_private = PL_hints;
1750 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1751 pad_leavemy(PL_comppad_name_fill);
1760 OP *o = newOP(OP_THREADSV, 0);
1761 o->op_targ = find_threadsv("_");
1764 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1765 #endif /* USE_THREADS */
1769 Perl_newPROG(pTHX_ OP *o)
1775 PL_eval_root = newUNOP(OP_LEAVEEVAL,
1776 ((PL_in_eval & EVAL_KEEPERR)
1777 ? OPf_SPECIAL : 0), o);
1778 PL_eval_start = linklist(PL_eval_root);
1779 PL_eval_root->op_next = 0;
1780 peep(PL_eval_start);
1785 PL_main_root = scope(sawparens(scalarvoid(o)));
1786 PL_curcop = &PL_compiling;
1787 PL_main_start = LINKLIST(PL_main_root);
1788 PL_main_root->op_next = 0;
1789 peep(PL_main_start);
1792 /* Register with debugger */
1794 CV *cv = get_cv("DB::postponed", FALSE);
1798 XPUSHs((SV*)PL_compiling.cop_filegv);
1800 call_sv((SV*)cv, G_DISCARD);
1807 Perl_localize(pTHX_ OP *o, I32 lex)
1809 if (o->op_flags & OPf_PARENS)
1813 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1815 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1816 if (*s == ';' || *s == '=')
1817 Perl_warner(aTHX_ WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1818 lex ? "my" : "local");
1822 PL_in_my_stash = Nullhv;
1826 return mod(o, OP_NULL); /* a bit kludgey */
1830 Perl_jmaybe(pTHX_ OP *o)
1832 if (o->op_type == OP_LIST) {
1835 o2 = newOP(OP_THREADSV, 0);
1836 o2->op_targ = find_threadsv(";");
1838 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1839 #endif /* USE_THREADS */
1840 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1846 Perl_fold_constants(pTHX_ register OP *o)
1850 I32 type = o->op_type;
1853 if (PL_opargs[type] & OA_RETSCALAR)
1855 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
1856 o->op_targ = pad_alloc(type, SVs_PADTMP);
1858 /* integerize op, unless it happens to be C<-foo>.
1859 * XXX should pp_i_negate() do magic string negation instead? */
1860 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
1861 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
1862 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
1864 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1867 if (!(PL_opargs[type] & OA_FOLDCONST))
1872 /* XXX might want a ck_negate() for this */
1873 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
1886 if (o->op_private & OPpLOCALE)
1891 goto nope; /* Don't try to run w/ errors */
1893 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1894 if (curop->op_type != OP_CONST &&
1895 curop->op_type != OP_LIST &&
1896 curop->op_type != OP_SCALAR &&
1897 curop->op_type != OP_NULL &&
1898 curop->op_type != OP_PUSHMARK)
1904 curop = LINKLIST(o);
1908 sv = *(PL_stack_sp--);
1909 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1910 pad_swipe(o->op_targ);
1911 else if (SvTEMP(sv)) { /* grab mortal temp? */
1912 (void)SvREFCNT_inc(sv);
1916 if (type == OP_RV2GV)
1917 return newGVOP(OP_GV, 0, (GV*)sv);
1919 /* try to smush double to int, but don't smush -2.0 to -2 */
1920 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1924 if ((NV)iv == SvNV(sv)) {
1929 SvIOK_off(sv); /* undo SvIV() damage */
1931 return newSVOP(OP_CONST, 0, sv);
1935 if (!(PL_opargs[type] & OA_OTHERINT))
1938 if (!(PL_hints & HINT_INTEGER)) {
1939 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1942 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1943 if (curop->op_type == OP_CONST) {
1944 if (SvIOK(((SVOP*)curop)->op_sv))
1948 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1952 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1959 Perl_gen_constant_list(pTHX_ register OP *o)
1963 I32 oldtmps_floor = PL_tmps_floor;
1967 return o; /* Don't attempt to run with errors */
1969 PL_op = curop = LINKLIST(o);
1975 PL_tmps_floor = oldtmps_floor;
1977 o->op_type = OP_RV2AV;
1978 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1979 curop = ((UNOP*)o)->op_first;
1980 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1987 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
1992 if (!o || o->op_type != OP_LIST)
1993 o = newLISTOP(OP_LIST, 0, o, Nullop);
1995 o->op_flags &= ~OPf_WANT;
1997 if (!(PL_opargs[type] & OA_MARK))
1998 null(cLISTOPo->op_first);
2001 o->op_ppaddr = PL_ppaddr[type];
2002 o->op_flags |= flags;
2004 o = CHECKOP(type, o);
2005 if (o->op_type != type)
2008 if (cLISTOPo->op_children < 7) {
2009 /* XXX do we really need to do this if we're done appending?? */
2010 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2012 cLISTOPo->op_last = last; /* in case check substituted last arg */
2015 return fold_constants(o);
2018 /* List constructors */
2021 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2029 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
2030 return newLISTOP(type, 0, first, last);
2032 if (first->op_flags & OPf_KIDS)
2033 ((LISTOP*)first)->op_last->op_sibling = last;
2035 first->op_flags |= OPf_KIDS;
2036 ((LISTOP*)first)->op_first = last;
2038 ((LISTOP*)first)->op_last = last;
2039 ((LISTOP*)first)->op_children++;
2044 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2052 if (first->op_type != type)
2053 return prepend_elem(type, (OP*)first, (OP*)last);
2055 if (last->op_type != type)
2056 return append_elem(type, (OP*)first, (OP*)last);
2058 first->op_last->op_sibling = last->op_first;
2059 first->op_last = last->op_last;
2060 first->op_children += last->op_children;
2061 if (first->op_children)
2062 first->op_flags |= OPf_KIDS;
2064 #ifdef PL_OP_SLAB_ALLOC
2072 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2080 if (last->op_type == type) {
2081 if (type == OP_LIST) { /* already a PUSHMARK there */
2082 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2083 ((LISTOP*)last)->op_first->op_sibling = first;
2086 if (!(last->op_flags & OPf_KIDS)) {
2087 ((LISTOP*)last)->op_last = first;
2088 last->op_flags |= OPf_KIDS;
2090 first->op_sibling = ((LISTOP*)last)->op_first;
2091 ((LISTOP*)last)->op_first = first;
2093 ((LISTOP*)last)->op_children++;
2097 return newLISTOP(type, 0, first, last);
2103 Perl_newNULLLIST(pTHX)
2105 return newOP(OP_STUB, 0);
2109 Perl_force_list(pTHX_ OP *o)
2111 if (!o || o->op_type != OP_LIST)
2112 o = newLISTOP(OP_LIST, 0, o, Nullop);
2118 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2122 NewOp(1101, listop, 1, LISTOP);
2124 listop->op_type = type;
2125 listop->op_ppaddr = PL_ppaddr[type];
2126 listop->op_children = (first != 0) + (last != 0);
2127 listop->op_flags = flags;
2131 else if (!first && last)
2134 first->op_sibling = last;
2135 listop->op_first = first;
2136 listop->op_last = last;
2137 if (type == OP_LIST) {
2139 pushop = newOP(OP_PUSHMARK, 0);
2140 pushop->op_sibling = first;
2141 listop->op_first = pushop;
2142 listop->op_flags |= OPf_KIDS;
2144 listop->op_last = pushop;
2146 else if (listop->op_children)
2147 listop->op_flags |= OPf_KIDS;
2153 Perl_newOP(pTHX_ I32 type, I32 flags)
2156 NewOp(1101, o, 1, OP);
2158 o->op_ppaddr = PL_ppaddr[type];
2159 o->op_flags = flags;
2162 o->op_private = 0 + (flags >> 8);
2163 if (PL_opargs[type] & OA_RETSCALAR)
2165 if (PL_opargs[type] & OA_TARGET)
2166 o->op_targ = pad_alloc(type, SVs_PADTMP);
2167 return CHECKOP(type, o);
2171 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2176 first = newOP(OP_STUB, 0);
2177 if (PL_opargs[type] & OA_MARK)
2178 first = force_list(first);
2180 NewOp(1101, unop, 1, UNOP);
2181 unop->op_type = type;
2182 unop->op_ppaddr = PL_ppaddr[type];
2183 unop->op_first = first;
2184 unop->op_flags = flags | OPf_KIDS;
2185 unop->op_private = 1 | (flags >> 8);
2186 unop = (UNOP*) CHECKOP(type, unop);
2190 return fold_constants((OP *) unop);
2194 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2197 NewOp(1101, binop, 1, BINOP);
2200 first = newOP(OP_NULL, 0);
2202 binop->op_type = type;
2203 binop->op_ppaddr = PL_ppaddr[type];
2204 binop->op_first = first;
2205 binop->op_flags = flags | OPf_KIDS;
2208 binop->op_private = 1 | (flags >> 8);
2211 binop->op_private = 2 | (flags >> 8);
2212 first->op_sibling = last;
2215 binop = (BINOP*)CHECKOP(type, binop);
2216 if (binop->op_next || binop->op_type != type)
2219 binop->op_last = binop->op_first->op_sibling;
2221 return fold_constants((OP *)binop);
2225 utf8compare(const void *a, const void *b)
2228 for (i = 0; i < 10; i++) {
2229 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2231 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2238 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2240 SV *tstr = ((SVOP*)expr)->op_sv;
2241 SV *rstr = ((SVOP*)repl)->op_sv;
2244 register U8 *t = (U8*)SvPV(tstr, tlen);
2245 register U8 *r = (U8*)SvPV(rstr, rlen);
2251 register short *tbl;
2253 complement = o->op_private & OPpTRANS_COMPLEMENT;
2254 del = o->op_private & OPpTRANS_DELETE;
2255 squash = o->op_private & OPpTRANS_SQUASH;
2257 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2258 SV* listsv = newSVpvn("# comment\n",10);
2260 U8* tend = t + tlen;
2261 U8* rend = r + rlen;
2277 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2278 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2284 New(1109, cp, tlen, U8*);
2286 transv = newSVpvn("",0);
2295 qsort(cp, i, sizeof(U8*), utf8compare);
2296 for (j = 0; j < i; j++) {
2298 UV val = utf8_to_uv(s, &ulen);
2300 diff = val - nextmin;
2302 t = uv_to_utf8(tmpbuf,nextmin);
2303 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2305 t = uv_to_utf8(tmpbuf, val - 1);
2306 sv_catpvn(transv, "\377", 1);
2307 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2311 val = utf8_to_uv(s+1, &ulen);
2315 t = uv_to_utf8(tmpbuf,nextmin);
2316 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2317 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2318 sv_catpvn(transv, "\377", 1);
2319 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2320 t = (U8*)SvPVX(transv);
2321 tlen = SvCUR(transv);
2324 else if (!rlen && !del) {
2325 r = t; rlen = tlen; rend = tend;
2328 if (to_utf && from_utf) { /* only counting characters */
2329 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2330 o->op_private |= OPpTRANS_IDENTICAL;
2332 else { /* straight latin-1 translation */
2333 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2334 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2335 o->op_private |= OPpTRANS_IDENTICAL;
2339 while (t < tend || tfirst <= tlast) {
2340 /* see if we need more "t" chars */
2341 if (tfirst > tlast) {
2342 tfirst = (I32)utf8_to_uv(t, &ulen);
2344 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2345 tlast = (I32)utf8_to_uv(++t, &ulen);
2352 /* now see if we need more "r" chars */
2353 if (rfirst > rlast) {
2355 rfirst = (I32)utf8_to_uv(r, &ulen);
2357 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2358 rlast = (I32)utf8_to_uv(++r, &ulen);
2367 rfirst = rlast = 0xffffffff;
2371 /* now see which range will peter our first, if either. */
2372 tdiff = tlast - tfirst;
2373 rdiff = rlast - rfirst;
2380 if (rfirst == 0xffffffff) {
2381 diff = tdiff; /* oops, pretend rdiff is infinite */
2383 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2385 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\tXXXX\n", tfirst);
2389 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2391 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2393 if (rfirst + diff > max)
2394 max = rfirst + diff;
2399 else if (rfirst <= 0x800)
2400 grows |= (tfirst < 0x80);
2401 else if (rfirst <= 0x10000)
2402 grows |= (tfirst < 0x800);
2403 else if (rfirst <= 0x200000)
2404 grows |= (tfirst < 0x10000);
2405 else if (rfirst <= 0x4000000)
2406 grows |= (tfirst < 0x200000);
2407 else if (rfirst <= 0x80000000)
2408 grows |= (tfirst < 0x4000000);
2420 else if (max > 0xff)
2425 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2426 SvREFCNT_dec(listsv);
2428 SvREFCNT_dec(transv);
2430 if (!del && havefinal)
2431 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2433 if (grows && to_utf)
2434 o->op_private |= OPpTRANS_GROWS;
2441 tbl = (short*)cPVOPo->op_pv;
2443 Zero(tbl, 256, short);
2444 for (i = 0; i < tlen; i++)
2446 for (i = 0, j = 0; i < 256; i++) {
2462 if (!rlen && !del) {
2465 o->op_private |= OPpTRANS_IDENTICAL;
2467 for (i = 0; i < 256; i++)
2469 for (i = 0, j = 0; i < tlen; i++,j++) {
2472 if (tbl[t[i]] == -1)
2478 if (tbl[t[i]] == -1)
2489 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2494 NewOp(1101, pmop, 1, PMOP);
2495 pmop->op_type = type;
2496 pmop->op_ppaddr = PL_ppaddr[type];
2497 pmop->op_flags = flags;
2498 pmop->op_private = 0 | (flags >> 8);
2500 if (PL_hints & HINT_RE_TAINT)
2501 pmop->op_pmpermflags |= PMf_RETAINT;
2502 if (PL_hints & HINT_LOCALE)
2503 pmop->op_pmpermflags |= PMf_LOCALE;
2504 pmop->op_pmflags = pmop->op_pmpermflags;
2506 /* link into pm list */
2507 if (type != OP_TRANS && PL_curstash) {
2508 pmop->op_pmnext = HvPMROOT(PL_curstash);
2509 HvPMROOT(PL_curstash) = pmop;
2516 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2521 I32 repl_has_vars = 0;
2523 if (o->op_type == OP_TRANS)
2524 return pmtrans(o, expr, repl);
2526 PL_hints |= HINT_BLOCK_SCOPE;
2529 if (expr->op_type == OP_CONST) {
2531 SV *pat = ((SVOP*)expr)->op_sv;
2532 char *p = SvPV(pat, plen);
2533 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2534 sv_setpvn(pat, "\\s+", 3);
2535 p = SvPV(pat, plen);
2536 pm->op_pmflags |= PMf_SKIPWHITE;
2538 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2539 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2540 pm->op_pmflags |= PMf_WHITE;
2544 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2545 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2547 : OP_REGCMAYBE),0,expr);
2549 NewOp(1101, rcop, 1, LOGOP);
2550 rcop->op_type = OP_REGCOMP;
2551 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2552 rcop->op_first = scalar(expr);
2553 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2554 ? (OPf_SPECIAL | OPf_KIDS)
2556 rcop->op_private = 1;
2559 /* establish postfix order */
2560 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2562 rcop->op_next = expr;
2563 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2566 rcop->op_next = LINKLIST(expr);
2567 expr->op_next = (OP*)rcop;
2570 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2575 if (pm->op_pmflags & PMf_EVAL) {
2577 if (PL_curcop->cop_line < PL_multi_end)
2578 PL_curcop->cop_line = PL_multi_end;
2581 else if (repl->op_type == OP_THREADSV
2582 && strchr("&`'123456789+",
2583 PL_threadsv_names[repl->op_targ]))
2587 #endif /* USE_THREADS */
2588 else if (repl->op_type == OP_CONST)
2592 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2593 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2595 if (curop->op_type == OP_THREADSV) {
2597 if (strchr("&`'123456789+", curop->op_private))
2601 if (curop->op_type == OP_GV) {
2602 GV *gv = ((GVOP*)curop)->op_gv;
2604 if (strchr("&`'123456789+", *GvENAME(gv)))
2607 #endif /* USE_THREADS */
2608 else if (curop->op_type == OP_RV2CV)
2610 else if (curop->op_type == OP_RV2SV ||
2611 curop->op_type == OP_RV2AV ||
2612 curop->op_type == OP_RV2HV ||
2613 curop->op_type == OP_RV2GV) {
2614 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2617 else if (curop->op_type == OP_PADSV ||
2618 curop->op_type == OP_PADAV ||
2619 curop->op_type == OP_PADHV ||
2620 curop->op_type == OP_PADANY) {
2623 else if (curop->op_type == OP_PUSHRE)
2624 ; /* Okay here, dangerous in newASSIGNOP */
2633 && (!pm->op_pmregexp
2634 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2635 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2636 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2637 prepend_elem(o->op_type, scalar(repl), o);
2640 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2641 pm->op_pmflags |= PMf_MAYBE_CONST;
2642 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2644 NewOp(1101, rcop, 1, LOGOP);
2645 rcop->op_type = OP_SUBSTCONT;
2646 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2647 rcop->op_first = scalar(repl);
2648 rcop->op_flags |= OPf_KIDS;
2649 rcop->op_private = 1;
2652 /* establish postfix order */
2653 rcop->op_next = LINKLIST(repl);
2654 repl->op_next = (OP*)rcop;
2656 pm->op_pmreplroot = scalar((OP*)rcop);
2657 pm->op_pmreplstart = LINKLIST(rcop);
2666 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2669 NewOp(1101, svop, 1, SVOP);
2670 svop->op_type = type;
2671 svop->op_ppaddr = PL_ppaddr[type];
2673 svop->op_next = (OP*)svop;
2674 svop->op_flags = flags;
2675 if (PL_opargs[type] & OA_RETSCALAR)
2677 if (PL_opargs[type] & OA_TARGET)
2678 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2679 return CHECKOP(type, svop);
2683 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
2687 NewOp(1101, gvop, 1, GVOP);
2688 gvop->op_type = type;
2689 gvop->op_ppaddr = PL_ppaddr[type];
2690 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2691 gvop->op_next = (OP*)gvop;
2692 gvop->op_flags = flags;
2693 if (PL_opargs[type] & OA_RETSCALAR)
2695 if (PL_opargs[type] & OA_TARGET)
2696 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2697 return CHECKOP(type, gvop);
2701 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
2704 NewOp(1101, pvop, 1, PVOP);
2705 pvop->op_type = type;
2706 pvop->op_ppaddr = PL_ppaddr[type];
2708 pvop->op_next = (OP*)pvop;
2709 pvop->op_flags = flags;
2710 if (PL_opargs[type] & OA_RETSCALAR)
2712 if (PL_opargs[type] & OA_TARGET)
2713 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2714 return CHECKOP(type, pvop);
2718 Perl_package(pTHX_ OP *o)
2723 save_hptr(&PL_curstash);
2724 save_item(PL_curstname);
2729 name = SvPV(sv, len);
2730 PL_curstash = gv_stashpvn(name,len,TRUE);
2731 sv_setpvn(PL_curstname, name, len);
2735 sv_setpv(PL_curstname,"<none>");
2736 PL_curstash = Nullhv;
2738 PL_hints |= HINT_BLOCK_SCOPE;
2739 PL_copline = NOLINE;
2744 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
2753 if (id->op_type != OP_CONST)
2754 Perl_croak(aTHX_ "Module name must be constant");
2758 if(version != Nullop) {
2759 SV *vesv = ((SVOP*)version)->op_sv;
2761 if (arg == Nullop && !SvNIOK(vesv)) {
2768 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2769 Perl_croak(aTHX_ "Version number must be constant number");
2771 /* Make copy of id so we don't free it twice */
2772 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2774 /* Fake up a method call to VERSION */
2775 meth = newSVOP(OP_CONST, 0, newSVpvn("VERSION", 7));
2776 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2777 append_elem(OP_LIST,
2778 prepend_elem(OP_LIST, pack, list(version)),
2779 newUNOP(OP_METHOD, 0, meth)));
2783 /* Fake up an import/unimport */
2784 if (arg && arg->op_type == OP_STUB)
2785 imop = arg; /* no import on explicit () */
2786 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2787 imop = Nullop; /* use 5.0; */
2790 /* Make copy of id so we don't free it twice */
2791 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2792 meth = newSVOP(OP_CONST, 0,
2794 ? newSVpvn("import", 6)
2795 : newSVpvn("unimport", 8)
2797 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2798 append_elem(OP_LIST,
2799 prepend_elem(OP_LIST, pack, list(arg)),
2800 newUNOP(OP_METHOD, 0, meth)));
2803 /* Fake up a require, handle override, if any */
2804 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2805 if (!(gv && GvIMPORTED_CV(gv)))
2806 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2808 if (gv && GvIMPORTED_CV(gv)) {
2809 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2810 append_elem(OP_LIST, id,
2811 scalar(newUNOP(OP_RV2CV, 0,
2816 rqop = newUNOP(OP_REQUIRE, 0, id);
2819 /* Fake up the BEGIN {}, which does its thing immediately. */
2821 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
2823 append_elem(OP_LINESEQ,
2824 append_elem(OP_LINESEQ,
2825 newSTATEOP(0, Nullch, rqop),
2826 newSTATEOP(0, Nullch, veop)),
2827 newSTATEOP(0, Nullch, imop) ));
2829 PL_copline = NOLINE;
2834 Perl_dofile(pTHX_ OP *term)
2839 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2840 if (!(gv && GvIMPORTED_CV(gv)))
2841 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2843 if (gv && GvIMPORTED_CV(gv)) {
2844 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2845 append_elem(OP_LIST, term,
2846 scalar(newUNOP(OP_RV2CV, 0,
2851 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2857 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
2859 return newBINOP(OP_LSLICE, flags,
2860 list(force_list(subscript)),
2861 list(force_list(listval)) );
2865 S_list_assignment(pTHX_ register OP *o)
2870 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2871 o = cUNOPo->op_first;
2873 if (o->op_type == OP_COND_EXPR) {
2874 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2875 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2880 yyerror("Assignment to both a list and a scalar");
2884 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2885 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2886 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2889 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2892 if (o->op_type == OP_RV2SV)
2899 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
2904 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2905 return newLOGOP(optype, 0,
2906 mod(scalar(left), optype),
2907 newUNOP(OP_SASSIGN, 0, scalar(right)));
2910 return newBINOP(optype, OPf_STACKED,
2911 mod(scalar(left), optype), scalar(right));
2915 if (list_assignment(left)) {
2918 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2919 left = mod(left, OP_AASSIGN);
2927 o = newBINOP(OP_AASSIGN, flags,
2928 list(force_list(right)),
2929 list(force_list(left)) );
2930 o->op_private = 0 | (flags >> 8);
2931 if (!(left->op_private & OPpLVAL_INTRO)) {
2935 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2936 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2937 if (curop->op_type == OP_GV) {
2938 GV *gv = ((GVOP*)curop)->op_gv;
2939 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2941 SvCUR(gv) = PL_generation;
2943 else if (curop->op_type == OP_PADSV ||
2944 curop->op_type == OP_PADAV ||
2945 curop->op_type == OP_PADHV ||
2946 curop->op_type == OP_PADANY) {
2947 SV **svp = AvARRAY(PL_comppad_name);
2948 SV *sv = svp[curop->op_targ];
2949 if (SvCUR(sv) == PL_generation)
2951 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2953 else if (curop->op_type == OP_RV2CV)
2955 else if (curop->op_type == OP_RV2SV ||
2956 curop->op_type == OP_RV2AV ||
2957 curop->op_type == OP_RV2HV ||
2958 curop->op_type == OP_RV2GV) {
2959 if (lastop->op_type != OP_GV) /* funny deref? */
2962 else if (curop->op_type == OP_PUSHRE) {
2963 if (((PMOP*)curop)->op_pmreplroot) {
2964 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2965 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2967 SvCUR(gv) = PL_generation;
2976 o->op_private = OPpASSIGN_COMMON;
2978 if (right && right->op_type == OP_SPLIT) {
2980 if ((tmpop = ((LISTOP*)right)->op_first) &&
2981 tmpop->op_type == OP_PUSHRE)
2983 PMOP *pm = (PMOP*)tmpop;
2984 if (left->op_type == OP_RV2AV &&
2985 !(left->op_private & OPpLVAL_INTRO) &&
2986 !(o->op_private & OPpASSIGN_COMMON) )
2988 tmpop = ((UNOP*)left)->op_first;
2989 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2990 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2991 pm->op_pmflags |= PMf_ONCE;
2992 tmpop = cUNOPo->op_first; /* to list (nulled) */
2993 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2994 tmpop->op_sibling = Nullop; /* don't free split */
2995 right->op_next = tmpop->op_next; /* fix starting loc */
2996 op_free(o); /* blow off assign */
2997 right->op_flags &= ~OPf_WANT;
2998 /* "I don't know and I don't care." */
3003 if (PL_modcount < 10000 &&
3004 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3006 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3008 sv_setiv(sv, PL_modcount+1);
3016 right = newOP(OP_UNDEF, 0);
3017 if (right->op_type == OP_READLINE) {
3018 right->op_flags |= OPf_STACKED;
3019 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3022 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3023 o = newBINOP(OP_SASSIGN, flags,
3024 scalar(right), mod(scalar(left), OP_SASSIGN) );
3036 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3039 U32 seq = intro_my();
3042 NewOp(1101, cop, 1, COP);
3043 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
3044 cop->op_type = OP_DBSTATE;
3045 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3048 cop->op_type = OP_NEXTSTATE;
3049 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3051 cop->op_flags = flags;
3052 cop->op_private = (PL_hints & HINT_UTF8);
3054 cop->op_private |= NATIVE_HINTS;
3056 PL_compiling.op_private = cop->op_private;
3057 cop->op_next = (OP*)cop;
3060 cop->cop_label = label;
3061 PL_hints |= HINT_BLOCK_SCOPE;
3064 cop->cop_arybase = PL_curcop->cop_arybase;
3065 if (PL_curcop->cop_warnings == WARN_NONE
3066 || PL_curcop->cop_warnings == WARN_ALL)
3067 cop->cop_warnings = PL_curcop->cop_warnings ;
3069 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3072 if (PL_copline == NOLINE)
3073 cop->cop_line = PL_curcop->cop_line;
3075 cop->cop_line = PL_copline;
3076 PL_copline = NOLINE;
3078 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
3079 cop->cop_stash = PL_curstash;
3081 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3082 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
3083 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3084 (void)SvIOK_on(*svp);
3086 SvSTASH(*svp) = (HV*)cop;
3090 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3093 /* "Introduce" my variables to visible status. */
3101 if (! PL_min_intro_pending)
3102 return PL_cop_seqmax;
3104 svp = AvARRAY(PL_comppad_name);
3105 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3106 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3107 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3108 SvNVX(sv) = (NV)PL_cop_seqmax;
3111 PL_min_intro_pending = 0;
3112 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3113 return PL_cop_seqmax++;
3117 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3119 return new_logop(type, flags, &first, &other);
3123 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3128 OP *first = *firstp;
3129 OP *other = *otherp;
3131 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3132 return newBINOP(type, flags, scalar(first), scalar(other));
3134 scalarboolean(first);
3135 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3136 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3137 if (type == OP_AND || type == OP_OR) {
3143 first = *firstp = cUNOPo->op_first;
3145 first->op_next = o->op_next;
3146 cUNOPo->op_first = Nullop;
3150 if (first->op_type == OP_CONST) {
3151 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3152 Perl_warner(aTHX_ WARN_PRECEDENCE, "Probable precedence problem on %s",
3154 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3165 else if (first->op_type == OP_WANTARRAY) {
3171 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3172 OP *k1 = ((UNOP*)first)->op_first;
3173 OP *k2 = k1->op_sibling;
3175 switch (first->op_type)
3178 if (k2 && k2->op_type == OP_READLINE
3179 && (k2->op_flags & OPf_STACKED)
3180 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3181 warnop = k2->op_type;
3185 if (k1->op_type == OP_READDIR
3186 || k1->op_type == OP_GLOB
3187 || k1->op_type == OP_EACH)
3188 warnop = k1->op_type;
3192 line_t oldline = PL_curcop->cop_line;
3193 PL_curcop->cop_line = PL_copline;
3194 Perl_warner(aTHX_ WARN_UNSAFE,
3195 "Value of %s%s can be \"0\"; test with defined()",
3197 ((warnop == OP_READLINE || warnop == OP_GLOB)
3198 ? " construct" : "() operator"));
3199 PL_curcop->cop_line = oldline;
3206 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3207 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3209 NewOp(1101, logop, 1, LOGOP);
3211 logop->op_type = type;
3212 logop->op_ppaddr = PL_ppaddr[type];
3213 logop->op_first = first;
3214 logop->op_flags = flags | OPf_KIDS;
3215 logop->op_other = LINKLIST(other);
3216 logop->op_private = 1 | (flags >> 8);
3218 /* establish postfix order */
3219 logop->op_next = LINKLIST(first);
3220 first->op_next = (OP*)logop;
3221 first->op_sibling = other;
3223 o = newUNOP(OP_NULL, 0, (OP*)logop);
3230 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3237 return newLOGOP(OP_AND, 0, first, trueop);
3239 return newLOGOP(OP_OR, 0, first, falseop);
3241 scalarboolean(first);
3242 if (first->op_type == OP_CONST) {
3243 if (SvTRUE(((SVOP*)first)->op_sv)) {
3254 else if (first->op_type == OP_WANTARRAY) {
3258 NewOp(1101, condop, 1, CONDOP);
3260 condop->op_type = OP_COND_EXPR;
3261 condop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3262 condop->op_first = first;
3263 condop->op_flags = flags | OPf_KIDS;
3264 condop->op_true = LINKLIST(trueop);
3265 condop->op_false = LINKLIST(falseop);
3266 condop->op_private = 1 | (flags >> 8);
3268 /* establish postfix order */
3269 condop->op_next = LINKLIST(first);
3270 first->op_next = (OP*)condop;
3272 first->op_sibling = trueop;
3273 trueop->op_sibling = falseop;
3274 o = newUNOP(OP_NULL, 0, (OP*)condop);
3276 trueop->op_next = o;
3277 falseop->op_next = o;
3283 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3291 NewOp(1101, condop, 1, CONDOP);
3293 condop->op_type = OP_RANGE;
3294 condop->op_ppaddr = PL_ppaddr[OP_RANGE];
3295 condop->op_first = left;
3296 condop->op_flags = OPf_KIDS;
3297 condop->op_true = LINKLIST(left);
3298 condop->op_false = LINKLIST(right);
3299 condop->op_private = 1 | (flags >> 8);
3301 left->op_sibling = right;
3303 condop->op_next = (OP*)condop;
3304 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3305 flop = newUNOP(OP_FLOP, 0, flip);
3306 o = newUNOP(OP_NULL, 0, flop);
3309 left->op_next = flip;
3310 right->op_next = flop;
3312 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3313 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3314 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3315 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3317 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3318 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3321 if (!flip->op_private || !flop->op_private)
3322 linklist(o); /* blow off optimizer unless constant */
3328 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3333 int once = block && block->op_flags & OPf_SPECIAL &&
3334 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3337 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3338 return block; /* do {} while 0 does once */
3339 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3340 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3341 expr = newUNOP(OP_DEFINED, 0,
3342 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3343 } else if (expr->op_flags & OPf_KIDS) {
3344 OP *k1 = ((UNOP*)expr)->op_first;
3345 OP *k2 = (k1) ? k1->op_sibling : NULL;
3346 switch (expr->op_type) {
3348 if (k2 && k2->op_type == OP_READLINE
3349 && (k2->op_flags & OPf_STACKED)
3350 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3351 expr = newUNOP(OP_DEFINED, 0, expr);
3355 if (k1->op_type == OP_READDIR
3356 || k1->op_type == OP_GLOB
3357 || k1->op_type == OP_EACH)
3358 expr = newUNOP(OP_DEFINED, 0, expr);
3364 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3365 o = new_logop(OP_AND, 0, &expr, &listop);
3368 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3370 if (once && o != listop)
3371 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3374 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3376 o->op_flags |= flags;
3378 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3383 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3392 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3393 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3394 expr = newUNOP(OP_DEFINED, 0,
3395 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3396 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3397 OP *k1 = ((UNOP*)expr)->op_first;
3398 OP *k2 = (k1) ? k1->op_sibling : NULL;
3399 switch (expr->op_type) {
3401 if (k2 && k2->op_type == OP_READLINE
3402 && (k2->op_flags & OPf_STACKED)
3403 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3404 expr = newUNOP(OP_DEFINED, 0, expr);
3408 if (k1->op_type == OP_READDIR
3409 || k1->op_type == OP_GLOB
3410 || k1->op_type == OP_EACH)
3411 expr = newUNOP(OP_DEFINED, 0, expr);
3417 block = newOP(OP_NULL, 0);
3420 next = LINKLIST(cont);
3422 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3423 if ((line_t)whileline != NOLINE) {
3424 PL_copline = whileline;
3425 cont = append_elem(OP_LINESEQ, cont,
3426 newSTATEOP(0, Nullch, Nullop));
3430 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3431 redo = LINKLIST(listop);
3434 PL_copline = whileline;
3436 o = new_logop(OP_AND, 0, &expr, &listop);
3437 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3438 op_free(expr); /* oops, it's a while (0) */
3440 return Nullop; /* listop already freed by new_logop */
3443 ((LISTOP*)listop)->op_last->op_next = condop =
3444 (o == listop ? redo : LINKLIST(o));
3452 NewOp(1101,loop,1,LOOP);
3453 loop->op_type = OP_ENTERLOOP;
3454 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3455 loop->op_private = 0;
3456 loop->op_next = (OP*)loop;
3459 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3461 loop->op_redoop = redo;
3462 loop->op_lastop = o;
3465 loop->op_nextop = next;
3467 loop->op_nextop = o;
3469 o->op_flags |= flags;
3470 o->op_private |= (flags >> 8);
3475 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3484 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3485 sv->op_type = OP_RV2GV;
3486 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3488 else if (sv->op_type == OP_PADSV) { /* private variable */
3489 padoff = sv->op_targ;
3493 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3494 padoff = sv->op_targ;
3495 iterflags |= OPf_SPECIAL;
3500 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3504 padoff = find_threadsv("_");
3505 iterflags |= OPf_SPECIAL;
3507 sv = newGVOP(OP_GV, 0, PL_defgv);
3510 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3511 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3512 iterflags |= OPf_STACKED;
3514 else if (expr->op_type == OP_NULL &&
3515 (expr->op_flags & OPf_KIDS) &&
3516 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3518 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3519 * set the STACKED flag to indicate that these values are to be
3520 * treated as min/max values by 'pp_iterinit'.
3522 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3523 CONDOP* range = (CONDOP*) flip->op_first;
3524 OP* left = range->op_first;
3525 OP* right = left->op_sibling;
3528 range->op_flags &= ~OPf_KIDS;
3529 range->op_first = Nullop;
3531 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3532 listop->op_first->op_next = range->op_true;
3533 left->op_next = range->op_false;
3534 right->op_next = (OP*)listop;
3535 listop->op_next = listop->op_first;
3538 expr = (OP*)(listop);
3540 iterflags |= OPf_STACKED;
3543 expr = mod(force_list(expr), OP_GREPSTART);
3547 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3548 append_elem(OP_LIST, expr, scalar(sv))));
3549 assert(!loop->op_next);
3550 #ifdef PL_OP_SLAB_ALLOC
3551 NewOp(1234,tmp,1,LOOP);
3552 Copy(loop,tmp,1,LOOP);
3555 Renew(loop, 1, LOOP);
3557 loop->op_targ = padoff;
3558 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3559 PL_copline = forline;
3560 return newSTATEOP(0, label, wop);
3564 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3570 if (type != OP_GOTO || label->op_type == OP_CONST) {
3571 /* "last()" means "last" */
3572 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3573 o = newOP(type, OPf_SPECIAL);
3575 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3576 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3582 if (label->op_type == OP_ENTERSUB)
3583 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3584 o = newUNOP(type, OPf_STACKED, label);
3586 PL_hints |= HINT_BLOCK_SCOPE;
3591 Perl_cv_undef(pTHX_ CV *cv)
3596 MUTEX_DESTROY(CvMUTEXP(cv));
3597 Safefree(CvMUTEXP(cv));
3600 #endif /* USE_THREADS */
3602 if (!CvXSUB(cv) && CvROOT(cv)) {
3604 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3605 Perl_croak(aTHX_ "Can't undef active subroutine");
3608 Perl_croak(aTHX_ "Can't undef active subroutine");
3609 #endif /* USE_THREADS */
3612 SAVESPTR(PL_curpad);
3616 op_free(CvROOT(cv));
3617 CvROOT(cv) = Nullop;
3620 SvPOK_off((SV*)cv); /* forget prototype */
3622 SvREFCNT_dec(CvGV(cv));
3624 SvREFCNT_dec(CvOUTSIDE(cv));
3625 CvOUTSIDE(cv) = Nullcv;
3626 if (CvPADLIST(cv)) {
3627 /* may be during global destruction */
3628 if (SvREFCNT(CvPADLIST(cv))) {
3629 I32 i = AvFILLp(CvPADLIST(cv));
3631 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3632 SV* sv = svp ? *svp : Nullsv;
3635 if (sv == (SV*)PL_comppad_name)
3636 PL_comppad_name = Nullav;
3637 else if (sv == (SV*)PL_comppad) {
3638 PL_comppad = Nullav;
3639 PL_curpad = Null(SV**);
3643 SvREFCNT_dec((SV*)CvPADLIST(cv));
3645 CvPADLIST(cv) = Nullav;
3649 #ifdef DEBUG_CLOSURES
3653 CV *outside = CvOUTSIDE(cv);
3654 AV* padlist = CvPADLIST(cv);
3661 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3663 (CvANON(cv) ? "ANON"
3664 : (cv == PL_main_cv) ? "MAIN"
3665 : CvUNIQUE(cv) ? "UNIQUE"
3666 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3669 : CvANON(outside) ? "ANON"
3670 : (outside == PL_main_cv) ? "MAIN"
3671 : CvUNIQUE(outside) ? "UNIQUE"
3672 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3677 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3678 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3679 pname = AvARRAY(pad_name);
3680 ppad = AvARRAY(pad);
3682 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3683 if (SvPOK(pname[ix]))
3684 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3686 SvFAKE(pname[ix]) ? "FAKE " : "",
3688 (long)I_32(SvNVX(pname[ix])),
3689 (long)SvIVX(pname[ix]));
3692 #endif /* DEBUG_CLOSURES */
3695 S_cv_clone2(pTHX_ CV *proto, CV *outside)
3700 AV* protopadlist = CvPADLIST(proto);
3701 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3702 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3703 SV** pname = AvARRAY(protopad_name);
3704 SV** ppad = AvARRAY(protopad);
3705 I32 fname = AvFILLp(protopad_name);
3706 I32 fpad = AvFILLp(protopad);
3710 assert(!CvUNIQUE(proto));
3713 SAVESPTR(PL_curpad);
3714 SAVESPTR(PL_comppad);
3715 SAVESPTR(PL_comppad_name);
3716 SAVESPTR(PL_compcv);
3718 cv = PL_compcv = (CV*)NEWSV(1104,0);
3719 sv_upgrade((SV *)cv, SvTYPE(proto));
3725 New(666, CvMUTEXP(cv), 1, perl_mutex);
3726 MUTEX_INIT(CvMUTEXP(cv));
3728 #endif /* USE_THREADS */
3729 CvFILEGV(cv) = CvFILEGV(proto);
3730 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3731 CvSTASH(cv) = CvSTASH(proto);
3732 CvROOT(cv) = CvROOT(proto);
3733 CvSTART(cv) = CvSTART(proto);
3735 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3738 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3740 PL_comppad_name = newAV();
3741 for (ix = fname; ix >= 0; ix--)
3742 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3744 PL_comppad = newAV();
3746 comppadlist = newAV();
3747 AvREAL_off(comppadlist);
3748 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3749 av_store(comppadlist, 1, (SV*)PL_comppad);
3750 CvPADLIST(cv) = comppadlist;
3751 av_fill(PL_comppad, AvFILLp(protopad));
3752 PL_curpad = AvARRAY(PL_comppad);
3754 av = newAV(); /* will be @_ */
3756 av_store(PL_comppad, 0, (SV*)av);
3757 AvFLAGS(av) = AVf_REIFY;
3759 for (ix = fpad; ix > 0; ix--) {
3760 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3761 if (namesv && namesv != &PL_sv_undef) {
3762 char *name = SvPVX(namesv); /* XXX */
3763 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3764 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3765 CvOUTSIDE(cv), cxstack_ix, 0, 0);
3767 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3769 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
3771 else { /* our own lexical */
3774 /* anon code -- we'll come back for it */
3775 sv = SvREFCNT_inc(ppad[ix]);
3777 else if (*name == '@')
3779 else if (*name == '%')
3789 SV* sv = NEWSV(0,0);
3795 /* Now that vars are all in place, clone nested closures. */
3797 for (ix = fpad; ix > 0; ix--) {
3798 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3800 && namesv != &PL_sv_undef
3801 && !(SvFLAGS(namesv) & SVf_FAKE)
3802 && *SvPVX(namesv) == '&'
3803 && CvCLONE(ppad[ix]))
3805 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3806 SvREFCNT_dec(ppad[ix]);
3809 PL_curpad[ix] = (SV*)kid;
3813 #ifdef DEBUG_CLOSURES
3814 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3816 PerlIO_printf(Perl_debug_log, " from:\n");
3818 PerlIO_printf(Perl_debug_log, " to:\n");
3827 Perl_cv_clone(pTHX_ CV *proto)
3830 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3831 cv = cv_clone2(proto, CvOUTSIDE(proto));
3832 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3837 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
3839 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3840 SV* msg = sv_newmortal();
3844 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3845 sv_setpv(msg, "Prototype mismatch:");
3847 Perl_sv_catpvf(aTHX_ msg, " sub %_", name);
3849 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
3850 sv_catpv(msg, " vs ");
3852 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
3854 sv_catpv(msg, "none");
3855 Perl_warn(aTHX_ "%_", msg);
3860 Perl_cv_const_sv(pTHX_ CV *cv)
3862 if (!cv || !SvPOK(cv) || SvCUR(cv))
3864 return op_const_sv(CvSTART(cv), cv);
3868 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
3875 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3876 o = cLISTOPo->op_first->op_sibling;
3878 for (; o; o = o->op_next) {
3879 OPCODE type = o->op_type;
3881 if(sv && o->op_next == o)
3883 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3885 if (type == OP_LEAVESUB || type == OP_RETURN)
3889 if (type == OP_CONST)
3891 else if (type == OP_PADSV && cv) {
3892 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3893 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3894 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3906 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
3910 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3911 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3912 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3913 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3922 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3923 maximum a prototype before. */
3924 if (SvTYPE(gv) > SVt_NULL) {
3925 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3926 Perl_warn(aTHX_ "Runaway prototype");
3927 cv_ckproto((CV*)gv, NULL, ps);
3930 sv_setpv((SV*)gv, ps);
3932 sv_setiv((SV*)gv, -1);
3933 SvREFCNT_dec(PL_compcv);
3934 cv = PL_compcv = NULL;
3935 PL_sub_generation++;
3939 if (!name || GvCVGEN(gv))
3941 else if (cv = GvCV(gv)) {
3942 cv_ckproto(cv, gv, ps);
3943 /* already defined (or promised)? */
3944 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3946 bool const_changed = TRUE;
3948 /* just a "sub foo;" when &foo is already defined */
3949 SAVEFREESV(PL_compcv);
3952 /* ahem, death to those who redefine active sort subs */
3953 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3954 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
3955 if(const_sv = cv_const_sv(cv))
3956 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3957 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3958 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3959 && HvNAME(GvSTASH(CvGV(cv)))
3960 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3962 line_t oldline = PL_curcop->cop_line;
3963 PL_curcop->cop_line = PL_copline;
3964 Perl_warner(aTHX_ WARN_REDEFINE,
3965 const_sv ? "Constant subroutine %s redefined"
3966 : "Subroutine %s redefined", name);
3967 PL_curcop->cop_line = oldline;
3973 if (cv) { /* must reuse cv if autoloaded */
3975 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3976 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3977 CvOUTSIDE(PL_compcv) = 0;
3978 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3979 CvPADLIST(PL_compcv) = 0;
3980 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3981 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3982 SvREFCNT_dec(PL_compcv);
3989 PL_sub_generation++;
3992 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3993 CvFILEGV(cv) = PL_curcop->cop_filegv;
3994 CvSTASH(cv) = PL_curstash;
3997 if (!CvMUTEXP(cv)) {
3998 New(666, CvMUTEXP(cv), 1, perl_mutex);
3999 MUTEX_INIT(CvMUTEXP(cv));
4001 #endif /* USE_THREADS */
4004 sv_setpv((SV*)cv, ps);
4006 if (PL_error_count) {
4010 char *s = strrchr(name, ':');
4012 if (strEQ(s, "BEGIN")) {
4014 "BEGIN not safe after errors--compilation aborted";
4015 if (PL_in_eval & EVAL_KEEPERR)
4016 Perl_croak(aTHX_ not_safe);
4018 /* force display of errors found but not reported */
4019 sv_catpv(ERRSV, not_safe);
4020 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4027 PL_copline = NOLINE;
4032 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4033 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4036 SV **namep = AvARRAY(PL_comppad_name);
4037 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4040 if (SvIMMORTAL(PL_curpad[ix]))
4043 * The only things that a clonable function needs in its
4044 * pad are references to outer lexicals and anonymous subs.
4045 * The rest are created anew during cloning.
4047 if (!((namesv = namep[ix]) != Nullsv &&
4048 namesv != &PL_sv_undef &&
4050 *SvPVX(namesv) == '&')))
4052 SvREFCNT_dec(PL_curpad[ix]);
4053 PL_curpad[ix] = Nullsv;
4058 AV *av = newAV(); /* Will be @_ */
4060 av_store(PL_comppad, 0, (SV*)av);
4061 AvFLAGS(av) = AVf_REIFY;
4063 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4064 if (SvIMMORTAL(PL_curpad[ix]))
4066 if (!SvPADMY(PL_curpad[ix]))
4067 SvPADTMP_on(PL_curpad[ix]);
4071 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4072 CvSTART(cv) = LINKLIST(CvROOT(cv));
4073 CvROOT(cv)->op_next = 0;
4079 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4080 SV *sv = NEWSV(0,0);
4081 SV *tmpstr = sv_newmortal();
4082 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4086 Perl_sv_setpvf(aTHX_ sv, "%_:%ld-%ld",
4087 GvSV(PL_curcop->cop_filegv),
4088 (long)PL_subline, (long)PL_curcop->cop_line);
4089 gv_efullname3(tmpstr, gv, Nullch);
4090 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4091 hv = GvHVn(db_postponed);
4092 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4093 && (cv = GvCV(db_postponed))) {
4098 call_sv((SV*)cv, G_DISCARD);
4102 if ((s = strrchr(name,':')))
4106 if (strEQ(s, "BEGIN")) {
4107 I32 oldscope = PL_scopestack_ix;
4109 SAVESPTR(PL_compiling.cop_filegv);
4110 SAVEI16(PL_compiling.cop_line);
4112 sv_setsv(PL_rs, PL_nrs);
4115 PL_beginav = newAV();
4116 DEBUG_x( dump_sub(gv) );
4117 av_push(PL_beginav, (SV *)cv);
4119 call_list(oldscope, PL_beginav);
4121 PL_curcop = &PL_compiling;
4122 PL_compiling.op_private = PL_hints;
4125 else if (strEQ(s, "END") && !PL_error_count) {
4128 av_unshift(PL_endav, 1);
4129 av_store(PL_endav, 0, (SV *)cv);
4132 else if (strEQ(s, "INIT") && !PL_error_count) {
4134 PL_initav = newAV();
4135 av_push(PL_initav, SvREFCNT_inc(cv));
4141 PL_copline = NOLINE;
4146 /* XXX unsafe for threads if eval_owner isn't held */
4148 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4151 U32 oldhints = PL_hints;
4152 HV *old_cop_stash = PL_curcop->cop_stash;
4153 HV *old_curstash = PL_curstash;
4154 line_t oldline = PL_curcop->cop_line;
4155 PL_curcop->cop_line = PL_copline;
4157 PL_hints &= ~HINT_BLOCK_SCOPE;
4159 PL_curstash = PL_curcop->cop_stash = stash;
4162 start_subparse(FALSE, 0),
4163 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4164 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4165 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4168 PL_hints = oldhints;
4169 PL_curcop->cop_stash = old_cop_stash;
4170 PL_curstash = old_curstash;
4171 PL_curcop->cop_line = oldline;
4175 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4178 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4181 if (cv = (name ? GvCV(gv) : Nullcv)) {
4183 /* just a cached method */
4187 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4188 /* already defined (or promised) */
4189 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4190 && HvNAME(GvSTASH(CvGV(cv)))
4191 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4192 line_t oldline = PL_curcop->cop_line;
4193 if (PL_copline != NOLINE)
4194 PL_curcop->cop_line = PL_copline;
4195 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4196 PL_curcop->cop_line = oldline;
4203 if (cv) /* must reuse cv if autoloaded */
4206 cv = (CV*)NEWSV(1105,0);
4207 sv_upgrade((SV *)cv, SVt_PVCV);
4211 PL_sub_generation++;
4214 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4216 New(666, CvMUTEXP(cv), 1, perl_mutex);
4217 MUTEX_INIT(CvMUTEXP(cv));
4219 #endif /* USE_THREADS */
4220 CvFILEGV(cv) = gv_fetchfile(filename);
4221 CvXSUB(cv) = subaddr;
4224 char *s = strrchr(name,':');
4229 if (strEQ(s, "BEGIN")) {
4231 PL_beginav = newAV();
4232 av_push(PL_beginav, (SV *)cv);
4235 else if (strEQ(s, "END")) {
4238 av_unshift(PL_endav, 1);
4239 av_store(PL_endav, 0, (SV *)cv);
4242 else if (strEQ(s, "INIT")) {
4244 PL_initav = newAV();
4245 av_push(PL_initav, (SV *)cv);
4256 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4266 name = SvPVx(cSVOPo->op_sv, n_a);
4269 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4271 if (cv = GvFORM(gv)) {
4272 if (ckWARN(WARN_REDEFINE)) {
4273 line_t oldline = PL_curcop->cop_line;
4275 PL_curcop->cop_line = PL_copline;
4276 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4277 PL_curcop->cop_line = oldline;
4283 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4284 CvFILEGV(cv) = PL_curcop->cop_filegv;
4286 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4287 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4288 SvPADTMP_on(PL_curpad[ix]);
4291 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4292 CvSTART(cv) = LINKLIST(CvROOT(cv));
4293 CvROOT(cv)->op_next = 0;
4296 PL_copline = NOLINE;
4301 Perl_newANONLIST(pTHX_ OP *o)
4303 return newUNOP(OP_REFGEN, 0,
4304 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4308 Perl_newANONHASH(pTHX_ OP *o)
4310 return newUNOP(OP_REFGEN, 0,
4311 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4315 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4317 return newUNOP(OP_REFGEN, 0,
4318 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4322 Perl_oopsAV(pTHX_ OP *o)
4324 switch (o->op_type) {
4326 o->op_type = OP_PADAV;
4327 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4328 return ref(o, OP_RV2AV);
4331 o->op_type = OP_RV2AV;
4332 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4337 Perl_warn(aTHX_ "oops: oopsAV");
4344 Perl_oopsHV(pTHX_ OP *o)
4346 switch (o->op_type) {
4349 o->op_type = OP_PADHV;
4350 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4351 return ref(o, OP_RV2HV);
4355 o->op_type = OP_RV2HV;
4356 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4361 Perl_warn(aTHX_ "oops: oopsHV");
4368 Perl_newAVREF(pTHX_ OP *o)
4370 if (o->op_type == OP_PADANY) {
4371 o->op_type = OP_PADAV;
4372 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4375 return newUNOP(OP_RV2AV, 0, scalar(o));
4379 Perl_newGVREF(pTHX_ I32 type, OP *o)
4381 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4382 return newUNOP(OP_NULL, 0, o);
4383 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4387 Perl_newHVREF(pTHX_ OP *o)
4389 if (o->op_type == OP_PADANY) {
4390 o->op_type = OP_PADHV;
4391 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4394 return newUNOP(OP_RV2HV, 0, scalar(o));
4398 Perl_oopsCV(pTHX_ OP *o)
4400 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4406 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4408 return newUNOP(OP_RV2CV, flags, scalar(o));
4412 Perl_newSVREF(pTHX_ OP *o)
4414 if (o->op_type == OP_PADANY) {
4415 o->op_type = OP_PADSV;
4416 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4419 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4420 o->op_flags |= OPpDONE_SVREF;
4423 return newUNOP(OP_RV2SV, 0, scalar(o));
4426 /* Check routines. */
4429 Perl_ck_anoncode(pTHX_ OP *o)
4434 name = NEWSV(1106,0);
4435 sv_upgrade(name, SVt_PVNV);
4436 sv_setpvn(name, "&", 1);
4439 ix = pad_alloc(o->op_type, SVs_PADMY);
4440 av_store(PL_comppad_name, ix, name);
4441 av_store(PL_comppad, ix, cSVOPo->op_sv);
4442 SvPADMY_on(cSVOPo->op_sv);
4443 cSVOPo->op_sv = Nullsv;
4444 cSVOPo->op_targ = ix;
4449 Perl_ck_bitop(pTHX_ OP *o)
4451 o->op_private = PL_hints;
4456 Perl_ck_concat(pTHX_ OP *o)
4458 if (cUNOPo->op_first->op_type == OP_CONCAT)
4459 o->op_flags |= OPf_STACKED;
4464 Perl_ck_spair(pTHX_ OP *o)
4466 if (o->op_flags & OPf_KIDS) {
4469 OPCODE type = o->op_type;
4470 o = modkids(ck_fun(o), type);
4471 kid = cUNOPo->op_first;
4472 newop = kUNOP->op_first->op_sibling;
4474 (newop->op_sibling ||
4475 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4476 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4477 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4481 op_free(kUNOP->op_first);
4482 kUNOP->op_first = newop;
4484 o->op_ppaddr = PL_ppaddr[++o->op_type];
4489 Perl_ck_delete(pTHX_ OP *o)
4493 if (o->op_flags & OPf_KIDS) {
4494 OP *kid = cUNOPo->op_first;
4495 if (kid->op_type == OP_HSLICE)
4496 o->op_private |= OPpSLICE;
4497 else if (kid->op_type != OP_HELEM)
4498 Perl_croak(aTHX_ "%s argument is not a HASH element or slice",
4499 PL_op_desc[o->op_type]);
4506 Perl_ck_eof(pTHX_ OP *o)
4508 I32 type = o->op_type;
4510 if (o->op_flags & OPf_KIDS) {
4511 if (cLISTOPo->op_first->op_type == OP_STUB) {
4513 o = newUNOP(type, OPf_SPECIAL,
4514 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4522 Perl_ck_eval(pTHX_ OP *o)
4524 PL_hints |= HINT_BLOCK_SCOPE;
4525 if (o->op_flags & OPf_KIDS) {
4526 SVOP *kid = (SVOP*)cUNOPo->op_first;
4529 o->op_flags &= ~OPf_KIDS;
4532 else if (kid->op_type == OP_LINESEQ) {
4535 kid->op_next = o->op_next;
4536 cUNOPo->op_first = 0;
4539 NewOp(1101, enter, 1, LOGOP);
4540 enter->op_type = OP_ENTERTRY;
4541 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4542 enter->op_private = 0;
4544 /* establish postfix order */
4545 enter->op_next = (OP*)enter;
4547 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4548 o->op_type = OP_LEAVETRY;
4549 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4550 enter->op_other = o;
4558 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4560 o->op_targ = (PADOFFSET)PL_hints;
4565 Perl_ck_exec(pTHX_ OP *o)
4568 if (o->op_flags & OPf_STACKED) {
4570 kid = cUNOPo->op_first->op_sibling;
4571 if (kid->op_type == OP_RV2GV)
4580 Perl_ck_exists(pTHX_ OP *o)
4583 if (o->op_flags & OPf_KIDS) {
4584 OP *kid = cUNOPo->op_first;
4585 if (kid->op_type != OP_HELEM)
4586 Perl_croak(aTHX_ "%s argument is not a HASH element", PL_op_desc[o->op_type]);
4594 Perl_ck_gvconst(pTHX_ register OP *o)
4596 o = fold_constants(o);
4597 if (o->op_type == OP_CONST)
4604 Perl_ck_rvconst(pTHX_ register OP *o)
4607 SVOP *kid = (SVOP*)cUNOPo->op_first;
4609 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4610 if (kid->op_type == OP_CONST) {
4614 SV *kidsv = kid->op_sv;
4617 /* Is it a constant from cv_const_sv()? */
4618 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4619 SV *rsv = SvRV(kidsv);
4620 int svtype = SvTYPE(rsv);
4621 char *badtype = Nullch;
4623 switch (o->op_type) {
4625 if (svtype > SVt_PVMG)
4626 badtype = "a SCALAR";
4629 if (svtype != SVt_PVAV)
4630 badtype = "an ARRAY";
4633 if (svtype != SVt_PVHV) {
4634 if (svtype == SVt_PVAV) { /* pseudohash? */
4635 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4636 if (ksv && SvROK(*ksv)
4637 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4646 if (svtype != SVt_PVCV)
4651 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
4654 name = SvPV(kidsv, n_a);
4655 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4656 char *badthing = Nullch;
4657 switch (o->op_type) {
4659 badthing = "a SCALAR";
4662 badthing = "an ARRAY";
4665 badthing = "a HASH";
4670 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4674 * This is a little tricky. We only want to add the symbol if we
4675 * didn't add it in the lexer. Otherwise we get duplicate strict
4676 * warnings. But if we didn't add it in the lexer, we must at
4677 * least pretend like we wanted to add it even if it existed before,
4678 * or we get possible typo warnings. OPpCONST_ENTERED says
4679 * whether the lexer already added THIS instance of this symbol.
4681 iscv = (o->op_type == OP_RV2CV) * 2;
4683 gv = gv_fetchpv(name,
4684 iscv | !(kid->op_private & OPpCONST_ENTERED),
4687 : o->op_type == OP_RV2SV
4689 : o->op_type == OP_RV2AV
4691 : o->op_type == OP_RV2HV
4694 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4696 kid->op_type = OP_GV;
4697 SvREFCNT_dec(kid->op_sv);
4698 kid->op_sv = SvREFCNT_inc(gv);
4705 Perl_ck_ftst(pTHX_ OP *o)
4708 I32 type = o->op_type;
4710 if (o->op_flags & OPf_REF)
4713 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4714 SVOP *kid = (SVOP*)cUNOPo->op_first;
4716 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4718 OP *newop = newGVOP(type, OPf_REF,
4719 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4726 if (type == OP_FTTTY)
4727 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4730 return newUNOP(type, 0, newDEFSVOP());
4736 Perl_ck_fun(pTHX_ OP *o)
4743 int type = o->op_type;
4744 register I32 oa = PL_opargs[type] >> OASHIFT;
4746 if (o->op_flags & OPf_STACKED) {
4747 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4750 return no_fh_allowed(o);
4753 if (o->op_flags & OPf_KIDS) {
4755 tokid = &cLISTOPo->op_first;
4756 kid = cLISTOPo->op_first;
4757 if (kid->op_type == OP_PUSHMARK ||
4758 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4760 tokid = &kid->op_sibling;
4761 kid = kid->op_sibling;
4763 if (!kid && PL_opargs[type] & OA_DEFGV)
4764 *tokid = kid = newDEFSVOP();
4768 sibl = kid->op_sibling;
4771 /* list seen where single (scalar) arg expected? */
4772 if (numargs == 1 && !(oa >> 4)
4773 && kid->op_type == OP_LIST && type != OP_SCALAR)
4775 return too_many_arguments(o,PL_op_desc[type]);
4788 if (kid->op_type == OP_CONST &&
4789 (kid->op_private & OPpCONST_BARE))
4791 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4792 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4793 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4794 if (ckWARN(WARN_SYNTAX))
4795 Perl_warner(aTHX_ WARN_SYNTAX,
4796 "Array @%s missing the @ in argument %ld of %s()",
4797 name, (long)numargs, PL_op_desc[type]);
4800 kid->op_sibling = sibl;
4803 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4804 bad_type(numargs, "array", PL_op_desc[type], kid);
4808 if (kid->op_type == OP_CONST &&
4809 (kid->op_private & OPpCONST_BARE))
4811 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4812 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4813 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4814 if (ckWARN(WARN_SYNTAX))
4815 Perl_warner(aTHX_ WARN_SYNTAX,
4816 "Hash %%%s missing the %% in argument %ld of %s()",
4817 name, (long)numargs, PL_op_desc[type]);
4820 kid->op_sibling = sibl;
4823 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4824 bad_type(numargs, "hash", PL_op_desc[type], kid);
4829 OP *newop = newUNOP(OP_NULL, 0, kid);
4830 kid->op_sibling = 0;
4832 newop->op_next = newop;
4834 kid->op_sibling = sibl;
4839 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4840 if (kid->op_type == OP_CONST &&
4841 (kid->op_private & OPpCONST_BARE))
4843 OP *newop = newGVOP(OP_GV, 0,
4844 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4849 else if (kid->op_type == OP_READLINE) {
4850 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4851 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4854 I32 flags = OPf_SPECIAL;
4856 /* is this op a FH constructor? */
4857 if (is_handle_constructor(o,numargs)) {
4859 /* Set a flag to tell rv2gv to vivify
4860 * need to "prove" flag does not mean something
4861 * else already - NI-S 1999/05/07
4865 /* Helps with open($array[$n],...)
4866 but is too simplistic - need to do selectively
4871 kid->op_sibling = 0;
4872 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
4874 kid->op_private |= priv;
4877 kid->op_sibling = sibl;
4883 mod(scalar(kid), type);
4887 tokid = &kid->op_sibling;
4888 kid = kid->op_sibling;
4890 o->op_private |= numargs;
4892 return too_many_arguments(o,PL_op_desc[o->op_type]);
4895 else if (PL_opargs[type] & OA_DEFGV) {
4897 return newUNOP(type, 0, newDEFSVOP());
4901 while (oa & OA_OPTIONAL)
4903 if (oa && oa != OA_LIST)
4904 return too_few_arguments(o,PL_op_desc[o->op_type]);
4910 Perl_ck_glob(pTHX_ OP *o)
4914 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4915 append_elem(OP_GLOB, o, newDEFSVOP());
4917 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4918 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4920 if (gv && GvIMPORTED_CV(gv)) {
4921 append_elem(OP_GLOB, o,
4922 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
4923 o->op_type = OP_LIST;
4924 o->op_ppaddr = PL_ppaddr[OP_LIST];
4925 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4926 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4927 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4928 append_elem(OP_LIST, o,
4929 scalar(newUNOP(OP_RV2CV, 0,
4930 newGVOP(OP_GV, 0, gv)))));
4931 o = newUNOP(OP_NULL, 0, ck_subr(o));
4932 o->op_targ = OP_GLOB; /* hint at what it used to be */
4935 gv = newGVgen("main");
4937 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4943 Perl_ck_grep(pTHX_ OP *o)
4947 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4949 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4950 NewOp(1101, gwop, 1, LOGOP);
4952 if (o->op_flags & OPf_STACKED) {
4955 kid = cLISTOPo->op_first->op_sibling;
4956 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4959 kid->op_next = (OP*)gwop;
4960 o->op_flags &= ~OPf_STACKED;
4962 kid = cLISTOPo->op_first->op_sibling;
4963 if (type == OP_MAPWHILE)
4970 kid = cLISTOPo->op_first->op_sibling;
4971 if (kid->op_type != OP_NULL)
4972 Perl_croak(aTHX_ "panic: ck_grep");
4973 kid = kUNOP->op_first;
4975 gwop->op_type = type;
4976 gwop->op_ppaddr = PL_ppaddr[type];
4977 gwop->op_first = listkids(o);
4978 gwop->op_flags |= OPf_KIDS;
4979 gwop->op_private = 1;
4980 gwop->op_other = LINKLIST(kid);
4981 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4982 kid->op_next = (OP*)gwop;
4984 kid = cLISTOPo->op_first->op_sibling;
4985 if (!kid || !kid->op_sibling)
4986 return too_few_arguments(o,PL_op_desc[o->op_type]);
4987 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4988 mod(kid, OP_GREPSTART);
4994 Perl_ck_index(pTHX_ OP *o)
4996 if (o->op_flags & OPf_KIDS) {
4997 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4999 kid = kid->op_sibling; /* get past "big" */
5000 if (kid && kid->op_type == OP_CONST)
5001 fbm_compile(((SVOP*)kid)->op_sv, 0);
5007 Perl_ck_lengthconst(pTHX_ OP *o)
5009 /* XXX length optimization goes here */
5014 Perl_ck_lfun(pTHX_ OP *o)
5016 OPCODE type = o->op_type;
5017 return modkids(ck_fun(o), type);
5021 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5024 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5025 switch (cUNOPo->op_first->op_type) {
5028 case OP_AASSIGN: /* Is this a good idea? */
5029 Perl_warner(aTHX_ WARN_DEPRECATED,
5030 "defined(@array) is deprecated");
5031 Perl_warner(aTHX_ WARN_DEPRECATED,
5032 "(Maybe you should just omit the defined()?)\n");
5036 Perl_warner(aTHX_ WARN_DEPRECATED,
5037 "defined(%hash) is deprecated");
5038 Perl_warner(aTHX_ WARN_DEPRECATED,
5039 "(Maybe you should just omit the defined()?)\n");
5050 Perl_ck_rfun(pTHX_ OP *o)
5052 OPCODE type = o->op_type;
5053 return refkids(ck_fun(o), type);
5057 Perl_ck_listiob(pTHX_ OP *o)
5061 kid = cLISTOPo->op_first;
5064 kid = cLISTOPo->op_first;
5066 if (kid->op_type == OP_PUSHMARK)
5067 kid = kid->op_sibling;
5068 if (kid && o->op_flags & OPf_STACKED)
5069 kid = kid->op_sibling;
5070 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5071 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5072 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5073 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5074 cLISTOPo->op_first->op_sibling = kid;
5075 cLISTOPo->op_last = kid;
5076 kid = kid->op_sibling;
5081 append_elem(o->op_type, o, newDEFSVOP());
5087 if (PL_hints & HINT_LOCALE)
5088 o->op_private |= OPpLOCALE;
5095 Perl_ck_fun_locale(pTHX_ OP *o)
5101 if (PL_hints & HINT_LOCALE)
5102 o->op_private |= OPpLOCALE;
5109 Perl_ck_sassign(pTHX_ OP *o)
5111 OP *kid = cLISTOPo->op_first;
5112 /* has a disposable target? */
5113 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5114 && !(kid->op_flags & OPf_STACKED))
5116 OP *kkid = kid->op_sibling;
5118 /* Can just relocate the target. */
5119 if (kkid && kkid->op_type == OP_PADSV) {
5120 /* Concat has problems if target is equal to right arg. */
5121 if (kid->op_type == OP_CONCAT
5122 && kLISTOP->op_first->op_sibling->op_type == OP_PADSV
5123 && kLISTOP->op_first->op_sibling->op_targ == kkid->op_targ)
5127 kid->op_targ = kkid->op_targ;
5128 /* Now we do not need PADSV and SASSIGN. */
5129 kid->op_sibling = o->op_sibling; /* NULL */
5130 cLISTOPo->op_first = NULL;
5133 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5141 Perl_ck_scmp(pTHX_ OP *o)
5145 if (PL_hints & HINT_LOCALE)
5146 o->op_private |= OPpLOCALE;
5153 Perl_ck_match(pTHX_ OP *o)
5155 o->op_private |= OPpRUNTIME;
5160 Perl_ck_null(pTHX_ OP *o)
5166 Perl_ck_repeat(pTHX_ OP *o)
5168 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5169 o->op_private |= OPpREPEAT_DOLIST;
5170 cBINOPo->op_first = force_list(cBINOPo->op_first);
5178 Perl_ck_require(pTHX_ OP *o)
5180 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5181 SVOP *kid = (SVOP*)cUNOPo->op_first;
5183 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5185 for (s = SvPVX(kid->op_sv); *s; s++) {
5186 if (*s == ':' && s[1] == ':') {
5188 Move(s+2, s+1, strlen(s+2)+1, char);
5189 --SvCUR(kid->op_sv);
5192 sv_catpvn(kid->op_sv, ".pm", 3);
5200 Perl_ck_retarget(pTHX_ OP *o)
5202 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5209 Perl_ck_select(pTHX_ OP *o)
5212 if (o->op_flags & OPf_KIDS) {
5213 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5214 if (kid && kid->op_sibling) {
5215 o->op_type = OP_SSELECT;
5216 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5218 return fold_constants(o);
5222 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5223 if (kid && kid->op_type == OP_RV2GV)
5224 kid->op_private &= ~HINT_STRICT_REFS;
5229 Perl_ck_shift(pTHX_ OP *o)
5231 I32 type = o->op_type;
5233 if (!(o->op_flags & OPf_KIDS)) {
5238 if (!CvUNIQUE(PL_compcv)) {
5239 argop = newOP(OP_PADAV, OPf_REF);
5240 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5243 argop = newUNOP(OP_RV2AV, 0,
5244 scalar(newGVOP(OP_GV, 0,
5245 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5248 argop = newUNOP(OP_RV2AV, 0,
5249 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5250 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5251 #endif /* USE_THREADS */
5252 return newUNOP(type, 0, scalar(argop));
5254 return scalar(modkids(ck_fun(o), type));
5258 Perl_ck_sort(pTHX_ OP *o)
5262 if (PL_hints & HINT_LOCALE)
5263 o->op_private |= OPpLOCALE;
5266 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5268 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5269 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5271 kid = kUNOP->op_first; /* get past null */
5273 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5275 if (kid->op_type == OP_SCOPE) {
5279 else if (kid->op_type == OP_LEAVE) {
5280 if (o->op_type == OP_SORT) {
5281 null(kid); /* wipe out leave */
5284 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5285 if (k->op_next == kid)
5290 kid->op_next = 0; /* just disconnect the leave */
5291 k = kLISTOP->op_first;
5295 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5296 if (o->op_type == OP_SORT)
5300 o->op_flags |= OPf_SPECIAL;
5302 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5303 null(cLISTOPo->op_first->op_sibling);
5310 S_simplify_sort(pTHX_ OP *o)
5313 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5316 if (!(o->op_flags & OPf_STACKED))
5318 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5319 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5320 kid = kUNOP->op_first; /* get past null */
5321 if (kid->op_type != OP_SCOPE)
5323 kid = kLISTOP->op_last; /* get past scope */
5324 switch(kid->op_type) {
5332 k = kid; /* remember this node*/
5333 if (kBINOP->op_first->op_type != OP_RV2SV)
5335 kid = kBINOP->op_first; /* get past cmp */
5336 if (kUNOP->op_first->op_type != OP_GV)
5338 kid = kUNOP->op_first; /* get past rv2sv */
5339 if (GvSTASH(kGVOP->op_gv) != PL_curstash)
5341 if (strEQ(GvNAME(kGVOP->op_gv), "a"))
5343 else if(strEQ(GvNAME(kGVOP->op_gv), "b"))
5347 kid = k; /* back to cmp */
5348 if (kBINOP->op_last->op_type != OP_RV2SV)
5350 kid = kBINOP->op_last; /* down to 2nd arg */
5351 if (kUNOP->op_first->op_type != OP_GV)
5353 kid = kUNOP->op_first; /* get past rv2sv */
5354 if (GvSTASH(kGVOP->op_gv) != PL_curstash
5356 ? strNE(GvNAME(kGVOP->op_gv), "a")
5357 : strNE(GvNAME(kGVOP->op_gv), "b")))
5359 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5361 o->op_private |= OPpSORT_REVERSE;
5362 if (k->op_type == OP_NCMP)
5363 o->op_private |= OPpSORT_NUMERIC;
5364 if (k->op_type == OP_I_NCMP)
5365 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5366 op_free(cLISTOPo->op_first->op_sibling); /* delete comparison block */
5367 cLISTOPo->op_first->op_sibling = cLISTOPo->op_last;
5368 cLISTOPo->op_children = 1;
5372 Perl_ck_split(pTHX_ OP *o)
5376 if (o->op_flags & OPf_STACKED)
5377 return no_fh_allowed(o);
5379 kid = cLISTOPo->op_first;
5380 if (kid->op_type != OP_NULL)
5381 Perl_croak(aTHX_ "panic: ck_split");
5382 kid = kid->op_sibling;
5383 op_free(cLISTOPo->op_first);
5384 cLISTOPo->op_first = kid;
5386 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5387 cLISTOPo->op_last = kid; /* There was only one element previously */
5390 if (kid->op_type != OP_MATCH) {
5391 OP *sibl = kid->op_sibling;
5392 kid->op_sibling = 0;
5393 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5394 if (cLISTOPo->op_first == cLISTOPo->op_last)
5395 cLISTOPo->op_last = kid;
5396 cLISTOPo->op_first = kid;
5397 kid->op_sibling = sibl;
5400 kid->op_type = OP_PUSHRE;
5401 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5404 if (!kid->op_sibling)
5405 append_elem(OP_SPLIT, o, newDEFSVOP());
5407 kid = kid->op_sibling;
5410 if (!kid->op_sibling)
5411 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5413 kid = kid->op_sibling;
5416 if (kid->op_sibling)
5417 return too_many_arguments(o,PL_op_desc[o->op_type]);
5423 Perl_ck_subr(pTHX_ OP *o)
5426 OP *prev = ((cUNOPo->op_first->op_sibling)
5427 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5428 OP *o2 = prev->op_sibling;
5437 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5438 if (cvop->op_type == OP_RV2CV) {
5440 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5441 null(cvop); /* disable rv2cv */
5442 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5443 if (tmpop->op_type == OP_GV) {
5444 cv = GvCVu(tmpop->op_sv);
5445 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5446 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5447 proto = SvPV((SV*)cv, n_a);
5451 else if (cvop->op_type == OP_METHOD) {
5452 if (o2->op_type == OP_CONST)
5453 o2->op_private &= ~OPpCONST_STRICT;
5454 else if (o2->op_type == OP_LIST) {
5455 OP *o = ((UNOP*)o2)->op_first->op_sibling;
5456 if (o && o->op_type == OP_CONST)
5457 o->op_private &= ~OPpCONST_STRICT;
5460 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5461 if (PERLDB_SUB && PL_curstash != PL_debstash)
5462 o->op_private |= OPpENTERSUB_DB;
5463 while (o2 != cvop) {
5467 return too_many_arguments(o, gv_ename(namegv));
5485 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5486 bad_type(arg, "block", gv_ename(namegv), o2);
5489 /* '*' allows any scalar type, including bareword */
5492 if (o2->op_type == OP_RV2GV)
5493 goto wrapref; /* autoconvert GLOB -> GLOBref */
5494 else if (o2->op_type == OP_CONST)
5495 o2->op_private &= ~OPpCONST_STRICT;
5496 else if (o2->op_type == OP_ENTERSUB) {
5497 /* accidental subroutine, revert to bareword */
5498 OP *gvop = ((UNOP*)o2)->op_first;
5499 if (gvop && gvop->op_type == OP_NULL) {
5500 gvop = ((UNOP*)gvop)->op_first;
5502 for (; gvop->op_sibling; gvop = gvop->op_sibling)
5505 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
5506 (gvop = ((UNOP*)gvop)->op_first) &&
5507 gvop->op_type == OP_GV)
5509 GV *gv = (GV*)((SVOP*)gvop)->op_sv;
5510 OP *sibling = o2->op_sibling;
5511 SV *n = newSVpvn("",0);
5513 gv_fullname3(n, gv, "");
5514 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
5515 sv_chop(n, SvPVX(n)+6);
5516 o2 = newSVOP(OP_CONST, 0, n);
5517 prev->op_sibling = o2;
5518 o2->op_sibling = sibling;
5530 if (o2->op_type != OP_RV2GV)
5531 bad_type(arg, "symbol", gv_ename(namegv), o2);
5534 if (o2->op_type != OP_RV2CV)
5535 bad_type(arg, "sub", gv_ename(namegv), o2);
5538 if (o2->op_type != OP_RV2SV
5539 && o2->op_type != OP_PADSV
5540 && o2->op_type != OP_THREADSV)
5542 bad_type(arg, "scalar", gv_ename(namegv), o2);
5546 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5547 bad_type(arg, "array", gv_ename(namegv), o2);
5550 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5551 bad_type(arg, "hash", gv_ename(namegv), o2);
5555 OP* sib = kid->op_sibling;
5556 kid->op_sibling = 0;
5557 o2 = newUNOP(OP_REFGEN, 0, kid);
5558 o2->op_sibling = sib;
5559 prev->op_sibling = o2;
5570 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
5571 gv_ename(namegv), SvPV((SV*)cv, n_a));
5576 mod(o2, OP_ENTERSUB);
5578 o2 = o2->op_sibling;
5580 if (proto && !optional &&
5581 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5582 return too_few_arguments(o, gv_ename(namegv));
5587 Perl_ck_svconst(pTHX_ OP *o)
5589 SvREADONLY_on(cSVOPo->op_sv);
5594 Perl_ck_trunc(pTHX_ OP *o)
5596 if (o->op_flags & OPf_KIDS) {
5597 SVOP *kid = (SVOP*)cUNOPo->op_first;
5599 if (kid->op_type == OP_NULL)
5600 kid = (SVOP*)kid->op_sibling;
5601 if (kid && kid->op_type == OP_CONST &&
5602 (kid->op_private & OPpCONST_BARE))
5604 o->op_flags |= OPf_SPECIAL;
5605 kid->op_private &= ~OPpCONST_STRICT;
5611 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5614 Perl_peep(pTHX_ register OP *o)
5617 register OP* oldop = 0;
5620 if (!o || o->op_seq)
5624 SAVESPTR(PL_curcop);
5625 for (; o; o = o->op_next) {
5631 switch (o->op_type) {
5634 PL_curcop = ((COP*)o); /* for warnings */
5635 o->op_seq = PL_op_seqmax++;
5639 if (cSVOPo->op_private & OPpCONST_STRICT)
5640 no_bareword_allowed(o);
5649 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
5650 if (o->op_next->op_private & OPpTARGET_MY) {
5651 if ((o->op_type == OP_CONST) /* no target */
5652 || (o->op_flags & OPf_STACKED) /* chained concats */
5653 || (o->op_type == OP_CONCAT
5654 /* Concat has problems if target is equal to right arg. */
5655 && (((LISTOP*)o)->op_first->op_sibling->op_type
5657 && (((LISTOP*)o)->op_first->op_sibling->op_targ
5658 == o->op_next->op_targ))) {
5659 goto ignore_optimization;
5661 o->op_targ = o->op_next->op_targ;
5666 ignore_optimization:
5667 o->op_seq = PL_op_seqmax++;
5670 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5671 o->op_seq = PL_op_seqmax++;
5672 break; /* Scalar stub must produce undef. List stub is noop */
5676 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5677 PL_curcop = ((COP*)o);
5683 if (oldop && o->op_next) {
5684 oldop->op_next = o->op_next;
5687 o->op_seq = PL_op_seqmax++;
5691 if (o->op_next->op_type == OP_RV2SV) {
5692 if (!(o->op_next->op_private & OPpDEREF)) {
5694 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5695 o->op_next = o->op_next->op_next;
5696 o->op_type = OP_GVSV;
5697 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5700 else if (o->op_next->op_type == OP_RV2AV) {
5701 OP* pop = o->op_next->op_next;
5703 if (pop->op_type == OP_CONST &&
5704 (PL_op = pop->op_next) &&
5705 pop->op_next->op_type == OP_AELEM &&
5706 !(pop->op_next->op_private &
5707 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5708 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5712 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5716 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5717 o->op_next = pop->op_next->op_next;
5718 o->op_type = OP_AELEMFAST;
5719 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5720 o->op_private = (U8)i;
5721 GvAVn(((GVOP*)o)->op_gv);
5724 o->op_seq = PL_op_seqmax++;
5731 o->op_seq = PL_op_seqmax++;
5732 while (cLOGOP->op_other->op_type == OP_NULL)
5733 cLOGOP->op_other = cLOGOP->op_other->op_next;
5734 peep(cLOGOP->op_other);
5738 o->op_seq = PL_op_seqmax++;
5739 peep(cCONDOP->op_true);
5740 peep(cCONDOP->op_false);
5744 o->op_seq = PL_op_seqmax++;
5745 peep(cLOOP->op_redoop);
5746 peep(cLOOP->op_nextop);
5747 peep(cLOOP->op_lastop);
5753 o->op_seq = PL_op_seqmax++;
5754 peep(cPMOP->op_pmreplstart);
5758 o->op_seq = PL_op_seqmax++;
5759 if (ckWARN(WARN_SYNTAX) && o->op_next
5760 && o->op_next->op_type == OP_NEXTSTATE) {
5761 if (o->op_next->op_sibling &&
5762 o->op_next->op_sibling->op_type != OP_EXIT &&
5763 o->op_next->op_sibling->op_type != OP_WARN &&
5764 o->op_next->op_sibling->op_type != OP_DIE) {
5765 line_t oldline = PL_curcop->cop_line;
5767 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5768 Perl_warner(aTHX_ WARN_SYNTAX, "Statement unlikely to be reached");
5769 Perl_warner(aTHX_ WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5770 PL_curcop->cop_line = oldline;
5784 if ((o->op_private & (OPpLVAL_INTRO))
5785 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5787 rop = (UNOP*)((BINOP*)o)->op_first;
5788 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5790 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5791 if (!SvOBJECT(lexname))
5793 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5794 if (!fields || !GvHV(*fields))
5796 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5797 key = SvPV(*svp, keylen);
5798 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5800 Perl_croak(aTHX_ "No such field \"%s\" in variable %s of type %s",
5801 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5803 ind = SvIV(*indsvp);
5805 Perl_croak(aTHX_ "Bad index while coercing array into hash");
5806 rop->op_type = OP_RV2AV;
5807 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5808 o->op_type = OP_AELEM;
5809 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5811 *svp = newSViv(ind);
5816 o->op_seq = PL_op_seqmax++;