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 #define CHECKCALL this->*check
24 #define CHECKCALL *check
28 * In the following definition, the ", Nullop" is just to make the compiler
29 * think the expression is of the right type: croak actually does a Siglongjmp.
31 #define CHECKOP(type,o) \
32 ((op_mask && op_mask[type]) \
33 ? ( op_free((OP*)o), \
34 croak("%s trapped by operation mask", op_desc[type]), \
36 : (CHECKCALL[type])((OP*)o))
38 static bool scalar_mod_type _((OP *o, I32 type));
40 static I32 list_assignment _((OP *o));
41 static void bad_type _((I32 n, char *t, char *name, OP *kid));
42 static OP *modkids _((OP *o, I32 type));
43 static OP *no_fh_allowed _((OP *o));
44 static OP *scalarboolean _((OP *o));
45 static OP *too_few_arguments _((OP *o, char* name));
46 static OP *too_many_arguments _((OP *o, char* name));
47 static void null _((OP* o));
48 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
49 CV* startcv, I32 cx_ix));
50 static OP *newDEFSVOP _((void));
56 SV* tmpsv = sv_newmortal();
57 gv_efullname3(tmpsv, gv, Nullch);
58 return SvPV(tmpsv,na);
64 yyerror(form("Missing comma after first argument to %s function",
65 op_desc[o->op_type]));
70 too_few_arguments(OP *o, char *name)
72 yyerror(form("Not enough arguments for %s", name));
77 too_many_arguments(OP *o, char *name)
79 yyerror(form("Too many arguments for %s", name));
84 bad_type(I32 n, char *t, char *name, OP *kid)
86 yyerror(form("Type of arg %d to %s must be %s (not %s)",
87 (int)n, name, t, op_desc[kid->op_type]));
93 int type = o->op_type;
94 if (type != OP_AELEM && type != OP_HELEM) {
95 yyerror(form("Can't use subscript on %s", op_desc[type]));
96 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV)
97 warn("(Did you mean $ or @ instead of %c?)\n",
98 type == OP_ENTERSUB ? '&' : '%');
102 /* "register" allocation */
105 pad_allocmy(char *name)
111 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
112 if (!isPRINT(name[1])) {
114 name[2] = toCTRL(name[1]);
117 croak("Can't use global %s in \"my\"",name);
119 if (dowarn && AvFILLp(comppad_name) >= 0) {
120 SV **svp = AvARRAY(comppad_name);
121 for (off = AvFILLp(comppad_name); off > comppad_name_floor; off--) {
124 && SvIVX(sv) == 999999999 /* var is in open scope */
125 && strEQ(name, SvPVX(sv)))
127 warn("\"my\" variable %s masks earlier declaration in same scope", name);
132 off = pad_alloc(OP_PADSV, SVs_PADMY);
134 sv_upgrade(sv, SVt_PVNV);
138 croak("Can't declare class for non-scalar %s in \"my\"",name);
140 (void)SvUPGRADE(sv, SVt_PVMG);
141 SvSTASH(sv) = (HV*)SvREFCNT_inc(in_my_stash);
144 av_store(comppad_name, off, sv);
145 SvNVX(sv) = (double)999999999;
146 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
147 if (!min_intro_pending)
148 min_intro_pending = off;
149 max_intro_pending = off;
151 av_store(comppad, off, (SV*)newAV());
152 else if (*name == '%')
153 av_store(comppad, off, (SV*)newHV());
154 SvPADMY_on(curpad[off]);
159 #ifndef CAN_PROTOTYPE
160 pad_findlex(name, newoff, seq, startcv, cx_ix)
167 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
175 register PERL_CONTEXT *cx;
178 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
179 AV *curlist = CvPADLIST(cv);
180 SV **svp = av_fetch(curlist, 0, FALSE);
183 if (!svp || *svp == &sv_undef)
186 svp = AvARRAY(curname);
187 for (off = AvFILLp(curname); off > 0; off--) {
188 if ((sv = svp[off]) &&
191 seq > I_32(SvNVX(sv)) &&
192 strEQ(SvPVX(sv), name))
203 return 0; /* don't clone from inactive stack frame */
207 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
208 oldsv = *av_fetch(oldpad, off, TRUE);
209 if (!newoff) { /* Not a mere clone operation. */
210 SV *namesv = NEWSV(1103,0);
211 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
212 sv_upgrade(namesv, SVt_PVNV);
213 sv_setpv(namesv, name);
214 av_store(comppad_name, newoff, namesv);
215 SvNVX(namesv) = (double)curcop->cop_seq;
216 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
217 SvFAKE_on(namesv); /* A ref, not a real var */
218 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
219 /* "It's closures all the way down." */
223 oldsv = Nullsv; /* no need to keep ref */
228 bcv && bcv != cv && !CvCLONE(bcv);
229 bcv = CvOUTSIDE(bcv)) {
233 if (dowarn && !CvUNIQUE(cv))
235 "Variable \"%s\" may be unavailable",
242 else if (!CvUNIQUE(compcv)) {
243 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
244 warn("Variable \"%s\" will not stay shared", name);
247 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
253 /* Nothing in current lexical context--try eval's context, if any.
254 * This is necessary to let the perldb get at lexically scoped variables.
255 * XXX This will also probably interact badly with eval tree caching.
259 for (i = cx_ix; i >= 0; i--) {
261 switch (cx->cx_type) {
263 if (i == 0 && saweval) {
264 seq = cxstack[saweval].blk_oldcop->cop_seq;
265 return pad_findlex(name, newoff, seq, main_cv, 0);
269 switch (cx->blk_eval.old_op_type) {
274 /* require must have its own scope */
282 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
283 saweval = i; /* so we know where we were called from */
286 seq = cxstack[saweval].blk_oldcop->cop_seq;
287 return pad_findlex(name, newoff, seq, cv, i-1);
295 pad_findmy(char *name)
301 SV **svp = AvARRAY(comppad_name);
302 U32 seq = cop_seqmax;
306 * Special case to get lexical (and hence per-thread) @_.
307 * XXX I need to find out how to tell at parse-time whether use
308 * of @_ should refer to a lexical (from a sub) or defgv (global
309 * scope and maybe weird sub-ish things like formats). See
310 * startsub in perly.y. It's possible that @_ could be lexical
311 * (at least from subs) even in non-threaded perl.
313 if (strEQ(name, "@_"))
314 return 0; /* success. (NOT_IN_PAD indicates failure) */
315 #endif /* USE_THREADS */
317 /* The one we're looking for is probably just before comppad_name_fill. */
318 for (off = AvFILLp(comppad_name); off > 0; off--) {
319 if ((sv = svp[off]) &&
323 seq > I_32(SvNVX(sv)))) &&
324 strEQ(SvPVX(sv), name))
327 return (PADOFFSET)off;
328 pendoff = off; /* this pending def. will override import */
332 /* See if it's in a nested scope */
333 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
335 /* If there is a pending local definition, this new alias must die */
337 SvIVX(AvARRAY(comppad_name)[off]) = seq;
338 return off; /* pad_findlex returns 0 for failure...*/
340 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
344 pad_leavemy(I32 fill)
347 SV **svp = AvARRAY(comppad_name);
349 if (min_intro_pending && fill < min_intro_pending) {
350 for (off = max_intro_pending; off >= min_intro_pending; off--) {
351 if ((sv = svp[off]) && sv != &sv_undef)
352 warn("%s never introduced", SvPVX(sv));
355 /* "Deintroduce" my variables that are leaving with this scope. */
356 for (off = AvFILLp(comppad_name); off > fill; off--) {
357 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
358 SvIVX(sv) = cop_seqmax;
363 pad_alloc(I32 optype, U32 tmptype)
369 if (AvARRAY(comppad) != curpad)
370 croak("panic: pad_alloc");
371 if (pad_reset_pending)
373 if (tmptype & SVs_PADMY) {
375 sv = *av_fetch(comppad, AvFILLp(comppad) + 1, TRUE);
376 } while (SvPADBUSY(sv)); /* need a fresh one */
377 retval = AvFILLp(comppad);
380 SV **names = AvARRAY(comppad_name);
381 SSize_t names_fill = AvFILLp(comppad_name);
384 * "foreach" index vars temporarily become aliases to non-"my"
385 * values. Thus we must skip, not just pad values that are
386 * marked as current pad values, but also those with names.
388 if (++padix <= names_fill &&
389 (sv = names[padix]) && sv != &sv_undef)
391 sv = *av_fetch(comppad, padix, TRUE);
392 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
397 SvFLAGS(sv) |= tmptype;
398 curpad = AvARRAY(comppad);
400 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
401 (unsigned long) thr, (unsigned long) curpad,
402 (long) retval, op_name[optype]));
404 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
405 (unsigned long) curpad,
406 (long) retval, op_name[optype]));
407 #endif /* USE_THREADS */
408 return (PADOFFSET)retval;
412 #ifndef CAN_PROTOTYPE
417 #endif /* CAN_PROTOTYPE */
421 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
422 (unsigned long) thr, (unsigned long) curpad, po));
425 croak("panic: pad_sv po");
426 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
427 (unsigned long) curpad, po));
428 #endif /* USE_THREADS */
429 return curpad[po]; /* eventually we'll turn this into a macro */
433 #ifndef CAN_PROTOTYPE
437 pad_free(PADOFFSET po)
438 #endif /* CAN_PROTOTYPE */
443 if (AvARRAY(comppad) != curpad)
444 croak("panic: pad_free curpad");
446 croak("panic: pad_free po");
448 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
449 (unsigned long) thr, (unsigned long) curpad, po));
451 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
452 (unsigned long) curpad, po));
453 #endif /* USE_THREADS */
454 if (curpad[po] && curpad[po] != &sv_undef)
455 SvPADTMP_off(curpad[po]);
461 #ifndef CAN_PROTOTYPE
465 pad_swipe(PADOFFSET po)
466 #endif /* CAN_PROTOTYPE */
469 if (AvARRAY(comppad) != curpad)
470 croak("panic: pad_swipe curpad");
472 croak("panic: pad_swipe po");
474 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
475 (unsigned long) thr, (unsigned long) curpad, po));
477 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
478 (unsigned long) curpad, po));
479 #endif /* USE_THREADS */
480 SvPADTMP_off(curpad[po]);
481 curpad[po] = NEWSV(1107,0);
482 SvPADTMP_on(curpad[po]);
487 /* XXX pad_reset() is currently disabled because it results in serious bugs.
488 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
489 * on the stack by OPs that use them, there are several ways to get an alias
490 * to a shared TARG. Such an alias will change randomly and unpredictably.
491 * We avoid doing this until we can think of a Better Way.
496 #ifdef USE_BROKEN_PAD_RESET
500 if (AvARRAY(comppad) != curpad)
501 croak("panic: pad_reset curpad");
503 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
504 (unsigned long) thr, (unsigned long) curpad));
506 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
507 (unsigned long) curpad));
508 #endif /* USE_THREADS */
509 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
510 for (po = AvMAX(comppad); po > padix_floor; po--) {
511 if (curpad[po] && !SvIMMORTAL(curpad[po]))
512 SvPADTMP_off(curpad[po]);
517 pad_reset_pending = FALSE;
521 /* find_threadsv is not reentrant */
523 find_threadsv(char *name)
529 /* We currently only handle names of a single character */
530 p = strchr(threadsv_names, *name);
533 key = p - threadsv_names;
534 svp = av_fetch(thr->threadsv, key, FALSE);
536 SV *sv = NEWSV(0, 0);
537 av_store(thr->threadsv, key, sv);
538 thr->threadsvp = AvARRAY(thr->threadsv);
540 * Some magic variables used to be automagically initialised
541 * in gv_fetchpv. Those which are now per-thread magicals get
542 * initialised here instead.
548 sv_setpv(sv, "\034");
549 sv_magic(sv, 0, 0, name, 1);
558 sv_magic(sv, 0, 0, name, 1);
560 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
561 "find_threadsv: new SV %p for $%s%c\n",
562 sv, (*name < 32) ? "^" : "",
563 (*name < 32) ? toCTRL(*name) : *name));
567 #endif /* USE_THREADS */
574 register OP *kid, *nextkid;
576 if (!o || o->op_seq == (U16)-1)
579 if (o->op_flags & OPf_KIDS) {
580 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
581 nextkid = kid->op_sibling; /* Get before next freeing kid */
586 switch (o->op_type) {
588 o->op_targ = 0; /* Was holding old type, if any. */
591 o->op_targ = 0; /* Was holding hints. */
595 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
597 #endif /* USE_THREADS */
599 if (!(o->op_flags & OPf_REF) || (check[o->op_type] != ck_ftst))
605 SvREFCNT_dec(cGVOPo->op_gv);
609 Safefree(cCOPo->cop_label);
610 SvREFCNT_dec(cCOPo->cop_filegv);
613 SvREFCNT_dec(cSVOPo->op_sv);
619 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
623 Safefree(cPVOPo->op_pv);
626 op_free(cPMOPo->op_pmreplroot);
630 ReREFCNT_dec(cPMOPo->op_pmregexp);
635 pad_free(o->op_targ);
643 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
644 pad_free(o->op_targ);
645 o->op_targ = o->op_type;
646 o->op_type = OP_NULL;
647 o->op_ppaddr = ppaddr[OP_NULL];
650 /* Contextualizers */
652 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
662 /* establish postfix order */
663 if (cUNOPo->op_first) {
664 o->op_next = LINKLIST(cUNOPo->op_first);
665 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
667 kid->op_next = LINKLIST(kid->op_sibling);
682 if (o && o->op_flags & OPf_KIDS) {
683 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
693 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
695 line_t oldline = curcop->cop_line;
697 if (copline != NOLINE)
698 curcop->cop_line = copline;
699 warn("Found = in conditional, should be ==");
700 curcop->cop_line = oldline;
710 /* assumes no premature commitment */
711 if (!o || (o->op_flags & OPf_WANT) || error_count
712 || o->op_type == OP_RETURN)
715 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
717 switch (o->op_type) {
719 if (o->op_private & OPpREPEAT_DOLIST)
720 null(((LISTOP*)cBINOPo->op_first)->op_first);
721 scalar(cBINOPo->op_first);
726 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
730 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
731 if (!kPMOP->op_pmreplroot)
732 deprecate("implicit split to @_");
739 if (o->op_flags & OPf_KIDS) {
740 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
746 kid = cLISTOPo->op_first;
748 while (kid = kid->op_sibling) {
754 WITH_THR(curcop = &compiling);
759 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
765 WITH_THR(curcop = &compiling);
778 /* assumes no premature commitment */
779 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
780 || o->op_type == OP_RETURN)
783 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
785 switch (o->op_type) {
787 if (!(opargs[o->op_type] & OA_FOLDCONST))
791 if (o->op_flags & OPf_STACKED)
862 if (!(o->op_private & OPpLVAL_INTRO))
863 useless = op_desc[o->op_type];
870 if (!(o->op_private & OPpLVAL_INTRO) &&
871 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
872 useless = "a variable";
877 WITH_THR(curcop = ((COP*)o)); /* for warning below */
883 useless = "a constant";
884 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
886 else if (SvPOK(sv)) {
887 if (strnEQ(SvPVX(sv), "di", 2) ||
888 strnEQ(SvPVX(sv), "ds", 2) ||
889 strnEQ(SvPVX(sv), "ig", 2))
893 null(o); /* don't execute a constant */
894 SvREFCNT_dec(sv); /* don't even remember it */
898 o->op_type = OP_PREINC; /* pre-increment is faster */
899 o->op_ppaddr = ppaddr[OP_PREINC];
903 o->op_type = OP_PREDEC; /* pre-decrement is faster */
904 o->op_ppaddr = ppaddr[OP_PREDEC];
910 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
915 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
916 WITH_THR(curcop = ((COP*)o)); /* for warning below */
917 if (o->op_flags & OPf_STACKED)
923 if (!(o->op_flags & OPf_KIDS))
932 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
939 /* all requires must return a boolean value */
940 o->op_flags &= ~OPf_WANT;
943 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
944 if (!kPMOP->op_pmreplroot)
945 deprecate("implicit split to @_");
949 if (useless && dowarn)
950 warn("Useless use of %s in void context", useless);
958 if (o && o->op_flags & OPf_KIDS) {
959 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
970 /* assumes no premature commitment */
971 if (!o || (o->op_flags & OPf_WANT) || error_count
972 || o->op_type == OP_RETURN)
975 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
977 switch (o->op_type) {
980 list(cBINOPo->op_first);
985 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
992 if (!(o->op_flags & OPf_KIDS))
994 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
995 list(cBINOPo->op_first);
996 return gen_constant_list(o);
1003 kid = cLISTOPo->op_first;
1005 while (kid = kid->op_sibling) {
1006 if (kid->op_sibling)
1011 WITH_THR(curcop = &compiling);
1015 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1016 if (kid->op_sibling)
1021 WITH_THR(curcop = &compiling);
1024 /* all requires must return a boolean value */
1025 o->op_flags &= ~OPf_WANT;
1037 if (o->op_type == OP_LINESEQ ||
1038 o->op_type == OP_SCOPE ||
1039 o->op_type == OP_LEAVE ||
1040 o->op_type == OP_LEAVETRY)
1043 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1044 if (kid->op_sibling) {
1048 curcop = &compiling;
1050 o->op_flags &= ~OPf_PARENS;
1051 if (hints & HINT_BLOCK_SCOPE)
1052 o->op_flags |= OPf_PARENS;
1055 o = newOP(OP_STUB, 0);
1060 modkids(OP *o, I32 type)
1063 if (o && o->op_flags & OPf_KIDS) {
1064 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1071 mod(OP *o, I32 type)
1077 if (!o || error_count)
1080 switch (o->op_type) {
1085 if (!(o->op_private & (OPpCONST_ARYBASE)))
1087 if (eval_start && eval_start->op_type == OP_CONST) {
1088 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1092 SAVEI32(compiling.cop_arybase);
1093 compiling.cop_arybase = 0;
1095 else if (type == OP_REFGEN)
1098 croak("That use of $[ is unsupported");
1101 if (o->op_flags & OPf_PARENS)
1105 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1106 !(o->op_flags & OPf_STACKED)) {
1107 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1108 o->op_ppaddr = ppaddr[OP_RV2CV];
1109 assert(cUNOPo->op_first->op_type == OP_NULL);
1110 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1116 /* grep, foreach, subcalls, refgen */
1117 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1119 yyerror(form("Can't modify %s in %s",
1120 op_desc[o->op_type],
1121 type ? op_desc[type] : "local"));
1135 case OP_RIGHT_SHIFT:
1144 if (!(o->op_flags & OPf_STACKED))
1150 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1156 if (!type && cUNOPo->op_first->op_type != OP_GV)
1157 croak("Can't localize through a reference");
1158 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1160 return o; /* Treat \(@foo) like ordinary list. */
1164 if (scalar_mod_type(o, type))
1166 ref(cUNOPo->op_first, o->op_type);
1178 if (!type && cUNOPo->op_first->op_type != OP_GV)
1179 croak("Can't localize through a reference");
1180 ref(cUNOPo->op_first, o->op_type);
1184 hints |= HINT_BLOCK_SCOPE;
1193 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1194 return o; /* Treat \(@foo) like ordinary list. */
1195 if (scalar_mod_type(o, type))
1201 croak("Can't localize lexical variable %s",
1202 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1207 modcount++; /* XXX ??? */
1209 #endif /* USE_THREADS */
1215 if (type != OP_SASSIGN)
1221 pad_free(o->op_targ);
1222 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1223 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1224 if (o->op_flags & OPf_KIDS)
1225 mod(cBINOPo->op_first->op_sibling, type);
1230 ref(cBINOPo->op_first, o->op_type);
1231 if (type == OP_ENTERSUB &&
1232 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1233 o->op_private |= OPpLVAL_DEFER;
1240 if (o->op_flags & OPf_KIDS)
1241 mod(cLISTOPo->op_last, type);
1245 if (!(o->op_flags & OPf_KIDS))
1247 if (o->op_targ != OP_LIST) {
1248 mod(cBINOPo->op_first, type);
1253 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1257 o->op_flags |= OPf_MOD;
1259 if (type == OP_AASSIGN || type == OP_SASSIGN)
1260 o->op_flags |= OPf_SPECIAL|OPf_REF;
1262 o->op_private |= OPpLVAL_INTRO;
1263 o->op_flags &= ~OPf_SPECIAL;
1265 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1266 o->op_flags |= OPf_REF;
1271 scalar_mod_type(OP *o, I32 type)
1275 if (o->op_type == OP_RV2GV)
1299 case OP_RIGHT_SHIFT:
1306 case OP_ANDASSIGN: /* may work later */
1307 case OP_ORASSIGN: /* may work later */
1315 refkids(OP *o, I32 type)
1318 if (o && o->op_flags & OPf_KIDS) {
1319 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1326 ref(OP *o, I32 type)
1330 if (!o || error_count)
1333 switch (o->op_type) {
1335 if ((type == OP_DEFINED || type == OP_LOCK) &&
1336 !(o->op_flags & OPf_STACKED)) {
1337 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1338 o->op_ppaddr = ppaddr[OP_RV2CV];
1339 assert(cUNOPo->op_first->op_type == OP_NULL);
1340 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1341 o->op_flags |= OPf_SPECIAL;
1346 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1350 ref(cUNOPo->op_first, o->op_type);
1353 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1354 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1355 : type == OP_RV2HV ? OPpDEREF_HV
1357 o->op_flags |= OPf_MOD;
1362 o->op_flags |= OPf_MOD; /* XXX ??? */
1367 o->op_flags |= OPf_REF;
1370 ref(cUNOPo->op_first, o->op_type);
1375 o->op_flags |= OPf_REF;
1380 if (!(o->op_flags & OPf_KIDS))
1382 ref(cBINOPo->op_first, type);
1386 ref(cBINOPo->op_first, o->op_type);
1387 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1388 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1389 : type == OP_RV2HV ? OPpDEREF_HV
1391 o->op_flags |= OPf_MOD;
1399 if (!(o->op_flags & OPf_KIDS))
1401 ref(cLISTOPo->op_last, type);
1416 if (!o || error_count)
1420 if (type == OP_LIST) {
1421 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1424 else if (type != OP_PADSV &&
1427 type != OP_PUSHMARK)
1429 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1432 o->op_flags |= OPf_MOD;
1433 o->op_private |= OPpLVAL_INTRO;
1441 o->op_flags |= OPf_PARENS;
1446 bind_match(I32 type, OP *left, OP *right)
1451 (left->op_type == OP_RV2AV ||
1452 left->op_type == OP_RV2HV ||
1453 left->op_type == OP_PADAV ||
1454 left->op_type == OP_PADHV)) {
1455 char *desc = op_desc[(right->op_type == OP_SUBST ||
1456 right->op_type == OP_TRANS)
1457 ? right->op_type : OP_MATCH];
1458 char *sample = ((left->op_type == OP_RV2AV ||
1459 left->op_type == OP_PADAV)
1460 ? "@array" : "%hash");
1461 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1464 if (right->op_type == OP_MATCH ||
1465 right->op_type == OP_SUBST ||
1466 right->op_type == OP_TRANS) {
1467 right->op_flags |= OPf_STACKED;
1468 if (right->op_type != OP_MATCH)
1469 left = mod(left, right->op_type);
1470 if (right->op_type == OP_TRANS)
1471 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1473 o = prepend_elem(right->op_type, scalar(left), right);
1475 return newUNOP(OP_NOT, 0, scalar(o));
1479 return bind_match(type, left,
1480 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1488 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1489 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1496 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1497 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1498 o->op_type = OP_LEAVE;
1499 o->op_ppaddr = ppaddr[OP_LEAVE];
1502 if (o->op_type == OP_LINESEQ) {
1504 o->op_type = OP_SCOPE;
1505 o->op_ppaddr = ppaddr[OP_SCOPE];
1506 kid = ((LISTOP*)o)->op_first;
1507 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1508 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1513 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1520 block_start(int full)
1523 int retval = savestack_ix;
1524 SAVEI32(comppad_name_floor);
1526 if ((comppad_name_fill = AvFILLp(comppad_name)) > 0)
1527 comppad_name_floor = comppad_name_fill;
1529 comppad_name_floor = 0;
1531 SAVEI32(min_intro_pending);
1532 SAVEI32(max_intro_pending);
1533 min_intro_pending = 0;
1534 SAVEI32(comppad_name_fill);
1535 SAVEI32(padix_floor);
1536 padix_floor = padix;
1537 pad_reset_pending = FALSE;
1539 hints &= ~HINT_BLOCK_SCOPE;
1544 block_end(I32 floor, OP *seq)
1547 int needblockscope = hints & HINT_BLOCK_SCOPE;
1548 OP* retval = scalarseq(seq);
1550 pad_reset_pending = FALSE;
1552 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1553 pad_leavemy(comppad_name_fill);
1562 OP *o = newOP(OP_THREADSV, 0);
1563 o->op_targ = find_threadsv("_");
1566 return newSVREF(newGVOP(OP_GV, 0, defgv));
1567 #endif /* USE_THREADS */
1575 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1576 eval_start = linklist(eval_root);
1577 eval_root->op_next = 0;
1583 main_root = scope(sawparens(scalarvoid(o)));
1584 curcop = &compiling;
1585 main_start = LINKLIST(main_root);
1586 main_root->op_next = 0;
1590 /* Register with debugger */
1592 CV *cv = perl_get_cv("DB::postponed", FALSE);
1596 XPUSHs((SV*)compiling.cop_filegv);
1598 perl_call_sv((SV*)cv, G_DISCARD);
1605 localize(OP *o, I32 lex)
1607 if (o->op_flags & OPf_PARENS)
1610 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1612 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1613 if (*s == ';' || *s == '=')
1614 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1618 in_my_stash = Nullhv;
1622 return mod(o, OP_NULL); /* a bit kludgey */
1628 if (o->op_type == OP_LIST) {
1631 o2 = newOP(OP_THREADSV, 0);
1632 o2->op_targ = find_threadsv(";");
1634 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1635 #endif /* USE_THREADS */
1636 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1642 fold_constants(register OP *o)
1646 I32 type = o->op_type;
1649 if (opargs[type] & OA_RETSCALAR)
1651 if (opargs[type] & OA_TARGET)
1652 o->op_targ = pad_alloc(type, SVs_PADTMP);
1654 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1655 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1657 if (!(opargs[type] & OA_FOLDCONST))
1672 if (o->op_private & OPpLOCALE)
1677 goto nope; /* Don't try to run w/ errors */
1679 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1680 if (curop->op_type != OP_CONST &&
1681 curop->op_type != OP_LIST &&
1682 curop->op_type != OP_SCALAR &&
1683 curop->op_type != OP_NULL &&
1684 curop->op_type != OP_PUSHMARK) {
1689 curop = LINKLIST(o);
1694 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1695 pad_swipe(o->op_targ);
1696 else if (SvTEMP(sv)) { /* grab mortal temp? */
1697 (void)SvREFCNT_inc(sv);
1701 if (type == OP_RV2GV)
1702 return newGVOP(OP_GV, 0, (GV*)sv);
1704 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1706 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1711 SvIOK_off(sv); /* undo SvIV() damage */
1713 return newSVOP(OP_CONST, 0, sv);
1717 if (!(opargs[type] & OA_OTHERINT))
1720 if (!(hints & HINT_INTEGER)) {
1721 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1724 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1725 if (curop->op_type == OP_CONST) {
1726 if (SvIOK(((SVOP*)curop)->op_sv))
1730 if (opargs[curop->op_type] & OA_RETINTEGER)
1734 o->op_ppaddr = ppaddr[++(o->op_type)];
1741 gen_constant_list(register OP *o)
1745 I32 oldtmps_floor = tmps_floor;
1749 return o; /* Don't attempt to run with errors */
1751 op = curop = LINKLIST(o);
1757 tmps_floor = oldtmps_floor;
1759 o->op_type = OP_RV2AV;
1760 o->op_ppaddr = ppaddr[OP_RV2AV];
1761 curop = ((UNOP*)o)->op_first;
1762 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1769 convert(I32 type, I32 flags, OP *o)
1774 if (!o || o->op_type != OP_LIST)
1775 o = newLISTOP(OP_LIST, 0, o, Nullop);
1777 o->op_flags &= ~OPf_WANT;
1779 if (!(opargs[type] & OA_MARK))
1780 null(cLISTOPo->op_first);
1783 o->op_ppaddr = ppaddr[type];
1784 o->op_flags |= flags;
1786 o = CHECKOP(type, o);
1787 if (o->op_type != type)
1790 if (cLISTOPo->op_children < 7) {
1791 /* XXX do we really need to do this if we're done appending?? */
1792 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1794 cLISTOPo->op_last = last; /* in case check substituted last arg */
1797 return fold_constants(o);
1800 /* List constructors */
1803 append_elem(I32 type, OP *first, OP *last)
1811 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1812 return newLISTOP(type, 0, first, last);
1814 if (first->op_flags & OPf_KIDS)
1815 ((LISTOP*)first)->op_last->op_sibling = last;
1817 first->op_flags |= OPf_KIDS;
1818 ((LISTOP*)first)->op_first = last;
1820 ((LISTOP*)first)->op_last = last;
1821 ((LISTOP*)first)->op_children++;
1826 append_list(I32 type, LISTOP *first, LISTOP *last)
1834 if (first->op_type != type)
1835 return prepend_elem(type, (OP*)first, (OP*)last);
1837 if (last->op_type != type)
1838 return append_elem(type, (OP*)first, (OP*)last);
1840 first->op_last->op_sibling = last->op_first;
1841 first->op_last = last->op_last;
1842 first->op_children += last->op_children;
1843 if (first->op_children)
1844 last->op_flags |= OPf_KIDS;
1851 prepend_elem(I32 type, OP *first, OP *last)
1859 if (last->op_type == type) {
1860 if (type == OP_LIST) { /* already a PUSHMARK there */
1861 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1862 ((LISTOP*)last)->op_first->op_sibling = first;
1865 if (!(last->op_flags & OPf_KIDS)) {
1866 ((LISTOP*)last)->op_last = first;
1867 last->op_flags |= OPf_KIDS;
1869 first->op_sibling = ((LISTOP*)last)->op_first;
1870 ((LISTOP*)last)->op_first = first;
1872 ((LISTOP*)last)->op_children++;
1876 return newLISTOP(type, 0, first, last);
1884 return newOP(OP_STUB, 0);
1890 if (!o || o->op_type != OP_LIST)
1891 o = newLISTOP(OP_LIST, 0, o, Nullop);
1897 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1901 Newz(1101, listop, 1, LISTOP);
1903 listop->op_type = type;
1904 listop->op_ppaddr = ppaddr[type];
1905 listop->op_children = (first != 0) + (last != 0);
1906 listop->op_flags = flags;
1910 else if (!first && last)
1913 first->op_sibling = last;
1914 listop->op_first = first;
1915 listop->op_last = last;
1916 if (type == OP_LIST) {
1918 pushop = newOP(OP_PUSHMARK, 0);
1919 pushop->op_sibling = first;
1920 listop->op_first = pushop;
1921 listop->op_flags |= OPf_KIDS;
1923 listop->op_last = pushop;
1925 else if (listop->op_children)
1926 listop->op_flags |= OPf_KIDS;
1932 newOP(I32 type, I32 flags)
1935 Newz(1101, o, 1, OP);
1937 o->op_ppaddr = ppaddr[type];
1938 o->op_flags = flags;
1941 o->op_private = 0 + (flags >> 8);
1942 if (opargs[type] & OA_RETSCALAR)
1944 if (opargs[type] & OA_TARGET)
1945 o->op_targ = pad_alloc(type, SVs_PADTMP);
1946 return CHECKOP(type, o);
1950 newUNOP(I32 type, I32 flags, OP *first)
1955 first = newOP(OP_STUB, 0);
1956 if (opargs[type] & OA_MARK)
1957 first = force_list(first);
1959 Newz(1101, unop, 1, UNOP);
1960 unop->op_type = type;
1961 unop->op_ppaddr = ppaddr[type];
1962 unop->op_first = first;
1963 unop->op_flags = flags | OPf_KIDS;
1964 unop->op_private = 1 | (flags >> 8);
1966 if(type == OP_STUDY && first->op_type == OP_MATCH) {
1967 first->op_type = OP_PUSHRE;
1968 first->op_ppaddr = ppaddr[OP_PUSHRE];
1971 unop = (UNOP*) CHECKOP(type, unop);
1975 return fold_constants((OP *) unop);
1979 newBINOP(I32 type, I32 flags, OP *first, OP *last)
1982 Newz(1101, binop, 1, BINOP);
1985 first = newOP(OP_NULL, 0);
1987 binop->op_type = type;
1988 binop->op_ppaddr = ppaddr[type];
1989 binop->op_first = first;
1990 binop->op_flags = flags | OPf_KIDS;
1993 binop->op_private = 1 | (flags >> 8);
1996 binop->op_private = 2 | (flags >> 8);
1997 first->op_sibling = last;
2000 binop = (BINOP*)CHECKOP(type, binop);
2004 binop->op_last = last = binop->op_first->op_sibling;
2006 return fold_constants((OP *)binop);
2010 pmtrans(OP *o, OP *expr, OP *repl)
2012 SV *tstr = ((SVOP*)expr)->op_sv;
2013 SV *rstr = ((SVOP*)repl)->op_sv;
2016 register U8 *t = (U8*)SvPV(tstr, tlen);
2017 register U8 *r = (U8*)SvPV(rstr, rlen);
2023 register short *tbl;
2025 tbl = (short*)cPVOPo->op_pv;
2026 complement = o->op_private & OPpTRANS_COMPLEMENT;
2027 Delete = o->op_private & OPpTRANS_DELETE;
2028 squash = o->op_private & OPpTRANS_SQUASH;
2031 Zero(tbl, 256, short);
2032 for (i = 0; i < tlen; i++)
2034 for (i = 0, j = 0; i < 256; i++) {
2050 if (!rlen && !Delete) {
2053 o->op_private |= OPpTRANS_COUNTONLY;
2055 for (i = 0; i < 256; i++)
2057 for (i = 0, j = 0; i < tlen; i++,j++) {
2060 if (tbl[t[i]] == -1)
2066 if (tbl[t[i]] == -1)
2077 newPMOP(I32 type, I32 flags)
2082 Newz(1101, pmop, 1, PMOP);
2083 pmop->op_type = type;
2084 pmop->op_ppaddr = ppaddr[type];
2085 pmop->op_flags = flags;
2086 pmop->op_private = 0 | (flags >> 8);
2088 if (hints & HINT_LOCALE)
2089 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2091 /* link into pm list */
2092 if (type != OP_TRANS && curstash) {
2093 pmop->op_pmnext = HvPMROOT(curstash);
2094 HvPMROOT(curstash) = pmop;
2101 pmruntime(OP *o, OP *expr, OP *repl)
2106 if (o->op_type == OP_TRANS)
2107 return pmtrans(o, expr, repl);
2109 hints |= HINT_BLOCK_SCOPE;
2112 if (expr->op_type == OP_CONST) {
2114 SV *pat = ((SVOP*)expr)->op_sv;
2115 char *p = SvPV(pat, plen);
2116 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2117 sv_setpvn(pat, "\\s+", 3);
2118 p = SvPV(pat, plen);
2119 pm->op_pmflags |= PMf_SKIPWHITE;
2121 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2122 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2123 pm->op_pmflags |= PMf_WHITE;
2127 if (pm->op_pmflags & PMf_KEEP)
2128 expr = newUNOP(OP_REGCMAYBE,0,expr);
2130 Newz(1101, rcop, 1, LOGOP);
2131 rcop->op_type = OP_REGCOMP;
2132 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2133 rcop->op_first = scalar(expr);
2134 rcop->op_flags |= OPf_KIDS;
2135 rcop->op_private = 1;
2138 /* establish postfix order */
2139 if (pm->op_pmflags & PMf_KEEP) {
2141 rcop->op_next = expr;
2142 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2145 rcop->op_next = LINKLIST(expr);
2146 expr->op_next = (OP*)rcop;
2149 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2154 if (pm->op_pmflags & PMf_EVAL)
2157 else if (repl->op_type == OP_THREADSV
2158 && strchr("&`'123456789+",
2159 threadsv_names[repl->op_targ]))
2163 #endif /* USE_THREADS */
2164 else if (repl->op_type == OP_CONST)
2168 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2169 if (opargs[curop->op_type] & OA_DANGEROUS) {
2171 if (curop->op_type == OP_THREADSV
2172 && strchr("&`'123456789+", curop->op_private)) {
2176 if (curop->op_type == OP_GV) {
2177 GV *gv = ((GVOP*)curop)->op_gv;
2178 if (strchr("&`'123456789+", *GvENAME(gv)))
2181 #endif /* USE_THREADS */
2182 else if (curop->op_type == OP_RV2CV)
2184 else if (curop->op_type == OP_RV2SV ||
2185 curop->op_type == OP_RV2AV ||
2186 curop->op_type == OP_RV2HV ||
2187 curop->op_type == OP_RV2GV) {
2188 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2191 else if (curop->op_type == OP_PADSV ||
2192 curop->op_type == OP_PADAV ||
2193 curop->op_type == OP_PADHV ||
2194 curop->op_type == OP_PADANY) {
2203 if (curop == repl) {
2204 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2205 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2206 prepend_elem(o->op_type, scalar(repl), o);
2209 Newz(1101, rcop, 1, LOGOP);
2210 rcop->op_type = OP_SUBSTCONT;
2211 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2212 rcop->op_first = scalar(repl);
2213 rcop->op_flags |= OPf_KIDS;
2214 rcop->op_private = 1;
2217 /* establish postfix order */
2218 rcop->op_next = LINKLIST(repl);
2219 repl->op_next = (OP*)rcop;
2221 pm->op_pmreplroot = scalar((OP*)rcop);
2222 pm->op_pmreplstart = LINKLIST(rcop);
2231 newSVOP(I32 type, I32 flags, SV *sv)
2234 Newz(1101, svop, 1, SVOP);
2235 svop->op_type = type;
2236 svop->op_ppaddr = ppaddr[type];
2238 svop->op_next = (OP*)svop;
2239 svop->op_flags = flags;
2240 if (opargs[type] & OA_RETSCALAR)
2242 if (opargs[type] & OA_TARGET)
2243 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2244 return CHECKOP(type, svop);
2248 newGVOP(I32 type, I32 flags, GV *gv)
2252 Newz(1101, gvop, 1, GVOP);
2253 gvop->op_type = type;
2254 gvop->op_ppaddr = ppaddr[type];
2255 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2256 gvop->op_next = (OP*)gvop;
2257 gvop->op_flags = flags;
2258 if (opargs[type] & OA_RETSCALAR)
2260 if (opargs[type] & OA_TARGET)
2261 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2262 return CHECKOP(type, gvop);
2266 newPVOP(I32 type, I32 flags, char *pv)
2269 Newz(1101, pvop, 1, PVOP);
2270 pvop->op_type = type;
2271 pvop->op_ppaddr = ppaddr[type];
2273 pvop->op_next = (OP*)pvop;
2274 pvop->op_flags = flags;
2275 if (opargs[type] & OA_RETSCALAR)
2277 if (opargs[type] & OA_TARGET)
2278 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2279 return CHECKOP(type, pvop);
2288 save_hptr(&curstash);
2289 save_item(curstname);
2294 name = SvPV(sv, len);
2295 curstash = gv_stashpvn(name,len,TRUE);
2296 sv_setpvn(curstname, name, len);
2300 sv_setpv(curstname,"<none>");
2308 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2316 if (id->op_type != OP_CONST)
2317 croak("Module name must be constant");
2321 if(version != Nullop) {
2322 SV *vesv = ((SVOP*)version)->op_sv;
2324 if (arg == Nullop && !SvNIOK(vesv)) {
2331 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2332 croak("Version number must be constant number");
2334 /* Make copy of id so we don't free it twice */
2335 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2337 /* Fake up a method call to VERSION */
2338 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2339 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2340 append_elem(OP_LIST,
2341 prepend_elem(OP_LIST, pack, list(version)),
2342 newUNOP(OP_METHOD, 0, meth)));
2346 /* Fake up an import/unimport */
2347 if (arg && arg->op_type == OP_STUB)
2348 imop = arg; /* no import on explicit () */
2349 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2350 imop = Nullop; /* use 5.0; */
2353 /* Make copy of id so we don't free it twice */
2354 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2355 meth = newSVOP(OP_CONST, 0,
2357 ? newSVpv("import", 6)
2358 : newSVpv("unimport", 8)
2360 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2361 append_elem(OP_LIST,
2362 prepend_elem(OP_LIST, pack, list(arg)),
2363 newUNOP(OP_METHOD, 0, meth)));
2366 /* Fake up a require */
2367 rqop = newUNOP(OP_REQUIRE, 0, id);
2369 /* Fake up the BEGIN {}, which does its thing immediately. */
2371 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2373 append_elem(OP_LINESEQ,
2374 append_elem(OP_LINESEQ,
2375 newSTATEOP(0, Nullch, rqop),
2376 newSTATEOP(0, Nullch, veop)),
2377 newSTATEOP(0, Nullch, imop) ));
2384 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2386 return newBINOP(OP_LSLICE, flags,
2387 list(force_list(subscript)),
2388 list(force_list(listval)) );
2392 list_assignment(register OP *o)
2397 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2398 o = cUNOPo->op_first;
2400 if (o->op_type == OP_COND_EXPR) {
2401 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2402 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2407 yyerror("Assignment to both a list and a scalar");
2411 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2412 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2413 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2416 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2419 if (o->op_type == OP_RV2SV)
2426 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2431 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2432 return newLOGOP(optype, 0,
2433 mod(scalar(left), optype),
2434 newUNOP(OP_SASSIGN, 0, scalar(right)));
2437 return newBINOP(optype, OPf_STACKED,
2438 mod(scalar(left), optype), scalar(right));
2442 if (list_assignment(left)) {
2444 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2445 left = mod(left, OP_AASSIGN);
2453 o = newBINOP(OP_AASSIGN, flags,
2454 list(force_list(right)),
2455 list(force_list(left)) );
2456 o->op_private = 0 | (flags >> 8);
2457 if (!(left->op_private & OPpLVAL_INTRO)) {
2461 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2462 if (opargs[curop->op_type] & OA_DANGEROUS) {
2463 if (curop->op_type == OP_GV) {
2464 GV *gv = ((GVOP*)curop)->op_gv;
2465 if (gv == defgv || SvCUR(gv) == generation)
2467 SvCUR(gv) = generation;
2469 else if (curop->op_type == OP_PADSV ||
2470 curop->op_type == OP_PADAV ||
2471 curop->op_type == OP_PADHV ||
2472 curop->op_type == OP_PADANY) {
2473 SV **svp = AvARRAY(comppad_name);
2474 SV *sv = svp[curop->op_targ];
2475 if (SvCUR(sv) == generation)
2477 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2479 else if (curop->op_type == OP_RV2CV)
2481 else if (curop->op_type == OP_RV2SV ||
2482 curop->op_type == OP_RV2AV ||
2483 curop->op_type == OP_RV2HV ||
2484 curop->op_type == OP_RV2GV) {
2485 if (lastop->op_type != OP_GV) /* funny deref? */
2494 o->op_private = OPpASSIGN_COMMON;
2496 if (right && right->op_type == OP_SPLIT) {
2498 if ((tmpop = ((LISTOP*)right)->op_first) &&
2499 tmpop->op_type == OP_PUSHRE)
2501 PMOP *pm = (PMOP*)tmpop;
2502 if (left->op_type == OP_RV2AV &&
2503 !(left->op_private & OPpLVAL_INTRO) &&
2504 !(o->op_private & OPpASSIGN_COMMON) )
2506 tmpop = ((UNOP*)left)->op_first;
2507 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2508 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2509 pm->op_pmflags |= PMf_ONCE;
2510 tmpop = cUNOPo->op_first; /* to list (nulled) */
2511 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2512 tmpop->op_sibling = Nullop; /* don't free split */
2513 right->op_next = tmpop->op_next; /* fix starting loc */
2514 op_free(o); /* blow off assign */
2515 right->op_flags &= ~OPf_WANT;
2516 /* "I don't know and I don't care." */
2521 if (modcount < 10000 &&
2522 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2524 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2526 sv_setiv(sv, modcount+1);
2534 right = newOP(OP_UNDEF, 0);
2535 if (right->op_type == OP_READLINE) {
2536 right->op_flags |= OPf_STACKED;
2537 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2540 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2541 o = newBINOP(OP_SASSIGN, flags,
2542 scalar(right), mod(scalar(left), OP_SASSIGN) );
2554 newSTATEOP(I32 flags, char *label, OP *o)
2557 U32 seq = intro_my();
2560 Newz(1101, cop, 1, COP);
2561 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2562 cop->op_type = OP_DBSTATE;
2563 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2566 cop->op_type = OP_NEXTSTATE;
2567 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2569 cop->op_flags = flags;
2570 cop->op_private = 0 | (flags >> 8);
2572 cop->op_private |= NATIVE_HINTS;
2574 cop->op_next = (OP*)cop;
2577 cop->cop_label = label;
2578 hints |= HINT_BLOCK_SCOPE;
2581 cop->cop_arybase = curcop->cop_arybase;
2583 if (copline == NOLINE)
2584 cop->cop_line = curcop->cop_line;
2586 cop->cop_line = copline;
2589 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2590 cop->cop_stash = curstash;
2592 if (PERLDB_LINE && curstash != debstash) {
2593 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2594 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2595 (void)SvIOK_on(*svp);
2597 SvSTASH(*svp) = (HV*)cop;
2601 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2604 /* "Introduce" my variables to visible status. */
2612 if (! min_intro_pending)
2615 svp = AvARRAY(comppad_name);
2616 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2617 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2618 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2619 SvNVX(sv) = (double)cop_seqmax;
2622 min_intro_pending = 0;
2623 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2624 return cop_seqmax++;
2628 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2634 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2635 return newBINOP(type, flags, scalar(first), scalar(other));
2637 scalarboolean(first);
2638 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2639 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2640 if (type == OP_AND || type == OP_OR) {
2646 first = cUNOPo->op_first;
2648 first->op_next = o->op_next;
2649 cUNOPo->op_first = Nullop;
2653 if (first->op_type == OP_CONST) {
2654 if (dowarn && (first->op_private & OPpCONST_BARE))
2655 warn("Probable precedence problem on %s", op_desc[type]);
2656 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2665 else if (first->op_type == OP_WANTARRAY) {
2671 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2672 OP *k1 = ((UNOP*)first)->op_first;
2673 OP *k2 = k1->op_sibling;
2675 switch (first->op_type)
2678 if (k2 && k2->op_type == OP_READLINE
2679 && (k2->op_flags & OPf_STACKED)
2680 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2681 warnop = k2->op_type;
2685 if (k1->op_type == OP_READDIR
2686 || k1->op_type == OP_GLOB
2687 || k1->op_type == OP_EACH)
2688 warnop = k1->op_type;
2692 line_t oldline = curcop->cop_line;
2693 curcop->cop_line = copline;
2694 warn("Value of %s%s can be \"0\"; test with defined()",
2696 ((warnop == OP_READLINE || warnop == OP_GLOB)
2697 ? " construct" : "() operator"));
2698 curcop->cop_line = oldline;
2705 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2706 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2708 Newz(1101, logop, 1, LOGOP);
2710 logop->op_type = type;
2711 logop->op_ppaddr = ppaddr[type];
2712 logop->op_first = first;
2713 logop->op_flags = flags | OPf_KIDS;
2714 logop->op_other = LINKLIST(other);
2715 logop->op_private = 1 | (flags >> 8);
2717 /* establish postfix order */
2718 logop->op_next = LINKLIST(first);
2719 first->op_next = (OP*)logop;
2720 first->op_sibling = other;
2722 o = newUNOP(OP_NULL, 0, (OP*)logop);
2729 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2736 return newLOGOP(OP_AND, 0, first, trueop);
2738 return newLOGOP(OP_OR, 0, first, falseop);
2740 scalarboolean(first);
2741 if (first->op_type == OP_CONST) {
2742 if (SvTRUE(((SVOP*)first)->op_sv)) {
2753 else if (first->op_type == OP_WANTARRAY) {
2757 Newz(1101, condop, 1, CONDOP);
2759 condop->op_type = OP_COND_EXPR;
2760 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2761 condop->op_first = first;
2762 condop->op_flags = flags | OPf_KIDS;
2763 condop->op_true = LINKLIST(trueop);
2764 condop->op_false = LINKLIST(falseop);
2765 condop->op_private = 1 | (flags >> 8);
2767 /* establish postfix order */
2768 condop->op_next = LINKLIST(first);
2769 first->op_next = (OP*)condop;
2771 first->op_sibling = trueop;
2772 trueop->op_sibling = falseop;
2773 o = newUNOP(OP_NULL, 0, (OP*)condop);
2775 trueop->op_next = o;
2776 falseop->op_next = o;
2782 newRANGE(I32 flags, OP *left, OP *right)
2790 Newz(1101, condop, 1, CONDOP);
2792 condop->op_type = OP_RANGE;
2793 condop->op_ppaddr = ppaddr[OP_RANGE];
2794 condop->op_first = left;
2795 condop->op_flags = OPf_KIDS;
2796 condop->op_true = LINKLIST(left);
2797 condop->op_false = LINKLIST(right);
2798 condop->op_private = 1 | (flags >> 8);
2800 left->op_sibling = right;
2802 condop->op_next = (OP*)condop;
2803 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2804 flop = newUNOP(OP_FLOP, 0, flip);
2805 o = newUNOP(OP_NULL, 0, flop);
2808 left->op_next = flip;
2809 right->op_next = flop;
2811 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2812 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2813 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2814 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2816 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2817 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2820 if (!flip->op_private || !flop->op_private)
2821 linklist(o); /* blow off optimizer unless constant */
2827 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2832 int once = block && block->op_flags & OPf_SPECIAL &&
2833 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2836 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2837 return block; /* do {} while 0 does once */
2838 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2839 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2840 expr = newUNOP(OP_DEFINED, 0,
2841 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2845 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2846 o = newLOGOP(OP_AND, 0, expr, listop);
2848 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2850 if (once && o != listop)
2851 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2854 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2856 o->op_flags |= flags;
2858 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2863 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2872 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2873 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2874 expr = newUNOP(OP_DEFINED, 0,
2875 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2879 block = newOP(OP_NULL, 0);
2882 next = LINKLIST(cont);
2884 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2885 if ((line_t)whileline != NOLINE) {
2886 copline = whileline;
2887 cont = append_elem(OP_LINESEQ, cont,
2888 newSTATEOP(0, Nullch, Nullop));
2892 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2893 redo = LINKLIST(listop);
2896 o = newLOGOP(OP_AND, 0, expr, scalar(listop));
2897 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2898 op_free(expr); /* oops, it's a while (0) */
2900 return Nullop; /* (listop already freed by newLOGOP) */
2902 ((LISTOP*)listop)->op_last->op_next = condop =
2903 (o == listop ? redo : LINKLIST(o));
2911 Newz(1101,loop,1,LOOP);
2912 loop->op_type = OP_ENTERLOOP;
2913 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2914 loop->op_private = 0;
2915 loop->op_next = (OP*)loop;
2918 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2920 loop->op_redoop = redo;
2921 loop->op_lastop = o;
2924 loop->op_nextop = next;
2926 loop->op_nextop = o;
2928 o->op_flags |= flags;
2929 o->op_private |= (flags >> 8);
2934 #ifndef CAN_PROTOTYPE
2935 newFOROP(flags,label,forline,sv,expr,block,cont)
2944 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2945 #endif /* CAN_PROTOTYPE */
2953 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2954 sv->op_type = OP_RV2GV;
2955 sv->op_ppaddr = ppaddr[OP_RV2GV];
2957 else if (sv->op_type == OP_PADSV) { /* private variable */
2958 padoff = sv->op_targ;
2962 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
2963 padoff = sv->op_targ;
2964 iterflags |= OPf_SPECIAL;
2969 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2973 padoff = find_threadsv("_");
2974 iterflags |= OPf_SPECIAL;
2976 sv = newGVOP(OP_GV, 0, defgv);
2979 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
2980 expr = scalar(ref(expr, OP_ITER));
2981 iterflags |= OPf_STACKED;
2983 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2984 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2986 assert(!loop->op_next);
2987 Renew(loop, 1, LOOP);
2988 loop->op_targ = padoff;
2989 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
2991 return newSTATEOP(0, label, wop);
2995 newLOOPEX(I32 type, OP *label)
2999 if (type != OP_GOTO || label->op_type == OP_CONST) {
3000 /* "last()" means "last" */
3001 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3002 o = newOP(type, OPf_SPECIAL);
3004 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3005 ? SvPVx(((SVOP*)label)->op_sv, na)
3011 if (label->op_type == OP_ENTERSUB)
3012 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3013 o = newUNOP(type, OPf_STACKED, label);
3015 hints |= HINT_BLOCK_SCOPE;
3025 MUTEX_DESTROY(CvMUTEXP(cv));
3026 Safefree(CvMUTEXP(cv));
3029 #endif /* USE_THREADS */
3031 if (!CvXSUB(cv) && CvROOT(cv)) {
3033 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3034 croak("Can't undef active subroutine");
3037 croak("Can't undef active subroutine");
3038 #endif /* USE_THREADS */
3045 op_free(CvROOT(cv));
3046 CvROOT(cv) = Nullop;
3049 SvPOK_off((SV*)cv); /* forget prototype */
3051 SvREFCNT_dec(CvGV(cv));
3053 SvREFCNT_dec(CvOUTSIDE(cv));
3054 CvOUTSIDE(cv) = Nullcv;
3055 if (CvPADLIST(cv)) {
3056 /* may be during global destruction */
3057 if (SvREFCNT(CvPADLIST(cv))) {
3058 I32 i = AvFILLp(CvPADLIST(cv));
3060 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3061 SV* sv = svp ? *svp : Nullsv;
3064 if (sv == (SV*)comppad_name)
3065 comppad_name = Nullav;
3066 else if (sv == (SV*)comppad) {
3068 curpad = Null(SV**);
3072 SvREFCNT_dec((SV*)CvPADLIST(cv));
3074 CvPADLIST(cv) = Nullav;
3078 #ifdef DEBUG_CLOSURES
3083 CV *outside = CvOUTSIDE(cv);
3084 AV* padlist = CvPADLIST(cv);
3091 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3093 (CvANON(cv) ? "ANON"
3094 : (cv == main_cv) ? "MAIN"
3095 : CvUNIQUE(outside) ? "UNIQUE"
3096 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3099 : CvANON(outside) ? "ANON"
3100 : (outside == main_cv) ? "MAIN"
3101 : CvUNIQUE(outside) ? "UNIQUE"
3102 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3107 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3108 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3109 pname = AvARRAY(pad_name);
3110 ppad = AvARRAY(pad);
3112 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3113 if (SvPOK(pname[ix]))
3114 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3116 SvFAKE(pname[ix]) ? "FAKE " : "",
3118 (long)I_32(SvNVX(pname[ix])),
3119 (long)SvIVX(pname[ix]));
3122 #endif /* DEBUG_CLOSURES */
3125 cv_clone2(CV *proto, CV *outside)
3130 AV* protopadlist = CvPADLIST(proto);
3131 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3132 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3133 SV** pname = AvARRAY(protopad_name);
3134 SV** ppad = AvARRAY(protopad);
3135 I32 fname = AvFILLp(protopad_name);
3136 I32 fpad = AvFILLp(protopad);
3140 assert(!CvUNIQUE(proto));
3145 SAVESPTR(comppad_name);
3148 cv = compcv = (CV*)NEWSV(1104,0);
3149 sv_upgrade((SV *)cv, SvTYPE(proto));
3155 New(666, CvMUTEXP(cv), 1, perl_mutex);
3156 MUTEX_INIT(CvMUTEXP(cv));
3158 #endif /* USE_THREADS */
3159 CvFILEGV(cv) = CvFILEGV(proto);
3160 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3161 CvSTASH(cv) = CvSTASH(proto);
3162 CvROOT(cv) = CvROOT(proto);
3163 CvSTART(cv) = CvSTART(proto);
3165 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3168 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3170 comppad_name = newAV();
3171 for (ix = fname; ix >= 0; ix--)
3172 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3176 comppadlist = newAV();
3177 AvREAL_off(comppadlist);
3178 av_store(comppadlist, 0, (SV*)comppad_name);
3179 av_store(comppadlist, 1, (SV*)comppad);
3180 CvPADLIST(cv) = comppadlist;
3181 av_fill(comppad, AvFILLp(protopad));
3182 curpad = AvARRAY(comppad);
3184 av = newAV(); /* will be @_ */
3186 av_store(comppad, 0, (SV*)av);
3187 AvFLAGS(av) = AVf_REIFY;
3189 for (ix = fpad; ix > 0; ix--) {
3190 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3191 if (namesv && namesv != &sv_undef) {
3192 char *name = SvPVX(namesv); /* XXX */
3193 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3194 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3195 CvOUTSIDE(cv), cxstack_ix);
3197 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3199 croak("panic: cv_clone: %s", name);
3201 else { /* our own lexical */
3204 /* anon code -- we'll come back for it */
3205 sv = SvREFCNT_inc(ppad[ix]);
3207 else if (*name == '@')
3209 else if (*name == '%')
3219 SV* sv = NEWSV(0,0);
3225 /* Now that vars are all in place, clone nested closures. */
3227 for (ix = fpad; ix > 0; ix--) {
3228 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3230 && namesv != &sv_undef
3231 && !(SvFLAGS(namesv) & SVf_FAKE)
3232 && *SvPVX(namesv) == '&'
3233 && CvCLONE(ppad[ix]))
3235 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3236 SvREFCNT_dec(ppad[ix]);
3239 curpad[ix] = (SV*)kid;
3243 #ifdef DEBUG_CLOSURES
3244 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3246 PerlIO_printf(Perl_debug_log, " from:\n");
3248 PerlIO_printf(Perl_debug_log, " to:\n");
3259 return cv_clone2(proto, CvOUTSIDE(proto));
3263 cv_ckproto(CV *cv, GV *gv, char *p)
3265 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3266 SV* msg = sv_newmortal();
3270 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3271 sv_setpv(msg, "Prototype mismatch:");
3273 sv_catpvf(msg, " sub %_", name);
3275 sv_catpvf(msg, " (%s)", SvPVX(cv));
3276 sv_catpv(msg, " vs ");
3278 sv_catpvf(msg, "(%s)", p);
3280 sv_catpv(msg, "none");
3291 if (!cv || !SvPOK(cv) || SvCUR(cv))
3295 for (o = CvSTART(cv); o; o = o->op_next) {
3296 OPCODE type = o->op_type;
3298 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3300 if (type == OP_LEAVESUB || type == OP_RETURN)
3304 if (type == OP_CONST)
3306 else if (type == OP_PADSV) {
3307 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3308 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3309 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3321 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3324 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3325 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3326 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3335 if (!name || GvCVGEN(gv))
3337 else if (cv = GvCV(gv)) {
3338 cv_ckproto(cv, gv, ps);
3339 /* already defined (or promised)? */
3340 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3343 /* just a "sub foo;" when &foo is already defined */
3347 /* ahem, death to those who redefine active sort subs */
3348 if (curstack == sortstack && sortcop == CvSTART(cv))
3349 croak("Can't redefine active sort subroutine %s", name);
3350 const_sv = cv_const_sv(cv);
3351 if (const_sv || dowarn) {
3352 line_t oldline = curcop->cop_line;
3353 curcop->cop_line = copline;
3354 warn(const_sv ? "Constant subroutine %s redefined"
3355 : "Subroutine %s redefined", name);
3356 curcop->cop_line = oldline;
3362 if (cv) { /* must reuse cv if autoloaded */
3364 CvFLAGS(cv) = CvFLAGS(compcv);
3365 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3366 CvOUTSIDE(compcv) = 0;
3367 CvPADLIST(cv) = CvPADLIST(compcv);
3368 CvPADLIST(compcv) = 0;
3369 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3370 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3371 SvREFCNT_dec(compcv);
3381 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3382 CvFILEGV(cv) = curcop->cop_filegv;
3383 CvSTASH(cv) = curstash;
3386 New(666, CvMUTEXP(cv), 1, perl_mutex);
3387 MUTEX_INIT(CvMUTEXP(cv));
3388 #endif /* USE_THREADS */
3391 sv_setpv((SV*)cv, ps);
3397 char *s = strrchr(name, ':');
3399 if (strEQ(s, "BEGIN")) {
3401 "BEGIN not safe after errors--compilation aborted";
3405 /* force display of errors found but not reported */
3406 sv_catpv(ERRSV, not_safe);
3407 croak("%s", SvPVx(ERRSV, na));
3418 if (AvFILLp(comppad_name) < AvFILLp(comppad))
3419 av_store(comppad_name, AvFILLp(comppad), Nullsv);
3422 SV **namep = AvARRAY(comppad_name);
3423 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3426 if (SvIMMORTAL(curpad[ix]))
3429 * The only things that a clonable function needs in its
3430 * pad are references to outer lexicals and anonymous subs.
3431 * The rest are created anew during cloning.
3433 if (!((namesv = namep[ix]) != Nullsv &&
3434 namesv != &sv_undef &&
3436 *SvPVX(namesv) == '&')))
3438 SvREFCNT_dec(curpad[ix]);
3439 curpad[ix] = Nullsv;
3444 AV *av = newAV(); /* Will be @_ */
3446 av_store(comppad, 0, (SV*)av);
3447 AvFLAGS(av) = AVf_REIFY;
3449 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3450 if (SvIMMORTAL(curpad[ix]))
3452 if (!SvPADMY(curpad[ix]))
3453 SvPADTMP_on(curpad[ix]);
3457 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3458 CvSTART(cv) = LINKLIST(CvROOT(cv));
3459 CvROOT(cv)->op_next = 0;
3465 if (PERLDB_SUBLINE && curstash != debstash) {
3466 SV *sv = NEWSV(0,0);
3467 SV *tmpstr = sv_newmortal();
3468 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3472 sv_setpvf(sv, "%_:%ld-%ld",
3473 GvSV(curcop->cop_filegv),
3474 (long)subline, (long)curcop->cop_line);
3475 gv_efullname3(tmpstr, gv, Nullch);
3476 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3477 hv = GvHVn(db_postponed);
3478 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3479 && (cv = GvCV(db_postponed))) {
3484 perl_call_sv((SV*)cv, G_DISCARD);
3488 if ((s = strrchr(name,':')))
3492 if (strEQ(s, "BEGIN")) {
3493 I32 oldscope = scopestack_ix;
3495 SAVESPTR(compiling.cop_filegv);
3496 SAVEI16(compiling.cop_line);
3503 DEBUG_x( dump_sub(gv) );
3504 av_push(beginav, (SV *)cv);
3506 call_list(oldscope, beginav);
3508 curcop = &compiling;
3511 else if (strEQ(s, "END") && !error_count) {
3514 av_unshift(endav, 1);
3515 av_store(endav, 0, (SV *)cv);
3518 else if (strEQ(s, "INIT") && !error_count) {
3521 av_push(initav, SvREFCNT_inc(cv));
3532 newXS(char *name, void (*subaddr) (CPERLproto_ CV *), char *filename)
3535 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3538 if (cv = (name ? GvCV(gv) : Nullcv)) {
3540 /* just a cached method */
3544 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3545 /* already defined (or promised) */
3547 line_t oldline = curcop->cop_line;
3548 curcop->cop_line = copline;
3549 warn("Subroutine %s redefined",name);
3550 curcop->cop_line = oldline;
3557 if (cv) /* must reuse cv if autoloaded */
3560 cv = (CV*)NEWSV(1105,0);
3561 sv_upgrade((SV *)cv, SVt_PVCV);
3568 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3570 New(666, CvMUTEXP(cv), 1, perl_mutex);
3571 MUTEX_INIT(CvMUTEXP(cv));
3573 #endif /* USE_THREADS */
3574 CvFILEGV(cv) = gv_fetchfile(filename);
3575 CvXSUB(cv) = subaddr;
3578 char *s = strrchr(name,':');
3583 if (strEQ(s, "BEGIN")) {
3586 av_push(beginav, (SV *)cv);
3589 else if (strEQ(s, "END")) {
3592 av_unshift(endav, 1);
3593 av_store(endav, 0, (SV *)cv);
3596 else if (strEQ(s, "INIT")) {
3599 av_push(initav, (SV *)cv);
3609 newFORM(I32 floor, OP *o, OP *block)
3618 name = SvPVx(cSVOPo->op_sv, na);
3621 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3623 if (cv = GvFORM(gv)) {
3625 line_t oldline = curcop->cop_line;
3627 curcop->cop_line = copline;
3628 warn("Format %s redefined",name);
3629 curcop->cop_line = oldline;
3635 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3636 CvFILEGV(cv) = curcop->cop_filegv;
3638 for (ix = AvFILLp(comppad); ix > 0; ix--) {
3639 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3640 SvPADTMP_on(curpad[ix]);
3643 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3644 CvSTART(cv) = LINKLIST(CvROOT(cv));
3645 CvROOT(cv)->op_next = 0;
3655 return newUNOP(OP_REFGEN, 0,
3656 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3662 return newUNOP(OP_REFGEN, 0,
3663 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3667 newANONSUB(I32 floor, OP *proto, OP *block)
3669 return newUNOP(OP_REFGEN, 0,
3670 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3676 switch (o->op_type) {
3678 o->op_type = OP_PADAV;
3679 o->op_ppaddr = ppaddr[OP_PADAV];
3680 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3683 o->op_type = OP_RV2AV;
3684 o->op_ppaddr = ppaddr[OP_RV2AV];
3689 warn("oops: oopsAV");
3698 switch (o->op_type) {
3701 o->op_type = OP_PADHV;
3702 o->op_ppaddr = ppaddr[OP_PADHV];
3703 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3707 o->op_type = OP_RV2HV;
3708 o->op_ppaddr = ppaddr[OP_RV2HV];
3713 warn("oops: oopsHV");
3722 if (o->op_type == OP_PADANY) {
3723 o->op_type = OP_PADAV;
3724 o->op_ppaddr = ppaddr[OP_PADAV];
3727 return newUNOP(OP_RV2AV, 0, scalar(o));
3731 newGVREF(I32 type, OP *o)
3733 if (type == OP_MAPSTART)
3734 return newUNOP(OP_NULL, 0, o);
3735 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3741 if (o->op_type == OP_PADANY) {
3742 o->op_type = OP_PADHV;
3743 o->op_ppaddr = ppaddr[OP_PADHV];
3746 return newUNOP(OP_RV2HV, 0, scalar(o));
3752 croak("NOT IMPL LINE %d",__LINE__);
3758 newCVREF(I32 flags, OP *o)
3760 return newUNOP(OP_RV2CV, flags, scalar(o));
3766 if (o->op_type == OP_PADANY) {
3767 o->op_type = OP_PADSV;
3768 o->op_ppaddr = ppaddr[OP_PADSV];
3771 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3772 o->op_flags |= OPpDONE_SVREF;
3775 return newUNOP(OP_RV2SV, 0, scalar(o));
3778 /* Check routines. */
3786 name = NEWSV(1106,0);
3787 sv_upgrade(name, SVt_PVNV);
3788 sv_setpvn(name, "&", 1);
3791 ix = pad_alloc(o->op_type, SVs_PADMY);
3792 av_store(comppad_name, ix, name);
3793 av_store(comppad, ix, cSVOPo->op_sv);
3794 SvPADMY_on(cSVOPo->op_sv);
3795 cSVOPo->op_sv = Nullsv;
3796 cSVOPo->op_targ = ix;
3803 o->op_private = hints;
3810 if (cUNOPo->op_first->op_type == OP_CONCAT)
3811 o->op_flags |= OPf_STACKED;
3818 if (o->op_flags & OPf_KIDS) {
3821 OPCODE type = o->op_type;
3822 o = modkids(ck_fun(o), type);
3823 kid = cUNOPo->op_first;
3824 newop = kUNOP->op_first->op_sibling;
3826 (newop->op_sibling ||
3827 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3828 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3829 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3833 op_free(kUNOP->op_first);
3834 kUNOP->op_first = newop;
3836 o->op_ppaddr = ppaddr[++o->op_type];
3845 if (o->op_flags & OPf_KIDS) {
3846 OP *kid = cUNOPo->op_first;
3847 if (kid->op_type == OP_HSLICE)
3848 o->op_private |= OPpSLICE;
3849 else if (kid->op_type != OP_HELEM)
3850 croak("%s argument is not a HASH element or slice",
3851 op_desc[o->op_type]);
3860 I32 type = o->op_type;
3862 if (o->op_flags & OPf_KIDS) {
3863 if (cLISTOPo->op_first->op_type == OP_STUB) {
3865 o = newUNOP(type, OPf_SPECIAL,
3866 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3876 hints |= HINT_BLOCK_SCOPE;
3877 if (o->op_flags & OPf_KIDS) {
3878 SVOP *kid = (SVOP*)cUNOPo->op_first;
3881 o->op_flags &= ~OPf_KIDS;
3884 else if (kid->op_type == OP_LINESEQ) {
3887 kid->op_next = o->op_next;
3888 cUNOPo->op_first = 0;
3891 Newz(1101, enter, 1, LOGOP);
3892 enter->op_type = OP_ENTERTRY;
3893 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3894 enter->op_private = 0;
3896 /* establish postfix order */
3897 enter->op_next = (OP*)enter;
3899 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3900 o->op_type = OP_LEAVETRY;
3901 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3902 enter->op_other = o;
3910 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
3912 o->op_targ = (PADOFFSET)hints;
3920 if (o->op_flags & OPf_STACKED) {
3922 kid = cUNOPo->op_first->op_sibling;
3923 if (kid->op_type == OP_RV2GV)
3935 if (o->op_flags & OPf_KIDS) {
3936 OP *kid = cUNOPo->op_first;
3937 if (kid->op_type != OP_HELEM)
3938 croak("%s argument is not a HASH element", op_desc[o->op_type]);
3945 ck_gvconst(register OP *o)
3947 o = fold_constants(o);
3948 if (o->op_type == OP_CONST)
3954 ck_rvconst(register OP *o)
3957 SVOP *kid = (SVOP*)cUNOPo->op_first;
3959 o->op_private |= (hints & HINT_STRICT_REFS);
3960 if (kid->op_type == OP_CONST) {
3965 name = SvPV(kid->op_sv, na);
3966 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
3967 char *badthing = Nullch;
3968 switch (o->op_type) {
3970 badthing = "a SCALAR";
3973 badthing = "an ARRAY";
3976 badthing = "a HASH";
3981 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
3984 kid->op_type = OP_GV;
3985 iscv = (o->op_type == OP_RV2CV) * 2;
3986 for (gv = 0; !gv; iscv++) {
3988 * This is a little tricky. We only want to add the symbol if we
3989 * didn't add it in the lexer. Otherwise we get duplicate strict
3990 * warnings. But if we didn't add it in the lexer, we must at
3991 * least pretend like we wanted to add it even if it existed before,
3992 * or we get possible typo warnings. OPpCONST_ENTERED says
3993 * whether the lexer already added THIS instance of this symbol.
3995 gv = gv_fetchpv(name,
3996 iscv | !(kid->op_private & OPpCONST_ENTERED),
3999 : o->op_type == OP_RV2SV
4001 : o->op_type == OP_RV2AV
4003 : o->op_type == OP_RV2HV
4007 SvREFCNT_dec(kid->op_sv);
4008 kid->op_sv = SvREFCNT_inc(gv);
4017 I32 type = o->op_type;
4019 if (o->op_flags & OPf_REF)
4022 if (o->op_flags & OPf_KIDS) {
4023 SVOP *kid = (SVOP*)cUNOPo->op_first;
4025 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4026 OP *newop = newGVOP(type, OPf_REF,
4027 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4034 if (type == OP_FTTTY)
4035 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4038 return newUNOP(type, 0, newDEFSVOP());
4051 int type = o->op_type;
4052 register I32 oa = opargs[type] >> OASHIFT;
4054 if (o->op_flags & OPf_STACKED) {
4055 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4058 return no_fh_allowed(o);
4061 if (o->op_flags & OPf_KIDS) {
4062 tokid = &cLISTOPo->op_first;
4063 kid = cLISTOPo->op_first;
4064 if (kid->op_type == OP_PUSHMARK ||
4065 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4067 tokid = &kid->op_sibling;
4068 kid = kid->op_sibling;
4070 if (!kid && opargs[type] & OA_DEFGV)
4071 *tokid = kid = newDEFSVOP();
4075 sibl = kid->op_sibling;
4089 if (kid->op_type == OP_CONST &&
4090 (kid->op_private & OPpCONST_BARE)) {
4091 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4092 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4093 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4095 warn("Array @%s missing the @ in argument %ld of %s()",
4096 name, (long)numargs, op_desc[type]);
4099 kid->op_sibling = sibl;
4102 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4103 bad_type(numargs, "array", op_desc[o->op_type], kid);
4107 if (kid->op_type == OP_CONST &&
4108 (kid->op_private & OPpCONST_BARE)) {
4109 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4110 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4111 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4113 warn("Hash %%%s missing the %% in argument %ld of %s()",
4114 name, (long)numargs, op_desc[type]);
4117 kid->op_sibling = sibl;
4120 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4121 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4126 OP *newop = newUNOP(OP_NULL, 0, kid);
4127 kid->op_sibling = 0;
4129 newop->op_next = newop;
4131 kid->op_sibling = sibl;
4136 if (kid->op_type != OP_GV) {
4137 if (kid->op_type == OP_CONST &&
4138 (kid->op_private & OPpCONST_BARE)) {
4139 OP *newop = newGVOP(OP_GV, 0,
4140 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4146 kid->op_sibling = 0;
4147 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4149 kid->op_sibling = sibl;
4155 mod(scalar(kid), type);
4159 tokid = &kid->op_sibling;
4160 kid = kid->op_sibling;
4162 o->op_private |= numargs;
4164 return too_many_arguments(o,op_desc[o->op_type]);
4167 else if (opargs[type] & OA_DEFGV) {
4169 return newUNOP(type, 0, newDEFSVOP());
4173 while (oa & OA_OPTIONAL)
4175 if (oa && oa != OA_LIST)
4176 return too_few_arguments(o,op_desc[o->op_type]);
4186 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4187 append_elem(OP_GLOB, o, newDEFSVOP());
4189 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4190 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4192 if (gv && GvIMPORTED_CV(gv)) {
4193 static int glob_index;
4195 append_elem(OP_GLOB, o,
4196 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4197 o->op_type = OP_LIST;
4198 o->op_ppaddr = ppaddr[OP_LIST];
4199 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4200 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4201 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4202 append_elem(OP_LIST, o,
4203 scalar(newUNOP(OP_RV2CV, 0,
4204 newGVOP(OP_GV, 0, gv)))));
4205 o = newUNOP(OP_NULL, 0, ck_subr(o));
4206 o->op_targ = OP_GLOB; /* hint at what it used to be */
4209 gv = newGVgen("main");
4211 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4221 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4223 o->op_ppaddr = ppaddr[OP_GREPSTART];
4224 Newz(1101, gwop, 1, LOGOP);
4226 if (o->op_flags & OPf_STACKED) {
4229 kid = cLISTOPo->op_first->op_sibling;
4230 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4233 kid->op_next = (OP*)gwop;
4234 o->op_flags &= ~OPf_STACKED;
4236 kid = cLISTOPo->op_first->op_sibling;
4237 if (type == OP_MAPWHILE)
4244 kid = cLISTOPo->op_first->op_sibling;
4245 if (kid->op_type != OP_NULL)
4246 croak("panic: ck_grep");
4247 kid = kUNOP->op_first;
4249 gwop->op_type = type;
4250 gwop->op_ppaddr = ppaddr[type];
4251 gwop->op_first = listkids(o);
4252 gwop->op_flags |= OPf_KIDS;
4253 gwop->op_private = 1;
4254 gwop->op_other = LINKLIST(kid);
4255 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4256 kid->op_next = (OP*)gwop;
4258 kid = cLISTOPo->op_first->op_sibling;
4259 if (!kid || !kid->op_sibling)
4260 return too_few_arguments(o,op_desc[o->op_type]);
4261 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4262 mod(kid, OP_GREPSTART);
4270 if (o->op_flags & OPf_KIDS) {
4271 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4272 if (kid && kid->op_type == OP_CONST)
4273 fbm_compile(((SVOP*)kid)->op_sv);
4279 ck_lengthconst(OP *o)
4281 /* XXX length optimization goes here */
4288 OPCODE type = o->op_type;
4289 return modkids(ck_fun(o), type);
4295 OPCODE type = o->op_type;
4296 return refkids(ck_fun(o), type);
4304 kid = cLISTOPo->op_first;
4307 kid = cLISTOPo->op_first;
4309 if (kid->op_type == OP_PUSHMARK)
4310 kid = kid->op_sibling;
4311 if (kid && o->op_flags & OPf_STACKED)
4312 kid = kid->op_sibling;
4313 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4314 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4315 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4316 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4317 cLISTOPo->op_first->op_sibling = kid;
4318 cLISTOPo->op_last = kid;
4319 kid = kid->op_sibling;
4324 append_elem(o->op_type, o, newDEFSVOP());
4330 if (hints & HINT_LOCALE)
4331 o->op_private |= OPpLOCALE;
4338 ck_fun_locale(OP *o)
4344 if (hints & HINT_LOCALE)
4345 o->op_private |= OPpLOCALE;
4356 if (hints & HINT_LOCALE)
4357 o->op_private |= OPpLOCALE;
4366 o->op_private |= OPpRUNTIME;
4379 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4380 o->op_private |= OPpREPEAT_DOLIST;
4381 cBINOPo->op_first = force_list(cBINOPo->op_first);
4391 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4392 SVOP *kid = (SVOP*)cUNOPo->op_first;
4394 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4396 for (s = SvPVX(kid->op_sv); *s; s++) {
4397 if (*s == ':' && s[1] == ':') {
4399 Move(s+2, s+1, strlen(s+2)+1, char);
4400 --SvCUR(kid->op_sv);
4403 sv_catpvn(kid->op_sv, ".pm", 3);
4412 croak("NOT IMPL LINE %d",__LINE__);
4421 if (o->op_flags & OPf_KIDS) {
4422 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4423 if (kid && kid->op_sibling) {
4424 o->op_type = OP_SSELECT;
4425 o->op_ppaddr = ppaddr[OP_SSELECT];
4427 return fold_constants(o);
4431 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4432 if (kid && kid->op_type == OP_RV2GV)
4433 kid->op_private &= ~HINT_STRICT_REFS;
4440 I32 type = o->op_type;
4442 if (!(o->op_flags & OPf_KIDS)) {
4447 if (!CvUNIQUE(compcv)) {
4448 argop = newOP(OP_PADAV, OPf_REF);
4449 argop->op_targ = 0; /* curpad[0] is @_ */
4452 argop = newUNOP(OP_RV2AV, 0,
4453 scalar(newGVOP(OP_GV, 0,
4454 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4457 argop = newUNOP(OP_RV2AV, 0,
4458 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(compcv) ?
4459 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4460 #endif /* USE_THREADS */
4461 return newUNOP(type, 0, scalar(argop));
4463 return scalar(modkids(ck_fun(o), type));
4471 if (hints & HINT_LOCALE)
4472 o->op_private |= OPpLOCALE;
4475 if (o->op_flags & OPf_STACKED) {
4476 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4478 kid = kUNOP->op_first; /* get past rv2gv */
4480 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4482 if (kid->op_type == OP_SCOPE) {
4486 else if (kid->op_type == OP_LEAVE) {
4487 if (o->op_type == OP_SORT) {
4488 null(kid); /* wipe out leave */
4491 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4492 if (k->op_next == kid)
4497 kid->op_next = 0; /* just disconnect the leave */
4498 k = kLISTOP->op_first;
4502 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4503 null(kid); /* wipe out rv2gv */
4504 if (o->op_type == OP_SORT)
4508 o->op_flags |= OPf_SPECIAL;
4520 if (o->op_flags & OPf_STACKED)
4521 return no_fh_allowed(o);
4523 kid = cLISTOPo->op_first;
4524 if (kid->op_type != OP_NULL)
4525 croak("panic: ck_split");
4526 kid = kid->op_sibling;
4527 op_free(cLISTOPo->op_first);
4528 cLISTOPo->op_first = kid;
4530 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4531 cLISTOPo->op_last = kid; /* There was only one element previously */
4534 if (kid->op_type != OP_MATCH) {
4535 OP *sibl = kid->op_sibling;
4536 kid->op_sibling = 0;
4537 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4538 if (cLISTOPo->op_first == cLISTOPo->op_last)
4539 cLISTOPo->op_last = kid;
4540 cLISTOPo->op_first = kid;
4541 kid->op_sibling = sibl;
4544 kid->op_type = OP_PUSHRE;
4545 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4548 if (!kid->op_sibling)
4549 append_elem(OP_SPLIT, o, newDEFSVOP());
4551 kid = kid->op_sibling;
4554 if (!kid->op_sibling)
4555 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4557 kid = kid->op_sibling;
4560 if (kid->op_sibling)
4561 return too_many_arguments(o,op_desc[o->op_type]);
4570 OP *prev = ((cUNOPo->op_first->op_sibling)
4571 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4572 OP *o2 = prev->op_sibling;
4580 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4581 if (cvop->op_type == OP_RV2CV) {
4583 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4584 null(cvop); /* disable rv2cv */
4585 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4586 if (tmpop->op_type == OP_GV) {
4587 cv = GvCVu(tmpop->op_sv);
4588 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4589 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4590 proto = SvPV((SV*)cv, na);
4594 o->op_private |= (hints & HINT_STRICT_REFS);
4595 if (PERLDB_SUB && curstash != debstash)
4596 o->op_private |= OPpENTERSUB_DB;
4597 while (o2 != cvop) {
4601 return too_many_arguments(o, gv_ename(namegv));
4619 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4620 bad_type(arg, "block", gv_ename(namegv), o2);
4625 if (o2->op_type == OP_RV2GV)
4629 OP* sib = kid->op_sibling;
4630 kid->op_sibling = 0;
4631 o2 = newUNOP(OP_RV2GV, 0, kid);
4632 o2->op_sibling = sib;
4633 prev->op_sibling = o2;
4641 if (o2->op_type != OP_RV2GV)
4642 bad_type(arg, "symbol", gv_ename(namegv), o2);
4645 if (o2->op_type != OP_RV2CV)
4646 bad_type(arg, "sub", gv_ename(namegv), o2);
4649 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4650 bad_type(arg, "scalar", gv_ename(namegv), o2);
4653 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4654 bad_type(arg, "array", gv_ename(namegv), o2);
4657 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4658 bad_type(arg, "hash", gv_ename(namegv), o2);
4662 OP* sib = kid->op_sibling;
4663 kid->op_sibling = 0;
4664 o2 = newUNOP(OP_REFGEN, 0, kid);
4665 o2->op_sibling = sib;
4666 prev->op_sibling = o2;
4677 croak("Malformed prototype for %s: %s",
4678 gv_ename(namegv), SvPV((SV*)cv, na));
4683 mod(o2, OP_ENTERSUB);
4685 o2 = o2->op_sibling;
4687 if (proto && !optional &&
4688 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4689 return too_few_arguments(o, gv_ename(namegv));
4696 SvREADONLY_on(cSVOPo->op_sv);
4703 if (o->op_flags & OPf_KIDS) {
4704 SVOP *kid = (SVOP*)cUNOPo->op_first;
4706 if (kid->op_type == OP_NULL)
4707 kid = (SVOP*)kid->op_sibling;
4709 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4710 o->op_flags |= OPf_SPECIAL;
4715 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4718 peep(register OP *o)
4721 register OP* oldop = 0;
4722 if (!o || o->op_seq)
4727 for (; o; o = o->op_next) {
4733 switch (o->op_type) {
4736 curcop = ((COP*)o); /* for warnings */
4737 o->op_seq = op_seqmax++;
4748 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
4750 o->op_seq = op_seqmax++;
4753 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4754 o->op_seq = op_seqmax++;
4755 break; /* Scalar stub must produce undef. List stub is noop */
4759 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4760 curcop = ((COP*)op);
4766 if (oldop && o->op_next) {
4767 oldop->op_next = o->op_next;
4770 o->op_seq = op_seqmax++;
4774 if (o->op_next->op_type == OP_RV2SV) {
4775 if (!(o->op_next->op_private & OPpDEREF)) {
4777 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4778 o->op_next = o->op_next->op_next;
4779 o->op_type = OP_GVSV;
4780 o->op_ppaddr = ppaddr[OP_GVSV];
4783 else if (o->op_next->op_type == OP_RV2AV) {
4784 OP* pop = o->op_next->op_next;
4786 if (pop->op_type == OP_CONST &&
4787 (op = pop->op_next) &&
4788 pop->op_next->op_type == OP_AELEM &&
4789 !(pop->op_next->op_private &
4790 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4791 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4795 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4799 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4800 o->op_next = pop->op_next->op_next;
4801 o->op_type = OP_AELEMFAST;
4802 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4803 o->op_private = (U8)i;
4804 GvAVn(((GVOP*)o)->op_gv);
4807 o->op_seq = op_seqmax++;
4811 if (o->op_next->op_type == OP_RV2AV
4812 && (o->op_next->op_flags && OPf_REF))
4815 o->op_next = o->op_next->op_next;
4820 if (o->op_next->op_type == OP_RV2HV
4821 && (o->op_next->op_flags && OPf_REF))
4824 o->op_next = o->op_next->op_next;
4832 o->op_seq = op_seqmax++;
4833 while (cLOGOP->op_other->op_type == OP_NULL)
4834 cLOGOP->op_other = cLOGOP->op_other->op_next;
4835 peep(cLOGOP->op_other);
4839 o->op_seq = op_seqmax++;
4840 peep(cCONDOP->op_true);
4841 peep(cCONDOP->op_false);
4845 o->op_seq = op_seqmax++;
4846 peep(cLOOP->op_redoop);
4847 peep(cLOOP->op_nextop);
4848 peep(cLOOP->op_lastop);
4853 o->op_seq = op_seqmax++;
4854 peep(cPMOP->op_pmreplstart);
4858 o->op_seq = op_seqmax++;
4859 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4860 if (o->op_next->op_sibling &&
4861 o->op_next->op_sibling->op_type != OP_DIE) {
4862 line_t oldline = curcop->cop_line;
4864 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4865 warn("Statement unlikely to be reached");
4866 warn("(Maybe you meant system() when you said exec()?)\n");
4867 curcop->cop_line = oldline;
4881 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4882 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4884 rop = (UNOP*)((BINOP*)o)->op_first;
4885 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4887 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
4888 if (!SvOBJECT(lexname))
4890 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
4891 if (!fields || !GvHV(*fields))
4893 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
4894 key = SvPV(*svp, keylen);
4895 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
4897 croak("No such field \"%s\" in variable %s of type %s",
4898 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
4900 ind = SvIV(*indsvp);
4902 croak("Bad index while coercing array into hash");
4903 rop->op_type = OP_RV2AV;
4904 rop->op_ppaddr = ppaddr[OP_RV2AV];
4905 o->op_type = OP_AELEM;
4906 o->op_ppaddr = ppaddr[OP_AELEM];
4908 *svp = newSViv(ind);
4913 o->op_seq = op_seqmax++;