3 * Copyright (c) 1991-1999, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
22 #define CHECKCALL this->*check
24 #define CHECKCALL *check
28 * In the following definition, the ", Nullop" is just to make the compiler
29 * think the expression is of the right type: croak actually does a Siglongjmp.
31 #define CHECKOP(type,o) \
32 ((PL_op_mask && PL_op_mask[type]) \
33 ? ( op_free((OP*)o), \
34 croak("%s trapped by operation mask", op_desc[type]), \
36 : (CHECKCALL[type])((OP*)o))
38 #define PAD_MAX 999999999
40 static bool scalar_mod_type _((OP *o, I32 type));
42 static I32 list_assignment _((OP *o));
43 static void bad_type _((I32 n, char *t, char *name, OP *kid));
44 static OP *modkids _((OP *o, I32 type));
45 static OP *no_fh_allowed _((OP *o));
46 static OP *scalarboolean _((OP *o));
47 static OP *too_few_arguments _((OP *o, char* name));
48 static OP *too_many_arguments _((OP *o, char* name));
49 static void null _((OP* o));
50 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
51 CV* startcv, I32 cx_ix, I32 saweval, U32 flags));
52 static OP *newDEFSVOP _((void));
53 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
59 SV* tmpsv = sv_newmortal();
61 gv_efullname3(tmpsv, gv, Nullch);
62 return SvPV(tmpsv,n_a);
68 yyerror(form("Missing comma after first argument to %s function",
69 op_desc[o->op_type]));
74 too_few_arguments(OP *o, char *name)
76 yyerror(form("Not enough arguments for %s", name));
81 too_many_arguments(OP *o, char *name)
83 yyerror(form("Too many arguments for %s", name));
88 bad_type(I32 n, char *t, char *name, OP *kid)
90 yyerror(form("Type of arg %d to %s must be %s (not %s)",
91 (int)n, name, t, op_desc[kid->op_type]));
97 int type = o->op_type;
98 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
99 yyerror(form("Can't use subscript on %s", op_desc[type]));
100 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
102 SV *msg = sv_2mortal(
103 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
104 type == OP_ENTERSUB ? '&' : '%'));
108 sv_catsv(GvSV(PL_errgv), msg);
110 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
115 /* "register" allocation */
118 pad_allocmy(char *name)
124 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
125 if (!isPRINT(name[1])) {
127 name[2] = toCTRL(name[1]);
130 croak("Can't use global %s in \"my\"",name);
132 if (PL_dowarn && AvFILLp(PL_comppad_name) >= 0) {
133 SV **svp = AvARRAY(PL_comppad_name);
134 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
136 && sv != &PL_sv_undef
137 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
138 && strEQ(name, SvPVX(sv)))
140 warn("\"my\" variable %s masks earlier declaration in same %s",
141 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
146 off = pad_alloc(OP_PADSV, SVs_PADMY);
148 sv_upgrade(sv, SVt_PVNV);
150 if (PL_in_my_stash) {
152 croak("Can't declare class for non-scalar %s in \"my\"",name);
154 (void)SvUPGRADE(sv, SVt_PVMG);
155 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
158 av_store(PL_comppad_name, off, sv);
159 SvNVX(sv) = (double)PAD_MAX;
160 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
161 if (!PL_min_intro_pending)
162 PL_min_intro_pending = off;
163 PL_max_intro_pending = off;
165 av_store(PL_comppad, off, (SV*)newAV());
166 else if (*name == '%')
167 av_store(PL_comppad, off, (SV*)newHV());
168 SvPADMY_on(PL_curpad[off]);
172 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
175 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix, I32 saweval,
183 register PERL_CONTEXT *cx;
185 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
186 AV *curlist = CvPADLIST(cv);
187 SV **svp = av_fetch(curlist, 0, FALSE);
190 if (!svp || *svp == &PL_sv_undef)
193 svp = AvARRAY(curname);
194 for (off = AvFILLp(curname); off > 0; off--) {
195 if ((sv = svp[off]) &&
196 sv != &PL_sv_undef &&
198 seq > I_32(SvNVX(sv)) &&
199 strEQ(SvPVX(sv), name))
210 return 0; /* don't clone from inactive stack frame */
214 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
215 oldsv = *av_fetch(oldpad, off, TRUE);
216 if (!newoff) { /* Not a mere clone operation. */
217 SV *namesv = NEWSV(1103,0);
218 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
219 sv_upgrade(namesv, SVt_PVNV);
220 sv_setpv(namesv, name);
221 av_store(PL_comppad_name, newoff, namesv);
222 SvNVX(namesv) = (double)PL_curcop->cop_seq;
223 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
224 SvFAKE_on(namesv); /* A ref, not a real var */
225 if (SvOBJECT(svp[off])) { /* A typed var */
227 (void)SvUPGRADE(namesv, SVt_PVMG);
228 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(svp[off]));
231 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
232 /* "It's closures all the way down." */
233 CvCLONE_on(PL_compcv);
235 if (CvANON(PL_compcv))
236 oldsv = Nullsv; /* no need to keep ref */
241 bcv && bcv != cv && !CvCLONE(bcv);
242 bcv = CvOUTSIDE(bcv))
248 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
251 "Variable \"%s\" may be unavailable",
259 else if (!CvUNIQUE(PL_compcv)) {
260 if (PL_dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
261 warn("Variable \"%s\" will not stay shared", name);
264 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
270 if (flags & FINDLEX_NOSEARCH)
273 /* Nothing in current lexical context--try eval's context, if any.
274 * This is necessary to let the perldb get at lexically scoped variables.
275 * XXX This will also probably interact badly with eval tree caching.
278 for (i = cx_ix; i >= 0; i--) {
280 switch (CxTYPE(cx)) {
282 if (i == 0 && saweval) {
283 seq = cxstack[saweval].blk_oldcop->cop_seq;
284 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
288 switch (cx->blk_eval.old_op_type) {
294 /* require must have its own scope */
302 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
303 saweval = i; /* so we know where we were called from */
306 seq = cxstack[saweval].blk_oldcop->cop_seq;
307 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
315 pad_findmy(char *name)
321 SV **svp = AvARRAY(PL_comppad_name);
322 U32 seq = PL_cop_seqmax;
328 * Special case to get lexical (and hence per-thread) @_.
329 * XXX I need to find out how to tell at parse-time whether use
330 * of @_ should refer to a lexical (from a sub) or defgv (global
331 * scope and maybe weird sub-ish things like formats). See
332 * startsub in perly.y. It's possible that @_ could be lexical
333 * (at least from subs) even in non-threaded perl.
335 if (strEQ(name, "@_"))
336 return 0; /* success. (NOT_IN_PAD indicates failure) */
337 #endif /* USE_THREADS */
339 /* The one we're looking for is probably just before comppad_name_fill. */
340 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
341 if ((sv = svp[off]) &&
342 sv != &PL_sv_undef &&
345 seq > I_32(SvNVX(sv)))) &&
346 strEQ(SvPVX(sv), name))
349 return (PADOFFSET)off;
350 pendoff = off; /* this pending def. will override import */
354 outside = CvOUTSIDE(PL_compcv);
356 /* Check if if we're compiling an eval'', and adjust seq to be the
357 * eval's seq number. This depends on eval'' having a non-null
358 * CvOUTSIDE() while it is being compiled. The eval'' itself is
359 * identified by CvEVAL being true and CvGV being null. */
360 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
361 cx = &cxstack[cxstack_ix];
363 seq = cx->blk_oldcop->cop_seq;
366 /* See if it's in a nested scope */
367 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
369 /* If there is a pending local definition, this new alias must die */
371 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
372 return off; /* pad_findlex returns 0 for failure...*/
374 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
378 pad_leavemy(I32 fill)
381 SV **svp = AvARRAY(PL_comppad_name);
383 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
384 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
385 if ((sv = svp[off]) && sv != &PL_sv_undef)
386 warn("%s never introduced", SvPVX(sv));
389 /* "Deintroduce" my variables that are leaving with this scope. */
390 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
391 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
392 SvIVX(sv) = PL_cop_seqmax;
397 pad_alloc(I32 optype, U32 tmptype)
403 if (AvARRAY(PL_comppad) != PL_curpad)
404 croak("panic: pad_alloc");
405 if (PL_pad_reset_pending)
407 if (tmptype & SVs_PADMY) {
409 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
410 } while (SvPADBUSY(sv)); /* need a fresh one */
411 retval = AvFILLp(PL_comppad);
414 SV **names = AvARRAY(PL_comppad_name);
415 SSize_t names_fill = AvFILLp(PL_comppad_name);
418 * "foreach" index vars temporarily become aliases to non-"my"
419 * values. Thus we must skip, not just pad values that are
420 * marked as current pad values, but also those with names.
422 if (++PL_padix <= names_fill &&
423 (sv = names[PL_padix]) && sv != &PL_sv_undef)
425 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
426 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
431 SvFLAGS(sv) |= tmptype;
432 PL_curpad = AvARRAY(PL_comppad);
434 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
435 (unsigned long) thr, (unsigned long) PL_curpad,
436 (long) retval, op_name[optype]));
438 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
439 (unsigned long) PL_curpad,
440 (long) retval, op_name[optype]));
441 #endif /* USE_THREADS */
442 return (PADOFFSET)retval;
450 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
451 (unsigned long) thr, (unsigned long) PL_curpad, po));
454 croak("panic: pad_sv po");
455 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
456 (unsigned long) PL_curpad, po));
457 #endif /* USE_THREADS */
458 return PL_curpad[po]; /* eventually we'll turn this into a macro */
462 pad_free(PADOFFSET po)
467 if (AvARRAY(PL_comppad) != PL_curpad)
468 croak("panic: pad_free curpad");
470 croak("panic: pad_free po");
472 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
473 (unsigned long) thr, (unsigned long) PL_curpad, po));
475 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
476 (unsigned long) PL_curpad, po));
477 #endif /* USE_THREADS */
478 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
479 SvPADTMP_off(PL_curpad[po]);
480 if ((I32)po < PL_padix)
485 pad_swipe(PADOFFSET po)
488 if (AvARRAY(PL_comppad) != PL_curpad)
489 croak("panic: pad_swipe curpad");
491 croak("panic: pad_swipe po");
493 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
494 (unsigned long) thr, (unsigned long) PL_curpad, po));
496 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
497 (unsigned long) PL_curpad, po));
498 #endif /* USE_THREADS */
499 SvPADTMP_off(PL_curpad[po]);
500 PL_curpad[po] = NEWSV(1107,0);
501 SvPADTMP_on(PL_curpad[po]);
502 if ((I32)po < PL_padix)
506 /* XXX pad_reset() is currently disabled because it results in serious bugs.
507 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
508 * on the stack by OPs that use them, there are several ways to get an alias
509 * to a shared TARG. Such an alias will change randomly and unpredictably.
510 * We avoid doing this until we can think of a Better Way.
515 #ifdef USE_BROKEN_PAD_RESET
519 if (AvARRAY(PL_comppad) != PL_curpad)
520 croak("panic: pad_reset curpad");
522 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
523 (unsigned long) thr, (unsigned long) PL_curpad));
525 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
526 (unsigned long) PL_curpad));
527 #endif /* USE_THREADS */
528 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
529 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
530 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
531 SvPADTMP_off(PL_curpad[po]);
533 PL_padix = PL_padix_floor;
536 PL_pad_reset_pending = FALSE;
540 /* find_threadsv is not reentrant */
542 find_threadsv(char *name)
548 /* We currently only handle names of a single character */
549 p = strchr(PL_threadsv_names, *name);
552 key = p - PL_threadsv_names;
553 MUTEX_LOCK(&thr->mutex);
554 svp = av_fetch(thr->threadsv, key, FALSE);
556 MUTEX_UNLOCK(&thr->mutex);
558 SV *sv = NEWSV(0, 0);
559 av_store(thr->threadsv, key, sv);
560 thr->threadsvp = AvARRAY(thr->threadsv);
561 MUTEX_UNLOCK(&thr->mutex);
563 * Some magic variables used to be automagically initialised
564 * in gv_fetchpv. Those which are now per-thread magicals get
565 * initialised here instead.
571 sv_setpv(sv, "\034");
572 sv_magic(sv, 0, 0, name, 1);
577 PL_sawampersand = TRUE;
591 /* XXX %! tied to Errno.pm needs to be added here.
592 * See gv_fetchpv(). */
596 sv_magic(sv, 0, 0, name, 1);
598 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
599 "find_threadsv: new SV %p for $%s%c\n",
600 sv, (*name < 32) ? "^" : "",
601 (*name < 32) ? toCTRL(*name) : *name));
605 #endif /* USE_THREADS */
612 register OP *kid, *nextkid;
614 if (!o || o->op_seq == (U16)-1)
617 if (o->op_flags & OPf_KIDS) {
618 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
619 nextkid = kid->op_sibling; /* Get before next freeing kid */
624 switch (o->op_type) {
626 o->op_targ = 0; /* Was holding old type, if any. */
629 o->op_targ = 0; /* Was holding hints. */
633 if (!(o->op_flags & OPf_SPECIAL))
637 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
639 #endif /* USE_THREADS */
641 if (!(o->op_flags & OPf_REF)
642 || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
648 SvREFCNT_dec(cGVOPo->op_gv);
652 Safefree(cCOPo->cop_label);
653 SvREFCNT_dec(cCOPo->cop_filegv);
656 SvREFCNT_dec(cSVOPo->op_sv);
662 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
666 Safefree(cPVOPo->op_pv);
669 op_free(cPMOPo->op_pmreplroot);
674 ReREFCNT_dec(cPMOPo->op_pmregexp);
679 pad_free(o->op_targ);
687 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
688 pad_free(o->op_targ);
689 o->op_targ = o->op_type;
690 o->op_type = OP_NULL;
691 o->op_ppaddr = ppaddr[OP_NULL];
694 /* Contextualizers */
696 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
706 /* establish postfix order */
707 if (cUNOPo->op_first) {
708 o->op_next = LINKLIST(cUNOPo->op_first);
709 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
711 kid->op_next = LINKLIST(kid->op_sibling);
726 if (o && o->op_flags & OPf_KIDS) {
727 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
737 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
739 line_t oldline = PL_curcop->cop_line;
741 if (PL_copline != NOLINE)
742 PL_curcop->cop_line = PL_copline;
743 warn("Found = in conditional, should be ==");
744 PL_curcop->cop_line = oldline;
754 /* assumes no premature commitment */
755 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
756 || o->op_type == OP_RETURN)
759 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
761 switch (o->op_type) {
763 if (o->op_private & OPpREPEAT_DOLIST)
764 null(((LISTOP*)cBINOPo->op_first)->op_first);
765 scalar(cBINOPo->op_first);
770 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
774 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
775 if (!kPMOP->op_pmreplroot)
776 deprecate("implicit split to @_");
784 if (o->op_flags & OPf_KIDS) {
785 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
791 kid = cLISTOPo->op_first;
793 while (kid = kid->op_sibling) {
799 WITH_THR(PL_curcop = &PL_compiling);
804 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
810 WITH_THR(PL_curcop = &PL_compiling);
823 /* assumes no premature commitment */
824 U8 want = o->op_flags & OPf_WANT;
825 if (!o || (want && want != OPf_WANT_SCALAR) || PL_error_count
826 || o->op_type == OP_RETURN)
829 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
831 switch (o->op_type) {
833 if (!(opargs[o->op_type] & OA_FOLDCONST))
837 if (o->op_flags & OPf_STACKED)
841 if (o->op_private == 4)
912 if (!(o->op_private & OPpLVAL_INTRO))
913 useless = op_desc[o->op_type];
920 if (!(o->op_private & OPpLVAL_INTRO) &&
921 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
922 useless = "a variable";
927 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
933 useless = "a constant";
934 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
936 else if (SvPOK(sv)) {
937 if (strnEQ(SvPVX(sv), "di", 2) ||
938 strnEQ(SvPVX(sv), "ds", 2) ||
939 strnEQ(SvPVX(sv), "ig", 2))
943 null(o); /* don't execute a constant */
944 SvREFCNT_dec(sv); /* don't even remember it */
948 o->op_type = OP_PREINC; /* pre-increment is faster */
949 o->op_ppaddr = ppaddr[OP_PREINC];
953 o->op_type = OP_PREDEC; /* pre-decrement is faster */
954 o->op_ppaddr = ppaddr[OP_PREDEC];
960 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
965 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
966 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
967 if (o->op_flags & OPf_STACKED)
973 if (!(o->op_flags & OPf_KIDS))
982 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
989 /* all requires must return a boolean value */
990 o->op_flags &= ~OPf_WANT;
993 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
994 if (!kPMOP->op_pmreplroot)
995 deprecate("implicit split to @_");
999 if (useless && PL_dowarn)
1000 warn("Useless use of %s in void context", useless);
1008 if (o && o->op_flags & OPf_KIDS) {
1009 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1020 /* assumes no premature commitment */
1021 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1022 || o->op_type == OP_RETURN)
1025 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1027 switch (o->op_type) {
1030 list(cBINOPo->op_first);
1035 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1043 if (!(o->op_flags & OPf_KIDS))
1045 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1046 list(cBINOPo->op_first);
1047 return gen_constant_list(o);
1054 kid = cLISTOPo->op_first;
1056 while (kid = kid->op_sibling) {
1057 if (kid->op_sibling)
1062 WITH_THR(PL_curcop = &PL_compiling);
1066 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1067 if (kid->op_sibling)
1072 WITH_THR(PL_curcop = &PL_compiling);
1075 /* all requires must return a boolean value */
1076 o->op_flags &= ~OPf_WANT;
1088 if (o->op_type == OP_LINESEQ ||
1089 o->op_type == OP_SCOPE ||
1090 o->op_type == OP_LEAVE ||
1091 o->op_type == OP_LEAVETRY)
1094 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1095 if (kid->op_sibling) {
1099 PL_curcop = &PL_compiling;
1101 o->op_flags &= ~OPf_PARENS;
1102 if (PL_hints & HINT_BLOCK_SCOPE)
1103 o->op_flags |= OPf_PARENS;
1106 o = newOP(OP_STUB, 0);
1111 modkids(OP *o, I32 type)
1114 if (o && o->op_flags & OPf_KIDS) {
1115 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1122 mod(OP *o, I32 type)
1129 if (!o || PL_error_count)
1132 switch (o->op_type) {
1137 if (!(o->op_private & (OPpCONST_ARYBASE)))
1139 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1140 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1144 SAVEI32(PL_compiling.cop_arybase);
1145 PL_compiling.cop_arybase = 0;
1147 else if (type == OP_REFGEN)
1150 croak("That use of $[ is unsupported");
1153 if (o->op_flags & OPf_PARENS)
1157 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1158 !(o->op_flags & OPf_STACKED)) {
1159 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1160 o->op_ppaddr = ppaddr[OP_RV2CV];
1161 assert(cUNOPo->op_first->op_type == OP_NULL);
1162 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1168 /* grep, foreach, subcalls, refgen */
1169 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1171 yyerror(form("Can't modify %s in %s",
1172 op_desc[o->op_type],
1173 type ? op_desc[type] : "local"));
1187 case OP_RIGHT_SHIFT:
1196 if (!(o->op_flags & OPf_STACKED))
1202 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1208 if (!type && cUNOPo->op_first->op_type != OP_GV)
1209 croak("Can't localize through a reference");
1210 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1211 PL_modcount = 10000;
1212 return o; /* Treat \(@foo) like ordinary list. */
1216 if (scalar_mod_type(o, type))
1218 ref(cUNOPo->op_first, o->op_type);
1227 PL_modcount = 10000;
1230 if (!type && cUNOPo->op_first->op_type != OP_GV)
1231 croak("Can't localize through a reference");
1232 ref(cUNOPo->op_first, o->op_type);
1236 PL_hints |= HINT_BLOCK_SCOPE;
1244 PL_modcount = 10000;
1245 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1246 return o; /* Treat \(@foo) like ordinary list. */
1247 if (scalar_mod_type(o, type))
1253 croak("Can't localize lexical variable %s",
1254 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1259 PL_modcount++; /* XXX ??? */
1261 #endif /* USE_THREADS */
1267 if (type != OP_SASSIGN)
1271 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1277 pad_free(o->op_targ);
1278 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1279 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1280 if (o->op_flags & OPf_KIDS)
1281 mod(cBINOPo->op_first->op_sibling, type);
1286 ref(cBINOPo->op_first, o->op_type);
1287 if (type == OP_ENTERSUB &&
1288 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1289 o->op_private |= OPpLVAL_DEFER;
1296 if (o->op_flags & OPf_KIDS)
1297 mod(cLISTOPo->op_last, type);
1301 if (!(o->op_flags & OPf_KIDS))
1303 if (o->op_targ != OP_LIST) {
1304 mod(cBINOPo->op_first, type);
1309 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1313 o->op_flags |= OPf_MOD;
1315 if (type == OP_AASSIGN || type == OP_SASSIGN)
1316 o->op_flags |= OPf_SPECIAL|OPf_REF;
1318 o->op_private |= OPpLVAL_INTRO;
1319 o->op_flags &= ~OPf_SPECIAL;
1320 PL_hints |= HINT_BLOCK_SCOPE;
1322 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1323 o->op_flags |= OPf_REF;
1328 scalar_mod_type(OP *o, I32 type)
1332 if (o->op_type == OP_RV2GV)
1356 case OP_RIGHT_SHIFT:
1366 case OP_ANDASSIGN: /* may work later */
1367 case OP_ORASSIGN: /* may work later */
1375 refkids(OP *o, I32 type)
1378 if (o && o->op_flags & OPf_KIDS) {
1379 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1386 ref(OP *o, I32 type)
1390 if (!o || PL_error_count)
1393 switch (o->op_type) {
1395 if ((type == OP_DEFINED || type == OP_LOCK) &&
1396 !(o->op_flags & OPf_STACKED)) {
1397 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1398 o->op_ppaddr = ppaddr[OP_RV2CV];
1399 assert(cUNOPo->op_first->op_type == OP_NULL);
1400 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1401 o->op_flags |= OPf_SPECIAL;
1406 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1410 ref(cUNOPo->op_first, o->op_type);
1413 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1414 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1415 : type == OP_RV2HV ? OPpDEREF_HV
1417 o->op_flags |= OPf_MOD;
1422 o->op_flags |= OPf_MOD; /* XXX ??? */
1427 o->op_flags |= OPf_REF;
1430 ref(cUNOPo->op_first, o->op_type);
1435 o->op_flags |= OPf_REF;
1440 if (!(o->op_flags & OPf_KIDS))
1442 ref(cBINOPo->op_first, type);
1446 ref(cBINOPo->op_first, o->op_type);
1447 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1448 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1449 : type == OP_RV2HV ? OPpDEREF_HV
1451 o->op_flags |= OPf_MOD;
1459 if (!(o->op_flags & OPf_KIDS))
1461 ref(cLISTOPo->op_last, type);
1476 if (!o || PL_error_count)
1480 if (type == OP_LIST) {
1481 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1483 } else if (type == OP_UNDEF) {
1485 } else if (type != OP_PADSV &&
1488 type != OP_PUSHMARK)
1490 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1493 o->op_flags |= OPf_MOD;
1494 o->op_private |= OPpLVAL_INTRO;
1502 o->op_flags |= OPf_PARENS;
1507 bind_match(I32 type, OP *left, OP *right)
1512 (left->op_type == OP_RV2AV ||
1513 left->op_type == OP_RV2HV ||
1514 left->op_type == OP_PADAV ||
1515 left->op_type == OP_PADHV)) {
1516 char *desc = op_desc[(right->op_type == OP_SUBST ||
1517 right->op_type == OP_TRANS)
1518 ? right->op_type : OP_MATCH];
1519 char *sample = ((left->op_type == OP_RV2AV ||
1520 left->op_type == OP_PADAV)
1521 ? "@array" : "%hash");
1522 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1525 if (right->op_type == OP_MATCH ||
1526 right->op_type == OP_SUBST ||
1527 right->op_type == OP_TRANS) {
1528 right->op_flags |= OPf_STACKED;
1529 if (right->op_type != OP_MATCH)
1530 left = mod(left, right->op_type);
1531 if (right->op_type == OP_TRANS)
1532 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1534 o = prepend_elem(right->op_type, scalar(left), right);
1536 return newUNOP(OP_NOT, 0, scalar(o));
1540 return bind_match(type, left,
1541 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1549 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1550 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1557 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1558 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1559 o->op_type = OP_LEAVE;
1560 o->op_ppaddr = ppaddr[OP_LEAVE];
1563 if (o->op_type == OP_LINESEQ) {
1565 o->op_type = OP_SCOPE;
1566 o->op_ppaddr = ppaddr[OP_SCOPE];
1567 kid = ((LISTOP*)o)->op_first;
1568 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1569 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1574 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1584 SAVESPTR(GvHV(PL_hintgv));
1585 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1586 SAVEFREESV(GvHV(PL_hintgv));
1590 block_start(int full)
1593 int retval = PL_savestack_ix;
1595 SAVEI32(PL_comppad_name_floor);
1597 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1598 PL_comppad_name_floor = PL_comppad_name_fill;
1600 PL_comppad_name_floor = 0;
1602 SAVEI32(PL_min_intro_pending);
1603 SAVEI32(PL_max_intro_pending);
1604 PL_min_intro_pending = 0;
1605 SAVEI32(PL_comppad_name_fill);
1606 SAVEI32(PL_padix_floor);
1607 PL_padix_floor = PL_padix;
1608 PL_pad_reset_pending = FALSE;
1610 PL_hints &= ~HINT_BLOCK_SCOPE;
1615 block_end(I32 floor, OP *seq)
1618 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1619 OP* retval = scalarseq(seq);
1621 PL_pad_reset_pending = FALSE;
1623 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1624 pad_leavemy(PL_comppad_name_fill);
1633 OP *o = newOP(OP_THREADSV, 0);
1634 o->op_targ = find_threadsv("_");
1637 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1638 #endif /* USE_THREADS */
1646 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1647 PL_eval_start = linklist(PL_eval_root);
1648 PL_eval_root->op_next = 0;
1649 peep(PL_eval_start);
1654 PL_main_root = scope(sawparens(scalarvoid(o)));
1655 PL_curcop = &PL_compiling;
1656 PL_main_start = LINKLIST(PL_main_root);
1657 PL_main_root->op_next = 0;
1658 peep(PL_main_start);
1661 /* Register with debugger */
1663 CV *cv = perl_get_cv("DB::postponed", FALSE);
1667 XPUSHs((SV*)PL_compiling.cop_filegv);
1669 perl_call_sv((SV*)cv, G_DISCARD);
1676 localize(OP *o, I32 lex)
1678 if (o->op_flags & OPf_PARENS)
1681 if (PL_dowarn && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1683 for (s = PL_bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1684 if (*s == ';' || *s == '=')
1685 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1689 PL_in_my_stash = Nullhv;
1693 return mod(o, OP_NULL); /* a bit kludgey */
1699 if (o->op_type == OP_LIST) {
1702 o2 = newOP(OP_THREADSV, 0);
1703 o2->op_targ = find_threadsv(";");
1705 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1706 #endif /* USE_THREADS */
1707 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1713 fold_constants(register OP *o)
1717 I32 type = o->op_type;
1720 if (opargs[type] & OA_RETSCALAR)
1722 if (opargs[type] & OA_TARGET)
1723 o->op_targ = pad_alloc(type, SVs_PADTMP);
1725 if ((opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1726 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1728 if (!(opargs[type] & OA_FOLDCONST))
1743 if (o->op_private & OPpLOCALE)
1748 goto nope; /* Don't try to run w/ errors */
1750 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1751 if (curop->op_type != OP_CONST &&
1752 curop->op_type != OP_LIST &&
1753 curop->op_type != OP_SCALAR &&
1754 curop->op_type != OP_NULL &&
1755 curop->op_type != OP_PUSHMARK) {
1760 curop = LINKLIST(o);
1764 sv = *(PL_stack_sp--);
1765 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1766 pad_swipe(o->op_targ);
1767 else if (SvTEMP(sv)) { /* grab mortal temp? */
1768 (void)SvREFCNT_inc(sv);
1772 if (type == OP_RV2GV)
1773 return newGVOP(OP_GV, 0, (GV*)sv);
1775 /* try to smush double to int, but don't smush -2.0 to -2 */
1776 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1780 if ((double)iv == SvNV(sv)) {
1785 SvIOK_off(sv); /* undo SvIV() damage */
1787 return newSVOP(OP_CONST, 0, sv);
1791 if (!(opargs[type] & OA_OTHERINT))
1794 if (!(PL_hints & HINT_INTEGER)) {
1795 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1798 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1799 if (curop->op_type == OP_CONST) {
1800 if (SvIOK(((SVOP*)curop)->op_sv))
1804 if (opargs[curop->op_type] & OA_RETINTEGER)
1808 o->op_ppaddr = ppaddr[++(o->op_type)];
1815 gen_constant_list(register OP *o)
1819 I32 oldtmps_floor = PL_tmps_floor;
1823 return o; /* Don't attempt to run with errors */
1825 PL_op = curop = LINKLIST(o);
1831 PL_tmps_floor = oldtmps_floor;
1833 o->op_type = OP_RV2AV;
1834 o->op_ppaddr = ppaddr[OP_RV2AV];
1835 curop = ((UNOP*)o)->op_first;
1836 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1843 convert(I32 type, I32 flags, OP *o)
1848 if (!o || o->op_type != OP_LIST)
1849 o = newLISTOP(OP_LIST, 0, o, Nullop);
1851 o->op_flags &= ~OPf_WANT;
1853 if (!(opargs[type] & OA_MARK))
1854 null(cLISTOPo->op_first);
1857 o->op_ppaddr = ppaddr[type];
1858 o->op_flags |= flags;
1860 o = CHECKOP(type, o);
1861 if (o->op_type != type)
1864 if (cLISTOPo->op_children < 7) {
1865 /* XXX do we really need to do this if we're done appending?? */
1866 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1868 cLISTOPo->op_last = last; /* in case check substituted last arg */
1871 return fold_constants(o);
1874 /* List constructors */
1877 append_elem(I32 type, OP *first, OP *last)
1885 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1886 return newLISTOP(type, 0, first, last);
1888 if (first->op_flags & OPf_KIDS)
1889 ((LISTOP*)first)->op_last->op_sibling = last;
1891 first->op_flags |= OPf_KIDS;
1892 ((LISTOP*)first)->op_first = last;
1894 ((LISTOP*)first)->op_last = last;
1895 ((LISTOP*)first)->op_children++;
1900 append_list(I32 type, LISTOP *first, LISTOP *last)
1908 if (first->op_type != type)
1909 return prepend_elem(type, (OP*)first, (OP*)last);
1911 if (last->op_type != type)
1912 return append_elem(type, (OP*)first, (OP*)last);
1914 first->op_last->op_sibling = last->op_first;
1915 first->op_last = last->op_last;
1916 first->op_children += last->op_children;
1917 if (first->op_children)
1918 first->op_flags |= OPf_KIDS;
1925 prepend_elem(I32 type, OP *first, OP *last)
1933 if (last->op_type == type) {
1934 if (type == OP_LIST) { /* already a PUSHMARK there */
1935 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1936 ((LISTOP*)last)->op_first->op_sibling = first;
1939 if (!(last->op_flags & OPf_KIDS)) {
1940 ((LISTOP*)last)->op_last = first;
1941 last->op_flags |= OPf_KIDS;
1943 first->op_sibling = ((LISTOP*)last)->op_first;
1944 ((LISTOP*)last)->op_first = first;
1946 ((LISTOP*)last)->op_children++;
1950 return newLISTOP(type, 0, first, last);
1958 return newOP(OP_STUB, 0);
1964 if (!o || o->op_type != OP_LIST)
1965 o = newLISTOP(OP_LIST, 0, o, Nullop);
1971 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1975 Newz(1101, listop, 1, LISTOP);
1977 listop->op_type = type;
1978 listop->op_ppaddr = ppaddr[type];
1979 listop->op_children = (first != 0) + (last != 0);
1980 listop->op_flags = flags;
1984 else if (!first && last)
1987 first->op_sibling = last;
1988 listop->op_first = first;
1989 listop->op_last = last;
1990 if (type == OP_LIST) {
1992 pushop = newOP(OP_PUSHMARK, 0);
1993 pushop->op_sibling = first;
1994 listop->op_first = pushop;
1995 listop->op_flags |= OPf_KIDS;
1997 listop->op_last = pushop;
1999 else if (listop->op_children)
2000 listop->op_flags |= OPf_KIDS;
2006 newOP(I32 type, I32 flags)
2009 Newz(1101, o, 1, OP);
2011 o->op_ppaddr = ppaddr[type];
2012 o->op_flags = flags;
2015 o->op_private = 0 + (flags >> 8);
2016 if (opargs[type] & OA_RETSCALAR)
2018 if (opargs[type] & OA_TARGET)
2019 o->op_targ = pad_alloc(type, SVs_PADTMP);
2020 return CHECKOP(type, o);
2024 newUNOP(I32 type, I32 flags, OP *first)
2029 first = newOP(OP_STUB, 0);
2030 if (opargs[type] & OA_MARK)
2031 first = force_list(first);
2033 Newz(1101, unop, 1, UNOP);
2034 unop->op_type = type;
2035 unop->op_ppaddr = ppaddr[type];
2036 unop->op_first = first;
2037 unop->op_flags = flags | OPf_KIDS;
2038 unop->op_private = 1 | (flags >> 8);
2039 unop = (UNOP*) CHECKOP(type, unop);
2043 return fold_constants((OP *) unop);
2047 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2050 Newz(1101, binop, 1, BINOP);
2053 first = newOP(OP_NULL, 0);
2055 binop->op_type = type;
2056 binop->op_ppaddr = ppaddr[type];
2057 binop->op_first = first;
2058 binop->op_flags = flags | OPf_KIDS;
2061 binop->op_private = 1 | (flags >> 8);
2064 binop->op_private = 2 | (flags >> 8);
2065 first->op_sibling = last;
2068 binop = (BINOP*)CHECKOP(type, binop);
2072 binop->op_last = last = binop->op_first->op_sibling;
2074 return fold_constants((OP *)binop);
2078 pmtrans(OP *o, OP *expr, OP *repl)
2080 SV *tstr = ((SVOP*)expr)->op_sv;
2081 SV *rstr = ((SVOP*)repl)->op_sv;
2084 register U8 *t = (U8*)SvPV(tstr, tlen);
2085 register U8 *r = (U8*)SvPV(rstr, rlen);
2091 register short *tbl;
2093 tbl = (short*)cPVOPo->op_pv;
2094 complement = o->op_private & OPpTRANS_COMPLEMENT;
2095 Delete = o->op_private & OPpTRANS_DELETE;
2096 squash = o->op_private & OPpTRANS_SQUASH;
2099 Zero(tbl, 256, short);
2100 for (i = 0; i < tlen; i++)
2102 for (i = 0, j = 0; i < 256; i++) {
2118 if (!rlen && !Delete) {
2121 o->op_private |= OPpTRANS_COUNTONLY;
2123 for (i = 0; i < 256; i++)
2125 for (i = 0, j = 0; i < tlen; i++,j++) {
2128 if (tbl[t[i]] == -1)
2134 if (tbl[t[i]] == -1)
2145 newPMOP(I32 type, I32 flags)
2150 Newz(1101, pmop, 1, PMOP);
2151 pmop->op_type = type;
2152 pmop->op_ppaddr = ppaddr[type];
2153 pmop->op_flags = flags;
2154 pmop->op_private = 0 | (flags >> 8);
2156 if (PL_hints & HINT_RE_TAINT)
2157 pmop->op_pmpermflags |= PMf_RETAINT;
2158 if (PL_hints & HINT_LOCALE)
2159 pmop->op_pmpermflags |= PMf_LOCALE;
2160 pmop->op_pmflags = pmop->op_pmpermflags;
2162 /* link into pm list */
2163 if (type != OP_TRANS && PL_curstash) {
2164 pmop->op_pmnext = HvPMROOT(PL_curstash);
2165 HvPMROOT(PL_curstash) = pmop;
2172 pmruntime(OP *o, OP *expr, OP *repl)
2177 I32 repl_has_vars = 0;
2179 if (o->op_type == OP_TRANS)
2180 return pmtrans(o, expr, repl);
2182 PL_hints |= HINT_BLOCK_SCOPE;
2185 if (expr->op_type == OP_CONST) {
2187 SV *pat = ((SVOP*)expr)->op_sv;
2188 char *p = SvPV(pat, plen);
2189 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2190 sv_setpvn(pat, "\\s+", 3);
2191 p = SvPV(pat, plen);
2192 pm->op_pmflags |= PMf_SKIPWHITE;
2194 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2195 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2196 pm->op_pmflags |= PMf_WHITE;
2200 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2201 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2203 : OP_REGCMAYBE),0,expr);
2205 Newz(1101, rcop, 1, LOGOP);
2206 rcop->op_type = OP_REGCOMP;
2207 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2208 rcop->op_first = scalar(expr);
2209 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2210 ? (OPf_SPECIAL | OPf_KIDS)
2212 rcop->op_private = 1;
2215 /* establish postfix order */
2216 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2218 rcop->op_next = expr;
2219 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2222 rcop->op_next = LINKLIST(expr);
2223 expr->op_next = (OP*)rcop;
2226 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2231 if (pm->op_pmflags & PMf_EVAL) {
2233 if (PL_curcop->cop_line < PL_multi_end)
2234 PL_curcop->cop_line = PL_multi_end;
2237 else if (repl->op_type == OP_THREADSV
2238 && strchr("&`'123456789+",
2239 PL_threadsv_names[repl->op_targ]))
2243 #endif /* USE_THREADS */
2244 else if (repl->op_type == OP_CONST)
2248 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2249 if (opargs[curop->op_type] & OA_DANGEROUS) {
2251 if (curop->op_type == OP_THREADSV) {
2253 if (strchr("&`'123456789+", curop->op_private))
2257 if (curop->op_type == OP_GV) {
2258 GV *gv = ((GVOP*)curop)->op_gv;
2260 if (strchr("&`'123456789+", *GvENAME(gv)))
2263 #endif /* USE_THREADS */
2264 else if (curop->op_type == OP_RV2CV)
2266 else if (curop->op_type == OP_RV2SV ||
2267 curop->op_type == OP_RV2AV ||
2268 curop->op_type == OP_RV2HV ||
2269 curop->op_type == OP_RV2GV) {
2270 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2273 else if (curop->op_type == OP_PADSV ||
2274 curop->op_type == OP_PADAV ||
2275 curop->op_type == OP_PADHV ||
2276 curop->op_type == OP_PADANY) {
2279 else if (curop->op_type == OP_PUSHRE)
2280 ; /* Okay here, dangerous in newASSIGNOP */
2289 && (!pm->op_pmregexp
2290 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2291 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2292 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2293 prepend_elem(o->op_type, scalar(repl), o);
2296 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2297 pm->op_pmflags |= PMf_MAYBE_CONST;
2298 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2300 Newz(1101, rcop, 1, LOGOP);
2301 rcop->op_type = OP_SUBSTCONT;
2302 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2303 rcop->op_first = scalar(repl);
2304 rcop->op_flags |= OPf_KIDS;
2305 rcop->op_private = 1;
2308 /* establish postfix order */
2309 rcop->op_next = LINKLIST(repl);
2310 repl->op_next = (OP*)rcop;
2312 pm->op_pmreplroot = scalar((OP*)rcop);
2313 pm->op_pmreplstart = LINKLIST(rcop);
2322 newSVOP(I32 type, I32 flags, SV *sv)
2325 Newz(1101, svop, 1, SVOP);
2326 svop->op_type = type;
2327 svop->op_ppaddr = ppaddr[type];
2329 svop->op_next = (OP*)svop;
2330 svop->op_flags = flags;
2331 if (opargs[type] & OA_RETSCALAR)
2333 if (opargs[type] & OA_TARGET)
2334 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2335 return CHECKOP(type, svop);
2339 newGVOP(I32 type, I32 flags, GV *gv)
2343 Newz(1101, gvop, 1, GVOP);
2344 gvop->op_type = type;
2345 gvop->op_ppaddr = ppaddr[type];
2346 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2347 gvop->op_next = (OP*)gvop;
2348 gvop->op_flags = flags;
2349 if (opargs[type] & OA_RETSCALAR)
2351 if (opargs[type] & OA_TARGET)
2352 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2353 return CHECKOP(type, gvop);
2357 newPVOP(I32 type, I32 flags, char *pv)
2360 Newz(1101, pvop, 1, PVOP);
2361 pvop->op_type = type;
2362 pvop->op_ppaddr = ppaddr[type];
2364 pvop->op_next = (OP*)pvop;
2365 pvop->op_flags = flags;
2366 if (opargs[type] & OA_RETSCALAR)
2368 if (opargs[type] & OA_TARGET)
2369 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2370 return CHECKOP(type, pvop);
2379 save_hptr(&PL_curstash);
2380 save_item(PL_curstname);
2385 name = SvPV(sv, len);
2386 PL_curstash = gv_stashpvn(name,len,TRUE);
2387 sv_setpvn(PL_curstname, name, len);
2391 sv_setpv(PL_curstname,"<none>");
2392 PL_curstash = Nullhv;
2394 PL_hints |= HINT_BLOCK_SCOPE;
2395 PL_copline = NOLINE;
2400 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2409 if (id->op_type != OP_CONST)
2410 croak("Module name must be constant");
2414 if(version != Nullop) {
2415 SV *vesv = ((SVOP*)version)->op_sv;
2417 if (arg == Nullop && !SvNIOK(vesv)) {
2424 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2425 croak("Version number must be constant number");
2427 /* Make copy of id so we don't free it twice */
2428 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2430 /* Fake up a method call to VERSION */
2431 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2432 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2433 append_elem(OP_LIST,
2434 prepend_elem(OP_LIST, pack, list(version)),
2435 newUNOP(OP_METHOD, 0, meth)));
2439 /* Fake up an import/unimport */
2440 if (arg && arg->op_type == OP_STUB)
2441 imop = arg; /* no import on explicit () */
2442 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2443 imop = Nullop; /* use 5.0; */
2446 /* Make copy of id so we don't free it twice */
2447 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2448 meth = newSVOP(OP_CONST, 0,
2450 ? newSVpv("import", 6)
2451 : newSVpv("unimport", 8)
2453 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2454 append_elem(OP_LIST,
2455 prepend_elem(OP_LIST, pack, list(arg)),
2456 newUNOP(OP_METHOD, 0, meth)));
2459 /* Fake up a require, handle override, if any */
2460 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2461 if (!(gv && GvIMPORTED_CV(gv)))
2462 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2464 if (gv && GvIMPORTED_CV(gv)) {
2465 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2466 append_elem(OP_LIST, id,
2467 scalar(newUNOP(OP_RV2CV, 0,
2472 rqop = newUNOP(OP_REQUIRE, 0, id);
2475 /* Fake up the BEGIN {}, which does its thing immediately. */
2477 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2479 append_elem(OP_LINESEQ,
2480 append_elem(OP_LINESEQ,
2481 newSTATEOP(0, Nullch, rqop),
2482 newSTATEOP(0, Nullch, veop)),
2483 newSTATEOP(0, Nullch, imop) ));
2485 PL_copline = NOLINE;
2495 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2496 if (!(gv && GvIMPORTED_CV(gv)))
2497 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2499 if (gv && GvIMPORTED_CV(gv)) {
2500 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2501 append_elem(OP_LIST, term,
2502 scalar(newUNOP(OP_RV2CV, 0,
2507 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2513 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2515 return newBINOP(OP_LSLICE, flags,
2516 list(force_list(subscript)),
2517 list(force_list(listval)) );
2521 list_assignment(register OP *o)
2526 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2527 o = cUNOPo->op_first;
2529 if (o->op_type == OP_COND_EXPR) {
2530 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2531 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2536 yyerror("Assignment to both a list and a scalar");
2540 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2541 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2542 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2545 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2548 if (o->op_type == OP_RV2SV)
2555 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2560 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2561 return newLOGOP(optype, 0,
2562 mod(scalar(left), optype),
2563 newUNOP(OP_SASSIGN, 0, scalar(right)));
2566 return newBINOP(optype, OPf_STACKED,
2567 mod(scalar(left), optype), scalar(right));
2571 if (list_assignment(left)) {
2574 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2575 left = mod(left, OP_AASSIGN);
2583 o = newBINOP(OP_AASSIGN, flags,
2584 list(force_list(right)),
2585 list(force_list(left)) );
2586 o->op_private = 0 | (flags >> 8);
2587 if (!(left->op_private & OPpLVAL_INTRO)) {
2591 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2592 if (opargs[curop->op_type] & OA_DANGEROUS) {
2593 if (curop->op_type == OP_GV) {
2594 GV *gv = ((GVOP*)curop)->op_gv;
2595 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2597 SvCUR(gv) = PL_generation;
2599 else if (curop->op_type == OP_PADSV ||
2600 curop->op_type == OP_PADAV ||
2601 curop->op_type == OP_PADHV ||
2602 curop->op_type == OP_PADANY) {
2603 SV **svp = AvARRAY(PL_comppad_name);
2604 SV *sv = svp[curop->op_targ];
2605 if (SvCUR(sv) == PL_generation)
2607 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2609 else if (curop->op_type == OP_RV2CV)
2611 else if (curop->op_type == OP_RV2SV ||
2612 curop->op_type == OP_RV2AV ||
2613 curop->op_type == OP_RV2HV ||
2614 curop->op_type == OP_RV2GV) {
2615 if (lastop->op_type != OP_GV) /* funny deref? */
2618 else if (curop->op_type == OP_PUSHRE) {
2619 if (((PMOP*)curop)->op_pmreplroot) {
2620 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2621 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2623 SvCUR(gv) = PL_generation;
2632 o->op_private = OPpASSIGN_COMMON;
2634 if (right && right->op_type == OP_SPLIT) {
2636 if ((tmpop = ((LISTOP*)right)->op_first) &&
2637 tmpop->op_type == OP_PUSHRE)
2639 PMOP *pm = (PMOP*)tmpop;
2640 if (left->op_type == OP_RV2AV &&
2641 !(left->op_private & OPpLVAL_INTRO) &&
2642 !(o->op_private & OPpASSIGN_COMMON) )
2644 tmpop = ((UNOP*)left)->op_first;
2645 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2646 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2647 pm->op_pmflags |= PMf_ONCE;
2648 tmpop = cUNOPo->op_first; /* to list (nulled) */
2649 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2650 tmpop->op_sibling = Nullop; /* don't free split */
2651 right->op_next = tmpop->op_next; /* fix starting loc */
2652 op_free(o); /* blow off assign */
2653 right->op_flags &= ~OPf_WANT;
2654 /* "I don't know and I don't care." */
2659 if (PL_modcount < 10000 &&
2660 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2662 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2664 sv_setiv(sv, PL_modcount+1);
2672 right = newOP(OP_UNDEF, 0);
2673 if (right->op_type == OP_READLINE) {
2674 right->op_flags |= OPf_STACKED;
2675 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2678 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2679 o = newBINOP(OP_SASSIGN, flags,
2680 scalar(right), mod(scalar(left), OP_SASSIGN) );
2692 newSTATEOP(I32 flags, char *label, OP *o)
2695 U32 seq = intro_my();
2698 Newz(1101, cop, 1, COP);
2699 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2700 cop->op_type = OP_DBSTATE;
2701 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2704 cop->op_type = OP_NEXTSTATE;
2705 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2707 cop->op_flags = flags;
2708 cop->op_private = 0 | (flags >> 8);
2710 cop->op_private |= NATIVE_HINTS;
2712 cop->op_next = (OP*)cop;
2715 cop->cop_label = label;
2716 PL_hints |= HINT_BLOCK_SCOPE;
2719 cop->cop_arybase = PL_curcop->cop_arybase;
2721 if (PL_copline == NOLINE)
2722 cop->cop_line = PL_curcop->cop_line;
2724 cop->cop_line = PL_copline;
2725 PL_copline = NOLINE;
2727 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2728 cop->cop_stash = PL_curstash;
2730 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2731 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2732 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2733 (void)SvIOK_on(*svp);
2735 SvSTASH(*svp) = (HV*)cop;
2739 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2742 /* "Introduce" my variables to visible status. */
2750 if (! PL_min_intro_pending)
2751 return PL_cop_seqmax;
2753 svp = AvARRAY(PL_comppad_name);
2754 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2755 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2756 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
2757 SvNVX(sv) = (double)PL_cop_seqmax;
2760 PL_min_intro_pending = 0;
2761 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2762 return PL_cop_seqmax++;
2766 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2768 return new_logop(type, flags, &first, &other);
2772 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2777 OP *first = *firstp;
2778 OP *other = *otherp;
2780 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2781 return newBINOP(type, flags, scalar(first), scalar(other));
2783 scalarboolean(first);
2784 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2785 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2786 if (type == OP_AND || type == OP_OR) {
2792 first = *firstp = cUNOPo->op_first;
2794 first->op_next = o->op_next;
2795 cUNOPo->op_first = Nullop;
2799 if (first->op_type == OP_CONST) {
2800 if (PL_dowarn && (first->op_private & OPpCONST_BARE))
2801 warn("Probable precedence problem on %s", op_desc[type]);
2802 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2813 else if (first->op_type == OP_WANTARRAY) {
2819 else if (PL_dowarn && (first->op_flags & OPf_KIDS)) {
2820 OP *k1 = ((UNOP*)first)->op_first;
2821 OP *k2 = k1->op_sibling;
2823 switch (first->op_type)
2826 if (k2 && k2->op_type == OP_READLINE
2827 && (k2->op_flags & OPf_STACKED)
2828 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2829 warnop = k2->op_type;
2833 if (k1->op_type == OP_READDIR
2834 || k1->op_type == OP_GLOB
2835 || k1->op_type == OP_EACH)
2836 warnop = k1->op_type;
2840 line_t oldline = PL_curcop->cop_line;
2841 PL_curcop->cop_line = PL_copline;
2842 warn("Value of %s%s can be \"0\"; test with defined()",
2844 ((warnop == OP_READLINE || warnop == OP_GLOB)
2845 ? " construct" : "() operator"));
2846 PL_curcop->cop_line = oldline;
2853 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2854 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2856 Newz(1101, logop, 1, LOGOP);
2858 logop->op_type = type;
2859 logop->op_ppaddr = ppaddr[type];
2860 logop->op_first = first;
2861 logop->op_flags = flags | OPf_KIDS;
2862 logop->op_other = LINKLIST(other);
2863 logop->op_private = 1 | (flags >> 8);
2865 /* establish postfix order */
2866 logop->op_next = LINKLIST(first);
2867 first->op_next = (OP*)logop;
2868 first->op_sibling = other;
2870 o = newUNOP(OP_NULL, 0, (OP*)logop);
2877 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2884 return newLOGOP(OP_AND, 0, first, trueop);
2886 return newLOGOP(OP_OR, 0, first, falseop);
2888 scalarboolean(first);
2889 if (first->op_type == OP_CONST) {
2890 if (SvTRUE(((SVOP*)first)->op_sv)) {
2901 else if (first->op_type == OP_WANTARRAY) {
2905 Newz(1101, condop, 1, CONDOP);
2907 condop->op_type = OP_COND_EXPR;
2908 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2909 condop->op_first = first;
2910 condop->op_flags = flags | OPf_KIDS;
2911 condop->op_true = LINKLIST(trueop);
2912 condop->op_false = LINKLIST(falseop);
2913 condop->op_private = 1 | (flags >> 8);
2915 /* establish postfix order */
2916 condop->op_next = LINKLIST(first);
2917 first->op_next = (OP*)condop;
2919 first->op_sibling = trueop;
2920 trueop->op_sibling = falseop;
2921 o = newUNOP(OP_NULL, 0, (OP*)condop);
2923 trueop->op_next = o;
2924 falseop->op_next = o;
2930 newRANGE(I32 flags, OP *left, OP *right)
2938 Newz(1101, condop, 1, CONDOP);
2940 condop->op_type = OP_RANGE;
2941 condop->op_ppaddr = ppaddr[OP_RANGE];
2942 condop->op_first = left;
2943 condop->op_flags = OPf_KIDS;
2944 condop->op_true = LINKLIST(left);
2945 condop->op_false = LINKLIST(right);
2946 condop->op_private = 1 | (flags >> 8);
2948 left->op_sibling = right;
2950 condop->op_next = (OP*)condop;
2951 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2952 flop = newUNOP(OP_FLOP, 0, flip);
2953 o = newUNOP(OP_NULL, 0, flop);
2956 left->op_next = flip;
2957 right->op_next = flop;
2959 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2960 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2961 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2962 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2964 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2965 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2968 if (!flip->op_private || !flop->op_private)
2969 linklist(o); /* blow off optimizer unless constant */
2975 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2980 int once = block && block->op_flags & OPf_SPECIAL &&
2981 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2984 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2985 return block; /* do {} while 0 does once */
2986 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2987 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2988 expr = newUNOP(OP_DEFINED, 0,
2989 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2990 } else if (expr->op_flags & OPf_KIDS) {
2991 OP *k1 = ((UNOP*)expr)->op_first;
2992 OP *k2 = (k1) ? k1->op_sibling : NULL;
2993 switch (expr->op_type) {
2995 if (k2 && k2->op_type == OP_READLINE
2996 && (k2->op_flags & OPf_STACKED)
2997 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2998 expr = newUNOP(OP_DEFINED, 0, expr);
3002 if (k1->op_type == OP_READDIR
3003 || k1->op_type == OP_GLOB
3004 || k1->op_type == OP_EACH)
3005 expr = newUNOP(OP_DEFINED, 0, expr);
3011 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3012 o = new_logop(OP_AND, 0, &expr, &listop);
3015 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3017 if (once && o != listop)
3018 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3021 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3023 o->op_flags |= flags;
3025 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3030 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3039 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3040 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3041 expr = newUNOP(OP_DEFINED, 0,
3042 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3043 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3044 OP *k1 = ((UNOP*)expr)->op_first;
3045 OP *k2 = (k1) ? k1->op_sibling : NULL;
3046 switch (expr->op_type) {
3048 if (k2 && k2->op_type == OP_READLINE
3049 && (k2->op_flags & OPf_STACKED)
3050 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3051 expr = newUNOP(OP_DEFINED, 0, expr);
3055 if (k1->op_type == OP_READDIR
3056 || k1->op_type == OP_GLOB
3057 || k1->op_type == OP_EACH)
3058 expr = newUNOP(OP_DEFINED, 0, expr);
3064 block = newOP(OP_NULL, 0);
3067 next = LINKLIST(cont);
3069 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3070 if ((line_t)whileline != NOLINE) {
3071 PL_copline = whileline;
3072 cont = append_elem(OP_LINESEQ, cont,
3073 newSTATEOP(0, Nullch, Nullop));
3077 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3078 redo = LINKLIST(listop);
3081 PL_copline = whileline;
3083 o = new_logop(OP_AND, 0, &expr, &listop);
3084 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3085 op_free(expr); /* oops, it's a while (0) */
3087 return Nullop; /* listop already freed by new_logop */
3090 ((LISTOP*)listop)->op_last->op_next = condop =
3091 (o == listop ? redo : LINKLIST(o));
3099 Newz(1101,loop,1,LOOP);
3100 loop->op_type = OP_ENTERLOOP;
3101 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
3102 loop->op_private = 0;
3103 loop->op_next = (OP*)loop;
3106 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3108 loop->op_redoop = redo;
3109 loop->op_lastop = o;
3112 loop->op_nextop = next;
3114 loop->op_nextop = o;
3116 o->op_flags |= flags;
3117 o->op_private |= (flags >> 8);
3122 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3130 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3131 sv->op_type = OP_RV2GV;
3132 sv->op_ppaddr = ppaddr[OP_RV2GV];
3134 else if (sv->op_type == OP_PADSV) { /* private variable */
3135 padoff = sv->op_targ;
3139 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3140 padoff = sv->op_targ;
3141 iterflags |= OPf_SPECIAL;
3146 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3150 padoff = find_threadsv("_");
3151 iterflags |= OPf_SPECIAL;
3153 sv = newGVOP(OP_GV, 0, PL_defgv);
3156 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3157 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3158 iterflags |= OPf_STACKED;
3160 else if (expr->op_type == OP_NULL &&
3161 (expr->op_flags & OPf_KIDS) &&
3162 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3164 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3165 * set the STACKED flag to indicate that these values are to be
3166 * treated as min/max values by 'pp_iterinit'.
3168 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3169 CONDOP* range = (CONDOP*) flip->op_first;
3170 OP* left = range->op_first;
3171 OP* right = left->op_sibling;
3174 range->op_flags &= ~OPf_KIDS;
3175 range->op_first = Nullop;
3177 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3178 listop->op_first->op_next = range->op_true;
3179 left->op_next = range->op_false;
3180 right->op_next = (OP*)listop;
3181 listop->op_next = listop->op_first;
3184 expr = (OP*)(listop);
3186 iterflags |= OPf_STACKED;
3189 expr = mod(force_list(expr), OP_GREPSTART);
3193 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3194 append_elem(OP_LIST, expr, scalar(sv))));
3195 assert(!loop->op_next);
3196 Renew(loop, 1, LOOP);
3197 loop->op_targ = padoff;
3198 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3199 PL_copline = forline;
3200 return newSTATEOP(0, label, wop);
3204 newLOOPEX(I32 type, OP *label)
3209 if (type != OP_GOTO || label->op_type == OP_CONST) {
3210 /* "last()" means "last" */
3211 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3212 o = newOP(type, OPf_SPECIAL);
3214 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3215 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3221 if (label->op_type == OP_ENTERSUB)
3222 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3223 o = newUNOP(type, OPf_STACKED, label);
3225 PL_hints |= HINT_BLOCK_SCOPE;
3235 MUTEX_DESTROY(CvMUTEXP(cv));
3236 Safefree(CvMUTEXP(cv));
3239 #endif /* USE_THREADS */
3241 if (!CvXSUB(cv) && CvROOT(cv)) {
3243 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3244 croak("Can't undef active subroutine");
3247 croak("Can't undef active subroutine");
3248 #endif /* USE_THREADS */
3251 SAVESPTR(PL_curpad);
3255 op_free(CvROOT(cv));
3256 CvROOT(cv) = Nullop;
3259 SvPOK_off((SV*)cv); /* forget prototype */
3261 SvREFCNT_dec(CvGV(cv));
3263 SvREFCNT_dec(CvOUTSIDE(cv));
3264 CvOUTSIDE(cv) = Nullcv;
3265 if (CvPADLIST(cv)) {
3266 /* may be during global destruction */
3267 if (SvREFCNT(CvPADLIST(cv))) {
3268 I32 i = AvFILLp(CvPADLIST(cv));
3270 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3271 SV* sv = svp ? *svp : Nullsv;
3274 if (sv == (SV*)PL_comppad_name)
3275 PL_comppad_name = Nullav;
3276 else if (sv == (SV*)PL_comppad) {
3277 PL_comppad = Nullav;
3278 PL_curpad = Null(SV**);
3282 SvREFCNT_dec((SV*)CvPADLIST(cv));
3284 CvPADLIST(cv) = Nullav;
3288 #ifdef DEBUG_CLOSURES
3293 CV *outside = CvOUTSIDE(cv);
3294 AV* padlist = CvPADLIST(cv);
3301 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3303 (CvANON(cv) ? "ANON"
3304 : (cv == PL_main_cv) ? "MAIN"
3305 : CvUNIQUE(cv) ? "UNIQUE"
3306 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3309 : CvANON(outside) ? "ANON"
3310 : (outside == PL_main_cv) ? "MAIN"
3311 : CvUNIQUE(outside) ? "UNIQUE"
3312 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3317 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3318 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3319 pname = AvARRAY(pad_name);
3320 ppad = AvARRAY(pad);
3322 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3323 if (SvPOK(pname[ix]))
3324 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3326 SvFAKE(pname[ix]) ? "FAKE " : "",
3328 (long)I_32(SvNVX(pname[ix])),
3329 (long)SvIVX(pname[ix]));
3332 #endif /* DEBUG_CLOSURES */
3335 cv_clone2(CV *proto, CV *outside)
3340 AV* protopadlist = CvPADLIST(proto);
3341 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3342 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3343 SV** pname = AvARRAY(protopad_name);
3344 SV** ppad = AvARRAY(protopad);
3345 I32 fname = AvFILLp(protopad_name);
3346 I32 fpad = AvFILLp(protopad);
3350 assert(!CvUNIQUE(proto));
3353 SAVESPTR(PL_curpad);
3354 SAVESPTR(PL_comppad);
3355 SAVESPTR(PL_comppad_name);
3356 SAVESPTR(PL_compcv);
3358 cv = PL_compcv = (CV*)NEWSV(1104,0);
3359 sv_upgrade((SV *)cv, SvTYPE(proto));
3365 New(666, CvMUTEXP(cv), 1, perl_mutex);
3366 MUTEX_INIT(CvMUTEXP(cv));
3368 #endif /* USE_THREADS */
3369 CvFILEGV(cv) = CvFILEGV(proto);
3370 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3371 CvSTASH(cv) = CvSTASH(proto);
3372 CvROOT(cv) = CvROOT(proto);
3373 CvSTART(cv) = CvSTART(proto);
3375 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3378 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3380 PL_comppad_name = newAV();
3381 for (ix = fname; ix >= 0; ix--)
3382 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3384 PL_comppad = newAV();
3386 comppadlist = newAV();
3387 AvREAL_off(comppadlist);
3388 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3389 av_store(comppadlist, 1, (SV*)PL_comppad);
3390 CvPADLIST(cv) = comppadlist;
3391 av_fill(PL_comppad, AvFILLp(protopad));
3392 PL_curpad = AvARRAY(PL_comppad);
3394 av = newAV(); /* will be @_ */
3396 av_store(PL_comppad, 0, (SV*)av);
3397 AvFLAGS(av) = AVf_REIFY;
3399 for (ix = fpad; ix > 0; ix--) {
3400 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3401 if (namesv && namesv != &PL_sv_undef) {
3402 char *name = SvPVX(namesv); /* XXX */
3403 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3404 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3405 CvOUTSIDE(cv), cxstack_ix, 0, 0);
3407 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3409 croak("panic: cv_clone: %s", name);
3411 else { /* our own lexical */
3414 /* anon code -- we'll come back for it */
3415 sv = SvREFCNT_inc(ppad[ix]);
3417 else if (*name == '@')
3419 else if (*name == '%')
3429 SV* sv = NEWSV(0,0);
3435 /* Now that vars are all in place, clone nested closures. */
3437 for (ix = fpad; ix > 0; ix--) {
3438 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3440 && namesv != &PL_sv_undef
3441 && !(SvFLAGS(namesv) & SVf_FAKE)
3442 && *SvPVX(namesv) == '&'
3443 && CvCLONE(ppad[ix]))
3445 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3446 SvREFCNT_dec(ppad[ix]);
3449 PL_curpad[ix] = (SV*)kid;
3453 #ifdef DEBUG_CLOSURES
3454 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3456 PerlIO_printf(Perl_debug_log, " from:\n");
3458 PerlIO_printf(Perl_debug_log, " to:\n");
3470 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3471 cv = cv_clone2(proto, CvOUTSIDE(proto));
3472 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3477 cv_ckproto(CV *cv, GV *gv, char *p)
3479 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3480 SV* msg = sv_newmortal();
3484 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3485 sv_setpv(msg, "Prototype mismatch:");
3487 sv_catpvf(msg, " sub %_", name);
3489 sv_catpvf(msg, " (%s)", SvPVX(cv));
3490 sv_catpv(msg, " vs ");
3492 sv_catpvf(msg, "(%s)", p);
3494 sv_catpv(msg, "none");
3502 if (!cv || !SvPOK(cv) || SvCUR(cv))
3504 return op_const_sv(CvSTART(cv), cv);
3508 op_const_sv(OP *o, CV *cv)
3515 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3516 o = cLISTOPo->op_first->op_sibling;
3518 for (; o; o = o->op_next) {
3519 OPCODE type = o->op_type;
3521 if(sv && o->op_next == o)
3523 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3525 if (type == OP_LEAVESUB || type == OP_RETURN)
3529 if (type == OP_CONST)
3531 else if (type == OP_PADSV && cv) {
3532 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3533 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3534 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3546 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3550 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3551 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3552 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3553 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3562 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3563 maximum a prototype before. */
3564 if (SvTYPE(gv) > SVt_NULL) {
3565 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3566 warn("Runaway prototype");
3567 cv_ckproto((CV*)gv, NULL, ps);
3570 sv_setpv((SV*)gv, ps);
3572 sv_setiv((SV*)gv, -1);
3573 SvREFCNT_dec(PL_compcv);
3574 cv = PL_compcv = NULL;
3575 PL_sub_generation++;
3579 if (!name || GvCVGEN(gv))
3581 else if (cv = GvCV(gv)) {
3582 cv_ckproto(cv, gv, ps);
3583 /* already defined (or promised)? */
3584 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3586 bool const_changed = TRUE;
3588 /* just a "sub foo;" when &foo is already defined */
3589 SAVEFREESV(PL_compcv);
3592 /* ahem, death to those who redefine active sort subs */
3593 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3594 croak("Can't redefine active sort subroutine %s", name);
3595 if(const_sv = cv_const_sv(cv))
3596 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3597 if ((const_sv && const_changed) || PL_dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3598 && HvNAME(GvSTASH(CvGV(cv)))
3599 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3601 line_t oldline = PL_curcop->cop_line;
3602 PL_curcop->cop_line = PL_copline;
3603 warn(const_sv ? "Constant subroutine %s redefined"
3604 : "Subroutine %s redefined", name);
3605 PL_curcop->cop_line = oldline;
3611 if (cv) { /* must reuse cv if autoloaded */
3613 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3614 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3615 CvOUTSIDE(PL_compcv) = 0;
3616 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3617 CvPADLIST(PL_compcv) = 0;
3618 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3619 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3620 SvREFCNT_dec(PL_compcv);
3627 PL_sub_generation++;
3630 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3631 CvFILEGV(cv) = PL_curcop->cop_filegv;
3632 CvSTASH(cv) = PL_curstash;
3635 if (!CvMUTEXP(cv)) {
3636 New(666, CvMUTEXP(cv), 1, perl_mutex);
3637 MUTEX_INIT(CvMUTEXP(cv));
3639 #endif /* USE_THREADS */
3642 sv_setpv((SV*)cv, ps);
3644 if (PL_error_count) {
3648 char *s = strrchr(name, ':');
3650 if (strEQ(s, "BEGIN")) {
3652 "BEGIN not safe after errors--compilation aborted";
3656 /* force display of errors found but not reported */
3657 sv_catpv(ERRSV, not_safe);
3658 croak("%s", SvPVx(ERRSV, n_a));
3665 PL_copline = NOLINE;
3670 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3671 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3674 SV **namep = AvARRAY(PL_comppad_name);
3675 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3678 if (SvIMMORTAL(PL_curpad[ix]))
3681 * The only things that a clonable function needs in its
3682 * pad are references to outer lexicals and anonymous subs.
3683 * The rest are created anew during cloning.
3685 if (!((namesv = namep[ix]) != Nullsv &&
3686 namesv != &PL_sv_undef &&
3688 *SvPVX(namesv) == '&')))
3690 SvREFCNT_dec(PL_curpad[ix]);
3691 PL_curpad[ix] = Nullsv;
3696 AV *av = newAV(); /* Will be @_ */
3698 av_store(PL_comppad, 0, (SV*)av);
3699 AvFLAGS(av) = AVf_REIFY;
3701 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3702 if (SvIMMORTAL(PL_curpad[ix]))
3704 if (!SvPADMY(PL_curpad[ix]))
3705 SvPADTMP_on(PL_curpad[ix]);
3709 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3710 CvSTART(cv) = LINKLIST(CvROOT(cv));
3711 CvROOT(cv)->op_next = 0;
3717 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3718 SV *sv = NEWSV(0,0);
3719 SV *tmpstr = sv_newmortal();
3720 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3724 sv_setpvf(sv, "%_:%ld-%ld",
3725 GvSV(PL_curcop->cop_filegv),
3726 (long)PL_subline, (long)PL_curcop->cop_line);
3727 gv_efullname3(tmpstr, gv, Nullch);
3728 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3729 hv = GvHVn(db_postponed);
3730 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3731 && (cv = GvCV(db_postponed))) {
3736 perl_call_sv((SV*)cv, G_DISCARD);
3740 if ((s = strrchr(name,':')))
3744 if (strEQ(s, "BEGIN")) {
3745 I32 oldscope = PL_scopestack_ix;
3747 SAVESPTR(PL_compiling.cop_filegv);
3748 SAVEI16(PL_compiling.cop_line);
3750 sv_setsv(PL_rs, PL_nrs);
3753 PL_beginav = newAV();
3754 DEBUG_x( dump_sub(gv) );
3755 av_push(PL_beginav, (SV *)cv);
3757 call_list(oldscope, PL_beginav);
3759 PL_curcop = &PL_compiling;
3762 else if (strEQ(s, "END") && !PL_error_count) {
3765 av_unshift(PL_endav, 1);
3766 av_store(PL_endav, 0, (SV *)cv);
3769 else if (strEQ(s, "INIT") && !PL_error_count) {
3771 PL_initav = newAV();
3772 av_push(PL_initav, SvREFCNT_inc(cv));
3778 PL_copline = NOLINE;
3783 /* XXX unsafe for threads if eval_owner isn't held */
3785 newCONSTSUB(HV *stash, char *name, SV *sv)
3788 U32 oldhints = PL_hints;
3789 HV *old_cop_stash = PL_curcop->cop_stash;
3790 HV *old_curstash = PL_curstash;
3791 line_t oldline = PL_curcop->cop_line;
3792 PL_curcop->cop_line = PL_copline;
3794 PL_hints &= ~HINT_BLOCK_SCOPE;
3796 PL_curstash = PL_curcop->cop_stash = stash;
3799 start_subparse(FALSE, 0),
3800 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3801 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
3802 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3805 PL_hints = oldhints;
3806 PL_curcop->cop_stash = old_cop_stash;
3807 PL_curstash = old_curstash;
3808 PL_curcop->cop_line = oldline;
3812 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3815 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3818 if (cv = (name ? GvCV(gv) : Nullcv)) {
3820 /* just a cached method */
3824 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3825 /* already defined (or promised) */
3826 if (PL_dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3827 && HvNAME(GvSTASH(CvGV(cv)))
3828 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3829 line_t oldline = PL_curcop->cop_line;
3830 if (PL_copline != NOLINE)
3831 PL_curcop->cop_line = PL_copline;
3832 warn("Subroutine %s redefined",name);
3833 PL_curcop->cop_line = oldline;
3840 if (cv) /* must reuse cv if autoloaded */
3843 cv = (CV*)NEWSV(1105,0);
3844 sv_upgrade((SV *)cv, SVt_PVCV);
3848 PL_sub_generation++;
3851 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3853 New(666, CvMUTEXP(cv), 1, perl_mutex);
3854 MUTEX_INIT(CvMUTEXP(cv));
3856 #endif /* USE_THREADS */
3857 CvFILEGV(cv) = gv_fetchfile(filename);
3858 CvXSUB(cv) = subaddr;
3861 char *s = strrchr(name,':');
3866 if (strEQ(s, "BEGIN")) {
3868 PL_beginav = newAV();
3869 av_push(PL_beginav, (SV *)cv);
3872 else if (strEQ(s, "END")) {
3875 av_unshift(PL_endav, 1);
3876 av_store(PL_endav, 0, (SV *)cv);
3879 else if (strEQ(s, "INIT")) {
3881 PL_initav = newAV();
3882 av_push(PL_initav, (SV *)cv);
3893 newFORM(I32 floor, OP *o, OP *block)
3903 name = SvPVx(cSVOPo->op_sv, n_a);
3906 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3908 if (cv = GvFORM(gv)) {
3910 line_t oldline = PL_curcop->cop_line;
3912 PL_curcop->cop_line = PL_copline;
3913 warn("Format %s redefined",name);
3914 PL_curcop->cop_line = oldline;
3920 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3921 CvFILEGV(cv) = PL_curcop->cop_filegv;
3923 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3924 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
3925 SvPADTMP_on(PL_curpad[ix]);
3928 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3929 CvSTART(cv) = LINKLIST(CvROOT(cv));
3930 CvROOT(cv)->op_next = 0;
3933 PL_copline = NOLINE;
3940 return newUNOP(OP_REFGEN, 0,
3941 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3947 return newUNOP(OP_REFGEN, 0,
3948 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3952 newANONSUB(I32 floor, OP *proto, OP *block)
3954 return newUNOP(OP_REFGEN, 0,
3955 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3961 switch (o->op_type) {
3963 o->op_type = OP_PADAV;
3964 o->op_ppaddr = ppaddr[OP_PADAV];
3965 return ref(o, OP_RV2AV);
3968 o->op_type = OP_RV2AV;
3969 o->op_ppaddr = ppaddr[OP_RV2AV];
3974 warn("oops: oopsAV");
3983 switch (o->op_type) {
3986 o->op_type = OP_PADHV;
3987 o->op_ppaddr = ppaddr[OP_PADHV];
3988 return ref(o, OP_RV2HV);
3992 o->op_type = OP_RV2HV;
3993 o->op_ppaddr = ppaddr[OP_RV2HV];
3998 warn("oops: oopsHV");
4007 if (o->op_type == OP_PADANY) {
4008 o->op_type = OP_PADAV;
4009 o->op_ppaddr = ppaddr[OP_PADAV];
4012 return newUNOP(OP_RV2AV, 0, scalar(o));
4016 newGVREF(I32 type, OP *o)
4018 if (type == OP_MAPSTART || type == OP_GREPSTART)
4019 return newUNOP(OP_NULL, 0, o);
4020 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4026 if (o->op_type == OP_PADANY) {
4027 o->op_type = OP_PADHV;
4028 o->op_ppaddr = ppaddr[OP_PADHV];
4031 return newUNOP(OP_RV2HV, 0, scalar(o));
4037 croak("NOT IMPL LINE %d",__LINE__);
4043 newCVREF(I32 flags, OP *o)
4045 return newUNOP(OP_RV2CV, flags, scalar(o));
4051 if (o->op_type == OP_PADANY) {
4052 o->op_type = OP_PADSV;
4053 o->op_ppaddr = ppaddr[OP_PADSV];
4056 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4057 o->op_flags |= OPpDONE_SVREF;
4060 return newUNOP(OP_RV2SV, 0, scalar(o));
4063 /* Check routines. */
4071 name = NEWSV(1106,0);
4072 sv_upgrade(name, SVt_PVNV);
4073 sv_setpvn(name, "&", 1);
4076 ix = pad_alloc(o->op_type, SVs_PADMY);
4077 av_store(PL_comppad_name, ix, name);
4078 av_store(PL_comppad, ix, cSVOPo->op_sv);
4079 SvPADMY_on(cSVOPo->op_sv);
4080 cSVOPo->op_sv = Nullsv;
4081 cSVOPo->op_targ = ix;
4088 o->op_private = PL_hints;
4095 if (cUNOPo->op_first->op_type == OP_CONCAT)
4096 o->op_flags |= OPf_STACKED;
4103 if (o->op_flags & OPf_KIDS) {
4106 OPCODE type = o->op_type;
4107 o = modkids(ck_fun(o), type);
4108 kid = cUNOPo->op_first;
4109 newop = kUNOP->op_first->op_sibling;
4111 (newop->op_sibling ||
4112 !(opargs[newop->op_type] & OA_RETSCALAR) ||
4113 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4114 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4118 op_free(kUNOP->op_first);
4119 kUNOP->op_first = newop;
4121 o->op_ppaddr = ppaddr[++o->op_type];
4130 if (o->op_flags & OPf_KIDS) {
4131 OP *kid = cUNOPo->op_first;
4132 if (kid->op_type == OP_HSLICE)
4133 o->op_private |= OPpSLICE;
4134 else if (kid->op_type != OP_HELEM)
4135 croak("%s argument is not a HASH element or slice",
4136 op_desc[o->op_type]);
4145 I32 type = o->op_type;
4147 if (o->op_flags & OPf_KIDS) {
4148 if (cLISTOPo->op_first->op_type == OP_STUB) {
4150 o = newUNOP(type, OPf_SPECIAL,
4151 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4161 PL_hints |= HINT_BLOCK_SCOPE;
4162 if (o->op_flags & OPf_KIDS) {
4163 SVOP *kid = (SVOP*)cUNOPo->op_first;
4166 o->op_flags &= ~OPf_KIDS;
4169 else if (kid->op_type == OP_LINESEQ) {
4172 kid->op_next = o->op_next;
4173 cUNOPo->op_first = 0;
4176 Newz(1101, enter, 1, LOGOP);
4177 enter->op_type = OP_ENTERTRY;
4178 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4179 enter->op_private = 0;
4181 /* establish postfix order */
4182 enter->op_next = (OP*)enter;
4184 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4185 o->op_type = OP_LEAVETRY;
4186 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4187 enter->op_other = o;
4195 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4197 o->op_targ = (PADOFFSET)PL_hints;
4205 if (o->op_flags & OPf_STACKED) {
4207 kid = cUNOPo->op_first->op_sibling;
4208 if (kid->op_type == OP_RV2GV)
4220 if (o->op_flags & OPf_KIDS) {
4221 OP *kid = cUNOPo->op_first;
4222 if (kid->op_type != OP_HELEM)
4223 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4230 ck_gvconst(register OP *o)
4232 o = fold_constants(o);
4233 if (o->op_type == OP_CONST)
4239 ck_rvconst(register OP *o)
4242 SVOP *kid = (SVOP*)cUNOPo->op_first;
4244 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4245 if (kid->op_type == OP_CONST) {
4249 SV *kidsv = kid->op_sv;
4252 /* Is it a constant from cv_const_sv()? */
4253 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4254 SV *rsv = SvRV(kidsv);
4255 int svtype = SvTYPE(rsv);
4256 char *badtype = Nullch;
4258 switch (o->op_type) {
4260 if (svtype > SVt_PVMG)
4261 badtype = "a SCALAR";
4264 if (svtype != SVt_PVAV)
4265 badtype = "an ARRAY";
4268 if (svtype != SVt_PVHV) {
4269 if (svtype == SVt_PVAV) { /* pseudohash? */
4270 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4271 if (ksv && SvROK(*ksv)
4272 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4281 if (svtype != SVt_PVCV)
4286 croak("Constant is not %s reference", badtype);
4289 name = SvPV(kidsv, n_a);
4291 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4292 char *badthing = Nullch;
4293 switch (o->op_type) {
4295 badthing = "a SCALAR";
4298 badthing = "an ARRAY";
4301 badthing = "a HASH";
4306 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4310 * This is a little tricky. We only want to add the symbol if we
4311 * didn't add it in the lexer. Otherwise we get duplicate strict
4312 * warnings. But if we didn't add it in the lexer, we must at
4313 * least pretend like we wanted to add it even if it existed before,
4314 * or we get possible typo warnings. OPpCONST_ENTERED says
4315 * whether the lexer already added THIS instance of this symbol.
4317 iscv = (o->op_type == OP_RV2CV) * 2;
4319 gv = gv_fetchpv(name,
4320 iscv | !(kid->op_private & OPpCONST_ENTERED),
4323 : o->op_type == OP_RV2SV
4325 : o->op_type == OP_RV2AV
4327 : o->op_type == OP_RV2HV
4330 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4332 kid->op_type = OP_GV;
4333 SvREFCNT_dec(kid->op_sv);
4334 kid->op_sv = SvREFCNT_inc(gv);
4344 I32 type = o->op_type;
4346 if (o->op_flags & OPf_REF)
4349 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4350 SVOP *kid = (SVOP*)cUNOPo->op_first;
4352 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4354 OP *newop = newGVOP(type, OPf_REF,
4355 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4362 if (type == OP_FTTTY)
4363 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4366 return newUNOP(type, 0, newDEFSVOP());
4379 int type = o->op_type;
4380 register I32 oa = opargs[type] >> OASHIFT;
4382 if (o->op_flags & OPf_STACKED) {
4383 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4386 return no_fh_allowed(o);
4389 if (o->op_flags & OPf_KIDS) {
4391 tokid = &cLISTOPo->op_first;
4392 kid = cLISTOPo->op_first;
4393 if (kid->op_type == OP_PUSHMARK ||
4394 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4396 tokid = &kid->op_sibling;
4397 kid = kid->op_sibling;
4399 if (!kid && opargs[type] & OA_DEFGV)
4400 *tokid = kid = newDEFSVOP();
4404 sibl = kid->op_sibling;
4418 if (kid->op_type == OP_CONST &&
4419 (kid->op_private & OPpCONST_BARE)) {
4420 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4421 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4422 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4424 warn("Array @%s missing the @ in argument %ld of %s()",
4425 name, (long)numargs, op_desc[type]);
4428 kid->op_sibling = sibl;
4431 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4432 bad_type(numargs, "array", op_desc[o->op_type], kid);
4436 if (kid->op_type == OP_CONST &&
4437 (kid->op_private & OPpCONST_BARE)) {
4438 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4439 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4440 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4442 warn("Hash %%%s missing the %% in argument %ld of %s()",
4443 name, (long)numargs, op_desc[type]);
4446 kid->op_sibling = sibl;
4449 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4450 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4455 OP *newop = newUNOP(OP_NULL, 0, kid);
4456 kid->op_sibling = 0;
4458 newop->op_next = newop;
4460 kid->op_sibling = sibl;
4465 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4466 if (kid->op_type == OP_CONST &&
4467 (kid->op_private & OPpCONST_BARE)) {
4468 OP *newop = newGVOP(OP_GV, 0,
4469 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4474 else if (kid->op_type == OP_READLINE) {
4475 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4476 bad_type(numargs, "HANDLE", op_desc[o->op_type], kid);
4479 kid->op_sibling = 0;
4480 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4482 kid->op_sibling = sibl;
4488 mod(scalar(kid), type);
4492 tokid = &kid->op_sibling;
4493 kid = kid->op_sibling;
4495 o->op_private |= numargs;
4497 return too_many_arguments(o,op_desc[o->op_type]);
4500 else if (opargs[type] & OA_DEFGV) {
4502 return newUNOP(type, 0, newDEFSVOP());
4506 while (oa & OA_OPTIONAL)
4508 if (oa && oa != OA_LIST)
4509 return too_few_arguments(o,op_desc[o->op_type]);
4519 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4520 append_elem(OP_GLOB, o, newDEFSVOP());
4522 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4523 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4525 if (gv && GvIMPORTED_CV(gv)) {
4527 static int glob_index;
4530 append_elem(OP_GLOB, o,
4531 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4532 o->op_type = OP_LIST;
4533 o->op_ppaddr = ppaddr[OP_LIST];
4534 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4535 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4536 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4537 append_elem(OP_LIST, o,
4538 scalar(newUNOP(OP_RV2CV, 0,
4539 newGVOP(OP_GV, 0, gv)))));
4540 o = newUNOP(OP_NULL, 0, ck_subr(o));
4541 o->op_targ = OP_GLOB; /* hint at what it used to be */
4544 gv = newGVgen("main");
4546 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4556 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4558 o->op_ppaddr = ppaddr[OP_GREPSTART];
4559 Newz(1101, gwop, 1, LOGOP);
4561 if (o->op_flags & OPf_STACKED) {
4564 kid = cLISTOPo->op_first->op_sibling;
4565 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4568 kid->op_next = (OP*)gwop;
4569 o->op_flags &= ~OPf_STACKED;
4571 kid = cLISTOPo->op_first->op_sibling;
4572 if (type == OP_MAPWHILE)
4579 kid = cLISTOPo->op_first->op_sibling;
4580 if (kid->op_type != OP_NULL)
4581 croak("panic: ck_grep");
4582 kid = kUNOP->op_first;
4584 gwop->op_type = type;
4585 gwop->op_ppaddr = ppaddr[type];
4586 gwop->op_first = listkids(o);
4587 gwop->op_flags |= OPf_KIDS;
4588 gwop->op_private = 1;
4589 gwop->op_other = LINKLIST(kid);
4590 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4591 kid->op_next = (OP*)gwop;
4593 kid = cLISTOPo->op_first->op_sibling;
4594 if (!kid || !kid->op_sibling)
4595 return too_few_arguments(o,op_desc[o->op_type]);
4596 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4597 mod(kid, OP_GREPSTART);
4605 if (o->op_flags & OPf_KIDS) {
4606 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4608 kid = kid->op_sibling; /* get past "big" */
4609 if (kid && kid->op_type == OP_CONST)
4610 fbm_compile(((SVOP*)kid)->op_sv, 0);
4616 ck_lengthconst(OP *o)
4618 /* XXX length optimization goes here */
4625 OPCODE type = o->op_type;
4626 return modkids(ck_fun(o), type);
4632 OPCODE type = o->op_type;
4633 return refkids(ck_fun(o), type);
4641 kid = cLISTOPo->op_first;
4644 kid = cLISTOPo->op_first;
4646 if (kid->op_type == OP_PUSHMARK)
4647 kid = kid->op_sibling;
4648 if (kid && o->op_flags & OPf_STACKED)
4649 kid = kid->op_sibling;
4650 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4651 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4652 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4653 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4654 cLISTOPo->op_first->op_sibling = kid;
4655 cLISTOPo->op_last = kid;
4656 kid = kid->op_sibling;
4661 append_elem(o->op_type, o, newDEFSVOP());
4667 if (PL_hints & HINT_LOCALE)
4668 o->op_private |= OPpLOCALE;
4675 ck_fun_locale(OP *o)
4681 if (PL_hints & HINT_LOCALE)
4682 o->op_private |= OPpLOCALE;
4693 if (PL_hints & HINT_LOCALE)
4694 o->op_private |= OPpLOCALE;
4703 o->op_private |= OPpRUNTIME;
4716 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4717 o->op_private |= OPpREPEAT_DOLIST;
4718 cBINOPo->op_first = force_list(cBINOPo->op_first);
4728 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4729 SVOP *kid = (SVOP*)cUNOPo->op_first;
4731 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4733 for (s = SvPVX(kid->op_sv); *s; s++) {
4734 if (*s == ':' && s[1] == ':') {
4736 Move(s+2, s+1, strlen(s+2)+1, char);
4737 --SvCUR(kid->op_sv);
4740 sv_catpvn(kid->op_sv, ".pm", 3);
4749 croak("NOT IMPL LINE %d",__LINE__);
4758 if (o->op_flags & OPf_KIDS) {
4759 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4760 if (kid && kid->op_sibling) {
4761 o->op_type = OP_SSELECT;
4762 o->op_ppaddr = ppaddr[OP_SSELECT];
4764 return fold_constants(o);
4768 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4769 if (kid && kid->op_type == OP_RV2GV)
4770 kid->op_private &= ~HINT_STRICT_REFS;
4777 I32 type = o->op_type;
4779 if (!(o->op_flags & OPf_KIDS)) {
4784 if (!CvUNIQUE(PL_compcv)) {
4785 argop = newOP(OP_PADAV, OPf_REF);
4786 argop->op_targ = 0; /* PL_curpad[0] is @_ */
4789 argop = newUNOP(OP_RV2AV, 0,
4790 scalar(newGVOP(OP_GV, 0,
4791 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4794 argop = newUNOP(OP_RV2AV, 0,
4795 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
4796 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4797 #endif /* USE_THREADS */
4798 return newUNOP(type, 0, scalar(argop));
4800 return scalar(modkids(ck_fun(o), type));
4808 if (PL_hints & HINT_LOCALE)
4809 o->op_private |= OPpLOCALE;
4812 if (o->op_flags & OPf_STACKED) {
4813 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4816 if (o->op_type == OP_SORT) {
4817 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
4818 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
4820 kid = kUNOP->op_first; /* get past rv2gv */
4822 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4824 if (kid->op_type == OP_SCOPE) {
4828 else if (kid->op_type == OP_LEAVE) {
4829 if (o->op_type == OP_SORT) {
4830 null(kid); /* wipe out leave */
4833 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4834 if (k->op_next == kid)
4839 kid->op_next = 0; /* just disconnect the leave */
4840 k = kLISTOP->op_first;
4844 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4845 null(kid); /* wipe out rv2gv */
4846 if (o->op_type == OP_SORT)
4850 o->op_flags |= OPf_SPECIAL;
4852 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
4853 null(cLISTOPo->op_first->op_sibling);
4864 if (o->op_flags & OPf_STACKED)
4865 return no_fh_allowed(o);
4867 kid = cLISTOPo->op_first;
4868 if (kid->op_type != OP_NULL)
4869 croak("panic: ck_split");
4870 kid = kid->op_sibling;
4871 op_free(cLISTOPo->op_first);
4872 cLISTOPo->op_first = kid;
4874 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4875 cLISTOPo->op_last = kid; /* There was only one element previously */
4878 if (kid->op_type != OP_MATCH) {
4879 OP *sibl = kid->op_sibling;
4880 kid->op_sibling = 0;
4881 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4882 if (cLISTOPo->op_first == cLISTOPo->op_last)
4883 cLISTOPo->op_last = kid;
4884 cLISTOPo->op_first = kid;
4885 kid->op_sibling = sibl;
4888 kid->op_type = OP_PUSHRE;
4889 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4892 if (!kid->op_sibling)
4893 append_elem(OP_SPLIT, o, newDEFSVOP());
4895 kid = kid->op_sibling;
4898 if (!kid->op_sibling)
4899 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4901 kid = kid->op_sibling;
4904 if (kid->op_sibling)
4905 return too_many_arguments(o,op_desc[o->op_type]);
4914 OP *prev = ((cUNOPo->op_first->op_sibling)
4915 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4916 OP *o2 = prev->op_sibling;
4925 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4926 if (cvop->op_type == OP_RV2CV) {
4928 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4929 null(cvop); /* disable rv2cv */
4930 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4931 if (tmpop->op_type == OP_GV) {
4932 cv = GvCVu(tmpop->op_sv);
4933 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4934 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4935 proto = SvPV((SV*)cv, n_a);
4939 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4940 if (PERLDB_SUB && PL_curstash != PL_debstash)
4941 o->op_private |= OPpENTERSUB_DB;
4942 while (o2 != cvop) {
4946 return too_many_arguments(o, gv_ename(namegv));
4964 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4965 bad_type(arg, "block", gv_ename(namegv), o2);
4968 /* '*' allows any scalar type, including bareword */
4971 if (o2->op_type == OP_RV2GV)
4972 goto wrapref; /* autoconvert GLOB -> GLOBref */
4980 if (o2->op_type != OP_RV2GV)
4981 bad_type(arg, "symbol", gv_ename(namegv), o2);
4984 if (o2->op_type != OP_RV2CV)
4985 bad_type(arg, "sub", gv_ename(namegv), o2);
4988 if (o2->op_type != OP_RV2SV
4989 && o2->op_type != OP_PADSV
4990 && o2->op_type != OP_THREADSV)
4992 bad_type(arg, "scalar", gv_ename(namegv), o2);
4996 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4997 bad_type(arg, "array", gv_ename(namegv), o2);
5000 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5001 bad_type(arg, "hash", gv_ename(namegv), o2);
5005 OP* sib = kid->op_sibling;
5006 kid->op_sibling = 0;
5007 o2 = newUNOP(OP_REFGEN, 0, kid);
5008 o2->op_sibling = sib;
5009 prev->op_sibling = o2;
5020 croak("Malformed prototype for %s: %s",
5021 gv_ename(namegv), SvPV((SV*)cv, n_a));
5026 mod(o2, OP_ENTERSUB);
5028 o2 = o2->op_sibling;
5030 if (proto && !optional &&
5031 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5032 return too_few_arguments(o, gv_ename(namegv));
5039 SvREADONLY_on(cSVOPo->op_sv);
5046 if (o->op_flags & OPf_KIDS) {
5047 SVOP *kid = (SVOP*)cUNOPo->op_first;
5049 if (kid->op_type == OP_NULL)
5050 kid = (SVOP*)kid->op_sibling;
5052 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5053 o->op_flags |= OPf_SPECIAL;
5058 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5061 peep(register OP *o)
5064 register OP* oldop = 0;
5066 if (!o || o->op_seq)
5070 SAVESPTR(PL_curcop);
5071 for (; o; o = o->op_next) {
5077 switch (o->op_type) {
5080 PL_curcop = ((COP*)o); /* for warnings */
5081 o->op_seq = PL_op_seqmax++;
5092 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5094 o->op_seq = PL_op_seqmax++;
5097 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5098 o->op_seq = PL_op_seqmax++;
5099 break; /* Scalar stub must produce undef. List stub is noop */
5103 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5104 PL_curcop = ((COP*)o);
5110 if (oldop && o->op_next) {
5111 oldop->op_next = o->op_next;
5114 o->op_seq = PL_op_seqmax++;
5118 if (o->op_next->op_type == OP_RV2SV) {
5119 if (!(o->op_next->op_private & OPpDEREF)) {
5121 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5122 o->op_next = o->op_next->op_next;
5123 o->op_type = OP_GVSV;
5124 o->op_ppaddr = ppaddr[OP_GVSV];
5127 else if (o->op_next->op_type == OP_RV2AV) {
5128 OP* pop = o->op_next->op_next;
5130 if (pop->op_type == OP_CONST &&
5131 (PL_op = pop->op_next) &&
5132 pop->op_next->op_type == OP_AELEM &&
5133 !(pop->op_next->op_private &
5134 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5135 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5139 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5143 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5144 o->op_next = pop->op_next->op_next;
5145 o->op_type = OP_AELEMFAST;
5146 o->op_ppaddr = ppaddr[OP_AELEMFAST];
5147 o->op_private = (U8)i;
5148 GvAVn(((GVOP*)o)->op_gv);
5151 o->op_seq = PL_op_seqmax++;
5158 o->op_seq = PL_op_seqmax++;
5159 while (cLOGOP->op_other->op_type == OP_NULL)
5160 cLOGOP->op_other = cLOGOP->op_other->op_next;
5161 peep(cLOGOP->op_other);
5165 o->op_seq = PL_op_seqmax++;
5166 peep(cCONDOP->op_true);
5167 peep(cCONDOP->op_false);
5171 o->op_seq = PL_op_seqmax++;
5172 peep(cLOOP->op_redoop);
5173 peep(cLOOP->op_nextop);
5174 peep(cLOOP->op_lastop);
5180 o->op_seq = PL_op_seqmax++;
5181 peep(cPMOP->op_pmreplstart);
5185 o->op_seq = PL_op_seqmax++;
5186 if (PL_dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
5187 if (o->op_next->op_sibling &&
5188 o->op_next->op_sibling->op_type != OP_EXIT &&
5189 o->op_next->op_sibling->op_type != OP_WARN &&
5190 o->op_next->op_sibling->op_type != OP_DIE) {
5191 line_t oldline = PL_curcop->cop_line;
5193 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5194 warn("Statement unlikely to be reached");
5195 warn("(Maybe you meant system() when you said exec()?)\n");
5196 PL_curcop->cop_line = oldline;
5210 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5211 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5213 rop = (UNOP*)((BINOP*)o)->op_first;
5214 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5216 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5217 if (!SvOBJECT(lexname))
5219 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5220 if (!fields || !GvHV(*fields))
5222 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5223 key = SvPV(*svp, keylen);
5224 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5226 croak("No such field \"%s\" in variable %s of type %s",
5227 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5229 ind = SvIV(*indsvp);
5231 croak("Bad index while coercing array into hash");
5232 rop->op_type = OP_RV2AV;
5233 rop->op_ppaddr = ppaddr[OP_RV2AV];
5234 o->op_type = OP_AELEM;
5235 o->op_ppaddr = ppaddr[OP_AELEM];
5237 *svp = newSViv(ind);
5242 o->op_seq = PL_op_seqmax++;