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 /* 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 Safefree(cPVOPo->op_pv);
618 op_free(cPMOPo->op_pmreplroot);
622 ReREFCNT_dec(cPMOPo->op_pmregexp);
627 pad_free(o->op_targ);
635 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
636 pad_free(o->op_targ);
637 o->op_targ = o->op_type;
638 o->op_type = OP_NULL;
639 o->op_ppaddr = ppaddr[OP_NULL];
642 /* Contextualizers */
644 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
654 /* establish postfix order */
655 if (cUNOPo->op_first) {
656 o->op_next = LINKLIST(cUNOPo->op_first);
657 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
659 kid->op_next = LINKLIST(kid->op_sibling);
674 if (o && o->op_flags & OPf_KIDS) {
675 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
685 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
687 line_t oldline = curcop->cop_line;
689 if (copline != NOLINE)
690 curcop->cop_line = copline;
691 warn("Found = in conditional, should be ==");
692 curcop->cop_line = oldline;
702 /* assumes no premature commitment */
703 if (!o || (o->op_flags & OPf_WANT) || error_count
704 || o->op_type == OP_RETURN)
707 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
709 switch (o->op_type) {
711 if (o->op_private & OPpREPEAT_DOLIST)
712 null(((LISTOP*)cBINOPo->op_first)->op_first);
713 scalar(cBINOPo->op_first);
718 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
722 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
723 if (!kPMOP->op_pmreplroot)
724 deprecate("implicit split to @_");
731 if (o->op_flags & OPf_KIDS) {
732 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
738 kid = cLISTOPo->op_first;
740 while (kid = kid->op_sibling) {
746 WITH_THR(curcop = &compiling);
751 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
757 WITH_THR(curcop = &compiling);
770 /* assumes no premature commitment */
771 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
772 || o->op_type == OP_RETURN)
775 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
777 switch (o->op_type) {
779 if (!(opargs[o->op_type] & OA_FOLDCONST))
783 if (o->op_flags & OPf_STACKED)
787 if (o->op_private == 4)
858 if (!(o->op_private & OPpLVAL_INTRO))
859 useless = op_desc[o->op_type];
866 if (!(o->op_private & OPpLVAL_INTRO) &&
867 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
868 useless = "a variable";
873 WITH_THR(curcop = ((COP*)o)); /* for warning below */
879 useless = "a constant";
880 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
882 else if (SvPOK(sv)) {
883 if (strnEQ(SvPVX(sv), "di", 2) ||
884 strnEQ(SvPVX(sv), "ds", 2) ||
885 strnEQ(SvPVX(sv), "ig", 2))
889 null(o); /* don't execute a constant */
890 SvREFCNT_dec(sv); /* don't even remember it */
894 o->op_type = OP_PREINC; /* pre-increment is faster */
895 o->op_ppaddr = ppaddr[OP_PREINC];
899 o->op_type = OP_PREDEC; /* pre-decrement is faster */
900 o->op_ppaddr = ppaddr[OP_PREDEC];
906 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
911 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
912 WITH_THR(curcop = ((COP*)o)); /* for warning below */
913 if (o->op_flags & OPf_STACKED)
919 if (!(o->op_flags & OPf_KIDS))
928 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
935 /* all requires must return a boolean value */
936 o->op_flags &= ~OPf_WANT;
939 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
940 if (!kPMOP->op_pmreplroot)
941 deprecate("implicit split to @_");
945 if (useless && dowarn)
946 warn("Useless use of %s in void context", useless);
954 if (o && o->op_flags & OPf_KIDS) {
955 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
966 /* assumes no premature commitment */
967 if (!o || (o->op_flags & OPf_WANT) || error_count
968 || o->op_type == OP_RETURN)
971 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
973 switch (o->op_type) {
976 list(cBINOPo->op_first);
981 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
988 if (!(o->op_flags & OPf_KIDS))
990 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
991 list(cBINOPo->op_first);
992 return gen_constant_list(o);
999 kid = cLISTOPo->op_first;
1001 while (kid = kid->op_sibling) {
1002 if (kid->op_sibling)
1007 WITH_THR(curcop = &compiling);
1011 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1012 if (kid->op_sibling)
1017 WITH_THR(curcop = &compiling);
1020 /* all requires must return a boolean value */
1021 o->op_flags &= ~OPf_WANT;
1033 if (o->op_type == OP_LINESEQ ||
1034 o->op_type == OP_SCOPE ||
1035 o->op_type == OP_LEAVE ||
1036 o->op_type == OP_LEAVETRY)
1039 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1040 if (kid->op_sibling) {
1044 curcop = &compiling;
1046 o->op_flags &= ~OPf_PARENS;
1047 if (hints & HINT_BLOCK_SCOPE)
1048 o->op_flags |= OPf_PARENS;
1051 o = newOP(OP_STUB, 0);
1056 modkids(OP *o, I32 type)
1059 if (o && o->op_flags & OPf_KIDS) {
1060 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1067 mod(OP *o, I32 type)
1073 if (!o || error_count)
1076 switch (o->op_type) {
1081 if (!(o->op_private & (OPpCONST_ARYBASE)))
1083 if (eval_start && eval_start->op_type == OP_CONST) {
1084 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1088 SAVEI32(compiling.cop_arybase);
1089 compiling.cop_arybase = 0;
1091 else if (type == OP_REFGEN)
1094 croak("That use of $[ is unsupported");
1097 if (o->op_flags & OPf_PARENS)
1101 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1102 !(o->op_flags & OPf_STACKED)) {
1103 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1104 o->op_ppaddr = ppaddr[OP_RV2CV];
1105 assert(cUNOPo->op_first->op_type == OP_NULL);
1106 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1112 /* grep, foreach, subcalls, refgen */
1113 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1115 yyerror(form("Can't modify %s in %s",
1116 op_desc[o->op_type],
1117 type ? op_desc[type] : "local"));
1131 case OP_RIGHT_SHIFT:
1140 if (!(o->op_flags & OPf_STACKED))
1146 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1152 if (!type && cUNOPo->op_first->op_type != OP_GV)
1153 croak("Can't localize through a reference");
1154 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1156 return o; /* Treat \(@foo) like ordinary list. */
1160 if (scalar_mod_type(o, type))
1162 ref(cUNOPo->op_first, o->op_type);
1174 if (!type && cUNOPo->op_first->op_type != OP_GV)
1175 croak("Can't localize through a reference");
1176 ref(cUNOPo->op_first, o->op_type);
1180 hints |= HINT_BLOCK_SCOPE;
1189 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1190 return o; /* Treat \(@foo) like ordinary list. */
1191 if (scalar_mod_type(o, type))
1197 croak("Can't localize lexical variable %s",
1198 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1203 modcount++; /* XXX ??? */
1205 #endif /* USE_THREADS */
1211 if (type != OP_SASSIGN)
1215 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1221 pad_free(o->op_targ);
1222 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1223 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1224 if (o->op_flags & OPf_KIDS)
1225 mod(cBINOPo->op_first->op_sibling, type);
1230 ref(cBINOPo->op_first, o->op_type);
1231 if (type == OP_ENTERSUB &&
1232 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1233 o->op_private |= OPpLVAL_DEFER;
1240 if (o->op_flags & OPf_KIDS)
1241 mod(cLISTOPo->op_last, type);
1245 if (!(o->op_flags & OPf_KIDS))
1247 if (o->op_targ != OP_LIST) {
1248 mod(cBINOPo->op_first, type);
1253 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1257 o->op_flags |= OPf_MOD;
1259 if (type == OP_AASSIGN || type == OP_SASSIGN)
1260 o->op_flags |= OPf_SPECIAL|OPf_REF;
1262 o->op_private |= OPpLVAL_INTRO;
1263 o->op_flags &= ~OPf_SPECIAL;
1264 hints |= HINT_BLOCK_SCOPE;
1266 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1267 o->op_flags |= OPf_REF;
1272 scalar_mod_type(OP *o, I32 type)
1276 if (o->op_type == OP_RV2GV)
1300 case OP_RIGHT_SHIFT:
1310 case OP_ANDASSIGN: /* may work later */
1311 case OP_ORASSIGN: /* may work later */
1319 refkids(OP *o, I32 type)
1322 if (o && o->op_flags & OPf_KIDS) {
1323 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1330 ref(OP *o, I32 type)
1334 if (!o || error_count)
1337 switch (o->op_type) {
1339 if ((type == OP_DEFINED || type == OP_LOCK) &&
1340 !(o->op_flags & OPf_STACKED)) {
1341 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1342 o->op_ppaddr = ppaddr[OP_RV2CV];
1343 assert(cUNOPo->op_first->op_type == OP_NULL);
1344 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1345 o->op_flags |= OPf_SPECIAL;
1350 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1354 ref(cUNOPo->op_first, o->op_type);
1357 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1358 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1359 : type == OP_RV2HV ? OPpDEREF_HV
1361 o->op_flags |= OPf_MOD;
1366 o->op_flags |= OPf_MOD; /* XXX ??? */
1371 o->op_flags |= OPf_REF;
1374 ref(cUNOPo->op_first, o->op_type);
1379 o->op_flags |= OPf_REF;
1384 if (!(o->op_flags & OPf_KIDS))
1386 ref(cBINOPo->op_first, type);
1390 ref(cBINOPo->op_first, o->op_type);
1391 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1392 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1393 : type == OP_RV2HV ? OPpDEREF_HV
1395 o->op_flags |= OPf_MOD;
1403 if (!(o->op_flags & OPf_KIDS))
1405 ref(cLISTOPo->op_last, type);
1420 if (!o || error_count)
1424 if (type == OP_LIST) {
1425 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1427 } else if (type == OP_UNDEF) {
1429 } else if (type != OP_PADSV &&
1432 type != OP_PUSHMARK)
1434 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1437 o->op_flags |= OPf_MOD;
1438 o->op_private |= OPpLVAL_INTRO;
1446 o->op_flags |= OPf_PARENS;
1451 bind_match(I32 type, OP *left, OP *right)
1456 (left->op_type == OP_RV2AV ||
1457 left->op_type == OP_RV2HV ||
1458 left->op_type == OP_PADAV ||
1459 left->op_type == OP_PADHV)) {
1460 char *desc = op_desc[(right->op_type == OP_SUBST ||
1461 right->op_type == OP_TRANS)
1462 ? right->op_type : OP_MATCH];
1463 char *sample = ((left->op_type == OP_RV2AV ||
1464 left->op_type == OP_PADAV)
1465 ? "@array" : "%hash");
1466 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1469 if (right->op_type == OP_MATCH ||
1470 right->op_type == OP_SUBST ||
1471 right->op_type == OP_TRANS) {
1472 right->op_flags |= OPf_STACKED;
1473 if (right->op_type != OP_MATCH)
1474 left = mod(left, right->op_type);
1475 if (right->op_type == OP_TRANS)
1476 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1478 o = prepend_elem(right->op_type, scalar(left), right);
1480 return newUNOP(OP_NOT, 0, scalar(o));
1484 return bind_match(type, left,
1485 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1493 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1494 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1501 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1502 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1503 o->op_type = OP_LEAVE;
1504 o->op_ppaddr = ppaddr[OP_LEAVE];
1507 if (o->op_type == OP_LINESEQ) {
1509 o->op_type = OP_SCOPE;
1510 o->op_ppaddr = ppaddr[OP_SCOPE];
1511 kid = ((LISTOP*)o)->op_first;
1512 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1513 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1518 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1528 SAVESPTR(GvHV(hintgv));
1529 GvHV(hintgv) = newHVhv(GvHV(hintgv));
1530 SAVEFREESV(GvHV(hintgv));
1534 block_start(int full)
1537 int retval = savestack_ix;
1539 SAVEI32(comppad_name_floor);
1541 if ((comppad_name_fill = AvFILLp(comppad_name)) > 0)
1542 comppad_name_floor = comppad_name_fill;
1544 comppad_name_floor = 0;
1546 SAVEI32(min_intro_pending);
1547 SAVEI32(max_intro_pending);
1548 min_intro_pending = 0;
1549 SAVEI32(comppad_name_fill);
1550 SAVEI32(padix_floor);
1551 padix_floor = padix;
1552 pad_reset_pending = FALSE;
1554 hints &= ~HINT_BLOCK_SCOPE;
1559 block_end(I32 floor, OP *seq)
1562 int needblockscope = hints & HINT_BLOCK_SCOPE;
1563 OP* retval = scalarseq(seq);
1565 pad_reset_pending = FALSE;
1567 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1568 pad_leavemy(comppad_name_fill);
1577 OP *o = newOP(OP_THREADSV, 0);
1578 o->op_targ = find_threadsv("_");
1581 return newSVREF(newGVOP(OP_GV, 0, defgv));
1582 #endif /* USE_THREADS */
1590 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1591 eval_start = linklist(eval_root);
1592 eval_root->op_next = 0;
1598 main_root = scope(sawparens(scalarvoid(o)));
1599 curcop = &compiling;
1600 main_start = LINKLIST(main_root);
1601 main_root->op_next = 0;
1605 /* Register with debugger */
1607 CV *cv = perl_get_cv("DB::postponed", FALSE);
1611 XPUSHs((SV*)compiling.cop_filegv);
1613 perl_call_sv((SV*)cv, G_DISCARD);
1620 localize(OP *o, I32 lex)
1622 if (o->op_flags & OPf_PARENS)
1625 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1627 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1628 if (*s == ';' || *s == '=')
1629 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1633 in_my_stash = Nullhv;
1637 return mod(o, OP_NULL); /* a bit kludgey */
1643 if (o->op_type == OP_LIST) {
1646 o2 = newOP(OP_THREADSV, 0);
1647 o2->op_targ = find_threadsv(";");
1649 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1650 #endif /* USE_THREADS */
1651 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1657 fold_constants(register OP *o)
1661 I32 type = o->op_type;
1664 if (opargs[type] & OA_RETSCALAR)
1666 if (opargs[type] & OA_TARGET)
1667 o->op_targ = pad_alloc(type, SVs_PADTMP);
1669 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1670 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1672 if (!(opargs[type] & OA_FOLDCONST))
1687 if (o->op_private & OPpLOCALE)
1692 goto nope; /* Don't try to run w/ errors */
1694 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1695 if (curop->op_type != OP_CONST &&
1696 curop->op_type != OP_LIST &&
1697 curop->op_type != OP_SCALAR &&
1698 curop->op_type != OP_NULL &&
1699 curop->op_type != OP_PUSHMARK) {
1704 curop = LINKLIST(o);
1709 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1710 pad_swipe(o->op_targ);
1711 else if (SvTEMP(sv)) { /* grab mortal temp? */
1712 (void)SvREFCNT_inc(sv);
1716 if (type == OP_RV2GV)
1717 return newGVOP(OP_GV, 0, (GV*)sv);
1719 /* try to smush double to int, but don't smush -2.0 to -2 */
1720 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1724 if ((double)iv == SvNV(sv)) {
1729 SvIOK_off(sv); /* undo SvIV() damage */
1731 return newSVOP(OP_CONST, 0, sv);
1735 if (!(opargs[type] & OA_OTHERINT))
1738 if (!(hints & HINT_INTEGER)) {
1739 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1742 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1743 if (curop->op_type == OP_CONST) {
1744 if (SvIOK(((SVOP*)curop)->op_sv))
1748 if (opargs[curop->op_type] & OA_RETINTEGER)
1752 o->op_ppaddr = ppaddr[++(o->op_type)];
1759 gen_constant_list(register OP *o)
1763 I32 oldtmps_floor = tmps_floor;
1767 return o; /* Don't attempt to run with errors */
1769 op = curop = LINKLIST(o);
1775 tmps_floor = oldtmps_floor;
1777 o->op_type = OP_RV2AV;
1778 o->op_ppaddr = ppaddr[OP_RV2AV];
1779 curop = ((UNOP*)o)->op_first;
1780 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1787 convert(I32 type, I32 flags, OP *o)
1792 if (!o || o->op_type != OP_LIST)
1793 o = newLISTOP(OP_LIST, 0, o, Nullop);
1795 o->op_flags &= ~OPf_WANT;
1797 if (!(opargs[type] & OA_MARK))
1798 null(cLISTOPo->op_first);
1801 o->op_ppaddr = ppaddr[type];
1802 o->op_flags |= flags;
1804 o = CHECKOP(type, o);
1805 if (o->op_type != type)
1808 if (cLISTOPo->op_children < 7) {
1809 /* XXX do we really need to do this if we're done appending?? */
1810 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1812 cLISTOPo->op_last = last; /* in case check substituted last arg */
1815 return fold_constants(o);
1818 /* List constructors */
1821 append_elem(I32 type, OP *first, OP *last)
1829 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1830 return newLISTOP(type, 0, first, last);
1832 if (first->op_flags & OPf_KIDS)
1833 ((LISTOP*)first)->op_last->op_sibling = last;
1835 first->op_flags |= OPf_KIDS;
1836 ((LISTOP*)first)->op_first = last;
1838 ((LISTOP*)first)->op_last = last;
1839 ((LISTOP*)first)->op_children++;
1844 append_list(I32 type, LISTOP *first, LISTOP *last)
1852 if (first->op_type != type)
1853 return prepend_elem(type, (OP*)first, (OP*)last);
1855 if (last->op_type != type)
1856 return append_elem(type, (OP*)first, (OP*)last);
1858 first->op_last->op_sibling = last->op_first;
1859 first->op_last = last->op_last;
1860 first->op_children += last->op_children;
1861 if (first->op_children)
1862 last->op_flags |= OPf_KIDS;
1869 prepend_elem(I32 type, OP *first, OP *last)
1877 if (last->op_type == type) {
1878 if (type == OP_LIST) { /* already a PUSHMARK there */
1879 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1880 ((LISTOP*)last)->op_first->op_sibling = first;
1883 if (!(last->op_flags & OPf_KIDS)) {
1884 ((LISTOP*)last)->op_last = first;
1885 last->op_flags |= OPf_KIDS;
1887 first->op_sibling = ((LISTOP*)last)->op_first;
1888 ((LISTOP*)last)->op_first = first;
1890 ((LISTOP*)last)->op_children++;
1894 return newLISTOP(type, 0, first, last);
1902 return newOP(OP_STUB, 0);
1908 if (!o || o->op_type != OP_LIST)
1909 o = newLISTOP(OP_LIST, 0, o, Nullop);
1915 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1919 Newz(1101, listop, 1, LISTOP);
1921 listop->op_type = type;
1922 listop->op_ppaddr = ppaddr[type];
1923 listop->op_children = (first != 0) + (last != 0);
1924 listop->op_flags = flags;
1928 else if (!first && last)
1931 first->op_sibling = last;
1932 listop->op_first = first;
1933 listop->op_last = last;
1934 if (type == OP_LIST) {
1936 pushop = newOP(OP_PUSHMARK, 0);
1937 pushop->op_sibling = first;
1938 listop->op_first = pushop;
1939 listop->op_flags |= OPf_KIDS;
1941 listop->op_last = pushop;
1943 else if (listop->op_children)
1944 listop->op_flags |= OPf_KIDS;
1950 newOP(I32 type, I32 flags)
1953 Newz(1101, o, 1, OP);
1955 o->op_ppaddr = ppaddr[type];
1956 o->op_flags = flags;
1959 o->op_private = 0 + (flags >> 8);
1960 if (opargs[type] & OA_RETSCALAR)
1962 if (opargs[type] & OA_TARGET)
1963 o->op_targ = pad_alloc(type, SVs_PADTMP);
1964 return CHECKOP(type, o);
1968 newUNOP(I32 type, I32 flags, OP *first)
1973 first = newOP(OP_STUB, 0);
1974 if (opargs[type] & OA_MARK)
1975 first = force_list(first);
1977 Newz(1101, unop, 1, UNOP);
1978 unop->op_type = type;
1979 unop->op_ppaddr = ppaddr[type];
1980 unop->op_first = first;
1981 unop->op_flags = flags | OPf_KIDS;
1982 unop->op_private = 1 | (flags >> 8);
1984 if(type == OP_STUDY && first->op_type == OP_MATCH) {
1985 first->op_type = OP_PUSHRE;
1986 first->op_ppaddr = ppaddr[OP_PUSHRE];
1989 unop = (UNOP*) CHECKOP(type, unop);
1993 return fold_constants((OP *) unop);
1997 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2000 Newz(1101, binop, 1, BINOP);
2003 first = newOP(OP_NULL, 0);
2005 binop->op_type = type;
2006 binop->op_ppaddr = ppaddr[type];
2007 binop->op_first = first;
2008 binop->op_flags = flags | OPf_KIDS;
2011 binop->op_private = 1 | (flags >> 8);
2014 binop->op_private = 2 | (flags >> 8);
2015 first->op_sibling = last;
2018 binop = (BINOP*)CHECKOP(type, binop);
2022 binop->op_last = last = binop->op_first->op_sibling;
2024 return fold_constants((OP *)binop);
2028 pmtrans(OP *o, OP *expr, OP *repl)
2030 SV *tstr = ((SVOP*)expr)->op_sv;
2031 SV *rstr = ((SVOP*)repl)->op_sv;
2034 register U8 *t = (U8*)SvPV(tstr, tlen);
2035 register U8 *r = (U8*)SvPV(rstr, rlen);
2041 register short *tbl;
2043 tbl = (short*)cPVOPo->op_pv;
2044 complement = o->op_private & OPpTRANS_COMPLEMENT;
2045 Delete = o->op_private & OPpTRANS_DELETE;
2046 squash = o->op_private & OPpTRANS_SQUASH;
2049 Zero(tbl, 256, short);
2050 for (i = 0; i < tlen; i++)
2052 for (i = 0, j = 0; i < 256; i++) {
2068 if (!rlen && !Delete) {
2071 o->op_private |= OPpTRANS_COUNTONLY;
2073 for (i = 0; i < 256; i++)
2075 for (i = 0, j = 0; i < tlen; i++,j++) {
2078 if (tbl[t[i]] == -1)
2084 if (tbl[t[i]] == -1)
2095 newPMOP(I32 type, I32 flags)
2100 Newz(1101, pmop, 1, PMOP);
2101 pmop->op_type = type;
2102 pmop->op_ppaddr = ppaddr[type];
2103 pmop->op_flags = flags;
2104 pmop->op_private = 0 | (flags >> 8);
2106 if (hints & HINT_RE_TAINT)
2107 pmop->op_pmpermflags |= PMf_RETAINT;
2108 if (hints & HINT_LOCALE)
2109 pmop->op_pmpermflags |= PMf_LOCALE;
2110 pmop->op_pmflags = pmop->op_pmpermflags;
2112 /* link into pm list */
2113 if (type != OP_TRANS && curstash) {
2114 pmop->op_pmnext = HvPMROOT(curstash);
2115 HvPMROOT(curstash) = pmop;
2122 pmruntime(OP *o, OP *expr, OP *repl)
2127 I32 repl_has_vars = 0;
2129 if (o->op_type == OP_TRANS)
2130 return pmtrans(o, expr, repl);
2132 hints |= HINT_BLOCK_SCOPE;
2135 if (expr->op_type == OP_CONST) {
2137 SV *pat = ((SVOP*)expr)->op_sv;
2138 char *p = SvPV(pat, plen);
2139 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2140 sv_setpvn(pat, "\\s+", 3);
2141 p = SvPV(pat, plen);
2142 pm->op_pmflags |= PMf_SKIPWHITE;
2144 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2145 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2146 pm->op_pmflags |= PMf_WHITE;
2150 if (pm->op_pmflags & PMf_KEEP || !(hints & HINT_RE_EVAL))
2151 expr = newUNOP((!(hints & HINT_RE_EVAL)
2153 : OP_REGCMAYBE),0,expr);
2155 Newz(1101, rcop, 1, LOGOP);
2156 rcop->op_type = OP_REGCOMP;
2157 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2158 rcop->op_first = scalar(expr);
2159 rcop->op_flags |= ((hints & HINT_RE_EVAL)
2160 ? (OPf_SPECIAL | OPf_KIDS)
2162 rcop->op_private = 1;
2165 /* establish postfix order */
2166 if (pm->op_pmflags & PMf_KEEP || !(hints & HINT_RE_EVAL)) {
2168 rcop->op_next = expr;
2169 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2172 rcop->op_next = LINKLIST(expr);
2173 expr->op_next = (OP*)rcop;
2176 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2181 if (pm->op_pmflags & PMf_EVAL)
2184 else if (repl->op_type == OP_THREADSV
2185 && strchr("&`'123456789+",
2186 threadsv_names[repl->op_targ]))
2190 #endif /* USE_THREADS */
2191 else if (repl->op_type == OP_CONST)
2195 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2196 if (opargs[curop->op_type] & OA_DANGEROUS) {
2198 if (curop->op_type == OP_THREADSV) {
2200 if (strchr("&`'123456789+", curop->op_private))
2204 if (curop->op_type == OP_GV) {
2205 GV *gv = ((GVOP*)curop)->op_gv;
2207 if (strchr("&`'123456789+", *GvENAME(gv)))
2210 #endif /* USE_THREADS */
2211 else if (curop->op_type == OP_RV2CV)
2213 else if (curop->op_type == OP_RV2SV ||
2214 curop->op_type == OP_RV2AV ||
2215 curop->op_type == OP_RV2HV ||
2216 curop->op_type == OP_RV2GV) {
2217 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2220 else if (curop->op_type == OP_PADSV ||
2221 curop->op_type == OP_PADAV ||
2222 curop->op_type == OP_PADHV ||
2223 curop->op_type == OP_PADANY) {
2226 else if (curop->op_type == OP_PUSHRE)
2227 ; /* Okay here, dangerous in newASSIGNOP */
2236 && (!pm->op_pmregexp
2237 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2238 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2239 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2240 prepend_elem(o->op_type, scalar(repl), o);
2243 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2244 pm->op_pmflags |= PMf_MAYBE_CONST;
2245 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2247 Newz(1101, rcop, 1, LOGOP);
2248 rcop->op_type = OP_SUBSTCONT;
2249 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2250 rcop->op_first = scalar(repl);
2251 rcop->op_flags |= OPf_KIDS;
2252 rcop->op_private = 1;
2255 /* establish postfix order */
2256 rcop->op_next = LINKLIST(repl);
2257 repl->op_next = (OP*)rcop;
2259 pm->op_pmreplroot = scalar((OP*)rcop);
2260 pm->op_pmreplstart = LINKLIST(rcop);
2269 newSVOP(I32 type, I32 flags, SV *sv)
2272 Newz(1101, svop, 1, SVOP);
2273 svop->op_type = type;
2274 svop->op_ppaddr = ppaddr[type];
2276 svop->op_next = (OP*)svop;
2277 svop->op_flags = flags;
2278 if (opargs[type] & OA_RETSCALAR)
2280 if (opargs[type] & OA_TARGET)
2281 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2282 return CHECKOP(type, svop);
2286 newGVOP(I32 type, I32 flags, GV *gv)
2290 Newz(1101, gvop, 1, GVOP);
2291 gvop->op_type = type;
2292 gvop->op_ppaddr = ppaddr[type];
2293 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2294 gvop->op_next = (OP*)gvop;
2295 gvop->op_flags = flags;
2296 if (opargs[type] & OA_RETSCALAR)
2298 if (opargs[type] & OA_TARGET)
2299 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2300 return CHECKOP(type, gvop);
2304 newPVOP(I32 type, I32 flags, char *pv)
2307 Newz(1101, pvop, 1, PVOP);
2308 pvop->op_type = type;
2309 pvop->op_ppaddr = ppaddr[type];
2311 pvop->op_next = (OP*)pvop;
2312 pvop->op_flags = flags;
2313 if (opargs[type] & OA_RETSCALAR)
2315 if (opargs[type] & OA_TARGET)
2316 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2317 return CHECKOP(type, pvop);
2326 save_hptr(&curstash);
2327 save_item(curstname);
2332 name = SvPV(sv, len);
2333 curstash = gv_stashpvn(name,len,TRUE);
2334 sv_setpvn(curstname, name, len);
2338 sv_setpv(curstname,"<none>");
2346 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2354 if (id->op_type != OP_CONST)
2355 croak("Module name must be constant");
2359 if(version != Nullop) {
2360 SV *vesv = ((SVOP*)version)->op_sv;
2362 if (arg == Nullop && !SvNIOK(vesv)) {
2369 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2370 croak("Version number must be constant number");
2372 /* Make copy of id so we don't free it twice */
2373 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2375 /* Fake up a method call to VERSION */
2376 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2377 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2378 append_elem(OP_LIST,
2379 prepend_elem(OP_LIST, pack, list(version)),
2380 newUNOP(OP_METHOD, 0, meth)));
2384 /* Fake up an import/unimport */
2385 if (arg && arg->op_type == OP_STUB)
2386 imop = arg; /* no import on explicit () */
2387 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2388 imop = Nullop; /* use 5.0; */
2391 /* Make copy of id so we don't free it twice */
2392 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2393 meth = newSVOP(OP_CONST, 0,
2395 ? newSVpv("import", 6)
2396 : newSVpv("unimport", 8)
2398 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2399 append_elem(OP_LIST,
2400 prepend_elem(OP_LIST, pack, list(arg)),
2401 newUNOP(OP_METHOD, 0, meth)));
2404 /* Fake up a require */
2405 rqop = newUNOP(OP_REQUIRE, 0, id);
2407 /* Fake up the BEGIN {}, which does its thing immediately. */
2409 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2411 append_elem(OP_LINESEQ,
2412 append_elem(OP_LINESEQ,
2413 newSTATEOP(0, Nullch, rqop),
2414 newSTATEOP(0, Nullch, veop)),
2415 newSTATEOP(0, Nullch, imop) ));
2422 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2424 return newBINOP(OP_LSLICE, flags,
2425 list(force_list(subscript)),
2426 list(force_list(listval)) );
2430 list_assignment(register OP *o)
2435 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2436 o = cUNOPo->op_first;
2438 if (o->op_type == OP_COND_EXPR) {
2439 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2440 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2445 yyerror("Assignment to both a list and a scalar");
2449 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2450 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2451 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2454 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2457 if (o->op_type == OP_RV2SV)
2464 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2469 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2470 return newLOGOP(optype, 0,
2471 mod(scalar(left), optype),
2472 newUNOP(OP_SASSIGN, 0, scalar(right)));
2475 return newBINOP(optype, OPf_STACKED,
2476 mod(scalar(left), optype), scalar(right));
2480 if (list_assignment(left)) {
2483 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2484 left = mod(left, OP_AASSIGN);
2492 o = newBINOP(OP_AASSIGN, flags,
2493 list(force_list(right)),
2494 list(force_list(left)) );
2495 o->op_private = 0 | (flags >> 8);
2496 if (!(left->op_private & OPpLVAL_INTRO)) {
2500 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2501 if (opargs[curop->op_type] & OA_DANGEROUS) {
2502 if (curop->op_type == OP_GV) {
2503 GV *gv = ((GVOP*)curop)->op_gv;
2504 if (gv == defgv || SvCUR(gv) == generation)
2506 SvCUR(gv) = generation;
2508 else if (curop->op_type == OP_PADSV ||
2509 curop->op_type == OP_PADAV ||
2510 curop->op_type == OP_PADHV ||
2511 curop->op_type == OP_PADANY) {
2512 SV **svp = AvARRAY(comppad_name);
2513 SV *sv = svp[curop->op_targ];
2514 if (SvCUR(sv) == generation)
2516 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2518 else if (curop->op_type == OP_RV2CV)
2520 else if (curop->op_type == OP_RV2SV ||
2521 curop->op_type == OP_RV2AV ||
2522 curop->op_type == OP_RV2HV ||
2523 curop->op_type == OP_RV2GV) {
2524 if (lastop->op_type != OP_GV) /* funny deref? */
2527 else if (curop->op_type == OP_PUSHRE) {
2528 if (((PMOP*)curop)->op_pmreplroot) {
2529 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2530 if (gv == defgv || SvCUR(gv) == generation)
2532 SvCUR(gv) = generation;
2541 o->op_private = OPpASSIGN_COMMON;
2543 if (right && right->op_type == OP_SPLIT) {
2545 if ((tmpop = ((LISTOP*)right)->op_first) &&
2546 tmpop->op_type == OP_PUSHRE)
2548 PMOP *pm = (PMOP*)tmpop;
2549 if (left->op_type == OP_RV2AV &&
2550 !(left->op_private & OPpLVAL_INTRO) &&
2551 !(o->op_private & OPpASSIGN_COMMON) )
2553 tmpop = ((UNOP*)left)->op_first;
2554 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2555 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2556 pm->op_pmflags |= PMf_ONCE;
2557 tmpop = cUNOPo->op_first; /* to list (nulled) */
2558 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2559 tmpop->op_sibling = Nullop; /* don't free split */
2560 right->op_next = tmpop->op_next; /* fix starting loc */
2561 op_free(o); /* blow off assign */
2562 right->op_flags &= ~OPf_WANT;
2563 /* "I don't know and I don't care." */
2568 if (modcount < 10000 &&
2569 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2571 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2573 sv_setiv(sv, modcount+1);
2581 right = newOP(OP_UNDEF, 0);
2582 if (right->op_type == OP_READLINE) {
2583 right->op_flags |= OPf_STACKED;
2584 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2587 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2588 o = newBINOP(OP_SASSIGN, flags,
2589 scalar(right), mod(scalar(left), OP_SASSIGN) );
2601 newSTATEOP(I32 flags, char *label, OP *o)
2604 U32 seq = intro_my();
2607 Newz(1101, cop, 1, COP);
2608 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2609 cop->op_type = OP_DBSTATE;
2610 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2613 cop->op_type = OP_NEXTSTATE;
2614 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2616 cop->op_flags = flags;
2617 cop->op_private = 0 | (flags >> 8);
2619 cop->op_private |= NATIVE_HINTS;
2621 cop->op_next = (OP*)cop;
2624 cop->cop_label = label;
2625 hints |= HINT_BLOCK_SCOPE;
2628 cop->cop_arybase = curcop->cop_arybase;
2630 if (copline == NOLINE)
2631 cop->cop_line = curcop->cop_line;
2633 cop->cop_line = copline;
2636 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2637 cop->cop_stash = curstash;
2639 if (PERLDB_LINE && curstash != debstash) {
2640 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2641 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2642 (void)SvIOK_on(*svp);
2644 SvSTASH(*svp) = (HV*)cop;
2648 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2651 /* "Introduce" my variables to visible status. */
2659 if (! min_intro_pending)
2662 svp = AvARRAY(comppad_name);
2663 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2664 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2665 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2666 SvNVX(sv) = (double)cop_seqmax;
2669 min_intro_pending = 0;
2670 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2671 return cop_seqmax++;
2675 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2677 return new_logop(type, flags, &first, &other);
2681 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2686 OP *first = *firstp;
2687 OP *other = *otherp;
2689 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2690 return newBINOP(type, flags, scalar(first), scalar(other));
2692 scalarboolean(first);
2693 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2694 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2695 if (type == OP_AND || type == OP_OR) {
2701 first = *firstp = cUNOPo->op_first;
2703 first->op_next = o->op_next;
2704 cUNOPo->op_first = Nullop;
2708 if (first->op_type == OP_CONST) {
2709 if (dowarn && (first->op_private & OPpCONST_BARE))
2710 warn("Probable precedence problem on %s", op_desc[type]);
2711 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2722 else if (first->op_type == OP_WANTARRAY) {
2728 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2729 OP *k1 = ((UNOP*)first)->op_first;
2730 OP *k2 = k1->op_sibling;
2732 switch (first->op_type)
2735 if (k2 && k2->op_type == OP_READLINE
2736 && (k2->op_flags & OPf_STACKED)
2737 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2738 warnop = k2->op_type;
2742 if (k1->op_type == OP_READDIR
2743 || k1->op_type == OP_GLOB
2744 || k1->op_type == OP_EACH)
2745 warnop = k1->op_type;
2749 line_t oldline = curcop->cop_line;
2750 curcop->cop_line = copline;
2751 warn("Value of %s%s can be \"0\"; test with defined()",
2753 ((warnop == OP_READLINE || warnop == OP_GLOB)
2754 ? " construct" : "() operator"));
2755 curcop->cop_line = oldline;
2762 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2763 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2765 Newz(1101, logop, 1, LOGOP);
2767 logop->op_type = type;
2768 logop->op_ppaddr = ppaddr[type];
2769 logop->op_first = first;
2770 logop->op_flags = flags | OPf_KIDS;
2771 logop->op_other = LINKLIST(other);
2772 logop->op_private = 1 | (flags >> 8);
2774 /* establish postfix order */
2775 logop->op_next = LINKLIST(first);
2776 first->op_next = (OP*)logop;
2777 first->op_sibling = other;
2779 o = newUNOP(OP_NULL, 0, (OP*)logop);
2786 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2793 return newLOGOP(OP_AND, 0, first, trueop);
2795 return newLOGOP(OP_OR, 0, first, falseop);
2797 scalarboolean(first);
2798 if (first->op_type == OP_CONST) {
2799 if (SvTRUE(((SVOP*)first)->op_sv)) {
2810 else if (first->op_type == OP_WANTARRAY) {
2814 Newz(1101, condop, 1, CONDOP);
2816 condop->op_type = OP_COND_EXPR;
2817 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2818 condop->op_first = first;
2819 condop->op_flags = flags | OPf_KIDS;
2820 condop->op_true = LINKLIST(trueop);
2821 condop->op_false = LINKLIST(falseop);
2822 condop->op_private = 1 | (flags >> 8);
2824 /* establish postfix order */
2825 condop->op_next = LINKLIST(first);
2826 first->op_next = (OP*)condop;
2828 first->op_sibling = trueop;
2829 trueop->op_sibling = falseop;
2830 o = newUNOP(OP_NULL, 0, (OP*)condop);
2832 trueop->op_next = o;
2833 falseop->op_next = o;
2839 newRANGE(I32 flags, OP *left, OP *right)
2847 Newz(1101, condop, 1, CONDOP);
2849 condop->op_type = OP_RANGE;
2850 condop->op_ppaddr = ppaddr[OP_RANGE];
2851 condop->op_first = left;
2852 condop->op_flags = OPf_KIDS;
2853 condop->op_true = LINKLIST(left);
2854 condop->op_false = LINKLIST(right);
2855 condop->op_private = 1 | (flags >> 8);
2857 left->op_sibling = right;
2859 condop->op_next = (OP*)condop;
2860 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2861 flop = newUNOP(OP_FLOP, 0, flip);
2862 o = newUNOP(OP_NULL, 0, flop);
2865 left->op_next = flip;
2866 right->op_next = flop;
2868 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2869 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2870 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2871 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2873 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2874 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2877 if (!flip->op_private || !flop->op_private)
2878 linklist(o); /* blow off optimizer unless constant */
2884 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2889 int once = block && block->op_flags & OPf_SPECIAL &&
2890 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2893 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2894 return block; /* do {} while 0 does once */
2895 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2896 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2897 expr = newUNOP(OP_DEFINED, 0,
2898 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2899 } else if (expr->op_flags & OPf_KIDS) {
2900 OP *k1 = ((UNOP*)expr)->op_first;
2901 OP *k2 = (k1) ? k1->op_sibling : NULL;
2902 switch (expr->op_type) {
2904 if (k2 && k2->op_type == OP_READLINE
2905 && (k2->op_flags & OPf_STACKED)
2906 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2907 expr = newUNOP(OP_DEFINED, 0, expr);
2911 if (k1->op_type == OP_READDIR
2912 || k1->op_type == OP_GLOB
2913 || k1->op_type == OP_EACH)
2914 expr = newUNOP(OP_DEFINED, 0, expr);
2920 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2921 o = new_logop(OP_AND, 0, &expr, &listop);
2924 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2926 if (once && o != listop)
2927 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2930 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2932 o->op_flags |= flags;
2934 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2939 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2948 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2949 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2950 expr = newUNOP(OP_DEFINED, 0,
2951 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2952 } else if (expr && (expr->op_flags & OPf_KIDS)) {
2953 OP *k1 = ((UNOP*)expr)->op_first;
2954 OP *k2 = (k1) ? k1->op_sibling : NULL;
2955 switch (expr->op_type) {
2957 if (k2 && k2->op_type == OP_READLINE
2958 && (k2->op_flags & OPf_STACKED)
2959 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2960 expr = newUNOP(OP_DEFINED, 0, expr);
2964 if (k1->op_type == OP_READDIR
2965 || k1->op_type == OP_GLOB
2966 || k1->op_type == OP_EACH)
2967 expr = newUNOP(OP_DEFINED, 0, expr);
2973 block = newOP(OP_NULL, 0);
2976 next = LINKLIST(cont);
2978 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2979 if ((line_t)whileline != NOLINE) {
2980 copline = whileline;
2981 cont = append_elem(OP_LINESEQ, cont,
2982 newSTATEOP(0, Nullch, Nullop));
2986 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2987 redo = LINKLIST(listop);
2990 copline = whileline;
2992 o = new_logop(OP_AND, 0, &expr, &listop);
2993 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2994 op_free(expr); /* oops, it's a while (0) */
2996 return Nullop; /* listop already freed by new_logop */
2999 ((LISTOP*)listop)->op_last->op_next = condop =
3000 (o == listop ? redo : LINKLIST(o));
3008 Newz(1101,loop,1,LOOP);
3009 loop->op_type = OP_ENTERLOOP;
3010 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
3011 loop->op_private = 0;
3012 loop->op_next = (OP*)loop;
3015 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3017 loop->op_redoop = redo;
3018 loop->op_lastop = o;
3021 loop->op_nextop = next;
3023 loop->op_nextop = o;
3025 o->op_flags |= flags;
3026 o->op_private |= (flags >> 8);
3031 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3039 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3040 sv->op_type = OP_RV2GV;
3041 sv->op_ppaddr = ppaddr[OP_RV2GV];
3043 else if (sv->op_type == OP_PADSV) { /* private variable */
3044 padoff = sv->op_targ;
3048 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3049 padoff = sv->op_targ;
3050 iterflags |= OPf_SPECIAL;
3055 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3059 padoff = find_threadsv("_");
3060 iterflags |= OPf_SPECIAL;
3062 sv = newGVOP(OP_GV, 0, defgv);
3065 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3066 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3067 iterflags |= OPf_STACKED;
3069 else if (expr->op_type == OP_NULL &&
3070 (expr->op_flags & OPf_KIDS) &&
3071 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3073 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3074 * set the STACKED flag to indicate that these values are to be
3075 * treated as min/max values by 'pp_iterinit'.
3077 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3078 CONDOP* range = (CONDOP*) flip->op_first;
3079 OP* left = range->op_first;
3080 OP* right = left->op_sibling;
3083 range->op_flags &= ~OPf_KIDS;
3084 range->op_first = Nullop;
3086 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3087 listop->op_first->op_next = range->op_true;
3088 left->op_next = range->op_false;
3089 right->op_next = (OP*)listop;
3090 listop->op_next = listop->op_first;
3093 expr = (OP*)(listop);
3095 iterflags |= OPf_STACKED;
3098 expr = mod(force_list(expr), OP_GREPSTART);
3102 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3103 append_elem(OP_LIST, expr, scalar(sv))));
3104 assert(!loop->op_next);
3105 Renew(loop, 1, LOOP);
3106 loop->op_targ = padoff;
3107 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3109 return newSTATEOP(0, label, wop);
3113 newLOOPEX(I32 type, OP *label)
3117 if (type != OP_GOTO || label->op_type == OP_CONST) {
3118 /* "last()" means "last" */
3119 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3120 o = newOP(type, OPf_SPECIAL);
3122 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3123 ? SvPVx(((SVOP*)label)->op_sv, na)
3129 if (label->op_type == OP_ENTERSUB)
3130 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3131 o = newUNOP(type, OPf_STACKED, label);
3133 hints |= HINT_BLOCK_SCOPE;
3143 MUTEX_DESTROY(CvMUTEXP(cv));
3144 Safefree(CvMUTEXP(cv));
3147 #endif /* USE_THREADS */
3149 if (!CvXSUB(cv) && CvROOT(cv)) {
3151 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3152 croak("Can't undef active subroutine");
3155 croak("Can't undef active subroutine");
3156 #endif /* USE_THREADS */
3163 op_free(CvROOT(cv));
3164 CvROOT(cv) = Nullop;
3167 SvPOK_off((SV*)cv); /* forget prototype */
3169 SvREFCNT_dec(CvGV(cv));
3171 SvREFCNT_dec(CvOUTSIDE(cv));
3172 CvOUTSIDE(cv) = Nullcv;
3173 if (CvPADLIST(cv)) {
3174 /* may be during global destruction */
3175 if (SvREFCNT(CvPADLIST(cv))) {
3176 I32 i = AvFILLp(CvPADLIST(cv));
3178 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3179 SV* sv = svp ? *svp : Nullsv;
3182 if (sv == (SV*)comppad_name)
3183 comppad_name = Nullav;
3184 else if (sv == (SV*)comppad) {
3186 curpad = Null(SV**);
3190 SvREFCNT_dec((SV*)CvPADLIST(cv));
3192 CvPADLIST(cv) = Nullav;
3196 #ifdef DEBUG_CLOSURES
3201 CV *outside = CvOUTSIDE(cv);
3202 AV* padlist = CvPADLIST(cv);
3209 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3211 (CvANON(cv) ? "ANON"
3212 : (cv == main_cv) ? "MAIN"
3213 : CvUNIQUE(outside) ? "UNIQUE"
3214 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3217 : CvANON(outside) ? "ANON"
3218 : (outside == main_cv) ? "MAIN"
3219 : CvUNIQUE(outside) ? "UNIQUE"
3220 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3225 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3226 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3227 pname = AvARRAY(pad_name);
3228 ppad = AvARRAY(pad);
3230 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3231 if (SvPOK(pname[ix]))
3232 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3234 SvFAKE(pname[ix]) ? "FAKE " : "",
3236 (long)I_32(SvNVX(pname[ix])),
3237 (long)SvIVX(pname[ix]));
3240 #endif /* DEBUG_CLOSURES */
3243 cv_clone2(CV *proto, CV *outside)
3248 AV* protopadlist = CvPADLIST(proto);
3249 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3250 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3251 SV** pname = AvARRAY(protopad_name);
3252 SV** ppad = AvARRAY(protopad);
3253 I32 fname = AvFILLp(protopad_name);
3254 I32 fpad = AvFILLp(protopad);
3258 assert(!CvUNIQUE(proto));
3263 SAVESPTR(comppad_name);
3266 cv = compcv = (CV*)NEWSV(1104,0);
3267 sv_upgrade((SV *)cv, SvTYPE(proto));
3273 New(666, CvMUTEXP(cv), 1, perl_mutex);
3274 MUTEX_INIT(CvMUTEXP(cv));
3276 #endif /* USE_THREADS */
3277 CvFILEGV(cv) = CvFILEGV(proto);
3278 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3279 CvSTASH(cv) = CvSTASH(proto);
3280 CvROOT(cv) = CvROOT(proto);
3281 CvSTART(cv) = CvSTART(proto);
3283 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3286 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3288 comppad_name = newAV();
3289 for (ix = fname; ix >= 0; ix--)
3290 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3294 comppadlist = newAV();
3295 AvREAL_off(comppadlist);
3296 av_store(comppadlist, 0, (SV*)comppad_name);
3297 av_store(comppadlist, 1, (SV*)comppad);
3298 CvPADLIST(cv) = comppadlist;
3299 av_fill(comppad, AvFILLp(protopad));
3300 curpad = AvARRAY(comppad);
3302 av = newAV(); /* will be @_ */
3304 av_store(comppad, 0, (SV*)av);
3305 AvFLAGS(av) = AVf_REIFY;
3307 for (ix = fpad; ix > 0; ix--) {
3308 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3309 if (namesv && namesv != &sv_undef) {
3310 char *name = SvPVX(namesv); /* XXX */
3311 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3312 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3313 CvOUTSIDE(cv), cxstack_ix);
3315 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3317 croak("panic: cv_clone: %s", name);
3319 else { /* our own lexical */
3322 /* anon code -- we'll come back for it */
3323 sv = SvREFCNT_inc(ppad[ix]);
3325 else if (*name == '@')
3327 else if (*name == '%')
3337 SV* sv = NEWSV(0,0);
3343 /* Now that vars are all in place, clone nested closures. */
3345 for (ix = fpad; ix > 0; ix--) {
3346 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3348 && namesv != &sv_undef
3349 && !(SvFLAGS(namesv) & SVf_FAKE)
3350 && *SvPVX(namesv) == '&'
3351 && CvCLONE(ppad[ix]))
3353 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3354 SvREFCNT_dec(ppad[ix]);
3357 curpad[ix] = (SV*)kid;
3361 #ifdef DEBUG_CLOSURES
3362 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3364 PerlIO_printf(Perl_debug_log, " from:\n");
3366 PerlIO_printf(Perl_debug_log, " to:\n");
3377 return cv_clone2(proto, CvOUTSIDE(proto));
3381 cv_ckproto(CV *cv, GV *gv, char *p)
3383 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3384 SV* msg = sv_newmortal();
3388 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3389 sv_setpv(msg, "Prototype mismatch:");
3391 sv_catpvf(msg, " sub %_", name);
3393 sv_catpvf(msg, " (%s)", SvPVX(cv));
3394 sv_catpv(msg, " vs ");
3396 sv_catpvf(msg, "(%s)", p);
3398 sv_catpv(msg, "none");
3406 if (!cv || !SvPOK(cv) || SvCUR(cv))
3408 return op_const_sv(CvSTART(cv), cv);
3412 op_const_sv(OP *o, CV *cv)
3419 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3420 o = cLISTOPo->op_first->op_sibling;
3422 for (; o; o = o->op_next) {
3423 OPCODE type = o->op_type;
3425 if(sv && o->op_next == o)
3427 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3429 if (type == OP_LEAVESUB || type == OP_RETURN)
3433 if (type == OP_CONST)
3435 else if (type == OP_PADSV && cv) {
3436 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3437 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3438 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3450 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3453 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3454 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3455 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3456 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3465 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3466 maximum a prototype before. */
3467 if (SvTYPE(gv) > SVt_NULL) {
3468 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3469 warn("Runaway prototype");
3470 cv_ckproto((CV*)gv, NULL, ps);
3473 sv_setpv((SV*)gv, ps);
3475 sv_setiv((SV*)gv, -1);
3476 SvREFCNT_dec(compcv);
3482 if (!name || GvCVGEN(gv))
3484 else if (cv = GvCV(gv)) {
3485 cv_ckproto(cv, gv, ps);
3486 /* already defined (or promised)? */
3487 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3489 bool const_changed = TRUE;
3491 /* just a "sub foo;" when &foo is already defined */
3495 /* ahem, death to those who redefine active sort subs */
3496 if (curstackinfo->si_type == PERLSI_SORT && sortcop == CvSTART(cv))
3497 croak("Can't redefine active sort subroutine %s", name);
3498 if(const_sv = cv_const_sv(cv))
3499 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3500 if ((const_sv && const_changed) || dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3501 && HvNAME(GvSTASH(CvGV(cv)))
3502 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3504 line_t oldline = curcop->cop_line;
3505 curcop->cop_line = copline;
3506 warn(const_sv ? "Constant subroutine %s redefined"
3507 : "Subroutine %s redefined", name);
3508 curcop->cop_line = oldline;
3514 if (cv) { /* must reuse cv if autoloaded */
3516 CvFLAGS(cv) = CvFLAGS(compcv);
3517 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3518 CvOUTSIDE(compcv) = 0;
3519 CvPADLIST(cv) = CvPADLIST(compcv);
3520 CvPADLIST(compcv) = 0;
3521 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3522 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3523 SvREFCNT_dec(compcv);
3533 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3534 CvFILEGV(cv) = curcop->cop_filegv;
3535 CvSTASH(cv) = curstash;
3538 New(666, CvMUTEXP(cv), 1, perl_mutex);
3539 MUTEX_INIT(CvMUTEXP(cv));
3540 #endif /* USE_THREADS */
3543 sv_setpv((SV*)cv, ps);
3549 char *s = strrchr(name, ':');
3551 if (strEQ(s, "BEGIN")) {
3553 "BEGIN not safe after errors--compilation aborted";
3557 /* force display of errors found but not reported */
3558 sv_catpv(ERRSV, not_safe);
3559 croak("%s", SvPVx(ERRSV, na));
3571 if (AvFILLp(comppad_name) < AvFILLp(comppad))
3572 av_store(comppad_name, AvFILLp(comppad), Nullsv);
3575 SV **namep = AvARRAY(comppad_name);
3576 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3579 if (SvIMMORTAL(curpad[ix]))
3582 * The only things that a clonable function needs in its
3583 * pad are references to outer lexicals and anonymous subs.
3584 * The rest are created anew during cloning.
3586 if (!((namesv = namep[ix]) != Nullsv &&
3587 namesv != &sv_undef &&
3589 *SvPVX(namesv) == '&')))
3591 SvREFCNT_dec(curpad[ix]);
3592 curpad[ix] = Nullsv;
3597 AV *av = newAV(); /* Will be @_ */
3599 av_store(comppad, 0, (SV*)av);
3600 AvFLAGS(av) = AVf_REIFY;
3602 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3603 if (SvIMMORTAL(curpad[ix]))
3605 if (!SvPADMY(curpad[ix]))
3606 SvPADTMP_on(curpad[ix]);
3610 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3611 CvSTART(cv) = LINKLIST(CvROOT(cv));
3612 CvROOT(cv)->op_next = 0;
3618 if (PERLDB_SUBLINE && curstash != debstash) {
3619 SV *sv = NEWSV(0,0);
3620 SV *tmpstr = sv_newmortal();
3621 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3625 sv_setpvf(sv, "%_:%ld-%ld",
3626 GvSV(curcop->cop_filegv),
3627 (long)subline, (long)curcop->cop_line);
3628 gv_efullname3(tmpstr, gv, Nullch);
3629 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3630 hv = GvHVn(db_postponed);
3631 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3632 && (cv = GvCV(db_postponed))) {
3637 perl_call_sv((SV*)cv, G_DISCARD);
3641 if ((s = strrchr(name,':')))
3645 if (strEQ(s, "BEGIN")) {
3646 I32 oldscope = scopestack_ix;
3648 SAVESPTR(compiling.cop_filegv);
3649 SAVEI16(compiling.cop_line);
3655 DEBUG_x( dump_sub(gv) );
3656 av_push(beginav, (SV *)cv);
3658 call_list(oldscope, beginav);
3660 curcop = &compiling;
3663 else if (strEQ(s, "END") && !error_count) {
3666 av_unshift(endav, 1);
3667 av_store(endav, 0, (SV *)cv);
3670 else if (strEQ(s, "INIT") && !error_count) {
3673 av_push(initav, SvREFCNT_inc(cv));
3684 newCONSTSUB(HV *stash, char *name, SV *sv)
3687 U32 oldhints = hints;
3688 HV *old_cop_stash = curcop->cop_stash;
3689 HV *old_curstash = curstash;
3690 line_t oldline = curcop->cop_line;
3691 curcop->cop_line = copline;
3693 hints &= ~HINT_BLOCK_SCOPE;
3695 curstash = curcop->cop_stash = stash;
3698 start_subparse(FALSE, 0),
3699 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3700 newSVOP(OP_CONST, 0, &sv_no), /* SvPV(&sv_no) == "" -- GMB */
3701 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3705 curcop->cop_stash = old_cop_stash;
3706 curstash = old_curstash;
3707 curcop->cop_line = oldline;
3711 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3714 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3717 if (cv = (name ? GvCV(gv) : Nullcv)) {
3719 /* just a cached method */
3723 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3724 /* already defined (or promised) */
3725 if (dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3726 && HvNAME(GvSTASH(CvGV(cv)))
3727 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3728 line_t oldline = curcop->cop_line;
3729 curcop->cop_line = copline;
3730 warn("Subroutine %s redefined",name);
3731 curcop->cop_line = oldline;
3738 if (cv) /* must reuse cv if autoloaded */
3741 cv = (CV*)NEWSV(1105,0);
3742 sv_upgrade((SV *)cv, SVt_PVCV);
3749 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3751 New(666, CvMUTEXP(cv), 1, perl_mutex);
3752 MUTEX_INIT(CvMUTEXP(cv));
3754 #endif /* USE_THREADS */
3755 CvFILEGV(cv) = gv_fetchfile(filename);
3756 CvXSUB(cv) = subaddr;
3759 char *s = strrchr(name,':');
3764 if (strEQ(s, "BEGIN")) {
3767 av_push(beginav, (SV *)cv);
3770 else if (strEQ(s, "END")) {
3773 av_unshift(endav, 1);
3774 av_store(endav, 0, (SV *)cv);
3777 else if (strEQ(s, "INIT")) {
3780 av_push(initav, (SV *)cv);
3790 newFORM(I32 floor, OP *o, OP *block)
3799 name = SvPVx(cSVOPo->op_sv, na);
3802 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3804 if (cv = GvFORM(gv)) {
3806 line_t oldline = curcop->cop_line;
3808 curcop->cop_line = copline;
3809 warn("Format %s redefined",name);
3810 curcop->cop_line = oldline;
3816 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3817 CvFILEGV(cv) = curcop->cop_filegv;
3819 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3820 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3821 SvPADTMP_on(curpad[ix]);
3824 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3825 CvSTART(cv) = LINKLIST(CvROOT(cv));
3826 CvROOT(cv)->op_next = 0;
3836 return newUNOP(OP_REFGEN, 0,
3837 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3843 return newUNOP(OP_REFGEN, 0,
3844 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3848 newANONSUB(I32 floor, OP *proto, OP *block)
3850 return newUNOP(OP_REFGEN, 0,
3851 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3857 switch (o->op_type) {
3859 o->op_type = OP_PADAV;
3860 o->op_ppaddr = ppaddr[OP_PADAV];
3861 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3864 o->op_type = OP_RV2AV;
3865 o->op_ppaddr = ppaddr[OP_RV2AV];
3870 warn("oops: oopsAV");
3879 switch (o->op_type) {
3882 o->op_type = OP_PADHV;
3883 o->op_ppaddr = ppaddr[OP_PADHV];
3884 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3888 o->op_type = OP_RV2HV;
3889 o->op_ppaddr = ppaddr[OP_RV2HV];
3894 warn("oops: oopsHV");
3903 if (o->op_type == OP_PADANY) {
3904 o->op_type = OP_PADAV;
3905 o->op_ppaddr = ppaddr[OP_PADAV];
3908 return newUNOP(OP_RV2AV, 0, scalar(o));
3912 newGVREF(I32 type, OP *o)
3914 if (type == OP_MAPSTART)
3915 return newUNOP(OP_NULL, 0, o);
3916 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3922 if (o->op_type == OP_PADANY) {
3923 o->op_type = OP_PADHV;
3924 o->op_ppaddr = ppaddr[OP_PADHV];
3927 return newUNOP(OP_RV2HV, 0, scalar(o));
3933 croak("NOT IMPL LINE %d",__LINE__);
3939 newCVREF(I32 flags, OP *o)
3941 return newUNOP(OP_RV2CV, flags, scalar(o));
3947 if (o->op_type == OP_PADANY) {
3948 o->op_type = OP_PADSV;
3949 o->op_ppaddr = ppaddr[OP_PADSV];
3952 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3953 o->op_flags |= OPpDONE_SVREF;
3956 return newUNOP(OP_RV2SV, 0, scalar(o));
3959 /* Check routines. */
3967 name = NEWSV(1106,0);
3968 sv_upgrade(name, SVt_PVNV);
3969 sv_setpvn(name, "&", 1);
3972 ix = pad_alloc(o->op_type, SVs_PADMY);
3973 av_store(comppad_name, ix, name);
3974 av_store(comppad, ix, cSVOPo->op_sv);
3975 SvPADMY_on(cSVOPo->op_sv);
3976 cSVOPo->op_sv = Nullsv;
3977 cSVOPo->op_targ = ix;
3984 o->op_private = hints;
3991 if (cUNOPo->op_first->op_type == OP_CONCAT)
3992 o->op_flags |= OPf_STACKED;
3999 if (o->op_flags & OPf_KIDS) {
4002 OPCODE type = o->op_type;
4003 o = modkids(ck_fun(o), type);
4004 kid = cUNOPo->op_first;
4005 newop = kUNOP->op_first->op_sibling;
4007 (newop->op_sibling ||
4008 !(opargs[newop->op_type] & OA_RETSCALAR) ||
4009 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4010 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4014 op_free(kUNOP->op_first);
4015 kUNOP->op_first = newop;
4017 o->op_ppaddr = ppaddr[++o->op_type];
4026 if (o->op_flags & OPf_KIDS) {
4027 OP *kid = cUNOPo->op_first;
4028 if (kid->op_type == OP_HSLICE)
4029 o->op_private |= OPpSLICE;
4030 else if (kid->op_type != OP_HELEM)
4031 croak("%s argument is not a HASH element or slice",
4032 op_desc[o->op_type]);
4041 I32 type = o->op_type;
4043 if (o->op_flags & OPf_KIDS) {
4044 if (cLISTOPo->op_first->op_type == OP_STUB) {
4046 o = newUNOP(type, OPf_SPECIAL,
4047 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4057 hints |= HINT_BLOCK_SCOPE;
4058 if (o->op_flags & OPf_KIDS) {
4059 SVOP *kid = (SVOP*)cUNOPo->op_first;
4062 o->op_flags &= ~OPf_KIDS;
4065 else if (kid->op_type == OP_LINESEQ) {
4068 kid->op_next = o->op_next;
4069 cUNOPo->op_first = 0;
4072 Newz(1101, enter, 1, LOGOP);
4073 enter->op_type = OP_ENTERTRY;
4074 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4075 enter->op_private = 0;
4077 /* establish postfix order */
4078 enter->op_next = (OP*)enter;
4080 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4081 o->op_type = OP_LEAVETRY;
4082 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4083 enter->op_other = o;
4091 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4093 o->op_targ = (PADOFFSET)hints;
4101 if (o->op_flags & OPf_STACKED) {
4103 kid = cUNOPo->op_first->op_sibling;
4104 if (kid->op_type == OP_RV2GV)
4116 if (o->op_flags & OPf_KIDS) {
4117 OP *kid = cUNOPo->op_first;
4118 if (kid->op_type != OP_HELEM)
4119 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4126 ck_gvconst(register OP *o)
4128 o = fold_constants(o);
4129 if (o->op_type == OP_CONST)
4135 ck_rvconst(register OP *o)
4138 SVOP *kid = (SVOP*)cUNOPo->op_first;
4140 o->op_private |= (hints & HINT_STRICT_REFS);
4141 if (kid->op_type == OP_CONST) {
4146 name = SvPV(kid->op_sv, na);
4147 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4148 char *badthing = Nullch;
4149 switch (o->op_type) {
4151 badthing = "a SCALAR";
4154 badthing = "an ARRAY";
4157 badthing = "a HASH";
4162 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4166 * This is a little tricky. We only want to add the symbol if we
4167 * didn't add it in the lexer. Otherwise we get duplicate strict
4168 * warnings. But if we didn't add it in the lexer, we must at
4169 * least pretend like we wanted to add it even if it existed before,
4170 * or we get possible typo warnings. OPpCONST_ENTERED says
4171 * whether the lexer already added THIS instance of this symbol.
4173 iscv = (o->op_type == OP_RV2CV) * 2;
4175 gv = gv_fetchpv(name,
4176 iscv | !(kid->op_private & OPpCONST_ENTERED),
4179 : o->op_type == OP_RV2SV
4181 : o->op_type == OP_RV2AV
4183 : o->op_type == OP_RV2HV
4186 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4188 kid->op_type = OP_GV;
4189 SvREFCNT_dec(kid->op_sv);
4190 kid->op_sv = SvREFCNT_inc(gv);
4200 I32 type = o->op_type;
4202 if (o->op_flags & OPf_REF)
4205 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4206 SVOP *kid = (SVOP*)cUNOPo->op_first;
4208 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4209 OP *newop = newGVOP(type, OPf_REF,
4210 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4217 if (type == OP_FTTTY)
4218 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4221 return newUNOP(type, 0, newDEFSVOP());
4234 int type = o->op_type;
4235 register I32 oa = opargs[type] >> OASHIFT;
4237 if (o->op_flags & OPf_STACKED) {
4238 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4241 return no_fh_allowed(o);
4244 if (o->op_flags & OPf_KIDS) {
4245 tokid = &cLISTOPo->op_first;
4246 kid = cLISTOPo->op_first;
4247 if (kid->op_type == OP_PUSHMARK ||
4248 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4250 tokid = &kid->op_sibling;
4251 kid = kid->op_sibling;
4253 if (!kid && opargs[type] & OA_DEFGV)
4254 *tokid = kid = newDEFSVOP();
4258 sibl = kid->op_sibling;
4272 if (kid->op_type == OP_CONST &&
4273 (kid->op_private & OPpCONST_BARE)) {
4274 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4275 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4276 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4278 warn("Array @%s missing the @ in argument %ld of %s()",
4279 name, (long)numargs, op_desc[type]);
4282 kid->op_sibling = sibl;
4285 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4286 bad_type(numargs, "array", op_desc[o->op_type], kid);
4290 if (kid->op_type == OP_CONST &&
4291 (kid->op_private & OPpCONST_BARE)) {
4292 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4293 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4294 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4296 warn("Hash %%%s missing the %% in argument %ld of %s()",
4297 name, (long)numargs, op_desc[type]);
4300 kid->op_sibling = sibl;
4303 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4304 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4309 OP *newop = newUNOP(OP_NULL, 0, kid);
4310 kid->op_sibling = 0;
4312 newop->op_next = newop;
4314 kid->op_sibling = sibl;
4319 if (kid->op_type != OP_GV) {
4320 if (kid->op_type == OP_CONST &&
4321 (kid->op_private & OPpCONST_BARE)) {
4322 OP *newop = newGVOP(OP_GV, 0,
4323 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4329 kid->op_sibling = 0;
4330 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4332 kid->op_sibling = sibl;
4338 mod(scalar(kid), type);
4342 tokid = &kid->op_sibling;
4343 kid = kid->op_sibling;
4345 o->op_private |= numargs;
4347 return too_many_arguments(o,op_desc[o->op_type]);
4350 else if (opargs[type] & OA_DEFGV) {
4352 return newUNOP(type, 0, newDEFSVOP());
4356 while (oa & OA_OPTIONAL)
4358 if (oa && oa != OA_LIST)
4359 return too_few_arguments(o,op_desc[o->op_type]);
4369 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4370 append_elem(OP_GLOB, o, newDEFSVOP());
4372 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4373 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4375 if (gv && GvIMPORTED_CV(gv)) {
4376 static int glob_index;
4378 append_elem(OP_GLOB, o,
4379 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4380 o->op_type = OP_LIST;
4381 o->op_ppaddr = ppaddr[OP_LIST];
4382 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4383 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4384 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4385 append_elem(OP_LIST, o,
4386 scalar(newUNOP(OP_RV2CV, 0,
4387 newGVOP(OP_GV, 0, gv)))));
4388 o = newUNOP(OP_NULL, 0, ck_subr(o));
4389 o->op_targ = OP_GLOB; /* hint at what it used to be */
4392 gv = newGVgen("main");
4394 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4404 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4406 o->op_ppaddr = ppaddr[OP_GREPSTART];
4407 Newz(1101, gwop, 1, LOGOP);
4409 if (o->op_flags & OPf_STACKED) {
4412 kid = cLISTOPo->op_first->op_sibling;
4413 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4416 kid->op_next = (OP*)gwop;
4417 o->op_flags &= ~OPf_STACKED;
4419 kid = cLISTOPo->op_first->op_sibling;
4420 if (type == OP_MAPWHILE)
4427 kid = cLISTOPo->op_first->op_sibling;
4428 if (kid->op_type != OP_NULL)
4429 croak("panic: ck_grep");
4430 kid = kUNOP->op_first;
4432 gwop->op_type = type;
4433 gwop->op_ppaddr = ppaddr[type];
4434 gwop->op_first = listkids(o);
4435 gwop->op_flags |= OPf_KIDS;
4436 gwop->op_private = 1;
4437 gwop->op_other = LINKLIST(kid);
4438 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4439 kid->op_next = (OP*)gwop;
4441 kid = cLISTOPo->op_first->op_sibling;
4442 if (!kid || !kid->op_sibling)
4443 return too_few_arguments(o,op_desc[o->op_type]);
4444 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4445 mod(kid, OP_GREPSTART);
4453 if (o->op_flags & OPf_KIDS) {
4454 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4455 if (kid && kid->op_type == OP_CONST)
4456 fbm_compile(((SVOP*)kid)->op_sv, 0);
4462 ck_lengthconst(OP *o)
4464 /* XXX length optimization goes here */
4471 OPCODE type = o->op_type;
4472 return modkids(ck_fun(o), type);
4478 OPCODE type = o->op_type;
4479 return refkids(ck_fun(o), type);
4487 kid = cLISTOPo->op_first;
4490 kid = cLISTOPo->op_first;
4492 if (kid->op_type == OP_PUSHMARK)
4493 kid = kid->op_sibling;
4494 if (kid && o->op_flags & OPf_STACKED)
4495 kid = kid->op_sibling;
4496 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4497 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4498 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4499 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4500 cLISTOPo->op_first->op_sibling = kid;
4501 cLISTOPo->op_last = kid;
4502 kid = kid->op_sibling;
4507 append_elem(o->op_type, o, newDEFSVOP());
4513 if (hints & HINT_LOCALE)
4514 o->op_private |= OPpLOCALE;
4521 ck_fun_locale(OP *o)
4527 if (hints & HINT_LOCALE)
4528 o->op_private |= OPpLOCALE;
4539 if (hints & HINT_LOCALE)
4540 o->op_private |= OPpLOCALE;
4549 o->op_private |= OPpRUNTIME;
4562 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4563 o->op_private |= OPpREPEAT_DOLIST;
4564 cBINOPo->op_first = force_list(cBINOPo->op_first);
4574 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4575 SVOP *kid = (SVOP*)cUNOPo->op_first;
4577 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4579 for (s = SvPVX(kid->op_sv); *s; s++) {
4580 if (*s == ':' && s[1] == ':') {
4582 Move(s+2, s+1, strlen(s+2)+1, char);
4583 --SvCUR(kid->op_sv);
4586 sv_catpvn(kid->op_sv, ".pm", 3);
4595 croak("NOT IMPL LINE %d",__LINE__);
4604 if (o->op_flags & OPf_KIDS) {
4605 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4606 if (kid && kid->op_sibling) {
4607 o->op_type = OP_SSELECT;
4608 o->op_ppaddr = ppaddr[OP_SSELECT];
4610 return fold_constants(o);
4614 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4615 if (kid && kid->op_type == OP_RV2GV)
4616 kid->op_private &= ~HINT_STRICT_REFS;
4623 I32 type = o->op_type;
4625 if (!(o->op_flags & OPf_KIDS)) {
4630 if (!CvUNIQUE(compcv)) {
4631 argop = newOP(OP_PADAV, OPf_REF);
4632 argop->op_targ = 0; /* curpad[0] is @_ */
4635 argop = newUNOP(OP_RV2AV, 0,
4636 scalar(newGVOP(OP_GV, 0,
4637 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4640 argop = newUNOP(OP_RV2AV, 0,
4641 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(compcv) ?
4642 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4643 #endif /* USE_THREADS */
4644 return newUNOP(type, 0, scalar(argop));
4646 return scalar(modkids(ck_fun(o), type));
4654 if (hints & HINT_LOCALE)
4655 o->op_private |= OPpLOCALE;
4658 if (o->op_flags & OPf_STACKED) {
4659 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4661 kid = kUNOP->op_first; /* get past rv2gv */
4663 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4665 if (kid->op_type == OP_SCOPE) {
4669 else if (kid->op_type == OP_LEAVE) {
4670 if (o->op_type == OP_SORT) {
4671 null(kid); /* wipe out leave */
4674 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4675 if (k->op_next == kid)
4680 kid->op_next = 0; /* just disconnect the leave */
4681 k = kLISTOP->op_first;
4685 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4686 null(kid); /* wipe out rv2gv */
4687 if (o->op_type == OP_SORT)
4691 o->op_flags |= OPf_SPECIAL;
4703 if (o->op_flags & OPf_STACKED)
4704 return no_fh_allowed(o);
4706 kid = cLISTOPo->op_first;
4707 if (kid->op_type != OP_NULL)
4708 croak("panic: ck_split");
4709 kid = kid->op_sibling;
4710 op_free(cLISTOPo->op_first);
4711 cLISTOPo->op_first = kid;
4713 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4714 cLISTOPo->op_last = kid; /* There was only one element previously */
4717 if (kid->op_type != OP_MATCH) {
4718 OP *sibl = kid->op_sibling;
4719 kid->op_sibling = 0;
4720 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4721 if (cLISTOPo->op_first == cLISTOPo->op_last)
4722 cLISTOPo->op_last = kid;
4723 cLISTOPo->op_first = kid;
4724 kid->op_sibling = sibl;
4727 kid->op_type = OP_PUSHRE;
4728 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4731 if (!kid->op_sibling)
4732 append_elem(OP_SPLIT, o, newDEFSVOP());
4734 kid = kid->op_sibling;
4737 if (!kid->op_sibling)
4738 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4740 kid = kid->op_sibling;
4743 if (kid->op_sibling)
4744 return too_many_arguments(o,op_desc[o->op_type]);
4753 OP *prev = ((cUNOPo->op_first->op_sibling)
4754 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4755 OP *o2 = prev->op_sibling;
4763 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4764 if (cvop->op_type == OP_RV2CV) {
4766 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4767 null(cvop); /* disable rv2cv */
4768 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4769 if (tmpop->op_type == OP_GV) {
4770 cv = GvCVu(tmpop->op_sv);
4771 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4772 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4773 proto = SvPV((SV*)cv, na);
4777 o->op_private |= (hints & HINT_STRICT_REFS);
4778 if (PERLDB_SUB && curstash != debstash)
4779 o->op_private |= OPpENTERSUB_DB;
4780 while (o2 != cvop) {
4784 return too_many_arguments(o, gv_ename(namegv));
4802 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4803 bad_type(arg, "block", gv_ename(namegv), o2);
4808 if (o2->op_type == OP_RV2GV)
4812 OP* sib = kid->op_sibling;
4813 kid->op_sibling = 0;
4814 o2 = newUNOP(OP_RV2GV, 0, kid);
4815 o2->op_sibling = sib;
4816 prev->op_sibling = o2;
4824 if (o2->op_type != OP_RV2GV)
4825 bad_type(arg, "symbol", gv_ename(namegv), o2);
4828 if (o2->op_type != OP_RV2CV)
4829 bad_type(arg, "sub", gv_ename(namegv), o2);
4832 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4833 bad_type(arg, "scalar", gv_ename(namegv), o2);
4836 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4837 bad_type(arg, "array", gv_ename(namegv), o2);
4840 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4841 bad_type(arg, "hash", gv_ename(namegv), o2);
4845 OP* sib = kid->op_sibling;
4846 kid->op_sibling = 0;
4847 o2 = newUNOP(OP_REFGEN, 0, kid);
4848 o2->op_sibling = sib;
4849 prev->op_sibling = o2;
4860 croak("Malformed prototype for %s: %s",
4861 gv_ename(namegv), SvPV((SV*)cv, na));
4866 mod(o2, OP_ENTERSUB);
4868 o2 = o2->op_sibling;
4870 if (proto && !optional &&
4871 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4872 return too_few_arguments(o, gv_ename(namegv));
4879 SvREADONLY_on(cSVOPo->op_sv);
4886 if (o->op_flags & OPf_KIDS) {
4887 SVOP *kid = (SVOP*)cUNOPo->op_first;
4889 if (kid->op_type == OP_NULL)
4890 kid = (SVOP*)kid->op_sibling;
4892 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4893 o->op_flags |= OPf_SPECIAL;
4898 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4901 peep(register OP *o)
4904 register OP* oldop = 0;
4905 if (!o || o->op_seq)
4910 for (; o; o = o->op_next) {
4916 switch (o->op_type) {
4919 curcop = ((COP*)o); /* for warnings */
4920 o->op_seq = op_seqmax++;
4931 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
4933 o->op_seq = op_seqmax++;
4936 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4937 o->op_seq = op_seqmax++;
4938 break; /* Scalar stub must produce undef. List stub is noop */
4942 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4949 if (oldop && o->op_next) {
4950 oldop->op_next = o->op_next;
4953 o->op_seq = op_seqmax++;
4957 if (o->op_next->op_type == OP_RV2SV) {
4958 if (!(o->op_next->op_private & OPpDEREF)) {
4960 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4961 o->op_next = o->op_next->op_next;
4962 o->op_type = OP_GVSV;
4963 o->op_ppaddr = ppaddr[OP_GVSV];
4966 else if (o->op_next->op_type == OP_RV2AV) {
4967 OP* pop = o->op_next->op_next;
4969 if (pop->op_type == OP_CONST &&
4970 (op = pop->op_next) &&
4971 pop->op_next->op_type == OP_AELEM &&
4972 !(pop->op_next->op_private &
4973 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4974 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4978 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4982 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4983 o->op_next = pop->op_next->op_next;
4984 o->op_type = OP_AELEMFAST;
4985 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4986 o->op_private = (U8)i;
4987 GvAVn(((GVOP*)o)->op_gv);
4990 o->op_seq = op_seqmax++;
4994 if (o->op_next->op_type == OP_RV2AV
4995 && (o->op_next->op_flags & OPf_REF))
4998 o->op_next = o->op_next->op_next;
5003 if (o->op_next->op_type == OP_RV2HV
5004 && (o->op_next->op_flags & OPf_REF))
5007 o->op_next = o->op_next->op_next;
5015 o->op_seq = op_seqmax++;
5016 while (cLOGOP->op_other->op_type == OP_NULL)
5017 cLOGOP->op_other = cLOGOP->op_other->op_next;
5018 peep(cLOGOP->op_other);
5022 o->op_seq = op_seqmax++;
5023 peep(cCONDOP->op_true);
5024 peep(cCONDOP->op_false);
5028 o->op_seq = op_seqmax++;
5029 peep(cLOOP->op_redoop);
5030 peep(cLOOP->op_nextop);
5031 peep(cLOOP->op_lastop);
5036 o->op_seq = op_seqmax++;
5037 peep(cPMOP->op_pmreplstart);
5041 o->op_seq = op_seqmax++;
5042 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
5043 if (o->op_next->op_sibling &&
5044 o->op_next->op_sibling->op_type != OP_EXIT &&
5045 o->op_next->op_sibling->op_type != OP_WARN &&
5046 o->op_next->op_sibling->op_type != OP_DIE) {
5047 line_t oldline = curcop->cop_line;
5049 curcop->cop_line = ((COP*)o->op_next)->cop_line;
5050 warn("Statement unlikely to be reached");
5051 warn("(Maybe you meant system() when you said exec()?)\n");
5052 curcop->cop_line = oldline;
5066 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5067 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5069 rop = (UNOP*)((BINOP*)o)->op_first;
5070 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5072 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
5073 if (!SvOBJECT(lexname))
5075 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5076 if (!fields || !GvHV(*fields))
5078 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5079 key = SvPV(*svp, keylen);
5080 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5082 croak("No such field \"%s\" in variable %s of type %s",
5083 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
5085 ind = SvIV(*indsvp);
5087 croak("Bad index while coercing array into hash");
5088 rop->op_type = OP_RV2AV;
5089 rop->op_ppaddr = ppaddr[OP_RV2AV];
5090 o->op_type = OP_AELEM;
5091 o->op_ppaddr = ppaddr[OP_AELEM];
5093 *svp = newSViv(ind);
5098 o->op_seq = op_seqmax++;