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 * In the following definition, the ", Nullop" is just to make the compiler
23 * think the expression is of the right type: croak actually does a Siglongjmp.
25 #define CHECKOP(type,o) \
26 ((op_mask && op_mask[type]) \
27 ? ( op_free((OP*)o), \
28 croak("%s trapped by operation mask", op_desc[type]), \
30 : (*check[type])((OP*)o))
32 static I32 list_assignment _((OP *o));
33 static void bad_type _((I32 n, char *t, char *name, OP *kid));
34 static OP *modkids _((OP *o, I32 type));
35 static OP *no_fh_allowed _((OP *o));
36 static bool scalar_mod_type _((OP *o, I32 type));
37 static OP *scalarboolean _((OP *o));
38 static OP *too_few_arguments _((OP *o, char* name));
39 static OP *too_many_arguments _((OP *o, char* name));
40 static void null _((OP* o));
41 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
42 CV* startcv, I32 cx_ix));
43 static OP *newDEFSVOP _((void));
44 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
49 SV* tmpsv = sv_newmortal();
50 gv_efullname3(tmpsv, gv, Nullch);
51 return SvPV(tmpsv,na);
57 yyerror(form("Missing comma after first argument to %s function",
58 op_desc[o->op_type]));
63 too_few_arguments(OP *o, char *name)
65 yyerror(form("Not enough arguments for %s", name));
70 too_many_arguments(OP *o, char *name)
72 yyerror(form("Too many arguments for %s", name));
77 bad_type(I32 n, char *t, char *name, OP *kid)
79 yyerror(form("Type of arg %d to %s must be %s (not %s)",
80 (int)n, name, t, op_desc[kid->op_type]));
86 int type = o->op_type;
87 if (type != OP_AELEM && type != OP_HELEM) {
88 yyerror(form("Can't use subscript on %s", op_desc[type]));
89 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
92 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
93 type == OP_ENTERSUB ? '&' : '%'));
97 sv_catsv(GvSV(errgv), msg);
99 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
104 /* "register" allocation */
107 pad_allocmy(char *name)
113 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
114 if (!isPRINT(name[1])) {
116 name[2] = toCTRL(name[1]);
119 croak("Can't use global %s in \"my\"",name);
121 if (dowarn && AvFILLp(comppad_name) >= 0) {
122 SV **svp = AvARRAY(comppad_name);
123 for (off = AvFILLp(comppad_name); off > comppad_name_floor; off--) {
126 && SvIVX(sv) == 999999999 /* var is in open scope */
127 && strEQ(name, SvPVX(sv)))
129 warn("\"my\" variable %s masks earlier declaration in same scope", name);
134 off = pad_alloc(OP_PADSV, SVs_PADMY);
136 sv_upgrade(sv, SVt_PVNV);
140 croak("Can't declare class for non-scalar %s in \"my\"",name);
142 (void)SvUPGRADE(sv, SVt_PVMG);
143 SvSTASH(sv) = (HV*)SvREFCNT_inc(in_my_stash);
146 av_store(comppad_name, off, sv);
147 SvNVX(sv) = (double)999999999;
148 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
149 if (!min_intro_pending)
150 min_intro_pending = off;
151 max_intro_pending = off;
153 av_store(comppad, off, (SV*)newAV());
154 else if (*name == '%')
155 av_store(comppad, off, (SV*)newHV());
156 SvPADMY_on(curpad[off]);
161 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
168 register PERL_CONTEXT *cx;
171 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
172 AV *curlist = CvPADLIST(cv);
173 SV **svp = av_fetch(curlist, 0, FALSE);
176 if (!svp || *svp == &sv_undef)
179 svp = AvARRAY(curname);
180 for (off = AvFILLp(curname); off > 0; off--) {
181 if ((sv = svp[off]) &&
184 seq > I_32(SvNVX(sv)) &&
185 strEQ(SvPVX(sv), name))
196 return 0; /* don't clone from inactive stack frame */
200 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
201 oldsv = *av_fetch(oldpad, off, TRUE);
202 if (!newoff) { /* Not a mere clone operation. */
203 SV *namesv = NEWSV(1103,0);
204 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
205 sv_upgrade(namesv, SVt_PVNV);
206 sv_setpv(namesv, name);
207 av_store(comppad_name, newoff, namesv);
208 SvNVX(namesv) = (double)curcop->cop_seq;
209 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
210 SvFAKE_on(namesv); /* A ref, not a real var */
211 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
212 /* "It's closures all the way down." */
216 oldsv = Nullsv; /* no need to keep ref */
221 bcv && bcv != cv && !CvCLONE(bcv);
222 bcv = CvOUTSIDE(bcv)) {
226 if (dowarn && !CvUNIQUE(cv))
228 "Variable \"%s\" may be unavailable",
235 else if (!CvUNIQUE(compcv)) {
236 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
237 warn("Variable \"%s\" will not stay shared", name);
240 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
246 /* Nothing in current lexical context--try eval's context, if any.
247 * This is necessary to let the perldb get at lexically scoped variables.
248 * XXX This will also probably interact badly with eval tree caching.
252 for (i = cx_ix; i >= 0; i--) {
254 switch (cx->cx_type) {
256 if (i == 0 && saweval) {
257 seq = cxstack[saweval].blk_oldcop->cop_seq;
258 return pad_findlex(name, newoff, seq, main_cv, 0);
262 switch (cx->blk_eval.old_op_type) {
267 /* require must have its own scope */
275 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
276 saweval = i; /* so we know where we were called from */
279 seq = cxstack[saweval].blk_oldcop->cop_seq;
280 return pad_findlex(name, newoff, seq, cv, i-1);
288 pad_findmy(char *name)
294 SV **svp = AvARRAY(comppad_name);
295 U32 seq = cop_seqmax;
299 * Special case to get lexical (and hence per-thread) @_.
300 * XXX I need to find out how to tell at parse-time whether use
301 * of @_ should refer to a lexical (from a sub) or defgv (global
302 * scope and maybe weird sub-ish things like formats). See
303 * startsub in perly.y. It's possible that @_ could be lexical
304 * (at least from subs) even in non-threaded perl.
306 if (strEQ(name, "@_"))
307 return 0; /* success. (NOT_IN_PAD indicates failure) */
308 #endif /* USE_THREADS */
310 /* The one we're looking for is probably just before comppad_name_fill. */
311 for (off = AvFILLp(comppad_name); off > 0; off--) {
312 if ((sv = svp[off]) &&
316 seq > I_32(SvNVX(sv)))) &&
317 strEQ(SvPVX(sv), name))
320 return (PADOFFSET)off;
321 pendoff = off; /* this pending def. will override import */
325 /* See if it's in a nested scope */
326 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
328 /* If there is a pending local definition, this new alias must die */
330 SvIVX(AvARRAY(comppad_name)[off]) = seq;
331 return off; /* pad_findlex returns 0 for failure...*/
333 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
337 pad_leavemy(I32 fill)
340 SV **svp = AvARRAY(comppad_name);
342 if (min_intro_pending && fill < min_intro_pending) {
343 for (off = max_intro_pending; off >= min_intro_pending; off--) {
344 if ((sv = svp[off]) && sv != &sv_undef)
345 warn("%s never introduced", SvPVX(sv));
348 /* "Deintroduce" my variables that are leaving with this scope. */
349 for (off = AvFILLp(comppad_name); off > fill; off--) {
350 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
351 SvIVX(sv) = cop_seqmax;
356 pad_alloc(I32 optype, U32 tmptype)
362 if (AvARRAY(comppad) != curpad)
363 croak("panic: pad_alloc");
364 if (pad_reset_pending)
366 if (tmptype & SVs_PADMY) {
368 sv = *av_fetch(comppad, AvFILLp(comppad) + 1, TRUE);
369 } while (SvPADBUSY(sv)); /* need a fresh one */
370 retval = AvFILLp(comppad);
373 SV **names = AvARRAY(comppad_name);
374 SSize_t names_fill = AvFILLp(comppad_name);
377 * "foreach" index vars temporarily become aliases to non-"my"
378 * values. Thus we must skip, not just pad values that are
379 * marked as current pad values, but also those with names.
381 if (++padix <= names_fill &&
382 (sv = names[padix]) && sv != &sv_undef)
384 sv = *av_fetch(comppad, padix, TRUE);
385 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
390 SvFLAGS(sv) |= tmptype;
391 curpad = AvARRAY(comppad);
393 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
394 (unsigned long) thr, (unsigned long) curpad,
395 (long) retval, op_name[optype]));
397 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
398 (unsigned long) curpad,
399 (long) retval, op_name[optype]));
400 #endif /* USE_THREADS */
401 return (PADOFFSET)retval;
409 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
410 (unsigned long) thr, (unsigned long) curpad, po));
413 croak("panic: pad_sv po");
414 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
415 (unsigned long) curpad, po));
416 #endif /* USE_THREADS */
417 return curpad[po]; /* eventually we'll turn this into a macro */
421 pad_free(PADOFFSET po)
426 if (AvARRAY(comppad) != curpad)
427 croak("panic: pad_free curpad");
429 croak("panic: pad_free po");
431 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
432 (unsigned long) thr, (unsigned long) curpad, po));
434 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
435 (unsigned long) curpad, po));
436 #endif /* USE_THREADS */
437 if (curpad[po] && curpad[po] != &sv_undef)
438 SvPADTMP_off(curpad[po]);
444 pad_swipe(PADOFFSET po)
447 if (AvARRAY(comppad) != curpad)
448 croak("panic: pad_swipe curpad");
450 croak("panic: pad_swipe po");
452 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
453 (unsigned long) thr, (unsigned long) curpad, po));
455 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
456 (unsigned long) curpad, po));
457 #endif /* USE_THREADS */
458 SvPADTMP_off(curpad[po]);
459 curpad[po] = NEWSV(1107,0);
460 SvPADTMP_on(curpad[po]);
465 /* XXX pad_reset() is currently disabled because it results in serious bugs.
466 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
467 * on the stack by OPs that use them, there are several ways to get an alias
468 * to a shared TARG. Such an alias will change randomly and unpredictably.
469 * We avoid doing this until we can think of a Better Way.
474 #ifdef USE_BROKEN_PAD_RESET
478 if (AvARRAY(comppad) != curpad)
479 croak("panic: pad_reset curpad");
481 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
482 (unsigned long) thr, (unsigned long) curpad));
484 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
485 (unsigned long) curpad));
486 #endif /* USE_THREADS */
487 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
488 for (po = AvMAX(comppad); po > padix_floor; po--) {
489 if (curpad[po] && !SvIMMORTAL(curpad[po]))
490 SvPADTMP_off(curpad[po]);
495 pad_reset_pending = FALSE;
499 /* find_threadsv is not reentrant */
501 find_threadsv(char *name)
507 /* We currently only handle names of a single character */
508 p = strchr(threadsv_names, *name);
511 key = p - threadsv_names;
512 svp = av_fetch(thr->threadsv, key, FALSE);
514 SV *sv = NEWSV(0, 0);
515 av_store(thr->threadsv, key, sv);
516 thr->threadsvp = AvARRAY(thr->threadsv);
518 * Some magic variables used to be automagically initialised
519 * in gv_fetchpv. Those which are now per-thread magicals get
520 * initialised here instead.
526 sv_setpv(sv, "\034");
527 sv_magic(sv, 0, 0, name, 1);
536 sv_magic(sv, 0, 0, name, 1);
538 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
539 "find_threadsv: new SV %p for $%s%c\n",
540 sv, (*name < 32) ? "^" : "",
541 (*name < 32) ? toCTRL(*name) : *name));
545 #endif /* USE_THREADS */
552 register OP *kid, *nextkid;
554 if (!o || o->op_seq == (U16)-1)
557 if (o->op_flags & OPf_KIDS) {
558 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
559 nextkid = kid->op_sibling; /* Get before next freeing kid */
564 switch (o->op_type) {
566 o->op_targ = 0; /* Was holding old type, if any. */
569 o->op_targ = 0; /* Was holding hints. */
573 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
575 #endif /* USE_THREADS */
577 if (!(o->op_flags & OPf_REF) || (check[o->op_type] != ck_ftst))
583 SvREFCNT_dec(cGVOPo->op_gv);
587 Safefree(cCOPo->cop_label);
588 SvREFCNT_dec(cCOPo->cop_filegv);
591 SvREFCNT_dec(cSVOPo->op_sv);
597 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
601 Safefree(cPVOPo->op_pv);
604 op_free(cPMOPo->op_pmreplroot);
608 ReREFCNT_dec(cPMOPo->op_pmregexp);
613 pad_free(o->op_targ);
621 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
622 pad_free(o->op_targ);
623 o->op_targ = o->op_type;
624 o->op_type = OP_NULL;
625 o->op_ppaddr = ppaddr[OP_NULL];
628 /* Contextualizers */
630 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
640 /* establish postfix order */
641 if (cUNOPo->op_first) {
642 o->op_next = LINKLIST(cUNOPo->op_first);
643 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
645 kid->op_next = LINKLIST(kid->op_sibling);
660 if (o && o->op_flags & OPf_KIDS) {
661 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
671 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
673 line_t oldline = curcop->cop_line;
675 if (copline != NOLINE)
676 curcop->cop_line = copline;
677 warn("Found = in conditional, should be ==");
678 curcop->cop_line = oldline;
688 /* assumes no premature commitment */
689 if (!o || (o->op_flags & OPf_WANT) || error_count
690 || o->op_type == OP_RETURN)
693 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
695 switch (o->op_type) {
697 if (o->op_private & OPpREPEAT_DOLIST)
698 null(((LISTOP*)cBINOPo->op_first)->op_first);
699 scalar(cBINOPo->op_first);
704 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
708 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
709 if (!kPMOP->op_pmreplroot)
710 deprecate("implicit split to @_");
717 if (o->op_flags & OPf_KIDS) {
718 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
724 kid = cLISTOPo->op_first;
726 while (kid = kid->op_sibling) {
732 WITH_THR(curcop = &compiling);
737 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
743 WITH_THR(curcop = &compiling);
756 /* assumes no premature commitment */
757 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
758 || o->op_type == OP_RETURN)
761 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
763 switch (o->op_type) {
765 if (!(opargs[o->op_type] & OA_FOLDCONST))
769 if (o->op_flags & OPf_STACKED)
840 if (!(o->op_private & OPpLVAL_INTRO))
841 useless = op_desc[o->op_type];
848 if (!(o->op_private & OPpLVAL_INTRO) &&
849 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
850 useless = "a variable";
855 WITH_THR(curcop = ((COP*)o)); /* for warning below */
861 useless = "a constant";
862 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
864 else if (SvPOK(sv)) {
865 if (strnEQ(SvPVX(sv), "di", 2) ||
866 strnEQ(SvPVX(sv), "ds", 2) ||
867 strnEQ(SvPVX(sv), "ig", 2))
871 null(o); /* don't execute a constant */
872 SvREFCNT_dec(sv); /* don't even remember it */
876 o->op_type = OP_PREINC; /* pre-increment is faster */
877 o->op_ppaddr = ppaddr[OP_PREINC];
881 o->op_type = OP_PREDEC; /* pre-decrement is faster */
882 o->op_ppaddr = ppaddr[OP_PREDEC];
888 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
893 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
894 WITH_THR(curcop = ((COP*)o)); /* for warning below */
895 if (o->op_flags & OPf_STACKED)
901 if (!(o->op_flags & OPf_KIDS))
910 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
917 /* all requires must return a boolean value */
918 o->op_flags &= ~OPf_WANT;
921 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
922 if (!kPMOP->op_pmreplroot)
923 deprecate("implicit split to @_");
927 if (useless && dowarn)
928 warn("Useless use of %s in void context", useless);
936 if (o && o->op_flags & OPf_KIDS) {
937 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
948 /* assumes no premature commitment */
949 if (!o || (o->op_flags & OPf_WANT) || error_count
950 || o->op_type == OP_RETURN)
953 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
955 switch (o->op_type) {
958 list(cBINOPo->op_first);
963 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
970 if (!(o->op_flags & OPf_KIDS))
972 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
973 list(cBINOPo->op_first);
974 return gen_constant_list(o);
981 kid = cLISTOPo->op_first;
983 while (kid = kid->op_sibling) {
989 WITH_THR(curcop = &compiling);
993 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
999 WITH_THR(curcop = &compiling);
1002 /* all requires must return a boolean value */
1003 o->op_flags &= ~OPf_WANT;
1015 if (o->op_type == OP_LINESEQ ||
1016 o->op_type == OP_SCOPE ||
1017 o->op_type == OP_LEAVE ||
1018 o->op_type == OP_LEAVETRY)
1021 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1022 if (kid->op_sibling) {
1026 curcop = &compiling;
1028 o->op_flags &= ~OPf_PARENS;
1029 if (hints & HINT_BLOCK_SCOPE)
1030 o->op_flags |= OPf_PARENS;
1033 o = newOP(OP_STUB, 0);
1038 modkids(OP *o, I32 type)
1041 if (o && o->op_flags & OPf_KIDS) {
1042 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1048 static I32 modcount;
1051 mod(OP *o, I32 type)
1057 if (!o || error_count)
1060 switch (o->op_type) {
1065 if (!(o->op_private & (OPpCONST_ARYBASE)))
1067 if (eval_start && eval_start->op_type == OP_CONST) {
1068 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1072 SAVEI32(compiling.cop_arybase);
1073 compiling.cop_arybase = 0;
1075 else if (type == OP_REFGEN)
1078 croak("That use of $[ is unsupported");
1081 if (o->op_flags & OPf_PARENS)
1085 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1086 !(o->op_flags & OPf_STACKED)) {
1087 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1088 o->op_ppaddr = ppaddr[OP_RV2CV];
1089 assert(cUNOPo->op_first->op_type == OP_NULL);
1090 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1096 /* grep, foreach, subcalls, refgen */
1097 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1099 yyerror(form("Can't modify %s in %s",
1100 op_desc[o->op_type],
1101 type ? op_desc[type] : "local"));
1115 case OP_RIGHT_SHIFT:
1124 if (!(o->op_flags & OPf_STACKED))
1130 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1136 if (!type && cUNOPo->op_first->op_type != OP_GV)
1137 croak("Can't localize through a reference");
1138 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1140 return o; /* Treat \(@foo) like ordinary list. */
1144 if (scalar_mod_type(o, type))
1146 ref(cUNOPo->op_first, o->op_type);
1158 if (!type && cUNOPo->op_first->op_type != OP_GV)
1159 croak("Can't localize through a reference");
1160 ref(cUNOPo->op_first, o->op_type);
1164 hints |= HINT_BLOCK_SCOPE;
1173 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1174 return o; /* Treat \(@foo) like ordinary list. */
1175 if (scalar_mod_type(o, type))
1181 croak("Can't localize lexical variable %s",
1182 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1187 modcount++; /* XXX ??? */
1189 #endif /* USE_THREADS */
1195 if (type != OP_SASSIGN)
1201 pad_free(o->op_targ);
1202 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1203 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1204 if (o->op_flags & OPf_KIDS)
1205 mod(cBINOPo->op_first->op_sibling, type);
1210 ref(cBINOPo->op_first, o->op_type);
1211 if (type == OP_ENTERSUB &&
1212 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1213 o->op_private |= OPpLVAL_DEFER;
1220 if (o->op_flags & OPf_KIDS)
1221 mod(cLISTOPo->op_last, type);
1225 if (!(o->op_flags & OPf_KIDS))
1227 if (o->op_targ != OP_LIST) {
1228 mod(cBINOPo->op_first, type);
1233 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1237 o->op_flags |= OPf_MOD;
1239 if (type == OP_AASSIGN || type == OP_SASSIGN)
1240 o->op_flags |= OPf_SPECIAL|OPf_REF;
1242 o->op_private |= OPpLVAL_INTRO;
1243 o->op_flags &= ~OPf_SPECIAL;
1244 hints |= HINT_BLOCK_SCOPE;
1246 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1247 o->op_flags |= OPf_REF;
1252 scalar_mod_type(OP *o, I32 type)
1256 if (o->op_type == OP_RV2GV)
1280 case OP_RIGHT_SHIFT:
1287 case OP_ANDASSIGN: /* may work later */
1288 case OP_ORASSIGN: /* may work later */
1296 refkids(OP *o, I32 type)
1299 if (o && o->op_flags & OPf_KIDS) {
1300 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1307 ref(OP *o, I32 type)
1311 if (!o || error_count)
1314 switch (o->op_type) {
1316 if ((type == OP_DEFINED || type == OP_LOCK) &&
1317 !(o->op_flags & OPf_STACKED)) {
1318 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1319 o->op_ppaddr = ppaddr[OP_RV2CV];
1320 assert(cUNOPo->op_first->op_type == OP_NULL);
1321 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1322 o->op_flags |= OPf_SPECIAL;
1327 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1331 ref(cUNOPo->op_first, o->op_type);
1334 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1335 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1336 : type == OP_RV2HV ? OPpDEREF_HV
1338 o->op_flags |= OPf_MOD;
1343 o->op_flags |= OPf_MOD; /* XXX ??? */
1348 o->op_flags |= OPf_REF;
1351 ref(cUNOPo->op_first, o->op_type);
1356 o->op_flags |= OPf_REF;
1361 if (!(o->op_flags & OPf_KIDS))
1363 ref(cBINOPo->op_first, type);
1367 ref(cBINOPo->op_first, o->op_type);
1368 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1369 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1370 : type == OP_RV2HV ? OPpDEREF_HV
1372 o->op_flags |= OPf_MOD;
1380 if (!(o->op_flags & OPf_KIDS))
1382 ref(cLISTOPo->op_last, type);
1397 if (!o || error_count)
1401 if (type == OP_LIST) {
1402 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1404 } else if (type == OP_UNDEF) {
1406 } else if (type != OP_PADSV &&
1409 type != OP_PUSHMARK)
1411 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1414 o->op_flags |= OPf_MOD;
1415 o->op_private |= OPpLVAL_INTRO;
1423 o->op_flags |= OPf_PARENS;
1428 bind_match(I32 type, OP *left, OP *right)
1433 (left->op_type == OP_RV2AV ||
1434 left->op_type == OP_RV2HV ||
1435 left->op_type == OP_PADAV ||
1436 left->op_type == OP_PADHV)) {
1437 char *desc = op_desc[(right->op_type == OP_SUBST ||
1438 right->op_type == OP_TRANS)
1439 ? right->op_type : OP_MATCH];
1440 char *sample = ((left->op_type == OP_RV2AV ||
1441 left->op_type == OP_PADAV)
1442 ? "@array" : "%hash");
1443 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1446 if (right->op_type == OP_MATCH ||
1447 right->op_type == OP_SUBST ||
1448 right->op_type == OP_TRANS) {
1449 right->op_flags |= OPf_STACKED;
1450 if (right->op_type != OP_MATCH)
1451 left = mod(left, right->op_type);
1452 if (right->op_type == OP_TRANS)
1453 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1455 o = prepend_elem(right->op_type, scalar(left), right);
1457 return newUNOP(OP_NOT, 0, scalar(o));
1461 return bind_match(type, left,
1462 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1470 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1471 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1478 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1479 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1480 o->op_type = OP_LEAVE;
1481 o->op_ppaddr = ppaddr[OP_LEAVE];
1484 if (o->op_type == OP_LINESEQ) {
1486 o->op_type = OP_SCOPE;
1487 o->op_ppaddr = ppaddr[OP_SCOPE];
1488 kid = ((LISTOP*)o)->op_first;
1489 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1490 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1495 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1502 block_start(int full)
1505 int retval = savestack_ix;
1506 SAVEI32(comppad_name_floor);
1508 if ((comppad_name_fill = AvFILLp(comppad_name)) > 0)
1509 comppad_name_floor = comppad_name_fill;
1511 comppad_name_floor = 0;
1513 SAVEI32(min_intro_pending);
1514 SAVEI32(max_intro_pending);
1515 min_intro_pending = 0;
1516 SAVEI32(comppad_name_fill);
1517 SAVEI32(padix_floor);
1518 padix_floor = padix;
1519 pad_reset_pending = FALSE;
1521 hints &= ~HINT_BLOCK_SCOPE;
1526 block_end(I32 floor, OP *seq)
1529 int needblockscope = hints & HINT_BLOCK_SCOPE;
1530 OP* retval = scalarseq(seq);
1532 pad_reset_pending = FALSE;
1534 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1535 pad_leavemy(comppad_name_fill);
1544 OP *o = newOP(OP_THREADSV, 0);
1545 o->op_targ = find_threadsv("_");
1548 return newSVREF(newGVOP(OP_GV, 0, defgv));
1549 #endif /* USE_THREADS */
1557 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1558 eval_start = linklist(eval_root);
1559 eval_root->op_next = 0;
1565 main_root = scope(sawparens(scalarvoid(o)));
1566 curcop = &compiling;
1567 main_start = LINKLIST(main_root);
1568 main_root->op_next = 0;
1572 /* Register with debugger */
1574 CV *cv = perl_get_cv("DB::postponed", FALSE);
1578 XPUSHs((SV*)compiling.cop_filegv);
1580 perl_call_sv((SV*)cv, G_DISCARD);
1587 localize(OP *o, I32 lex)
1589 if (o->op_flags & OPf_PARENS)
1592 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1594 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1595 if (*s == ';' || *s == '=')
1596 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1600 in_my_stash = Nullhv;
1604 return mod(o, OP_NULL); /* a bit kludgey */
1610 if (o->op_type == OP_LIST) {
1613 o2 = newOP(OP_THREADSV, 0);
1614 o2->op_targ = find_threadsv(";");
1616 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1617 #endif /* USE_THREADS */
1618 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1624 fold_constants(register OP *o)
1628 I32 type = o->op_type;
1631 if (opargs[type] & OA_RETSCALAR)
1633 if (opargs[type] & OA_TARGET)
1634 o->op_targ = pad_alloc(type, SVs_PADTMP);
1636 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1637 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1639 if (!(opargs[type] & OA_FOLDCONST))
1654 if (o->op_private & OPpLOCALE)
1659 goto nope; /* Don't try to run w/ errors */
1661 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1662 if (curop->op_type != OP_CONST &&
1663 curop->op_type != OP_LIST &&
1664 curop->op_type != OP_SCALAR &&
1665 curop->op_type != OP_NULL &&
1666 curop->op_type != OP_PUSHMARK) {
1671 curop = LINKLIST(o);
1676 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1677 pad_swipe(o->op_targ);
1678 else if (SvTEMP(sv)) { /* grab mortal temp? */
1679 (void)SvREFCNT_inc(sv);
1683 if (type == OP_RV2GV)
1684 return newGVOP(OP_GV, 0, (GV*)sv);
1686 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1688 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1693 SvIOK_off(sv); /* undo SvIV() damage */
1695 return newSVOP(OP_CONST, 0, sv);
1699 if (!(opargs[type] & OA_OTHERINT))
1702 if (!(hints & HINT_INTEGER)) {
1703 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1706 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1707 if (curop->op_type == OP_CONST) {
1708 if (SvIOK(((SVOP*)curop)->op_sv))
1712 if (opargs[curop->op_type] & OA_RETINTEGER)
1716 o->op_ppaddr = ppaddr[++(o->op_type)];
1723 gen_constant_list(register OP *o)
1727 I32 oldtmps_floor = tmps_floor;
1731 return o; /* Don't attempt to run with errors */
1733 op = curop = LINKLIST(o);
1739 tmps_floor = oldtmps_floor;
1741 o->op_type = OP_RV2AV;
1742 o->op_ppaddr = ppaddr[OP_RV2AV];
1743 curop = ((UNOP*)o)->op_first;
1744 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1751 convert(I32 type, I32 flags, OP *o)
1756 if (!o || o->op_type != OP_LIST)
1757 o = newLISTOP(OP_LIST, 0, o, Nullop);
1759 o->op_flags &= ~OPf_WANT;
1761 if (!(opargs[type] & OA_MARK))
1762 null(cLISTOPo->op_first);
1765 o->op_ppaddr = ppaddr[type];
1766 o->op_flags |= flags;
1768 o = CHECKOP(type, o);
1769 if (o->op_type != type)
1772 if (cLISTOPo->op_children < 7) {
1773 /* XXX do we really need to do this if we're done appending?? */
1774 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1776 cLISTOPo->op_last = last; /* in case check substituted last arg */
1779 return fold_constants(o);
1782 /* List constructors */
1785 append_elem(I32 type, OP *first, OP *last)
1793 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1794 return newLISTOP(type, 0, first, last);
1796 if (first->op_flags & OPf_KIDS)
1797 ((LISTOP*)first)->op_last->op_sibling = last;
1799 first->op_flags |= OPf_KIDS;
1800 ((LISTOP*)first)->op_first = last;
1802 ((LISTOP*)first)->op_last = last;
1803 ((LISTOP*)first)->op_children++;
1808 append_list(I32 type, LISTOP *first, LISTOP *last)
1816 if (first->op_type != type)
1817 return prepend_elem(type, (OP*)first, (OP*)last);
1819 if (last->op_type != type)
1820 return append_elem(type, (OP*)first, (OP*)last);
1822 first->op_last->op_sibling = last->op_first;
1823 first->op_last = last->op_last;
1824 first->op_children += last->op_children;
1825 if (first->op_children)
1826 last->op_flags |= OPf_KIDS;
1833 prepend_elem(I32 type, OP *first, OP *last)
1841 if (last->op_type == type) {
1842 if (type == OP_LIST) { /* already a PUSHMARK there */
1843 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1844 ((LISTOP*)last)->op_first->op_sibling = first;
1847 if (!(last->op_flags & OPf_KIDS)) {
1848 ((LISTOP*)last)->op_last = first;
1849 last->op_flags |= OPf_KIDS;
1851 first->op_sibling = ((LISTOP*)last)->op_first;
1852 ((LISTOP*)last)->op_first = first;
1854 ((LISTOP*)last)->op_children++;
1858 return newLISTOP(type, 0, first, last);
1866 return newOP(OP_STUB, 0);
1872 if (!o || o->op_type != OP_LIST)
1873 o = newLISTOP(OP_LIST, 0, o, Nullop);
1879 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1883 Newz(1101, listop, 1, LISTOP);
1885 listop->op_type = type;
1886 listop->op_ppaddr = ppaddr[type];
1887 listop->op_children = (first != 0) + (last != 0);
1888 listop->op_flags = flags;
1892 else if (!first && last)
1895 first->op_sibling = last;
1896 listop->op_first = first;
1897 listop->op_last = last;
1898 if (type == OP_LIST) {
1900 pushop = newOP(OP_PUSHMARK, 0);
1901 pushop->op_sibling = first;
1902 listop->op_first = pushop;
1903 listop->op_flags |= OPf_KIDS;
1905 listop->op_last = pushop;
1907 else if (listop->op_children)
1908 listop->op_flags |= OPf_KIDS;
1914 newOP(I32 type, I32 flags)
1917 Newz(1101, o, 1, OP);
1919 o->op_ppaddr = ppaddr[type];
1920 o->op_flags = flags;
1923 o->op_private = 0 + (flags >> 8);
1924 if (opargs[type] & OA_RETSCALAR)
1926 if (opargs[type] & OA_TARGET)
1927 o->op_targ = pad_alloc(type, SVs_PADTMP);
1928 return CHECKOP(type, o);
1932 newUNOP(I32 type, I32 flags, OP *first)
1937 first = newOP(OP_STUB, 0);
1938 if (opargs[type] & OA_MARK)
1939 first = force_list(first);
1941 Newz(1101, unop, 1, UNOP);
1942 unop->op_type = type;
1943 unop->op_ppaddr = ppaddr[type];
1944 unop->op_first = first;
1945 unop->op_flags = flags | OPf_KIDS;
1946 unop->op_private = 1 | (flags >> 8);
1948 if(type == OP_STUDY && first->op_type == OP_MATCH) {
1949 first->op_type = OP_PUSHRE;
1950 first->op_ppaddr = ppaddr[OP_PUSHRE];
1953 unop = (UNOP*) CHECKOP(type, unop);
1957 return fold_constants((OP *) unop);
1961 newBINOP(I32 type, I32 flags, OP *first, OP *last)
1964 Newz(1101, binop, 1, BINOP);
1967 first = newOP(OP_NULL, 0);
1969 binop->op_type = type;
1970 binop->op_ppaddr = ppaddr[type];
1971 binop->op_first = first;
1972 binop->op_flags = flags | OPf_KIDS;
1975 binop->op_private = 1 | (flags >> 8);
1978 binop->op_private = 2 | (flags >> 8);
1979 first->op_sibling = last;
1982 binop = (BINOP*)CHECKOP(type, binop);
1986 binop->op_last = last = binop->op_first->op_sibling;
1988 return fold_constants((OP *)binop);
1992 pmtrans(OP *o, OP *expr, OP *repl)
1994 SV *tstr = ((SVOP*)expr)->op_sv;
1995 SV *rstr = ((SVOP*)repl)->op_sv;
1998 register U8 *t = (U8*)SvPV(tstr, tlen);
1999 register U8 *r = (U8*)SvPV(rstr, rlen);
2005 register short *tbl;
2007 tbl = (short*)cPVOPo->op_pv;
2008 complement = o->op_private & OPpTRANS_COMPLEMENT;
2009 Delete = o->op_private & OPpTRANS_DELETE;
2010 squash = o->op_private & OPpTRANS_SQUASH;
2013 Zero(tbl, 256, short);
2014 for (i = 0; i < tlen; i++)
2016 for (i = 0, j = 0; i < 256; i++) {
2032 if (!rlen && !Delete) {
2035 o->op_private |= OPpTRANS_COUNTONLY;
2037 for (i = 0; i < 256; i++)
2039 for (i = 0, j = 0; i < tlen; i++,j++) {
2042 if (tbl[t[i]] == -1)
2048 if (tbl[t[i]] == -1)
2059 newPMOP(I32 type, I32 flags)
2064 Newz(1101, pmop, 1, PMOP);
2065 pmop->op_type = type;
2066 pmop->op_ppaddr = ppaddr[type];
2067 pmop->op_flags = flags;
2068 pmop->op_private = 0 | (flags >> 8);
2070 if (hints & HINT_LOCALE)
2071 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2073 /* link into pm list */
2074 if (type != OP_TRANS && curstash) {
2075 pmop->op_pmnext = HvPMROOT(curstash);
2076 HvPMROOT(curstash) = pmop;
2083 pmruntime(OP *o, OP *expr, OP *repl)
2088 if (o->op_type == OP_TRANS)
2089 return pmtrans(o, expr, repl);
2091 hints |= HINT_BLOCK_SCOPE;
2094 if (expr->op_type == OP_CONST) {
2096 SV *pat = ((SVOP*)expr)->op_sv;
2097 char *p = SvPV(pat, plen);
2098 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2099 sv_setpvn(pat, "\\s+", 3);
2100 p = SvPV(pat, plen);
2101 pm->op_pmflags |= PMf_SKIPWHITE;
2103 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2104 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2105 pm->op_pmflags |= PMf_WHITE;
2109 if (pm->op_pmflags & PMf_KEEP)
2110 expr = newUNOP(OP_REGCMAYBE,0,expr);
2112 Newz(1101, rcop, 1, LOGOP);
2113 rcop->op_type = OP_REGCOMP;
2114 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2115 rcop->op_first = scalar(expr);
2116 rcop->op_flags |= OPf_KIDS;
2117 rcop->op_private = 1;
2120 /* establish postfix order */
2121 if (pm->op_pmflags & PMf_KEEP) {
2123 rcop->op_next = expr;
2124 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2127 rcop->op_next = LINKLIST(expr);
2128 expr->op_next = (OP*)rcop;
2131 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2136 if (pm->op_pmflags & PMf_EVAL)
2139 else if (repl->op_type == OP_THREADSV
2140 && strchr("&`'123456789+",
2141 threadsv_names[repl->op_targ]))
2145 #endif /* USE_THREADS */
2146 else if (repl->op_type == OP_CONST)
2150 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2151 if (opargs[curop->op_type] & OA_DANGEROUS) {
2153 if (curop->op_type == OP_THREADSV
2154 && strchr("&`'123456789+", curop->op_private)) {
2158 if (curop->op_type == OP_GV) {
2159 GV *gv = ((GVOP*)curop)->op_gv;
2160 if (strchr("&`'123456789+", *GvENAME(gv)))
2163 #endif /* USE_THREADS */
2164 else if (curop->op_type == OP_RV2CV)
2166 else if (curop->op_type == OP_RV2SV ||
2167 curop->op_type == OP_RV2AV ||
2168 curop->op_type == OP_RV2HV ||
2169 curop->op_type == OP_RV2GV) {
2170 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2173 else if (curop->op_type == OP_PADSV ||
2174 curop->op_type == OP_PADAV ||
2175 curop->op_type == OP_PADHV ||
2176 curop->op_type == OP_PADANY) {
2185 if (curop == repl) {
2186 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2187 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2188 prepend_elem(o->op_type, scalar(repl), o);
2191 Newz(1101, rcop, 1, LOGOP);
2192 rcop->op_type = OP_SUBSTCONT;
2193 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2194 rcop->op_first = scalar(repl);
2195 rcop->op_flags |= OPf_KIDS;
2196 rcop->op_private = 1;
2199 /* establish postfix order */
2200 rcop->op_next = LINKLIST(repl);
2201 repl->op_next = (OP*)rcop;
2203 pm->op_pmreplroot = scalar((OP*)rcop);
2204 pm->op_pmreplstart = LINKLIST(rcop);
2213 newSVOP(I32 type, I32 flags, SV *sv)
2216 Newz(1101, svop, 1, SVOP);
2217 svop->op_type = type;
2218 svop->op_ppaddr = ppaddr[type];
2220 svop->op_next = (OP*)svop;
2221 svop->op_flags = flags;
2222 if (opargs[type] & OA_RETSCALAR)
2224 if (opargs[type] & OA_TARGET)
2225 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2226 return CHECKOP(type, svop);
2230 newGVOP(I32 type, I32 flags, GV *gv)
2234 Newz(1101, gvop, 1, GVOP);
2235 gvop->op_type = type;
2236 gvop->op_ppaddr = ppaddr[type];
2237 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2238 gvop->op_next = (OP*)gvop;
2239 gvop->op_flags = flags;
2240 if (opargs[type] & OA_RETSCALAR)
2242 if (opargs[type] & OA_TARGET)
2243 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2244 return CHECKOP(type, gvop);
2248 newPVOP(I32 type, I32 flags, char *pv)
2251 Newz(1101, pvop, 1, PVOP);
2252 pvop->op_type = type;
2253 pvop->op_ppaddr = ppaddr[type];
2255 pvop->op_next = (OP*)pvop;
2256 pvop->op_flags = flags;
2257 if (opargs[type] & OA_RETSCALAR)
2259 if (opargs[type] & OA_TARGET)
2260 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2261 return CHECKOP(type, pvop);
2270 save_hptr(&curstash);
2271 save_item(curstname);
2276 name = SvPV(sv, len);
2277 curstash = gv_stashpvn(name,len,TRUE);
2278 sv_setpvn(curstname, name, len);
2282 sv_setpv(curstname,"<none>");
2290 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2298 if (id->op_type != OP_CONST)
2299 croak("Module name must be constant");
2303 if(version != Nullop) {
2304 SV *vesv = ((SVOP*)version)->op_sv;
2306 if (arg == Nullop && !SvNIOK(vesv)) {
2313 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2314 croak("Version number must be constant number");
2316 /* Make copy of id so we don't free it twice */
2317 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2319 /* Fake up a method call to VERSION */
2320 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2321 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2322 append_elem(OP_LIST,
2323 prepend_elem(OP_LIST, pack, list(version)),
2324 newUNOP(OP_METHOD, 0, meth)));
2328 /* Fake up an import/unimport */
2329 if (arg && arg->op_type == OP_STUB)
2330 imop = arg; /* no import on explicit () */
2331 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2332 imop = Nullop; /* use 5.0; */
2335 /* Make copy of id so we don't free it twice */
2336 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2337 meth = newSVOP(OP_CONST, 0,
2339 ? newSVpv("import", 6)
2340 : newSVpv("unimport", 8)
2342 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2343 append_elem(OP_LIST,
2344 prepend_elem(OP_LIST, pack, list(arg)),
2345 newUNOP(OP_METHOD, 0, meth)));
2348 /* Fake up a require */
2349 rqop = newUNOP(OP_REQUIRE, 0, id);
2351 /* Fake up the BEGIN {}, which does its thing immediately. */
2353 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2355 append_elem(OP_LINESEQ,
2356 append_elem(OP_LINESEQ,
2357 newSTATEOP(0, Nullch, rqop),
2358 newSTATEOP(0, Nullch, veop)),
2359 newSTATEOP(0, Nullch, imop) ));
2366 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2368 return newBINOP(OP_LSLICE, flags,
2369 list(force_list(subscript)),
2370 list(force_list(listval)) );
2374 list_assignment(register OP *o)
2379 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2380 o = cUNOPo->op_first;
2382 if (o->op_type == OP_COND_EXPR) {
2383 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2384 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2389 yyerror("Assignment to both a list and a scalar");
2393 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2394 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2395 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2398 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2401 if (o->op_type == OP_RV2SV)
2408 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2413 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2414 return newLOGOP(optype, 0,
2415 mod(scalar(left), optype),
2416 newUNOP(OP_SASSIGN, 0, scalar(right)));
2419 return newBINOP(optype, OPf_STACKED,
2420 mod(scalar(left), optype), scalar(right));
2424 if (list_assignment(left)) {
2426 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2427 left = mod(left, OP_AASSIGN);
2435 o = newBINOP(OP_AASSIGN, flags,
2436 list(force_list(right)),
2437 list(force_list(left)) );
2438 o->op_private = 0 | (flags >> 8);
2439 if (!(left->op_private & OPpLVAL_INTRO)) {
2440 static int generation = 100;
2444 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2445 if (opargs[curop->op_type] & OA_DANGEROUS) {
2446 if (curop->op_type == OP_GV) {
2447 GV *gv = ((GVOP*)curop)->op_gv;
2448 if (gv == defgv || SvCUR(gv) == generation)
2450 SvCUR(gv) = generation;
2452 else if (curop->op_type == OP_PADSV ||
2453 curop->op_type == OP_PADAV ||
2454 curop->op_type == OP_PADHV ||
2455 curop->op_type == OP_PADANY) {
2456 SV **svp = AvARRAY(comppad_name);
2457 SV *sv = svp[curop->op_targ];
2458 if (SvCUR(sv) == generation)
2460 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2462 else if (curop->op_type == OP_RV2CV)
2464 else if (curop->op_type == OP_RV2SV ||
2465 curop->op_type == OP_RV2AV ||
2466 curop->op_type == OP_RV2HV ||
2467 curop->op_type == OP_RV2GV) {
2468 if (lastop->op_type != OP_GV) /* funny deref? */
2477 o->op_private = OPpASSIGN_COMMON;
2479 if (right && right->op_type == OP_SPLIT) {
2481 if ((tmpop = ((LISTOP*)right)->op_first) &&
2482 tmpop->op_type == OP_PUSHRE)
2484 PMOP *pm = (PMOP*)tmpop;
2485 if (left->op_type == OP_RV2AV &&
2486 !(left->op_private & OPpLVAL_INTRO) &&
2487 !(o->op_private & OPpASSIGN_COMMON) )
2489 tmpop = ((UNOP*)left)->op_first;
2490 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2491 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2492 pm->op_pmflags |= PMf_ONCE;
2493 tmpop = cUNOPo->op_first; /* to list (nulled) */
2494 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2495 tmpop->op_sibling = Nullop; /* don't free split */
2496 right->op_next = tmpop->op_next; /* fix starting loc */
2497 op_free(o); /* blow off assign */
2498 right->op_flags &= ~OPf_WANT;
2499 /* "I don't know and I don't care." */
2504 if (modcount < 10000 &&
2505 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2507 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2509 sv_setiv(sv, modcount+1);
2517 right = newOP(OP_UNDEF, 0);
2518 if (right->op_type == OP_READLINE) {
2519 right->op_flags |= OPf_STACKED;
2520 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2523 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2524 o = newBINOP(OP_SASSIGN, flags,
2525 scalar(right), mod(scalar(left), OP_SASSIGN) );
2537 newSTATEOP(I32 flags, char *label, OP *o)
2540 U32 seq = intro_my();
2543 Newz(1101, cop, 1, COP);
2544 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2545 cop->op_type = OP_DBSTATE;
2546 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2549 cop->op_type = OP_NEXTSTATE;
2550 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2552 cop->op_flags = flags;
2553 cop->op_private = 0 | (flags >> 8);
2555 cop->op_private |= NATIVE_HINTS;
2557 cop->op_next = (OP*)cop;
2560 cop->cop_label = label;
2561 hints |= HINT_BLOCK_SCOPE;
2564 cop->cop_arybase = curcop->cop_arybase;
2566 if (copline == NOLINE)
2567 cop->cop_line = curcop->cop_line;
2569 cop->cop_line = copline;
2572 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2573 cop->cop_stash = curstash;
2575 if (PERLDB_LINE && curstash != debstash) {
2576 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2577 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2578 (void)SvIOK_on(*svp);
2580 SvSTASH(*svp) = (HV*)cop;
2584 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2587 /* "Introduce" my variables to visible status. */
2595 if (! min_intro_pending)
2598 svp = AvARRAY(comppad_name);
2599 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2600 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2601 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2602 SvNVX(sv) = (double)cop_seqmax;
2605 min_intro_pending = 0;
2606 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2607 return cop_seqmax++;
2611 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2613 return new_logop(type, flags, &first, &other);
2617 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2622 OP *first = *firstp;
2623 OP *other = *otherp;
2625 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2626 return newBINOP(type, flags, scalar(first), scalar(other));
2628 scalarboolean(first);
2629 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2630 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2631 if (type == OP_AND || type == OP_OR) {
2637 first = *firstp = cUNOPo->op_first;
2639 first->op_next = o->op_next;
2640 cUNOPo->op_first = Nullop;
2644 if (first->op_type == OP_CONST) {
2645 if (dowarn && (first->op_private & OPpCONST_BARE))
2646 warn("Probable precedence problem on %s", op_desc[type]);
2647 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2658 else if (first->op_type == OP_WANTARRAY) {
2664 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2665 OP *k1 = ((UNOP*)first)->op_first;
2666 OP *k2 = k1->op_sibling;
2668 switch (first->op_type)
2671 if (k2 && k2->op_type == OP_READLINE
2672 && (k2->op_flags & OPf_STACKED)
2673 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2674 warnop = k2->op_type;
2678 if (k1->op_type == OP_READDIR
2679 || k1->op_type == OP_GLOB
2680 || k1->op_type == OP_EACH)
2681 warnop = k1->op_type;
2685 line_t oldline = curcop->cop_line;
2686 curcop->cop_line = copline;
2687 warn("Value of %s%s can be \"0\"; test with defined()",
2689 ((warnop == OP_READLINE || warnop == OP_GLOB)
2690 ? " construct" : "() operator"));
2691 curcop->cop_line = oldline;
2698 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2699 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2701 Newz(1101, logop, 1, LOGOP);
2703 logop->op_type = type;
2704 logop->op_ppaddr = ppaddr[type];
2705 logop->op_first = first;
2706 logop->op_flags = flags | OPf_KIDS;
2707 logop->op_other = LINKLIST(other);
2708 logop->op_private = 1 | (flags >> 8);
2710 /* establish postfix order */
2711 logop->op_next = LINKLIST(first);
2712 first->op_next = (OP*)logop;
2713 first->op_sibling = other;
2715 o = newUNOP(OP_NULL, 0, (OP*)logop);
2722 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2729 return newLOGOP(OP_AND, 0, first, trueop);
2731 return newLOGOP(OP_OR, 0, first, falseop);
2733 scalarboolean(first);
2734 if (first->op_type == OP_CONST) {
2735 if (SvTRUE(((SVOP*)first)->op_sv)) {
2746 else if (first->op_type == OP_WANTARRAY) {
2750 Newz(1101, condop, 1, CONDOP);
2752 condop->op_type = OP_COND_EXPR;
2753 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2754 condop->op_first = first;
2755 condop->op_flags = flags | OPf_KIDS;
2756 condop->op_true = LINKLIST(trueop);
2757 condop->op_false = LINKLIST(falseop);
2758 condop->op_private = 1 | (flags >> 8);
2760 /* establish postfix order */
2761 condop->op_next = LINKLIST(first);
2762 first->op_next = (OP*)condop;
2764 first->op_sibling = trueop;
2765 trueop->op_sibling = falseop;
2766 o = newUNOP(OP_NULL, 0, (OP*)condop);
2768 trueop->op_next = o;
2769 falseop->op_next = o;
2775 newRANGE(I32 flags, OP *left, OP *right)
2783 Newz(1101, condop, 1, CONDOP);
2785 condop->op_type = OP_RANGE;
2786 condop->op_ppaddr = ppaddr[OP_RANGE];
2787 condop->op_first = left;
2788 condop->op_flags = OPf_KIDS;
2789 condop->op_true = LINKLIST(left);
2790 condop->op_false = LINKLIST(right);
2791 condop->op_private = 1 | (flags >> 8);
2793 left->op_sibling = right;
2795 condop->op_next = (OP*)condop;
2796 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2797 flop = newUNOP(OP_FLOP, 0, flip);
2798 o = newUNOP(OP_NULL, 0, flop);
2801 left->op_next = flip;
2802 right->op_next = flop;
2804 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2805 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2806 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2807 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2809 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2810 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2813 if (!flip->op_private || !flop->op_private)
2814 linklist(o); /* blow off optimizer unless constant */
2820 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2825 int once = block && block->op_flags & OPf_SPECIAL &&
2826 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2829 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2830 return block; /* do {} while 0 does once */
2831 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2832 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2833 expr = newUNOP(OP_DEFINED, 0,
2834 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2838 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2839 o = new_logop(OP_AND, 0, &expr, &listop);
2842 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2844 if (once && o != listop)
2845 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2848 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2850 o->op_flags |= flags;
2852 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2857 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2866 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2867 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2868 expr = newUNOP(OP_DEFINED, 0,
2869 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2873 block = newOP(OP_NULL, 0);
2876 next = LINKLIST(cont);
2878 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2879 if ((line_t)whileline != NOLINE) {
2880 copline = whileline;
2881 cont = append_elem(OP_LINESEQ, cont,
2882 newSTATEOP(0, Nullch, Nullop));
2886 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2887 redo = LINKLIST(listop);
2890 copline = whileline;
2892 o = new_logop(OP_AND, 0, &expr, &listop);
2893 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2894 op_free(expr); /* oops, it's a while (0) */
2896 return Nullop; /* listop already freed by new_logop */
2899 ((LISTOP*)listop)->op_last->op_next = condop =
2900 (o == listop ? redo : LINKLIST(o));
2908 Newz(1101,loop,1,LOOP);
2909 loop->op_type = OP_ENTERLOOP;
2910 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2911 loop->op_private = 0;
2912 loop->op_next = (OP*)loop;
2915 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2917 loop->op_redoop = redo;
2918 loop->op_lastop = o;
2921 loop->op_nextop = next;
2923 loop->op_nextop = o;
2925 o->op_flags |= flags;
2926 o->op_private |= (flags >> 8);
2931 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2939 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2940 sv->op_type = OP_RV2GV;
2941 sv->op_ppaddr = ppaddr[OP_RV2GV];
2943 else if (sv->op_type == OP_PADSV) { /* private variable */
2944 padoff = sv->op_targ;
2948 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
2949 padoff = sv->op_targ;
2950 iterflags |= OPf_SPECIAL;
2955 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2959 padoff = find_threadsv("_");
2960 iterflags |= OPf_SPECIAL;
2962 sv = newGVOP(OP_GV, 0, defgv);
2965 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2966 expr = scalar(ref(expr, OP_ITER));
2967 iterflags |= OPf_STACKED;
2969 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2970 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2972 assert(!loop->op_next);
2973 Renew(loop, 1, LOOP);
2974 loop->op_targ = padoff;
2975 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
2977 return newSTATEOP(0, label, wop);
2981 newLOOPEX(I32 type, OP *label)
2985 if (type != OP_GOTO || label->op_type == OP_CONST) {
2986 /* "last()" means "last" */
2987 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
2988 o = newOP(type, OPf_SPECIAL);
2990 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
2991 ? SvPVx(((SVOP*)label)->op_sv, na)
2997 if (label->op_type == OP_ENTERSUB)
2998 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2999 o = newUNOP(type, OPf_STACKED, label);
3001 hints |= HINT_BLOCK_SCOPE;
3011 MUTEX_DESTROY(CvMUTEXP(cv));
3012 Safefree(CvMUTEXP(cv));
3015 #endif /* USE_THREADS */
3017 if (!CvXSUB(cv) && CvROOT(cv)) {
3019 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3020 croak("Can't undef active subroutine");
3023 croak("Can't undef active subroutine");
3024 #endif /* USE_THREADS */
3031 op_free(CvROOT(cv));
3032 CvROOT(cv) = Nullop;
3035 SvPOK_off((SV*)cv); /* forget prototype */
3037 SvREFCNT_dec(CvGV(cv));
3039 SvREFCNT_dec(CvOUTSIDE(cv));
3040 CvOUTSIDE(cv) = Nullcv;
3041 if (CvPADLIST(cv)) {
3042 /* may be during global destruction */
3043 if (SvREFCNT(CvPADLIST(cv))) {
3044 I32 i = AvFILLp(CvPADLIST(cv));
3046 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3047 SV* sv = svp ? *svp : Nullsv;
3050 if (sv == (SV*)comppad_name)
3051 comppad_name = Nullav;
3052 else if (sv == (SV*)comppad) {
3054 curpad = Null(SV**);
3058 SvREFCNT_dec((SV*)CvPADLIST(cv));
3060 CvPADLIST(cv) = Nullav;
3064 #ifdef DEBUG_CLOSURES
3069 CV *outside = CvOUTSIDE(cv);
3070 AV* padlist = CvPADLIST(cv);
3077 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3079 (CvANON(cv) ? "ANON"
3080 : (cv == main_cv) ? "MAIN"
3081 : CvUNIQUE(outside) ? "UNIQUE"
3082 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3085 : CvANON(outside) ? "ANON"
3086 : (outside == main_cv) ? "MAIN"
3087 : CvUNIQUE(outside) ? "UNIQUE"
3088 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3093 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3094 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3095 pname = AvARRAY(pad_name);
3096 ppad = AvARRAY(pad);
3098 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3099 if (SvPOK(pname[ix]))
3100 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3102 SvFAKE(pname[ix]) ? "FAKE " : "",
3104 (long)I_32(SvNVX(pname[ix])),
3105 (long)SvIVX(pname[ix]));
3108 #endif /* DEBUG_CLOSURES */
3111 cv_clone2(CV *proto, CV *outside)
3116 AV* protopadlist = CvPADLIST(proto);
3117 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3118 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3119 SV** pname = AvARRAY(protopad_name);
3120 SV** ppad = AvARRAY(protopad);
3121 I32 fname = AvFILLp(protopad_name);
3122 I32 fpad = AvFILLp(protopad);
3126 assert(!CvUNIQUE(proto));
3131 SAVESPTR(comppad_name);
3134 cv = compcv = (CV*)NEWSV(1104,0);
3135 sv_upgrade((SV *)cv, SvTYPE(proto));
3141 New(666, CvMUTEXP(cv), 1, perl_mutex);
3142 MUTEX_INIT(CvMUTEXP(cv));
3144 #endif /* USE_THREADS */
3145 CvFILEGV(cv) = CvFILEGV(proto);
3146 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3147 CvSTASH(cv) = CvSTASH(proto);
3148 CvROOT(cv) = CvROOT(proto);
3149 CvSTART(cv) = CvSTART(proto);
3151 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3154 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3156 comppad_name = newAV();
3157 for (ix = fname; ix >= 0; ix--)
3158 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3162 comppadlist = newAV();
3163 AvREAL_off(comppadlist);
3164 av_store(comppadlist, 0, (SV*)comppad_name);
3165 av_store(comppadlist, 1, (SV*)comppad);
3166 CvPADLIST(cv) = comppadlist;
3167 av_fill(comppad, AvFILLp(protopad));
3168 curpad = AvARRAY(comppad);
3170 av = newAV(); /* will be @_ */
3172 av_store(comppad, 0, (SV*)av);
3173 AvFLAGS(av) = AVf_REIFY;
3175 for (ix = fpad; ix > 0; ix--) {
3176 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3177 if (namesv && namesv != &sv_undef) {
3178 char *name = SvPVX(namesv); /* XXX */
3179 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3180 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3181 CvOUTSIDE(cv), cxstack_ix);
3183 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3185 croak("panic: cv_clone: %s", name);
3187 else { /* our own lexical */
3190 /* anon code -- we'll come back for it */
3191 sv = SvREFCNT_inc(ppad[ix]);
3193 else if (*name == '@')
3195 else if (*name == '%')
3205 SV* sv = NEWSV(0,0);
3211 /* Now that vars are all in place, clone nested closures. */
3213 for (ix = fpad; ix > 0; ix--) {
3214 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3216 && namesv != &sv_undef
3217 && !(SvFLAGS(namesv) & SVf_FAKE)
3218 && *SvPVX(namesv) == '&'
3219 && CvCLONE(ppad[ix]))
3221 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3222 SvREFCNT_dec(ppad[ix]);
3225 curpad[ix] = (SV*)kid;
3229 #ifdef DEBUG_CLOSURES
3230 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3232 PerlIO_printf(Perl_debug_log, " from:\n");
3234 PerlIO_printf(Perl_debug_log, " to:\n");
3245 return cv_clone2(proto, CvOUTSIDE(proto));
3249 cv_ckproto(CV *cv, GV *gv, char *p)
3251 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3252 SV* msg = sv_newmortal();
3256 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3257 sv_setpv(msg, "Prototype mismatch:");
3259 sv_catpvf(msg, " sub %_", name);
3261 sv_catpvf(msg, " (%s)", SvPVX(cv));
3262 sv_catpv(msg, " vs ");
3264 sv_catpvf(msg, "(%s)", p);
3266 sv_catpv(msg, "none");
3277 if (!cv || !SvPOK(cv) || SvCUR(cv))
3281 for (o = CvSTART(cv); o; o = o->op_next) {
3282 OPCODE type = o->op_type;
3284 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3286 if (type == OP_LEAVESUB || type == OP_RETURN)
3290 if (type == OP_CONST)
3292 else if (type == OP_PADSV) {
3293 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3294 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3295 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3307 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3310 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3311 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3312 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3321 if (!name || GvCVGEN(gv))
3323 else if (cv = GvCV(gv)) {
3324 cv_ckproto(cv, gv, ps);
3325 /* already defined (or promised)? */
3326 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3329 /* just a "sub foo;" when &foo is already defined */
3333 /* ahem, death to those who redefine active sort subs */
3334 if (curstackinfo->si_type == SI_SORT && sortcop == CvSTART(cv))
3335 croak("Can't redefine active sort subroutine %s", name);
3336 const_sv = cv_const_sv(cv);
3337 if (const_sv || dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3338 && HvNAME(GvSTASH(CvGV(cv)))
3339 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3341 line_t oldline = curcop->cop_line;
3342 curcop->cop_line = copline;
3343 warn(const_sv ? "Constant subroutine %s redefined"
3344 : "Subroutine %s redefined", name);
3345 curcop->cop_line = oldline;
3351 if (cv) { /* must reuse cv if autoloaded */
3353 CvFLAGS(cv) = CvFLAGS(compcv);
3354 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3355 CvOUTSIDE(compcv) = 0;
3356 CvPADLIST(cv) = CvPADLIST(compcv);
3357 CvPADLIST(compcv) = 0;
3358 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3359 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3360 SvREFCNT_dec(compcv);
3370 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3371 CvFILEGV(cv) = curcop->cop_filegv;
3372 CvSTASH(cv) = curstash;
3375 New(666, CvMUTEXP(cv), 1, perl_mutex);
3376 MUTEX_INIT(CvMUTEXP(cv));
3377 #endif /* USE_THREADS */
3380 sv_setpv((SV*)cv, ps);
3386 char *s = strrchr(name, ':');
3388 if (strEQ(s, "BEGIN")) {
3390 "BEGIN not safe after errors--compilation aborted";
3394 /* force display of errors found but not reported */
3395 sv_catpv(ERRSV, not_safe);
3396 croak("%s", SvPVx(ERRSV, na));
3407 if (AvFILLp(comppad_name) < AvFILLp(comppad))
3408 av_store(comppad_name, AvFILLp(comppad), Nullsv);
3411 SV **namep = AvARRAY(comppad_name);
3412 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3415 if (SvIMMORTAL(curpad[ix]))
3418 * The only things that a clonable function needs in its
3419 * pad are references to outer lexicals and anonymous subs.
3420 * The rest are created anew during cloning.
3422 if (!((namesv = namep[ix]) != Nullsv &&
3423 namesv != &sv_undef &&
3425 *SvPVX(namesv) == '&')))
3427 SvREFCNT_dec(curpad[ix]);
3428 curpad[ix] = Nullsv;
3433 AV *av = newAV(); /* Will be @_ */
3435 av_store(comppad, 0, (SV*)av);
3436 AvFLAGS(av) = AVf_REIFY;
3438 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3439 if (SvIMMORTAL(curpad[ix]))
3441 if (!SvPADMY(curpad[ix]))
3442 SvPADTMP_on(curpad[ix]);
3446 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3447 CvSTART(cv) = LINKLIST(CvROOT(cv));
3448 CvROOT(cv)->op_next = 0;
3454 if (PERLDB_SUBLINE && curstash != debstash) {
3455 SV *sv = NEWSV(0,0);
3456 SV *tmpstr = sv_newmortal();
3457 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3461 sv_setpvf(sv, "%_:%ld-%ld",
3462 GvSV(curcop->cop_filegv),
3463 (long)subline, (long)curcop->cop_line);
3464 gv_efullname3(tmpstr, gv, Nullch);
3465 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3466 hv = GvHVn(db_postponed);
3467 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3468 && (cv = GvCV(db_postponed))) {
3473 perl_call_sv((SV*)cv, G_DISCARD);
3477 if ((s = strrchr(name,':')))
3481 if (strEQ(s, "BEGIN")) {
3482 I32 oldscope = scopestack_ix;
3484 SAVESPTR(compiling.cop_filegv);
3485 SAVEI16(compiling.cop_line);
3491 DEBUG_x( dump_sub(gv) );
3492 av_push(beginav, (SV *)cv);
3494 call_list(oldscope, beginav);
3496 curcop = &compiling;
3499 else if (strEQ(s, "END") && !error_count) {
3502 av_unshift(endav, 1);
3503 av_store(endav, 0, (SV *)cv);
3506 else if (strEQ(s, "INIT") && !error_count) {
3509 av_push(initav, SvREFCNT_inc(cv));
3520 newCONSTSUB(HV *stash, char *name, SV *sv)
3523 U32 oldhints = hints;
3524 HV *old_cop_stash = curcop->cop_stash;
3525 HV *old_curstash = curstash;
3526 line_t oldline = curcop->cop_line;
3527 curcop->cop_line = copline;
3529 hints &= ~HINT_BLOCK_SCOPE;
3531 curstash = curcop->cop_stash = stash;
3534 start_subparse(FALSE, 0),
3535 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3536 newSVOP(OP_CONST, 0, &sv_no), /* SvPV(&sv_no) == "" -- GMB */
3537 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3541 curcop->cop_stash = old_cop_stash;
3542 curstash = old_curstash;
3543 curcop->cop_line = oldline;
3547 newXS(char *name, void (*subaddr) (CV *), char *filename)
3550 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3553 if (cv = (name ? GvCV(gv) : Nullcv)) {
3555 /* just a cached method */
3559 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3560 /* already defined (or promised) */
3561 if (dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3562 && HvNAME(GvSTASH(CvGV(cv)))
3563 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3564 line_t oldline = curcop->cop_line;
3565 curcop->cop_line = copline;
3566 warn("Subroutine %s redefined",name);
3567 curcop->cop_line = oldline;
3574 if (cv) /* must reuse cv if autoloaded */
3577 cv = (CV*)NEWSV(1105,0);
3578 sv_upgrade((SV *)cv, SVt_PVCV);
3585 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3587 New(666, CvMUTEXP(cv), 1, perl_mutex);
3588 MUTEX_INIT(CvMUTEXP(cv));
3590 #endif /* USE_THREADS */
3591 CvFILEGV(cv) = gv_fetchfile(filename);
3592 CvXSUB(cv) = subaddr;
3595 char *s = strrchr(name,':');
3600 if (strEQ(s, "BEGIN")) {
3603 av_push(beginav, (SV *)cv);
3606 else if (strEQ(s, "END")) {
3609 av_unshift(endav, 1);
3610 av_store(endav, 0, (SV *)cv);
3613 else if (strEQ(s, "INIT")) {
3616 av_push(initav, (SV *)cv);
3626 newFORM(I32 floor, OP *o, OP *block)
3635 name = SvPVx(cSVOPo->op_sv, na);
3638 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3640 if (cv = GvFORM(gv)) {
3642 line_t oldline = curcop->cop_line;
3644 curcop->cop_line = copline;
3645 warn("Format %s redefined",name);
3646 curcop->cop_line = oldline;
3652 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3653 CvFILEGV(cv) = curcop->cop_filegv;
3655 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3656 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3657 SvPADTMP_on(curpad[ix]);
3660 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3661 CvSTART(cv) = LINKLIST(CvROOT(cv));
3662 CvROOT(cv)->op_next = 0;
3672 return newUNOP(OP_REFGEN, 0,
3673 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3679 return newUNOP(OP_REFGEN, 0,
3680 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3684 newANONSUB(I32 floor, OP *proto, OP *block)
3686 return newUNOP(OP_REFGEN, 0,
3687 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3693 switch (o->op_type) {
3695 o->op_type = OP_PADAV;
3696 o->op_ppaddr = ppaddr[OP_PADAV];
3697 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3700 o->op_type = OP_RV2AV;
3701 o->op_ppaddr = ppaddr[OP_RV2AV];
3706 warn("oops: oopsAV");
3715 switch (o->op_type) {
3718 o->op_type = OP_PADHV;
3719 o->op_ppaddr = ppaddr[OP_PADHV];
3720 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3724 o->op_type = OP_RV2HV;
3725 o->op_ppaddr = ppaddr[OP_RV2HV];
3730 warn("oops: oopsHV");
3739 if (o->op_type == OP_PADANY) {
3740 o->op_type = OP_PADAV;
3741 o->op_ppaddr = ppaddr[OP_PADAV];
3744 return newUNOP(OP_RV2AV, 0, scalar(o));
3748 newGVREF(I32 type, OP *o)
3750 if (type == OP_MAPSTART)
3751 return newUNOP(OP_NULL, 0, o);
3752 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3758 if (o->op_type == OP_PADANY) {
3759 o->op_type = OP_PADHV;
3760 o->op_ppaddr = ppaddr[OP_PADHV];
3763 return newUNOP(OP_RV2HV, 0, scalar(o));
3769 croak("NOT IMPL LINE %d",__LINE__);
3775 newCVREF(I32 flags, OP *o)
3777 return newUNOP(OP_RV2CV, flags, scalar(o));
3783 if (o->op_type == OP_PADANY) {
3784 o->op_type = OP_PADSV;
3785 o->op_ppaddr = ppaddr[OP_PADSV];
3788 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3789 o->op_flags |= OPpDONE_SVREF;
3792 return newUNOP(OP_RV2SV, 0, scalar(o));
3795 /* Check routines. */
3803 name = NEWSV(1106,0);
3804 sv_upgrade(name, SVt_PVNV);
3805 sv_setpvn(name, "&", 1);
3808 ix = pad_alloc(o->op_type, SVs_PADMY);
3809 av_store(comppad_name, ix, name);
3810 av_store(comppad, ix, cSVOPo->op_sv);
3811 SvPADMY_on(cSVOPo->op_sv);
3812 cSVOPo->op_sv = Nullsv;
3813 cSVOPo->op_targ = ix;
3820 o->op_private = hints;
3827 if (cUNOPo->op_first->op_type == OP_CONCAT)
3828 o->op_flags |= OPf_STACKED;
3835 if (o->op_flags & OPf_KIDS) {
3838 OPCODE type = o->op_type;
3839 o = modkids(ck_fun(o), type);
3840 kid = cUNOPo->op_first;
3841 newop = kUNOP->op_first->op_sibling;
3843 (newop->op_sibling ||
3844 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3845 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3846 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3850 op_free(kUNOP->op_first);
3851 kUNOP->op_first = newop;
3853 o->op_ppaddr = ppaddr[++o->op_type];
3862 if (o->op_flags & OPf_KIDS) {
3863 OP *kid = cUNOPo->op_first;
3864 if (kid->op_type == OP_HSLICE)
3865 o->op_private |= OPpSLICE;
3866 else if (kid->op_type != OP_HELEM)
3867 croak("%s argument is not a HASH element or slice",
3868 op_desc[o->op_type]);
3877 I32 type = o->op_type;
3879 if (o->op_flags & OPf_KIDS) {
3880 if (cLISTOPo->op_first->op_type == OP_STUB) {
3882 o = newUNOP(type, OPf_SPECIAL,
3883 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3893 hints |= HINT_BLOCK_SCOPE;
3894 if (o->op_flags & OPf_KIDS) {
3895 SVOP *kid = (SVOP*)cUNOPo->op_first;
3898 o->op_flags &= ~OPf_KIDS;
3901 else if (kid->op_type == OP_LINESEQ) {
3904 kid->op_next = o->op_next;
3905 cUNOPo->op_first = 0;
3908 Newz(1101, enter, 1, LOGOP);
3909 enter->op_type = OP_ENTERTRY;
3910 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3911 enter->op_private = 0;
3913 /* establish postfix order */
3914 enter->op_next = (OP*)enter;
3916 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3917 o->op_type = OP_LEAVETRY;
3918 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3919 enter->op_other = o;
3927 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
3929 o->op_targ = (PADOFFSET)hints;
3937 if (o->op_flags & OPf_STACKED) {
3939 kid = cUNOPo->op_first->op_sibling;
3940 if (kid->op_type == OP_RV2GV)
3952 if (o->op_flags & OPf_KIDS) {
3953 OP *kid = cUNOPo->op_first;
3954 if (kid->op_type != OP_HELEM)
3955 croak("%s argument is not a HASH element", op_desc[o->op_type]);
3962 ck_gvconst(register OP *o)
3964 o = fold_constants(o);
3965 if (o->op_type == OP_CONST)
3971 ck_rvconst(register OP *o)
3974 SVOP *kid = (SVOP*)cUNOPo->op_first;
3976 o->op_private |= (hints & HINT_STRICT_REFS);
3977 if (kid->op_type == OP_CONST) {
3982 name = SvPV(kid->op_sv, na);
3983 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3984 char *badthing = Nullch;
3985 switch (o->op_type) {
3987 badthing = "a SCALAR";
3990 badthing = "an ARRAY";
3993 badthing = "a HASH";
3998 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4002 * This is a little tricky. We only want to add the symbol if we
4003 * didn't add it in the lexer. Otherwise we get duplicate strict
4004 * warnings. But if we didn't add it in the lexer, we must at
4005 * least pretend like we wanted to add it even if it existed before,
4006 * or we get possible typo warnings. OPpCONST_ENTERED says
4007 * whether the lexer already added THIS instance of this symbol.
4009 iscv = (o->op_type == OP_RV2CV) * 2;
4011 gv = gv_fetchpv(name,
4012 iscv | !(kid->op_private & OPpCONST_ENTERED),
4015 : o->op_type == OP_RV2SV
4017 : o->op_type == OP_RV2AV
4019 : o->op_type == OP_RV2HV
4022 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4024 kid->op_type = OP_GV;
4025 SvREFCNT_dec(kid->op_sv);
4026 kid->op_sv = SvREFCNT_inc(gv);
4036 I32 type = o->op_type;
4038 if (o->op_flags & OPf_REF)
4041 if (o->op_flags & OPf_KIDS) {
4042 SVOP *kid = (SVOP*)cUNOPo->op_first;
4044 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4045 OP *newop = newGVOP(type, OPf_REF,
4046 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4053 if (type == OP_FTTTY)
4054 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4057 return newUNOP(type, 0, newDEFSVOP());
4070 int type = o->op_type;
4071 register I32 oa = opargs[type] >> OASHIFT;
4073 if (o->op_flags & OPf_STACKED) {
4074 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4077 return no_fh_allowed(o);
4080 if (o->op_flags & OPf_KIDS) {
4081 tokid = &cLISTOPo->op_first;
4082 kid = cLISTOPo->op_first;
4083 if (kid->op_type == OP_PUSHMARK ||
4084 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4086 tokid = &kid->op_sibling;
4087 kid = kid->op_sibling;
4089 if (!kid && opargs[type] & OA_DEFGV)
4090 *tokid = kid = newDEFSVOP();
4094 sibl = kid->op_sibling;
4108 if (kid->op_type == OP_CONST &&
4109 (kid->op_private & OPpCONST_BARE)) {
4110 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4111 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4112 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4114 warn("Array @%s missing the @ in argument %ld of %s()",
4115 name, (long)numargs, op_desc[type]);
4118 kid->op_sibling = sibl;
4121 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4122 bad_type(numargs, "array", op_desc[o->op_type], kid);
4126 if (kid->op_type == OP_CONST &&
4127 (kid->op_private & OPpCONST_BARE)) {
4128 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4129 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4130 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4132 warn("Hash %%%s missing the %% in argument %ld of %s()",
4133 name, (long)numargs, op_desc[type]);
4136 kid->op_sibling = sibl;
4139 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4140 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4145 OP *newop = newUNOP(OP_NULL, 0, kid);
4146 kid->op_sibling = 0;
4148 newop->op_next = newop;
4150 kid->op_sibling = sibl;
4155 if (kid->op_type != OP_GV) {
4156 if (kid->op_type == OP_CONST &&
4157 (kid->op_private & OPpCONST_BARE)) {
4158 OP *newop = newGVOP(OP_GV, 0,
4159 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4165 kid->op_sibling = 0;
4166 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4168 kid->op_sibling = sibl;
4174 mod(scalar(kid), type);
4178 tokid = &kid->op_sibling;
4179 kid = kid->op_sibling;
4181 o->op_private |= numargs;
4183 return too_many_arguments(o,op_desc[o->op_type]);
4186 else if (opargs[type] & OA_DEFGV) {
4188 return newUNOP(type, 0, newDEFSVOP());
4192 while (oa & OA_OPTIONAL)
4194 if (oa && oa != OA_LIST)
4195 return too_few_arguments(o,op_desc[o->op_type]);
4205 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4206 append_elem(OP_GLOB, o, newDEFSVOP());
4208 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4209 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4211 if (gv && GvIMPORTED_CV(gv)) {
4212 static int glob_index;
4214 append_elem(OP_GLOB, o,
4215 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4216 o->op_type = OP_LIST;
4217 o->op_ppaddr = ppaddr[OP_LIST];
4218 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4219 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4220 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4221 append_elem(OP_LIST, o,
4222 scalar(newUNOP(OP_RV2CV, 0,
4223 newGVOP(OP_GV, 0, gv)))));
4224 o = newUNOP(OP_NULL, 0, ck_subr(o));
4225 o->op_targ = OP_GLOB; /* hint at what it used to be */
4228 gv = newGVgen("main");
4230 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4240 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4242 o->op_ppaddr = ppaddr[OP_GREPSTART];
4243 Newz(1101, gwop, 1, LOGOP);
4245 if (o->op_flags & OPf_STACKED) {
4248 kid = cLISTOPo->op_first->op_sibling;
4249 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4252 kid->op_next = (OP*)gwop;
4253 o->op_flags &= ~OPf_STACKED;
4255 kid = cLISTOPo->op_first->op_sibling;
4256 if (type == OP_MAPWHILE)
4263 kid = cLISTOPo->op_first->op_sibling;
4264 if (kid->op_type != OP_NULL)
4265 croak("panic: ck_grep");
4266 kid = kUNOP->op_first;
4268 gwop->op_type = type;
4269 gwop->op_ppaddr = ppaddr[type];
4270 gwop->op_first = listkids(o);
4271 gwop->op_flags |= OPf_KIDS;
4272 gwop->op_private = 1;
4273 gwop->op_other = LINKLIST(kid);
4274 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4275 kid->op_next = (OP*)gwop;
4277 kid = cLISTOPo->op_first->op_sibling;
4278 if (!kid || !kid->op_sibling)
4279 return too_few_arguments(o,op_desc[o->op_type]);
4280 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4281 mod(kid, OP_GREPSTART);
4289 if (o->op_flags & OPf_KIDS) {
4290 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4291 if (kid && kid->op_type == OP_CONST)
4292 fbm_compile(((SVOP*)kid)->op_sv, 0);
4298 ck_lengthconst(OP *o)
4300 /* XXX length optimization goes here */
4307 OPCODE type = o->op_type;
4308 return modkids(ck_fun(o), type);
4314 OPCODE type = o->op_type;
4315 return refkids(ck_fun(o), type);
4323 kid = cLISTOPo->op_first;
4326 kid = cLISTOPo->op_first;
4328 if (kid->op_type == OP_PUSHMARK)
4329 kid = kid->op_sibling;
4330 if (kid && o->op_flags & OPf_STACKED)
4331 kid = kid->op_sibling;
4332 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4333 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4334 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4335 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4336 cLISTOPo->op_first->op_sibling = kid;
4337 cLISTOPo->op_last = kid;
4338 kid = kid->op_sibling;
4343 append_elem(o->op_type, o, newDEFSVOP());
4349 if (hints & HINT_LOCALE)
4350 o->op_private |= OPpLOCALE;
4357 ck_fun_locale(OP *o)
4363 if (hints & HINT_LOCALE)
4364 o->op_private |= OPpLOCALE;
4375 if (hints & HINT_LOCALE)
4376 o->op_private |= OPpLOCALE;
4385 o->op_private |= OPpRUNTIME;
4398 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4399 o->op_private |= OPpREPEAT_DOLIST;
4400 cBINOPo->op_first = force_list(cBINOPo->op_first);
4410 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4411 SVOP *kid = (SVOP*)cUNOPo->op_first;
4413 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4415 for (s = SvPVX(kid->op_sv); *s; s++) {
4416 if (*s == ':' && s[1] == ':') {
4418 Move(s+2, s+1, strlen(s+2)+1, char);
4419 --SvCUR(kid->op_sv);
4422 sv_catpvn(kid->op_sv, ".pm", 3);
4431 croak("NOT IMPL LINE %d",__LINE__);
4440 if (o->op_flags & OPf_KIDS) {
4441 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4442 if (kid && kid->op_sibling) {
4443 o->op_type = OP_SSELECT;
4444 o->op_ppaddr = ppaddr[OP_SSELECT];
4446 return fold_constants(o);
4450 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4451 if (kid && kid->op_type == OP_RV2GV)
4452 kid->op_private &= ~HINT_STRICT_REFS;
4459 I32 type = o->op_type;
4461 if (!(o->op_flags & OPf_KIDS)) {
4466 if (!CvUNIQUE(compcv)) {
4467 argop = newOP(OP_PADAV, OPf_REF);
4468 argop->op_targ = 0; /* curpad[0] is @_ */
4471 argop = newUNOP(OP_RV2AV, 0,
4472 scalar(newGVOP(OP_GV, 0,
4473 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4476 argop = newUNOP(OP_RV2AV, 0,
4477 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(compcv) ?
4478 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4479 #endif /* USE_THREADS */
4480 return newUNOP(type, 0, scalar(argop));
4482 return scalar(modkids(ck_fun(o), type));
4490 if (hints & HINT_LOCALE)
4491 o->op_private |= OPpLOCALE;
4494 if (o->op_flags & OPf_STACKED) {
4495 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4497 kid = kUNOP->op_first; /* get past rv2gv */
4499 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4501 if (kid->op_type == OP_SCOPE) {
4505 else if (kid->op_type == OP_LEAVE) {
4506 if (o->op_type == OP_SORT) {
4507 null(kid); /* wipe out leave */
4510 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4511 if (k->op_next == kid)
4516 kid->op_next = 0; /* just disconnect the leave */
4517 k = kLISTOP->op_first;
4521 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4522 null(kid); /* wipe out rv2gv */
4523 if (o->op_type == OP_SORT)
4527 o->op_flags |= OPf_SPECIAL;
4539 if (o->op_flags & OPf_STACKED)
4540 return no_fh_allowed(o);
4542 kid = cLISTOPo->op_first;
4543 if (kid->op_type != OP_NULL)
4544 croak("panic: ck_split");
4545 kid = kid->op_sibling;
4546 op_free(cLISTOPo->op_first);
4547 cLISTOPo->op_first = kid;
4549 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4550 cLISTOPo->op_last = kid; /* There was only one element previously */
4553 if (kid->op_type != OP_MATCH) {
4554 OP *sibl = kid->op_sibling;
4555 kid->op_sibling = 0;
4556 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4557 if (cLISTOPo->op_first == cLISTOPo->op_last)
4558 cLISTOPo->op_last = kid;
4559 cLISTOPo->op_first = kid;
4560 kid->op_sibling = sibl;
4563 kid->op_type = OP_PUSHRE;
4564 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4567 if (!kid->op_sibling)
4568 append_elem(OP_SPLIT, o, newDEFSVOP());
4570 kid = kid->op_sibling;
4573 if (!kid->op_sibling)
4574 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4576 kid = kid->op_sibling;
4579 if (kid->op_sibling)
4580 return too_many_arguments(o,op_desc[o->op_type]);
4589 OP *prev = ((cUNOPo->op_first->op_sibling)
4590 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4591 OP *o2 = prev->op_sibling;
4599 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4600 if (cvop->op_type == OP_RV2CV) {
4602 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4603 null(cvop); /* disable rv2cv */
4604 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4605 if (tmpop->op_type == OP_GV) {
4606 cv = GvCVu(tmpop->op_sv);
4607 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4608 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4609 proto = SvPV((SV*)cv, na);
4613 o->op_private |= (hints & HINT_STRICT_REFS);
4614 if (PERLDB_SUB && curstash != debstash)
4615 o->op_private |= OPpENTERSUB_DB;
4616 while (o2 != cvop) {
4620 return too_many_arguments(o, gv_ename(namegv));
4638 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4639 bad_type(arg, "block", gv_ename(namegv), o2);
4644 if (o2->op_type == OP_RV2GV)
4648 OP* sib = kid->op_sibling;
4649 kid->op_sibling = 0;
4650 o2 = newUNOP(OP_RV2GV, 0, kid);
4651 o2->op_sibling = sib;
4652 prev->op_sibling = o2;
4660 if (o2->op_type != OP_RV2GV)
4661 bad_type(arg, "symbol", gv_ename(namegv), o2);
4664 if (o2->op_type != OP_RV2CV)
4665 bad_type(arg, "sub", gv_ename(namegv), o2);
4668 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4669 bad_type(arg, "scalar", gv_ename(namegv), o2);
4672 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4673 bad_type(arg, "array", gv_ename(namegv), o2);
4676 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4677 bad_type(arg, "hash", gv_ename(namegv), o2);
4681 OP* sib = kid->op_sibling;
4682 kid->op_sibling = 0;
4683 o2 = newUNOP(OP_REFGEN, 0, kid);
4684 o2->op_sibling = sib;
4685 prev->op_sibling = o2;
4696 croak("Malformed prototype for %s: %s",
4697 gv_ename(namegv), SvPV((SV*)cv, na));
4702 mod(o2, OP_ENTERSUB);
4704 o2 = o2->op_sibling;
4706 if (proto && !optional &&
4707 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4708 return too_few_arguments(o, gv_ename(namegv));
4715 SvREADONLY_on(cSVOPo->op_sv);
4722 if (o->op_flags & OPf_KIDS) {
4723 SVOP *kid = (SVOP*)cUNOPo->op_first;
4725 if (kid->op_type == OP_NULL)
4726 kid = (SVOP*)kid->op_sibling;
4728 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4729 o->op_flags |= OPf_SPECIAL;
4734 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4737 peep(register OP *o)
4740 register OP* oldop = 0;
4741 if (!o || o->op_seq)
4746 for (; o; o = o->op_next) {
4752 switch (o->op_type) {
4755 curcop = ((COP*)o); /* for warnings */
4756 o->op_seq = op_seqmax++;
4767 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
4769 o->op_seq = op_seqmax++;
4772 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4773 o->op_seq = op_seqmax++;
4774 break; /* Scalar stub must produce undef. List stub is noop */
4778 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4785 if (oldop && o->op_next) {
4786 oldop->op_next = o->op_next;
4789 o->op_seq = op_seqmax++;
4793 if (o->op_next->op_type == OP_RV2SV) {
4794 if (!(o->op_next->op_private & OPpDEREF)) {
4796 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4797 o->op_next = o->op_next->op_next;
4798 o->op_type = OP_GVSV;
4799 o->op_ppaddr = ppaddr[OP_GVSV];
4802 else if (o->op_next->op_type == OP_RV2AV) {
4803 OP* pop = o->op_next->op_next;
4805 if (pop->op_type == OP_CONST &&
4806 (op = pop->op_next) &&
4807 pop->op_next->op_type == OP_AELEM &&
4808 !(pop->op_next->op_private &
4809 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4810 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4814 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4818 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4819 o->op_next = pop->op_next->op_next;
4820 o->op_type = OP_AELEMFAST;
4821 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4822 o->op_private = (U8)i;
4823 GvAVn(((GVOP*)o)->op_gv);
4826 o->op_seq = op_seqmax++;
4830 if (o->op_next->op_type == OP_RV2AV
4831 && (o->op_next->op_flags && OPf_REF))
4834 o->op_next = o->op_next->op_next;
4839 if (o->op_next->op_type == OP_RV2HV
4840 && (o->op_next->op_flags && OPf_REF))
4843 o->op_next = o->op_next->op_next;
4851 o->op_seq = op_seqmax++;
4852 while (cLOGOP->op_other->op_type == OP_NULL)
4853 cLOGOP->op_other = cLOGOP->op_other->op_next;
4854 peep(cLOGOP->op_other);
4858 o->op_seq = op_seqmax++;
4859 peep(cCONDOP->op_true);
4860 peep(cCONDOP->op_false);
4864 o->op_seq = op_seqmax++;
4865 peep(cLOOP->op_redoop);
4866 peep(cLOOP->op_nextop);
4867 peep(cLOOP->op_lastop);
4872 o->op_seq = op_seqmax++;
4873 peep(cPMOP->op_pmreplstart);
4877 o->op_seq = op_seqmax++;
4878 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4879 if (o->op_next->op_sibling &&
4880 o->op_next->op_sibling->op_type != OP_DIE) {
4881 line_t oldline = curcop->cop_line;
4883 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4884 warn("Statement unlikely to be reached");
4885 warn("(Maybe you meant system() when you said exec()?)\n");
4886 curcop->cop_line = oldline;
4900 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4901 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4903 rop = (UNOP*)((BINOP*)o)->op_first;
4904 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4906 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4907 if (!SvOBJECT(lexname))
4909 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4910 if (!fields || !GvHV(*fields))
4912 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4913 key = SvPV(*svp, keylen);
4914 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4916 croak("No such field \"%s\" in variable %s of type %s",
4917 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4919 ind = SvIV(*indsvp);
4921 croak("Bad index while coercing array into hash");
4922 rop->op_type = OP_RV2AV;
4923 rop->op_ppaddr = ppaddr[OP_RV2AV];
4924 o->op_type = OP_AELEM;
4925 o->op_ppaddr = ppaddr[OP_AELEM];
4927 *svp = newSViv(ind);
4932 o->op_seq = op_seqmax++;