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));
47 SV* tmpsv = sv_newmortal();
48 gv_efullname3(tmpsv, gv, Nullch);
49 return SvPV(tmpsv,na);
55 yyerror(form("Missing comma after first argument to %s function",
56 op_desc[o->op_type]));
61 too_few_arguments(OP *o, char *name)
63 yyerror(form("Not enough arguments for %s", name));
68 too_many_arguments(OP *o, char *name)
70 yyerror(form("Too many arguments for %s", name));
75 bad_type(I32 n, char *t, char *name, OP *kid)
77 yyerror(form("Type of arg %d to %s must be %s (not %s)",
78 (int)n, name, t, op_desc[kid->op_type]));
84 int type = o->op_type;
85 if (type != OP_AELEM && type != OP_HELEM) {
86 yyerror(form("Can't use subscript on %s", op_desc[type]));
87 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV)
88 warn("(Did you mean $ or @ instead of %c?)\n",
89 type == OP_ENTERSUB ? '&' : '%');
93 /* "register" allocation */
96 pad_allocmy(char *name)
102 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
103 if (!isPRINT(name[1])) {
105 name[2] = toCTRL(name[1]);
108 croak("Can't use global %s in \"my\"",name);
110 if (dowarn && AvFILL(comppad_name) >= 0) {
111 SV **svp = AvARRAY(comppad_name);
112 for (off = AvFILL(comppad_name); off > comppad_name_floor; off--) {
115 && SvIVX(sv) == 999999999 /* var is in open scope */
116 && strEQ(name, SvPVX(sv)))
118 warn("\"my\" variable %s masks earlier declaration in same scope", name);
123 off = pad_alloc(OP_PADSV, SVs_PADMY);
125 sv_upgrade(sv, SVt_PVNV);
129 croak("Can't declare class for non-scalar %s in \"my\"",name);
131 (void)SvUPGRADE(sv, SVt_PVMG);
132 SvSTASH(sv) = (HV*)SvREFCNT_inc(in_my_stash);
135 av_store(comppad_name, off, sv);
136 SvNVX(sv) = (double)999999999;
137 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
138 if (!min_intro_pending)
139 min_intro_pending = off;
140 max_intro_pending = off;
142 av_store(comppad, off, (SV*)newAV());
143 else if (*name == '%')
144 av_store(comppad, off, (SV*)newHV());
145 SvPADMY_on(curpad[off]);
150 #ifndef CAN_PROTOTYPE
151 pad_findlex(name, newoff, seq, startcv, cx_ix)
158 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
166 register CONTEXT *cx;
169 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
170 AV *curlist = CvPADLIST(cv);
171 SV **svp = av_fetch(curlist, 0, FALSE);
174 if (!svp || *svp == &sv_undef)
177 svp = AvARRAY(curname);
178 for (off = AvFILL(curname); off > 0; off--) {
179 if ((sv = svp[off]) &&
182 seq > I_32(SvNVX(sv)) &&
183 strEQ(SvPVX(sv), name))
194 return 0; /* don't clone from inactive stack frame */
198 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
199 oldsv = *av_fetch(oldpad, off, TRUE);
200 if (!newoff) { /* Not a mere clone operation. */
201 SV *namesv = NEWSV(1103,0);
202 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
203 sv_upgrade(namesv, SVt_PVNV);
204 sv_setpv(namesv, name);
205 av_store(comppad_name, newoff, namesv);
206 SvNVX(namesv) = (double)curcop->cop_seq;
207 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
208 SvFAKE_on(namesv); /* A ref, not a real var */
209 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
210 /* "It's closures all the way down." */
214 oldsv = Nullsv; /* no need to keep ref */
219 bcv && bcv != cv && !CvCLONE(bcv);
220 bcv = CvOUTSIDE(bcv)) {
224 if (dowarn && !CvUNIQUE(cv))
226 "Variable \"%s\" may be unavailable",
233 else if (!CvUNIQUE(compcv)) {
234 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
235 warn("Variable \"%s\" will not stay shared", name);
238 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
244 /* Nothing in current lexical context--try eval's context, if any.
245 * This is necessary to let the perldb get at lexically scoped variables.
246 * XXX This will also probably interact badly with eval tree caching.
250 for (i = cx_ix; i >= 0; i--) {
252 switch (cx->cx_type) {
254 if (i == 0 && saweval) {
255 seq = cxstack[saweval].blk_oldcop->cop_seq;
256 return pad_findlex(name, newoff, seq, main_cv, 0);
260 switch (cx->blk_eval.old_op_type) {
265 /* require must have its own scope */
273 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
274 saweval = i; /* so we know where we were called from */
277 seq = cxstack[saweval].blk_oldcop->cop_seq;
278 return pad_findlex(name, newoff, seq, cv, i-1);
286 pad_findmy(char *name)
292 SV **svp = AvARRAY(comppad_name);
293 U32 seq = cop_seqmax;
297 * Special case to get lexical (and hence per-thread) @_.
298 * XXX I need to find out how to tell at parse-time whether use
299 * of @_ should refer to a lexical (from a sub) or defgv (global
300 * scope and maybe weird sub-ish things like formats). See
301 * startsub in perly.y. It's possible that @_ could be lexical
302 * (at least from subs) even in non-threaded perl.
304 if (strEQ(name, "@_"))
305 return 0; /* success. (NOT_IN_PAD indicates failure) */
306 #endif /* USE_THREADS */
308 /* The one we're looking for is probably just before comppad_name_fill. */
309 for (off = AvFILL(comppad_name); off > 0; off--) {
310 if ((sv = svp[off]) &&
314 seq > I_32(SvNVX(sv)))) &&
315 strEQ(SvPVX(sv), name))
318 return (PADOFFSET)off;
319 pendoff = off; /* this pending def. will override import */
323 /* See if it's in a nested scope */
324 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
326 /* If there is a pending local definition, this new alias must die */
328 SvIVX(AvARRAY(comppad_name)[off]) = seq;
329 return off; /* pad_findlex returns 0 for failure...*/
331 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
335 pad_leavemy(I32 fill)
338 SV **svp = AvARRAY(comppad_name);
340 if (min_intro_pending && fill < min_intro_pending) {
341 for (off = max_intro_pending; off >= min_intro_pending; off--) {
342 if ((sv = svp[off]) && sv != &sv_undef)
343 warn("%s never introduced", SvPVX(sv));
346 /* "Deintroduce" my variables that are leaving with this scope. */
347 for (off = AvFILL(comppad_name); off > fill; off--) {
348 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
349 SvIVX(sv) = cop_seqmax;
354 pad_alloc(I32 optype, U32 tmptype)
360 if (AvARRAY(comppad) != curpad)
361 croak("panic: pad_alloc");
362 if (pad_reset_pending)
364 if (tmptype & SVs_PADMY) {
366 sv = *av_fetch(comppad, AvFILL(comppad) + 1, TRUE);
367 } while (SvPADBUSY(sv)); /* need a fresh one */
368 retval = AvFILL(comppad);
371 SV **names = AvARRAY(comppad_name);
372 SSize_t names_fill = AvFILL(comppad_name);
375 * "foreach" index vars temporarily become aliases to non-"my"
376 * values. Thus we must skip, not just pad values that are
377 * marked as current pad values, but also those with names.
379 if (++padix <= names_fill &&
380 (sv = names[padix]) && sv != &sv_undef)
382 sv = *av_fetch(comppad, padix, TRUE);
383 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
388 SvFLAGS(sv) |= tmptype;
389 curpad = AvARRAY(comppad);
391 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
392 (unsigned long) thr, (unsigned long) curpad,
393 (long) retval, op_name[optype]));
395 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad alloc %ld for %s\n",
396 (long) retval, op_name[optype]));
397 #endif /* USE_THREADS */
398 return (PADOFFSET)retval;
402 #ifndef CAN_PROTOTYPE
407 #endif /* CAN_PROTOTYPE */
411 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
412 (unsigned long) thr, (unsigned long) curpad, po));
415 croak("panic: pad_sv po");
416 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad sv %d\n", po));
417 #endif /* USE_THREADS */
418 return curpad[po]; /* eventually we'll turn this into a macro */
422 #ifndef CAN_PROTOTYPE
426 pad_free(PADOFFSET po)
427 #endif /* CAN_PROTOTYPE */
432 if (AvARRAY(comppad) != curpad)
433 croak("panic: pad_free curpad");
435 croak("panic: pad_free po");
437 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
438 (unsigned long) thr, (unsigned long) curpad, po));
440 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad free %d\n", po));
441 #endif /* USE_THREADS */
442 if (curpad[po] && curpad[po] != &sv_undef)
443 SvPADTMP_off(curpad[po]);
449 #ifndef CAN_PROTOTYPE
453 pad_swipe(PADOFFSET po)
454 #endif /* CAN_PROTOTYPE */
457 if (AvARRAY(comppad) != curpad)
458 croak("panic: pad_swipe curpad");
460 croak("panic: pad_swipe po");
462 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
463 (unsigned long) thr, (unsigned long) curpad, po));
465 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad swipe %d\n", po));
466 #endif /* USE_THREADS */
467 SvPADTMP_off(curpad[po]);
468 curpad[po] = NEWSV(1107,0);
469 SvPADTMP_on(curpad[po]);
480 if (AvARRAY(comppad) != curpad)
481 croak("panic: pad_reset curpad");
483 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
484 (unsigned long) thr, (unsigned long) curpad));
486 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad reset\n"));
487 #endif /* USE_THREADS */
488 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
489 for (po = AvMAX(comppad); po > padix_floor; po--) {
490 if (curpad[po] && !SvIMMORTAL(curpad[po]))
491 SvPADTMP_off(curpad[po]);
495 pad_reset_pending = FALSE;
499 /* find_thread_magical is not reentrant */
501 find_thread_magical(char *name)
507 /* We currently only handle single character magicals */
508 p = strchr(per_thread_magicals, *name);
511 key = p - per_thread_magicals;
512 svp = av_fetch(thr->magicals, key, FALSE);
514 SV *sv = NEWSV(0, 0);
515 av_store(thr->magicals, key, sv);
517 * Some magic variables used to be automagically initialised
518 * in gv_fetchpv. Those which are now per-thread magicals get
519 * initialised here instead.
523 sv_setpv(sv, "\034");
526 sv_magic(sv, 0, 0, name, 1);
527 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
528 "find_thread_magical: new SV %p for $%s%c\n",
529 sv, (*name < 32) ? "^" : "",
530 (*name < 32) ? toCTRL(*name) : *name));
534 #endif /* USE_THREADS */
541 register OP *kid, *nextkid;
543 if (!o || o->op_seq == (U16)-1)
546 if (o->op_flags & OPf_KIDS) {
547 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
548 nextkid = kid->op_sibling; /* Get before next freeing kid */
553 switch (o->op_type) {
555 o->op_targ = 0; /* Was holding old type, if any. */
558 o->op_targ = 0; /* Was holding hints. */
562 o->op_targ = 0; /* Was holding index into thr->magicals AV. */
564 #endif /* USE_THREADS */
566 if (!(o->op_flags & OPf_REF) || (check[o->op_type] != ck_ftst))
572 SvREFCNT_dec(cGVOPo->op_gv);
576 Safefree(cCOPo->cop_label);
577 SvREFCNT_dec(cCOPo->cop_filegv);
580 SvREFCNT_dec(cSVOPo->op_sv);
586 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
590 Safefree(cPVOPo->op_pv);
593 op_free(cPMOPo->op_pmreplroot);
597 pregfree(cPMOPo->op_pmregexp);
598 SvREFCNT_dec(cPMOPo->op_pmshort);
603 pad_free(o->op_targ);
611 if (o->op_type != OP_NULL && o->op_targ > 0)
612 pad_free(o->op_targ);
613 o->op_targ = o->op_type;
614 o->op_type = OP_NULL;
615 o->op_ppaddr = ppaddr[OP_NULL];
618 /* Contextualizers */
620 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
630 /* establish postfix order */
631 if (cUNOPo->op_first) {
632 o->op_next = LINKLIST(cUNOPo->op_first);
633 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
635 kid->op_next = LINKLIST(kid->op_sibling);
650 if (o && o->op_flags & OPf_KIDS) {
651 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
661 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
663 line_t oldline = curcop->cop_line;
665 if (copline != NOLINE)
666 curcop->cop_line = copline;
667 warn("Found = in conditional, should be ==");
668 curcop->cop_line = oldline;
678 /* assumes no premature commitment */
679 if (!o || (o->op_flags & OPf_WANT) || error_count
680 || o->op_type == OP_RETURN)
683 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
685 switch (o->op_type) {
687 if (o->op_private & OPpREPEAT_DOLIST)
688 null(((LISTOP*)cBINOPo->op_first)->op_first);
689 scalar(cBINOPo->op_first);
694 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
698 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
699 if (!kPMOP->op_pmreplroot)
700 deprecate("implicit split to @_");
707 if (o->op_flags & OPf_KIDS) {
708 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
714 kid = cLISTOPo->op_first;
716 while (kid = kid->op_sibling) {
722 WITH_THR(curcop = &compiling);
727 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
733 WITH_THR(curcop = &compiling);
746 /* assumes no premature commitment */
747 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
748 || o->op_type == OP_RETURN)
751 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
753 switch (o->op_type) {
755 if (!(opargs[o->op_type] & OA_FOLDCONST))
759 if (o->op_flags & OPf_STACKED)
830 if (!(o->op_private & OPpLVAL_INTRO))
831 useless = op_desc[o->op_type];
838 if (!(o->op_private & OPpLVAL_INTRO) &&
839 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
840 useless = "a variable";
845 WITH_THR(curcop = ((COP*)o)); /* for warning below */
851 useless = "a constant";
852 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
854 else if (SvPOK(sv)) {
855 if (strnEQ(SvPVX(sv), "di", 2) ||
856 strnEQ(SvPVX(sv), "ds", 2) ||
857 strnEQ(SvPVX(sv), "ig", 2))
861 null(o); /* don't execute a constant */
862 SvREFCNT_dec(sv); /* don't even remember it */
866 o->op_type = OP_PREINC; /* pre-increment is faster */
867 o->op_ppaddr = ppaddr[OP_PREINC];
871 o->op_type = OP_PREDEC; /* pre-decrement is faster */
872 o->op_ppaddr = ppaddr[OP_PREDEC];
878 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
883 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
884 WITH_THR(curcop = ((COP*)o)); /* for warning below */
885 if (o->op_flags & OPf_STACKED)
891 if (!(o->op_flags & OPf_KIDS))
900 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
907 /* all requires must return a boolean value */
908 o->op_flags &= ~OPf_WANT;
911 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
912 if (!kPMOP->op_pmreplroot)
913 deprecate("implicit split to @_");
917 if (useless && dowarn)
918 warn("Useless use of %s in void context", useless);
926 if (o && o->op_flags & OPf_KIDS) {
927 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
938 /* assumes no premature commitment */
939 if (!o || (o->op_flags & OPf_WANT) || error_count
940 || o->op_type == OP_RETURN)
943 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
945 switch (o->op_type) {
948 list(cBINOPo->op_first);
953 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
960 if (!(o->op_flags & OPf_KIDS))
962 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
963 list(cBINOPo->op_first);
964 return gen_constant_list(o);
971 kid = cLISTOPo->op_first;
973 while (kid = kid->op_sibling) {
979 WITH_THR(curcop = &compiling);
983 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
989 WITH_THR(curcop = &compiling);
992 /* all requires must return a boolean value */
993 o->op_flags &= ~OPf_WANT;
1005 if (o->op_type == OP_LINESEQ ||
1006 o->op_type == OP_SCOPE ||
1007 o->op_type == OP_LEAVE ||
1008 o->op_type == OP_LEAVETRY)
1011 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1012 if (kid->op_sibling) {
1016 curcop = &compiling;
1018 o->op_flags &= ~OPf_PARENS;
1019 if (hints & HINT_BLOCK_SCOPE)
1020 o->op_flags |= OPf_PARENS;
1023 o = newOP(OP_STUB, 0);
1028 modkids(OP *o, I32 type)
1031 if (o && o->op_flags & OPf_KIDS) {
1032 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1038 static I32 modcount;
1041 mod(OP *o, I32 type)
1047 if (!o || error_count)
1050 switch (o->op_type) {
1055 if (!(o->op_private & (OPpCONST_ARYBASE)))
1057 if (eval_start && eval_start->op_type == OP_CONST) {
1058 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1062 SAVEI32(compiling.cop_arybase);
1063 compiling.cop_arybase = 0;
1065 else if (type == OP_REFGEN)
1068 croak("That use of $[ is unsupported");
1071 if (o->op_flags & OPf_PARENS)
1075 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1076 !(o->op_flags & OPf_STACKED)) {
1077 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1078 o->op_ppaddr = ppaddr[OP_RV2CV];
1079 assert(cUNOPo->op_first->op_type == OP_NULL);
1080 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1086 /* grep, foreach, subcalls, refgen */
1087 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1089 yyerror(form("Can't modify %s in %s",
1090 op_desc[o->op_type],
1091 type ? op_desc[type] : "local"));
1105 case OP_RIGHT_SHIFT:
1114 if (!(o->op_flags & OPf_STACKED))
1120 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1126 if (!type && cUNOPo->op_first->op_type != OP_GV)
1127 croak("Can't localize through a reference");
1128 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1130 return o; /* Treat \(@foo) like ordinary list. */
1134 if (scalar_mod_type(o, type))
1136 ref(cUNOPo->op_first, o->op_type);
1148 if (!type && cUNOPo->op_first->op_type != OP_GV)
1149 croak("Can't localize through a reference");
1150 ref(cUNOPo->op_first, o->op_type);
1162 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1163 return o; /* Treat \(@foo) like ordinary list. */
1164 if (scalar_mod_type(o, type))
1170 croak("Can't localize lexical variable %s",
1171 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1176 modcount++; /* XXX ??? */
1179 croak("Can't localize thread-specific variable");
1182 #endif /* USE_THREADS */
1188 if (type != OP_SASSIGN)
1194 pad_free(o->op_targ);
1195 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1196 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1197 if (o->op_flags & OPf_KIDS)
1198 mod(cBINOPo->op_first->op_sibling, type);
1203 ref(cBINOPo->op_first, o->op_type);
1204 if (type == OP_ENTERSUB &&
1205 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1206 o->op_private |= OPpLVAL_DEFER;
1213 if (o->op_flags & OPf_KIDS)
1214 mod(cLISTOPo->op_last, type);
1218 if (!(o->op_flags & OPf_KIDS))
1220 if (o->op_targ != OP_LIST) {
1221 mod(cBINOPo->op_first, type);
1226 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1230 o->op_flags |= OPf_MOD;
1232 if (type == OP_AASSIGN || type == OP_SASSIGN)
1233 o->op_flags |= OPf_SPECIAL|OPf_REF;
1235 o->op_private |= OPpLVAL_INTRO;
1236 o->op_flags &= ~OPf_SPECIAL;
1238 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1239 o->op_flags |= OPf_REF;
1244 scalar_mod_type(OP *o, I32 type)
1248 if (o->op_type == OP_RV2GV)
1272 case OP_RIGHT_SHIFT:
1279 case OP_ANDASSIGN: /* may work later */
1280 case OP_ORASSIGN: /* may work later */
1288 refkids(OP *o, I32 type)
1291 if (o && o->op_flags & OPf_KIDS) {
1292 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1299 ref(OP *o, I32 type)
1303 if (!o || error_count)
1306 switch (o->op_type) {
1308 if ((type == OP_DEFINED || type == OP_LOCK) &&
1309 !(o->op_flags & OPf_STACKED)) {
1310 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1311 o->op_ppaddr = ppaddr[OP_RV2CV];
1312 assert(cUNOPo->op_first->op_type == OP_NULL);
1313 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1314 o->op_flags |= OPf_SPECIAL;
1319 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1323 ref(cUNOPo->op_first, o->op_type);
1326 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1327 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1328 : type == OP_RV2HV ? OPpDEREF_HV
1330 o->op_flags |= OPf_MOD;
1335 o->op_flags |= OPf_MOD; /* XXX ??? */
1340 o->op_flags |= OPf_REF;
1343 ref(cUNOPo->op_first, o->op_type);
1348 o->op_flags |= OPf_REF;
1353 if (!(o->op_flags & OPf_KIDS))
1355 ref(cBINOPo->op_first, type);
1359 ref(cBINOPo->op_first, o->op_type);
1360 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1361 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1362 : type == OP_RV2HV ? OPpDEREF_HV
1364 o->op_flags |= OPf_MOD;
1372 if (!(o->op_flags & OPf_KIDS))
1374 ref(cLISTOPo->op_last, type);
1389 if (!o || error_count)
1393 if (type == OP_LIST) {
1394 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1397 else if (type != OP_PADSV &&
1400 type != OP_PUSHMARK)
1402 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1405 o->op_flags |= OPf_MOD;
1406 o->op_private |= OPpLVAL_INTRO;
1414 o->op_flags |= OPf_PARENS;
1419 bind_match(I32 type, OP *left, OP *right)
1424 (left->op_type == OP_RV2AV ||
1425 left->op_type == OP_RV2HV ||
1426 left->op_type == OP_PADAV ||
1427 left->op_type == OP_PADHV)) {
1428 char *desc = op_desc[(right->op_type == OP_SUBST ||
1429 right->op_type == OP_TRANS)
1430 ? right->op_type : OP_MATCH];
1431 char *sample = ((left->op_type == OP_RV2AV ||
1432 left->op_type == OP_PADAV)
1433 ? "@array" : "%hash");
1434 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1437 if (right->op_type == OP_MATCH ||
1438 right->op_type == OP_SUBST ||
1439 right->op_type == OP_TRANS) {
1440 right->op_flags |= OPf_STACKED;
1441 if (right->op_type != OP_MATCH)
1442 left = mod(left, right->op_type);
1443 if (right->op_type == OP_TRANS)
1444 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1446 o = prepend_elem(right->op_type, scalar(left), right);
1448 return newUNOP(OP_NOT, 0, scalar(o));
1452 return bind_match(type, left,
1453 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1461 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1462 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1469 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1470 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1471 o->op_type = OP_LEAVE;
1472 o->op_ppaddr = ppaddr[OP_LEAVE];
1475 if (o->op_type == OP_LINESEQ) {
1477 o->op_type = OP_SCOPE;
1478 o->op_ppaddr = ppaddr[OP_SCOPE];
1479 kid = ((LISTOP*)o)->op_first;
1480 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1481 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1486 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1493 block_start(int full)
1496 int retval = savestack_ix;
1497 SAVEI32(comppad_name_floor);
1499 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1500 comppad_name_floor = comppad_name_fill;
1502 comppad_name_floor = 0;
1504 SAVEI32(min_intro_pending);
1505 SAVEI32(max_intro_pending);
1506 min_intro_pending = 0;
1507 SAVEI32(comppad_name_fill);
1508 SAVEI32(padix_floor);
1509 padix_floor = padix;
1510 pad_reset_pending = FALSE;
1512 hints &= ~HINT_BLOCK_SCOPE;
1517 block_end(I32 floor, OP *seq)
1520 int needblockscope = hints & HINT_BLOCK_SCOPE;
1521 OP* retval = scalarseq(seq);
1523 pad_reset_pending = FALSE;
1525 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1526 pad_leavemy(comppad_name_fill);
1536 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1537 eval_start = linklist(eval_root);
1538 eval_root->op_next = 0;
1544 main_root = scope(sawparens(scalarvoid(o)));
1545 curcop = &compiling;
1546 main_start = LINKLIST(main_root);
1547 main_root->op_next = 0;
1551 /* Register with debugger */
1553 CV *cv = perl_get_cv("DB::postponed", FALSE);
1557 XPUSHs((SV*)compiling.cop_filegv);
1559 perl_call_sv((SV*)cv, G_DISCARD);
1566 localize(OP *o, I32 lex)
1568 if (o->op_flags & OPf_PARENS)
1572 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1574 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1575 if (*s == ';' || *s == '=')
1576 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1580 in_my_stash = Nullhv;
1584 return mod(o, OP_NULL); /* a bit kludgey */
1590 if (o->op_type == OP_LIST) {
1593 o2 = newOP(OP_SPECIFIC, 0);
1594 o2->op_targ = find_thread_magical(";");
1596 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1597 #endif /* USE_THREADS */
1598 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1604 fold_constants(register OP *o)
1608 I32 type = o->op_type;
1611 if (opargs[type] & OA_RETSCALAR)
1613 if (opargs[type] & OA_TARGET)
1614 o->op_targ = pad_alloc(type, SVs_PADTMP);
1616 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1617 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1619 if (!(opargs[type] & OA_FOLDCONST))
1628 if (o->op_private & OPpLOCALE)
1633 goto nope; /* Don't try to run w/ errors */
1635 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1636 if (curop->op_type != OP_CONST &&
1637 curop->op_type != OP_LIST &&
1638 curop->op_type != OP_SCALAR &&
1639 curop->op_type != OP_NULL &&
1640 curop->op_type != OP_PUSHMARK) {
1645 curop = LINKLIST(o);
1650 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1651 pad_swipe(o->op_targ);
1652 else if (SvTEMP(sv)) { /* grab mortal temp? */
1653 (void)SvREFCNT_inc(sv);
1657 if (type == OP_RV2GV)
1658 return newGVOP(OP_GV, 0, (GV*)sv);
1660 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1662 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1667 SvIOK_off(sv); /* undo SvIV() damage */
1669 return newSVOP(OP_CONST, 0, sv);
1673 if (!(opargs[type] & OA_OTHERINT))
1676 if (!(hints & HINT_INTEGER)) {
1677 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1680 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1681 if (curop->op_type == OP_CONST) {
1682 if (SvIOK(((SVOP*)curop)->op_sv))
1686 if (opargs[curop->op_type] & OA_RETINTEGER)
1690 o->op_ppaddr = ppaddr[++(o->op_type)];
1697 gen_constant_list(register OP *o)
1701 I32 oldtmps_floor = tmps_floor;
1705 return o; /* Don't attempt to run with errors */
1707 op = curop = LINKLIST(o);
1713 tmps_floor = oldtmps_floor;
1715 o->op_type = OP_RV2AV;
1716 o->op_ppaddr = ppaddr[OP_RV2AV];
1717 curop = ((UNOP*)o)->op_first;
1718 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1725 convert(I32 type, I32 flags, OP *o)
1730 if (!o || o->op_type != OP_LIST)
1731 o = newLISTOP(OP_LIST, 0, o, Nullop);
1733 o->op_flags &= ~OPf_WANT;
1735 if (!(opargs[type] & OA_MARK))
1736 null(cLISTOPo->op_first);
1739 o->op_ppaddr = ppaddr[type];
1740 o->op_flags |= flags;
1742 o = CHECKOP(type, o);
1743 if (o->op_type != type)
1746 if (cLISTOPo->op_children < 7) {
1747 /* XXX do we really need to do this if we're done appending?? */
1748 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1750 cLISTOPo->op_last = last; /* in case check substituted last arg */
1753 return fold_constants(o);
1756 /* List constructors */
1759 append_elem(I32 type, OP *first, OP *last)
1767 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1768 return newLISTOP(type, 0, first, last);
1770 if (first->op_flags & OPf_KIDS)
1771 ((LISTOP*)first)->op_last->op_sibling = last;
1773 first->op_flags |= OPf_KIDS;
1774 ((LISTOP*)first)->op_first = last;
1776 ((LISTOP*)first)->op_last = last;
1777 ((LISTOP*)first)->op_children++;
1782 append_list(I32 type, LISTOP *first, LISTOP *last)
1790 if (first->op_type != type)
1791 return prepend_elem(type, (OP*)first, (OP*)last);
1793 if (last->op_type != type)
1794 return append_elem(type, (OP*)first, (OP*)last);
1796 first->op_last->op_sibling = last->op_first;
1797 first->op_last = last->op_last;
1798 first->op_children += last->op_children;
1799 if (first->op_children)
1800 last->op_flags |= OPf_KIDS;
1807 prepend_elem(I32 type, OP *first, OP *last)
1815 if (last->op_type == type) {
1816 if (type == OP_LIST) { /* already a PUSHMARK there */
1817 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1818 ((LISTOP*)last)->op_first->op_sibling = first;
1821 if (!(last->op_flags & OPf_KIDS)) {
1822 ((LISTOP*)last)->op_last = first;
1823 last->op_flags |= OPf_KIDS;
1825 first->op_sibling = ((LISTOP*)last)->op_first;
1826 ((LISTOP*)last)->op_first = first;
1828 ((LISTOP*)last)->op_children++;
1832 return newLISTOP(type, 0, first, last);
1840 return newOP(OP_STUB, 0);
1846 if (!o || o->op_type != OP_LIST)
1847 o = newLISTOP(OP_LIST, 0, o, Nullop);
1853 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1857 Newz(1101, listop, 1, LISTOP);
1859 listop->op_type = type;
1860 listop->op_ppaddr = ppaddr[type];
1861 listop->op_children = (first != 0) + (last != 0);
1862 listop->op_flags = flags;
1866 else if (!first && last)
1869 first->op_sibling = last;
1870 listop->op_first = first;
1871 listop->op_last = last;
1872 if (type == OP_LIST) {
1874 pushop = newOP(OP_PUSHMARK, 0);
1875 pushop->op_sibling = first;
1876 listop->op_first = pushop;
1877 listop->op_flags |= OPf_KIDS;
1879 listop->op_last = pushop;
1881 else if (listop->op_children)
1882 listop->op_flags |= OPf_KIDS;
1888 newOP(I32 type, I32 flags)
1891 Newz(1101, o, 1, OP);
1893 o->op_ppaddr = ppaddr[type];
1894 o->op_flags = flags;
1897 o->op_private = 0 + (flags >> 8);
1898 if (opargs[type] & OA_RETSCALAR)
1900 if (opargs[type] & OA_TARGET)
1901 o->op_targ = pad_alloc(type, SVs_PADTMP);
1902 return CHECKOP(type, o);
1906 newUNOP(I32 type, I32 flags, OP *first)
1911 first = newOP(OP_STUB, 0);
1912 if (opargs[type] & OA_MARK)
1913 first = force_list(first);
1915 Newz(1101, unop, 1, UNOP);
1916 unop->op_type = type;
1917 unop->op_ppaddr = ppaddr[type];
1918 unop->op_first = first;
1919 unop->op_flags = flags | OPf_KIDS;
1920 unop->op_private = 1 | (flags >> 8);
1922 unop = (UNOP*) CHECKOP(type, unop);
1926 return fold_constants((OP *) unop);
1930 newBINOP(I32 type, I32 flags, OP *first, OP *last)
1933 Newz(1101, binop, 1, BINOP);
1936 first = newOP(OP_NULL, 0);
1938 binop->op_type = type;
1939 binop->op_ppaddr = ppaddr[type];
1940 binop->op_first = first;
1941 binop->op_flags = flags | OPf_KIDS;
1944 binop->op_private = 1 | (flags >> 8);
1947 binop->op_private = 2 | (flags >> 8);
1948 first->op_sibling = last;
1951 binop = (BINOP*)CHECKOP(type, binop);
1955 binop->op_last = last = binop->op_first->op_sibling;
1957 return fold_constants((OP *)binop);
1961 pmtrans(OP *o, OP *expr, OP *repl)
1963 SV *tstr = ((SVOP*)expr)->op_sv;
1964 SV *rstr = ((SVOP*)repl)->op_sv;
1967 register U8 *t = (U8*)SvPV(tstr, tlen);
1968 register U8 *r = (U8*)SvPV(rstr, rlen);
1973 register short *tbl;
1975 tbl = (short*)cPVOPo->op_pv;
1976 complement = o->op_private & OPpTRANS_COMPLEMENT;
1977 Delete = o->op_private & OPpTRANS_DELETE;
1978 /* squash = o->op_private & OPpTRANS_SQUASH; */
1981 Zero(tbl, 256, short);
1982 for (i = 0; i < tlen; i++)
1984 for (i = 0, j = 0; i < 256; i++) {
2000 if (!rlen && !Delete) {
2003 for (i = 0; i < 256; i++)
2005 for (i = 0, j = 0; i < tlen; i++,j++) {
2008 if (tbl[t[i]] == -1)
2014 if (tbl[t[i]] == -1)
2025 newPMOP(I32 type, I32 flags)
2030 Newz(1101, pmop, 1, PMOP);
2031 pmop->op_type = type;
2032 pmop->op_ppaddr = ppaddr[type];
2033 pmop->op_flags = flags;
2034 pmop->op_private = 0 | (flags >> 8);
2036 if (hints & HINT_LOCALE)
2037 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2039 /* link into pm list */
2040 if (type != OP_TRANS && curstash) {
2041 pmop->op_pmnext = HvPMROOT(curstash);
2042 HvPMROOT(curstash) = pmop;
2049 pmruntime(OP *o, OP *expr, OP *repl)
2054 if (o->op_type == OP_TRANS)
2055 return pmtrans(o, expr, repl);
2057 hints |= HINT_BLOCK_SCOPE;
2060 if (expr->op_type == OP_CONST) {
2062 SV *pat = ((SVOP*)expr)->op_sv;
2063 char *p = SvPV(pat, plen);
2064 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2065 sv_setpvn(pat, "\\s+", 3);
2066 p = SvPV(pat, plen);
2067 pm->op_pmflags |= PMf_SKIPWHITE;
2069 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2070 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2071 pm->op_pmflags |= PMf_WHITE;
2076 if (pm->op_pmflags & PMf_KEEP)
2077 expr = newUNOP(OP_REGCMAYBE,0,expr);
2079 Newz(1101, rcop, 1, LOGOP);
2080 rcop->op_type = OP_REGCOMP;
2081 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2082 rcop->op_first = scalar(expr);
2083 rcop->op_flags |= OPf_KIDS;
2084 rcop->op_private = 1;
2087 /* establish postfix order */
2088 if (pm->op_pmflags & PMf_KEEP) {
2090 rcop->op_next = expr;
2091 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2094 rcop->op_next = LINKLIST(expr);
2095 expr->op_next = (OP*)rcop;
2098 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2103 if (pm->op_pmflags & PMf_EVAL)
2106 else if (repl->op_type == OP_SPECIFIC
2107 && strchr("&`'123456789+",
2108 per_thread_magicals[repl->op_targ]))
2112 #endif /* USE_THREADS */
2113 else if (repl->op_type == OP_CONST)
2117 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2118 if (opargs[curop->op_type] & OA_DANGEROUS) {
2120 if (curop->op_type == OP_SPECIFIC
2121 && strchr("&`'123456789+", curop->op_private)) {
2125 if (curop->op_type == OP_GV) {
2126 GV *gv = ((GVOP*)curop)->op_gv;
2127 if (strchr("&`'123456789+", *GvENAME(gv)))
2130 #endif /* USE_THREADS */
2131 else if (curop->op_type == OP_RV2CV)
2133 else if (curop->op_type == OP_RV2SV ||
2134 curop->op_type == OP_RV2AV ||
2135 curop->op_type == OP_RV2HV ||
2136 curop->op_type == OP_RV2GV) {
2137 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2140 else if (curop->op_type == OP_PADSV ||
2141 curop->op_type == OP_PADAV ||
2142 curop->op_type == OP_PADHV ||
2143 curop->op_type == OP_PADANY) {
2152 if (curop == repl) {
2153 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2154 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2155 prepend_elem(o->op_type, scalar(repl), o);
2158 Newz(1101, rcop, 1, LOGOP);
2159 rcop->op_type = OP_SUBSTCONT;
2160 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2161 rcop->op_first = scalar(repl);
2162 rcop->op_flags |= OPf_KIDS;
2163 rcop->op_private = 1;
2166 /* establish postfix order */
2167 rcop->op_next = LINKLIST(repl);
2168 repl->op_next = (OP*)rcop;
2170 pm->op_pmreplroot = scalar((OP*)rcop);
2171 pm->op_pmreplstart = LINKLIST(rcop);
2180 newSVOP(I32 type, I32 flags, SV *sv)
2183 Newz(1101, svop, 1, SVOP);
2184 svop->op_type = type;
2185 svop->op_ppaddr = ppaddr[type];
2187 svop->op_next = (OP*)svop;
2188 svop->op_flags = flags;
2189 if (opargs[type] & OA_RETSCALAR)
2191 if (opargs[type] & OA_TARGET)
2192 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2193 return CHECKOP(type, svop);
2197 newGVOP(I32 type, I32 flags, GV *gv)
2201 Newz(1101, gvop, 1, GVOP);
2202 gvop->op_type = type;
2203 gvop->op_ppaddr = ppaddr[type];
2204 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2205 gvop->op_next = (OP*)gvop;
2206 gvop->op_flags = flags;
2207 if (opargs[type] & OA_RETSCALAR)
2209 if (opargs[type] & OA_TARGET)
2210 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2211 return CHECKOP(type, gvop);
2215 newPVOP(I32 type, I32 flags, char *pv)
2218 Newz(1101, pvop, 1, PVOP);
2219 pvop->op_type = type;
2220 pvop->op_ppaddr = ppaddr[type];
2222 pvop->op_next = (OP*)pvop;
2223 pvop->op_flags = flags;
2224 if (opargs[type] & OA_RETSCALAR)
2226 if (opargs[type] & OA_TARGET)
2227 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2228 return CHECKOP(type, pvop);
2237 save_hptr(&curstash);
2238 save_item(curstname);
2243 name = SvPV(sv, len);
2244 curstash = gv_stashpvn(name,len,TRUE);
2245 sv_setpvn(curstname, name, len);
2249 sv_setpv(curstname,"<none>");
2257 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2265 if (id->op_type != OP_CONST)
2266 croak("Module name must be constant");
2270 if(version != Nullop) {
2271 SV *vesv = ((SVOP*)version)->op_sv;
2273 if (arg == Nullop && !SvNIOK(vesv)) {
2280 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2281 croak("Version number must be constant number");
2283 /* Make copy of id so we don't free it twice */
2284 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2286 /* Fake up a method call to VERSION */
2287 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2288 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2289 append_elem(OP_LIST,
2290 prepend_elem(OP_LIST, pack, list(version)),
2291 newUNOP(OP_METHOD, 0, meth)));
2295 /* Fake up an import/unimport */
2296 if (arg && arg->op_type == OP_STUB)
2297 imop = arg; /* no import on explicit () */
2298 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2299 imop = Nullop; /* use 5.0; */
2302 /* Make copy of id so we don't free it twice */
2303 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2304 meth = newSVOP(OP_CONST, 0,
2306 ? newSVpv("import", 6)
2307 : newSVpv("unimport", 8)
2309 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2310 append_elem(OP_LIST,
2311 prepend_elem(OP_LIST, pack, list(arg)),
2312 newUNOP(OP_METHOD, 0, meth)));
2315 /* Fake up a require */
2316 rqop = newUNOP(OP_REQUIRE, 0, id);
2318 /* Fake up the BEGIN {}, which does its thing immediately. */
2320 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2322 append_elem(OP_LINESEQ,
2323 append_elem(OP_LINESEQ,
2324 newSTATEOP(0, Nullch, rqop),
2325 newSTATEOP(0, Nullch, veop)),
2326 newSTATEOP(0, Nullch, imop) ));
2333 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2335 return newBINOP(OP_LSLICE, flags,
2336 list(force_list(subscript)),
2337 list(force_list(listval)) );
2341 list_assignment(register OP *o)
2346 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2347 o = cUNOPo->op_first;
2349 if (o->op_type == OP_COND_EXPR) {
2350 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2351 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2356 yyerror("Assignment to both a list and a scalar");
2360 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2361 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2362 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2365 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2368 if (o->op_type == OP_RV2SV)
2375 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2380 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2381 return newLOGOP(optype, 0,
2382 mod(scalar(left), optype),
2383 newUNOP(OP_SASSIGN, 0, scalar(right)));
2386 return newBINOP(optype, OPf_STACKED,
2387 mod(scalar(left), optype), scalar(right));
2391 if (list_assignment(left)) {
2393 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2394 left = mod(left, OP_AASSIGN);
2402 o = newBINOP(OP_AASSIGN, flags,
2403 list(force_list(right)),
2404 list(force_list(left)) );
2405 o->op_private = 0 | (flags >> 8);
2406 if (!(left->op_private & OPpLVAL_INTRO)) {
2407 static int generation = 100;
2411 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2412 if (opargs[curop->op_type] & OA_DANGEROUS) {
2413 if (curop->op_type == OP_GV) {
2414 GV *gv = ((GVOP*)curop)->op_gv;
2415 if (gv == defgv || SvCUR(gv) == generation)
2417 SvCUR(gv) = generation;
2419 else if (curop->op_type == OP_PADSV ||
2420 curop->op_type == OP_PADAV ||
2421 curop->op_type == OP_PADHV ||
2422 curop->op_type == OP_PADANY) {
2423 SV **svp = AvARRAY(comppad_name);
2424 SV *sv = svp[curop->op_targ];
2425 if (SvCUR(sv) == generation)
2427 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2429 else if (curop->op_type == OP_RV2CV)
2431 else if (curop->op_type == OP_RV2SV ||
2432 curop->op_type == OP_RV2AV ||
2433 curop->op_type == OP_RV2HV ||
2434 curop->op_type == OP_RV2GV) {
2435 if (lastop->op_type != OP_GV) /* funny deref? */
2444 o->op_private = OPpASSIGN_COMMON;
2446 if (right && right->op_type == OP_SPLIT) {
2448 if ((tmpop = ((LISTOP*)right)->op_first) &&
2449 tmpop->op_type == OP_PUSHRE)
2451 PMOP *pm = (PMOP*)tmpop;
2452 if (left->op_type == OP_RV2AV &&
2453 !(left->op_private & OPpLVAL_INTRO) &&
2454 !(o->op_private & OPpASSIGN_COMMON) )
2456 tmpop = ((UNOP*)left)->op_first;
2457 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2458 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2459 pm->op_pmflags |= PMf_ONCE;
2460 tmpop = cUNOPo->op_first; /* to list (nulled) */
2461 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2462 tmpop->op_sibling = Nullop; /* don't free split */
2463 right->op_next = tmpop->op_next; /* fix starting loc */
2464 op_free(o); /* blow off assign */
2465 right->op_flags &= ~OPf_WANT;
2466 /* "I don't know and I don't care." */
2471 if (modcount < 10000 &&
2472 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2474 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2476 sv_setiv(sv, modcount+1);
2484 right = newOP(OP_UNDEF, 0);
2485 if (right->op_type == OP_READLINE) {
2486 right->op_flags |= OPf_STACKED;
2487 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2490 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2491 o = newBINOP(OP_SASSIGN, flags,
2492 scalar(right), mod(scalar(left), OP_SASSIGN) );
2504 newSTATEOP(I32 flags, char *label, OP *o)
2507 U32 seq = intro_my();
2510 Newz(1101, cop, 1, COP);
2511 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2512 cop->op_type = OP_DBSTATE;
2513 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2516 cop->op_type = OP_NEXTSTATE;
2517 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2519 cop->op_flags = flags;
2520 cop->op_private = 0 | (flags >> 8);
2522 cop->op_private |= NATIVE_HINTS;
2524 cop->op_next = (OP*)cop;
2527 cop->cop_label = label;
2528 hints |= HINT_BLOCK_SCOPE;
2531 cop->cop_arybase = curcop->cop_arybase;
2533 if (copline == NOLINE)
2534 cop->cop_line = curcop->cop_line;
2536 cop->cop_line = copline;
2539 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2540 cop->cop_stash = curstash;
2542 if (PERLDB_LINE && curstash != debstash) {
2543 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2544 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2545 (void)SvIOK_on(*svp);
2547 SvSTASH(*svp) = (HV*)cop;
2551 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2554 /* "Introduce" my variables to visible status. */
2562 if (! min_intro_pending)
2565 svp = AvARRAY(comppad_name);
2566 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2567 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2568 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2569 SvNVX(sv) = (double)cop_seqmax;
2572 min_intro_pending = 0;
2573 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2574 return cop_seqmax++;
2578 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2584 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2585 return newBINOP(type, flags, scalar(first), scalar(other));
2587 scalarboolean(first);
2588 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2589 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2590 if (type == OP_AND || type == OP_OR) {
2596 first = cUNOPo->op_first;
2598 first->op_next = o->op_next;
2599 cUNOPo->op_first = Nullop;
2603 if (first->op_type == OP_CONST) {
2604 if (dowarn && (first->op_private & OPpCONST_BARE))
2605 warn("Probable precedence problem on %s", op_desc[type]);
2606 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2615 else if (first->op_type == OP_WANTARRAY) {
2621 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2622 OP *k1 = ((UNOP*)first)->op_first;
2623 OP *k2 = k1->op_sibling;
2625 switch (first->op_type)
2628 if (k2 && k2->op_type == OP_READLINE
2629 && (k2->op_flags & OPf_STACKED)
2630 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2631 warnop = k2->op_type;
2635 if (k1->op_type == OP_READDIR
2636 || k1->op_type == OP_GLOB
2637 || k1->op_type == OP_EACH)
2638 warnop = k1->op_type;
2642 line_t oldline = curcop->cop_line;
2643 curcop->cop_line = copline;
2644 warn("Value of %s%s can be \"0\"; test with defined()",
2646 ((warnop == OP_READLINE || warnop == OP_GLOB)
2647 ? " construct" : "() operator"));
2648 curcop->cop_line = oldline;
2655 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2656 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2658 Newz(1101, logop, 1, LOGOP);
2660 logop->op_type = type;
2661 logop->op_ppaddr = ppaddr[type];
2662 logop->op_first = first;
2663 logop->op_flags = flags | OPf_KIDS;
2664 logop->op_other = LINKLIST(other);
2665 logop->op_private = 1 | (flags >> 8);
2667 /* establish postfix order */
2668 logop->op_next = LINKLIST(first);
2669 first->op_next = (OP*)logop;
2670 first->op_sibling = other;
2672 o = newUNOP(OP_NULL, 0, (OP*)logop);
2679 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2686 return newLOGOP(OP_AND, 0, first, trueop);
2688 return newLOGOP(OP_OR, 0, first, falseop);
2690 scalarboolean(first);
2691 if (first->op_type == OP_CONST) {
2692 if (SvTRUE(((SVOP*)first)->op_sv)) {
2703 else if (first->op_type == OP_WANTARRAY) {
2707 Newz(1101, condop, 1, CONDOP);
2709 condop->op_type = OP_COND_EXPR;
2710 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2711 condop->op_first = first;
2712 condop->op_flags = flags | OPf_KIDS;
2713 condop->op_true = LINKLIST(trueop);
2714 condop->op_false = LINKLIST(falseop);
2715 condop->op_private = 1 | (flags >> 8);
2717 /* establish postfix order */
2718 condop->op_next = LINKLIST(first);
2719 first->op_next = (OP*)condop;
2721 first->op_sibling = trueop;
2722 trueop->op_sibling = falseop;
2723 o = newUNOP(OP_NULL, 0, (OP*)condop);
2725 trueop->op_next = o;
2726 falseop->op_next = o;
2732 newRANGE(I32 flags, OP *left, OP *right)
2740 Newz(1101, condop, 1, CONDOP);
2742 condop->op_type = OP_RANGE;
2743 condop->op_ppaddr = ppaddr[OP_RANGE];
2744 condop->op_first = left;
2745 condop->op_flags = OPf_KIDS;
2746 condop->op_true = LINKLIST(left);
2747 condop->op_false = LINKLIST(right);
2748 condop->op_private = 1 | (flags >> 8);
2750 left->op_sibling = right;
2752 condop->op_next = (OP*)condop;
2753 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2754 flop = newUNOP(OP_FLOP, 0, flip);
2755 o = newUNOP(OP_NULL, 0, flop);
2758 left->op_next = flip;
2759 right->op_next = flop;
2761 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2762 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2763 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2764 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2766 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2767 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2770 if (!flip->op_private || !flop->op_private)
2771 linklist(o); /* blow off optimizer unless constant */
2777 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2782 int once = block && block->op_flags & OPf_SPECIAL &&
2783 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2786 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2787 return block; /* do {} while 0 does once */
2788 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2789 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2790 expr = newUNOP(OP_DEFINED, 0,
2791 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2795 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2796 o = newLOGOP(OP_AND, 0, expr, listop);
2798 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2800 if (once && o != listop)
2801 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2804 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2806 o->op_flags |= flags;
2808 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2813 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2822 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2823 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2824 expr = newUNOP(OP_DEFINED, 0,
2825 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2829 block = newOP(OP_NULL, 0);
2832 next = LINKLIST(cont);
2834 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2835 if ((line_t)whileline != NOLINE) {
2836 copline = whileline;
2837 cont = append_elem(OP_LINESEQ, cont,
2838 newSTATEOP(0, Nullch, Nullop));
2842 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2843 redo = LINKLIST(listop);
2846 o = newLOGOP(OP_AND, 0, expr, scalar(listop));
2847 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2848 op_free(expr); /* oops, it's a while (0) */
2850 return Nullop; /* (listop already freed by newLOGOP) */
2852 ((LISTOP*)listop)->op_last->op_next = condop =
2853 (o == listop ? redo : LINKLIST(o));
2861 Newz(1101,loop,1,LOOP);
2862 loop->op_type = OP_ENTERLOOP;
2863 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2864 loop->op_private = 0;
2865 loop->op_next = (OP*)loop;
2868 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2870 loop->op_redoop = redo;
2871 loop->op_lastop = o;
2874 loop->op_nextop = next;
2876 loop->op_nextop = o;
2878 o->op_flags |= flags;
2879 o->op_private |= (flags >> 8);
2884 #ifndef CAN_PROTOTYPE
2885 newFOROP(flags,label,forline,sv,expr,block,cont)
2894 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2895 #endif /* CAN_PROTOTYPE */
2903 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2904 sv->op_type = OP_RV2GV;
2905 sv->op_ppaddr = ppaddr[OP_RV2GV];
2907 else if (sv->op_type == OP_PADSV) { /* private variable */
2908 padoff = sv->op_targ;
2913 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2916 sv = newGVOP(OP_GV, 0, defgv);
2918 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2919 expr = scalar(ref(expr, OP_ITER));
2920 iterflags |= OPf_STACKED;
2922 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2923 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2925 assert(!loop->op_next);
2926 Renew(loop, 1, LOOP);
2927 loop->op_targ = padoff;
2928 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
2930 return newSTATEOP(0, label, wop);
2934 newLOOPEX(I32 type, OP *label)
2938 if (type != OP_GOTO || label->op_type == OP_CONST) {
2939 o = newPVOP(type, 0, savepv(
2940 label->op_type == OP_CONST
2941 ? SvPVx(((SVOP*)label)->op_sv, na)
2946 if (label->op_type == OP_ENTERSUB)
2947 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2948 o = newUNOP(type, OPf_STACKED, label);
2950 hints |= HINT_BLOCK_SCOPE;
2960 MUTEX_DESTROY(CvMUTEXP(cv));
2961 Safefree(CvMUTEXP(cv));
2964 #endif /* USE_THREADS */
2966 if (!CvXSUB(cv) && CvROOT(cv)) {
2968 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
2969 croak("Can't undef active subroutine");
2972 croak("Can't undef active subroutine");
2973 #endif /* USE_THREADS */
2980 op_free(CvROOT(cv));
2981 CvROOT(cv) = Nullop;
2984 SvPOK_off((SV*)cv); /* forget prototype */
2986 SvREFCNT_dec(CvGV(cv));
2988 SvREFCNT_dec(CvOUTSIDE(cv));
2989 CvOUTSIDE(cv) = Nullcv;
2990 if (CvPADLIST(cv)) {
2991 /* may be during global destruction */
2992 if (SvREFCNT(CvPADLIST(cv))) {
2993 I32 i = AvFILL(CvPADLIST(cv));
2995 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
2996 SV* sv = svp ? *svp : Nullsv;
2999 if (sv == (SV*)comppad_name)
3000 comppad_name = Nullav;
3001 else if (sv == (SV*)comppad) {
3003 curpad = Null(SV**);
3007 SvREFCNT_dec((SV*)CvPADLIST(cv));
3009 CvPADLIST(cv) = Nullav;
3013 #ifdef DEBUG_CLOSURES
3018 CV *outside = CvOUTSIDE(cv);
3019 AV* padlist = CvPADLIST(cv);
3026 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3028 (CvANON(cv) ? "ANON"
3029 : (cv == main_cv) ? "MAIN"
3030 : CvUNIQUE(outside) ? "UNIQUE"
3031 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3034 : CvANON(outside) ? "ANON"
3035 : (outside == main_cv) ? "MAIN"
3036 : CvUNIQUE(outside) ? "UNIQUE"
3037 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3042 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3043 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3044 pname = AvARRAY(pad_name);
3045 ppad = AvARRAY(pad);
3047 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
3048 if (SvPOK(pname[ix]))
3049 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3051 SvFAKE(pname[ix]) ? "FAKE " : "",
3053 (long)I_32(SvNVX(pname[ix])),
3054 (long)SvIVX(pname[ix]));
3057 #endif /* DEBUG_CLOSURES */
3060 cv_clone2(CV *proto, CV *outside)
3065 AV* protopadlist = CvPADLIST(proto);
3066 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3067 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3068 SV** pname = AvARRAY(protopad_name);
3069 SV** ppad = AvARRAY(protopad);
3070 I32 fname = AvFILL(protopad_name);
3071 I32 fpad = AvFILL(protopad);
3075 assert(!CvUNIQUE(proto));
3080 SAVESPTR(comppad_name);
3083 cv = compcv = (CV*)NEWSV(1104,0);
3084 sv_upgrade((SV *)cv, SvTYPE(proto));
3090 New(666, CvMUTEXP(cv), 1, perl_mutex);
3091 MUTEX_INIT(CvMUTEXP(cv));
3093 #endif /* USE_THREADS */
3094 CvFILEGV(cv) = CvFILEGV(proto);
3095 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3096 CvSTASH(cv) = CvSTASH(proto);
3097 CvROOT(cv) = CvROOT(proto);
3098 CvSTART(cv) = CvSTART(proto);
3100 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3103 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3105 comppad_name = newAV();
3106 for (ix = fname; ix >= 0; ix--)
3107 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3111 comppadlist = newAV();
3112 AvREAL_off(comppadlist);
3113 av_store(comppadlist, 0, (SV*)comppad_name);
3114 av_store(comppadlist, 1, (SV*)comppad);
3115 CvPADLIST(cv) = comppadlist;
3116 av_fill(comppad, AvFILL(protopad));
3117 curpad = AvARRAY(comppad);
3119 av = newAV(); /* will be @_ */
3121 av_store(comppad, 0, (SV*)av);
3122 AvFLAGS(av) = AVf_REIFY;
3124 for (ix = fpad; ix > 0; ix--) {
3125 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3126 if (namesv && namesv != &sv_undef) {
3127 char *name = SvPVX(namesv); /* XXX */
3128 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3129 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3130 CvOUTSIDE(cv), cxstack_ix);
3132 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3134 croak("panic: cv_clone: %s", name);
3136 else { /* our own lexical */
3139 /* anon code -- we'll come back for it */
3140 sv = SvREFCNT_inc(ppad[ix]);
3142 else if (*name == '@')
3144 else if (*name == '%')
3154 SV* sv = NEWSV(0,0);
3160 /* Now that vars are all in place, clone nested closures. */
3162 for (ix = fpad; ix > 0; ix--) {
3163 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3165 && namesv != &sv_undef
3166 && !(SvFLAGS(namesv) & SVf_FAKE)
3167 && *SvPVX(namesv) == '&'
3168 && CvCLONE(ppad[ix]))
3170 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3171 SvREFCNT_dec(ppad[ix]);
3174 curpad[ix] = (SV*)kid;
3178 #ifdef DEBUG_CLOSURES
3179 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3181 PerlIO_printf(Perl_debug_log, " from:\n");
3183 PerlIO_printf(Perl_debug_log, " to:\n");
3194 return cv_clone2(proto, CvOUTSIDE(proto));
3198 cv_ckproto(CV *cv, GV *gv, char *p)
3200 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3201 SV* msg = sv_newmortal();
3205 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3206 sv_setpv(msg, "Prototype mismatch:");
3208 sv_catpvf(msg, " sub %_", name);
3210 sv_catpvf(msg, " (%s)", SvPVX(cv));
3211 sv_catpv(msg, " vs ");
3213 sv_catpvf(msg, "(%s)", p);
3215 sv_catpv(msg, "none");
3226 if (!cv || !SvPOK(cv) || SvCUR(cv))
3230 for (o = CvSTART(cv); o; o = o->op_next) {
3231 OPCODE type = o->op_type;
3233 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3235 if (type == OP_LEAVESUB || type == OP_RETURN)
3239 if (type == OP_CONST)
3241 else if (type == OP_PADSV) {
3242 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3243 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3244 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3256 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3259 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3260 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3261 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3270 if (!name || GvCVGEN(gv))
3272 else if (cv = GvCV(gv)) {
3273 cv_ckproto(cv, gv, ps);
3274 /* already defined (or promised)? */
3275 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3278 /* just a "sub foo;" when &foo is already defined */
3282 /* ahem, death to those who redefine active sort subs */
3283 if (curstack == sortstack && sortcop == CvSTART(cv))
3284 croak("Can't redefine active sort subroutine %s", name);
3285 const_sv = cv_const_sv(cv);
3286 if (const_sv || dowarn) {
3287 line_t oldline = curcop->cop_line;
3288 curcop->cop_line = copline;
3289 warn(const_sv ? "Constant subroutine %s redefined"
3290 : "Subroutine %s redefined", name);
3291 curcop->cop_line = oldline;
3297 if (cv) { /* must reuse cv if autoloaded */
3299 CvFLAGS(cv) = CvFLAGS(compcv);
3300 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3301 CvOUTSIDE(compcv) = 0;
3302 CvPADLIST(cv) = CvPADLIST(compcv);
3303 CvPADLIST(compcv) = 0;
3304 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3305 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3306 SvREFCNT_dec(compcv);
3316 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3317 CvFILEGV(cv) = curcop->cop_filegv;
3318 CvSTASH(cv) = curstash;
3321 New(666, CvMUTEXP(cv), 1, perl_mutex);
3322 MUTEX_INIT(CvMUTEXP(cv));
3323 #endif /* USE_THREADS */
3326 sv_setpv((SV*)cv, ps);
3332 char *s = strrchr(name, ':');
3334 if (strEQ(s, "BEGIN")) {
3336 "BEGIN not safe after errors--compilation aborted";
3340 /* force display of errors found but not reported */
3341 sv_catpv(errsv, not_safe);
3342 croak("%s", SvPV(errsv, na));
3353 if (AvFILL(comppad_name) < AvFILL(comppad))
3354 av_store(comppad_name, AvFILL(comppad), Nullsv);
3357 SV **namep = AvARRAY(comppad_name);
3358 for (ix = AvFILL(comppad); ix > 0; ix--) {
3361 if (SvIMMORTAL(curpad[ix]))
3364 * The only things that a clonable function needs in its
3365 * pad are references to outer lexicals and anonymous subs.
3366 * The rest are created anew during cloning.
3368 if (!((namesv = namep[ix]) != Nullsv &&
3369 namesv != &sv_undef &&
3371 *SvPVX(namesv) == '&')))
3373 SvREFCNT_dec(curpad[ix]);
3374 curpad[ix] = Nullsv;
3379 AV *av = newAV(); /* Will be @_ */
3381 av_store(comppad, 0, (SV*)av);
3382 AvFLAGS(av) = AVf_REIFY;
3384 for (ix = AvFILL(comppad); ix > 0; ix--) {
3385 if (SvIMMORTAL(curpad[ix]))
3387 if (!SvPADMY(curpad[ix]))
3388 SvPADTMP_on(curpad[ix]);
3392 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3393 CvSTART(cv) = LINKLIST(CvROOT(cv));
3394 CvROOT(cv)->op_next = 0;
3400 if (PERLDB_SUBLINE && curstash != debstash) {
3401 SV *sv = NEWSV(0,0);
3402 SV *tmpstr = sv_newmortal();
3403 static GV *db_postponed;
3407 sv_setpvf(sv, "%_:%ld-%ld",
3408 GvSV(curcop->cop_filegv),
3409 (long)subline, (long)curcop->cop_line);
3410 gv_efullname3(tmpstr, gv, Nullch);
3411 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3412 if (!db_postponed) {
3413 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3415 hv = GvHVn(db_postponed);
3416 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3417 && (cv = GvCV(db_postponed))) {
3422 perl_call_sv((SV*)cv, G_DISCARD);
3426 if ((s = strrchr(name,':')))
3430 if (strEQ(s, "BEGIN")) {
3431 I32 oldscope = scopestack_ix;
3433 SAVESPTR(compiling.cop_filegv);
3434 SAVEI16(compiling.cop_line);
3441 DEBUG_x( dump_sub(gv) );
3442 av_push(beginav, (SV *)cv);
3444 call_list(oldscope, beginav);
3446 curcop = &compiling;
3449 else if (strEQ(s, "END") && !error_count) {
3452 av_unshift(endav, 1);
3453 av_store(endav, 0, (SV *)cv);
3456 else if (strEQ(s, "INIT") && !error_count) {
3459 av_push(initav, SvREFCNT_inc(cv));
3471 newXS(char *name, void (*subaddr) (CV *), char *filename)
3474 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3477 if (cv = (name ? GvCV(gv) : Nullcv)) {
3479 /* just a cached method */
3483 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3484 /* already defined (or promised) */
3486 line_t oldline = curcop->cop_line;
3487 curcop->cop_line = copline;
3488 warn("Subroutine %s redefined",name);
3489 curcop->cop_line = oldline;
3496 if (cv) /* must reuse cv if autoloaded */
3499 cv = (CV*)NEWSV(1105,0);
3500 sv_upgrade((SV *)cv, SVt_PVCV);
3507 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3509 New(666, CvMUTEXP(cv), 1, perl_mutex);
3510 MUTEX_INIT(CvMUTEXP(cv));
3512 #endif /* USE_THREADS */
3513 CvFILEGV(cv) = gv_fetchfile(filename);
3514 CvXSUB(cv) = subaddr;
3517 char *s = strrchr(name,':');
3522 if (strEQ(s, "BEGIN")) {
3525 av_push(beginav, (SV *)cv);
3528 else if (strEQ(s, "END")) {
3531 av_unshift(endav, 1);
3532 av_store(endav, 0, (SV *)cv);
3535 else if (strEQ(s, "INIT")) {
3538 av_push(initav, (SV *)cv);
3548 newFORM(I32 floor, OP *o, OP *block)
3557 name = SvPVx(cSVOPo->op_sv, na);
3560 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3562 if (cv = GvFORM(gv)) {
3564 line_t oldline = curcop->cop_line;
3566 curcop->cop_line = copline;
3567 warn("Format %s redefined",name);
3568 curcop->cop_line = oldline;
3574 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3575 CvFILEGV(cv) = curcop->cop_filegv;
3577 for (ix = AvFILL(comppad); ix > 0; ix--) {
3578 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3579 SvPADTMP_on(curpad[ix]);
3582 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3583 CvSTART(cv) = LINKLIST(CvROOT(cv));
3584 CvROOT(cv)->op_next = 0;
3594 return newUNOP(OP_REFGEN, 0,
3595 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3601 return newUNOP(OP_REFGEN, 0,
3602 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3606 newANONSUB(I32 floor, OP *proto, OP *block)
3608 return newUNOP(OP_REFGEN, 0,
3609 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3615 switch (o->op_type) {
3617 o->op_type = OP_PADAV;
3618 o->op_ppaddr = ppaddr[OP_PADAV];
3619 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3622 o->op_type = OP_RV2AV;
3623 o->op_ppaddr = ppaddr[OP_RV2AV];
3628 warn("oops: oopsAV");
3637 switch (o->op_type) {
3640 o->op_type = OP_PADHV;
3641 o->op_ppaddr = ppaddr[OP_PADHV];
3642 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3646 o->op_type = OP_RV2HV;
3647 o->op_ppaddr = ppaddr[OP_RV2HV];
3652 warn("oops: oopsHV");
3661 if (o->op_type == OP_PADANY) {
3662 o->op_type = OP_PADAV;
3663 o->op_ppaddr = ppaddr[OP_PADAV];
3666 return newUNOP(OP_RV2AV, 0, scalar(o));
3670 newGVREF(I32 type, OP *o)
3672 if (type == OP_MAPSTART)
3673 return newUNOP(OP_NULL, 0, o);
3674 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3680 if (o->op_type == OP_PADANY) {
3681 o->op_type = OP_PADHV;
3682 o->op_ppaddr = ppaddr[OP_PADHV];
3685 return newUNOP(OP_RV2HV, 0, scalar(o));
3691 croak("NOT IMPL LINE %d",__LINE__);
3697 newCVREF(I32 flags, OP *o)
3699 return newUNOP(OP_RV2CV, flags, scalar(o));
3705 if (o->op_type == OP_PADANY) {
3706 o->op_type = OP_PADSV;
3707 o->op_ppaddr = ppaddr[OP_PADSV];
3710 else if (o->op_type == OP_SPECIFIC)
3712 return newUNOP(OP_RV2SV, 0, scalar(o));
3715 /* Check routines. */
3723 name = NEWSV(1106,0);
3724 sv_upgrade(name, SVt_PVNV);
3725 sv_setpvn(name, "&", 1);
3728 ix = pad_alloc(o->op_type, SVs_PADMY);
3729 av_store(comppad_name, ix, name);
3730 av_store(comppad, ix, cSVOPo->op_sv);
3731 SvPADMY_on(cSVOPo->op_sv);
3732 cSVOPo->op_sv = Nullsv;
3733 cSVOPo->op_targ = ix;
3740 o->op_private = hints;
3747 if (cUNOPo->op_first->op_type == OP_CONCAT)
3748 o->op_flags |= OPf_STACKED;
3755 if (o->op_flags & OPf_KIDS) {
3758 OPCODE type = o->op_type;
3759 o = modkids(ck_fun(o), type);
3760 kid = cUNOPo->op_first;
3761 newop = kUNOP->op_first->op_sibling;
3763 (newop->op_sibling ||
3764 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3765 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3766 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3770 op_free(kUNOP->op_first);
3771 kUNOP->op_first = newop;
3773 o->op_ppaddr = ppaddr[++o->op_type];
3782 if (o->op_flags & OPf_KIDS) {
3783 OP *kid = cUNOPo->op_first;
3784 if (kid->op_type == OP_HSLICE)
3785 o->op_private |= OPpSLICE;
3786 else if (kid->op_type != OP_HELEM)
3787 croak("%s argument is not a HASH element or slice",
3788 op_desc[o->op_type]);
3797 I32 type = o->op_type;
3799 if (o->op_flags & OPf_KIDS) {
3800 if (cLISTOPo->op_first->op_type == OP_STUB) {
3802 o = newUNOP(type, OPf_SPECIAL,
3803 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3813 hints |= HINT_BLOCK_SCOPE;
3814 if (o->op_flags & OPf_KIDS) {
3815 SVOP *kid = (SVOP*)cUNOPo->op_first;
3818 o->op_flags &= ~OPf_KIDS;
3821 else if (kid->op_type == OP_LINESEQ) {
3824 kid->op_next = o->op_next;
3825 cUNOPo->op_first = 0;
3828 Newz(1101, enter, 1, LOGOP);
3829 enter->op_type = OP_ENTERTRY;
3830 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3831 enter->op_private = 0;
3833 /* establish postfix order */
3834 enter->op_next = (OP*)enter;
3836 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3837 o->op_type = OP_LEAVETRY;
3838 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3839 enter->op_other = o;
3845 o = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3847 o->op_targ = (PADOFFSET)hints;
3855 if (o->op_flags & OPf_STACKED) {
3857 kid = cUNOPo->op_first->op_sibling;
3858 if (kid->op_type == OP_RV2GV)
3870 if (o->op_flags & OPf_KIDS) {
3871 OP *kid = cUNOPo->op_first;
3872 if (kid->op_type != OP_HELEM)
3873 croak("%s argument is not a HASH element", op_desc[o->op_type]);
3880 ck_gvconst(register OP *o)
3882 o = fold_constants(o);
3883 if (o->op_type == OP_CONST)
3889 ck_rvconst(register OP *o)
3892 SVOP *kid = (SVOP*)cUNOPo->op_first;
3894 o->op_private |= (hints & HINT_STRICT_REFS);
3895 if (kid->op_type == OP_CONST) {
3900 name = SvPV(kid->op_sv, na);
3901 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3902 char *badthing = Nullch;
3903 switch (o->op_type) {
3905 badthing = "a SCALAR";
3908 badthing = "an ARRAY";
3911 badthing = "a HASH";
3916 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3919 kid->op_type = OP_GV;
3920 iscv = (o->op_type == OP_RV2CV) * 2;
3921 for (gv = 0; !gv; iscv++) {
3923 * This is a little tricky. We only want to add the symbol if we
3924 * didn't add it in the lexer. Otherwise we get duplicate strict
3925 * warnings. But if we didn't add it in the lexer, we must at
3926 * least pretend like we wanted to add it even if it existed before,
3927 * or we get possible typo warnings. OPpCONST_ENTERED says
3928 * whether the lexer already added THIS instance of this symbol.
3930 gv = gv_fetchpv(name,
3931 iscv | !(kid->op_private & OPpCONST_ENTERED),
3934 : o->op_type == OP_RV2SV
3936 : o->op_type == OP_RV2AV
3938 : o->op_type == OP_RV2HV
3942 SvREFCNT_dec(kid->op_sv);
3943 kid->op_sv = SvREFCNT_inc(gv);
3952 I32 type = o->op_type;
3954 if (o->op_flags & OPf_REF)
3957 if (o->op_flags & OPf_KIDS) {
3958 SVOP *kid = (SVOP*)cUNOPo->op_first;
3960 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3961 OP *newop = newGVOP(type, OPf_REF,
3962 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
3969 if (type == OP_FTTTY)
3970 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
3973 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3986 int type = o->op_type;
3987 register I32 oa = opargs[type] >> OASHIFT;
3989 if (o->op_flags & OPf_STACKED) {
3990 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
3993 return no_fh_allowed(o);
3996 if (o->op_flags & OPf_KIDS) {
3997 tokid = &cLISTOPo->op_first;
3998 kid = cLISTOPo->op_first;
3999 if (kid->op_type == OP_PUSHMARK ||
4000 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4002 tokid = &kid->op_sibling;
4003 kid = kid->op_sibling;
4005 if (!kid && opargs[type] & OA_DEFGV)
4006 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
4010 sibl = kid->op_sibling;
4024 if (kid->op_type == OP_CONST &&
4025 (kid->op_private & OPpCONST_BARE)) {
4026 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4027 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4028 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4030 warn("Array @%s missing the @ in argument %ld of %s()",
4031 name, (long)numargs, op_desc[type]);
4034 kid->op_sibling = sibl;
4037 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4038 bad_type(numargs, "array", op_desc[o->op_type], kid);
4042 if (kid->op_type == OP_CONST &&
4043 (kid->op_private & OPpCONST_BARE)) {
4044 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4045 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4046 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4048 warn("Hash %%%s missing the %% in argument %ld of %s()",
4049 name, (long)numargs, op_desc[type]);
4052 kid->op_sibling = sibl;
4055 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4056 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4061 OP *newop = newUNOP(OP_NULL, 0, kid);
4062 kid->op_sibling = 0;
4064 newop->op_next = newop;
4066 kid->op_sibling = sibl;
4071 if (kid->op_type != OP_GV) {
4072 if (kid->op_type == OP_CONST &&
4073 (kid->op_private & OPpCONST_BARE)) {
4074 OP *newop = newGVOP(OP_GV, 0,
4075 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4081 kid->op_sibling = 0;
4082 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4084 kid->op_sibling = sibl;
4090 mod(scalar(kid), type);
4094 tokid = &kid->op_sibling;
4095 kid = kid->op_sibling;
4097 o->op_private |= numargs;
4099 return too_many_arguments(o,op_desc[o->op_type]);
4102 else if (opargs[type] & OA_DEFGV) {
4104 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4108 while (oa & OA_OPTIONAL)
4110 if (oa && oa != OA_LIST)
4111 return too_few_arguments(o,op_desc[o->op_type]);
4121 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4122 append_elem(OP_GLOB, o, newSVREF(newGVOP(OP_GV, 0, defgv)));
4124 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4125 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4127 if (gv && GvIMPORTED_CV(gv)) {
4128 static int glob_index;
4130 append_elem(OP_GLOB, o,
4131 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4132 o->op_type = OP_LIST;
4133 o->op_ppaddr = ppaddr[OP_LIST];
4134 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4135 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4136 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4137 append_elem(OP_LIST, o,
4138 scalar(newUNOP(OP_RV2CV, 0,
4139 newGVOP(OP_GV, 0, gv)))));
4140 o = newUNOP(OP_NULL, 0, ck_subr(o));
4141 o->op_targ = OP_GLOB; /* hint at what it used to be */
4144 gv = newGVgen("main");
4146 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4156 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4158 o->op_ppaddr = ppaddr[OP_GREPSTART];
4159 Newz(1101, gwop, 1, LOGOP);
4161 if (o->op_flags & OPf_STACKED) {
4164 kid = cLISTOPo->op_first->op_sibling;
4165 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4168 kid->op_next = (OP*)gwop;
4169 o->op_flags &= ~OPf_STACKED;
4171 kid = cLISTOPo->op_first->op_sibling;
4172 if (type == OP_MAPWHILE)
4179 kid = cLISTOPo->op_first->op_sibling;
4180 if (kid->op_type != OP_NULL)
4181 croak("panic: ck_grep");
4182 kid = kUNOP->op_first;
4184 gwop->op_type = type;
4185 gwop->op_ppaddr = ppaddr[type];
4186 gwop->op_first = listkids(o);
4187 gwop->op_flags |= OPf_KIDS;
4188 gwop->op_private = 1;
4189 gwop->op_other = LINKLIST(kid);
4190 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4191 kid->op_next = (OP*)gwop;
4193 kid = cLISTOPo->op_first->op_sibling;
4194 if (!kid || !kid->op_sibling)
4195 return too_few_arguments(o,op_desc[o->op_type]);
4196 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4197 mod(kid, OP_GREPSTART);
4205 if (o->op_flags & OPf_KIDS) {
4206 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4207 if (kid && kid->op_type == OP_CONST)
4208 fbm_compile(((SVOP*)kid)->op_sv);
4214 ck_lengthconst(OP *o)
4216 /* XXX length optimization goes here */
4223 OPCODE type = o->op_type;
4224 return modkids(ck_fun(o), type);
4230 OPCODE type = o->op_type;
4231 return refkids(ck_fun(o), type);
4239 kid = cLISTOPo->op_first;
4242 kid = cLISTOPo->op_first;
4244 if (kid->op_type == OP_PUSHMARK)
4245 kid = kid->op_sibling;
4246 if (kid && o->op_flags & OPf_STACKED)
4247 kid = kid->op_sibling;
4248 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4249 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4250 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4251 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4252 cLISTOPo->op_first->op_sibling = kid;
4253 cLISTOPo->op_last = kid;
4254 kid = kid->op_sibling;
4259 append_elem(o->op_type, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4265 if (hints & HINT_LOCALE)
4266 o->op_private |= OPpLOCALE;
4273 ck_fun_locale(OP *o)
4279 if (hints & HINT_LOCALE)
4280 o->op_private |= OPpLOCALE;
4291 if (hints & HINT_LOCALE)
4292 o->op_private |= OPpLOCALE;
4301 o->op_private |= OPpRUNTIME;
4314 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4315 o->op_private |= OPpREPEAT_DOLIST;
4316 cBINOPo->op_first = force_list(cBINOPo->op_first);
4326 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4327 SVOP *kid = (SVOP*)cUNOPo->op_first;
4329 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4331 for (s = SvPVX(kid->op_sv); *s; s++) {
4332 if (*s == ':' && s[1] == ':') {
4334 Move(s+2, s+1, strlen(s+2)+1, char);
4335 --SvCUR(kid->op_sv);
4338 sv_catpvn(kid->op_sv, ".pm", 3);
4347 croak("NOT IMPL LINE %d",__LINE__);
4356 if (o->op_flags & OPf_KIDS) {
4357 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4358 if (kid && kid->op_sibling) {
4359 o->op_type = OP_SSELECT;
4360 o->op_ppaddr = ppaddr[OP_SSELECT];
4362 return fold_constants(o);
4366 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4367 if (kid && kid->op_type == OP_RV2GV)
4368 kid->op_private &= ~HINT_STRICT_REFS;
4375 I32 type = o->op_type;
4377 if (!(o->op_flags & OPf_KIDS)) {
4383 argop = newOP(OP_PADAV, OPf_REF);
4384 argop->op_targ = 0; /* curpad[0] is @_ */
4387 argop = newUNOP(OP_RV2AV, 0,
4388 scalar(newGVOP(OP_GV, 0,
4389 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4392 argop = newUNOP(OP_RV2AV, 0,
4393 scalar(newGVOP(OP_GV, 0, subline ?
4394 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4395 #endif /* USE_THREADS */
4396 return newUNOP(type, 0, scalar(argop));
4398 return scalar(modkids(ck_fun(o), type));
4406 if (hints & HINT_LOCALE)
4407 o->op_private |= OPpLOCALE;
4410 if (o->op_flags & OPf_STACKED) {
4411 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4413 kid = kUNOP->op_first; /* get past rv2gv */
4415 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4417 if (kid->op_type == OP_SCOPE) {
4421 else if (kid->op_type == OP_LEAVE) {
4422 if (o->op_type == OP_SORT) {
4423 null(kid); /* wipe out leave */
4426 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4427 if (k->op_next == kid)
4432 kid->op_next = 0; /* just disconnect the leave */
4433 k = kLISTOP->op_first;
4437 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4438 null(kid); /* wipe out rv2gv */
4439 if (o->op_type == OP_SORT)
4443 o->op_flags |= OPf_SPECIAL;
4456 if (o->op_flags & OPf_STACKED)
4457 return no_fh_allowed(o);
4459 kid = cLISTOPo->op_first;
4460 if (kid->op_type != OP_NULL)
4461 croak("panic: ck_split");
4462 kid = kid->op_sibling;
4463 op_free(cLISTOPo->op_first);
4464 cLISTOPo->op_first = kid;
4466 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4467 cLISTOPo->op_last = kid; /* There was only one element previously */
4470 if (kid->op_type != OP_MATCH) {
4471 OP *sibl = kid->op_sibling;
4472 kid->op_sibling = 0;
4473 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4474 if (cLISTOPo->op_first == cLISTOPo->op_last)
4475 cLISTOPo->op_last = kid;
4476 cLISTOPo->op_first = kid;
4477 kid->op_sibling = sibl;
4480 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4481 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4485 kid->op_type = OP_PUSHRE;
4486 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4489 if (!kid->op_sibling)
4490 append_elem(OP_SPLIT, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4492 kid = kid->op_sibling;
4495 if (!kid->op_sibling)
4496 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4498 kid = kid->op_sibling;
4501 if (kid->op_sibling)
4502 return too_many_arguments(o,op_desc[o->op_type]);
4511 OP *prev = ((cUNOPo->op_first->op_sibling)
4512 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4513 OP *o2 = prev->op_sibling;
4521 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4522 if (cvop->op_type == OP_RV2CV) {
4524 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4525 null(cvop); /* disable rv2cv */
4526 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4527 if (tmpop->op_type == OP_GV) {
4528 cv = GvCVu(tmpop->op_sv);
4529 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4530 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4531 proto = SvPV((SV*)cv, na);
4535 o->op_private |= (hints & HINT_STRICT_REFS);
4536 if (PERLDB_SUB && curstash != debstash)
4537 o->op_private |= OPpENTERSUB_DB;
4538 while (o2 != cvop) {
4542 return too_many_arguments(o, gv_ename(namegv));
4560 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4561 bad_type(arg, "block", gv_ename(namegv), o2);
4566 if (o2->op_type == OP_RV2GV)
4570 o2 = newUNOP(OP_RV2GV, 0, kid);
4571 o2->op_sibling = kid->op_sibling;
4572 kid->op_sibling = 0;
4573 prev->op_sibling = o;
4581 if (o2->op_type != OP_RV2GV)
4582 bad_type(arg, "symbol", gv_ename(namegv), o2);
4585 if (o2->op_type != OP_RV2CV)
4586 bad_type(arg, "sub", gv_ename(namegv), o2);
4589 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4590 bad_type(arg, "scalar", gv_ename(namegv), o2);
4593 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4594 bad_type(arg, "array", gv_ename(namegv), o2);
4597 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4598 bad_type(arg, "hash", gv_ename(namegv), o2);
4602 o2 = newUNOP(OP_REFGEN, 0, kid);
4603 o2->op_sibling = kid->op_sibling;
4604 kid->op_sibling = 0;
4605 prev->op_sibling = o2;
4616 croak("Malformed prototype for %s: %s",
4617 gv_ename(namegv), SvPV((SV*)cv, na));
4622 mod(o2, OP_ENTERSUB);
4624 o2 = o2->op_sibling;
4626 if (proto && !optional &&
4627 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4628 return too_few_arguments(o, gv_ename(namegv));
4635 SvREADONLY_on(cSVOPo->op_sv);
4642 if (o->op_flags & OPf_KIDS) {
4643 SVOP *kid = (SVOP*)cUNOPo->op_first;
4645 if (kid->op_type == OP_NULL)
4646 kid = (SVOP*)kid->op_sibling;
4648 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4649 o->op_flags |= OPf_SPECIAL;
4654 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4657 peep(register OP *o)
4660 register OP* oldop = 0;
4661 if (!o || o->op_seq)
4666 for (; o; o = o->op_next) {
4672 switch (o->op_type) {
4675 curcop = ((COP*)o); /* for warnings */
4676 o->op_seq = op_seqmax++;
4687 if (o->op_next->op_type == OP_STRINGIFY)
4689 o->op_seq = op_seqmax++;
4692 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4693 o->op_seq = op_seqmax++;
4694 break; /* Scalar stub must produce undef. List stub is noop */
4698 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4699 curcop = ((COP*)op);
4705 if (oldop && o->op_next) {
4706 oldop->op_next = o->op_next;
4709 o->op_seq = op_seqmax++;
4713 if (o->op_next->op_type == OP_RV2SV) {
4714 if (!(o->op_next->op_private & OPpDEREF)) {
4716 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4717 o->op_next = o->op_next->op_next;
4718 o->op_type = OP_GVSV;
4719 o->op_ppaddr = ppaddr[OP_GVSV];
4722 else if (o->op_next->op_type == OP_RV2AV) {
4723 OP* pop = o->op_next->op_next;
4725 if (pop->op_type == OP_CONST &&
4726 (op = pop->op_next) &&
4727 pop->op_next->op_type == OP_AELEM &&
4728 !(pop->op_next->op_private &
4729 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4730 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4734 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4738 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4739 o->op_next = pop->op_next->op_next;
4740 o->op_type = OP_AELEMFAST;
4741 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4742 o->op_private = (U8)i;
4743 GvAVn(((GVOP*)o)->op_gv);
4746 o->op_seq = op_seqmax++;
4750 if (o->op_next->op_type == OP_RV2AV
4751 && (o->op_next->op_flags && OPf_REF))
4754 o->op_next = o->op_next->op_next;
4759 if (o->op_next->op_type == OP_RV2HV
4760 && (o->op_next->op_flags && OPf_REF))
4763 o->op_next = o->op_next->op_next;
4771 o->op_seq = op_seqmax++;
4772 peep(cLOGOP->op_other);
4776 o->op_seq = op_seqmax++;
4777 peep(cCONDOP->op_true);
4778 peep(cCONDOP->op_false);
4782 o->op_seq = op_seqmax++;
4783 peep(cLOOP->op_redoop);
4784 peep(cLOOP->op_nextop);
4785 peep(cLOOP->op_lastop);
4790 o->op_seq = op_seqmax++;
4791 peep(cPMOP->op_pmreplstart);
4795 o->op_seq = op_seqmax++;
4796 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4797 if (o->op_next->op_sibling &&
4798 o->op_next->op_sibling->op_type != OP_DIE) {
4799 line_t oldline = curcop->cop_line;
4801 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4802 warn("Statement unlikely to be reached");
4803 warn("(Maybe you meant system() when you said exec()?)\n");
4804 curcop->cop_line = oldline;
4818 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4819 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4821 rop = (UNOP*)((BINOP*)o)->op_first;
4822 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4824 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4825 if (!SvOBJECT(lexname))
4827 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4828 if (!fields || !GvHV(*fields))
4830 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4831 key = SvPV(*svp, keylen);
4832 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4834 croak("No such field \"%s\" in variable %s of type %s",
4835 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4837 ind = SvIV(*indsvp);
4839 croak("Bad index while coercing array into hash");
4840 rop->op_type = OP_RV2AV;
4841 rop->op_ppaddr = ppaddr[OP_RV2AV];
4842 o->op_type = OP_AELEM;
4843 o->op_ppaddr = ppaddr[OP_AELEM];
4845 *svp = newSViv(ind);
4850 o->op_seq = op_seqmax++;