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) {
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_L(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 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
588 #endif /* USE_THREADS */
590 if (!(o->op_flags & OPf_REF)
591 || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
597 SvREFCNT_dec(cGVOPo->op_gv);
601 Safefree(cCOPo->cop_label);
602 SvREFCNT_dec(cCOPo->cop_filegv);
605 SvREFCNT_dec(cSVOPo->op_sv);
611 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
615 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
616 SvREFCNT_dec(cSVOPo->op_sv);
618 Safefree(cPVOPo->op_pv);
621 op_free(cPMOPo->op_pmreplroot);
626 ReREFCNT_dec(cPMOPo->op_pmregexp);
631 pad_free(o->op_targ);
639 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
640 pad_free(o->op_targ);
641 o->op_targ = o->op_type;
642 o->op_type = OP_NULL;
643 o->op_ppaddr = ppaddr[OP_NULL];
646 /* Contextualizers */
648 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
658 /* establish postfix order */
659 if (cUNOPo->op_first) {
660 o->op_next = LINKLIST(cUNOPo->op_first);
661 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
663 kid->op_next = LINKLIST(kid->op_sibling);
678 if (o && o->op_flags & OPf_KIDS) {
679 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
689 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
691 line_t oldline = PL_curcop->cop_line;
693 if (PL_copline != NOLINE)
694 PL_curcop->cop_line = PL_copline;
695 warn("Found = in conditional, should be ==");
696 PL_curcop->cop_line = oldline;
706 /* assumes no premature commitment */
707 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
708 || o->op_type == OP_RETURN)
711 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
713 switch (o->op_type) {
715 if (o->op_private & OPpREPEAT_DOLIST)
716 null(((LISTOP*)cBINOPo->op_first)->op_first);
717 scalar(cBINOPo->op_first);
722 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
726 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
727 if (!kPMOP->op_pmreplroot)
728 deprecate("implicit split to @_");
736 if (o->op_flags & OPf_KIDS) {
737 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
743 kid = cLISTOPo->op_first;
745 while (kid = kid->op_sibling) {
751 WITH_THR(PL_curcop = &PL_compiling);
756 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
762 WITH_THR(PL_curcop = &PL_compiling);
775 /* assumes no premature commitment */
776 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || PL_error_count
777 || o->op_type == OP_RETURN)
780 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
782 switch (o->op_type) {
784 if (!(opargs[o->op_type] & OA_FOLDCONST))
788 if (o->op_flags & OPf_STACKED)
792 if (o->op_private == 4)
863 if (!(o->op_private & OPpLVAL_INTRO))
864 useless = op_desc[o->op_type];
871 if (!(o->op_private & OPpLVAL_INTRO) &&
872 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
873 useless = "a variable";
878 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
884 useless = "a constant";
885 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
887 else if (SvPOK(sv)) {
888 if (strnEQ(SvPVX(sv), "di", 2) ||
889 strnEQ(SvPVX(sv), "ds", 2) ||
890 strnEQ(SvPVX(sv), "ig", 2))
894 null(o); /* don't execute a constant */
895 SvREFCNT_dec(sv); /* don't even remember it */
899 o->op_type = OP_PREINC; /* pre-increment is faster */
900 o->op_ppaddr = ppaddr[OP_PREINC];
904 o->op_type = OP_PREDEC; /* pre-decrement is faster */
905 o->op_ppaddr = ppaddr[OP_PREDEC];
911 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
916 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
917 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
918 if (o->op_flags & OPf_STACKED)
924 if (!(o->op_flags & OPf_KIDS))
933 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
940 /* all requires must return a boolean value */
941 o->op_flags &= ~OPf_WANT;
944 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
945 if (!kPMOP->op_pmreplroot)
946 deprecate("implicit split to @_");
950 if (useless && PL_dowarn)
951 warn("Useless use of %s in void context", useless);
959 if (o && o->op_flags & OPf_KIDS) {
960 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
971 /* assumes no premature commitment */
972 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
973 || o->op_type == OP_RETURN)
976 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
978 switch (o->op_type) {
981 list(cBINOPo->op_first);
986 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
994 if (!(o->op_flags & OPf_KIDS))
996 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
997 list(cBINOPo->op_first);
998 return gen_constant_list(o);
1005 kid = cLISTOPo->op_first;
1007 while (kid = kid->op_sibling) {
1008 if (kid->op_sibling)
1013 WITH_THR(PL_curcop = &PL_compiling);
1017 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1018 if (kid->op_sibling)
1023 WITH_THR(PL_curcop = &PL_compiling);
1026 /* all requires must return a boolean value */
1027 o->op_flags &= ~OPf_WANT;
1039 if (o->op_type == OP_LINESEQ ||
1040 o->op_type == OP_SCOPE ||
1041 o->op_type == OP_LEAVE ||
1042 o->op_type == OP_LEAVETRY)
1045 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1046 if (kid->op_sibling) {
1050 PL_curcop = &PL_compiling;
1052 o->op_flags &= ~OPf_PARENS;
1053 if (PL_hints & HINT_BLOCK_SCOPE)
1054 o->op_flags |= OPf_PARENS;
1057 o = newOP(OP_STUB, 0);
1062 modkids(OP *o, I32 type)
1065 if (o && o->op_flags & OPf_KIDS) {
1066 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1073 mod(OP *o, I32 type)
1079 if (!o || PL_error_count)
1082 switch (o->op_type) {
1087 if (!(o->op_private & (OPpCONST_ARYBASE)))
1089 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1090 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1094 SAVEI32(PL_compiling.cop_arybase);
1095 PL_compiling.cop_arybase = 0;
1097 else if (type == OP_REFGEN)
1100 croak("That use of $[ is unsupported");
1103 if (o->op_flags & OPf_PARENS)
1107 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1108 !(o->op_flags & OPf_STACKED)) {
1109 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1110 o->op_ppaddr = ppaddr[OP_RV2CV];
1111 assert(cUNOPo->op_first->op_type == OP_NULL);
1112 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1118 /* grep, foreach, subcalls, refgen */
1119 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1121 yyerror(form("Can't modify %s in %s",
1122 op_desc[o->op_type],
1123 type ? op_desc[type] : "local"));
1137 case OP_RIGHT_SHIFT:
1146 if (!(o->op_flags & OPf_STACKED))
1152 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1158 if (!type && cUNOPo->op_first->op_type != OP_GV)
1159 croak("Can't localize through a reference");
1160 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1161 PL_modcount = 10000;
1162 return o; /* Treat \(@foo) like ordinary list. */
1166 if (scalar_mod_type(o, type))
1168 ref(cUNOPo->op_first, o->op_type);
1177 PL_modcount = 10000;
1180 if (!type && cUNOPo->op_first->op_type != OP_GV)
1181 croak("Can't localize through a reference");
1182 ref(cUNOPo->op_first, o->op_type);
1186 PL_hints |= HINT_BLOCK_SCOPE;
1194 PL_modcount = 10000;
1195 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1196 return o; /* Treat \(@foo) like ordinary list. */
1197 if (scalar_mod_type(o, type))
1203 croak("Can't localize lexical variable %s",
1204 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), PL_na));
1209 PL_modcount++; /* XXX ??? */
1211 #endif /* USE_THREADS */
1217 if (type != OP_SASSIGN)
1221 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1227 pad_free(o->op_targ);
1228 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1229 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1230 if (o->op_flags & OPf_KIDS)
1231 mod(cBINOPo->op_first->op_sibling, type);
1236 ref(cBINOPo->op_first, o->op_type);
1237 if (type == OP_ENTERSUB &&
1238 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1239 o->op_private |= OPpLVAL_DEFER;
1246 if (o->op_flags & OPf_KIDS)
1247 mod(cLISTOPo->op_last, type);
1251 if (!(o->op_flags & OPf_KIDS))
1253 if (o->op_targ != OP_LIST) {
1254 mod(cBINOPo->op_first, type);
1259 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1263 o->op_flags |= OPf_MOD;
1265 if (type == OP_AASSIGN || type == OP_SASSIGN)
1266 o->op_flags |= OPf_SPECIAL|OPf_REF;
1268 o->op_private |= OPpLVAL_INTRO;
1269 o->op_flags &= ~OPf_SPECIAL;
1270 PL_hints |= HINT_BLOCK_SCOPE;
1272 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1273 o->op_flags |= OPf_REF;
1278 scalar_mod_type(OP *o, I32 type)
1282 if (o->op_type == OP_RV2GV)
1306 case OP_RIGHT_SHIFT:
1316 case OP_ANDASSIGN: /* may work later */
1317 case OP_ORASSIGN: /* may work later */
1325 refkids(OP *o, I32 type)
1328 if (o && o->op_flags & OPf_KIDS) {
1329 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1336 ref(OP *o, I32 type)
1340 if (!o || PL_error_count)
1343 switch (o->op_type) {
1345 if ((type == OP_DEFINED || type == OP_LOCK) &&
1346 !(o->op_flags & OPf_STACKED)) {
1347 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1348 o->op_ppaddr = ppaddr[OP_RV2CV];
1349 assert(cUNOPo->op_first->op_type == OP_NULL);
1350 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1351 o->op_flags |= OPf_SPECIAL;
1356 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1360 ref(cUNOPo->op_first, o->op_type);
1363 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1364 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1365 : type == OP_RV2HV ? OPpDEREF_HV
1367 o->op_flags |= OPf_MOD;
1372 o->op_flags |= OPf_MOD; /* XXX ??? */
1377 o->op_flags |= OPf_REF;
1380 ref(cUNOPo->op_first, o->op_type);
1385 o->op_flags |= OPf_REF;
1390 if (!(o->op_flags & OPf_KIDS))
1392 ref(cBINOPo->op_first, type);
1396 ref(cBINOPo->op_first, o->op_type);
1397 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1398 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1399 : type == OP_RV2HV ? OPpDEREF_HV
1401 o->op_flags |= OPf_MOD;
1409 if (!(o->op_flags & OPf_KIDS))
1411 ref(cLISTOPo->op_last, type);
1426 if (!o || PL_error_count)
1430 if (type == OP_LIST) {
1431 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1433 } else if (type == OP_UNDEF) {
1435 } else if (type != OP_PADSV &&
1438 type != OP_PUSHMARK)
1440 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1443 o->op_flags |= OPf_MOD;
1444 o->op_private |= OPpLVAL_INTRO;
1452 o->op_flags |= OPf_PARENS;
1457 bind_match(I32 type, OP *left, OP *right)
1462 (left->op_type == OP_RV2AV ||
1463 left->op_type == OP_RV2HV ||
1464 left->op_type == OP_PADAV ||
1465 left->op_type == OP_PADHV)) {
1466 char *desc = op_desc[(right->op_type == OP_SUBST ||
1467 right->op_type == OP_TRANS)
1468 ? right->op_type : OP_MATCH];
1469 char *sample = ((left->op_type == OP_RV2AV ||
1470 left->op_type == OP_PADAV)
1471 ? "@array" : "%hash");
1472 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1475 if (right->op_type == OP_MATCH ||
1476 right->op_type == OP_SUBST ||
1477 right->op_type == OP_TRANS) {
1478 right->op_flags |= OPf_STACKED;
1479 if (right->op_type != OP_MATCH)
1480 left = mod(left, right->op_type);
1481 if (right->op_type == OP_TRANS)
1482 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1484 o = prepend_elem(right->op_type, scalar(left), right);
1486 return newUNOP(OP_NOT, 0, scalar(o));
1490 return bind_match(type, left,
1491 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1499 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1500 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1507 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1508 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1509 o->op_type = OP_LEAVE;
1510 o->op_ppaddr = ppaddr[OP_LEAVE];
1513 if (o->op_type == OP_LINESEQ) {
1515 o->op_type = OP_SCOPE;
1516 o->op_ppaddr = ppaddr[OP_SCOPE];
1517 kid = ((LISTOP*)o)->op_first;
1518 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1519 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1524 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1534 SAVESPTR(GvHV(PL_hintgv));
1535 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1536 SAVEFREESV(GvHV(PL_hintgv));
1540 block_start(int full)
1543 int retval = PL_savestack_ix;
1545 SAVEI32(PL_comppad_name_floor);
1547 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1548 PL_comppad_name_floor = PL_comppad_name_fill;
1550 PL_comppad_name_floor = 0;
1552 SAVEI32(PL_min_intro_pending);
1553 SAVEI32(PL_max_intro_pending);
1554 PL_min_intro_pending = 0;
1555 SAVEI32(PL_comppad_name_fill);
1556 SAVEI32(PL_padix_floor);
1557 PL_padix_floor = PL_padix;
1558 PL_pad_reset_pending = FALSE;
1560 PL_hints &= ~HINT_BLOCK_SCOPE;
1565 block_end(I32 floor, OP *seq)
1568 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1569 OP* retval = scalarseq(seq);
1571 PL_pad_reset_pending = FALSE;
1572 compiling.op_private = PL_hints;
1574 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1575 pad_leavemy(PL_comppad_name_fill);
1584 OP *o = newOP(OP_THREADSV, 0);
1585 o->op_targ = find_threadsv("_");
1588 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1589 #endif /* USE_THREADS */
1597 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1598 PL_eval_start = linklist(PL_eval_root);
1599 PL_eval_root->op_next = 0;
1600 peep(PL_eval_start);
1605 PL_main_root = scope(sawparens(scalarvoid(o)));
1606 PL_curcop = &PL_compiling;
1607 PL_main_start = LINKLIST(PL_main_root);
1608 PL_main_root->op_next = 0;
1609 peep(PL_main_start);
1612 /* Register with debugger */
1614 CV *cv = perl_get_cv("DB::postponed", FALSE);
1618 XPUSHs((SV*)PL_compiling.cop_filegv);
1620 perl_call_sv((SV*)cv, G_DISCARD);
1627 localize(OP *o, I32 lex)
1629 if (o->op_flags & OPf_PARENS)
1632 if (PL_dowarn && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1634 for (s = PL_bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1635 if (*s == ';' || *s == '=')
1636 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1640 PL_in_my_stash = Nullhv;
1644 return mod(o, OP_NULL); /* a bit kludgey */
1650 if (o->op_type == OP_LIST) {
1653 o2 = newOP(OP_THREADSV, 0);
1654 o2->op_targ = find_threadsv(";");
1656 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1657 #endif /* USE_THREADS */
1658 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1664 fold_constants(register OP *o)
1668 I32 type = o->op_type;
1671 if (opargs[type] & OA_RETSCALAR)
1673 if (opargs[type] & OA_TARGET)
1674 o->op_targ = pad_alloc(type, SVs_PADTMP);
1676 if ((opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1677 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1679 if (!(opargs[type] & OA_FOLDCONST))
1694 if (o->op_private & OPpLOCALE)
1699 goto nope; /* Don't try to run w/ errors */
1701 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1702 if (curop->op_type != OP_CONST &&
1703 curop->op_type != OP_LIST &&
1704 curop->op_type != OP_SCALAR &&
1705 curop->op_type != OP_NULL &&
1706 curop->op_type != OP_PUSHMARK) {
1711 curop = LINKLIST(o);
1715 sv = *(PL_stack_sp--);
1716 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1717 pad_swipe(o->op_targ);
1718 else if (SvTEMP(sv)) { /* grab mortal temp? */
1719 (void)SvREFCNT_inc(sv);
1723 if (type == OP_RV2GV)
1724 return newGVOP(OP_GV, 0, (GV*)sv);
1726 /* try to smush double to int, but don't smush -2.0 to -2 */
1727 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1731 if ((double)iv == SvNV(sv)) {
1736 SvIOK_off(sv); /* undo SvIV() damage */
1738 return newSVOP(OP_CONST, 0, sv);
1742 if (!(opargs[type] & OA_OTHERINT))
1745 if (!(PL_hints & HINT_INTEGER)) {
1746 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1749 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1750 if (curop->op_type == OP_CONST) {
1751 if (SvIOK(((SVOP*)curop)->op_sv))
1755 if (opargs[curop->op_type] & OA_RETINTEGER)
1759 o->op_ppaddr = ppaddr[++(o->op_type)];
1766 gen_constant_list(register OP *o)
1770 I32 oldtmps_floor = PL_tmps_floor;
1774 return o; /* Don't attempt to run with errors */
1776 PL_op = curop = LINKLIST(o);
1782 PL_tmps_floor = oldtmps_floor;
1784 o->op_type = OP_RV2AV;
1785 o->op_ppaddr = ppaddr[OP_RV2AV];
1786 curop = ((UNOP*)o)->op_first;
1787 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1794 convert(I32 type, I32 flags, OP *o)
1799 if (!o || o->op_type != OP_LIST)
1800 o = newLISTOP(OP_LIST, 0, o, Nullop);
1802 o->op_flags &= ~OPf_WANT;
1804 if (!(opargs[type] & OA_MARK))
1805 null(cLISTOPo->op_first);
1808 o->op_ppaddr = ppaddr[type];
1809 o->op_flags |= flags;
1811 o = CHECKOP(type, o);
1812 if (o->op_type != type)
1815 if (cLISTOPo->op_children < 7) {
1816 /* XXX do we really need to do this if we're done appending?? */
1817 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1819 cLISTOPo->op_last = last; /* in case check substituted last arg */
1822 return fold_constants(o);
1825 /* List constructors */
1828 append_elem(I32 type, OP *first, OP *last)
1836 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1837 return newLISTOP(type, 0, first, last);
1839 if (first->op_flags & OPf_KIDS)
1840 ((LISTOP*)first)->op_last->op_sibling = last;
1842 first->op_flags |= OPf_KIDS;
1843 ((LISTOP*)first)->op_first = last;
1845 ((LISTOP*)first)->op_last = last;
1846 ((LISTOP*)first)->op_children++;
1851 append_list(I32 type, LISTOP *first, LISTOP *last)
1859 if (first->op_type != type)
1860 return prepend_elem(type, (OP*)first, (OP*)last);
1862 if (last->op_type != type)
1863 return append_elem(type, (OP*)first, (OP*)last);
1865 first->op_last->op_sibling = last->op_first;
1866 first->op_last = last->op_last;
1867 first->op_children += last->op_children;
1868 if (first->op_children)
1869 last->op_flags |= OPf_KIDS;
1876 prepend_elem(I32 type, OP *first, OP *last)
1884 if (last->op_type == type) {
1885 if (type == OP_LIST) { /* already a PUSHMARK there */
1886 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1887 ((LISTOP*)last)->op_first->op_sibling = first;
1890 if (!(last->op_flags & OPf_KIDS)) {
1891 ((LISTOP*)last)->op_last = first;
1892 last->op_flags |= OPf_KIDS;
1894 first->op_sibling = ((LISTOP*)last)->op_first;
1895 ((LISTOP*)last)->op_first = first;
1897 ((LISTOP*)last)->op_children++;
1901 return newLISTOP(type, 0, first, last);
1909 return newOP(OP_STUB, 0);
1915 if (!o || o->op_type != OP_LIST)
1916 o = newLISTOP(OP_LIST, 0, o, Nullop);
1922 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1926 Newz(1101, listop, 1, LISTOP);
1928 listop->op_type = type;
1929 listop->op_ppaddr = ppaddr[type];
1930 listop->op_children = (first != 0) + (last != 0);
1931 listop->op_flags = flags;
1935 else if (!first && last)
1938 first->op_sibling = last;
1939 listop->op_first = first;
1940 listop->op_last = last;
1941 if (type == OP_LIST) {
1943 pushop = newOP(OP_PUSHMARK, 0);
1944 pushop->op_sibling = first;
1945 listop->op_first = pushop;
1946 listop->op_flags |= OPf_KIDS;
1948 listop->op_last = pushop;
1950 else if (listop->op_children)
1951 listop->op_flags |= OPf_KIDS;
1957 newOP(I32 type, I32 flags)
1960 Newz(1101, o, 1, OP);
1962 o->op_ppaddr = ppaddr[type];
1963 o->op_flags = flags;
1966 o->op_private = 0 + (flags >> 8);
1967 if (opargs[type] & OA_RETSCALAR)
1969 if (opargs[type] & OA_TARGET)
1970 o->op_targ = pad_alloc(type, SVs_PADTMP);
1971 return CHECKOP(type, o);
1975 newUNOP(I32 type, I32 flags, OP *first)
1980 first = newOP(OP_STUB, 0);
1981 if (opargs[type] & OA_MARK)
1982 first = force_list(first);
1984 Newz(1101, unop, 1, UNOP);
1985 unop->op_type = type;
1986 unop->op_ppaddr = ppaddr[type];
1987 unop->op_first = first;
1988 unop->op_flags = flags | OPf_KIDS;
1989 unop->op_private = 1 | (flags >> 8);
1990 unop = (UNOP*) CHECKOP(type, unop);
1994 return fold_constants((OP *) unop);
1998 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2001 Newz(1101, binop, 1, BINOP);
2004 first = newOP(OP_NULL, 0);
2006 binop->op_type = type;
2007 binop->op_ppaddr = ppaddr[type];
2008 binop->op_first = first;
2009 binop->op_flags = flags | OPf_KIDS;
2012 binop->op_private = 1 | (flags >> 8);
2015 binop->op_private = 2 | (flags >> 8);
2016 first->op_sibling = last;
2019 binop = (BINOP*)CHECKOP(type, binop);
2023 binop->op_last = last = binop->op_first->op_sibling;
2025 return fold_constants((OP *)binop);
2029 utf8compare(const void *a, const void *b)
2032 for (i = 0; i < 10; i++) {
2033 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2035 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2042 pmtrans(OP *o, OP *expr, OP *repl)
2044 SV *tstr = ((SVOP*)expr)->op_sv;
2045 SV *rstr = ((SVOP*)repl)->op_sv;
2048 register U8 *t = (U8*)SvPV(tstr, tlen);
2049 register U8 *r = (U8*)SvPV(rstr, rlen);
2055 register short *tbl;
2057 complement = o->op_private & OPpTRANS_COMPLEMENT;
2058 del = o->op_private & OPpTRANS_DELETE;
2059 squash = o->op_private & OPpTRANS_SQUASH;
2061 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2062 SV* listsv = newSVpv("# comment\n",0);
2064 U8* tend = t + tlen;
2065 U8* rend = r + rlen;
2081 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2082 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2088 New(1109, cp, tlen, U8*);
2090 transv = newSVpv("",0);
2099 qsort(cp, i, sizeof(U8*), utf8compare);
2100 for (j = 0; j < i; j++) {
2102 UV val = utf8_to_uv(s, &ulen);
2104 diff = val - nextmin;
2106 t = uv_to_utf8(tmpbuf,nextmin);
2107 sv_catpvn(transv, tmpbuf, t - tmpbuf);
2109 t = uv_to_utf8(tmpbuf, val - 1);
2110 sv_catpvn(transv, "\377", 1);
2111 sv_catpvn(transv, tmpbuf, t - tmpbuf);
2115 val = utf8_to_uv(s+1, &ulen);
2119 t = uv_to_utf8(tmpbuf,nextmin);
2120 sv_catpvn(transv, tmpbuf, t - tmpbuf);
2121 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2122 sv_catpvn(transv, "\377", 1);
2123 sv_catpvn(transv, tmpbuf, t - tmpbuf);
2125 tlen = SvCUR(transv);
2128 else if (!rlen && !del) {
2129 r = t; rlen = tlen; rend = tend;
2130 if (!squash && to_utf && from_utf)
2131 o->op_private |= OPpTRANS_COUNTONLY;
2134 while (t < tend || tfirst <= tlast) {
2135 /* see if we need more "t" chars */
2136 if (tfirst > tlast) {
2137 tfirst = (I32)utf8_to_uv(t, &ulen);
2139 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2140 tlast = (I32)utf8_to_uv(++t, &ulen);
2147 /* now see if we need more "r" chars */
2148 if (rfirst > rlast) {
2150 rfirst = (I32)utf8_to_uv(r, &ulen);
2152 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2153 rlast = (I32)utf8_to_uv(++r, &ulen);
2162 rfirst = rlast = 0xffffffff;
2166 /* now see which range will peter our first, if either. */
2167 tdiff = tlast - tfirst;
2168 rdiff = rlast - rfirst;
2175 if (rfirst == 0xffffffff) {
2176 diff = tdiff; /* oops, pretend rdiff is infinite */
2178 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2180 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2184 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2186 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2188 if (rfirst + diff > max)
2189 max = rfirst + diff;
2194 else if (rfirst <= 0x800)
2195 grows |= (tfirst < 0x80);
2196 else if (rfirst <= 0x10000)
2197 grows |= (tfirst < 0x800);
2198 else if (rfirst <= 0x200000)
2199 grows |= (tfirst < 0x10000);
2200 else if (rfirst <= 0x4000000)
2201 grows |= (tfirst < 0x200000);
2202 else if (rfirst <= 0x80000000)
2203 grows |= (tfirst < 0x4000000);
2215 else if (max > 0xff)
2220 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2221 SvREFCNT_dec(listsv);
2223 SvREFCNT_dec(transv);
2225 if (!del && havefinal)
2226 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2228 if (grows && to_utf)
2229 o->op_private |= OPpTRANS_GROWS;
2236 tbl = (short*)cPVOPo->op_pv;
2238 Zero(tbl, 256, short);
2239 for (i = 0; i < tlen; i++)
2241 for (i = 0, j = 0; i < 256; i++) {
2257 if (!rlen && !del) {
2260 o->op_private |= OPpTRANS_COUNTONLY;
2262 for (i = 0; i < 256; i++)
2264 for (i = 0, j = 0; i < tlen; i++,j++) {
2267 if (tbl[t[i]] == -1)
2273 if (tbl[t[i]] == -1)
2284 newPMOP(I32 type, I32 flags)
2289 Newz(1101, pmop, 1, PMOP);
2290 pmop->op_type = type;
2291 pmop->op_ppaddr = ppaddr[type];
2292 pmop->op_flags = flags;
2293 pmop->op_private = 0 | (flags >> 8);
2295 if (PL_hints & HINT_RE_TAINT)
2296 pmop->op_pmpermflags |= PMf_RETAINT;
2297 if (PL_hints & HINT_LOCALE)
2298 pmop->op_pmpermflags |= PMf_LOCALE;
2299 pmop->op_pmflags = pmop->op_pmpermflags;
2301 /* link into pm list */
2302 if (type != OP_TRANS && PL_curstash) {
2303 pmop->op_pmnext = HvPMROOT(PL_curstash);
2304 HvPMROOT(PL_curstash) = pmop;
2311 pmruntime(OP *o, OP *expr, OP *repl)
2316 I32 repl_has_vars = 0;
2318 if (o->op_type == OP_TRANS)
2319 return pmtrans(o, expr, repl);
2321 PL_hints |= HINT_BLOCK_SCOPE;
2324 if (expr->op_type == OP_CONST) {
2326 SV *pat = ((SVOP*)expr)->op_sv;
2327 char *p = SvPV(pat, plen);
2328 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2329 sv_setpvn(pat, "\\s+", 3);
2330 p = SvPV(pat, plen);
2331 pm->op_pmflags |= PMf_SKIPWHITE;
2333 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2334 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2335 pm->op_pmflags |= PMf_WHITE;
2339 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2340 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2342 : OP_REGCMAYBE),0,expr);
2344 Newz(1101, rcop, 1, LOGOP);
2345 rcop->op_type = OP_REGCOMP;
2346 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2347 rcop->op_first = scalar(expr);
2348 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2349 ? (OPf_SPECIAL | OPf_KIDS)
2351 rcop->op_private = 1;
2354 /* establish postfix order */
2355 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2357 rcop->op_next = expr;
2358 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2361 rcop->op_next = LINKLIST(expr);
2362 expr->op_next = (OP*)rcop;
2365 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2370 if (pm->op_pmflags & PMf_EVAL)
2373 else if (repl->op_type == OP_THREADSV
2374 && strchr("&`'123456789+",
2375 PL_threadsv_names[repl->op_targ]))
2379 #endif /* USE_THREADS */
2380 else if (repl->op_type == OP_CONST)
2384 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2385 if (opargs[curop->op_type] & OA_DANGEROUS) {
2387 if (curop->op_type == OP_THREADSV) {
2389 if (strchr("&`'123456789+", curop->op_private))
2393 if (curop->op_type == OP_GV) {
2394 GV *gv = ((GVOP*)curop)->op_gv;
2396 if (strchr("&`'123456789+", *GvENAME(gv)))
2399 #endif /* USE_THREADS */
2400 else if (curop->op_type == OP_RV2CV)
2402 else if (curop->op_type == OP_RV2SV ||
2403 curop->op_type == OP_RV2AV ||
2404 curop->op_type == OP_RV2HV ||
2405 curop->op_type == OP_RV2GV) {
2406 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2409 else if (curop->op_type == OP_PADSV ||
2410 curop->op_type == OP_PADAV ||
2411 curop->op_type == OP_PADHV ||
2412 curop->op_type == OP_PADANY) {
2415 else if (curop->op_type == OP_PUSHRE)
2416 ; /* Okay here, dangerous in newASSIGNOP */
2425 && (!pm->op_pmregexp
2426 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2427 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2428 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2429 prepend_elem(o->op_type, scalar(repl), o);
2432 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2433 pm->op_pmflags |= PMf_MAYBE_CONST;
2434 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2436 Newz(1101, rcop, 1, LOGOP);
2437 rcop->op_type = OP_SUBSTCONT;
2438 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2439 rcop->op_first = scalar(repl);
2440 rcop->op_flags |= OPf_KIDS;
2441 rcop->op_private = 1;
2444 /* establish postfix order */
2445 rcop->op_next = LINKLIST(repl);
2446 repl->op_next = (OP*)rcop;
2448 pm->op_pmreplroot = scalar((OP*)rcop);
2449 pm->op_pmreplstart = LINKLIST(rcop);
2458 newSVOP(I32 type, I32 flags, SV *sv)
2461 Newz(1101, svop, 1, SVOP);
2462 svop->op_type = type;
2463 svop->op_ppaddr = ppaddr[type];
2465 svop->op_next = (OP*)svop;
2466 svop->op_flags = flags;
2467 if (opargs[type] & OA_RETSCALAR)
2469 if (opargs[type] & OA_TARGET)
2470 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2471 return CHECKOP(type, svop);
2475 newGVOP(I32 type, I32 flags, GV *gv)
2479 Newz(1101, gvop, 1, GVOP);
2480 gvop->op_type = type;
2481 gvop->op_ppaddr = ppaddr[type];
2482 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2483 gvop->op_next = (OP*)gvop;
2484 gvop->op_flags = flags;
2485 if (opargs[type] & OA_RETSCALAR)
2487 if (opargs[type] & OA_TARGET)
2488 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2489 return CHECKOP(type, gvop);
2493 newPVOP(I32 type, I32 flags, char *pv)
2496 Newz(1101, pvop, 1, PVOP);
2497 pvop->op_type = type;
2498 pvop->op_ppaddr = ppaddr[type];
2500 pvop->op_next = (OP*)pvop;
2501 pvop->op_flags = flags;
2502 if (opargs[type] & OA_RETSCALAR)
2504 if (opargs[type] & OA_TARGET)
2505 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2506 return CHECKOP(type, pvop);
2515 save_hptr(&PL_curstash);
2516 save_item(PL_curstname);
2521 name = SvPV(sv, len);
2522 PL_curstash = gv_stashpvn(name,len,TRUE);
2523 sv_setpvn(PL_curstname, name, len);
2527 sv_setpv(PL_curstname,"<none>");
2528 PL_curstash = Nullhv;
2530 PL_copline = NOLINE;
2535 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2543 if (id->op_type != OP_CONST)
2544 croak("Module name must be constant");
2548 if(version != Nullop) {
2549 SV *vesv = ((SVOP*)version)->op_sv;
2551 if (arg == Nullop && !SvNIOK(vesv)) {
2558 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2559 croak("Version number must be constant number");
2561 /* Make copy of id so we don't free it twice */
2562 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2564 /* Fake up a method call to VERSION */
2565 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2566 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2567 append_elem(OP_LIST,
2568 prepend_elem(OP_LIST, pack, list(version)),
2569 newUNOP(OP_METHOD, 0, meth)));
2573 /* Fake up an import/unimport */
2574 if (arg && arg->op_type == OP_STUB)
2575 imop = arg; /* no import on explicit () */
2576 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2577 imop = Nullop; /* use 5.0; */
2580 /* Make copy of id so we don't free it twice */
2581 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2582 meth = newSVOP(OP_CONST, 0,
2584 ? newSVpv("import", 6)
2585 : newSVpv("unimport", 8)
2587 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2588 append_elem(OP_LIST,
2589 prepend_elem(OP_LIST, pack, list(arg)),
2590 newUNOP(OP_METHOD, 0, meth)));
2593 /* Fake up a require */
2594 rqop = newUNOP(OP_REQUIRE, 0, id);
2596 /* Fake up the BEGIN {}, which does its thing immediately. */
2598 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2600 append_elem(OP_LINESEQ,
2601 append_elem(OP_LINESEQ,
2602 newSTATEOP(0, Nullch, rqop),
2603 newSTATEOP(0, Nullch, veop)),
2604 newSTATEOP(0, Nullch, imop) ));
2606 PL_copline = NOLINE;
2611 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2613 return newBINOP(OP_LSLICE, flags,
2614 list(force_list(subscript)),
2615 list(force_list(listval)) );
2619 list_assignment(register OP *o)
2624 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2625 o = cUNOPo->op_first;
2627 if (o->op_type == OP_COND_EXPR) {
2628 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2629 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2634 yyerror("Assignment to both a list and a scalar");
2638 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2639 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2640 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2643 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2646 if (o->op_type == OP_RV2SV)
2653 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2658 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2659 return newLOGOP(optype, 0,
2660 mod(scalar(left), optype),
2661 newUNOP(OP_SASSIGN, 0, scalar(right)));
2664 return newBINOP(optype, OPf_STACKED,
2665 mod(scalar(left), optype), scalar(right));
2669 if (list_assignment(left)) {
2672 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2673 left = mod(left, OP_AASSIGN);
2681 o = newBINOP(OP_AASSIGN, flags,
2682 list(force_list(right)),
2683 list(force_list(left)) );
2684 o->op_private = 0 | (flags >> 8);
2685 if (!(left->op_private & OPpLVAL_INTRO)) {
2689 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2690 if (opargs[curop->op_type] & OA_DANGEROUS) {
2691 if (curop->op_type == OP_GV) {
2692 GV *gv = ((GVOP*)curop)->op_gv;
2693 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2695 SvCUR(gv) = PL_generation;
2697 else if (curop->op_type == OP_PADSV ||
2698 curop->op_type == OP_PADAV ||
2699 curop->op_type == OP_PADHV ||
2700 curop->op_type == OP_PADANY) {
2701 SV **svp = AvARRAY(PL_comppad_name);
2702 SV *sv = svp[curop->op_targ];
2703 if (SvCUR(sv) == PL_generation)
2705 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2707 else if (curop->op_type == OP_RV2CV)
2709 else if (curop->op_type == OP_RV2SV ||
2710 curop->op_type == OP_RV2AV ||
2711 curop->op_type == OP_RV2HV ||
2712 curop->op_type == OP_RV2GV) {
2713 if (lastop->op_type != OP_GV) /* funny deref? */
2716 else if (curop->op_type == OP_PUSHRE) {
2717 if (((PMOP*)curop)->op_pmreplroot) {
2718 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2719 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2721 SvCUR(gv) = PL_generation;
2730 o->op_private = OPpASSIGN_COMMON;
2732 if (right && right->op_type == OP_SPLIT) {
2734 if ((tmpop = ((LISTOP*)right)->op_first) &&
2735 tmpop->op_type == OP_PUSHRE)
2737 PMOP *pm = (PMOP*)tmpop;
2738 if (left->op_type == OP_RV2AV &&
2739 !(left->op_private & OPpLVAL_INTRO) &&
2740 !(o->op_private & OPpASSIGN_COMMON) )
2742 tmpop = ((UNOP*)left)->op_first;
2743 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2744 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2745 pm->op_pmflags |= PMf_ONCE;
2746 tmpop = cUNOPo->op_first; /* to list (nulled) */
2747 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2748 tmpop->op_sibling = Nullop; /* don't free split */
2749 right->op_next = tmpop->op_next; /* fix starting loc */
2750 op_free(o); /* blow off assign */
2751 right->op_flags &= ~OPf_WANT;
2752 /* "I don't know and I don't care." */
2757 if (PL_modcount < 10000 &&
2758 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2760 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2762 sv_setiv(sv, PL_modcount+1);
2770 right = newOP(OP_UNDEF, 0);
2771 if (right->op_type == OP_READLINE) {
2772 right->op_flags |= OPf_STACKED;
2773 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2776 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2777 o = newBINOP(OP_SASSIGN, flags,
2778 scalar(right), mod(scalar(left), OP_SASSIGN) );
2790 newSTATEOP(I32 flags, char *label, OP *o)
2793 U32 seq = intro_my();
2796 Newz(1101, cop, 1, COP);
2797 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2798 cop->op_type = OP_DBSTATE;
2799 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2802 cop->op_type = OP_NEXTSTATE;
2803 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2805 cop->op_flags = flags;
2806 cop->op_private = (PL_hints & HINT_UTF8);
2808 cop->op_private |= NATIVE_HINTS;
2810 compiling.op_private = cop->op_private;
2811 cop->op_next = (OP*)cop;
2814 cop->cop_label = label;
2815 PL_hints |= HINT_BLOCK_SCOPE;
2818 cop->cop_arybase = PL_curcop->cop_arybase;
2820 if (PL_copline == NOLINE)
2821 cop->cop_line = PL_curcop->cop_line;
2823 cop->cop_line = PL_copline;
2824 PL_copline = NOLINE;
2826 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2827 cop->cop_stash = PL_curstash;
2829 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2830 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2831 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2832 (void)SvIOK_on(*svp);
2834 SvSTASH(*svp) = (HV*)cop;
2838 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2841 /* "Introduce" my variables to visible status. */
2849 if (! PL_min_intro_pending)
2850 return PL_cop_seqmax;
2852 svp = AvARRAY(PL_comppad_name);
2853 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2854 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2855 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2856 SvNVX(sv) = (double)PL_cop_seqmax;
2859 PL_min_intro_pending = 0;
2860 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2861 return PL_cop_seqmax++;
2865 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2867 return new_logop(type, flags, &first, &other);
2871 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2876 OP *first = *firstp;
2877 OP *other = *otherp;
2879 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2880 return newBINOP(type, flags, scalar(first), scalar(other));
2882 scalarboolean(first);
2883 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2884 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2885 if (type == OP_AND || type == OP_OR) {
2891 first = *firstp = cUNOPo->op_first;
2893 first->op_next = o->op_next;
2894 cUNOPo->op_first = Nullop;
2898 if (first->op_type == OP_CONST) {
2899 if (PL_dowarn && (first->op_private & OPpCONST_BARE))
2900 warn("Probable precedence problem on %s", op_desc[type]);
2901 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2912 else if (first->op_type == OP_WANTARRAY) {
2918 else if (PL_dowarn && (first->op_flags & OPf_KIDS)) {
2919 OP *k1 = ((UNOP*)first)->op_first;
2920 OP *k2 = k1->op_sibling;
2922 switch (first->op_type)
2925 if (k2 && k2->op_type == OP_READLINE
2926 && (k2->op_flags & OPf_STACKED)
2927 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2928 warnop = k2->op_type;
2932 if (k1->op_type == OP_READDIR
2933 || k1->op_type == OP_GLOB
2934 || k1->op_type == OP_EACH)
2935 warnop = k1->op_type;
2939 line_t oldline = PL_curcop->cop_line;
2940 PL_curcop->cop_line = PL_copline;
2941 warn("Value of %s%s can be \"0\"; test with defined()",
2943 ((warnop == OP_READLINE || warnop == OP_GLOB)
2944 ? " construct" : "() operator"));
2945 PL_curcop->cop_line = oldline;
2952 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2953 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2955 Newz(1101, logop, 1, LOGOP);
2957 logop->op_type = type;
2958 logop->op_ppaddr = ppaddr[type];
2959 logop->op_first = first;
2960 logop->op_flags = flags | OPf_KIDS;
2961 logop->op_other = LINKLIST(other);
2962 logop->op_private = 1 | (flags >> 8);
2964 /* establish postfix order */
2965 logop->op_next = LINKLIST(first);
2966 first->op_next = (OP*)logop;
2967 first->op_sibling = other;
2969 o = newUNOP(OP_NULL, 0, (OP*)logop);
2976 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2983 return newLOGOP(OP_AND, 0, first, trueop);
2985 return newLOGOP(OP_OR, 0, first, falseop);
2987 scalarboolean(first);
2988 if (first->op_type == OP_CONST) {
2989 if (SvTRUE(((SVOP*)first)->op_sv)) {
3000 else if (first->op_type == OP_WANTARRAY) {
3004 Newz(1101, condop, 1, CONDOP);
3006 condop->op_type = OP_COND_EXPR;
3007 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
3008 condop->op_first = first;
3009 condop->op_flags = flags | OPf_KIDS;
3010 condop->op_true = LINKLIST(trueop);
3011 condop->op_false = LINKLIST(falseop);
3012 condop->op_private = 1 | (flags >> 8);
3014 /* establish postfix order */
3015 condop->op_next = LINKLIST(first);
3016 first->op_next = (OP*)condop;
3018 first->op_sibling = trueop;
3019 trueop->op_sibling = falseop;
3020 o = newUNOP(OP_NULL, 0, (OP*)condop);
3022 trueop->op_next = o;
3023 falseop->op_next = o;
3029 newRANGE(I32 flags, OP *left, OP *right)
3037 Newz(1101, condop, 1, CONDOP);
3039 condop->op_type = OP_RANGE;
3040 condop->op_ppaddr = ppaddr[OP_RANGE];
3041 condop->op_first = left;
3042 condop->op_flags = OPf_KIDS;
3043 condop->op_true = LINKLIST(left);
3044 condop->op_false = LINKLIST(right);
3045 condop->op_private = 1 | (flags >> 8);
3047 left->op_sibling = right;
3049 condop->op_next = (OP*)condop;
3050 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3051 flop = newUNOP(OP_FLOP, 0, flip);
3052 o = newUNOP(OP_NULL, 0, flop);
3055 left->op_next = flip;
3056 right->op_next = flop;
3058 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3059 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3060 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3061 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3063 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3064 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3067 if (!flip->op_private || !flop->op_private)
3068 linklist(o); /* blow off optimizer unless constant */
3074 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3079 int once = block && block->op_flags & OPf_SPECIAL &&
3080 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3083 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3084 return block; /* do {} while 0 does once */
3085 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3086 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3087 expr = newUNOP(OP_DEFINED, 0,
3088 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3089 } else if (expr->op_flags & OPf_KIDS) {
3090 OP *k1 = ((UNOP*)expr)->op_first;
3091 OP *k2 = (k1) ? k1->op_sibling : NULL;
3092 switch (expr->op_type) {
3094 if (k2 && k2->op_type == OP_READLINE
3095 && (k2->op_flags & OPf_STACKED)
3096 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3097 expr = newUNOP(OP_DEFINED, 0, expr);
3101 if (k1->op_type == OP_READDIR
3102 || k1->op_type == OP_GLOB
3103 || k1->op_type == OP_EACH)
3104 expr = newUNOP(OP_DEFINED, 0, expr);
3110 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3111 o = new_logop(OP_AND, 0, &expr, &listop);
3114 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3116 if (once && o != listop)
3117 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3120 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3122 o->op_flags |= flags;
3124 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3129 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3138 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3139 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3140 expr = newUNOP(OP_DEFINED, 0,
3141 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3142 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3143 OP *k1 = ((UNOP*)expr)->op_first;
3144 OP *k2 = (k1) ? k1->op_sibling : NULL;
3145 switch (expr->op_type) {
3147 if (k2 && k2->op_type == OP_READLINE
3148 && (k2->op_flags & OPf_STACKED)
3149 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3150 expr = newUNOP(OP_DEFINED, 0, expr);
3154 if (k1->op_type == OP_READDIR
3155 || k1->op_type == OP_GLOB
3156 || k1->op_type == OP_EACH)
3157 expr = newUNOP(OP_DEFINED, 0, expr);
3163 block = newOP(OP_NULL, 0);
3166 next = LINKLIST(cont);
3168 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3169 if ((line_t)whileline != NOLINE) {
3170 PL_copline = whileline;
3171 cont = append_elem(OP_LINESEQ, cont,
3172 newSTATEOP(0, Nullch, Nullop));
3176 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3177 redo = LINKLIST(listop);
3180 PL_copline = whileline;
3182 o = new_logop(OP_AND, 0, &expr, &listop);
3183 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3184 op_free(expr); /* oops, it's a while (0) */
3186 return Nullop; /* listop already freed by new_logop */
3189 ((LISTOP*)listop)->op_last->op_next = condop =
3190 (o == listop ? redo : LINKLIST(o));
3198 Newz(1101,loop,1,LOOP);
3199 loop->op_type = OP_ENTERLOOP;
3200 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
3201 loop->op_private = 0;
3202 loop->op_next = (OP*)loop;
3205 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3207 loop->op_redoop = redo;
3208 loop->op_lastop = o;
3211 loop->op_nextop = next;
3213 loop->op_nextop = o;
3215 o->op_flags |= flags;
3216 o->op_private |= (flags >> 8);
3221 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3229 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3230 sv->op_type = OP_RV2GV;
3231 sv->op_ppaddr = ppaddr[OP_RV2GV];
3233 else if (sv->op_type == OP_PADSV) { /* private variable */
3234 padoff = sv->op_targ;
3238 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3239 padoff = sv->op_targ;
3240 iterflags |= OPf_SPECIAL;
3245 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3249 padoff = find_threadsv("_");
3250 iterflags |= OPf_SPECIAL;
3252 sv = newGVOP(OP_GV, 0, PL_defgv);
3255 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3256 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3257 iterflags |= OPf_STACKED;
3259 else if (expr->op_type == OP_NULL &&
3260 (expr->op_flags & OPf_KIDS) &&
3261 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3263 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3264 * set the STACKED flag to indicate that these values are to be
3265 * treated as min/max values by 'pp_iterinit'.
3267 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3268 CONDOP* range = (CONDOP*) flip->op_first;
3269 OP* left = range->op_first;
3270 OP* right = left->op_sibling;
3273 range->op_flags &= ~OPf_KIDS;
3274 range->op_first = Nullop;
3276 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3277 listop->op_first->op_next = range->op_true;
3278 left->op_next = range->op_false;
3279 right->op_next = (OP*)listop;
3280 listop->op_next = listop->op_first;
3283 expr = (OP*)(listop);
3285 iterflags |= OPf_STACKED;
3288 expr = mod(force_list(expr), OP_GREPSTART);
3292 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3293 append_elem(OP_LIST, expr, scalar(sv))));
3294 assert(!loop->op_next);
3295 Renew(loop, 1, LOOP);
3296 loop->op_targ = padoff;
3297 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3298 PL_copline = forline;
3299 return newSTATEOP(0, label, wop);
3303 newLOOPEX(I32 type, OP *label)
3307 if (type != OP_GOTO || label->op_type == OP_CONST) {
3308 /* "last()" means "last" */
3309 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3310 o = newOP(type, OPf_SPECIAL);
3312 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3313 ? SvPVx(((SVOP*)label)->op_sv, PL_na)
3319 if (label->op_type == OP_ENTERSUB)
3320 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3321 o = newUNOP(type, OPf_STACKED, label);
3323 PL_hints |= HINT_BLOCK_SCOPE;
3333 MUTEX_DESTROY(CvMUTEXP(cv));
3334 Safefree(CvMUTEXP(cv));
3337 #endif /* USE_THREADS */
3339 if (!CvXSUB(cv) && CvROOT(cv)) {
3341 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3342 croak("Can't undef active subroutine");
3345 croak("Can't undef active subroutine");
3346 #endif /* USE_THREADS */
3349 SAVESPTR(PL_curpad);
3353 op_free(CvROOT(cv));
3354 CvROOT(cv) = Nullop;
3357 SvPOK_off((SV*)cv); /* forget prototype */
3359 SvREFCNT_dec(CvGV(cv));
3361 SvREFCNT_dec(CvOUTSIDE(cv));
3362 CvOUTSIDE(cv) = Nullcv;
3363 if (CvPADLIST(cv)) {
3364 /* may be during global destruction */
3365 if (SvREFCNT(CvPADLIST(cv))) {
3366 I32 i = AvFILLp(CvPADLIST(cv));
3368 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3369 SV* sv = svp ? *svp : Nullsv;
3372 if (sv == (SV*)PL_comppad_name)
3373 PL_comppad_name = Nullav;
3374 else if (sv == (SV*)PL_comppad) {
3375 PL_comppad = Nullav;
3376 PL_curpad = Null(SV**);
3380 SvREFCNT_dec((SV*)CvPADLIST(cv));
3382 CvPADLIST(cv) = Nullav;
3386 #ifdef DEBUG_CLOSURES
3391 CV *outside = CvOUTSIDE(cv);
3392 AV* padlist = CvPADLIST(cv);
3399 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3401 (CvANON(cv) ? "ANON"
3402 : (cv == PL_main_cv) ? "MAIN"
3403 : CvUNIQUE(outside) ? "UNIQUE"
3404 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3407 : CvANON(outside) ? "ANON"
3408 : (outside == PL_main_cv) ? "MAIN"
3409 : CvUNIQUE(outside) ? "UNIQUE"
3410 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3415 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3416 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3417 pname = AvARRAY(pad_name);
3418 ppad = AvARRAY(pad);
3420 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3421 if (SvPOK(pname[ix]))
3422 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3424 SvFAKE(pname[ix]) ? "FAKE " : "",
3426 (long)I_32(SvNVX(pname[ix])),
3427 (long)SvIVX(pname[ix]));
3430 #endif /* DEBUG_CLOSURES */
3433 cv_clone2(CV *proto, CV *outside)
3438 AV* protopadlist = CvPADLIST(proto);
3439 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3440 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3441 SV** pname = AvARRAY(protopad_name);
3442 SV** ppad = AvARRAY(protopad);
3443 I32 fname = AvFILLp(protopad_name);
3444 I32 fpad = AvFILLp(protopad);
3448 assert(!CvUNIQUE(proto));
3451 SAVESPTR(PL_curpad);
3452 SAVESPTR(PL_comppad);
3453 SAVESPTR(PL_comppad_name);
3454 SAVESPTR(PL_compcv);
3456 cv = PL_compcv = (CV*)NEWSV(1104,0);
3457 sv_upgrade((SV *)cv, SvTYPE(proto));
3463 New(666, CvMUTEXP(cv), 1, perl_mutex);
3464 MUTEX_INIT(CvMUTEXP(cv));
3466 #endif /* USE_THREADS */
3467 CvFILEGV(cv) = CvFILEGV(proto);
3468 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3469 CvSTASH(cv) = CvSTASH(proto);
3470 CvROOT(cv) = CvROOT(proto);
3471 CvSTART(cv) = CvSTART(proto);
3473 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3476 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3478 PL_comppad_name = newAV();
3479 for (ix = fname; ix >= 0; ix--)
3480 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3482 PL_comppad = newAV();
3484 comppadlist = newAV();
3485 AvREAL_off(comppadlist);
3486 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3487 av_store(comppadlist, 1, (SV*)PL_comppad);
3488 CvPADLIST(cv) = comppadlist;
3489 av_fill(PL_comppad, AvFILLp(protopad));
3490 PL_curpad = AvARRAY(PL_comppad);
3492 av = newAV(); /* will be @_ */
3494 av_store(PL_comppad, 0, (SV*)av);
3495 AvFLAGS(av) = AVf_REIFY;
3497 for (ix = fpad; ix > 0; ix--) {
3498 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3499 if (namesv && namesv != &PL_sv_undef) {
3500 char *name = SvPVX(namesv); /* XXX */
3501 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3502 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3503 CvOUTSIDE(cv), cxstack_ix);
3505 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3507 croak("panic: cv_clone: %s", name);
3509 else { /* our own lexical */
3512 /* anon code -- we'll come back for it */
3513 sv = SvREFCNT_inc(ppad[ix]);
3515 else if (*name == '@')
3517 else if (*name == '%')
3527 SV* sv = NEWSV(0,0);
3533 /* Now that vars are all in place, clone nested closures. */
3535 for (ix = fpad; ix > 0; ix--) {
3536 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3538 && namesv != &PL_sv_undef
3539 && !(SvFLAGS(namesv) & SVf_FAKE)
3540 && *SvPVX(namesv) == '&'
3541 && CvCLONE(ppad[ix]))
3543 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3544 SvREFCNT_dec(ppad[ix]);
3547 PL_curpad[ix] = (SV*)kid;
3551 #ifdef DEBUG_CLOSURES
3552 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3554 PerlIO_printf(Perl_debug_log, " from:\n");
3556 PerlIO_printf(Perl_debug_log, " to:\n");
3567 return cv_clone2(proto, CvOUTSIDE(proto));
3571 cv_ckproto(CV *cv, GV *gv, char *p)
3573 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3574 SV* msg = sv_newmortal();
3578 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3579 sv_setpv(msg, "Prototype mismatch:");
3581 sv_catpvf(msg, " sub %_", name);
3583 sv_catpvf(msg, " (%s)", SvPVX(cv));
3584 sv_catpv(msg, " vs ");
3586 sv_catpvf(msg, "(%s)", p);
3588 sv_catpv(msg, "none");
3596 if (!cv || !SvPOK(cv) || SvCUR(cv))
3598 return op_const_sv(CvSTART(cv), cv);
3602 op_const_sv(OP *o, CV *cv)
3609 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3610 o = cLISTOPo->op_first->op_sibling;
3612 for (; o; o = o->op_next) {
3613 OPCODE type = o->op_type;
3615 if(sv && o->op_next == o)
3617 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3619 if (type == OP_LEAVESUB || type == OP_RETURN)
3623 if (type == OP_CONST)
3625 else if (type == OP_PADSV && cv) {
3626 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3627 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3628 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3640 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3643 char *name = o ? SvPVx(cSVOPo->op_sv, PL_na) : Nullch;
3644 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3645 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3646 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, PL_na) : Nullch;
3655 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3656 maximum a prototype before. */
3657 if (SvTYPE(gv) > SVt_NULL) {
3658 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3659 warn("Runaway prototype");
3660 cv_ckproto((CV*)gv, NULL, ps);
3663 sv_setpv((SV*)gv, ps);
3665 sv_setiv((SV*)gv, -1);
3666 SvREFCNT_dec(PL_compcv);
3667 cv = PL_compcv = NULL;
3668 PL_sub_generation++;
3672 if (!name || GvCVGEN(gv))
3674 else if (cv = GvCV(gv)) {
3675 cv_ckproto(cv, gv, ps);
3676 /* already defined (or promised)? */
3677 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3679 bool const_changed = TRUE;
3681 /* just a "sub foo;" when &foo is already defined */
3682 SAVEFREESV(PL_compcv);
3685 /* ahem, death to those who redefine active sort subs */
3686 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3687 croak("Can't redefine active sort subroutine %s", name);
3688 if(const_sv = cv_const_sv(cv))
3689 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3690 if ((const_sv && const_changed) || PL_dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3691 && HvNAME(GvSTASH(CvGV(cv)))
3692 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3694 line_t oldline = PL_curcop->cop_line;
3695 PL_curcop->cop_line = PL_copline;
3696 warn(const_sv ? "Constant subroutine %s redefined"
3697 : "Subroutine %s redefined", name);
3698 PL_curcop->cop_line = oldline;
3704 if (cv) { /* must reuse cv if autoloaded */
3706 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3707 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3708 CvOUTSIDE(PL_compcv) = 0;
3709 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3710 CvPADLIST(PL_compcv) = 0;
3711 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3712 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3713 SvREFCNT_dec(PL_compcv);
3720 PL_sub_generation++;
3723 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3724 CvFILEGV(cv) = PL_curcop->cop_filegv;
3725 CvSTASH(cv) = PL_curstash;
3729 New(666, CvMUTEXP(cv), 1, perl_mutex);
3730 MUTEX_INIT(CvMUTEXP(cv));
3731 #endif /* USE_THREADS */
3734 sv_setpv((SV*)cv, ps);
3736 if (PL_error_count) {
3740 char *s = strrchr(name, ':');
3742 if (strEQ(s, "BEGIN")) {
3744 "BEGIN not safe after errors--compilation aborted";
3748 /* force display of errors found but not reported */
3749 sv_catpv(ERRSV, not_safe);
3750 croak("%s", SvPVx(ERRSV, PL_na));
3757 PL_copline = NOLINE;
3762 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3763 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3766 SV **namep = AvARRAY(PL_comppad_name);
3767 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3770 if (SvIMMORTAL(PL_curpad[ix]))
3773 * The only things that a clonable function needs in its
3774 * pad are references to outer lexicals and anonymous subs.
3775 * The rest are created anew during cloning.
3777 if (!((namesv = namep[ix]) != Nullsv &&
3778 namesv != &PL_sv_undef &&
3780 *SvPVX(namesv) == '&')))
3782 SvREFCNT_dec(PL_curpad[ix]);
3783 PL_curpad[ix] = Nullsv;
3788 AV *av = newAV(); /* Will be @_ */
3790 av_store(PL_comppad, 0, (SV*)av);
3791 AvFLAGS(av) = AVf_REIFY;
3793 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3794 if (SvIMMORTAL(PL_curpad[ix]))
3796 if (!SvPADMY(PL_curpad[ix]))
3797 SvPADTMP_on(PL_curpad[ix]);
3801 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3802 CvSTART(cv) = LINKLIST(CvROOT(cv));
3803 CvROOT(cv)->op_next = 0;
3809 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3810 SV *sv = NEWSV(0,0);
3811 SV *tmpstr = sv_newmortal();
3812 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3816 sv_setpvf(sv, "%_:%ld-%ld",
3817 GvSV(PL_curcop->cop_filegv),
3818 (long)PL_subline, (long)PL_curcop->cop_line);
3819 gv_efullname3(tmpstr, gv, Nullch);
3820 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3821 hv = GvHVn(db_postponed);
3822 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3823 && (cv = GvCV(db_postponed))) {
3828 perl_call_sv((SV*)cv, G_DISCARD);
3832 if ((s = strrchr(name,':')))
3836 if (strEQ(s, "BEGIN")) {
3837 I32 oldscope = PL_scopestack_ix;
3839 SAVESPTR(PL_compiling.cop_filegv);
3840 SAVEI16(PL_compiling.cop_line);
3842 sv_setsv(PL_rs, PL_nrs);
3845 PL_beginav = newAV();
3846 DEBUG_x( dump_sub(gv) );
3847 av_push(PL_beginav, (SV *)cv);
3849 call_list(oldscope, PL_beginav);
3851 PL_curcop = &PL_compiling;
3852 PL_compiling.op_private = PL_hints;
3855 else if (strEQ(s, "END") && !PL_error_count) {
3858 av_unshift(PL_endav, 1);
3859 av_store(PL_endav, 0, (SV *)cv);
3862 else if (strEQ(s, "INIT") && !PL_error_count) {
3864 PL_initav = newAV();
3865 av_push(PL_initav, SvREFCNT_inc(cv));
3871 PL_copline = NOLINE;
3877 newCONSTSUB(HV *stash, char *name, SV *sv)
3880 U32 oldhints = PL_hints;
3881 HV *old_cop_stash = PL_curcop->cop_stash;
3882 HV *old_curstash = PL_curstash;
3883 line_t oldline = PL_curcop->cop_line;
3884 PL_curcop->cop_line = PL_copline;
3886 PL_hints &= ~HINT_BLOCK_SCOPE;
3888 PL_curstash = PL_curcop->cop_stash = stash;
3891 start_subparse(FALSE, 0),
3892 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3893 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
3894 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3897 PL_hints = oldhints;
3898 PL_curcop->cop_stash = old_cop_stash;
3899 PL_curstash = old_curstash;
3900 PL_curcop->cop_line = oldline;
3904 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3907 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3910 if (cv = (name ? GvCV(gv) : Nullcv)) {
3912 /* just a cached method */
3916 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3917 /* already defined (or promised) */
3918 if (PL_dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3919 && HvNAME(GvSTASH(CvGV(cv)))
3920 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3921 line_t oldline = PL_curcop->cop_line;
3922 PL_curcop->cop_line = PL_copline;
3923 warn("Subroutine %s redefined",name);
3924 PL_curcop->cop_line = oldline;
3931 if (cv) /* must reuse cv if autoloaded */
3934 cv = (CV*)NEWSV(1105,0);
3935 sv_upgrade((SV *)cv, SVt_PVCV);
3939 PL_sub_generation++;
3942 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3944 New(666, CvMUTEXP(cv), 1, perl_mutex);
3945 MUTEX_INIT(CvMUTEXP(cv));
3947 #endif /* USE_THREADS */
3948 CvFILEGV(cv) = gv_fetchfile(filename);
3949 CvXSUB(cv) = subaddr;
3952 char *s = strrchr(name,':');
3957 if (strEQ(s, "BEGIN")) {
3959 PL_beginav = newAV();
3960 av_push(PL_beginav, (SV *)cv);
3963 else if (strEQ(s, "END")) {
3966 av_unshift(PL_endav, 1);
3967 av_store(PL_endav, 0, (SV *)cv);
3970 else if (strEQ(s, "INIT")) {
3972 PL_initav = newAV();
3973 av_push(PL_initav, (SV *)cv);
3983 newFORM(I32 floor, OP *o, OP *block)
3992 name = SvPVx(cSVOPo->op_sv, PL_na);
3995 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3997 if (cv = GvFORM(gv)) {
3999 line_t oldline = PL_curcop->cop_line;
4001 PL_curcop->cop_line = PL_copline;
4002 warn("Format %s redefined",name);
4003 PL_curcop->cop_line = oldline;
4009 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4010 CvFILEGV(cv) = PL_curcop->cop_filegv;
4012 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4013 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4014 SvPADTMP_on(PL_curpad[ix]);
4017 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4018 CvSTART(cv) = LINKLIST(CvROOT(cv));
4019 CvROOT(cv)->op_next = 0;
4022 PL_copline = NOLINE;
4029 return newUNOP(OP_REFGEN, 0,
4030 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4036 return newUNOP(OP_REFGEN, 0,
4037 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4041 newANONSUB(I32 floor, OP *proto, OP *block)
4043 return newUNOP(OP_REFGEN, 0,
4044 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4050 switch (o->op_type) {
4052 o->op_type = OP_PADAV;
4053 o->op_ppaddr = ppaddr[OP_PADAV];
4054 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
4057 o->op_type = OP_RV2AV;
4058 o->op_ppaddr = ppaddr[OP_RV2AV];
4063 warn("oops: oopsAV");
4072 switch (o->op_type) {
4075 o->op_type = OP_PADHV;
4076 o->op_ppaddr = ppaddr[OP_PADHV];
4077 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
4081 o->op_type = OP_RV2HV;
4082 o->op_ppaddr = ppaddr[OP_RV2HV];
4087 warn("oops: oopsHV");
4096 if (o->op_type == OP_PADANY) {
4097 o->op_type = OP_PADAV;
4098 o->op_ppaddr = ppaddr[OP_PADAV];
4101 return newUNOP(OP_RV2AV, 0, scalar(o));
4105 newGVREF(I32 type, OP *o)
4107 if (type == OP_MAPSTART)
4108 return newUNOP(OP_NULL, 0, o);
4109 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4115 if (o->op_type == OP_PADANY) {
4116 o->op_type = OP_PADHV;
4117 o->op_ppaddr = ppaddr[OP_PADHV];
4120 return newUNOP(OP_RV2HV, 0, scalar(o));
4126 croak("NOT IMPL LINE %d",__LINE__);
4132 newCVREF(I32 flags, OP *o)
4134 return newUNOP(OP_RV2CV, flags, scalar(o));
4140 if (o->op_type == OP_PADANY) {
4141 o->op_type = OP_PADSV;
4142 o->op_ppaddr = ppaddr[OP_PADSV];
4145 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4146 o->op_flags |= OPpDONE_SVREF;
4149 return newUNOP(OP_RV2SV, 0, scalar(o));
4152 /* Check routines. */
4160 name = NEWSV(1106,0);
4161 sv_upgrade(name, SVt_PVNV);
4162 sv_setpvn(name, "&", 1);
4165 ix = pad_alloc(o->op_type, SVs_PADMY);
4166 av_store(PL_comppad_name, ix, name);
4167 av_store(PL_comppad, ix, cSVOPo->op_sv);
4168 SvPADMY_on(cSVOPo->op_sv);
4169 cSVOPo->op_sv = Nullsv;
4170 cSVOPo->op_targ = ix;
4177 o->op_private = PL_hints;
4184 if (cUNOPo->op_first->op_type == OP_CONCAT)
4185 o->op_flags |= OPf_STACKED;
4192 if (o->op_flags & OPf_KIDS) {
4195 OPCODE type = o->op_type;
4196 o = modkids(ck_fun(o), type);
4197 kid = cUNOPo->op_first;
4198 newop = kUNOP->op_first->op_sibling;
4200 (newop->op_sibling ||
4201 !(opargs[newop->op_type] & OA_RETSCALAR) ||
4202 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4203 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4207 op_free(kUNOP->op_first);
4208 kUNOP->op_first = newop;
4210 o->op_ppaddr = ppaddr[++o->op_type];
4219 if (o->op_flags & OPf_KIDS) {
4220 OP *kid = cUNOPo->op_first;
4221 if (kid->op_type == OP_HSLICE)
4222 o->op_private |= OPpSLICE;
4223 else if (kid->op_type != OP_HELEM)
4224 croak("%s argument is not a HASH element or slice",
4225 op_desc[o->op_type]);
4234 I32 type = o->op_type;
4236 if (o->op_flags & OPf_KIDS) {
4237 if (cLISTOPo->op_first->op_type == OP_STUB) {
4239 o = newUNOP(type, OPf_SPECIAL,
4240 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4250 PL_hints |= HINT_BLOCK_SCOPE;
4251 if (o->op_flags & OPf_KIDS) {
4252 SVOP *kid = (SVOP*)cUNOPo->op_first;
4255 o->op_flags &= ~OPf_KIDS;
4258 else if (kid->op_type == OP_LINESEQ) {
4261 kid->op_next = o->op_next;
4262 cUNOPo->op_first = 0;
4265 Newz(1101, enter, 1, LOGOP);
4266 enter->op_type = OP_ENTERTRY;
4267 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4268 enter->op_private = 0;
4270 /* establish postfix order */
4271 enter->op_next = (OP*)enter;
4273 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4274 o->op_type = OP_LEAVETRY;
4275 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4276 enter->op_other = o;
4284 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4286 o->op_targ = (PADOFFSET)PL_hints;
4294 if (o->op_flags & OPf_STACKED) {
4296 kid = cUNOPo->op_first->op_sibling;
4297 if (kid->op_type == OP_RV2GV)
4309 if (o->op_flags & OPf_KIDS) {
4310 OP *kid = cUNOPo->op_first;
4311 if (kid->op_type != OP_HELEM)
4312 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4319 ck_gvconst(register OP *o)
4321 o = fold_constants(o);
4322 if (o->op_type == OP_CONST)
4328 ck_rvconst(register OP *o)
4331 SVOP *kid = (SVOP*)cUNOPo->op_first;
4333 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4334 if (kid->op_type == OP_CONST) {
4339 name = SvPV(kid->op_sv, PL_na);
4340 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4341 char *badthing = Nullch;
4342 switch (o->op_type) {
4344 badthing = "a SCALAR";
4347 badthing = "an ARRAY";
4350 badthing = "a HASH";
4355 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4359 * This is a little tricky. We only want to add the symbol if we
4360 * didn't add it in the lexer. Otherwise we get duplicate strict
4361 * warnings. But if we didn't add it in the lexer, we must at
4362 * least pretend like we wanted to add it even if it existed before,
4363 * or we get possible typo warnings. OPpCONST_ENTERED says
4364 * whether the lexer already added THIS instance of this symbol.
4366 iscv = (o->op_type == OP_RV2CV) * 2;
4368 gv = gv_fetchpv(name,
4369 iscv | !(kid->op_private & OPpCONST_ENTERED),
4372 : o->op_type == OP_RV2SV
4374 : o->op_type == OP_RV2AV
4376 : o->op_type == OP_RV2HV
4379 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4381 kid->op_type = OP_GV;
4382 SvREFCNT_dec(kid->op_sv);
4383 kid->op_sv = SvREFCNT_inc(gv);
4393 I32 type = o->op_type;
4395 if (o->op_flags & OPf_REF)
4398 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4399 SVOP *kid = (SVOP*)cUNOPo->op_first;
4401 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4402 OP *newop = newGVOP(type, OPf_REF,
4403 gv_fetchpv(SvPVx(kid->op_sv, PL_na), TRUE, SVt_PVIO));
4410 if (type == OP_FTTTY)
4411 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4414 return newUNOP(type, 0, newDEFSVOP());
4427 int type = o->op_type;
4428 register I32 oa = opargs[type] >> OASHIFT;
4430 if (o->op_flags & OPf_STACKED) {
4431 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4434 return no_fh_allowed(o);
4437 if (o->op_flags & OPf_KIDS) {
4438 tokid = &cLISTOPo->op_first;
4439 kid = cLISTOPo->op_first;
4440 if (kid->op_type == OP_PUSHMARK ||
4441 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4443 tokid = &kid->op_sibling;
4444 kid = kid->op_sibling;
4446 if (!kid && opargs[type] & OA_DEFGV)
4447 *tokid = kid = newDEFSVOP();
4451 sibl = kid->op_sibling;
4465 if (kid->op_type == OP_CONST &&
4466 (kid->op_private & OPpCONST_BARE)) {
4467 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4468 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4469 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4471 warn("Array @%s missing the @ in argument %ld of %s()",
4472 name, (long)numargs, op_desc[type]);
4475 kid->op_sibling = sibl;
4478 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4479 bad_type(numargs, "array", op_desc[o->op_type], kid);
4483 if (kid->op_type == OP_CONST &&
4484 (kid->op_private & OPpCONST_BARE)) {
4485 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4486 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4487 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4489 warn("Hash %%%s missing the %% in argument %ld of %s()",
4490 name, (long)numargs, op_desc[type]);
4493 kid->op_sibling = sibl;
4496 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4497 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4502 OP *newop = newUNOP(OP_NULL, 0, kid);
4503 kid->op_sibling = 0;
4505 newop->op_next = newop;
4507 kid->op_sibling = sibl;
4512 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4513 if (kid->op_type == OP_CONST &&
4514 (kid->op_private & OPpCONST_BARE)) {
4515 OP *newop = newGVOP(OP_GV, 0,
4516 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, PL_na), TRUE,
4522 kid->op_sibling = 0;
4523 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4525 kid->op_sibling = sibl;
4531 mod(scalar(kid), type);
4535 tokid = &kid->op_sibling;
4536 kid = kid->op_sibling;
4538 o->op_private |= numargs;
4540 return too_many_arguments(o,op_desc[o->op_type]);
4543 else if (opargs[type] & OA_DEFGV) {
4545 return newUNOP(type, 0, newDEFSVOP());
4549 while (oa & OA_OPTIONAL)
4551 if (oa && oa != OA_LIST)
4552 return too_few_arguments(o,op_desc[o->op_type]);
4562 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4563 append_elem(OP_GLOB, o, newDEFSVOP());
4565 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4566 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4568 if (gv && GvIMPORTED_CV(gv)) {
4569 static int glob_index;
4571 append_elem(OP_GLOB, o,
4572 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4573 o->op_type = OP_LIST;
4574 o->op_ppaddr = ppaddr[OP_LIST];
4575 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4576 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4577 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4578 append_elem(OP_LIST, o,
4579 scalar(newUNOP(OP_RV2CV, 0,
4580 newGVOP(OP_GV, 0, gv)))));
4581 o = newUNOP(OP_NULL, 0, ck_subr(o));
4582 o->op_targ = OP_GLOB; /* hint at what it used to be */
4585 gv = newGVgen("main");
4587 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4597 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4599 o->op_ppaddr = ppaddr[OP_GREPSTART];
4600 Newz(1101, gwop, 1, LOGOP);
4602 if (o->op_flags & OPf_STACKED) {
4605 kid = cLISTOPo->op_first->op_sibling;
4606 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4609 kid->op_next = (OP*)gwop;
4610 o->op_flags &= ~OPf_STACKED;
4612 kid = cLISTOPo->op_first->op_sibling;
4613 if (type == OP_MAPWHILE)
4620 kid = cLISTOPo->op_first->op_sibling;
4621 if (kid->op_type != OP_NULL)
4622 croak("panic: ck_grep");
4623 kid = kUNOP->op_first;
4625 gwop->op_type = type;
4626 gwop->op_ppaddr = ppaddr[type];
4627 gwop->op_first = listkids(o);
4628 gwop->op_flags |= OPf_KIDS;
4629 gwop->op_private = 1;
4630 gwop->op_other = LINKLIST(kid);
4631 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4632 kid->op_next = (OP*)gwop;
4634 kid = cLISTOPo->op_first->op_sibling;
4635 if (!kid || !kid->op_sibling)
4636 return too_few_arguments(o,op_desc[o->op_type]);
4637 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4638 mod(kid, OP_GREPSTART);
4646 if (o->op_flags & OPf_KIDS) {
4647 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4648 if (kid && kid->op_type == OP_CONST)
4649 fbm_compile(((SVOP*)kid)->op_sv, 0);
4655 ck_lengthconst(OP *o)
4657 /* XXX length optimization goes here */
4664 OPCODE type = o->op_type;
4665 return modkids(ck_fun(o), type);
4671 OPCODE type = o->op_type;
4672 return refkids(ck_fun(o), type);
4680 kid = cLISTOPo->op_first;
4683 kid = cLISTOPo->op_first;
4685 if (kid->op_type == OP_PUSHMARK)
4686 kid = kid->op_sibling;
4687 if (kid && o->op_flags & OPf_STACKED)
4688 kid = kid->op_sibling;
4689 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4690 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4691 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4692 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4693 cLISTOPo->op_first->op_sibling = kid;
4694 cLISTOPo->op_last = kid;
4695 kid = kid->op_sibling;
4700 append_elem(o->op_type, o, newDEFSVOP());
4706 if (PL_hints & HINT_LOCALE)
4707 o->op_private |= OPpLOCALE;
4714 ck_fun_locale(OP *o)
4720 if (PL_hints & HINT_LOCALE)
4721 o->op_private |= OPpLOCALE;
4732 if (PL_hints & HINT_LOCALE)
4733 o->op_private |= OPpLOCALE;
4742 o->op_private |= OPpRUNTIME;
4755 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4756 o->op_private |= OPpREPEAT_DOLIST;
4757 cBINOPo->op_first = force_list(cBINOPo->op_first);
4767 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4768 SVOP *kid = (SVOP*)cUNOPo->op_first;
4770 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4772 for (s = SvPVX(kid->op_sv); *s; s++) {
4773 if (*s == ':' && s[1] == ':') {
4775 Move(s+2, s+1, strlen(s+2)+1, char);
4776 --SvCUR(kid->op_sv);
4779 sv_catpvn(kid->op_sv, ".pm", 3);
4788 croak("NOT IMPL LINE %d",__LINE__);
4797 if (o->op_flags & OPf_KIDS) {
4798 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4799 if (kid && kid->op_sibling) {
4800 o->op_type = OP_SSELECT;
4801 o->op_ppaddr = ppaddr[OP_SSELECT];
4803 return fold_constants(o);
4807 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4808 if (kid && kid->op_type == OP_RV2GV)
4809 kid->op_private &= ~HINT_STRICT_REFS;
4816 I32 type = o->op_type;
4818 if (!(o->op_flags & OPf_KIDS)) {
4823 if (!CvUNIQUE(PL_compcv)) {
4824 argop = newOP(OP_PADAV, OPf_REF);
4825 argop->op_targ = 0; /* PL_curpad[0] is @_ */
4828 argop = newUNOP(OP_RV2AV, 0,
4829 scalar(newGVOP(OP_GV, 0,
4830 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4833 argop = newUNOP(OP_RV2AV, 0,
4834 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
4835 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4836 #endif /* USE_THREADS */
4837 return newUNOP(type, 0, scalar(argop));
4839 return scalar(modkids(ck_fun(o), type));
4847 if (PL_hints & HINT_LOCALE)
4848 o->op_private |= OPpLOCALE;
4851 if (o->op_flags & OPf_STACKED) {
4852 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4854 kid = kUNOP->op_first; /* get past rv2gv */
4856 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4858 if (kid->op_type == OP_SCOPE) {
4862 else if (kid->op_type == OP_LEAVE) {
4863 if (o->op_type == OP_SORT) {
4864 null(kid); /* wipe out leave */
4867 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4868 if (k->op_next == kid)
4873 kid->op_next = 0; /* just disconnect the leave */
4874 k = kLISTOP->op_first;
4878 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4879 null(kid); /* wipe out rv2gv */
4880 if (o->op_type == OP_SORT)
4884 o->op_flags |= OPf_SPECIAL;
4896 if (o->op_flags & OPf_STACKED)
4897 return no_fh_allowed(o);
4899 kid = cLISTOPo->op_first;
4900 if (kid->op_type != OP_NULL)
4901 croak("panic: ck_split");
4902 kid = kid->op_sibling;
4903 op_free(cLISTOPo->op_first);
4904 cLISTOPo->op_first = kid;
4906 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4907 cLISTOPo->op_last = kid; /* There was only one element previously */
4910 if (kid->op_type != OP_MATCH) {
4911 OP *sibl = kid->op_sibling;
4912 kid->op_sibling = 0;
4913 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4914 if (cLISTOPo->op_first == cLISTOPo->op_last)
4915 cLISTOPo->op_last = kid;
4916 cLISTOPo->op_first = kid;
4917 kid->op_sibling = sibl;
4920 kid->op_type = OP_PUSHRE;
4921 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4924 if (!kid->op_sibling)
4925 append_elem(OP_SPLIT, o, newDEFSVOP());
4927 kid = kid->op_sibling;
4930 if (!kid->op_sibling)
4931 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4933 kid = kid->op_sibling;
4936 if (kid->op_sibling)
4937 return too_many_arguments(o,op_desc[o->op_type]);
4946 OP *prev = ((cUNOPo->op_first->op_sibling)
4947 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4948 OP *o2 = prev->op_sibling;
4956 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4957 if (cvop->op_type == OP_RV2CV) {
4959 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4960 null(cvop); /* disable rv2cv */
4961 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4962 if (tmpop->op_type == OP_GV) {
4963 cv = GvCVu(tmpop->op_sv);
4964 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4965 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4966 proto = SvPV((SV*)cv, PL_na);
4970 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4971 if (PERLDB_SUB && PL_curstash != PL_debstash)
4972 o->op_private |= OPpENTERSUB_DB;
4973 while (o2 != cvop) {
4977 return too_many_arguments(o, gv_ename(namegv));
4995 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4996 bad_type(arg, "block", gv_ename(namegv), o2);
5001 if (o2->op_type == OP_RV2GV)
5005 OP* sib = kid->op_sibling;
5006 kid->op_sibling = 0;
5007 o2 = newUNOP(OP_RV2GV, 0, kid);
5008 o2->op_sibling = sib;
5009 prev->op_sibling = o2;
5017 if (o2->op_type != OP_RV2GV)
5018 bad_type(arg, "symbol", gv_ename(namegv), o2);
5021 if (o2->op_type != OP_RV2CV)
5022 bad_type(arg, "sub", gv_ename(namegv), o2);
5025 if (o2->op_type != OP_RV2SV
5026 && o2->op_type != OP_PADSV
5027 && o2->op_type != OP_THREADSV)
5029 bad_type(arg, "scalar", gv_ename(namegv), o2);
5033 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5034 bad_type(arg, "array", gv_ename(namegv), o2);
5037 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5038 bad_type(arg, "hash", gv_ename(namegv), o2);
5042 OP* sib = kid->op_sibling;
5043 kid->op_sibling = 0;
5044 o2 = newUNOP(OP_REFGEN, 0, kid);
5045 o2->op_sibling = sib;
5046 prev->op_sibling = o2;
5057 croak("Malformed prototype for %s: %s",
5058 gv_ename(namegv), SvPV((SV*)cv, PL_na));
5063 mod(o2, OP_ENTERSUB);
5065 o2 = o2->op_sibling;
5067 if (proto && !optional &&
5068 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5069 return too_few_arguments(o, gv_ename(namegv));
5076 SvREADONLY_on(cSVOPo->op_sv);
5083 if (o->op_flags & OPf_KIDS) {
5084 SVOP *kid = (SVOP*)cUNOPo->op_first;
5086 if (kid->op_type == OP_NULL)
5087 kid = (SVOP*)kid->op_sibling;
5089 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5090 o->op_flags |= OPf_SPECIAL;
5095 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5098 peep(register OP *o)
5101 register OP* oldop = 0;
5102 if (!o || o->op_seq)
5106 SAVESPTR(PL_curcop);
5107 for (; o; o = o->op_next) {
5113 switch (o->op_type) {
5116 PL_curcop = ((COP*)o); /* for warnings */
5117 o->op_seq = PL_op_seqmax++;
5128 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5130 o->op_seq = PL_op_seqmax++;
5133 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5134 o->op_seq = PL_op_seqmax++;
5135 break; /* Scalar stub must produce undef. List stub is noop */
5139 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5140 PL_curcop = ((COP*)o);
5146 if (oldop && o->op_next) {
5147 oldop->op_next = o->op_next;
5150 o->op_seq = PL_op_seqmax++;
5154 if (o->op_next->op_type == OP_RV2SV) {
5155 if (!(o->op_next->op_private & OPpDEREF)) {
5157 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5158 o->op_next = o->op_next->op_next;
5159 o->op_type = OP_GVSV;
5160 o->op_ppaddr = ppaddr[OP_GVSV];
5163 else if (o->op_next->op_type == OP_RV2AV) {
5164 OP* pop = o->op_next->op_next;
5166 if (pop->op_type == OP_CONST &&
5167 (PL_op = pop->op_next) &&
5168 pop->op_next->op_type == OP_AELEM &&
5169 !(pop->op_next->op_private &
5170 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5171 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5175 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5179 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5180 o->op_next = pop->op_next->op_next;
5181 o->op_type = OP_AELEMFAST;
5182 o->op_ppaddr = ppaddr[OP_AELEMFAST];
5183 o->op_private = (U8)i;
5184 GvAVn(((GVOP*)o)->op_gv);
5187 o->op_seq = PL_op_seqmax++;
5191 if (o->op_next->op_type == OP_RV2AV
5192 && (o->op_next->op_flags & OPf_REF))
5195 o->op_next = o->op_next->op_next;
5200 if (o->op_next->op_type == OP_RV2HV
5201 && (o->op_next->op_flags & OPf_REF))
5204 o->op_next = o->op_next->op_next;
5212 o->op_seq = PL_op_seqmax++;
5213 while (cLOGOP->op_other->op_type == OP_NULL)
5214 cLOGOP->op_other = cLOGOP->op_other->op_next;
5215 peep(cLOGOP->op_other);
5219 o->op_seq = PL_op_seqmax++;
5220 peep(cCONDOP->op_true);
5221 peep(cCONDOP->op_false);
5225 o->op_seq = PL_op_seqmax++;
5226 peep(cLOOP->op_redoop);
5227 peep(cLOOP->op_nextop);
5228 peep(cLOOP->op_lastop);
5234 o->op_seq = PL_op_seqmax++;
5235 peep(cPMOP->op_pmreplstart);
5239 o->op_seq = PL_op_seqmax++;
5240 if (PL_dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
5241 if (o->op_next->op_sibling &&
5242 o->op_next->op_sibling->op_type != OP_EXIT &&
5243 o->op_next->op_sibling->op_type != OP_WARN &&
5244 o->op_next->op_sibling->op_type != OP_DIE) {
5245 line_t oldline = PL_curcop->cop_line;
5247 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5248 warn("Statement unlikely to be reached");
5249 warn("(Maybe you meant system() when you said exec()?)\n");
5250 PL_curcop->cop_line = oldline;
5264 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5265 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5267 rop = (UNOP*)((BINOP*)o)->op_first;
5268 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5270 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5271 if (!SvOBJECT(lexname))
5273 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5274 if (!fields || !GvHV(*fields))
5276 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5277 key = SvPV(*svp, keylen);
5278 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5280 croak("No such field \"%s\" in variable %s of type %s",
5281 key, SvPV(lexname, PL_na), HvNAME(SvSTASH(lexname)));
5283 ind = SvIV(*indsvp);
5285 croak("Bad index while coercing array into hash");
5286 rop->op_type = OP_RV2AV;
5287 rop->op_ppaddr = ppaddr[OP_RV2AV];
5288 o->op_type = OP_AELEM;
5289 o->op_ppaddr = ppaddr[OP_AELEM];
5291 *svp = newSViv(ind);
5296 o->op_seq = PL_op_seqmax++;