3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
22 * In the following definition, the ", Nullop" is just to make the compiler
23 * think the expression is of the right type: croak actually does a Siglongjmp.
25 #define CHECKOP(type,o) \
26 ((op_mask && op_mask[type]) \
27 ? ( op_free((OP*)o), \
28 croak("%s trapped by operation mask", op_desc[type]), \
30 : (*check[type])((OP*)o))
32 static I32 list_assignment _((OP *o));
33 static void bad_type _((I32 n, char *t, char *name, OP *kid));
34 static OP *modkids _((OP *o, I32 type));
35 static OP *no_fh_allowed _((OP *o));
36 static bool scalar_mod_type _((OP *o, I32 type));
37 static OP *scalarboolean _((OP *o));
38 static OP *too_few_arguments _((OP *o, char* name));
39 static OP *too_many_arguments _((OP *o, char* name));
40 static void null _((OP* o));
41 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
42 CV* startcv, I32 cx_ix));
47 SV* tmpsv = sv_newmortal();
48 gv_efullname3(tmpsv, gv, Nullch);
49 return SvPV(tmpsv,na);
55 yyerror(form("Missing comma after first argument to %s function",
56 op_desc[o->op_type]));
61 too_few_arguments(OP *o, char *name)
63 yyerror(form("Not enough arguments for %s", name));
68 too_many_arguments(OP *o, char *name)
70 yyerror(form("Too many arguments for %s", name));
75 bad_type(I32 n, char *t, char *name, OP *kid)
77 yyerror(form("Type of arg %d to %s must be %s (not %s)",
78 (int)n, name, t, op_desc[kid->op_type]));
84 int type = o->op_type;
85 if (type != OP_AELEM && type != OP_HELEM) {
86 yyerror(form("Can't use subscript on %s", op_desc[type]));
87 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV)
88 warn("(Did you mean $ or @ instead of %c?)\n",
89 type == OP_ENTERSUB ? '&' : '%');
93 /* "register" allocation */
96 pad_allocmy(char *name)
102 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
103 if (!isPRINT(name[1])) {
105 name[2] = toCTRL(name[1]);
108 croak("Can't use global %s in \"my\"",name);
110 if (dowarn && AvFILL(comppad_name) >= 0) {
111 SV **svp = AvARRAY(comppad_name);
112 for (off = AvFILL(comppad_name); off > comppad_name_floor; off--) {
115 && SvIVX(sv) == 999999999 /* var is in open scope */
116 && strEQ(name, SvPVX(sv)))
118 warn("\"my\" variable %s masks earlier declaration in same scope", name);
123 off = pad_alloc(OP_PADSV, SVs_PADMY);
125 sv_upgrade(sv, SVt_PVNV);
129 croak("Can't declare class for non-scalar %s in \"my\"",name);
131 (void)SvUPGRADE(sv, SVt_PVMG);
132 SvSTASH(sv) = (HV*)SvREFCNT_inc(in_my_stash);
135 av_store(comppad_name, off, sv);
136 SvNVX(sv) = (double)999999999;
137 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
138 if (!min_intro_pending)
139 min_intro_pending = off;
140 max_intro_pending = off;
142 av_store(comppad, off, (SV*)newAV());
143 else if (*name == '%')
144 av_store(comppad, off, (SV*)newHV());
145 SvPADMY_on(curpad[off]);
150 #ifndef CAN_PROTOTYPE
151 pad_findlex(name, newoff, seq, startcv, cx_ix)
158 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
166 register PERL_CONTEXT *cx;
169 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
170 AV *curlist = CvPADLIST(cv);
171 SV **svp = av_fetch(curlist, 0, FALSE);
174 if (!svp || *svp == &sv_undef)
177 svp = AvARRAY(curname);
178 for (off = AvFILL(curname); off > 0; off--) {
179 if ((sv = svp[off]) &&
182 seq > I_32(SvNVX(sv)) &&
183 strEQ(SvPVX(sv), name))
194 return 0; /* don't clone from inactive stack frame */
198 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
199 oldsv = *av_fetch(oldpad, off, TRUE);
200 if (!newoff) { /* Not a mere clone operation. */
201 SV *namesv = NEWSV(1103,0);
202 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
203 sv_upgrade(namesv, SVt_PVNV);
204 sv_setpv(namesv, name);
205 av_store(comppad_name, newoff, namesv);
206 SvNVX(namesv) = (double)curcop->cop_seq;
207 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
208 SvFAKE_on(namesv); /* A ref, not a real var */
209 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
210 /* "It's closures all the way down." */
214 oldsv = Nullsv; /* no need to keep ref */
219 bcv && bcv != cv && !CvCLONE(bcv);
220 bcv = CvOUTSIDE(bcv)) {
224 if (dowarn && !CvUNIQUE(cv))
226 "Variable \"%s\" may be unavailable",
233 else if (!CvUNIQUE(compcv)) {
234 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
235 warn("Variable \"%s\" will not stay shared", name);
238 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
244 /* Nothing in current lexical context--try eval's context, if any.
245 * This is necessary to let the perldb get at lexically scoped variables.
246 * XXX This will also probably interact badly with eval tree caching.
250 for (i = cx_ix; i >= 0; i--) {
252 switch (cx->cx_type) {
254 if (i == 0 && saweval) {
255 seq = cxstack[saweval].blk_oldcop->cop_seq;
256 return pad_findlex(name, newoff, seq, main_cv, 0);
260 switch (cx->blk_eval.old_op_type) {
265 /* require must have its own scope */
273 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
274 saweval = i; /* so we know where we were called from */
277 seq = cxstack[saweval].blk_oldcop->cop_seq;
278 return pad_findlex(name, newoff, seq, cv, i-1);
286 pad_findmy(char *name)
292 SV **svp = AvARRAY(comppad_name);
293 U32 seq = cop_seqmax;
297 * Special case to get lexical (and hence per-thread) @_.
298 * XXX I need to find out how to tell at parse-time whether use
299 * of @_ should refer to a lexical (from a sub) or defgv (global
300 * scope and maybe weird sub-ish things like formats). See
301 * startsub in perly.y. It's possible that @_ could be lexical
302 * (at least from subs) even in non-threaded perl.
304 if (strEQ(name, "@_"))
305 return 0; /* success. (NOT_IN_PAD indicates failure) */
306 #endif /* USE_THREADS */
308 /* The one we're looking for is probably just before comppad_name_fill. */
309 for (off = AvFILL(comppad_name); off > 0; off--) {
310 if ((sv = svp[off]) &&
314 seq > I_32(SvNVX(sv)))) &&
315 strEQ(SvPVX(sv), name))
318 return (PADOFFSET)off;
319 pendoff = off; /* this pending def. will override import */
323 /* See if it's in a nested scope */
324 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
326 /* If there is a pending local definition, this new alias must die */
328 SvIVX(AvARRAY(comppad_name)[off]) = seq;
329 return off; /* pad_findlex returns 0 for failure...*/
331 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
335 pad_leavemy(I32 fill)
338 SV **svp = AvARRAY(comppad_name);
340 if (min_intro_pending && fill < min_intro_pending) {
341 for (off = max_intro_pending; off >= min_intro_pending; off--) {
342 if ((sv = svp[off]) && sv != &sv_undef)
343 warn("%s never introduced", SvPVX(sv));
346 /* "Deintroduce" my variables that are leaving with this scope. */
347 for (off = AvFILL(comppad_name); off > fill; off--) {
348 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
349 SvIVX(sv) = cop_seqmax;
354 pad_alloc(I32 optype, U32 tmptype)
360 if (AvARRAY(comppad) != curpad)
361 croak("panic: pad_alloc");
362 if (pad_reset_pending)
364 if (tmptype & SVs_PADMY) {
366 sv = *av_fetch(comppad, AvFILL(comppad) + 1, TRUE);
367 } while (SvPADBUSY(sv)); /* need a fresh one */
368 retval = AvFILL(comppad);
371 SV **names = AvARRAY(comppad_name);
372 SSize_t names_fill = AvFILL(comppad_name);
375 * "foreach" index vars temporarily become aliases to non-"my"
376 * values. Thus we must skip, not just pad values that are
377 * marked as current pad values, but also those with names.
379 if (++padix <= names_fill &&
380 (sv = names[padix]) && sv != &sv_undef)
382 sv = *av_fetch(comppad, padix, TRUE);
383 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
388 SvFLAGS(sv) |= tmptype;
389 curpad = AvARRAY(comppad);
391 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
392 (unsigned long) thr, (unsigned long) curpad,
393 (long) retval, op_name[optype]));
395 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad alloc %ld for %s\n",
396 (long) retval, op_name[optype]));
397 #endif /* USE_THREADS */
398 return (PADOFFSET)retval;
402 #ifndef CAN_PROTOTYPE
407 #endif /* CAN_PROTOTYPE */
411 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
412 (unsigned long) thr, (unsigned long) curpad, po));
415 croak("panic: pad_sv po");
416 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad sv %d\n", po));
417 #endif /* USE_THREADS */
418 return curpad[po]; /* eventually we'll turn this into a macro */
422 #ifndef CAN_PROTOTYPE
426 pad_free(PADOFFSET po)
427 #endif /* CAN_PROTOTYPE */
432 if (AvARRAY(comppad) != curpad)
433 croak("panic: pad_free curpad");
435 croak("panic: pad_free po");
437 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
438 (unsigned long) thr, (unsigned long) curpad, po));
440 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad free %d\n", po));
441 #endif /* USE_THREADS */
442 if (curpad[po] && curpad[po] != &sv_undef)
443 SvPADTMP_off(curpad[po]);
449 #ifndef CAN_PROTOTYPE
453 pad_swipe(PADOFFSET po)
454 #endif /* CAN_PROTOTYPE */
457 if (AvARRAY(comppad) != curpad)
458 croak("panic: pad_swipe curpad");
460 croak("panic: pad_swipe po");
462 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
463 (unsigned long) thr, (unsigned long) curpad, po));
465 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad swipe %d\n", po));
466 #endif /* USE_THREADS */
467 SvPADTMP_off(curpad[po]);
468 curpad[po] = NEWSV(1107,0);
469 SvPADTMP_on(curpad[po]);
480 if (AvARRAY(comppad) != curpad)
481 croak("panic: pad_reset curpad");
483 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
484 (unsigned long) thr, (unsigned long) curpad));
486 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad reset\n"));
487 #endif /* USE_THREADS */
488 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
489 for (po = AvMAX(comppad); po > padix_floor; po--) {
490 if (curpad[po] && !SvIMMORTAL(curpad[po]))
491 SvPADTMP_off(curpad[po]);
495 pad_reset_pending = FALSE;
499 /* find_thread_magical is not reentrant */
501 find_thread_magical(char *name)
507 /* We currently only handle single character magicals */
508 p = strchr(per_thread_magicals, *name);
511 key = p - per_thread_magicals;
512 svp = av_fetch(thr->magicals, key, FALSE);
514 SV *sv = NEWSV(0, 0);
515 av_store(thr->magicals, key, sv);
517 * Some magic variables used to be automagically initialised
518 * in gv_fetchpv. Those which are now per-thread magicals get
519 * initialised here instead.
523 sv_setpv(sv, "\034");
526 sv_magic(sv, 0, 0, name, 1);
527 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
528 "find_thread_magical: new SV %p for $%s%c\n",
529 sv, (*name < 32) ? "^" : "",
530 (*name < 32) ? toCTRL(*name) : *name));
534 #endif /* USE_THREADS */
541 register OP *kid, *nextkid;
543 if (!o || o->op_seq == (U16)-1)
546 if (o->op_flags & OPf_KIDS) {
547 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
548 nextkid = kid->op_sibling; /* Get before next freeing kid */
553 switch (o->op_type) {
555 o->op_targ = 0; /* Was holding old type, if any. */
558 o->op_targ = 0; /* Was holding hints. */
562 o->op_targ = 0; /* Was holding index into thr->magicals AV. */
564 #endif /* USE_THREADS */
566 if (!(o->op_flags & OPf_REF) || (check[o->op_type] != ck_ftst))
572 SvREFCNT_dec(cGVOPo->op_gv);
576 Safefree(cCOPo->cop_label);
577 SvREFCNT_dec(cCOPo->cop_filegv);
580 SvREFCNT_dec(cSVOPo->op_sv);
586 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
590 Safefree(cPVOPo->op_pv);
593 op_free(cPMOPo->op_pmreplroot);
597 pregfree(cPMOPo->op_pmregexp);
598 SvREFCNT_dec(cPMOPo->op_pmshort);
603 pad_free(o->op_targ);
611 if (o->op_type != OP_NULL && o->op_targ > 0)
612 pad_free(o->op_targ);
613 o->op_targ = o->op_type;
614 o->op_type = OP_NULL;
615 o->op_ppaddr = ppaddr[OP_NULL];
618 /* Contextualizers */
620 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
630 /* establish postfix order */
631 if (cUNOPo->op_first) {
632 o->op_next = LINKLIST(cUNOPo->op_first);
633 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
635 kid->op_next = LINKLIST(kid->op_sibling);
650 if (o && o->op_flags & OPf_KIDS) {
651 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
661 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
663 line_t oldline = curcop->cop_line;
665 if (copline != NOLINE)
666 curcop->cop_line = copline;
667 warn("Found = in conditional, should be ==");
668 curcop->cop_line = oldline;
678 /* assumes no premature commitment */
679 if (!o || (o->op_flags & OPf_WANT) || error_count
680 || o->op_type == OP_RETURN)
683 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
685 switch (o->op_type) {
687 if (o->op_private & OPpREPEAT_DOLIST)
688 null(((LISTOP*)cBINOPo->op_first)->op_first);
689 scalar(cBINOPo->op_first);
694 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
698 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
699 if (!kPMOP->op_pmreplroot)
700 deprecate("implicit split to @_");
707 if (o->op_flags & OPf_KIDS) {
708 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
714 kid = cLISTOPo->op_first;
716 while (kid = kid->op_sibling) {
722 WITH_THR(curcop = &compiling);
727 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
733 WITH_THR(curcop = &compiling);
746 /* assumes no premature commitment */
747 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
748 || o->op_type == OP_RETURN)
751 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
753 switch (o->op_type) {
755 if (!(opargs[o->op_type] & OA_FOLDCONST))
759 if (o->op_flags & OPf_STACKED)
830 if (!(o->op_private & OPpLVAL_INTRO))
831 useless = op_desc[o->op_type];
838 if (!(o->op_private & OPpLVAL_INTRO) &&
839 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
840 useless = "a variable";
845 WITH_THR(curcop = ((COP*)o)); /* for warning below */
851 useless = "a constant";
852 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
854 else if (SvPOK(sv)) {
855 if (strnEQ(SvPVX(sv), "di", 2) ||
856 strnEQ(SvPVX(sv), "ds", 2) ||
857 strnEQ(SvPVX(sv), "ig", 2))
861 null(o); /* don't execute a constant */
862 SvREFCNT_dec(sv); /* don't even remember it */
866 o->op_type = OP_PREINC; /* pre-increment is faster */
867 o->op_ppaddr = ppaddr[OP_PREINC];
871 o->op_type = OP_PREDEC; /* pre-decrement is faster */
872 o->op_ppaddr = ppaddr[OP_PREDEC];
878 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
883 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
884 WITH_THR(curcop = ((COP*)o)); /* for warning below */
885 if (o->op_flags & OPf_STACKED)
891 if (!(o->op_flags & OPf_KIDS))
900 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
907 /* all requires must return a boolean value */
908 o->op_flags &= ~OPf_WANT;
911 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
912 if (!kPMOP->op_pmreplroot)
913 deprecate("implicit split to @_");
917 if (useless && dowarn)
918 warn("Useless use of %s in void context", useless);
926 if (o && o->op_flags & OPf_KIDS) {
927 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
938 /* assumes no premature commitment */
939 if (!o || (o->op_flags & OPf_WANT) || error_count
940 || o->op_type == OP_RETURN)
943 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
945 switch (o->op_type) {
948 list(cBINOPo->op_first);
953 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
960 if (!(o->op_flags & OPf_KIDS))
962 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
963 list(cBINOPo->op_first);
964 return gen_constant_list(o);
971 kid = cLISTOPo->op_first;
973 while (kid = kid->op_sibling) {
979 WITH_THR(curcop = &compiling);
983 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
989 WITH_THR(curcop = &compiling);
992 /* all requires must return a boolean value */
993 o->op_flags &= ~OPf_WANT;
1005 if (o->op_type == OP_LINESEQ ||
1006 o->op_type == OP_SCOPE ||
1007 o->op_type == OP_LEAVE ||
1008 o->op_type == OP_LEAVETRY)
1011 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1012 if (kid->op_sibling) {
1016 curcop = &compiling;
1018 o->op_flags &= ~OPf_PARENS;
1019 if (hints & HINT_BLOCK_SCOPE)
1020 o->op_flags |= OPf_PARENS;
1023 o = newOP(OP_STUB, 0);
1028 modkids(OP *o, I32 type)
1031 if (o && o->op_flags & OPf_KIDS) {
1032 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1038 static I32 modcount;
1041 mod(OP *o, I32 type)
1047 if (!o || error_count)
1050 switch (o->op_type) {
1055 if (!(o->op_private & (OPpCONST_ARYBASE)))
1057 if (eval_start && eval_start->op_type == OP_CONST) {
1058 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1062 SAVEI32(compiling.cop_arybase);
1063 compiling.cop_arybase = 0;
1065 else if (type == OP_REFGEN)
1068 croak("That use of $[ is unsupported");
1071 if (o->op_flags & OPf_PARENS)
1075 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1076 !(o->op_flags & OPf_STACKED)) {
1077 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1078 o->op_ppaddr = ppaddr[OP_RV2CV];
1079 assert(cUNOPo->op_first->op_type == OP_NULL);
1080 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1086 /* grep, foreach, subcalls, refgen */
1087 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1089 yyerror(form("Can't modify %s in %s",
1090 op_desc[o->op_type],
1091 type ? op_desc[type] : "local"));
1105 case OP_RIGHT_SHIFT:
1114 if (!(o->op_flags & OPf_STACKED))
1120 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1126 if (!type && cUNOPo->op_first->op_type != OP_GV)
1127 croak("Can't localize through a reference");
1128 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1130 return o; /* Treat \(@foo) like ordinary list. */
1134 if (scalar_mod_type(o, type))
1136 ref(cUNOPo->op_first, o->op_type);
1148 if (!type && cUNOPo->op_first->op_type != OP_GV)
1149 croak("Can't localize through a reference");
1150 ref(cUNOPo->op_first, o->op_type);
1162 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1163 return o; /* Treat \(@foo) like ordinary list. */
1164 if (scalar_mod_type(o, type))
1170 croak("Can't localize lexical variable %s",
1171 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1176 modcount++; /* XXX ??? */
1178 #endif /* USE_THREADS */
1184 if (type != OP_SASSIGN)
1190 pad_free(o->op_targ);
1191 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1192 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1193 if (o->op_flags & OPf_KIDS)
1194 mod(cBINOPo->op_first->op_sibling, type);
1199 ref(cBINOPo->op_first, o->op_type);
1200 if (type == OP_ENTERSUB &&
1201 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1202 o->op_private |= OPpLVAL_DEFER;
1209 if (o->op_flags & OPf_KIDS)
1210 mod(cLISTOPo->op_last, type);
1214 if (!(o->op_flags & OPf_KIDS))
1216 if (o->op_targ != OP_LIST) {
1217 mod(cBINOPo->op_first, type);
1222 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1226 o->op_flags |= OPf_MOD;
1228 if (type == OP_AASSIGN || type == OP_SASSIGN)
1229 o->op_flags |= OPf_SPECIAL|OPf_REF;
1231 o->op_private |= OPpLVAL_INTRO;
1232 o->op_flags &= ~OPf_SPECIAL;
1234 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1235 o->op_flags |= OPf_REF;
1240 scalar_mod_type(OP *o, I32 type)
1244 if (o->op_type == OP_RV2GV)
1268 case OP_RIGHT_SHIFT:
1275 case OP_ANDASSIGN: /* may work later */
1276 case OP_ORASSIGN: /* may work later */
1284 refkids(OP *o, I32 type)
1287 if (o && o->op_flags & OPf_KIDS) {
1288 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1295 ref(OP *o, I32 type)
1299 if (!o || error_count)
1302 switch (o->op_type) {
1304 if ((type == OP_DEFINED || type == OP_LOCK) &&
1305 !(o->op_flags & OPf_STACKED)) {
1306 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1307 o->op_ppaddr = ppaddr[OP_RV2CV];
1308 assert(cUNOPo->op_first->op_type == OP_NULL);
1309 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1310 o->op_flags |= OPf_SPECIAL;
1315 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1319 ref(cUNOPo->op_first, o->op_type);
1322 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1323 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1324 : type == OP_RV2HV ? OPpDEREF_HV
1326 o->op_flags |= OPf_MOD;
1331 o->op_flags |= OPf_MOD; /* XXX ??? */
1336 o->op_flags |= OPf_REF;
1339 ref(cUNOPo->op_first, o->op_type);
1344 o->op_flags |= OPf_REF;
1349 if (!(o->op_flags & OPf_KIDS))
1351 ref(cBINOPo->op_first, type);
1355 ref(cBINOPo->op_first, o->op_type);
1356 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1357 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1358 : type == OP_RV2HV ? OPpDEREF_HV
1360 o->op_flags |= OPf_MOD;
1368 if (!(o->op_flags & OPf_KIDS))
1370 ref(cLISTOPo->op_last, type);
1385 if (!o || error_count)
1389 if (type == OP_LIST) {
1390 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1393 else if (type != OP_PADSV &&
1396 type != OP_PUSHMARK)
1398 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1401 o->op_flags |= OPf_MOD;
1402 o->op_private |= OPpLVAL_INTRO;
1410 o->op_flags |= OPf_PARENS;
1415 bind_match(I32 type, OP *left, OP *right)
1420 (left->op_type == OP_RV2AV ||
1421 left->op_type == OP_RV2HV ||
1422 left->op_type == OP_PADAV ||
1423 left->op_type == OP_PADHV)) {
1424 char *desc = op_desc[(right->op_type == OP_SUBST ||
1425 right->op_type == OP_TRANS)
1426 ? right->op_type : OP_MATCH];
1427 char *sample = ((left->op_type == OP_RV2AV ||
1428 left->op_type == OP_PADAV)
1429 ? "@array" : "%hash");
1430 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1433 if (right->op_type == OP_MATCH ||
1434 right->op_type == OP_SUBST ||
1435 right->op_type == OP_TRANS) {
1436 right->op_flags |= OPf_STACKED;
1437 if (right->op_type != OP_MATCH)
1438 left = mod(left, right->op_type);
1439 if (right->op_type == OP_TRANS)
1440 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1442 o = prepend_elem(right->op_type, scalar(left), right);
1444 return newUNOP(OP_NOT, 0, scalar(o));
1448 return bind_match(type, left,
1449 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1457 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1458 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1465 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1466 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1467 o->op_type = OP_LEAVE;
1468 o->op_ppaddr = ppaddr[OP_LEAVE];
1471 if (o->op_type == OP_LINESEQ) {
1473 o->op_type = OP_SCOPE;
1474 o->op_ppaddr = ppaddr[OP_SCOPE];
1475 kid = ((LISTOP*)o)->op_first;
1476 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1477 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1482 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1489 block_start(int full)
1492 int retval = savestack_ix;
1493 SAVEI32(comppad_name_floor);
1495 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1496 comppad_name_floor = comppad_name_fill;
1498 comppad_name_floor = 0;
1500 SAVEI32(min_intro_pending);
1501 SAVEI32(max_intro_pending);
1502 min_intro_pending = 0;
1503 SAVEI32(comppad_name_fill);
1504 SAVEI32(padix_floor);
1505 padix_floor = padix;
1506 pad_reset_pending = FALSE;
1508 hints &= ~HINT_BLOCK_SCOPE;
1513 block_end(I32 floor, OP *seq)
1516 int needblockscope = hints & HINT_BLOCK_SCOPE;
1517 OP* retval = scalarseq(seq);
1519 pad_reset_pending = FALSE;
1521 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1522 pad_leavemy(comppad_name_fill);
1532 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1533 eval_start = linklist(eval_root);
1534 eval_root->op_next = 0;
1540 main_root = scope(sawparens(scalarvoid(o)));
1541 curcop = &compiling;
1542 main_start = LINKLIST(main_root);
1543 main_root->op_next = 0;
1547 /* Register with debugger */
1549 CV *cv = perl_get_cv("DB::postponed", FALSE);
1553 XPUSHs((SV*)compiling.cop_filegv);
1555 perl_call_sv((SV*)cv, G_DISCARD);
1562 localize(OP *o, I32 lex)
1564 if (o->op_flags & OPf_PARENS)
1568 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1570 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1571 if (*s == ';' || *s == '=')
1572 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1576 in_my_stash = Nullhv;
1580 return mod(o, OP_NULL); /* a bit kludgey */
1586 if (o->op_type == OP_LIST) {
1589 o2 = newOP(OP_THREADSV, 0);
1590 o2->op_targ = find_thread_magical(";");
1592 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1593 #endif /* USE_THREADS */
1594 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1600 fold_constants(register OP *o)
1604 I32 type = o->op_type;
1607 if (opargs[type] & OA_RETSCALAR)
1609 if (opargs[type] & OA_TARGET)
1610 o->op_targ = pad_alloc(type, SVs_PADTMP);
1612 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1613 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1615 if (!(opargs[type] & OA_FOLDCONST))
1624 if (o->op_private & OPpLOCALE)
1629 goto nope; /* Don't try to run w/ errors */
1631 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1632 if (curop->op_type != OP_CONST &&
1633 curop->op_type != OP_LIST &&
1634 curop->op_type != OP_SCALAR &&
1635 curop->op_type != OP_NULL &&
1636 curop->op_type != OP_PUSHMARK) {
1641 curop = LINKLIST(o);
1646 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1647 pad_swipe(o->op_targ);
1648 else if (SvTEMP(sv)) { /* grab mortal temp? */
1649 (void)SvREFCNT_inc(sv);
1653 if (type == OP_RV2GV)
1654 return newGVOP(OP_GV, 0, (GV*)sv);
1656 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1658 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1663 SvIOK_off(sv); /* undo SvIV() damage */
1665 return newSVOP(OP_CONST, 0, sv);
1669 if (!(opargs[type] & OA_OTHERINT))
1672 if (!(hints & HINT_INTEGER)) {
1673 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1676 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1677 if (curop->op_type == OP_CONST) {
1678 if (SvIOK(((SVOP*)curop)->op_sv))
1682 if (opargs[curop->op_type] & OA_RETINTEGER)
1686 o->op_ppaddr = ppaddr[++(o->op_type)];
1693 gen_constant_list(register OP *o)
1697 I32 oldtmps_floor = tmps_floor;
1701 return o; /* Don't attempt to run with errors */
1703 op = curop = LINKLIST(o);
1709 tmps_floor = oldtmps_floor;
1711 o->op_type = OP_RV2AV;
1712 o->op_ppaddr = ppaddr[OP_RV2AV];
1713 curop = ((UNOP*)o)->op_first;
1714 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1721 convert(I32 type, I32 flags, OP *o)
1726 if (!o || o->op_type != OP_LIST)
1727 o = newLISTOP(OP_LIST, 0, o, Nullop);
1729 o->op_flags &= ~OPf_WANT;
1731 if (!(opargs[type] & OA_MARK))
1732 null(cLISTOPo->op_first);
1735 o->op_ppaddr = ppaddr[type];
1736 o->op_flags |= flags;
1738 o = CHECKOP(type, o);
1739 if (o->op_type != type)
1742 if (cLISTOPo->op_children < 7) {
1743 /* XXX do we really need to do this if we're done appending?? */
1744 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1746 cLISTOPo->op_last = last; /* in case check substituted last arg */
1749 return fold_constants(o);
1752 /* List constructors */
1755 append_elem(I32 type, OP *first, OP *last)
1763 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1764 return newLISTOP(type, 0, first, last);
1766 if (first->op_flags & OPf_KIDS)
1767 ((LISTOP*)first)->op_last->op_sibling = last;
1769 first->op_flags |= OPf_KIDS;
1770 ((LISTOP*)first)->op_first = last;
1772 ((LISTOP*)first)->op_last = last;
1773 ((LISTOP*)first)->op_children++;
1778 append_list(I32 type, LISTOP *first, LISTOP *last)
1786 if (first->op_type != type)
1787 return prepend_elem(type, (OP*)first, (OP*)last);
1789 if (last->op_type != type)
1790 return append_elem(type, (OP*)first, (OP*)last);
1792 first->op_last->op_sibling = last->op_first;
1793 first->op_last = last->op_last;
1794 first->op_children += last->op_children;
1795 if (first->op_children)
1796 last->op_flags |= OPf_KIDS;
1803 prepend_elem(I32 type, OP *first, OP *last)
1811 if (last->op_type == type) {
1812 if (type == OP_LIST) { /* already a PUSHMARK there */
1813 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1814 ((LISTOP*)last)->op_first->op_sibling = first;
1817 if (!(last->op_flags & OPf_KIDS)) {
1818 ((LISTOP*)last)->op_last = first;
1819 last->op_flags |= OPf_KIDS;
1821 first->op_sibling = ((LISTOP*)last)->op_first;
1822 ((LISTOP*)last)->op_first = first;
1824 ((LISTOP*)last)->op_children++;
1828 return newLISTOP(type, 0, first, last);
1836 return newOP(OP_STUB, 0);
1842 if (!o || o->op_type != OP_LIST)
1843 o = newLISTOP(OP_LIST, 0, o, Nullop);
1849 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1853 Newz(1101, listop, 1, LISTOP);
1855 listop->op_type = type;
1856 listop->op_ppaddr = ppaddr[type];
1857 listop->op_children = (first != 0) + (last != 0);
1858 listop->op_flags = flags;
1862 else if (!first && last)
1865 first->op_sibling = last;
1866 listop->op_first = first;
1867 listop->op_last = last;
1868 if (type == OP_LIST) {
1870 pushop = newOP(OP_PUSHMARK, 0);
1871 pushop->op_sibling = first;
1872 listop->op_first = pushop;
1873 listop->op_flags |= OPf_KIDS;
1875 listop->op_last = pushop;
1877 else if (listop->op_children)
1878 listop->op_flags |= OPf_KIDS;
1884 newOP(I32 type, I32 flags)
1887 Newz(1101, o, 1, OP);
1889 o->op_ppaddr = ppaddr[type];
1890 o->op_flags = flags;
1893 o->op_private = 0 + (flags >> 8);
1894 if (opargs[type] & OA_RETSCALAR)
1896 if (opargs[type] & OA_TARGET)
1897 o->op_targ = pad_alloc(type, SVs_PADTMP);
1898 return CHECKOP(type, o);
1902 newUNOP(I32 type, I32 flags, OP *first)
1907 first = newOP(OP_STUB, 0);
1908 if (opargs[type] & OA_MARK)
1909 first = force_list(first);
1911 Newz(1101, unop, 1, UNOP);
1912 unop->op_type = type;
1913 unop->op_ppaddr = ppaddr[type];
1914 unop->op_first = first;
1915 unop->op_flags = flags | OPf_KIDS;
1916 unop->op_private = 1 | (flags >> 8);
1918 unop = (UNOP*) CHECKOP(type, unop);
1922 return fold_constants((OP *) unop);
1926 newBINOP(I32 type, I32 flags, OP *first, OP *last)
1929 Newz(1101, binop, 1, BINOP);
1932 first = newOP(OP_NULL, 0);
1934 binop->op_type = type;
1935 binop->op_ppaddr = ppaddr[type];
1936 binop->op_first = first;
1937 binop->op_flags = flags | OPf_KIDS;
1940 binop->op_private = 1 | (flags >> 8);
1943 binop->op_private = 2 | (flags >> 8);
1944 first->op_sibling = last;
1947 binop = (BINOP*)CHECKOP(type, binop);
1951 binop->op_last = last = binop->op_first->op_sibling;
1953 return fold_constants((OP *)binop);
1957 pmtrans(OP *o, OP *expr, OP *repl)
1959 SV *tstr = ((SVOP*)expr)->op_sv;
1960 SV *rstr = ((SVOP*)repl)->op_sv;
1963 register U8 *t = (U8*)SvPV(tstr, tlen);
1964 register U8 *r = (U8*)SvPV(rstr, rlen);
1969 register short *tbl;
1971 tbl = (short*)cPVOPo->op_pv;
1972 complement = o->op_private & OPpTRANS_COMPLEMENT;
1973 Delete = o->op_private & OPpTRANS_DELETE;
1974 /* squash = o->op_private & OPpTRANS_SQUASH; */
1977 Zero(tbl, 256, short);
1978 for (i = 0; i < tlen; i++)
1980 for (i = 0, j = 0; i < 256; i++) {
1996 if (!rlen && !Delete) {
1999 for (i = 0; i < 256; i++)
2001 for (i = 0, j = 0; i < tlen; i++,j++) {
2004 if (tbl[t[i]] == -1)
2010 if (tbl[t[i]] == -1)
2021 newPMOP(I32 type, I32 flags)
2026 Newz(1101, pmop, 1, PMOP);
2027 pmop->op_type = type;
2028 pmop->op_ppaddr = ppaddr[type];
2029 pmop->op_flags = flags;
2030 pmop->op_private = 0 | (flags >> 8);
2032 if (hints & HINT_LOCALE)
2033 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2035 /* link into pm list */
2036 if (type != OP_TRANS && curstash) {
2037 pmop->op_pmnext = HvPMROOT(curstash);
2038 HvPMROOT(curstash) = pmop;
2045 pmruntime(OP *o, OP *expr, OP *repl)
2050 if (o->op_type == OP_TRANS)
2051 return pmtrans(o, expr, repl);
2053 hints |= HINT_BLOCK_SCOPE;
2056 if (expr->op_type == OP_CONST) {
2058 SV *pat = ((SVOP*)expr)->op_sv;
2059 char *p = SvPV(pat, plen);
2060 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2061 sv_setpvn(pat, "\\s+", 3);
2062 p = SvPV(pat, plen);
2063 pm->op_pmflags |= PMf_SKIPWHITE;
2065 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2066 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2067 pm->op_pmflags |= PMf_WHITE;
2072 if (pm->op_pmflags & PMf_KEEP)
2073 expr = newUNOP(OP_REGCMAYBE,0,expr);
2075 Newz(1101, rcop, 1, LOGOP);
2076 rcop->op_type = OP_REGCOMP;
2077 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2078 rcop->op_first = scalar(expr);
2079 rcop->op_flags |= OPf_KIDS;
2080 rcop->op_private = 1;
2083 /* establish postfix order */
2084 if (pm->op_pmflags & PMf_KEEP) {
2086 rcop->op_next = expr;
2087 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2090 rcop->op_next = LINKLIST(expr);
2091 expr->op_next = (OP*)rcop;
2094 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2099 if (pm->op_pmflags & PMf_EVAL)
2102 else if (repl->op_type == OP_THREADSV
2103 && strchr("&`'123456789+",
2104 per_thread_magicals[repl->op_targ]))
2108 #endif /* USE_THREADS */
2109 else if (repl->op_type == OP_CONST)
2113 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2114 if (opargs[curop->op_type] & OA_DANGEROUS) {
2116 if (curop->op_type == OP_THREADSV
2117 && strchr("&`'123456789+", curop->op_private)) {
2121 if (curop->op_type == OP_GV) {
2122 GV *gv = ((GVOP*)curop)->op_gv;
2123 if (strchr("&`'123456789+", *GvENAME(gv)))
2126 #endif /* USE_THREADS */
2127 else if (curop->op_type == OP_RV2CV)
2129 else if (curop->op_type == OP_RV2SV ||
2130 curop->op_type == OP_RV2AV ||
2131 curop->op_type == OP_RV2HV ||
2132 curop->op_type == OP_RV2GV) {
2133 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2136 else if (curop->op_type == OP_PADSV ||
2137 curop->op_type == OP_PADAV ||
2138 curop->op_type == OP_PADHV ||
2139 curop->op_type == OP_PADANY) {
2148 if (curop == repl) {
2149 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2150 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2151 prepend_elem(o->op_type, scalar(repl), o);
2154 Newz(1101, rcop, 1, LOGOP);
2155 rcop->op_type = OP_SUBSTCONT;
2156 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2157 rcop->op_first = scalar(repl);
2158 rcop->op_flags |= OPf_KIDS;
2159 rcop->op_private = 1;
2162 /* establish postfix order */
2163 rcop->op_next = LINKLIST(repl);
2164 repl->op_next = (OP*)rcop;
2166 pm->op_pmreplroot = scalar((OP*)rcop);
2167 pm->op_pmreplstart = LINKLIST(rcop);
2176 newSVOP(I32 type, I32 flags, SV *sv)
2179 Newz(1101, svop, 1, SVOP);
2180 svop->op_type = type;
2181 svop->op_ppaddr = ppaddr[type];
2183 svop->op_next = (OP*)svop;
2184 svop->op_flags = flags;
2185 if (opargs[type] & OA_RETSCALAR)
2187 if (opargs[type] & OA_TARGET)
2188 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2189 return CHECKOP(type, svop);
2193 newGVOP(I32 type, I32 flags, GV *gv)
2197 Newz(1101, gvop, 1, GVOP);
2198 gvop->op_type = type;
2199 gvop->op_ppaddr = ppaddr[type];
2200 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2201 gvop->op_next = (OP*)gvop;
2202 gvop->op_flags = flags;
2203 if (opargs[type] & OA_RETSCALAR)
2205 if (opargs[type] & OA_TARGET)
2206 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2207 return CHECKOP(type, gvop);
2211 newPVOP(I32 type, I32 flags, char *pv)
2214 Newz(1101, pvop, 1, PVOP);
2215 pvop->op_type = type;
2216 pvop->op_ppaddr = ppaddr[type];
2218 pvop->op_next = (OP*)pvop;
2219 pvop->op_flags = flags;
2220 if (opargs[type] & OA_RETSCALAR)
2222 if (opargs[type] & OA_TARGET)
2223 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2224 return CHECKOP(type, pvop);
2233 save_hptr(&curstash);
2234 save_item(curstname);
2239 name = SvPV(sv, len);
2240 curstash = gv_stashpvn(name,len,TRUE);
2241 sv_setpvn(curstname, name, len);
2245 sv_setpv(curstname,"<none>");
2253 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2261 if (id->op_type != OP_CONST)
2262 croak("Module name must be constant");
2266 if(version != Nullop) {
2267 SV *vesv = ((SVOP*)version)->op_sv;
2269 if (arg == Nullop && !SvNIOK(vesv)) {
2276 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2277 croak("Version number must be constant number");
2279 /* Make copy of id so we don't free it twice */
2280 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2282 /* Fake up a method call to VERSION */
2283 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2284 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2285 append_elem(OP_LIST,
2286 prepend_elem(OP_LIST, pack, list(version)),
2287 newUNOP(OP_METHOD, 0, meth)));
2291 /* Fake up an import/unimport */
2292 if (arg && arg->op_type == OP_STUB)
2293 imop = arg; /* no import on explicit () */
2294 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2295 imop = Nullop; /* use 5.0; */
2298 /* Make copy of id so we don't free it twice */
2299 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2300 meth = newSVOP(OP_CONST, 0,
2302 ? newSVpv("import", 6)
2303 : newSVpv("unimport", 8)
2305 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2306 append_elem(OP_LIST,
2307 prepend_elem(OP_LIST, pack, list(arg)),
2308 newUNOP(OP_METHOD, 0, meth)));
2311 /* Fake up a require */
2312 rqop = newUNOP(OP_REQUIRE, 0, id);
2314 /* Fake up the BEGIN {}, which does its thing immediately. */
2316 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2318 append_elem(OP_LINESEQ,
2319 append_elem(OP_LINESEQ,
2320 newSTATEOP(0, Nullch, rqop),
2321 newSTATEOP(0, Nullch, veop)),
2322 newSTATEOP(0, Nullch, imop) ));
2329 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2331 return newBINOP(OP_LSLICE, flags,
2332 list(force_list(subscript)),
2333 list(force_list(listval)) );
2337 list_assignment(register OP *o)
2342 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2343 o = cUNOPo->op_first;
2345 if (o->op_type == OP_COND_EXPR) {
2346 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2347 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2352 yyerror("Assignment to both a list and a scalar");
2356 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2357 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2358 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2361 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2364 if (o->op_type == OP_RV2SV)
2371 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2376 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2377 return newLOGOP(optype, 0,
2378 mod(scalar(left), optype),
2379 newUNOP(OP_SASSIGN, 0, scalar(right)));
2382 return newBINOP(optype, OPf_STACKED,
2383 mod(scalar(left), optype), scalar(right));
2387 if (list_assignment(left)) {
2389 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2390 left = mod(left, OP_AASSIGN);
2398 o = newBINOP(OP_AASSIGN, flags,
2399 list(force_list(right)),
2400 list(force_list(left)) );
2401 o->op_private = 0 | (flags >> 8);
2402 if (!(left->op_private & OPpLVAL_INTRO)) {
2403 static int generation = 100;
2407 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2408 if (opargs[curop->op_type] & OA_DANGEROUS) {
2409 if (curop->op_type == OP_GV) {
2410 GV *gv = ((GVOP*)curop)->op_gv;
2411 if (gv == defgv || SvCUR(gv) == generation)
2413 SvCUR(gv) = generation;
2415 else if (curop->op_type == OP_PADSV ||
2416 curop->op_type == OP_PADAV ||
2417 curop->op_type == OP_PADHV ||
2418 curop->op_type == OP_PADANY) {
2419 SV **svp = AvARRAY(comppad_name);
2420 SV *sv = svp[curop->op_targ];
2421 if (SvCUR(sv) == generation)
2423 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2425 else if (curop->op_type == OP_RV2CV)
2427 else if (curop->op_type == OP_RV2SV ||
2428 curop->op_type == OP_RV2AV ||
2429 curop->op_type == OP_RV2HV ||
2430 curop->op_type == OP_RV2GV) {
2431 if (lastop->op_type != OP_GV) /* funny deref? */
2440 o->op_private = OPpASSIGN_COMMON;
2442 if (right && right->op_type == OP_SPLIT) {
2444 if ((tmpop = ((LISTOP*)right)->op_first) &&
2445 tmpop->op_type == OP_PUSHRE)
2447 PMOP *pm = (PMOP*)tmpop;
2448 if (left->op_type == OP_RV2AV &&
2449 !(left->op_private & OPpLVAL_INTRO) &&
2450 !(o->op_private & OPpASSIGN_COMMON) )
2452 tmpop = ((UNOP*)left)->op_first;
2453 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2454 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2455 pm->op_pmflags |= PMf_ONCE;
2456 tmpop = cUNOPo->op_first; /* to list (nulled) */
2457 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2458 tmpop->op_sibling = Nullop; /* don't free split */
2459 right->op_next = tmpop->op_next; /* fix starting loc */
2460 op_free(o); /* blow off assign */
2461 right->op_flags &= ~OPf_WANT;
2462 /* "I don't know and I don't care." */
2467 if (modcount < 10000 &&
2468 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2470 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2472 sv_setiv(sv, modcount+1);
2480 right = newOP(OP_UNDEF, 0);
2481 if (right->op_type == OP_READLINE) {
2482 right->op_flags |= OPf_STACKED;
2483 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2486 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2487 o = newBINOP(OP_SASSIGN, flags,
2488 scalar(right), mod(scalar(left), OP_SASSIGN) );
2500 newSTATEOP(I32 flags, char *label, OP *o)
2503 U32 seq = intro_my();
2506 Newz(1101, cop, 1, COP);
2507 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2508 cop->op_type = OP_DBSTATE;
2509 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2512 cop->op_type = OP_NEXTSTATE;
2513 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2515 cop->op_flags = flags;
2516 cop->op_private = 0 | (flags >> 8);
2518 cop->op_private |= NATIVE_HINTS;
2520 cop->op_next = (OP*)cop;
2523 cop->cop_label = label;
2524 hints |= HINT_BLOCK_SCOPE;
2527 cop->cop_arybase = curcop->cop_arybase;
2529 if (copline == NOLINE)
2530 cop->cop_line = curcop->cop_line;
2532 cop->cop_line = copline;
2535 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2536 cop->cop_stash = curstash;
2538 if (PERLDB_LINE && curstash != debstash) {
2539 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2540 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2541 (void)SvIOK_on(*svp);
2543 SvSTASH(*svp) = (HV*)cop;
2547 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2550 /* "Introduce" my variables to visible status. */
2558 if (! min_intro_pending)
2561 svp = AvARRAY(comppad_name);
2562 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2563 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2564 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2565 SvNVX(sv) = (double)cop_seqmax;
2568 min_intro_pending = 0;
2569 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2570 return cop_seqmax++;
2574 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2580 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2581 return newBINOP(type, flags, scalar(first), scalar(other));
2583 scalarboolean(first);
2584 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2585 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2586 if (type == OP_AND || type == OP_OR) {
2592 first = cUNOPo->op_first;
2594 first->op_next = o->op_next;
2595 cUNOPo->op_first = Nullop;
2599 if (first->op_type == OP_CONST) {
2600 if (dowarn && (first->op_private & OPpCONST_BARE))
2601 warn("Probable precedence problem on %s", op_desc[type]);
2602 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2611 else if (first->op_type == OP_WANTARRAY) {
2617 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2618 OP *k1 = ((UNOP*)first)->op_first;
2619 OP *k2 = k1->op_sibling;
2621 switch (first->op_type)
2624 if (k2 && k2->op_type == OP_READLINE
2625 && (k2->op_flags & OPf_STACKED)
2626 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2627 warnop = k2->op_type;
2631 if (k1->op_type == OP_READDIR
2632 || k1->op_type == OP_GLOB
2633 || k1->op_type == OP_EACH)
2634 warnop = k1->op_type;
2638 line_t oldline = curcop->cop_line;
2639 curcop->cop_line = copline;
2640 warn("Value of %s%s can be \"0\"; test with defined()",
2642 ((warnop == OP_READLINE || warnop == OP_GLOB)
2643 ? " construct" : "() operator"));
2644 curcop->cop_line = oldline;
2651 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2652 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2654 Newz(1101, logop, 1, LOGOP);
2656 logop->op_type = type;
2657 logop->op_ppaddr = ppaddr[type];
2658 logop->op_first = first;
2659 logop->op_flags = flags | OPf_KIDS;
2660 logop->op_other = LINKLIST(other);
2661 logop->op_private = 1 | (flags >> 8);
2663 /* establish postfix order */
2664 logop->op_next = LINKLIST(first);
2665 first->op_next = (OP*)logop;
2666 first->op_sibling = other;
2668 o = newUNOP(OP_NULL, 0, (OP*)logop);
2675 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2682 return newLOGOP(OP_AND, 0, first, trueop);
2684 return newLOGOP(OP_OR, 0, first, falseop);
2686 scalarboolean(first);
2687 if (first->op_type == OP_CONST) {
2688 if (SvTRUE(((SVOP*)first)->op_sv)) {
2699 else if (first->op_type == OP_WANTARRAY) {
2703 Newz(1101, condop, 1, CONDOP);
2705 condop->op_type = OP_COND_EXPR;
2706 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2707 condop->op_first = first;
2708 condop->op_flags = flags | OPf_KIDS;
2709 condop->op_true = LINKLIST(trueop);
2710 condop->op_false = LINKLIST(falseop);
2711 condop->op_private = 1 | (flags >> 8);
2713 /* establish postfix order */
2714 condop->op_next = LINKLIST(first);
2715 first->op_next = (OP*)condop;
2717 first->op_sibling = trueop;
2718 trueop->op_sibling = falseop;
2719 o = newUNOP(OP_NULL, 0, (OP*)condop);
2721 trueop->op_next = o;
2722 falseop->op_next = o;
2728 newRANGE(I32 flags, OP *left, OP *right)
2736 Newz(1101, condop, 1, CONDOP);
2738 condop->op_type = OP_RANGE;
2739 condop->op_ppaddr = ppaddr[OP_RANGE];
2740 condop->op_first = left;
2741 condop->op_flags = OPf_KIDS;
2742 condop->op_true = LINKLIST(left);
2743 condop->op_false = LINKLIST(right);
2744 condop->op_private = 1 | (flags >> 8);
2746 left->op_sibling = right;
2748 condop->op_next = (OP*)condop;
2749 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2750 flop = newUNOP(OP_FLOP, 0, flip);
2751 o = newUNOP(OP_NULL, 0, flop);
2754 left->op_next = flip;
2755 right->op_next = flop;
2757 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2758 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2759 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2760 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2762 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2763 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2766 if (!flip->op_private || !flop->op_private)
2767 linklist(o); /* blow off optimizer unless constant */
2773 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2778 int once = block && block->op_flags & OPf_SPECIAL &&
2779 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2782 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2783 return block; /* do {} while 0 does once */
2784 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2785 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2786 expr = newUNOP(OP_DEFINED, 0,
2787 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2791 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2792 o = newLOGOP(OP_AND, 0, expr, listop);
2794 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2796 if (once && o != listop)
2797 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2800 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2802 o->op_flags |= flags;
2804 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2809 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2818 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2819 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2820 expr = newUNOP(OP_DEFINED, 0,
2821 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2825 block = newOP(OP_NULL, 0);
2828 next = LINKLIST(cont);
2830 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2831 if ((line_t)whileline != NOLINE) {
2832 copline = whileline;
2833 cont = append_elem(OP_LINESEQ, cont,
2834 newSTATEOP(0, Nullch, Nullop));
2838 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2839 redo = LINKLIST(listop);
2842 o = newLOGOP(OP_AND, 0, expr, scalar(listop));
2843 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2844 op_free(expr); /* oops, it's a while (0) */
2846 return Nullop; /* (listop already freed by newLOGOP) */
2848 ((LISTOP*)listop)->op_last->op_next = condop =
2849 (o == listop ? redo : LINKLIST(o));
2857 Newz(1101,loop,1,LOOP);
2858 loop->op_type = OP_ENTERLOOP;
2859 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2860 loop->op_private = 0;
2861 loop->op_next = (OP*)loop;
2864 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2866 loop->op_redoop = redo;
2867 loop->op_lastop = o;
2870 loop->op_nextop = next;
2872 loop->op_nextop = o;
2874 o->op_flags |= flags;
2875 o->op_private |= (flags >> 8);
2880 #ifndef CAN_PROTOTYPE
2881 newFOROP(flags,label,forline,sv,expr,block,cont)
2890 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2891 #endif /* CAN_PROTOTYPE */
2899 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2900 sv->op_type = OP_RV2GV;
2901 sv->op_ppaddr = ppaddr[OP_RV2GV];
2903 else if (sv->op_type == OP_PADSV) { /* private variable */
2904 padoff = sv->op_targ;
2909 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2912 sv = newGVOP(OP_GV, 0, defgv);
2914 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2915 expr = scalar(ref(expr, OP_ITER));
2916 iterflags |= OPf_STACKED;
2918 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2919 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2921 assert(!loop->op_next);
2922 Renew(loop, 1, LOOP);
2923 loop->op_targ = padoff;
2924 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
2926 return newSTATEOP(0, label, wop);
2930 newLOOPEX(I32 type, OP *label)
2934 if (type != OP_GOTO || label->op_type == OP_CONST) {
2935 o = newPVOP(type, 0, savepv(
2936 label->op_type == OP_CONST
2937 ? SvPVx(((SVOP*)label)->op_sv, na)
2942 if (label->op_type == OP_ENTERSUB)
2943 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2944 o = newUNOP(type, OPf_STACKED, label);
2946 hints |= HINT_BLOCK_SCOPE;
2956 MUTEX_DESTROY(CvMUTEXP(cv));
2957 Safefree(CvMUTEXP(cv));
2960 #endif /* USE_THREADS */
2962 if (!CvXSUB(cv) && CvROOT(cv)) {
2964 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
2965 croak("Can't undef active subroutine");
2968 croak("Can't undef active subroutine");
2969 #endif /* USE_THREADS */
2976 op_free(CvROOT(cv));
2977 CvROOT(cv) = Nullop;
2980 SvPOK_off((SV*)cv); /* forget prototype */
2982 SvREFCNT_dec(CvGV(cv));
2984 SvREFCNT_dec(CvOUTSIDE(cv));
2985 CvOUTSIDE(cv) = Nullcv;
2986 if (CvPADLIST(cv)) {
2987 /* may be during global destruction */
2988 if (SvREFCNT(CvPADLIST(cv))) {
2989 I32 i = AvFILL(CvPADLIST(cv));
2991 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
2992 SV* sv = svp ? *svp : Nullsv;
2995 if (sv == (SV*)comppad_name)
2996 comppad_name = Nullav;
2997 else if (sv == (SV*)comppad) {
2999 curpad = Null(SV**);
3003 SvREFCNT_dec((SV*)CvPADLIST(cv));
3005 CvPADLIST(cv) = Nullav;
3009 #ifdef DEBUG_CLOSURES
3014 CV *outside = CvOUTSIDE(cv);
3015 AV* padlist = CvPADLIST(cv);
3022 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3024 (CvANON(cv) ? "ANON"
3025 : (cv == main_cv) ? "MAIN"
3026 : CvUNIQUE(outside) ? "UNIQUE"
3027 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3030 : CvANON(outside) ? "ANON"
3031 : (outside == main_cv) ? "MAIN"
3032 : CvUNIQUE(outside) ? "UNIQUE"
3033 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3038 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3039 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3040 pname = AvARRAY(pad_name);
3041 ppad = AvARRAY(pad);
3043 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
3044 if (SvPOK(pname[ix]))
3045 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3047 SvFAKE(pname[ix]) ? "FAKE " : "",
3049 (long)I_32(SvNVX(pname[ix])),
3050 (long)SvIVX(pname[ix]));
3053 #endif /* DEBUG_CLOSURES */
3056 cv_clone2(CV *proto, CV *outside)
3061 AV* protopadlist = CvPADLIST(proto);
3062 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3063 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3064 SV** pname = AvARRAY(protopad_name);
3065 SV** ppad = AvARRAY(protopad);
3066 I32 fname = AvFILL(protopad_name);
3067 I32 fpad = AvFILL(protopad);
3071 assert(!CvUNIQUE(proto));
3076 SAVESPTR(comppad_name);
3079 cv = compcv = (CV*)NEWSV(1104,0);
3080 sv_upgrade((SV *)cv, SvTYPE(proto));
3086 New(666, CvMUTEXP(cv), 1, perl_mutex);
3087 MUTEX_INIT(CvMUTEXP(cv));
3089 #endif /* USE_THREADS */
3090 CvFILEGV(cv) = CvFILEGV(proto);
3091 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3092 CvSTASH(cv) = CvSTASH(proto);
3093 CvROOT(cv) = CvROOT(proto);
3094 CvSTART(cv) = CvSTART(proto);
3096 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3099 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3101 comppad_name = newAV();
3102 for (ix = fname; ix >= 0; ix--)
3103 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3107 comppadlist = newAV();
3108 AvREAL_off(comppadlist);
3109 av_store(comppadlist, 0, (SV*)comppad_name);
3110 av_store(comppadlist, 1, (SV*)comppad);
3111 CvPADLIST(cv) = comppadlist;
3112 av_fill(comppad, AvFILL(protopad));
3113 curpad = AvARRAY(comppad);
3115 av = newAV(); /* will be @_ */
3117 av_store(comppad, 0, (SV*)av);
3118 AvFLAGS(av) = AVf_REIFY;
3120 for (ix = fpad; ix > 0; ix--) {
3121 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3122 if (namesv && namesv != &sv_undef) {
3123 char *name = SvPVX(namesv); /* XXX */
3124 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3125 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3126 CvOUTSIDE(cv), cxstack_ix);
3128 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3130 croak("panic: cv_clone: %s", name);
3132 else { /* our own lexical */
3135 /* anon code -- we'll come back for it */
3136 sv = SvREFCNT_inc(ppad[ix]);
3138 else if (*name == '@')
3140 else if (*name == '%')
3150 SV* sv = NEWSV(0,0);
3156 /* Now that vars are all in place, clone nested closures. */
3158 for (ix = fpad; ix > 0; ix--) {
3159 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3161 && namesv != &sv_undef
3162 && !(SvFLAGS(namesv) & SVf_FAKE)
3163 && *SvPVX(namesv) == '&'
3164 && CvCLONE(ppad[ix]))
3166 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3167 SvREFCNT_dec(ppad[ix]);
3170 curpad[ix] = (SV*)kid;
3174 #ifdef DEBUG_CLOSURES
3175 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3177 PerlIO_printf(Perl_debug_log, " from:\n");
3179 PerlIO_printf(Perl_debug_log, " to:\n");
3190 return cv_clone2(proto, CvOUTSIDE(proto));
3194 cv_ckproto(CV *cv, GV *gv, char *p)
3196 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3197 SV* msg = sv_newmortal();
3201 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3202 sv_setpv(msg, "Prototype mismatch:");
3204 sv_catpvf(msg, " sub %_", name);
3206 sv_catpvf(msg, " (%s)", SvPVX(cv));
3207 sv_catpv(msg, " vs ");
3209 sv_catpvf(msg, "(%s)", p);
3211 sv_catpv(msg, "none");
3222 if (!cv || !SvPOK(cv) || SvCUR(cv))
3226 for (o = CvSTART(cv); o; o = o->op_next) {
3227 OPCODE type = o->op_type;
3229 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3231 if (type == OP_LEAVESUB || type == OP_RETURN)
3235 if (type == OP_CONST)
3237 else if (type == OP_PADSV) {
3238 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3239 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3240 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3252 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3255 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3256 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3257 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3266 if (!name || GvCVGEN(gv))
3268 else if (cv = GvCV(gv)) {
3269 cv_ckproto(cv, gv, ps);
3270 /* already defined (or promised)? */
3271 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3274 /* just a "sub foo;" when &foo is already defined */
3278 /* ahem, death to those who redefine active sort subs */
3279 if (curstack == sortstack && sortcop == CvSTART(cv))
3280 croak("Can't redefine active sort subroutine %s", name);
3281 const_sv = cv_const_sv(cv);
3282 if (const_sv || dowarn) {
3283 line_t oldline = curcop->cop_line;
3284 curcop->cop_line = copline;
3285 warn(const_sv ? "Constant subroutine %s redefined"
3286 : "Subroutine %s redefined", name);
3287 curcop->cop_line = oldline;
3293 if (cv) { /* must reuse cv if autoloaded */
3295 CvFLAGS(cv) = CvFLAGS(compcv);
3296 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3297 CvOUTSIDE(compcv) = 0;
3298 CvPADLIST(cv) = CvPADLIST(compcv);
3299 CvPADLIST(compcv) = 0;
3300 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3301 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3302 SvREFCNT_dec(compcv);
3312 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3313 CvFILEGV(cv) = curcop->cop_filegv;
3314 CvSTASH(cv) = curstash;
3317 New(666, CvMUTEXP(cv), 1, perl_mutex);
3318 MUTEX_INIT(CvMUTEXP(cv));
3319 #endif /* USE_THREADS */
3322 sv_setpv((SV*)cv, ps);
3328 char *s = strrchr(name, ':');
3330 if (strEQ(s, "BEGIN")) {
3332 "BEGIN not safe after errors--compilation aborted";
3336 /* force display of errors found but not reported */
3337 sv_catpv(ERRSV, not_safe);
3338 croak("%s", SvPVx(ERRSV, na));
3349 if (AvFILL(comppad_name) < AvFILL(comppad))
3350 av_store(comppad_name, AvFILL(comppad), Nullsv);
3353 SV **namep = AvARRAY(comppad_name);
3354 for (ix = AvFILL(comppad); ix > 0; ix--) {
3357 if (SvIMMORTAL(curpad[ix]))
3360 * The only things that a clonable function needs in its
3361 * pad are references to outer lexicals and anonymous subs.
3362 * The rest are created anew during cloning.
3364 if (!((namesv = namep[ix]) != Nullsv &&
3365 namesv != &sv_undef &&
3367 *SvPVX(namesv) == '&')))
3369 SvREFCNT_dec(curpad[ix]);
3370 curpad[ix] = Nullsv;
3375 AV *av = newAV(); /* Will be @_ */
3377 av_store(comppad, 0, (SV*)av);
3378 AvFLAGS(av) = AVf_REIFY;
3380 for (ix = AvFILL(comppad); ix > 0; ix--) {
3381 if (SvIMMORTAL(curpad[ix]))
3383 if (!SvPADMY(curpad[ix]))
3384 SvPADTMP_on(curpad[ix]);
3388 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3389 CvSTART(cv) = LINKLIST(CvROOT(cv));
3390 CvROOT(cv)->op_next = 0;
3396 if (PERLDB_SUBLINE && curstash != debstash) {
3397 SV *sv = NEWSV(0,0);
3398 SV *tmpstr = sv_newmortal();
3399 static GV *db_postponed;
3403 sv_setpvf(sv, "%_:%ld-%ld",
3404 GvSV(curcop->cop_filegv),
3405 (long)subline, (long)curcop->cop_line);
3406 gv_efullname3(tmpstr, gv, Nullch);
3407 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3408 if (!db_postponed) {
3409 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3411 hv = GvHVn(db_postponed);
3412 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3413 && (cv = GvCV(db_postponed))) {
3418 perl_call_sv((SV*)cv, G_DISCARD);
3422 if ((s = strrchr(name,':')))
3426 if (strEQ(s, "BEGIN")) {
3427 I32 oldscope = scopestack_ix;
3429 SAVESPTR(compiling.cop_filegv);
3430 SAVEI16(compiling.cop_line);
3437 DEBUG_x( dump_sub(gv) );
3438 av_push(beginav, (SV *)cv);
3440 call_list(oldscope, beginav);
3442 curcop = &compiling;
3445 else if (strEQ(s, "END") && !error_count) {
3448 av_unshift(endav, 1);
3449 av_store(endav, 0, (SV *)cv);
3452 else if (strEQ(s, "INIT") && !error_count) {
3455 av_push(initav, SvREFCNT_inc(cv));
3466 newXS(char *name, void (*subaddr) (CV *), char *filename)
3469 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3472 if (cv = (name ? GvCV(gv) : Nullcv)) {
3474 /* just a cached method */
3478 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3479 /* already defined (or promised) */
3481 line_t oldline = curcop->cop_line;
3482 curcop->cop_line = copline;
3483 warn("Subroutine %s redefined",name);
3484 curcop->cop_line = oldline;
3491 if (cv) /* must reuse cv if autoloaded */
3494 cv = (CV*)NEWSV(1105,0);
3495 sv_upgrade((SV *)cv, SVt_PVCV);
3502 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3504 New(666, CvMUTEXP(cv), 1, perl_mutex);
3505 MUTEX_INIT(CvMUTEXP(cv));
3507 #endif /* USE_THREADS */
3508 CvFILEGV(cv) = gv_fetchfile(filename);
3509 CvXSUB(cv) = subaddr;
3512 char *s = strrchr(name,':');
3517 if (strEQ(s, "BEGIN")) {
3520 av_push(beginav, (SV *)cv);
3523 else if (strEQ(s, "END")) {
3526 av_unshift(endav, 1);
3527 av_store(endav, 0, (SV *)cv);
3530 else if (strEQ(s, "INIT")) {
3533 av_push(initav, (SV *)cv);
3543 newFORM(I32 floor, OP *o, OP *block)
3552 name = SvPVx(cSVOPo->op_sv, na);
3555 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3557 if (cv = GvFORM(gv)) {
3559 line_t oldline = curcop->cop_line;
3561 curcop->cop_line = copline;
3562 warn("Format %s redefined",name);
3563 curcop->cop_line = oldline;
3569 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3570 CvFILEGV(cv) = curcop->cop_filegv;
3572 for (ix = AvFILL(comppad); ix > 0; ix--) {
3573 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3574 SvPADTMP_on(curpad[ix]);
3577 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3578 CvSTART(cv) = LINKLIST(CvROOT(cv));
3579 CvROOT(cv)->op_next = 0;
3589 return newUNOP(OP_REFGEN, 0,
3590 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3596 return newUNOP(OP_REFGEN, 0,
3597 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3601 newANONSUB(I32 floor, OP *proto, OP *block)
3603 return newUNOP(OP_REFGEN, 0,
3604 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3610 switch (o->op_type) {
3612 o->op_type = OP_PADAV;
3613 o->op_ppaddr = ppaddr[OP_PADAV];
3614 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3617 o->op_type = OP_RV2AV;
3618 o->op_ppaddr = ppaddr[OP_RV2AV];
3623 warn("oops: oopsAV");
3632 switch (o->op_type) {
3635 o->op_type = OP_PADHV;
3636 o->op_ppaddr = ppaddr[OP_PADHV];
3637 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3641 o->op_type = OP_RV2HV;
3642 o->op_ppaddr = ppaddr[OP_RV2HV];
3647 warn("oops: oopsHV");
3656 if (o->op_type == OP_PADANY) {
3657 o->op_type = OP_PADAV;
3658 o->op_ppaddr = ppaddr[OP_PADAV];
3661 return newUNOP(OP_RV2AV, 0, scalar(o));
3665 newGVREF(I32 type, OP *o)
3667 if (type == OP_MAPSTART)
3668 return newUNOP(OP_NULL, 0, o);
3669 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3675 if (o->op_type == OP_PADANY) {
3676 o->op_type = OP_PADHV;
3677 o->op_ppaddr = ppaddr[OP_PADHV];
3680 return newUNOP(OP_RV2HV, 0, scalar(o));
3686 croak("NOT IMPL LINE %d",__LINE__);
3692 newCVREF(I32 flags, OP *o)
3694 return newUNOP(OP_RV2CV, flags, scalar(o));
3700 if (o->op_type == OP_PADANY) {
3701 o->op_type = OP_PADSV;
3702 o->op_ppaddr = ppaddr[OP_PADSV];
3705 else if (o->op_type == OP_THREADSV)
3707 return newUNOP(OP_RV2SV, 0, scalar(o));
3710 /* Check routines. */
3718 name = NEWSV(1106,0);
3719 sv_upgrade(name, SVt_PVNV);
3720 sv_setpvn(name, "&", 1);
3723 ix = pad_alloc(o->op_type, SVs_PADMY);
3724 av_store(comppad_name, ix, name);
3725 av_store(comppad, ix, cSVOPo->op_sv);
3726 SvPADMY_on(cSVOPo->op_sv);
3727 cSVOPo->op_sv = Nullsv;
3728 cSVOPo->op_targ = ix;
3735 o->op_private = hints;
3742 if (cUNOPo->op_first->op_type == OP_CONCAT)
3743 o->op_flags |= OPf_STACKED;
3750 if (o->op_flags & OPf_KIDS) {
3753 OPCODE type = o->op_type;
3754 o = modkids(ck_fun(o), type);
3755 kid = cUNOPo->op_first;
3756 newop = kUNOP->op_first->op_sibling;
3758 (newop->op_sibling ||
3759 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3760 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3761 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3765 op_free(kUNOP->op_first);
3766 kUNOP->op_first = newop;
3768 o->op_ppaddr = ppaddr[++o->op_type];
3777 if (o->op_flags & OPf_KIDS) {
3778 OP *kid = cUNOPo->op_first;
3779 if (kid->op_type == OP_HSLICE)
3780 o->op_private |= OPpSLICE;
3781 else if (kid->op_type != OP_HELEM)
3782 croak("%s argument is not a HASH element or slice",
3783 op_desc[o->op_type]);
3792 I32 type = o->op_type;
3794 if (o->op_flags & OPf_KIDS) {
3795 if (cLISTOPo->op_first->op_type == OP_STUB) {
3797 o = newUNOP(type, OPf_SPECIAL,
3798 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3808 hints |= HINT_BLOCK_SCOPE;
3809 if (o->op_flags & OPf_KIDS) {
3810 SVOP *kid = (SVOP*)cUNOPo->op_first;
3813 o->op_flags &= ~OPf_KIDS;
3816 else if (kid->op_type == OP_LINESEQ) {
3819 kid->op_next = o->op_next;
3820 cUNOPo->op_first = 0;
3823 Newz(1101, enter, 1, LOGOP);
3824 enter->op_type = OP_ENTERTRY;
3825 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3826 enter->op_private = 0;
3828 /* establish postfix order */
3829 enter->op_next = (OP*)enter;
3831 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3832 o->op_type = OP_LEAVETRY;
3833 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3834 enter->op_other = o;
3840 o = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3842 o->op_targ = (PADOFFSET)hints;
3850 if (o->op_flags & OPf_STACKED) {
3852 kid = cUNOPo->op_first->op_sibling;
3853 if (kid->op_type == OP_RV2GV)
3865 if (o->op_flags & OPf_KIDS) {
3866 OP *kid = cUNOPo->op_first;
3867 if (kid->op_type != OP_HELEM)
3868 croak("%s argument is not a HASH element", op_desc[o->op_type]);
3875 ck_gvconst(register OP *o)
3877 o = fold_constants(o);
3878 if (o->op_type == OP_CONST)
3884 ck_rvconst(register OP *o)
3887 SVOP *kid = (SVOP*)cUNOPo->op_first;
3889 o->op_private |= (hints & HINT_STRICT_REFS);
3890 if (kid->op_type == OP_CONST) {
3895 name = SvPV(kid->op_sv, na);
3896 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3897 char *badthing = Nullch;
3898 switch (o->op_type) {
3900 badthing = "a SCALAR";
3903 badthing = "an ARRAY";
3906 badthing = "a HASH";
3911 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3914 kid->op_type = OP_GV;
3915 iscv = (o->op_type == OP_RV2CV) * 2;
3916 for (gv = 0; !gv; iscv++) {
3918 * This is a little tricky. We only want to add the symbol if we
3919 * didn't add it in the lexer. Otherwise we get duplicate strict
3920 * warnings. But if we didn't add it in the lexer, we must at
3921 * least pretend like we wanted to add it even if it existed before,
3922 * or we get possible typo warnings. OPpCONST_ENTERED says
3923 * whether the lexer already added THIS instance of this symbol.
3925 gv = gv_fetchpv(name,
3926 iscv | !(kid->op_private & OPpCONST_ENTERED),
3929 : o->op_type == OP_RV2SV
3931 : o->op_type == OP_RV2AV
3933 : o->op_type == OP_RV2HV
3937 SvREFCNT_dec(kid->op_sv);
3938 kid->op_sv = SvREFCNT_inc(gv);
3947 I32 type = o->op_type;
3949 if (o->op_flags & OPf_REF)
3952 if (o->op_flags & OPf_KIDS) {
3953 SVOP *kid = (SVOP*)cUNOPo->op_first;
3955 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3956 OP *newop = newGVOP(type, OPf_REF,
3957 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
3964 if (type == OP_FTTTY)
3965 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
3968 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3981 int type = o->op_type;
3982 register I32 oa = opargs[type] >> OASHIFT;
3984 if (o->op_flags & OPf_STACKED) {
3985 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
3988 return no_fh_allowed(o);
3991 if (o->op_flags & OPf_KIDS) {
3992 tokid = &cLISTOPo->op_first;
3993 kid = cLISTOPo->op_first;
3994 if (kid->op_type == OP_PUSHMARK ||
3995 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
3997 tokid = &kid->op_sibling;
3998 kid = kid->op_sibling;
4000 if (!kid && opargs[type] & OA_DEFGV)
4001 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
4005 sibl = kid->op_sibling;
4019 if (kid->op_type == OP_CONST &&
4020 (kid->op_private & OPpCONST_BARE)) {
4021 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4022 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4023 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4025 warn("Array @%s missing the @ in argument %ld of %s()",
4026 name, (long)numargs, op_desc[type]);
4029 kid->op_sibling = sibl;
4032 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4033 bad_type(numargs, "array", op_desc[o->op_type], kid);
4037 if (kid->op_type == OP_CONST &&
4038 (kid->op_private & OPpCONST_BARE)) {
4039 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4040 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4041 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4043 warn("Hash %%%s missing the %% in argument %ld of %s()",
4044 name, (long)numargs, op_desc[type]);
4047 kid->op_sibling = sibl;
4050 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4051 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4056 OP *newop = newUNOP(OP_NULL, 0, kid);
4057 kid->op_sibling = 0;
4059 newop->op_next = newop;
4061 kid->op_sibling = sibl;
4066 if (kid->op_type != OP_GV) {
4067 if (kid->op_type == OP_CONST &&
4068 (kid->op_private & OPpCONST_BARE)) {
4069 OP *newop = newGVOP(OP_GV, 0,
4070 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4076 kid->op_sibling = 0;
4077 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4079 kid->op_sibling = sibl;
4085 mod(scalar(kid), type);
4089 tokid = &kid->op_sibling;
4090 kid = kid->op_sibling;
4092 o->op_private |= numargs;
4094 return too_many_arguments(o,op_desc[o->op_type]);
4097 else if (opargs[type] & OA_DEFGV) {
4099 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4103 while (oa & OA_OPTIONAL)
4105 if (oa && oa != OA_LIST)
4106 return too_few_arguments(o,op_desc[o->op_type]);
4116 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4117 append_elem(OP_GLOB, o, newSVREF(newGVOP(OP_GV, 0, defgv)));
4119 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4120 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4122 if (gv && GvIMPORTED_CV(gv)) {
4123 static int glob_index;
4125 append_elem(OP_GLOB, o,
4126 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4127 o->op_type = OP_LIST;
4128 o->op_ppaddr = ppaddr[OP_LIST];
4129 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4130 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4131 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4132 append_elem(OP_LIST, o,
4133 scalar(newUNOP(OP_RV2CV, 0,
4134 newGVOP(OP_GV, 0, gv)))));
4135 o = newUNOP(OP_NULL, 0, ck_subr(o));
4136 o->op_targ = OP_GLOB; /* hint at what it used to be */
4139 gv = newGVgen("main");
4141 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4151 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4153 o->op_ppaddr = ppaddr[OP_GREPSTART];
4154 Newz(1101, gwop, 1, LOGOP);
4156 if (o->op_flags & OPf_STACKED) {
4159 kid = cLISTOPo->op_first->op_sibling;
4160 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4163 kid->op_next = (OP*)gwop;
4164 o->op_flags &= ~OPf_STACKED;
4166 kid = cLISTOPo->op_first->op_sibling;
4167 if (type == OP_MAPWHILE)
4174 kid = cLISTOPo->op_first->op_sibling;
4175 if (kid->op_type != OP_NULL)
4176 croak("panic: ck_grep");
4177 kid = kUNOP->op_first;
4179 gwop->op_type = type;
4180 gwop->op_ppaddr = ppaddr[type];
4181 gwop->op_first = listkids(o);
4182 gwop->op_flags |= OPf_KIDS;
4183 gwop->op_private = 1;
4184 gwop->op_other = LINKLIST(kid);
4185 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4186 kid->op_next = (OP*)gwop;
4188 kid = cLISTOPo->op_first->op_sibling;
4189 if (!kid || !kid->op_sibling)
4190 return too_few_arguments(o,op_desc[o->op_type]);
4191 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4192 mod(kid, OP_GREPSTART);
4200 if (o->op_flags & OPf_KIDS) {
4201 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4202 if (kid && kid->op_type == OP_CONST)
4203 fbm_compile(((SVOP*)kid)->op_sv);
4209 ck_lengthconst(OP *o)
4211 /* XXX length optimization goes here */
4218 OPCODE type = o->op_type;
4219 return modkids(ck_fun(o), type);
4225 OPCODE type = o->op_type;
4226 return refkids(ck_fun(o), type);
4234 kid = cLISTOPo->op_first;
4237 kid = cLISTOPo->op_first;
4239 if (kid->op_type == OP_PUSHMARK)
4240 kid = kid->op_sibling;
4241 if (kid && o->op_flags & OPf_STACKED)
4242 kid = kid->op_sibling;
4243 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4244 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4245 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4246 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4247 cLISTOPo->op_first->op_sibling = kid;
4248 cLISTOPo->op_last = kid;
4249 kid = kid->op_sibling;
4254 append_elem(o->op_type, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4260 if (hints & HINT_LOCALE)
4261 o->op_private |= OPpLOCALE;
4268 ck_fun_locale(OP *o)
4274 if (hints & HINT_LOCALE)
4275 o->op_private |= OPpLOCALE;
4286 if (hints & HINT_LOCALE)
4287 o->op_private |= OPpLOCALE;
4296 o->op_private |= OPpRUNTIME;
4309 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4310 o->op_private |= OPpREPEAT_DOLIST;
4311 cBINOPo->op_first = force_list(cBINOPo->op_first);
4321 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4322 SVOP *kid = (SVOP*)cUNOPo->op_first;
4324 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4326 for (s = SvPVX(kid->op_sv); *s; s++) {
4327 if (*s == ':' && s[1] == ':') {
4329 Move(s+2, s+1, strlen(s+2)+1, char);
4330 --SvCUR(kid->op_sv);
4333 sv_catpvn(kid->op_sv, ".pm", 3);
4342 croak("NOT IMPL LINE %d",__LINE__);
4351 if (o->op_flags & OPf_KIDS) {
4352 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4353 if (kid && kid->op_sibling) {
4354 o->op_type = OP_SSELECT;
4355 o->op_ppaddr = ppaddr[OP_SSELECT];
4357 return fold_constants(o);
4361 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4362 if (kid && kid->op_type == OP_RV2GV)
4363 kid->op_private &= ~HINT_STRICT_REFS;
4370 I32 type = o->op_type;
4372 if (!(o->op_flags & OPf_KIDS)) {
4378 argop = newOP(OP_PADAV, OPf_REF);
4379 argop->op_targ = 0; /* curpad[0] is @_ */
4382 argop = newUNOP(OP_RV2AV, 0,
4383 scalar(newGVOP(OP_GV, 0,
4384 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4387 argop = newUNOP(OP_RV2AV, 0,
4388 scalar(newGVOP(OP_GV, 0, subline ?
4389 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4390 #endif /* USE_THREADS */
4391 return newUNOP(type, 0, scalar(argop));
4393 return scalar(modkids(ck_fun(o), type));
4401 if (hints & HINT_LOCALE)
4402 o->op_private |= OPpLOCALE;
4405 if (o->op_flags & OPf_STACKED) {
4406 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4408 kid = kUNOP->op_first; /* get past rv2gv */
4410 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4412 if (kid->op_type == OP_SCOPE) {
4416 else if (kid->op_type == OP_LEAVE) {
4417 if (o->op_type == OP_SORT) {
4418 null(kid); /* wipe out leave */
4421 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4422 if (k->op_next == kid)
4427 kid->op_next = 0; /* just disconnect the leave */
4428 k = kLISTOP->op_first;
4432 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4433 null(kid); /* wipe out rv2gv */
4434 if (o->op_type == OP_SORT)
4438 o->op_flags |= OPf_SPECIAL;
4451 if (o->op_flags & OPf_STACKED)
4452 return no_fh_allowed(o);
4454 kid = cLISTOPo->op_first;
4455 if (kid->op_type != OP_NULL)
4456 croak("panic: ck_split");
4457 kid = kid->op_sibling;
4458 op_free(cLISTOPo->op_first);
4459 cLISTOPo->op_first = kid;
4461 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4462 cLISTOPo->op_last = kid; /* There was only one element previously */
4465 if (kid->op_type != OP_MATCH) {
4466 OP *sibl = kid->op_sibling;
4467 kid->op_sibling = 0;
4468 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4469 if (cLISTOPo->op_first == cLISTOPo->op_last)
4470 cLISTOPo->op_last = kid;
4471 cLISTOPo->op_first = kid;
4472 kid->op_sibling = sibl;
4475 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4476 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4480 kid->op_type = OP_PUSHRE;
4481 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4484 if (!kid->op_sibling)
4485 append_elem(OP_SPLIT, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4487 kid = kid->op_sibling;
4490 if (!kid->op_sibling)
4491 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4493 kid = kid->op_sibling;
4496 if (kid->op_sibling)
4497 return too_many_arguments(o,op_desc[o->op_type]);
4506 OP *prev = ((cUNOPo->op_first->op_sibling)
4507 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4508 OP *o2 = prev->op_sibling;
4516 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4517 if (cvop->op_type == OP_RV2CV) {
4519 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4520 null(cvop); /* disable rv2cv */
4521 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4522 if (tmpop->op_type == OP_GV) {
4523 cv = GvCVu(tmpop->op_sv);
4524 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4525 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4526 proto = SvPV((SV*)cv, na);
4530 o->op_private |= (hints & HINT_STRICT_REFS);
4531 if (PERLDB_SUB && curstash != debstash)
4532 o->op_private |= OPpENTERSUB_DB;
4533 while (o2 != cvop) {
4537 return too_many_arguments(o, gv_ename(namegv));
4555 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4556 bad_type(arg, "block", gv_ename(namegv), o2);
4561 if (o2->op_type == OP_RV2GV)
4565 o2 = newUNOP(OP_RV2GV, 0, kid);
4566 o2->op_sibling = kid->op_sibling;
4567 kid->op_sibling = 0;
4568 prev->op_sibling = o;
4576 if (o2->op_type != OP_RV2GV)
4577 bad_type(arg, "symbol", gv_ename(namegv), o2);
4580 if (o2->op_type != OP_RV2CV)
4581 bad_type(arg, "sub", gv_ename(namegv), o2);
4584 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4585 bad_type(arg, "scalar", gv_ename(namegv), o2);
4588 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4589 bad_type(arg, "array", gv_ename(namegv), o2);
4592 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4593 bad_type(arg, "hash", gv_ename(namegv), o2);
4597 o2 = newUNOP(OP_REFGEN, 0, kid);
4598 o2->op_sibling = kid->op_sibling;
4599 kid->op_sibling = 0;
4600 prev->op_sibling = o2;
4611 croak("Malformed prototype for %s: %s",
4612 gv_ename(namegv), SvPV((SV*)cv, na));
4617 mod(o2, OP_ENTERSUB);
4619 o2 = o2->op_sibling;
4621 if (proto && !optional &&
4622 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4623 return too_few_arguments(o, gv_ename(namegv));
4630 SvREADONLY_on(cSVOPo->op_sv);
4637 if (o->op_flags & OPf_KIDS) {
4638 SVOP *kid = (SVOP*)cUNOPo->op_first;
4640 if (kid->op_type == OP_NULL)
4641 kid = (SVOP*)kid->op_sibling;
4643 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4644 o->op_flags |= OPf_SPECIAL;
4649 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4652 peep(register OP *o)
4655 register OP* oldop = 0;
4656 if (!o || o->op_seq)
4661 for (; o; o = o->op_next) {
4667 switch (o->op_type) {
4670 curcop = ((COP*)o); /* for warnings */
4671 o->op_seq = op_seqmax++;
4682 if (o->op_next->op_type == OP_STRINGIFY)
4684 o->op_seq = op_seqmax++;
4687 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4688 o->op_seq = op_seqmax++;
4689 break; /* Scalar stub must produce undef. List stub is noop */
4693 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4694 curcop = ((COP*)op);
4700 if (oldop && o->op_next) {
4701 oldop->op_next = o->op_next;
4704 o->op_seq = op_seqmax++;
4708 if (o->op_next->op_type == OP_RV2SV) {
4709 if (!(o->op_next->op_private & OPpDEREF)) {
4711 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4712 o->op_next = o->op_next->op_next;
4713 o->op_type = OP_GVSV;
4714 o->op_ppaddr = ppaddr[OP_GVSV];
4717 else if (o->op_next->op_type == OP_RV2AV) {
4718 OP* pop = o->op_next->op_next;
4720 if (pop->op_type == OP_CONST &&
4721 (op = pop->op_next) &&
4722 pop->op_next->op_type == OP_AELEM &&
4723 !(pop->op_next->op_private &
4724 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4725 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4729 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4733 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4734 o->op_next = pop->op_next->op_next;
4735 o->op_type = OP_AELEMFAST;
4736 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4737 o->op_private = (U8)i;
4738 GvAVn(((GVOP*)o)->op_gv);
4741 o->op_seq = op_seqmax++;
4745 if (o->op_next->op_type == OP_RV2AV
4746 && (o->op_next->op_flags && OPf_REF))
4749 o->op_next = o->op_next->op_next;
4754 if (o->op_next->op_type == OP_RV2HV
4755 && (o->op_next->op_flags && OPf_REF))
4758 o->op_next = o->op_next->op_next;
4766 o->op_seq = op_seqmax++;
4767 peep(cLOGOP->op_other);
4771 o->op_seq = op_seqmax++;
4772 peep(cCONDOP->op_true);
4773 peep(cCONDOP->op_false);
4777 o->op_seq = op_seqmax++;
4778 peep(cLOOP->op_redoop);
4779 peep(cLOOP->op_nextop);
4780 peep(cLOOP->op_lastop);
4785 o->op_seq = op_seqmax++;
4786 peep(cPMOP->op_pmreplstart);
4790 o->op_seq = op_seqmax++;
4791 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4792 if (o->op_next->op_sibling &&
4793 o->op_next->op_sibling->op_type != OP_DIE) {
4794 line_t oldline = curcop->cop_line;
4796 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4797 warn("Statement unlikely to be reached");
4798 warn("(Maybe you meant system() when you said exec()?)\n");
4799 curcop->cop_line = oldline;
4813 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4814 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4816 rop = (UNOP*)((BINOP*)o)->op_first;
4817 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4819 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4820 if (!SvOBJECT(lexname))
4822 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4823 if (!fields || !GvHV(*fields))
4825 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4826 key = SvPV(*svp, keylen);
4827 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4829 croak("No such field \"%s\" in variable %s of type %s",
4830 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4832 ind = SvIV(*indsvp);
4834 croak("Bad index while coercing array into hash");
4835 rop->op_type = OP_RV2AV;
4836 rop->op_ppaddr = ppaddr[OP_RV2AV];
4837 o->op_type = OP_AELEM;
4838 o->op_ppaddr = ppaddr[OP_AELEM];
4840 *svp = newSViv(ind);
4845 o->op_seq = op_seqmax++;