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;
503 register OP *kid, *nextkid;
505 if (!o || o->op_seq == (U16)-1)
508 if (o->op_flags & OPf_KIDS) {
509 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
510 nextkid = kid->op_sibling; /* Get before next freeing kid */
515 switch (o->op_type) {
517 o->op_targ = 0; /* Was holding old type, if any. */
520 o->op_targ = 0; /* Was holding hints. */
523 if (!(o->op_flags & OPf_REF) || (check[o->op_type] != ck_ftst))
529 SvREFCNT_dec(cGVOPo->op_gv);
533 Safefree(cCOPo->cop_label);
534 SvREFCNT_dec(cCOPo->cop_filegv);
537 SvREFCNT_dec(cSVOPo->op_sv);
543 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
547 Safefree(cPVOPo->op_pv);
550 op_free(cPMOPo->op_pmreplroot);
554 pregfree(cPMOPo->op_pmregexp);
555 SvREFCNT_dec(cPMOPo->op_pmshort);
560 pad_free(o->op_targ);
568 if (o->op_type != OP_NULL && o->op_targ > 0)
569 pad_free(o->op_targ);
570 o->op_targ = o->op_type;
571 o->op_type = OP_NULL;
572 o->op_ppaddr = ppaddr[OP_NULL];
575 /* Contextualizers */
577 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
587 /* establish postfix order */
588 if (cUNOPo->op_first) {
589 o->op_next = LINKLIST(cUNOPo->op_first);
590 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
592 kid->op_next = LINKLIST(kid->op_sibling);
607 if (o && o->op_flags & OPf_KIDS) {
608 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
618 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
620 line_t oldline = curcop->cop_line;
622 if (copline != NOLINE)
623 curcop->cop_line = copline;
624 warn("Found = in conditional, should be ==");
625 curcop->cop_line = oldline;
635 /* assumes no premature commitment */
636 if (!o || (o->op_flags & OPf_WANT) || error_count
637 || o->op_type == OP_RETURN)
640 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
642 switch (o->op_type) {
644 if (o->op_private & OPpREPEAT_DOLIST)
645 null(((LISTOP*)cBINOPo->op_first)->op_first);
646 scalar(cBINOPo->op_first);
651 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
655 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
656 if (!kPMOP->op_pmreplroot)
657 deprecate("implicit split to @_");
664 if (o->op_flags & OPf_KIDS) {
665 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
671 kid = cLISTOPo->op_first;
673 while (kid = kid->op_sibling) {
679 WITH_THR(curcop = &compiling);
684 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
690 WITH_THR(curcop = &compiling);
703 /* assumes no premature commitment */
704 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
705 || o->op_type == OP_RETURN)
708 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
710 switch (o->op_type) {
712 if (!(opargs[o->op_type] & OA_FOLDCONST))
716 if (o->op_flags & OPf_STACKED)
787 if (!(o->op_private & OPpLVAL_INTRO))
788 useless = op_desc[o->op_type];
795 if (!(o->op_private & OPpLVAL_INTRO) &&
796 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
797 useless = "a variable";
802 WITH_THR(curcop = ((COP*)o)); /* for warning below */
808 useless = "a constant";
809 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
811 else if (SvPOK(sv)) {
812 if (strnEQ(SvPVX(sv), "di", 2) ||
813 strnEQ(SvPVX(sv), "ds", 2) ||
814 strnEQ(SvPVX(sv), "ig", 2))
818 null(o); /* don't execute a constant */
819 SvREFCNT_dec(sv); /* don't even remember it */
823 o->op_type = OP_PREINC; /* pre-increment is faster */
824 o->op_ppaddr = ppaddr[OP_PREINC];
828 o->op_type = OP_PREDEC; /* pre-decrement is faster */
829 o->op_ppaddr = ppaddr[OP_PREDEC];
835 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
840 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
841 WITH_THR(curcop = ((COP*)o)); /* for warning below */
842 if (o->op_flags & OPf_STACKED)
848 if (!(o->op_flags & OPf_KIDS))
857 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
864 /* all requires must return a boolean value */
865 o->op_flags &= ~OPf_WANT;
868 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
869 if (!kPMOP->op_pmreplroot)
870 deprecate("implicit split to @_");
874 if (useless && dowarn)
875 warn("Useless use of %s in void context", useless);
883 if (o && o->op_flags & OPf_KIDS) {
884 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
895 /* assumes no premature commitment */
896 if (!o || (o->op_flags & OPf_WANT) || error_count
897 || o->op_type == OP_RETURN)
900 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
902 switch (o->op_type) {
905 list(cBINOPo->op_first);
910 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
917 if (!(o->op_flags & OPf_KIDS))
919 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
920 list(cBINOPo->op_first);
921 return gen_constant_list(o);
928 kid = cLISTOPo->op_first;
930 while (kid = kid->op_sibling) {
936 WITH_THR(curcop = &compiling);
940 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
946 WITH_THR(curcop = &compiling);
949 /* all requires must return a boolean value */
950 o->op_flags &= ~OPf_WANT;
962 if (o->op_type == OP_LINESEQ ||
963 o->op_type == OP_SCOPE ||
964 o->op_type == OP_LEAVE ||
965 o->op_type == OP_LEAVETRY)
968 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
969 if (kid->op_sibling) {
975 o->op_flags &= ~OPf_PARENS;
976 if (hints & HINT_BLOCK_SCOPE)
977 o->op_flags |= OPf_PARENS;
980 o = newOP(OP_STUB, 0);
985 modkids(OP *o, I32 type)
988 if (o && o->op_flags & OPf_KIDS) {
989 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1004 if (!o || error_count)
1007 switch (o->op_type) {
1012 if (!(o->op_private & (OPpCONST_ARYBASE)))
1014 if (eval_start && eval_start->op_type == OP_CONST) {
1015 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1019 SAVEI32(compiling.cop_arybase);
1020 compiling.cop_arybase = 0;
1022 else if (type == OP_REFGEN)
1025 croak("That use of $[ is unsupported");
1028 if (o->op_flags & OPf_PARENS)
1032 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1033 !(o->op_flags & OPf_STACKED)) {
1034 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1035 o->op_ppaddr = ppaddr[OP_RV2CV];
1036 assert(cUNOPo->op_first->op_type == OP_NULL);
1037 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1043 /* grep, foreach, subcalls, refgen */
1044 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1046 yyerror(form("Can't modify %s in %s",
1047 op_desc[o->op_type],
1048 type ? op_desc[type] : "local"));
1062 case OP_RIGHT_SHIFT:
1071 if (!(o->op_flags & OPf_STACKED))
1077 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1083 if (!type && cUNOPo->op_first->op_type != OP_GV)
1084 croak("Can't localize through a reference");
1085 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1087 return o; /* Treat \(@foo) like ordinary list. */
1091 if (scalar_mod_type(o, type))
1093 ref(cUNOPo->op_first, o->op_type);
1105 if (!type && cUNOPo->op_first->op_type != OP_GV)
1106 croak("Can't localize through a reference");
1107 ref(cUNOPo->op_first, o->op_type);
1119 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1120 return o; /* Treat \(@foo) like ordinary list. */
1121 if (scalar_mod_type(o, type))
1127 croak("Can't localize lexical variable %s",
1128 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1135 if (type != OP_SASSIGN)
1141 pad_free(o->op_targ);
1142 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1143 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1144 if (o->op_flags & OPf_KIDS)
1145 mod(cBINOPo->op_first->op_sibling, type);
1150 ref(cBINOPo->op_first, o->op_type);
1151 if (type == OP_ENTERSUB &&
1152 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1153 o->op_private |= OPpLVAL_DEFER;
1160 if (o->op_flags & OPf_KIDS)
1161 mod(cLISTOPo->op_last, type);
1165 if (!(o->op_flags & OPf_KIDS))
1167 if (o->op_targ != OP_LIST) {
1168 mod(cBINOPo->op_first, type);
1173 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1177 o->op_flags |= OPf_MOD;
1179 if (type == OP_AASSIGN || type == OP_SASSIGN)
1180 o->op_flags |= OPf_SPECIAL|OPf_REF;
1182 o->op_private |= OPpLVAL_INTRO;
1183 o->op_flags &= ~OPf_SPECIAL;
1185 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1186 o->op_flags |= OPf_REF;
1191 scalar_mod_type(OP *o, I32 type)
1195 if (o->op_type == OP_RV2GV)
1219 case OP_RIGHT_SHIFT:
1226 case OP_ANDASSIGN: /* may work later */
1227 case OP_ORASSIGN: /* may work later */
1235 refkids(OP *o, I32 type)
1238 if (o && o->op_flags & OPf_KIDS) {
1239 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1246 ref(OP *o, I32 type)
1250 if (!o || error_count)
1253 switch (o->op_type) {
1255 if ((type == OP_DEFINED || type == OP_LOCK) &&
1256 !(o->op_flags & OPf_STACKED)) {
1257 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1258 o->op_ppaddr = ppaddr[OP_RV2CV];
1259 assert(cUNOPo->op_first->op_type == OP_NULL);
1260 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1261 o->op_flags |= OPf_SPECIAL;
1266 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1270 ref(cUNOPo->op_first, o->op_type);
1273 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1274 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1275 : type == OP_RV2HV ? OPpDEREF_HV
1277 o->op_flags |= OPf_MOD;
1283 o->op_flags |= OPf_REF;
1286 ref(cUNOPo->op_first, o->op_type);
1291 o->op_flags |= OPf_REF;
1296 if (!(o->op_flags & OPf_KIDS))
1298 ref(cBINOPo->op_first, type);
1302 ref(cBINOPo->op_first, o->op_type);
1303 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1304 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1305 : type == OP_RV2HV ? OPpDEREF_HV
1307 o->op_flags |= OPf_MOD;
1315 if (!(o->op_flags & OPf_KIDS))
1317 ref(cLISTOPo->op_last, type);
1332 if (!o || error_count)
1336 if (type == OP_LIST) {
1337 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1340 else if (type != OP_PADSV &&
1343 type != OP_PUSHMARK)
1345 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1348 o->op_flags |= OPf_MOD;
1349 o->op_private |= OPpLVAL_INTRO;
1357 o->op_flags |= OPf_PARENS;
1362 bind_match(I32 type, OP *left, OP *right)
1367 (left->op_type == OP_RV2AV ||
1368 left->op_type == OP_RV2HV ||
1369 left->op_type == OP_PADAV ||
1370 left->op_type == OP_PADHV)) {
1371 char *desc = op_desc[(right->op_type == OP_SUBST ||
1372 right->op_type == OP_TRANS)
1373 ? right->op_type : OP_MATCH];
1374 char *sample = ((left->op_type == OP_RV2AV ||
1375 left->op_type == OP_PADAV)
1376 ? "@array" : "%hash");
1377 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1380 if (right->op_type == OP_MATCH ||
1381 right->op_type == OP_SUBST ||
1382 right->op_type == OP_TRANS) {
1383 right->op_flags |= OPf_STACKED;
1384 if (right->op_type != OP_MATCH)
1385 left = mod(left, right->op_type);
1386 if (right->op_type == OP_TRANS)
1387 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1389 o = prepend_elem(right->op_type, scalar(left), right);
1391 return newUNOP(OP_NOT, 0, scalar(o));
1395 return bind_match(type, left,
1396 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1404 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1405 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1412 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1413 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1414 o->op_type = OP_LEAVE;
1415 o->op_ppaddr = ppaddr[OP_LEAVE];
1418 if (o->op_type == OP_LINESEQ) {
1420 o->op_type = OP_SCOPE;
1421 o->op_ppaddr = ppaddr[OP_SCOPE];
1422 kid = ((LISTOP*)o)->op_first;
1423 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1424 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1429 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1436 block_start(int full)
1439 int retval = savestack_ix;
1440 SAVEI32(comppad_name_floor);
1442 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1443 comppad_name_floor = comppad_name_fill;
1445 comppad_name_floor = 0;
1447 SAVEI32(min_intro_pending);
1448 SAVEI32(max_intro_pending);
1449 min_intro_pending = 0;
1450 SAVEI32(comppad_name_fill);
1451 SAVEI32(padix_floor);
1452 padix_floor = padix;
1453 pad_reset_pending = FALSE;
1455 hints &= ~HINT_BLOCK_SCOPE;
1460 block_end(I32 floor, OP *seq)
1463 int needblockscope = hints & HINT_BLOCK_SCOPE;
1464 OP* retval = scalarseq(seq);
1466 pad_reset_pending = FALSE;
1468 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1469 pad_leavemy(comppad_name_fill);
1479 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1480 eval_start = linklist(eval_root);
1481 eval_root->op_next = 0;
1487 main_root = scope(sawparens(scalarvoid(o)));
1488 curcop = &compiling;
1489 main_start = LINKLIST(main_root);
1490 main_root->op_next = 0;
1494 /* Register with debugger */
1496 CV *cv = perl_get_cv("DB::postponed", FALSE);
1500 XPUSHs((SV*)compiling.cop_filegv);
1502 perl_call_sv((SV*)cv, G_DISCARD);
1509 localize(OP *o, I32 lex)
1511 if (o->op_flags & OPf_PARENS)
1515 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1517 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1518 if (*s == ';' || *s == '=')
1519 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1523 in_my_stash = Nullhv;
1527 return mod(o, OP_NULL); /* a bit kludgey */
1533 if (o->op_type == OP_LIST) {
1534 o = convert(OP_JOIN, 0,
1535 prepend_elem(OP_LIST,
1536 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1543 fold_constants(register OP *o)
1547 I32 type = o->op_type;
1550 if (opargs[type] & OA_RETSCALAR)
1552 if (opargs[type] & OA_TARGET)
1553 o->op_targ = pad_alloc(type, SVs_PADTMP);
1555 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1556 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1558 if (!(opargs[type] & OA_FOLDCONST))
1567 if (o->op_private & OPpLOCALE)
1572 goto nope; /* Don't try to run w/ errors */
1574 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1575 if (curop->op_type != OP_CONST &&
1576 curop->op_type != OP_LIST &&
1577 curop->op_type != OP_SCALAR &&
1578 curop->op_type != OP_NULL &&
1579 curop->op_type != OP_PUSHMARK) {
1584 curop = LINKLIST(o);
1589 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1590 pad_swipe(o->op_targ);
1591 else if (SvTEMP(sv)) { /* grab mortal temp? */
1592 (void)SvREFCNT_inc(sv);
1596 if (type == OP_RV2GV)
1597 return newGVOP(OP_GV, 0, (GV*)sv);
1599 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1601 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1606 SvIOK_off(sv); /* undo SvIV() damage */
1608 return newSVOP(OP_CONST, 0, sv);
1612 if (!(opargs[type] & OA_OTHERINT))
1615 if (!(hints & HINT_INTEGER)) {
1616 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1619 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1620 if (curop->op_type == OP_CONST) {
1621 if (SvIOK(((SVOP*)curop)->op_sv))
1625 if (opargs[curop->op_type] & OA_RETINTEGER)
1629 o->op_ppaddr = ppaddr[++(o->op_type)];
1636 gen_constant_list(register OP *o)
1640 I32 oldtmps_floor = tmps_floor;
1644 return o; /* Don't attempt to run with errors */
1646 op = curop = LINKLIST(o);
1652 tmps_floor = oldtmps_floor;
1654 o->op_type = OP_RV2AV;
1655 o->op_ppaddr = ppaddr[OP_RV2AV];
1656 curop = ((UNOP*)o)->op_first;
1657 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1664 convert(I32 type, I32 flags, OP *o)
1669 if (!o || o->op_type != OP_LIST)
1670 o = newLISTOP(OP_LIST, 0, o, Nullop);
1672 o->op_flags &= ~OPf_WANT;
1674 if (!(opargs[type] & OA_MARK))
1675 null(cLISTOPo->op_first);
1678 o->op_ppaddr = ppaddr[type];
1679 o->op_flags |= flags;
1681 o = CHECKOP(type, o);
1682 if (o->op_type != type)
1685 if (cLISTOPo->op_children < 7) {
1686 /* XXX do we really need to do this if we're done appending?? */
1687 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1689 cLISTOPo->op_last = last; /* in case check substituted last arg */
1692 return fold_constants(o);
1695 /* List constructors */
1698 append_elem(I32 type, OP *first, OP *last)
1706 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1707 return newLISTOP(type, 0, first, last);
1709 if (first->op_flags & OPf_KIDS)
1710 ((LISTOP*)first)->op_last->op_sibling = last;
1712 first->op_flags |= OPf_KIDS;
1713 ((LISTOP*)first)->op_first = last;
1715 ((LISTOP*)first)->op_last = last;
1716 ((LISTOP*)first)->op_children++;
1721 append_list(I32 type, LISTOP *first, LISTOP *last)
1729 if (first->op_type != type)
1730 return prepend_elem(type, (OP*)first, (OP*)last);
1732 if (last->op_type != type)
1733 return append_elem(type, (OP*)first, (OP*)last);
1735 first->op_last->op_sibling = last->op_first;
1736 first->op_last = last->op_last;
1737 first->op_children += last->op_children;
1738 if (first->op_children)
1739 last->op_flags |= OPf_KIDS;
1746 prepend_elem(I32 type, OP *first, OP *last)
1754 if (last->op_type == type) {
1755 if (type == OP_LIST) { /* already a PUSHMARK there */
1756 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1757 ((LISTOP*)last)->op_first->op_sibling = first;
1760 if (!(last->op_flags & OPf_KIDS)) {
1761 ((LISTOP*)last)->op_last = first;
1762 last->op_flags |= OPf_KIDS;
1764 first->op_sibling = ((LISTOP*)last)->op_first;
1765 ((LISTOP*)last)->op_first = first;
1767 ((LISTOP*)last)->op_children++;
1771 return newLISTOP(type, 0, first, last);
1779 return newOP(OP_STUB, 0);
1785 if (!o || o->op_type != OP_LIST)
1786 o = newLISTOP(OP_LIST, 0, o, Nullop);
1792 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1796 Newz(1101, listop, 1, LISTOP);
1798 listop->op_type = type;
1799 listop->op_ppaddr = ppaddr[type];
1800 listop->op_children = (first != 0) + (last != 0);
1801 listop->op_flags = flags;
1805 else if (!first && last)
1808 first->op_sibling = last;
1809 listop->op_first = first;
1810 listop->op_last = last;
1811 if (type == OP_LIST) {
1813 pushop = newOP(OP_PUSHMARK, 0);
1814 pushop->op_sibling = first;
1815 listop->op_first = pushop;
1816 listop->op_flags |= OPf_KIDS;
1818 listop->op_last = pushop;
1820 else if (listop->op_children)
1821 listop->op_flags |= OPf_KIDS;
1827 newOP(I32 type, I32 flags)
1830 Newz(1101, o, 1, OP);
1832 o->op_ppaddr = ppaddr[type];
1833 o->op_flags = flags;
1836 o->op_private = 0 + (flags >> 8);
1837 if (opargs[type] & OA_RETSCALAR)
1839 if (opargs[type] & OA_TARGET)
1840 o->op_targ = pad_alloc(type, SVs_PADTMP);
1841 return CHECKOP(type, o);
1845 newUNOP(I32 type, I32 flags, OP *first)
1850 first = newOP(OP_STUB, 0);
1851 if (opargs[type] & OA_MARK)
1852 first = force_list(first);
1854 Newz(1101, unop, 1, UNOP);
1855 unop->op_type = type;
1856 unop->op_ppaddr = ppaddr[type];
1857 unop->op_first = first;
1858 unop->op_flags = flags | OPf_KIDS;
1859 unop->op_private = 1 | (flags >> 8);
1861 unop = (UNOP*) CHECKOP(type, unop);
1865 return fold_constants((OP *) unop);
1869 newBINOP(I32 type, I32 flags, OP *first, OP *last)
1872 Newz(1101, binop, 1, BINOP);
1875 first = newOP(OP_NULL, 0);
1877 binop->op_type = type;
1878 binop->op_ppaddr = ppaddr[type];
1879 binop->op_first = first;
1880 binop->op_flags = flags | OPf_KIDS;
1883 binop->op_private = 1 | (flags >> 8);
1886 binop->op_private = 2 | (flags >> 8);
1887 first->op_sibling = last;
1890 binop = (BINOP*)CHECKOP(type, binop);
1894 binop->op_last = last = binop->op_first->op_sibling;
1896 return fold_constants((OP *)binop);
1900 pmtrans(OP *o, OP *expr, OP *repl)
1902 SV *tstr = ((SVOP*)expr)->op_sv;
1903 SV *rstr = ((SVOP*)repl)->op_sv;
1906 register U8 *t = (U8*)SvPV(tstr, tlen);
1907 register U8 *r = (U8*)SvPV(rstr, rlen);
1912 register short *tbl;
1914 tbl = (short*)cPVOPo->op_pv;
1915 complement = o->op_private & OPpTRANS_COMPLEMENT;
1916 Delete = o->op_private & OPpTRANS_DELETE;
1917 /* squash = o->op_private & OPpTRANS_SQUASH; */
1920 Zero(tbl, 256, short);
1921 for (i = 0; i < tlen; i++)
1923 for (i = 0, j = 0; i < 256; i++) {
1939 if (!rlen && !Delete) {
1942 for (i = 0; i < 256; i++)
1944 for (i = 0, j = 0; i < tlen; i++,j++) {
1947 if (tbl[t[i]] == -1)
1953 if (tbl[t[i]] == -1)
1964 newPMOP(I32 type, I32 flags)
1969 Newz(1101, pmop, 1, PMOP);
1970 pmop->op_type = type;
1971 pmop->op_ppaddr = ppaddr[type];
1972 pmop->op_flags = flags;
1973 pmop->op_private = 0 | (flags >> 8);
1975 if (hints & HINT_LOCALE)
1976 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
1978 /* link into pm list */
1979 if (type != OP_TRANS && curstash) {
1980 pmop->op_pmnext = HvPMROOT(curstash);
1981 HvPMROOT(curstash) = pmop;
1988 pmruntime(OP *o, OP *expr, OP *repl)
1993 if (o->op_type == OP_TRANS)
1994 return pmtrans(o, expr, repl);
1996 hints |= HINT_BLOCK_SCOPE;
1999 if (expr->op_type == OP_CONST) {
2001 SV *pat = ((SVOP*)expr)->op_sv;
2002 char *p = SvPV(pat, plen);
2003 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2004 sv_setpvn(pat, "\\s+", 3);
2005 p = SvPV(pat, plen);
2006 pm->op_pmflags |= PMf_SKIPWHITE;
2008 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2009 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2010 pm->op_pmflags |= PMf_WHITE;
2015 if (pm->op_pmflags & PMf_KEEP)
2016 expr = newUNOP(OP_REGCMAYBE,0,expr);
2018 Newz(1101, rcop, 1, LOGOP);
2019 rcop->op_type = OP_REGCOMP;
2020 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2021 rcop->op_first = scalar(expr);
2022 rcop->op_flags |= OPf_KIDS;
2023 rcop->op_private = 1;
2026 /* establish postfix order */
2027 if (pm->op_pmflags & PMf_KEEP) {
2029 rcop->op_next = expr;
2030 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2033 rcop->op_next = LINKLIST(expr);
2034 expr->op_next = (OP*)rcop;
2037 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2042 if (pm->op_pmflags & PMf_EVAL)
2044 else if (repl->op_type == OP_CONST)
2048 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2049 if (opargs[curop->op_type] & OA_DANGEROUS) {
2050 if (curop->op_type == OP_GV) {
2051 GV *gv = ((GVOP*)curop)->op_gv;
2052 if (strchr("&`'123456789+", *GvENAME(gv)))
2055 else if (curop->op_type == OP_RV2CV)
2057 else if (curop->op_type == OP_RV2SV ||
2058 curop->op_type == OP_RV2AV ||
2059 curop->op_type == OP_RV2HV ||
2060 curop->op_type == OP_RV2GV) {
2061 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2064 else if (curop->op_type == OP_PADSV ||
2065 curop->op_type == OP_PADAV ||
2066 curop->op_type == OP_PADHV ||
2067 curop->op_type == OP_PADANY) {
2076 if (curop == repl) {
2077 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2078 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2079 prepend_elem(o->op_type, scalar(repl), o);
2082 Newz(1101, rcop, 1, LOGOP);
2083 rcop->op_type = OP_SUBSTCONT;
2084 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2085 rcop->op_first = scalar(repl);
2086 rcop->op_flags |= OPf_KIDS;
2087 rcop->op_private = 1;
2090 /* establish postfix order */
2091 rcop->op_next = LINKLIST(repl);
2092 repl->op_next = (OP*)rcop;
2094 pm->op_pmreplroot = scalar((OP*)rcop);
2095 pm->op_pmreplstart = LINKLIST(rcop);
2104 newSVOP(I32 type, I32 flags, SV *sv)
2107 Newz(1101, svop, 1, SVOP);
2108 svop->op_type = type;
2109 svop->op_ppaddr = ppaddr[type];
2111 svop->op_next = (OP*)svop;
2112 svop->op_flags = flags;
2113 if (opargs[type] & OA_RETSCALAR)
2115 if (opargs[type] & OA_TARGET)
2116 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2117 return CHECKOP(type, svop);
2121 newGVOP(I32 type, I32 flags, GV *gv)
2125 Newz(1101, gvop, 1, GVOP);
2126 gvop->op_type = type;
2127 gvop->op_ppaddr = ppaddr[type];
2128 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2129 gvop->op_next = (OP*)gvop;
2130 gvop->op_flags = flags;
2131 if (opargs[type] & OA_RETSCALAR)
2133 if (opargs[type] & OA_TARGET)
2134 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2135 return CHECKOP(type, gvop);
2139 newPVOP(I32 type, I32 flags, char *pv)
2142 Newz(1101, pvop, 1, PVOP);
2143 pvop->op_type = type;
2144 pvop->op_ppaddr = ppaddr[type];
2146 pvop->op_next = (OP*)pvop;
2147 pvop->op_flags = flags;
2148 if (opargs[type] & OA_RETSCALAR)
2150 if (opargs[type] & OA_TARGET)
2151 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2152 return CHECKOP(type, pvop);
2161 save_hptr(&curstash);
2162 save_item(curstname);
2167 name = SvPV(sv, len);
2168 curstash = gv_stashpvn(name,len,TRUE);
2169 sv_setpvn(curstname, name, len);
2173 sv_setpv(curstname,"<none>");
2181 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2189 if (id->op_type != OP_CONST)
2190 croak("Module name must be constant");
2194 if(version != Nullop) {
2195 SV *vesv = ((SVOP*)version)->op_sv;
2197 if (arg == Nullop && !SvNIOK(vesv)) {
2204 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2205 croak("Version number must be constant number");
2207 /* Make copy of id so we don't free it twice */
2208 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2210 /* Fake up a method call to VERSION */
2211 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2212 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2213 append_elem(OP_LIST,
2214 prepend_elem(OP_LIST, pack, list(version)),
2215 newUNOP(OP_METHOD, 0, meth)));
2219 /* Fake up an import/unimport */
2220 if (arg && arg->op_type == OP_STUB)
2221 imop = arg; /* no import on explicit () */
2222 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2223 imop = Nullop; /* use 5.0; */
2226 /* Make copy of id so we don't free it twice */
2227 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2228 meth = newSVOP(OP_CONST, 0,
2230 ? newSVpv("import", 6)
2231 : newSVpv("unimport", 8)
2233 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2234 append_elem(OP_LIST,
2235 prepend_elem(OP_LIST, pack, list(arg)),
2236 newUNOP(OP_METHOD, 0, meth)));
2239 /* Fake up a require */
2240 rqop = newUNOP(OP_REQUIRE, 0, id);
2242 /* Fake up the BEGIN {}, which does its thing immediately. */
2244 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2246 append_elem(OP_LINESEQ,
2247 append_elem(OP_LINESEQ,
2248 newSTATEOP(0, Nullch, rqop),
2249 newSTATEOP(0, Nullch, veop)),
2250 newSTATEOP(0, Nullch, imop) ));
2257 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2259 return newBINOP(OP_LSLICE, flags,
2260 list(force_list(subscript)),
2261 list(force_list(listval)) );
2265 list_assignment(register OP *o)
2270 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2271 o = cUNOPo->op_first;
2273 if (o->op_type == OP_COND_EXPR) {
2274 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2275 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2280 yyerror("Assignment to both a list and a scalar");
2284 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2285 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2286 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2289 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2292 if (o->op_type == OP_RV2SV)
2299 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2304 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2305 return newLOGOP(optype, 0,
2306 mod(scalar(left), optype),
2307 newUNOP(OP_SASSIGN, 0, scalar(right)));
2310 return newBINOP(optype, OPf_STACKED,
2311 mod(scalar(left), optype), scalar(right));
2315 if (list_assignment(left)) {
2317 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2318 left = mod(left, OP_AASSIGN);
2326 o = newBINOP(OP_AASSIGN, flags,
2327 list(force_list(right)),
2328 list(force_list(left)) );
2329 o->op_private = 0 | (flags >> 8);
2330 if (!(left->op_private & OPpLVAL_INTRO)) {
2331 static int generation = 100;
2335 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2336 if (opargs[curop->op_type] & OA_DANGEROUS) {
2337 if (curop->op_type == OP_GV) {
2338 GV *gv = ((GVOP*)curop)->op_gv;
2339 if (gv == defgv || SvCUR(gv) == generation)
2341 SvCUR(gv) = generation;
2343 else if (curop->op_type == OP_PADSV ||
2344 curop->op_type == OP_PADAV ||
2345 curop->op_type == OP_PADHV ||
2346 curop->op_type == OP_PADANY) {
2347 SV **svp = AvARRAY(comppad_name);
2348 SV *sv = svp[curop->op_targ];
2349 if (SvCUR(sv) == generation)
2351 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2353 else if (curop->op_type == OP_RV2CV)
2355 else if (curop->op_type == OP_RV2SV ||
2356 curop->op_type == OP_RV2AV ||
2357 curop->op_type == OP_RV2HV ||
2358 curop->op_type == OP_RV2GV) {
2359 if (lastop->op_type != OP_GV) /* funny deref? */
2368 o->op_private = OPpASSIGN_COMMON;
2370 if (right && right->op_type == OP_SPLIT) {
2372 if ((tmpop = ((LISTOP*)right)->op_first) &&
2373 tmpop->op_type == OP_PUSHRE)
2375 PMOP *pm = (PMOP*)tmpop;
2376 if (left->op_type == OP_RV2AV &&
2377 !(left->op_private & OPpLVAL_INTRO) &&
2378 !(o->op_private & OPpASSIGN_COMMON) )
2380 tmpop = ((UNOP*)left)->op_first;
2381 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2382 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2383 pm->op_pmflags |= PMf_ONCE;
2384 tmpop = cUNOPo->op_first; /* to list (nulled) */
2385 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2386 tmpop->op_sibling = Nullop; /* don't free split */
2387 right->op_next = tmpop->op_next; /* fix starting loc */
2388 op_free(o); /* blow off assign */
2389 right->op_flags &= ~OPf_WANT;
2390 /* "I don't know and I don't care." */
2395 if (modcount < 10000 &&
2396 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2398 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2400 sv_setiv(sv, modcount+1);
2408 right = newOP(OP_UNDEF, 0);
2409 if (right->op_type == OP_READLINE) {
2410 right->op_flags |= OPf_STACKED;
2411 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2414 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2415 o = newBINOP(OP_SASSIGN, flags,
2416 scalar(right), mod(scalar(left), OP_SASSIGN) );
2428 newSTATEOP(I32 flags, char *label, OP *o)
2431 U32 seq = intro_my();
2434 Newz(1101, cop, 1, COP);
2435 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2436 cop->op_type = OP_DBSTATE;
2437 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2440 cop->op_type = OP_NEXTSTATE;
2441 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2443 cop->op_flags = flags;
2444 cop->op_private = 0 | (flags >> 8);
2446 cop->op_private |= NATIVE_HINTS;
2448 cop->op_next = (OP*)cop;
2451 cop->cop_label = label;
2452 hints |= HINT_BLOCK_SCOPE;
2455 cop->cop_arybase = curcop->cop_arybase;
2457 if (copline == NOLINE)
2458 cop->cop_line = curcop->cop_line;
2460 cop->cop_line = copline;
2463 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2464 cop->cop_stash = curstash;
2466 if (PERLDB_LINE && curstash != debstash) {
2467 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2468 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2469 (void)SvIOK_on(*svp);
2471 SvSTASH(*svp) = (HV*)cop;
2475 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2478 /* "Introduce" my variables to visible status. */
2486 if (! min_intro_pending)
2489 svp = AvARRAY(comppad_name);
2490 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2491 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2492 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2493 SvNVX(sv) = (double)cop_seqmax;
2496 min_intro_pending = 0;
2497 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2498 return cop_seqmax++;
2502 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2508 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2509 return newBINOP(type, flags, scalar(first), scalar(other));
2511 scalarboolean(first);
2512 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2513 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2514 if (type == OP_AND || type == OP_OR) {
2520 first = cUNOPo->op_first;
2522 first->op_next = o->op_next;
2523 cUNOPo->op_first = Nullop;
2527 if (first->op_type == OP_CONST) {
2528 if (dowarn && (first->op_private & OPpCONST_BARE))
2529 warn("Probable precedence problem on %s", op_desc[type]);
2530 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2539 else if (first->op_type == OP_WANTARRAY) {
2545 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2546 OP *k1 = ((UNOP*)first)->op_first;
2547 OP *k2 = k1->op_sibling;
2549 switch (first->op_type)
2552 if (k2 && k2->op_type == OP_READLINE
2553 && (k2->op_flags & OPf_STACKED)
2554 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2555 warnop = k2->op_type;
2559 if (k1->op_type == OP_READDIR
2560 || k1->op_type == OP_GLOB
2561 || k1->op_type == OP_EACH)
2562 warnop = k1->op_type;
2566 line_t oldline = curcop->cop_line;
2567 curcop->cop_line = copline;
2568 warn("Value of %s%s can be \"0\"; test with defined()",
2570 ((warnop == OP_READLINE || warnop == OP_GLOB)
2571 ? " construct" : "() operator"));
2572 curcop->cop_line = oldline;
2579 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2580 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2582 Newz(1101, logop, 1, LOGOP);
2584 logop->op_type = type;
2585 logop->op_ppaddr = ppaddr[type];
2586 logop->op_first = first;
2587 logop->op_flags = flags | OPf_KIDS;
2588 logop->op_other = LINKLIST(other);
2589 logop->op_private = 1 | (flags >> 8);
2591 /* establish postfix order */
2592 logop->op_next = LINKLIST(first);
2593 first->op_next = (OP*)logop;
2594 first->op_sibling = other;
2596 o = newUNOP(OP_NULL, 0, (OP*)logop);
2603 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2610 return newLOGOP(OP_AND, 0, first, trueop);
2612 return newLOGOP(OP_OR, 0, first, falseop);
2614 scalarboolean(first);
2615 if (first->op_type == OP_CONST) {
2616 if (SvTRUE(((SVOP*)first)->op_sv)) {
2627 else if (first->op_type == OP_WANTARRAY) {
2631 Newz(1101, condop, 1, CONDOP);
2633 condop->op_type = OP_COND_EXPR;
2634 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2635 condop->op_first = first;
2636 condop->op_flags = flags | OPf_KIDS;
2637 condop->op_true = LINKLIST(trueop);
2638 condop->op_false = LINKLIST(falseop);
2639 condop->op_private = 1 | (flags >> 8);
2641 /* establish postfix order */
2642 condop->op_next = LINKLIST(first);
2643 first->op_next = (OP*)condop;
2645 first->op_sibling = trueop;
2646 trueop->op_sibling = falseop;
2647 o = newUNOP(OP_NULL, 0, (OP*)condop);
2649 trueop->op_next = o;
2650 falseop->op_next = o;
2656 newRANGE(I32 flags, OP *left, OP *right)
2664 Newz(1101, condop, 1, CONDOP);
2666 condop->op_type = OP_RANGE;
2667 condop->op_ppaddr = ppaddr[OP_RANGE];
2668 condop->op_first = left;
2669 condop->op_flags = OPf_KIDS;
2670 condop->op_true = LINKLIST(left);
2671 condop->op_false = LINKLIST(right);
2672 condop->op_private = 1 | (flags >> 8);
2674 left->op_sibling = right;
2676 condop->op_next = (OP*)condop;
2677 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2678 flop = newUNOP(OP_FLOP, 0, flip);
2679 o = newUNOP(OP_NULL, 0, flop);
2682 left->op_next = flip;
2683 right->op_next = flop;
2685 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2686 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2687 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2688 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2690 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2691 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2694 if (!flip->op_private || !flop->op_private)
2695 linklist(o); /* blow off optimizer unless constant */
2701 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2706 int once = block && block->op_flags & OPf_SPECIAL &&
2707 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2710 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2711 return block; /* do {} while 0 does once */
2712 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2713 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2714 expr = newUNOP(OP_DEFINED, 0,
2715 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2719 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2720 o = newLOGOP(OP_AND, 0, expr, listop);
2722 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2724 if (once && o != listop)
2725 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2728 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2730 o->op_flags |= flags;
2732 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2737 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2746 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2747 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2748 expr = newUNOP(OP_DEFINED, 0,
2749 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2753 block = newOP(OP_NULL, 0);
2756 next = LINKLIST(cont);
2758 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2759 if ((line_t)whileline != NOLINE) {
2760 copline = whileline;
2761 cont = append_elem(OP_LINESEQ, cont,
2762 newSTATEOP(0, Nullch, Nullop));
2766 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2767 redo = LINKLIST(listop);
2770 o = newLOGOP(OP_AND, 0, expr, scalar(listop));
2771 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2772 op_free(expr); /* oops, it's a while (0) */
2774 return Nullop; /* (listop already freed by newLOGOP) */
2776 ((LISTOP*)listop)->op_last->op_next = condop =
2777 (o == listop ? redo : LINKLIST(o));
2785 Newz(1101,loop,1,LOOP);
2786 loop->op_type = OP_ENTERLOOP;
2787 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2788 loop->op_private = 0;
2789 loop->op_next = (OP*)loop;
2792 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2794 loop->op_redoop = redo;
2795 loop->op_lastop = o;
2798 loop->op_nextop = next;
2800 loop->op_nextop = o;
2802 o->op_flags |= flags;
2803 o->op_private |= (flags >> 8);
2808 #ifndef CAN_PROTOTYPE
2809 newFOROP(flags,label,forline,sv,expr,block,cont)
2818 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2819 #endif /* CAN_PROTOTYPE */
2827 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2828 sv->op_type = OP_RV2GV;
2829 sv->op_ppaddr = ppaddr[OP_RV2GV];
2831 else if (sv->op_type == OP_PADSV) { /* private variable */
2832 padoff = sv->op_targ;
2837 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2840 sv = newGVOP(OP_GV, 0, defgv);
2842 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2843 expr = scalar(ref(expr, OP_ITER));
2844 iterflags |= OPf_STACKED;
2846 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2847 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2849 assert(!loop->op_next);
2850 Renew(loop, 1, LOOP);
2851 loop->op_targ = padoff;
2852 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
2854 return newSTATEOP(0, label, wop);
2858 newLOOPEX(I32 type, OP *label)
2862 if (type != OP_GOTO || label->op_type == OP_CONST) {
2863 o = newPVOP(type, 0, savepv(
2864 label->op_type == OP_CONST
2865 ? SvPVx(((SVOP*)label)->op_sv, na)
2870 if (label->op_type == OP_ENTERSUB)
2871 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2872 o = newUNOP(type, OPf_STACKED, label);
2874 hints |= HINT_BLOCK_SCOPE;
2884 MUTEX_DESTROY(CvMUTEXP(cv));
2885 Safefree(CvMUTEXP(cv));
2888 #endif /* USE_THREADS */
2890 if (!CvXSUB(cv) && CvROOT(cv)) {
2892 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
2893 croak("Can't undef active subroutine");
2896 croak("Can't undef active subroutine");
2897 #endif /* USE_THREADS */
2904 op_free(CvROOT(cv));
2905 CvROOT(cv) = Nullop;
2908 SvPOK_off((SV*)cv); /* forget prototype */
2910 SvREFCNT_dec(CvGV(cv));
2912 SvREFCNT_dec(CvOUTSIDE(cv));
2913 CvOUTSIDE(cv) = Nullcv;
2914 if (CvPADLIST(cv)) {
2915 /* may be during global destruction */
2916 if (SvREFCNT(CvPADLIST(cv))) {
2917 I32 i = AvFILL(CvPADLIST(cv));
2919 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
2920 SV* sv = svp ? *svp : Nullsv;
2923 if (sv == (SV*)comppad_name)
2924 comppad_name = Nullav;
2925 else if (sv == (SV*)comppad) {
2927 curpad = Null(SV**);
2931 SvREFCNT_dec((SV*)CvPADLIST(cv));
2933 CvPADLIST(cv) = Nullav;
2937 #ifdef DEBUG_CLOSURES
2942 CV *outside = CvOUTSIDE(cv);
2943 AV* padlist = CvPADLIST(cv);
2950 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
2952 (CvANON(cv) ? "ANON"
2953 : (cv == main_cv) ? "MAIN"
2954 : CvUNIQUE(outside) ? "UNIQUE"
2955 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
2958 : CvANON(outside) ? "ANON"
2959 : (outside == main_cv) ? "MAIN"
2960 : CvUNIQUE(outside) ? "UNIQUE"
2961 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
2966 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
2967 pad = (AV*)*av_fetch(padlist, 1, FALSE);
2968 pname = AvARRAY(pad_name);
2969 ppad = AvARRAY(pad);
2971 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
2972 if (SvPOK(pname[ix]))
2973 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
2975 SvFAKE(pname[ix]) ? "FAKE " : "",
2977 (long)I_32(SvNVX(pname[ix])),
2978 (long)SvIVX(pname[ix]));
2981 #endif /* DEBUG_CLOSURES */
2984 cv_clone2(CV *proto, CV *outside)
2989 AV* protopadlist = CvPADLIST(proto);
2990 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
2991 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
2992 SV** pname = AvARRAY(protopad_name);
2993 SV** ppad = AvARRAY(protopad);
2994 I32 fname = AvFILL(protopad_name);
2995 I32 fpad = AvFILL(protopad);
2999 assert(!CvUNIQUE(proto));
3004 SAVESPTR(comppad_name);
3007 cv = compcv = (CV*)NEWSV(1104,0);
3008 sv_upgrade((SV *)cv, SvTYPE(proto));
3014 New(666, CvMUTEXP(cv), 1, perl_mutex);
3015 MUTEX_INIT(CvMUTEXP(cv));
3017 #endif /* USE_THREADS */
3018 CvFILEGV(cv) = CvFILEGV(proto);
3019 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3020 CvSTASH(cv) = CvSTASH(proto);
3021 CvROOT(cv) = CvROOT(proto);
3022 CvSTART(cv) = CvSTART(proto);
3024 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3027 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3029 comppad_name = newAV();
3030 for (ix = fname; ix >= 0; ix--)
3031 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3035 comppadlist = newAV();
3036 AvREAL_off(comppadlist);
3037 av_store(comppadlist, 0, (SV*)comppad_name);
3038 av_store(comppadlist, 1, (SV*)comppad);
3039 CvPADLIST(cv) = comppadlist;
3040 av_fill(comppad, AvFILL(protopad));
3041 curpad = AvARRAY(comppad);
3043 av = newAV(); /* will be @_ */
3045 av_store(comppad, 0, (SV*)av);
3046 AvFLAGS(av) = AVf_REIFY;
3048 for (ix = fpad; ix > 0; ix--) {
3049 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3050 if (namesv && namesv != &sv_undef) {
3051 char *name = SvPVX(namesv); /* XXX */
3052 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3053 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3054 CvOUTSIDE(cv), cxstack_ix);
3056 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3058 croak("panic: cv_clone: %s", name);
3060 else { /* our own lexical */
3063 /* anon code -- we'll come back for it */
3064 sv = SvREFCNT_inc(ppad[ix]);
3066 else if (*name == '@')
3068 else if (*name == '%')
3078 SV* sv = NEWSV(0,0);
3084 /* Now that vars are all in place, clone nested closures. */
3086 for (ix = fpad; ix > 0; ix--) {
3087 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3089 && namesv != &sv_undef
3090 && !(SvFLAGS(namesv) & SVf_FAKE)
3091 && *SvPVX(namesv) == '&'
3092 && CvCLONE(ppad[ix]))
3094 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3095 SvREFCNT_dec(ppad[ix]);
3098 curpad[ix] = (SV*)kid;
3102 #ifdef DEBUG_CLOSURES
3103 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3105 PerlIO_printf(Perl_debug_log, " from:\n");
3107 PerlIO_printf(Perl_debug_log, " to:\n");
3118 return cv_clone2(proto, CvOUTSIDE(proto));
3122 cv_ckproto(CV *cv, GV *gv, char *p)
3124 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3125 SV* msg = sv_newmortal();
3129 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3130 sv_setpv(msg, "Prototype mismatch:");
3132 sv_catpvf(msg, " sub %_", name);
3134 sv_catpvf(msg, " (%s)", SvPVX(cv));
3135 sv_catpv(msg, " vs ");
3137 sv_catpvf(msg, "(%s)", p);
3139 sv_catpv(msg, "none");
3150 if (!cv || !SvPOK(cv) || SvCUR(cv))
3154 for (o = CvSTART(cv); o; o = o->op_next) {
3155 OPCODE type = o->op_type;
3157 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3159 if (type == OP_LEAVESUB || type == OP_RETURN)
3163 if (type == OP_CONST)
3165 else if (type == OP_PADSV) {
3166 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3167 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3168 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3180 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3183 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3184 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3185 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3194 if (!name || GvCVGEN(gv))
3196 else if (cv = GvCV(gv)) {
3197 cv_ckproto(cv, gv, ps);
3198 /* already defined (or promised)? */
3199 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3202 /* just a "sub foo;" when &foo is already defined */
3206 /* ahem, death to those who redefine active sort subs */
3207 if (curstack == sortstack && sortcop == CvSTART(cv))
3208 croak("Can't redefine active sort subroutine %s", name);
3209 const_sv = cv_const_sv(cv);
3210 if (const_sv || dowarn) {
3211 line_t oldline = curcop->cop_line;
3212 curcop->cop_line = copline;
3213 warn(const_sv ? "Constant subroutine %s redefined"
3214 : "Subroutine %s redefined", name);
3215 curcop->cop_line = oldline;
3221 if (cv) { /* must reuse cv if autoloaded */
3223 CvFLAGS(cv) = CvFLAGS(compcv);
3224 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3225 CvOUTSIDE(compcv) = 0;
3226 CvPADLIST(cv) = CvPADLIST(compcv);
3227 CvPADLIST(compcv) = 0;
3228 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3229 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3230 SvREFCNT_dec(compcv);
3240 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3241 CvFILEGV(cv) = curcop->cop_filegv;
3242 CvSTASH(cv) = curstash;
3245 New(666, CvMUTEXP(cv), 1, perl_mutex);
3246 MUTEX_INIT(CvMUTEXP(cv));
3247 #endif /* USE_THREADS */
3250 sv_setpv((SV*)cv, ps);
3256 char *s = strrchr(name, ':');
3258 if (strEQ(s, "BEGIN")) {
3260 "BEGIN not safe after errors--compilation aborted";
3264 /* force display of errors found but not reported */
3265 sv_catpv(GvSV(errgv), not_safe);
3266 croak("%s", SvPVx(GvSV(errgv), na));
3277 if (AvFILL(comppad_name) < AvFILL(comppad))
3278 av_store(comppad_name, AvFILL(comppad), Nullsv);
3281 SV **namep = AvARRAY(comppad_name);
3282 for (ix = AvFILL(comppad); ix > 0; ix--) {
3285 if (SvIMMORTAL(curpad[ix]))
3288 * The only things that a clonable function needs in its
3289 * pad are references to outer lexicals and anonymous subs.
3290 * The rest are created anew during cloning.
3292 if (!((namesv = namep[ix]) != Nullsv &&
3293 namesv != &sv_undef &&
3295 *SvPVX(namesv) == '&')))
3297 SvREFCNT_dec(curpad[ix]);
3298 curpad[ix] = Nullsv;
3303 AV *av = newAV(); /* Will be @_ */
3305 av_store(comppad, 0, (SV*)av);
3306 AvFLAGS(av) = AVf_REIFY;
3308 for (ix = AvFILL(comppad); ix > 0; ix--) {
3309 if (SvIMMORTAL(curpad[ix]))
3311 if (!SvPADMY(curpad[ix]))
3312 SvPADTMP_on(curpad[ix]);
3316 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3317 CvSTART(cv) = LINKLIST(CvROOT(cv));
3318 CvROOT(cv)->op_next = 0;
3324 if (PERLDB_SUBLINE && curstash != debstash) {
3325 SV *sv = NEWSV(0,0);
3326 SV *tmpstr = sv_newmortal();
3327 static GV *db_postponed;
3331 sv_setpvf(sv, "%_:%ld-%ld",
3332 GvSV(curcop->cop_filegv),
3333 (long)subline, (long)curcop->cop_line);
3334 gv_efullname3(tmpstr, gv, Nullch);
3335 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3336 if (!db_postponed) {
3337 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3339 hv = GvHVn(db_postponed);
3340 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3341 && (cv = GvCV(db_postponed))) {
3346 perl_call_sv((SV*)cv, G_DISCARD);
3350 if ((s = strrchr(name,':')))
3354 if (strEQ(s, "BEGIN")) {
3355 I32 oldscope = scopestack_ix;
3357 SAVESPTR(compiling.cop_filegv);
3358 SAVEI16(compiling.cop_line);
3365 DEBUG_x( dump_sub(gv) );
3366 av_push(beginav, (SV *)cv);
3368 call_list(oldscope, beginav);
3370 curcop = &compiling;
3373 else if (strEQ(s, "END") && !error_count) {
3376 av_unshift(endav, 1);
3377 av_store(endav, 0, (SV *)cv);
3380 else if (strEQ(s, "INIT") && !error_count) {
3383 av_push(initav, SvREFCNT_inc(cv));
3395 newXSUB(name, ix, subaddr, filename)
3401 CV* cv = newXS(name, (void(*)())subaddr, filename);
3403 CvXSUBANY(cv).any_i32 = ix;
3409 newXS(char *name, void (*subaddr) (CV *), char *filename)
3412 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3415 if (cv = (name ? GvCV(gv) : Nullcv)) {
3417 /* just a cached method */
3421 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3422 /* already defined (or promised) */
3424 line_t oldline = curcop->cop_line;
3425 curcop->cop_line = copline;
3426 warn("Subroutine %s redefined",name);
3427 curcop->cop_line = oldline;
3434 if (cv) /* must reuse cv if autoloaded */
3437 cv = (CV*)NEWSV(1105,0);
3438 sv_upgrade((SV *)cv, SVt_PVCV);
3445 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3447 New(666, CvMUTEXP(cv), 1, perl_mutex);
3448 MUTEX_INIT(CvMUTEXP(cv));
3450 #endif /* USE_THREADS */
3451 CvFILEGV(cv) = gv_fetchfile(filename);
3452 CvXSUB(cv) = subaddr;
3455 char *s = strrchr(name,':');
3460 if (strEQ(s, "BEGIN")) {
3463 av_push(beginav, (SV *)cv);
3466 else if (strEQ(s, "END")) {
3469 av_unshift(endav, 1);
3470 av_store(endav, 0, (SV *)cv);
3473 else if (strEQ(s, "INIT")) {
3476 av_push(initav, (SV *)cv);
3486 newFORM(I32 floor, OP *o, OP *block)
3495 name = SvPVx(cSVOPo->op_sv, na);
3498 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3500 if (cv = GvFORM(gv)) {
3502 line_t oldline = curcop->cop_line;
3504 curcop->cop_line = copline;
3505 warn("Format %s redefined",name);
3506 curcop->cop_line = oldline;
3512 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3513 CvFILEGV(cv) = curcop->cop_filegv;
3515 for (ix = AvFILL(comppad); ix > 0; ix--) {
3516 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3517 SvPADTMP_on(curpad[ix]);
3520 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3521 CvSTART(cv) = LINKLIST(CvROOT(cv));
3522 CvROOT(cv)->op_next = 0;
3532 return newUNOP(OP_REFGEN, 0,
3533 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3539 return newUNOP(OP_REFGEN, 0,
3540 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3544 newANONSUB(I32 floor, OP *proto, OP *block)
3546 return newUNOP(OP_REFGEN, 0,
3547 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3553 switch (o->op_type) {
3555 o->op_type = OP_PADAV;
3556 o->op_ppaddr = ppaddr[OP_PADAV];
3557 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3560 o->op_type = OP_RV2AV;
3561 o->op_ppaddr = ppaddr[OP_RV2AV];
3566 warn("oops: oopsAV");
3575 switch (o->op_type) {
3578 o->op_type = OP_PADHV;
3579 o->op_ppaddr = ppaddr[OP_PADHV];
3580 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3584 o->op_type = OP_RV2HV;
3585 o->op_ppaddr = ppaddr[OP_RV2HV];
3590 warn("oops: oopsHV");
3599 if (o->op_type == OP_PADANY) {
3600 o->op_type = OP_PADAV;
3601 o->op_ppaddr = ppaddr[OP_PADAV];
3604 return newUNOP(OP_RV2AV, 0, scalar(o));
3608 newGVREF(I32 type, OP *o)
3610 if (type == OP_MAPSTART)
3611 return newUNOP(OP_NULL, 0, o);
3612 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3618 if (o->op_type == OP_PADANY) {
3619 o->op_type = OP_PADHV;
3620 o->op_ppaddr = ppaddr[OP_PADHV];
3623 return newUNOP(OP_RV2HV, 0, scalar(o));
3629 croak("NOT IMPL LINE %d",__LINE__);
3635 newCVREF(I32 flags, OP *o)
3637 return newUNOP(OP_RV2CV, flags, scalar(o));
3643 if (o->op_type == OP_PADANY) {
3644 o->op_type = OP_PADSV;
3645 o->op_ppaddr = ppaddr[OP_PADSV];
3648 return newUNOP(OP_RV2SV, 0, scalar(o));
3651 /* Check routines. */
3659 name = NEWSV(1106,0);
3660 sv_upgrade(name, SVt_PVNV);
3661 sv_setpvn(name, "&", 1);
3664 ix = pad_alloc(o->op_type, SVs_PADMY);
3665 av_store(comppad_name, ix, name);
3666 av_store(comppad, ix, cSVOPo->op_sv);
3667 SvPADMY_on(cSVOPo->op_sv);
3668 cSVOPo->op_sv = Nullsv;
3669 cSVOPo->op_targ = ix;
3676 o->op_private = hints;
3683 if (cUNOPo->op_first->op_type == OP_CONCAT)
3684 o->op_flags |= OPf_STACKED;
3691 if (o->op_flags & OPf_KIDS) {
3694 OPCODE type = o->op_type;
3695 o = modkids(ck_fun(o), type);
3696 kid = cUNOPo->op_first;
3697 newop = kUNOP->op_first->op_sibling;
3699 (newop->op_sibling ||
3700 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3701 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3702 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3706 op_free(kUNOP->op_first);
3707 kUNOP->op_first = newop;
3709 o->op_ppaddr = ppaddr[++o->op_type];
3718 if (o->op_flags & OPf_KIDS) {
3719 OP *kid = cUNOPo->op_first;
3720 if (kid->op_type == OP_HSLICE)
3721 o->op_private |= OPpSLICE;
3722 else if (kid->op_type != OP_HELEM)
3723 croak("%s argument is not a HASH element or slice",
3724 op_desc[o->op_type]);
3733 I32 type = o->op_type;
3735 if (o->op_flags & OPf_KIDS) {
3736 if (cLISTOPo->op_first->op_type == OP_STUB) {
3738 o = newUNOP(type, OPf_SPECIAL,
3739 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3749 hints |= HINT_BLOCK_SCOPE;
3750 if (o->op_flags & OPf_KIDS) {
3751 SVOP *kid = (SVOP*)cUNOPo->op_first;
3754 o->op_flags &= ~OPf_KIDS;
3757 else if (kid->op_type == OP_LINESEQ) {
3760 kid->op_next = o->op_next;
3761 cUNOPo->op_first = 0;
3764 Newz(1101, enter, 1, LOGOP);
3765 enter->op_type = OP_ENTERTRY;
3766 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3767 enter->op_private = 0;
3769 /* establish postfix order */
3770 enter->op_next = (OP*)enter;
3772 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3773 o->op_type = OP_LEAVETRY;
3774 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3775 enter->op_other = o;
3781 o = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3783 o->op_targ = (PADOFFSET)hints;
3791 if (o->op_flags & OPf_STACKED) {
3793 kid = cUNOPo->op_first->op_sibling;
3794 if (kid->op_type == OP_RV2GV)
3806 if (o->op_flags & OPf_KIDS) {
3807 OP *kid = cUNOPo->op_first;
3808 if (kid->op_type != OP_HELEM)
3809 croak("%s argument is not a HASH element", op_desc[o->op_type]);
3816 ck_gvconst(register OP *o)
3818 o = fold_constants(o);
3819 if (o->op_type == OP_CONST)
3825 ck_rvconst(register OP *o)
3828 SVOP *kid = (SVOP*)cUNOPo->op_first;
3830 o->op_private |= (hints & HINT_STRICT_REFS);
3831 if (kid->op_type == OP_CONST) {
3836 name = SvPV(kid->op_sv, na);
3837 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3838 char *badthing = Nullch;
3839 switch (o->op_type) {
3841 badthing = "a SCALAR";
3844 badthing = "an ARRAY";
3847 badthing = "a HASH";
3852 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3855 kid->op_type = OP_GV;
3856 iscv = (o->op_type == OP_RV2CV) * 2;
3857 for (gv = 0; !gv; iscv++) {
3859 * This is a little tricky. We only want to add the symbol if we
3860 * didn't add it in the lexer. Otherwise we get duplicate strict
3861 * warnings. But if we didn't add it in the lexer, we must at
3862 * least pretend like we wanted to add it even if it existed before,
3863 * or we get possible typo warnings. OPpCONST_ENTERED says
3864 * whether the lexer already added THIS instance of this symbol.
3866 gv = gv_fetchpv(name,
3867 iscv | !(kid->op_private & OPpCONST_ENTERED),
3870 : o->op_type == OP_RV2SV
3872 : o->op_type == OP_RV2AV
3874 : o->op_type == OP_RV2HV
3878 SvREFCNT_dec(kid->op_sv);
3879 kid->op_sv = SvREFCNT_inc(gv);
3888 I32 type = o->op_type;
3890 if (o->op_flags & OPf_REF)
3893 if (o->op_flags & OPf_KIDS) {
3894 SVOP *kid = (SVOP*)cUNOPo->op_first;
3896 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3897 OP *newop = newGVOP(type, OPf_REF,
3898 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
3905 if (type == OP_FTTTY)
3906 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
3909 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3922 int type = o->op_type;
3923 register I32 oa = opargs[type] >> OASHIFT;
3925 if (o->op_flags & OPf_STACKED) {
3926 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
3929 return no_fh_allowed(o);
3932 if (o->op_flags & OPf_KIDS) {
3933 tokid = &cLISTOPo->op_first;
3934 kid = cLISTOPo->op_first;
3935 if (kid->op_type == OP_PUSHMARK ||
3936 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
3938 tokid = &kid->op_sibling;
3939 kid = kid->op_sibling;
3941 if (!kid && opargs[type] & OA_DEFGV)
3942 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
3946 sibl = kid->op_sibling;
3960 if (kid->op_type == OP_CONST &&
3961 (kid->op_private & OPpCONST_BARE)) {
3962 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
3963 OP *newop = newAVREF(newGVOP(OP_GV, 0,
3964 gv_fetchpv(name, TRUE, SVt_PVAV) ));
3966 warn("Array @%s missing the @ in argument %ld of %s()",
3967 name, (long)numargs, op_desc[type]);
3970 kid->op_sibling = sibl;
3973 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
3974 bad_type(numargs, "array", op_desc[o->op_type], kid);
3978 if (kid->op_type == OP_CONST &&
3979 (kid->op_private & OPpCONST_BARE)) {
3980 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
3981 OP *newop = newHVREF(newGVOP(OP_GV, 0,
3982 gv_fetchpv(name, TRUE, SVt_PVHV) ));
3984 warn("Hash %%%s missing the %% in argument %ld of %s()",
3985 name, (long)numargs, op_desc[type]);
3988 kid->op_sibling = sibl;
3991 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
3992 bad_type(numargs, "hash", op_desc[o->op_type], kid);
3997 OP *newop = newUNOP(OP_NULL, 0, kid);
3998 kid->op_sibling = 0;
4000 newop->op_next = newop;
4002 kid->op_sibling = sibl;
4007 if (kid->op_type != OP_GV) {
4008 if (kid->op_type == OP_CONST &&
4009 (kid->op_private & OPpCONST_BARE)) {
4010 OP *newop = newGVOP(OP_GV, 0,
4011 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4017 kid->op_sibling = 0;
4018 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4020 kid->op_sibling = sibl;
4026 mod(scalar(kid), type);
4030 tokid = &kid->op_sibling;
4031 kid = kid->op_sibling;
4033 o->op_private |= numargs;
4035 return too_many_arguments(o,op_desc[o->op_type]);
4038 else if (opargs[type] & OA_DEFGV) {
4040 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4044 while (oa & OA_OPTIONAL)
4046 if (oa && oa != OA_LIST)
4047 return too_few_arguments(o,op_desc[o->op_type]);
4057 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4058 append_elem(OP_GLOB, o, newSVREF(newGVOP(OP_GV, 0, defgv)));
4060 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4061 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4063 if (gv && GvIMPORTED_CV(gv)) {
4064 static int glob_index;
4066 append_elem(OP_GLOB, o,
4067 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4068 o->op_type = OP_LIST;
4069 o->op_ppaddr = ppaddr[OP_LIST];
4070 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4071 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4072 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4073 append_elem(OP_LIST, o,
4074 scalar(newUNOP(OP_RV2CV, 0,
4075 newGVOP(OP_GV, 0, gv)))));
4076 o = newUNOP(OP_NULL, 0, ck_subr(o));
4077 o->op_targ = OP_GLOB; /* hint at what it used to be */
4080 gv = newGVgen("main");
4082 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4092 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4094 o->op_ppaddr = ppaddr[OP_GREPSTART];
4095 Newz(1101, gwop, 1, LOGOP);
4097 if (o->op_flags & OPf_STACKED) {
4100 kid = cLISTOPo->op_first->op_sibling;
4101 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4104 kid->op_next = (OP*)gwop;
4105 o->op_flags &= ~OPf_STACKED;
4107 kid = cLISTOPo->op_first->op_sibling;
4108 if (type == OP_MAPWHILE)
4115 kid = cLISTOPo->op_first->op_sibling;
4116 if (kid->op_type != OP_NULL)
4117 croak("panic: ck_grep");
4118 kid = kUNOP->op_first;
4120 gwop->op_type = type;
4121 gwop->op_ppaddr = ppaddr[type];
4122 gwop->op_first = listkids(o);
4123 gwop->op_flags |= OPf_KIDS;
4124 gwop->op_private = 1;
4125 gwop->op_other = LINKLIST(kid);
4126 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4127 kid->op_next = (OP*)gwop;
4129 kid = cLISTOPo->op_first->op_sibling;
4130 if (!kid || !kid->op_sibling)
4131 return too_few_arguments(o,op_desc[o->op_type]);
4132 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4133 mod(kid, OP_GREPSTART);
4141 if (o->op_flags & OPf_KIDS) {
4142 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4143 if (kid && kid->op_type == OP_CONST)
4144 fbm_compile(((SVOP*)kid)->op_sv);
4150 ck_lengthconst(OP *o)
4152 /* XXX length optimization goes here */
4159 OPCODE type = o->op_type;
4160 return modkids(ck_fun(o), type);
4166 OPCODE type = o->op_type;
4167 return refkids(ck_fun(o), type);
4175 kid = cLISTOPo->op_first;
4178 kid = cLISTOPo->op_first;
4180 if (kid->op_type == OP_PUSHMARK)
4181 kid = kid->op_sibling;
4182 if (kid && o->op_flags & OPf_STACKED)
4183 kid = kid->op_sibling;
4184 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4185 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4186 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4187 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4188 cLISTOPo->op_first->op_sibling = kid;
4189 cLISTOPo->op_last = kid;
4190 kid = kid->op_sibling;
4195 append_elem(o->op_type, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4201 if (hints & HINT_LOCALE)
4202 o->op_private |= OPpLOCALE;
4209 ck_fun_locale(OP *o)
4215 if (hints & HINT_LOCALE)
4216 o->op_private |= OPpLOCALE;
4227 if (hints & HINT_LOCALE)
4228 o->op_private |= OPpLOCALE;
4237 o->op_private |= OPpRUNTIME;
4250 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4251 o->op_private |= OPpREPEAT_DOLIST;
4252 cBINOPo->op_first = force_list(cBINOPo->op_first);
4262 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4263 SVOP *kid = (SVOP*)cUNOPo->op_first;
4265 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4267 for (s = SvPVX(kid->op_sv); *s; s++) {
4268 if (*s == ':' && s[1] == ':') {
4270 Move(s+2, s+1, strlen(s+2)+1, char);
4271 --SvCUR(kid->op_sv);
4274 sv_catpvn(kid->op_sv, ".pm", 3);
4283 croak("NOT IMPL LINE %d",__LINE__);
4292 if (o->op_flags & OPf_KIDS) {
4293 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4294 if (kid && kid->op_sibling) {
4295 o->op_type = OP_SSELECT;
4296 o->op_ppaddr = ppaddr[OP_SSELECT];
4298 return fold_constants(o);
4302 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4303 if (kid && kid->op_type == OP_RV2GV)
4304 kid->op_private &= ~HINT_STRICT_REFS;
4311 I32 type = o->op_type;
4313 if (!(o->op_flags & OPf_KIDS)) {
4319 argop = newOP(OP_PADAV, OPf_REF);
4320 argop->op_targ = 0; /* curpad[0] is @_ */
4323 argop = newUNOP(OP_RV2AV, 0,
4324 scalar(newGVOP(OP_GV, 0,
4325 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4328 argop = newUNOP(OP_RV2AV, 0,
4329 scalar(newGVOP(OP_GV, 0, subline ?
4330 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4331 #endif /* USE_THREADS */
4332 return newUNOP(type, 0, scalar(argop));
4334 return scalar(modkids(ck_fun(o), type));
4342 if (hints & HINT_LOCALE)
4343 o->op_private |= OPpLOCALE;
4346 if (o->op_flags & OPf_STACKED) {
4347 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4349 kid = kUNOP->op_first; /* get past rv2gv */
4351 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4353 if (kid->op_type == OP_SCOPE) {
4357 else if (kid->op_type == OP_LEAVE) {
4358 if (o->op_type == OP_SORT) {
4359 null(kid); /* wipe out leave */
4362 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4363 if (k->op_next == kid)
4368 kid->op_next = 0; /* just disconnect the leave */
4369 k = kLISTOP->op_first;
4373 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4374 null(kid); /* wipe out rv2gv */
4375 if (o->op_type == OP_SORT)
4379 o->op_flags |= OPf_SPECIAL;
4392 if (o->op_flags & OPf_STACKED)
4393 return no_fh_allowed(o);
4395 kid = cLISTOPo->op_first;
4396 if (kid->op_type != OP_NULL)
4397 croak("panic: ck_split");
4398 kid = kid->op_sibling;
4399 op_free(cLISTOPo->op_first);
4400 cLISTOPo->op_first = kid;
4402 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4403 cLISTOPo->op_last = kid; /* There was only one element previously */
4406 if (kid->op_type != OP_MATCH) {
4407 OP *sibl = kid->op_sibling;
4408 kid->op_sibling = 0;
4409 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4410 if (cLISTOPo->op_first == cLISTOPo->op_last)
4411 cLISTOPo->op_last = kid;
4412 cLISTOPo->op_first = kid;
4413 kid->op_sibling = sibl;
4416 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4417 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4421 kid->op_type = OP_PUSHRE;
4422 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4425 if (!kid->op_sibling)
4426 append_elem(OP_SPLIT, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4428 kid = kid->op_sibling;
4431 if (!kid->op_sibling)
4432 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4434 kid = kid->op_sibling;
4437 if (kid->op_sibling)
4438 return too_many_arguments(o,op_desc[o->op_type]);
4447 OP *prev = ((cUNOPo->op_first->op_sibling)
4448 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4449 OP *o2 = prev->op_sibling;
4457 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4458 if (cvop->op_type == OP_RV2CV) {
4460 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4461 null(cvop); /* disable rv2cv */
4462 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4463 if (tmpop->op_type == OP_GV) {
4464 cv = GvCVu(tmpop->op_sv);
4465 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4466 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4467 proto = SvPV((SV*)cv, na);
4471 o->op_private |= (hints & HINT_STRICT_REFS);
4472 if (PERLDB_SUB && curstash != debstash)
4473 o->op_private |= OPpENTERSUB_DB;
4474 while (o2 != cvop) {
4478 return too_many_arguments(o, gv_ename(namegv));
4496 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4497 bad_type(arg, "block", gv_ename(namegv), o2);
4502 if (o2->op_type == OP_RV2GV)
4506 o2 = newUNOP(OP_RV2GV, 0, kid);
4507 o2->op_sibling = kid->op_sibling;
4508 kid->op_sibling = 0;
4509 prev->op_sibling = o;
4517 if (o2->op_type != OP_RV2GV)
4518 bad_type(arg, "symbol", gv_ename(namegv), o2);
4521 if (o2->op_type != OP_RV2CV)
4522 bad_type(arg, "sub", gv_ename(namegv), o2);
4525 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4526 bad_type(arg, "scalar", gv_ename(namegv), o2);
4529 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4530 bad_type(arg, "array", gv_ename(namegv), o2);
4533 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4534 bad_type(arg, "hash", gv_ename(namegv), o2);
4538 o2 = newUNOP(OP_REFGEN, 0, kid);
4539 o2->op_sibling = kid->op_sibling;
4540 kid->op_sibling = 0;
4541 prev->op_sibling = o2;
4552 croak("Malformed prototype for %s: %s",
4553 gv_ename(namegv), SvPV((SV*)cv, na));
4558 mod(o2, OP_ENTERSUB);
4560 o2 = o2->op_sibling;
4562 if (proto && !optional &&
4563 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4564 return too_few_arguments(o, gv_ename(namegv));
4571 SvREADONLY_on(cSVOPo->op_sv);
4578 if (o->op_flags & OPf_KIDS) {
4579 SVOP *kid = (SVOP*)cUNOPo->op_first;
4581 if (kid->op_type == OP_NULL)
4582 kid = (SVOP*)kid->op_sibling;
4584 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4585 o->op_flags |= OPf_SPECIAL;
4590 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4593 peep(register OP *o)
4596 register OP* oldop = 0;
4597 if (!o || o->op_seq)
4602 for (; o; o = o->op_next) {
4608 switch (o->op_type) {
4611 curcop = ((COP*)o); /* for warnings */
4612 o->op_seq = op_seqmax++;
4623 if (o->op_next->op_type == OP_STRINGIFY)
4625 o->op_seq = op_seqmax++;
4628 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4629 o->op_seq = op_seqmax++;
4630 break; /* Scalar stub must produce undef. List stub is noop */
4634 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4635 curcop = ((COP*)op);
4641 if (oldop && o->op_next) {
4642 oldop->op_next = o->op_next;
4645 o->op_seq = op_seqmax++;
4649 if (o->op_next->op_type == OP_RV2SV) {
4650 if (!(o->op_next->op_private & OPpDEREF)) {
4652 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4653 o->op_next = o->op_next->op_next;
4654 o->op_type = OP_GVSV;
4655 o->op_ppaddr = ppaddr[OP_GVSV];
4658 else if (o->op_next->op_type == OP_RV2AV) {
4659 OP* pop = o->op_next->op_next;
4661 if (pop->op_type == OP_CONST &&
4662 (op = pop->op_next) &&
4663 pop->op_next->op_type == OP_AELEM &&
4664 !(pop->op_next->op_private &
4665 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4666 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4670 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4674 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4675 o->op_next = pop->op_next->op_next;
4676 o->op_type = OP_AELEMFAST;
4677 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4678 o->op_private = (U8)i;
4679 GvAVn(((GVOP*)o)->op_gv);
4682 o->op_seq = op_seqmax++;
4686 if (o->op_next->op_type == OP_RV2AV
4687 && (o->op_next->op_flags && OPf_REF))
4690 o->op_next = o->op_next->op_next;
4695 if (o->op_next->op_type == OP_RV2HV
4696 && (o->op_next->op_flags && OPf_REF))
4699 o->op_next = o->op_next->op_next;
4707 o->op_seq = op_seqmax++;
4708 peep(cLOGOP->op_other);
4712 o->op_seq = op_seqmax++;
4713 peep(cCONDOP->op_true);
4714 peep(cCONDOP->op_false);
4718 o->op_seq = op_seqmax++;
4719 peep(cLOOP->op_redoop);
4720 peep(cLOOP->op_nextop);
4721 peep(cLOOP->op_lastop);
4726 o->op_seq = op_seqmax++;
4727 peep(cPMOP->op_pmreplstart);
4731 o->op_seq = op_seqmax++;
4732 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4733 if (o->op_next->op_sibling &&
4734 o->op_next->op_sibling->op_type != OP_DIE) {
4735 line_t oldline = curcop->cop_line;
4737 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4738 warn("Statement unlikely to be reached");
4739 warn("(Maybe you meant system() when you said exec()?)\n");
4740 curcop->cop_line = oldline;
4754 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4755 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4757 rop = (UNOP*)((BINOP*)o)->op_first;
4758 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4760 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4761 if (!SvOBJECT(lexname))
4763 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4764 if (!fields || !GvHV(*fields))
4766 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4767 key = SvPV(*svp, keylen);
4768 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4770 croak("No such field \"%s\" in variable %s of type %s",
4771 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4773 ind = SvIV(*indsvp);
4775 croak("Bad index while coercing array into hash");
4776 rop->op_type = OP_RV2AV;
4777 rop->op_ppaddr = ppaddr[OP_RV2AV];
4778 o->op_type = OP_AELEM;
4779 o->op_ppaddr = ppaddr[OP_AELEM];
4781 *svp = newSViv(ind);
4786 o->op_seq = op_seqmax++;