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);
1173 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1174 return o; /* Treat \(@foo) like ordinary list. */
1175 if (scalar_mod_type(o, type))
1181 croak("Can't localize lexical variable %s",
1182 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1187 modcount++; /* XXX ??? */
1189 #endif /* USE_THREADS */
1195 if (type != OP_SASSIGN)
1201 pad_free(o->op_targ);
1202 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1203 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1204 if (o->op_flags & OPf_KIDS)
1205 mod(cBINOPo->op_first->op_sibling, type);
1210 ref(cBINOPo->op_first, o->op_type);
1211 if (type == OP_ENTERSUB &&
1212 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1213 o->op_private |= OPpLVAL_DEFER;
1220 if (o->op_flags & OPf_KIDS)
1221 mod(cLISTOPo->op_last, type);
1225 if (!(o->op_flags & OPf_KIDS))
1227 if (o->op_targ != OP_LIST) {
1228 mod(cBINOPo->op_first, type);
1233 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1237 o->op_flags |= OPf_MOD;
1239 if (type == OP_AASSIGN || type == OP_SASSIGN)
1240 o->op_flags |= OPf_SPECIAL|OPf_REF;
1242 o->op_private |= OPpLVAL_INTRO;
1243 o->op_flags &= ~OPf_SPECIAL;
1245 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1246 o->op_flags |= OPf_REF;
1251 scalar_mod_type(OP *o, I32 type)
1255 if (o->op_type == OP_RV2GV)
1279 case OP_RIGHT_SHIFT:
1286 case OP_ANDASSIGN: /* may work later */
1287 case OP_ORASSIGN: /* may work later */
1295 refkids(OP *o, I32 type)
1298 if (o && o->op_flags & OPf_KIDS) {
1299 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1306 ref(OP *o, I32 type)
1310 if (!o || error_count)
1313 switch (o->op_type) {
1315 if ((type == OP_DEFINED || type == OP_LOCK) &&
1316 !(o->op_flags & OPf_STACKED)) {
1317 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1318 o->op_ppaddr = ppaddr[OP_RV2CV];
1319 assert(cUNOPo->op_first->op_type == OP_NULL);
1320 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1321 o->op_flags |= OPf_SPECIAL;
1326 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1330 ref(cUNOPo->op_first, o->op_type);
1333 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1334 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1335 : type == OP_RV2HV ? OPpDEREF_HV
1337 o->op_flags |= OPf_MOD;
1342 o->op_flags |= OPf_MOD; /* XXX ??? */
1347 o->op_flags |= OPf_REF;
1350 ref(cUNOPo->op_first, o->op_type);
1355 o->op_flags |= OPf_REF;
1360 if (!(o->op_flags & OPf_KIDS))
1362 ref(cBINOPo->op_first, type);
1366 ref(cBINOPo->op_first, o->op_type);
1367 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1368 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1369 : type == OP_RV2HV ? OPpDEREF_HV
1371 o->op_flags |= OPf_MOD;
1379 if (!(o->op_flags & OPf_KIDS))
1381 ref(cLISTOPo->op_last, type);
1396 if (!o || error_count)
1400 if (type == OP_LIST) {
1401 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1404 else if (type != OP_PADSV &&
1407 type != OP_PUSHMARK)
1409 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1412 o->op_flags |= OPf_MOD;
1413 o->op_private |= OPpLVAL_INTRO;
1421 o->op_flags |= OPf_PARENS;
1426 bind_match(I32 type, OP *left, OP *right)
1431 (left->op_type == OP_RV2AV ||
1432 left->op_type == OP_RV2HV ||
1433 left->op_type == OP_PADAV ||
1434 left->op_type == OP_PADHV)) {
1435 char *desc = op_desc[(right->op_type == OP_SUBST ||
1436 right->op_type == OP_TRANS)
1437 ? right->op_type : OP_MATCH];
1438 char *sample = ((left->op_type == OP_RV2AV ||
1439 left->op_type == OP_PADAV)
1440 ? "@array" : "%hash");
1441 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1444 if (right->op_type == OP_MATCH ||
1445 right->op_type == OP_SUBST ||
1446 right->op_type == OP_TRANS) {
1447 right->op_flags |= OPf_STACKED;
1448 if (right->op_type != OP_MATCH)
1449 left = mod(left, right->op_type);
1450 if (right->op_type == OP_TRANS)
1451 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1453 o = prepend_elem(right->op_type, scalar(left), right);
1455 return newUNOP(OP_NOT, 0, scalar(o));
1459 return bind_match(type, left,
1460 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1468 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1469 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1476 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1477 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1478 o->op_type = OP_LEAVE;
1479 o->op_ppaddr = ppaddr[OP_LEAVE];
1482 if (o->op_type == OP_LINESEQ) {
1484 o->op_type = OP_SCOPE;
1485 o->op_ppaddr = ppaddr[OP_SCOPE];
1486 kid = ((LISTOP*)o)->op_first;
1487 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1488 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1493 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1500 block_start(int full)
1503 int retval = savestack_ix;
1504 SAVEI32(comppad_name_floor);
1506 if ((comppad_name_fill = AvFILLp(comppad_name)) > 0)
1507 comppad_name_floor = comppad_name_fill;
1509 comppad_name_floor = 0;
1511 SAVEI32(min_intro_pending);
1512 SAVEI32(max_intro_pending);
1513 min_intro_pending = 0;
1514 SAVEI32(comppad_name_fill);
1515 SAVEI32(padix_floor);
1516 padix_floor = padix;
1517 pad_reset_pending = FALSE;
1519 hints &= ~HINT_BLOCK_SCOPE;
1524 block_end(I32 floor, OP *seq)
1527 int needblockscope = hints & HINT_BLOCK_SCOPE;
1528 OP* retval = scalarseq(seq);
1530 pad_reset_pending = FALSE;
1532 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1533 pad_leavemy(comppad_name_fill);
1542 OP *o = newOP(OP_THREADSV, 0);
1543 o->op_targ = find_threadsv("_");
1546 return newSVREF(newGVOP(OP_GV, 0, defgv));
1547 #endif /* USE_THREADS */
1555 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1556 eval_start = linklist(eval_root);
1557 eval_root->op_next = 0;
1563 main_root = scope(sawparens(scalarvoid(o)));
1564 curcop = &compiling;
1565 main_start = LINKLIST(main_root);
1566 main_root->op_next = 0;
1570 /* Register with debugger */
1572 CV *cv = perl_get_cv("DB::postponed", FALSE);
1576 XPUSHs((SV*)compiling.cop_filegv);
1578 perl_call_sv((SV*)cv, G_DISCARD);
1585 localize(OP *o, I32 lex)
1587 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))
1647 if (o->op_private & OPpLOCALE)
1652 goto nope; /* Don't try to run w/ errors */
1654 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1655 if (curop->op_type != OP_CONST &&
1656 curop->op_type != OP_LIST &&
1657 curop->op_type != OP_SCALAR &&
1658 curop->op_type != OP_NULL &&
1659 curop->op_type != OP_PUSHMARK) {
1664 curop = LINKLIST(o);
1669 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1670 pad_swipe(o->op_targ);
1671 else if (SvTEMP(sv)) { /* grab mortal temp? */
1672 (void)SvREFCNT_inc(sv);
1676 if (type == OP_RV2GV)
1677 return newGVOP(OP_GV, 0, (GV*)sv);
1679 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1681 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1686 SvIOK_off(sv); /* undo SvIV() damage */
1688 return newSVOP(OP_CONST, 0, sv);
1692 if (!(opargs[type] & OA_OTHERINT))
1695 if (!(hints & HINT_INTEGER)) {
1696 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1699 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1700 if (curop->op_type == OP_CONST) {
1701 if (SvIOK(((SVOP*)curop)->op_sv))
1705 if (opargs[curop->op_type] & OA_RETINTEGER)
1709 o->op_ppaddr = ppaddr[++(o->op_type)];
1716 gen_constant_list(register OP *o)
1720 I32 oldtmps_floor = tmps_floor;
1724 return o; /* Don't attempt to run with errors */
1726 op = curop = LINKLIST(o);
1732 tmps_floor = oldtmps_floor;
1734 o->op_type = OP_RV2AV;
1735 o->op_ppaddr = ppaddr[OP_RV2AV];
1736 curop = ((UNOP*)o)->op_first;
1737 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1744 convert(I32 type, I32 flags, OP *o)
1749 if (!o || o->op_type != OP_LIST)
1750 o = newLISTOP(OP_LIST, 0, o, Nullop);
1752 o->op_flags &= ~OPf_WANT;
1754 if (!(opargs[type] & OA_MARK))
1755 null(cLISTOPo->op_first);
1758 o->op_ppaddr = ppaddr[type];
1759 o->op_flags |= flags;
1761 o = CHECKOP(type, o);
1762 if (o->op_type != type)
1765 if (cLISTOPo->op_children < 7) {
1766 /* XXX do we really need to do this if we're done appending?? */
1767 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1769 cLISTOPo->op_last = last; /* in case check substituted last arg */
1772 return fold_constants(o);
1775 /* List constructors */
1778 append_elem(I32 type, OP *first, OP *last)
1786 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1787 return newLISTOP(type, 0, first, last);
1789 if (first->op_flags & OPf_KIDS)
1790 ((LISTOP*)first)->op_last->op_sibling = last;
1792 first->op_flags |= OPf_KIDS;
1793 ((LISTOP*)first)->op_first = last;
1795 ((LISTOP*)first)->op_last = last;
1796 ((LISTOP*)first)->op_children++;
1801 append_list(I32 type, LISTOP *first, LISTOP *last)
1809 if (first->op_type != type)
1810 return prepend_elem(type, (OP*)first, (OP*)last);
1812 if (last->op_type != type)
1813 return append_elem(type, (OP*)first, (OP*)last);
1815 first->op_last->op_sibling = last->op_first;
1816 first->op_last = last->op_last;
1817 first->op_children += last->op_children;
1818 if (first->op_children)
1819 last->op_flags |= OPf_KIDS;
1826 prepend_elem(I32 type, OP *first, OP *last)
1834 if (last->op_type == type) {
1835 if (type == OP_LIST) { /* already a PUSHMARK there */
1836 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1837 ((LISTOP*)last)->op_first->op_sibling = first;
1840 if (!(last->op_flags & OPf_KIDS)) {
1841 ((LISTOP*)last)->op_last = first;
1842 last->op_flags |= OPf_KIDS;
1844 first->op_sibling = ((LISTOP*)last)->op_first;
1845 ((LISTOP*)last)->op_first = first;
1847 ((LISTOP*)last)->op_children++;
1851 return newLISTOP(type, 0, first, last);
1859 return newOP(OP_STUB, 0);
1865 if (!o || o->op_type != OP_LIST)
1866 o = newLISTOP(OP_LIST, 0, o, Nullop);
1872 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1876 Newz(1101, listop, 1, LISTOP);
1878 listop->op_type = type;
1879 listop->op_ppaddr = ppaddr[type];
1880 listop->op_children = (first != 0) + (last != 0);
1881 listop->op_flags = flags;
1885 else if (!first && last)
1888 first->op_sibling = last;
1889 listop->op_first = first;
1890 listop->op_last = last;
1891 if (type == OP_LIST) {
1893 pushop = newOP(OP_PUSHMARK, 0);
1894 pushop->op_sibling = first;
1895 listop->op_first = pushop;
1896 listop->op_flags |= OPf_KIDS;
1898 listop->op_last = pushop;
1900 else if (listop->op_children)
1901 listop->op_flags |= OPf_KIDS;
1907 newOP(I32 type, I32 flags)
1910 Newz(1101, o, 1, OP);
1912 o->op_ppaddr = ppaddr[type];
1913 o->op_flags = flags;
1916 o->op_private = 0 + (flags >> 8);
1917 if (opargs[type] & OA_RETSCALAR)
1919 if (opargs[type] & OA_TARGET)
1920 o->op_targ = pad_alloc(type, SVs_PADTMP);
1921 return CHECKOP(type, o);
1925 newUNOP(I32 type, I32 flags, OP *first)
1930 first = newOP(OP_STUB, 0);
1931 if (opargs[type] & OA_MARK)
1932 first = force_list(first);
1934 Newz(1101, unop, 1, UNOP);
1935 unop->op_type = type;
1936 unop->op_ppaddr = ppaddr[type];
1937 unop->op_first = first;
1938 unop->op_flags = flags | OPf_KIDS;
1939 unop->op_private = 1 | (flags >> 8);
1941 if(type == OP_STUDY && first->op_type == OP_MATCH) {
1942 first->op_type = OP_PUSHRE;
1943 first->op_ppaddr = ppaddr[OP_PUSHRE];
1946 unop = (UNOP*) CHECKOP(type, unop);
1950 return fold_constants((OP *) unop);
1954 newBINOP(I32 type, I32 flags, OP *first, OP *last)
1957 Newz(1101, binop, 1, BINOP);
1960 first = newOP(OP_NULL, 0);
1962 binop->op_type = type;
1963 binop->op_ppaddr = ppaddr[type];
1964 binop->op_first = first;
1965 binop->op_flags = flags | OPf_KIDS;
1968 binop->op_private = 1 | (flags >> 8);
1971 binop->op_private = 2 | (flags >> 8);
1972 first->op_sibling = last;
1975 binop = (BINOP*)CHECKOP(type, binop);
1979 binop->op_last = last = binop->op_first->op_sibling;
1981 return fold_constants((OP *)binop);
1985 pmtrans(OP *o, OP *expr, OP *repl)
1987 SV *tstr = ((SVOP*)expr)->op_sv;
1988 SV *rstr = ((SVOP*)repl)->op_sv;
1991 register U8 *t = (U8*)SvPV(tstr, tlen);
1992 register U8 *r = (U8*)SvPV(rstr, rlen);
1998 register short *tbl;
2000 tbl = (short*)cPVOPo->op_pv;
2001 complement = o->op_private & OPpTRANS_COMPLEMENT;
2002 Delete = o->op_private & OPpTRANS_DELETE;
2003 squash = o->op_private & OPpTRANS_SQUASH;
2006 Zero(tbl, 256, short);
2007 for (i = 0; i < tlen; i++)
2009 for (i = 0, j = 0; i < 256; i++) {
2025 if (!rlen && !Delete) {
2028 o->op_private |= OPpTRANS_COUNTONLY;
2030 for (i = 0; i < 256; i++)
2032 for (i = 0, j = 0; i < tlen; i++,j++) {
2035 if (tbl[t[i]] == -1)
2041 if (tbl[t[i]] == -1)
2052 newPMOP(I32 type, I32 flags)
2057 Newz(1101, pmop, 1, PMOP);
2058 pmop->op_type = type;
2059 pmop->op_ppaddr = ppaddr[type];
2060 pmop->op_flags = flags;
2061 pmop->op_private = 0 | (flags >> 8);
2063 if (hints & HINT_LOCALE)
2064 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2066 /* link into pm list */
2067 if (type != OP_TRANS && curstash) {
2068 pmop->op_pmnext = HvPMROOT(curstash);
2069 HvPMROOT(curstash) = pmop;
2076 pmruntime(OP *o, OP *expr, OP *repl)
2081 if (o->op_type == OP_TRANS)
2082 return pmtrans(o, expr, repl);
2084 hints |= HINT_BLOCK_SCOPE;
2087 if (expr->op_type == OP_CONST) {
2089 SV *pat = ((SVOP*)expr)->op_sv;
2090 char *p = SvPV(pat, plen);
2091 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2092 sv_setpvn(pat, "\\s+", 3);
2093 p = SvPV(pat, plen);
2094 pm->op_pmflags |= PMf_SKIPWHITE;
2096 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2097 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2098 pm->op_pmflags |= PMf_WHITE;
2102 if (pm->op_pmflags & PMf_KEEP)
2103 expr = newUNOP(OP_REGCMAYBE,0,expr);
2105 Newz(1101, rcop, 1, LOGOP);
2106 rcop->op_type = OP_REGCOMP;
2107 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2108 rcop->op_first = scalar(expr);
2109 rcop->op_flags |= OPf_KIDS;
2110 rcop->op_private = 1;
2113 /* establish postfix order */
2114 if (pm->op_pmflags & PMf_KEEP) {
2116 rcop->op_next = expr;
2117 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2120 rcop->op_next = LINKLIST(expr);
2121 expr->op_next = (OP*)rcop;
2124 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2129 if (pm->op_pmflags & PMf_EVAL)
2132 else if (repl->op_type == OP_THREADSV
2133 && strchr("&`'123456789+",
2134 threadsv_names[repl->op_targ]))
2138 #endif /* USE_THREADS */
2139 else if (repl->op_type == OP_CONST)
2143 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2144 if (opargs[curop->op_type] & OA_DANGEROUS) {
2146 if (curop->op_type == OP_THREADSV
2147 && strchr("&`'123456789+", curop->op_private)) {
2151 if (curop->op_type == OP_GV) {
2152 GV *gv = ((GVOP*)curop)->op_gv;
2153 if (strchr("&`'123456789+", *GvENAME(gv)))
2156 #endif /* USE_THREADS */
2157 else if (curop->op_type == OP_RV2CV)
2159 else if (curop->op_type == OP_RV2SV ||
2160 curop->op_type == OP_RV2AV ||
2161 curop->op_type == OP_RV2HV ||
2162 curop->op_type == OP_RV2GV) {
2163 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2166 else if (curop->op_type == OP_PADSV ||
2167 curop->op_type == OP_PADAV ||
2168 curop->op_type == OP_PADHV ||
2169 curop->op_type == OP_PADANY) {
2178 if (curop == repl) {
2179 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2180 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2181 prepend_elem(o->op_type, scalar(repl), o);
2184 Newz(1101, rcop, 1, LOGOP);
2185 rcop->op_type = OP_SUBSTCONT;
2186 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2187 rcop->op_first = scalar(repl);
2188 rcop->op_flags |= OPf_KIDS;
2189 rcop->op_private = 1;
2192 /* establish postfix order */
2193 rcop->op_next = LINKLIST(repl);
2194 repl->op_next = (OP*)rcop;
2196 pm->op_pmreplroot = scalar((OP*)rcop);
2197 pm->op_pmreplstart = LINKLIST(rcop);
2206 newSVOP(I32 type, I32 flags, SV *sv)
2209 Newz(1101, svop, 1, SVOP);
2210 svop->op_type = type;
2211 svop->op_ppaddr = ppaddr[type];
2213 svop->op_next = (OP*)svop;
2214 svop->op_flags = flags;
2215 if (opargs[type] & OA_RETSCALAR)
2217 if (opargs[type] & OA_TARGET)
2218 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2219 return CHECKOP(type, svop);
2223 newGVOP(I32 type, I32 flags, GV *gv)
2227 Newz(1101, gvop, 1, GVOP);
2228 gvop->op_type = type;
2229 gvop->op_ppaddr = ppaddr[type];
2230 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2231 gvop->op_next = (OP*)gvop;
2232 gvop->op_flags = flags;
2233 if (opargs[type] & OA_RETSCALAR)
2235 if (opargs[type] & OA_TARGET)
2236 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2237 return CHECKOP(type, gvop);
2241 newPVOP(I32 type, I32 flags, char *pv)
2244 Newz(1101, pvop, 1, PVOP);
2245 pvop->op_type = type;
2246 pvop->op_ppaddr = ppaddr[type];
2248 pvop->op_next = (OP*)pvop;
2249 pvop->op_flags = flags;
2250 if (opargs[type] & OA_RETSCALAR)
2252 if (opargs[type] & OA_TARGET)
2253 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2254 return CHECKOP(type, pvop);
2263 save_hptr(&curstash);
2264 save_item(curstname);
2269 name = SvPV(sv, len);
2270 curstash = gv_stashpvn(name,len,TRUE);
2271 sv_setpvn(curstname, name, len);
2275 sv_setpv(curstname,"<none>");
2283 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2291 if (id->op_type != OP_CONST)
2292 croak("Module name must be constant");
2296 if(version != Nullop) {
2297 SV *vesv = ((SVOP*)version)->op_sv;
2299 if (arg == Nullop && !SvNIOK(vesv)) {
2306 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2307 croak("Version number must be constant number");
2309 /* Make copy of id so we don't free it twice */
2310 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2312 /* Fake up a method call to VERSION */
2313 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2314 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2315 append_elem(OP_LIST,
2316 prepend_elem(OP_LIST, pack, list(version)),
2317 newUNOP(OP_METHOD, 0, meth)));
2321 /* Fake up an import/unimport */
2322 if (arg && arg->op_type == OP_STUB)
2323 imop = arg; /* no import on explicit () */
2324 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2325 imop = Nullop; /* use 5.0; */
2328 /* Make copy of id so we don't free it twice */
2329 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2330 meth = newSVOP(OP_CONST, 0,
2332 ? newSVpv("import", 6)
2333 : newSVpv("unimport", 8)
2335 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2336 append_elem(OP_LIST,
2337 prepend_elem(OP_LIST, pack, list(arg)),
2338 newUNOP(OP_METHOD, 0, meth)));
2341 /* Fake up a require */
2342 rqop = newUNOP(OP_REQUIRE, 0, id);
2344 /* Fake up the BEGIN {}, which does its thing immediately. */
2346 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2348 append_elem(OP_LINESEQ,
2349 append_elem(OP_LINESEQ,
2350 newSTATEOP(0, Nullch, rqop),
2351 newSTATEOP(0, Nullch, veop)),
2352 newSTATEOP(0, Nullch, imop) ));
2359 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2361 return newBINOP(OP_LSLICE, flags,
2362 list(force_list(subscript)),
2363 list(force_list(listval)) );
2367 list_assignment(register OP *o)
2372 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2373 o = cUNOPo->op_first;
2375 if (o->op_type == OP_COND_EXPR) {
2376 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2377 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2382 yyerror("Assignment to both a list and a scalar");
2386 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2387 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2388 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2391 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2394 if (o->op_type == OP_RV2SV)
2401 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2406 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2407 return newLOGOP(optype, 0,
2408 mod(scalar(left), optype),
2409 newUNOP(OP_SASSIGN, 0, scalar(right)));
2412 return newBINOP(optype, OPf_STACKED,
2413 mod(scalar(left), optype), scalar(right));
2417 if (list_assignment(left)) {
2419 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2420 left = mod(left, OP_AASSIGN);
2428 o = newBINOP(OP_AASSIGN, flags,
2429 list(force_list(right)),
2430 list(force_list(left)) );
2431 o->op_private = 0 | (flags >> 8);
2432 if (!(left->op_private & OPpLVAL_INTRO)) {
2433 static int generation = 100;
2437 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2438 if (opargs[curop->op_type] & OA_DANGEROUS) {
2439 if (curop->op_type == OP_GV) {
2440 GV *gv = ((GVOP*)curop)->op_gv;
2441 if (gv == defgv || SvCUR(gv) == generation)
2443 SvCUR(gv) = generation;
2445 else if (curop->op_type == OP_PADSV ||
2446 curop->op_type == OP_PADAV ||
2447 curop->op_type == OP_PADHV ||
2448 curop->op_type == OP_PADANY) {
2449 SV **svp = AvARRAY(comppad_name);
2450 SV *sv = svp[curop->op_targ];
2451 if (SvCUR(sv) == generation)
2453 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2455 else if (curop->op_type == OP_RV2CV)
2457 else if (curop->op_type == OP_RV2SV ||
2458 curop->op_type == OP_RV2AV ||
2459 curop->op_type == OP_RV2HV ||
2460 curop->op_type == OP_RV2GV) {
2461 if (lastop->op_type != OP_GV) /* funny deref? */
2470 o->op_private = OPpASSIGN_COMMON;
2472 if (right && right->op_type == OP_SPLIT) {
2474 if ((tmpop = ((LISTOP*)right)->op_first) &&
2475 tmpop->op_type == OP_PUSHRE)
2477 PMOP *pm = (PMOP*)tmpop;
2478 if (left->op_type == OP_RV2AV &&
2479 !(left->op_private & OPpLVAL_INTRO) &&
2480 !(o->op_private & OPpASSIGN_COMMON) )
2482 tmpop = ((UNOP*)left)->op_first;
2483 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2484 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2485 pm->op_pmflags |= PMf_ONCE;
2486 tmpop = cUNOPo->op_first; /* to list (nulled) */
2487 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2488 tmpop->op_sibling = Nullop; /* don't free split */
2489 right->op_next = tmpop->op_next; /* fix starting loc */
2490 op_free(o); /* blow off assign */
2491 right->op_flags &= ~OPf_WANT;
2492 /* "I don't know and I don't care." */
2497 if (modcount < 10000 &&
2498 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2500 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2502 sv_setiv(sv, modcount+1);
2510 right = newOP(OP_UNDEF, 0);
2511 if (right->op_type == OP_READLINE) {
2512 right->op_flags |= OPf_STACKED;
2513 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2516 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2517 o = newBINOP(OP_SASSIGN, flags,
2518 scalar(right), mod(scalar(left), OP_SASSIGN) );
2530 newSTATEOP(I32 flags, char *label, OP *o)
2533 U32 seq = intro_my();
2536 Newz(1101, cop, 1, COP);
2537 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2538 cop->op_type = OP_DBSTATE;
2539 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2542 cop->op_type = OP_NEXTSTATE;
2543 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2545 cop->op_flags = flags;
2546 cop->op_private = 0 | (flags >> 8);
2548 cop->op_private |= NATIVE_HINTS;
2550 cop->op_next = (OP*)cop;
2553 cop->cop_label = label;
2554 hints |= HINT_BLOCK_SCOPE;
2557 cop->cop_arybase = curcop->cop_arybase;
2559 if (copline == NOLINE)
2560 cop->cop_line = curcop->cop_line;
2562 cop->cop_line = copline;
2565 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2566 cop->cop_stash = curstash;
2568 if (PERLDB_LINE && curstash != debstash) {
2569 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2570 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2571 (void)SvIOK_on(*svp);
2573 SvSTASH(*svp) = (HV*)cop;
2577 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2580 /* "Introduce" my variables to visible status. */
2588 if (! min_intro_pending)
2591 svp = AvARRAY(comppad_name);
2592 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2593 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2594 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2595 SvNVX(sv) = (double)cop_seqmax;
2598 min_intro_pending = 0;
2599 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2600 return cop_seqmax++;
2604 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2610 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2611 return newBINOP(type, flags, scalar(first), scalar(other));
2613 scalarboolean(first);
2614 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2615 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2616 if (type == OP_AND || type == OP_OR) {
2622 first = cUNOPo->op_first;
2624 first->op_next = o->op_next;
2625 cUNOPo->op_first = Nullop;
2629 if (first->op_type == OP_CONST) {
2630 if (dowarn && (first->op_private & OPpCONST_BARE))
2631 warn("Probable precedence problem on %s", op_desc[type]);
2632 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2641 else if (first->op_type == OP_WANTARRAY) {
2647 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2648 OP *k1 = ((UNOP*)first)->op_first;
2649 OP *k2 = k1->op_sibling;
2651 switch (first->op_type)
2654 if (k2 && k2->op_type == OP_READLINE
2655 && (k2->op_flags & OPf_STACKED)
2656 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2657 warnop = k2->op_type;
2661 if (k1->op_type == OP_READDIR
2662 || k1->op_type == OP_GLOB
2663 || k1->op_type == OP_EACH)
2664 warnop = k1->op_type;
2668 line_t oldline = curcop->cop_line;
2669 curcop->cop_line = copline;
2670 warn("Value of %s%s can be \"0\"; test with defined()",
2672 ((warnop == OP_READLINE || warnop == OP_GLOB)
2673 ? " construct" : "() operator"));
2674 curcop->cop_line = oldline;
2681 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2682 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2684 Newz(1101, logop, 1, LOGOP);
2686 logop->op_type = type;
2687 logop->op_ppaddr = ppaddr[type];
2688 logop->op_first = first;
2689 logop->op_flags = flags | OPf_KIDS;
2690 logop->op_other = LINKLIST(other);
2691 logop->op_private = 1 | (flags >> 8);
2693 /* establish postfix order */
2694 logop->op_next = LINKLIST(first);
2695 first->op_next = (OP*)logop;
2696 first->op_sibling = other;
2698 o = newUNOP(OP_NULL, 0, (OP*)logop);
2705 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2712 return newLOGOP(OP_AND, 0, first, trueop);
2714 return newLOGOP(OP_OR, 0, first, falseop);
2716 scalarboolean(first);
2717 if (first->op_type == OP_CONST) {
2718 if (SvTRUE(((SVOP*)first)->op_sv)) {
2729 else if (first->op_type == OP_WANTARRAY) {
2733 Newz(1101, condop, 1, CONDOP);
2735 condop->op_type = OP_COND_EXPR;
2736 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2737 condop->op_first = first;
2738 condop->op_flags = flags | OPf_KIDS;
2739 condop->op_true = LINKLIST(trueop);
2740 condop->op_false = LINKLIST(falseop);
2741 condop->op_private = 1 | (flags >> 8);
2743 /* establish postfix order */
2744 condop->op_next = LINKLIST(first);
2745 first->op_next = (OP*)condop;
2747 first->op_sibling = trueop;
2748 trueop->op_sibling = falseop;
2749 o = newUNOP(OP_NULL, 0, (OP*)condop);
2751 trueop->op_next = o;
2752 falseop->op_next = o;
2758 newRANGE(I32 flags, OP *left, OP *right)
2766 Newz(1101, condop, 1, CONDOP);
2768 condop->op_type = OP_RANGE;
2769 condop->op_ppaddr = ppaddr[OP_RANGE];
2770 condop->op_first = left;
2771 condop->op_flags = OPf_KIDS;
2772 condop->op_true = LINKLIST(left);
2773 condop->op_false = LINKLIST(right);
2774 condop->op_private = 1 | (flags >> 8);
2776 left->op_sibling = right;
2778 condop->op_next = (OP*)condop;
2779 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2780 flop = newUNOP(OP_FLOP, 0, flip);
2781 o = newUNOP(OP_NULL, 0, flop);
2784 left->op_next = flip;
2785 right->op_next = flop;
2787 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2788 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2789 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2790 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2792 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2793 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2796 if (!flip->op_private || !flop->op_private)
2797 linklist(o); /* blow off optimizer unless constant */
2803 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2808 int once = block && block->op_flags & OPf_SPECIAL &&
2809 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2812 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2813 return block; /* do {} while 0 does once */
2814 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2815 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2816 expr = newUNOP(OP_DEFINED, 0,
2817 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2821 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2822 o = newLOGOP(OP_AND, 0, expr, listop);
2824 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2826 if (once && o != listop)
2827 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2830 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2832 o->op_flags |= flags;
2834 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2839 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2848 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2849 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2850 expr = newUNOP(OP_DEFINED, 0,
2851 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2855 block = newOP(OP_NULL, 0);
2858 next = LINKLIST(cont);
2860 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2861 if ((line_t)whileline != NOLINE) {
2862 copline = whileline;
2863 cont = append_elem(OP_LINESEQ, cont,
2864 newSTATEOP(0, Nullch, Nullop));
2868 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2869 redo = LINKLIST(listop);
2872 o = newLOGOP(OP_AND, 0, expr, scalar(listop));
2873 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2874 op_free(expr); /* oops, it's a while (0) */
2876 return Nullop; /* (listop already freed by newLOGOP) */
2878 ((LISTOP*)listop)->op_last->op_next = condop =
2879 (o == listop ? redo : LINKLIST(o));
2887 Newz(1101,loop,1,LOOP);
2888 loop->op_type = OP_ENTERLOOP;
2889 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2890 loop->op_private = 0;
2891 loop->op_next = (OP*)loop;
2894 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2896 loop->op_redoop = redo;
2897 loop->op_lastop = o;
2900 loop->op_nextop = next;
2902 loop->op_nextop = o;
2904 o->op_flags |= flags;
2905 o->op_private |= (flags >> 8);
2910 #ifndef CAN_PROTOTYPE
2911 newFOROP(flags,label,forline,sv,expr,block,cont)
2920 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2921 #endif /* CAN_PROTOTYPE */
2929 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2930 sv->op_type = OP_RV2GV;
2931 sv->op_ppaddr = ppaddr[OP_RV2GV];
2933 else if (sv->op_type == OP_PADSV) { /* private variable */
2934 padoff = sv->op_targ;
2938 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
2939 padoff = sv->op_targ;
2940 iterflags |= OPf_SPECIAL;
2945 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2949 padoff = find_threadsv("_");
2950 iterflags |= OPf_SPECIAL;
2952 sv = newGVOP(OP_GV, 0, defgv);
2955 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2956 expr = scalar(ref(expr, OP_ITER));
2957 iterflags |= OPf_STACKED;
2959 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2960 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2962 assert(!loop->op_next);
2963 Renew(loop, 1, LOOP);
2964 loop->op_targ = padoff;
2965 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
2967 return newSTATEOP(0, label, wop);
2971 newLOOPEX(I32 type, OP *label)
2975 if (type != OP_GOTO || label->op_type == OP_CONST) {
2976 o = newPVOP(type, 0, savepv(
2977 label->op_type == OP_CONST
2978 ? SvPVx(((SVOP*)label)->op_sv, na)
2983 if (label->op_type == OP_ENTERSUB)
2984 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2985 o = newUNOP(type, OPf_STACKED, label);
2987 hints |= HINT_BLOCK_SCOPE;
2997 MUTEX_DESTROY(CvMUTEXP(cv));
2998 Safefree(CvMUTEXP(cv));
3001 #endif /* USE_THREADS */
3003 if (!CvXSUB(cv) && CvROOT(cv)) {
3005 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3006 croak("Can't undef active subroutine");
3009 croak("Can't undef active subroutine");
3010 #endif /* USE_THREADS */
3017 op_free(CvROOT(cv));
3018 CvROOT(cv) = Nullop;
3021 SvPOK_off((SV*)cv); /* forget prototype */
3023 SvREFCNT_dec(CvGV(cv));
3025 SvREFCNT_dec(CvOUTSIDE(cv));
3026 CvOUTSIDE(cv) = Nullcv;
3027 if (CvPADLIST(cv)) {
3028 /* may be during global destruction */
3029 if (SvREFCNT(CvPADLIST(cv))) {
3030 I32 i = AvFILLp(CvPADLIST(cv));
3032 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3033 SV* sv = svp ? *svp : Nullsv;
3036 if (sv == (SV*)comppad_name)
3037 comppad_name = Nullav;
3038 else if (sv == (SV*)comppad) {
3040 curpad = Null(SV**);
3044 SvREFCNT_dec((SV*)CvPADLIST(cv));
3046 CvPADLIST(cv) = Nullav;
3050 #ifdef DEBUG_CLOSURES
3055 CV *outside = CvOUTSIDE(cv);
3056 AV* padlist = CvPADLIST(cv);
3063 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3065 (CvANON(cv) ? "ANON"
3066 : (cv == main_cv) ? "MAIN"
3067 : CvUNIQUE(outside) ? "UNIQUE"
3068 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3071 : CvANON(outside) ? "ANON"
3072 : (outside == main_cv) ? "MAIN"
3073 : CvUNIQUE(outside) ? "UNIQUE"
3074 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3079 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3080 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3081 pname = AvARRAY(pad_name);
3082 ppad = AvARRAY(pad);
3084 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3085 if (SvPOK(pname[ix]))
3086 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3088 SvFAKE(pname[ix]) ? "FAKE " : "",
3090 (long)I_32(SvNVX(pname[ix])),
3091 (long)SvIVX(pname[ix]));
3094 #endif /* DEBUG_CLOSURES */
3097 cv_clone2(CV *proto, CV *outside)
3102 AV* protopadlist = CvPADLIST(proto);
3103 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3104 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3105 SV** pname = AvARRAY(protopad_name);
3106 SV** ppad = AvARRAY(protopad);
3107 I32 fname = AvFILLp(protopad_name);
3108 I32 fpad = AvFILLp(protopad);
3112 assert(!CvUNIQUE(proto));
3117 SAVESPTR(comppad_name);
3120 cv = compcv = (CV*)NEWSV(1104,0);
3121 sv_upgrade((SV *)cv, SvTYPE(proto));
3127 New(666, CvMUTEXP(cv), 1, perl_mutex);
3128 MUTEX_INIT(CvMUTEXP(cv));
3130 #endif /* USE_THREADS */
3131 CvFILEGV(cv) = CvFILEGV(proto);
3132 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3133 CvSTASH(cv) = CvSTASH(proto);
3134 CvROOT(cv) = CvROOT(proto);
3135 CvSTART(cv) = CvSTART(proto);
3137 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3140 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3142 comppad_name = newAV();
3143 for (ix = fname; ix >= 0; ix--)
3144 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3148 comppadlist = newAV();
3149 AvREAL_off(comppadlist);
3150 av_store(comppadlist, 0, (SV*)comppad_name);
3151 av_store(comppadlist, 1, (SV*)comppad);
3152 CvPADLIST(cv) = comppadlist;
3153 av_fill(comppad, AvFILLp(protopad));
3154 curpad = AvARRAY(comppad);
3156 av = newAV(); /* will be @_ */
3158 av_store(comppad, 0, (SV*)av);
3159 AvFLAGS(av) = AVf_REIFY;
3161 for (ix = fpad; ix > 0; ix--) {
3162 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3163 if (namesv && namesv != &sv_undef) {
3164 char *name = SvPVX(namesv); /* XXX */
3165 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3166 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3167 CvOUTSIDE(cv), cxstack_ix);
3169 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3171 croak("panic: cv_clone: %s", name);
3173 else { /* our own lexical */
3176 /* anon code -- we'll come back for it */
3177 sv = SvREFCNT_inc(ppad[ix]);
3179 else if (*name == '@')
3181 else if (*name == '%')
3191 SV* sv = NEWSV(0,0);
3197 /* Now that vars are all in place, clone nested closures. */
3199 for (ix = fpad; ix > 0; ix--) {
3200 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3202 && namesv != &sv_undef
3203 && !(SvFLAGS(namesv) & SVf_FAKE)
3204 && *SvPVX(namesv) == '&'
3205 && CvCLONE(ppad[ix]))
3207 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3208 SvREFCNT_dec(ppad[ix]);
3211 curpad[ix] = (SV*)kid;
3215 #ifdef DEBUG_CLOSURES
3216 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3218 PerlIO_printf(Perl_debug_log, " from:\n");
3220 PerlIO_printf(Perl_debug_log, " to:\n");
3231 return cv_clone2(proto, CvOUTSIDE(proto));
3235 cv_ckproto(CV *cv, GV *gv, char *p)
3237 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3238 SV* msg = sv_newmortal();
3242 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3243 sv_setpv(msg, "Prototype mismatch:");
3245 sv_catpvf(msg, " sub %_", name);
3247 sv_catpvf(msg, " (%s)", SvPVX(cv));
3248 sv_catpv(msg, " vs ");
3250 sv_catpvf(msg, "(%s)", p);
3252 sv_catpv(msg, "none");
3263 if (!cv || !SvPOK(cv) || SvCUR(cv))
3267 for (o = CvSTART(cv); o; o = o->op_next) {
3268 OPCODE type = o->op_type;
3270 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3272 if (type == OP_LEAVESUB || type == OP_RETURN)
3276 if (type == OP_CONST)
3278 else if (type == OP_PADSV) {
3279 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3280 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3281 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3293 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3296 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3297 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3298 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3307 if (!name || GvCVGEN(gv))
3309 else if (cv = GvCV(gv)) {
3310 cv_ckproto(cv, gv, ps);
3311 /* already defined (or promised)? */
3312 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3315 /* just a "sub foo;" when &foo is already defined */
3319 /* ahem, death to those who redefine active sort subs */
3320 if (curstack == sortstack && sortcop == CvSTART(cv))
3321 croak("Can't redefine active sort subroutine %s", name);
3322 const_sv = cv_const_sv(cv);
3323 if (const_sv || dowarn) {
3324 line_t oldline = curcop->cop_line;
3325 curcop->cop_line = copline;
3326 warn(const_sv ? "Constant subroutine %s redefined"
3327 : "Subroutine %s redefined", name);
3328 curcop->cop_line = oldline;
3334 if (cv) { /* must reuse cv if autoloaded */
3336 CvFLAGS(cv) = CvFLAGS(compcv);
3337 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3338 CvOUTSIDE(compcv) = 0;
3339 CvPADLIST(cv) = CvPADLIST(compcv);
3340 CvPADLIST(compcv) = 0;
3341 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3342 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3343 SvREFCNT_dec(compcv);
3353 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3354 CvFILEGV(cv) = curcop->cop_filegv;
3355 CvSTASH(cv) = curstash;
3358 New(666, CvMUTEXP(cv), 1, perl_mutex);
3359 MUTEX_INIT(CvMUTEXP(cv));
3360 #endif /* USE_THREADS */
3363 sv_setpv((SV*)cv, ps);
3369 char *s = strrchr(name, ':');
3371 if (strEQ(s, "BEGIN")) {
3373 "BEGIN not safe after errors--compilation aborted";
3377 /* force display of errors found but not reported */
3378 sv_catpv(ERRSV, not_safe);
3379 croak("%s", SvPVx(ERRSV, na));
3390 if (AvFILLp(comppad_name) < AvFILLp(comppad))
3391 av_store(comppad_name, AvFILLp(comppad), Nullsv);
3394 SV **namep = AvARRAY(comppad_name);
3395 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3398 if (SvIMMORTAL(curpad[ix]))
3401 * The only things that a clonable function needs in its
3402 * pad are references to outer lexicals and anonymous subs.
3403 * The rest are created anew during cloning.
3405 if (!((namesv = namep[ix]) != Nullsv &&
3406 namesv != &sv_undef &&
3408 *SvPVX(namesv) == '&')))
3410 SvREFCNT_dec(curpad[ix]);
3411 curpad[ix] = Nullsv;
3416 AV *av = newAV(); /* Will be @_ */
3418 av_store(comppad, 0, (SV*)av);
3419 AvFLAGS(av) = AVf_REIFY;
3421 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3422 if (SvIMMORTAL(curpad[ix]))
3424 if (!SvPADMY(curpad[ix]))
3425 SvPADTMP_on(curpad[ix]);
3429 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3430 CvSTART(cv) = LINKLIST(CvROOT(cv));
3431 CvROOT(cv)->op_next = 0;
3437 if (PERLDB_SUBLINE && curstash != debstash) {
3438 SV *sv = NEWSV(0,0);
3439 SV *tmpstr = sv_newmortal();
3440 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3444 sv_setpvf(sv, "%_:%ld-%ld",
3445 GvSV(curcop->cop_filegv),
3446 (long)subline, (long)curcop->cop_line);
3447 gv_efullname3(tmpstr, gv, Nullch);
3448 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3449 hv = GvHVn(db_postponed);
3450 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3451 && (cv = GvCV(db_postponed))) {
3456 perl_call_sv((SV*)cv, G_DISCARD);
3460 if ((s = strrchr(name,':')))
3464 if (strEQ(s, "BEGIN")) {
3465 I32 oldscope = scopestack_ix;
3467 SAVESPTR(compiling.cop_filegv);
3468 SAVEI16(compiling.cop_line);
3475 DEBUG_x( dump_sub(gv) );
3476 av_push(beginav, (SV *)cv);
3478 call_list(oldscope, beginav);
3480 curcop = &compiling;
3483 else if (strEQ(s, "END") && !error_count) {
3486 av_unshift(endav, 1);
3487 av_store(endav, 0, (SV *)cv);
3490 else if (strEQ(s, "INIT") && !error_count) {
3493 av_push(initav, SvREFCNT_inc(cv));
3504 newXS(char *name, void (*subaddr) (CV *), char *filename)
3507 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3510 if (cv = (name ? GvCV(gv) : Nullcv)) {
3512 /* just a cached method */
3516 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3517 /* already defined (or promised) */
3519 line_t oldline = curcop->cop_line;
3520 curcop->cop_line = copline;
3521 warn("Subroutine %s redefined",name);
3522 curcop->cop_line = oldline;
3529 if (cv) /* must reuse cv if autoloaded */
3532 cv = (CV*)NEWSV(1105,0);
3533 sv_upgrade((SV *)cv, SVt_PVCV);
3540 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3542 New(666, CvMUTEXP(cv), 1, perl_mutex);
3543 MUTEX_INIT(CvMUTEXP(cv));
3545 #endif /* USE_THREADS */
3546 CvFILEGV(cv) = gv_fetchfile(filename);
3547 CvXSUB(cv) = subaddr;
3550 char *s = strrchr(name,':');
3555 if (strEQ(s, "BEGIN")) {
3558 av_push(beginav, (SV *)cv);
3561 else if (strEQ(s, "END")) {
3564 av_unshift(endav, 1);
3565 av_store(endav, 0, (SV *)cv);
3568 else if (strEQ(s, "INIT")) {
3571 av_push(initav, (SV *)cv);
3581 newFORM(I32 floor, OP *o, OP *block)
3590 name = SvPVx(cSVOPo->op_sv, na);
3593 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3595 if (cv = GvFORM(gv)) {
3597 line_t oldline = curcop->cop_line;
3599 curcop->cop_line = copline;
3600 warn("Format %s redefined",name);
3601 curcop->cop_line = oldline;
3607 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3608 CvFILEGV(cv) = curcop->cop_filegv;
3610 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3611 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3612 SvPADTMP_on(curpad[ix]);
3615 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3616 CvSTART(cv) = LINKLIST(CvROOT(cv));
3617 CvROOT(cv)->op_next = 0;
3627 return newUNOP(OP_REFGEN, 0,
3628 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3634 return newUNOP(OP_REFGEN, 0,
3635 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3639 newANONSUB(I32 floor, OP *proto, OP *block)
3641 return newUNOP(OP_REFGEN, 0,
3642 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3648 switch (o->op_type) {
3650 o->op_type = OP_PADAV;
3651 o->op_ppaddr = ppaddr[OP_PADAV];
3652 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3655 o->op_type = OP_RV2AV;
3656 o->op_ppaddr = ppaddr[OP_RV2AV];
3661 warn("oops: oopsAV");
3670 switch (o->op_type) {
3673 o->op_type = OP_PADHV;
3674 o->op_ppaddr = ppaddr[OP_PADHV];
3675 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3679 o->op_type = OP_RV2HV;
3680 o->op_ppaddr = ppaddr[OP_RV2HV];
3685 warn("oops: oopsHV");
3694 if (o->op_type == OP_PADANY) {
3695 o->op_type = OP_PADAV;
3696 o->op_ppaddr = ppaddr[OP_PADAV];
3699 return newUNOP(OP_RV2AV, 0, scalar(o));
3703 newGVREF(I32 type, OP *o)
3705 if (type == OP_MAPSTART)
3706 return newUNOP(OP_NULL, 0, o);
3707 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3713 if (o->op_type == OP_PADANY) {
3714 o->op_type = OP_PADHV;
3715 o->op_ppaddr = ppaddr[OP_PADHV];
3718 return newUNOP(OP_RV2HV, 0, scalar(o));
3724 croak("NOT IMPL LINE %d",__LINE__);
3730 newCVREF(I32 flags, OP *o)
3732 return newUNOP(OP_RV2CV, flags, scalar(o));
3738 if (o->op_type == OP_PADANY) {
3739 o->op_type = OP_PADSV;
3740 o->op_ppaddr = ppaddr[OP_PADSV];
3743 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3744 o->op_flags |= OPpDONE_SVREF;
3747 return newUNOP(OP_RV2SV, 0, scalar(o));
3750 /* Check routines. */
3758 name = NEWSV(1106,0);
3759 sv_upgrade(name, SVt_PVNV);
3760 sv_setpvn(name, "&", 1);
3763 ix = pad_alloc(o->op_type, SVs_PADMY);
3764 av_store(comppad_name, ix, name);
3765 av_store(comppad, ix, cSVOPo->op_sv);
3766 SvPADMY_on(cSVOPo->op_sv);
3767 cSVOPo->op_sv = Nullsv;
3768 cSVOPo->op_targ = ix;
3775 o->op_private = hints;
3782 if (cUNOPo->op_first->op_type == OP_CONCAT)
3783 o->op_flags |= OPf_STACKED;
3790 if (o->op_flags & OPf_KIDS) {
3793 OPCODE type = o->op_type;
3794 o = modkids(ck_fun(o), type);
3795 kid = cUNOPo->op_first;
3796 newop = kUNOP->op_first->op_sibling;
3798 (newop->op_sibling ||
3799 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3800 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3801 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3805 op_free(kUNOP->op_first);
3806 kUNOP->op_first = newop;
3808 o->op_ppaddr = ppaddr[++o->op_type];
3817 if (o->op_flags & OPf_KIDS) {
3818 OP *kid = cUNOPo->op_first;
3819 if (kid->op_type == OP_HSLICE)
3820 o->op_private |= OPpSLICE;
3821 else if (kid->op_type != OP_HELEM)
3822 croak("%s argument is not a HASH element or slice",
3823 op_desc[o->op_type]);
3832 I32 type = o->op_type;
3834 if (o->op_flags & OPf_KIDS) {
3835 if (cLISTOPo->op_first->op_type == OP_STUB) {
3837 o = newUNOP(type, OPf_SPECIAL,
3838 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3848 hints |= HINT_BLOCK_SCOPE;
3849 if (o->op_flags & OPf_KIDS) {
3850 SVOP *kid = (SVOP*)cUNOPo->op_first;
3853 o->op_flags &= ~OPf_KIDS;
3856 else if (kid->op_type == OP_LINESEQ) {
3859 kid->op_next = o->op_next;
3860 cUNOPo->op_first = 0;
3863 Newz(1101, enter, 1, LOGOP);
3864 enter->op_type = OP_ENTERTRY;
3865 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3866 enter->op_private = 0;
3868 /* establish postfix order */
3869 enter->op_next = (OP*)enter;
3871 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3872 o->op_type = OP_LEAVETRY;
3873 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3874 enter->op_other = o;
3882 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
3884 o->op_targ = (PADOFFSET)hints;
3892 if (o->op_flags & OPf_STACKED) {
3894 kid = cUNOPo->op_first->op_sibling;
3895 if (kid->op_type == OP_RV2GV)
3907 if (o->op_flags & OPf_KIDS) {
3908 OP *kid = cUNOPo->op_first;
3909 if (kid->op_type != OP_HELEM)
3910 croak("%s argument is not a HASH element", op_desc[o->op_type]);
3917 ck_gvconst(register OP *o)
3919 o = fold_constants(o);
3920 if (o->op_type == OP_CONST)
3926 ck_rvconst(register OP *o)
3929 SVOP *kid = (SVOP*)cUNOPo->op_first;
3931 o->op_private |= (hints & HINT_STRICT_REFS);
3932 if (kid->op_type == OP_CONST) {
3937 name = SvPV(kid->op_sv, na);
3938 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3939 char *badthing = Nullch;
3940 switch (o->op_type) {
3942 badthing = "a SCALAR";
3945 badthing = "an ARRAY";
3948 badthing = "a HASH";
3953 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3956 kid->op_type = OP_GV;
3957 iscv = (o->op_type == OP_RV2CV) * 2;
3958 for (gv = 0; !gv; iscv++) {
3960 * This is a little tricky. We only want to add the symbol if we
3961 * didn't add it in the lexer. Otherwise we get duplicate strict
3962 * warnings. But if we didn't add it in the lexer, we must at
3963 * least pretend like we wanted to add it even if it existed before,
3964 * or we get possible typo warnings. OPpCONST_ENTERED says
3965 * whether the lexer already added THIS instance of this symbol.
3967 gv = gv_fetchpv(name,
3968 iscv | !(kid->op_private & OPpCONST_ENTERED),
3971 : o->op_type == OP_RV2SV
3973 : o->op_type == OP_RV2AV
3975 : o->op_type == OP_RV2HV
3979 SvREFCNT_dec(kid->op_sv);
3980 kid->op_sv = SvREFCNT_inc(gv);
3989 I32 type = o->op_type;
3991 if (o->op_flags & OPf_REF)
3994 if (o->op_flags & OPf_KIDS) {
3995 SVOP *kid = (SVOP*)cUNOPo->op_first;
3997 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3998 OP *newop = newGVOP(type, OPf_REF,
3999 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4006 if (type == OP_FTTTY)
4007 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4010 return newUNOP(type, 0, newDEFSVOP());
4023 int type = o->op_type;
4024 register I32 oa = opargs[type] >> OASHIFT;
4026 if (o->op_flags & OPf_STACKED) {
4027 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4030 return no_fh_allowed(o);
4033 if (o->op_flags & OPf_KIDS) {
4034 tokid = &cLISTOPo->op_first;
4035 kid = cLISTOPo->op_first;
4036 if (kid->op_type == OP_PUSHMARK ||
4037 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4039 tokid = &kid->op_sibling;
4040 kid = kid->op_sibling;
4042 if (!kid && opargs[type] & OA_DEFGV)
4043 *tokid = kid = newDEFSVOP();
4047 sibl = kid->op_sibling;
4061 if (kid->op_type == OP_CONST &&
4062 (kid->op_private & OPpCONST_BARE)) {
4063 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4064 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4065 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4067 warn("Array @%s missing the @ in argument %ld of %s()",
4068 name, (long)numargs, op_desc[type]);
4071 kid->op_sibling = sibl;
4074 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4075 bad_type(numargs, "array", op_desc[o->op_type], kid);
4079 if (kid->op_type == OP_CONST &&
4080 (kid->op_private & OPpCONST_BARE)) {
4081 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4082 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4083 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4085 warn("Hash %%%s missing the %% in argument %ld of %s()",
4086 name, (long)numargs, op_desc[type]);
4089 kid->op_sibling = sibl;
4092 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4093 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4098 OP *newop = newUNOP(OP_NULL, 0, kid);
4099 kid->op_sibling = 0;
4101 newop->op_next = newop;
4103 kid->op_sibling = sibl;
4108 if (kid->op_type != OP_GV) {
4109 if (kid->op_type == OP_CONST &&
4110 (kid->op_private & OPpCONST_BARE)) {
4111 OP *newop = newGVOP(OP_GV, 0,
4112 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4118 kid->op_sibling = 0;
4119 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4121 kid->op_sibling = sibl;
4127 mod(scalar(kid), type);
4131 tokid = &kid->op_sibling;
4132 kid = kid->op_sibling;
4134 o->op_private |= numargs;
4136 return too_many_arguments(o,op_desc[o->op_type]);
4139 else if (opargs[type] & OA_DEFGV) {
4141 return newUNOP(type, 0, newDEFSVOP());
4145 while (oa & OA_OPTIONAL)
4147 if (oa && oa != OA_LIST)
4148 return too_few_arguments(o,op_desc[o->op_type]);
4158 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4159 append_elem(OP_GLOB, o, newDEFSVOP());
4161 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4162 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4164 if (gv && GvIMPORTED_CV(gv)) {
4165 static int glob_index;
4167 append_elem(OP_GLOB, o,
4168 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4169 o->op_type = OP_LIST;
4170 o->op_ppaddr = ppaddr[OP_LIST];
4171 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4172 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4173 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4174 append_elem(OP_LIST, o,
4175 scalar(newUNOP(OP_RV2CV, 0,
4176 newGVOP(OP_GV, 0, gv)))));
4177 o = newUNOP(OP_NULL, 0, ck_subr(o));
4178 o->op_targ = OP_GLOB; /* hint at what it used to be */
4181 gv = newGVgen("main");
4183 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4193 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4195 o->op_ppaddr = ppaddr[OP_GREPSTART];
4196 Newz(1101, gwop, 1, LOGOP);
4198 if (o->op_flags & OPf_STACKED) {
4201 kid = cLISTOPo->op_first->op_sibling;
4202 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4205 kid->op_next = (OP*)gwop;
4206 o->op_flags &= ~OPf_STACKED;
4208 kid = cLISTOPo->op_first->op_sibling;
4209 if (type == OP_MAPWHILE)
4216 kid = cLISTOPo->op_first->op_sibling;
4217 if (kid->op_type != OP_NULL)
4218 croak("panic: ck_grep");
4219 kid = kUNOP->op_first;
4221 gwop->op_type = type;
4222 gwop->op_ppaddr = ppaddr[type];
4223 gwop->op_first = listkids(o);
4224 gwop->op_flags |= OPf_KIDS;
4225 gwop->op_private = 1;
4226 gwop->op_other = LINKLIST(kid);
4227 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4228 kid->op_next = (OP*)gwop;
4230 kid = cLISTOPo->op_first->op_sibling;
4231 if (!kid || !kid->op_sibling)
4232 return too_few_arguments(o,op_desc[o->op_type]);
4233 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4234 mod(kid, OP_GREPSTART);
4242 if (o->op_flags & OPf_KIDS) {
4243 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4244 if (kid && kid->op_type == OP_CONST)
4245 fbm_compile(((SVOP*)kid)->op_sv);
4251 ck_lengthconst(OP *o)
4253 /* XXX length optimization goes here */
4260 OPCODE type = o->op_type;
4261 return modkids(ck_fun(o), type);
4267 OPCODE type = o->op_type;
4268 return refkids(ck_fun(o), type);
4276 kid = cLISTOPo->op_first;
4279 kid = cLISTOPo->op_first;
4281 if (kid->op_type == OP_PUSHMARK)
4282 kid = kid->op_sibling;
4283 if (kid && o->op_flags & OPf_STACKED)
4284 kid = kid->op_sibling;
4285 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4286 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4287 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4288 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4289 cLISTOPo->op_first->op_sibling = kid;
4290 cLISTOPo->op_last = kid;
4291 kid = kid->op_sibling;
4296 append_elem(o->op_type, o, newDEFSVOP());
4302 if (hints & HINT_LOCALE)
4303 o->op_private |= OPpLOCALE;
4310 ck_fun_locale(OP *o)
4316 if (hints & HINT_LOCALE)
4317 o->op_private |= OPpLOCALE;
4328 if (hints & HINT_LOCALE)
4329 o->op_private |= OPpLOCALE;
4338 o->op_private |= OPpRUNTIME;
4351 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4352 o->op_private |= OPpREPEAT_DOLIST;
4353 cBINOPo->op_first = force_list(cBINOPo->op_first);
4363 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4364 SVOP *kid = (SVOP*)cUNOPo->op_first;
4366 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4368 for (s = SvPVX(kid->op_sv); *s; s++) {
4369 if (*s == ':' && s[1] == ':') {
4371 Move(s+2, s+1, strlen(s+2)+1, char);
4372 --SvCUR(kid->op_sv);
4375 sv_catpvn(kid->op_sv, ".pm", 3);
4384 croak("NOT IMPL LINE %d",__LINE__);
4393 if (o->op_flags & OPf_KIDS) {
4394 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4395 if (kid && kid->op_sibling) {
4396 o->op_type = OP_SSELECT;
4397 o->op_ppaddr = ppaddr[OP_SSELECT];
4399 return fold_constants(o);
4403 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4404 if (kid && kid->op_type == OP_RV2GV)
4405 kid->op_private &= ~HINT_STRICT_REFS;
4412 I32 type = o->op_type;
4414 if (!(o->op_flags & OPf_KIDS)) {
4419 if (!CvUNIQUE(compcv)) {
4420 argop = newOP(OP_PADAV, OPf_REF);
4421 argop->op_targ = 0; /* curpad[0] is @_ */
4424 argop = newUNOP(OP_RV2AV, 0,
4425 scalar(newGVOP(OP_GV, 0,
4426 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4429 argop = newUNOP(OP_RV2AV, 0,
4430 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(compcv) ?
4431 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4432 #endif /* USE_THREADS */
4433 return newUNOP(type, 0, scalar(argop));
4435 return scalar(modkids(ck_fun(o), type));
4443 if (hints & HINT_LOCALE)
4444 o->op_private |= OPpLOCALE;
4447 if (o->op_flags & OPf_STACKED) {
4448 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4450 kid = kUNOP->op_first; /* get past rv2gv */
4452 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4454 if (kid->op_type == OP_SCOPE) {
4458 else if (kid->op_type == OP_LEAVE) {
4459 if (o->op_type == OP_SORT) {
4460 null(kid); /* wipe out leave */
4463 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4464 if (k->op_next == kid)
4469 kid->op_next = 0; /* just disconnect the leave */
4470 k = kLISTOP->op_first;
4474 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4475 null(kid); /* wipe out rv2gv */
4476 if (o->op_type == OP_SORT)
4480 o->op_flags |= OPf_SPECIAL;
4492 if (o->op_flags & OPf_STACKED)
4493 return no_fh_allowed(o);
4495 kid = cLISTOPo->op_first;
4496 if (kid->op_type != OP_NULL)
4497 croak("panic: ck_split");
4498 kid = kid->op_sibling;
4499 op_free(cLISTOPo->op_first);
4500 cLISTOPo->op_first = kid;
4502 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4503 cLISTOPo->op_last = kid; /* There was only one element previously */
4506 if (kid->op_type != OP_MATCH) {
4507 OP *sibl = kid->op_sibling;
4508 kid->op_sibling = 0;
4509 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4510 if (cLISTOPo->op_first == cLISTOPo->op_last)
4511 cLISTOPo->op_last = kid;
4512 cLISTOPo->op_first = kid;
4513 kid->op_sibling = sibl;
4516 kid->op_type = OP_PUSHRE;
4517 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4520 if (!kid->op_sibling)
4521 append_elem(OP_SPLIT, o, newDEFSVOP());
4523 kid = kid->op_sibling;
4526 if (!kid->op_sibling)
4527 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4529 kid = kid->op_sibling;
4532 if (kid->op_sibling)
4533 return too_many_arguments(o,op_desc[o->op_type]);
4542 OP *prev = ((cUNOPo->op_first->op_sibling)
4543 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4544 OP *o2 = prev->op_sibling;
4552 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4553 if (cvop->op_type == OP_RV2CV) {
4555 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4556 null(cvop); /* disable rv2cv */
4557 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4558 if (tmpop->op_type == OP_GV) {
4559 cv = GvCVu(tmpop->op_sv);
4560 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4561 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4562 proto = SvPV((SV*)cv, na);
4566 o->op_private |= (hints & HINT_STRICT_REFS);
4567 if (PERLDB_SUB && curstash != debstash)
4568 o->op_private |= OPpENTERSUB_DB;
4569 while (o2 != cvop) {
4573 return too_many_arguments(o, gv_ename(namegv));
4591 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4592 bad_type(arg, "block", gv_ename(namegv), o2);
4597 if (o2->op_type == OP_RV2GV)
4601 o2 = newUNOP(OP_RV2GV, 0, kid);
4602 o2->op_sibling = kid->op_sibling;
4603 kid->op_sibling = 0;
4604 prev->op_sibling = o;
4612 if (o2->op_type != OP_RV2GV)
4613 bad_type(arg, "symbol", gv_ename(namegv), o2);
4616 if (o2->op_type != OP_RV2CV)
4617 bad_type(arg, "sub", gv_ename(namegv), o2);
4620 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4621 bad_type(arg, "scalar", gv_ename(namegv), o2);
4624 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4625 bad_type(arg, "array", gv_ename(namegv), o2);
4628 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4629 bad_type(arg, "hash", gv_ename(namegv), o2);
4633 o2 = newUNOP(OP_REFGEN, 0, kid);
4634 o2->op_sibling = kid->op_sibling;
4635 kid->op_sibling = 0;
4636 prev->op_sibling = o2;
4647 croak("Malformed prototype for %s: %s",
4648 gv_ename(namegv), SvPV((SV*)cv, na));
4653 mod(o2, OP_ENTERSUB);
4655 o2 = o2->op_sibling;
4657 if (proto && !optional &&
4658 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4659 return too_few_arguments(o, gv_ename(namegv));
4666 SvREADONLY_on(cSVOPo->op_sv);
4673 if (o->op_flags & OPf_KIDS) {
4674 SVOP *kid = (SVOP*)cUNOPo->op_first;
4676 if (kid->op_type == OP_NULL)
4677 kid = (SVOP*)kid->op_sibling;
4679 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4680 o->op_flags |= OPf_SPECIAL;
4685 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4688 peep(register OP *o)
4691 register OP* oldop = 0;
4692 if (!o || o->op_seq)
4697 for (; o; o = o->op_next) {
4703 switch (o->op_type) {
4706 curcop = ((COP*)o); /* for warnings */
4707 o->op_seq = op_seqmax++;
4718 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
4720 o->op_seq = op_seqmax++;
4723 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4724 o->op_seq = op_seqmax++;
4725 break; /* Scalar stub must produce undef. List stub is noop */
4729 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4730 curcop = ((COP*)op);
4736 if (oldop && o->op_next) {
4737 oldop->op_next = o->op_next;
4740 o->op_seq = op_seqmax++;
4744 if (o->op_next->op_type == OP_RV2SV) {
4745 if (!(o->op_next->op_private & OPpDEREF)) {
4747 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4748 o->op_next = o->op_next->op_next;
4749 o->op_type = OP_GVSV;
4750 o->op_ppaddr = ppaddr[OP_GVSV];
4753 else if (o->op_next->op_type == OP_RV2AV) {
4754 OP* pop = o->op_next->op_next;
4756 if (pop->op_type == OP_CONST &&
4757 (op = pop->op_next) &&
4758 pop->op_next->op_type == OP_AELEM &&
4759 !(pop->op_next->op_private &
4760 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4761 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4765 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4769 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4770 o->op_next = pop->op_next->op_next;
4771 o->op_type = OP_AELEMFAST;
4772 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4773 o->op_private = (U8)i;
4774 GvAVn(((GVOP*)o)->op_gv);
4777 o->op_seq = op_seqmax++;
4781 if (o->op_next->op_type == OP_RV2AV
4782 && (o->op_next->op_flags && OPf_REF))
4785 o->op_next = o->op_next->op_next;
4790 if (o->op_next->op_type == OP_RV2HV
4791 && (o->op_next->op_flags && OPf_REF))
4794 o->op_next = o->op_next->op_next;
4802 o->op_seq = op_seqmax++;
4803 peep(cLOGOP->op_other);
4807 o->op_seq = op_seqmax++;
4808 peep(cCONDOP->op_true);
4809 peep(cCONDOP->op_false);
4813 o->op_seq = op_seqmax++;
4814 peep(cLOOP->op_redoop);
4815 peep(cLOOP->op_nextop);
4816 peep(cLOOP->op_lastop);
4821 o->op_seq = op_seqmax++;
4822 peep(cPMOP->op_pmreplstart);
4826 o->op_seq = op_seqmax++;
4827 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4828 if (o->op_next->op_sibling &&
4829 o->op_next->op_sibling->op_type != OP_DIE) {
4830 line_t oldline = curcop->cop_line;
4832 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4833 warn("Statement unlikely to be reached");
4834 warn("(Maybe you meant system() when you said exec()?)\n");
4835 curcop->cop_line = oldline;
4849 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4850 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4852 rop = (UNOP*)((BINOP*)o)->op_first;
4853 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4855 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4856 if (!SvOBJECT(lexname))
4858 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4859 if (!fields || !GvHV(*fields))
4861 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4862 key = SvPV(*svp, keylen);
4863 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4865 croak("No such field \"%s\" in variable %s of type %s",
4866 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4868 ind = SvIV(*indsvp);
4870 croak("Bad index while coercing array into hash");
4871 rop->op_type = OP_RV2AV;
4872 rop->op_ppaddr = ppaddr[OP_RV2AV];
4873 o->op_type = OP_AELEM;
4874 o->op_ppaddr = ppaddr[OP_AELEM];
4876 *svp = newSViv(ind);
4881 o->op_seq = op_seqmax++;