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 0x%lx alloc %ld for %s\n",
397 (unsigned long) curpad,
398 (long) retval, op_name[optype]));
399 #endif /* USE_THREADS */
400 return (PADOFFSET)retval;
404 #ifndef CAN_PROTOTYPE
409 #endif /* CAN_PROTOTYPE */
413 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
414 (unsigned long) thr, (unsigned long) curpad, po));
417 croak("panic: pad_sv po");
418 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
419 (unsigned long) curpad, po));
420 #endif /* USE_THREADS */
421 return curpad[po]; /* eventually we'll turn this into a macro */
425 #ifndef CAN_PROTOTYPE
429 pad_free(PADOFFSET po)
430 #endif /* CAN_PROTOTYPE */
435 if (AvARRAY(comppad) != curpad)
436 croak("panic: pad_free curpad");
438 croak("panic: pad_free po");
440 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
441 (unsigned long) thr, (unsigned long) curpad, po));
443 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
444 (unsigned long) curpad, po));
445 #endif /* USE_THREADS */
446 if (curpad[po] && curpad[po] != &sv_undef)
447 SvPADTMP_off(curpad[po]);
453 #ifndef CAN_PROTOTYPE
457 pad_swipe(PADOFFSET po)
458 #endif /* CAN_PROTOTYPE */
461 if (AvARRAY(comppad) != curpad)
462 croak("panic: pad_swipe curpad");
464 croak("panic: pad_swipe po");
466 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
467 (unsigned long) thr, (unsigned long) curpad, po));
469 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
470 (unsigned long) curpad, po));
471 #endif /* USE_THREADS */
472 SvPADTMP_off(curpad[po]);
473 curpad[po] = NEWSV(1107,0);
474 SvPADTMP_on(curpad[po]);
479 /* XXX pad_reset() is currently disabled because it results in serious bugs.
480 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
481 * on the stack by OPs that use them, there are several ways to get an alias
482 * to a shared TARG. Such an alias will change randomly and unpredictably.
483 * We avoid doing this until we can think of a Better Way.
488 #ifdef USE_BROKEN_PAD_RESET
492 if (AvARRAY(comppad) != curpad)
493 croak("panic: pad_reset curpad");
495 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
496 (unsigned long) thr, (unsigned long) curpad));
498 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
499 (unsigned long) curpad));
500 #endif /* USE_THREADS */
501 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
502 for (po = AvMAX(comppad); po > padix_floor; po--) {
503 if (curpad[po] && !SvIMMORTAL(curpad[po]))
504 SvPADTMP_off(curpad[po]);
509 pad_reset_pending = FALSE;
513 /* find_threadsv is not reentrant */
515 find_threadsv(char *name)
521 /* We currently only handle names of a single character */
522 p = strchr(threadsv_names, *name);
525 key = p - threadsv_names;
526 svp = av_fetch(thr->threadsv, key, FALSE);
528 SV *sv = NEWSV(0, 0);
529 av_store(thr->threadsv, key, sv);
530 thr->threadsvp = AvARRAY(thr->threadsv);
532 * Some magic variables used to be automagically initialised
533 * in gv_fetchpv. Those which are now per-thread magicals get
534 * initialised here instead.
540 sv_setpv(sv, "\034");
541 sv_magic(sv, 0, 0, name, 1);
550 sv_magic(sv, 0, 0, name, 1);
552 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
553 "find_threadsv: new SV %p for $%s%c\n",
554 sv, (*name < 32) ? "^" : "",
555 (*name < 32) ? toCTRL(*name) : *name));
559 #endif /* USE_THREADS */
566 register OP *kid, *nextkid;
568 if (!o || o->op_seq == (U16)-1)
571 if (o->op_flags & OPf_KIDS) {
572 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
573 nextkid = kid->op_sibling; /* Get before next freeing kid */
578 switch (o->op_type) {
580 o->op_targ = 0; /* Was holding old type, if any. */
583 o->op_targ = 0; /* Was holding hints. */
587 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
589 #endif /* USE_THREADS */
591 if (!(o->op_flags & OPf_REF) || (check[o->op_type] != ck_ftst))
597 SvREFCNT_dec(cGVOPo->op_gv);
601 Safefree(cCOPo->cop_label);
602 SvREFCNT_dec(cCOPo->cop_filegv);
605 SvREFCNT_dec(cSVOPo->op_sv);
611 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
615 Safefree(cPVOPo->op_pv);
618 op_free(cPMOPo->op_pmreplroot);
622 ReREFCNT_dec(cPMOPo->op_pmregexp);
627 pad_free(o->op_targ);
635 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
636 pad_free(o->op_targ);
637 o->op_targ = o->op_type;
638 o->op_type = OP_NULL;
639 o->op_ppaddr = ppaddr[OP_NULL];
642 /* Contextualizers */
644 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
654 /* establish postfix order */
655 if (cUNOPo->op_first) {
656 o->op_next = LINKLIST(cUNOPo->op_first);
657 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
659 kid->op_next = LINKLIST(kid->op_sibling);
674 if (o && o->op_flags & OPf_KIDS) {
675 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
685 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
687 line_t oldline = curcop->cop_line;
689 if (copline != NOLINE)
690 curcop->cop_line = copline;
691 warn("Found = in conditional, should be ==");
692 curcop->cop_line = oldline;
702 /* assumes no premature commitment */
703 if (!o || (o->op_flags & OPf_WANT) || error_count
704 || o->op_type == OP_RETURN)
707 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
709 switch (o->op_type) {
711 if (o->op_private & OPpREPEAT_DOLIST)
712 null(((LISTOP*)cBINOPo->op_first)->op_first);
713 scalar(cBINOPo->op_first);
718 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
722 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
723 if (!kPMOP->op_pmreplroot)
724 deprecate("implicit split to @_");
731 if (o->op_flags & OPf_KIDS) {
732 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
738 kid = cLISTOPo->op_first;
740 while (kid = kid->op_sibling) {
746 WITH_THR(curcop = &compiling);
751 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
757 WITH_THR(curcop = &compiling);
770 /* assumes no premature commitment */
771 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
772 || o->op_type == OP_RETURN)
775 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
777 switch (o->op_type) {
779 if (!(opargs[o->op_type] & OA_FOLDCONST))
783 if (o->op_flags & OPf_STACKED)
854 if (!(o->op_private & OPpLVAL_INTRO))
855 useless = op_desc[o->op_type];
862 if (!(o->op_private & OPpLVAL_INTRO) &&
863 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
864 useless = "a variable";
869 WITH_THR(curcop = ((COP*)o)); /* for warning below */
875 useless = "a constant";
876 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
878 else if (SvPOK(sv)) {
879 if (strnEQ(SvPVX(sv), "di", 2) ||
880 strnEQ(SvPVX(sv), "ds", 2) ||
881 strnEQ(SvPVX(sv), "ig", 2))
885 null(o); /* don't execute a constant */
886 SvREFCNT_dec(sv); /* don't even remember it */
890 o->op_type = OP_PREINC; /* pre-increment is faster */
891 o->op_ppaddr = ppaddr[OP_PREINC];
895 o->op_type = OP_PREDEC; /* pre-decrement is faster */
896 o->op_ppaddr = ppaddr[OP_PREDEC];
902 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
907 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
908 WITH_THR(curcop = ((COP*)o)); /* for warning below */
909 if (o->op_flags & OPf_STACKED)
915 if (!(o->op_flags & OPf_KIDS))
924 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
931 /* all requires must return a boolean value */
932 o->op_flags &= ~OPf_WANT;
935 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
936 if (!kPMOP->op_pmreplroot)
937 deprecate("implicit split to @_");
941 if (useless && dowarn)
942 warn("Useless use of %s in void context", useless);
950 if (o && o->op_flags & OPf_KIDS) {
951 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
962 /* assumes no premature commitment */
963 if (!o || (o->op_flags & OPf_WANT) || error_count
964 || o->op_type == OP_RETURN)
967 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
969 switch (o->op_type) {
972 list(cBINOPo->op_first);
977 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
984 if (!(o->op_flags & OPf_KIDS))
986 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
987 list(cBINOPo->op_first);
988 return gen_constant_list(o);
995 kid = cLISTOPo->op_first;
997 while (kid = kid->op_sibling) {
1003 WITH_THR(curcop = &compiling);
1007 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1008 if (kid->op_sibling)
1013 WITH_THR(curcop = &compiling);
1016 /* all requires must return a boolean value */
1017 o->op_flags &= ~OPf_WANT;
1029 if (o->op_type == OP_LINESEQ ||
1030 o->op_type == OP_SCOPE ||
1031 o->op_type == OP_LEAVE ||
1032 o->op_type == OP_LEAVETRY)
1035 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1036 if (kid->op_sibling) {
1040 curcop = &compiling;
1042 o->op_flags &= ~OPf_PARENS;
1043 if (hints & HINT_BLOCK_SCOPE)
1044 o->op_flags |= OPf_PARENS;
1047 o = newOP(OP_STUB, 0);
1052 modkids(OP *o, I32 type)
1055 if (o && o->op_flags & OPf_KIDS) {
1056 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1062 static I32 modcount;
1065 mod(OP *o, I32 type)
1071 if (!o || error_count)
1074 switch (o->op_type) {
1079 if (!(o->op_private & (OPpCONST_ARYBASE)))
1081 if (eval_start && eval_start->op_type == OP_CONST) {
1082 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1086 SAVEI32(compiling.cop_arybase);
1087 compiling.cop_arybase = 0;
1089 else if (type == OP_REFGEN)
1092 croak("That use of $[ is unsupported");
1095 if (o->op_flags & OPf_PARENS)
1099 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1100 !(o->op_flags & OPf_STACKED)) {
1101 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1102 o->op_ppaddr = ppaddr[OP_RV2CV];
1103 assert(cUNOPo->op_first->op_type == OP_NULL);
1104 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1110 /* grep, foreach, subcalls, refgen */
1111 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1113 yyerror(form("Can't modify %s in %s",
1114 op_desc[o->op_type],
1115 type ? op_desc[type] : "local"));
1129 case OP_RIGHT_SHIFT:
1138 if (!(o->op_flags & OPf_STACKED))
1144 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1150 if (!type && cUNOPo->op_first->op_type != OP_GV)
1151 croak("Can't localize through a reference");
1152 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1154 return o; /* Treat \(@foo) like ordinary list. */
1158 if (scalar_mod_type(o, type))
1160 ref(cUNOPo->op_first, o->op_type);
1172 if (!type && cUNOPo->op_first->op_type != OP_GV)
1173 croak("Can't localize through a reference");
1174 ref(cUNOPo->op_first, o->op_type);
1178 hints |= HINT_BLOCK_SCOPE;
1187 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1188 return o; /* Treat \(@foo) like ordinary list. */
1189 if (scalar_mod_type(o, type))
1195 croak("Can't localize lexical variable %s",
1196 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1201 modcount++; /* XXX ??? */
1203 #endif /* USE_THREADS */
1209 if (type != OP_SASSIGN)
1215 pad_free(o->op_targ);
1216 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1217 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1218 if (o->op_flags & OPf_KIDS)
1219 mod(cBINOPo->op_first->op_sibling, type);
1224 ref(cBINOPo->op_first, o->op_type);
1225 if (type == OP_ENTERSUB &&
1226 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1227 o->op_private |= OPpLVAL_DEFER;
1234 if (o->op_flags & OPf_KIDS)
1235 mod(cLISTOPo->op_last, type);
1239 if (!(o->op_flags & OPf_KIDS))
1241 if (o->op_targ != OP_LIST) {
1242 mod(cBINOPo->op_first, type);
1247 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1251 o->op_flags |= OPf_MOD;
1253 if (type == OP_AASSIGN || type == OP_SASSIGN)
1254 o->op_flags |= OPf_SPECIAL|OPf_REF;
1256 o->op_private |= OPpLVAL_INTRO;
1257 o->op_flags &= ~OPf_SPECIAL;
1259 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1260 o->op_flags |= OPf_REF;
1265 scalar_mod_type(OP *o, I32 type)
1269 if (o->op_type == OP_RV2GV)
1293 case OP_RIGHT_SHIFT:
1300 case OP_ANDASSIGN: /* may work later */
1301 case OP_ORASSIGN: /* may work later */
1309 refkids(OP *o, I32 type)
1312 if (o && o->op_flags & OPf_KIDS) {
1313 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1320 ref(OP *o, I32 type)
1324 if (!o || error_count)
1327 switch (o->op_type) {
1329 if ((type == OP_DEFINED || type == OP_LOCK) &&
1330 !(o->op_flags & OPf_STACKED)) {
1331 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1332 o->op_ppaddr = ppaddr[OP_RV2CV];
1333 assert(cUNOPo->op_first->op_type == OP_NULL);
1334 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1335 o->op_flags |= OPf_SPECIAL;
1340 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1344 ref(cUNOPo->op_first, o->op_type);
1347 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1348 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1349 : type == OP_RV2HV ? OPpDEREF_HV
1351 o->op_flags |= OPf_MOD;
1356 o->op_flags |= OPf_MOD; /* XXX ??? */
1361 o->op_flags |= OPf_REF;
1364 ref(cUNOPo->op_first, o->op_type);
1369 o->op_flags |= OPf_REF;
1374 if (!(o->op_flags & OPf_KIDS))
1376 ref(cBINOPo->op_first, type);
1380 ref(cBINOPo->op_first, o->op_type);
1381 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1382 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1383 : type == OP_RV2HV ? OPpDEREF_HV
1385 o->op_flags |= OPf_MOD;
1393 if (!(o->op_flags & OPf_KIDS))
1395 ref(cLISTOPo->op_last, type);
1410 if (!o || error_count)
1414 if (type == OP_LIST) {
1415 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1418 else if (type != OP_PADSV &&
1421 type != OP_PUSHMARK)
1423 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1426 o->op_flags |= OPf_MOD;
1427 o->op_private |= OPpLVAL_INTRO;
1435 o->op_flags |= OPf_PARENS;
1440 bind_match(I32 type, OP *left, OP *right)
1445 (left->op_type == OP_RV2AV ||
1446 left->op_type == OP_RV2HV ||
1447 left->op_type == OP_PADAV ||
1448 left->op_type == OP_PADHV)) {
1449 char *desc = op_desc[(right->op_type == OP_SUBST ||
1450 right->op_type == OP_TRANS)
1451 ? right->op_type : OP_MATCH];
1452 char *sample = ((left->op_type == OP_RV2AV ||
1453 left->op_type == OP_PADAV)
1454 ? "@array" : "%hash");
1455 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1458 if (right->op_type == OP_MATCH ||
1459 right->op_type == OP_SUBST ||
1460 right->op_type == OP_TRANS) {
1461 right->op_flags |= OPf_STACKED;
1462 if (right->op_type != OP_MATCH)
1463 left = mod(left, right->op_type);
1464 if (right->op_type == OP_TRANS)
1465 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1467 o = prepend_elem(right->op_type, scalar(left), right);
1469 return newUNOP(OP_NOT, 0, scalar(o));
1473 return bind_match(type, left,
1474 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1482 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1483 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1490 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1491 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1492 o->op_type = OP_LEAVE;
1493 o->op_ppaddr = ppaddr[OP_LEAVE];
1496 if (o->op_type == OP_LINESEQ) {
1498 o->op_type = OP_SCOPE;
1499 o->op_ppaddr = ppaddr[OP_SCOPE];
1500 kid = ((LISTOP*)o)->op_first;
1501 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1502 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1507 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1514 block_start(int full)
1517 int retval = savestack_ix;
1518 SAVEI32(comppad_name_floor);
1520 if ((comppad_name_fill = AvFILLp(comppad_name)) > 0)
1521 comppad_name_floor = comppad_name_fill;
1523 comppad_name_floor = 0;
1525 SAVEI32(min_intro_pending);
1526 SAVEI32(max_intro_pending);
1527 min_intro_pending = 0;
1528 SAVEI32(comppad_name_fill);
1529 SAVEI32(padix_floor);
1530 padix_floor = padix;
1531 pad_reset_pending = FALSE;
1533 hints &= ~HINT_BLOCK_SCOPE;
1538 block_end(I32 floor, OP *seq)
1541 int needblockscope = hints & HINT_BLOCK_SCOPE;
1542 OP* retval = scalarseq(seq);
1544 pad_reset_pending = FALSE;
1546 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1547 pad_leavemy(comppad_name_fill);
1556 OP *o = newOP(OP_THREADSV, 0);
1557 o->op_targ = find_threadsv("_");
1560 return newSVREF(newGVOP(OP_GV, 0, defgv));
1561 #endif /* USE_THREADS */
1569 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1570 eval_start = linklist(eval_root);
1571 eval_root->op_next = 0;
1577 main_root = scope(sawparens(scalarvoid(o)));
1578 curcop = &compiling;
1579 main_start = LINKLIST(main_root);
1580 main_root->op_next = 0;
1584 /* Register with debugger */
1586 CV *cv = perl_get_cv("DB::postponed", FALSE);
1590 XPUSHs((SV*)compiling.cop_filegv);
1592 perl_call_sv((SV*)cv, G_DISCARD);
1599 localize(OP *o, I32 lex)
1601 if (o->op_flags & OPf_PARENS)
1604 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1606 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1607 if (*s == ';' || *s == '=')
1608 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1612 in_my_stash = Nullhv;
1616 return mod(o, OP_NULL); /* a bit kludgey */
1622 if (o->op_type == OP_LIST) {
1625 o2 = newOP(OP_THREADSV, 0);
1626 o2->op_targ = find_threadsv(";");
1628 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1629 #endif /* USE_THREADS */
1630 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1636 fold_constants(register OP *o)
1640 I32 type = o->op_type;
1643 if (opargs[type] & OA_RETSCALAR)
1645 if (opargs[type] & OA_TARGET)
1646 o->op_targ = pad_alloc(type, SVs_PADTMP);
1648 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1649 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1651 if (!(opargs[type] & OA_FOLDCONST))
1666 if (o->op_private & OPpLOCALE)
1671 goto nope; /* Don't try to run w/ errors */
1673 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1674 if (curop->op_type != OP_CONST &&
1675 curop->op_type != OP_LIST &&
1676 curop->op_type != OP_SCALAR &&
1677 curop->op_type != OP_NULL &&
1678 curop->op_type != OP_PUSHMARK) {
1683 curop = LINKLIST(o);
1688 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1689 pad_swipe(o->op_targ);
1690 else if (SvTEMP(sv)) { /* grab mortal temp? */
1691 (void)SvREFCNT_inc(sv);
1695 if (type == OP_RV2GV)
1696 return newGVOP(OP_GV, 0, (GV*)sv);
1698 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1700 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1705 SvIOK_off(sv); /* undo SvIV() damage */
1707 return newSVOP(OP_CONST, 0, sv);
1711 if (!(opargs[type] & OA_OTHERINT))
1714 if (!(hints & HINT_INTEGER)) {
1715 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1718 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1719 if (curop->op_type == OP_CONST) {
1720 if (SvIOK(((SVOP*)curop)->op_sv))
1724 if (opargs[curop->op_type] & OA_RETINTEGER)
1728 o->op_ppaddr = ppaddr[++(o->op_type)];
1735 gen_constant_list(register OP *o)
1739 I32 oldtmps_floor = tmps_floor;
1743 return o; /* Don't attempt to run with errors */
1745 op = curop = LINKLIST(o);
1751 tmps_floor = oldtmps_floor;
1753 o->op_type = OP_RV2AV;
1754 o->op_ppaddr = ppaddr[OP_RV2AV];
1755 curop = ((UNOP*)o)->op_first;
1756 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1763 convert(I32 type, I32 flags, OP *o)
1768 if (!o || o->op_type != OP_LIST)
1769 o = newLISTOP(OP_LIST, 0, o, Nullop);
1771 o->op_flags &= ~OPf_WANT;
1773 if (!(opargs[type] & OA_MARK))
1774 null(cLISTOPo->op_first);
1777 o->op_ppaddr = ppaddr[type];
1778 o->op_flags |= flags;
1780 o = CHECKOP(type, o);
1781 if (o->op_type != type)
1784 if (cLISTOPo->op_children < 7) {
1785 /* XXX do we really need to do this if we're done appending?? */
1786 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1788 cLISTOPo->op_last = last; /* in case check substituted last arg */
1791 return fold_constants(o);
1794 /* List constructors */
1797 append_elem(I32 type, OP *first, OP *last)
1805 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1806 return newLISTOP(type, 0, first, last);
1808 if (first->op_flags & OPf_KIDS)
1809 ((LISTOP*)first)->op_last->op_sibling = last;
1811 first->op_flags |= OPf_KIDS;
1812 ((LISTOP*)first)->op_first = last;
1814 ((LISTOP*)first)->op_last = last;
1815 ((LISTOP*)first)->op_children++;
1820 append_list(I32 type, LISTOP *first, LISTOP *last)
1828 if (first->op_type != type)
1829 return prepend_elem(type, (OP*)first, (OP*)last);
1831 if (last->op_type != type)
1832 return append_elem(type, (OP*)first, (OP*)last);
1834 first->op_last->op_sibling = last->op_first;
1835 first->op_last = last->op_last;
1836 first->op_children += last->op_children;
1837 if (first->op_children)
1838 last->op_flags |= OPf_KIDS;
1845 prepend_elem(I32 type, OP *first, OP *last)
1853 if (last->op_type == type) {
1854 if (type == OP_LIST) { /* already a PUSHMARK there */
1855 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1856 ((LISTOP*)last)->op_first->op_sibling = first;
1859 if (!(last->op_flags & OPf_KIDS)) {
1860 ((LISTOP*)last)->op_last = first;
1861 last->op_flags |= OPf_KIDS;
1863 first->op_sibling = ((LISTOP*)last)->op_first;
1864 ((LISTOP*)last)->op_first = first;
1866 ((LISTOP*)last)->op_children++;
1870 return newLISTOP(type, 0, first, last);
1878 return newOP(OP_STUB, 0);
1884 if (!o || o->op_type != OP_LIST)
1885 o = newLISTOP(OP_LIST, 0, o, Nullop);
1891 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1895 Newz(1101, listop, 1, LISTOP);
1897 listop->op_type = type;
1898 listop->op_ppaddr = ppaddr[type];
1899 listop->op_children = (first != 0) + (last != 0);
1900 listop->op_flags = flags;
1904 else if (!first && last)
1907 first->op_sibling = last;
1908 listop->op_first = first;
1909 listop->op_last = last;
1910 if (type == OP_LIST) {
1912 pushop = newOP(OP_PUSHMARK, 0);
1913 pushop->op_sibling = first;
1914 listop->op_first = pushop;
1915 listop->op_flags |= OPf_KIDS;
1917 listop->op_last = pushop;
1919 else if (listop->op_children)
1920 listop->op_flags |= OPf_KIDS;
1926 newOP(I32 type, I32 flags)
1929 Newz(1101, o, 1, OP);
1931 o->op_ppaddr = ppaddr[type];
1932 o->op_flags = flags;
1935 o->op_private = 0 + (flags >> 8);
1936 if (opargs[type] & OA_RETSCALAR)
1938 if (opargs[type] & OA_TARGET)
1939 o->op_targ = pad_alloc(type, SVs_PADTMP);
1940 return CHECKOP(type, o);
1944 newUNOP(I32 type, I32 flags, OP *first)
1949 first = newOP(OP_STUB, 0);
1950 if (opargs[type] & OA_MARK)
1951 first = force_list(first);
1953 Newz(1101, unop, 1, UNOP);
1954 unop->op_type = type;
1955 unop->op_ppaddr = ppaddr[type];
1956 unop->op_first = first;
1957 unop->op_flags = flags | OPf_KIDS;
1958 unop->op_private = 1 | (flags >> 8);
1960 if(type == OP_STUDY && first->op_type == OP_MATCH) {
1961 first->op_type = OP_PUSHRE;
1962 first->op_ppaddr = ppaddr[OP_PUSHRE];
1965 unop = (UNOP*) CHECKOP(type, unop);
1969 return fold_constants((OP *) unop);
1973 newBINOP(I32 type, I32 flags, OP *first, OP *last)
1976 Newz(1101, binop, 1, BINOP);
1979 first = newOP(OP_NULL, 0);
1981 binop->op_type = type;
1982 binop->op_ppaddr = ppaddr[type];
1983 binop->op_first = first;
1984 binop->op_flags = flags | OPf_KIDS;
1987 binop->op_private = 1 | (flags >> 8);
1990 binop->op_private = 2 | (flags >> 8);
1991 first->op_sibling = last;
1994 binop = (BINOP*)CHECKOP(type, binop);
1998 binop->op_last = last = binop->op_first->op_sibling;
2000 return fold_constants((OP *)binop);
2004 pmtrans(OP *o, OP *expr, OP *repl)
2006 SV *tstr = ((SVOP*)expr)->op_sv;
2007 SV *rstr = ((SVOP*)repl)->op_sv;
2010 register U8 *t = (U8*)SvPV(tstr, tlen);
2011 register U8 *r = (U8*)SvPV(rstr, rlen);
2017 register short *tbl;
2019 tbl = (short*)cPVOPo->op_pv;
2020 complement = o->op_private & OPpTRANS_COMPLEMENT;
2021 Delete = o->op_private & OPpTRANS_DELETE;
2022 squash = o->op_private & OPpTRANS_SQUASH;
2025 Zero(tbl, 256, short);
2026 for (i = 0; i < tlen; i++)
2028 for (i = 0, j = 0; i < 256; i++) {
2044 if (!rlen && !Delete) {
2047 o->op_private |= OPpTRANS_COUNTONLY;
2049 for (i = 0; i < 256; i++)
2051 for (i = 0, j = 0; i < tlen; i++,j++) {
2054 if (tbl[t[i]] == -1)
2060 if (tbl[t[i]] == -1)
2071 newPMOP(I32 type, I32 flags)
2076 Newz(1101, pmop, 1, PMOP);
2077 pmop->op_type = type;
2078 pmop->op_ppaddr = ppaddr[type];
2079 pmop->op_flags = flags;
2080 pmop->op_private = 0 | (flags >> 8);
2082 if (hints & HINT_LOCALE)
2083 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2085 /* link into pm list */
2086 if (type != OP_TRANS && curstash) {
2087 pmop->op_pmnext = HvPMROOT(curstash);
2088 HvPMROOT(curstash) = pmop;
2095 pmruntime(OP *o, OP *expr, OP *repl)
2100 if (o->op_type == OP_TRANS)
2101 return pmtrans(o, expr, repl);
2103 hints |= HINT_BLOCK_SCOPE;
2106 if (expr->op_type == OP_CONST) {
2108 SV *pat = ((SVOP*)expr)->op_sv;
2109 char *p = SvPV(pat, plen);
2110 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2111 sv_setpvn(pat, "\\s+", 3);
2112 p = SvPV(pat, plen);
2113 pm->op_pmflags |= PMf_SKIPWHITE;
2115 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2116 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2117 pm->op_pmflags |= PMf_WHITE;
2121 if (pm->op_pmflags & PMf_KEEP)
2122 expr = newUNOP(OP_REGCMAYBE,0,expr);
2124 Newz(1101, rcop, 1, LOGOP);
2125 rcop->op_type = OP_REGCOMP;
2126 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2127 rcop->op_first = scalar(expr);
2128 rcop->op_flags |= OPf_KIDS;
2129 rcop->op_private = 1;
2132 /* establish postfix order */
2133 if (pm->op_pmflags & PMf_KEEP) {
2135 rcop->op_next = expr;
2136 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2139 rcop->op_next = LINKLIST(expr);
2140 expr->op_next = (OP*)rcop;
2143 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2148 if (pm->op_pmflags & PMf_EVAL)
2151 else if (repl->op_type == OP_THREADSV
2152 && strchr("&`'123456789+",
2153 threadsv_names[repl->op_targ]))
2157 #endif /* USE_THREADS */
2158 else if (repl->op_type == OP_CONST)
2162 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2163 if (opargs[curop->op_type] & OA_DANGEROUS) {
2165 if (curop->op_type == OP_THREADSV
2166 && strchr("&`'123456789+", curop->op_private)) {
2170 if (curop->op_type == OP_GV) {
2171 GV *gv = ((GVOP*)curop)->op_gv;
2172 if (strchr("&`'123456789+", *GvENAME(gv)))
2175 #endif /* USE_THREADS */
2176 else if (curop->op_type == OP_RV2CV)
2178 else if (curop->op_type == OP_RV2SV ||
2179 curop->op_type == OP_RV2AV ||
2180 curop->op_type == OP_RV2HV ||
2181 curop->op_type == OP_RV2GV) {
2182 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2185 else if (curop->op_type == OP_PADSV ||
2186 curop->op_type == OP_PADAV ||
2187 curop->op_type == OP_PADHV ||
2188 curop->op_type == OP_PADANY) {
2197 if (curop == repl) {
2198 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2199 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2200 prepend_elem(o->op_type, scalar(repl), o);
2203 Newz(1101, rcop, 1, LOGOP);
2204 rcop->op_type = OP_SUBSTCONT;
2205 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2206 rcop->op_first = scalar(repl);
2207 rcop->op_flags |= OPf_KIDS;
2208 rcop->op_private = 1;
2211 /* establish postfix order */
2212 rcop->op_next = LINKLIST(repl);
2213 repl->op_next = (OP*)rcop;
2215 pm->op_pmreplroot = scalar((OP*)rcop);
2216 pm->op_pmreplstart = LINKLIST(rcop);
2225 newSVOP(I32 type, I32 flags, SV *sv)
2228 Newz(1101, svop, 1, SVOP);
2229 svop->op_type = type;
2230 svop->op_ppaddr = ppaddr[type];
2232 svop->op_next = (OP*)svop;
2233 svop->op_flags = flags;
2234 if (opargs[type] & OA_RETSCALAR)
2236 if (opargs[type] & OA_TARGET)
2237 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2238 return CHECKOP(type, svop);
2242 newGVOP(I32 type, I32 flags, GV *gv)
2246 Newz(1101, gvop, 1, GVOP);
2247 gvop->op_type = type;
2248 gvop->op_ppaddr = ppaddr[type];
2249 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2250 gvop->op_next = (OP*)gvop;
2251 gvop->op_flags = flags;
2252 if (opargs[type] & OA_RETSCALAR)
2254 if (opargs[type] & OA_TARGET)
2255 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2256 return CHECKOP(type, gvop);
2260 newPVOP(I32 type, I32 flags, char *pv)
2263 Newz(1101, pvop, 1, PVOP);
2264 pvop->op_type = type;
2265 pvop->op_ppaddr = ppaddr[type];
2267 pvop->op_next = (OP*)pvop;
2268 pvop->op_flags = flags;
2269 if (opargs[type] & OA_RETSCALAR)
2271 if (opargs[type] & OA_TARGET)
2272 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2273 return CHECKOP(type, pvop);
2282 save_hptr(&curstash);
2283 save_item(curstname);
2288 name = SvPV(sv, len);
2289 curstash = gv_stashpvn(name,len,TRUE);
2290 sv_setpvn(curstname, name, len);
2294 sv_setpv(curstname,"<none>");
2302 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2310 if (id->op_type != OP_CONST)
2311 croak("Module name must be constant");
2315 if(version != Nullop) {
2316 SV *vesv = ((SVOP*)version)->op_sv;
2318 if (arg == Nullop && !SvNIOK(vesv)) {
2325 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2326 croak("Version number must be constant number");
2328 /* Make copy of id so we don't free it twice */
2329 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2331 /* Fake up a method call to VERSION */
2332 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2333 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2334 append_elem(OP_LIST,
2335 prepend_elem(OP_LIST, pack, list(version)),
2336 newUNOP(OP_METHOD, 0, meth)));
2340 /* Fake up an import/unimport */
2341 if (arg && arg->op_type == OP_STUB)
2342 imop = arg; /* no import on explicit () */
2343 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2344 imop = Nullop; /* use 5.0; */
2347 /* Make copy of id so we don't free it twice */
2348 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2349 meth = newSVOP(OP_CONST, 0,
2351 ? newSVpv("import", 6)
2352 : newSVpv("unimport", 8)
2354 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2355 append_elem(OP_LIST,
2356 prepend_elem(OP_LIST, pack, list(arg)),
2357 newUNOP(OP_METHOD, 0, meth)));
2360 /* Fake up a require */
2361 rqop = newUNOP(OP_REQUIRE, 0, id);
2363 /* Fake up the BEGIN {}, which does its thing immediately. */
2365 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2367 append_elem(OP_LINESEQ,
2368 append_elem(OP_LINESEQ,
2369 newSTATEOP(0, Nullch, rqop),
2370 newSTATEOP(0, Nullch, veop)),
2371 newSTATEOP(0, Nullch, imop) ));
2378 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2380 return newBINOP(OP_LSLICE, flags,
2381 list(force_list(subscript)),
2382 list(force_list(listval)) );
2386 list_assignment(register OP *o)
2391 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2392 o = cUNOPo->op_first;
2394 if (o->op_type == OP_COND_EXPR) {
2395 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2396 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2401 yyerror("Assignment to both a list and a scalar");
2405 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2406 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2407 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2410 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2413 if (o->op_type == OP_RV2SV)
2420 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2425 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2426 return newLOGOP(optype, 0,
2427 mod(scalar(left), optype),
2428 newUNOP(OP_SASSIGN, 0, scalar(right)));
2431 return newBINOP(optype, OPf_STACKED,
2432 mod(scalar(left), optype), scalar(right));
2436 if (list_assignment(left)) {
2438 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2439 left = mod(left, OP_AASSIGN);
2447 o = newBINOP(OP_AASSIGN, flags,
2448 list(force_list(right)),
2449 list(force_list(left)) );
2450 o->op_private = 0 | (flags >> 8);
2451 if (!(left->op_private & OPpLVAL_INTRO)) {
2452 static int generation = 100;
2456 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2457 if (opargs[curop->op_type] & OA_DANGEROUS) {
2458 if (curop->op_type == OP_GV) {
2459 GV *gv = ((GVOP*)curop)->op_gv;
2460 if (gv == defgv || SvCUR(gv) == generation)
2462 SvCUR(gv) = generation;
2464 else if (curop->op_type == OP_PADSV ||
2465 curop->op_type == OP_PADAV ||
2466 curop->op_type == OP_PADHV ||
2467 curop->op_type == OP_PADANY) {
2468 SV **svp = AvARRAY(comppad_name);
2469 SV *sv = svp[curop->op_targ];
2470 if (SvCUR(sv) == generation)
2472 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2474 else if (curop->op_type == OP_RV2CV)
2476 else if (curop->op_type == OP_RV2SV ||
2477 curop->op_type == OP_RV2AV ||
2478 curop->op_type == OP_RV2HV ||
2479 curop->op_type == OP_RV2GV) {
2480 if (lastop->op_type != OP_GV) /* funny deref? */
2489 o->op_private = OPpASSIGN_COMMON;
2491 if (right && right->op_type == OP_SPLIT) {
2493 if ((tmpop = ((LISTOP*)right)->op_first) &&
2494 tmpop->op_type == OP_PUSHRE)
2496 PMOP *pm = (PMOP*)tmpop;
2497 if (left->op_type == OP_RV2AV &&
2498 !(left->op_private & OPpLVAL_INTRO) &&
2499 !(o->op_private & OPpASSIGN_COMMON) )
2501 tmpop = ((UNOP*)left)->op_first;
2502 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2503 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2504 pm->op_pmflags |= PMf_ONCE;
2505 tmpop = cUNOPo->op_first; /* to list (nulled) */
2506 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2507 tmpop->op_sibling = Nullop; /* don't free split */
2508 right->op_next = tmpop->op_next; /* fix starting loc */
2509 op_free(o); /* blow off assign */
2510 right->op_flags &= ~OPf_WANT;
2511 /* "I don't know and I don't care." */
2516 if (modcount < 10000 &&
2517 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2519 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2521 sv_setiv(sv, modcount+1);
2529 right = newOP(OP_UNDEF, 0);
2530 if (right->op_type == OP_READLINE) {
2531 right->op_flags |= OPf_STACKED;
2532 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2535 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2536 o = newBINOP(OP_SASSIGN, flags,
2537 scalar(right), mod(scalar(left), OP_SASSIGN) );
2549 newSTATEOP(I32 flags, char *label, OP *o)
2552 U32 seq = intro_my();
2555 Newz(1101, cop, 1, COP);
2556 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2557 cop->op_type = OP_DBSTATE;
2558 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2561 cop->op_type = OP_NEXTSTATE;
2562 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2564 cop->op_flags = flags;
2565 cop->op_private = 0 | (flags >> 8);
2567 cop->op_private |= NATIVE_HINTS;
2569 cop->op_next = (OP*)cop;
2572 cop->cop_label = label;
2573 hints |= HINT_BLOCK_SCOPE;
2576 cop->cop_arybase = curcop->cop_arybase;
2578 if (copline == NOLINE)
2579 cop->cop_line = curcop->cop_line;
2581 cop->cop_line = copline;
2584 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2585 cop->cop_stash = curstash;
2587 if (PERLDB_LINE && curstash != debstash) {
2588 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2589 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2590 (void)SvIOK_on(*svp);
2592 SvSTASH(*svp) = (HV*)cop;
2596 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2599 /* "Introduce" my variables to visible status. */
2607 if (! min_intro_pending)
2610 svp = AvARRAY(comppad_name);
2611 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2612 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2613 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2614 SvNVX(sv) = (double)cop_seqmax;
2617 min_intro_pending = 0;
2618 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2619 return cop_seqmax++;
2623 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2629 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2630 return newBINOP(type, flags, scalar(first), scalar(other));
2632 scalarboolean(first);
2633 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2634 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2635 if (type == OP_AND || type == OP_OR) {
2641 first = cUNOPo->op_first;
2643 first->op_next = o->op_next;
2644 cUNOPo->op_first = Nullop;
2648 if (first->op_type == OP_CONST) {
2649 if (dowarn && (first->op_private & OPpCONST_BARE))
2650 warn("Probable precedence problem on %s", op_desc[type]);
2651 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2660 else if (first->op_type == OP_WANTARRAY) {
2666 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2667 OP *k1 = ((UNOP*)first)->op_first;
2668 OP *k2 = k1->op_sibling;
2670 switch (first->op_type)
2673 if (k2 && k2->op_type == OP_READLINE
2674 && (k2->op_flags & OPf_STACKED)
2675 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2676 warnop = k2->op_type;
2680 if (k1->op_type == OP_READDIR
2681 || k1->op_type == OP_GLOB
2682 || k1->op_type == OP_EACH)
2683 warnop = k1->op_type;
2687 line_t oldline = curcop->cop_line;
2688 curcop->cop_line = copline;
2689 warn("Value of %s%s can be \"0\"; test with defined()",
2691 ((warnop == OP_READLINE || warnop == OP_GLOB)
2692 ? " construct" : "() operator"));
2693 curcop->cop_line = oldline;
2700 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2701 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2703 Newz(1101, logop, 1, LOGOP);
2705 logop->op_type = type;
2706 logop->op_ppaddr = ppaddr[type];
2707 logop->op_first = first;
2708 logop->op_flags = flags | OPf_KIDS;
2709 logop->op_other = LINKLIST(other);
2710 logop->op_private = 1 | (flags >> 8);
2712 /* establish postfix order */
2713 logop->op_next = LINKLIST(first);
2714 first->op_next = (OP*)logop;
2715 first->op_sibling = other;
2717 o = newUNOP(OP_NULL, 0, (OP*)logop);
2724 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2731 return newLOGOP(OP_AND, 0, first, trueop);
2733 return newLOGOP(OP_OR, 0, first, falseop);
2735 scalarboolean(first);
2736 if (first->op_type == OP_CONST) {
2737 if (SvTRUE(((SVOP*)first)->op_sv)) {
2748 else if (first->op_type == OP_WANTARRAY) {
2752 Newz(1101, condop, 1, CONDOP);
2754 condop->op_type = OP_COND_EXPR;
2755 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2756 condop->op_first = first;
2757 condop->op_flags = flags | OPf_KIDS;
2758 condop->op_true = LINKLIST(trueop);
2759 condop->op_false = LINKLIST(falseop);
2760 condop->op_private = 1 | (flags >> 8);
2762 /* establish postfix order */
2763 condop->op_next = LINKLIST(first);
2764 first->op_next = (OP*)condop;
2766 first->op_sibling = trueop;
2767 trueop->op_sibling = falseop;
2768 o = newUNOP(OP_NULL, 0, (OP*)condop);
2770 trueop->op_next = o;
2771 falseop->op_next = o;
2777 newRANGE(I32 flags, OP *left, OP *right)
2785 Newz(1101, condop, 1, CONDOP);
2787 condop->op_type = OP_RANGE;
2788 condop->op_ppaddr = ppaddr[OP_RANGE];
2789 condop->op_first = left;
2790 condop->op_flags = OPf_KIDS;
2791 condop->op_true = LINKLIST(left);
2792 condop->op_false = LINKLIST(right);
2793 condop->op_private = 1 | (flags >> 8);
2795 left->op_sibling = right;
2797 condop->op_next = (OP*)condop;
2798 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2799 flop = newUNOP(OP_FLOP, 0, flip);
2800 o = newUNOP(OP_NULL, 0, flop);
2803 left->op_next = flip;
2804 right->op_next = flop;
2806 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2807 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2808 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2809 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2811 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2812 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2815 if (!flip->op_private || !flop->op_private)
2816 linklist(o); /* blow off optimizer unless constant */
2822 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2827 int once = block && block->op_flags & OPf_SPECIAL &&
2828 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2831 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2832 return block; /* do {} while 0 does once */
2833 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2834 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2835 expr = newUNOP(OP_DEFINED, 0,
2836 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2840 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2841 o = newLOGOP(OP_AND, 0, expr, listop);
2843 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2845 if (once && o != listop)
2846 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2849 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2851 o->op_flags |= flags;
2853 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2858 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2867 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2868 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2869 expr = newUNOP(OP_DEFINED, 0,
2870 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2874 block = newOP(OP_NULL, 0);
2877 next = LINKLIST(cont);
2879 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2880 if ((line_t)whileline != NOLINE) {
2881 copline = whileline;
2882 cont = append_elem(OP_LINESEQ, cont,
2883 newSTATEOP(0, Nullch, Nullop));
2887 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2888 redo = LINKLIST(listop);
2891 o = newLOGOP(OP_AND, 0, expr, scalar(listop));
2892 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2893 op_free(expr); /* oops, it's a while (0) */
2895 return Nullop; /* (listop already freed by newLOGOP) */
2897 ((LISTOP*)listop)->op_last->op_next = condop =
2898 (o == listop ? redo : LINKLIST(o));
2906 Newz(1101,loop,1,LOOP);
2907 loop->op_type = OP_ENTERLOOP;
2908 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2909 loop->op_private = 0;
2910 loop->op_next = (OP*)loop;
2913 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2915 loop->op_redoop = redo;
2916 loop->op_lastop = o;
2919 loop->op_nextop = next;
2921 loop->op_nextop = o;
2923 o->op_flags |= flags;
2924 o->op_private |= (flags >> 8);
2929 #ifndef CAN_PROTOTYPE
2930 newFOROP(flags,label,forline,sv,expr,block,cont)
2939 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2940 #endif /* CAN_PROTOTYPE */
2948 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2949 sv->op_type = OP_RV2GV;
2950 sv->op_ppaddr = ppaddr[OP_RV2GV];
2952 else if (sv->op_type == OP_PADSV) { /* private variable */
2953 padoff = sv->op_targ;
2957 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
2958 padoff = sv->op_targ;
2959 iterflags |= OPf_SPECIAL;
2964 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2968 padoff = find_threadsv("_");
2969 iterflags |= OPf_SPECIAL;
2971 sv = newGVOP(OP_GV, 0, defgv);
2974 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2975 expr = scalar(ref(expr, OP_ITER));
2976 iterflags |= OPf_STACKED;
2978 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2979 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2981 assert(!loop->op_next);
2982 Renew(loop, 1, LOOP);
2983 loop->op_targ = padoff;
2984 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
2986 return newSTATEOP(0, label, wop);
2990 newLOOPEX(I32 type, OP *label)
2994 if (type != OP_GOTO || label->op_type == OP_CONST) {
2995 /* "last()" means "last" */
2996 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
2997 o = newOP(type, OPf_SPECIAL);
2999 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3000 ? SvPVx(((SVOP*)label)->op_sv, na)
3006 if (label->op_type == OP_ENTERSUB)
3007 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3008 o = newUNOP(type, OPf_STACKED, label);
3010 hints |= HINT_BLOCK_SCOPE;
3020 MUTEX_DESTROY(CvMUTEXP(cv));
3021 Safefree(CvMUTEXP(cv));
3024 #endif /* USE_THREADS */
3026 if (!CvXSUB(cv) && CvROOT(cv)) {
3028 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3029 croak("Can't undef active subroutine");
3032 croak("Can't undef active subroutine");
3033 #endif /* USE_THREADS */
3040 op_free(CvROOT(cv));
3041 CvROOT(cv) = Nullop;
3044 SvPOK_off((SV*)cv); /* forget prototype */
3046 SvREFCNT_dec(CvGV(cv));
3048 SvREFCNT_dec(CvOUTSIDE(cv));
3049 CvOUTSIDE(cv) = Nullcv;
3050 if (CvPADLIST(cv)) {
3051 /* may be during global destruction */
3052 if (SvREFCNT(CvPADLIST(cv))) {
3053 I32 i = AvFILLp(CvPADLIST(cv));
3055 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3056 SV* sv = svp ? *svp : Nullsv;
3059 if (sv == (SV*)comppad_name)
3060 comppad_name = Nullav;
3061 else if (sv == (SV*)comppad) {
3063 curpad = Null(SV**);
3067 SvREFCNT_dec((SV*)CvPADLIST(cv));
3069 CvPADLIST(cv) = Nullav;
3073 #ifdef DEBUG_CLOSURES
3078 CV *outside = CvOUTSIDE(cv);
3079 AV* padlist = CvPADLIST(cv);
3086 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3088 (CvANON(cv) ? "ANON"
3089 : (cv == main_cv) ? "MAIN"
3090 : CvUNIQUE(outside) ? "UNIQUE"
3091 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3094 : CvANON(outside) ? "ANON"
3095 : (outside == main_cv) ? "MAIN"
3096 : CvUNIQUE(outside) ? "UNIQUE"
3097 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3102 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3103 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3104 pname = AvARRAY(pad_name);
3105 ppad = AvARRAY(pad);
3107 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3108 if (SvPOK(pname[ix]))
3109 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3111 SvFAKE(pname[ix]) ? "FAKE " : "",
3113 (long)I_32(SvNVX(pname[ix])),
3114 (long)SvIVX(pname[ix]));
3117 #endif /* DEBUG_CLOSURES */
3120 cv_clone2(CV *proto, CV *outside)
3125 AV* protopadlist = CvPADLIST(proto);
3126 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3127 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3128 SV** pname = AvARRAY(protopad_name);
3129 SV** ppad = AvARRAY(protopad);
3130 I32 fname = AvFILLp(protopad_name);
3131 I32 fpad = AvFILLp(protopad);
3135 assert(!CvUNIQUE(proto));
3140 SAVESPTR(comppad_name);
3143 cv = compcv = (CV*)NEWSV(1104,0);
3144 sv_upgrade((SV *)cv, SvTYPE(proto));
3150 New(666, CvMUTEXP(cv), 1, perl_mutex);
3151 MUTEX_INIT(CvMUTEXP(cv));
3153 #endif /* USE_THREADS */
3154 CvFILEGV(cv) = CvFILEGV(proto);
3155 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3156 CvSTASH(cv) = CvSTASH(proto);
3157 CvROOT(cv) = CvROOT(proto);
3158 CvSTART(cv) = CvSTART(proto);
3160 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3163 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3165 comppad_name = newAV();
3166 for (ix = fname; ix >= 0; ix--)
3167 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3171 comppadlist = newAV();
3172 AvREAL_off(comppadlist);
3173 av_store(comppadlist, 0, (SV*)comppad_name);
3174 av_store(comppadlist, 1, (SV*)comppad);
3175 CvPADLIST(cv) = comppadlist;
3176 av_fill(comppad, AvFILLp(protopad));
3177 curpad = AvARRAY(comppad);
3179 av = newAV(); /* will be @_ */
3181 av_store(comppad, 0, (SV*)av);
3182 AvFLAGS(av) = AVf_REIFY;
3184 for (ix = fpad; ix > 0; ix--) {
3185 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3186 if (namesv && namesv != &sv_undef) {
3187 char *name = SvPVX(namesv); /* XXX */
3188 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3189 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3190 CvOUTSIDE(cv), cxstack_ix);
3192 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3194 croak("panic: cv_clone: %s", name);
3196 else { /* our own lexical */
3199 /* anon code -- we'll come back for it */
3200 sv = SvREFCNT_inc(ppad[ix]);
3202 else if (*name == '@')
3204 else if (*name == '%')
3214 SV* sv = NEWSV(0,0);
3220 /* Now that vars are all in place, clone nested closures. */
3222 for (ix = fpad; ix > 0; ix--) {
3223 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3225 && namesv != &sv_undef
3226 && !(SvFLAGS(namesv) & SVf_FAKE)
3227 && *SvPVX(namesv) == '&'
3228 && CvCLONE(ppad[ix]))
3230 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3231 SvREFCNT_dec(ppad[ix]);
3234 curpad[ix] = (SV*)kid;
3238 #ifdef DEBUG_CLOSURES
3239 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3241 PerlIO_printf(Perl_debug_log, " from:\n");
3243 PerlIO_printf(Perl_debug_log, " to:\n");
3254 return cv_clone2(proto, CvOUTSIDE(proto));
3258 cv_ckproto(CV *cv, GV *gv, char *p)
3260 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3261 SV* msg = sv_newmortal();
3265 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3266 sv_setpv(msg, "Prototype mismatch:");
3268 sv_catpvf(msg, " sub %_", name);
3270 sv_catpvf(msg, " (%s)", SvPVX(cv));
3271 sv_catpv(msg, " vs ");
3273 sv_catpvf(msg, "(%s)", p);
3275 sv_catpv(msg, "none");
3286 if (!cv || !SvPOK(cv) || SvCUR(cv))
3290 for (o = CvSTART(cv); o; o = o->op_next) {
3291 OPCODE type = o->op_type;
3293 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3295 if (type == OP_LEAVESUB || type == OP_RETURN)
3299 if (type == OP_CONST)
3301 else if (type == OP_PADSV) {
3302 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3303 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3304 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3316 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3319 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3320 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3321 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3330 if (!name || GvCVGEN(gv))
3332 else if (cv = GvCV(gv)) {
3333 cv_ckproto(cv, gv, ps);
3334 /* already defined (or promised)? */
3335 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3338 /* just a "sub foo;" when &foo is already defined */
3342 /* ahem, death to those who redefine active sort subs */
3343 if (curstack == sortstack && sortcop == CvSTART(cv))
3344 croak("Can't redefine active sort subroutine %s", name);
3345 const_sv = cv_const_sv(cv);
3346 if (const_sv || dowarn) {
3347 line_t oldline = curcop->cop_line;
3348 curcop->cop_line = copline;
3349 warn(const_sv ? "Constant subroutine %s redefined"
3350 : "Subroutine %s redefined", name);
3351 curcop->cop_line = oldline;
3357 if (cv) { /* must reuse cv if autoloaded */
3359 CvFLAGS(cv) = CvFLAGS(compcv);
3360 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3361 CvOUTSIDE(compcv) = 0;
3362 CvPADLIST(cv) = CvPADLIST(compcv);
3363 CvPADLIST(compcv) = 0;
3364 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3365 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3366 SvREFCNT_dec(compcv);
3376 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3377 CvFILEGV(cv) = curcop->cop_filegv;
3378 CvSTASH(cv) = curstash;
3381 New(666, CvMUTEXP(cv), 1, perl_mutex);
3382 MUTEX_INIT(CvMUTEXP(cv));
3383 #endif /* USE_THREADS */
3386 sv_setpv((SV*)cv, ps);
3392 char *s = strrchr(name, ':');
3394 if (strEQ(s, "BEGIN")) {
3396 "BEGIN not safe after errors--compilation aborted";
3400 /* force display of errors found but not reported */
3401 sv_catpv(ERRSV, not_safe);
3402 croak("%s", SvPVx(ERRSV, na));
3413 if (AvFILLp(comppad_name) < AvFILLp(comppad))
3414 av_store(comppad_name, AvFILLp(comppad), Nullsv);
3417 SV **namep = AvARRAY(comppad_name);
3418 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3421 if (SvIMMORTAL(curpad[ix]))
3424 * The only things that a clonable function needs in its
3425 * pad are references to outer lexicals and anonymous subs.
3426 * The rest are created anew during cloning.
3428 if (!((namesv = namep[ix]) != Nullsv &&
3429 namesv != &sv_undef &&
3431 *SvPVX(namesv) == '&')))
3433 SvREFCNT_dec(curpad[ix]);
3434 curpad[ix] = Nullsv;
3439 AV *av = newAV(); /* Will be @_ */
3441 av_store(comppad, 0, (SV*)av);
3442 AvFLAGS(av) = AVf_REIFY;
3444 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3445 if (SvIMMORTAL(curpad[ix]))
3447 if (!SvPADMY(curpad[ix]))
3448 SvPADTMP_on(curpad[ix]);
3452 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3453 CvSTART(cv) = LINKLIST(CvROOT(cv));
3454 CvROOT(cv)->op_next = 0;
3460 if (PERLDB_SUBLINE && curstash != debstash) {
3461 SV *sv = NEWSV(0,0);
3462 SV *tmpstr = sv_newmortal();
3463 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3467 sv_setpvf(sv, "%_:%ld-%ld",
3468 GvSV(curcop->cop_filegv),
3469 (long)subline, (long)curcop->cop_line);
3470 gv_efullname3(tmpstr, gv, Nullch);
3471 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3472 hv = GvHVn(db_postponed);
3473 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3474 && (cv = GvCV(db_postponed))) {
3479 perl_call_sv((SV*)cv, G_DISCARD);
3483 if ((s = strrchr(name,':')))
3487 if (strEQ(s, "BEGIN")) {
3488 I32 oldscope = scopestack_ix;
3490 SAVESPTR(compiling.cop_filegv);
3491 SAVEI16(compiling.cop_line);
3498 DEBUG_x( dump_sub(gv) );
3499 av_push(beginav, (SV *)cv);
3501 call_list(oldscope, beginav);
3503 curcop = &compiling;
3506 else if (strEQ(s, "END") && !error_count) {
3509 av_unshift(endav, 1);
3510 av_store(endav, 0, (SV *)cv);
3513 else if (strEQ(s, "INIT") && !error_count) {
3516 av_push(initav, SvREFCNT_inc(cv));
3527 newXS(char *name, void (*subaddr) (CV *), char *filename)
3530 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3533 if (cv = (name ? GvCV(gv) : Nullcv)) {
3535 /* just a cached method */
3539 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3540 /* already defined (or promised) */
3542 line_t oldline = curcop->cop_line;
3543 curcop->cop_line = copline;
3544 warn("Subroutine %s redefined",name);
3545 curcop->cop_line = oldline;
3552 if (cv) /* must reuse cv if autoloaded */
3555 cv = (CV*)NEWSV(1105,0);
3556 sv_upgrade((SV *)cv, SVt_PVCV);
3563 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3565 New(666, CvMUTEXP(cv), 1, perl_mutex);
3566 MUTEX_INIT(CvMUTEXP(cv));
3568 #endif /* USE_THREADS */
3569 CvFILEGV(cv) = gv_fetchfile(filename);
3570 CvXSUB(cv) = subaddr;
3573 char *s = strrchr(name,':');
3578 if (strEQ(s, "BEGIN")) {
3581 av_push(beginav, (SV *)cv);
3584 else if (strEQ(s, "END")) {
3587 av_unshift(endav, 1);
3588 av_store(endav, 0, (SV *)cv);
3591 else if (strEQ(s, "INIT")) {
3594 av_push(initav, (SV *)cv);
3604 newFORM(I32 floor, OP *o, OP *block)
3613 name = SvPVx(cSVOPo->op_sv, na);
3616 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3618 if (cv = GvFORM(gv)) {
3620 line_t oldline = curcop->cop_line;
3622 curcop->cop_line = copline;
3623 warn("Format %s redefined",name);
3624 curcop->cop_line = oldline;
3630 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3631 CvFILEGV(cv) = curcop->cop_filegv;
3633 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3634 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3635 SvPADTMP_on(curpad[ix]);
3638 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3639 CvSTART(cv) = LINKLIST(CvROOT(cv));
3640 CvROOT(cv)->op_next = 0;
3650 return newUNOP(OP_REFGEN, 0,
3651 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3657 return newUNOP(OP_REFGEN, 0,
3658 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3662 newANONSUB(I32 floor, OP *proto, OP *block)
3664 return newUNOP(OP_REFGEN, 0,
3665 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3671 switch (o->op_type) {
3673 o->op_type = OP_PADAV;
3674 o->op_ppaddr = ppaddr[OP_PADAV];
3675 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3678 o->op_type = OP_RV2AV;
3679 o->op_ppaddr = ppaddr[OP_RV2AV];
3684 warn("oops: oopsAV");
3693 switch (o->op_type) {
3696 o->op_type = OP_PADHV;
3697 o->op_ppaddr = ppaddr[OP_PADHV];
3698 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3702 o->op_type = OP_RV2HV;
3703 o->op_ppaddr = ppaddr[OP_RV2HV];
3708 warn("oops: oopsHV");
3717 if (o->op_type == OP_PADANY) {
3718 o->op_type = OP_PADAV;
3719 o->op_ppaddr = ppaddr[OP_PADAV];
3722 return newUNOP(OP_RV2AV, 0, scalar(o));
3726 newGVREF(I32 type, OP *o)
3728 if (type == OP_MAPSTART)
3729 return newUNOP(OP_NULL, 0, o);
3730 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3736 if (o->op_type == OP_PADANY) {
3737 o->op_type = OP_PADHV;
3738 o->op_ppaddr = ppaddr[OP_PADHV];
3741 return newUNOP(OP_RV2HV, 0, scalar(o));
3747 croak("NOT IMPL LINE %d",__LINE__);
3753 newCVREF(I32 flags, OP *o)
3755 return newUNOP(OP_RV2CV, flags, scalar(o));
3761 if (o->op_type == OP_PADANY) {
3762 o->op_type = OP_PADSV;
3763 o->op_ppaddr = ppaddr[OP_PADSV];
3766 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3767 o->op_flags |= OPpDONE_SVREF;
3770 return newUNOP(OP_RV2SV, 0, scalar(o));
3773 /* Check routines. */
3781 name = NEWSV(1106,0);
3782 sv_upgrade(name, SVt_PVNV);
3783 sv_setpvn(name, "&", 1);
3786 ix = pad_alloc(o->op_type, SVs_PADMY);
3787 av_store(comppad_name, ix, name);
3788 av_store(comppad, ix, cSVOPo->op_sv);
3789 SvPADMY_on(cSVOPo->op_sv);
3790 cSVOPo->op_sv = Nullsv;
3791 cSVOPo->op_targ = ix;
3798 o->op_private = hints;
3805 if (cUNOPo->op_first->op_type == OP_CONCAT)
3806 o->op_flags |= OPf_STACKED;
3813 if (o->op_flags & OPf_KIDS) {
3816 OPCODE type = o->op_type;
3817 o = modkids(ck_fun(o), type);
3818 kid = cUNOPo->op_first;
3819 newop = kUNOP->op_first->op_sibling;
3821 (newop->op_sibling ||
3822 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3823 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3824 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3828 op_free(kUNOP->op_first);
3829 kUNOP->op_first = newop;
3831 o->op_ppaddr = ppaddr[++o->op_type];
3840 if (o->op_flags & OPf_KIDS) {
3841 OP *kid = cUNOPo->op_first;
3842 if (kid->op_type == OP_HSLICE)
3843 o->op_private |= OPpSLICE;
3844 else if (kid->op_type != OP_HELEM)
3845 croak("%s argument is not a HASH element or slice",
3846 op_desc[o->op_type]);
3855 I32 type = o->op_type;
3857 if (o->op_flags & OPf_KIDS) {
3858 if (cLISTOPo->op_first->op_type == OP_STUB) {
3860 o = newUNOP(type, OPf_SPECIAL,
3861 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3871 hints |= HINT_BLOCK_SCOPE;
3872 if (o->op_flags & OPf_KIDS) {
3873 SVOP *kid = (SVOP*)cUNOPo->op_first;
3876 o->op_flags &= ~OPf_KIDS;
3879 else if (kid->op_type == OP_LINESEQ) {
3882 kid->op_next = o->op_next;
3883 cUNOPo->op_first = 0;
3886 Newz(1101, enter, 1, LOGOP);
3887 enter->op_type = OP_ENTERTRY;
3888 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3889 enter->op_private = 0;
3891 /* establish postfix order */
3892 enter->op_next = (OP*)enter;
3894 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3895 o->op_type = OP_LEAVETRY;
3896 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3897 enter->op_other = o;
3905 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
3907 o->op_targ = (PADOFFSET)hints;
3915 if (o->op_flags & OPf_STACKED) {
3917 kid = cUNOPo->op_first->op_sibling;
3918 if (kid->op_type == OP_RV2GV)
3930 if (o->op_flags & OPf_KIDS) {
3931 OP *kid = cUNOPo->op_first;
3932 if (kid->op_type != OP_HELEM)
3933 croak("%s argument is not a HASH element", op_desc[o->op_type]);
3940 ck_gvconst(register OP *o)
3942 o = fold_constants(o);
3943 if (o->op_type == OP_CONST)
3949 ck_rvconst(register OP *o)
3952 SVOP *kid = (SVOP*)cUNOPo->op_first;
3954 o->op_private |= (hints & HINT_STRICT_REFS);
3955 if (kid->op_type == OP_CONST) {
3960 name = SvPV(kid->op_sv, na);
3961 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3962 char *badthing = Nullch;
3963 switch (o->op_type) {
3965 badthing = "a SCALAR";
3968 badthing = "an ARRAY";
3971 badthing = "a HASH";
3976 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3979 kid->op_type = OP_GV;
3980 iscv = (o->op_type == OP_RV2CV) * 2;
3981 for (gv = 0; !gv; iscv++) {
3983 * This is a little tricky. We only want to add the symbol if we
3984 * didn't add it in the lexer. Otherwise we get duplicate strict
3985 * warnings. But if we didn't add it in the lexer, we must at
3986 * least pretend like we wanted to add it even if it existed before,
3987 * or we get possible typo warnings. OPpCONST_ENTERED says
3988 * whether the lexer already added THIS instance of this symbol.
3990 gv = gv_fetchpv(name,
3991 iscv | !(kid->op_private & OPpCONST_ENTERED),
3994 : o->op_type == OP_RV2SV
3996 : o->op_type == OP_RV2AV
3998 : o->op_type == OP_RV2HV
4002 SvREFCNT_dec(kid->op_sv);
4003 kid->op_sv = SvREFCNT_inc(gv);
4012 I32 type = o->op_type;
4014 if (o->op_flags & OPf_REF)
4017 if (o->op_flags & OPf_KIDS) {
4018 SVOP *kid = (SVOP*)cUNOPo->op_first;
4020 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4021 OP *newop = newGVOP(type, OPf_REF,
4022 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4029 if (type == OP_FTTTY)
4030 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4033 return newUNOP(type, 0, newDEFSVOP());
4046 int type = o->op_type;
4047 register I32 oa = opargs[type] >> OASHIFT;
4049 if (o->op_flags & OPf_STACKED) {
4050 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4053 return no_fh_allowed(o);
4056 if (o->op_flags & OPf_KIDS) {
4057 tokid = &cLISTOPo->op_first;
4058 kid = cLISTOPo->op_first;
4059 if (kid->op_type == OP_PUSHMARK ||
4060 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4062 tokid = &kid->op_sibling;
4063 kid = kid->op_sibling;
4065 if (!kid && opargs[type] & OA_DEFGV)
4066 *tokid = kid = newDEFSVOP();
4070 sibl = kid->op_sibling;
4084 if (kid->op_type == OP_CONST &&
4085 (kid->op_private & OPpCONST_BARE)) {
4086 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4087 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4088 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4090 warn("Array @%s missing the @ in argument %ld of %s()",
4091 name, (long)numargs, op_desc[type]);
4094 kid->op_sibling = sibl;
4097 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4098 bad_type(numargs, "array", op_desc[o->op_type], kid);
4102 if (kid->op_type == OP_CONST &&
4103 (kid->op_private & OPpCONST_BARE)) {
4104 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4105 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4106 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4108 warn("Hash %%%s missing the %% in argument %ld of %s()",
4109 name, (long)numargs, op_desc[type]);
4112 kid->op_sibling = sibl;
4115 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4116 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4121 OP *newop = newUNOP(OP_NULL, 0, kid);
4122 kid->op_sibling = 0;
4124 newop->op_next = newop;
4126 kid->op_sibling = sibl;
4131 if (kid->op_type != OP_GV) {
4132 if (kid->op_type == OP_CONST &&
4133 (kid->op_private & OPpCONST_BARE)) {
4134 OP *newop = newGVOP(OP_GV, 0,
4135 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4141 kid->op_sibling = 0;
4142 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4144 kid->op_sibling = sibl;
4150 mod(scalar(kid), type);
4154 tokid = &kid->op_sibling;
4155 kid = kid->op_sibling;
4157 o->op_private |= numargs;
4159 return too_many_arguments(o,op_desc[o->op_type]);
4162 else if (opargs[type] & OA_DEFGV) {
4164 return newUNOP(type, 0, newDEFSVOP());
4168 while (oa & OA_OPTIONAL)
4170 if (oa && oa != OA_LIST)
4171 return too_few_arguments(o,op_desc[o->op_type]);
4181 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4182 append_elem(OP_GLOB, o, newDEFSVOP());
4184 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4185 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4187 if (gv && GvIMPORTED_CV(gv)) {
4188 static int glob_index;
4190 append_elem(OP_GLOB, o,
4191 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4192 o->op_type = OP_LIST;
4193 o->op_ppaddr = ppaddr[OP_LIST];
4194 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4195 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4196 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4197 append_elem(OP_LIST, o,
4198 scalar(newUNOP(OP_RV2CV, 0,
4199 newGVOP(OP_GV, 0, gv)))));
4200 o = newUNOP(OP_NULL, 0, ck_subr(o));
4201 o->op_targ = OP_GLOB; /* hint at what it used to be */
4204 gv = newGVgen("main");
4206 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4216 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4218 o->op_ppaddr = ppaddr[OP_GREPSTART];
4219 Newz(1101, gwop, 1, LOGOP);
4221 if (o->op_flags & OPf_STACKED) {
4224 kid = cLISTOPo->op_first->op_sibling;
4225 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4228 kid->op_next = (OP*)gwop;
4229 o->op_flags &= ~OPf_STACKED;
4231 kid = cLISTOPo->op_first->op_sibling;
4232 if (type == OP_MAPWHILE)
4239 kid = cLISTOPo->op_first->op_sibling;
4240 if (kid->op_type != OP_NULL)
4241 croak("panic: ck_grep");
4242 kid = kUNOP->op_first;
4244 gwop->op_type = type;
4245 gwop->op_ppaddr = ppaddr[type];
4246 gwop->op_first = listkids(o);
4247 gwop->op_flags |= OPf_KIDS;
4248 gwop->op_private = 1;
4249 gwop->op_other = LINKLIST(kid);
4250 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4251 kid->op_next = (OP*)gwop;
4253 kid = cLISTOPo->op_first->op_sibling;
4254 if (!kid || !kid->op_sibling)
4255 return too_few_arguments(o,op_desc[o->op_type]);
4256 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4257 mod(kid, OP_GREPSTART);
4265 if (o->op_flags & OPf_KIDS) {
4266 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4267 if (kid && kid->op_type == OP_CONST)
4268 fbm_compile(((SVOP*)kid)->op_sv);
4274 ck_lengthconst(OP *o)
4276 /* XXX length optimization goes here */
4283 OPCODE type = o->op_type;
4284 return modkids(ck_fun(o), type);
4290 OPCODE type = o->op_type;
4291 return refkids(ck_fun(o), type);
4299 kid = cLISTOPo->op_first;
4302 kid = cLISTOPo->op_first;
4304 if (kid->op_type == OP_PUSHMARK)
4305 kid = kid->op_sibling;
4306 if (kid && o->op_flags & OPf_STACKED)
4307 kid = kid->op_sibling;
4308 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4309 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4310 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4311 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4312 cLISTOPo->op_first->op_sibling = kid;
4313 cLISTOPo->op_last = kid;
4314 kid = kid->op_sibling;
4319 append_elem(o->op_type, o, newDEFSVOP());
4325 if (hints & HINT_LOCALE)
4326 o->op_private |= OPpLOCALE;
4333 ck_fun_locale(OP *o)
4339 if (hints & HINT_LOCALE)
4340 o->op_private |= OPpLOCALE;
4351 if (hints & HINT_LOCALE)
4352 o->op_private |= OPpLOCALE;
4361 o->op_private |= OPpRUNTIME;
4374 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4375 o->op_private |= OPpREPEAT_DOLIST;
4376 cBINOPo->op_first = force_list(cBINOPo->op_first);
4386 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4387 SVOP *kid = (SVOP*)cUNOPo->op_first;
4389 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4391 for (s = SvPVX(kid->op_sv); *s; s++) {
4392 if (*s == ':' && s[1] == ':') {
4394 Move(s+2, s+1, strlen(s+2)+1, char);
4395 --SvCUR(kid->op_sv);
4398 sv_catpvn(kid->op_sv, ".pm", 3);
4407 croak("NOT IMPL LINE %d",__LINE__);
4416 if (o->op_flags & OPf_KIDS) {
4417 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4418 if (kid && kid->op_sibling) {
4419 o->op_type = OP_SSELECT;
4420 o->op_ppaddr = ppaddr[OP_SSELECT];
4422 return fold_constants(o);
4426 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4427 if (kid && kid->op_type == OP_RV2GV)
4428 kid->op_private &= ~HINT_STRICT_REFS;
4435 I32 type = o->op_type;
4437 if (!(o->op_flags & OPf_KIDS)) {
4442 if (!CvUNIQUE(compcv)) {
4443 argop = newOP(OP_PADAV, OPf_REF);
4444 argop->op_targ = 0; /* curpad[0] is @_ */
4447 argop = newUNOP(OP_RV2AV, 0,
4448 scalar(newGVOP(OP_GV, 0,
4449 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4452 argop = newUNOP(OP_RV2AV, 0,
4453 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(compcv) ?
4454 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4455 #endif /* USE_THREADS */
4456 return newUNOP(type, 0, scalar(argop));
4458 return scalar(modkids(ck_fun(o), type));
4466 if (hints & HINT_LOCALE)
4467 o->op_private |= OPpLOCALE;
4470 if (o->op_flags & OPf_STACKED) {
4471 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4473 kid = kUNOP->op_first; /* get past rv2gv */
4475 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4477 if (kid->op_type == OP_SCOPE) {
4481 else if (kid->op_type == OP_LEAVE) {
4482 if (o->op_type == OP_SORT) {
4483 null(kid); /* wipe out leave */
4486 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4487 if (k->op_next == kid)
4492 kid->op_next = 0; /* just disconnect the leave */
4493 k = kLISTOP->op_first;
4497 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4498 null(kid); /* wipe out rv2gv */
4499 if (o->op_type == OP_SORT)
4503 o->op_flags |= OPf_SPECIAL;
4515 if (o->op_flags & OPf_STACKED)
4516 return no_fh_allowed(o);
4518 kid = cLISTOPo->op_first;
4519 if (kid->op_type != OP_NULL)
4520 croak("panic: ck_split");
4521 kid = kid->op_sibling;
4522 op_free(cLISTOPo->op_first);
4523 cLISTOPo->op_first = kid;
4525 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4526 cLISTOPo->op_last = kid; /* There was only one element previously */
4529 if (kid->op_type != OP_MATCH) {
4530 OP *sibl = kid->op_sibling;
4531 kid->op_sibling = 0;
4532 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4533 if (cLISTOPo->op_first == cLISTOPo->op_last)
4534 cLISTOPo->op_last = kid;
4535 cLISTOPo->op_first = kid;
4536 kid->op_sibling = sibl;
4539 kid->op_type = OP_PUSHRE;
4540 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4543 if (!kid->op_sibling)
4544 append_elem(OP_SPLIT, o, newDEFSVOP());
4546 kid = kid->op_sibling;
4549 if (!kid->op_sibling)
4550 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4552 kid = kid->op_sibling;
4555 if (kid->op_sibling)
4556 return too_many_arguments(o,op_desc[o->op_type]);
4565 OP *prev = ((cUNOPo->op_first->op_sibling)
4566 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4567 OP *o2 = prev->op_sibling;
4575 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4576 if (cvop->op_type == OP_RV2CV) {
4578 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4579 null(cvop); /* disable rv2cv */
4580 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4581 if (tmpop->op_type == OP_GV) {
4582 cv = GvCVu(tmpop->op_sv);
4583 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4584 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4585 proto = SvPV((SV*)cv, na);
4589 o->op_private |= (hints & HINT_STRICT_REFS);
4590 if (PERLDB_SUB && curstash != debstash)
4591 o->op_private |= OPpENTERSUB_DB;
4592 while (o2 != cvop) {
4596 return too_many_arguments(o, gv_ename(namegv));
4614 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4615 bad_type(arg, "block", gv_ename(namegv), o2);
4620 if (o2->op_type == OP_RV2GV)
4624 OP* sib = kid->op_sibling;
4625 kid->op_sibling = 0;
4626 o2 = newUNOP(OP_RV2GV, 0, kid);
4627 o2->op_sibling = sib;
4628 prev->op_sibling = o2;
4636 if (o2->op_type != OP_RV2GV)
4637 bad_type(arg, "symbol", gv_ename(namegv), o2);
4640 if (o2->op_type != OP_RV2CV)
4641 bad_type(arg, "sub", gv_ename(namegv), o2);
4644 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4645 bad_type(arg, "scalar", gv_ename(namegv), o2);
4648 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4649 bad_type(arg, "array", gv_ename(namegv), o2);
4652 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4653 bad_type(arg, "hash", gv_ename(namegv), o2);
4657 OP* sib = kid->op_sibling;
4658 kid->op_sibling = 0;
4659 o2 = newUNOP(OP_REFGEN, 0, kid);
4660 o2->op_sibling = sib;
4661 prev->op_sibling = o2;
4672 croak("Malformed prototype for %s: %s",
4673 gv_ename(namegv), SvPV((SV*)cv, na));
4678 mod(o2, OP_ENTERSUB);
4680 o2 = o2->op_sibling;
4682 if (proto && !optional &&
4683 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4684 return too_few_arguments(o, gv_ename(namegv));
4691 SvREADONLY_on(cSVOPo->op_sv);
4698 if (o->op_flags & OPf_KIDS) {
4699 SVOP *kid = (SVOP*)cUNOPo->op_first;
4701 if (kid->op_type == OP_NULL)
4702 kid = (SVOP*)kid->op_sibling;
4704 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4705 o->op_flags |= OPf_SPECIAL;
4710 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4713 peep(register OP *o)
4716 register OP* oldop = 0;
4717 if (!o || o->op_seq)
4722 for (; o; o = o->op_next) {
4728 switch (o->op_type) {
4731 curcop = ((COP*)o); /* for warnings */
4732 o->op_seq = op_seqmax++;
4743 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
4745 o->op_seq = op_seqmax++;
4748 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4749 o->op_seq = op_seqmax++;
4750 break; /* Scalar stub must produce undef. List stub is noop */
4754 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4755 curcop = ((COP*)op);
4761 if (oldop && o->op_next) {
4762 oldop->op_next = o->op_next;
4765 o->op_seq = op_seqmax++;
4769 if (o->op_next->op_type == OP_RV2SV) {
4770 if (!(o->op_next->op_private & OPpDEREF)) {
4772 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4773 o->op_next = o->op_next->op_next;
4774 o->op_type = OP_GVSV;
4775 o->op_ppaddr = ppaddr[OP_GVSV];
4778 else if (o->op_next->op_type == OP_RV2AV) {
4779 OP* pop = o->op_next->op_next;
4781 if (pop->op_type == OP_CONST &&
4782 (op = pop->op_next) &&
4783 pop->op_next->op_type == OP_AELEM &&
4784 !(pop->op_next->op_private &
4785 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4786 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4790 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4794 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4795 o->op_next = pop->op_next->op_next;
4796 o->op_type = OP_AELEMFAST;
4797 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4798 o->op_private = (U8)i;
4799 GvAVn(((GVOP*)o)->op_gv);
4802 o->op_seq = op_seqmax++;
4806 if (o->op_next->op_type == OP_RV2AV
4807 && (o->op_next->op_flags && OPf_REF))
4810 o->op_next = o->op_next->op_next;
4815 if (o->op_next->op_type == OP_RV2HV
4816 && (o->op_next->op_flags && OPf_REF))
4819 o->op_next = o->op_next->op_next;
4827 o->op_seq = op_seqmax++;
4828 while (cLOGOP->op_other->op_type == OP_NULL)
4829 cLOGOP->op_other = cLOGOP->op_other->op_next;
4830 peep(cLOGOP->op_other);
4834 o->op_seq = op_seqmax++;
4835 peep(cCONDOP->op_true);
4836 peep(cCONDOP->op_false);
4840 o->op_seq = op_seqmax++;
4841 peep(cLOOP->op_redoop);
4842 peep(cLOOP->op_nextop);
4843 peep(cLOOP->op_lastop);
4848 o->op_seq = op_seqmax++;
4849 peep(cPMOP->op_pmreplstart);
4853 o->op_seq = op_seqmax++;
4854 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4855 if (o->op_next->op_sibling &&
4856 o->op_next->op_sibling->op_type != OP_DIE) {
4857 line_t oldline = curcop->cop_line;
4859 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4860 warn("Statement unlikely to be reached");
4861 warn("(Maybe you meant system() when you said exec()?)\n");
4862 curcop->cop_line = oldline;
4876 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4877 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4879 rop = (UNOP*)((BINOP*)o)->op_first;
4880 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4882 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4883 if (!SvOBJECT(lexname))
4885 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4886 if (!fields || !GvHV(*fields))
4888 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4889 key = SvPV(*svp, keylen);
4890 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4892 croak("No such field \"%s\" in variable %s of type %s",
4893 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4895 ind = SvIV(*indsvp);
4897 croak("Bad index while coercing array into hash");
4898 rop->op_type = OP_RV2AV;
4899 rop->op_ppaddr = ppaddr[OP_RV2AV];
4900 o->op_type = OP_AELEM;
4901 o->op_ppaddr = ppaddr[OP_AELEM];
4903 *svp = newSViv(ind);
4908 o->op_seq = op_seqmax++;