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)
1049 mod(OP *o, I32 type)
1055 if (!o || error_count)
1058 switch (o->op_type) {
1063 if (!(o->op_private & (OPpCONST_ARYBASE)))
1065 if (eval_start && eval_start->op_type == OP_CONST) {
1066 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1070 SAVEI32(compiling.cop_arybase);
1071 compiling.cop_arybase = 0;
1073 else if (type == OP_REFGEN)
1076 croak("That use of $[ is unsupported");
1079 if (o->op_flags & OPf_PARENS)
1083 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1084 !(o->op_flags & OPf_STACKED)) {
1085 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1086 o->op_ppaddr = ppaddr[OP_RV2CV];
1087 assert(cUNOPo->op_first->op_type == OP_NULL);
1088 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1094 /* grep, foreach, subcalls, refgen */
1095 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1097 yyerror(form("Can't modify %s in %s",
1098 op_desc[o->op_type],
1099 type ? op_desc[type] : "local"));
1113 case OP_RIGHT_SHIFT:
1122 if (!(o->op_flags & OPf_STACKED))
1128 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1134 if (!type && cUNOPo->op_first->op_type != OP_GV)
1135 croak("Can't localize through a reference");
1136 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1138 return o; /* Treat \(@foo) like ordinary list. */
1142 if (scalar_mod_type(o, type))
1144 ref(cUNOPo->op_first, o->op_type);
1156 if (!type && cUNOPo->op_first->op_type != OP_GV)
1157 croak("Can't localize through a reference");
1158 ref(cUNOPo->op_first, o->op_type);
1162 hints |= HINT_BLOCK_SCOPE;
1171 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1172 return o; /* Treat \(@foo) like ordinary list. */
1173 if (scalar_mod_type(o, type))
1179 croak("Can't localize lexical variable %s",
1180 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1185 modcount++; /* XXX ??? */
1187 #endif /* USE_THREADS */
1193 if (type != OP_SASSIGN)
1199 pad_free(o->op_targ);
1200 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1201 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1202 if (o->op_flags & OPf_KIDS)
1203 mod(cBINOPo->op_first->op_sibling, type);
1208 ref(cBINOPo->op_first, o->op_type);
1209 if (type == OP_ENTERSUB &&
1210 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1211 o->op_private |= OPpLVAL_DEFER;
1218 if (o->op_flags & OPf_KIDS)
1219 mod(cLISTOPo->op_last, type);
1223 if (!(o->op_flags & OPf_KIDS))
1225 if (o->op_targ != OP_LIST) {
1226 mod(cBINOPo->op_first, type);
1231 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1235 o->op_flags |= OPf_MOD;
1237 if (type == OP_AASSIGN || type == OP_SASSIGN)
1238 o->op_flags |= OPf_SPECIAL|OPf_REF;
1240 o->op_private |= OPpLVAL_INTRO;
1241 o->op_flags &= ~OPf_SPECIAL;
1242 hints |= HINT_BLOCK_SCOPE;
1244 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1245 o->op_flags |= OPf_REF;
1250 scalar_mod_type(OP *o, I32 type)
1254 if (o->op_type == OP_RV2GV)
1278 case OP_RIGHT_SHIFT:
1285 case OP_ANDASSIGN: /* may work later */
1286 case OP_ORASSIGN: /* may work later */
1294 refkids(OP *o, I32 type)
1297 if (o && o->op_flags & OPf_KIDS) {
1298 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1305 ref(OP *o, I32 type)
1309 if (!o || error_count)
1312 switch (o->op_type) {
1314 if ((type == OP_DEFINED || type == OP_LOCK) &&
1315 !(o->op_flags & OPf_STACKED)) {
1316 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1317 o->op_ppaddr = ppaddr[OP_RV2CV];
1318 assert(cUNOPo->op_first->op_type == OP_NULL);
1319 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1320 o->op_flags |= OPf_SPECIAL;
1325 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1329 ref(cUNOPo->op_first, o->op_type);
1332 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1333 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1334 : type == OP_RV2HV ? OPpDEREF_HV
1336 o->op_flags |= OPf_MOD;
1341 o->op_flags |= OPf_MOD; /* XXX ??? */
1346 o->op_flags |= OPf_REF;
1349 ref(cUNOPo->op_first, o->op_type);
1354 o->op_flags |= OPf_REF;
1359 if (!(o->op_flags & OPf_KIDS))
1361 ref(cBINOPo->op_first, type);
1365 ref(cBINOPo->op_first, o->op_type);
1366 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1367 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1368 : type == OP_RV2HV ? OPpDEREF_HV
1370 o->op_flags |= OPf_MOD;
1378 if (!(o->op_flags & OPf_KIDS))
1380 ref(cLISTOPo->op_last, type);
1395 if (!o || error_count)
1399 if (type == OP_LIST) {
1400 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1402 } else if (type == OP_UNDEF) {
1404 } else if (type != OP_PADSV &&
1407 type != OP_PUSHMARK)
1409 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1412 o->op_flags |= OPf_MOD;
1413 o->op_private |= OPpLVAL_INTRO;
1421 o->op_flags |= OPf_PARENS;
1426 bind_match(I32 type, OP *left, OP *right)
1431 (left->op_type == OP_RV2AV ||
1432 left->op_type == OP_RV2HV ||
1433 left->op_type == OP_PADAV ||
1434 left->op_type == OP_PADHV)) {
1435 char *desc = op_desc[(right->op_type == OP_SUBST ||
1436 right->op_type == OP_TRANS)
1437 ? right->op_type : OP_MATCH];
1438 char *sample = ((left->op_type == OP_RV2AV ||
1439 left->op_type == OP_PADAV)
1440 ? "@array" : "%hash");
1441 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1444 if (right->op_type == OP_MATCH ||
1445 right->op_type == OP_SUBST ||
1446 right->op_type == OP_TRANS) {
1447 right->op_flags |= OPf_STACKED;
1448 if (right->op_type != OP_MATCH)
1449 left = mod(left, right->op_type);
1450 if (right->op_type == OP_TRANS)
1451 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1453 o = prepend_elem(right->op_type, scalar(left), right);
1455 return newUNOP(OP_NOT, 0, scalar(o));
1459 return bind_match(type, left,
1460 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1468 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1469 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1476 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1477 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1478 o->op_type = OP_LEAVE;
1479 o->op_ppaddr = ppaddr[OP_LEAVE];
1482 if (o->op_type == OP_LINESEQ) {
1484 o->op_type = OP_SCOPE;
1485 o->op_ppaddr = ppaddr[OP_SCOPE];
1486 kid = ((LISTOP*)o)->op_first;
1487 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1488 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1493 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1500 block_start(int full)
1503 int retval = savestack_ix;
1504 SAVEI32(comppad_name_floor);
1506 if ((comppad_name_fill = AvFILLp(comppad_name)) > 0)
1507 comppad_name_floor = comppad_name_fill;
1509 comppad_name_floor = 0;
1511 SAVEI32(min_intro_pending);
1512 SAVEI32(max_intro_pending);
1513 min_intro_pending = 0;
1514 SAVEI32(comppad_name_fill);
1515 SAVEI32(padix_floor);
1516 padix_floor = padix;
1517 pad_reset_pending = FALSE;
1519 hints &= ~HINT_BLOCK_SCOPE;
1524 block_end(I32 floor, OP *seq)
1527 int needblockscope = hints & HINT_BLOCK_SCOPE;
1528 OP* retval = scalarseq(seq);
1530 pad_reset_pending = FALSE;
1532 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1533 pad_leavemy(comppad_name_fill);
1542 OP *o = newOP(OP_THREADSV, 0);
1543 o->op_targ = find_threadsv("_");
1546 return newSVREF(newGVOP(OP_GV, 0, defgv));
1547 #endif /* USE_THREADS */
1555 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1556 eval_start = linklist(eval_root);
1557 eval_root->op_next = 0;
1563 main_root = scope(sawparens(scalarvoid(o)));
1564 curcop = &compiling;
1565 main_start = LINKLIST(main_root);
1566 main_root->op_next = 0;
1570 /* Register with debugger */
1572 CV *cv = perl_get_cv("DB::postponed", FALSE);
1576 XPUSHs((SV*)compiling.cop_filegv);
1578 perl_call_sv((SV*)cv, G_DISCARD);
1585 localize(OP *o, I32 lex)
1587 if (o->op_flags & OPf_PARENS)
1590 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1592 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1593 if (*s == ';' || *s == '=')
1594 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1598 in_my_stash = Nullhv;
1602 return mod(o, OP_NULL); /* a bit kludgey */
1608 if (o->op_type == OP_LIST) {
1611 o2 = newOP(OP_THREADSV, 0);
1612 o2->op_targ = find_threadsv(";");
1614 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1615 #endif /* USE_THREADS */
1616 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1622 fold_constants(register OP *o)
1626 I32 type = o->op_type;
1629 if (opargs[type] & OA_RETSCALAR)
1631 if (opargs[type] & OA_TARGET)
1632 o->op_targ = pad_alloc(type, SVs_PADTMP);
1634 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1635 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1637 if (!(opargs[type] & OA_FOLDCONST))
1652 if (o->op_private & OPpLOCALE)
1657 goto nope; /* Don't try to run w/ errors */
1659 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1660 if (curop->op_type != OP_CONST &&
1661 curop->op_type != OP_LIST &&
1662 curop->op_type != OP_SCALAR &&
1663 curop->op_type != OP_NULL &&
1664 curop->op_type != OP_PUSHMARK) {
1669 curop = LINKLIST(o);
1674 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1675 pad_swipe(o->op_targ);
1676 else if (SvTEMP(sv)) { /* grab mortal temp? */
1677 (void)SvREFCNT_inc(sv);
1681 if (type == OP_RV2GV)
1682 return newGVOP(OP_GV, 0, (GV*)sv);
1684 /* try to smush double to int, but don't smush -2.0 to -2 */
1685 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1689 if ((double)iv == SvNV(sv)) {
1694 SvIOK_off(sv); /* undo SvIV() damage */
1696 return newSVOP(OP_CONST, 0, sv);
1700 if (!(opargs[type] & OA_OTHERINT))
1703 if (!(hints & HINT_INTEGER)) {
1704 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1707 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1708 if (curop->op_type == OP_CONST) {
1709 if (SvIOK(((SVOP*)curop)->op_sv))
1713 if (opargs[curop->op_type] & OA_RETINTEGER)
1717 o->op_ppaddr = ppaddr[++(o->op_type)];
1724 gen_constant_list(register OP *o)
1728 I32 oldtmps_floor = tmps_floor;
1732 return o; /* Don't attempt to run with errors */
1734 op = curop = LINKLIST(o);
1740 tmps_floor = oldtmps_floor;
1742 o->op_type = OP_RV2AV;
1743 o->op_ppaddr = ppaddr[OP_RV2AV];
1744 curop = ((UNOP*)o)->op_first;
1745 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1752 convert(I32 type, I32 flags, OP *o)
1757 if (!o || o->op_type != OP_LIST)
1758 o = newLISTOP(OP_LIST, 0, o, Nullop);
1760 o->op_flags &= ~OPf_WANT;
1762 if (!(opargs[type] & OA_MARK))
1763 null(cLISTOPo->op_first);
1766 o->op_ppaddr = ppaddr[type];
1767 o->op_flags |= flags;
1769 o = CHECKOP(type, o);
1770 if (o->op_type != type)
1773 if (cLISTOPo->op_children < 7) {
1774 /* XXX do we really need to do this if we're done appending?? */
1775 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1777 cLISTOPo->op_last = last; /* in case check substituted last arg */
1780 return fold_constants(o);
1783 /* List constructors */
1786 append_elem(I32 type, OP *first, OP *last)
1794 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1795 return newLISTOP(type, 0, first, last);
1797 if (first->op_flags & OPf_KIDS)
1798 ((LISTOP*)first)->op_last->op_sibling = last;
1800 first->op_flags |= OPf_KIDS;
1801 ((LISTOP*)first)->op_first = last;
1803 ((LISTOP*)first)->op_last = last;
1804 ((LISTOP*)first)->op_children++;
1809 append_list(I32 type, LISTOP *first, LISTOP *last)
1817 if (first->op_type != type)
1818 return prepend_elem(type, (OP*)first, (OP*)last);
1820 if (last->op_type != type)
1821 return append_elem(type, (OP*)first, (OP*)last);
1823 first->op_last->op_sibling = last->op_first;
1824 first->op_last = last->op_last;
1825 first->op_children += last->op_children;
1826 if (first->op_children)
1827 last->op_flags |= OPf_KIDS;
1834 prepend_elem(I32 type, OP *first, OP *last)
1842 if (last->op_type == type) {
1843 if (type == OP_LIST) { /* already a PUSHMARK there */
1844 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1845 ((LISTOP*)last)->op_first->op_sibling = first;
1848 if (!(last->op_flags & OPf_KIDS)) {
1849 ((LISTOP*)last)->op_last = first;
1850 last->op_flags |= OPf_KIDS;
1852 first->op_sibling = ((LISTOP*)last)->op_first;
1853 ((LISTOP*)last)->op_first = first;
1855 ((LISTOP*)last)->op_children++;
1859 return newLISTOP(type, 0, first, last);
1867 return newOP(OP_STUB, 0);
1873 if (!o || o->op_type != OP_LIST)
1874 o = newLISTOP(OP_LIST, 0, o, Nullop);
1880 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1884 Newz(1101, listop, 1, LISTOP);
1886 listop->op_type = type;
1887 listop->op_ppaddr = ppaddr[type];
1888 listop->op_children = (first != 0) + (last != 0);
1889 listop->op_flags = flags;
1893 else if (!first && last)
1896 first->op_sibling = last;
1897 listop->op_first = first;
1898 listop->op_last = last;
1899 if (type == OP_LIST) {
1901 pushop = newOP(OP_PUSHMARK, 0);
1902 pushop->op_sibling = first;
1903 listop->op_first = pushop;
1904 listop->op_flags |= OPf_KIDS;
1906 listop->op_last = pushop;
1908 else if (listop->op_children)
1909 listop->op_flags |= OPf_KIDS;
1915 newOP(I32 type, I32 flags)
1918 Newz(1101, o, 1, OP);
1920 o->op_ppaddr = ppaddr[type];
1921 o->op_flags = flags;
1924 o->op_private = 0 + (flags >> 8);
1925 if (opargs[type] & OA_RETSCALAR)
1927 if (opargs[type] & OA_TARGET)
1928 o->op_targ = pad_alloc(type, SVs_PADTMP);
1929 return CHECKOP(type, o);
1933 newUNOP(I32 type, I32 flags, OP *first)
1938 first = newOP(OP_STUB, 0);
1939 if (opargs[type] & OA_MARK)
1940 first = force_list(first);
1942 Newz(1101, unop, 1, UNOP);
1943 unop->op_type = type;
1944 unop->op_ppaddr = ppaddr[type];
1945 unop->op_first = first;
1946 unop->op_flags = flags | OPf_KIDS;
1947 unop->op_private = 1 | (flags >> 8);
1949 if(type == OP_STUDY && first->op_type == OP_MATCH) {
1950 first->op_type = OP_PUSHRE;
1951 first->op_ppaddr = ppaddr[OP_PUSHRE];
1954 unop = (UNOP*) CHECKOP(type, unop);
1958 return fold_constants((OP *) unop);
1962 newBINOP(I32 type, I32 flags, OP *first, OP *last)
1965 Newz(1101, binop, 1, BINOP);
1968 first = newOP(OP_NULL, 0);
1970 binop->op_type = type;
1971 binop->op_ppaddr = ppaddr[type];
1972 binop->op_first = first;
1973 binop->op_flags = flags | OPf_KIDS;
1976 binop->op_private = 1 | (flags >> 8);
1979 binop->op_private = 2 | (flags >> 8);
1980 first->op_sibling = last;
1983 binop = (BINOP*)CHECKOP(type, binop);
1987 binop->op_last = last = binop->op_first->op_sibling;
1989 return fold_constants((OP *)binop);
1993 pmtrans(OP *o, OP *expr, OP *repl)
1995 SV *tstr = ((SVOP*)expr)->op_sv;
1996 SV *rstr = ((SVOP*)repl)->op_sv;
1999 register U8 *t = (U8*)SvPV(tstr, tlen);
2000 register U8 *r = (U8*)SvPV(rstr, rlen);
2006 register short *tbl;
2008 tbl = (short*)cPVOPo->op_pv;
2009 complement = o->op_private & OPpTRANS_COMPLEMENT;
2010 Delete = o->op_private & OPpTRANS_DELETE;
2011 squash = o->op_private & OPpTRANS_SQUASH;
2014 Zero(tbl, 256, short);
2015 for (i = 0; i < tlen; i++)
2017 for (i = 0, j = 0; i < 256; i++) {
2033 if (!rlen && !Delete) {
2036 o->op_private |= OPpTRANS_COUNTONLY;
2038 for (i = 0; i < 256; i++)
2040 for (i = 0, j = 0; i < tlen; i++,j++) {
2043 if (tbl[t[i]] == -1)
2049 if (tbl[t[i]] == -1)
2060 newPMOP(I32 type, I32 flags)
2065 Newz(1101, pmop, 1, PMOP);
2066 pmop->op_type = type;
2067 pmop->op_ppaddr = ppaddr[type];
2068 pmop->op_flags = flags;
2069 pmop->op_private = 0 | (flags >> 8);
2071 if (hints & HINT_LOCALE)
2072 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2074 /* link into pm list */
2075 if (type != OP_TRANS && curstash) {
2076 pmop->op_pmnext = HvPMROOT(curstash);
2077 HvPMROOT(curstash) = pmop;
2084 pmruntime(OP *o, OP *expr, OP *repl)
2089 if (o->op_type == OP_TRANS)
2090 return pmtrans(o, expr, repl);
2092 hints |= HINT_BLOCK_SCOPE;
2095 if (expr->op_type == OP_CONST) {
2097 SV *pat = ((SVOP*)expr)->op_sv;
2098 char *p = SvPV(pat, plen);
2099 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2100 sv_setpvn(pat, "\\s+", 3);
2101 p = SvPV(pat, plen);
2102 pm->op_pmflags |= PMf_SKIPWHITE;
2104 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2105 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2106 pm->op_pmflags |= PMf_WHITE;
2110 if (pm->op_pmflags & PMf_KEEP)
2111 expr = newUNOP(OP_REGCMAYBE,0,expr);
2113 Newz(1101, rcop, 1, LOGOP);
2114 rcop->op_type = OP_REGCOMP;
2115 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2116 rcop->op_first = scalar(expr);
2117 rcop->op_flags |= OPf_KIDS;
2118 rcop->op_private = 1;
2121 /* establish postfix order */
2122 if (pm->op_pmflags & PMf_KEEP) {
2124 rcop->op_next = expr;
2125 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2128 rcop->op_next = LINKLIST(expr);
2129 expr->op_next = (OP*)rcop;
2132 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2137 if (pm->op_pmflags & PMf_EVAL)
2140 else if (repl->op_type == OP_THREADSV
2141 && strchr("&`'123456789+",
2142 threadsv_names[repl->op_targ]))
2146 #endif /* USE_THREADS */
2147 else if (repl->op_type == OP_CONST)
2151 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2152 if (opargs[curop->op_type] & OA_DANGEROUS) {
2154 if (curop->op_type == OP_THREADSV
2155 && strchr("&`'123456789+", curop->op_private)) {
2159 if (curop->op_type == OP_GV) {
2160 GV *gv = ((GVOP*)curop)->op_gv;
2161 if (strchr("&`'123456789+", *GvENAME(gv)))
2164 #endif /* USE_THREADS */
2165 else if (curop->op_type == OP_RV2CV)
2167 else if (curop->op_type == OP_RV2SV ||
2168 curop->op_type == OP_RV2AV ||
2169 curop->op_type == OP_RV2HV ||
2170 curop->op_type == OP_RV2GV) {
2171 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2174 else if (curop->op_type == OP_PADSV ||
2175 curop->op_type == OP_PADAV ||
2176 curop->op_type == OP_PADHV ||
2177 curop->op_type == OP_PADANY) {
2186 if (curop == repl) {
2187 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2188 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2189 prepend_elem(o->op_type, scalar(repl), o);
2192 Newz(1101, rcop, 1, LOGOP);
2193 rcop->op_type = OP_SUBSTCONT;
2194 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2195 rcop->op_first = scalar(repl);
2196 rcop->op_flags |= OPf_KIDS;
2197 rcop->op_private = 1;
2200 /* establish postfix order */
2201 rcop->op_next = LINKLIST(repl);
2202 repl->op_next = (OP*)rcop;
2204 pm->op_pmreplroot = scalar((OP*)rcop);
2205 pm->op_pmreplstart = LINKLIST(rcop);
2214 newSVOP(I32 type, I32 flags, SV *sv)
2217 Newz(1101, svop, 1, SVOP);
2218 svop->op_type = type;
2219 svop->op_ppaddr = ppaddr[type];
2221 svop->op_next = (OP*)svop;
2222 svop->op_flags = flags;
2223 if (opargs[type] & OA_RETSCALAR)
2225 if (opargs[type] & OA_TARGET)
2226 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2227 return CHECKOP(type, svop);
2231 newGVOP(I32 type, I32 flags, GV *gv)
2235 Newz(1101, gvop, 1, GVOP);
2236 gvop->op_type = type;
2237 gvop->op_ppaddr = ppaddr[type];
2238 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2239 gvop->op_next = (OP*)gvop;
2240 gvop->op_flags = flags;
2241 if (opargs[type] & OA_RETSCALAR)
2243 if (opargs[type] & OA_TARGET)
2244 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2245 return CHECKOP(type, gvop);
2249 newPVOP(I32 type, I32 flags, char *pv)
2252 Newz(1101, pvop, 1, PVOP);
2253 pvop->op_type = type;
2254 pvop->op_ppaddr = ppaddr[type];
2256 pvop->op_next = (OP*)pvop;
2257 pvop->op_flags = flags;
2258 if (opargs[type] & OA_RETSCALAR)
2260 if (opargs[type] & OA_TARGET)
2261 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2262 return CHECKOP(type, pvop);
2271 save_hptr(&curstash);
2272 save_item(curstname);
2277 name = SvPV(sv, len);
2278 curstash = gv_stashpvn(name,len,TRUE);
2279 sv_setpvn(curstname, name, len);
2283 sv_setpv(curstname,"<none>");
2291 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2299 if (id->op_type != OP_CONST)
2300 croak("Module name must be constant");
2304 if(version != Nullop) {
2305 SV *vesv = ((SVOP*)version)->op_sv;
2307 if (arg == Nullop && !SvNIOK(vesv)) {
2314 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2315 croak("Version number must be constant number");
2317 /* Make copy of id so we don't free it twice */
2318 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2320 /* Fake up a method call to VERSION */
2321 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2322 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2323 append_elem(OP_LIST,
2324 prepend_elem(OP_LIST, pack, list(version)),
2325 newUNOP(OP_METHOD, 0, meth)));
2329 /* Fake up an import/unimport */
2330 if (arg && arg->op_type == OP_STUB)
2331 imop = arg; /* no import on explicit () */
2332 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2333 imop = Nullop; /* use 5.0; */
2336 /* Make copy of id so we don't free it twice */
2337 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2338 meth = newSVOP(OP_CONST, 0,
2340 ? newSVpv("import", 6)
2341 : newSVpv("unimport", 8)
2343 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2344 append_elem(OP_LIST,
2345 prepend_elem(OP_LIST, pack, list(arg)),
2346 newUNOP(OP_METHOD, 0, meth)));
2349 /* Fake up a require */
2350 rqop = newUNOP(OP_REQUIRE, 0, id);
2352 /* Fake up the BEGIN {}, which does its thing immediately. */
2354 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2356 append_elem(OP_LINESEQ,
2357 append_elem(OP_LINESEQ,
2358 newSTATEOP(0, Nullch, rqop),
2359 newSTATEOP(0, Nullch, veop)),
2360 newSTATEOP(0, Nullch, imop) ));
2367 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2369 return newBINOP(OP_LSLICE, flags,
2370 list(force_list(subscript)),
2371 list(force_list(listval)) );
2375 list_assignment(register OP *o)
2380 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2381 o = cUNOPo->op_first;
2383 if (o->op_type == OP_COND_EXPR) {
2384 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2385 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2390 yyerror("Assignment to both a list and a scalar");
2394 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2395 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2396 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2399 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2402 if (o->op_type == OP_RV2SV)
2409 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2414 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2415 return newLOGOP(optype, 0,
2416 mod(scalar(left), optype),
2417 newUNOP(OP_SASSIGN, 0, scalar(right)));
2420 return newBINOP(optype, OPf_STACKED,
2421 mod(scalar(left), optype), scalar(right));
2425 if (list_assignment(left)) {
2428 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2429 left = mod(left, OP_AASSIGN);
2437 o = newBINOP(OP_AASSIGN, flags,
2438 list(force_list(right)),
2439 list(force_list(left)) );
2440 o->op_private = 0 | (flags >> 8);
2441 if (!(left->op_private & OPpLVAL_INTRO)) {
2442 static int generation = 100;
2446 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2447 if (opargs[curop->op_type] & OA_DANGEROUS) {
2448 if (curop->op_type == OP_GV) {
2449 GV *gv = ((GVOP*)curop)->op_gv;
2450 if (gv == defgv || SvCUR(gv) == generation)
2452 SvCUR(gv) = generation;
2454 else if (curop->op_type == OP_PADSV ||
2455 curop->op_type == OP_PADAV ||
2456 curop->op_type == OP_PADHV ||
2457 curop->op_type == OP_PADANY) {
2458 SV **svp = AvARRAY(comppad_name);
2459 SV *sv = svp[curop->op_targ];
2460 if (SvCUR(sv) == generation)
2462 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2464 else if (curop->op_type == OP_RV2CV)
2466 else if (curop->op_type == OP_RV2SV ||
2467 curop->op_type == OP_RV2AV ||
2468 curop->op_type == OP_RV2HV ||
2469 curop->op_type == OP_RV2GV) {
2470 if (lastop->op_type != OP_GV) /* funny deref? */
2479 o->op_private = OPpASSIGN_COMMON;
2481 if (right && right->op_type == OP_SPLIT) {
2483 if ((tmpop = ((LISTOP*)right)->op_first) &&
2484 tmpop->op_type == OP_PUSHRE)
2486 PMOP *pm = (PMOP*)tmpop;
2487 if (left->op_type == OP_RV2AV &&
2488 !(left->op_private & OPpLVAL_INTRO) &&
2489 !(o->op_private & OPpASSIGN_COMMON) )
2491 tmpop = ((UNOP*)left)->op_first;
2492 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2493 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2494 pm->op_pmflags |= PMf_ONCE;
2495 tmpop = cUNOPo->op_first; /* to list (nulled) */
2496 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2497 tmpop->op_sibling = Nullop; /* don't free split */
2498 right->op_next = tmpop->op_next; /* fix starting loc */
2499 op_free(o); /* blow off assign */
2500 right->op_flags &= ~OPf_WANT;
2501 /* "I don't know and I don't care." */
2506 if (modcount < 10000 &&
2507 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2509 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2511 sv_setiv(sv, modcount+1);
2519 right = newOP(OP_UNDEF, 0);
2520 if (right->op_type == OP_READLINE) {
2521 right->op_flags |= OPf_STACKED;
2522 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2525 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2526 o = newBINOP(OP_SASSIGN, flags,
2527 scalar(right), mod(scalar(left), OP_SASSIGN) );
2539 newSTATEOP(I32 flags, char *label, OP *o)
2542 U32 seq = intro_my();
2545 Newz(1101, cop, 1, COP);
2546 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2547 cop->op_type = OP_DBSTATE;
2548 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2551 cop->op_type = OP_NEXTSTATE;
2552 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2554 cop->op_flags = flags;
2555 cop->op_private = 0 | (flags >> 8);
2557 cop->op_private |= NATIVE_HINTS;
2559 cop->op_next = (OP*)cop;
2562 cop->cop_label = label;
2563 hints |= HINT_BLOCK_SCOPE;
2566 cop->cop_arybase = curcop->cop_arybase;
2568 if (copline == NOLINE)
2569 cop->cop_line = curcop->cop_line;
2571 cop->cop_line = copline;
2574 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2575 cop->cop_stash = curstash;
2577 if (PERLDB_LINE && curstash != debstash) {
2578 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2579 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2580 (void)SvIOK_on(*svp);
2582 SvSTASH(*svp) = (HV*)cop;
2586 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2589 /* "Introduce" my variables to visible status. */
2597 if (! min_intro_pending)
2600 svp = AvARRAY(comppad_name);
2601 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2602 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2603 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2604 SvNVX(sv) = (double)cop_seqmax;
2607 min_intro_pending = 0;
2608 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2609 return cop_seqmax++;
2613 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2615 return new_logop(type, flags, &first, &other);
2619 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2624 OP *first = *firstp;
2625 OP *other = *otherp;
2627 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2628 return newBINOP(type, flags, scalar(first), scalar(other));
2630 scalarboolean(first);
2631 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2632 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2633 if (type == OP_AND || type == OP_OR) {
2639 first = *firstp = cUNOPo->op_first;
2641 first->op_next = o->op_next;
2642 cUNOPo->op_first = Nullop;
2646 if (first->op_type == OP_CONST) {
2647 if (dowarn && (first->op_private & OPpCONST_BARE))
2648 warn("Probable precedence problem on %s", op_desc[type]);
2649 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2660 else if (first->op_type == OP_WANTARRAY) {
2666 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2667 OP *k1 = ((UNOP*)first)->op_first;
2668 OP *k2 = k1->op_sibling;
2670 switch (first->op_type)
2673 if (k2 && k2->op_type == OP_READLINE
2674 && (k2->op_flags & OPf_STACKED)
2675 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2676 warnop = k2->op_type;
2680 if (k1->op_type == OP_READDIR
2681 || k1->op_type == OP_GLOB
2682 || k1->op_type == OP_EACH)
2683 warnop = k1->op_type;
2687 line_t oldline = curcop->cop_line;
2688 curcop->cop_line = copline;
2689 warn("Value of %s%s can be \"0\"; test with defined()",
2691 ((warnop == OP_READLINE || warnop == OP_GLOB)
2692 ? " construct" : "() operator"));
2693 curcop->cop_line = oldline;
2700 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2701 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2703 Newz(1101, logop, 1, LOGOP);
2705 logop->op_type = type;
2706 logop->op_ppaddr = ppaddr[type];
2707 logop->op_first = first;
2708 logop->op_flags = flags | OPf_KIDS;
2709 logop->op_other = LINKLIST(other);
2710 logop->op_private = 1 | (flags >> 8);
2712 /* establish postfix order */
2713 logop->op_next = LINKLIST(first);
2714 first->op_next = (OP*)logop;
2715 first->op_sibling = other;
2717 o = newUNOP(OP_NULL, 0, (OP*)logop);
2724 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2731 return newLOGOP(OP_AND, 0, first, trueop);
2733 return newLOGOP(OP_OR, 0, first, falseop);
2735 scalarboolean(first);
2736 if (first->op_type == OP_CONST) {
2737 if (SvTRUE(((SVOP*)first)->op_sv)) {
2748 else if (first->op_type == OP_WANTARRAY) {
2752 Newz(1101, condop, 1, CONDOP);
2754 condop->op_type = OP_COND_EXPR;
2755 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2756 condop->op_first = first;
2757 condop->op_flags = flags | OPf_KIDS;
2758 condop->op_true = LINKLIST(trueop);
2759 condop->op_false = LINKLIST(falseop);
2760 condop->op_private = 1 | (flags >> 8);
2762 /* establish postfix order */
2763 condop->op_next = LINKLIST(first);
2764 first->op_next = (OP*)condop;
2766 first->op_sibling = trueop;
2767 trueop->op_sibling = falseop;
2768 o = newUNOP(OP_NULL, 0, (OP*)condop);
2770 trueop->op_next = o;
2771 falseop->op_next = o;
2777 newRANGE(I32 flags, OP *left, OP *right)
2785 Newz(1101, condop, 1, CONDOP);
2787 condop->op_type = OP_RANGE;
2788 condop->op_ppaddr = ppaddr[OP_RANGE];
2789 condop->op_first = left;
2790 condop->op_flags = OPf_KIDS;
2791 condop->op_true = LINKLIST(left);
2792 condop->op_false = LINKLIST(right);
2793 condop->op_private = 1 | (flags >> 8);
2795 left->op_sibling = right;
2797 condop->op_next = (OP*)condop;
2798 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2799 flop = newUNOP(OP_FLOP, 0, flip);
2800 o = newUNOP(OP_NULL, 0, flop);
2803 left->op_next = flip;
2804 right->op_next = flop;
2806 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2807 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2808 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2809 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2811 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2812 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2815 if (!flip->op_private || !flop->op_private)
2816 linklist(o); /* blow off optimizer unless constant */
2822 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2827 int once = block && block->op_flags & OPf_SPECIAL &&
2828 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2831 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2832 return block; /* do {} while 0 does once */
2833 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2834 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2835 expr = newUNOP(OP_DEFINED, 0,
2836 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2837 } else if (expr->op_flags & OPf_KIDS) {
2838 OP *k1 = ((UNOP*)expr)->op_first;
2839 OP *k2 = (k1) ? k1->op_sibling : NULL;
2840 switch (expr->op_type) {
2842 if (k2 && k2->op_type == OP_READLINE
2843 && (k2->op_flags & OPf_STACKED)
2844 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2845 expr = newUNOP(OP_DEFINED, 0, expr);
2849 if (k1->op_type == OP_READDIR
2850 || k1->op_type == OP_GLOB
2851 || k1->op_type == OP_EACH)
2852 expr = newUNOP(OP_DEFINED, 0, expr);
2858 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2859 o = new_logop(OP_AND, 0, &expr, &listop);
2862 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2864 if (once && o != listop)
2865 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2868 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2870 o->op_flags |= flags;
2872 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2877 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2886 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2887 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2888 expr = newUNOP(OP_DEFINED, 0,
2889 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2890 } else if (expr && (expr->op_flags & OPf_KIDS)) {
2891 OP *k1 = ((UNOP*)expr)->op_first;
2892 OP *k2 = (k1) ? k1->op_sibling : NULL;
2893 switch (expr->op_type) {
2895 if (k2 && k2->op_type == OP_READLINE
2896 && (k2->op_flags & OPf_STACKED)
2897 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2898 expr = newUNOP(OP_DEFINED, 0, expr);
2902 if (k1->op_type == OP_READDIR
2903 || k1->op_type == OP_GLOB
2904 || k1->op_type == OP_EACH)
2905 expr = newUNOP(OP_DEFINED, 0, expr);
2911 block = newOP(OP_NULL, 0);
2914 next = LINKLIST(cont);
2916 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2917 if ((line_t)whileline != NOLINE) {
2918 copline = whileline;
2919 cont = append_elem(OP_LINESEQ, cont,
2920 newSTATEOP(0, Nullch, Nullop));
2924 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2925 redo = LINKLIST(listop);
2928 copline = whileline;
2930 o = new_logop(OP_AND, 0, &expr, &listop);
2931 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2932 op_free(expr); /* oops, it's a while (0) */
2934 return Nullop; /* listop already freed by new_logop */
2937 ((LISTOP*)listop)->op_last->op_next = condop =
2938 (o == listop ? redo : LINKLIST(o));
2946 Newz(1101,loop,1,LOOP);
2947 loop->op_type = OP_ENTERLOOP;
2948 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2949 loop->op_private = 0;
2950 loop->op_next = (OP*)loop;
2953 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2955 loop->op_redoop = redo;
2956 loop->op_lastop = o;
2959 loop->op_nextop = next;
2961 loop->op_nextop = o;
2963 o->op_flags |= flags;
2964 o->op_private |= (flags >> 8);
2969 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2977 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2978 sv->op_type = OP_RV2GV;
2979 sv->op_ppaddr = ppaddr[OP_RV2GV];
2981 else if (sv->op_type == OP_PADSV) { /* private variable */
2982 padoff = sv->op_targ;
2986 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
2987 padoff = sv->op_targ;
2988 iterflags |= OPf_SPECIAL;
2993 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2997 padoff = find_threadsv("_");
2998 iterflags |= OPf_SPECIAL;
3000 sv = newGVOP(OP_GV, 0, defgv);
3003 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3004 expr = scalar(ref(expr, OP_ITER));
3005 iterflags |= OPf_STACKED;
3007 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3008 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
3010 assert(!loop->op_next);
3011 Renew(loop, 1, LOOP);
3012 loop->op_targ = padoff;
3013 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3015 return newSTATEOP(0, label, wop);
3019 newLOOPEX(I32 type, OP *label)
3023 if (type != OP_GOTO || label->op_type == OP_CONST) {
3024 /* "last()" means "last" */
3025 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3026 o = newOP(type, OPf_SPECIAL);
3028 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3029 ? SvPVx(((SVOP*)label)->op_sv, na)
3035 if (label->op_type == OP_ENTERSUB)
3036 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3037 o = newUNOP(type, OPf_STACKED, label);
3039 hints |= HINT_BLOCK_SCOPE;
3049 MUTEX_DESTROY(CvMUTEXP(cv));
3050 Safefree(CvMUTEXP(cv));
3053 #endif /* USE_THREADS */
3055 if (!CvXSUB(cv) && CvROOT(cv)) {
3057 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3058 croak("Can't undef active subroutine");
3061 croak("Can't undef active subroutine");
3062 #endif /* USE_THREADS */
3069 op_free(CvROOT(cv));
3070 CvROOT(cv) = Nullop;
3073 SvPOK_off((SV*)cv); /* forget prototype */
3075 SvREFCNT_dec(CvGV(cv));
3077 SvREFCNT_dec(CvOUTSIDE(cv));
3078 CvOUTSIDE(cv) = Nullcv;
3079 if (CvPADLIST(cv)) {
3080 /* may be during global destruction */
3081 if (SvREFCNT(CvPADLIST(cv))) {
3082 I32 i = AvFILLp(CvPADLIST(cv));
3084 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3085 SV* sv = svp ? *svp : Nullsv;
3088 if (sv == (SV*)comppad_name)
3089 comppad_name = Nullav;
3090 else if (sv == (SV*)comppad) {
3092 curpad = Null(SV**);
3096 SvREFCNT_dec((SV*)CvPADLIST(cv));
3098 CvPADLIST(cv) = Nullav;
3102 #ifdef DEBUG_CLOSURES
3107 CV *outside = CvOUTSIDE(cv);
3108 AV* padlist = CvPADLIST(cv);
3115 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3117 (CvANON(cv) ? "ANON"
3118 : (cv == main_cv) ? "MAIN"
3119 : CvUNIQUE(outside) ? "UNIQUE"
3120 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3123 : CvANON(outside) ? "ANON"
3124 : (outside == main_cv) ? "MAIN"
3125 : CvUNIQUE(outside) ? "UNIQUE"
3126 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3131 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3132 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3133 pname = AvARRAY(pad_name);
3134 ppad = AvARRAY(pad);
3136 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3137 if (SvPOK(pname[ix]))
3138 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3140 SvFAKE(pname[ix]) ? "FAKE " : "",
3142 (long)I_32(SvNVX(pname[ix])),
3143 (long)SvIVX(pname[ix]));
3146 #endif /* DEBUG_CLOSURES */
3149 cv_clone2(CV *proto, CV *outside)
3154 AV* protopadlist = CvPADLIST(proto);
3155 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3156 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3157 SV** pname = AvARRAY(protopad_name);
3158 SV** ppad = AvARRAY(protopad);
3159 I32 fname = AvFILLp(protopad_name);
3160 I32 fpad = AvFILLp(protopad);
3164 assert(!CvUNIQUE(proto));
3169 SAVESPTR(comppad_name);
3172 cv = compcv = (CV*)NEWSV(1104,0);
3173 sv_upgrade((SV *)cv, SvTYPE(proto));
3179 New(666, CvMUTEXP(cv), 1, perl_mutex);
3180 MUTEX_INIT(CvMUTEXP(cv));
3182 #endif /* USE_THREADS */
3183 CvFILEGV(cv) = CvFILEGV(proto);
3184 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3185 CvSTASH(cv) = CvSTASH(proto);
3186 CvROOT(cv) = CvROOT(proto);
3187 CvSTART(cv) = CvSTART(proto);
3189 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3192 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3194 comppad_name = newAV();
3195 for (ix = fname; ix >= 0; ix--)
3196 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3200 comppadlist = newAV();
3201 AvREAL_off(comppadlist);
3202 av_store(comppadlist, 0, (SV*)comppad_name);
3203 av_store(comppadlist, 1, (SV*)comppad);
3204 CvPADLIST(cv) = comppadlist;
3205 av_fill(comppad, AvFILLp(protopad));
3206 curpad = AvARRAY(comppad);
3208 av = newAV(); /* will be @_ */
3210 av_store(comppad, 0, (SV*)av);
3211 AvFLAGS(av) = AVf_REIFY;
3213 for (ix = fpad; ix > 0; ix--) {
3214 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3215 if (namesv && namesv != &sv_undef) {
3216 char *name = SvPVX(namesv); /* XXX */
3217 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3218 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3219 CvOUTSIDE(cv), cxstack_ix);
3221 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3223 croak("panic: cv_clone: %s", name);
3225 else { /* our own lexical */
3228 /* anon code -- we'll come back for it */
3229 sv = SvREFCNT_inc(ppad[ix]);
3231 else if (*name == '@')
3233 else if (*name == '%')
3243 SV* sv = NEWSV(0,0);
3249 /* Now that vars are all in place, clone nested closures. */
3251 for (ix = fpad; ix > 0; ix--) {
3252 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3254 && namesv != &sv_undef
3255 && !(SvFLAGS(namesv) & SVf_FAKE)
3256 && *SvPVX(namesv) == '&'
3257 && CvCLONE(ppad[ix]))
3259 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3260 SvREFCNT_dec(ppad[ix]);
3263 curpad[ix] = (SV*)kid;
3267 #ifdef DEBUG_CLOSURES
3268 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3270 PerlIO_printf(Perl_debug_log, " from:\n");
3272 PerlIO_printf(Perl_debug_log, " to:\n");
3283 return cv_clone2(proto, CvOUTSIDE(proto));
3287 cv_ckproto(CV *cv, GV *gv, char *p)
3289 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3290 SV* msg = sv_newmortal();
3294 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3295 sv_setpv(msg, "Prototype mismatch:");
3297 sv_catpvf(msg, " sub %_", name);
3299 sv_catpvf(msg, " (%s)", SvPVX(cv));
3300 sv_catpv(msg, " vs ");
3302 sv_catpvf(msg, "(%s)", p);
3304 sv_catpv(msg, "none");
3315 if (!cv || !SvPOK(cv) || SvCUR(cv))
3319 for (o = CvSTART(cv); o; o = o->op_next) {
3320 OPCODE type = o->op_type;
3322 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3324 if (type == OP_LEAVESUB || type == OP_RETURN)
3328 if (type == OP_CONST)
3330 else if (type == OP_PADSV) {
3331 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3332 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3333 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3345 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3348 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3349 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3350 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3351 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3360 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3361 maximum a prototype before. */
3362 if (SvTYPE(gv) > SVt_NULL) {
3363 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3364 warn("Runaway prototype");
3365 cv_ckproto((CV*)gv, NULL, ps);
3368 sv_setpv((SV*)gv, ps);
3370 sv_setiv((SV*)gv, -1);
3371 SvREFCNT_dec(compcv);
3377 if (!name || GvCVGEN(gv))
3379 else if (cv = GvCV(gv)) {
3380 cv_ckproto(cv, gv, ps);
3381 /* already defined (or promised)? */
3382 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3385 /* just a "sub foo;" when &foo is already defined */
3389 /* ahem, death to those who redefine active sort subs */
3390 if (curstackinfo->si_type == SI_SORT && sortcop == CvSTART(cv))
3391 croak("Can't redefine active sort subroutine %s", name);
3392 const_sv = cv_const_sv(cv);
3393 if (const_sv || dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3394 && HvNAME(GvSTASH(CvGV(cv)))
3395 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3397 line_t oldline = curcop->cop_line;
3398 curcop->cop_line = copline;
3399 warn(const_sv ? "Constant subroutine %s redefined"
3400 : "Subroutine %s redefined", name);
3401 curcop->cop_line = oldline;
3407 if (cv) { /* must reuse cv if autoloaded */
3409 CvFLAGS(cv) = CvFLAGS(compcv);
3410 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3411 CvOUTSIDE(compcv) = 0;
3412 CvPADLIST(cv) = CvPADLIST(compcv);
3413 CvPADLIST(compcv) = 0;
3414 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3415 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3416 SvREFCNT_dec(compcv);
3426 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3427 CvFILEGV(cv) = curcop->cop_filegv;
3428 CvSTASH(cv) = curstash;
3431 New(666, CvMUTEXP(cv), 1, perl_mutex);
3432 MUTEX_INIT(CvMUTEXP(cv));
3433 #endif /* USE_THREADS */
3436 sv_setpv((SV*)cv, ps);
3442 char *s = strrchr(name, ':');
3444 if (strEQ(s, "BEGIN")) {
3446 "BEGIN not safe after errors--compilation aborted";
3450 /* force display of errors found but not reported */
3451 sv_catpv(ERRSV, not_safe);
3452 croak("%s", SvPVx(ERRSV, na));
3464 if (AvFILLp(comppad_name) < AvFILLp(comppad))
3465 av_store(comppad_name, AvFILLp(comppad), Nullsv);
3468 SV **namep = AvARRAY(comppad_name);
3469 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3472 if (SvIMMORTAL(curpad[ix]))
3475 * The only things that a clonable function needs in its
3476 * pad are references to outer lexicals and anonymous subs.
3477 * The rest are created anew during cloning.
3479 if (!((namesv = namep[ix]) != Nullsv &&
3480 namesv != &sv_undef &&
3482 *SvPVX(namesv) == '&')))
3484 SvREFCNT_dec(curpad[ix]);
3485 curpad[ix] = Nullsv;
3490 AV *av = newAV(); /* Will be @_ */
3492 av_store(comppad, 0, (SV*)av);
3493 AvFLAGS(av) = AVf_REIFY;
3495 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3496 if (SvIMMORTAL(curpad[ix]))
3498 if (!SvPADMY(curpad[ix]))
3499 SvPADTMP_on(curpad[ix]);
3503 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3504 CvSTART(cv) = LINKLIST(CvROOT(cv));
3505 CvROOT(cv)->op_next = 0;
3511 if (PERLDB_SUBLINE && curstash != debstash) {
3512 SV *sv = NEWSV(0,0);
3513 SV *tmpstr = sv_newmortal();
3514 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3518 sv_setpvf(sv, "%_:%ld-%ld",
3519 GvSV(curcop->cop_filegv),
3520 (long)subline, (long)curcop->cop_line);
3521 gv_efullname3(tmpstr, gv, Nullch);
3522 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3523 hv = GvHVn(db_postponed);
3524 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3525 && (cv = GvCV(db_postponed))) {
3530 perl_call_sv((SV*)cv, G_DISCARD);
3534 if ((s = strrchr(name,':')))
3538 if (strEQ(s, "BEGIN")) {
3539 I32 oldscope = scopestack_ix;
3541 SAVESPTR(compiling.cop_filegv);
3542 SAVEI16(compiling.cop_line);
3548 DEBUG_x( dump_sub(gv) );
3549 av_push(beginav, (SV *)cv);
3551 call_list(oldscope, beginav);
3553 curcop = &compiling;
3556 else if (strEQ(s, "END") && !error_count) {
3559 av_unshift(endav, 1);
3560 av_store(endav, 0, (SV *)cv);
3563 else if (strEQ(s, "INIT") && !error_count) {
3566 av_push(initav, SvREFCNT_inc(cv));
3577 newCONSTSUB(HV *stash, char *name, SV *sv)
3580 U32 oldhints = hints;
3581 HV *old_cop_stash = curcop->cop_stash;
3582 HV *old_curstash = curstash;
3583 line_t oldline = curcop->cop_line;
3584 curcop->cop_line = copline;
3586 hints &= ~HINT_BLOCK_SCOPE;
3588 curstash = curcop->cop_stash = stash;
3591 start_subparse(FALSE, 0),
3592 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3593 newSVOP(OP_CONST, 0, &sv_no), /* SvPV(&sv_no) == "" -- GMB */
3594 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3598 curcop->cop_stash = old_cop_stash;
3599 curstash = old_curstash;
3600 curcop->cop_line = oldline;
3604 newXS(char *name, void (*subaddr) (CV *), char *filename)
3607 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3610 if (cv = (name ? GvCV(gv) : Nullcv)) {
3612 /* just a cached method */
3616 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3617 /* already defined (or promised) */
3618 if (dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3619 && HvNAME(GvSTASH(CvGV(cv)))
3620 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3621 line_t oldline = curcop->cop_line;
3622 curcop->cop_line = copline;
3623 warn("Subroutine %s redefined",name);
3624 curcop->cop_line = oldline;
3631 if (cv) /* must reuse cv if autoloaded */
3634 cv = (CV*)NEWSV(1105,0);
3635 sv_upgrade((SV *)cv, SVt_PVCV);
3642 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3644 New(666, CvMUTEXP(cv), 1, perl_mutex);
3645 MUTEX_INIT(CvMUTEXP(cv));
3647 #endif /* USE_THREADS */
3648 CvFILEGV(cv) = gv_fetchfile(filename);
3649 CvXSUB(cv) = subaddr;
3652 char *s = strrchr(name,':');
3657 if (strEQ(s, "BEGIN")) {
3660 av_push(beginav, (SV *)cv);
3663 else if (strEQ(s, "END")) {
3666 av_unshift(endav, 1);
3667 av_store(endav, 0, (SV *)cv);
3670 else if (strEQ(s, "INIT")) {
3673 av_push(initav, (SV *)cv);
3683 newFORM(I32 floor, OP *o, OP *block)
3692 name = SvPVx(cSVOPo->op_sv, na);
3695 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3697 if (cv = GvFORM(gv)) {
3699 line_t oldline = curcop->cop_line;
3701 curcop->cop_line = copline;
3702 warn("Format %s redefined",name);
3703 curcop->cop_line = oldline;
3709 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3710 CvFILEGV(cv) = curcop->cop_filegv;
3712 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3713 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3714 SvPADTMP_on(curpad[ix]);
3717 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3718 CvSTART(cv) = LINKLIST(CvROOT(cv));
3719 CvROOT(cv)->op_next = 0;
3729 return newUNOP(OP_REFGEN, 0,
3730 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3736 return newUNOP(OP_REFGEN, 0,
3737 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3741 newANONSUB(I32 floor, OP *proto, OP *block)
3743 return newUNOP(OP_REFGEN, 0,
3744 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3750 switch (o->op_type) {
3752 o->op_type = OP_PADAV;
3753 o->op_ppaddr = ppaddr[OP_PADAV];
3754 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3757 o->op_type = OP_RV2AV;
3758 o->op_ppaddr = ppaddr[OP_RV2AV];
3763 warn("oops: oopsAV");
3772 switch (o->op_type) {
3775 o->op_type = OP_PADHV;
3776 o->op_ppaddr = ppaddr[OP_PADHV];
3777 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3781 o->op_type = OP_RV2HV;
3782 o->op_ppaddr = ppaddr[OP_RV2HV];
3787 warn("oops: oopsHV");
3796 if (o->op_type == OP_PADANY) {
3797 o->op_type = OP_PADAV;
3798 o->op_ppaddr = ppaddr[OP_PADAV];
3801 return newUNOP(OP_RV2AV, 0, scalar(o));
3805 newGVREF(I32 type, OP *o)
3807 if (type == OP_MAPSTART)
3808 return newUNOP(OP_NULL, 0, o);
3809 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3815 if (o->op_type == OP_PADANY) {
3816 o->op_type = OP_PADHV;
3817 o->op_ppaddr = ppaddr[OP_PADHV];
3820 return newUNOP(OP_RV2HV, 0, scalar(o));
3826 croak("NOT IMPL LINE %d",__LINE__);
3832 newCVREF(I32 flags, OP *o)
3834 return newUNOP(OP_RV2CV, flags, scalar(o));
3840 if (o->op_type == OP_PADANY) {
3841 o->op_type = OP_PADSV;
3842 o->op_ppaddr = ppaddr[OP_PADSV];
3845 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3846 o->op_flags |= OPpDONE_SVREF;
3849 return newUNOP(OP_RV2SV, 0, scalar(o));
3852 /* Check routines. */
3860 name = NEWSV(1106,0);
3861 sv_upgrade(name, SVt_PVNV);
3862 sv_setpvn(name, "&", 1);
3865 ix = pad_alloc(o->op_type, SVs_PADMY);
3866 av_store(comppad_name, ix, name);
3867 av_store(comppad, ix, cSVOPo->op_sv);
3868 SvPADMY_on(cSVOPo->op_sv);
3869 cSVOPo->op_sv = Nullsv;
3870 cSVOPo->op_targ = ix;
3877 o->op_private = hints;
3884 if (cUNOPo->op_first->op_type == OP_CONCAT)
3885 o->op_flags |= OPf_STACKED;
3892 if (o->op_flags & OPf_KIDS) {
3895 OPCODE type = o->op_type;
3896 o = modkids(ck_fun(o), type);
3897 kid = cUNOPo->op_first;
3898 newop = kUNOP->op_first->op_sibling;
3900 (newop->op_sibling ||
3901 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3902 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3903 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3907 op_free(kUNOP->op_first);
3908 kUNOP->op_first = newop;
3910 o->op_ppaddr = ppaddr[++o->op_type];
3919 if (o->op_flags & OPf_KIDS) {
3920 OP *kid = cUNOPo->op_first;
3921 if (kid->op_type == OP_HSLICE)
3922 o->op_private |= OPpSLICE;
3923 else if (kid->op_type != OP_HELEM)
3924 croak("%s argument is not a HASH element or slice",
3925 op_desc[o->op_type]);
3934 I32 type = o->op_type;
3936 if (o->op_flags & OPf_KIDS) {
3937 if (cLISTOPo->op_first->op_type == OP_STUB) {
3939 o = newUNOP(type, OPf_SPECIAL,
3940 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3950 hints |= HINT_BLOCK_SCOPE;
3951 if (o->op_flags & OPf_KIDS) {
3952 SVOP *kid = (SVOP*)cUNOPo->op_first;
3955 o->op_flags &= ~OPf_KIDS;
3958 else if (kid->op_type == OP_LINESEQ) {
3961 kid->op_next = o->op_next;
3962 cUNOPo->op_first = 0;
3965 Newz(1101, enter, 1, LOGOP);
3966 enter->op_type = OP_ENTERTRY;
3967 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3968 enter->op_private = 0;
3970 /* establish postfix order */
3971 enter->op_next = (OP*)enter;
3973 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3974 o->op_type = OP_LEAVETRY;
3975 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3976 enter->op_other = o;
3984 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
3986 o->op_targ = (PADOFFSET)hints;
3994 if (o->op_flags & OPf_STACKED) {
3996 kid = cUNOPo->op_first->op_sibling;
3997 if (kid->op_type == OP_RV2GV)
4009 if (o->op_flags & OPf_KIDS) {
4010 OP *kid = cUNOPo->op_first;
4011 if (kid->op_type != OP_HELEM)
4012 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4019 ck_gvconst(register OP *o)
4021 o = fold_constants(o);
4022 if (o->op_type == OP_CONST)
4028 ck_rvconst(register OP *o)
4031 SVOP *kid = (SVOP*)cUNOPo->op_first;
4033 o->op_private |= (hints & HINT_STRICT_REFS);
4034 if (kid->op_type == OP_CONST) {
4039 name = SvPV(kid->op_sv, na);
4040 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4041 char *badthing = Nullch;
4042 switch (o->op_type) {
4044 badthing = "a SCALAR";
4047 badthing = "an ARRAY";
4050 badthing = "a HASH";
4055 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4059 * This is a little tricky. We only want to add the symbol if we
4060 * didn't add it in the lexer. Otherwise we get duplicate strict
4061 * warnings. But if we didn't add it in the lexer, we must at
4062 * least pretend like we wanted to add it even if it existed before,
4063 * or we get possible typo warnings. OPpCONST_ENTERED says
4064 * whether the lexer already added THIS instance of this symbol.
4066 iscv = (o->op_type == OP_RV2CV) * 2;
4068 gv = gv_fetchpv(name,
4069 iscv | !(kid->op_private & OPpCONST_ENTERED),
4072 : o->op_type == OP_RV2SV
4074 : o->op_type == OP_RV2AV
4076 : o->op_type == OP_RV2HV
4079 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4081 kid->op_type = OP_GV;
4082 SvREFCNT_dec(kid->op_sv);
4083 kid->op_sv = SvREFCNT_inc(gv);
4093 I32 type = o->op_type;
4095 if (o->op_flags & OPf_REF)
4098 if (o->op_flags & OPf_KIDS) {
4099 SVOP *kid = (SVOP*)cUNOPo->op_first;
4101 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4102 OP *newop = newGVOP(type, OPf_REF,
4103 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4110 if (type == OP_FTTTY)
4111 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4114 return newUNOP(type, 0, newDEFSVOP());
4127 int type = o->op_type;
4128 register I32 oa = opargs[type] >> OASHIFT;
4130 if (o->op_flags & OPf_STACKED) {
4131 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4134 return no_fh_allowed(o);
4137 if (o->op_flags & OPf_KIDS) {
4138 tokid = &cLISTOPo->op_first;
4139 kid = cLISTOPo->op_first;
4140 if (kid->op_type == OP_PUSHMARK ||
4141 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4143 tokid = &kid->op_sibling;
4144 kid = kid->op_sibling;
4146 if (!kid && opargs[type] & OA_DEFGV)
4147 *tokid = kid = newDEFSVOP();
4151 sibl = kid->op_sibling;
4165 if (kid->op_type == OP_CONST &&
4166 (kid->op_private & OPpCONST_BARE)) {
4167 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4168 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4169 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4171 warn("Array @%s missing the @ in argument %ld of %s()",
4172 name, (long)numargs, op_desc[type]);
4175 kid->op_sibling = sibl;
4178 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4179 bad_type(numargs, "array", op_desc[o->op_type], kid);
4183 if (kid->op_type == OP_CONST &&
4184 (kid->op_private & OPpCONST_BARE)) {
4185 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4186 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4187 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4189 warn("Hash %%%s missing the %% in argument %ld of %s()",
4190 name, (long)numargs, op_desc[type]);
4193 kid->op_sibling = sibl;
4196 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4197 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4202 OP *newop = newUNOP(OP_NULL, 0, kid);
4203 kid->op_sibling = 0;
4205 newop->op_next = newop;
4207 kid->op_sibling = sibl;
4212 if (kid->op_type != OP_GV) {
4213 if (kid->op_type == OP_CONST &&
4214 (kid->op_private & OPpCONST_BARE)) {
4215 OP *newop = newGVOP(OP_GV, 0,
4216 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4222 kid->op_sibling = 0;
4223 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4225 kid->op_sibling = sibl;
4231 mod(scalar(kid), type);
4235 tokid = &kid->op_sibling;
4236 kid = kid->op_sibling;
4238 o->op_private |= numargs;
4240 return too_many_arguments(o,op_desc[o->op_type]);
4243 else if (opargs[type] & OA_DEFGV) {
4245 return newUNOP(type, 0, newDEFSVOP());
4249 while (oa & OA_OPTIONAL)
4251 if (oa && oa != OA_LIST)
4252 return too_few_arguments(o,op_desc[o->op_type]);
4262 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4263 append_elem(OP_GLOB, o, newDEFSVOP());
4265 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4266 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4268 if (gv && GvIMPORTED_CV(gv)) {
4269 static int glob_index;
4271 append_elem(OP_GLOB, o,
4272 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4273 o->op_type = OP_LIST;
4274 o->op_ppaddr = ppaddr[OP_LIST];
4275 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4276 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4277 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4278 append_elem(OP_LIST, o,
4279 scalar(newUNOP(OP_RV2CV, 0,
4280 newGVOP(OP_GV, 0, gv)))));
4281 o = newUNOP(OP_NULL, 0, ck_subr(o));
4282 o->op_targ = OP_GLOB; /* hint at what it used to be */
4285 gv = newGVgen("main");
4287 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4297 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4299 o->op_ppaddr = ppaddr[OP_GREPSTART];
4300 Newz(1101, gwop, 1, LOGOP);
4302 if (o->op_flags & OPf_STACKED) {
4305 kid = cLISTOPo->op_first->op_sibling;
4306 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4309 kid->op_next = (OP*)gwop;
4310 o->op_flags &= ~OPf_STACKED;
4312 kid = cLISTOPo->op_first->op_sibling;
4313 if (type == OP_MAPWHILE)
4320 kid = cLISTOPo->op_first->op_sibling;
4321 if (kid->op_type != OP_NULL)
4322 croak("panic: ck_grep");
4323 kid = kUNOP->op_first;
4325 gwop->op_type = type;
4326 gwop->op_ppaddr = ppaddr[type];
4327 gwop->op_first = listkids(o);
4328 gwop->op_flags |= OPf_KIDS;
4329 gwop->op_private = 1;
4330 gwop->op_other = LINKLIST(kid);
4331 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4332 kid->op_next = (OP*)gwop;
4334 kid = cLISTOPo->op_first->op_sibling;
4335 if (!kid || !kid->op_sibling)
4336 return too_few_arguments(o,op_desc[o->op_type]);
4337 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4338 mod(kid, OP_GREPSTART);
4346 if (o->op_flags & OPf_KIDS) {
4347 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4348 if (kid && kid->op_type == OP_CONST)
4349 fbm_compile(((SVOP*)kid)->op_sv, 0);
4355 ck_lengthconst(OP *o)
4357 /* XXX length optimization goes here */
4364 OPCODE type = o->op_type;
4365 return modkids(ck_fun(o), type);
4371 OPCODE type = o->op_type;
4372 return refkids(ck_fun(o), type);
4380 kid = cLISTOPo->op_first;
4383 kid = cLISTOPo->op_first;
4385 if (kid->op_type == OP_PUSHMARK)
4386 kid = kid->op_sibling;
4387 if (kid && o->op_flags & OPf_STACKED)
4388 kid = kid->op_sibling;
4389 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4390 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4391 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4392 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4393 cLISTOPo->op_first->op_sibling = kid;
4394 cLISTOPo->op_last = kid;
4395 kid = kid->op_sibling;
4400 append_elem(o->op_type, o, newDEFSVOP());
4406 if (hints & HINT_LOCALE)
4407 o->op_private |= OPpLOCALE;
4414 ck_fun_locale(OP *o)
4420 if (hints & HINT_LOCALE)
4421 o->op_private |= OPpLOCALE;
4432 if (hints & HINT_LOCALE)
4433 o->op_private |= OPpLOCALE;
4442 o->op_private |= OPpRUNTIME;
4455 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4456 o->op_private |= OPpREPEAT_DOLIST;
4457 cBINOPo->op_first = force_list(cBINOPo->op_first);
4467 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4468 SVOP *kid = (SVOP*)cUNOPo->op_first;
4470 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4472 for (s = SvPVX(kid->op_sv); *s; s++) {
4473 if (*s == ':' && s[1] == ':') {
4475 Move(s+2, s+1, strlen(s+2)+1, char);
4476 --SvCUR(kid->op_sv);
4479 sv_catpvn(kid->op_sv, ".pm", 3);
4488 croak("NOT IMPL LINE %d",__LINE__);
4497 if (o->op_flags & OPf_KIDS) {
4498 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4499 if (kid && kid->op_sibling) {
4500 o->op_type = OP_SSELECT;
4501 o->op_ppaddr = ppaddr[OP_SSELECT];
4503 return fold_constants(o);
4507 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4508 if (kid && kid->op_type == OP_RV2GV)
4509 kid->op_private &= ~HINT_STRICT_REFS;
4516 I32 type = o->op_type;
4518 if (!(o->op_flags & OPf_KIDS)) {
4523 if (!CvUNIQUE(compcv)) {
4524 argop = newOP(OP_PADAV, OPf_REF);
4525 argop->op_targ = 0; /* curpad[0] is @_ */
4528 argop = newUNOP(OP_RV2AV, 0,
4529 scalar(newGVOP(OP_GV, 0,
4530 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4533 argop = newUNOP(OP_RV2AV, 0,
4534 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(compcv) ?
4535 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4536 #endif /* USE_THREADS */
4537 return newUNOP(type, 0, scalar(argop));
4539 return scalar(modkids(ck_fun(o), type));
4547 if (hints & HINT_LOCALE)
4548 o->op_private |= OPpLOCALE;
4551 if (o->op_flags & OPf_STACKED) {
4552 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4554 kid = kUNOP->op_first; /* get past rv2gv */
4556 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4558 if (kid->op_type == OP_SCOPE) {
4562 else if (kid->op_type == OP_LEAVE) {
4563 if (o->op_type == OP_SORT) {
4564 null(kid); /* wipe out leave */
4567 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4568 if (k->op_next == kid)
4573 kid->op_next = 0; /* just disconnect the leave */
4574 k = kLISTOP->op_first;
4578 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4579 null(kid); /* wipe out rv2gv */
4580 if (o->op_type == OP_SORT)
4584 o->op_flags |= OPf_SPECIAL;
4596 if (o->op_flags & OPf_STACKED)
4597 return no_fh_allowed(o);
4599 kid = cLISTOPo->op_first;
4600 if (kid->op_type != OP_NULL)
4601 croak("panic: ck_split");
4602 kid = kid->op_sibling;
4603 op_free(cLISTOPo->op_first);
4604 cLISTOPo->op_first = kid;
4606 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4607 cLISTOPo->op_last = kid; /* There was only one element previously */
4610 if (kid->op_type != OP_MATCH) {
4611 OP *sibl = kid->op_sibling;
4612 kid->op_sibling = 0;
4613 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4614 if (cLISTOPo->op_first == cLISTOPo->op_last)
4615 cLISTOPo->op_last = kid;
4616 cLISTOPo->op_first = kid;
4617 kid->op_sibling = sibl;
4620 kid->op_type = OP_PUSHRE;
4621 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4624 if (!kid->op_sibling)
4625 append_elem(OP_SPLIT, o, newDEFSVOP());
4627 kid = kid->op_sibling;
4630 if (!kid->op_sibling)
4631 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4633 kid = kid->op_sibling;
4636 if (kid->op_sibling)
4637 return too_many_arguments(o,op_desc[o->op_type]);
4646 OP *prev = ((cUNOPo->op_first->op_sibling)
4647 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4648 OP *o2 = prev->op_sibling;
4656 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4657 if (cvop->op_type == OP_RV2CV) {
4659 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4660 null(cvop); /* disable rv2cv */
4661 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4662 if (tmpop->op_type == OP_GV) {
4663 cv = GvCVu(tmpop->op_sv);
4664 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4665 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4666 proto = SvPV((SV*)cv, na);
4670 o->op_private |= (hints & HINT_STRICT_REFS);
4671 if (PERLDB_SUB && curstash != debstash)
4672 o->op_private |= OPpENTERSUB_DB;
4673 while (o2 != cvop) {
4677 return too_many_arguments(o, gv_ename(namegv));
4695 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4696 bad_type(arg, "block", gv_ename(namegv), o2);
4701 if (o2->op_type == OP_RV2GV)
4705 OP* sib = kid->op_sibling;
4706 kid->op_sibling = 0;
4707 o2 = newUNOP(OP_RV2GV, 0, kid);
4708 o2->op_sibling = sib;
4709 prev->op_sibling = o2;
4717 if (o2->op_type != OP_RV2GV)
4718 bad_type(arg, "symbol", gv_ename(namegv), o2);
4721 if (o2->op_type != OP_RV2CV)
4722 bad_type(arg, "sub", gv_ename(namegv), o2);
4725 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4726 bad_type(arg, "scalar", gv_ename(namegv), o2);
4729 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4730 bad_type(arg, "array", gv_ename(namegv), o2);
4733 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4734 bad_type(arg, "hash", gv_ename(namegv), o2);
4738 OP* sib = kid->op_sibling;
4739 kid->op_sibling = 0;
4740 o2 = newUNOP(OP_REFGEN, 0, kid);
4741 o2->op_sibling = sib;
4742 prev->op_sibling = o2;
4753 croak("Malformed prototype for %s: %s",
4754 gv_ename(namegv), SvPV((SV*)cv, na));
4759 mod(o2, OP_ENTERSUB);
4761 o2 = o2->op_sibling;
4763 if (proto && !optional &&
4764 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4765 return too_few_arguments(o, gv_ename(namegv));
4772 SvREADONLY_on(cSVOPo->op_sv);
4779 if (o->op_flags & OPf_KIDS) {
4780 SVOP *kid = (SVOP*)cUNOPo->op_first;
4782 if (kid->op_type == OP_NULL)
4783 kid = (SVOP*)kid->op_sibling;
4785 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4786 o->op_flags |= OPf_SPECIAL;
4791 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4794 peep(register OP *o)
4797 register OP* oldop = 0;
4798 if (!o || o->op_seq)
4803 for (; o; o = o->op_next) {
4809 switch (o->op_type) {
4812 curcop = ((COP*)o); /* for warnings */
4813 o->op_seq = op_seqmax++;
4824 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
4826 o->op_seq = op_seqmax++;
4829 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4830 o->op_seq = op_seqmax++;
4831 break; /* Scalar stub must produce undef. List stub is noop */
4835 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4842 if (oldop && o->op_next) {
4843 oldop->op_next = o->op_next;
4846 o->op_seq = op_seqmax++;
4850 if (o->op_next->op_type == OP_RV2SV) {
4851 if (!(o->op_next->op_private & OPpDEREF)) {
4853 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4854 o->op_next = o->op_next->op_next;
4855 o->op_type = OP_GVSV;
4856 o->op_ppaddr = ppaddr[OP_GVSV];
4859 else if (o->op_next->op_type == OP_RV2AV) {
4860 OP* pop = o->op_next->op_next;
4862 if (pop->op_type == OP_CONST &&
4863 (op = pop->op_next) &&
4864 pop->op_next->op_type == OP_AELEM &&
4865 !(pop->op_next->op_private &
4866 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4867 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4871 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4875 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4876 o->op_next = pop->op_next->op_next;
4877 o->op_type = OP_AELEMFAST;
4878 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4879 o->op_private = (U8)i;
4880 GvAVn(((GVOP*)o)->op_gv);
4883 o->op_seq = op_seqmax++;
4887 if (o->op_next->op_type == OP_RV2AV
4888 && (o->op_next->op_flags && OPf_REF))
4891 o->op_next = o->op_next->op_next;
4896 if (o->op_next->op_type == OP_RV2HV
4897 && (o->op_next->op_flags && OPf_REF))
4900 o->op_next = o->op_next->op_next;
4908 o->op_seq = op_seqmax++;
4909 while (cLOGOP->op_other->op_type == OP_NULL)
4910 cLOGOP->op_other = cLOGOP->op_other->op_next;
4911 peep(cLOGOP->op_other);
4915 o->op_seq = op_seqmax++;
4916 peep(cCONDOP->op_true);
4917 peep(cCONDOP->op_false);
4921 o->op_seq = op_seqmax++;
4922 peep(cLOOP->op_redoop);
4923 peep(cLOOP->op_nextop);
4924 peep(cLOOP->op_lastop);
4929 o->op_seq = op_seqmax++;
4930 peep(cPMOP->op_pmreplstart);
4934 o->op_seq = op_seqmax++;
4935 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4936 if (o->op_next->op_sibling &&
4937 o->op_next->op_sibling->op_type != OP_EXIT &&
4938 o->op_next->op_sibling->op_type != OP_WARN &&
4939 o->op_next->op_sibling->op_type != OP_DIE) {
4940 line_t oldline = curcop->cop_line;
4942 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4943 warn("Statement unlikely to be reached");
4944 warn("(Maybe you meant system() when you said exec()?)\n");
4945 curcop->cop_line = oldline;
4959 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4960 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4962 rop = (UNOP*)((BINOP*)o)->op_first;
4963 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4965 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4966 if (!SvOBJECT(lexname))
4968 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4969 if (!fields || !GvHV(*fields))
4971 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4972 key = SvPV(*svp, keylen);
4973 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4975 croak("No such field \"%s\" in variable %s of type %s",
4976 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4978 ind = SvIV(*indsvp);
4980 croak("Bad index while coercing array into hash");
4981 rop->op_type = OP_RV2AV;
4982 rop->op_ppaddr = ppaddr[OP_RV2AV];
4983 o->op_type = OP_AELEM;
4984 o->op_ppaddr = ppaddr[OP_AELEM];
4986 *svp = newSViv(ind);
4991 o->op_seq = op_seqmax++;