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, oldsv ? SvREFCNT_inc(oldsv) : 0);
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;
500 find_thread_magical(name)
506 /* We currently only handle single character magicals */
507 p = strchr(per_thread_magicals, *name);
510 key = magical_keys[p - per_thread_magicals];
511 if (key == NOT_IN_PAD) {
513 key = magical_keys[p - per_thread_magicals] = key_create();
515 av_store(thr->specific, key, sv);
516 sv_magic(sv, 0, 0, name, 1);
517 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
518 "find_thread_magical: key %d new SV %p for %d\n",
519 (int)key, sv, (int)*name));
523 #endif /* USE_THREADS */
530 register OP *kid, *nextkid;
532 if (!o || o->op_seq == (U16)-1)
535 if (o->op_flags & OPf_KIDS) {
536 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
537 nextkid = kid->op_sibling; /* Get before next freeing kid */
542 switch (o->op_type) {
544 o->op_targ = 0; /* Was holding old type, if any. */
547 o->op_targ = 0; /* Was holding hints. */
550 if (!(o->op_flags & OPf_REF) || (check[o->op_type] != ck_ftst))
556 SvREFCNT_dec(cGVOPo->op_gv);
560 Safefree(cCOPo->cop_label);
561 SvREFCNT_dec(cCOPo->cop_filegv);
564 SvREFCNT_dec(cSVOPo->op_sv);
570 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
574 Safefree(cPVOPo->op_pv);
577 op_free(cPMOPo->op_pmreplroot);
581 pregfree(cPMOPo->op_pmregexp);
582 SvREFCNT_dec(cPMOPo->op_pmshort);
587 pad_free(o->op_targ);
595 if (o->op_type != OP_NULL && o->op_targ > 0)
596 pad_free(o->op_targ);
597 o->op_targ = o->op_type;
598 o->op_type = OP_NULL;
599 o->op_ppaddr = ppaddr[OP_NULL];
602 /* Contextualizers */
604 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
614 /* establish postfix order */
615 if (cUNOPo->op_first) {
616 o->op_next = LINKLIST(cUNOPo->op_first);
617 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
619 kid->op_next = LINKLIST(kid->op_sibling);
634 if (o && o->op_flags & OPf_KIDS) {
635 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
645 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
647 line_t oldline = curcop->cop_line;
649 if (copline != NOLINE)
650 curcop->cop_line = copline;
651 warn("Found = in conditional, should be ==");
652 curcop->cop_line = oldline;
662 /* assumes no premature commitment */
663 if (!o || (o->op_flags & OPf_WANT) || error_count
664 || o->op_type == OP_RETURN)
667 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
669 switch (o->op_type) {
671 if (o->op_private & OPpREPEAT_DOLIST)
672 null(((LISTOP*)cBINOPo->op_first)->op_first);
673 scalar(cBINOPo->op_first);
678 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
682 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
683 if (!kPMOP->op_pmreplroot)
684 deprecate("implicit split to @_");
691 if (o->op_flags & OPf_KIDS) {
692 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
698 kid = cLISTOPo->op_first;
700 while (kid = kid->op_sibling) {
706 WITH_THR(curcop = &compiling);
711 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
717 WITH_THR(curcop = &compiling);
730 /* assumes no premature commitment */
731 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
732 || o->op_type == OP_RETURN)
735 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
737 switch (o->op_type) {
739 if (!(opargs[o->op_type] & OA_FOLDCONST))
743 if (o->op_flags & OPf_STACKED)
814 if (!(o->op_private & OPpLVAL_INTRO))
815 useless = op_desc[o->op_type];
822 if (!(o->op_private & OPpLVAL_INTRO) &&
823 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
824 useless = "a variable";
829 WITH_THR(curcop = ((COP*)o)); /* for warning below */
835 useless = "a constant";
836 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
838 else if (SvPOK(sv)) {
839 if (strnEQ(SvPVX(sv), "di", 2) ||
840 strnEQ(SvPVX(sv), "ds", 2) ||
841 strnEQ(SvPVX(sv), "ig", 2))
845 null(o); /* don't execute a constant */
846 SvREFCNT_dec(sv); /* don't even remember it */
850 o->op_type = OP_PREINC; /* pre-increment is faster */
851 o->op_ppaddr = ppaddr[OP_PREINC];
855 o->op_type = OP_PREDEC; /* pre-decrement is faster */
856 o->op_ppaddr = ppaddr[OP_PREDEC];
862 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
867 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
868 WITH_THR(curcop = ((COP*)o)); /* for warning below */
869 if (o->op_flags & OPf_STACKED)
875 if (!(o->op_flags & OPf_KIDS))
884 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
891 /* all requires must return a boolean value */
892 o->op_flags &= ~OPf_WANT;
895 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
896 if (!kPMOP->op_pmreplroot)
897 deprecate("implicit split to @_");
901 if (useless && dowarn)
902 warn("Useless use of %s in void context", useless);
910 if (o && o->op_flags & OPf_KIDS) {
911 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
922 /* assumes no premature commitment */
923 if (!o || (o->op_flags & OPf_WANT) || error_count
924 || o->op_type == OP_RETURN)
927 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
929 switch (o->op_type) {
932 list(cBINOPo->op_first);
937 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
944 if (!(o->op_flags & OPf_KIDS))
946 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
947 list(cBINOPo->op_first);
948 return gen_constant_list(o);
955 kid = cLISTOPo->op_first;
957 while (kid = kid->op_sibling) {
963 WITH_THR(curcop = &compiling);
967 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
973 WITH_THR(curcop = &compiling);
976 /* all requires must return a boolean value */
977 o->op_flags &= ~OPf_WANT;
989 if (o->op_type == OP_LINESEQ ||
990 o->op_type == OP_SCOPE ||
991 o->op_type == OP_LEAVE ||
992 o->op_type == OP_LEAVETRY)
995 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
996 if (kid->op_sibling) {
1000 curcop = &compiling;
1002 o->op_flags &= ~OPf_PARENS;
1003 if (hints & HINT_BLOCK_SCOPE)
1004 o->op_flags |= OPf_PARENS;
1007 o = newOP(OP_STUB, 0);
1012 modkids(OP *o, I32 type)
1015 if (o && o->op_flags & OPf_KIDS) {
1016 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1022 static I32 modcount;
1025 mod(OP *o, I32 type)
1031 if (!o || error_count)
1034 switch (o->op_type) {
1039 if (!(o->op_private & (OPpCONST_ARYBASE)))
1041 if (eval_start && eval_start->op_type == OP_CONST) {
1042 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1046 SAVEI32(compiling.cop_arybase);
1047 compiling.cop_arybase = 0;
1049 else if (type == OP_REFGEN)
1052 croak("That use of $[ is unsupported");
1055 if (o->op_flags & OPf_PARENS)
1059 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1060 !(o->op_flags & OPf_STACKED)) {
1061 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1062 o->op_ppaddr = ppaddr[OP_RV2CV];
1063 assert(cUNOPo->op_first->op_type == OP_NULL);
1064 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1070 /* grep, foreach, subcalls, refgen */
1071 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1073 yyerror(form("Can't modify %s in %s",
1074 op_desc[o->op_type],
1075 type ? op_desc[type] : "local"));
1089 case OP_RIGHT_SHIFT:
1098 if (!(o->op_flags & OPf_STACKED))
1104 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1110 if (!type && cUNOPo->op_first->op_type != OP_GV)
1111 croak("Can't localize through a reference");
1112 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1114 return o; /* Treat \(@foo) like ordinary list. */
1118 if (scalar_mod_type(o, type))
1120 ref(cUNOPo->op_first, o->op_type);
1132 if (!type && cUNOPo->op_first->op_type != OP_GV)
1133 croak("Can't localize through a reference");
1134 ref(cUNOPo->op_first, o->op_type);
1146 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1147 return o; /* Treat \(@foo) like ordinary list. */
1148 if (scalar_mod_type(o, type))
1155 croak("Can't localize lexical variable %s",
1156 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1163 if (type != OP_SASSIGN)
1169 pad_free(o->op_targ);
1170 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1171 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1172 if (o->op_flags & OPf_KIDS)
1173 mod(cBINOPo->op_first->op_sibling, type);
1178 ref(cBINOPo->op_first, o->op_type);
1179 if (type == OP_ENTERSUB &&
1180 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1181 o->op_private |= OPpLVAL_DEFER;
1188 if (o->op_flags & OPf_KIDS)
1189 mod(cLISTOPo->op_last, type);
1193 if (!(o->op_flags & OPf_KIDS))
1195 if (o->op_targ != OP_LIST) {
1196 mod(cBINOPo->op_first, type);
1201 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1205 o->op_flags |= OPf_MOD;
1207 if (type == OP_AASSIGN || type == OP_SASSIGN)
1208 o->op_flags |= OPf_SPECIAL|OPf_REF;
1210 o->op_private |= OPpLVAL_INTRO;
1211 o->op_flags &= ~OPf_SPECIAL;
1213 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1214 o->op_flags |= OPf_REF;
1219 scalar_mod_type(OP *o, I32 type)
1223 if (o->op_type == OP_RV2GV)
1247 case OP_RIGHT_SHIFT:
1254 case OP_ANDASSIGN: /* may work later */
1255 case OP_ORASSIGN: /* may work later */
1263 refkids(OP *o, I32 type)
1266 if (o && o->op_flags & OPf_KIDS) {
1267 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1274 ref(OP *o, I32 type)
1278 if (!o || error_count)
1281 switch (o->op_type) {
1283 if ((type == OP_DEFINED || type == OP_LOCK) &&
1284 !(o->op_flags & OPf_STACKED)) {
1285 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1286 o->op_ppaddr = ppaddr[OP_RV2CV];
1287 assert(cUNOPo->op_first->op_type == OP_NULL);
1288 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1289 o->op_flags |= OPf_SPECIAL;
1294 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1298 ref(cUNOPo->op_first, o->op_type);
1301 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1302 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1303 : type == OP_RV2HV ? OPpDEREF_HV
1305 o->op_flags |= OPf_MOD;
1310 o->op_flags |= OPf_MOD; /* XXX ??? */
1315 o->op_flags |= OPf_REF;
1318 ref(cUNOPo->op_first, o->op_type);
1323 o->op_flags |= OPf_REF;
1328 if (!(o->op_flags & OPf_KIDS))
1330 ref(cBINOPo->op_first, type);
1334 ref(cBINOPo->op_first, o->op_type);
1335 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1336 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1337 : type == OP_RV2HV ? OPpDEREF_HV
1339 o->op_flags |= OPf_MOD;
1347 if (!(o->op_flags & OPf_KIDS))
1349 ref(cLISTOPo->op_last, type);
1364 if (!o || error_count)
1368 if (type == OP_LIST) {
1369 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1372 else if (type != OP_PADSV &&
1375 type != OP_PUSHMARK)
1377 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1380 o->op_flags |= OPf_MOD;
1381 o->op_private |= OPpLVAL_INTRO;
1389 o->op_flags |= OPf_PARENS;
1394 bind_match(I32 type, OP *left, OP *right)
1399 (left->op_type == OP_RV2AV ||
1400 left->op_type == OP_RV2HV ||
1401 left->op_type == OP_PADAV ||
1402 left->op_type == OP_PADHV)) {
1403 char *desc = op_desc[(right->op_type == OP_SUBST ||
1404 right->op_type == OP_TRANS)
1405 ? right->op_type : OP_MATCH];
1406 char *sample = ((left->op_type == OP_RV2AV ||
1407 left->op_type == OP_PADAV)
1408 ? "@array" : "%hash");
1409 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1412 if (right->op_type == OP_MATCH ||
1413 right->op_type == OP_SUBST ||
1414 right->op_type == OP_TRANS) {
1415 right->op_flags |= OPf_STACKED;
1416 if (right->op_type != OP_MATCH)
1417 left = mod(left, right->op_type);
1418 if (right->op_type == OP_TRANS)
1419 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1421 o = prepend_elem(right->op_type, scalar(left), right);
1423 return newUNOP(OP_NOT, 0, scalar(o));
1427 return bind_match(type, left,
1428 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1436 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1437 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1444 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1445 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1446 o->op_type = OP_LEAVE;
1447 o->op_ppaddr = ppaddr[OP_LEAVE];
1450 if (o->op_type == OP_LINESEQ) {
1452 o->op_type = OP_SCOPE;
1453 o->op_ppaddr = ppaddr[OP_SCOPE];
1454 kid = ((LISTOP*)o)->op_first;
1455 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1456 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1461 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1468 block_start(int full)
1471 int retval = savestack_ix;
1472 SAVEI32(comppad_name_floor);
1474 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1475 comppad_name_floor = comppad_name_fill;
1477 comppad_name_floor = 0;
1479 SAVEI32(min_intro_pending);
1480 SAVEI32(max_intro_pending);
1481 min_intro_pending = 0;
1482 SAVEI32(comppad_name_fill);
1483 SAVEI32(padix_floor);
1484 padix_floor = padix;
1485 pad_reset_pending = FALSE;
1487 hints &= ~HINT_BLOCK_SCOPE;
1492 block_end(I32 floor, OP *seq)
1495 int needblockscope = hints & HINT_BLOCK_SCOPE;
1496 OP* retval = scalarseq(seq);
1498 pad_reset_pending = FALSE;
1500 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1501 pad_leavemy(comppad_name_fill);
1511 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1512 eval_start = linklist(eval_root);
1513 eval_root->op_next = 0;
1519 main_root = scope(sawparens(scalarvoid(o)));
1520 curcop = &compiling;
1521 main_start = LINKLIST(main_root);
1522 main_root->op_next = 0;
1526 /* Register with debugger */
1528 CV *cv = perl_get_cv("DB::postponed", FALSE);
1532 XPUSHs((SV*)compiling.cop_filegv);
1534 perl_call_sv((SV*)cv, G_DISCARD);
1541 localize(OP *o, I32 lex)
1543 if (o->op_flags & OPf_PARENS)
1547 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1549 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1550 if (*s == ';' || *s == '=')
1551 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1555 in_my_stash = Nullhv;
1559 return mod(o, OP_NULL); /* a bit kludgey */
1565 if (o->op_type == OP_LIST) {
1566 o = convert(OP_JOIN, 0,
1567 prepend_elem(OP_LIST,
1568 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1575 fold_constants(register OP *o)
1579 I32 type = o->op_type;
1582 if (opargs[type] & OA_RETSCALAR)
1584 if (opargs[type] & OA_TARGET)
1585 o->op_targ = pad_alloc(type, SVs_PADTMP);
1587 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1588 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1590 if (!(opargs[type] & OA_FOLDCONST))
1599 if (o->op_private & OPpLOCALE)
1604 goto nope; /* Don't try to run w/ errors */
1606 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1607 if (curop->op_type != OP_CONST &&
1608 curop->op_type != OP_LIST &&
1609 curop->op_type != OP_SCALAR &&
1610 curop->op_type != OP_NULL &&
1611 curop->op_type != OP_PUSHMARK) {
1616 curop = LINKLIST(o);
1621 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1622 pad_swipe(o->op_targ);
1623 else if (SvTEMP(sv)) { /* grab mortal temp? */
1624 (void)SvREFCNT_inc(sv);
1628 if (type == OP_RV2GV)
1629 return newGVOP(OP_GV, 0, (GV*)sv);
1631 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1633 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1638 SvIOK_off(sv); /* undo SvIV() damage */
1640 return newSVOP(OP_CONST, 0, sv);
1644 if (!(opargs[type] & OA_OTHERINT))
1647 if (!(hints & HINT_INTEGER)) {
1648 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1651 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1652 if (curop->op_type == OP_CONST) {
1653 if (SvIOK(((SVOP*)curop)->op_sv))
1657 if (opargs[curop->op_type] & OA_RETINTEGER)
1661 o->op_ppaddr = ppaddr[++(o->op_type)];
1668 gen_constant_list(register OP *o)
1672 I32 oldtmps_floor = tmps_floor;
1676 return o; /* Don't attempt to run with errors */
1678 op = curop = LINKLIST(o);
1684 tmps_floor = oldtmps_floor;
1686 o->op_type = OP_RV2AV;
1687 o->op_ppaddr = ppaddr[OP_RV2AV];
1688 curop = ((UNOP*)o)->op_first;
1689 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1696 convert(I32 type, I32 flags, OP *o)
1701 if (!o || o->op_type != OP_LIST)
1702 o = newLISTOP(OP_LIST, 0, o, Nullop);
1704 o->op_flags &= ~OPf_WANT;
1706 if (!(opargs[type] & OA_MARK))
1707 null(cLISTOPo->op_first);
1710 o->op_ppaddr = ppaddr[type];
1711 o->op_flags |= flags;
1713 o = CHECKOP(type, o);
1714 if (o->op_type != type)
1717 if (cLISTOPo->op_children < 7) {
1718 /* XXX do we really need to do this if we're done appending?? */
1719 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1721 cLISTOPo->op_last = last; /* in case check substituted last arg */
1724 return fold_constants(o);
1727 /* List constructors */
1730 append_elem(I32 type, OP *first, OP *last)
1738 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1739 return newLISTOP(type, 0, first, last);
1741 if (first->op_flags & OPf_KIDS)
1742 ((LISTOP*)first)->op_last->op_sibling = last;
1744 first->op_flags |= OPf_KIDS;
1745 ((LISTOP*)first)->op_first = last;
1747 ((LISTOP*)first)->op_last = last;
1748 ((LISTOP*)first)->op_children++;
1753 append_list(I32 type, LISTOP *first, LISTOP *last)
1761 if (first->op_type != type)
1762 return prepend_elem(type, (OP*)first, (OP*)last);
1764 if (last->op_type != type)
1765 return append_elem(type, (OP*)first, (OP*)last);
1767 first->op_last->op_sibling = last->op_first;
1768 first->op_last = last->op_last;
1769 first->op_children += last->op_children;
1770 if (first->op_children)
1771 last->op_flags |= OPf_KIDS;
1778 prepend_elem(I32 type, OP *first, OP *last)
1786 if (last->op_type == type) {
1787 if (type == OP_LIST) { /* already a PUSHMARK there */
1788 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1789 ((LISTOP*)last)->op_first->op_sibling = first;
1792 if (!(last->op_flags & OPf_KIDS)) {
1793 ((LISTOP*)last)->op_last = first;
1794 last->op_flags |= OPf_KIDS;
1796 first->op_sibling = ((LISTOP*)last)->op_first;
1797 ((LISTOP*)last)->op_first = first;
1799 ((LISTOP*)last)->op_children++;
1803 return newLISTOP(type, 0, first, last);
1811 return newOP(OP_STUB, 0);
1817 if (!o || o->op_type != OP_LIST)
1818 o = newLISTOP(OP_LIST, 0, o, Nullop);
1824 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1828 Newz(1101, listop, 1, LISTOP);
1830 listop->op_type = type;
1831 listop->op_ppaddr = ppaddr[type];
1832 listop->op_children = (first != 0) + (last != 0);
1833 listop->op_flags = flags;
1837 else if (!first && last)
1840 first->op_sibling = last;
1841 listop->op_first = first;
1842 listop->op_last = last;
1843 if (type == OP_LIST) {
1845 pushop = newOP(OP_PUSHMARK, 0);
1846 pushop->op_sibling = first;
1847 listop->op_first = pushop;
1848 listop->op_flags |= OPf_KIDS;
1850 listop->op_last = pushop;
1852 else if (listop->op_children)
1853 listop->op_flags |= OPf_KIDS;
1859 newOP(I32 type, I32 flags)
1862 Newz(1101, o, 1, OP);
1864 o->op_ppaddr = ppaddr[type];
1865 o->op_flags = flags;
1868 o->op_private = 0 + (flags >> 8);
1869 if (opargs[type] & OA_RETSCALAR)
1871 if (opargs[type] & OA_TARGET)
1872 o->op_targ = pad_alloc(type, SVs_PADTMP);
1873 return CHECKOP(type, o);
1877 newUNOP(I32 type, I32 flags, OP *first)
1882 first = newOP(OP_STUB, 0);
1883 if (opargs[type] & OA_MARK)
1884 first = force_list(first);
1886 Newz(1101, unop, 1, UNOP);
1887 unop->op_type = type;
1888 unop->op_ppaddr = ppaddr[type];
1889 unop->op_first = first;
1890 unop->op_flags = flags | OPf_KIDS;
1891 unop->op_private = 1 | (flags >> 8);
1893 unop = (UNOP*) CHECKOP(type, unop);
1897 return fold_constants((OP *) unop);
1901 newBINOP(I32 type, I32 flags, OP *first, OP *last)
1904 Newz(1101, binop, 1, BINOP);
1907 first = newOP(OP_NULL, 0);
1909 binop->op_type = type;
1910 binop->op_ppaddr = ppaddr[type];
1911 binop->op_first = first;
1912 binop->op_flags = flags | OPf_KIDS;
1915 binop->op_private = 1 | (flags >> 8);
1918 binop->op_private = 2 | (flags >> 8);
1919 first->op_sibling = last;
1922 binop = (BINOP*)CHECKOP(type, binop);
1926 binop->op_last = last = binop->op_first->op_sibling;
1928 return fold_constants((OP *)binop);
1932 pmtrans(OP *o, OP *expr, OP *repl)
1934 SV *tstr = ((SVOP*)expr)->op_sv;
1935 SV *rstr = ((SVOP*)repl)->op_sv;
1938 register U8 *t = (U8*)SvPV(tstr, tlen);
1939 register U8 *r = (U8*)SvPV(rstr, rlen);
1944 register short *tbl;
1946 tbl = (short*)cPVOPo->op_pv;
1947 complement = o->op_private & OPpTRANS_COMPLEMENT;
1948 Delete = o->op_private & OPpTRANS_DELETE;
1949 /* squash = o->op_private & OPpTRANS_SQUASH; */
1952 Zero(tbl, 256, short);
1953 for (i = 0; i < tlen; i++)
1955 for (i = 0, j = 0; i < 256; i++) {
1971 if (!rlen && !Delete) {
1974 for (i = 0; i < 256; i++)
1976 for (i = 0, j = 0; i < tlen; i++,j++) {
1979 if (tbl[t[i]] == -1)
1985 if (tbl[t[i]] == -1)
1996 newPMOP(I32 type, I32 flags)
2001 Newz(1101, pmop, 1, PMOP);
2002 pmop->op_type = type;
2003 pmop->op_ppaddr = ppaddr[type];
2004 pmop->op_flags = flags;
2005 pmop->op_private = 0 | (flags >> 8);
2007 if (hints & HINT_LOCALE)
2008 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2010 /* link into pm list */
2011 if (type != OP_TRANS && curstash) {
2012 pmop->op_pmnext = HvPMROOT(curstash);
2013 HvPMROOT(curstash) = pmop;
2020 pmruntime(OP *o, OP *expr, OP *repl)
2025 if (o->op_type == OP_TRANS)
2026 return pmtrans(o, expr, repl);
2028 hints |= HINT_BLOCK_SCOPE;
2031 if (expr->op_type == OP_CONST) {
2033 SV *pat = ((SVOP*)expr)->op_sv;
2034 char *p = SvPV(pat, plen);
2035 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2036 sv_setpvn(pat, "\\s+", 3);
2037 p = SvPV(pat, plen);
2038 pm->op_pmflags |= PMf_SKIPWHITE;
2040 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2041 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2042 pm->op_pmflags |= PMf_WHITE;
2047 if (pm->op_pmflags & PMf_KEEP)
2048 expr = newUNOP(OP_REGCMAYBE,0,expr);
2050 Newz(1101, rcop, 1, LOGOP);
2051 rcop->op_type = OP_REGCOMP;
2052 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2053 rcop->op_first = scalar(expr);
2054 rcop->op_flags |= OPf_KIDS;
2055 rcop->op_private = 1;
2058 /* establish postfix order */
2059 if (pm->op_pmflags & PMf_KEEP) {
2061 rcop->op_next = expr;
2062 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2065 rcop->op_next = LINKLIST(expr);
2066 expr->op_next = (OP*)rcop;
2069 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2074 if (pm->op_pmflags & PMf_EVAL)
2076 else if (repl->op_type == OP_CONST)
2080 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2081 if (opargs[curop->op_type] & OA_DANGEROUS) {
2082 if (curop->op_type == OP_GV) {
2083 GV *gv = ((GVOP*)curop)->op_gv;
2084 if (strchr("&`'123456789+", *GvENAME(gv)))
2087 else if (curop->op_type == OP_RV2CV)
2089 else if (curop->op_type == OP_RV2SV ||
2090 curop->op_type == OP_RV2AV ||
2091 curop->op_type == OP_RV2HV ||
2092 curop->op_type == OP_RV2GV) {
2093 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2096 else if (curop->op_type == OP_PADSV ||
2097 curop->op_type == OP_PADAV ||
2098 curop->op_type == OP_PADHV ||
2099 curop->op_type == OP_PADANY ||
2100 curop->op_type == OP_SPECIFIC) {
2109 if (curop == repl) {
2110 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2111 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2112 prepend_elem(o->op_type, scalar(repl), o);
2115 Newz(1101, rcop, 1, LOGOP);
2116 rcop->op_type = OP_SUBSTCONT;
2117 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2118 rcop->op_first = scalar(repl);
2119 rcop->op_flags |= OPf_KIDS;
2120 rcop->op_private = 1;
2123 /* establish postfix order */
2124 rcop->op_next = LINKLIST(repl);
2125 repl->op_next = (OP*)rcop;
2127 pm->op_pmreplroot = scalar((OP*)rcop);
2128 pm->op_pmreplstart = LINKLIST(rcop);
2137 newSVOP(I32 type, I32 flags, SV *sv)
2140 Newz(1101, svop, 1, SVOP);
2141 svop->op_type = type;
2142 svop->op_ppaddr = ppaddr[type];
2144 svop->op_next = (OP*)svop;
2145 svop->op_flags = flags;
2146 if (opargs[type] & OA_RETSCALAR)
2148 if (opargs[type] & OA_TARGET)
2149 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2150 return CHECKOP(type, svop);
2154 newGVOP(I32 type, I32 flags, GV *gv)
2158 Newz(1101, gvop, 1, GVOP);
2159 gvop->op_type = type;
2160 gvop->op_ppaddr = ppaddr[type];
2161 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2162 gvop->op_next = (OP*)gvop;
2163 gvop->op_flags = flags;
2164 if (opargs[type] & OA_RETSCALAR)
2166 if (opargs[type] & OA_TARGET)
2167 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2168 return CHECKOP(type, gvop);
2172 newPVOP(I32 type, I32 flags, char *pv)
2175 Newz(1101, pvop, 1, PVOP);
2176 pvop->op_type = type;
2177 pvop->op_ppaddr = ppaddr[type];
2179 pvop->op_next = (OP*)pvop;
2180 pvop->op_flags = flags;
2181 if (opargs[type] & OA_RETSCALAR)
2183 if (opargs[type] & OA_TARGET)
2184 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2185 return CHECKOP(type, pvop);
2194 save_hptr(&curstash);
2195 save_item(curstname);
2200 name = SvPV(sv, len);
2201 curstash = gv_stashpvn(name,len,TRUE);
2202 sv_setpvn(curstname, name, len);
2206 sv_setpv(curstname,"<none>");
2214 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2222 if (id->op_type != OP_CONST)
2223 croak("Module name must be constant");
2227 if(version != Nullop) {
2228 SV *vesv = ((SVOP*)version)->op_sv;
2230 if (arg == Nullop && !SvNIOK(vesv)) {
2237 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2238 croak("Version number must be constant number");
2240 /* Make copy of id so we don't free it twice */
2241 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2243 /* Fake up a method call to VERSION */
2244 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2245 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2246 append_elem(OP_LIST,
2247 prepend_elem(OP_LIST, pack, list(version)),
2248 newUNOP(OP_METHOD, 0, meth)));
2252 /* Fake up an import/unimport */
2253 if (arg && arg->op_type == OP_STUB)
2254 imop = arg; /* no import on explicit () */
2255 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2256 imop = Nullop; /* use 5.0; */
2259 /* Make copy of id so we don't free it twice */
2260 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2261 meth = newSVOP(OP_CONST, 0,
2263 ? newSVpv("import", 6)
2264 : newSVpv("unimport", 8)
2266 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2267 append_elem(OP_LIST,
2268 prepend_elem(OP_LIST, pack, list(arg)),
2269 newUNOP(OP_METHOD, 0, meth)));
2272 /* Fake up a require */
2273 rqop = newUNOP(OP_REQUIRE, 0, id);
2275 /* Fake up the BEGIN {}, which does its thing immediately. */
2277 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2279 append_elem(OP_LINESEQ,
2280 append_elem(OP_LINESEQ,
2281 newSTATEOP(0, Nullch, rqop),
2282 newSTATEOP(0, Nullch, veop)),
2283 newSTATEOP(0, Nullch, imop) ));
2290 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2292 return newBINOP(OP_LSLICE, flags,
2293 list(force_list(subscript)),
2294 list(force_list(listval)) );
2298 list_assignment(register OP *o)
2303 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2304 o = cUNOPo->op_first;
2306 if (o->op_type == OP_COND_EXPR) {
2307 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2308 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2313 yyerror("Assignment to both a list and a scalar");
2317 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2318 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2319 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2322 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2325 if (o->op_type == OP_RV2SV)
2332 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2337 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2338 return newLOGOP(optype, 0,
2339 mod(scalar(left), optype),
2340 newUNOP(OP_SASSIGN, 0, scalar(right)));
2343 return newBINOP(optype, OPf_STACKED,
2344 mod(scalar(left), optype), scalar(right));
2348 if (list_assignment(left)) {
2350 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2351 left = mod(left, OP_AASSIGN);
2359 o = newBINOP(OP_AASSIGN, flags,
2360 list(force_list(right)),
2361 list(force_list(left)) );
2362 o->op_private = 0 | (flags >> 8);
2363 if (!(left->op_private & OPpLVAL_INTRO)) {
2364 static int generation = 100;
2368 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2369 if (opargs[curop->op_type] & OA_DANGEROUS) {
2370 if (curop->op_type == OP_GV) {
2371 GV *gv = ((GVOP*)curop)->op_gv;
2372 if (gv == defgv || SvCUR(gv) == generation)
2374 SvCUR(gv) = generation;
2376 else if (curop->op_type == OP_PADSV ||
2377 curop->op_type == OP_PADAV ||
2378 curop->op_type == OP_PADHV ||
2379 curop->op_type == OP_PADANY) {
2380 SV **svp = AvARRAY(comppad_name);
2381 SV *sv = svp[curop->op_targ];
2382 if (SvCUR(sv) == generation)
2384 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2386 else if (curop->op_type == OP_RV2CV)
2388 else if (curop->op_type == OP_RV2SV ||
2389 curop->op_type == OP_RV2AV ||
2390 curop->op_type == OP_RV2HV ||
2391 curop->op_type == OP_RV2GV) {
2392 if (lastop->op_type != OP_GV) /* funny deref? */
2401 o->op_private = OPpASSIGN_COMMON;
2403 if (right && right->op_type == OP_SPLIT) {
2405 if ((tmpop = ((LISTOP*)right)->op_first) &&
2406 tmpop->op_type == OP_PUSHRE)
2408 PMOP *pm = (PMOP*)tmpop;
2409 if (left->op_type == OP_RV2AV &&
2410 !(left->op_private & OPpLVAL_INTRO) &&
2411 !(o->op_private & OPpASSIGN_COMMON) )
2413 tmpop = ((UNOP*)left)->op_first;
2414 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2415 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2416 pm->op_pmflags |= PMf_ONCE;
2417 tmpop = cUNOPo->op_first; /* to list (nulled) */
2418 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2419 tmpop->op_sibling = Nullop; /* don't free split */
2420 right->op_next = tmpop->op_next; /* fix starting loc */
2421 op_free(o); /* blow off assign */
2422 right->op_flags &= ~OPf_WANT;
2423 /* "I don't know and I don't care." */
2428 if (modcount < 10000 &&
2429 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2431 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2433 sv_setiv(sv, modcount+1);
2441 right = newOP(OP_UNDEF, 0);
2442 if (right->op_type == OP_READLINE) {
2443 right->op_flags |= OPf_STACKED;
2444 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2447 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2448 o = newBINOP(OP_SASSIGN, flags,
2449 scalar(right), mod(scalar(left), OP_SASSIGN) );
2461 newSTATEOP(I32 flags, char *label, OP *o)
2464 U32 seq = intro_my();
2467 Newz(1101, cop, 1, COP);
2468 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2469 cop->op_type = OP_DBSTATE;
2470 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2473 cop->op_type = OP_NEXTSTATE;
2474 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2476 cop->op_flags = flags;
2477 cop->op_private = 0 | (flags >> 8);
2479 cop->op_private |= NATIVE_HINTS;
2481 cop->op_next = (OP*)cop;
2484 cop->cop_label = label;
2485 hints |= HINT_BLOCK_SCOPE;
2488 cop->cop_arybase = curcop->cop_arybase;
2490 if (copline == NOLINE)
2491 cop->cop_line = curcop->cop_line;
2493 cop->cop_line = copline;
2496 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2497 cop->cop_stash = curstash;
2499 if (PERLDB_LINE && curstash != debstash) {
2500 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2501 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2502 (void)SvIOK_on(*svp);
2504 SvSTASH(*svp) = (HV*)cop;
2508 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2511 /* "Introduce" my variables to visible status. */
2519 if (! min_intro_pending)
2522 svp = AvARRAY(comppad_name);
2523 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2524 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2525 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2526 SvNVX(sv) = (double)cop_seqmax;
2529 min_intro_pending = 0;
2530 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2531 return cop_seqmax++;
2535 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2541 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2542 return newBINOP(type, flags, scalar(first), scalar(other));
2544 scalarboolean(first);
2545 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2546 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2547 if (type == OP_AND || type == OP_OR) {
2553 first = cUNOPo->op_first;
2555 first->op_next = o->op_next;
2556 cUNOPo->op_first = Nullop;
2560 if (first->op_type == OP_CONST) {
2561 if (dowarn && (first->op_private & OPpCONST_BARE))
2562 warn("Probable precedence problem on %s", op_desc[type]);
2563 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2572 else if (first->op_type == OP_WANTARRAY) {
2578 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2579 OP *k1 = ((UNOP*)first)->op_first;
2580 OP *k2 = k1->op_sibling;
2582 switch (first->op_type)
2585 if (k2 && k2->op_type == OP_READLINE
2586 && (k2->op_flags & OPf_STACKED)
2587 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2588 warnop = k2->op_type;
2592 if (k1->op_type == OP_READDIR
2593 || k1->op_type == OP_GLOB
2594 || k1->op_type == OP_EACH)
2595 warnop = k1->op_type;
2599 line_t oldline = curcop->cop_line;
2600 curcop->cop_line = copline;
2601 warn("Value of %s%s can be \"0\"; test with defined()",
2603 ((warnop == OP_READLINE || warnop == OP_GLOB)
2604 ? " construct" : "() operator"));
2605 curcop->cop_line = oldline;
2612 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2613 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2615 Newz(1101, logop, 1, LOGOP);
2617 logop->op_type = type;
2618 logop->op_ppaddr = ppaddr[type];
2619 logop->op_first = first;
2620 logop->op_flags = flags | OPf_KIDS;
2621 logop->op_other = LINKLIST(other);
2622 logop->op_private = 1 | (flags >> 8);
2624 /* establish postfix order */
2625 logop->op_next = LINKLIST(first);
2626 first->op_next = (OP*)logop;
2627 first->op_sibling = other;
2629 o = newUNOP(OP_NULL, 0, (OP*)logop);
2636 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2643 return newLOGOP(OP_AND, 0, first, trueop);
2645 return newLOGOP(OP_OR, 0, first, falseop);
2647 scalarboolean(first);
2648 if (first->op_type == OP_CONST) {
2649 if (SvTRUE(((SVOP*)first)->op_sv)) {
2660 else if (first->op_type == OP_WANTARRAY) {
2664 Newz(1101, condop, 1, CONDOP);
2666 condop->op_type = OP_COND_EXPR;
2667 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2668 condop->op_first = first;
2669 condop->op_flags = flags | OPf_KIDS;
2670 condop->op_true = LINKLIST(trueop);
2671 condop->op_false = LINKLIST(falseop);
2672 condop->op_private = 1 | (flags >> 8);
2674 /* establish postfix order */
2675 condop->op_next = LINKLIST(first);
2676 first->op_next = (OP*)condop;
2678 first->op_sibling = trueop;
2679 trueop->op_sibling = falseop;
2680 o = newUNOP(OP_NULL, 0, (OP*)condop);
2682 trueop->op_next = o;
2683 falseop->op_next = o;
2689 newRANGE(I32 flags, OP *left, OP *right)
2697 Newz(1101, condop, 1, CONDOP);
2699 condop->op_type = OP_RANGE;
2700 condop->op_ppaddr = ppaddr[OP_RANGE];
2701 condop->op_first = left;
2702 condop->op_flags = OPf_KIDS;
2703 condop->op_true = LINKLIST(left);
2704 condop->op_false = LINKLIST(right);
2705 condop->op_private = 1 | (flags >> 8);
2707 left->op_sibling = right;
2709 condop->op_next = (OP*)condop;
2710 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2711 flop = newUNOP(OP_FLOP, 0, flip);
2712 o = newUNOP(OP_NULL, 0, flop);
2715 left->op_next = flip;
2716 right->op_next = flop;
2718 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2719 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2720 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2721 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2723 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2724 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2727 if (!flip->op_private || !flop->op_private)
2728 linklist(o); /* blow off optimizer unless constant */
2734 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2739 int once = block && block->op_flags & OPf_SPECIAL &&
2740 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2743 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2744 return block; /* do {} while 0 does once */
2745 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2746 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2747 expr = newUNOP(OP_DEFINED, 0,
2748 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2752 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2753 o = newLOGOP(OP_AND, 0, expr, listop);
2755 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2757 if (once && o != listop)
2758 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2761 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2763 o->op_flags |= flags;
2765 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2770 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2779 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2780 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2781 expr = newUNOP(OP_DEFINED, 0,
2782 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2786 block = newOP(OP_NULL, 0);
2789 next = LINKLIST(cont);
2791 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2792 if ((line_t)whileline != NOLINE) {
2793 copline = whileline;
2794 cont = append_elem(OP_LINESEQ, cont,
2795 newSTATEOP(0, Nullch, Nullop));
2799 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2800 redo = LINKLIST(listop);
2803 o = newLOGOP(OP_AND, 0, expr, scalar(listop));
2804 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2805 op_free(expr); /* oops, it's a while (0) */
2807 return Nullop; /* (listop already freed by newLOGOP) */
2809 ((LISTOP*)listop)->op_last->op_next = condop =
2810 (o == listop ? redo : LINKLIST(o));
2818 Newz(1101,loop,1,LOOP);
2819 loop->op_type = OP_ENTERLOOP;
2820 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2821 loop->op_private = 0;
2822 loop->op_next = (OP*)loop;
2825 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2827 loop->op_redoop = redo;
2828 loop->op_lastop = o;
2831 loop->op_nextop = next;
2833 loop->op_nextop = o;
2835 o->op_flags |= flags;
2836 o->op_private |= (flags >> 8);
2841 #ifndef CAN_PROTOTYPE
2842 newFOROP(flags,label,forline,sv,expr,block,cont)
2851 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2852 #endif /* CAN_PROTOTYPE */
2860 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2861 sv->op_type = OP_RV2GV;
2862 sv->op_ppaddr = ppaddr[OP_RV2GV];
2864 else if (sv->op_type == OP_PADSV) { /* private variable */
2865 padoff = sv->op_targ;
2870 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2873 sv = newGVOP(OP_GV, 0, defgv);
2875 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2876 expr = scalar(ref(expr, OP_ITER));
2877 iterflags |= OPf_STACKED;
2879 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2880 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2882 assert(!loop->op_next);
2883 Renew(loop, 1, LOOP);
2884 loop->op_targ = padoff;
2885 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
2887 return newSTATEOP(0, label, wop);
2891 newLOOPEX(I32 type, OP *label)
2895 if (type != OP_GOTO || label->op_type == OP_CONST) {
2896 o = newPVOP(type, 0, savepv(
2897 label->op_type == OP_CONST
2898 ? SvPVx(((SVOP*)label)->op_sv, na)
2903 if (label->op_type == OP_ENTERSUB)
2904 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2905 o = newUNOP(type, OPf_STACKED, label);
2907 hints |= HINT_BLOCK_SCOPE;
2917 MUTEX_DESTROY(CvMUTEXP(cv));
2918 Safefree(CvMUTEXP(cv));
2921 #endif /* USE_THREADS */
2923 if (!CvXSUB(cv) && CvROOT(cv)) {
2925 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
2926 croak("Can't undef active subroutine");
2929 croak("Can't undef active subroutine");
2930 #endif /* USE_THREADS */
2937 op_free(CvROOT(cv));
2938 CvROOT(cv) = Nullop;
2941 SvPOK_off((SV*)cv); /* forget prototype */
2943 SvREFCNT_dec(CvGV(cv));
2945 SvREFCNT_dec(CvOUTSIDE(cv));
2946 CvOUTSIDE(cv) = Nullcv;
2947 if (CvPADLIST(cv)) {
2948 /* may be during global destruction */
2949 if (SvREFCNT(CvPADLIST(cv))) {
2950 I32 i = AvFILL(CvPADLIST(cv));
2952 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
2953 SV* sv = svp ? *svp : Nullsv;
2956 if (sv == (SV*)comppad_name)
2957 comppad_name = Nullav;
2958 else if (sv == (SV*)comppad) {
2960 curpad = Null(SV**);
2964 SvREFCNT_dec((SV*)CvPADLIST(cv));
2966 CvPADLIST(cv) = Nullav;
2970 #ifdef DEBUG_CLOSURES
2975 CV *outside = CvOUTSIDE(cv);
2976 AV* padlist = CvPADLIST(cv);
2983 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
2985 (CvANON(cv) ? "ANON"
2986 : (cv == main_cv) ? "MAIN"
2987 : CvUNIQUE(outside) ? "UNIQUE"
2988 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
2991 : CvANON(outside) ? "ANON"
2992 : (outside == main_cv) ? "MAIN"
2993 : CvUNIQUE(outside) ? "UNIQUE"
2994 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
2999 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3000 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3001 pname = AvARRAY(pad_name);
3002 ppad = AvARRAY(pad);
3004 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
3005 if (SvPOK(pname[ix]))
3006 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3008 SvFAKE(pname[ix]) ? "FAKE " : "",
3010 (long)I_32(SvNVX(pname[ix])),
3011 (long)SvIVX(pname[ix]));
3014 #endif /* DEBUG_CLOSURES */
3017 cv_clone2(CV *proto, CV *outside)
3022 AV* protopadlist = CvPADLIST(proto);
3023 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3024 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3025 SV** pname = AvARRAY(protopad_name);
3026 SV** ppad = AvARRAY(protopad);
3027 I32 fname = AvFILL(protopad_name);
3028 I32 fpad = AvFILL(protopad);
3032 assert(!CvUNIQUE(proto));
3037 SAVESPTR(comppad_name);
3040 cv = compcv = (CV*)NEWSV(1104,0);
3041 sv_upgrade((SV *)cv, SvTYPE(proto));
3047 New(666, CvMUTEXP(cv), 1, perl_mutex);
3048 MUTEX_INIT(CvMUTEXP(cv));
3050 #endif /* USE_THREADS */
3051 CvFILEGV(cv) = CvFILEGV(proto);
3052 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3053 CvSTASH(cv) = CvSTASH(proto);
3054 CvROOT(cv) = CvROOT(proto);
3055 CvSTART(cv) = CvSTART(proto);
3057 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3060 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3062 comppad_name = newAV();
3063 for (ix = fname; ix >= 0; ix--)
3064 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3068 comppadlist = newAV();
3069 AvREAL_off(comppadlist);
3070 av_store(comppadlist, 0, (SV*)comppad_name);
3071 av_store(comppadlist, 1, (SV*)comppad);
3072 CvPADLIST(cv) = comppadlist;
3073 av_fill(comppad, AvFILL(protopad));
3074 curpad = AvARRAY(comppad);
3076 av = newAV(); /* will be @_ */
3078 av_store(comppad, 0, (SV*)av);
3079 AvFLAGS(av) = AVf_REIFY;
3081 for (ix = fpad; ix > 0; ix--) {
3082 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3083 if (namesv && namesv != &sv_undef) {
3084 char *name = SvPVX(namesv); /* XXX */
3085 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3086 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3087 CvOUTSIDE(cv), cxstack_ix);
3089 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3091 croak("panic: cv_clone: %s", name);
3093 else { /* our own lexical */
3096 /* anon code -- we'll come back for it */
3097 sv = SvREFCNT_inc(ppad[ix]);
3099 else if (*name == '@')
3101 else if (*name == '%')
3111 SV* sv = NEWSV(0,0);
3117 /* Now that vars are all in place, clone nested closures. */
3119 for (ix = fpad; ix > 0; ix--) {
3120 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3122 && namesv != &sv_undef
3123 && !(SvFLAGS(namesv) & SVf_FAKE)
3124 && *SvPVX(namesv) == '&'
3125 && CvCLONE(ppad[ix]))
3127 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3128 SvREFCNT_dec(ppad[ix]);
3131 curpad[ix] = (SV*)kid;
3135 #ifdef DEBUG_CLOSURES
3136 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3138 PerlIO_printf(Perl_debug_log, " from:\n");
3140 PerlIO_printf(Perl_debug_log, " to:\n");
3151 return cv_clone2(proto, CvOUTSIDE(proto));
3155 cv_ckproto(CV *cv, GV *gv, char *p)
3157 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3158 SV* msg = sv_newmortal();
3162 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3163 sv_setpv(msg, "Prototype mismatch:");
3165 sv_catpvf(msg, " sub %_", name);
3167 sv_catpvf(msg, " (%s)", SvPVX(cv));
3168 sv_catpv(msg, " vs ");
3170 sv_catpvf(msg, "(%s)", p);
3172 sv_catpv(msg, "none");
3183 if (!cv || !SvPOK(cv) || SvCUR(cv))
3187 for (o = CvSTART(cv); o; o = o->op_next) {
3188 OPCODE type = o->op_type;
3190 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3192 if (type == OP_LEAVESUB || type == OP_RETURN)
3196 if (type == OP_CONST)
3198 else if (type == OP_PADSV) {
3199 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3200 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3201 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3213 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3216 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3217 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3218 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3227 if (!name || GvCVGEN(gv))
3229 else if (cv = GvCV(gv)) {
3230 cv_ckproto(cv, gv, ps);
3231 /* already defined (or promised)? */
3232 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3235 /* just a "sub foo;" when &foo is already defined */
3239 /* ahem, death to those who redefine active sort subs */
3240 if (curstack == sortstack && sortcop == CvSTART(cv))
3241 croak("Can't redefine active sort subroutine %s", name);
3242 const_sv = cv_const_sv(cv);
3243 if (const_sv || dowarn) {
3244 line_t oldline = curcop->cop_line;
3245 curcop->cop_line = copline;
3246 warn(const_sv ? "Constant subroutine %s redefined"
3247 : "Subroutine %s redefined", name);
3248 curcop->cop_line = oldline;
3254 if (cv) { /* must reuse cv if autoloaded */
3256 CvFLAGS(cv) = CvFLAGS(compcv);
3257 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3258 CvOUTSIDE(compcv) = 0;
3259 CvPADLIST(cv) = CvPADLIST(compcv);
3260 CvPADLIST(compcv) = 0;
3261 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3262 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3263 SvREFCNT_dec(compcv);
3273 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3274 CvFILEGV(cv) = curcop->cop_filegv;
3275 CvSTASH(cv) = curstash;
3278 New(666, CvMUTEXP(cv), 1, perl_mutex);
3279 MUTEX_INIT(CvMUTEXP(cv));
3280 #endif /* USE_THREADS */
3283 sv_setpv((SV*)cv, ps);
3289 char *s = strrchr(name, ':');
3291 if (strEQ(s, "BEGIN")) {
3293 "BEGIN not safe after errors--compilation aborted";
3297 /* force display of errors found but not reported */
3298 sv_catpv(errsv, not_safe);
3299 croak("%s", SvPV(errsv, na));
3310 if (AvFILL(comppad_name) < AvFILL(comppad))
3311 av_store(comppad_name, AvFILL(comppad), Nullsv);
3314 SV **namep = AvARRAY(comppad_name);
3315 for (ix = AvFILL(comppad); ix > 0; ix--) {
3318 if (SvIMMORTAL(curpad[ix]))
3321 * The only things that a clonable function needs in its
3322 * pad are references to outer lexicals and anonymous subs.
3323 * The rest are created anew during cloning.
3325 if (!((namesv = namep[ix]) != Nullsv &&
3326 namesv != &sv_undef &&
3328 *SvPVX(namesv) == '&')))
3330 SvREFCNT_dec(curpad[ix]);
3331 curpad[ix] = Nullsv;
3336 AV *av = newAV(); /* Will be @_ */
3338 av_store(comppad, 0, (SV*)av);
3339 AvFLAGS(av) = AVf_REIFY;
3341 for (ix = AvFILL(comppad); ix > 0; ix--) {
3342 if (SvIMMORTAL(curpad[ix]))
3344 if (!SvPADMY(curpad[ix]))
3345 SvPADTMP_on(curpad[ix]);
3349 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3350 CvSTART(cv) = LINKLIST(CvROOT(cv));
3351 CvROOT(cv)->op_next = 0;
3357 if (PERLDB_SUBLINE && curstash != debstash) {
3358 SV *sv = NEWSV(0,0);
3359 SV *tmpstr = sv_newmortal();
3360 static GV *db_postponed;
3364 sv_setpvf(sv, "%_:%ld-%ld",
3365 GvSV(curcop->cop_filegv),
3366 (long)subline, (long)curcop->cop_line);
3367 gv_efullname3(tmpstr, gv, Nullch);
3368 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3369 if (!db_postponed) {
3370 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3372 hv = GvHVn(db_postponed);
3373 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3374 && (cv = GvCV(db_postponed))) {
3379 perl_call_sv((SV*)cv, G_DISCARD);
3383 if ((s = strrchr(name,':')))
3387 if (strEQ(s, "BEGIN")) {
3388 I32 oldscope = scopestack_ix;
3390 SAVESPTR(compiling.cop_filegv);
3391 SAVEI16(compiling.cop_line);
3398 DEBUG_x( dump_sub(gv) );
3399 av_push(beginav, (SV *)cv);
3401 call_list(oldscope, beginav);
3403 curcop = &compiling;
3406 else if (strEQ(s, "END") && !error_count) {
3409 av_unshift(endav, 1);
3410 av_store(endav, 0, (SV *)cv);
3413 else if (strEQ(s, "INIT") && !error_count) {
3416 av_push(initav, SvREFCNT_inc(cv));
3428 newXSUB(name, ix, subaddr, filename)
3434 CV* cv = newXS(name, (void(*)())subaddr, filename);
3436 CvXSUBANY(cv).any_i32 = ix;
3442 newXS(char *name, void (*subaddr) (CV *), char *filename)
3445 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3448 if (cv = (name ? GvCV(gv) : Nullcv)) {
3450 /* just a cached method */
3454 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3455 /* already defined (or promised) */
3457 line_t oldline = curcop->cop_line;
3458 curcop->cop_line = copline;
3459 warn("Subroutine %s redefined",name);
3460 curcop->cop_line = oldline;
3467 if (cv) /* must reuse cv if autoloaded */
3470 cv = (CV*)NEWSV(1105,0);
3471 sv_upgrade((SV *)cv, SVt_PVCV);
3478 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3480 New(666, CvMUTEXP(cv), 1, perl_mutex);
3481 MUTEX_INIT(CvMUTEXP(cv));
3483 #endif /* USE_THREADS */
3484 CvFILEGV(cv) = gv_fetchfile(filename);
3485 CvXSUB(cv) = subaddr;
3488 char *s = strrchr(name,':');
3493 if (strEQ(s, "BEGIN")) {
3496 av_push(beginav, (SV *)cv);
3499 else if (strEQ(s, "END")) {
3502 av_unshift(endav, 1);
3503 av_store(endav, 0, (SV *)cv);
3506 else if (strEQ(s, "INIT")) {
3509 av_push(initav, (SV *)cv);
3519 newFORM(I32 floor, OP *o, OP *block)
3528 name = SvPVx(cSVOPo->op_sv, na);
3531 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3533 if (cv = GvFORM(gv)) {
3535 line_t oldline = curcop->cop_line;
3537 curcop->cop_line = copline;
3538 warn("Format %s redefined",name);
3539 curcop->cop_line = oldline;
3545 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3546 CvFILEGV(cv) = curcop->cop_filegv;
3548 for (ix = AvFILL(comppad); ix > 0; ix--) {
3549 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3550 SvPADTMP_on(curpad[ix]);
3553 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3554 CvSTART(cv) = LINKLIST(CvROOT(cv));
3555 CvROOT(cv)->op_next = 0;
3565 return newUNOP(OP_REFGEN, 0,
3566 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3572 return newUNOP(OP_REFGEN, 0,
3573 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3577 newANONSUB(I32 floor, OP *proto, OP *block)
3579 return newUNOP(OP_REFGEN, 0,
3580 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3586 switch (o->op_type) {
3588 o->op_type = OP_PADAV;
3589 o->op_ppaddr = ppaddr[OP_PADAV];
3590 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3593 o->op_type = OP_RV2AV;
3594 o->op_ppaddr = ppaddr[OP_RV2AV];
3599 warn("oops: oopsAV");
3608 switch (o->op_type) {
3611 o->op_type = OP_PADHV;
3612 o->op_ppaddr = ppaddr[OP_PADHV];
3613 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3617 o->op_type = OP_RV2HV;
3618 o->op_ppaddr = ppaddr[OP_RV2HV];
3623 warn("oops: oopsHV");
3632 if (o->op_type == OP_PADANY) {
3633 o->op_type = OP_PADAV;
3634 o->op_ppaddr = ppaddr[OP_PADAV];
3637 return newUNOP(OP_RV2AV, 0, scalar(o));
3641 newGVREF(I32 type, OP *o)
3643 if (type == OP_MAPSTART)
3644 return newUNOP(OP_NULL, 0, o);
3645 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3651 if (o->op_type == OP_PADANY) {
3652 o->op_type = OP_PADHV;
3653 o->op_ppaddr = ppaddr[OP_PADHV];
3656 return newUNOP(OP_RV2HV, 0, scalar(o));
3662 croak("NOT IMPL LINE %d",__LINE__);
3668 newCVREF(I32 flags, OP *o)
3670 return newUNOP(OP_RV2CV, flags, scalar(o));
3676 if (o->op_type == OP_PADANY) {
3677 o->op_type = OP_PADSV;
3678 o->op_ppaddr = ppaddr[OP_PADSV];
3681 else if (o->op_type == OP_SPECIFIC)
3683 return newUNOP(OP_RV2SV, 0, scalar(o));
3686 /* Check routines. */
3694 name = NEWSV(1106,0);
3695 sv_upgrade(name, SVt_PVNV);
3696 sv_setpvn(name, "&", 1);
3699 ix = pad_alloc(o->op_type, SVs_PADMY);
3700 av_store(comppad_name, ix, name);
3701 av_store(comppad, ix, cSVOPo->op_sv);
3702 SvPADMY_on(cSVOPo->op_sv);
3703 cSVOPo->op_sv = Nullsv;
3704 cSVOPo->op_targ = ix;
3711 o->op_private = hints;
3718 if (cUNOPo->op_first->op_type == OP_CONCAT)
3719 o->op_flags |= OPf_STACKED;
3726 if (o->op_flags & OPf_KIDS) {
3729 OPCODE type = o->op_type;
3730 o = modkids(ck_fun(o), type);
3731 kid = cUNOPo->op_first;
3732 newop = kUNOP->op_first->op_sibling;
3734 (newop->op_sibling ||
3735 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3736 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3737 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3741 op_free(kUNOP->op_first);
3742 kUNOP->op_first = newop;
3744 o->op_ppaddr = ppaddr[++o->op_type];
3753 if (o->op_flags & OPf_KIDS) {
3754 OP *kid = cUNOPo->op_first;
3755 if (kid->op_type == OP_HSLICE)
3756 o->op_private |= OPpSLICE;
3757 else if (kid->op_type != OP_HELEM)
3758 croak("%s argument is not a HASH element or slice",
3759 op_desc[o->op_type]);
3768 I32 type = o->op_type;
3770 if (o->op_flags & OPf_KIDS) {
3771 if (cLISTOPo->op_first->op_type == OP_STUB) {
3773 o = newUNOP(type, OPf_SPECIAL,
3774 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3784 hints |= HINT_BLOCK_SCOPE;
3785 if (o->op_flags & OPf_KIDS) {
3786 SVOP *kid = (SVOP*)cUNOPo->op_first;
3789 o->op_flags &= ~OPf_KIDS;
3792 else if (kid->op_type == OP_LINESEQ) {
3795 kid->op_next = o->op_next;
3796 cUNOPo->op_first = 0;
3799 Newz(1101, enter, 1, LOGOP);
3800 enter->op_type = OP_ENTERTRY;
3801 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3802 enter->op_private = 0;
3804 /* establish postfix order */
3805 enter->op_next = (OP*)enter;
3807 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3808 o->op_type = OP_LEAVETRY;
3809 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3810 enter->op_other = o;
3816 o = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3818 o->op_targ = (PADOFFSET)hints;
3826 if (o->op_flags & OPf_STACKED) {
3828 kid = cUNOPo->op_first->op_sibling;
3829 if (kid->op_type == OP_RV2GV)
3841 if (o->op_flags & OPf_KIDS) {
3842 OP *kid = cUNOPo->op_first;
3843 if (kid->op_type != OP_HELEM)
3844 croak("%s argument is not a HASH element", op_desc[o->op_type]);
3851 ck_gvconst(register OP *o)
3853 o = fold_constants(o);
3854 if (o->op_type == OP_CONST)
3860 ck_rvconst(register OP *o)
3863 SVOP *kid = (SVOP*)cUNOPo->op_first;
3865 o->op_private |= (hints & HINT_STRICT_REFS);
3866 if (kid->op_type == OP_CONST) {
3871 name = SvPV(kid->op_sv, na);
3872 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3873 char *badthing = Nullch;
3874 switch (o->op_type) {
3876 badthing = "a SCALAR";
3879 badthing = "an ARRAY";
3882 badthing = "a HASH";
3887 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3890 kid->op_type = OP_GV;
3891 iscv = (o->op_type == OP_RV2CV) * 2;
3892 for (gv = 0; !gv; iscv++) {
3894 * This is a little tricky. We only want to add the symbol if we
3895 * didn't add it in the lexer. Otherwise we get duplicate strict
3896 * warnings. But if we didn't add it in the lexer, we must at
3897 * least pretend like we wanted to add it even if it existed before,
3898 * or we get possible typo warnings. OPpCONST_ENTERED says
3899 * whether the lexer already added THIS instance of this symbol.
3901 gv = gv_fetchpv(name,
3902 iscv | !(kid->op_private & OPpCONST_ENTERED),
3905 : o->op_type == OP_RV2SV
3907 : o->op_type == OP_RV2AV
3909 : o->op_type == OP_RV2HV
3913 SvREFCNT_dec(kid->op_sv);
3914 kid->op_sv = SvREFCNT_inc(gv);
3923 I32 type = o->op_type;
3925 if (o->op_flags & OPf_REF)
3928 if (o->op_flags & OPf_KIDS) {
3929 SVOP *kid = (SVOP*)cUNOPo->op_first;
3931 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3932 OP *newop = newGVOP(type, OPf_REF,
3933 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
3940 if (type == OP_FTTTY)
3941 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
3944 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3957 int type = o->op_type;
3958 register I32 oa = opargs[type] >> OASHIFT;
3960 if (o->op_flags & OPf_STACKED) {
3961 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
3964 return no_fh_allowed(o);
3967 if (o->op_flags & OPf_KIDS) {
3968 tokid = &cLISTOPo->op_first;
3969 kid = cLISTOPo->op_first;
3970 if (kid->op_type == OP_PUSHMARK ||
3971 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
3973 tokid = &kid->op_sibling;
3974 kid = kid->op_sibling;
3976 if (!kid && opargs[type] & OA_DEFGV)
3977 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
3981 sibl = kid->op_sibling;
3995 if (kid->op_type == OP_CONST &&
3996 (kid->op_private & OPpCONST_BARE)) {
3997 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
3998 OP *newop = newAVREF(newGVOP(OP_GV, 0,
3999 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4001 warn("Array @%s missing the @ in argument %ld of %s()",
4002 name, (long)numargs, op_desc[type]);
4005 kid->op_sibling = sibl;
4008 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4009 bad_type(numargs, "array", op_desc[o->op_type], kid);
4013 if (kid->op_type == OP_CONST &&
4014 (kid->op_private & OPpCONST_BARE)) {
4015 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4016 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4017 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4019 warn("Hash %%%s missing the %% in argument %ld of %s()",
4020 name, (long)numargs, op_desc[type]);
4023 kid->op_sibling = sibl;
4026 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4027 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4032 OP *newop = newUNOP(OP_NULL, 0, kid);
4033 kid->op_sibling = 0;
4035 newop->op_next = newop;
4037 kid->op_sibling = sibl;
4042 if (kid->op_type != OP_GV) {
4043 if (kid->op_type == OP_CONST &&
4044 (kid->op_private & OPpCONST_BARE)) {
4045 OP *newop = newGVOP(OP_GV, 0,
4046 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4052 kid->op_sibling = 0;
4053 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4055 kid->op_sibling = sibl;
4061 mod(scalar(kid), type);
4065 tokid = &kid->op_sibling;
4066 kid = kid->op_sibling;
4068 o->op_private |= numargs;
4070 return too_many_arguments(o,op_desc[o->op_type]);
4073 else if (opargs[type] & OA_DEFGV) {
4075 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4079 while (oa & OA_OPTIONAL)
4081 if (oa && oa != OA_LIST)
4082 return too_few_arguments(o,op_desc[o->op_type]);
4092 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4093 append_elem(OP_GLOB, o, newSVREF(newGVOP(OP_GV, 0, defgv)));
4095 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4096 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4098 if (gv && GvIMPORTED_CV(gv)) {
4099 static int glob_index;
4101 append_elem(OP_GLOB, o,
4102 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4103 o->op_type = OP_LIST;
4104 o->op_ppaddr = ppaddr[OP_LIST];
4105 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4106 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4107 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4108 append_elem(OP_LIST, o,
4109 scalar(newUNOP(OP_RV2CV, 0,
4110 newGVOP(OP_GV, 0, gv)))));
4111 o = newUNOP(OP_NULL, 0, ck_subr(o));
4112 o->op_targ = OP_GLOB; /* hint at what it used to be */
4115 gv = newGVgen("main");
4117 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4127 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4129 o->op_ppaddr = ppaddr[OP_GREPSTART];
4130 Newz(1101, gwop, 1, LOGOP);
4132 if (o->op_flags & OPf_STACKED) {
4135 kid = cLISTOPo->op_first->op_sibling;
4136 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4139 kid->op_next = (OP*)gwop;
4140 o->op_flags &= ~OPf_STACKED;
4142 kid = cLISTOPo->op_first->op_sibling;
4143 if (type == OP_MAPWHILE)
4150 kid = cLISTOPo->op_first->op_sibling;
4151 if (kid->op_type != OP_NULL)
4152 croak("panic: ck_grep");
4153 kid = kUNOP->op_first;
4155 gwop->op_type = type;
4156 gwop->op_ppaddr = ppaddr[type];
4157 gwop->op_first = listkids(o);
4158 gwop->op_flags |= OPf_KIDS;
4159 gwop->op_private = 1;
4160 gwop->op_other = LINKLIST(kid);
4161 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4162 kid->op_next = (OP*)gwop;
4164 kid = cLISTOPo->op_first->op_sibling;
4165 if (!kid || !kid->op_sibling)
4166 return too_few_arguments(o,op_desc[o->op_type]);
4167 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4168 mod(kid, OP_GREPSTART);
4176 if (o->op_flags & OPf_KIDS) {
4177 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4178 if (kid && kid->op_type == OP_CONST)
4179 fbm_compile(((SVOP*)kid)->op_sv);
4185 ck_lengthconst(OP *o)
4187 /* XXX length optimization goes here */
4194 OPCODE type = o->op_type;
4195 return modkids(ck_fun(o), type);
4201 OPCODE type = o->op_type;
4202 return refkids(ck_fun(o), type);
4210 kid = cLISTOPo->op_first;
4213 kid = cLISTOPo->op_first;
4215 if (kid->op_type == OP_PUSHMARK)
4216 kid = kid->op_sibling;
4217 if (kid && o->op_flags & OPf_STACKED)
4218 kid = kid->op_sibling;
4219 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4220 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4221 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4222 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4223 cLISTOPo->op_first->op_sibling = kid;
4224 cLISTOPo->op_last = kid;
4225 kid = kid->op_sibling;
4230 append_elem(o->op_type, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4236 if (hints & HINT_LOCALE)
4237 o->op_private |= OPpLOCALE;
4244 ck_fun_locale(OP *o)
4250 if (hints & HINT_LOCALE)
4251 o->op_private |= OPpLOCALE;
4262 if (hints & HINT_LOCALE)
4263 o->op_private |= OPpLOCALE;
4272 o->op_private |= OPpRUNTIME;
4285 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4286 o->op_private |= OPpREPEAT_DOLIST;
4287 cBINOPo->op_first = force_list(cBINOPo->op_first);
4297 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4298 SVOP *kid = (SVOP*)cUNOPo->op_first;
4300 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4302 for (s = SvPVX(kid->op_sv); *s; s++) {
4303 if (*s == ':' && s[1] == ':') {
4305 Move(s+2, s+1, strlen(s+2)+1, char);
4306 --SvCUR(kid->op_sv);
4309 sv_catpvn(kid->op_sv, ".pm", 3);
4318 croak("NOT IMPL LINE %d",__LINE__);
4327 if (o->op_flags & OPf_KIDS) {
4328 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4329 if (kid && kid->op_sibling) {
4330 o->op_type = OP_SSELECT;
4331 o->op_ppaddr = ppaddr[OP_SSELECT];
4333 return fold_constants(o);
4337 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4338 if (kid && kid->op_type == OP_RV2GV)
4339 kid->op_private &= ~HINT_STRICT_REFS;
4346 I32 type = o->op_type;
4348 if (!(o->op_flags & OPf_KIDS)) {
4354 argop = newOP(OP_PADAV, OPf_REF);
4355 argop->op_targ = 0; /* curpad[0] is @_ */
4358 argop = newUNOP(OP_RV2AV, 0,
4359 scalar(newGVOP(OP_GV, 0,
4360 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4363 argop = newUNOP(OP_RV2AV, 0,
4364 scalar(newGVOP(OP_GV, 0, subline ?
4365 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4366 #endif /* USE_THREADS */
4367 return newUNOP(type, 0, scalar(argop));
4369 return scalar(modkids(ck_fun(o), type));
4377 if (hints & HINT_LOCALE)
4378 o->op_private |= OPpLOCALE;
4381 if (o->op_flags & OPf_STACKED) {
4382 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4384 kid = kUNOP->op_first; /* get past rv2gv */
4386 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4388 if (kid->op_type == OP_SCOPE) {
4392 else if (kid->op_type == OP_LEAVE) {
4393 if (o->op_type == OP_SORT) {
4394 null(kid); /* wipe out leave */
4397 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4398 if (k->op_next == kid)
4403 kid->op_next = 0; /* just disconnect the leave */
4404 k = kLISTOP->op_first;
4408 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4409 null(kid); /* wipe out rv2gv */
4410 if (o->op_type == OP_SORT)
4414 o->op_flags |= OPf_SPECIAL;
4427 if (o->op_flags & OPf_STACKED)
4428 return no_fh_allowed(o);
4430 kid = cLISTOPo->op_first;
4431 if (kid->op_type != OP_NULL)
4432 croak("panic: ck_split");
4433 kid = kid->op_sibling;
4434 op_free(cLISTOPo->op_first);
4435 cLISTOPo->op_first = kid;
4437 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4438 cLISTOPo->op_last = kid; /* There was only one element previously */
4441 if (kid->op_type != OP_MATCH) {
4442 OP *sibl = kid->op_sibling;
4443 kid->op_sibling = 0;
4444 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4445 if (cLISTOPo->op_first == cLISTOPo->op_last)
4446 cLISTOPo->op_last = kid;
4447 cLISTOPo->op_first = kid;
4448 kid->op_sibling = sibl;
4451 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4452 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4456 kid->op_type = OP_PUSHRE;
4457 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4460 if (!kid->op_sibling)
4461 append_elem(OP_SPLIT, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4463 kid = kid->op_sibling;
4466 if (!kid->op_sibling)
4467 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4469 kid = kid->op_sibling;
4472 if (kid->op_sibling)
4473 return too_many_arguments(o,op_desc[o->op_type]);
4482 OP *prev = ((cUNOPo->op_first->op_sibling)
4483 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4484 OP *o2 = prev->op_sibling;
4492 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4493 if (cvop->op_type == OP_RV2CV) {
4495 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4496 null(cvop); /* disable rv2cv */
4497 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4498 if (tmpop->op_type == OP_GV) {
4499 cv = GvCVu(tmpop->op_sv);
4500 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4501 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4502 proto = SvPV((SV*)cv, na);
4506 o->op_private |= (hints & HINT_STRICT_REFS);
4507 if (PERLDB_SUB && curstash != debstash)
4508 o->op_private |= OPpENTERSUB_DB;
4509 while (o2 != cvop) {
4513 return too_many_arguments(o, gv_ename(namegv));
4531 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4532 bad_type(arg, "block", gv_ename(namegv), o2);
4537 if (o2->op_type == OP_RV2GV)
4541 o2 = newUNOP(OP_RV2GV, 0, kid);
4542 o2->op_sibling = kid->op_sibling;
4543 kid->op_sibling = 0;
4544 prev->op_sibling = o;
4552 if (o2->op_type != OP_RV2GV)
4553 bad_type(arg, "symbol", gv_ename(namegv), o2);
4556 if (o2->op_type != OP_RV2CV)
4557 bad_type(arg, "sub", gv_ename(namegv), o2);
4560 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4561 bad_type(arg, "scalar", gv_ename(namegv), o2);
4564 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4565 bad_type(arg, "array", gv_ename(namegv), o2);
4568 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4569 bad_type(arg, "hash", gv_ename(namegv), o2);
4573 o2 = newUNOP(OP_REFGEN, 0, kid);
4574 o2->op_sibling = kid->op_sibling;
4575 kid->op_sibling = 0;
4576 prev->op_sibling = o2;
4587 croak("Malformed prototype for %s: %s",
4588 gv_ename(namegv), SvPV((SV*)cv, na));
4593 mod(o2, OP_ENTERSUB);
4595 o2 = o2->op_sibling;
4597 if (proto && !optional &&
4598 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4599 return too_few_arguments(o, gv_ename(namegv));
4606 SvREADONLY_on(cSVOPo->op_sv);
4613 if (o->op_flags & OPf_KIDS) {
4614 SVOP *kid = (SVOP*)cUNOPo->op_first;
4616 if (kid->op_type == OP_NULL)
4617 kid = (SVOP*)kid->op_sibling;
4619 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4620 o->op_flags |= OPf_SPECIAL;
4625 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4628 peep(register OP *o)
4631 register OP* oldop = 0;
4632 if (!o || o->op_seq)
4637 for (; o; o = o->op_next) {
4643 switch (o->op_type) {
4646 curcop = ((COP*)o); /* for warnings */
4647 o->op_seq = op_seqmax++;
4658 if (o->op_next->op_type == OP_STRINGIFY)
4660 o->op_seq = op_seqmax++;
4663 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4664 o->op_seq = op_seqmax++;
4665 break; /* Scalar stub must produce undef. List stub is noop */
4669 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4670 curcop = ((COP*)op);
4676 if (oldop && o->op_next) {
4677 oldop->op_next = o->op_next;
4680 o->op_seq = op_seqmax++;
4684 if (o->op_next->op_type == OP_RV2SV) {
4685 if (!(o->op_next->op_private & OPpDEREF)) {
4687 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4688 o->op_next = o->op_next->op_next;
4689 o->op_type = OP_GVSV;
4690 o->op_ppaddr = ppaddr[OP_GVSV];
4693 else if (o->op_next->op_type == OP_RV2AV) {
4694 OP* pop = o->op_next->op_next;
4696 if (pop->op_type == OP_CONST &&
4697 (op = pop->op_next) &&
4698 pop->op_next->op_type == OP_AELEM &&
4699 !(pop->op_next->op_private &
4700 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4701 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4705 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4709 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4710 o->op_next = pop->op_next->op_next;
4711 o->op_type = OP_AELEMFAST;
4712 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4713 o->op_private = (U8)i;
4714 GvAVn(((GVOP*)o)->op_gv);
4717 o->op_seq = op_seqmax++;
4721 if (o->op_next->op_type == OP_RV2AV
4722 && (o->op_next->op_flags && OPf_REF))
4725 o->op_next = o->op_next->op_next;
4730 if (o->op_next->op_type == OP_RV2HV
4731 && (o->op_next->op_flags && OPf_REF))
4734 o->op_next = o->op_next->op_next;
4742 o->op_seq = op_seqmax++;
4743 peep(cLOGOP->op_other);
4747 o->op_seq = op_seqmax++;
4748 peep(cCONDOP->op_true);
4749 peep(cCONDOP->op_false);
4753 o->op_seq = op_seqmax++;
4754 peep(cLOOP->op_redoop);
4755 peep(cLOOP->op_nextop);
4756 peep(cLOOP->op_lastop);
4761 o->op_seq = op_seqmax++;
4762 peep(cPMOP->op_pmreplstart);
4766 o->op_seq = op_seqmax++;
4767 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4768 if (o->op_next->op_sibling &&
4769 o->op_next->op_sibling->op_type != OP_DIE) {
4770 line_t oldline = curcop->cop_line;
4772 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4773 warn("Statement unlikely to be reached");
4774 warn("(Maybe you meant system() when you said exec()?)\n");
4775 curcop->cop_line = oldline;
4789 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4790 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4792 rop = (UNOP*)((BINOP*)o)->op_first;
4793 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4795 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4796 if (!SvOBJECT(lexname))
4798 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4799 if (!fields || !GvHV(*fields))
4801 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4802 key = SvPV(*svp, keylen);
4803 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4805 croak("No such field \"%s\" in variable %s of type %s",
4806 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4808 ind = SvIV(*indsvp);
4810 croak("Bad index while coercing array into hash");
4811 rop->op_type = OP_RV2AV;
4812 rop->op_ppaddr = ppaddr[OP_RV2AV];
4813 o->op_type = OP_AELEM;
4814 o->op_ppaddr = ppaddr[OP_AELEM];
4816 *svp = newSViv(ind);
4821 o->op_seq = op_seqmax++;