3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
22 * In the following definition, the ", Nullop" is just to make the compiler
23 * think the expression is of the right type: croak actually does a Siglongjmp.
25 #define CHECKOP(type,o) \
26 ((op_mask && op_mask[type]) \
27 ? ( op_free((OP*)o), \
28 croak("%s trapped by operation mask", op_desc[type]), \
30 : (*check[type])((OP*)o))
32 static I32 list_assignment _((OP *o));
33 static void bad_type _((I32 n, char *t, char *name, OP *kid));
34 static OP *modkids _((OP *o, I32 type));
35 static OP *no_fh_allowed _((OP *o));
36 static bool scalar_mod_type _((OP *o, I32 type));
37 static OP *scalarboolean _((OP *o));
38 static OP *too_few_arguments _((OP *o, char* name));
39 static OP *too_many_arguments _((OP *o, char* name));
40 static void null _((OP* o));
41 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
42 CV* startcv, I32 cx_ix));
43 static OP *newDEFSVOP _((void));
48 SV* tmpsv = sv_newmortal();
49 gv_efullname3(tmpsv, gv, Nullch);
50 return SvPV(tmpsv,na);
56 yyerror(form("Missing comma after first argument to %s function",
57 op_desc[o->op_type]));
62 too_few_arguments(OP *o, char *name)
64 yyerror(form("Not enough arguments for %s", name));
69 too_many_arguments(OP *o, char *name)
71 yyerror(form("Too many arguments for %s", name));
76 bad_type(I32 n, char *t, char *name, OP *kid)
78 yyerror(form("Type of arg %d to %s must be %s (not %s)",
79 (int)n, name, t, op_desc[kid->op_type]));
85 int type = o->op_type;
86 if (type != OP_AELEM && type != OP_HELEM) {
87 yyerror(form("Can't use subscript on %s", op_desc[type]));
88 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV)
89 warn("(Did you mean $ or @ instead of %c?)\n",
90 type == OP_ENTERSUB ? '&' : '%');
94 /* "register" allocation */
97 pad_allocmy(char *name)
103 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
104 if (!isPRINT(name[1])) {
106 name[2] = toCTRL(name[1]);
109 croak("Can't use global %s in \"my\"",name);
111 if (dowarn && AvFILLp(comppad_name) >= 0) {
112 SV **svp = AvARRAY(comppad_name);
113 for (off = AvFILLp(comppad_name); off > comppad_name_floor; off--) {
116 && SvIVX(sv) == 999999999 /* var is in open scope */
117 && strEQ(name, SvPVX(sv)))
119 warn("\"my\" variable %s masks earlier declaration in same scope", name);
124 off = pad_alloc(OP_PADSV, SVs_PADMY);
126 sv_upgrade(sv, SVt_PVNV);
130 croak("Can't declare class for non-scalar %s in \"my\"",name);
132 (void)SvUPGRADE(sv, SVt_PVMG);
133 SvSTASH(sv) = (HV*)SvREFCNT_inc(in_my_stash);
136 av_store(comppad_name, off, sv);
137 SvNVX(sv) = (double)999999999;
138 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
139 if (!min_intro_pending)
140 min_intro_pending = off;
141 max_intro_pending = off;
143 av_store(comppad, off, (SV*)newAV());
144 else if (*name == '%')
145 av_store(comppad, off, (SV*)newHV());
146 SvPADMY_on(curpad[off]);
151 #ifndef CAN_PROTOTYPE
152 pad_findlex(name, newoff, seq, startcv, cx_ix)
159 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
167 register PERL_CONTEXT *cx;
170 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
171 AV *curlist = CvPADLIST(cv);
172 SV **svp = av_fetch(curlist, 0, FALSE);
175 if (!svp || *svp == &sv_undef)
178 svp = AvARRAY(curname);
179 for (off = AvFILLp(curname); off > 0; off--) {
180 if ((sv = svp[off]) &&
183 seq > I_32(SvNVX(sv)) &&
184 strEQ(SvPVX(sv), name))
195 return 0; /* don't clone from inactive stack frame */
199 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
200 oldsv = *av_fetch(oldpad, off, TRUE);
201 if (!newoff) { /* Not a mere clone operation. */
202 SV *namesv = NEWSV(1103,0);
203 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
204 sv_upgrade(namesv, SVt_PVNV);
205 sv_setpv(namesv, name);
206 av_store(comppad_name, newoff, namesv);
207 SvNVX(namesv) = (double)curcop->cop_seq;
208 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
209 SvFAKE_on(namesv); /* A ref, not a real var */
210 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
211 /* "It's closures all the way down." */
215 oldsv = Nullsv; /* no need to keep ref */
220 bcv && bcv != cv && !CvCLONE(bcv);
221 bcv = CvOUTSIDE(bcv)) {
225 if (dowarn && !CvUNIQUE(cv))
227 "Variable \"%s\" may be unavailable",
234 else if (!CvUNIQUE(compcv)) {
235 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
236 warn("Variable \"%s\" will not stay shared", name);
239 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
245 /* Nothing in current lexical context--try eval's context, if any.
246 * This is necessary to let the perldb get at lexically scoped variables.
247 * XXX This will also probably interact badly with eval tree caching.
251 for (i = cx_ix; i >= 0; i--) {
253 switch (cx->cx_type) {
255 if (i == 0 && saweval) {
256 seq = cxstack[saweval].blk_oldcop->cop_seq;
257 return pad_findlex(name, newoff, seq, main_cv, 0);
261 switch (cx->blk_eval.old_op_type) {
266 /* require must have its own scope */
274 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
275 saweval = i; /* so we know where we were called from */
278 seq = cxstack[saweval].blk_oldcop->cop_seq;
279 return pad_findlex(name, newoff, seq, cv, i-1);
287 pad_findmy(char *name)
293 SV **svp = AvARRAY(comppad_name);
294 U32 seq = cop_seqmax;
298 * Special case to get lexical (and hence per-thread) @_.
299 * XXX I need to find out how to tell at parse-time whether use
300 * of @_ should refer to a lexical (from a sub) or defgv (global
301 * scope and maybe weird sub-ish things like formats). See
302 * startsub in perly.y. It's possible that @_ could be lexical
303 * (at least from subs) even in non-threaded perl.
305 if (strEQ(name, "@_"))
306 return 0; /* success. (NOT_IN_PAD indicates failure) */
307 #endif /* USE_THREADS */
309 /* The one we're looking for is probably just before comppad_name_fill. */
310 for (off = AvFILLp(comppad_name); off > 0; off--) {
311 if ((sv = svp[off]) &&
315 seq > I_32(SvNVX(sv)))) &&
316 strEQ(SvPVX(sv), name))
319 return (PADOFFSET)off;
320 pendoff = off; /* this pending def. will override import */
324 /* See if it's in a nested scope */
325 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
327 /* If there is a pending local definition, this new alias must die */
329 SvIVX(AvARRAY(comppad_name)[off]) = seq;
330 return off; /* pad_findlex returns 0 for failure...*/
332 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
336 pad_leavemy(I32 fill)
339 SV **svp = AvARRAY(comppad_name);
341 if (min_intro_pending && fill < min_intro_pending) {
342 for (off = max_intro_pending; off >= min_intro_pending; off--) {
343 if ((sv = svp[off]) && sv != &sv_undef)
344 warn("%s never introduced", SvPVX(sv));
347 /* "Deintroduce" my variables that are leaving with this scope. */
348 for (off = AvFILLp(comppad_name); off > fill; off--) {
349 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
350 SvIVX(sv) = cop_seqmax;
355 pad_alloc(I32 optype, U32 tmptype)
361 if (AvARRAY(comppad) != curpad)
362 croak("panic: pad_alloc");
363 if (pad_reset_pending)
365 if (tmptype & SVs_PADMY) {
367 sv = *av_fetch(comppad, AvFILLp(comppad) + 1, TRUE);
368 } while (SvPADBUSY(sv)); /* need a fresh one */
369 retval = AvFILLp(comppad);
372 SV **names = AvARRAY(comppad_name);
373 SSize_t names_fill = AvFILLp(comppad_name);
376 * "foreach" index vars temporarily become aliases to non-"my"
377 * values. Thus we must skip, not just pad values that are
378 * marked as current pad values, but also those with names.
380 if (++padix <= names_fill &&
381 (sv = names[padix]) && sv != &sv_undef)
383 sv = *av_fetch(comppad, padix, TRUE);
384 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
389 SvFLAGS(sv) |= tmptype;
390 curpad = AvARRAY(comppad);
392 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
393 (unsigned long) thr, (unsigned long) curpad,
394 (long) retval, op_name[optype]));
396 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad alloc %ld for %s\n",
397 (long) retval, op_name[optype]));
398 #endif /* USE_THREADS */
399 return (PADOFFSET)retval;
403 #ifndef CAN_PROTOTYPE
408 #endif /* CAN_PROTOTYPE */
412 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
413 (unsigned long) thr, (unsigned long) curpad, po));
416 croak("panic: pad_sv po");
417 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad sv %d\n", po));
418 #endif /* USE_THREADS */
419 return curpad[po]; /* eventually we'll turn this into a macro */
423 #ifndef CAN_PROTOTYPE
427 pad_free(PADOFFSET po)
428 #endif /* CAN_PROTOTYPE */
433 if (AvARRAY(comppad) != curpad)
434 croak("panic: pad_free curpad");
436 croak("panic: pad_free po");
438 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
439 (unsigned long) thr, (unsigned long) curpad, po));
441 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad free %d\n", po));
442 #endif /* USE_THREADS */
443 if (curpad[po] && curpad[po] != &sv_undef)
444 SvPADTMP_off(curpad[po]);
450 #ifndef CAN_PROTOTYPE
454 pad_swipe(PADOFFSET po)
455 #endif /* CAN_PROTOTYPE */
458 if (AvARRAY(comppad) != curpad)
459 croak("panic: pad_swipe curpad");
461 croak("panic: pad_swipe po");
463 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
464 (unsigned long) thr, (unsigned long) curpad, po));
466 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad swipe %d\n", po));
467 #endif /* USE_THREADS */
468 SvPADTMP_off(curpad[po]);
469 curpad[po] = NEWSV(1107,0);
470 SvPADTMP_on(curpad[po]);
481 if (AvARRAY(comppad) != curpad)
482 croak("panic: pad_reset curpad");
484 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
485 (unsigned long) thr, (unsigned long) curpad));
487 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad reset\n"));
488 #endif /* USE_THREADS */
489 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
490 for (po = AvMAX(comppad); po > padix_floor; po--) {
491 if (curpad[po] && !SvIMMORTAL(curpad[po]))
492 SvPADTMP_off(curpad[po]);
496 pad_reset_pending = FALSE;
500 /* find_threadsv is not reentrant */
502 find_threadsv(char *name)
508 /* We currently only handle names of a single character */
509 p = strchr(threadsv_names, *name);
512 key = p - threadsv_names;
513 svp = av_fetch(thr->threadsv, key, FALSE);
515 SV *sv = NEWSV(0, 0);
516 av_store(thr->threadsv, key, sv);
517 thr->threadsvp = AvARRAY(thr->threadsv);
519 * Some magic variables used to be automagically initialised
520 * in gv_fetchpv. Those which are now per-thread magicals get
521 * initialised here instead.
527 sv_setpv(sv, "\034");
528 sv_magic(sv, 0, 0, name, 1);
537 sv_magic(sv, 0, 0, name, 1);
539 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
540 "find_threadsv: new SV %p for $%s%c\n",
541 sv, (*name < 32) ? "^" : "",
542 (*name < 32) ? toCTRL(*name) : *name));
546 #endif /* USE_THREADS */
553 register OP *kid, *nextkid;
555 if (!o || o->op_seq == (U16)-1)
558 if (o->op_flags & OPf_KIDS) {
559 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
560 nextkid = kid->op_sibling; /* Get before next freeing kid */
565 switch (o->op_type) {
567 o->op_targ = 0; /* Was holding old type, if any. */
570 o->op_targ = 0; /* Was holding hints. */
574 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
576 #endif /* USE_THREADS */
578 if (!(o->op_flags & OPf_REF) || (check[o->op_type] != ck_ftst))
584 SvREFCNT_dec(cGVOPo->op_gv);
588 Safefree(cCOPo->cop_label);
589 SvREFCNT_dec(cCOPo->cop_filegv);
592 SvREFCNT_dec(cSVOPo->op_sv);
598 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
602 Safefree(cPVOPo->op_pv);
605 op_free(cPMOPo->op_pmreplroot);
609 ReREFCNT_dec(cPMOPo->op_pmregexp);
614 pad_free(o->op_targ);
622 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
623 pad_free(o->op_targ);
624 o->op_targ = o->op_type;
625 o->op_type = OP_NULL;
626 o->op_ppaddr = ppaddr[OP_NULL];
629 /* Contextualizers */
631 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
641 /* establish postfix order */
642 if (cUNOPo->op_first) {
643 o->op_next = LINKLIST(cUNOPo->op_first);
644 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
646 kid->op_next = LINKLIST(kid->op_sibling);
661 if (o && o->op_flags & OPf_KIDS) {
662 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
672 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
674 line_t oldline = curcop->cop_line;
676 if (copline != NOLINE)
677 curcop->cop_line = copline;
678 warn("Found = in conditional, should be ==");
679 curcop->cop_line = oldline;
689 /* assumes no premature commitment */
690 if (!o || (o->op_flags & OPf_WANT) || error_count
691 || o->op_type == OP_RETURN)
694 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
696 switch (o->op_type) {
698 if (o->op_private & OPpREPEAT_DOLIST)
699 null(((LISTOP*)cBINOPo->op_first)->op_first);
700 scalar(cBINOPo->op_first);
705 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
709 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
710 if (!kPMOP->op_pmreplroot)
711 deprecate("implicit split to @_");
718 if (o->op_flags & OPf_KIDS) {
719 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
725 kid = cLISTOPo->op_first;
727 while (kid = kid->op_sibling) {
733 WITH_THR(curcop = &compiling);
738 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
744 WITH_THR(curcop = &compiling);
757 /* assumes no premature commitment */
758 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
759 || o->op_type == OP_RETURN)
762 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
764 switch (o->op_type) {
766 if (!(opargs[o->op_type] & OA_FOLDCONST))
770 if (o->op_flags & OPf_STACKED)
841 if (!(o->op_private & OPpLVAL_INTRO))
842 useless = op_desc[o->op_type];
849 if (!(o->op_private & OPpLVAL_INTRO) &&
850 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
851 useless = "a variable";
856 WITH_THR(curcop = ((COP*)o)); /* for warning below */
862 useless = "a constant";
863 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
865 else if (SvPOK(sv)) {
866 if (strnEQ(SvPVX(sv), "di", 2) ||
867 strnEQ(SvPVX(sv), "ds", 2) ||
868 strnEQ(SvPVX(sv), "ig", 2))
872 null(o); /* don't execute a constant */
873 SvREFCNT_dec(sv); /* don't even remember it */
877 o->op_type = OP_PREINC; /* pre-increment is faster */
878 o->op_ppaddr = ppaddr[OP_PREINC];
882 o->op_type = OP_PREDEC; /* pre-decrement is faster */
883 o->op_ppaddr = ppaddr[OP_PREDEC];
889 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
894 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
895 WITH_THR(curcop = ((COP*)o)); /* for warning below */
896 if (o->op_flags & OPf_STACKED)
902 if (!(o->op_flags & OPf_KIDS))
911 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
918 /* all requires must return a boolean value */
919 o->op_flags &= ~OPf_WANT;
922 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
923 if (!kPMOP->op_pmreplroot)
924 deprecate("implicit split to @_");
928 if (useless && dowarn)
929 warn("Useless use of %s in void context", useless);
937 if (o && o->op_flags & OPf_KIDS) {
938 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
949 /* assumes no premature commitment */
950 if (!o || (o->op_flags & OPf_WANT) || error_count
951 || o->op_type == OP_RETURN)
954 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
956 switch (o->op_type) {
959 list(cBINOPo->op_first);
964 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
971 if (!(o->op_flags & OPf_KIDS))
973 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
974 list(cBINOPo->op_first);
975 return gen_constant_list(o);
982 kid = cLISTOPo->op_first;
984 while (kid = kid->op_sibling) {
990 WITH_THR(curcop = &compiling);
994 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1000 WITH_THR(curcop = &compiling);
1003 /* all requires must return a boolean value */
1004 o->op_flags &= ~OPf_WANT;
1016 if (o->op_type == OP_LINESEQ ||
1017 o->op_type == OP_SCOPE ||
1018 o->op_type == OP_LEAVE ||
1019 o->op_type == OP_LEAVETRY)
1022 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1023 if (kid->op_sibling) {
1027 curcop = &compiling;
1029 o->op_flags &= ~OPf_PARENS;
1030 if (hints & HINT_BLOCK_SCOPE)
1031 o->op_flags |= OPf_PARENS;
1034 o = newOP(OP_STUB, 0);
1039 modkids(OP *o, I32 type)
1042 if (o && o->op_flags & OPf_KIDS) {
1043 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1049 static I32 modcount;
1052 mod(OP *o, I32 type)
1058 if (!o || error_count)
1061 switch (o->op_type) {
1066 if (!(o->op_private & (OPpCONST_ARYBASE)))
1068 if (eval_start && eval_start->op_type == OP_CONST) {
1069 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1073 SAVEI32(compiling.cop_arybase);
1074 compiling.cop_arybase = 0;
1076 else if (type == OP_REFGEN)
1079 croak("That use of $[ is unsupported");
1082 if (o->op_flags & OPf_PARENS)
1086 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1087 !(o->op_flags & OPf_STACKED)) {
1088 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1089 o->op_ppaddr = ppaddr[OP_RV2CV];
1090 assert(cUNOPo->op_first->op_type == OP_NULL);
1091 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1097 /* grep, foreach, subcalls, refgen */
1098 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1100 yyerror(form("Can't modify %s in %s",
1101 op_desc[o->op_type],
1102 type ? op_desc[type] : "local"));
1116 case OP_RIGHT_SHIFT:
1125 if (!(o->op_flags & OPf_STACKED))
1131 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1137 if (!type && cUNOPo->op_first->op_type != OP_GV)
1138 croak("Can't localize through a reference");
1139 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1141 return o; /* Treat \(@foo) like ordinary list. */
1145 if (scalar_mod_type(o, type))
1147 ref(cUNOPo->op_first, o->op_type);
1159 if (!type && cUNOPo->op_first->op_type != OP_GV)
1160 croak("Can't localize through a reference");
1161 ref(cUNOPo->op_first, o->op_type);
1165 hints |= HINT_BLOCK_SCOPE;
1174 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1175 return o; /* Treat \(@foo) like ordinary list. */
1176 if (scalar_mod_type(o, type))
1182 croak("Can't localize lexical variable %s",
1183 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1188 modcount++; /* XXX ??? */
1190 #endif /* USE_THREADS */
1196 if (type != OP_SASSIGN)
1202 pad_free(o->op_targ);
1203 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1204 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1205 if (o->op_flags & OPf_KIDS)
1206 mod(cBINOPo->op_first->op_sibling, type);
1211 ref(cBINOPo->op_first, o->op_type);
1212 if (type == OP_ENTERSUB &&
1213 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1214 o->op_private |= OPpLVAL_DEFER;
1221 if (o->op_flags & OPf_KIDS)
1222 mod(cLISTOPo->op_last, type);
1226 if (!(o->op_flags & OPf_KIDS))
1228 if (o->op_targ != OP_LIST) {
1229 mod(cBINOPo->op_first, type);
1234 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1238 o->op_flags |= OPf_MOD;
1240 if (type == OP_AASSIGN || type == OP_SASSIGN)
1241 o->op_flags |= OPf_SPECIAL|OPf_REF;
1243 o->op_private |= OPpLVAL_INTRO;
1244 o->op_flags &= ~OPf_SPECIAL;
1246 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1247 o->op_flags |= OPf_REF;
1252 scalar_mod_type(OP *o, I32 type)
1256 if (o->op_type == OP_RV2GV)
1280 case OP_RIGHT_SHIFT:
1287 case OP_ANDASSIGN: /* may work later */
1288 case OP_ORASSIGN: /* may work later */
1296 refkids(OP *o, I32 type)
1299 if (o && o->op_flags & OPf_KIDS) {
1300 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1307 ref(OP *o, I32 type)
1311 if (!o || error_count)
1314 switch (o->op_type) {
1316 if ((type == OP_DEFINED || type == OP_LOCK) &&
1317 !(o->op_flags & OPf_STACKED)) {
1318 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1319 o->op_ppaddr = ppaddr[OP_RV2CV];
1320 assert(cUNOPo->op_first->op_type == OP_NULL);
1321 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1322 o->op_flags |= OPf_SPECIAL;
1327 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1331 ref(cUNOPo->op_first, o->op_type);
1334 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1335 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1336 : type == OP_RV2HV ? OPpDEREF_HV
1338 o->op_flags |= OPf_MOD;
1343 o->op_flags |= OPf_MOD; /* XXX ??? */
1348 o->op_flags |= OPf_REF;
1351 ref(cUNOPo->op_first, o->op_type);
1356 o->op_flags |= OPf_REF;
1361 if (!(o->op_flags & OPf_KIDS))
1363 ref(cBINOPo->op_first, type);
1367 ref(cBINOPo->op_first, o->op_type);
1368 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1369 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1370 : type == OP_RV2HV ? OPpDEREF_HV
1372 o->op_flags |= OPf_MOD;
1380 if (!(o->op_flags & OPf_KIDS))
1382 ref(cLISTOPo->op_last, type);
1397 if (!o || error_count)
1401 if (type == OP_LIST) {
1402 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1405 else if (type != OP_PADSV &&
1408 type != OP_PUSHMARK)
1410 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1413 o->op_flags |= OPf_MOD;
1414 o->op_private |= OPpLVAL_INTRO;
1422 o->op_flags |= OPf_PARENS;
1427 bind_match(I32 type, OP *left, OP *right)
1432 (left->op_type == OP_RV2AV ||
1433 left->op_type == OP_RV2HV ||
1434 left->op_type == OP_PADAV ||
1435 left->op_type == OP_PADHV)) {
1436 char *desc = op_desc[(right->op_type == OP_SUBST ||
1437 right->op_type == OP_TRANS)
1438 ? right->op_type : OP_MATCH];
1439 char *sample = ((left->op_type == OP_RV2AV ||
1440 left->op_type == OP_PADAV)
1441 ? "@array" : "%hash");
1442 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1445 if (right->op_type == OP_MATCH ||
1446 right->op_type == OP_SUBST ||
1447 right->op_type == OP_TRANS) {
1448 right->op_flags |= OPf_STACKED;
1449 if (right->op_type != OP_MATCH)
1450 left = mod(left, right->op_type);
1451 if (right->op_type == OP_TRANS)
1452 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1454 o = prepend_elem(right->op_type, scalar(left), right);
1456 return newUNOP(OP_NOT, 0, scalar(o));
1460 return bind_match(type, left,
1461 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1469 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1470 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1477 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1478 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1479 o->op_type = OP_LEAVE;
1480 o->op_ppaddr = ppaddr[OP_LEAVE];
1483 if (o->op_type == OP_LINESEQ) {
1485 o->op_type = OP_SCOPE;
1486 o->op_ppaddr = ppaddr[OP_SCOPE];
1487 kid = ((LISTOP*)o)->op_first;
1488 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1489 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1494 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1501 block_start(int full)
1504 int retval = savestack_ix;
1505 SAVEI32(comppad_name_floor);
1507 if ((comppad_name_fill = AvFILLp(comppad_name)) > 0)
1508 comppad_name_floor = comppad_name_fill;
1510 comppad_name_floor = 0;
1512 SAVEI32(min_intro_pending);
1513 SAVEI32(max_intro_pending);
1514 min_intro_pending = 0;
1515 SAVEI32(comppad_name_fill);
1516 SAVEI32(padix_floor);
1517 padix_floor = padix;
1518 pad_reset_pending = FALSE;
1520 hints &= ~HINT_BLOCK_SCOPE;
1525 block_end(I32 floor, OP *seq)
1528 int needblockscope = hints & HINT_BLOCK_SCOPE;
1529 OP* retval = scalarseq(seq);
1531 pad_reset_pending = FALSE;
1533 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1534 pad_leavemy(comppad_name_fill);
1543 OP *o = newOP(OP_THREADSV, 0);
1544 o->op_targ = find_threadsv("_");
1547 return newSVREF(newGVOP(OP_GV, 0, defgv));
1548 #endif /* USE_THREADS */
1556 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1557 eval_start = linklist(eval_root);
1558 eval_root->op_next = 0;
1564 main_root = scope(sawparens(scalarvoid(o)));
1565 curcop = &compiling;
1566 main_start = LINKLIST(main_root);
1567 main_root->op_next = 0;
1571 /* Register with debugger */
1573 CV *cv = perl_get_cv("DB::postponed", FALSE);
1577 XPUSHs((SV*)compiling.cop_filegv);
1579 perl_call_sv((SV*)cv, G_DISCARD);
1586 localize(OP *o, I32 lex)
1588 if (o->op_flags & OPf_PARENS)
1591 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1593 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1594 if (*s == ';' || *s == '=')
1595 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1599 in_my_stash = Nullhv;
1603 return mod(o, OP_NULL); /* a bit kludgey */
1609 if (o->op_type == OP_LIST) {
1612 o2 = newOP(OP_THREADSV, 0);
1613 o2->op_targ = find_threadsv(";");
1615 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1616 #endif /* USE_THREADS */
1617 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1623 fold_constants(register OP *o)
1627 I32 type = o->op_type;
1630 if (opargs[type] & OA_RETSCALAR)
1632 if (opargs[type] & OA_TARGET)
1633 o->op_targ = pad_alloc(type, SVs_PADTMP);
1635 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1636 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1638 if (!(opargs[type] & OA_FOLDCONST))
1653 if (o->op_private & OPpLOCALE)
1658 goto nope; /* Don't try to run w/ errors */
1660 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1661 if (curop->op_type != OP_CONST &&
1662 curop->op_type != OP_LIST &&
1663 curop->op_type != OP_SCALAR &&
1664 curop->op_type != OP_NULL &&
1665 curop->op_type != OP_PUSHMARK) {
1670 curop = LINKLIST(o);
1675 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1676 pad_swipe(o->op_targ);
1677 else if (SvTEMP(sv)) { /* grab mortal temp? */
1678 (void)SvREFCNT_inc(sv);
1682 if (type == OP_RV2GV)
1683 return newGVOP(OP_GV, 0, (GV*)sv);
1685 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1687 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1692 SvIOK_off(sv); /* undo SvIV() damage */
1694 return newSVOP(OP_CONST, 0, sv);
1698 if (!(opargs[type] & OA_OTHERINT))
1701 if (!(hints & HINT_INTEGER)) {
1702 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1705 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1706 if (curop->op_type == OP_CONST) {
1707 if (SvIOK(((SVOP*)curop)->op_sv))
1711 if (opargs[curop->op_type] & OA_RETINTEGER)
1715 o->op_ppaddr = ppaddr[++(o->op_type)];
1722 gen_constant_list(register OP *o)
1726 I32 oldtmps_floor = tmps_floor;
1730 return o; /* Don't attempt to run with errors */
1732 op = curop = LINKLIST(o);
1738 tmps_floor = oldtmps_floor;
1740 o->op_type = OP_RV2AV;
1741 o->op_ppaddr = ppaddr[OP_RV2AV];
1742 curop = ((UNOP*)o)->op_first;
1743 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1750 convert(I32 type, I32 flags, OP *o)
1755 if (!o || o->op_type != OP_LIST)
1756 o = newLISTOP(OP_LIST, 0, o, Nullop);
1758 o->op_flags &= ~OPf_WANT;
1760 if (!(opargs[type] & OA_MARK))
1761 null(cLISTOPo->op_first);
1764 o->op_ppaddr = ppaddr[type];
1765 o->op_flags |= flags;
1767 o = CHECKOP(type, o);
1768 if (o->op_type != type)
1771 if (cLISTOPo->op_children < 7) {
1772 /* XXX do we really need to do this if we're done appending?? */
1773 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1775 cLISTOPo->op_last = last; /* in case check substituted last arg */
1778 return fold_constants(o);
1781 /* List constructors */
1784 append_elem(I32 type, OP *first, OP *last)
1792 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1793 return newLISTOP(type, 0, first, last);
1795 if (first->op_flags & OPf_KIDS)
1796 ((LISTOP*)first)->op_last->op_sibling = last;
1798 first->op_flags |= OPf_KIDS;
1799 ((LISTOP*)first)->op_first = last;
1801 ((LISTOP*)first)->op_last = last;
1802 ((LISTOP*)first)->op_children++;
1807 append_list(I32 type, LISTOP *first, LISTOP *last)
1815 if (first->op_type != type)
1816 return prepend_elem(type, (OP*)first, (OP*)last);
1818 if (last->op_type != type)
1819 return append_elem(type, (OP*)first, (OP*)last);
1821 first->op_last->op_sibling = last->op_first;
1822 first->op_last = last->op_last;
1823 first->op_children += last->op_children;
1824 if (first->op_children)
1825 last->op_flags |= OPf_KIDS;
1832 prepend_elem(I32 type, OP *first, OP *last)
1840 if (last->op_type == type) {
1841 if (type == OP_LIST) { /* already a PUSHMARK there */
1842 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1843 ((LISTOP*)last)->op_first->op_sibling = first;
1846 if (!(last->op_flags & OPf_KIDS)) {
1847 ((LISTOP*)last)->op_last = first;
1848 last->op_flags |= OPf_KIDS;
1850 first->op_sibling = ((LISTOP*)last)->op_first;
1851 ((LISTOP*)last)->op_first = first;
1853 ((LISTOP*)last)->op_children++;
1857 return newLISTOP(type, 0, first, last);
1865 return newOP(OP_STUB, 0);
1871 if (!o || o->op_type != OP_LIST)
1872 o = newLISTOP(OP_LIST, 0, o, Nullop);
1878 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1882 Newz(1101, listop, 1, LISTOP);
1884 listop->op_type = type;
1885 listop->op_ppaddr = ppaddr[type];
1886 listop->op_children = (first != 0) + (last != 0);
1887 listop->op_flags = flags;
1891 else if (!first && last)
1894 first->op_sibling = last;
1895 listop->op_first = first;
1896 listop->op_last = last;
1897 if (type == OP_LIST) {
1899 pushop = newOP(OP_PUSHMARK, 0);
1900 pushop->op_sibling = first;
1901 listop->op_first = pushop;
1902 listop->op_flags |= OPf_KIDS;
1904 listop->op_last = pushop;
1906 else if (listop->op_children)
1907 listop->op_flags |= OPf_KIDS;
1913 newOP(I32 type, I32 flags)
1916 Newz(1101, o, 1, OP);
1918 o->op_ppaddr = ppaddr[type];
1919 o->op_flags = flags;
1922 o->op_private = 0 + (flags >> 8);
1923 if (opargs[type] & OA_RETSCALAR)
1925 if (opargs[type] & OA_TARGET)
1926 o->op_targ = pad_alloc(type, SVs_PADTMP);
1927 return CHECKOP(type, o);
1931 newUNOP(I32 type, I32 flags, OP *first)
1936 first = newOP(OP_STUB, 0);
1937 if (opargs[type] & OA_MARK)
1938 first = force_list(first);
1940 Newz(1101, unop, 1, UNOP);
1941 unop->op_type = type;
1942 unop->op_ppaddr = ppaddr[type];
1943 unop->op_first = first;
1944 unop->op_flags = flags | OPf_KIDS;
1945 unop->op_private = 1 | (flags >> 8);
1947 if(type == OP_STUDY && first->op_type == OP_MATCH) {
1948 first->op_type = OP_PUSHRE;
1949 first->op_ppaddr = ppaddr[OP_PUSHRE];
1952 unop = (UNOP*) CHECKOP(type, unop);
1956 return fold_constants((OP *) unop);
1960 newBINOP(I32 type, I32 flags, OP *first, OP *last)
1963 Newz(1101, binop, 1, BINOP);
1966 first = newOP(OP_NULL, 0);
1968 binop->op_type = type;
1969 binop->op_ppaddr = ppaddr[type];
1970 binop->op_first = first;
1971 binop->op_flags = flags | OPf_KIDS;
1974 binop->op_private = 1 | (flags >> 8);
1977 binop->op_private = 2 | (flags >> 8);
1978 first->op_sibling = last;
1981 binop = (BINOP*)CHECKOP(type, binop);
1985 binop->op_last = last = binop->op_first->op_sibling;
1987 return fold_constants((OP *)binop);
1991 pmtrans(OP *o, OP *expr, OP *repl)
1993 SV *tstr = ((SVOP*)expr)->op_sv;
1994 SV *rstr = ((SVOP*)repl)->op_sv;
1997 register U8 *t = (U8*)SvPV(tstr, tlen);
1998 register U8 *r = (U8*)SvPV(rstr, rlen);
2004 register short *tbl;
2006 tbl = (short*)cPVOPo->op_pv;
2007 complement = o->op_private & OPpTRANS_COMPLEMENT;
2008 Delete = o->op_private & OPpTRANS_DELETE;
2009 squash = o->op_private & OPpTRANS_SQUASH;
2012 Zero(tbl, 256, short);
2013 for (i = 0; i < tlen; i++)
2015 for (i = 0, j = 0; i < 256; i++) {
2031 if (!rlen && !Delete) {
2034 o->op_private |= OPpTRANS_COUNTONLY;
2036 for (i = 0; i < 256; i++)
2038 for (i = 0, j = 0; i < tlen; i++,j++) {
2041 if (tbl[t[i]] == -1)
2047 if (tbl[t[i]] == -1)
2058 newPMOP(I32 type, I32 flags)
2063 Newz(1101, pmop, 1, PMOP);
2064 pmop->op_type = type;
2065 pmop->op_ppaddr = ppaddr[type];
2066 pmop->op_flags = flags;
2067 pmop->op_private = 0 | (flags >> 8);
2069 if (hints & HINT_LOCALE)
2070 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2072 /* link into pm list */
2073 if (type != OP_TRANS && curstash) {
2074 pmop->op_pmnext = HvPMROOT(curstash);
2075 HvPMROOT(curstash) = pmop;
2082 pmruntime(OP *o, OP *expr, OP *repl)
2087 if (o->op_type == OP_TRANS)
2088 return pmtrans(o, expr, repl);
2090 hints |= HINT_BLOCK_SCOPE;
2093 if (expr->op_type == OP_CONST) {
2095 SV *pat = ((SVOP*)expr)->op_sv;
2096 char *p = SvPV(pat, plen);
2097 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2098 sv_setpvn(pat, "\\s+", 3);
2099 p = SvPV(pat, plen);
2100 pm->op_pmflags |= PMf_SKIPWHITE;
2102 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2103 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2104 pm->op_pmflags |= PMf_WHITE;
2108 if (pm->op_pmflags & PMf_KEEP)
2109 expr = newUNOP(OP_REGCMAYBE,0,expr);
2111 Newz(1101, rcop, 1, LOGOP);
2112 rcop->op_type = OP_REGCOMP;
2113 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2114 rcop->op_first = scalar(expr);
2115 rcop->op_flags |= OPf_KIDS;
2116 rcop->op_private = 1;
2119 /* establish postfix order */
2120 if (pm->op_pmflags & PMf_KEEP) {
2122 rcop->op_next = expr;
2123 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2126 rcop->op_next = LINKLIST(expr);
2127 expr->op_next = (OP*)rcop;
2130 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2135 if (pm->op_pmflags & PMf_EVAL)
2138 else if (repl->op_type == OP_THREADSV
2139 && strchr("&`'123456789+",
2140 threadsv_names[repl->op_targ]))
2144 #endif /* USE_THREADS */
2145 else if (repl->op_type == OP_CONST)
2149 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2150 if (opargs[curop->op_type] & OA_DANGEROUS) {
2152 if (curop->op_type == OP_THREADSV
2153 && strchr("&`'123456789+", curop->op_private)) {
2157 if (curop->op_type == OP_GV) {
2158 GV *gv = ((GVOP*)curop)->op_gv;
2159 if (strchr("&`'123456789+", *GvENAME(gv)))
2162 #endif /* USE_THREADS */
2163 else if (curop->op_type == OP_RV2CV)
2165 else if (curop->op_type == OP_RV2SV ||
2166 curop->op_type == OP_RV2AV ||
2167 curop->op_type == OP_RV2HV ||
2168 curop->op_type == OP_RV2GV) {
2169 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2172 else if (curop->op_type == OP_PADSV ||
2173 curop->op_type == OP_PADAV ||
2174 curop->op_type == OP_PADHV ||
2175 curop->op_type == OP_PADANY) {
2184 if (curop == repl) {
2185 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2186 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2187 prepend_elem(o->op_type, scalar(repl), o);
2190 Newz(1101, rcop, 1, LOGOP);
2191 rcop->op_type = OP_SUBSTCONT;
2192 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2193 rcop->op_first = scalar(repl);
2194 rcop->op_flags |= OPf_KIDS;
2195 rcop->op_private = 1;
2198 /* establish postfix order */
2199 rcop->op_next = LINKLIST(repl);
2200 repl->op_next = (OP*)rcop;
2202 pm->op_pmreplroot = scalar((OP*)rcop);
2203 pm->op_pmreplstart = LINKLIST(rcop);
2212 newSVOP(I32 type, I32 flags, SV *sv)
2215 Newz(1101, svop, 1, SVOP);
2216 svop->op_type = type;
2217 svop->op_ppaddr = ppaddr[type];
2219 svop->op_next = (OP*)svop;
2220 svop->op_flags = flags;
2221 if (opargs[type] & OA_RETSCALAR)
2223 if (opargs[type] & OA_TARGET)
2224 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2225 return CHECKOP(type, svop);
2229 newGVOP(I32 type, I32 flags, GV *gv)
2233 Newz(1101, gvop, 1, GVOP);
2234 gvop->op_type = type;
2235 gvop->op_ppaddr = ppaddr[type];
2236 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2237 gvop->op_next = (OP*)gvop;
2238 gvop->op_flags = flags;
2239 if (opargs[type] & OA_RETSCALAR)
2241 if (opargs[type] & OA_TARGET)
2242 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2243 return CHECKOP(type, gvop);
2247 newPVOP(I32 type, I32 flags, char *pv)
2250 Newz(1101, pvop, 1, PVOP);
2251 pvop->op_type = type;
2252 pvop->op_ppaddr = ppaddr[type];
2254 pvop->op_next = (OP*)pvop;
2255 pvop->op_flags = flags;
2256 if (opargs[type] & OA_RETSCALAR)
2258 if (opargs[type] & OA_TARGET)
2259 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2260 return CHECKOP(type, pvop);
2269 save_hptr(&curstash);
2270 save_item(curstname);
2275 name = SvPV(sv, len);
2276 curstash = gv_stashpvn(name,len,TRUE);
2277 sv_setpvn(curstname, name, len);
2281 sv_setpv(curstname,"<none>");
2289 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2297 if (id->op_type != OP_CONST)
2298 croak("Module name must be constant");
2302 if(version != Nullop) {
2303 SV *vesv = ((SVOP*)version)->op_sv;
2305 if (arg == Nullop && !SvNIOK(vesv)) {
2312 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2313 croak("Version number must be constant number");
2315 /* Make copy of id so we don't free it twice */
2316 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2318 /* Fake up a method call to VERSION */
2319 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2320 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2321 append_elem(OP_LIST,
2322 prepend_elem(OP_LIST, pack, list(version)),
2323 newUNOP(OP_METHOD, 0, meth)));
2327 /* Fake up an import/unimport */
2328 if (arg && arg->op_type == OP_STUB)
2329 imop = arg; /* no import on explicit () */
2330 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2331 imop = Nullop; /* use 5.0; */
2334 /* Make copy of id so we don't free it twice */
2335 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2336 meth = newSVOP(OP_CONST, 0,
2338 ? newSVpv("import", 6)
2339 : newSVpv("unimport", 8)
2341 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2342 append_elem(OP_LIST,
2343 prepend_elem(OP_LIST, pack, list(arg)),
2344 newUNOP(OP_METHOD, 0, meth)));
2347 /* Fake up a require */
2348 rqop = newUNOP(OP_REQUIRE, 0, id);
2350 /* Fake up the BEGIN {}, which does its thing immediately. */
2352 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2354 append_elem(OP_LINESEQ,
2355 append_elem(OP_LINESEQ,
2356 newSTATEOP(0, Nullch, rqop),
2357 newSTATEOP(0, Nullch, veop)),
2358 newSTATEOP(0, Nullch, imop) ));
2365 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2367 return newBINOP(OP_LSLICE, flags,
2368 list(force_list(subscript)),
2369 list(force_list(listval)) );
2373 list_assignment(register OP *o)
2378 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2379 o = cUNOPo->op_first;
2381 if (o->op_type == OP_COND_EXPR) {
2382 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2383 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2388 yyerror("Assignment to both a list and a scalar");
2392 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2393 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2394 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2397 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2400 if (o->op_type == OP_RV2SV)
2407 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2412 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2413 return newLOGOP(optype, 0,
2414 mod(scalar(left), optype),
2415 newUNOP(OP_SASSIGN, 0, scalar(right)));
2418 return newBINOP(optype, OPf_STACKED,
2419 mod(scalar(left), optype), scalar(right));
2423 if (list_assignment(left)) {
2425 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2426 left = mod(left, OP_AASSIGN);
2434 o = newBINOP(OP_AASSIGN, flags,
2435 list(force_list(right)),
2436 list(force_list(left)) );
2437 o->op_private = 0 | (flags >> 8);
2438 if (!(left->op_private & OPpLVAL_INTRO)) {
2439 static int generation = 100;
2443 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2444 if (opargs[curop->op_type] & OA_DANGEROUS) {
2445 if (curop->op_type == OP_GV) {
2446 GV *gv = ((GVOP*)curop)->op_gv;
2447 if (gv == defgv || SvCUR(gv) == generation)
2449 SvCUR(gv) = generation;
2451 else if (curop->op_type == OP_PADSV ||
2452 curop->op_type == OP_PADAV ||
2453 curop->op_type == OP_PADHV ||
2454 curop->op_type == OP_PADANY) {
2455 SV **svp = AvARRAY(comppad_name);
2456 SV *sv = svp[curop->op_targ];
2457 if (SvCUR(sv) == generation)
2459 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2461 else if (curop->op_type == OP_RV2CV)
2463 else if (curop->op_type == OP_RV2SV ||
2464 curop->op_type == OP_RV2AV ||
2465 curop->op_type == OP_RV2HV ||
2466 curop->op_type == OP_RV2GV) {
2467 if (lastop->op_type != OP_GV) /* funny deref? */
2476 o->op_private = OPpASSIGN_COMMON;
2478 if (right && right->op_type == OP_SPLIT) {
2480 if ((tmpop = ((LISTOP*)right)->op_first) &&
2481 tmpop->op_type == OP_PUSHRE)
2483 PMOP *pm = (PMOP*)tmpop;
2484 if (left->op_type == OP_RV2AV &&
2485 !(left->op_private & OPpLVAL_INTRO) &&
2486 !(o->op_private & OPpASSIGN_COMMON) )
2488 tmpop = ((UNOP*)left)->op_first;
2489 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2490 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2491 pm->op_pmflags |= PMf_ONCE;
2492 tmpop = cUNOPo->op_first; /* to list (nulled) */
2493 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2494 tmpop->op_sibling = Nullop; /* don't free split */
2495 right->op_next = tmpop->op_next; /* fix starting loc */
2496 op_free(o); /* blow off assign */
2497 right->op_flags &= ~OPf_WANT;
2498 /* "I don't know and I don't care." */
2503 if (modcount < 10000 &&
2504 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2506 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2508 sv_setiv(sv, modcount+1);
2516 right = newOP(OP_UNDEF, 0);
2517 if (right->op_type == OP_READLINE) {
2518 right->op_flags |= OPf_STACKED;
2519 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2522 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2523 o = newBINOP(OP_SASSIGN, flags,
2524 scalar(right), mod(scalar(left), OP_SASSIGN) );
2536 newSTATEOP(I32 flags, char *label, OP *o)
2539 U32 seq = intro_my();
2542 Newz(1101, cop, 1, COP);
2543 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2544 cop->op_type = OP_DBSTATE;
2545 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2548 cop->op_type = OP_NEXTSTATE;
2549 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2551 cop->op_flags = flags;
2552 cop->op_private = 0 | (flags >> 8);
2554 cop->op_private |= NATIVE_HINTS;
2556 cop->op_next = (OP*)cop;
2559 cop->cop_label = label;
2560 hints |= HINT_BLOCK_SCOPE;
2563 cop->cop_arybase = curcop->cop_arybase;
2565 if (copline == NOLINE)
2566 cop->cop_line = curcop->cop_line;
2568 cop->cop_line = copline;
2571 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2572 cop->cop_stash = curstash;
2574 if (PERLDB_LINE && curstash != debstash) {
2575 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2576 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2577 (void)SvIOK_on(*svp);
2579 SvSTASH(*svp) = (HV*)cop;
2583 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2586 /* "Introduce" my variables to visible status. */
2594 if (! min_intro_pending)
2597 svp = AvARRAY(comppad_name);
2598 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2599 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2600 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2601 SvNVX(sv) = (double)cop_seqmax;
2604 min_intro_pending = 0;
2605 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2606 return cop_seqmax++;
2610 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2616 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2617 return newBINOP(type, flags, scalar(first), scalar(other));
2619 scalarboolean(first);
2620 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2621 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2622 if (type == OP_AND || type == OP_OR) {
2628 first = cUNOPo->op_first;
2630 first->op_next = o->op_next;
2631 cUNOPo->op_first = Nullop;
2635 if (first->op_type == OP_CONST) {
2636 if (dowarn && (first->op_private & OPpCONST_BARE))
2637 warn("Probable precedence problem on %s", op_desc[type]);
2638 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2647 else if (first->op_type == OP_WANTARRAY) {
2653 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2654 OP *k1 = ((UNOP*)first)->op_first;
2655 OP *k2 = k1->op_sibling;
2657 switch (first->op_type)
2660 if (k2 && k2->op_type == OP_READLINE
2661 && (k2->op_flags & OPf_STACKED)
2662 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2663 warnop = k2->op_type;
2667 if (k1->op_type == OP_READDIR
2668 || k1->op_type == OP_GLOB
2669 || k1->op_type == OP_EACH)
2670 warnop = k1->op_type;
2674 line_t oldline = curcop->cop_line;
2675 curcop->cop_line = copline;
2676 warn("Value of %s%s can be \"0\"; test with defined()",
2678 ((warnop == OP_READLINE || warnop == OP_GLOB)
2679 ? " construct" : "() operator"));
2680 curcop->cop_line = oldline;
2687 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2688 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2690 Newz(1101, logop, 1, LOGOP);
2692 logop->op_type = type;
2693 logop->op_ppaddr = ppaddr[type];
2694 logop->op_first = first;
2695 logop->op_flags = flags | OPf_KIDS;
2696 logop->op_other = LINKLIST(other);
2697 logop->op_private = 1 | (flags >> 8);
2699 /* establish postfix order */
2700 logop->op_next = LINKLIST(first);
2701 first->op_next = (OP*)logop;
2702 first->op_sibling = other;
2704 o = newUNOP(OP_NULL, 0, (OP*)logop);
2711 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2718 return newLOGOP(OP_AND, 0, first, trueop);
2720 return newLOGOP(OP_OR, 0, first, falseop);
2722 scalarboolean(first);
2723 if (first->op_type == OP_CONST) {
2724 if (SvTRUE(((SVOP*)first)->op_sv)) {
2735 else if (first->op_type == OP_WANTARRAY) {
2739 Newz(1101, condop, 1, CONDOP);
2741 condop->op_type = OP_COND_EXPR;
2742 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2743 condop->op_first = first;
2744 condop->op_flags = flags | OPf_KIDS;
2745 condop->op_true = LINKLIST(trueop);
2746 condop->op_false = LINKLIST(falseop);
2747 condop->op_private = 1 | (flags >> 8);
2749 /* establish postfix order */
2750 condop->op_next = LINKLIST(first);
2751 first->op_next = (OP*)condop;
2753 first->op_sibling = trueop;
2754 trueop->op_sibling = falseop;
2755 o = newUNOP(OP_NULL, 0, (OP*)condop);
2757 trueop->op_next = o;
2758 falseop->op_next = o;
2764 newRANGE(I32 flags, OP *left, OP *right)
2772 Newz(1101, condop, 1, CONDOP);
2774 condop->op_type = OP_RANGE;
2775 condop->op_ppaddr = ppaddr[OP_RANGE];
2776 condop->op_first = left;
2777 condop->op_flags = OPf_KIDS;
2778 condop->op_true = LINKLIST(left);
2779 condop->op_false = LINKLIST(right);
2780 condop->op_private = 1 | (flags >> 8);
2782 left->op_sibling = right;
2784 condop->op_next = (OP*)condop;
2785 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2786 flop = newUNOP(OP_FLOP, 0, flip);
2787 o = newUNOP(OP_NULL, 0, flop);
2790 left->op_next = flip;
2791 right->op_next = flop;
2793 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2794 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2795 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2796 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2798 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2799 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2802 if (!flip->op_private || !flop->op_private)
2803 linklist(o); /* blow off optimizer unless constant */
2809 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2814 int once = block && block->op_flags & OPf_SPECIAL &&
2815 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2818 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2819 return block; /* do {} while 0 does once */
2820 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2821 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2822 expr = newUNOP(OP_DEFINED, 0,
2823 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2827 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2828 o = newLOGOP(OP_AND, 0, expr, listop);
2830 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2832 if (once && o != listop)
2833 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2836 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2838 o->op_flags |= flags;
2840 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2845 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2854 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2855 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2856 expr = newUNOP(OP_DEFINED, 0,
2857 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2861 block = newOP(OP_NULL, 0);
2864 next = LINKLIST(cont);
2866 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2867 if ((line_t)whileline != NOLINE) {
2868 copline = whileline;
2869 cont = append_elem(OP_LINESEQ, cont,
2870 newSTATEOP(0, Nullch, Nullop));
2874 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2875 redo = LINKLIST(listop);
2878 o = newLOGOP(OP_AND, 0, expr, scalar(listop));
2879 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2880 op_free(expr); /* oops, it's a while (0) */
2882 return Nullop; /* (listop already freed by newLOGOP) */
2884 ((LISTOP*)listop)->op_last->op_next = condop =
2885 (o == listop ? redo : LINKLIST(o));
2893 Newz(1101,loop,1,LOOP);
2894 loop->op_type = OP_ENTERLOOP;
2895 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2896 loop->op_private = 0;
2897 loop->op_next = (OP*)loop;
2900 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2902 loop->op_redoop = redo;
2903 loop->op_lastop = o;
2906 loop->op_nextop = next;
2908 loop->op_nextop = o;
2910 o->op_flags |= flags;
2911 o->op_private |= (flags >> 8);
2916 #ifndef CAN_PROTOTYPE
2917 newFOROP(flags,label,forline,sv,expr,block,cont)
2926 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2927 #endif /* CAN_PROTOTYPE */
2935 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2936 sv->op_type = OP_RV2GV;
2937 sv->op_ppaddr = ppaddr[OP_RV2GV];
2939 else if (sv->op_type == OP_PADSV) { /* private variable */
2940 padoff = sv->op_targ;
2944 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
2945 padoff = sv->op_targ;
2946 iterflags |= OPf_SPECIAL;
2951 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2955 padoff = find_threadsv("_");
2956 iterflags |= OPf_SPECIAL;
2958 sv = newGVOP(OP_GV, 0, defgv);
2961 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2962 expr = scalar(ref(expr, OP_ITER));
2963 iterflags |= OPf_STACKED;
2965 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2966 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2968 assert(!loop->op_next);
2969 Renew(loop, 1, LOOP);
2970 loop->op_targ = padoff;
2971 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
2973 return newSTATEOP(0, label, wop);
2977 newLOOPEX(I32 type, OP *label)
2981 if (type != OP_GOTO || label->op_type == OP_CONST) {
2982 /* "last()" means "last" */
2983 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
2984 o = newOP(type, OPf_SPECIAL);
2986 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
2987 ? SvPVx(((SVOP*)label)->op_sv, na)
2993 if (label->op_type == OP_ENTERSUB)
2994 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2995 o = newUNOP(type, OPf_STACKED, label);
2997 hints |= HINT_BLOCK_SCOPE;
3007 MUTEX_DESTROY(CvMUTEXP(cv));
3008 Safefree(CvMUTEXP(cv));
3011 #endif /* USE_THREADS */
3013 if (!CvXSUB(cv) && CvROOT(cv)) {
3015 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3016 croak("Can't undef active subroutine");
3019 croak("Can't undef active subroutine");
3020 #endif /* USE_THREADS */
3027 op_free(CvROOT(cv));
3028 CvROOT(cv) = Nullop;
3031 SvPOK_off((SV*)cv); /* forget prototype */
3033 SvREFCNT_dec(CvGV(cv));
3035 SvREFCNT_dec(CvOUTSIDE(cv));
3036 CvOUTSIDE(cv) = Nullcv;
3037 if (CvPADLIST(cv)) {
3038 /* may be during global destruction */
3039 if (SvREFCNT(CvPADLIST(cv))) {
3040 I32 i = AvFILLp(CvPADLIST(cv));
3042 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3043 SV* sv = svp ? *svp : Nullsv;
3046 if (sv == (SV*)comppad_name)
3047 comppad_name = Nullav;
3048 else if (sv == (SV*)comppad) {
3050 curpad = Null(SV**);
3054 SvREFCNT_dec((SV*)CvPADLIST(cv));
3056 CvPADLIST(cv) = Nullav;
3060 #ifdef DEBUG_CLOSURES
3065 CV *outside = CvOUTSIDE(cv);
3066 AV* padlist = CvPADLIST(cv);
3073 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3075 (CvANON(cv) ? "ANON"
3076 : (cv == main_cv) ? "MAIN"
3077 : CvUNIQUE(outside) ? "UNIQUE"
3078 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3081 : CvANON(outside) ? "ANON"
3082 : (outside == main_cv) ? "MAIN"
3083 : CvUNIQUE(outside) ? "UNIQUE"
3084 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3089 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3090 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3091 pname = AvARRAY(pad_name);
3092 ppad = AvARRAY(pad);
3094 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3095 if (SvPOK(pname[ix]))
3096 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3098 SvFAKE(pname[ix]) ? "FAKE " : "",
3100 (long)I_32(SvNVX(pname[ix])),
3101 (long)SvIVX(pname[ix]));
3104 #endif /* DEBUG_CLOSURES */
3107 cv_clone2(CV *proto, CV *outside)
3112 AV* protopadlist = CvPADLIST(proto);
3113 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3114 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3115 SV** pname = AvARRAY(protopad_name);
3116 SV** ppad = AvARRAY(protopad);
3117 I32 fname = AvFILLp(protopad_name);
3118 I32 fpad = AvFILLp(protopad);
3122 assert(!CvUNIQUE(proto));
3127 SAVESPTR(comppad_name);
3130 cv = compcv = (CV*)NEWSV(1104,0);
3131 sv_upgrade((SV *)cv, SvTYPE(proto));
3137 New(666, CvMUTEXP(cv), 1, perl_mutex);
3138 MUTEX_INIT(CvMUTEXP(cv));
3140 #endif /* USE_THREADS */
3141 CvFILEGV(cv) = CvFILEGV(proto);
3142 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3143 CvSTASH(cv) = CvSTASH(proto);
3144 CvROOT(cv) = CvROOT(proto);
3145 CvSTART(cv) = CvSTART(proto);
3147 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3150 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3152 comppad_name = newAV();
3153 for (ix = fname; ix >= 0; ix--)
3154 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3158 comppadlist = newAV();
3159 AvREAL_off(comppadlist);
3160 av_store(comppadlist, 0, (SV*)comppad_name);
3161 av_store(comppadlist, 1, (SV*)comppad);
3162 CvPADLIST(cv) = comppadlist;
3163 av_fill(comppad, AvFILLp(protopad));
3164 curpad = AvARRAY(comppad);
3166 av = newAV(); /* will be @_ */
3168 av_store(comppad, 0, (SV*)av);
3169 AvFLAGS(av) = AVf_REIFY;
3171 for (ix = fpad; ix > 0; ix--) {
3172 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3173 if (namesv && namesv != &sv_undef) {
3174 char *name = SvPVX(namesv); /* XXX */
3175 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3176 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3177 CvOUTSIDE(cv), cxstack_ix);
3179 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3181 croak("panic: cv_clone: %s", name);
3183 else { /* our own lexical */
3186 /* anon code -- we'll come back for it */
3187 sv = SvREFCNT_inc(ppad[ix]);
3189 else if (*name == '@')
3191 else if (*name == '%')
3201 SV* sv = NEWSV(0,0);
3207 /* Now that vars are all in place, clone nested closures. */
3209 for (ix = fpad; ix > 0; ix--) {
3210 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3212 && namesv != &sv_undef
3213 && !(SvFLAGS(namesv) & SVf_FAKE)
3214 && *SvPVX(namesv) == '&'
3215 && CvCLONE(ppad[ix]))
3217 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3218 SvREFCNT_dec(ppad[ix]);
3221 curpad[ix] = (SV*)kid;
3225 #ifdef DEBUG_CLOSURES
3226 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3228 PerlIO_printf(Perl_debug_log, " from:\n");
3230 PerlIO_printf(Perl_debug_log, " to:\n");
3241 return cv_clone2(proto, CvOUTSIDE(proto));
3245 cv_ckproto(CV *cv, GV *gv, char *p)
3247 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3248 SV* msg = sv_newmortal();
3252 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3253 sv_setpv(msg, "Prototype mismatch:");
3255 sv_catpvf(msg, " sub %_", name);
3257 sv_catpvf(msg, " (%s)", SvPVX(cv));
3258 sv_catpv(msg, " vs ");
3260 sv_catpvf(msg, "(%s)", p);
3262 sv_catpv(msg, "none");
3273 if (!cv || !SvPOK(cv) || SvCUR(cv))
3277 for (o = CvSTART(cv); o; o = o->op_next) {
3278 OPCODE type = o->op_type;
3280 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3282 if (type == OP_LEAVESUB || type == OP_RETURN)
3286 if (type == OP_CONST)
3288 else if (type == OP_PADSV) {
3289 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3290 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3291 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3303 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3306 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3307 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3308 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3317 if (!name || GvCVGEN(gv))
3319 else if (cv = GvCV(gv)) {
3320 cv_ckproto(cv, gv, ps);
3321 /* already defined (or promised)? */
3322 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3325 /* just a "sub foo;" when &foo is already defined */
3329 /* ahem, death to those who redefine active sort subs */
3330 if (curstack == sortstack && sortcop == CvSTART(cv))
3331 croak("Can't redefine active sort subroutine %s", name);
3332 const_sv = cv_const_sv(cv);
3333 if (const_sv || dowarn) {
3334 line_t oldline = curcop->cop_line;
3335 curcop->cop_line = copline;
3336 warn(const_sv ? "Constant subroutine %s redefined"
3337 : "Subroutine %s redefined", name);
3338 curcop->cop_line = oldline;
3344 if (cv) { /* must reuse cv if autoloaded */
3346 CvFLAGS(cv) = CvFLAGS(compcv);
3347 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3348 CvOUTSIDE(compcv) = 0;
3349 CvPADLIST(cv) = CvPADLIST(compcv);
3350 CvPADLIST(compcv) = 0;
3351 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3352 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3353 SvREFCNT_dec(compcv);
3363 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3364 CvFILEGV(cv) = curcop->cop_filegv;
3365 CvSTASH(cv) = curstash;
3368 New(666, CvMUTEXP(cv), 1, perl_mutex);
3369 MUTEX_INIT(CvMUTEXP(cv));
3370 #endif /* USE_THREADS */
3373 sv_setpv((SV*)cv, ps);
3379 char *s = strrchr(name, ':');
3381 if (strEQ(s, "BEGIN")) {
3383 "BEGIN not safe after errors--compilation aborted";
3387 /* force display of errors found but not reported */
3388 sv_catpv(ERRSV, not_safe);
3389 croak("%s", SvPVx(ERRSV, na));
3400 if (AvFILLp(comppad_name) < AvFILLp(comppad))
3401 av_store(comppad_name, AvFILLp(comppad), Nullsv);
3404 SV **namep = AvARRAY(comppad_name);
3405 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3408 if (SvIMMORTAL(curpad[ix]))
3411 * The only things that a clonable function needs in its
3412 * pad are references to outer lexicals and anonymous subs.
3413 * The rest are created anew during cloning.
3415 if (!((namesv = namep[ix]) != Nullsv &&
3416 namesv != &sv_undef &&
3418 *SvPVX(namesv) == '&')))
3420 SvREFCNT_dec(curpad[ix]);
3421 curpad[ix] = Nullsv;
3426 AV *av = newAV(); /* Will be @_ */
3428 av_store(comppad, 0, (SV*)av);
3429 AvFLAGS(av) = AVf_REIFY;
3431 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3432 if (SvIMMORTAL(curpad[ix]))
3434 if (!SvPADMY(curpad[ix]))
3435 SvPADTMP_on(curpad[ix]);
3439 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3440 CvSTART(cv) = LINKLIST(CvROOT(cv));
3441 CvROOT(cv)->op_next = 0;
3447 if (PERLDB_SUBLINE && curstash != debstash) {
3448 SV *sv = NEWSV(0,0);
3449 SV *tmpstr = sv_newmortal();
3450 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3454 sv_setpvf(sv, "%_:%ld-%ld",
3455 GvSV(curcop->cop_filegv),
3456 (long)subline, (long)curcop->cop_line);
3457 gv_efullname3(tmpstr, gv, Nullch);
3458 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3459 hv = GvHVn(db_postponed);
3460 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3461 && (cv = GvCV(db_postponed))) {
3466 perl_call_sv((SV*)cv, G_DISCARD);
3470 if ((s = strrchr(name,':')))
3474 if (strEQ(s, "BEGIN")) {
3475 I32 oldscope = scopestack_ix;
3477 SAVESPTR(compiling.cop_filegv);
3478 SAVEI16(compiling.cop_line);
3485 DEBUG_x( dump_sub(gv) );
3486 av_push(beginav, (SV *)cv);
3488 call_list(oldscope, beginav);
3490 curcop = &compiling;
3493 else if (strEQ(s, "END") && !error_count) {
3496 av_unshift(endav, 1);
3497 av_store(endav, 0, (SV *)cv);
3500 else if (strEQ(s, "INIT") && !error_count) {
3503 av_push(initav, SvREFCNT_inc(cv));
3514 newXS(char *name, void (*subaddr) (CV *), char *filename)
3517 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3520 if (cv = (name ? GvCV(gv) : Nullcv)) {
3522 /* just a cached method */
3526 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3527 /* already defined (or promised) */
3529 line_t oldline = curcop->cop_line;
3530 curcop->cop_line = copline;
3531 warn("Subroutine %s redefined",name);
3532 curcop->cop_line = oldline;
3539 if (cv) /* must reuse cv if autoloaded */
3542 cv = (CV*)NEWSV(1105,0);
3543 sv_upgrade((SV *)cv, SVt_PVCV);
3550 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3552 New(666, CvMUTEXP(cv), 1, perl_mutex);
3553 MUTEX_INIT(CvMUTEXP(cv));
3555 #endif /* USE_THREADS */
3556 CvFILEGV(cv) = gv_fetchfile(filename);
3557 CvXSUB(cv) = subaddr;
3560 char *s = strrchr(name,':');
3565 if (strEQ(s, "BEGIN")) {
3568 av_push(beginav, (SV *)cv);
3571 else if (strEQ(s, "END")) {
3574 av_unshift(endav, 1);
3575 av_store(endav, 0, (SV *)cv);
3578 else if (strEQ(s, "INIT")) {
3581 av_push(initav, (SV *)cv);
3591 newFORM(I32 floor, OP *o, OP *block)
3600 name = SvPVx(cSVOPo->op_sv, na);
3603 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3605 if (cv = GvFORM(gv)) {
3607 line_t oldline = curcop->cop_line;
3609 curcop->cop_line = copline;
3610 warn("Format %s redefined",name);
3611 curcop->cop_line = oldline;
3617 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3618 CvFILEGV(cv) = curcop->cop_filegv;
3620 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3621 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3622 SvPADTMP_on(curpad[ix]);
3625 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3626 CvSTART(cv) = LINKLIST(CvROOT(cv));
3627 CvROOT(cv)->op_next = 0;
3637 return newUNOP(OP_REFGEN, 0,
3638 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3644 return newUNOP(OP_REFGEN, 0,
3645 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3649 newANONSUB(I32 floor, OP *proto, OP *block)
3651 return newUNOP(OP_REFGEN, 0,
3652 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3658 switch (o->op_type) {
3660 o->op_type = OP_PADAV;
3661 o->op_ppaddr = ppaddr[OP_PADAV];
3662 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3665 o->op_type = OP_RV2AV;
3666 o->op_ppaddr = ppaddr[OP_RV2AV];
3671 warn("oops: oopsAV");
3680 switch (o->op_type) {
3683 o->op_type = OP_PADHV;
3684 o->op_ppaddr = ppaddr[OP_PADHV];
3685 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3689 o->op_type = OP_RV2HV;
3690 o->op_ppaddr = ppaddr[OP_RV2HV];
3695 warn("oops: oopsHV");
3704 if (o->op_type == OP_PADANY) {
3705 o->op_type = OP_PADAV;
3706 o->op_ppaddr = ppaddr[OP_PADAV];
3709 return newUNOP(OP_RV2AV, 0, scalar(o));
3713 newGVREF(I32 type, OP *o)
3715 if (type == OP_MAPSTART)
3716 return newUNOP(OP_NULL, 0, o);
3717 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3723 if (o->op_type == OP_PADANY) {
3724 o->op_type = OP_PADHV;
3725 o->op_ppaddr = ppaddr[OP_PADHV];
3728 return newUNOP(OP_RV2HV, 0, scalar(o));
3734 croak("NOT IMPL LINE %d",__LINE__);
3740 newCVREF(I32 flags, OP *o)
3742 return newUNOP(OP_RV2CV, flags, scalar(o));
3748 if (o->op_type == OP_PADANY) {
3749 o->op_type = OP_PADSV;
3750 o->op_ppaddr = ppaddr[OP_PADSV];
3753 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3754 o->op_flags |= OPpDONE_SVREF;
3757 return newUNOP(OP_RV2SV, 0, scalar(o));
3760 /* Check routines. */
3768 name = NEWSV(1106,0);
3769 sv_upgrade(name, SVt_PVNV);
3770 sv_setpvn(name, "&", 1);
3773 ix = pad_alloc(o->op_type, SVs_PADMY);
3774 av_store(comppad_name, ix, name);
3775 av_store(comppad, ix, cSVOPo->op_sv);
3776 SvPADMY_on(cSVOPo->op_sv);
3777 cSVOPo->op_sv = Nullsv;
3778 cSVOPo->op_targ = ix;
3785 o->op_private = hints;
3792 if (cUNOPo->op_first->op_type == OP_CONCAT)
3793 o->op_flags |= OPf_STACKED;
3800 if (o->op_flags & OPf_KIDS) {
3803 OPCODE type = o->op_type;
3804 o = modkids(ck_fun(o), type);
3805 kid = cUNOPo->op_first;
3806 newop = kUNOP->op_first->op_sibling;
3808 (newop->op_sibling ||
3809 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3810 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3811 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3815 op_free(kUNOP->op_first);
3816 kUNOP->op_first = newop;
3818 o->op_ppaddr = ppaddr[++o->op_type];
3827 if (o->op_flags & OPf_KIDS) {
3828 OP *kid = cUNOPo->op_first;
3829 if (kid->op_type == OP_HSLICE)
3830 o->op_private |= OPpSLICE;
3831 else if (kid->op_type != OP_HELEM)
3832 croak("%s argument is not a HASH element or slice",
3833 op_desc[o->op_type]);
3842 I32 type = o->op_type;
3844 if (o->op_flags & OPf_KIDS) {
3845 if (cLISTOPo->op_first->op_type == OP_STUB) {
3847 o = newUNOP(type, OPf_SPECIAL,
3848 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3858 hints |= HINT_BLOCK_SCOPE;
3859 if (o->op_flags & OPf_KIDS) {
3860 SVOP *kid = (SVOP*)cUNOPo->op_first;
3863 o->op_flags &= ~OPf_KIDS;
3866 else if (kid->op_type == OP_LINESEQ) {
3869 kid->op_next = o->op_next;
3870 cUNOPo->op_first = 0;
3873 Newz(1101, enter, 1, LOGOP);
3874 enter->op_type = OP_ENTERTRY;
3875 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3876 enter->op_private = 0;
3878 /* establish postfix order */
3879 enter->op_next = (OP*)enter;
3881 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3882 o->op_type = OP_LEAVETRY;
3883 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3884 enter->op_other = o;
3892 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
3894 o->op_targ = (PADOFFSET)hints;
3902 if (o->op_flags & OPf_STACKED) {
3904 kid = cUNOPo->op_first->op_sibling;
3905 if (kid->op_type == OP_RV2GV)
3917 if (o->op_flags & OPf_KIDS) {
3918 OP *kid = cUNOPo->op_first;
3919 if (kid->op_type != OP_HELEM)
3920 croak("%s argument is not a HASH element", op_desc[o->op_type]);
3927 ck_gvconst(register OP *o)
3929 o = fold_constants(o);
3930 if (o->op_type == OP_CONST)
3936 ck_rvconst(register OP *o)
3939 SVOP *kid = (SVOP*)cUNOPo->op_first;
3941 o->op_private |= (hints & HINT_STRICT_REFS);
3942 if (kid->op_type == OP_CONST) {
3947 name = SvPV(kid->op_sv, na);
3948 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3949 char *badthing = Nullch;
3950 switch (o->op_type) {
3952 badthing = "a SCALAR";
3955 badthing = "an ARRAY";
3958 badthing = "a HASH";
3963 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3966 kid->op_type = OP_GV;
3967 iscv = (o->op_type == OP_RV2CV) * 2;
3968 for (gv = 0; !gv; iscv++) {
3970 * This is a little tricky. We only want to add the symbol if we
3971 * didn't add it in the lexer. Otherwise we get duplicate strict
3972 * warnings. But if we didn't add it in the lexer, we must at
3973 * least pretend like we wanted to add it even if it existed before,
3974 * or we get possible typo warnings. OPpCONST_ENTERED says
3975 * whether the lexer already added THIS instance of this symbol.
3977 gv = gv_fetchpv(name,
3978 iscv | !(kid->op_private & OPpCONST_ENTERED),
3981 : o->op_type == OP_RV2SV
3983 : o->op_type == OP_RV2AV
3985 : o->op_type == OP_RV2HV
3989 SvREFCNT_dec(kid->op_sv);
3990 kid->op_sv = SvREFCNT_inc(gv);
3999 I32 type = o->op_type;
4001 if (o->op_flags & OPf_REF)
4004 if (o->op_flags & OPf_KIDS) {
4005 SVOP *kid = (SVOP*)cUNOPo->op_first;
4007 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4008 OP *newop = newGVOP(type, OPf_REF,
4009 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4016 if (type == OP_FTTTY)
4017 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4020 return newUNOP(type, 0, newDEFSVOP());
4033 int type = o->op_type;
4034 register I32 oa = opargs[type] >> OASHIFT;
4036 if (o->op_flags & OPf_STACKED) {
4037 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4040 return no_fh_allowed(o);
4043 if (o->op_flags & OPf_KIDS) {
4044 tokid = &cLISTOPo->op_first;
4045 kid = cLISTOPo->op_first;
4046 if (kid->op_type == OP_PUSHMARK ||
4047 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4049 tokid = &kid->op_sibling;
4050 kid = kid->op_sibling;
4052 if (!kid && opargs[type] & OA_DEFGV)
4053 *tokid = kid = newDEFSVOP();
4057 sibl = kid->op_sibling;
4071 if (kid->op_type == OP_CONST &&
4072 (kid->op_private & OPpCONST_BARE)) {
4073 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4074 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4075 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4077 warn("Array @%s missing the @ in argument %ld of %s()",
4078 name, (long)numargs, op_desc[type]);
4081 kid->op_sibling = sibl;
4084 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4085 bad_type(numargs, "array", op_desc[o->op_type], kid);
4089 if (kid->op_type == OP_CONST &&
4090 (kid->op_private & OPpCONST_BARE)) {
4091 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4092 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4093 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4095 warn("Hash %%%s missing the %% in argument %ld of %s()",
4096 name, (long)numargs, op_desc[type]);
4099 kid->op_sibling = sibl;
4102 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4103 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4108 OP *newop = newUNOP(OP_NULL, 0, kid);
4109 kid->op_sibling = 0;
4111 newop->op_next = newop;
4113 kid->op_sibling = sibl;
4118 if (kid->op_type != OP_GV) {
4119 if (kid->op_type == OP_CONST &&
4120 (kid->op_private & OPpCONST_BARE)) {
4121 OP *newop = newGVOP(OP_GV, 0,
4122 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4128 kid->op_sibling = 0;
4129 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4131 kid->op_sibling = sibl;
4137 mod(scalar(kid), type);
4141 tokid = &kid->op_sibling;
4142 kid = kid->op_sibling;
4144 o->op_private |= numargs;
4146 return too_many_arguments(o,op_desc[o->op_type]);
4149 else if (opargs[type] & OA_DEFGV) {
4151 return newUNOP(type, 0, newDEFSVOP());
4155 while (oa & OA_OPTIONAL)
4157 if (oa && oa != OA_LIST)
4158 return too_few_arguments(o,op_desc[o->op_type]);
4168 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4169 append_elem(OP_GLOB, o, newDEFSVOP());
4171 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4172 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4174 if (gv && GvIMPORTED_CV(gv)) {
4175 static int glob_index;
4177 append_elem(OP_GLOB, o,
4178 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4179 o->op_type = OP_LIST;
4180 o->op_ppaddr = ppaddr[OP_LIST];
4181 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4182 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4183 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4184 append_elem(OP_LIST, o,
4185 scalar(newUNOP(OP_RV2CV, 0,
4186 newGVOP(OP_GV, 0, gv)))));
4187 o = newUNOP(OP_NULL, 0, ck_subr(o));
4188 o->op_targ = OP_GLOB; /* hint at what it used to be */
4191 gv = newGVgen("main");
4193 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4203 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4205 o->op_ppaddr = ppaddr[OP_GREPSTART];
4206 Newz(1101, gwop, 1, LOGOP);
4208 if (o->op_flags & OPf_STACKED) {
4211 kid = cLISTOPo->op_first->op_sibling;
4212 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4215 kid->op_next = (OP*)gwop;
4216 o->op_flags &= ~OPf_STACKED;
4218 kid = cLISTOPo->op_first->op_sibling;
4219 if (type == OP_MAPWHILE)
4226 kid = cLISTOPo->op_first->op_sibling;
4227 if (kid->op_type != OP_NULL)
4228 croak("panic: ck_grep");
4229 kid = kUNOP->op_first;
4231 gwop->op_type = type;
4232 gwop->op_ppaddr = ppaddr[type];
4233 gwop->op_first = listkids(o);
4234 gwop->op_flags |= OPf_KIDS;
4235 gwop->op_private = 1;
4236 gwop->op_other = LINKLIST(kid);
4237 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4238 kid->op_next = (OP*)gwop;
4240 kid = cLISTOPo->op_first->op_sibling;
4241 if (!kid || !kid->op_sibling)
4242 return too_few_arguments(o,op_desc[o->op_type]);
4243 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4244 mod(kid, OP_GREPSTART);
4252 if (o->op_flags & OPf_KIDS) {
4253 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4254 if (kid && kid->op_type == OP_CONST)
4255 fbm_compile(((SVOP*)kid)->op_sv);
4261 ck_lengthconst(OP *o)
4263 /* XXX length optimization goes here */
4270 OPCODE type = o->op_type;
4271 return modkids(ck_fun(o), type);
4277 OPCODE type = o->op_type;
4278 return refkids(ck_fun(o), type);
4286 kid = cLISTOPo->op_first;
4289 kid = cLISTOPo->op_first;
4291 if (kid->op_type == OP_PUSHMARK)
4292 kid = kid->op_sibling;
4293 if (kid && o->op_flags & OPf_STACKED)
4294 kid = kid->op_sibling;
4295 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4296 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4297 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4298 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4299 cLISTOPo->op_first->op_sibling = kid;
4300 cLISTOPo->op_last = kid;
4301 kid = kid->op_sibling;
4306 append_elem(o->op_type, o, newDEFSVOP());
4312 if (hints & HINT_LOCALE)
4313 o->op_private |= OPpLOCALE;
4320 ck_fun_locale(OP *o)
4326 if (hints & HINT_LOCALE)
4327 o->op_private |= OPpLOCALE;
4338 if (hints & HINT_LOCALE)
4339 o->op_private |= OPpLOCALE;
4348 o->op_private |= OPpRUNTIME;
4361 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4362 o->op_private |= OPpREPEAT_DOLIST;
4363 cBINOPo->op_first = force_list(cBINOPo->op_first);
4373 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4374 SVOP *kid = (SVOP*)cUNOPo->op_first;
4376 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4378 for (s = SvPVX(kid->op_sv); *s; s++) {
4379 if (*s == ':' && s[1] == ':') {
4381 Move(s+2, s+1, strlen(s+2)+1, char);
4382 --SvCUR(kid->op_sv);
4385 sv_catpvn(kid->op_sv, ".pm", 3);
4394 croak("NOT IMPL LINE %d",__LINE__);
4403 if (o->op_flags & OPf_KIDS) {
4404 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4405 if (kid && kid->op_sibling) {
4406 o->op_type = OP_SSELECT;
4407 o->op_ppaddr = ppaddr[OP_SSELECT];
4409 return fold_constants(o);
4413 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4414 if (kid && kid->op_type == OP_RV2GV)
4415 kid->op_private &= ~HINT_STRICT_REFS;
4422 I32 type = o->op_type;
4424 if (!(o->op_flags & OPf_KIDS)) {
4429 if (!CvUNIQUE(compcv)) {
4430 argop = newOP(OP_PADAV, OPf_REF);
4431 argop->op_targ = 0; /* curpad[0] is @_ */
4434 argop = newUNOP(OP_RV2AV, 0,
4435 scalar(newGVOP(OP_GV, 0,
4436 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4439 argop = newUNOP(OP_RV2AV, 0,
4440 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(compcv) ?
4441 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4442 #endif /* USE_THREADS */
4443 return newUNOP(type, 0, scalar(argop));
4445 return scalar(modkids(ck_fun(o), type));
4453 if (hints & HINT_LOCALE)
4454 o->op_private |= OPpLOCALE;
4457 if (o->op_flags & OPf_STACKED) {
4458 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4460 kid = kUNOP->op_first; /* get past rv2gv */
4462 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4464 if (kid->op_type == OP_SCOPE) {
4468 else if (kid->op_type == OP_LEAVE) {
4469 if (o->op_type == OP_SORT) {
4470 null(kid); /* wipe out leave */
4473 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4474 if (k->op_next == kid)
4479 kid->op_next = 0; /* just disconnect the leave */
4480 k = kLISTOP->op_first;
4484 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4485 null(kid); /* wipe out rv2gv */
4486 if (o->op_type == OP_SORT)
4490 o->op_flags |= OPf_SPECIAL;
4502 if (o->op_flags & OPf_STACKED)
4503 return no_fh_allowed(o);
4505 kid = cLISTOPo->op_first;
4506 if (kid->op_type != OP_NULL)
4507 croak("panic: ck_split");
4508 kid = kid->op_sibling;
4509 op_free(cLISTOPo->op_first);
4510 cLISTOPo->op_first = kid;
4512 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4513 cLISTOPo->op_last = kid; /* There was only one element previously */
4516 if (kid->op_type != OP_MATCH) {
4517 OP *sibl = kid->op_sibling;
4518 kid->op_sibling = 0;
4519 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4520 if (cLISTOPo->op_first == cLISTOPo->op_last)
4521 cLISTOPo->op_last = kid;
4522 cLISTOPo->op_first = kid;
4523 kid->op_sibling = sibl;
4526 kid->op_type = OP_PUSHRE;
4527 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4530 if (!kid->op_sibling)
4531 append_elem(OP_SPLIT, o, newDEFSVOP());
4533 kid = kid->op_sibling;
4536 if (!kid->op_sibling)
4537 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4539 kid = kid->op_sibling;
4542 if (kid->op_sibling)
4543 return too_many_arguments(o,op_desc[o->op_type]);
4552 OP *prev = ((cUNOPo->op_first->op_sibling)
4553 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4554 OP *o2 = prev->op_sibling;
4562 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4563 if (cvop->op_type == OP_RV2CV) {
4565 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4566 null(cvop); /* disable rv2cv */
4567 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4568 if (tmpop->op_type == OP_GV) {
4569 cv = GvCVu(tmpop->op_sv);
4570 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4571 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4572 proto = SvPV((SV*)cv, na);
4576 o->op_private |= (hints & HINT_STRICT_REFS);
4577 if (PERLDB_SUB && curstash != debstash)
4578 o->op_private |= OPpENTERSUB_DB;
4579 while (o2 != cvop) {
4583 return too_many_arguments(o, gv_ename(namegv));
4601 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4602 bad_type(arg, "block", gv_ename(namegv), o2);
4607 if (o2->op_type == OP_RV2GV)
4611 OP* sib = kid->op_sibling;
4612 kid->op_sibling = 0;
4613 o2 = newUNOP(OP_RV2GV, 0, kid);
4614 o2->op_sibling = sib;
4615 prev->op_sibling = o2;
4623 if (o2->op_type != OP_RV2GV)
4624 bad_type(arg, "symbol", gv_ename(namegv), o2);
4627 if (o2->op_type != OP_RV2CV)
4628 bad_type(arg, "sub", gv_ename(namegv), o2);
4631 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4632 bad_type(arg, "scalar", gv_ename(namegv), o2);
4635 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4636 bad_type(arg, "array", gv_ename(namegv), o2);
4639 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4640 bad_type(arg, "hash", gv_ename(namegv), o2);
4644 OP* sib = kid->op_sibling;
4645 kid->op_sibling = 0;
4646 o2 = newUNOP(OP_REFGEN, 0, kid);
4647 o2->op_sibling = sib;
4648 prev->op_sibling = o2;
4659 croak("Malformed prototype for %s: %s",
4660 gv_ename(namegv), SvPV((SV*)cv, na));
4665 mod(o2, OP_ENTERSUB);
4667 o2 = o2->op_sibling;
4669 if (proto && !optional &&
4670 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4671 return too_few_arguments(o, gv_ename(namegv));
4678 SvREADONLY_on(cSVOPo->op_sv);
4685 if (o->op_flags & OPf_KIDS) {
4686 SVOP *kid = (SVOP*)cUNOPo->op_first;
4688 if (kid->op_type == OP_NULL)
4689 kid = (SVOP*)kid->op_sibling;
4691 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4692 o->op_flags |= OPf_SPECIAL;
4697 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4700 peep(register OP *o)
4703 register OP* oldop = 0;
4704 if (!o || o->op_seq)
4709 for (; o; o = o->op_next) {
4715 switch (o->op_type) {
4718 curcop = ((COP*)o); /* for warnings */
4719 o->op_seq = op_seqmax++;
4730 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
4732 o->op_seq = op_seqmax++;
4735 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4736 o->op_seq = op_seqmax++;
4737 break; /* Scalar stub must produce undef. List stub is noop */
4741 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4742 curcop = ((COP*)op);
4748 if (oldop && o->op_next) {
4749 oldop->op_next = o->op_next;
4752 o->op_seq = op_seqmax++;
4756 if (o->op_next->op_type == OP_RV2SV) {
4757 if (!(o->op_next->op_private & OPpDEREF)) {
4759 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4760 o->op_next = o->op_next->op_next;
4761 o->op_type = OP_GVSV;
4762 o->op_ppaddr = ppaddr[OP_GVSV];
4765 else if (o->op_next->op_type == OP_RV2AV) {
4766 OP* pop = o->op_next->op_next;
4768 if (pop->op_type == OP_CONST &&
4769 (op = pop->op_next) &&
4770 pop->op_next->op_type == OP_AELEM &&
4771 !(pop->op_next->op_private &
4772 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4773 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4777 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4781 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4782 o->op_next = pop->op_next->op_next;
4783 o->op_type = OP_AELEMFAST;
4784 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4785 o->op_private = (U8)i;
4786 GvAVn(((GVOP*)o)->op_gv);
4789 o->op_seq = op_seqmax++;
4793 if (o->op_next->op_type == OP_RV2AV
4794 && (o->op_next->op_flags && OPf_REF))
4797 o->op_next = o->op_next->op_next;
4802 if (o->op_next->op_type == OP_RV2HV
4803 && (o->op_next->op_flags && OPf_REF))
4806 o->op_next = o->op_next->op_next;
4814 o->op_seq = op_seqmax++;
4815 peep(cLOGOP->op_other);
4819 o->op_seq = op_seqmax++;
4820 peep(cCONDOP->op_true);
4821 peep(cCONDOP->op_false);
4825 o->op_seq = op_seqmax++;
4826 peep(cLOOP->op_redoop);
4827 peep(cLOOP->op_nextop);
4828 peep(cLOOP->op_lastop);
4833 o->op_seq = op_seqmax++;
4834 peep(cPMOP->op_pmreplstart);
4838 o->op_seq = op_seqmax++;
4839 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4840 if (o->op_next->op_sibling &&
4841 o->op_next->op_sibling->op_type != OP_DIE) {
4842 line_t oldline = curcop->cop_line;
4844 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4845 warn("Statement unlikely to be reached");
4846 warn("(Maybe you meant system() when you said exec()?)\n");
4847 curcop->cop_line = oldline;
4861 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4862 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4864 rop = (UNOP*)((BINOP*)o)->op_first;
4865 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4867 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4868 if (!SvOBJECT(lexname))
4870 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4871 if (!fields || !GvHV(*fields))
4873 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4874 key = SvPV(*svp, keylen);
4875 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4877 croak("No such field \"%s\" in variable %s of type %s",
4878 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4880 ind = SvIV(*indsvp);
4882 croak("Bad index while coercing array into hash");
4883 rop->op_type = OP_RV2AV;
4884 rop->op_ppaddr = ppaddr[OP_RV2AV];
4885 o->op_type = OP_AELEM;
4886 o->op_ppaddr = ppaddr[OP_AELEM];
4888 *svp = newSViv(ind);
4893 o->op_seq = op_seqmax++;