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 ((op_mask && 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,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(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 (dowarn && AvFILLp(comppad_name) >= 0) {
130 SV **svp = AvARRAY(comppad_name);
131 for (off = AvFILLp(comppad_name); off > comppad_name_floor; off--) {
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);
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(in_my_stash);
154 av_store(comppad_name, off, sv);
155 SvNVX(sv) = (double)999999999;
156 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
157 if (!min_intro_pending)
158 min_intro_pending = off;
159 max_intro_pending = off;
161 av_store(comppad, off, (SV*)newAV());
162 else if (*name == '%')
163 av_store(comppad, off, (SV*)newHV());
164 SvPADMY_on(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 == &sv_undef)
187 svp = AvARRAY(curname);
188 for (off = AvFILLp(curname); off > 0; off--) {
189 if ((sv = svp[off]) &&
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(comppad_name, newoff, namesv);
216 SvNVX(namesv) = (double)curcop->cop_seq;
217 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
218 SvFAKE_on(namesv); /* A ref, not a real var */
219 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
220 /* "It's closures all the way down." */
224 oldsv = Nullsv; /* no need to keep ref */
229 bcv && bcv != cv && !CvCLONE(bcv);
230 bcv = CvOUTSIDE(bcv)) {
234 if (dowarn && !CvUNIQUE(cv))
236 "Variable \"%s\" may be unavailable",
243 else if (!CvUNIQUE(compcv)) {
244 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
245 warn("Variable \"%s\" will not stay shared", name);
248 av_store(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, main_cv, 0);
270 switch (cx->blk_eval.old_op_type) {
275 /* require must have its own scope */
283 if (debstash && CvSTASH(cv) == 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(comppad_name);
303 U32 seq = 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(comppad_name); off > 0; off--) {
320 if ((sv = svp[off]) &&
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(compcv), cxstack_ix);
336 /* If there is a pending local definition, this new alias must die */
338 SvIVX(AvARRAY(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(comppad_name);
350 if (min_intro_pending && fill < min_intro_pending) {
351 for (off = max_intro_pending; off >= min_intro_pending; off--) {
352 if ((sv = svp[off]) && sv != &sv_undef)
353 warn("%s never introduced", SvPVX(sv));
356 /* "Deintroduce" my variables that are leaving with this scope. */
357 for (off = AvFILLp(comppad_name); off > fill; off--) {
358 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
359 SvIVX(sv) = cop_seqmax;
364 pad_alloc(I32 optype, U32 tmptype)
370 if (AvARRAY(comppad) != curpad)
371 croak("panic: pad_alloc");
372 if (pad_reset_pending)
374 if (tmptype & SVs_PADMY) {
376 sv = *av_fetch(comppad, AvFILLp(comppad) + 1, TRUE);
377 } while (SvPADBUSY(sv)); /* need a fresh one */
378 retval = AvFILLp(comppad);
381 SV **names = AvARRAY(comppad_name);
382 SSize_t names_fill = AvFILLp(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 (++padix <= names_fill &&
390 (sv = names[padix]) && sv != &sv_undef)
392 sv = *av_fetch(comppad, padix, TRUE);
393 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
398 SvFLAGS(sv) |= tmptype;
399 curpad = AvARRAY(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) 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) 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) 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) curpad, po));
424 #endif /* USE_THREADS */
425 return curpad[po]; /* eventually we'll turn this into a macro */
429 pad_free(PADOFFSET po)
434 if (AvARRAY(comppad) != 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) curpad, po));
442 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
443 (unsigned long) curpad, po));
444 #endif /* USE_THREADS */
445 if (curpad[po] && curpad[po] != &sv_undef)
446 SvPADTMP_off(curpad[po]);
452 pad_swipe(PADOFFSET po)
455 if (AvARRAY(comppad) != 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) curpad, po));
463 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
464 (unsigned long) curpad, po));
465 #endif /* USE_THREADS */
466 SvPADTMP_off(curpad[po]);
467 curpad[po] = NEWSV(1107,0);
468 SvPADTMP_on(curpad[po]);
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(comppad) != 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) curpad));
492 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
493 (unsigned long) curpad));
494 #endif /* USE_THREADS */
495 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
496 for (po = AvMAX(comppad); po > padix_floor; po--) {
497 if (curpad[po] && !SvIMMORTAL(curpad[po]))
498 SvPADTMP_off(curpad[po]);
503 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(threadsv_names, *name);
519 key = p - 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);
544 sv_magic(sv, 0, 0, name, 1);
546 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
547 "find_threadsv: new SV %p for $%s%c\n",
548 sv, (*name < 32) ? "^" : "",
549 (*name < 32) ? toCTRL(*name) : *name));
553 #endif /* USE_THREADS */
560 register OP *kid, *nextkid;
562 if (!o || o->op_seq == (U16)-1)
565 if (o->op_flags & OPf_KIDS) {
566 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
567 nextkid = kid->op_sibling; /* Get before next freeing kid */
572 switch (o->op_type) {
574 o->op_targ = 0; /* Was holding old type, if any. */
577 o->op_targ = 0; /* Was holding hints. */
581 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
583 #endif /* USE_THREADS */
585 if (!(o->op_flags & OPf_REF)
586 || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
592 SvREFCNT_dec(cGVOPo->op_gv);
596 Safefree(cCOPo->cop_label);
597 SvREFCNT_dec(cCOPo->cop_filegv);
600 SvREFCNT_dec(cSVOPo->op_sv);
606 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
610 Safefree(cPVOPo->op_pv);
613 op_free(cPMOPo->op_pmreplroot);
617 ReREFCNT_dec(cPMOPo->op_pmregexp);
622 pad_free(o->op_targ);
630 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
631 pad_free(o->op_targ);
632 o->op_targ = o->op_type;
633 o->op_type = OP_NULL;
634 o->op_ppaddr = ppaddr[OP_NULL];
637 /* Contextualizers */
639 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
649 /* establish postfix order */
650 if (cUNOPo->op_first) {
651 o->op_next = LINKLIST(cUNOPo->op_first);
652 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
654 kid->op_next = LINKLIST(kid->op_sibling);
669 if (o && o->op_flags & OPf_KIDS) {
670 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
680 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
682 line_t oldline = curcop->cop_line;
684 if (copline != NOLINE)
685 curcop->cop_line = copline;
686 warn("Found = in conditional, should be ==");
687 curcop->cop_line = oldline;
697 /* assumes no premature commitment */
698 if (!o || (o->op_flags & OPf_WANT) || error_count
699 || o->op_type == OP_RETURN)
702 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
704 switch (o->op_type) {
706 if (o->op_private & OPpREPEAT_DOLIST)
707 null(((LISTOP*)cBINOPo->op_first)->op_first);
708 scalar(cBINOPo->op_first);
713 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
717 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
718 if (!kPMOP->op_pmreplroot)
719 deprecate("implicit split to @_");
726 if (o->op_flags & OPf_KIDS) {
727 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
733 kid = cLISTOPo->op_first;
735 while (kid = kid->op_sibling) {
741 WITH_THR(curcop = &compiling);
746 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
752 WITH_THR(curcop = &compiling);
765 /* assumes no premature commitment */
766 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
767 || o->op_type == OP_RETURN)
770 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
772 switch (o->op_type) {
774 if (!(opargs[o->op_type] & OA_FOLDCONST))
778 if (o->op_flags & OPf_STACKED)
849 if (!(o->op_private & OPpLVAL_INTRO))
850 useless = op_desc[o->op_type];
857 if (!(o->op_private & OPpLVAL_INTRO) &&
858 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
859 useless = "a variable";
864 WITH_THR(curcop = ((COP*)o)); /* for warning below */
870 useless = "a constant";
871 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
873 else if (SvPOK(sv)) {
874 if (strnEQ(SvPVX(sv), "di", 2) ||
875 strnEQ(SvPVX(sv), "ds", 2) ||
876 strnEQ(SvPVX(sv), "ig", 2))
880 null(o); /* don't execute a constant */
881 SvREFCNT_dec(sv); /* don't even remember it */
885 o->op_type = OP_PREINC; /* pre-increment is faster */
886 o->op_ppaddr = ppaddr[OP_PREINC];
890 o->op_type = OP_PREDEC; /* pre-decrement is faster */
891 o->op_ppaddr = ppaddr[OP_PREDEC];
897 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
902 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
903 WITH_THR(curcop = ((COP*)o)); /* for warning below */
904 if (o->op_flags & OPf_STACKED)
910 if (!(o->op_flags & OPf_KIDS))
919 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
926 /* all requires must return a boolean value */
927 o->op_flags &= ~OPf_WANT;
930 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
931 if (!kPMOP->op_pmreplroot)
932 deprecate("implicit split to @_");
936 if (useless && dowarn)
937 warn("Useless use of %s in void context", useless);
945 if (o && o->op_flags & OPf_KIDS) {
946 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
957 /* assumes no premature commitment */
958 if (!o || (o->op_flags & OPf_WANT) || error_count
959 || o->op_type == OP_RETURN)
962 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
964 switch (o->op_type) {
967 list(cBINOPo->op_first);
972 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
979 if (!(o->op_flags & OPf_KIDS))
981 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
982 list(cBINOPo->op_first);
983 return gen_constant_list(o);
990 kid = cLISTOPo->op_first;
992 while (kid = kid->op_sibling) {
998 WITH_THR(curcop = &compiling);
1002 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1003 if (kid->op_sibling)
1008 WITH_THR(curcop = &compiling);
1011 /* all requires must return a boolean value */
1012 o->op_flags &= ~OPf_WANT;
1024 if (o->op_type == OP_LINESEQ ||
1025 o->op_type == OP_SCOPE ||
1026 o->op_type == OP_LEAVE ||
1027 o->op_type == OP_LEAVETRY)
1030 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1031 if (kid->op_sibling) {
1035 curcop = &compiling;
1037 o->op_flags &= ~OPf_PARENS;
1038 if (hints & HINT_BLOCK_SCOPE)
1039 o->op_flags |= OPf_PARENS;
1042 o = newOP(OP_STUB, 0);
1047 modkids(OP *o, I32 type)
1050 if (o && o->op_flags & OPf_KIDS) {
1051 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1058 mod(OP *o, I32 type)
1064 if (!o || error_count)
1067 switch (o->op_type) {
1072 if (!(o->op_private & (OPpCONST_ARYBASE)))
1074 if (eval_start && eval_start->op_type == OP_CONST) {
1075 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1079 SAVEI32(compiling.cop_arybase);
1080 compiling.cop_arybase = 0;
1082 else if (type == OP_REFGEN)
1085 croak("That use of $[ is unsupported");
1088 if (o->op_flags & OPf_PARENS)
1092 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1093 !(o->op_flags & OPf_STACKED)) {
1094 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1095 o->op_ppaddr = ppaddr[OP_RV2CV];
1096 assert(cUNOPo->op_first->op_type == OP_NULL);
1097 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1103 /* grep, foreach, subcalls, refgen */
1104 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1106 yyerror(form("Can't modify %s in %s",
1107 op_desc[o->op_type],
1108 type ? op_desc[type] : "local"));
1122 case OP_RIGHT_SHIFT:
1131 if (!(o->op_flags & OPf_STACKED))
1137 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1143 if (!type && cUNOPo->op_first->op_type != OP_GV)
1144 croak("Can't localize through a reference");
1145 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1147 return o; /* Treat \(@foo) like ordinary list. */
1151 if (scalar_mod_type(o, type))
1153 ref(cUNOPo->op_first, o->op_type);
1165 if (!type && cUNOPo->op_first->op_type != OP_GV)
1166 croak("Can't localize through a reference");
1167 ref(cUNOPo->op_first, o->op_type);
1171 hints |= HINT_BLOCK_SCOPE;
1180 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1181 return o; /* Treat \(@foo) like ordinary list. */
1182 if (scalar_mod_type(o, type))
1188 croak("Can't localize lexical variable %s",
1189 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1194 modcount++; /* XXX ??? */
1196 #endif /* USE_THREADS */
1202 if (type != OP_SASSIGN)
1208 pad_free(o->op_targ);
1209 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1210 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1211 if (o->op_flags & OPf_KIDS)
1212 mod(cBINOPo->op_first->op_sibling, type);
1217 ref(cBINOPo->op_first, o->op_type);
1218 if (type == OP_ENTERSUB &&
1219 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1220 o->op_private |= OPpLVAL_DEFER;
1227 if (o->op_flags & OPf_KIDS)
1228 mod(cLISTOPo->op_last, type);
1232 if (!(o->op_flags & OPf_KIDS))
1234 if (o->op_targ != OP_LIST) {
1235 mod(cBINOPo->op_first, type);
1240 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1244 o->op_flags |= OPf_MOD;
1246 if (type == OP_AASSIGN || type == OP_SASSIGN)
1247 o->op_flags |= OPf_SPECIAL|OPf_REF;
1249 o->op_private |= OPpLVAL_INTRO;
1250 o->op_flags &= ~OPf_SPECIAL;
1252 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1253 o->op_flags |= OPf_REF;
1258 scalar_mod_type(OP *o, I32 type)
1262 if (o->op_type == OP_RV2GV)
1286 case OP_RIGHT_SHIFT:
1293 case OP_ANDASSIGN: /* may work later */
1294 case OP_ORASSIGN: /* may work later */
1302 refkids(OP *o, I32 type)
1305 if (o && o->op_flags & OPf_KIDS) {
1306 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1313 ref(OP *o, I32 type)
1317 if (!o || error_count)
1320 switch (o->op_type) {
1322 if ((type == OP_DEFINED || type == OP_LOCK) &&
1323 !(o->op_flags & OPf_STACKED)) {
1324 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1325 o->op_ppaddr = ppaddr[OP_RV2CV];
1326 assert(cUNOPo->op_first->op_type == OP_NULL);
1327 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1328 o->op_flags |= OPf_SPECIAL;
1333 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1337 ref(cUNOPo->op_first, o->op_type);
1340 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1341 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1342 : type == OP_RV2HV ? OPpDEREF_HV
1344 o->op_flags |= OPf_MOD;
1349 o->op_flags |= OPf_MOD; /* XXX ??? */
1354 o->op_flags |= OPf_REF;
1357 ref(cUNOPo->op_first, o->op_type);
1362 o->op_flags |= OPf_REF;
1367 if (!(o->op_flags & OPf_KIDS))
1369 ref(cBINOPo->op_first, type);
1373 ref(cBINOPo->op_first, o->op_type);
1374 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1375 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1376 : type == OP_RV2HV ? OPpDEREF_HV
1378 o->op_flags |= OPf_MOD;
1386 if (!(o->op_flags & OPf_KIDS))
1388 ref(cLISTOPo->op_last, type);
1403 if (!o || error_count)
1407 if (type == OP_LIST) {
1408 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1410 } else if (type == OP_UNDEF) {
1412 } else if (type != OP_PADSV &&
1415 type != OP_PUSHMARK)
1417 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1420 o->op_flags |= OPf_MOD;
1421 o->op_private |= OPpLVAL_INTRO;
1429 o->op_flags |= OPf_PARENS;
1434 bind_match(I32 type, OP *left, OP *right)
1439 (left->op_type == OP_RV2AV ||
1440 left->op_type == OP_RV2HV ||
1441 left->op_type == OP_PADAV ||
1442 left->op_type == OP_PADHV)) {
1443 char *desc = op_desc[(right->op_type == OP_SUBST ||
1444 right->op_type == OP_TRANS)
1445 ? right->op_type : OP_MATCH];
1446 char *sample = ((left->op_type == OP_RV2AV ||
1447 left->op_type == OP_PADAV)
1448 ? "@array" : "%hash");
1449 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1452 if (right->op_type == OP_MATCH ||
1453 right->op_type == OP_SUBST ||
1454 right->op_type == OP_TRANS) {
1455 right->op_flags |= OPf_STACKED;
1456 if (right->op_type != OP_MATCH)
1457 left = mod(left, right->op_type);
1458 if (right->op_type == OP_TRANS)
1459 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1461 o = prepend_elem(right->op_type, scalar(left), right);
1463 return newUNOP(OP_NOT, 0, scalar(o));
1467 return bind_match(type, left,
1468 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1476 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1477 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1484 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1485 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1486 o->op_type = OP_LEAVE;
1487 o->op_ppaddr = ppaddr[OP_LEAVE];
1490 if (o->op_type == OP_LINESEQ) {
1492 o->op_type = OP_SCOPE;
1493 o->op_ppaddr = ppaddr[OP_SCOPE];
1494 kid = ((LISTOP*)o)->op_first;
1495 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1496 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1501 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1508 block_start(int full)
1511 int retval = savestack_ix;
1512 SAVEI32(comppad_name_floor);
1514 if ((comppad_name_fill = AvFILLp(comppad_name)) > 0)
1515 comppad_name_floor = comppad_name_fill;
1517 comppad_name_floor = 0;
1519 SAVEI32(min_intro_pending);
1520 SAVEI32(max_intro_pending);
1521 min_intro_pending = 0;
1522 SAVEI32(comppad_name_fill);
1523 SAVEI32(padix_floor);
1524 padix_floor = padix;
1525 pad_reset_pending = FALSE;
1527 hints &= ~HINT_BLOCK_SCOPE;
1532 block_end(I32 floor, OP *seq)
1535 int needblockscope = hints & HINT_BLOCK_SCOPE;
1536 OP* retval = scalarseq(seq);
1538 pad_reset_pending = FALSE;
1540 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1541 pad_leavemy(comppad_name_fill);
1550 OP *o = newOP(OP_THREADSV, 0);
1551 o->op_targ = find_threadsv("_");
1554 return newSVREF(newGVOP(OP_GV, 0, defgv));
1555 #endif /* USE_THREADS */
1563 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1564 eval_start = linklist(eval_root);
1565 eval_root->op_next = 0;
1571 main_root = scope(sawparens(scalarvoid(o)));
1572 curcop = &compiling;
1573 main_start = LINKLIST(main_root);
1574 main_root->op_next = 0;
1578 /* Register with debugger */
1580 CV *cv = perl_get_cv("DB::postponed", FALSE);
1584 XPUSHs((SV*)compiling.cop_filegv);
1586 perl_call_sv((SV*)cv, G_DISCARD);
1593 localize(OP *o, I32 lex)
1595 if (o->op_flags & OPf_PARENS)
1598 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1600 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1601 if (*s == ';' || *s == '=')
1602 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1606 in_my_stash = Nullhv;
1610 return mod(o, OP_NULL); /* a bit kludgey */
1616 if (o->op_type == OP_LIST) {
1619 o2 = newOP(OP_THREADSV, 0);
1620 o2->op_targ = find_threadsv(";");
1622 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1623 #endif /* USE_THREADS */
1624 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1630 fold_constants(register OP *o)
1634 I32 type = o->op_type;
1637 if (opargs[type] & OA_RETSCALAR)
1639 if (opargs[type] & OA_TARGET)
1640 o->op_targ = pad_alloc(type, SVs_PADTMP);
1642 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1643 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1645 if (!(opargs[type] & OA_FOLDCONST))
1660 if (o->op_private & OPpLOCALE)
1665 goto nope; /* Don't try to run w/ errors */
1667 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1668 if (curop->op_type != OP_CONST &&
1669 curop->op_type != OP_LIST &&
1670 curop->op_type != OP_SCALAR &&
1671 curop->op_type != OP_NULL &&
1672 curop->op_type != OP_PUSHMARK) {
1677 curop = LINKLIST(o);
1682 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1683 pad_swipe(o->op_targ);
1684 else if (SvTEMP(sv)) { /* grab mortal temp? */
1685 (void)SvREFCNT_inc(sv);
1689 if (type == OP_RV2GV)
1690 return newGVOP(OP_GV, 0, (GV*)sv);
1692 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1694 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1699 SvIOK_off(sv); /* undo SvIV() damage */
1701 return newSVOP(OP_CONST, 0, sv);
1705 if (!(opargs[type] & OA_OTHERINT))
1708 if (!(hints & HINT_INTEGER)) {
1709 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1712 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1713 if (curop->op_type == OP_CONST) {
1714 if (SvIOK(((SVOP*)curop)->op_sv))
1718 if (opargs[curop->op_type] & OA_RETINTEGER)
1722 o->op_ppaddr = ppaddr[++(o->op_type)];
1729 gen_constant_list(register OP *o)
1733 I32 oldtmps_floor = tmps_floor;
1737 return o; /* Don't attempt to run with errors */
1739 op = curop = LINKLIST(o);
1745 tmps_floor = oldtmps_floor;
1747 o->op_type = OP_RV2AV;
1748 o->op_ppaddr = ppaddr[OP_RV2AV];
1749 curop = ((UNOP*)o)->op_first;
1750 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1757 convert(I32 type, I32 flags, OP *o)
1762 if (!o || o->op_type != OP_LIST)
1763 o = newLISTOP(OP_LIST, 0, o, Nullop);
1765 o->op_flags &= ~OPf_WANT;
1767 if (!(opargs[type] & OA_MARK))
1768 null(cLISTOPo->op_first);
1771 o->op_ppaddr = ppaddr[type];
1772 o->op_flags |= flags;
1774 o = CHECKOP(type, o);
1775 if (o->op_type != type)
1778 if (cLISTOPo->op_children < 7) {
1779 /* XXX do we really need to do this if we're done appending?? */
1780 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1782 cLISTOPo->op_last = last; /* in case check substituted last arg */
1785 return fold_constants(o);
1788 /* List constructors */
1791 append_elem(I32 type, OP *first, OP *last)
1799 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1800 return newLISTOP(type, 0, first, last);
1802 if (first->op_flags & OPf_KIDS)
1803 ((LISTOP*)first)->op_last->op_sibling = last;
1805 first->op_flags |= OPf_KIDS;
1806 ((LISTOP*)first)->op_first = last;
1808 ((LISTOP*)first)->op_last = last;
1809 ((LISTOP*)first)->op_children++;
1814 append_list(I32 type, LISTOP *first, LISTOP *last)
1822 if (first->op_type != type)
1823 return prepend_elem(type, (OP*)first, (OP*)last);
1825 if (last->op_type != type)
1826 return append_elem(type, (OP*)first, (OP*)last);
1828 first->op_last->op_sibling = last->op_first;
1829 first->op_last = last->op_last;
1830 first->op_children += last->op_children;
1831 if (first->op_children)
1832 last->op_flags |= OPf_KIDS;
1839 prepend_elem(I32 type, OP *first, OP *last)
1847 if (last->op_type == type) {
1848 if (type == OP_LIST) { /* already a PUSHMARK there */
1849 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1850 ((LISTOP*)last)->op_first->op_sibling = first;
1853 if (!(last->op_flags & OPf_KIDS)) {
1854 ((LISTOP*)last)->op_last = first;
1855 last->op_flags |= OPf_KIDS;
1857 first->op_sibling = ((LISTOP*)last)->op_first;
1858 ((LISTOP*)last)->op_first = first;
1860 ((LISTOP*)last)->op_children++;
1864 return newLISTOP(type, 0, first, last);
1872 return newOP(OP_STUB, 0);
1878 if (!o || o->op_type != OP_LIST)
1879 o = newLISTOP(OP_LIST, 0, o, Nullop);
1885 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1889 Newz(1101, listop, 1, LISTOP);
1891 listop->op_type = type;
1892 listop->op_ppaddr = ppaddr[type];
1893 listop->op_children = (first != 0) + (last != 0);
1894 listop->op_flags = flags;
1898 else if (!first && last)
1901 first->op_sibling = last;
1902 listop->op_first = first;
1903 listop->op_last = last;
1904 if (type == OP_LIST) {
1906 pushop = newOP(OP_PUSHMARK, 0);
1907 pushop->op_sibling = first;
1908 listop->op_first = pushop;
1909 listop->op_flags |= OPf_KIDS;
1911 listop->op_last = pushop;
1913 else if (listop->op_children)
1914 listop->op_flags |= OPf_KIDS;
1920 newOP(I32 type, I32 flags)
1923 Newz(1101, o, 1, OP);
1925 o->op_ppaddr = ppaddr[type];
1926 o->op_flags = flags;
1929 o->op_private = 0 + (flags >> 8);
1930 if (opargs[type] & OA_RETSCALAR)
1932 if (opargs[type] & OA_TARGET)
1933 o->op_targ = pad_alloc(type, SVs_PADTMP);
1934 return CHECKOP(type, o);
1938 newUNOP(I32 type, I32 flags, OP *first)
1943 first = newOP(OP_STUB, 0);
1944 if (opargs[type] & OA_MARK)
1945 first = force_list(first);
1947 Newz(1101, unop, 1, UNOP);
1948 unop->op_type = type;
1949 unop->op_ppaddr = ppaddr[type];
1950 unop->op_first = first;
1951 unop->op_flags = flags | OPf_KIDS;
1952 unop->op_private = 1 | (flags >> 8);
1954 if(type == OP_STUDY && first->op_type == OP_MATCH) {
1955 first->op_type = OP_PUSHRE;
1956 first->op_ppaddr = ppaddr[OP_PUSHRE];
1959 unop = (UNOP*) CHECKOP(type, unop);
1963 return fold_constants((OP *) unop);
1967 newBINOP(I32 type, I32 flags, OP *first, OP *last)
1970 Newz(1101, binop, 1, BINOP);
1973 first = newOP(OP_NULL, 0);
1975 binop->op_type = type;
1976 binop->op_ppaddr = ppaddr[type];
1977 binop->op_first = first;
1978 binop->op_flags = flags | OPf_KIDS;
1981 binop->op_private = 1 | (flags >> 8);
1984 binop->op_private = 2 | (flags >> 8);
1985 first->op_sibling = last;
1988 binop = (BINOP*)CHECKOP(type, binop);
1992 binop->op_last = last = binop->op_first->op_sibling;
1994 return fold_constants((OP *)binop);
1998 pmtrans(OP *o, OP *expr, OP *repl)
2000 SV *tstr = ((SVOP*)expr)->op_sv;
2001 SV *rstr = ((SVOP*)repl)->op_sv;
2004 register U8 *t = (U8*)SvPV(tstr, tlen);
2005 register U8 *r = (U8*)SvPV(rstr, rlen);
2011 register short *tbl;
2013 tbl = (short*)cPVOPo->op_pv;
2014 complement = o->op_private & OPpTRANS_COMPLEMENT;
2015 Delete = o->op_private & OPpTRANS_DELETE;
2016 squash = o->op_private & OPpTRANS_SQUASH;
2019 Zero(tbl, 256, short);
2020 for (i = 0; i < tlen; i++)
2022 for (i = 0, j = 0; i < 256; i++) {
2038 if (!rlen && !Delete) {
2041 o->op_private |= OPpTRANS_COUNTONLY;
2043 for (i = 0; i < 256; i++)
2045 for (i = 0, j = 0; i < tlen; i++,j++) {
2048 if (tbl[t[i]] == -1)
2054 if (tbl[t[i]] == -1)
2065 newPMOP(I32 type, I32 flags)
2070 Newz(1101, pmop, 1, PMOP);
2071 pmop->op_type = type;
2072 pmop->op_ppaddr = ppaddr[type];
2073 pmop->op_flags = flags;
2074 pmop->op_private = 0 | (flags >> 8);
2076 if (hints & HINT_LOCALE)
2077 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2079 /* link into pm list */
2080 if (type != OP_TRANS && curstash) {
2081 pmop->op_pmnext = HvPMROOT(curstash);
2082 HvPMROOT(curstash) = pmop;
2089 pmruntime(OP *o, OP *expr, OP *repl)
2094 if (o->op_type == OP_TRANS)
2095 return pmtrans(o, expr, repl);
2097 hints |= HINT_BLOCK_SCOPE;
2100 if (expr->op_type == OP_CONST) {
2102 SV *pat = ((SVOP*)expr)->op_sv;
2103 char *p = SvPV(pat, plen);
2104 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2105 sv_setpvn(pat, "\\s+", 3);
2106 p = SvPV(pat, plen);
2107 pm->op_pmflags |= PMf_SKIPWHITE;
2109 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2110 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2111 pm->op_pmflags |= PMf_WHITE;
2115 if (pm->op_pmflags & PMf_KEEP)
2116 expr = newUNOP(OP_REGCMAYBE,0,expr);
2118 Newz(1101, rcop, 1, LOGOP);
2119 rcop->op_type = OP_REGCOMP;
2120 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2121 rcop->op_first = scalar(expr);
2122 rcop->op_flags |= OPf_KIDS;
2123 rcop->op_private = 1;
2126 /* establish postfix order */
2127 if (pm->op_pmflags & PMf_KEEP) {
2129 rcop->op_next = expr;
2130 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2133 rcop->op_next = LINKLIST(expr);
2134 expr->op_next = (OP*)rcop;
2137 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2142 if (pm->op_pmflags & PMf_EVAL)
2145 else if (repl->op_type == OP_THREADSV
2146 && strchr("&`'123456789+",
2147 threadsv_names[repl->op_targ]))
2151 #endif /* USE_THREADS */
2152 else if (repl->op_type == OP_CONST)
2156 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2157 if (opargs[curop->op_type] & OA_DANGEROUS) {
2159 if (curop->op_type == OP_THREADSV
2160 && strchr("&`'123456789+", curop->op_private)) {
2164 if (curop->op_type == OP_GV) {
2165 GV *gv = ((GVOP*)curop)->op_gv;
2166 if (strchr("&`'123456789+", *GvENAME(gv)))
2169 #endif /* USE_THREADS */
2170 else if (curop->op_type == OP_RV2CV)
2172 else if (curop->op_type == OP_RV2SV ||
2173 curop->op_type == OP_RV2AV ||
2174 curop->op_type == OP_RV2HV ||
2175 curop->op_type == OP_RV2GV) {
2176 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2179 else if (curop->op_type == OP_PADSV ||
2180 curop->op_type == OP_PADAV ||
2181 curop->op_type == OP_PADHV ||
2182 curop->op_type == OP_PADANY) {
2191 if (curop == repl) {
2192 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2193 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2194 prepend_elem(o->op_type, scalar(repl), o);
2197 Newz(1101, rcop, 1, LOGOP);
2198 rcop->op_type = OP_SUBSTCONT;
2199 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2200 rcop->op_first = scalar(repl);
2201 rcop->op_flags |= OPf_KIDS;
2202 rcop->op_private = 1;
2205 /* establish postfix order */
2206 rcop->op_next = LINKLIST(repl);
2207 repl->op_next = (OP*)rcop;
2209 pm->op_pmreplroot = scalar((OP*)rcop);
2210 pm->op_pmreplstart = LINKLIST(rcop);
2219 newSVOP(I32 type, I32 flags, SV *sv)
2222 Newz(1101, svop, 1, SVOP);
2223 svop->op_type = type;
2224 svop->op_ppaddr = ppaddr[type];
2226 svop->op_next = (OP*)svop;
2227 svop->op_flags = flags;
2228 if (opargs[type] & OA_RETSCALAR)
2230 if (opargs[type] & OA_TARGET)
2231 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2232 return CHECKOP(type, svop);
2236 newGVOP(I32 type, I32 flags, GV *gv)
2240 Newz(1101, gvop, 1, GVOP);
2241 gvop->op_type = type;
2242 gvop->op_ppaddr = ppaddr[type];
2243 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2244 gvop->op_next = (OP*)gvop;
2245 gvop->op_flags = flags;
2246 if (opargs[type] & OA_RETSCALAR)
2248 if (opargs[type] & OA_TARGET)
2249 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2250 return CHECKOP(type, gvop);
2254 newPVOP(I32 type, I32 flags, char *pv)
2257 Newz(1101, pvop, 1, PVOP);
2258 pvop->op_type = type;
2259 pvop->op_ppaddr = ppaddr[type];
2261 pvop->op_next = (OP*)pvop;
2262 pvop->op_flags = flags;
2263 if (opargs[type] & OA_RETSCALAR)
2265 if (opargs[type] & OA_TARGET)
2266 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2267 return CHECKOP(type, pvop);
2276 save_hptr(&curstash);
2277 save_item(curstname);
2282 name = SvPV(sv, len);
2283 curstash = gv_stashpvn(name,len,TRUE);
2284 sv_setpvn(curstname, name, len);
2288 sv_setpv(curstname,"<none>");
2296 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2304 if (id->op_type != OP_CONST)
2305 croak("Module name must be constant");
2309 if(version != Nullop) {
2310 SV *vesv = ((SVOP*)version)->op_sv;
2312 if (arg == Nullop && !SvNIOK(vesv)) {
2319 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2320 croak("Version number must be constant number");
2322 /* Make copy of id so we don't free it twice */
2323 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2325 /* Fake up a method call to VERSION */
2326 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2327 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2328 append_elem(OP_LIST,
2329 prepend_elem(OP_LIST, pack, list(version)),
2330 newUNOP(OP_METHOD, 0, meth)));
2334 /* Fake up an import/unimport */
2335 if (arg && arg->op_type == OP_STUB)
2336 imop = arg; /* no import on explicit () */
2337 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2338 imop = Nullop; /* use 5.0; */
2341 /* Make copy of id so we don't free it twice */
2342 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2343 meth = newSVOP(OP_CONST, 0,
2345 ? newSVpv("import", 6)
2346 : newSVpv("unimport", 8)
2348 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2349 append_elem(OP_LIST,
2350 prepend_elem(OP_LIST, pack, list(arg)),
2351 newUNOP(OP_METHOD, 0, meth)));
2354 /* Fake up a require */
2355 rqop = newUNOP(OP_REQUIRE, 0, id);
2357 /* Fake up the BEGIN {}, which does its thing immediately. */
2359 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2361 append_elem(OP_LINESEQ,
2362 append_elem(OP_LINESEQ,
2363 newSTATEOP(0, Nullch, rqop),
2364 newSTATEOP(0, Nullch, veop)),
2365 newSTATEOP(0, Nullch, imop) ));
2372 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2374 return newBINOP(OP_LSLICE, flags,
2375 list(force_list(subscript)),
2376 list(force_list(listval)) );
2380 list_assignment(register OP *o)
2385 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2386 o = cUNOPo->op_first;
2388 if (o->op_type == OP_COND_EXPR) {
2389 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2390 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2395 yyerror("Assignment to both a list and a scalar");
2399 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2400 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2401 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2404 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2407 if (o->op_type == OP_RV2SV)
2414 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2419 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2420 return newLOGOP(optype, 0,
2421 mod(scalar(left), optype),
2422 newUNOP(OP_SASSIGN, 0, scalar(right)));
2425 return newBINOP(optype, OPf_STACKED,
2426 mod(scalar(left), optype), scalar(right));
2430 if (list_assignment(left)) {
2432 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2433 left = mod(left, OP_AASSIGN);
2441 o = newBINOP(OP_AASSIGN, flags,
2442 list(force_list(right)),
2443 list(force_list(left)) );
2444 o->op_private = 0 | (flags >> 8);
2445 if (!(left->op_private & OPpLVAL_INTRO)) {
2449 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2450 if (opargs[curop->op_type] & OA_DANGEROUS) {
2451 if (curop->op_type == OP_GV) {
2452 GV *gv = ((GVOP*)curop)->op_gv;
2453 if (gv == defgv || SvCUR(gv) == generation)
2455 SvCUR(gv) = generation;
2457 else if (curop->op_type == OP_PADSV ||
2458 curop->op_type == OP_PADAV ||
2459 curop->op_type == OP_PADHV ||
2460 curop->op_type == OP_PADANY) {
2461 SV **svp = AvARRAY(comppad_name);
2462 SV *sv = svp[curop->op_targ];
2463 if (SvCUR(sv) == generation)
2465 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2467 else if (curop->op_type == OP_RV2CV)
2469 else if (curop->op_type == OP_RV2SV ||
2470 curop->op_type == OP_RV2AV ||
2471 curop->op_type == OP_RV2HV ||
2472 curop->op_type == OP_RV2GV) {
2473 if (lastop->op_type != OP_GV) /* funny deref? */
2482 o->op_private = OPpASSIGN_COMMON;
2484 if (right && right->op_type == OP_SPLIT) {
2486 if ((tmpop = ((LISTOP*)right)->op_first) &&
2487 tmpop->op_type == OP_PUSHRE)
2489 PMOP *pm = (PMOP*)tmpop;
2490 if (left->op_type == OP_RV2AV &&
2491 !(left->op_private & OPpLVAL_INTRO) &&
2492 !(o->op_private & OPpASSIGN_COMMON) )
2494 tmpop = ((UNOP*)left)->op_first;
2495 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2496 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2497 pm->op_pmflags |= PMf_ONCE;
2498 tmpop = cUNOPo->op_first; /* to list (nulled) */
2499 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2500 tmpop->op_sibling = Nullop; /* don't free split */
2501 right->op_next = tmpop->op_next; /* fix starting loc */
2502 op_free(o); /* blow off assign */
2503 right->op_flags &= ~OPf_WANT;
2504 /* "I don't know and I don't care." */
2509 if (modcount < 10000 &&
2510 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2512 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2514 sv_setiv(sv, modcount+1);
2522 right = newOP(OP_UNDEF, 0);
2523 if (right->op_type == OP_READLINE) {
2524 right->op_flags |= OPf_STACKED;
2525 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2528 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2529 o = newBINOP(OP_SASSIGN, flags,
2530 scalar(right), mod(scalar(left), OP_SASSIGN) );
2542 newSTATEOP(I32 flags, char *label, OP *o)
2545 U32 seq = intro_my();
2548 Newz(1101, cop, 1, COP);
2549 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2550 cop->op_type = OP_DBSTATE;
2551 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2554 cop->op_type = OP_NEXTSTATE;
2555 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2557 cop->op_flags = flags;
2558 cop->op_private = 0 | (flags >> 8);
2560 cop->op_private |= NATIVE_HINTS;
2562 cop->op_next = (OP*)cop;
2565 cop->cop_label = label;
2566 hints |= HINT_BLOCK_SCOPE;
2569 cop->cop_arybase = curcop->cop_arybase;
2571 if (copline == NOLINE)
2572 cop->cop_line = curcop->cop_line;
2574 cop->cop_line = copline;
2577 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2578 cop->cop_stash = curstash;
2580 if (PERLDB_LINE && curstash != debstash) {
2581 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2582 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2583 (void)SvIOK_on(*svp);
2585 SvSTASH(*svp) = (HV*)cop;
2589 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2592 /* "Introduce" my variables to visible status. */
2600 if (! min_intro_pending)
2603 svp = AvARRAY(comppad_name);
2604 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2605 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2606 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2607 SvNVX(sv) = (double)cop_seqmax;
2610 min_intro_pending = 0;
2611 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2612 return cop_seqmax++;
2616 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2618 return new_logop(type, flags, &first, &other);
2622 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2627 OP *first = *firstp;
2628 OP *other = *otherp;
2630 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2631 return newBINOP(type, flags, scalar(first), scalar(other));
2633 scalarboolean(first);
2634 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2635 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2636 if (type == OP_AND || type == OP_OR) {
2642 first = *firstp = cUNOPo->op_first;
2644 first->op_next = o->op_next;
2645 cUNOPo->op_first = Nullop;
2649 if (first->op_type == OP_CONST) {
2650 if (dowarn && (first->op_private & OPpCONST_BARE))
2651 warn("Probable precedence problem on %s", op_desc[type]);
2652 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2663 else if (first->op_type == OP_WANTARRAY) {
2669 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2670 OP *k1 = ((UNOP*)first)->op_first;
2671 OP *k2 = k1->op_sibling;
2673 switch (first->op_type)
2676 if (k2 && k2->op_type == OP_READLINE
2677 && (k2->op_flags & OPf_STACKED)
2678 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2679 warnop = k2->op_type;
2683 if (k1->op_type == OP_READDIR
2684 || k1->op_type == OP_GLOB
2685 || k1->op_type == OP_EACH)
2686 warnop = k1->op_type;
2690 line_t oldline = curcop->cop_line;
2691 curcop->cop_line = copline;
2692 warn("Value of %s%s can be \"0\"; test with defined()",
2694 ((warnop == OP_READLINE || warnop == OP_GLOB)
2695 ? " construct" : "() operator"));
2696 curcop->cop_line = oldline;
2703 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2704 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2706 Newz(1101, logop, 1, LOGOP);
2708 logop->op_type = type;
2709 logop->op_ppaddr = ppaddr[type];
2710 logop->op_first = first;
2711 logop->op_flags = flags | OPf_KIDS;
2712 logop->op_other = LINKLIST(other);
2713 logop->op_private = 1 | (flags >> 8);
2715 /* establish postfix order */
2716 logop->op_next = LINKLIST(first);
2717 first->op_next = (OP*)logop;
2718 first->op_sibling = other;
2720 o = newUNOP(OP_NULL, 0, (OP*)logop);
2727 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2734 return newLOGOP(OP_AND, 0, first, trueop);
2736 return newLOGOP(OP_OR, 0, first, falseop);
2738 scalarboolean(first);
2739 if (first->op_type == OP_CONST) {
2740 if (SvTRUE(((SVOP*)first)->op_sv)) {
2751 else if (first->op_type == OP_WANTARRAY) {
2755 Newz(1101, condop, 1, CONDOP);
2757 condop->op_type = OP_COND_EXPR;
2758 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2759 condop->op_first = first;
2760 condop->op_flags = flags | OPf_KIDS;
2761 condop->op_true = LINKLIST(trueop);
2762 condop->op_false = LINKLIST(falseop);
2763 condop->op_private = 1 | (flags >> 8);
2765 /* establish postfix order */
2766 condop->op_next = LINKLIST(first);
2767 first->op_next = (OP*)condop;
2769 first->op_sibling = trueop;
2770 trueop->op_sibling = falseop;
2771 o = newUNOP(OP_NULL, 0, (OP*)condop);
2773 trueop->op_next = o;
2774 falseop->op_next = o;
2780 newRANGE(I32 flags, OP *left, OP *right)
2788 Newz(1101, condop, 1, CONDOP);
2790 condop->op_type = OP_RANGE;
2791 condop->op_ppaddr = ppaddr[OP_RANGE];
2792 condop->op_first = left;
2793 condop->op_flags = OPf_KIDS;
2794 condop->op_true = LINKLIST(left);
2795 condop->op_false = LINKLIST(right);
2796 condop->op_private = 1 | (flags >> 8);
2798 left->op_sibling = right;
2800 condop->op_next = (OP*)condop;
2801 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2802 flop = newUNOP(OP_FLOP, 0, flip);
2803 o = newUNOP(OP_NULL, 0, flop);
2806 left->op_next = flip;
2807 right->op_next = flop;
2809 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2810 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2811 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2812 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2814 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2815 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2818 if (!flip->op_private || !flop->op_private)
2819 linklist(o); /* blow off optimizer unless constant */
2825 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2830 int once = block && block->op_flags & OPf_SPECIAL &&
2831 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2834 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2835 return block; /* do {} while 0 does once */
2836 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2837 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2838 expr = newUNOP(OP_DEFINED, 0,
2839 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2843 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2844 o = new_logop(OP_AND, 0, &expr, &listop);
2847 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2849 if (once && o != listop)
2850 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2853 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2855 o->op_flags |= flags;
2857 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2862 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2871 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2872 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2873 expr = newUNOP(OP_DEFINED, 0,
2874 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2878 block = newOP(OP_NULL, 0);
2881 next = LINKLIST(cont);
2883 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2884 if ((line_t)whileline != NOLINE) {
2885 copline = whileline;
2886 cont = append_elem(OP_LINESEQ, cont,
2887 newSTATEOP(0, Nullch, Nullop));
2891 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2892 redo = LINKLIST(listop);
2895 copline = whileline;
2897 o = new_logop(OP_AND, 0, &expr, &listop);
2898 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2899 op_free(expr); /* oops, it's a while (0) */
2901 return Nullop; /* listop already freed by new_logop */
2904 ((LISTOP*)listop)->op_last->op_next = condop =
2905 (o == listop ? redo : LINKLIST(o));
2913 Newz(1101,loop,1,LOOP);
2914 loop->op_type = OP_ENTERLOOP;
2915 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2916 loop->op_private = 0;
2917 loop->op_next = (OP*)loop;
2920 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2922 loop->op_redoop = redo;
2923 loop->op_lastop = o;
2926 loop->op_nextop = next;
2928 loop->op_nextop = o;
2930 o->op_flags |= flags;
2931 o->op_private |= (flags >> 8);
2936 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2944 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2945 sv->op_type = OP_RV2GV;
2946 sv->op_ppaddr = ppaddr[OP_RV2GV];
2948 else if (sv->op_type == OP_PADSV) { /* private variable */
2949 padoff = sv->op_targ;
2953 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
2954 padoff = sv->op_targ;
2955 iterflags |= OPf_SPECIAL;
2960 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2964 padoff = find_threadsv("_");
2965 iterflags |= OPf_SPECIAL;
2967 sv = newGVOP(OP_GV, 0, defgv);
2970 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2971 expr = scalar(ref(expr, OP_ITER));
2972 iterflags |= OPf_STACKED;
2974 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2975 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2977 assert(!loop->op_next);
2978 Renew(loop, 1, LOOP);
2979 loop->op_targ = padoff;
2980 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
2982 return newSTATEOP(0, label, wop);
2986 newLOOPEX(I32 type, OP *label)
2990 if (type != OP_GOTO || label->op_type == OP_CONST) {
2991 /* "last()" means "last" */
2992 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
2993 o = newOP(type, OPf_SPECIAL);
2995 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
2996 ? SvPVx(((SVOP*)label)->op_sv, na)
3002 if (label->op_type == OP_ENTERSUB)
3003 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3004 o = newUNOP(type, OPf_STACKED, label);
3006 hints |= HINT_BLOCK_SCOPE;
3016 MUTEX_DESTROY(CvMUTEXP(cv));
3017 Safefree(CvMUTEXP(cv));
3020 #endif /* USE_THREADS */
3022 if (!CvXSUB(cv) && CvROOT(cv)) {
3024 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3025 croak("Can't undef active subroutine");
3028 croak("Can't undef active subroutine");
3029 #endif /* USE_THREADS */
3036 op_free(CvROOT(cv));
3037 CvROOT(cv) = Nullop;
3040 SvPOK_off((SV*)cv); /* forget prototype */
3042 SvREFCNT_dec(CvGV(cv));
3044 SvREFCNT_dec(CvOUTSIDE(cv));
3045 CvOUTSIDE(cv) = Nullcv;
3046 if (CvPADLIST(cv)) {
3047 /* may be during global destruction */
3048 if (SvREFCNT(CvPADLIST(cv))) {
3049 I32 i = AvFILLp(CvPADLIST(cv));
3051 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3052 SV* sv = svp ? *svp : Nullsv;
3055 if (sv == (SV*)comppad_name)
3056 comppad_name = Nullav;
3057 else if (sv == (SV*)comppad) {
3059 curpad = Null(SV**);
3063 SvREFCNT_dec((SV*)CvPADLIST(cv));
3065 CvPADLIST(cv) = Nullav;
3069 #ifdef DEBUG_CLOSURES
3074 CV *outside = CvOUTSIDE(cv);
3075 AV* padlist = CvPADLIST(cv);
3082 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3084 (CvANON(cv) ? "ANON"
3085 : (cv == main_cv) ? "MAIN"
3086 : CvUNIQUE(outside) ? "UNIQUE"
3087 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3090 : CvANON(outside) ? "ANON"
3091 : (outside == main_cv) ? "MAIN"
3092 : CvUNIQUE(outside) ? "UNIQUE"
3093 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3098 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3099 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3100 pname = AvARRAY(pad_name);
3101 ppad = AvARRAY(pad);
3103 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3104 if (SvPOK(pname[ix]))
3105 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3107 SvFAKE(pname[ix]) ? "FAKE " : "",
3109 (long)I_32(SvNVX(pname[ix])),
3110 (long)SvIVX(pname[ix]));
3113 #endif /* DEBUG_CLOSURES */
3116 cv_clone2(CV *proto, CV *outside)
3121 AV* protopadlist = CvPADLIST(proto);
3122 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3123 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3124 SV** pname = AvARRAY(protopad_name);
3125 SV** ppad = AvARRAY(protopad);
3126 I32 fname = AvFILLp(protopad_name);
3127 I32 fpad = AvFILLp(protopad);
3131 assert(!CvUNIQUE(proto));
3136 SAVESPTR(comppad_name);
3139 cv = compcv = (CV*)NEWSV(1104,0);
3140 sv_upgrade((SV *)cv, SvTYPE(proto));
3146 New(666, CvMUTEXP(cv), 1, perl_mutex);
3147 MUTEX_INIT(CvMUTEXP(cv));
3149 #endif /* USE_THREADS */
3150 CvFILEGV(cv) = CvFILEGV(proto);
3151 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3152 CvSTASH(cv) = CvSTASH(proto);
3153 CvROOT(cv) = CvROOT(proto);
3154 CvSTART(cv) = CvSTART(proto);
3156 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3159 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3161 comppad_name = newAV();
3162 for (ix = fname; ix >= 0; ix--)
3163 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3167 comppadlist = newAV();
3168 AvREAL_off(comppadlist);
3169 av_store(comppadlist, 0, (SV*)comppad_name);
3170 av_store(comppadlist, 1, (SV*)comppad);
3171 CvPADLIST(cv) = comppadlist;
3172 av_fill(comppad, AvFILLp(protopad));
3173 curpad = AvARRAY(comppad);
3175 av = newAV(); /* will be @_ */
3177 av_store(comppad, 0, (SV*)av);
3178 AvFLAGS(av) = AVf_REIFY;
3180 for (ix = fpad; ix > 0; ix--) {
3181 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3182 if (namesv && namesv != &sv_undef) {
3183 char *name = SvPVX(namesv); /* XXX */
3184 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3185 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3186 CvOUTSIDE(cv), cxstack_ix);
3188 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3190 croak("panic: cv_clone: %s", name);
3192 else { /* our own lexical */
3195 /* anon code -- we'll come back for it */
3196 sv = SvREFCNT_inc(ppad[ix]);
3198 else if (*name == '@')
3200 else if (*name == '%')
3210 SV* sv = NEWSV(0,0);
3216 /* Now that vars are all in place, clone nested closures. */
3218 for (ix = fpad; ix > 0; ix--) {
3219 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3221 && namesv != &sv_undef
3222 && !(SvFLAGS(namesv) & SVf_FAKE)
3223 && *SvPVX(namesv) == '&'
3224 && CvCLONE(ppad[ix]))
3226 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3227 SvREFCNT_dec(ppad[ix]);
3230 curpad[ix] = (SV*)kid;
3234 #ifdef DEBUG_CLOSURES
3235 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3237 PerlIO_printf(Perl_debug_log, " from:\n");
3239 PerlIO_printf(Perl_debug_log, " to:\n");
3250 return cv_clone2(proto, CvOUTSIDE(proto));
3254 cv_ckproto(CV *cv, GV *gv, char *p)
3256 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3257 SV* msg = sv_newmortal();
3261 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3262 sv_setpv(msg, "Prototype mismatch:");
3264 sv_catpvf(msg, " sub %_", name);
3266 sv_catpvf(msg, " (%s)", SvPVX(cv));
3267 sv_catpv(msg, " vs ");
3269 sv_catpvf(msg, "(%s)", p);
3271 sv_catpv(msg, "none");
3282 if (!cv || !SvPOK(cv) || SvCUR(cv))
3286 for (o = CvSTART(cv); o; o = o->op_next) {
3287 OPCODE type = o->op_type;
3289 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3291 if (type == OP_LEAVESUB || type == OP_RETURN)
3295 if (type == OP_CONST)
3297 else if (type == OP_PADSV) {
3298 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3299 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3300 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3312 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3315 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3316 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3317 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3326 if (!name || GvCVGEN(gv))
3328 else if (cv = GvCV(gv)) {
3329 cv_ckproto(cv, gv, ps);
3330 /* already defined (or promised)? */
3331 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3334 /* just a "sub foo;" when &foo is already defined */
3338 /* ahem, death to those who redefine active sort subs */
3339 if (curstack == sortstack && sortcop == CvSTART(cv))
3340 croak("Can't redefine active sort subroutine %s", name);
3341 const_sv = cv_const_sv(cv);
3342 if (const_sv || dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3343 && HvNAME(GvSTASH(CvGV(cv)))
3344 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3346 line_t oldline = curcop->cop_line;
3347 curcop->cop_line = copline;
3348 warn(const_sv ? "Constant subroutine %s redefined"
3349 : "Subroutine %s redefined", name);
3350 curcop->cop_line = oldline;
3356 if (cv) { /* must reuse cv if autoloaded */
3358 CvFLAGS(cv) = CvFLAGS(compcv);
3359 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3360 CvOUTSIDE(compcv) = 0;
3361 CvPADLIST(cv) = CvPADLIST(compcv);
3362 CvPADLIST(compcv) = 0;
3363 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3364 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3365 SvREFCNT_dec(compcv);
3375 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3376 CvFILEGV(cv) = curcop->cop_filegv;
3377 CvSTASH(cv) = curstash;
3380 New(666, CvMUTEXP(cv), 1, perl_mutex);
3381 MUTEX_INIT(CvMUTEXP(cv));
3382 #endif /* USE_THREADS */
3385 sv_setpv((SV*)cv, ps);
3391 char *s = strrchr(name, ':');
3393 if (strEQ(s, "BEGIN")) {
3395 "BEGIN not safe after errors--compilation aborted";
3399 /* force display of errors found but not reported */
3400 sv_catpv(ERRSV, not_safe);
3401 croak("%s", SvPVx(ERRSV, na));
3412 if (AvFILLp(comppad_name) < AvFILLp(comppad))
3413 av_store(comppad_name, AvFILLp(comppad), Nullsv);
3416 SV **namep = AvARRAY(comppad_name);
3417 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3420 if (SvIMMORTAL(curpad[ix]))
3423 * The only things that a clonable function needs in its
3424 * pad are references to outer lexicals and anonymous subs.
3425 * The rest are created anew during cloning.
3427 if (!((namesv = namep[ix]) != Nullsv &&
3428 namesv != &sv_undef &&
3430 *SvPVX(namesv) == '&')))
3432 SvREFCNT_dec(curpad[ix]);
3433 curpad[ix] = Nullsv;
3438 AV *av = newAV(); /* Will be @_ */
3440 av_store(comppad, 0, (SV*)av);
3441 AvFLAGS(av) = AVf_REIFY;
3443 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3444 if (SvIMMORTAL(curpad[ix]))
3446 if (!SvPADMY(curpad[ix]))
3447 SvPADTMP_on(curpad[ix]);
3451 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3452 CvSTART(cv) = LINKLIST(CvROOT(cv));
3453 CvROOT(cv)->op_next = 0;
3459 if (PERLDB_SUBLINE && curstash != debstash) {
3460 SV *sv = NEWSV(0,0);
3461 SV *tmpstr = sv_newmortal();
3462 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3466 sv_setpvf(sv, "%_:%ld-%ld",
3467 GvSV(curcop->cop_filegv),
3468 (long)subline, (long)curcop->cop_line);
3469 gv_efullname3(tmpstr, gv, Nullch);
3470 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3471 hv = GvHVn(db_postponed);
3472 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3473 && (cv = GvCV(db_postponed))) {
3478 perl_call_sv((SV*)cv, G_DISCARD);
3482 if ((s = strrchr(name,':')))
3486 if (strEQ(s, "BEGIN")) {
3487 I32 oldscope = scopestack_ix;
3489 SAVESPTR(compiling.cop_filegv);
3490 SAVEI16(compiling.cop_line);
3497 DEBUG_x( dump_sub(gv) );
3498 av_push(beginav, (SV *)cv);
3500 call_list(oldscope, beginav);
3502 curcop = &compiling;
3505 else if (strEQ(s, "END") && !error_count) {
3508 av_unshift(endav, 1);
3509 av_store(endav, 0, (SV *)cv);
3512 else if (strEQ(s, "INIT") && !error_count) {
3515 av_push(initav, SvREFCNT_inc(cv));
3526 newXS(char *name, void (*subaddr) (CPERLproto_ CV *), char *filename)
3529 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3532 if (cv = (name ? GvCV(gv) : Nullcv)) {
3534 /* just a cached method */
3538 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3539 /* already defined (or promised) */
3540 if (dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3541 && HvNAME(GvSTASH(CvGV(cv)))
3542 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3543 line_t oldline = curcop->cop_line;
3544 curcop->cop_line = copline;
3545 warn("Subroutine %s redefined",name);
3546 curcop->cop_line = oldline;
3553 if (cv) /* must reuse cv if autoloaded */
3556 cv = (CV*)NEWSV(1105,0);
3557 sv_upgrade((SV *)cv, SVt_PVCV);
3564 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3566 New(666, CvMUTEXP(cv), 1, perl_mutex);
3567 MUTEX_INIT(CvMUTEXP(cv));
3569 #endif /* USE_THREADS */
3570 CvFILEGV(cv) = gv_fetchfile(filename);
3571 CvXSUB(cv) = subaddr;
3574 char *s = strrchr(name,':');
3579 if (strEQ(s, "BEGIN")) {
3582 av_push(beginav, (SV *)cv);
3585 else if (strEQ(s, "END")) {
3588 av_unshift(endav, 1);
3589 av_store(endav, 0, (SV *)cv);
3592 else if (strEQ(s, "INIT")) {
3595 av_push(initav, (SV *)cv);
3605 newFORM(I32 floor, OP *o, OP *block)
3614 name = SvPVx(cSVOPo->op_sv, na);
3617 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3619 if (cv = GvFORM(gv)) {
3621 line_t oldline = curcop->cop_line;
3623 curcop->cop_line = copline;
3624 warn("Format %s redefined",name);
3625 curcop->cop_line = oldline;
3631 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3632 CvFILEGV(cv) = curcop->cop_filegv;
3634 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3635 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3636 SvPADTMP_on(curpad[ix]);
3639 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3640 CvSTART(cv) = LINKLIST(CvROOT(cv));
3641 CvROOT(cv)->op_next = 0;
3651 return newUNOP(OP_REFGEN, 0,
3652 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3658 return newUNOP(OP_REFGEN, 0,
3659 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3663 newANONSUB(I32 floor, OP *proto, OP *block)
3665 return newUNOP(OP_REFGEN, 0,
3666 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3672 switch (o->op_type) {
3674 o->op_type = OP_PADAV;
3675 o->op_ppaddr = ppaddr[OP_PADAV];
3676 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3679 o->op_type = OP_RV2AV;
3680 o->op_ppaddr = ppaddr[OP_RV2AV];
3685 warn("oops: oopsAV");
3694 switch (o->op_type) {
3697 o->op_type = OP_PADHV;
3698 o->op_ppaddr = ppaddr[OP_PADHV];
3699 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3703 o->op_type = OP_RV2HV;
3704 o->op_ppaddr = ppaddr[OP_RV2HV];
3709 warn("oops: oopsHV");
3718 if (o->op_type == OP_PADANY) {
3719 o->op_type = OP_PADAV;
3720 o->op_ppaddr = ppaddr[OP_PADAV];
3723 return newUNOP(OP_RV2AV, 0, scalar(o));
3727 newGVREF(I32 type, OP *o)
3729 if (type == OP_MAPSTART)
3730 return newUNOP(OP_NULL, 0, o);
3731 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3737 if (o->op_type == OP_PADANY) {
3738 o->op_type = OP_PADHV;
3739 o->op_ppaddr = ppaddr[OP_PADHV];
3742 return newUNOP(OP_RV2HV, 0, scalar(o));
3748 croak("NOT IMPL LINE %d",__LINE__);
3754 newCVREF(I32 flags, OP *o)
3756 return newUNOP(OP_RV2CV, flags, scalar(o));
3762 if (o->op_type == OP_PADANY) {
3763 o->op_type = OP_PADSV;
3764 o->op_ppaddr = ppaddr[OP_PADSV];
3767 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3768 o->op_flags |= OPpDONE_SVREF;
3771 return newUNOP(OP_RV2SV, 0, scalar(o));
3774 /* Check routines. */
3782 name = NEWSV(1106,0);
3783 sv_upgrade(name, SVt_PVNV);
3784 sv_setpvn(name, "&", 1);
3787 ix = pad_alloc(o->op_type, SVs_PADMY);
3788 av_store(comppad_name, ix, name);
3789 av_store(comppad, ix, cSVOPo->op_sv);
3790 SvPADMY_on(cSVOPo->op_sv);
3791 cSVOPo->op_sv = Nullsv;
3792 cSVOPo->op_targ = ix;
3799 o->op_private = hints;
3806 if (cUNOPo->op_first->op_type == OP_CONCAT)
3807 o->op_flags |= OPf_STACKED;
3814 if (o->op_flags & OPf_KIDS) {
3817 OPCODE type = o->op_type;
3818 o = modkids(ck_fun(o), type);
3819 kid = cUNOPo->op_first;
3820 newop = kUNOP->op_first->op_sibling;
3822 (newop->op_sibling ||
3823 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3824 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3825 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3829 op_free(kUNOP->op_first);
3830 kUNOP->op_first = newop;
3832 o->op_ppaddr = ppaddr[++o->op_type];
3841 if (o->op_flags & OPf_KIDS) {
3842 OP *kid = cUNOPo->op_first;
3843 if (kid->op_type == OP_HSLICE)
3844 o->op_private |= OPpSLICE;
3845 else if (kid->op_type != OP_HELEM)
3846 croak("%s argument is not a HASH element or slice",
3847 op_desc[o->op_type]);
3856 I32 type = o->op_type;
3858 if (o->op_flags & OPf_KIDS) {
3859 if (cLISTOPo->op_first->op_type == OP_STUB) {
3861 o = newUNOP(type, OPf_SPECIAL,
3862 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3872 hints |= HINT_BLOCK_SCOPE;
3873 if (o->op_flags & OPf_KIDS) {
3874 SVOP *kid = (SVOP*)cUNOPo->op_first;
3877 o->op_flags &= ~OPf_KIDS;
3880 else if (kid->op_type == OP_LINESEQ) {
3883 kid->op_next = o->op_next;
3884 cUNOPo->op_first = 0;
3887 Newz(1101, enter, 1, LOGOP);
3888 enter->op_type = OP_ENTERTRY;
3889 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3890 enter->op_private = 0;
3892 /* establish postfix order */
3893 enter->op_next = (OP*)enter;
3895 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3896 o->op_type = OP_LEAVETRY;
3897 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3898 enter->op_other = o;
3906 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
3908 o->op_targ = (PADOFFSET)hints;
3916 if (o->op_flags & OPf_STACKED) {
3918 kid = cUNOPo->op_first->op_sibling;
3919 if (kid->op_type == OP_RV2GV)
3931 if (o->op_flags & OPf_KIDS) {
3932 OP *kid = cUNOPo->op_first;
3933 if (kid->op_type != OP_HELEM)
3934 croak("%s argument is not a HASH element", op_desc[o->op_type]);
3941 ck_gvconst(register OP *o)
3943 o = fold_constants(o);
3944 if (o->op_type == OP_CONST)
3950 ck_rvconst(register OP *o)
3953 SVOP *kid = (SVOP*)cUNOPo->op_first;
3955 o->op_private |= (hints & HINT_STRICT_REFS);
3956 if (kid->op_type == OP_CONST) {
3961 name = SvPV(kid->op_sv, na);
3962 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3963 char *badthing = Nullch;
3964 switch (o->op_type) {
3966 badthing = "a SCALAR";
3969 badthing = "an ARRAY";
3972 badthing = "a HASH";
3977 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3981 * This is a little tricky. We only want to add the symbol if we
3982 * didn't add it in the lexer. Otherwise we get duplicate strict
3983 * warnings. But if we didn't add it in the lexer, we must at
3984 * least pretend like we wanted to add it even if it existed before,
3985 * or we get possible typo warnings. OPpCONST_ENTERED says
3986 * whether the lexer already added THIS instance of this symbol.
3988 iscv = (o->op_type == OP_RV2CV) * 2;
3990 gv = gv_fetchpv(name,
3991 iscv | !(kid->op_private & OPpCONST_ENTERED),
3994 : o->op_type == OP_RV2SV
3996 : o->op_type == OP_RV2AV
3998 : o->op_type == OP_RV2HV
4001 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4003 kid->op_type = OP_GV;
4004 SvREFCNT_dec(kid->op_sv);
4005 kid->op_sv = SvREFCNT_inc(gv);
4015 I32 type = o->op_type;
4017 if (o->op_flags & OPf_REF)
4020 if (o->op_flags & OPf_KIDS) {
4021 SVOP *kid = (SVOP*)cUNOPo->op_first;
4023 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4024 OP *newop = newGVOP(type, OPf_REF,
4025 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4032 if (type == OP_FTTTY)
4033 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4036 return newUNOP(type, 0, newDEFSVOP());
4049 int type = o->op_type;
4050 register I32 oa = opargs[type] >> OASHIFT;
4052 if (o->op_flags & OPf_STACKED) {
4053 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4056 return no_fh_allowed(o);
4059 if (o->op_flags & OPf_KIDS) {
4060 tokid = &cLISTOPo->op_first;
4061 kid = cLISTOPo->op_first;
4062 if (kid->op_type == OP_PUSHMARK ||
4063 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4065 tokid = &kid->op_sibling;
4066 kid = kid->op_sibling;
4068 if (!kid && opargs[type] & OA_DEFGV)
4069 *tokid = kid = newDEFSVOP();
4073 sibl = kid->op_sibling;
4087 if (kid->op_type == OP_CONST &&
4088 (kid->op_private & OPpCONST_BARE)) {
4089 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4090 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4091 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4093 warn("Array @%s missing the @ in argument %ld of %s()",
4094 name, (long)numargs, op_desc[type]);
4097 kid->op_sibling = sibl;
4100 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4101 bad_type(numargs, "array", op_desc[o->op_type], kid);
4105 if (kid->op_type == OP_CONST &&
4106 (kid->op_private & OPpCONST_BARE)) {
4107 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4108 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4109 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4111 warn("Hash %%%s missing the %% in argument %ld of %s()",
4112 name, (long)numargs, op_desc[type]);
4115 kid->op_sibling = sibl;
4118 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4119 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4124 OP *newop = newUNOP(OP_NULL, 0, kid);
4125 kid->op_sibling = 0;
4127 newop->op_next = newop;
4129 kid->op_sibling = sibl;
4134 if (kid->op_type != OP_GV) {
4135 if (kid->op_type == OP_CONST &&
4136 (kid->op_private & OPpCONST_BARE)) {
4137 OP *newop = newGVOP(OP_GV, 0,
4138 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4144 kid->op_sibling = 0;
4145 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4147 kid->op_sibling = sibl;
4153 mod(scalar(kid), type);
4157 tokid = &kid->op_sibling;
4158 kid = kid->op_sibling;
4160 o->op_private |= numargs;
4162 return too_many_arguments(o,op_desc[o->op_type]);
4165 else if (opargs[type] & OA_DEFGV) {
4167 return newUNOP(type, 0, newDEFSVOP());
4171 while (oa & OA_OPTIONAL)
4173 if (oa && oa != OA_LIST)
4174 return too_few_arguments(o,op_desc[o->op_type]);
4184 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4185 append_elem(OP_GLOB, o, newDEFSVOP());
4187 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4188 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4190 if (gv && GvIMPORTED_CV(gv)) {
4191 static int glob_index;
4193 append_elem(OP_GLOB, o,
4194 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4195 o->op_type = OP_LIST;
4196 o->op_ppaddr = ppaddr[OP_LIST];
4197 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4198 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4199 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4200 append_elem(OP_LIST, o,
4201 scalar(newUNOP(OP_RV2CV, 0,
4202 newGVOP(OP_GV, 0, gv)))));
4203 o = newUNOP(OP_NULL, 0, ck_subr(o));
4204 o->op_targ = OP_GLOB; /* hint at what it used to be */
4207 gv = newGVgen("main");
4209 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4219 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4221 o->op_ppaddr = ppaddr[OP_GREPSTART];
4222 Newz(1101, gwop, 1, LOGOP);
4224 if (o->op_flags & OPf_STACKED) {
4227 kid = cLISTOPo->op_first->op_sibling;
4228 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4231 kid->op_next = (OP*)gwop;
4232 o->op_flags &= ~OPf_STACKED;
4234 kid = cLISTOPo->op_first->op_sibling;
4235 if (type == OP_MAPWHILE)
4242 kid = cLISTOPo->op_first->op_sibling;
4243 if (kid->op_type != OP_NULL)
4244 croak("panic: ck_grep");
4245 kid = kUNOP->op_first;
4247 gwop->op_type = type;
4248 gwop->op_ppaddr = ppaddr[type];
4249 gwop->op_first = listkids(o);
4250 gwop->op_flags |= OPf_KIDS;
4251 gwop->op_private = 1;
4252 gwop->op_other = LINKLIST(kid);
4253 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4254 kid->op_next = (OP*)gwop;
4256 kid = cLISTOPo->op_first->op_sibling;
4257 if (!kid || !kid->op_sibling)
4258 return too_few_arguments(o,op_desc[o->op_type]);
4259 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4260 mod(kid, OP_GREPSTART);
4268 if (o->op_flags & OPf_KIDS) {
4269 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4270 if (kid && kid->op_type == OP_CONST)
4271 fbm_compile(((SVOP*)kid)->op_sv, 0);
4277 ck_lengthconst(OP *o)
4279 /* XXX length optimization goes here */
4286 OPCODE type = o->op_type;
4287 return modkids(ck_fun(o), type);
4293 OPCODE type = o->op_type;
4294 return refkids(ck_fun(o), type);
4302 kid = cLISTOPo->op_first;
4305 kid = cLISTOPo->op_first;
4307 if (kid->op_type == OP_PUSHMARK)
4308 kid = kid->op_sibling;
4309 if (kid && o->op_flags & OPf_STACKED)
4310 kid = kid->op_sibling;
4311 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4312 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4313 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4314 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4315 cLISTOPo->op_first->op_sibling = kid;
4316 cLISTOPo->op_last = kid;
4317 kid = kid->op_sibling;
4322 append_elem(o->op_type, o, newDEFSVOP());
4328 if (hints & HINT_LOCALE)
4329 o->op_private |= OPpLOCALE;
4336 ck_fun_locale(OP *o)
4342 if (hints & HINT_LOCALE)
4343 o->op_private |= OPpLOCALE;
4354 if (hints & HINT_LOCALE)
4355 o->op_private |= OPpLOCALE;
4364 o->op_private |= OPpRUNTIME;
4377 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4378 o->op_private |= OPpREPEAT_DOLIST;
4379 cBINOPo->op_first = force_list(cBINOPo->op_first);
4389 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4390 SVOP *kid = (SVOP*)cUNOPo->op_first;
4392 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4394 for (s = SvPVX(kid->op_sv); *s; s++) {
4395 if (*s == ':' && s[1] == ':') {
4397 Move(s+2, s+1, strlen(s+2)+1, char);
4398 --SvCUR(kid->op_sv);
4401 sv_catpvn(kid->op_sv, ".pm", 3);
4410 croak("NOT IMPL LINE %d",__LINE__);
4419 if (o->op_flags & OPf_KIDS) {
4420 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4421 if (kid && kid->op_sibling) {
4422 o->op_type = OP_SSELECT;
4423 o->op_ppaddr = ppaddr[OP_SSELECT];
4425 return fold_constants(o);
4429 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4430 if (kid && kid->op_type == OP_RV2GV)
4431 kid->op_private &= ~HINT_STRICT_REFS;
4438 I32 type = o->op_type;
4440 if (!(o->op_flags & OPf_KIDS)) {
4445 if (!CvUNIQUE(compcv)) {
4446 argop = newOP(OP_PADAV, OPf_REF);
4447 argop->op_targ = 0; /* curpad[0] is @_ */
4450 argop = newUNOP(OP_RV2AV, 0,
4451 scalar(newGVOP(OP_GV, 0,
4452 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4455 argop = newUNOP(OP_RV2AV, 0,
4456 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(compcv) ?
4457 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4458 #endif /* USE_THREADS */
4459 return newUNOP(type, 0, scalar(argop));
4461 return scalar(modkids(ck_fun(o), type));
4469 if (hints & HINT_LOCALE)
4470 o->op_private |= OPpLOCALE;
4473 if (o->op_flags & OPf_STACKED) {
4474 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4476 kid = kUNOP->op_first; /* get past rv2gv */
4478 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4480 if (kid->op_type == OP_SCOPE) {
4484 else if (kid->op_type == OP_LEAVE) {
4485 if (o->op_type == OP_SORT) {
4486 null(kid); /* wipe out leave */
4489 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4490 if (k->op_next == kid)
4495 kid->op_next = 0; /* just disconnect the leave */
4496 k = kLISTOP->op_first;
4500 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4501 null(kid); /* wipe out rv2gv */
4502 if (o->op_type == OP_SORT)
4506 o->op_flags |= OPf_SPECIAL;
4518 if (o->op_flags & OPf_STACKED)
4519 return no_fh_allowed(o);
4521 kid = cLISTOPo->op_first;
4522 if (kid->op_type != OP_NULL)
4523 croak("panic: ck_split");
4524 kid = kid->op_sibling;
4525 op_free(cLISTOPo->op_first);
4526 cLISTOPo->op_first = kid;
4528 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4529 cLISTOPo->op_last = kid; /* There was only one element previously */
4532 if (kid->op_type != OP_MATCH) {
4533 OP *sibl = kid->op_sibling;
4534 kid->op_sibling = 0;
4535 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4536 if (cLISTOPo->op_first == cLISTOPo->op_last)
4537 cLISTOPo->op_last = kid;
4538 cLISTOPo->op_first = kid;
4539 kid->op_sibling = sibl;
4542 kid->op_type = OP_PUSHRE;
4543 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4546 if (!kid->op_sibling)
4547 append_elem(OP_SPLIT, o, newDEFSVOP());
4549 kid = kid->op_sibling;
4552 if (!kid->op_sibling)
4553 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4555 kid = kid->op_sibling;
4558 if (kid->op_sibling)
4559 return too_many_arguments(o,op_desc[o->op_type]);
4568 OP *prev = ((cUNOPo->op_first->op_sibling)
4569 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4570 OP *o2 = prev->op_sibling;
4578 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4579 if (cvop->op_type == OP_RV2CV) {
4581 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4582 null(cvop); /* disable rv2cv */
4583 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4584 if (tmpop->op_type == OP_GV) {
4585 cv = GvCVu(tmpop->op_sv);
4586 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4587 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4588 proto = SvPV((SV*)cv, na);
4592 o->op_private |= (hints & HINT_STRICT_REFS);
4593 if (PERLDB_SUB && curstash != debstash)
4594 o->op_private |= OPpENTERSUB_DB;
4595 while (o2 != cvop) {
4599 return too_many_arguments(o, gv_ename(namegv));
4617 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4618 bad_type(arg, "block", gv_ename(namegv), o2);
4623 if (o2->op_type == OP_RV2GV)
4627 OP* sib = kid->op_sibling;
4628 kid->op_sibling = 0;
4629 o2 = newUNOP(OP_RV2GV, 0, kid);
4630 o2->op_sibling = sib;
4631 prev->op_sibling = o2;
4639 if (o2->op_type != OP_RV2GV)
4640 bad_type(arg, "symbol", gv_ename(namegv), o2);
4643 if (o2->op_type != OP_RV2CV)
4644 bad_type(arg, "sub", gv_ename(namegv), o2);
4647 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4648 bad_type(arg, "scalar", gv_ename(namegv), o2);
4651 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4652 bad_type(arg, "array", gv_ename(namegv), o2);
4655 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4656 bad_type(arg, "hash", gv_ename(namegv), o2);
4660 OP* sib = kid->op_sibling;
4661 kid->op_sibling = 0;
4662 o2 = newUNOP(OP_REFGEN, 0, kid);
4663 o2->op_sibling = sib;
4664 prev->op_sibling = o2;
4675 croak("Malformed prototype for %s: %s",
4676 gv_ename(namegv), SvPV((SV*)cv, na));
4681 mod(o2, OP_ENTERSUB);
4683 o2 = o2->op_sibling;
4685 if (proto && !optional &&
4686 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4687 return too_few_arguments(o, gv_ename(namegv));
4694 SvREADONLY_on(cSVOPo->op_sv);
4701 if (o->op_flags & OPf_KIDS) {
4702 SVOP *kid = (SVOP*)cUNOPo->op_first;
4704 if (kid->op_type == OP_NULL)
4705 kid = (SVOP*)kid->op_sibling;
4707 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4708 o->op_flags |= OPf_SPECIAL;
4713 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4716 peep(register OP *o)
4719 register OP* oldop = 0;
4720 if (!o || o->op_seq)
4725 for (; o; o = o->op_next) {
4731 switch (o->op_type) {
4734 curcop = ((COP*)o); /* for warnings */
4735 o->op_seq = op_seqmax++;
4746 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
4748 o->op_seq = op_seqmax++;
4751 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4752 o->op_seq = op_seqmax++;
4753 break; /* Scalar stub must produce undef. List stub is noop */
4757 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4764 if (oldop && o->op_next) {
4765 oldop->op_next = o->op_next;
4768 o->op_seq = op_seqmax++;
4772 if (o->op_next->op_type == OP_RV2SV) {
4773 if (!(o->op_next->op_private & OPpDEREF)) {
4775 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4776 o->op_next = o->op_next->op_next;
4777 o->op_type = OP_GVSV;
4778 o->op_ppaddr = ppaddr[OP_GVSV];
4781 else if (o->op_next->op_type == OP_RV2AV) {
4782 OP* pop = o->op_next->op_next;
4784 if (pop->op_type == OP_CONST &&
4785 (op = pop->op_next) &&
4786 pop->op_next->op_type == OP_AELEM &&
4787 !(pop->op_next->op_private &
4788 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4789 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4793 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4797 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4798 o->op_next = pop->op_next->op_next;
4799 o->op_type = OP_AELEMFAST;
4800 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4801 o->op_private = (U8)i;
4802 GvAVn(((GVOP*)o)->op_gv);
4805 o->op_seq = op_seqmax++;
4809 if (o->op_next->op_type == OP_RV2AV
4810 && (o->op_next->op_flags && OPf_REF))
4813 o->op_next = o->op_next->op_next;
4818 if (o->op_next->op_type == OP_RV2HV
4819 && (o->op_next->op_flags && OPf_REF))
4822 o->op_next = o->op_next->op_next;
4830 o->op_seq = op_seqmax++;
4831 while (cLOGOP->op_other->op_type == OP_NULL)
4832 cLOGOP->op_other = cLOGOP->op_other->op_next;
4833 peep(cLOGOP->op_other);
4837 o->op_seq = op_seqmax++;
4838 peep(cCONDOP->op_true);
4839 peep(cCONDOP->op_false);
4843 o->op_seq = op_seqmax++;
4844 peep(cLOOP->op_redoop);
4845 peep(cLOOP->op_nextop);
4846 peep(cLOOP->op_lastop);
4851 o->op_seq = op_seqmax++;
4852 peep(cPMOP->op_pmreplstart);
4856 o->op_seq = op_seqmax++;
4857 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4858 if (o->op_next->op_sibling &&
4859 o->op_next->op_sibling->op_type != OP_DIE) {
4860 line_t oldline = curcop->cop_line;
4862 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4863 warn("Statement unlikely to be reached");
4864 warn("(Maybe you meant system() when you said exec()?)\n");
4865 curcop->cop_line = oldline;
4879 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4880 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4882 rop = (UNOP*)((BINOP*)o)->op_first;
4883 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4885 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4886 if (!SvOBJECT(lexname))
4888 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4889 if (!fields || !GvHV(*fields))
4891 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4892 key = SvPV(*svp, keylen);
4893 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4895 croak("No such field \"%s\" in variable %s of type %s",
4896 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4898 ind = SvIV(*indsvp);
4900 croak("Bad index while coercing array into hash");
4901 rop->op_type = OP_RV2AV;
4902 rop->op_ppaddr = ppaddr[OP_RV2AV];
4903 o->op_type = OP_AELEM;
4904 o->op_ppaddr = ppaddr[OP_AELEM];
4906 *svp = newSViv(ind);
4911 o->op_seq = op_seqmax++;