3 * Copyright (c) 1991-1997, 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 static bool scalar_mod_type _((OP *o, I32 type));
40 static I32 list_assignment _((OP *o));
41 static void bad_type _((I32 n, char *t, char *name, OP *kid));
42 static OP *modkids _((OP *o, I32 type));
43 static OP *no_fh_allowed _((OP *o));
44 static OP *scalarboolean _((OP *o));
45 static OP *too_few_arguments _((OP *o, char* name));
46 static OP *too_many_arguments _((OP *o, char* name));
47 static void null _((OP* o));
48 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
49 CV* startcv, I32 cx_ix));
50 static OP *newDEFSVOP _((void));
51 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
57 SV* tmpsv = sv_newmortal();
58 gv_efullname3(tmpsv, gv, Nullch);
59 return SvPV(tmpsv,PL_na);
65 yyerror(form("Missing comma after first argument to %s function",
66 op_desc[o->op_type]));
71 too_few_arguments(OP *o, char *name)
73 yyerror(form("Not enough arguments for %s", name));
78 too_many_arguments(OP *o, char *name)
80 yyerror(form("Too many arguments for %s", name));
85 bad_type(I32 n, char *t, char *name, OP *kid)
87 yyerror(form("Type of arg %d to %s must be %s (not %s)",
88 (int)n, name, t, op_desc[kid->op_type]));
94 int type = o->op_type;
95 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
96 yyerror(form("Can't use subscript on %s", op_desc[type]));
97 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
100 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
101 type == OP_ENTERSUB ? '&' : '%'));
105 sv_catsv(GvSV(PL_errgv), msg);
107 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
112 /* "register" allocation */
115 pad_allocmy(char *name)
121 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
122 if (!isPRINT(name[1])) {
124 name[2] = toCTRL(name[1]);
127 croak("Can't use global %s in \"my\"",name);
129 if (PL_dowarn && AvFILLp(PL_comppad_name) >= 0) {
130 SV **svp = AvARRAY(PL_comppad_name);
131 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
133 && sv != &PL_sv_undef
134 && SvIVX(sv) == 999999999 /* var is in open scope */
135 && strEQ(name, SvPVX(sv)))
137 warn("\"my\" variable %s masks earlier declaration in same scope", name);
142 off = pad_alloc(OP_PADSV, SVs_PADMY);
144 sv_upgrade(sv, SVt_PVNV);
146 if (PL_in_my_stash) {
148 croak("Can't declare class for non-scalar %s in \"my\"",name);
150 (void)SvUPGRADE(sv, SVt_PVMG);
151 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
154 av_store(PL_comppad_name, off, sv);
155 SvNVX(sv) = (double)999999999;
156 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
157 if (!PL_min_intro_pending)
158 PL_min_intro_pending = off;
159 PL_max_intro_pending = off;
161 av_store(PL_comppad, off, (SV*)newAV());
162 else if (*name == '%')
163 av_store(PL_comppad, off, (SV*)newHV());
164 SvPADMY_on(PL_curpad[off]);
169 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
176 register PERL_CONTEXT *cx;
179 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
180 AV *curlist = CvPADLIST(cv);
181 SV **svp = av_fetch(curlist, 0, FALSE);
184 if (!svp || *svp == &PL_sv_undef)
187 svp = AvARRAY(curname);
188 for (off = AvFILLp(curname); off > 0; off--) {
189 if ((sv = svp[off]) &&
190 sv != &PL_sv_undef &&
192 seq > I_32(SvNVX(sv)) &&
193 strEQ(SvPVX(sv), name))
204 return 0; /* don't clone from inactive stack frame */
208 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
209 oldsv = *av_fetch(oldpad, off, TRUE);
210 if (!newoff) { /* Not a mere clone operation. */
211 SV *namesv = NEWSV(1103,0);
212 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
213 sv_upgrade(namesv, SVt_PVNV);
214 sv_setpv(namesv, name);
215 av_store(PL_comppad_name, newoff, namesv);
216 SvNVX(namesv) = (double)PL_curcop->cop_seq;
217 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
218 SvFAKE_on(namesv); /* A ref, not a real var */
219 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
220 /* "It's closures all the way down." */
221 CvCLONE_on(PL_compcv);
223 if (CvANON(PL_compcv))
224 oldsv = Nullsv; /* no need to keep ref */
229 bcv && bcv != cv && !CvCLONE(bcv);
230 bcv = CvOUTSIDE(bcv)) {
234 if (PL_dowarn && !CvUNIQUE(cv))
236 "Variable \"%s\" may be unavailable",
243 else if (!CvUNIQUE(PL_compcv)) {
244 if (PL_dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
245 warn("Variable \"%s\" will not stay shared", name);
248 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
254 /* Nothing in current lexical context--try eval's context, if any.
255 * This is necessary to let the perldb get at lexically scoped variables.
256 * XXX This will also probably interact badly with eval tree caching.
260 for (i = cx_ix; i >= 0; i--) {
262 switch (cx->cx_type) {
264 if (i == 0 && saweval) {
265 seq = cxstack[saweval].blk_oldcop->cop_seq;
266 return pad_findlex(name, newoff, seq, PL_main_cv, 0);
270 switch (cx->blk_eval.old_op_type) {
275 /* require must have its own scope */
283 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
284 saweval = i; /* so we know where we were called from */
287 seq = cxstack[saweval].blk_oldcop->cop_seq;
288 return pad_findlex(name, newoff, seq, cv, i-1);
296 pad_findmy(char *name)
302 SV **svp = AvARRAY(PL_comppad_name);
303 U32 seq = PL_cop_seqmax;
307 * Special case to get lexical (and hence per-thread) @_.
308 * XXX I need to find out how to tell at parse-time whether use
309 * of @_ should refer to a lexical (from a sub) or defgv (global
310 * scope and maybe weird sub-ish things like formats). See
311 * startsub in perly.y. It's possible that @_ could be lexical
312 * (at least from subs) even in non-threaded perl.
314 if (strEQ(name, "@_"))
315 return 0; /* success. (NOT_IN_PAD indicates failure) */
316 #endif /* USE_THREADS */
318 /* The one we're looking for is probably just before comppad_name_fill. */
319 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
320 if ((sv = svp[off]) &&
321 sv != &PL_sv_undef &&
324 seq > I_32(SvNVX(sv)))) &&
325 strEQ(SvPVX(sv), name))
328 return (PADOFFSET)off;
329 pendoff = off; /* this pending def. will override import */
333 /* See if it's in a nested scope */
334 off = pad_findlex(name, 0, seq, CvOUTSIDE(PL_compcv), cxstack_ix);
336 /* If there is a pending local definition, this new alias must die */
338 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
339 return off; /* pad_findlex returns 0 for failure...*/
341 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
345 pad_leavemy(I32 fill)
348 SV **svp = AvARRAY(PL_comppad_name);
350 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
351 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
352 if ((sv = svp[off]) && sv != &PL_sv_undef)
353 warn("%s never introduced", SvPVX(sv));
356 /* "Deintroduce" my variables that are leaving with this scope. */
357 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
358 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == 999999999)
359 SvIVX(sv) = PL_cop_seqmax;
364 pad_alloc(I32 optype, U32 tmptype)
370 if (AvARRAY(PL_comppad) != PL_curpad)
371 croak("panic: pad_alloc");
372 if (PL_pad_reset_pending)
374 if (tmptype & SVs_PADMY) {
376 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
377 } while (SvPADBUSY(sv)); /* need a fresh one */
378 retval = AvFILLp(PL_comppad);
381 SV **names = AvARRAY(PL_comppad_name);
382 SSize_t names_fill = AvFILLp(PL_comppad_name);
385 * "foreach" index vars temporarily become aliases to non-"my"
386 * values. Thus we must skip, not just pad values that are
387 * marked as current pad values, but also those with names.
389 if (++PL_padix <= names_fill &&
390 (sv = names[PL_padix]) && sv != &PL_sv_undef)
392 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
393 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
398 SvFLAGS(sv) |= tmptype;
399 PL_curpad = AvARRAY(PL_comppad);
401 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
402 (unsigned long) thr, (unsigned long) PL_curpad,
403 (long) retval, op_name[optype]));
405 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
406 (unsigned long) PL_curpad,
407 (long) retval, op_name[optype]));
408 #endif /* USE_THREADS */
409 return (PADOFFSET)retval;
417 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
418 (unsigned long) thr, (unsigned long) PL_curpad, po));
421 croak("panic: pad_sv po");
422 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
423 (unsigned long) PL_curpad, po));
424 #endif /* USE_THREADS */
425 return PL_curpad[po]; /* eventually we'll turn this into a macro */
429 pad_free(PADOFFSET po)
434 if (AvARRAY(PL_comppad) != PL_curpad)
435 croak("panic: pad_free curpad");
437 croak("panic: pad_free po");
439 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
440 (unsigned long) thr, (unsigned long) PL_curpad, po));
442 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
443 (unsigned long) PL_curpad, po));
444 #endif /* USE_THREADS */
445 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
446 SvPADTMP_off(PL_curpad[po]);
447 if ((I32)po < PL_padix)
452 pad_swipe(PADOFFSET po)
455 if (AvARRAY(PL_comppad) != PL_curpad)
456 croak("panic: pad_swipe curpad");
458 croak("panic: pad_swipe po");
460 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
461 (unsigned long) thr, (unsigned long) PL_curpad, po));
463 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
464 (unsigned long) PL_curpad, po));
465 #endif /* USE_THREADS */
466 SvPADTMP_off(PL_curpad[po]);
467 PL_curpad[po] = NEWSV(1107,0);
468 SvPADTMP_on(PL_curpad[po]);
469 if ((I32)po < PL_padix)
473 /* XXX pad_reset() is currently disabled because it results in serious bugs.
474 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
475 * on the stack by OPs that use them, there are several ways to get an alias
476 * to a shared TARG. Such an alias will change randomly and unpredictably.
477 * We avoid doing this until we can think of a Better Way.
482 #ifdef USE_BROKEN_PAD_RESET
486 if (AvARRAY(PL_comppad) != PL_curpad)
487 croak("panic: pad_reset curpad");
489 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
490 (unsigned long) thr, (unsigned long) PL_curpad));
492 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
493 (unsigned long) PL_curpad));
494 #endif /* USE_THREADS */
495 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
496 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
497 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
498 SvPADTMP_off(PL_curpad[po]);
500 PL_padix = PL_padix_floor;
503 PL_pad_reset_pending = FALSE;
507 /* find_threadsv is not reentrant */
509 find_threadsv(char *name)
515 /* We currently only handle names of a single character */
516 p = strchr(PL_threadsv_names, *name);
519 key = p - PL_threadsv_names;
520 svp = av_fetch(thr->threadsv, key, FALSE);
522 SV *sv = NEWSV(0, 0);
523 av_store(thr->threadsv, key, sv);
524 thr->threadsvp = AvARRAY(thr->threadsv);
526 * Some magic variables used to be automagically initialised
527 * in gv_fetchpv. Those which are now per-thread magicals get
528 * initialised here instead.
534 sv_setpv(sv, "\034");
535 sv_magic(sv, 0, 0, name, 1);
540 PL_sawampersand = TRUE;
544 /* XXX %! tied to Errno.pm needs to be added here.
545 * See gv_fetchpv(). */
549 sv_magic(sv, 0, 0, name, 1);
551 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
552 "find_threadsv: new SV %p for $%s%c\n",
553 sv, (*name < 32) ? "^" : "",
554 (*name < 32) ? toCTRL(*name) : *name));
558 #endif /* USE_THREADS */
565 register OP *kid, *nextkid;
567 if (!o || o->op_seq == (U16)-1)
570 if (o->op_flags & OPf_KIDS) {
571 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
572 nextkid = kid->op_sibling; /* Get before next freeing kid */
577 switch (o->op_type) {
579 o->op_targ = 0; /* Was holding old type, if any. */
582 o->op_targ = 0; /* Was holding hints. */
586 if (!(o->op_flags & OPf_SPECIAL))
590 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
592 #endif /* USE_THREADS */
594 if (!(o->op_flags & OPf_REF)
595 || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
601 SvREFCNT_dec(cGVOPo->op_gv);
605 Safefree(cCOPo->cop_label);
606 SvREFCNT_dec(cCOPo->cop_filegv);
609 SvREFCNT_dec(cSVOPo->op_sv);
615 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
619 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
620 SvREFCNT_dec(cSVOPo->op_sv);
622 Safefree(cPVOPo->op_pv);
625 op_free(cPMOPo->op_pmreplroot);
630 ReREFCNT_dec(cPMOPo->op_pmregexp);
635 pad_free(o->op_targ);
643 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
644 pad_free(o->op_targ);
645 o->op_targ = o->op_type;
646 o->op_type = OP_NULL;
647 o->op_ppaddr = ppaddr[OP_NULL];
650 /* Contextualizers */
652 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
662 /* establish postfix order */
663 if (cUNOPo->op_first) {
664 o->op_next = LINKLIST(cUNOPo->op_first);
665 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
667 kid->op_next = LINKLIST(kid->op_sibling);
682 if (o && o->op_flags & OPf_KIDS) {
683 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
693 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
695 line_t oldline = PL_curcop->cop_line;
697 if (PL_copline != NOLINE)
698 PL_curcop->cop_line = PL_copline;
699 warn("Found = in conditional, should be ==");
700 PL_curcop->cop_line = oldline;
710 /* assumes no premature commitment */
711 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
712 || o->op_type == OP_RETURN)
715 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
717 switch (o->op_type) {
719 if (o->op_private & OPpREPEAT_DOLIST)
720 null(((LISTOP*)cBINOPo->op_first)->op_first);
721 scalar(cBINOPo->op_first);
726 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
730 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
731 if (!kPMOP->op_pmreplroot)
732 deprecate("implicit split to @_");
740 if (o->op_flags & OPf_KIDS) {
741 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
747 kid = cLISTOPo->op_first;
749 while (kid = kid->op_sibling) {
755 WITH_THR(PL_curcop = &PL_compiling);
760 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
766 WITH_THR(PL_curcop = &PL_compiling);
779 /* assumes no premature commitment */
780 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || PL_error_count
781 || o->op_type == OP_RETURN)
784 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
786 switch (o->op_type) {
788 if (!(opargs[o->op_type] & OA_FOLDCONST))
792 if (o->op_flags & OPf_STACKED)
796 if (o->op_private == 4)
867 if (!(o->op_private & OPpLVAL_INTRO))
868 useless = op_desc[o->op_type];
875 if (!(o->op_private & OPpLVAL_INTRO) &&
876 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
877 useless = "a variable";
882 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
888 useless = "a constant";
889 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
891 else if (SvPOK(sv)) {
892 if (strnEQ(SvPVX(sv), "di", 2) ||
893 strnEQ(SvPVX(sv), "ds", 2) ||
894 strnEQ(SvPVX(sv), "ig", 2))
898 null(o); /* don't execute a constant */
899 SvREFCNT_dec(sv); /* don't even remember it */
903 o->op_type = OP_PREINC; /* pre-increment is faster */
904 o->op_ppaddr = ppaddr[OP_PREINC];
908 o->op_type = OP_PREDEC; /* pre-decrement is faster */
909 o->op_ppaddr = ppaddr[OP_PREDEC];
915 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
920 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
921 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
922 if (o->op_flags & OPf_STACKED)
928 if (!(o->op_flags & OPf_KIDS))
937 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
944 /* all requires must return a boolean value */
945 o->op_flags &= ~OPf_WANT;
948 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
949 if (!kPMOP->op_pmreplroot)
950 deprecate("implicit split to @_");
954 if (useless && PL_dowarn)
955 warn("Useless use of %s in void context", useless);
963 if (o && o->op_flags & OPf_KIDS) {
964 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
975 /* assumes no premature commitment */
976 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
977 || o->op_type == OP_RETURN)
980 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
982 switch (o->op_type) {
985 list(cBINOPo->op_first);
990 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
998 if (!(o->op_flags & OPf_KIDS))
1000 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1001 list(cBINOPo->op_first);
1002 return gen_constant_list(o);
1009 kid = cLISTOPo->op_first;
1011 while (kid = kid->op_sibling) {
1012 if (kid->op_sibling)
1017 WITH_THR(PL_curcop = &PL_compiling);
1021 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1022 if (kid->op_sibling)
1027 WITH_THR(PL_curcop = &PL_compiling);
1030 /* all requires must return a boolean value */
1031 o->op_flags &= ~OPf_WANT;
1043 if (o->op_type == OP_LINESEQ ||
1044 o->op_type == OP_SCOPE ||
1045 o->op_type == OP_LEAVE ||
1046 o->op_type == OP_LEAVETRY)
1049 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1050 if (kid->op_sibling) {
1054 PL_curcop = &PL_compiling;
1056 o->op_flags &= ~OPf_PARENS;
1057 if (PL_hints & HINT_BLOCK_SCOPE)
1058 o->op_flags |= OPf_PARENS;
1061 o = newOP(OP_STUB, 0);
1066 modkids(OP *o, I32 type)
1069 if (o && o->op_flags & OPf_KIDS) {
1070 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1077 mod(OP *o, I32 type)
1083 if (!o || PL_error_count)
1086 switch (o->op_type) {
1091 if (!(o->op_private & (OPpCONST_ARYBASE)))
1093 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1094 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1098 SAVEI32(PL_compiling.cop_arybase);
1099 PL_compiling.cop_arybase = 0;
1101 else if (type == OP_REFGEN)
1104 croak("That use of $[ is unsupported");
1107 if (o->op_flags & OPf_PARENS)
1111 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1112 !(o->op_flags & OPf_STACKED)) {
1113 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1114 o->op_ppaddr = ppaddr[OP_RV2CV];
1115 assert(cUNOPo->op_first->op_type == OP_NULL);
1116 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1122 /* grep, foreach, subcalls, refgen */
1123 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1125 yyerror(form("Can't modify %s in %s",
1126 op_desc[o->op_type],
1127 type ? op_desc[type] : "local"));
1141 case OP_RIGHT_SHIFT:
1150 if (!(o->op_flags & OPf_STACKED))
1156 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1162 if (!type && cUNOPo->op_first->op_type != OP_GV)
1163 croak("Can't localize through a reference");
1164 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1165 PL_modcount = 10000;
1166 return o; /* Treat \(@foo) like ordinary list. */
1170 if (scalar_mod_type(o, type))
1172 ref(cUNOPo->op_first, o->op_type);
1181 PL_modcount = 10000;
1184 if (!type && cUNOPo->op_first->op_type != OP_GV)
1185 croak("Can't localize through a reference");
1186 ref(cUNOPo->op_first, o->op_type);
1190 PL_hints |= HINT_BLOCK_SCOPE;
1198 PL_modcount = 10000;
1199 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1200 return o; /* Treat \(@foo) like ordinary list. */
1201 if (scalar_mod_type(o, type))
1207 croak("Can't localize lexical variable %s",
1208 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), PL_na));
1213 PL_modcount++; /* XXX ??? */
1215 #endif /* USE_THREADS */
1221 if (type != OP_SASSIGN)
1225 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1231 pad_free(o->op_targ);
1232 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1233 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1234 if (o->op_flags & OPf_KIDS)
1235 mod(cBINOPo->op_first->op_sibling, type);
1240 ref(cBINOPo->op_first, o->op_type);
1241 if (type == OP_ENTERSUB &&
1242 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1243 o->op_private |= OPpLVAL_DEFER;
1250 if (o->op_flags & OPf_KIDS)
1251 mod(cLISTOPo->op_last, type);
1255 if (!(o->op_flags & OPf_KIDS))
1257 if (o->op_targ != OP_LIST) {
1258 mod(cBINOPo->op_first, type);
1263 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1267 o->op_flags |= OPf_MOD;
1269 if (type == OP_AASSIGN || type == OP_SASSIGN)
1270 o->op_flags |= OPf_SPECIAL|OPf_REF;
1272 o->op_private |= OPpLVAL_INTRO;
1273 o->op_flags &= ~OPf_SPECIAL;
1274 PL_hints |= HINT_BLOCK_SCOPE;
1276 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1277 o->op_flags |= OPf_REF;
1282 scalar_mod_type(OP *o, I32 type)
1286 if (o->op_type == OP_RV2GV)
1310 case OP_RIGHT_SHIFT:
1320 case OP_ANDASSIGN: /* may work later */
1321 case OP_ORASSIGN: /* may work later */
1329 refkids(OP *o, I32 type)
1332 if (o && o->op_flags & OPf_KIDS) {
1333 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1340 ref(OP *o, I32 type)
1344 if (!o || PL_error_count)
1347 switch (o->op_type) {
1349 if ((type == OP_DEFINED || type == OP_LOCK) &&
1350 !(o->op_flags & OPf_STACKED)) {
1351 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1352 o->op_ppaddr = ppaddr[OP_RV2CV];
1353 assert(cUNOPo->op_first->op_type == OP_NULL);
1354 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1355 o->op_flags |= OPf_SPECIAL;
1360 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1364 ref(cUNOPo->op_first, o->op_type);
1367 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1368 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1369 : type == OP_RV2HV ? OPpDEREF_HV
1371 o->op_flags |= OPf_MOD;
1376 o->op_flags |= OPf_MOD; /* XXX ??? */
1381 o->op_flags |= OPf_REF;
1384 ref(cUNOPo->op_first, o->op_type);
1389 o->op_flags |= OPf_REF;
1394 if (!(o->op_flags & OPf_KIDS))
1396 ref(cBINOPo->op_first, type);
1400 ref(cBINOPo->op_first, o->op_type);
1401 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1402 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1403 : type == OP_RV2HV ? OPpDEREF_HV
1405 o->op_flags |= OPf_MOD;
1413 if (!(o->op_flags & OPf_KIDS))
1415 ref(cLISTOPo->op_last, type);
1430 if (!o || PL_error_count)
1434 if (type == OP_LIST) {
1435 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1437 } else if (type == OP_UNDEF) {
1439 } else if (type != OP_PADSV &&
1442 type != OP_PUSHMARK)
1444 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1447 o->op_flags |= OPf_MOD;
1448 o->op_private |= OPpLVAL_INTRO;
1456 o->op_flags |= OPf_PARENS;
1461 bind_match(I32 type, OP *left, OP *right)
1466 (left->op_type == OP_RV2AV ||
1467 left->op_type == OP_RV2HV ||
1468 left->op_type == OP_PADAV ||
1469 left->op_type == OP_PADHV)) {
1470 char *desc = op_desc[(right->op_type == OP_SUBST ||
1471 right->op_type == OP_TRANS)
1472 ? right->op_type : OP_MATCH];
1473 char *sample = ((left->op_type == OP_RV2AV ||
1474 left->op_type == OP_PADAV)
1475 ? "@array" : "%hash");
1476 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1479 if (right->op_type == OP_MATCH ||
1480 right->op_type == OP_SUBST ||
1481 right->op_type == OP_TRANS) {
1482 right->op_flags |= OPf_STACKED;
1483 if (right->op_type != OP_MATCH)
1484 left = mod(left, right->op_type);
1485 if (right->op_type == OP_TRANS)
1486 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1488 o = prepend_elem(right->op_type, scalar(left), right);
1490 return newUNOP(OP_NOT, 0, scalar(o));
1494 return bind_match(type, left,
1495 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1503 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1504 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1511 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1512 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1513 o->op_type = OP_LEAVE;
1514 o->op_ppaddr = ppaddr[OP_LEAVE];
1517 if (o->op_type == OP_LINESEQ) {
1519 o->op_type = OP_SCOPE;
1520 o->op_ppaddr = ppaddr[OP_SCOPE];
1521 kid = ((LISTOP*)o)->op_first;
1522 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1523 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1528 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1538 SAVESPTR(GvHV(PL_hintgv));
1539 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1540 SAVEFREESV(GvHV(PL_hintgv));
1544 block_start(int full)
1547 int retval = PL_savestack_ix;
1549 SAVEI32(PL_comppad_name_floor);
1551 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1552 PL_comppad_name_floor = PL_comppad_name_fill;
1554 PL_comppad_name_floor = 0;
1556 SAVEI32(PL_min_intro_pending);
1557 SAVEI32(PL_max_intro_pending);
1558 PL_min_intro_pending = 0;
1559 SAVEI32(PL_comppad_name_fill);
1560 SAVEI32(PL_padix_floor);
1561 PL_padix_floor = PL_padix;
1562 PL_pad_reset_pending = FALSE;
1564 PL_hints &= ~HINT_BLOCK_SCOPE;
1569 block_end(I32 floor, OP *seq)
1572 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1573 OP* retval = scalarseq(seq);
1575 PL_pad_reset_pending = FALSE;
1576 compiling.op_private = PL_hints;
1578 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1579 pad_leavemy(PL_comppad_name_fill);
1588 OP *o = newOP(OP_THREADSV, 0);
1589 o->op_targ = find_threadsv("_");
1592 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1593 #endif /* USE_THREADS */
1601 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1602 PL_eval_start = linklist(PL_eval_root);
1603 PL_eval_root->op_next = 0;
1604 peep(PL_eval_start);
1609 PL_main_root = scope(sawparens(scalarvoid(o)));
1610 PL_curcop = &PL_compiling;
1611 PL_main_start = LINKLIST(PL_main_root);
1612 PL_main_root->op_next = 0;
1613 peep(PL_main_start);
1616 /* Register with debugger */
1618 CV *cv = perl_get_cv("DB::postponed", FALSE);
1622 XPUSHs((SV*)PL_compiling.cop_filegv);
1624 perl_call_sv((SV*)cv, G_DISCARD);
1631 localize(OP *o, I32 lex)
1633 if (o->op_flags & OPf_PARENS)
1636 if (PL_dowarn && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1638 for (s = PL_bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1639 if (*s == ';' || *s == '=')
1640 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1644 PL_in_my_stash = Nullhv;
1648 return mod(o, OP_NULL); /* a bit kludgey */
1654 if (o->op_type == OP_LIST) {
1657 o2 = newOP(OP_THREADSV, 0);
1658 o2->op_targ = find_threadsv(";");
1660 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1661 #endif /* USE_THREADS */
1662 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1668 fold_constants(register OP *o)
1672 I32 type = o->op_type;
1675 if (opargs[type] & OA_RETSCALAR)
1677 if (opargs[type] & OA_TARGET)
1678 o->op_targ = pad_alloc(type, SVs_PADTMP);
1680 if ((opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1681 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1683 if (!(opargs[type] & OA_FOLDCONST))
1698 if (o->op_private & OPpLOCALE)
1703 goto nope; /* Don't try to run w/ errors */
1705 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1706 if (curop->op_type != OP_CONST &&
1707 curop->op_type != OP_LIST &&
1708 curop->op_type != OP_SCALAR &&
1709 curop->op_type != OP_NULL &&
1710 curop->op_type != OP_PUSHMARK) {
1715 curop = LINKLIST(o);
1719 sv = *(PL_stack_sp--);
1720 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1721 pad_swipe(o->op_targ);
1722 else if (SvTEMP(sv)) { /* grab mortal temp? */
1723 (void)SvREFCNT_inc(sv);
1727 if (type == OP_RV2GV)
1728 return newGVOP(OP_GV, 0, (GV*)sv);
1730 /* try to smush double to int, but don't smush -2.0 to -2 */
1731 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1735 if ((double)iv == SvNV(sv)) {
1740 SvIOK_off(sv); /* undo SvIV() damage */
1742 return newSVOP(OP_CONST, 0, sv);
1746 if (!(opargs[type] & OA_OTHERINT))
1749 if (!(PL_hints & HINT_INTEGER)) {
1750 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1753 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1754 if (curop->op_type == OP_CONST) {
1755 if (SvIOK(((SVOP*)curop)->op_sv))
1759 if (opargs[curop->op_type] & OA_RETINTEGER)
1763 o->op_ppaddr = ppaddr[++(o->op_type)];
1770 gen_constant_list(register OP *o)
1774 I32 oldtmps_floor = PL_tmps_floor;
1778 return o; /* Don't attempt to run with errors */
1780 PL_op = curop = LINKLIST(o);
1786 PL_tmps_floor = oldtmps_floor;
1788 o->op_type = OP_RV2AV;
1789 o->op_ppaddr = ppaddr[OP_RV2AV];
1790 curop = ((UNOP*)o)->op_first;
1791 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1798 convert(I32 type, I32 flags, OP *o)
1803 if (!o || o->op_type != OP_LIST)
1804 o = newLISTOP(OP_LIST, 0, o, Nullop);
1806 o->op_flags &= ~OPf_WANT;
1808 if (!(opargs[type] & OA_MARK))
1809 null(cLISTOPo->op_first);
1812 o->op_ppaddr = ppaddr[type];
1813 o->op_flags |= flags;
1815 o = CHECKOP(type, o);
1816 if (o->op_type != type)
1819 if (cLISTOPo->op_children < 7) {
1820 /* XXX do we really need to do this if we're done appending?? */
1821 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1823 cLISTOPo->op_last = last; /* in case check substituted last arg */
1826 return fold_constants(o);
1829 /* List constructors */
1832 append_elem(I32 type, OP *first, OP *last)
1840 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1841 return newLISTOP(type, 0, first, last);
1843 if (first->op_flags & OPf_KIDS)
1844 ((LISTOP*)first)->op_last->op_sibling = last;
1846 first->op_flags |= OPf_KIDS;
1847 ((LISTOP*)first)->op_first = last;
1849 ((LISTOP*)first)->op_last = last;
1850 ((LISTOP*)first)->op_children++;
1855 append_list(I32 type, LISTOP *first, LISTOP *last)
1863 if (first->op_type != type)
1864 return prepend_elem(type, (OP*)first, (OP*)last);
1866 if (last->op_type != type)
1867 return append_elem(type, (OP*)first, (OP*)last);
1869 first->op_last->op_sibling = last->op_first;
1870 first->op_last = last->op_last;
1871 first->op_children += last->op_children;
1872 if (first->op_children)
1873 last->op_flags |= OPf_KIDS;
1880 prepend_elem(I32 type, OP *first, OP *last)
1888 if (last->op_type == type) {
1889 if (type == OP_LIST) { /* already a PUSHMARK there */
1890 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1891 ((LISTOP*)last)->op_first->op_sibling = first;
1894 if (!(last->op_flags & OPf_KIDS)) {
1895 ((LISTOP*)last)->op_last = first;
1896 last->op_flags |= OPf_KIDS;
1898 first->op_sibling = ((LISTOP*)last)->op_first;
1899 ((LISTOP*)last)->op_first = first;
1901 ((LISTOP*)last)->op_children++;
1905 return newLISTOP(type, 0, first, last);
1913 return newOP(OP_STUB, 0);
1919 if (!o || o->op_type != OP_LIST)
1920 o = newLISTOP(OP_LIST, 0, o, Nullop);
1926 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1930 Newz(1101, listop, 1, LISTOP);
1932 listop->op_type = type;
1933 listop->op_ppaddr = ppaddr[type];
1934 listop->op_children = (first != 0) + (last != 0);
1935 listop->op_flags = flags;
1939 else if (!first && last)
1942 first->op_sibling = last;
1943 listop->op_first = first;
1944 listop->op_last = last;
1945 if (type == OP_LIST) {
1947 pushop = newOP(OP_PUSHMARK, 0);
1948 pushop->op_sibling = first;
1949 listop->op_first = pushop;
1950 listop->op_flags |= OPf_KIDS;
1952 listop->op_last = pushop;
1954 else if (listop->op_children)
1955 listop->op_flags |= OPf_KIDS;
1961 newOP(I32 type, I32 flags)
1964 Newz(1101, o, 1, OP);
1966 o->op_ppaddr = ppaddr[type];
1967 o->op_flags = flags;
1970 o->op_private = 0 + (flags >> 8);
1971 if (opargs[type] & OA_RETSCALAR)
1973 if (opargs[type] & OA_TARGET)
1974 o->op_targ = pad_alloc(type, SVs_PADTMP);
1975 return CHECKOP(type, o);
1979 newUNOP(I32 type, I32 flags, OP *first)
1984 first = newOP(OP_STUB, 0);
1985 if (opargs[type] & OA_MARK)
1986 first = force_list(first);
1988 Newz(1101, unop, 1, UNOP);
1989 unop->op_type = type;
1990 unop->op_ppaddr = ppaddr[type];
1991 unop->op_first = first;
1992 unop->op_flags = flags | OPf_KIDS;
1993 unop->op_private = 1 | (flags >> 8);
1994 unop = (UNOP*) CHECKOP(type, unop);
1998 return fold_constants((OP *) unop);
2002 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2005 Newz(1101, binop, 1, BINOP);
2008 first = newOP(OP_NULL, 0);
2010 binop->op_type = type;
2011 binop->op_ppaddr = ppaddr[type];
2012 binop->op_first = first;
2013 binop->op_flags = flags | OPf_KIDS;
2016 binop->op_private = 1 | (flags >> 8);
2019 binop->op_private = 2 | (flags >> 8);
2020 first->op_sibling = last;
2023 binop = (BINOP*)CHECKOP(type, binop);
2027 binop->op_last = last = binop->op_first->op_sibling;
2029 return fold_constants((OP *)binop);
2033 utf8compare(const void *a, const void *b)
2036 for (i = 0; i < 10; i++) {
2037 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2039 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2046 pmtrans(OP *o, OP *expr, OP *repl)
2048 SV *tstr = ((SVOP*)expr)->op_sv;
2049 SV *rstr = ((SVOP*)repl)->op_sv;
2052 register U8 *t = (U8*)SvPV(tstr, tlen);
2053 register U8 *r = (U8*)SvPV(rstr, rlen);
2059 register short *tbl;
2061 complement = o->op_private & OPpTRANS_COMPLEMENT;
2062 del = o->op_private & OPpTRANS_DELETE;
2063 squash = o->op_private & OPpTRANS_SQUASH;
2065 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2066 SV* listsv = newSVpv("# comment\n",0);
2068 U8* tend = t + tlen;
2069 U8* rend = r + rlen;
2085 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2086 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2092 New(1109, cp, tlen, U8*);
2094 transv = newSVpv("",0);
2103 qsort(cp, i, sizeof(U8*), utf8compare);
2104 for (j = 0; j < i; j++) {
2106 UV val = utf8_to_uv(s, &ulen);
2108 diff = val - nextmin;
2110 t = uv_to_utf8(tmpbuf,nextmin);
2111 sv_catpvn(transv, tmpbuf, t - tmpbuf);
2113 t = uv_to_utf8(tmpbuf, val - 1);
2114 sv_catpvn(transv, "\377", 1);
2115 sv_catpvn(transv, tmpbuf, t - tmpbuf);
2119 val = utf8_to_uv(s+1, &ulen);
2123 t = uv_to_utf8(tmpbuf,nextmin);
2124 sv_catpvn(transv, tmpbuf, t - tmpbuf);
2125 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2126 sv_catpvn(transv, "\377", 1);
2127 sv_catpvn(transv, tmpbuf, t - tmpbuf);
2129 tlen = SvCUR(transv);
2132 else if (!rlen && !del) {
2133 r = t; rlen = tlen; rend = tend;
2134 if (!squash && to_utf && from_utf)
2135 o->op_private |= OPpTRANS_COUNTONLY;
2138 while (t < tend || tfirst <= tlast) {
2139 /* see if we need more "t" chars */
2140 if (tfirst > tlast) {
2141 tfirst = (I32)utf8_to_uv(t, &ulen);
2143 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2144 tlast = (I32)utf8_to_uv(++t, &ulen);
2151 /* now see if we need more "r" chars */
2152 if (rfirst > rlast) {
2154 rfirst = (I32)utf8_to_uv(r, &ulen);
2156 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2157 rlast = (I32)utf8_to_uv(++r, &ulen);
2166 rfirst = rlast = 0xffffffff;
2170 /* now see which range will peter our first, if either. */
2171 tdiff = tlast - tfirst;
2172 rdiff = rlast - rfirst;
2179 if (rfirst == 0xffffffff) {
2180 diff = tdiff; /* oops, pretend rdiff is infinite */
2182 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2184 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2188 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2190 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2192 if (rfirst + diff > max)
2193 max = rfirst + diff;
2198 else if (rfirst <= 0x800)
2199 grows |= (tfirst < 0x80);
2200 else if (rfirst <= 0x10000)
2201 grows |= (tfirst < 0x800);
2202 else if (rfirst <= 0x200000)
2203 grows |= (tfirst < 0x10000);
2204 else if (rfirst <= 0x4000000)
2205 grows |= (tfirst < 0x200000);
2206 else if (rfirst <= 0x80000000)
2207 grows |= (tfirst < 0x4000000);
2219 else if (max > 0xff)
2224 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2225 SvREFCNT_dec(listsv);
2227 SvREFCNT_dec(transv);
2229 if (!del && havefinal)
2230 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2232 if (grows && to_utf)
2233 o->op_private |= OPpTRANS_GROWS;
2240 tbl = (short*)cPVOPo->op_pv;
2242 Zero(tbl, 256, short);
2243 for (i = 0; i < tlen; i++)
2245 for (i = 0, j = 0; i < 256; i++) {
2261 if (!rlen && !del) {
2264 o->op_private |= OPpTRANS_COUNTONLY;
2266 for (i = 0; i < 256; i++)
2268 for (i = 0, j = 0; i < tlen; i++,j++) {
2271 if (tbl[t[i]] == -1)
2277 if (tbl[t[i]] == -1)
2288 newPMOP(I32 type, I32 flags)
2293 Newz(1101, pmop, 1, PMOP);
2294 pmop->op_type = type;
2295 pmop->op_ppaddr = ppaddr[type];
2296 pmop->op_flags = flags;
2297 pmop->op_private = 0 | (flags >> 8);
2299 if (PL_hints & HINT_RE_TAINT)
2300 pmop->op_pmpermflags |= PMf_RETAINT;
2301 if (PL_hints & HINT_LOCALE)
2302 pmop->op_pmpermflags |= PMf_LOCALE;
2303 pmop->op_pmflags = pmop->op_pmpermflags;
2305 /* link into pm list */
2306 if (type != OP_TRANS && PL_curstash) {
2307 pmop->op_pmnext = HvPMROOT(PL_curstash);
2308 HvPMROOT(PL_curstash) = pmop;
2315 pmruntime(OP *o, OP *expr, OP *repl)
2320 I32 repl_has_vars = 0;
2322 if (o->op_type == OP_TRANS)
2323 return pmtrans(o, expr, repl);
2325 PL_hints |= HINT_BLOCK_SCOPE;
2328 if (expr->op_type == OP_CONST) {
2330 SV *pat = ((SVOP*)expr)->op_sv;
2331 char *p = SvPV(pat, plen);
2332 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2333 sv_setpvn(pat, "\\s+", 3);
2334 p = SvPV(pat, plen);
2335 pm->op_pmflags |= PMf_SKIPWHITE;
2337 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2338 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2339 pm->op_pmflags |= PMf_WHITE;
2343 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2344 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2346 : OP_REGCMAYBE),0,expr);
2348 Newz(1101, rcop, 1, LOGOP);
2349 rcop->op_type = OP_REGCOMP;
2350 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2351 rcop->op_first = scalar(expr);
2352 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2353 ? (OPf_SPECIAL | OPf_KIDS)
2355 rcop->op_private = 1;
2358 /* establish postfix order */
2359 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2361 rcop->op_next = expr;
2362 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2365 rcop->op_next = LINKLIST(expr);
2366 expr->op_next = (OP*)rcop;
2369 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2374 if (pm->op_pmflags & PMf_EVAL)
2377 else if (repl->op_type == OP_THREADSV
2378 && strchr("&`'123456789+",
2379 PL_threadsv_names[repl->op_targ]))
2383 #endif /* USE_THREADS */
2384 else if (repl->op_type == OP_CONST)
2388 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2389 if (opargs[curop->op_type] & OA_DANGEROUS) {
2391 if (curop->op_type == OP_THREADSV) {
2393 if (strchr("&`'123456789+", curop->op_private))
2397 if (curop->op_type == OP_GV) {
2398 GV *gv = ((GVOP*)curop)->op_gv;
2400 if (strchr("&`'123456789+", *GvENAME(gv)))
2403 #endif /* USE_THREADS */
2404 else if (curop->op_type == OP_RV2CV)
2406 else if (curop->op_type == OP_RV2SV ||
2407 curop->op_type == OP_RV2AV ||
2408 curop->op_type == OP_RV2HV ||
2409 curop->op_type == OP_RV2GV) {
2410 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2413 else if (curop->op_type == OP_PADSV ||
2414 curop->op_type == OP_PADAV ||
2415 curop->op_type == OP_PADHV ||
2416 curop->op_type == OP_PADANY) {
2419 else if (curop->op_type == OP_PUSHRE)
2420 ; /* Okay here, dangerous in newASSIGNOP */
2429 && (!pm->op_pmregexp
2430 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2431 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2432 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2433 prepend_elem(o->op_type, scalar(repl), o);
2436 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2437 pm->op_pmflags |= PMf_MAYBE_CONST;
2438 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2440 Newz(1101, rcop, 1, LOGOP);
2441 rcop->op_type = OP_SUBSTCONT;
2442 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2443 rcop->op_first = scalar(repl);
2444 rcop->op_flags |= OPf_KIDS;
2445 rcop->op_private = 1;
2448 /* establish postfix order */
2449 rcop->op_next = LINKLIST(repl);
2450 repl->op_next = (OP*)rcop;
2452 pm->op_pmreplroot = scalar((OP*)rcop);
2453 pm->op_pmreplstart = LINKLIST(rcop);
2462 newSVOP(I32 type, I32 flags, SV *sv)
2465 Newz(1101, svop, 1, SVOP);
2466 svop->op_type = type;
2467 svop->op_ppaddr = ppaddr[type];
2469 svop->op_next = (OP*)svop;
2470 svop->op_flags = flags;
2471 if (opargs[type] & OA_RETSCALAR)
2473 if (opargs[type] & OA_TARGET)
2474 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2475 return CHECKOP(type, svop);
2479 newGVOP(I32 type, I32 flags, GV *gv)
2483 Newz(1101, gvop, 1, GVOP);
2484 gvop->op_type = type;
2485 gvop->op_ppaddr = ppaddr[type];
2486 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2487 gvop->op_next = (OP*)gvop;
2488 gvop->op_flags = flags;
2489 if (opargs[type] & OA_RETSCALAR)
2491 if (opargs[type] & OA_TARGET)
2492 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2493 return CHECKOP(type, gvop);
2497 newPVOP(I32 type, I32 flags, char *pv)
2500 Newz(1101, pvop, 1, PVOP);
2501 pvop->op_type = type;
2502 pvop->op_ppaddr = ppaddr[type];
2504 pvop->op_next = (OP*)pvop;
2505 pvop->op_flags = flags;
2506 if (opargs[type] & OA_RETSCALAR)
2508 if (opargs[type] & OA_TARGET)
2509 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2510 return CHECKOP(type, pvop);
2519 save_hptr(&PL_curstash);
2520 save_item(PL_curstname);
2525 name = SvPV(sv, len);
2526 PL_curstash = gv_stashpvn(name,len,TRUE);
2527 sv_setpvn(PL_curstname, name, len);
2531 sv_setpv(PL_curstname,"<none>");
2532 PL_curstash = Nullhv;
2534 PL_copline = NOLINE;
2539 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2547 if (id->op_type != OP_CONST)
2548 croak("Module name must be constant");
2552 if(version != Nullop) {
2553 SV *vesv = ((SVOP*)version)->op_sv;
2555 if (arg == Nullop && !SvNIOK(vesv)) {
2562 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2563 croak("Version number must be constant number");
2565 /* Make copy of id so we don't free it twice */
2566 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2568 /* Fake up a method call to VERSION */
2569 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2570 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2571 append_elem(OP_LIST,
2572 prepend_elem(OP_LIST, pack, list(version)),
2573 newUNOP(OP_METHOD, 0, meth)));
2577 /* Fake up an import/unimport */
2578 if (arg && arg->op_type == OP_STUB)
2579 imop = arg; /* no import on explicit () */
2580 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2581 imop = Nullop; /* use 5.0; */
2584 /* Make copy of id so we don't free it twice */
2585 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2586 meth = newSVOP(OP_CONST, 0,
2588 ? newSVpv("import", 6)
2589 : newSVpv("unimport", 8)
2591 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2592 append_elem(OP_LIST,
2593 prepend_elem(OP_LIST, pack, list(arg)),
2594 newUNOP(OP_METHOD, 0, meth)));
2597 /* Fake up a require */
2598 rqop = newUNOP(OP_REQUIRE, 0, id);
2600 /* Fake up the BEGIN {}, which does its thing immediately. */
2602 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2604 append_elem(OP_LINESEQ,
2605 append_elem(OP_LINESEQ,
2606 newSTATEOP(0, Nullch, rqop),
2607 newSTATEOP(0, Nullch, veop)),
2608 newSTATEOP(0, Nullch, imop) ));
2610 PL_copline = NOLINE;
2615 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2617 return newBINOP(OP_LSLICE, flags,
2618 list(force_list(subscript)),
2619 list(force_list(listval)) );
2623 list_assignment(register OP *o)
2628 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2629 o = cUNOPo->op_first;
2631 if (o->op_type == OP_COND_EXPR) {
2632 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2633 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2638 yyerror("Assignment to both a list and a scalar");
2642 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2643 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2644 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2647 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2650 if (o->op_type == OP_RV2SV)
2657 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2662 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2663 return newLOGOP(optype, 0,
2664 mod(scalar(left), optype),
2665 newUNOP(OP_SASSIGN, 0, scalar(right)));
2668 return newBINOP(optype, OPf_STACKED,
2669 mod(scalar(left), optype), scalar(right));
2673 if (list_assignment(left)) {
2676 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2677 left = mod(left, OP_AASSIGN);
2685 o = newBINOP(OP_AASSIGN, flags,
2686 list(force_list(right)),
2687 list(force_list(left)) );
2688 o->op_private = 0 | (flags >> 8);
2689 if (!(left->op_private & OPpLVAL_INTRO)) {
2693 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2694 if (opargs[curop->op_type] & OA_DANGEROUS) {
2695 if (curop->op_type == OP_GV) {
2696 GV *gv = ((GVOP*)curop)->op_gv;
2697 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2699 SvCUR(gv) = PL_generation;
2701 else if (curop->op_type == OP_PADSV ||
2702 curop->op_type == OP_PADAV ||
2703 curop->op_type == OP_PADHV ||
2704 curop->op_type == OP_PADANY) {
2705 SV **svp = AvARRAY(PL_comppad_name);
2706 SV *sv = svp[curop->op_targ];
2707 if (SvCUR(sv) == PL_generation)
2709 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2711 else if (curop->op_type == OP_RV2CV)
2713 else if (curop->op_type == OP_RV2SV ||
2714 curop->op_type == OP_RV2AV ||
2715 curop->op_type == OP_RV2HV ||
2716 curop->op_type == OP_RV2GV) {
2717 if (lastop->op_type != OP_GV) /* funny deref? */
2720 else if (curop->op_type == OP_PUSHRE) {
2721 if (((PMOP*)curop)->op_pmreplroot) {
2722 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2723 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2725 SvCUR(gv) = PL_generation;
2734 o->op_private = OPpASSIGN_COMMON;
2736 if (right && right->op_type == OP_SPLIT) {
2738 if ((tmpop = ((LISTOP*)right)->op_first) &&
2739 tmpop->op_type == OP_PUSHRE)
2741 PMOP *pm = (PMOP*)tmpop;
2742 if (left->op_type == OP_RV2AV &&
2743 !(left->op_private & OPpLVAL_INTRO) &&
2744 !(o->op_private & OPpASSIGN_COMMON) )
2746 tmpop = ((UNOP*)left)->op_first;
2747 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2748 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2749 pm->op_pmflags |= PMf_ONCE;
2750 tmpop = cUNOPo->op_first; /* to list (nulled) */
2751 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2752 tmpop->op_sibling = Nullop; /* don't free split */
2753 right->op_next = tmpop->op_next; /* fix starting loc */
2754 op_free(o); /* blow off assign */
2755 right->op_flags &= ~OPf_WANT;
2756 /* "I don't know and I don't care." */
2761 if (PL_modcount < 10000 &&
2762 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2764 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2766 sv_setiv(sv, PL_modcount+1);
2774 right = newOP(OP_UNDEF, 0);
2775 if (right->op_type == OP_READLINE) {
2776 right->op_flags |= OPf_STACKED;
2777 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2780 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2781 o = newBINOP(OP_SASSIGN, flags,
2782 scalar(right), mod(scalar(left), OP_SASSIGN) );
2794 newSTATEOP(I32 flags, char *label, OP *o)
2797 U32 seq = intro_my();
2800 Newz(1101, cop, 1, COP);
2801 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2802 cop->op_type = OP_DBSTATE;
2803 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2806 cop->op_type = OP_NEXTSTATE;
2807 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2809 cop->op_flags = flags;
2810 cop->op_private = (PL_hints & HINT_UTF8);
2812 cop->op_private |= NATIVE_HINTS;
2814 compiling.op_private = cop->op_private;
2815 cop->op_next = (OP*)cop;
2818 cop->cop_label = label;
2819 PL_hints |= HINT_BLOCK_SCOPE;
2822 cop->cop_arybase = PL_curcop->cop_arybase;
2824 if (PL_copline == NOLINE)
2825 cop->cop_line = PL_curcop->cop_line;
2827 cop->cop_line = PL_copline;
2828 PL_copline = NOLINE;
2830 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2831 cop->cop_stash = PL_curstash;
2833 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2834 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2835 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2836 (void)SvIOK_on(*svp);
2838 SvSTASH(*svp) = (HV*)cop;
2842 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2845 /* "Introduce" my variables to visible status. */
2853 if (! PL_min_intro_pending)
2854 return PL_cop_seqmax;
2856 svp = AvARRAY(PL_comppad_name);
2857 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2858 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2859 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2860 SvNVX(sv) = (double)PL_cop_seqmax;
2863 PL_min_intro_pending = 0;
2864 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2865 return PL_cop_seqmax++;
2869 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2871 return new_logop(type, flags, &first, &other);
2875 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2880 OP *first = *firstp;
2881 OP *other = *otherp;
2883 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2884 return newBINOP(type, flags, scalar(first), scalar(other));
2886 scalarboolean(first);
2887 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2888 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2889 if (type == OP_AND || type == OP_OR) {
2895 first = *firstp = cUNOPo->op_first;
2897 first->op_next = o->op_next;
2898 cUNOPo->op_first = Nullop;
2902 if (first->op_type == OP_CONST) {
2903 if (PL_dowarn && (first->op_private & OPpCONST_BARE))
2904 warn("Probable precedence problem on %s", op_desc[type]);
2905 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2916 else if (first->op_type == OP_WANTARRAY) {
2922 else if (PL_dowarn && (first->op_flags & OPf_KIDS)) {
2923 OP *k1 = ((UNOP*)first)->op_first;
2924 OP *k2 = k1->op_sibling;
2926 switch (first->op_type)
2929 if (k2 && k2->op_type == OP_READLINE
2930 && (k2->op_flags & OPf_STACKED)
2931 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2932 warnop = k2->op_type;
2936 if (k1->op_type == OP_READDIR
2937 || k1->op_type == OP_GLOB
2938 || k1->op_type == OP_EACH)
2939 warnop = k1->op_type;
2943 line_t oldline = PL_curcop->cop_line;
2944 PL_curcop->cop_line = PL_copline;
2945 warn("Value of %s%s can be \"0\"; test with defined()",
2947 ((warnop == OP_READLINE || warnop == OP_GLOB)
2948 ? " construct" : "() operator"));
2949 PL_curcop->cop_line = oldline;
2956 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2957 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2959 Newz(1101, logop, 1, LOGOP);
2961 logop->op_type = type;
2962 logop->op_ppaddr = ppaddr[type];
2963 logop->op_first = first;
2964 logop->op_flags = flags | OPf_KIDS;
2965 logop->op_other = LINKLIST(other);
2966 logop->op_private = 1 | (flags >> 8);
2968 /* establish postfix order */
2969 logop->op_next = LINKLIST(first);
2970 first->op_next = (OP*)logop;
2971 first->op_sibling = other;
2973 o = newUNOP(OP_NULL, 0, (OP*)logop);
2980 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2987 return newLOGOP(OP_AND, 0, first, trueop);
2989 return newLOGOP(OP_OR, 0, first, falseop);
2991 scalarboolean(first);
2992 if (first->op_type == OP_CONST) {
2993 if (SvTRUE(((SVOP*)first)->op_sv)) {
3004 else if (first->op_type == OP_WANTARRAY) {
3008 Newz(1101, condop, 1, CONDOP);
3010 condop->op_type = OP_COND_EXPR;
3011 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
3012 condop->op_first = first;
3013 condop->op_flags = flags | OPf_KIDS;
3014 condop->op_true = LINKLIST(trueop);
3015 condop->op_false = LINKLIST(falseop);
3016 condop->op_private = 1 | (flags >> 8);
3018 /* establish postfix order */
3019 condop->op_next = LINKLIST(first);
3020 first->op_next = (OP*)condop;
3022 first->op_sibling = trueop;
3023 trueop->op_sibling = falseop;
3024 o = newUNOP(OP_NULL, 0, (OP*)condop);
3026 trueop->op_next = o;
3027 falseop->op_next = o;
3033 newRANGE(I32 flags, OP *left, OP *right)
3041 Newz(1101, condop, 1, CONDOP);
3043 condop->op_type = OP_RANGE;
3044 condop->op_ppaddr = ppaddr[OP_RANGE];
3045 condop->op_first = left;
3046 condop->op_flags = OPf_KIDS;
3047 condop->op_true = LINKLIST(left);
3048 condop->op_false = LINKLIST(right);
3049 condop->op_private = 1 | (flags >> 8);
3051 left->op_sibling = right;
3053 condop->op_next = (OP*)condop;
3054 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3055 flop = newUNOP(OP_FLOP, 0, flip);
3056 o = newUNOP(OP_NULL, 0, flop);
3059 left->op_next = flip;
3060 right->op_next = flop;
3062 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3063 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3064 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3065 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3067 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3068 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3071 if (!flip->op_private || !flop->op_private)
3072 linklist(o); /* blow off optimizer unless constant */
3078 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3083 int once = block && block->op_flags & OPf_SPECIAL &&
3084 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3087 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3088 return block; /* do {} while 0 does once */
3089 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3090 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3091 expr = newUNOP(OP_DEFINED, 0,
3092 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3093 } else if (expr->op_flags & OPf_KIDS) {
3094 OP *k1 = ((UNOP*)expr)->op_first;
3095 OP *k2 = (k1) ? k1->op_sibling : NULL;
3096 switch (expr->op_type) {
3098 if (k2 && k2->op_type == OP_READLINE
3099 && (k2->op_flags & OPf_STACKED)
3100 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3101 expr = newUNOP(OP_DEFINED, 0, expr);
3105 if (k1->op_type == OP_READDIR
3106 || k1->op_type == OP_GLOB
3107 || k1->op_type == OP_EACH)
3108 expr = newUNOP(OP_DEFINED, 0, expr);
3114 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3115 o = new_logop(OP_AND, 0, &expr, &listop);
3118 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3120 if (once && o != listop)
3121 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3124 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3126 o->op_flags |= flags;
3128 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3133 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3142 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3143 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3144 expr = newUNOP(OP_DEFINED, 0,
3145 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3146 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3147 OP *k1 = ((UNOP*)expr)->op_first;
3148 OP *k2 = (k1) ? k1->op_sibling : NULL;
3149 switch (expr->op_type) {
3151 if (k2 && k2->op_type == OP_READLINE
3152 && (k2->op_flags & OPf_STACKED)
3153 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3154 expr = newUNOP(OP_DEFINED, 0, expr);
3158 if (k1->op_type == OP_READDIR
3159 || k1->op_type == OP_GLOB
3160 || k1->op_type == OP_EACH)
3161 expr = newUNOP(OP_DEFINED, 0, expr);
3167 block = newOP(OP_NULL, 0);
3170 next = LINKLIST(cont);
3172 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3173 if ((line_t)whileline != NOLINE) {
3174 PL_copline = whileline;
3175 cont = append_elem(OP_LINESEQ, cont,
3176 newSTATEOP(0, Nullch, Nullop));
3180 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3181 redo = LINKLIST(listop);
3184 PL_copline = whileline;
3186 o = new_logop(OP_AND, 0, &expr, &listop);
3187 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3188 op_free(expr); /* oops, it's a while (0) */
3190 return Nullop; /* listop already freed by new_logop */
3193 ((LISTOP*)listop)->op_last->op_next = condop =
3194 (o == listop ? redo : LINKLIST(o));
3202 Newz(1101,loop,1,LOOP);
3203 loop->op_type = OP_ENTERLOOP;
3204 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
3205 loop->op_private = 0;
3206 loop->op_next = (OP*)loop;
3209 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3211 loop->op_redoop = redo;
3212 loop->op_lastop = o;
3215 loop->op_nextop = next;
3217 loop->op_nextop = o;
3219 o->op_flags |= flags;
3220 o->op_private |= (flags >> 8);
3225 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3233 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3234 sv->op_type = OP_RV2GV;
3235 sv->op_ppaddr = ppaddr[OP_RV2GV];
3237 else if (sv->op_type == OP_PADSV) { /* private variable */
3238 padoff = sv->op_targ;
3242 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3243 padoff = sv->op_targ;
3244 iterflags |= OPf_SPECIAL;
3249 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3253 padoff = find_threadsv("_");
3254 iterflags |= OPf_SPECIAL;
3256 sv = newGVOP(OP_GV, 0, PL_defgv);
3259 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3260 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3261 iterflags |= OPf_STACKED;
3263 else if (expr->op_type == OP_NULL &&
3264 (expr->op_flags & OPf_KIDS) &&
3265 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3267 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3268 * set the STACKED flag to indicate that these values are to be
3269 * treated as min/max values by 'pp_iterinit'.
3271 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3272 CONDOP* range = (CONDOP*) flip->op_first;
3273 OP* left = range->op_first;
3274 OP* right = left->op_sibling;
3277 range->op_flags &= ~OPf_KIDS;
3278 range->op_first = Nullop;
3280 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3281 listop->op_first->op_next = range->op_true;
3282 left->op_next = range->op_false;
3283 right->op_next = (OP*)listop;
3284 listop->op_next = listop->op_first;
3287 expr = (OP*)(listop);
3289 iterflags |= OPf_STACKED;
3292 expr = mod(force_list(expr), OP_GREPSTART);
3296 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3297 append_elem(OP_LIST, expr, scalar(sv))));
3298 assert(!loop->op_next);
3299 Renew(loop, 1, LOOP);
3300 loop->op_targ = padoff;
3301 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3302 PL_copline = forline;
3303 return newSTATEOP(0, label, wop);
3307 newLOOPEX(I32 type, OP *label)
3311 if (type != OP_GOTO || label->op_type == OP_CONST) {
3312 /* "last()" means "last" */
3313 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3314 o = newOP(type, OPf_SPECIAL);
3316 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3317 ? SvPVx(((SVOP*)label)->op_sv, PL_na)
3323 if (label->op_type == OP_ENTERSUB)
3324 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3325 o = newUNOP(type, OPf_STACKED, label);
3327 PL_hints |= HINT_BLOCK_SCOPE;
3337 MUTEX_DESTROY(CvMUTEXP(cv));
3338 Safefree(CvMUTEXP(cv));
3341 #endif /* USE_THREADS */
3343 if (!CvXSUB(cv) && CvROOT(cv)) {
3345 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3346 croak("Can't undef active subroutine");
3349 croak("Can't undef active subroutine");
3350 #endif /* USE_THREADS */
3353 SAVESPTR(PL_curpad);
3357 op_free(CvROOT(cv));
3358 CvROOT(cv) = Nullop;
3361 SvPOK_off((SV*)cv); /* forget prototype */
3363 SvREFCNT_dec(CvGV(cv));
3365 SvREFCNT_dec(CvOUTSIDE(cv));
3366 CvOUTSIDE(cv) = Nullcv;
3367 if (CvPADLIST(cv)) {
3368 /* may be during global destruction */
3369 if (SvREFCNT(CvPADLIST(cv))) {
3370 I32 i = AvFILLp(CvPADLIST(cv));
3372 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3373 SV* sv = svp ? *svp : Nullsv;
3376 if (sv == (SV*)PL_comppad_name)
3377 PL_comppad_name = Nullav;
3378 else if (sv == (SV*)PL_comppad) {
3379 PL_comppad = Nullav;
3380 PL_curpad = Null(SV**);
3384 SvREFCNT_dec((SV*)CvPADLIST(cv));
3386 CvPADLIST(cv) = Nullav;
3390 #ifdef DEBUG_CLOSURES
3395 CV *outside = CvOUTSIDE(cv);
3396 AV* padlist = CvPADLIST(cv);
3403 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3405 (CvANON(cv) ? "ANON"
3406 : (cv == PL_main_cv) ? "MAIN"
3407 : CvUNIQUE(outside) ? "UNIQUE"
3408 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3411 : CvANON(outside) ? "ANON"
3412 : (outside == PL_main_cv) ? "MAIN"
3413 : CvUNIQUE(outside) ? "UNIQUE"
3414 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3419 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3420 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3421 pname = AvARRAY(pad_name);
3422 ppad = AvARRAY(pad);
3424 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3425 if (SvPOK(pname[ix]))
3426 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3428 SvFAKE(pname[ix]) ? "FAKE " : "",
3430 (long)I_32(SvNVX(pname[ix])),
3431 (long)SvIVX(pname[ix]));
3434 #endif /* DEBUG_CLOSURES */
3437 cv_clone2(CV *proto, CV *outside)
3442 AV* protopadlist = CvPADLIST(proto);
3443 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3444 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3445 SV** pname = AvARRAY(protopad_name);
3446 SV** ppad = AvARRAY(protopad);
3447 I32 fname = AvFILLp(protopad_name);
3448 I32 fpad = AvFILLp(protopad);
3452 assert(!CvUNIQUE(proto));
3455 SAVESPTR(PL_curpad);
3456 SAVESPTR(PL_comppad);
3457 SAVESPTR(PL_comppad_name);
3458 SAVESPTR(PL_compcv);
3460 cv = PL_compcv = (CV*)NEWSV(1104,0);
3461 sv_upgrade((SV *)cv, SvTYPE(proto));
3467 New(666, CvMUTEXP(cv), 1, perl_mutex);
3468 MUTEX_INIT(CvMUTEXP(cv));
3470 #endif /* USE_THREADS */
3471 CvFILEGV(cv) = CvFILEGV(proto);
3472 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3473 CvSTASH(cv) = CvSTASH(proto);
3474 CvROOT(cv) = CvROOT(proto);
3475 CvSTART(cv) = CvSTART(proto);
3477 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3480 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3482 PL_comppad_name = newAV();
3483 for (ix = fname; ix >= 0; ix--)
3484 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3486 PL_comppad = newAV();
3488 comppadlist = newAV();
3489 AvREAL_off(comppadlist);
3490 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3491 av_store(comppadlist, 1, (SV*)PL_comppad);
3492 CvPADLIST(cv) = comppadlist;
3493 av_fill(PL_comppad, AvFILLp(protopad));
3494 PL_curpad = AvARRAY(PL_comppad);
3496 av = newAV(); /* will be @_ */
3498 av_store(PL_comppad, 0, (SV*)av);
3499 AvFLAGS(av) = AVf_REIFY;
3501 for (ix = fpad; ix > 0; ix--) {
3502 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3503 if (namesv && namesv != &PL_sv_undef) {
3504 char *name = SvPVX(namesv); /* XXX */
3505 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3506 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3507 CvOUTSIDE(cv), cxstack_ix);
3509 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3511 croak("panic: cv_clone: %s", name);
3513 else { /* our own lexical */
3516 /* anon code -- we'll come back for it */
3517 sv = SvREFCNT_inc(ppad[ix]);
3519 else if (*name == '@')
3521 else if (*name == '%')
3531 SV* sv = NEWSV(0,0);
3537 /* Now that vars are all in place, clone nested closures. */
3539 for (ix = fpad; ix > 0; ix--) {
3540 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3542 && namesv != &PL_sv_undef
3543 && !(SvFLAGS(namesv) & SVf_FAKE)
3544 && *SvPVX(namesv) == '&'
3545 && CvCLONE(ppad[ix]))
3547 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3548 SvREFCNT_dec(ppad[ix]);
3551 PL_curpad[ix] = (SV*)kid;
3555 #ifdef DEBUG_CLOSURES
3556 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3558 PerlIO_printf(Perl_debug_log, " from:\n");
3560 PerlIO_printf(Perl_debug_log, " to:\n");
3571 return cv_clone2(proto, CvOUTSIDE(proto));
3575 cv_ckproto(CV *cv, GV *gv, char *p)
3577 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3578 SV* msg = sv_newmortal();
3582 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3583 sv_setpv(msg, "Prototype mismatch:");
3585 sv_catpvf(msg, " sub %_", name);
3587 sv_catpvf(msg, " (%s)", SvPVX(cv));
3588 sv_catpv(msg, " vs ");
3590 sv_catpvf(msg, "(%s)", p);
3592 sv_catpv(msg, "none");
3600 if (!cv || !SvPOK(cv) || SvCUR(cv))
3602 return op_const_sv(CvSTART(cv), cv);
3606 op_const_sv(OP *o, CV *cv)
3613 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3614 o = cLISTOPo->op_first->op_sibling;
3616 for (; o; o = o->op_next) {
3617 OPCODE type = o->op_type;
3619 if(sv && o->op_next == o)
3621 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3623 if (type == OP_LEAVESUB || type == OP_RETURN)
3627 if (type == OP_CONST)
3629 else if (type == OP_PADSV && cv) {
3630 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3631 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3632 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3644 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3647 char *name = o ? SvPVx(cSVOPo->op_sv, PL_na) : Nullch;
3648 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3649 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3650 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, PL_na) : Nullch;
3659 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3660 maximum a prototype before. */
3661 if (SvTYPE(gv) > SVt_NULL) {
3662 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3663 warn("Runaway prototype");
3664 cv_ckproto((CV*)gv, NULL, ps);
3667 sv_setpv((SV*)gv, ps);
3669 sv_setiv((SV*)gv, -1);
3670 SvREFCNT_dec(PL_compcv);
3671 cv = PL_compcv = NULL;
3672 PL_sub_generation++;
3676 if (!name || GvCVGEN(gv))
3678 else if (cv = GvCV(gv)) {
3679 cv_ckproto(cv, gv, ps);
3680 /* already defined (or promised)? */
3681 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3683 bool const_changed = TRUE;
3685 /* just a "sub foo;" when &foo is already defined */
3686 SAVEFREESV(PL_compcv);
3689 /* ahem, death to those who redefine active sort subs */
3690 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3691 croak("Can't redefine active sort subroutine %s", name);
3692 if(const_sv = cv_const_sv(cv))
3693 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3694 if ((const_sv && const_changed) || PL_dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3695 && HvNAME(GvSTASH(CvGV(cv)))
3696 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3698 line_t oldline = PL_curcop->cop_line;
3699 PL_curcop->cop_line = PL_copline;
3700 warn(const_sv ? "Constant subroutine %s redefined"
3701 : "Subroutine %s redefined", name);
3702 PL_curcop->cop_line = oldline;
3708 if (cv) { /* must reuse cv if autoloaded */
3710 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3711 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3712 CvOUTSIDE(PL_compcv) = 0;
3713 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3714 CvPADLIST(PL_compcv) = 0;
3715 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3716 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3717 SvREFCNT_dec(PL_compcv);
3724 PL_sub_generation++;
3727 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3728 CvFILEGV(cv) = PL_curcop->cop_filegv;
3729 CvSTASH(cv) = PL_curstash;
3733 New(666, CvMUTEXP(cv), 1, perl_mutex);
3734 MUTEX_INIT(CvMUTEXP(cv));
3735 #endif /* USE_THREADS */
3738 sv_setpv((SV*)cv, ps);
3740 if (PL_error_count) {
3744 char *s = strrchr(name, ':');
3746 if (strEQ(s, "BEGIN")) {
3748 "BEGIN not safe after errors--compilation aborted";
3752 /* force display of errors found but not reported */
3753 sv_catpv(ERRSV, not_safe);
3754 croak("%s", SvPVx(ERRSV, PL_na));
3761 PL_copline = NOLINE;
3766 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3767 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3770 SV **namep = AvARRAY(PL_comppad_name);
3771 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3774 if (SvIMMORTAL(PL_curpad[ix]))
3777 * The only things that a clonable function needs in its
3778 * pad are references to outer lexicals and anonymous subs.
3779 * The rest are created anew during cloning.
3781 if (!((namesv = namep[ix]) != Nullsv &&
3782 namesv != &PL_sv_undef &&
3784 *SvPVX(namesv) == '&')))
3786 SvREFCNT_dec(PL_curpad[ix]);
3787 PL_curpad[ix] = Nullsv;
3792 AV *av = newAV(); /* Will be @_ */
3794 av_store(PL_comppad, 0, (SV*)av);
3795 AvFLAGS(av) = AVf_REIFY;
3797 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3798 if (SvIMMORTAL(PL_curpad[ix]))
3800 if (!SvPADMY(PL_curpad[ix]))
3801 SvPADTMP_on(PL_curpad[ix]);
3805 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3806 CvSTART(cv) = LINKLIST(CvROOT(cv));
3807 CvROOT(cv)->op_next = 0;
3813 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3814 SV *sv = NEWSV(0,0);
3815 SV *tmpstr = sv_newmortal();
3816 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3820 sv_setpvf(sv, "%_:%ld-%ld",
3821 GvSV(PL_curcop->cop_filegv),
3822 (long)PL_subline, (long)PL_curcop->cop_line);
3823 gv_efullname3(tmpstr, gv, Nullch);
3824 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3825 hv = GvHVn(db_postponed);
3826 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3827 && (cv = GvCV(db_postponed))) {
3832 perl_call_sv((SV*)cv, G_DISCARD);
3836 if ((s = strrchr(name,':')))
3840 if (strEQ(s, "BEGIN")) {
3841 I32 oldscope = PL_scopestack_ix;
3843 SAVESPTR(PL_compiling.cop_filegv);
3844 SAVEI16(PL_compiling.cop_line);
3846 sv_setsv(PL_rs, PL_nrs);
3849 PL_beginav = newAV();
3850 DEBUG_x( dump_sub(gv) );
3851 av_push(PL_beginav, (SV *)cv);
3853 call_list(oldscope, PL_beginav);
3855 PL_curcop = &PL_compiling;
3856 PL_compiling.op_private = PL_hints;
3859 else if (strEQ(s, "END") && !PL_error_count) {
3862 av_unshift(PL_endav, 1);
3863 av_store(PL_endav, 0, (SV *)cv);
3866 else if (strEQ(s, "INIT") && !PL_error_count) {
3868 PL_initav = newAV();
3869 av_push(PL_initav, SvREFCNT_inc(cv));
3875 PL_copline = NOLINE;
3881 newCONSTSUB(HV *stash, char *name, SV *sv)
3884 U32 oldhints = PL_hints;
3885 HV *old_cop_stash = PL_curcop->cop_stash;
3886 HV *old_curstash = PL_curstash;
3887 line_t oldline = PL_curcop->cop_line;
3888 PL_curcop->cop_line = PL_copline;
3890 PL_hints &= ~HINT_BLOCK_SCOPE;
3892 PL_curstash = PL_curcop->cop_stash = stash;
3895 start_subparse(FALSE, 0),
3896 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3897 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
3898 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3901 PL_hints = oldhints;
3902 PL_curcop->cop_stash = old_cop_stash;
3903 PL_curstash = old_curstash;
3904 PL_curcop->cop_line = oldline;
3908 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3911 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3914 if (cv = (name ? GvCV(gv) : Nullcv)) {
3916 /* just a cached method */
3920 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3921 /* already defined (or promised) */
3922 if (PL_dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3923 && HvNAME(GvSTASH(CvGV(cv)))
3924 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3925 line_t oldline = PL_curcop->cop_line;
3926 PL_curcop->cop_line = PL_copline;
3927 warn("Subroutine %s redefined",name);
3928 PL_curcop->cop_line = oldline;
3935 if (cv) /* must reuse cv if autoloaded */
3938 cv = (CV*)NEWSV(1105,0);
3939 sv_upgrade((SV *)cv, SVt_PVCV);
3943 PL_sub_generation++;
3946 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3948 New(666, CvMUTEXP(cv), 1, perl_mutex);
3949 MUTEX_INIT(CvMUTEXP(cv));
3951 #endif /* USE_THREADS */
3952 CvFILEGV(cv) = gv_fetchfile(filename);
3953 CvXSUB(cv) = subaddr;
3956 char *s = strrchr(name,':');
3961 if (strEQ(s, "BEGIN")) {
3963 PL_beginav = newAV();
3964 av_push(PL_beginav, (SV *)cv);
3967 else if (strEQ(s, "END")) {
3970 av_unshift(PL_endav, 1);
3971 av_store(PL_endav, 0, (SV *)cv);
3974 else if (strEQ(s, "INIT")) {
3976 PL_initav = newAV();
3977 av_push(PL_initav, (SV *)cv);
3987 newFORM(I32 floor, OP *o, OP *block)
3996 name = SvPVx(cSVOPo->op_sv, PL_na);
3999 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4001 if (cv = GvFORM(gv)) {
4003 line_t oldline = PL_curcop->cop_line;
4005 PL_curcop->cop_line = PL_copline;
4006 warn("Format %s redefined",name);
4007 PL_curcop->cop_line = oldline;
4013 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4014 CvFILEGV(cv) = PL_curcop->cop_filegv;
4016 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4017 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4018 SvPADTMP_on(PL_curpad[ix]);
4021 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4022 CvSTART(cv) = LINKLIST(CvROOT(cv));
4023 CvROOT(cv)->op_next = 0;
4026 PL_copline = NOLINE;
4033 return newUNOP(OP_REFGEN, 0,
4034 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4040 return newUNOP(OP_REFGEN, 0,
4041 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4045 newANONSUB(I32 floor, OP *proto, OP *block)
4047 return newUNOP(OP_REFGEN, 0,
4048 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4054 switch (o->op_type) {
4056 o->op_type = OP_PADAV;
4057 o->op_ppaddr = ppaddr[OP_PADAV];
4058 return ref(o, OP_RV2AV);
4061 o->op_type = OP_RV2AV;
4062 o->op_ppaddr = ppaddr[OP_RV2AV];
4067 warn("oops: oopsAV");
4076 switch (o->op_type) {
4079 o->op_type = OP_PADHV;
4080 o->op_ppaddr = ppaddr[OP_PADHV];
4081 return ref(o, OP_RV2HV);
4085 o->op_type = OP_RV2HV;
4086 o->op_ppaddr = ppaddr[OP_RV2HV];
4091 warn("oops: oopsHV");
4100 if (o->op_type == OP_PADANY) {
4101 o->op_type = OP_PADAV;
4102 o->op_ppaddr = ppaddr[OP_PADAV];
4105 return newUNOP(OP_RV2AV, 0, scalar(o));
4109 newGVREF(I32 type, OP *o)
4111 if (type == OP_MAPSTART)
4112 return newUNOP(OP_NULL, 0, o);
4113 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4119 if (o->op_type == OP_PADANY) {
4120 o->op_type = OP_PADHV;
4121 o->op_ppaddr = ppaddr[OP_PADHV];
4124 return newUNOP(OP_RV2HV, 0, scalar(o));
4130 croak("NOT IMPL LINE %d",__LINE__);
4136 newCVREF(I32 flags, OP *o)
4138 return newUNOP(OP_RV2CV, flags, scalar(o));
4144 if (o->op_type == OP_PADANY) {
4145 o->op_type = OP_PADSV;
4146 o->op_ppaddr = ppaddr[OP_PADSV];
4149 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4150 o->op_flags |= OPpDONE_SVREF;
4153 return newUNOP(OP_RV2SV, 0, scalar(o));
4156 /* Check routines. */
4164 name = NEWSV(1106,0);
4165 sv_upgrade(name, SVt_PVNV);
4166 sv_setpvn(name, "&", 1);
4169 ix = pad_alloc(o->op_type, SVs_PADMY);
4170 av_store(PL_comppad_name, ix, name);
4171 av_store(PL_comppad, ix, cSVOPo->op_sv);
4172 SvPADMY_on(cSVOPo->op_sv);
4173 cSVOPo->op_sv = Nullsv;
4174 cSVOPo->op_targ = ix;
4181 o->op_private = PL_hints;
4188 if (cUNOPo->op_first->op_type == OP_CONCAT)
4189 o->op_flags |= OPf_STACKED;
4196 if (o->op_flags & OPf_KIDS) {
4199 OPCODE type = o->op_type;
4200 o = modkids(ck_fun(o), type);
4201 kid = cUNOPo->op_first;
4202 newop = kUNOP->op_first->op_sibling;
4204 (newop->op_sibling ||
4205 !(opargs[newop->op_type] & OA_RETSCALAR) ||
4206 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4207 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4211 op_free(kUNOP->op_first);
4212 kUNOP->op_first = newop;
4214 o->op_ppaddr = ppaddr[++o->op_type];
4223 if (o->op_flags & OPf_KIDS) {
4224 OP *kid = cUNOPo->op_first;
4225 if (kid->op_type == OP_HSLICE)
4226 o->op_private |= OPpSLICE;
4227 else if (kid->op_type != OP_HELEM)
4228 croak("%s argument is not a HASH element or slice",
4229 op_desc[o->op_type]);
4238 I32 type = o->op_type;
4240 if (o->op_flags & OPf_KIDS) {
4241 if (cLISTOPo->op_first->op_type == OP_STUB) {
4243 o = newUNOP(type, OPf_SPECIAL,
4244 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4254 PL_hints |= HINT_BLOCK_SCOPE;
4255 if (o->op_flags & OPf_KIDS) {
4256 SVOP *kid = (SVOP*)cUNOPo->op_first;
4259 o->op_flags &= ~OPf_KIDS;
4262 else if (kid->op_type == OP_LINESEQ) {
4265 kid->op_next = o->op_next;
4266 cUNOPo->op_first = 0;
4269 Newz(1101, enter, 1, LOGOP);
4270 enter->op_type = OP_ENTERTRY;
4271 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4272 enter->op_private = 0;
4274 /* establish postfix order */
4275 enter->op_next = (OP*)enter;
4277 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4278 o->op_type = OP_LEAVETRY;
4279 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4280 enter->op_other = o;
4288 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4290 o->op_targ = (PADOFFSET)PL_hints;
4298 if (o->op_flags & OPf_STACKED) {
4300 kid = cUNOPo->op_first->op_sibling;
4301 if (kid->op_type == OP_RV2GV)
4313 if (o->op_flags & OPf_KIDS) {
4314 OP *kid = cUNOPo->op_first;
4315 if (kid->op_type != OP_HELEM)
4316 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4323 ck_gvconst(register OP *o)
4325 o = fold_constants(o);
4326 if (o->op_type == OP_CONST)
4332 ck_rvconst(register OP *o)
4335 SVOP *kid = (SVOP*)cUNOPo->op_first;
4337 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4338 if (kid->op_type == OP_CONST) {
4343 name = SvPV(kid->op_sv, PL_na);
4344 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4345 char *badthing = Nullch;
4346 switch (o->op_type) {
4348 badthing = "a SCALAR";
4351 badthing = "an ARRAY";
4354 badthing = "a HASH";
4359 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4363 * This is a little tricky. We only want to add the symbol if we
4364 * didn't add it in the lexer. Otherwise we get duplicate strict
4365 * warnings. But if we didn't add it in the lexer, we must at
4366 * least pretend like we wanted to add it even if it existed before,
4367 * or we get possible typo warnings. OPpCONST_ENTERED says
4368 * whether the lexer already added THIS instance of this symbol.
4370 iscv = (o->op_type == OP_RV2CV) * 2;
4372 gv = gv_fetchpv(name,
4373 iscv | !(kid->op_private & OPpCONST_ENTERED),
4376 : o->op_type == OP_RV2SV
4378 : o->op_type == OP_RV2AV
4380 : o->op_type == OP_RV2HV
4383 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4385 kid->op_type = OP_GV;
4386 SvREFCNT_dec(kid->op_sv);
4387 kid->op_sv = SvREFCNT_inc(gv);
4397 I32 type = o->op_type;
4399 if (o->op_flags & OPf_REF)
4402 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4403 SVOP *kid = (SVOP*)cUNOPo->op_first;
4405 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4406 OP *newop = newGVOP(type, OPf_REF,
4407 gv_fetchpv(SvPVx(kid->op_sv, PL_na), TRUE, SVt_PVIO));
4414 if (type == OP_FTTTY)
4415 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4418 return newUNOP(type, 0, newDEFSVOP());
4431 int type = o->op_type;
4432 register I32 oa = opargs[type] >> OASHIFT;
4434 if (o->op_flags & OPf_STACKED) {
4435 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4438 return no_fh_allowed(o);
4441 if (o->op_flags & OPf_KIDS) {
4442 tokid = &cLISTOPo->op_first;
4443 kid = cLISTOPo->op_first;
4444 if (kid->op_type == OP_PUSHMARK ||
4445 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4447 tokid = &kid->op_sibling;
4448 kid = kid->op_sibling;
4450 if (!kid && opargs[type] & OA_DEFGV)
4451 *tokid = kid = newDEFSVOP();
4455 sibl = kid->op_sibling;
4469 if (kid->op_type == OP_CONST &&
4470 (kid->op_private & OPpCONST_BARE)) {
4471 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4472 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4473 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4475 warn("Array @%s missing the @ in argument %ld of %s()",
4476 name, (long)numargs, op_desc[type]);
4479 kid->op_sibling = sibl;
4482 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4483 bad_type(numargs, "array", op_desc[o->op_type], kid);
4487 if (kid->op_type == OP_CONST &&
4488 (kid->op_private & OPpCONST_BARE)) {
4489 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4490 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4491 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4493 warn("Hash %%%s missing the %% in argument %ld of %s()",
4494 name, (long)numargs, op_desc[type]);
4497 kid->op_sibling = sibl;
4500 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4501 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4506 OP *newop = newUNOP(OP_NULL, 0, kid);
4507 kid->op_sibling = 0;
4509 newop->op_next = newop;
4511 kid->op_sibling = sibl;
4516 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4517 if (kid->op_type == OP_CONST &&
4518 (kid->op_private & OPpCONST_BARE)) {
4519 OP *newop = newGVOP(OP_GV, 0,
4520 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, PL_na), TRUE,
4526 kid->op_sibling = 0;
4527 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4529 kid->op_sibling = sibl;
4535 mod(scalar(kid), type);
4539 tokid = &kid->op_sibling;
4540 kid = kid->op_sibling;
4542 o->op_private |= numargs;
4544 return too_many_arguments(o,op_desc[o->op_type]);
4547 else if (opargs[type] & OA_DEFGV) {
4549 return newUNOP(type, 0, newDEFSVOP());
4553 while (oa & OA_OPTIONAL)
4555 if (oa && oa != OA_LIST)
4556 return too_few_arguments(o,op_desc[o->op_type]);
4566 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4567 append_elem(OP_GLOB, o, newDEFSVOP());
4569 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4570 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4572 if (gv && GvIMPORTED_CV(gv)) {
4573 static int glob_index;
4575 append_elem(OP_GLOB, o,
4576 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4577 o->op_type = OP_LIST;
4578 o->op_ppaddr = ppaddr[OP_LIST];
4579 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4580 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4581 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4582 append_elem(OP_LIST, o,
4583 scalar(newUNOP(OP_RV2CV, 0,
4584 newGVOP(OP_GV, 0, gv)))));
4585 o = newUNOP(OP_NULL, 0, ck_subr(o));
4586 o->op_targ = OP_GLOB; /* hint at what it used to be */
4589 gv = newGVgen("main");
4591 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4601 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4603 o->op_ppaddr = ppaddr[OP_GREPSTART];
4604 Newz(1101, gwop, 1, LOGOP);
4606 if (o->op_flags & OPf_STACKED) {
4609 kid = cLISTOPo->op_first->op_sibling;
4610 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4613 kid->op_next = (OP*)gwop;
4614 o->op_flags &= ~OPf_STACKED;
4616 kid = cLISTOPo->op_first->op_sibling;
4617 if (type == OP_MAPWHILE)
4624 kid = cLISTOPo->op_first->op_sibling;
4625 if (kid->op_type != OP_NULL)
4626 croak("panic: ck_grep");
4627 kid = kUNOP->op_first;
4629 gwop->op_type = type;
4630 gwop->op_ppaddr = ppaddr[type];
4631 gwop->op_first = listkids(o);
4632 gwop->op_flags |= OPf_KIDS;
4633 gwop->op_private = 1;
4634 gwop->op_other = LINKLIST(kid);
4635 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4636 kid->op_next = (OP*)gwop;
4638 kid = cLISTOPo->op_first->op_sibling;
4639 if (!kid || !kid->op_sibling)
4640 return too_few_arguments(o,op_desc[o->op_type]);
4641 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4642 mod(kid, OP_GREPSTART);
4650 if (o->op_flags & OPf_KIDS) {
4651 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4652 if (kid && kid->op_type == OP_CONST)
4653 fbm_compile(((SVOP*)kid)->op_sv, 0);
4659 ck_lengthconst(OP *o)
4661 /* XXX length optimization goes here */
4668 OPCODE type = o->op_type;
4669 return modkids(ck_fun(o), type);
4675 OPCODE type = o->op_type;
4676 return refkids(ck_fun(o), type);
4684 kid = cLISTOPo->op_first;
4687 kid = cLISTOPo->op_first;
4689 if (kid->op_type == OP_PUSHMARK)
4690 kid = kid->op_sibling;
4691 if (kid && o->op_flags & OPf_STACKED)
4692 kid = kid->op_sibling;
4693 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4694 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4695 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4696 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4697 cLISTOPo->op_first->op_sibling = kid;
4698 cLISTOPo->op_last = kid;
4699 kid = kid->op_sibling;
4704 append_elem(o->op_type, o, newDEFSVOP());
4710 if (PL_hints & HINT_LOCALE)
4711 o->op_private |= OPpLOCALE;
4718 ck_fun_locale(OP *o)
4724 if (PL_hints & HINT_LOCALE)
4725 o->op_private |= OPpLOCALE;
4736 if (PL_hints & HINT_LOCALE)
4737 o->op_private |= OPpLOCALE;
4746 o->op_private |= OPpRUNTIME;
4759 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4760 o->op_private |= OPpREPEAT_DOLIST;
4761 cBINOPo->op_first = force_list(cBINOPo->op_first);
4771 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4772 SVOP *kid = (SVOP*)cUNOPo->op_first;
4774 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4776 for (s = SvPVX(kid->op_sv); *s; s++) {
4777 if (*s == ':' && s[1] == ':') {
4779 Move(s+2, s+1, strlen(s+2)+1, char);
4780 --SvCUR(kid->op_sv);
4783 sv_catpvn(kid->op_sv, ".pm", 3);
4792 croak("NOT IMPL LINE %d",__LINE__);
4801 if (o->op_flags & OPf_KIDS) {
4802 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4803 if (kid && kid->op_sibling) {
4804 o->op_type = OP_SSELECT;
4805 o->op_ppaddr = ppaddr[OP_SSELECT];
4807 return fold_constants(o);
4811 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4812 if (kid && kid->op_type == OP_RV2GV)
4813 kid->op_private &= ~HINT_STRICT_REFS;
4820 I32 type = o->op_type;
4822 if (!(o->op_flags & OPf_KIDS)) {
4827 if (!CvUNIQUE(PL_compcv)) {
4828 argop = newOP(OP_PADAV, OPf_REF);
4829 argop->op_targ = 0; /* PL_curpad[0] is @_ */
4832 argop = newUNOP(OP_RV2AV, 0,
4833 scalar(newGVOP(OP_GV, 0,
4834 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4837 argop = newUNOP(OP_RV2AV, 0,
4838 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
4839 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4840 #endif /* USE_THREADS */
4841 return newUNOP(type, 0, scalar(argop));
4843 return scalar(modkids(ck_fun(o), type));
4851 if (PL_hints & HINT_LOCALE)
4852 o->op_private |= OPpLOCALE;
4855 if (o->op_flags & OPf_STACKED) {
4856 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4858 kid = kUNOP->op_first; /* get past rv2gv */
4860 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4862 if (kid->op_type == OP_SCOPE) {
4866 else if (kid->op_type == OP_LEAVE) {
4867 if (o->op_type == OP_SORT) {
4868 null(kid); /* wipe out leave */
4871 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4872 if (k->op_next == kid)
4877 kid->op_next = 0; /* just disconnect the leave */
4878 k = kLISTOP->op_first;
4882 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4883 null(kid); /* wipe out rv2gv */
4884 if (o->op_type == OP_SORT)
4888 o->op_flags |= OPf_SPECIAL;
4900 if (o->op_flags & OPf_STACKED)
4901 return no_fh_allowed(o);
4903 kid = cLISTOPo->op_first;
4904 if (kid->op_type != OP_NULL)
4905 croak("panic: ck_split");
4906 kid = kid->op_sibling;
4907 op_free(cLISTOPo->op_first);
4908 cLISTOPo->op_first = kid;
4910 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4911 cLISTOPo->op_last = kid; /* There was only one element previously */
4914 if (kid->op_type != OP_MATCH) {
4915 OP *sibl = kid->op_sibling;
4916 kid->op_sibling = 0;
4917 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4918 if (cLISTOPo->op_first == cLISTOPo->op_last)
4919 cLISTOPo->op_last = kid;
4920 cLISTOPo->op_first = kid;
4921 kid->op_sibling = sibl;
4924 kid->op_type = OP_PUSHRE;
4925 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4928 if (!kid->op_sibling)
4929 append_elem(OP_SPLIT, o, newDEFSVOP());
4931 kid = kid->op_sibling;
4934 if (!kid->op_sibling)
4935 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4937 kid = kid->op_sibling;
4940 if (kid->op_sibling)
4941 return too_many_arguments(o,op_desc[o->op_type]);
4950 OP *prev = ((cUNOPo->op_first->op_sibling)
4951 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4952 OP *o2 = prev->op_sibling;
4960 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4961 if (cvop->op_type == OP_RV2CV) {
4963 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4964 null(cvop); /* disable rv2cv */
4965 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4966 if (tmpop->op_type == OP_GV) {
4967 cv = GvCVu(tmpop->op_sv);
4968 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4969 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4970 proto = SvPV((SV*)cv, PL_na);
4974 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4975 if (PERLDB_SUB && PL_curstash != PL_debstash)
4976 o->op_private |= OPpENTERSUB_DB;
4977 while (o2 != cvop) {
4981 return too_many_arguments(o, gv_ename(namegv));
4999 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5000 bad_type(arg, "block", gv_ename(namegv), o2);
5005 if (o2->op_type == OP_RV2GV)
5009 OP* sib = kid->op_sibling;
5010 kid->op_sibling = 0;
5011 o2 = newUNOP(OP_RV2GV, 0, kid);
5012 o2->op_sibling = sib;
5013 prev->op_sibling = o2;
5021 if (o2->op_type != OP_RV2GV)
5022 bad_type(arg, "symbol", gv_ename(namegv), o2);
5025 if (o2->op_type != OP_RV2CV)
5026 bad_type(arg, "sub", gv_ename(namegv), o2);
5029 if (o2->op_type != OP_RV2SV
5030 && o2->op_type != OP_PADSV
5031 && o2->op_type != OP_THREADSV)
5033 bad_type(arg, "scalar", gv_ename(namegv), o2);
5037 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5038 bad_type(arg, "array", gv_ename(namegv), o2);
5041 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5042 bad_type(arg, "hash", gv_ename(namegv), o2);
5046 OP* sib = kid->op_sibling;
5047 kid->op_sibling = 0;
5048 o2 = newUNOP(OP_REFGEN, 0, kid);
5049 o2->op_sibling = sib;
5050 prev->op_sibling = o2;
5061 croak("Malformed prototype for %s: %s",
5062 gv_ename(namegv), SvPV((SV*)cv, PL_na));
5067 mod(o2, OP_ENTERSUB);
5069 o2 = o2->op_sibling;
5071 if (proto && !optional &&
5072 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5073 return too_few_arguments(o, gv_ename(namegv));
5080 SvREADONLY_on(cSVOPo->op_sv);
5087 if (o->op_flags & OPf_KIDS) {
5088 SVOP *kid = (SVOP*)cUNOPo->op_first;
5090 if (kid->op_type == OP_NULL)
5091 kid = (SVOP*)kid->op_sibling;
5093 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5094 o->op_flags |= OPf_SPECIAL;
5099 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5102 peep(register OP *o)
5105 register OP* oldop = 0;
5106 if (!o || o->op_seq)
5110 SAVESPTR(PL_curcop);
5111 for (; o; o = o->op_next) {
5117 switch (o->op_type) {
5120 PL_curcop = ((COP*)o); /* for warnings */
5121 o->op_seq = PL_op_seqmax++;
5132 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5134 o->op_seq = PL_op_seqmax++;
5137 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5138 o->op_seq = PL_op_seqmax++;
5139 break; /* Scalar stub must produce undef. List stub is noop */
5143 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5144 PL_curcop = ((COP*)o);
5150 if (oldop && o->op_next) {
5151 oldop->op_next = o->op_next;
5154 o->op_seq = PL_op_seqmax++;
5158 if (o->op_next->op_type == OP_RV2SV) {
5159 if (!(o->op_next->op_private & OPpDEREF)) {
5161 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5162 o->op_next = o->op_next->op_next;
5163 o->op_type = OP_GVSV;
5164 o->op_ppaddr = ppaddr[OP_GVSV];
5167 else if (o->op_next->op_type == OP_RV2AV) {
5168 OP* pop = o->op_next->op_next;
5170 if (pop->op_type == OP_CONST &&
5171 (PL_op = pop->op_next) &&
5172 pop->op_next->op_type == OP_AELEM &&
5173 !(pop->op_next->op_private &
5174 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5175 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5179 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5183 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5184 o->op_next = pop->op_next->op_next;
5185 o->op_type = OP_AELEMFAST;
5186 o->op_ppaddr = ppaddr[OP_AELEMFAST];
5187 o->op_private = (U8)i;
5188 GvAVn(((GVOP*)o)->op_gv);
5191 o->op_seq = PL_op_seqmax++;
5198 o->op_seq = PL_op_seqmax++;
5199 while (cLOGOP->op_other->op_type == OP_NULL)
5200 cLOGOP->op_other = cLOGOP->op_other->op_next;
5201 peep(cLOGOP->op_other);
5205 o->op_seq = PL_op_seqmax++;
5206 peep(cCONDOP->op_true);
5207 peep(cCONDOP->op_false);
5211 o->op_seq = PL_op_seqmax++;
5212 peep(cLOOP->op_redoop);
5213 peep(cLOOP->op_nextop);
5214 peep(cLOOP->op_lastop);
5220 o->op_seq = PL_op_seqmax++;
5221 peep(cPMOP->op_pmreplstart);
5225 o->op_seq = PL_op_seqmax++;
5226 if (PL_dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
5227 if (o->op_next->op_sibling &&
5228 o->op_next->op_sibling->op_type != OP_EXIT &&
5229 o->op_next->op_sibling->op_type != OP_WARN &&
5230 o->op_next->op_sibling->op_type != OP_DIE) {
5231 line_t oldline = PL_curcop->cop_line;
5233 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5234 warn("Statement unlikely to be reached");
5235 warn("(Maybe you meant system() when you said exec()?)\n");
5236 PL_curcop->cop_line = oldline;
5250 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5251 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5253 rop = (UNOP*)((BINOP*)o)->op_first;
5254 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5256 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5257 if (!SvOBJECT(lexname))
5259 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5260 if (!fields || !GvHV(*fields))
5262 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5263 key = SvPV(*svp, keylen);
5264 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5266 croak("No such field \"%s\" in variable %s of type %s",
5267 key, SvPV(lexname, PL_na), HvNAME(SvSTASH(lexname)));
5269 ind = SvIV(*indsvp);
5271 croak("Bad index while coercing array into hash");
5272 rop->op_type = OP_RV2AV;
5273 rop->op_ppaddr = ppaddr[OP_RV2AV];
5274 o->op_type = OP_AELEM;
5275 o->op_ppaddr = ppaddr[OP_AELEM];
5277 *svp = newSViv(ind);
5282 o->op_seq = PL_op_seqmax++;