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));
48 SV* tmpsv = sv_newmortal();
49 gv_efullname3(tmpsv, gv, Nullch);
50 return SvPV(tmpsv,na);
57 yyerror(form("Missing comma after first argument to %s function",
58 op_desc[o->op_type]));
63 too_few_arguments(o, name)
67 yyerror(form("Not enough arguments for %s", name));
72 too_many_arguments(o, name)
76 yyerror(form("Too many arguments for %s", name));
81 bad_type(n, t, name, kid)
87 yyerror(form("Type of arg %d to %s must be %s (not %s)",
88 (int)n, name, t, op_desc[kid->op_type]));
95 int type = o->op_type;
96 if (type != OP_AELEM && type != OP_HELEM) {
97 yyerror(form("Can't use subscript on %s", op_desc[type]));
98 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV)
99 warn("(Did you mean $ or @ instead of %c?)\n",
100 type == OP_ENTERSUB ? '&' : '%');
104 /* "register" allocation */
114 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
115 if (!isPRINT(name[1])) {
117 name[2] = toCTRL(name[1]);
120 croak("Can't use global %s in \"my\"",name);
122 if (dowarn && AvFILL(comppad_name) >= 0) {
123 SV **svp = AvARRAY(comppad_name);
124 for (off = AvFILL(comppad_name); off > comppad_name_floor; off--) {
127 && SvIVX(sv) == 999999999 /* var is in open scope */
128 && strEQ(name, SvPVX(sv)))
130 warn("\"my\" variable %s masks earlier declaration in same scope", name);
135 off = pad_alloc(OP_PADSV, SVs_PADMY);
137 sv_upgrade(sv, SVt_PVNV);
141 croak("Can't declare class for non-scalar %s in \"my\"",name);
143 (void)SvUPGRADE(sv, SVt_PVMG);
144 SvSTASH(sv) = (HV*)SvREFCNT_inc(in_my_stash);
147 av_store(comppad_name, off, sv);
148 SvNVX(sv) = (double)999999999;
149 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
150 if (!min_intro_pending)
151 min_intro_pending = off;
152 max_intro_pending = off;
154 av_store(comppad, off, (SV*)newAV());
155 else if (*name == '%')
156 av_store(comppad, off, (SV*)newHV());
157 SvPADMY_on(curpad[off]);
162 #ifndef CAN_PROTOTYPE
163 pad_findlex(name, newoff, seq, startcv, cx_ix)
170 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
178 register CONTEXT *cx;
181 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
182 AV *curlist = CvPADLIST(cv);
183 SV **svp = av_fetch(curlist, 0, FALSE);
186 if (!svp || *svp == &sv_undef)
189 svp = AvARRAY(curname);
190 for (off = AvFILL(curname); off > 0; off--) {
191 if ((sv = svp[off]) &&
194 seq > I_32(SvNVX(sv)) &&
195 strEQ(SvPVX(sv), name))
206 return 0; /* don't clone from inactive stack frame */
210 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
211 oldsv = *av_fetch(oldpad, off, TRUE);
212 if (!newoff) { /* Not a mere clone operation. */
213 SV *namesv = NEWSV(1103,0);
214 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
215 sv_upgrade(namesv, SVt_PVNV);
216 sv_setpv(namesv, name);
217 av_store(comppad_name, newoff, namesv);
218 SvNVX(namesv) = (double)curcop->cop_seq;
219 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
220 SvFAKE_on(namesv); /* A ref, not a real var */
221 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
222 /* "It's closures all the way down." */
226 oldsv = Nullsv; /* no need to keep ref */
231 bcv && bcv != cv && !CvCLONE(bcv);
232 bcv = CvOUTSIDE(bcv)) {
236 if (dowarn && !CvUNIQUE(cv))
238 "Variable \"%s\" may be unavailable",
245 else if (!CvUNIQUE(compcv)) {
246 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
247 warn("Variable \"%s\" will not stay shared", name);
250 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
256 /* Nothing in current lexical context--try eval's context, if any.
257 * This is necessary to let the perldb get at lexically scoped variables.
258 * XXX This will also probably interact badly with eval tree caching.
262 for (i = cx_ix; i >= 0; i--) {
264 switch (cx->cx_type) {
266 if (i == 0 && saweval) {
267 seq = cxstack[saweval].blk_oldcop->cop_seq;
268 return pad_findlex(name, newoff, seq, main_cv, 0);
272 switch (cx->blk_eval.old_op_type) {
277 /* require must have its own scope */
285 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
286 saweval = i; /* so we know where we were called from */
289 seq = cxstack[saweval].blk_oldcop->cop_seq;
290 return pad_findlex(name, newoff, seq, cv, i-1);
305 SV **svp = AvARRAY(comppad_name);
306 U32 seq = cop_seqmax;
310 * Special case to get lexical (and hence per-thread) @_.
311 * XXX I need to find out how to tell at parse-time whether use
312 * of @_ should refer to a lexical (from a sub) or defgv (global
313 * scope and maybe weird sub-ish things like formats). See
314 * startsub in perly.y. It's possible that @_ could be lexical
315 * (at least from subs) even in non-threaded perl.
317 if (strEQ(name, "@_"))
318 return 0; /* success. (NOT_IN_PAD indicates failure) */
319 #endif /* USE_THREADS */
321 /* The one we're looking for is probably just before comppad_name_fill. */
322 for (off = AvFILL(comppad_name); off > 0; off--) {
323 if ((sv = svp[off]) &&
327 seq > I_32(SvNVX(sv)))) &&
328 strEQ(SvPVX(sv), name))
331 return (PADOFFSET)off;
332 pendoff = off; /* this pending def. will override import */
336 /* See if it's in a nested scope */
337 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
339 /* If there is a pending local definition, this new alias must die */
341 SvIVX(AvARRAY(comppad_name)[off]) = seq;
342 return off; /* pad_findlex returns 0 for failure...*/
344 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
352 SV **svp = AvARRAY(comppad_name);
354 if (min_intro_pending && fill < min_intro_pending) {
355 for (off = max_intro_pending; off >= min_intro_pending; off--) {
356 if ((sv = svp[off]) && sv != &sv_undef)
357 warn("%s never introduced", SvPVX(sv));
360 /* "Deintroduce" my variables that are leaving with this scope. */
361 for (off = AvFILL(comppad_name); off > fill; off--) {
362 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
363 SvIVX(sv) = cop_seqmax;
368 pad_alloc(optype,tmptype)
376 if (AvARRAY(comppad) != curpad)
377 croak("panic: pad_alloc");
378 if (pad_reset_pending)
380 if (tmptype & SVs_PADMY) {
382 sv = *av_fetch(comppad, AvFILL(comppad) + 1, TRUE);
383 } while (SvPADBUSY(sv)); /* need a fresh one */
384 retval = AvFILL(comppad);
387 SV **names = AvARRAY(comppad_name);
388 SSize_t names_fill = AvFILL(comppad_name);
391 * "foreach" index vars temporarily become aliases to non-"my"
392 * values. Thus we must skip, not just pad values that are
393 * marked as current pad values, but also those with names.
395 if (++padix <= names_fill &&
396 (sv = names[padix]) && sv != &sv_undef)
398 sv = *av_fetch(comppad, padix, TRUE);
399 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
404 SvFLAGS(sv) |= tmptype;
405 curpad = AvARRAY(comppad);
407 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
408 (unsigned long) thr, (unsigned long) curpad,
409 (long) retval, op_name[optype]));
411 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad alloc %ld for %s\n",
412 (long) retval, op_name[optype]));
413 #endif /* USE_THREADS */
414 return (PADOFFSET)retval;
418 #ifndef CAN_PROTOTYPE
423 #endif /* CAN_PROTOTYPE */
427 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
428 (unsigned long) thr, (unsigned long) curpad, po));
431 croak("panic: pad_sv po");
432 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad sv %d\n", po));
433 #endif /* USE_THREADS */
434 return curpad[po]; /* eventually we'll turn this into a macro */
438 #ifndef CAN_PROTOTYPE
442 pad_free(PADOFFSET po)
443 #endif /* CAN_PROTOTYPE */
448 if (AvARRAY(comppad) != curpad)
449 croak("panic: pad_free curpad");
451 croak("panic: pad_free po");
453 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
454 (unsigned long) thr, (unsigned long) curpad, po));
456 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad free %d\n", po));
457 #endif /* USE_THREADS */
458 if (curpad[po] && curpad[po] != &sv_undef)
459 SvPADTMP_off(curpad[po]);
465 #ifndef CAN_PROTOTYPE
469 pad_swipe(PADOFFSET po)
470 #endif /* CAN_PROTOTYPE */
473 if (AvARRAY(comppad) != curpad)
474 croak("panic: pad_swipe curpad");
476 croak("panic: pad_swipe po");
478 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
479 (unsigned long) thr, (unsigned long) curpad, po));
481 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad swipe %d\n", po));
482 #endif /* USE_THREADS */
483 SvPADTMP_off(curpad[po]);
484 curpad[po] = NEWSV(1107,0);
485 SvPADTMP_on(curpad[po]);
496 if (AvARRAY(comppad) != curpad)
497 croak("panic: pad_reset curpad");
499 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
500 (unsigned long) thr, (unsigned long) curpad));
502 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad reset\n"));
503 #endif /* USE_THREADS */
504 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
505 for (po = AvMAX(comppad); po > padix_floor; po--) {
506 if (curpad[po] && !SvIMMORTAL(curpad[po]))
507 SvPADTMP_off(curpad[po]);
511 pad_reset_pending = FALSE;
515 /* find_thread_magical is not reentrant */
517 find_thread_magical(name)
524 /* We currently only handle single character magicals */
525 p = strchr(per_thread_magicals, *name);
528 key = p - per_thread_magicals;
529 svp = av_fetch(thr->magicals, key, FALSE);
531 SV *sv = NEWSV(0, 0);
532 av_store(thr->magicals, key, sv);
534 * Some magic variables used to be automagically initialised
535 * in gv_fetchpv. Those which are now per-thread magicals get
536 * initialised here instead.
540 sv_setpv(sv, "\034");
543 sv_magic(sv, 0, 0, name, 1);
544 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
545 "find_thread_magical: new SV %p for $%s%c\n",
546 sv, (*name < 32) ? "^" : "",
547 (*name < 32) ? toCTRL(*name) : *name));
551 #endif /* USE_THREADS */
559 register OP *kid, *nextkid;
561 if (!o || o->op_seq == (U16)-1)
564 if (o->op_flags & OPf_KIDS) {
565 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
566 nextkid = kid->op_sibling; /* Get before next freeing kid */
571 switch (o->op_type) {
573 o->op_targ = 0; /* Was holding old type, if any. */
576 o->op_targ = 0; /* Was holding hints. */
580 o->op_targ = 0; /* Was holding index into thr->magicals AV. */
582 #endif /* USE_THREADS */
584 if (!(o->op_flags & OPf_REF) || (check[o->op_type] != ck_ftst))
590 SvREFCNT_dec(cGVOPo->op_gv);
594 Safefree(cCOPo->cop_label);
595 SvREFCNT_dec(cCOPo->cop_filegv);
598 SvREFCNT_dec(cSVOPo->op_sv);
604 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
608 Safefree(cPVOPo->op_pv);
611 op_free(cPMOPo->op_pmreplroot);
615 pregfree(cPMOPo->op_pmregexp);
616 SvREFCNT_dec(cPMOPo->op_pmshort);
621 pad_free(o->op_targ);
630 if (o->op_type != OP_NULL && o->op_targ > 0)
631 pad_free(o->op_targ);
632 o->op_targ = o->op_type;
633 o->op_type = OP_NULL;
634 o->op_ppaddr = ppaddr[OP_NULL];
637 /* Contextualizers */
639 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
650 /* establish postfix order */
651 if (cUNOPo->op_first) {
652 o->op_next = LINKLIST(cUNOPo->op_first);
653 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
655 kid->op_next = LINKLIST(kid->op_sibling);
671 if (o && o->op_flags & OPf_KIDS) {
672 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
683 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
685 line_t oldline = curcop->cop_line;
687 if (copline != NOLINE)
688 curcop->cop_line = copline;
689 warn("Found = in conditional, should be ==");
690 curcop->cop_line = oldline;
701 /* assumes no premature commitment */
702 if (!o || (o->op_flags & OPf_WANT) || error_count
703 || o->op_type == OP_RETURN)
706 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
708 switch (o->op_type) {
710 if (o->op_private & OPpREPEAT_DOLIST)
711 null(((LISTOP*)cBINOPo->op_first)->op_first);
712 scalar(cBINOPo->op_first);
717 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
721 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
722 if (!kPMOP->op_pmreplroot)
723 deprecate("implicit split to @_");
730 if (o->op_flags & OPf_KIDS) {
731 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
737 kid = cLISTOPo->op_first;
739 while (kid = kid->op_sibling) {
745 WITH_THR(curcop = &compiling);
750 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
756 WITH_THR(curcop = &compiling);
770 /* assumes no premature commitment */
771 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
772 || o->op_type == OP_RETURN)
775 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
777 switch (o->op_type) {
779 if (!(opargs[o->op_type] & OA_FOLDCONST))
783 if (o->op_flags & OPf_STACKED)
854 if (!(o->op_private & OPpLVAL_INTRO))
855 useless = op_desc[o->op_type];
862 if (!(o->op_private & OPpLVAL_INTRO) &&
863 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
864 useless = "a variable";
869 WITH_THR(curcop = ((COP*)o)); /* for warning below */
875 useless = "a constant";
876 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
878 else if (SvPOK(sv)) {
879 if (strnEQ(SvPVX(sv), "di", 2) ||
880 strnEQ(SvPVX(sv), "ds", 2) ||
881 strnEQ(SvPVX(sv), "ig", 2))
885 null(o); /* don't execute a constant */
886 SvREFCNT_dec(sv); /* don't even remember it */
890 o->op_type = OP_PREINC; /* pre-increment is faster */
891 o->op_ppaddr = ppaddr[OP_PREINC];
895 o->op_type = OP_PREDEC; /* pre-decrement is faster */
896 o->op_ppaddr = ppaddr[OP_PREDEC];
902 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
907 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
908 WITH_THR(curcop = ((COP*)o)); /* for warning below */
909 if (o->op_flags & OPf_STACKED)
915 if (!(o->op_flags & OPf_KIDS))
924 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
931 /* all requires must return a boolean value */
932 o->op_flags &= ~OPf_WANT;
935 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
936 if (!kPMOP->op_pmreplroot)
937 deprecate("implicit split to @_");
941 if (useless && dowarn)
942 warn("Useless use of %s in void context", useless);
951 if (o && o->op_flags & OPf_KIDS) {
952 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
964 /* assumes no premature commitment */
965 if (!o || (o->op_flags & OPf_WANT) || error_count
966 || o->op_type == OP_RETURN)
969 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
971 switch (o->op_type) {
974 list(cBINOPo->op_first);
979 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
986 if (!(o->op_flags & OPf_KIDS))
988 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
989 list(cBINOPo->op_first);
990 return gen_constant_list(o);
997 kid = cLISTOPo->op_first;
999 while (kid = kid->op_sibling) {
1000 if (kid->op_sibling)
1005 WITH_THR(curcop = &compiling);
1009 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1010 if (kid->op_sibling)
1015 WITH_THR(curcop = &compiling);
1018 /* all requires must return a boolean value */
1019 o->op_flags &= ~OPf_WANT;
1032 if (o->op_type == OP_LINESEQ ||
1033 o->op_type == OP_SCOPE ||
1034 o->op_type == OP_LEAVE ||
1035 o->op_type == OP_LEAVETRY)
1038 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1039 if (kid->op_sibling) {
1043 curcop = &compiling;
1045 o->op_flags &= ~OPf_PARENS;
1046 if (hints & HINT_BLOCK_SCOPE)
1047 o->op_flags |= OPf_PARENS;
1050 o = newOP(OP_STUB, 0);
1060 if (o && o->op_flags & OPf_KIDS) {
1061 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1067 static I32 modcount;
1078 if (!o || error_count)
1081 switch (o->op_type) {
1086 if (!(o->op_private & (OPpCONST_ARYBASE)))
1088 if (eval_start && eval_start->op_type == OP_CONST) {
1089 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1093 SAVEI32(compiling.cop_arybase);
1094 compiling.cop_arybase = 0;
1096 else if (type == OP_REFGEN)
1099 croak("That use of $[ is unsupported");
1102 if (o->op_flags & OPf_PARENS)
1106 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1107 !(o->op_flags & OPf_STACKED)) {
1108 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1109 o->op_ppaddr = ppaddr[OP_RV2CV];
1110 assert(cUNOPo->op_first->op_type == OP_NULL);
1111 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1117 /* grep, foreach, subcalls, refgen */
1118 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1120 yyerror(form("Can't modify %s in %s",
1121 op_desc[o->op_type],
1122 type ? op_desc[type] : "local"));
1136 case OP_RIGHT_SHIFT:
1145 if (!(o->op_flags & OPf_STACKED))
1151 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1157 if (!type && cUNOPo->op_first->op_type != OP_GV)
1158 croak("Can't localize through a reference");
1159 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1161 return o; /* Treat \(@foo) like ordinary list. */
1165 if (scalar_mod_type(o, type))
1167 ref(cUNOPo->op_first, o->op_type);
1179 if (!type && cUNOPo->op_first->op_type != OP_GV)
1180 croak("Can't localize through a reference");
1181 ref(cUNOPo->op_first, o->op_type);
1193 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1194 return o; /* Treat \(@foo) like ordinary list. */
1195 if (scalar_mod_type(o, type))
1201 croak("Can't localize lexical variable %s",
1202 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1207 modcount++; /* XXX ??? */
1209 #endif /* USE_THREADS */
1215 if (type != OP_SASSIGN)
1221 pad_free(o->op_targ);
1222 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1223 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1224 if (o->op_flags & OPf_KIDS)
1225 mod(cBINOPo->op_first->op_sibling, type);
1230 ref(cBINOPo->op_first, o->op_type);
1231 if (type == OP_ENTERSUB &&
1232 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1233 o->op_private |= OPpLVAL_DEFER;
1240 if (o->op_flags & OPf_KIDS)
1241 mod(cLISTOPo->op_last, type);
1245 if (!(o->op_flags & OPf_KIDS))
1247 if (o->op_targ != OP_LIST) {
1248 mod(cBINOPo->op_first, type);
1253 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1257 o->op_flags |= OPf_MOD;
1259 if (type == OP_AASSIGN || type == OP_SASSIGN)
1260 o->op_flags |= OPf_SPECIAL|OPf_REF;
1262 o->op_private |= OPpLVAL_INTRO;
1263 o->op_flags &= ~OPf_SPECIAL;
1265 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1266 o->op_flags |= OPf_REF;
1271 scalar_mod_type(o, type)
1277 if (o->op_type == OP_RV2GV)
1301 case OP_RIGHT_SHIFT:
1308 case OP_ANDASSIGN: /* may work later */
1309 case OP_ORASSIGN: /* may work later */
1322 if (o && o->op_flags & OPf_KIDS) {
1323 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1336 if (!o || error_count)
1339 switch (o->op_type) {
1341 if ((type == OP_DEFINED || type == OP_LOCK) &&
1342 !(o->op_flags & OPf_STACKED)) {
1343 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1344 o->op_ppaddr = ppaddr[OP_RV2CV];
1345 assert(cUNOPo->op_first->op_type == OP_NULL);
1346 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1347 o->op_flags |= OPf_SPECIAL;
1352 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1356 ref(cUNOPo->op_first, o->op_type);
1359 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1360 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1361 : type == OP_RV2HV ? OPpDEREF_HV
1363 o->op_flags |= OPf_MOD;
1368 o->op_flags |= OPf_MOD; /* XXX ??? */
1373 o->op_flags |= OPf_REF;
1376 ref(cUNOPo->op_first, o->op_type);
1381 o->op_flags |= OPf_REF;
1386 if (!(o->op_flags & OPf_KIDS))
1388 ref(cBINOPo->op_first, type);
1392 ref(cBINOPo->op_first, o->op_type);
1393 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1394 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1395 : type == OP_RV2HV ? OPpDEREF_HV
1397 o->op_flags |= OPf_MOD;
1405 if (!(o->op_flags & OPf_KIDS))
1407 ref(cLISTOPo->op_last, type);
1423 if (!o || error_count)
1427 if (type == OP_LIST) {
1428 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1431 else if (type != OP_PADSV &&
1434 type != OP_PUSHMARK)
1436 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1439 o->op_flags |= OPf_MOD;
1440 o->op_private |= OPpLVAL_INTRO;
1449 o->op_flags |= OPf_PARENS;
1454 bind_match(type, left, right)
1462 (left->op_type == OP_RV2AV ||
1463 left->op_type == OP_RV2HV ||
1464 left->op_type == OP_PADAV ||
1465 left->op_type == OP_PADHV)) {
1466 char *desc = op_desc[(right->op_type == OP_SUBST ||
1467 right->op_type == OP_TRANS)
1468 ? right->op_type : OP_MATCH];
1469 char *sample = ((left->op_type == OP_RV2AV ||
1470 left->op_type == OP_PADAV)
1471 ? "@array" : "%hash");
1472 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1475 if (right->op_type == OP_MATCH ||
1476 right->op_type == OP_SUBST ||
1477 right->op_type == OP_TRANS) {
1478 right->op_flags |= OPf_STACKED;
1479 if (right->op_type != OP_MATCH)
1480 left = mod(left, right->op_type);
1481 if (right->op_type == OP_TRANS)
1482 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1484 o = prepend_elem(right->op_type, scalar(left), right);
1486 return newUNOP(OP_NOT, 0, scalar(o));
1490 return bind_match(type, left,
1491 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1500 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1501 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1509 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1510 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1511 o->op_type = OP_LEAVE;
1512 o->op_ppaddr = ppaddr[OP_LEAVE];
1515 if (o->op_type == OP_LINESEQ) {
1517 o->op_type = OP_SCOPE;
1518 o->op_ppaddr = ppaddr[OP_SCOPE];
1519 kid = ((LISTOP*)o)->op_first;
1520 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1521 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1526 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1537 int retval = savestack_ix;
1538 SAVEI32(comppad_name_floor);
1540 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1541 comppad_name_floor = comppad_name_fill;
1543 comppad_name_floor = 0;
1545 SAVEI32(min_intro_pending);
1546 SAVEI32(max_intro_pending);
1547 min_intro_pending = 0;
1548 SAVEI32(comppad_name_fill);
1549 SAVEI32(padix_floor);
1550 padix_floor = padix;
1551 pad_reset_pending = FALSE;
1553 hints &= ~HINT_BLOCK_SCOPE;
1558 block_end(floor, seq)
1563 int needblockscope = hints & HINT_BLOCK_SCOPE;
1564 OP* retval = scalarseq(seq);
1566 pad_reset_pending = FALSE;
1568 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1569 pad_leavemy(comppad_name_fill);
1580 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1581 eval_start = linklist(eval_root);
1582 eval_root->op_next = 0;
1588 main_root = scope(sawparens(scalarvoid(o)));
1589 curcop = &compiling;
1590 main_start = LINKLIST(main_root);
1591 main_root->op_next = 0;
1595 /* Register with debugger */
1597 CV *cv = perl_get_cv("DB::postponed", FALSE);
1601 XPUSHs((SV*)compiling.cop_filegv);
1603 perl_call_sv((SV*)cv, G_DISCARD);
1614 if (o->op_flags & OPf_PARENS)
1618 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1620 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1621 if (*s == ';' || *s == '=')
1622 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1626 in_my_stash = Nullhv;
1630 return mod(o, OP_NULL); /* a bit kludgey */
1637 if (o->op_type == OP_LIST) {
1640 o2 = newOP(OP_THREADSV, 0);
1641 o2->op_targ = find_thread_magical(";");
1643 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1644 #endif /* USE_THREADS */
1645 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1656 I32 type = o->op_type;
1659 if (opargs[type] & OA_RETSCALAR)
1661 if (opargs[type] & OA_TARGET)
1662 o->op_targ = pad_alloc(type, SVs_PADTMP);
1664 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1665 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1667 if (!(opargs[type] & OA_FOLDCONST))
1676 if (o->op_private & OPpLOCALE)
1681 goto nope; /* Don't try to run w/ errors */
1683 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1684 if (curop->op_type != OP_CONST &&
1685 curop->op_type != OP_LIST &&
1686 curop->op_type != OP_SCALAR &&
1687 curop->op_type != OP_NULL &&
1688 curop->op_type != OP_PUSHMARK) {
1693 curop = LINKLIST(o);
1698 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1699 pad_swipe(o->op_targ);
1700 else if (SvTEMP(sv)) { /* grab mortal temp? */
1701 (void)SvREFCNT_inc(sv);
1705 if (type == OP_RV2GV)
1706 return newGVOP(OP_GV, 0, (GV*)sv);
1708 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1710 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1715 SvIOK_off(sv); /* undo SvIV() damage */
1717 return newSVOP(OP_CONST, 0, sv);
1721 if (!(opargs[type] & OA_OTHERINT))
1724 if (!(hints & HINT_INTEGER)) {
1725 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1728 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1729 if (curop->op_type == OP_CONST) {
1730 if (SvIOK(((SVOP*)curop)->op_sv))
1734 if (opargs[curop->op_type] & OA_RETINTEGER)
1738 o->op_ppaddr = ppaddr[++(o->op_type)];
1745 gen_constant_list(o)
1750 I32 oldtmps_floor = tmps_floor;
1754 return o; /* Don't attempt to run with errors */
1756 op = curop = LINKLIST(o);
1762 tmps_floor = oldtmps_floor;
1764 o->op_type = OP_RV2AV;
1765 o->op_ppaddr = ppaddr[OP_RV2AV];
1766 curop = ((UNOP*)o)->op_first;
1767 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1774 convert(type, flags, o)
1782 if (!o || o->op_type != OP_LIST)
1783 o = newLISTOP(OP_LIST, 0, o, Nullop);
1785 o->op_flags &= ~OPf_WANT;
1787 if (!(opargs[type] & OA_MARK))
1788 null(cLISTOPo->op_first);
1791 o->op_ppaddr = ppaddr[type];
1792 o->op_flags |= flags;
1794 o = CHECKOP(type, o);
1795 if (o->op_type != type)
1798 if (cLISTOPo->op_children < 7) {
1799 /* XXX do we really need to do this if we're done appending?? */
1800 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1802 cLISTOPo->op_last = last; /* in case check substituted last arg */
1805 return fold_constants(o);
1808 /* List constructors */
1811 append_elem(type, first, last)
1822 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1823 return newLISTOP(type, 0, first, last);
1825 if (first->op_flags & OPf_KIDS)
1826 ((LISTOP*)first)->op_last->op_sibling = last;
1828 first->op_flags |= OPf_KIDS;
1829 ((LISTOP*)first)->op_first = last;
1831 ((LISTOP*)first)->op_last = last;
1832 ((LISTOP*)first)->op_children++;
1837 append_list(type, first, last)
1848 if (first->op_type != type)
1849 return prepend_elem(type, (OP*)first, (OP*)last);
1851 if (last->op_type != type)
1852 return append_elem(type, (OP*)first, (OP*)last);
1854 first->op_last->op_sibling = last->op_first;
1855 first->op_last = last->op_last;
1856 first->op_children += last->op_children;
1857 if (first->op_children)
1858 last->op_flags |= OPf_KIDS;
1865 prepend_elem(type, first, last)
1876 if (last->op_type == type) {
1877 if (type == OP_LIST) { /* already a PUSHMARK there */
1878 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1879 ((LISTOP*)last)->op_first->op_sibling = first;
1882 if (!(last->op_flags & OPf_KIDS)) {
1883 ((LISTOP*)last)->op_last = first;
1884 last->op_flags |= OPf_KIDS;
1886 first->op_sibling = ((LISTOP*)last)->op_first;
1887 ((LISTOP*)last)->op_first = first;
1889 ((LISTOP*)last)->op_children++;
1893 return newLISTOP(type, 0, first, last);
1901 return newOP(OP_STUB, 0);
1908 if (!o || o->op_type != OP_LIST)
1909 o = newLISTOP(OP_LIST, 0, o, Nullop);
1915 newLISTOP(type, flags, first, last)
1923 Newz(1101, listop, 1, LISTOP);
1925 listop->op_type = type;
1926 listop->op_ppaddr = ppaddr[type];
1927 listop->op_children = (first != 0) + (last != 0);
1928 listop->op_flags = flags;
1932 else if (!first && last)
1935 first->op_sibling = last;
1936 listop->op_first = first;
1937 listop->op_last = last;
1938 if (type == OP_LIST) {
1940 pushop = newOP(OP_PUSHMARK, 0);
1941 pushop->op_sibling = first;
1942 listop->op_first = pushop;
1943 listop->op_flags |= OPf_KIDS;
1945 listop->op_last = pushop;
1947 else if (listop->op_children)
1948 listop->op_flags |= OPf_KIDS;
1959 Newz(1101, o, 1, OP);
1961 o->op_ppaddr = ppaddr[type];
1962 o->op_flags = flags;
1965 o->op_private = 0 + (flags >> 8);
1966 if (opargs[type] & OA_RETSCALAR)
1968 if (opargs[type] & OA_TARGET)
1969 o->op_targ = pad_alloc(type, SVs_PADTMP);
1970 return CHECKOP(type, o);
1974 newUNOP(type, flags, first)
1982 first = newOP(OP_STUB, 0);
1983 if (opargs[type] & OA_MARK)
1984 first = force_list(first);
1986 Newz(1101, unop, 1, UNOP);
1987 unop->op_type = type;
1988 unop->op_ppaddr = ppaddr[type];
1989 unop->op_first = first;
1990 unop->op_flags = flags | OPf_KIDS;
1991 unop->op_private = 1 | (flags >> 8);
1993 unop = (UNOP*) CHECKOP(type, unop);
1997 return fold_constants((OP *) unop);
2001 newBINOP(type, flags, first, last)
2008 Newz(1101, binop, 1, BINOP);
2011 first = newOP(OP_NULL, 0);
2013 binop->op_type = type;
2014 binop->op_ppaddr = ppaddr[type];
2015 binop->op_first = first;
2016 binop->op_flags = flags | OPf_KIDS;
2019 binop->op_private = 1 | (flags >> 8);
2022 binop->op_private = 2 | (flags >> 8);
2023 first->op_sibling = last;
2026 binop = (BINOP*)CHECKOP(type, binop);
2030 binop->op_last = last = binop->op_first->op_sibling;
2032 return fold_constants((OP *)binop);
2036 pmtrans(o, expr, repl)
2041 SV *tstr = ((SVOP*)expr)->op_sv;
2042 SV *rstr = ((SVOP*)repl)->op_sv;
2045 register U8 *t = (U8*)SvPV(tstr, tlen);
2046 register U8 *r = (U8*)SvPV(rstr, rlen);
2051 register short *tbl;
2053 tbl = (short*)cPVOPo->op_pv;
2054 complement = o->op_private & OPpTRANS_COMPLEMENT;
2055 delete = o->op_private & OPpTRANS_DELETE;
2056 /* squash = o->op_private & OPpTRANS_SQUASH; */
2059 Zero(tbl, 256, short);
2060 for (i = 0; i < tlen; i++)
2062 for (i = 0, j = 0; i < 256; i++) {
2078 if (!rlen && !delete) {
2081 for (i = 0; i < 256; i++)
2083 for (i = 0, j = 0; i < tlen; i++,j++) {
2086 if (tbl[t[i]] == -1)
2092 if (tbl[t[i]] == -1)
2103 newPMOP(type, flags)
2110 Newz(1101, pmop, 1, PMOP);
2111 pmop->op_type = type;
2112 pmop->op_ppaddr = ppaddr[type];
2113 pmop->op_flags = flags;
2114 pmop->op_private = 0 | (flags >> 8);
2116 if (hints & HINT_LOCALE)
2117 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2119 /* link into pm list */
2120 if (type != OP_TRANS && curstash) {
2121 pmop->op_pmnext = HvPMROOT(curstash);
2122 HvPMROOT(curstash) = pmop;
2129 pmruntime(o, expr, repl)
2137 if (o->op_type == OP_TRANS)
2138 return pmtrans(o, expr, repl);
2140 hints |= HINT_BLOCK_SCOPE;
2143 if (expr->op_type == OP_CONST) {
2145 SV *pat = ((SVOP*)expr)->op_sv;
2146 char *p = SvPV(pat, plen);
2147 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2148 sv_setpvn(pat, "\\s+", 3);
2149 p = SvPV(pat, plen);
2150 pm->op_pmflags |= PMf_SKIPWHITE;
2152 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2153 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2154 pm->op_pmflags |= PMf_WHITE;
2159 if (pm->op_pmflags & PMf_KEEP)
2160 expr = newUNOP(OP_REGCMAYBE,0,expr);
2162 Newz(1101, rcop, 1, LOGOP);
2163 rcop->op_type = OP_REGCOMP;
2164 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2165 rcop->op_first = scalar(expr);
2166 rcop->op_flags |= OPf_KIDS;
2167 rcop->op_private = 1;
2170 /* establish postfix order */
2171 if (pm->op_pmflags & PMf_KEEP) {
2173 rcop->op_next = expr;
2174 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2177 rcop->op_next = LINKLIST(expr);
2178 expr->op_next = (OP*)rcop;
2181 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2186 if (pm->op_pmflags & PMf_EVAL)
2189 else if (repl->op_type == OP_THREADSV
2190 && strchr("&`'123456789+",
2191 per_thread_magicals[repl->op_targ]))
2195 #endif /* USE_THREADS */
2196 else if (repl->op_type == OP_CONST)
2200 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2201 if (opargs[curop->op_type] & OA_DANGEROUS) {
2203 if (curop->op_type == OP_THREADSV
2204 && strchr("&`'123456789+", curop->op_private)) {
2208 if (curop->op_type == OP_GV) {
2209 GV *gv = ((GVOP*)curop)->op_gv;
2210 if (strchr("&`'123456789+", *GvENAME(gv)))
2213 #endif /* USE_THREADS */
2214 else if (curop->op_type == OP_RV2CV)
2216 else if (curop->op_type == OP_RV2SV ||
2217 curop->op_type == OP_RV2AV ||
2218 curop->op_type == OP_RV2HV ||
2219 curop->op_type == OP_RV2GV) {
2220 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2223 else if (curop->op_type == OP_PADSV ||
2224 curop->op_type == OP_PADAV ||
2225 curop->op_type == OP_PADHV ||
2226 curop->op_type == OP_PADANY) {
2235 if (curop == repl) {
2236 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2237 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2238 prepend_elem(o->op_type, scalar(repl), o);
2241 Newz(1101, rcop, 1, LOGOP);
2242 rcop->op_type = OP_SUBSTCONT;
2243 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2244 rcop->op_first = scalar(repl);
2245 rcop->op_flags |= OPf_KIDS;
2246 rcop->op_private = 1;
2249 /* establish postfix order */
2250 rcop->op_next = LINKLIST(repl);
2251 repl->op_next = (OP*)rcop;
2253 pm->op_pmreplroot = scalar((OP*)rcop);
2254 pm->op_pmreplstart = LINKLIST(rcop);
2263 newSVOP(type, flags, sv)
2269 Newz(1101, svop, 1, SVOP);
2270 svop->op_type = type;
2271 svop->op_ppaddr = ppaddr[type];
2273 svop->op_next = (OP*)svop;
2274 svop->op_flags = flags;
2275 if (opargs[type] & OA_RETSCALAR)
2277 if (opargs[type] & OA_TARGET)
2278 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2279 return CHECKOP(type, svop);
2283 newGVOP(type, flags, gv)
2290 Newz(1101, gvop, 1, GVOP);
2291 gvop->op_type = type;
2292 gvop->op_ppaddr = ppaddr[type];
2293 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2294 gvop->op_next = (OP*)gvop;
2295 gvop->op_flags = flags;
2296 if (opargs[type] & OA_RETSCALAR)
2298 if (opargs[type] & OA_TARGET)
2299 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2300 return CHECKOP(type, gvop);
2304 newPVOP(type, flags, pv)
2310 Newz(1101, pvop, 1, PVOP);
2311 pvop->op_type = type;
2312 pvop->op_ppaddr = ppaddr[type];
2314 pvop->op_next = (OP*)pvop;
2315 pvop->op_flags = flags;
2316 if (opargs[type] & OA_RETSCALAR)
2318 if (opargs[type] & OA_TARGET)
2319 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2320 return CHECKOP(type, pvop);
2330 save_hptr(&curstash);
2331 save_item(curstname);
2336 name = SvPV(sv, len);
2337 curstash = gv_stashpvn(name,len,TRUE);
2338 sv_setpvn(curstname, name, len);
2342 sv_setpv(curstname,"<none>");
2350 utilize(aver, floor, version, id, arg)
2363 if (id->op_type != OP_CONST)
2364 croak("Module name must be constant");
2368 if(version != Nullop) {
2369 SV *vesv = ((SVOP*)version)->op_sv;
2371 if (arg == Nullop && !SvNIOK(vesv)) {
2378 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2379 croak("Version number must be constant number");
2381 /* Make copy of id so we don't free it twice */
2382 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2384 /* Fake up a method call to VERSION */
2385 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2386 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2387 append_elem(OP_LIST,
2388 prepend_elem(OP_LIST, pack, list(version)),
2389 newUNOP(OP_METHOD, 0, meth)));
2393 /* Fake up an import/unimport */
2394 if (arg && arg->op_type == OP_STUB)
2395 imop = arg; /* no import on explicit () */
2396 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2397 imop = Nullop; /* use 5.0; */
2400 /* Make copy of id so we don't free it twice */
2401 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2402 meth = newSVOP(OP_CONST, 0,
2404 ? newSVpv("import", 6)
2405 : newSVpv("unimport", 8)
2407 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2408 append_elem(OP_LIST,
2409 prepend_elem(OP_LIST, pack, list(arg)),
2410 newUNOP(OP_METHOD, 0, meth)));
2413 /* Fake up a require */
2414 rqop = newUNOP(OP_REQUIRE, 0, id);
2416 /* Fake up the BEGIN {}, which does its thing immediately. */
2418 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2420 append_elem(OP_LINESEQ,
2421 append_elem(OP_LINESEQ,
2422 newSTATEOP(0, Nullch, rqop),
2423 newSTATEOP(0, Nullch, veop)),
2424 newSTATEOP(0, Nullch, imop) ));
2431 newSLICEOP(flags, subscript, listval)
2436 return newBINOP(OP_LSLICE, flags,
2437 list(force_list(subscript)),
2438 list(force_list(listval)) );
2448 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2449 o = cUNOPo->op_first;
2451 if (o->op_type == OP_COND_EXPR) {
2452 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2453 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2458 yyerror("Assignment to both a list and a scalar");
2462 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2463 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2464 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2467 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2470 if (o->op_type == OP_RV2SV)
2477 newASSIGNOP(flags, left, optype, right)
2486 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2487 return newLOGOP(optype, 0,
2488 mod(scalar(left), optype),
2489 newUNOP(OP_SASSIGN, 0, scalar(right)));
2492 return newBINOP(optype, OPf_STACKED,
2493 mod(scalar(left), optype), scalar(right));
2497 if (list_assignment(left)) {
2499 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2500 left = mod(left, OP_AASSIGN);
2508 o = newBINOP(OP_AASSIGN, flags,
2509 list(force_list(right)),
2510 list(force_list(left)) );
2511 o->op_private = 0 | (flags >> 8);
2512 if (!(left->op_private & OPpLVAL_INTRO)) {
2513 static int generation = 100;
2517 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2518 if (opargs[curop->op_type] & OA_DANGEROUS) {
2519 if (curop->op_type == OP_GV) {
2520 GV *gv = ((GVOP*)curop)->op_gv;
2521 if (gv == defgv || SvCUR(gv) == generation)
2523 SvCUR(gv) = generation;
2525 else if (curop->op_type == OP_PADSV ||
2526 curop->op_type == OP_PADAV ||
2527 curop->op_type == OP_PADHV ||
2528 curop->op_type == OP_PADANY) {
2529 SV **svp = AvARRAY(comppad_name);
2530 SV *sv = svp[curop->op_targ];
2531 if (SvCUR(sv) == generation)
2533 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2535 else if (curop->op_type == OP_RV2CV)
2537 else if (curop->op_type == OP_RV2SV ||
2538 curop->op_type == OP_RV2AV ||
2539 curop->op_type == OP_RV2HV ||
2540 curop->op_type == OP_RV2GV) {
2541 if (lastop->op_type != OP_GV) /* funny deref? */
2550 o->op_private = OPpASSIGN_COMMON;
2552 if (right && right->op_type == OP_SPLIT) {
2554 if ((tmpop = ((LISTOP*)right)->op_first) &&
2555 tmpop->op_type == OP_PUSHRE)
2557 PMOP *pm = (PMOP*)tmpop;
2558 if (left->op_type == OP_RV2AV &&
2559 !(left->op_private & OPpLVAL_INTRO) &&
2560 !(o->op_private & OPpASSIGN_COMMON) )
2562 tmpop = ((UNOP*)left)->op_first;
2563 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2564 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2565 pm->op_pmflags |= PMf_ONCE;
2566 tmpop = cUNOPo->op_first; /* to list (nulled) */
2567 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2568 tmpop->op_sibling = Nullop; /* don't free split */
2569 right->op_next = tmpop->op_next; /* fix starting loc */
2570 op_free(o); /* blow off assign */
2571 right->op_flags &= ~OPf_WANT;
2572 /* "I don't know and I don't care." */
2577 if (modcount < 10000 &&
2578 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2580 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2582 sv_setiv(sv, modcount+1);
2590 right = newOP(OP_UNDEF, 0);
2591 if (right->op_type == OP_READLINE) {
2592 right->op_flags |= OPf_STACKED;
2593 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2596 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2597 o = newBINOP(OP_SASSIGN, flags,
2598 scalar(right), mod(scalar(left), OP_SASSIGN) );
2610 newSTATEOP(flags, label, o)
2616 U32 seq = intro_my();
2619 Newz(1101, cop, 1, COP);
2620 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2621 cop->op_type = OP_DBSTATE;
2622 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2625 cop->op_type = OP_NEXTSTATE;
2626 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2628 cop->op_flags = flags;
2629 cop->op_private = 0 | (flags >> 8);
2631 cop->op_private |= NATIVE_HINTS;
2633 cop->op_next = (OP*)cop;
2636 cop->cop_label = label;
2637 hints |= HINT_BLOCK_SCOPE;
2640 cop->cop_arybase = curcop->cop_arybase;
2642 if (copline == NOLINE)
2643 cop->cop_line = curcop->cop_line;
2645 cop->cop_line = copline;
2648 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2649 cop->cop_stash = curstash;
2651 if (PERLDB_LINE && curstash != debstash) {
2652 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2653 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2654 (void)SvIOK_on(*svp);
2656 SvSTASH(*svp) = (HV*)cop;
2660 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2663 /* "Introduce" my variables to visible status. */
2671 if (! min_intro_pending)
2674 svp = AvARRAY(comppad_name);
2675 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2676 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2677 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2678 SvNVX(sv) = (double)cop_seqmax;
2681 min_intro_pending = 0;
2682 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2683 return cop_seqmax++;
2687 newLOGOP(type, flags, first, other)
2697 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2698 return newBINOP(type, flags, scalar(first), scalar(other));
2700 scalarboolean(first);
2701 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2702 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2703 if (type == OP_AND || type == OP_OR) {
2709 first = cUNOPo->op_first;
2711 first->op_next = o->op_next;
2712 cUNOPo->op_first = Nullop;
2716 if (first->op_type == OP_CONST) {
2717 if (dowarn && (first->op_private & OPpCONST_BARE))
2718 warn("Probable precedence problem on %s", op_desc[type]);
2719 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2728 else if (first->op_type == OP_WANTARRAY) {
2734 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2735 OP *k1 = ((UNOP*)first)->op_first;
2736 OP *k2 = k1->op_sibling;
2738 switch (first->op_type)
2741 if (k2 && k2->op_type == OP_READLINE
2742 && (k2->op_flags & OPf_STACKED)
2743 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2744 warnop = k2->op_type;
2748 if (k1->op_type == OP_READDIR
2749 || k1->op_type == OP_GLOB
2750 || k1->op_type == OP_EACH)
2751 warnop = k1->op_type;
2755 line_t oldline = curcop->cop_line;
2756 curcop->cop_line = copline;
2757 warn("Value of %s%s can be \"0\"; test with defined()",
2759 ((warnop == OP_READLINE || warnop == OP_GLOB)
2760 ? " construct" : "() operator"));
2761 curcop->cop_line = oldline;
2768 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2769 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2771 Newz(1101, logop, 1, LOGOP);
2773 logop->op_type = type;
2774 logop->op_ppaddr = ppaddr[type];
2775 logop->op_first = first;
2776 logop->op_flags = flags | OPf_KIDS;
2777 logop->op_other = LINKLIST(other);
2778 logop->op_private = 1 | (flags >> 8);
2780 /* establish postfix order */
2781 logop->op_next = LINKLIST(first);
2782 first->op_next = (OP*)logop;
2783 first->op_sibling = other;
2785 o = newUNOP(OP_NULL, 0, (OP*)logop);
2792 newCONDOP(flags, first, trueop, falseop)
2803 return newLOGOP(OP_AND, 0, first, trueop);
2805 return newLOGOP(OP_OR, 0, first, falseop);
2807 scalarboolean(first);
2808 if (first->op_type == OP_CONST) {
2809 if (SvTRUE(((SVOP*)first)->op_sv)) {
2820 else if (first->op_type == OP_WANTARRAY) {
2824 Newz(1101, condop, 1, CONDOP);
2826 condop->op_type = OP_COND_EXPR;
2827 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2828 condop->op_first = first;
2829 condop->op_flags = flags | OPf_KIDS;
2830 condop->op_true = LINKLIST(trueop);
2831 condop->op_false = LINKLIST(falseop);
2832 condop->op_private = 1 | (flags >> 8);
2834 /* establish postfix order */
2835 condop->op_next = LINKLIST(first);
2836 first->op_next = (OP*)condop;
2838 first->op_sibling = trueop;
2839 trueop->op_sibling = falseop;
2840 o = newUNOP(OP_NULL, 0, (OP*)condop);
2842 trueop->op_next = o;
2843 falseop->op_next = o;
2849 newRANGE(flags, left, right)
2860 Newz(1101, condop, 1, CONDOP);
2862 condop->op_type = OP_RANGE;
2863 condop->op_ppaddr = ppaddr[OP_RANGE];
2864 condop->op_first = left;
2865 condop->op_flags = OPf_KIDS;
2866 condop->op_true = LINKLIST(left);
2867 condop->op_false = LINKLIST(right);
2868 condop->op_private = 1 | (flags >> 8);
2870 left->op_sibling = right;
2872 condop->op_next = (OP*)condop;
2873 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2874 flop = newUNOP(OP_FLOP, 0, flip);
2875 o = newUNOP(OP_NULL, 0, flop);
2878 left->op_next = flip;
2879 right->op_next = flop;
2881 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2882 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2883 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2884 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2886 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2887 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2890 if (!flip->op_private || !flop->op_private)
2891 linklist(o); /* blow off optimizer unless constant */
2897 newLOOPOP(flags, debuggable, expr, block)
2906 int once = block && block->op_flags & OPf_SPECIAL &&
2907 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2910 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2911 return block; /* do {} while 0 does once */
2912 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2913 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2914 expr = newUNOP(OP_DEFINED, 0,
2915 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2919 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2920 o = newLOGOP(OP_AND, 0, expr, listop);
2922 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2924 if (once && o != listop)
2925 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2928 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2930 o->op_flags |= flags;
2932 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2937 newWHILEOP(flags, debuggable, loop, whileline, expr, block, cont)
2953 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2954 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2955 expr = newUNOP(OP_DEFINED, 0,
2956 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2960 block = newOP(OP_NULL, 0);
2963 next = LINKLIST(cont);
2965 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2966 if ((line_t)whileline != NOLINE) {
2967 copline = whileline;
2968 cont = append_elem(OP_LINESEQ, cont,
2969 newSTATEOP(0, Nullch, Nullop));
2973 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2974 redo = LINKLIST(listop);
2977 o = newLOGOP(OP_AND, 0, expr, scalar(listop));
2978 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2979 op_free(expr); /* oops, it's a while (0) */
2981 return Nullop; /* (listop already freed by newLOGOP) */
2983 ((LISTOP*)listop)->op_last->op_next = condop =
2984 (o == listop ? redo : LINKLIST(o));
2992 Newz(1101,loop,1,LOOP);
2993 loop->op_type = OP_ENTERLOOP;
2994 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2995 loop->op_private = 0;
2996 loop->op_next = (OP*)loop;
2999 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3001 loop->op_redoop = redo;
3002 loop->op_lastop = o;
3005 loop->op_nextop = next;
3007 loop->op_nextop = o;
3009 o->op_flags |= flags;
3010 o->op_private |= (flags >> 8);
3015 #ifndef CAN_PROTOTYPE
3016 newFOROP(flags,label,forline,sv,expr,block,cont)
3025 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3026 #endif /* CAN_PROTOTYPE */
3034 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3035 sv->op_type = OP_RV2GV;
3036 sv->op_ppaddr = ppaddr[OP_RV2GV];
3038 else if (sv->op_type == OP_PADSV) { /* private variable */
3039 padoff = sv->op_targ;
3044 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3047 sv = newGVOP(OP_GV, 0, defgv);
3049 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3050 expr = scalar(ref(expr, OP_ITER));
3051 iterflags |= OPf_STACKED;
3053 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3054 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
3056 assert(!loop->op_next);
3057 Renew(loop, 1, LOOP);
3058 loop->op_targ = padoff;
3059 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3061 return newSTATEOP(0, label, wop);
3065 newLOOPEX(type, label)
3071 if (type != OP_GOTO || label->op_type == OP_CONST) {
3072 o = newPVOP(type, 0, savepv(
3073 label->op_type == OP_CONST
3074 ? SvPVx(((SVOP*)label)->op_sv, na)
3079 if (label->op_type == OP_ENTERSUB)
3080 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3081 o = newUNOP(type, OPf_STACKED, label);
3083 hints |= HINT_BLOCK_SCOPE;
3094 MUTEX_DESTROY(CvMUTEXP(cv));
3095 Safefree(CvMUTEXP(cv));
3098 #endif /* USE_THREADS */
3100 if (!CvXSUB(cv) && CvROOT(cv)) {
3102 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3103 croak("Can't undef active subroutine");
3106 croak("Can't undef active subroutine");
3107 #endif /* USE_THREADS */
3114 op_free(CvROOT(cv));
3115 CvROOT(cv) = Nullop;
3118 SvPOK_off((SV*)cv); /* forget prototype */
3120 SvREFCNT_dec(CvGV(cv));
3122 SvREFCNT_dec(CvOUTSIDE(cv));
3123 CvOUTSIDE(cv) = Nullcv;
3124 if (CvPADLIST(cv)) {
3125 /* may be during global destruction */
3126 if (SvREFCNT(CvPADLIST(cv))) {
3127 I32 i = AvFILL(CvPADLIST(cv));
3129 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3130 SV* sv = svp ? *svp : Nullsv;
3133 if (sv == (SV*)comppad_name)
3134 comppad_name = Nullav;
3135 else if (sv == (SV*)comppad) {
3137 curpad = Null(SV**);
3141 SvREFCNT_dec((SV*)CvPADLIST(cv));
3143 CvPADLIST(cv) = Nullav;
3147 #ifdef DEBUG_CLOSURES
3152 CV *outside = CvOUTSIDE(cv);
3153 AV* padlist = CvPADLIST(cv);
3160 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3162 (CvANON(cv) ? "ANON"
3163 : (cv == main_cv) ? "MAIN"
3164 : CvUNIQUE(outside) ? "UNIQUE"
3165 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3168 : CvANON(outside) ? "ANON"
3169 : (outside == main_cv) ? "MAIN"
3170 : CvUNIQUE(outside) ? "UNIQUE"
3171 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3176 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3177 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3178 pname = AvARRAY(pad_name);
3179 ppad = AvARRAY(pad);
3181 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
3182 if (SvPOK(pname[ix]))
3183 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3185 SvFAKE(pname[ix]) ? "FAKE " : "",
3187 (long)I_32(SvNVX(pname[ix])),
3188 (long)SvIVX(pname[ix]));
3191 #endif /* DEBUG_CLOSURES */
3194 cv_clone2(proto, outside)
3201 AV* protopadlist = CvPADLIST(proto);
3202 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3203 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3204 SV** pname = AvARRAY(protopad_name);
3205 SV** ppad = AvARRAY(protopad);
3206 I32 fname = AvFILL(protopad_name);
3207 I32 fpad = AvFILL(protopad);
3211 assert(!CvUNIQUE(proto));
3216 SAVESPTR(comppad_name);
3219 cv = compcv = (CV*)NEWSV(1104,0);
3220 sv_upgrade((SV *)cv, SvTYPE(proto));
3226 New(666, CvMUTEXP(cv), 1, perl_mutex);
3227 MUTEX_INIT(CvMUTEXP(cv));
3229 #endif /* USE_THREADS */
3230 CvFILEGV(cv) = CvFILEGV(proto);
3231 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3232 CvSTASH(cv) = CvSTASH(proto);
3233 CvROOT(cv) = CvROOT(proto);
3234 CvSTART(cv) = CvSTART(proto);
3236 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3239 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3241 comppad_name = newAV();
3242 for (ix = fname; ix >= 0; ix--)
3243 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3247 comppadlist = newAV();
3248 AvREAL_off(comppadlist);
3249 av_store(comppadlist, 0, (SV*)comppad_name);
3250 av_store(comppadlist, 1, (SV*)comppad);
3251 CvPADLIST(cv) = comppadlist;
3252 av_fill(comppad, AvFILL(protopad));
3253 curpad = AvARRAY(comppad);
3255 av = newAV(); /* will be @_ */
3257 av_store(comppad, 0, (SV*)av);
3258 AvFLAGS(av) = AVf_REIFY;
3260 for (ix = fpad; ix > 0; ix--) {
3261 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3262 if (namesv && namesv != &sv_undef) {
3263 char *name = SvPVX(namesv); /* XXX */
3264 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3265 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3266 CvOUTSIDE(cv), cxstack_ix);
3268 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3270 croak("panic: cv_clone: %s", name);
3272 else { /* our own lexical */
3275 /* anon code -- we'll come back for it */
3276 sv = SvREFCNT_inc(ppad[ix]);
3278 else if (*name == '@')
3280 else if (*name == '%')
3290 SV* sv = NEWSV(0,0);
3296 /* Now that vars are all in place, clone nested closures. */
3298 for (ix = fpad; ix > 0; ix--) {
3299 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3301 && namesv != &sv_undef
3302 && !(SvFLAGS(namesv) & SVf_FAKE)
3303 && *SvPVX(namesv) == '&'
3304 && CvCLONE(ppad[ix]))
3306 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3307 SvREFCNT_dec(ppad[ix]);
3310 curpad[ix] = (SV*)kid;
3314 #ifdef DEBUG_CLOSURES
3315 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3317 PerlIO_printf(Perl_debug_log, " from:\n");
3319 PerlIO_printf(Perl_debug_log, " to:\n");
3331 return cv_clone2(proto, CvOUTSIDE(proto));
3335 cv_ckproto(cv, gv, p)
3340 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3341 SV* msg = sv_newmortal();
3345 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3346 sv_setpv(msg, "Prototype mismatch:");
3348 sv_catpvf(msg, " sub %_", name);
3350 sv_catpvf(msg, " (%s)", SvPVX(cv));
3351 sv_catpv(msg, " vs ");
3353 sv_catpvf(msg, "(%s)", p);
3355 sv_catpv(msg, "none");
3367 if (!cv || !SvPOK(cv) || SvCUR(cv))
3371 for (o = CvSTART(cv); o; o = o->op_next) {
3372 OPCODE type = o->op_type;
3374 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3376 if (type == OP_LEAVESUB || type == OP_RETURN)
3380 if (type == OP_CONST)
3382 else if (type == OP_PADSV) {
3383 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3384 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3385 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3397 newSUB(floor,o,proto,block)
3404 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3405 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3406 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3415 if (!name || GvCVGEN(gv))
3417 else if (cv = GvCV(gv)) {
3418 cv_ckproto(cv, gv, ps);
3419 /* already defined (or promised)? */
3420 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3423 /* just a "sub foo;" when &foo is already defined */
3427 /* ahem, death to those who redefine active sort subs */
3428 if (curstack == sortstack && sortcop == CvSTART(cv))
3429 croak("Can't redefine active sort subroutine %s", name);
3430 const_sv = cv_const_sv(cv);
3431 if (const_sv || dowarn) {
3432 line_t oldline = curcop->cop_line;
3433 curcop->cop_line = copline;
3434 warn(const_sv ? "Constant subroutine %s redefined"
3435 : "Subroutine %s redefined", name);
3436 curcop->cop_line = oldline;
3442 if (cv) { /* must reuse cv if autoloaded */
3444 CvFLAGS(cv) = CvFLAGS(compcv);
3445 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3446 CvOUTSIDE(compcv) = 0;
3447 CvPADLIST(cv) = CvPADLIST(compcv);
3448 CvPADLIST(compcv) = 0;
3449 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3450 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3451 SvREFCNT_dec(compcv);
3461 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3462 CvFILEGV(cv) = curcop->cop_filegv;
3463 CvSTASH(cv) = curstash;
3466 New(666, CvMUTEXP(cv), 1, perl_mutex);
3467 MUTEX_INIT(CvMUTEXP(cv));
3468 #endif /* USE_THREADS */
3471 sv_setpv((SV*)cv, ps);
3477 char *s = strrchr(name, ':');
3479 if (strEQ(s, "BEGIN")) {
3481 "BEGIN not safe after errors--compilation aborted";
3485 /* force display of errors found but not reported */
3486 sv_catpv(ERRSV, not_safe);
3487 croak("%s", SvPVx(ERRSV, na));
3498 if (AvFILL(comppad_name) < AvFILL(comppad))
3499 av_store(comppad_name, AvFILL(comppad), Nullsv);
3502 SV **namep = AvARRAY(comppad_name);
3503 for (ix = AvFILL(comppad); ix > 0; ix--) {
3506 if (SvIMMORTAL(curpad[ix]))
3509 * The only things that a clonable function needs in its
3510 * pad are references to outer lexicals and anonymous subs.
3511 * The rest are created anew during cloning.
3513 if (!((namesv = namep[ix]) != Nullsv &&
3514 namesv != &sv_undef &&
3516 *SvPVX(namesv) == '&')))
3518 SvREFCNT_dec(curpad[ix]);
3519 curpad[ix] = Nullsv;
3524 AV *av = newAV(); /* Will be @_ */
3526 av_store(comppad, 0, (SV*)av);
3527 AvFLAGS(av) = AVf_REIFY;
3529 for (ix = AvFILL(comppad); ix > 0; ix--) {
3530 if (SvIMMORTAL(curpad[ix]))
3532 if (!SvPADMY(curpad[ix]))
3533 SvPADTMP_on(curpad[ix]);
3537 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3538 CvSTART(cv) = LINKLIST(CvROOT(cv));
3539 CvROOT(cv)->op_next = 0;
3545 if (PERLDB_SUBLINE && curstash != debstash) {
3546 SV *sv = NEWSV(0,0);
3547 SV *tmpstr = sv_newmortal();
3548 static GV *db_postponed;
3552 sv_setpvf(sv, "%_:%ld-%ld",
3553 GvSV(curcop->cop_filegv),
3554 (long)subline, (long)curcop->cop_line);
3555 gv_efullname3(tmpstr, gv, Nullch);
3556 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3557 if (!db_postponed) {
3558 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3560 hv = GvHVn(db_postponed);
3561 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3562 && (cv = GvCV(db_postponed))) {
3567 perl_call_sv((SV*)cv, G_DISCARD);
3571 if ((s = strrchr(name,':')))
3575 if (strEQ(s, "BEGIN")) {
3576 I32 oldscope = scopestack_ix;
3578 SAVESPTR(compiling.cop_filegv);
3579 SAVEI16(compiling.cop_line);
3586 DEBUG_x( dump_sub(gv) );
3587 av_push(beginav, (SV *)cv);
3589 call_list(oldscope, beginav);
3591 curcop = &compiling;
3594 else if (strEQ(s, "END") && !error_count) {
3597 av_unshift(endav, 1);
3598 av_store(endav, 0, (SV *)cv);
3601 else if (strEQ(s, "INIT") && !error_count) {
3604 av_push(initav, SvREFCNT_inc(cv));
3615 newXS(name, subaddr, filename)
3617 void (*subaddr) _((CV*));
3621 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3624 if (cv = (name ? GvCV(gv) : Nullcv)) {
3626 /* just a cached method */
3630 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3631 /* already defined (or promised) */
3633 line_t oldline = curcop->cop_line;
3634 curcop->cop_line = copline;
3635 warn("Subroutine %s redefined",name);
3636 curcop->cop_line = oldline;
3643 if (cv) /* must reuse cv if autoloaded */
3646 cv = (CV*)NEWSV(1105,0);
3647 sv_upgrade((SV *)cv, SVt_PVCV);
3654 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3656 New(666, CvMUTEXP(cv), 1, perl_mutex);
3657 MUTEX_INIT(CvMUTEXP(cv));
3659 #endif /* USE_THREADS */
3660 CvFILEGV(cv) = gv_fetchfile(filename);
3661 CvXSUB(cv) = subaddr;
3664 char *s = strrchr(name,':');
3669 if (strEQ(s, "BEGIN")) {
3672 av_push(beginav, (SV *)cv);
3675 else if (strEQ(s, "END")) {
3678 av_unshift(endav, 1);
3679 av_store(endav, 0, (SV *)cv);
3682 else if (strEQ(s, "INIT")) {
3685 av_push(initav, (SV *)cv);
3695 newFORM(floor,o,block)
3707 name = SvPVx(cSVOPo->op_sv, na);
3710 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3712 if (cv = GvFORM(gv)) {
3714 line_t oldline = curcop->cop_line;
3716 curcop->cop_line = copline;
3717 warn("Format %s redefined",name);
3718 curcop->cop_line = oldline;
3724 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3725 CvFILEGV(cv) = curcop->cop_filegv;
3727 for (ix = AvFILL(comppad); ix > 0; ix--) {
3728 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3729 SvPADTMP_on(curpad[ix]);
3732 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3733 CvSTART(cv) = LINKLIST(CvROOT(cv));
3734 CvROOT(cv)->op_next = 0;
3745 return newUNOP(OP_REFGEN, 0,
3746 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3753 return newUNOP(OP_REFGEN, 0,
3754 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3758 newANONSUB(floor, proto, block)
3763 return newUNOP(OP_REFGEN, 0,
3764 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3771 switch (o->op_type) {
3773 o->op_type = OP_PADAV;
3774 o->op_ppaddr = ppaddr[OP_PADAV];
3775 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3778 o->op_type = OP_RV2AV;
3779 o->op_ppaddr = ppaddr[OP_RV2AV];
3784 warn("oops: oopsAV");
3794 switch (o->op_type) {
3797 o->op_type = OP_PADHV;
3798 o->op_ppaddr = ppaddr[OP_PADHV];
3799 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3803 o->op_type = OP_RV2HV;
3804 o->op_ppaddr = ppaddr[OP_RV2HV];
3809 warn("oops: oopsHV");
3819 if (o->op_type == OP_PADANY) {
3820 o->op_type = OP_PADAV;
3821 o->op_ppaddr = ppaddr[OP_PADAV];
3824 return newUNOP(OP_RV2AV, 0, scalar(o));
3832 if (type == OP_MAPSTART)
3833 return newUNOP(OP_NULL, 0, o);
3834 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3841 if (o->op_type == OP_PADANY) {
3842 o->op_type = OP_PADHV;
3843 o->op_ppaddr = ppaddr[OP_PADHV];
3846 return newUNOP(OP_RV2HV, 0, scalar(o));
3853 croak("NOT IMPL LINE %d",__LINE__);
3863 return newUNOP(OP_RV2CV, flags, scalar(o));
3870 if (o->op_type == OP_PADANY) {
3871 o->op_type = OP_PADSV;
3872 o->op_ppaddr = ppaddr[OP_PADSV];
3875 else if (o->op_type == OP_THREADSV)
3877 return newUNOP(OP_RV2SV, 0, scalar(o));
3880 /* Check routines. */
3889 name = NEWSV(1106,0);
3890 sv_upgrade(name, SVt_PVNV);
3891 sv_setpvn(name, "&", 1);
3894 ix = pad_alloc(o->op_type, SVs_PADMY);
3895 av_store(comppad_name, ix, name);
3896 av_store(comppad, ix, cSVOPo->op_sv);
3897 SvPADMY_on(cSVOPo->op_sv);
3898 cSVOPo->op_sv = Nullsv;
3899 cSVOPo->op_targ = ix;
3907 o->op_private = hints;
3915 if (cUNOPo->op_first->op_type == OP_CONCAT)
3916 o->op_flags |= OPf_STACKED;
3924 if (o->op_flags & OPf_KIDS) {
3927 OPCODE type = o->op_type;
3928 o = modkids(ck_fun(o), type);
3929 kid = cUNOPo->op_first;
3930 newop = kUNOP->op_first->op_sibling;
3932 (newop->op_sibling ||
3933 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3934 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3935 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3939 op_free(kUNOP->op_first);
3940 kUNOP->op_first = newop;
3942 o->op_ppaddr = ppaddr[++o->op_type];
3952 if (o->op_flags & OPf_KIDS) {
3953 OP *kid = cUNOPo->op_first;
3954 if (kid->op_type == OP_HSLICE)
3955 o->op_private |= OPpSLICE;
3956 else if (kid->op_type != OP_HELEM)
3957 croak("%s argument is not a HASH element or slice",
3958 op_desc[o->op_type]);
3968 I32 type = o->op_type;
3970 if (o->op_flags & OPf_KIDS) {
3971 if (cLISTOPo->op_first->op_type == OP_STUB) {
3973 o = newUNOP(type, OPf_SPECIAL,
3974 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3985 hints |= HINT_BLOCK_SCOPE;
3986 if (o->op_flags & OPf_KIDS) {
3987 SVOP *kid = (SVOP*)cUNOPo->op_first;
3990 o->op_flags &= ~OPf_KIDS;
3993 else if (kid->op_type == OP_LINESEQ) {
3996 kid->op_next = o->op_next;
3997 cUNOPo->op_first = 0;
4000 Newz(1101, enter, 1, LOGOP);
4001 enter->op_type = OP_ENTERTRY;
4002 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4003 enter->op_private = 0;
4005 /* establish postfix order */
4006 enter->op_next = (OP*)enter;
4008 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4009 o->op_type = OP_LEAVETRY;
4010 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4011 enter->op_other = o;
4017 o = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4019 o->op_targ = (PADOFFSET)hints;
4028 if (o->op_flags & OPf_STACKED) {
4030 kid = cUNOPo->op_first->op_sibling;
4031 if (kid->op_type == OP_RV2GV)
4044 if (o->op_flags & OPf_KIDS) {
4045 OP *kid = cUNOPo->op_first;
4046 if (kid->op_type != OP_HELEM)
4047 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4057 o = fold_constants(o);
4058 if (o->op_type == OP_CONST)
4068 SVOP *kid = (SVOP*)cUNOPo->op_first;
4070 o->op_private |= (hints & HINT_STRICT_REFS);
4071 if (kid->op_type == OP_CONST) {
4076 name = SvPV(kid->op_sv, na);
4077 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4078 char *badthing = Nullch;
4079 switch (o->op_type) {
4081 badthing = "a SCALAR";
4084 badthing = "an ARRAY";
4087 badthing = "a HASH";
4092 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4095 kid->op_type = OP_GV;
4096 iscv = (o->op_type == OP_RV2CV) * 2;
4097 for (gv = 0; !gv; iscv++) {
4099 * This is a little tricky. We only want to add the symbol if we
4100 * didn't add it in the lexer. Otherwise we get duplicate strict
4101 * warnings. But if we didn't add it in the lexer, we must at
4102 * least pretend like we wanted to add it even if it existed before,
4103 * or we get possible typo warnings. OPpCONST_ENTERED says
4104 * whether the lexer already added THIS instance of this symbol.
4106 gv = gv_fetchpv(name,
4107 iscv | !(kid->op_private & OPpCONST_ENTERED),
4110 : o->op_type == OP_RV2SV
4112 : o->op_type == OP_RV2AV
4114 : o->op_type == OP_RV2HV
4118 SvREFCNT_dec(kid->op_sv);
4119 kid->op_sv = SvREFCNT_inc(gv);
4129 I32 type = o->op_type;
4131 if (o->op_flags & OPf_REF)
4134 if (o->op_flags & OPf_KIDS) {
4135 SVOP *kid = (SVOP*)cUNOPo->op_first;
4137 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4138 OP *newop = newGVOP(type, OPf_REF,
4139 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4146 if (type == OP_FTTTY)
4147 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4150 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4164 int type = o->op_type;
4165 register I32 oa = opargs[type] >> OASHIFT;
4167 if (o->op_flags & OPf_STACKED) {
4168 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4171 return no_fh_allowed(o);
4174 if (o->op_flags & OPf_KIDS) {
4175 tokid = &cLISTOPo->op_first;
4176 kid = cLISTOPo->op_first;
4177 if (kid->op_type == OP_PUSHMARK ||
4178 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4180 tokid = &kid->op_sibling;
4181 kid = kid->op_sibling;
4183 if (!kid && opargs[type] & OA_DEFGV)
4184 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
4188 sibl = kid->op_sibling;
4202 if (kid->op_type == OP_CONST &&
4203 (kid->op_private & OPpCONST_BARE)) {
4204 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4205 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4206 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4208 warn("Array @%s missing the @ in argument %ld of %s()",
4209 name, (long)numargs, op_desc[type]);
4212 kid->op_sibling = sibl;
4215 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4216 bad_type(numargs, "array", op_desc[o->op_type], kid);
4220 if (kid->op_type == OP_CONST &&
4221 (kid->op_private & OPpCONST_BARE)) {
4222 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4223 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4224 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4226 warn("Hash %%%s missing the %% in argument %ld of %s()",
4227 name, (long)numargs, op_desc[type]);
4230 kid->op_sibling = sibl;
4233 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4234 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4239 OP *newop = newUNOP(OP_NULL, 0, kid);
4240 kid->op_sibling = 0;
4242 newop->op_next = newop;
4244 kid->op_sibling = sibl;
4249 if (kid->op_type != OP_GV) {
4250 if (kid->op_type == OP_CONST &&
4251 (kid->op_private & OPpCONST_BARE)) {
4252 OP *newop = newGVOP(OP_GV, 0,
4253 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4259 kid->op_sibling = 0;
4260 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4262 kid->op_sibling = sibl;
4268 mod(scalar(kid), type);
4272 tokid = &kid->op_sibling;
4273 kid = kid->op_sibling;
4275 o->op_private |= numargs;
4277 return too_many_arguments(o,op_desc[o->op_type]);
4280 else if (opargs[type] & OA_DEFGV) {
4282 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4286 while (oa & OA_OPTIONAL)
4288 if (oa && oa != OA_LIST)
4289 return too_few_arguments(o,op_desc[o->op_type]);
4300 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4301 append_elem(OP_GLOB, o, newSVREF(newGVOP(OP_GV, 0, defgv)));
4303 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4304 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4306 if (gv && GvIMPORTED_CV(gv)) {
4307 static int glob_index;
4309 append_elem(OP_GLOB, o,
4310 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4311 o->op_type = OP_LIST;
4312 o->op_ppaddr = ppaddr[OP_LIST];
4313 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4314 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4315 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4316 append_elem(OP_LIST, o,
4317 scalar(newUNOP(OP_RV2CV, 0,
4318 newGVOP(OP_GV, 0, gv)))));
4319 o = newUNOP(OP_NULL, 0, ck_subr(o));
4320 o->op_targ = OP_GLOB; /* hint at what it used to be */
4323 gv = newGVgen("main");
4325 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4336 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4338 o->op_ppaddr = ppaddr[OP_GREPSTART];
4339 Newz(1101, gwop, 1, LOGOP);
4341 if (o->op_flags & OPf_STACKED) {
4344 kid = cLISTOPo->op_first->op_sibling;
4345 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4348 kid->op_next = (OP*)gwop;
4349 o->op_flags &= ~OPf_STACKED;
4351 kid = cLISTOPo->op_first->op_sibling;
4352 if (type == OP_MAPWHILE)
4359 kid = cLISTOPo->op_first->op_sibling;
4360 if (kid->op_type != OP_NULL)
4361 croak("panic: ck_grep");
4362 kid = kUNOP->op_first;
4364 gwop->op_type = type;
4365 gwop->op_ppaddr = ppaddr[type];
4366 gwop->op_first = listkids(o);
4367 gwop->op_flags |= OPf_KIDS;
4368 gwop->op_private = 1;
4369 gwop->op_other = LINKLIST(kid);
4370 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4371 kid->op_next = (OP*)gwop;
4373 kid = cLISTOPo->op_first->op_sibling;
4374 if (!kid || !kid->op_sibling)
4375 return too_few_arguments(o,op_desc[o->op_type]);
4376 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4377 mod(kid, OP_GREPSTART);
4386 if (o->op_flags & OPf_KIDS) {
4387 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4388 if (kid && kid->op_type == OP_CONST)
4389 fbm_compile(((SVOP*)kid)->op_sv);
4398 /* XXX length optimization goes here */
4406 OPCODE type = o->op_type;
4407 return modkids(ck_fun(o), type);
4414 OPCODE type = o->op_type;
4415 return refkids(ck_fun(o), type);
4424 kid = cLISTOPo->op_first;
4427 kid = cLISTOPo->op_first;
4429 if (kid->op_type == OP_PUSHMARK)
4430 kid = kid->op_sibling;
4431 if (kid && o->op_flags & OPf_STACKED)
4432 kid = kid->op_sibling;
4433 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4434 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4435 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4436 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4437 cLISTOPo->op_first->op_sibling = kid;
4438 cLISTOPo->op_last = kid;
4439 kid = kid->op_sibling;
4444 append_elem(o->op_type, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4450 if (hints & HINT_LOCALE)
4451 o->op_private |= OPpLOCALE;
4465 if (hints & HINT_LOCALE)
4466 o->op_private |= OPpLOCALE;
4478 if (hints & HINT_LOCALE)
4479 o->op_private |= OPpLOCALE;
4489 o->op_private |= OPpRUNTIME;
4504 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4505 o->op_private |= OPpREPEAT_DOLIST;
4506 cBINOPo->op_first = force_list(cBINOPo->op_first);
4517 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4518 SVOP *kid = (SVOP*)cUNOPo->op_first;
4520 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4522 for (s = SvPVX(kid->op_sv); *s; s++) {
4523 if (*s == ':' && s[1] == ':') {
4525 Move(s+2, s+1, strlen(s+2)+1, char);
4526 --SvCUR(kid->op_sv);
4529 sv_catpvn(kid->op_sv, ".pm", 3);
4539 croak("NOT IMPL LINE %d",__LINE__);
4549 if (o->op_flags & OPf_KIDS) {
4550 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4551 if (kid && kid->op_sibling) {
4552 o->op_type = OP_SSELECT;
4553 o->op_ppaddr = ppaddr[OP_SSELECT];
4555 return fold_constants(o);
4559 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4560 if (kid && kid->op_type == OP_RV2GV)
4561 kid->op_private &= ~HINT_STRICT_REFS;
4569 I32 type = o->op_type;
4571 if (!(o->op_flags & OPf_KIDS)) {
4577 argop = newOP(OP_PADAV, OPf_REF);
4578 argop->op_targ = 0; /* curpad[0] is @_ */
4581 argop = newUNOP(OP_RV2AV, 0,
4582 scalar(newGVOP(OP_GV, 0,
4583 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4586 argop = newUNOP(OP_RV2AV, 0,
4587 scalar(newGVOP(OP_GV, 0, subline ?
4588 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4589 #endif /* USE_THREADS */
4590 return newUNOP(type, 0, scalar(argop));
4592 return scalar(modkids(ck_fun(o), type));
4601 if (hints & HINT_LOCALE)
4602 o->op_private |= OPpLOCALE;
4605 if (o->op_flags & OPf_STACKED) {
4606 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4608 kid = kUNOP->op_first; /* get past rv2gv */
4610 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4612 if (kid->op_type == OP_SCOPE) {
4616 else if (kid->op_type == OP_LEAVE) {
4617 if (o->op_type == OP_SORT) {
4618 null(kid); /* wipe out leave */
4621 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4622 if (k->op_next == kid)
4627 kid->op_next = 0; /* just disconnect the leave */
4628 k = kLISTOP->op_first;
4632 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4633 null(kid); /* wipe out rv2gv */
4634 if (o->op_type == OP_SORT)
4638 o->op_flags |= OPf_SPECIAL;
4652 if (o->op_flags & OPf_STACKED)
4653 return no_fh_allowed(o);
4655 kid = cLISTOPo->op_first;
4656 if (kid->op_type != OP_NULL)
4657 croak("panic: ck_split");
4658 kid = kid->op_sibling;
4659 op_free(cLISTOPo->op_first);
4660 cLISTOPo->op_first = kid;
4662 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4663 cLISTOPo->op_last = kid; /* There was only one element previously */
4666 if (kid->op_type != OP_MATCH) {
4667 OP *sibl = kid->op_sibling;
4668 kid->op_sibling = 0;
4669 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4670 if (cLISTOPo->op_first == cLISTOPo->op_last)
4671 cLISTOPo->op_last = kid;
4672 cLISTOPo->op_first = kid;
4673 kid->op_sibling = sibl;
4676 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4677 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4681 kid->op_type = OP_PUSHRE;
4682 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4685 if (!kid->op_sibling)
4686 append_elem(OP_SPLIT, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4688 kid = kid->op_sibling;
4691 if (!kid->op_sibling)
4692 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4694 kid = kid->op_sibling;
4697 if (kid->op_sibling)
4698 return too_many_arguments(o,op_desc[o->op_type]);
4708 OP *prev = ((cUNOPo->op_first->op_sibling)
4709 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4710 OP *o2 = prev->op_sibling;
4718 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4719 if (cvop->op_type == OP_RV2CV) {
4721 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4722 null(cvop); /* disable rv2cv */
4723 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4724 if (tmpop->op_type == OP_GV) {
4725 cv = GvCVu(tmpop->op_sv);
4726 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4727 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4728 proto = SvPV((SV*)cv, na);
4732 o->op_private |= (hints & HINT_STRICT_REFS);
4733 if (PERLDB_SUB && curstash != debstash)
4734 o->op_private |= OPpENTERSUB_DB;
4735 while (o2 != cvop) {
4739 return too_many_arguments(o, gv_ename(namegv));
4757 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4758 bad_type(arg, "block", gv_ename(namegv), o2);
4763 if (o2->op_type == OP_RV2GV)
4767 o2 = newUNOP(OP_RV2GV, 0, kid);
4768 o2->op_sibling = kid->op_sibling;
4769 kid->op_sibling = 0;
4770 prev->op_sibling = o;
4778 if (o2->op_type != OP_RV2GV)
4779 bad_type(arg, "symbol", gv_ename(namegv), o2);
4782 if (o2->op_type != OP_RV2CV)
4783 bad_type(arg, "sub", gv_ename(namegv), o2);
4786 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4787 bad_type(arg, "scalar", gv_ename(namegv), o2);
4790 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4791 bad_type(arg, "array", gv_ename(namegv), o2);
4794 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4795 bad_type(arg, "hash", gv_ename(namegv), o2);
4799 o2 = newUNOP(OP_REFGEN, 0, kid);
4800 o2->op_sibling = kid->op_sibling;
4801 kid->op_sibling = 0;
4802 prev->op_sibling = o2;
4813 croak("Malformed prototype for %s: %s",
4814 gv_ename(namegv), SvPV((SV*)cv, na));
4819 mod(o2, OP_ENTERSUB);
4821 o2 = o2->op_sibling;
4823 if (proto && !optional &&
4824 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4825 return too_few_arguments(o, gv_ename(namegv));
4833 SvREADONLY_on(cSVOPo->op_sv);
4841 if (o->op_flags & OPf_KIDS) {
4842 SVOP *kid = (SVOP*)cUNOPo->op_first;
4844 if (kid->op_type == OP_NULL)
4845 kid = (SVOP*)kid->op_sibling;
4847 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4848 o->op_flags |= OPf_SPECIAL;
4853 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4860 register OP* oldop = 0;
4861 if (!o || o->op_seq)
4866 for (; o; o = o->op_next) {
4872 switch (o->op_type) {
4875 curcop = ((COP*)o); /* for warnings */
4876 o->op_seq = op_seqmax++;
4887 if (o->op_next->op_type == OP_STRINGIFY)
4889 o->op_seq = op_seqmax++;
4892 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4893 o->op_seq = op_seqmax++;
4894 break; /* Scalar stub must produce undef. List stub is noop */
4898 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4899 curcop = ((COP*)op);
4905 if (oldop && o->op_next) {
4906 oldop->op_next = o->op_next;
4909 o->op_seq = op_seqmax++;
4913 if (o->op_next->op_type == OP_RV2SV) {
4914 if (!(o->op_next->op_private & OPpDEREF)) {
4916 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4917 o->op_next = o->op_next->op_next;
4918 o->op_type = OP_GVSV;
4919 o->op_ppaddr = ppaddr[OP_GVSV];
4922 else if (o->op_next->op_type == OP_RV2AV) {
4923 OP* pop = o->op_next->op_next;
4925 if (pop->op_type == OP_CONST &&
4926 (op = pop->op_next) &&
4927 pop->op_next->op_type == OP_AELEM &&
4928 !(pop->op_next->op_private &
4929 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4930 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4934 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4938 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4939 o->op_next = pop->op_next->op_next;
4940 o->op_type = OP_AELEMFAST;
4941 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4942 o->op_private = (U8)i;
4943 GvAVn(((GVOP*)o)->op_gv);
4946 o->op_seq = op_seqmax++;
4950 if (o->op_next->op_type == OP_RV2AV
4951 && (o->op_next->op_flags && OPf_REF))
4954 o->op_next = o->op_next->op_next;
4959 if (o->op_next->op_type == OP_RV2HV
4960 && (o->op_next->op_flags && OPf_REF))
4963 o->op_next = o->op_next->op_next;
4971 o->op_seq = op_seqmax++;
4972 peep(cLOGOP->op_other);
4976 o->op_seq = op_seqmax++;
4977 peep(cCONDOP->op_true);
4978 peep(cCONDOP->op_false);
4982 o->op_seq = op_seqmax++;
4983 peep(cLOOP->op_redoop);
4984 peep(cLOOP->op_nextop);
4985 peep(cLOOP->op_lastop);
4990 o->op_seq = op_seqmax++;
4991 peep(cPMOP->op_pmreplstart);
4995 o->op_seq = op_seqmax++;
4996 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4997 if (o->op_next->op_sibling &&
4998 o->op_next->op_sibling->op_type != OP_DIE) {
4999 line_t oldline = curcop->cop_line;
5001 curcop->cop_line = ((COP*)o->op_next)->cop_line;
5002 warn("Statement unlikely to be reached");
5003 warn("(Maybe you meant system() when you said exec()?)\n");
5004 curcop->cop_line = oldline;
5018 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5019 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5021 rop = (UNOP*)((BINOP*)o)->op_first;
5022 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5024 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
5025 if (!SvOBJECT(lexname))
5027 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5028 if (!fields || !GvHV(*fields))
5030 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5031 key = SvPV(*svp, keylen);
5032 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5034 croak("No such field \"%s\" in variable %s of type %s",
5035 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
5037 ind = SvIV(*indsvp);
5039 croak("Bad index while coercing array into hash");
5040 rop->op_type = OP_RV2AV;
5041 rop->op_ppaddr = ppaddr[OP_RV2AV];
5042 o->op_type = OP_AELEM;
5043 o->op_ppaddr = ppaddr[OP_AELEM];
5045 *svp = newSViv(ind);
5050 o->op_seq = op_seqmax++;