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));
48 SV* tmpsv = sv_newmortal();
49 gv_efullname3(tmpsv, gv, Nullch);
50 return SvPV(tmpsv,na);
57 yyerror(form("Missing comma after first argument to %s function",
58 op_desc[o->op_type]));
63 too_few_arguments(o, name)
67 yyerror(form("Not enough arguments for %s", name));
72 too_many_arguments(o, name)
76 yyerror(form("Too many arguments for %s", name));
81 bad_type(n, t, name, kid)
87 yyerror(form("Type of arg %d to %s must be %s (not %s)",
88 (int)n, name, t, op_desc[kid->op_type]));
95 int type = o->op_type;
96 if (type != OP_AELEM && type != OP_HELEM) {
97 yyerror(form("Can't use subscript on %s", op_desc[type]));
98 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV)
99 warn("(Did you mean $ or @ instead of %c?)\n",
100 type == OP_ENTERSUB ? '&' : '%');
104 /* "register" allocation */
114 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
115 if (!isPRINT(name[1])) {
117 name[2] = toCTRL(name[1]);
120 croak("Can't use global %s in \"my\"",name);
122 if (dowarn && AvFILL(comppad_name) >= 0) {
123 SV **svp = AvARRAY(comppad_name);
124 for (off = AvFILL(comppad_name); off > comppad_name_floor; off--) {
127 && SvIVX(sv) == 999999999 /* var is in open scope */
128 && strEQ(name, SvPVX(sv)))
130 warn("\"my\" variable %s masks earlier declaration in same scope", name);
135 off = pad_alloc(OP_PADSV, SVs_PADMY);
137 sv_upgrade(sv, SVt_PVNV);
141 croak("Can't declare class for non-scalar %s in \"my\"",name);
143 (void)SvUPGRADE(sv, SVt_PVMG);
144 SvSTASH(sv) = (HV*)SvREFCNT_inc(in_my_stash);
147 av_store(comppad_name, off, sv);
148 SvNVX(sv) = (double)999999999;
149 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
150 if (!min_intro_pending)
151 min_intro_pending = off;
152 max_intro_pending = off;
154 av_store(comppad, off, (SV*)newAV());
155 else if (*name == '%')
156 av_store(comppad, off, (SV*)newHV());
157 SvPADMY_on(curpad[off]);
162 #ifndef CAN_PROTOTYPE
163 pad_findlex(name, newoff, seq, startcv, cx_ix)
170 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
178 register CONTEXT *cx;
181 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
182 AV *curlist = CvPADLIST(cv);
183 SV **svp = av_fetch(curlist, 0, FALSE);
186 if (!svp || *svp == &sv_undef)
189 svp = AvARRAY(curname);
190 for (off = AvFILL(curname); off > 0; off--) {
191 if ((sv = svp[off]) &&
194 seq > I_32(SvNVX(sv)) &&
195 strEQ(SvPVX(sv), name))
206 return 0; /* don't clone from inactive stack frame */
210 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
211 oldsv = *av_fetch(oldpad, off, TRUE);
212 if (!newoff) { /* Not a mere clone operation. */
213 SV *namesv = NEWSV(1103,0);
214 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
215 sv_upgrade(namesv, SVt_PVNV);
216 sv_setpv(namesv, name);
217 av_store(comppad_name, newoff, namesv);
218 SvNVX(namesv) = (double)curcop->cop_seq;
219 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
220 SvFAKE_on(namesv); /* A ref, not a real var */
221 if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) {
222 /* "It's closures all the way down." */
226 oldsv = Nullsv; /* no need to keep ref */
231 bcv && bcv != cv && !CvCLONE(bcv);
232 bcv = CvOUTSIDE(bcv)) {
236 if (dowarn && !CvUNIQUE(cv))
238 "Variable \"%s\" may be unavailable",
245 else if (!CvUNIQUE(compcv)) {
246 if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
247 warn("Variable \"%s\" will not stay shared", name);
250 av_store(comppad, newoff, oldsv ? SvREFCNT_inc(oldsv) : 0);
256 /* Nothing in current lexical context--try eval's context, if any.
257 * This is necessary to let the perldb get at lexically scoped variables.
258 * XXX This will also probably interact badly with eval tree caching.
262 for (i = cx_ix; i >= 0; i--) {
264 switch (cx->cx_type) {
266 if (i == 0 && saweval) {
267 seq = cxstack[saweval].blk_oldcop->cop_seq;
268 return pad_findlex(name, newoff, seq, main_cv, 0);
272 switch (cx->blk_eval.old_op_type) {
277 /* require must have its own scope */
285 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
286 saweval = i; /* so we know where we were called from */
289 seq = cxstack[saweval].blk_oldcop->cop_seq;
290 return pad_findlex(name, newoff, seq, cv, i-1);
305 SV **svp = AvARRAY(comppad_name);
306 U32 seq = cop_seqmax;
310 * Special case to get lexical (and hence per-thread) @_.
311 * XXX I need to find out how to tell at parse-time whether use
312 * of @_ should refer to a lexical (from a sub) or defgv (global
313 * scope and maybe weird sub-ish things like formats). See
314 * startsub in perly.y. It's possible that @_ could be lexical
315 * (at least from subs) even in non-threaded perl.
317 if (strEQ(name, "@_"))
318 return 0; /* success. (NOT_IN_PAD indicates failure) */
319 #endif /* USE_THREADS */
321 /* The one we're looking for is probably just before comppad_name_fill. */
322 for (off = AvFILL(comppad_name); off > 0; off--) {
323 if ((sv = svp[off]) &&
327 seq > I_32(SvNVX(sv)))) &&
328 strEQ(SvPVX(sv), name))
331 return (PADOFFSET)off;
332 pendoff = off; /* this pending def. will override import */
336 /* See if it's in a nested scope */
337 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
339 /* If there is a pending local definition, this new alias must die */
341 SvIVX(AvARRAY(comppad_name)[off]) = seq;
342 return off; /* pad_findlex returns 0 for failure...*/
344 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
352 SV **svp = AvARRAY(comppad_name);
354 if (min_intro_pending && fill < min_intro_pending) {
355 for (off = max_intro_pending; off >= min_intro_pending; off--) {
356 if ((sv = svp[off]) && sv != &sv_undef)
357 warn("%s never introduced", SvPVX(sv));
360 /* "Deintroduce" my variables that are leaving with this scope. */
361 for (off = AvFILL(comppad_name); off > fill; off--) {
362 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
363 SvIVX(sv) = cop_seqmax;
368 pad_alloc(optype,tmptype)
376 if (AvARRAY(comppad) != curpad)
377 croak("panic: pad_alloc");
378 if (pad_reset_pending)
380 if (tmptype & SVs_PADMY) {
382 sv = *av_fetch(comppad, AvFILL(comppad) + 1, TRUE);
383 } while (SvPADBUSY(sv)); /* need a fresh one */
384 retval = AvFILL(comppad);
387 SV **names = AvARRAY(comppad_name);
388 SSize_t names_fill = AvFILL(comppad_name);
391 * "foreach" index vars temporarily become aliases to non-"my"
392 * values. Thus we must skip, not just pad values that are
393 * marked as current pad values, but also those with names.
395 if (++padix <= names_fill &&
396 (sv = names[padix]) && sv != &sv_undef)
398 sv = *av_fetch(comppad, padix, TRUE);
399 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
404 SvFLAGS(sv) |= tmptype;
405 curpad = AvARRAY(comppad);
407 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
408 (unsigned long) thr, (unsigned long) curpad,
409 (long) retval, op_name[optype]));
411 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad alloc %ld for %s\n",
412 (long) retval, op_name[optype]));
413 #endif /* USE_THREADS */
414 return (PADOFFSET)retval;
418 #ifndef CAN_PROTOTYPE
423 #endif /* CAN_PROTOTYPE */
427 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
428 (unsigned long) thr, (unsigned long) curpad, po));
431 croak("panic: pad_sv po");
432 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad sv %d\n", po));
433 #endif /* USE_THREADS */
434 return curpad[po]; /* eventually we'll turn this into a macro */
438 #ifndef CAN_PROTOTYPE
442 pad_free(PADOFFSET po)
443 #endif /* CAN_PROTOTYPE */
448 if (AvARRAY(comppad) != curpad)
449 croak("panic: pad_free curpad");
451 croak("panic: pad_free po");
453 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
454 (unsigned long) thr, (unsigned long) curpad, po));
456 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad free %d\n", po));
457 #endif /* USE_THREADS */
458 if (curpad[po] && curpad[po] != &sv_undef)
459 SvPADTMP_off(curpad[po]);
465 #ifndef CAN_PROTOTYPE
469 pad_swipe(PADOFFSET po)
470 #endif /* CAN_PROTOTYPE */
473 if (AvARRAY(comppad) != curpad)
474 croak("panic: pad_swipe curpad");
476 croak("panic: pad_swipe po");
478 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
479 (unsigned long) thr, (unsigned long) curpad, po));
481 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad swipe %d\n", po));
482 #endif /* USE_THREADS */
483 SvPADTMP_off(curpad[po]);
484 curpad[po] = NEWSV(1107,0);
485 SvPADTMP_on(curpad[po]);
496 if (AvARRAY(comppad) != curpad)
497 croak("panic: pad_reset curpad");
499 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
500 (unsigned long) thr, (unsigned long) curpad));
502 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad reset\n"));
503 #endif /* USE_THREADS */
504 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
505 for (po = AvMAX(comppad); po > padix_floor; po--) {
506 if (curpad[po] && !SvIMMORTAL(curpad[po]))
507 SvPADTMP_off(curpad[po]);
511 pad_reset_pending = FALSE;
516 find_thread_magical(name)
522 /* We currently only handle single character magicals */
523 p = strchr(per_thread_magicals, *name);
526 key = magical_keys[p - per_thread_magicals];
527 if (key == NOT_IN_PAD) {
529 key = magical_keys[p - per_thread_magicals] = key_create();
531 av_store(thr->specific, key, sv);
532 sv_magic(sv, 0, 0, name, 1);
533 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
534 "find_thread_magical: key %d new SV %p for %d\n",
535 (int)key, sv, (int)*name));
539 #endif /* USE_THREADS */
547 register OP *kid, *nextkid;
549 if (!o || o->op_seq == (U16)-1)
552 if (o->op_flags & OPf_KIDS) {
553 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
554 nextkid = kid->op_sibling; /* Get before next freeing kid */
559 switch (o->op_type) {
561 o->op_targ = 0; /* Was holding old type, if any. */
564 o->op_targ = 0; /* Was holding hints. */
567 if (!(o->op_flags & OPf_REF) || (check[o->op_type] != ck_ftst))
573 SvREFCNT_dec(cGVOPo->op_gv);
577 Safefree(cCOPo->cop_label);
578 SvREFCNT_dec(cCOPo->cop_filegv);
581 SvREFCNT_dec(cSVOPo->op_sv);
587 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
591 Safefree(cPVOPo->op_pv);
594 op_free(cPMOPo->op_pmreplroot);
598 pregfree(cPMOPo->op_pmregexp);
599 SvREFCNT_dec(cPMOPo->op_pmshort);
604 pad_free(o->op_targ);
613 if (o->op_type != OP_NULL && o->op_targ > 0)
614 pad_free(o->op_targ);
615 o->op_targ = o->op_type;
616 o->op_type = OP_NULL;
617 o->op_ppaddr = ppaddr[OP_NULL];
620 /* Contextualizers */
622 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
633 /* establish postfix order */
634 if (cUNOPo->op_first) {
635 o->op_next = LINKLIST(cUNOPo->op_first);
636 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
638 kid->op_next = LINKLIST(kid->op_sibling);
654 if (o && o->op_flags & OPf_KIDS) {
655 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
666 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
668 line_t oldline = curcop->cop_line;
670 if (copline != NOLINE)
671 curcop->cop_line = copline;
672 warn("Found = in conditional, should be ==");
673 curcop->cop_line = oldline;
684 /* assumes no premature commitment */
685 if (!o || (o->op_flags & OPf_WANT) || error_count
686 || o->op_type == OP_RETURN)
689 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
691 switch (o->op_type) {
693 if (o->op_private & OPpREPEAT_DOLIST)
694 null(((LISTOP*)cBINOPo->op_first)->op_first);
695 scalar(cBINOPo->op_first);
700 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
704 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
705 if (!kPMOP->op_pmreplroot)
706 deprecate("implicit split to @_");
713 if (o->op_flags & OPf_KIDS) {
714 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
720 kid = cLISTOPo->op_first;
722 while (kid = kid->op_sibling) {
728 WITH_THR(curcop = &compiling);
733 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
739 WITH_THR(curcop = &compiling);
753 /* assumes no premature commitment */
754 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count
755 || o->op_type == OP_RETURN)
758 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
760 switch (o->op_type) {
762 if (!(opargs[o->op_type] & OA_FOLDCONST))
766 if (o->op_flags & OPf_STACKED)
837 if (!(o->op_private & OPpLVAL_INTRO))
838 useless = op_desc[o->op_type];
845 if (!(o->op_private & OPpLVAL_INTRO) &&
846 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
847 useless = "a variable";
852 WITH_THR(curcop = ((COP*)o)); /* for warning below */
858 useless = "a constant";
859 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
861 else if (SvPOK(sv)) {
862 if (strnEQ(SvPVX(sv), "di", 2) ||
863 strnEQ(SvPVX(sv), "ds", 2) ||
864 strnEQ(SvPVX(sv), "ig", 2))
868 null(o); /* don't execute a constant */
869 SvREFCNT_dec(sv); /* don't even remember it */
873 o->op_type = OP_PREINC; /* pre-increment is faster */
874 o->op_ppaddr = ppaddr[OP_PREINC];
878 o->op_type = OP_PREDEC; /* pre-decrement is faster */
879 o->op_ppaddr = ppaddr[OP_PREDEC];
885 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
890 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
891 WITH_THR(curcop = ((COP*)o)); /* for warning below */
892 if (o->op_flags & OPf_STACKED)
898 if (!(o->op_flags & OPf_KIDS))
907 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
914 /* all requires must return a boolean value */
915 o->op_flags &= ~OPf_WANT;
918 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
919 if (!kPMOP->op_pmreplroot)
920 deprecate("implicit split to @_");
924 if (useless && dowarn)
925 warn("Useless use of %s in void context", useless);
934 if (o && o->op_flags & OPf_KIDS) {
935 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
947 /* assumes no premature commitment */
948 if (!o || (o->op_flags & OPf_WANT) || error_count
949 || o->op_type == OP_RETURN)
952 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
954 switch (o->op_type) {
957 list(cBINOPo->op_first);
962 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
969 if (!(o->op_flags & OPf_KIDS))
971 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
972 list(cBINOPo->op_first);
973 return gen_constant_list(o);
980 kid = cLISTOPo->op_first;
982 while (kid = kid->op_sibling) {
988 WITH_THR(curcop = &compiling);
992 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
998 WITH_THR(curcop = &compiling);
1001 /* all requires must return a boolean value */
1002 o->op_flags &= ~OPf_WANT;
1015 if (o->op_type == OP_LINESEQ ||
1016 o->op_type == OP_SCOPE ||
1017 o->op_type == OP_LEAVE ||
1018 o->op_type == OP_LEAVETRY)
1021 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1022 if (kid->op_sibling) {
1026 curcop = &compiling;
1028 o->op_flags &= ~OPf_PARENS;
1029 if (hints & HINT_BLOCK_SCOPE)
1030 o->op_flags |= OPf_PARENS;
1033 o = newOP(OP_STUB, 0);
1043 if (o && o->op_flags & OPf_KIDS) {
1044 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1050 static I32 modcount;
1061 if (!o || error_count)
1064 switch (o->op_type) {
1069 if (!(o->op_private & (OPpCONST_ARYBASE)))
1071 if (eval_start && eval_start->op_type == OP_CONST) {
1072 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
1076 SAVEI32(compiling.cop_arybase);
1077 compiling.cop_arybase = 0;
1079 else if (type == OP_REFGEN)
1082 croak("That use of $[ is unsupported");
1085 if (o->op_flags & OPf_PARENS)
1089 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1090 !(o->op_flags & OPf_STACKED)) {
1091 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1092 o->op_ppaddr = ppaddr[OP_RV2CV];
1093 assert(cUNOPo->op_first->op_type == OP_NULL);
1094 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1100 /* grep, foreach, subcalls, refgen */
1101 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1103 yyerror(form("Can't modify %s in %s",
1104 op_desc[o->op_type],
1105 type ? op_desc[type] : "local"));
1119 case OP_RIGHT_SHIFT:
1128 if (!(o->op_flags & OPf_STACKED))
1134 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1140 if (!type && cUNOPo->op_first->op_type != OP_GV)
1141 croak("Can't localize through a reference");
1142 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1144 return o; /* Treat \(@foo) like ordinary list. */
1148 if (scalar_mod_type(o, type))
1150 ref(cUNOPo->op_first, o->op_type);
1162 if (!type && cUNOPo->op_first->op_type != OP_GV)
1163 croak("Can't localize through a reference");
1164 ref(cUNOPo->op_first, o->op_type);
1176 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1177 return o; /* Treat \(@foo) like ordinary list. */
1178 if (scalar_mod_type(o, type))
1185 croak("Can't localize lexical variable %s",
1186 SvPV(*av_fetch(comppad_name, o->op_targ, 4), na));
1193 if (type != OP_SASSIGN)
1199 pad_free(o->op_targ);
1200 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1201 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1202 if (o->op_flags & OPf_KIDS)
1203 mod(cBINOPo->op_first->op_sibling, type);
1208 ref(cBINOPo->op_first, o->op_type);
1209 if (type == OP_ENTERSUB &&
1210 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1211 o->op_private |= OPpLVAL_DEFER;
1218 if (o->op_flags & OPf_KIDS)
1219 mod(cLISTOPo->op_last, type);
1223 if (!(o->op_flags & OPf_KIDS))
1225 if (o->op_targ != OP_LIST) {
1226 mod(cBINOPo->op_first, type);
1231 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1235 o->op_flags |= OPf_MOD;
1237 if (type == OP_AASSIGN || type == OP_SASSIGN)
1238 o->op_flags |= OPf_SPECIAL|OPf_REF;
1240 o->op_private |= OPpLVAL_INTRO;
1241 o->op_flags &= ~OPf_SPECIAL;
1243 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1244 o->op_flags |= OPf_REF;
1249 scalar_mod_type(o, type)
1255 if (o->op_type == OP_RV2GV)
1279 case OP_RIGHT_SHIFT:
1286 case OP_ANDASSIGN: /* may work later */
1287 case OP_ORASSIGN: /* may work later */
1300 if (o && o->op_flags & OPf_KIDS) {
1301 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1314 if (!o || error_count)
1317 switch (o->op_type) {
1319 if ((type == OP_DEFINED || type == OP_LOCK) &&
1320 !(o->op_flags & OPf_STACKED)) {
1321 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1322 o->op_ppaddr = ppaddr[OP_RV2CV];
1323 assert(cUNOPo->op_first->op_type == OP_NULL);
1324 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1325 o->op_flags |= OPf_SPECIAL;
1330 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1334 ref(cUNOPo->op_first, o->op_type);
1337 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1338 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1339 : type == OP_RV2HV ? OPpDEREF_HV
1341 o->op_flags |= OPf_MOD;
1346 o->op_flags |= OPf_MOD; /* XXX ??? */
1351 o->op_flags |= OPf_REF;
1354 ref(cUNOPo->op_first, o->op_type);
1359 o->op_flags |= OPf_REF;
1364 if (!(o->op_flags & OPf_KIDS))
1366 ref(cBINOPo->op_first, type);
1370 ref(cBINOPo->op_first, o->op_type);
1371 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1372 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1373 : type == OP_RV2HV ? OPpDEREF_HV
1375 o->op_flags |= OPf_MOD;
1383 if (!(o->op_flags & OPf_KIDS))
1385 ref(cLISTOPo->op_last, type);
1401 if (!o || error_count)
1405 if (type == OP_LIST) {
1406 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1409 else if (type != OP_PADSV &&
1412 type != OP_PUSHMARK)
1414 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1417 o->op_flags |= OPf_MOD;
1418 o->op_private |= OPpLVAL_INTRO;
1427 o->op_flags |= OPf_PARENS;
1432 bind_match(type, left, right)
1440 (left->op_type == OP_RV2AV ||
1441 left->op_type == OP_RV2HV ||
1442 left->op_type == OP_PADAV ||
1443 left->op_type == OP_PADHV)) {
1444 char *desc = op_desc[(right->op_type == OP_SUBST ||
1445 right->op_type == OP_TRANS)
1446 ? right->op_type : OP_MATCH];
1447 char *sample = ((left->op_type == OP_RV2AV ||
1448 left->op_type == OP_PADAV)
1449 ? "@array" : "%hash");
1450 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1453 if (right->op_type == OP_MATCH ||
1454 right->op_type == OP_SUBST ||
1455 right->op_type == OP_TRANS) {
1456 right->op_flags |= OPf_STACKED;
1457 if (right->op_type != OP_MATCH)
1458 left = mod(left, right->op_type);
1459 if (right->op_type == OP_TRANS)
1460 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1462 o = prepend_elem(right->op_type, scalar(left), right);
1464 return newUNOP(OP_NOT, 0, scalar(o));
1468 return bind_match(type, left,
1469 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1478 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1479 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1487 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) {
1488 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1489 o->op_type = OP_LEAVE;
1490 o->op_ppaddr = ppaddr[OP_LEAVE];
1493 if (o->op_type == OP_LINESEQ) {
1495 o->op_type = OP_SCOPE;
1496 o->op_ppaddr = ppaddr[OP_SCOPE];
1497 kid = ((LISTOP*)o)->op_first;
1498 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1499 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1504 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1515 int retval = savestack_ix;
1516 SAVEI32(comppad_name_floor);
1518 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1519 comppad_name_floor = comppad_name_fill;
1521 comppad_name_floor = 0;
1523 SAVEI32(min_intro_pending);
1524 SAVEI32(max_intro_pending);
1525 min_intro_pending = 0;
1526 SAVEI32(comppad_name_fill);
1527 SAVEI32(padix_floor);
1528 padix_floor = padix;
1529 pad_reset_pending = FALSE;
1531 hints &= ~HINT_BLOCK_SCOPE;
1536 block_end(floor, seq)
1541 int needblockscope = hints & HINT_BLOCK_SCOPE;
1542 OP* retval = scalarseq(seq);
1544 pad_reset_pending = FALSE;
1546 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1547 pad_leavemy(comppad_name_fill);
1558 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o);
1559 eval_start = linklist(eval_root);
1560 eval_root->op_next = 0;
1566 main_root = scope(sawparens(scalarvoid(o)));
1567 curcop = &compiling;
1568 main_start = LINKLIST(main_root);
1569 main_root->op_next = 0;
1573 /* Register with debugger */
1575 CV *cv = perl_get_cv("DB::postponed", FALSE);
1579 XPUSHs((SV*)compiling.cop_filegv);
1581 perl_call_sv((SV*)cv, G_DISCARD);
1592 if (o->op_flags & OPf_PARENS)
1596 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1598 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1599 if (*s == ';' || *s == '=')
1600 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1604 in_my_stash = Nullhv;
1608 return mod(o, OP_NULL); /* a bit kludgey */
1615 if (o->op_type == OP_LIST) {
1616 o = convert(OP_JOIN, 0,
1617 prepend_elem(OP_LIST,
1618 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1630 I32 type = o->op_type;
1633 if (opargs[type] & OA_RETSCALAR)
1635 if (opargs[type] & OA_TARGET)
1636 o->op_targ = pad_alloc(type, SVs_PADTMP);
1638 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1639 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1641 if (!(opargs[type] & OA_FOLDCONST))
1650 if (o->op_private & OPpLOCALE)
1655 goto nope; /* Don't try to run w/ errors */
1657 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1658 if (curop->op_type != OP_CONST &&
1659 curop->op_type != OP_LIST &&
1660 curop->op_type != OP_SCALAR &&
1661 curop->op_type != OP_NULL &&
1662 curop->op_type != OP_PUSHMARK) {
1667 curop = LINKLIST(o);
1672 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1673 pad_swipe(o->op_targ);
1674 else if (SvTEMP(sv)) { /* grab mortal temp? */
1675 (void)SvREFCNT_inc(sv);
1679 if (type == OP_RV2GV)
1680 return newGVOP(OP_GV, 0, (GV*)sv);
1682 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1684 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1689 SvIOK_off(sv); /* undo SvIV() damage */
1691 return newSVOP(OP_CONST, 0, sv);
1695 if (!(opargs[type] & OA_OTHERINT))
1698 if (!(hints & HINT_INTEGER)) {
1699 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1702 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1703 if (curop->op_type == OP_CONST) {
1704 if (SvIOK(((SVOP*)curop)->op_sv))
1708 if (opargs[curop->op_type] & OA_RETINTEGER)
1712 o->op_ppaddr = ppaddr[++(o->op_type)];
1719 gen_constant_list(o)
1724 I32 oldtmps_floor = tmps_floor;
1728 return o; /* Don't attempt to run with errors */
1730 op = curop = LINKLIST(o);
1736 tmps_floor = oldtmps_floor;
1738 o->op_type = OP_RV2AV;
1739 o->op_ppaddr = ppaddr[OP_RV2AV];
1740 curop = ((UNOP*)o)->op_first;
1741 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1748 convert(type, flags, o)
1756 if (!o || o->op_type != OP_LIST)
1757 o = newLISTOP(OP_LIST, 0, o, Nullop);
1759 o->op_flags &= ~OPf_WANT;
1761 if (!(opargs[type] & OA_MARK))
1762 null(cLISTOPo->op_first);
1765 o->op_ppaddr = ppaddr[type];
1766 o->op_flags |= flags;
1768 o = CHECKOP(type, o);
1769 if (o->op_type != type)
1772 if (cLISTOPo->op_children < 7) {
1773 /* XXX do we really need to do this if we're done appending?? */
1774 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1776 cLISTOPo->op_last = last; /* in case check substituted last arg */
1779 return fold_constants(o);
1782 /* List constructors */
1785 append_elem(type, first, last)
1796 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1797 return newLISTOP(type, 0, first, last);
1799 if (first->op_flags & OPf_KIDS)
1800 ((LISTOP*)first)->op_last->op_sibling = last;
1802 first->op_flags |= OPf_KIDS;
1803 ((LISTOP*)first)->op_first = last;
1805 ((LISTOP*)first)->op_last = last;
1806 ((LISTOP*)first)->op_children++;
1811 append_list(type, first, last)
1822 if (first->op_type != type)
1823 return prepend_elem(type, (OP*)first, (OP*)last);
1825 if (last->op_type != type)
1826 return append_elem(type, (OP*)first, (OP*)last);
1828 first->op_last->op_sibling = last->op_first;
1829 first->op_last = last->op_last;
1830 first->op_children += last->op_children;
1831 if (first->op_children)
1832 last->op_flags |= OPf_KIDS;
1839 prepend_elem(type, first, last)
1850 if (last->op_type == type) {
1851 if (type == OP_LIST) { /* already a PUSHMARK there */
1852 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1853 ((LISTOP*)last)->op_first->op_sibling = first;
1856 if (!(last->op_flags & OPf_KIDS)) {
1857 ((LISTOP*)last)->op_last = first;
1858 last->op_flags |= OPf_KIDS;
1860 first->op_sibling = ((LISTOP*)last)->op_first;
1861 ((LISTOP*)last)->op_first = first;
1863 ((LISTOP*)last)->op_children++;
1867 return newLISTOP(type, 0, first, last);
1875 return newOP(OP_STUB, 0);
1882 if (!o || o->op_type != OP_LIST)
1883 o = newLISTOP(OP_LIST, 0, o, Nullop);
1889 newLISTOP(type, flags, first, last)
1897 Newz(1101, listop, 1, LISTOP);
1899 listop->op_type = type;
1900 listop->op_ppaddr = ppaddr[type];
1901 listop->op_children = (first != 0) + (last != 0);
1902 listop->op_flags = flags;
1906 else if (!first && last)
1909 first->op_sibling = last;
1910 listop->op_first = first;
1911 listop->op_last = last;
1912 if (type == OP_LIST) {
1914 pushop = newOP(OP_PUSHMARK, 0);
1915 pushop->op_sibling = first;
1916 listop->op_first = pushop;
1917 listop->op_flags |= OPf_KIDS;
1919 listop->op_last = pushop;
1921 else if (listop->op_children)
1922 listop->op_flags |= OPf_KIDS;
1933 Newz(1101, o, 1, OP);
1935 o->op_ppaddr = ppaddr[type];
1936 o->op_flags = flags;
1939 o->op_private = 0 + (flags >> 8);
1940 if (opargs[type] & OA_RETSCALAR)
1942 if (opargs[type] & OA_TARGET)
1943 o->op_targ = pad_alloc(type, SVs_PADTMP);
1944 return CHECKOP(type, o);
1948 newUNOP(type, flags, first)
1956 first = newOP(OP_STUB, 0);
1957 if (opargs[type] & OA_MARK)
1958 first = force_list(first);
1960 Newz(1101, unop, 1, UNOP);
1961 unop->op_type = type;
1962 unop->op_ppaddr = ppaddr[type];
1963 unop->op_first = first;
1964 unop->op_flags = flags | OPf_KIDS;
1965 unop->op_private = 1 | (flags >> 8);
1967 unop = (UNOP*) CHECKOP(type, unop);
1971 return fold_constants((OP *) unop);
1975 newBINOP(type, flags, first, 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(o, expr, repl)
2015 SV *tstr = ((SVOP*)expr)->op_sv;
2016 SV *rstr = ((SVOP*)repl)->op_sv;
2019 register U8 *t = (U8*)SvPV(tstr, tlen);
2020 register U8 *r = (U8*)SvPV(rstr, rlen);
2025 register short *tbl;
2027 tbl = (short*)cPVOPo->op_pv;
2028 complement = o->op_private & OPpTRANS_COMPLEMENT;
2029 delete = o->op_private & OPpTRANS_DELETE;
2030 /* squash = o->op_private & OPpTRANS_SQUASH; */
2033 Zero(tbl, 256, short);
2034 for (i = 0; i < tlen; i++)
2036 for (i = 0, j = 0; i < 256; i++) {
2052 if (!rlen && !delete) {
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(type, flags)
2084 Newz(1101, pmop, 1, PMOP);
2085 pmop->op_type = type;
2086 pmop->op_ppaddr = ppaddr[type];
2087 pmop->op_flags = flags;
2088 pmop->op_private = 0 | (flags >> 8);
2090 if (hints & HINT_LOCALE)
2091 pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE);
2093 /* link into pm list */
2094 if (type != OP_TRANS && curstash) {
2095 pmop->op_pmnext = HvPMROOT(curstash);
2096 HvPMROOT(curstash) = pmop;
2103 pmruntime(o, expr, repl)
2111 if (o->op_type == OP_TRANS)
2112 return pmtrans(o, expr, repl);
2114 hints |= HINT_BLOCK_SCOPE;
2117 if (expr->op_type == OP_CONST) {
2119 SV *pat = ((SVOP*)expr)->op_sv;
2120 char *p = SvPV(pat, plen);
2121 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2122 sv_setpvn(pat, "\\s+", 3);
2123 p = SvPV(pat, plen);
2124 pm->op_pmflags |= PMf_SKIPWHITE;
2126 pm->op_pmregexp = pregcomp(p, p + plen, pm);
2127 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2128 pm->op_pmflags |= PMf_WHITE;
2133 if (pm->op_pmflags & PMf_KEEP)
2134 expr = newUNOP(OP_REGCMAYBE,0,expr);
2136 Newz(1101, rcop, 1, LOGOP);
2137 rcop->op_type = OP_REGCOMP;
2138 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2139 rcop->op_first = scalar(expr);
2140 rcop->op_flags |= OPf_KIDS;
2141 rcop->op_private = 1;
2144 /* establish postfix order */
2145 if (pm->op_pmflags & PMf_KEEP) {
2147 rcop->op_next = expr;
2148 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2151 rcop->op_next = LINKLIST(expr);
2152 expr->op_next = (OP*)rcop;
2155 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2160 if (pm->op_pmflags & PMf_EVAL)
2162 else if (repl->op_type == OP_CONST)
2166 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2167 if (opargs[curop->op_type] & OA_DANGEROUS) {
2168 if (curop->op_type == OP_GV) {
2169 GV *gv = ((GVOP*)curop)->op_gv;
2170 if (strchr("&`'123456789+", *GvENAME(gv)))
2173 else if (curop->op_type == OP_RV2CV)
2175 else if (curop->op_type == OP_RV2SV ||
2176 curop->op_type == OP_RV2AV ||
2177 curop->op_type == OP_RV2HV ||
2178 curop->op_type == OP_RV2GV) {
2179 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2182 else if (curop->op_type == OP_PADSV ||
2183 curop->op_type == OP_PADAV ||
2184 curop->op_type == OP_PADHV ||
2185 curop->op_type == OP_PADANY ||
2186 curop->op_type == OP_SPECIFIC) {
2195 if (curop == repl) {
2196 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2197 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2198 prepend_elem(o->op_type, scalar(repl), o);
2201 Newz(1101, rcop, 1, LOGOP);
2202 rcop->op_type = OP_SUBSTCONT;
2203 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2204 rcop->op_first = scalar(repl);
2205 rcop->op_flags |= OPf_KIDS;
2206 rcop->op_private = 1;
2209 /* establish postfix order */
2210 rcop->op_next = LINKLIST(repl);
2211 repl->op_next = (OP*)rcop;
2213 pm->op_pmreplroot = scalar((OP*)rcop);
2214 pm->op_pmreplstart = LINKLIST(rcop);
2223 newSVOP(type, flags, sv)
2229 Newz(1101, svop, 1, SVOP);
2230 svop->op_type = type;
2231 svop->op_ppaddr = ppaddr[type];
2233 svop->op_next = (OP*)svop;
2234 svop->op_flags = flags;
2235 if (opargs[type] & OA_RETSCALAR)
2237 if (opargs[type] & OA_TARGET)
2238 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2239 return CHECKOP(type, svop);
2243 newGVOP(type, flags, gv)
2250 Newz(1101, gvop, 1, GVOP);
2251 gvop->op_type = type;
2252 gvop->op_ppaddr = ppaddr[type];
2253 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2254 gvop->op_next = (OP*)gvop;
2255 gvop->op_flags = flags;
2256 if (opargs[type] & OA_RETSCALAR)
2258 if (opargs[type] & OA_TARGET)
2259 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2260 return CHECKOP(type, gvop);
2264 newPVOP(type, flags, pv)
2270 Newz(1101, pvop, 1, PVOP);
2271 pvop->op_type = type;
2272 pvop->op_ppaddr = ppaddr[type];
2274 pvop->op_next = (OP*)pvop;
2275 pvop->op_flags = flags;
2276 if (opargs[type] & OA_RETSCALAR)
2278 if (opargs[type] & OA_TARGET)
2279 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2280 return CHECKOP(type, pvop);
2290 save_hptr(&curstash);
2291 save_item(curstname);
2296 name = SvPV(sv, len);
2297 curstash = gv_stashpvn(name,len,TRUE);
2298 sv_setpvn(curstname, name, len);
2302 sv_setpv(curstname,"<none>");
2310 utilize(aver, floor, version, id, arg)
2323 if (id->op_type != OP_CONST)
2324 croak("Module name must be constant");
2328 if(version != Nullop) {
2329 SV *vesv = ((SVOP*)version)->op_sv;
2331 if (arg == Nullop && !SvNIOK(vesv)) {
2338 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2339 croak("Version number must be constant number");
2341 /* Make copy of id so we don't free it twice */
2342 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2344 /* Fake up a method call to VERSION */
2345 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2346 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2347 append_elem(OP_LIST,
2348 prepend_elem(OP_LIST, pack, list(version)),
2349 newUNOP(OP_METHOD, 0, meth)));
2353 /* Fake up an import/unimport */
2354 if (arg && arg->op_type == OP_STUB)
2355 imop = arg; /* no import on explicit () */
2356 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2357 imop = Nullop; /* use 5.0; */
2360 /* Make copy of id so we don't free it twice */
2361 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2362 meth = newSVOP(OP_CONST, 0,
2364 ? newSVpv("import", 6)
2365 : newSVpv("unimport", 8)
2367 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2368 append_elem(OP_LIST,
2369 prepend_elem(OP_LIST, pack, list(arg)),
2370 newUNOP(OP_METHOD, 0, meth)));
2373 /* Fake up a require */
2374 rqop = newUNOP(OP_REQUIRE, 0, id);
2376 /* Fake up the BEGIN {}, which does its thing immediately. */
2378 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2380 append_elem(OP_LINESEQ,
2381 append_elem(OP_LINESEQ,
2382 newSTATEOP(0, Nullch, rqop),
2383 newSTATEOP(0, Nullch, veop)),
2384 newSTATEOP(0, Nullch, imop) ));
2391 newSLICEOP(flags, subscript, listval)
2396 return newBINOP(OP_LSLICE, flags,
2397 list(force_list(subscript)),
2398 list(force_list(listval)) );
2408 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2409 o = cUNOPo->op_first;
2411 if (o->op_type == OP_COND_EXPR) {
2412 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2413 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2418 yyerror("Assignment to both a list and a scalar");
2422 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2423 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2424 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2427 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2430 if (o->op_type == OP_RV2SV)
2437 newASSIGNOP(flags, left, optype, right)
2446 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2447 return newLOGOP(optype, 0,
2448 mod(scalar(left), optype),
2449 newUNOP(OP_SASSIGN, 0, scalar(right)));
2452 return newBINOP(optype, OPf_STACKED,
2453 mod(scalar(left), optype), scalar(right));
2457 if (list_assignment(left)) {
2459 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2460 left = mod(left, OP_AASSIGN);
2468 o = newBINOP(OP_AASSIGN, flags,
2469 list(force_list(right)),
2470 list(force_list(left)) );
2471 o->op_private = 0 | (flags >> 8);
2472 if (!(left->op_private & OPpLVAL_INTRO)) {
2473 static int generation = 100;
2477 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2478 if (opargs[curop->op_type] & OA_DANGEROUS) {
2479 if (curop->op_type == OP_GV) {
2480 GV *gv = ((GVOP*)curop)->op_gv;
2481 if (gv == defgv || SvCUR(gv) == generation)
2483 SvCUR(gv) = generation;
2485 else if (curop->op_type == OP_PADSV ||
2486 curop->op_type == OP_PADAV ||
2487 curop->op_type == OP_PADHV ||
2488 curop->op_type == OP_PADANY) {
2489 SV **svp = AvARRAY(comppad_name);
2490 SV *sv = svp[curop->op_targ];
2491 if (SvCUR(sv) == generation)
2493 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2495 else if (curop->op_type == OP_RV2CV)
2497 else if (curop->op_type == OP_RV2SV ||
2498 curop->op_type == OP_RV2AV ||
2499 curop->op_type == OP_RV2HV ||
2500 curop->op_type == OP_RV2GV) {
2501 if (lastop->op_type != OP_GV) /* funny deref? */
2510 o->op_private = OPpASSIGN_COMMON;
2512 if (right && right->op_type == OP_SPLIT) {
2514 if ((tmpop = ((LISTOP*)right)->op_first) &&
2515 tmpop->op_type == OP_PUSHRE)
2517 PMOP *pm = (PMOP*)tmpop;
2518 if (left->op_type == OP_RV2AV &&
2519 !(left->op_private & OPpLVAL_INTRO) &&
2520 !(o->op_private & OPpASSIGN_COMMON) )
2522 tmpop = ((UNOP*)left)->op_first;
2523 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2524 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2525 pm->op_pmflags |= PMf_ONCE;
2526 tmpop = cUNOPo->op_first; /* to list (nulled) */
2527 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2528 tmpop->op_sibling = Nullop; /* don't free split */
2529 right->op_next = tmpop->op_next; /* fix starting loc */
2530 op_free(o); /* blow off assign */
2531 right->op_flags &= ~OPf_WANT;
2532 /* "I don't know and I don't care." */
2537 if (modcount < 10000 &&
2538 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2540 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2542 sv_setiv(sv, modcount+1);
2550 right = newOP(OP_UNDEF, 0);
2551 if (right->op_type == OP_READLINE) {
2552 right->op_flags |= OPf_STACKED;
2553 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2556 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2557 o = newBINOP(OP_SASSIGN, flags,
2558 scalar(right), mod(scalar(left), OP_SASSIGN) );
2570 newSTATEOP(flags, label, o)
2576 U32 seq = intro_my();
2579 Newz(1101, cop, 1, COP);
2580 if (PERLDB_LINE && curcop->cop_line && curstash != debstash) {
2581 cop->op_type = OP_DBSTATE;
2582 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2585 cop->op_type = OP_NEXTSTATE;
2586 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2588 cop->op_flags = flags;
2589 cop->op_private = 0 | (flags >> 8);
2591 cop->op_private |= NATIVE_HINTS;
2593 cop->op_next = (OP*)cop;
2596 cop->cop_label = label;
2597 hints |= HINT_BLOCK_SCOPE;
2600 cop->cop_arybase = curcop->cop_arybase;
2602 if (copline == NOLINE)
2603 cop->cop_line = curcop->cop_line;
2605 cop->cop_line = copline;
2608 cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv);
2609 cop->cop_stash = curstash;
2611 if (PERLDB_LINE && curstash != debstash) {
2612 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2613 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2614 (void)SvIOK_on(*svp);
2616 SvSTASH(*svp) = (HV*)cop;
2620 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2623 /* "Introduce" my variables to visible status. */
2631 if (! min_intro_pending)
2634 svp = AvARRAY(comppad_name);
2635 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2636 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2637 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2638 SvNVX(sv) = (double)cop_seqmax;
2641 min_intro_pending = 0;
2642 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2643 return cop_seqmax++;
2647 newLOGOP(type, flags, first, other)
2657 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2658 return newBINOP(type, flags, scalar(first), scalar(other));
2660 scalarboolean(first);
2661 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2662 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2663 if (type == OP_AND || type == OP_OR) {
2669 first = cUNOPo->op_first;
2671 first->op_next = o->op_next;
2672 cUNOPo->op_first = Nullop;
2676 if (first->op_type == OP_CONST) {
2677 if (dowarn && (first->op_private & OPpCONST_BARE))
2678 warn("Probable precedence problem on %s", op_desc[type]);
2679 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2688 else if (first->op_type == OP_WANTARRAY) {
2694 else if (dowarn && (first->op_flags & OPf_KIDS)) {
2695 OP *k1 = ((UNOP*)first)->op_first;
2696 OP *k2 = k1->op_sibling;
2698 switch (first->op_type)
2701 if (k2 && k2->op_type == OP_READLINE
2702 && (k2->op_flags & OPf_STACKED)
2703 && (k1->op_type == OP_RV2SV || k1->op_type == OP_PADSV))
2704 warnop = k2->op_type;
2708 if (k1->op_type == OP_READDIR
2709 || k1->op_type == OP_GLOB
2710 || k1->op_type == OP_EACH)
2711 warnop = k1->op_type;
2715 line_t oldline = curcop->cop_line;
2716 curcop->cop_line = copline;
2717 warn("Value of %s%s can be \"0\"; test with defined()",
2719 ((warnop == OP_READLINE || warnop == OP_GLOB)
2720 ? " construct" : "() operator"));
2721 curcop->cop_line = oldline;
2728 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2729 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2731 Newz(1101, logop, 1, LOGOP);
2733 logop->op_type = type;
2734 logop->op_ppaddr = ppaddr[type];
2735 logop->op_first = first;
2736 logop->op_flags = flags | OPf_KIDS;
2737 logop->op_other = LINKLIST(other);
2738 logop->op_private = 1 | (flags >> 8);
2740 /* establish postfix order */
2741 logop->op_next = LINKLIST(first);
2742 first->op_next = (OP*)logop;
2743 first->op_sibling = other;
2745 o = newUNOP(OP_NULL, 0, (OP*)logop);
2752 newCONDOP(flags, first, trueop, falseop)
2763 return newLOGOP(OP_AND, 0, first, trueop);
2765 return newLOGOP(OP_OR, 0, first, falseop);
2767 scalarboolean(first);
2768 if (first->op_type == OP_CONST) {
2769 if (SvTRUE(((SVOP*)first)->op_sv)) {
2780 else if (first->op_type == OP_WANTARRAY) {
2784 Newz(1101, condop, 1, CONDOP);
2786 condop->op_type = OP_COND_EXPR;
2787 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2788 condop->op_first = first;
2789 condop->op_flags = flags | OPf_KIDS;
2790 condop->op_true = LINKLIST(trueop);
2791 condop->op_false = LINKLIST(falseop);
2792 condop->op_private = 1 | (flags >> 8);
2794 /* establish postfix order */
2795 condop->op_next = LINKLIST(first);
2796 first->op_next = (OP*)condop;
2798 first->op_sibling = trueop;
2799 trueop->op_sibling = falseop;
2800 o = newUNOP(OP_NULL, 0, (OP*)condop);
2802 trueop->op_next = o;
2803 falseop->op_next = o;
2809 newRANGE(flags, left, right)
2820 Newz(1101, condop, 1, CONDOP);
2822 condop->op_type = OP_RANGE;
2823 condop->op_ppaddr = ppaddr[OP_RANGE];
2824 condop->op_first = left;
2825 condop->op_flags = OPf_KIDS;
2826 condop->op_true = LINKLIST(left);
2827 condop->op_false = LINKLIST(right);
2828 condop->op_private = 1 | (flags >> 8);
2830 left->op_sibling = right;
2832 condop->op_next = (OP*)condop;
2833 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2834 flop = newUNOP(OP_FLOP, 0, flip);
2835 o = newUNOP(OP_NULL, 0, flop);
2838 left->op_next = flip;
2839 right->op_next = flop;
2841 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2842 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2843 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2844 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2846 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2847 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2850 if (!flip->op_private || !flop->op_private)
2851 linklist(o); /* blow off optimizer unless constant */
2857 newLOOPOP(flags, debuggable, expr, block)
2866 int once = block && block->op_flags & OPf_SPECIAL &&
2867 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2870 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2871 return block; /* do {} while 0 does once */
2872 if (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, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2879 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2880 o = newLOGOP(OP_AND, 0, expr, listop);
2882 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2884 if (once && o != listop)
2885 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2888 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2890 o->op_flags |= flags;
2892 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2897 newWHILEOP(flags, debuggable, loop, whileline, expr, block, cont)
2913 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2914 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2915 expr = newUNOP(OP_DEFINED, 0,
2916 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2920 block = newOP(OP_NULL, 0);
2923 next = LINKLIST(cont);
2925 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2926 if ((line_t)whileline != NOLINE) {
2927 copline = whileline;
2928 cont = append_elem(OP_LINESEQ, cont,
2929 newSTATEOP(0, Nullch, Nullop));
2933 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2934 redo = LINKLIST(listop);
2937 o = newLOGOP(OP_AND, 0, expr, scalar(listop));
2938 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
2939 op_free(expr); /* oops, it's a while (0) */
2941 return Nullop; /* (listop already freed by newLOGOP) */
2943 ((LISTOP*)listop)->op_last->op_next = condop =
2944 (o == listop ? redo : LINKLIST(o));
2952 Newz(1101,loop,1,LOOP);
2953 loop->op_type = OP_ENTERLOOP;
2954 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2955 loop->op_private = 0;
2956 loop->op_next = (OP*)loop;
2959 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
2961 loop->op_redoop = redo;
2962 loop->op_lastop = o;
2965 loop->op_nextop = next;
2967 loop->op_nextop = o;
2969 o->op_flags |= flags;
2970 o->op_private |= (flags >> 8);
2975 #ifndef CAN_PROTOTYPE
2976 newFOROP(flags,label,forline,sv,expr,block,cont)
2985 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2986 #endif /* CAN_PROTOTYPE */
2994 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2995 sv->op_type = OP_RV2GV;
2996 sv->op_ppaddr = ppaddr[OP_RV2GV];
2998 else if (sv->op_type == OP_PADSV) { /* private variable */
2999 padoff = sv->op_targ;
3004 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3007 sv = newGVOP(OP_GV, 0, defgv);
3009 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3010 expr = scalar(ref(expr, OP_ITER));
3011 iterflags |= OPf_STACKED;
3013 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3014 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
3016 assert(!loop->op_next);
3017 Renew(loop, 1, LOOP);
3018 loop->op_targ = padoff;
3019 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3021 return newSTATEOP(0, label, wop);
3025 newLOOPEX(type, label)
3031 if (type != OP_GOTO || label->op_type == OP_CONST) {
3032 o = newPVOP(type, 0, savepv(
3033 label->op_type == OP_CONST
3034 ? SvPVx(((SVOP*)label)->op_sv, na)
3039 if (label->op_type == OP_ENTERSUB)
3040 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3041 o = newUNOP(type, OPf_STACKED, label);
3043 hints |= HINT_BLOCK_SCOPE;
3054 MUTEX_DESTROY(CvMUTEXP(cv));
3055 Safefree(CvMUTEXP(cv));
3058 #endif /* USE_THREADS */
3060 if (!CvXSUB(cv) && CvROOT(cv)) {
3062 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3063 croak("Can't undef active subroutine");
3066 croak("Can't undef active subroutine");
3067 #endif /* USE_THREADS */
3074 op_free(CvROOT(cv));
3075 CvROOT(cv) = Nullop;
3078 SvPOK_off((SV*)cv); /* forget prototype */
3080 SvREFCNT_dec(CvGV(cv));
3082 SvREFCNT_dec(CvOUTSIDE(cv));
3083 CvOUTSIDE(cv) = Nullcv;
3084 if (CvPADLIST(cv)) {
3085 /* may be during global destruction */
3086 if (SvREFCNT(CvPADLIST(cv))) {
3087 I32 i = AvFILL(CvPADLIST(cv));
3089 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3090 SV* sv = svp ? *svp : Nullsv;
3093 if (sv == (SV*)comppad_name)
3094 comppad_name = Nullav;
3095 else if (sv == (SV*)comppad) {
3097 curpad = Null(SV**);
3101 SvREFCNT_dec((SV*)CvPADLIST(cv));
3103 CvPADLIST(cv) = Nullav;
3107 #ifdef DEBUG_CLOSURES
3112 CV *outside = CvOUTSIDE(cv);
3113 AV* padlist = CvPADLIST(cv);
3120 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3122 (CvANON(cv) ? "ANON"
3123 : (cv == main_cv) ? "MAIN"
3124 : CvUNIQUE(outside) ? "UNIQUE"
3125 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3128 : CvANON(outside) ? "ANON"
3129 : (outside == main_cv) ? "MAIN"
3130 : CvUNIQUE(outside) ? "UNIQUE"
3131 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3136 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3137 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3138 pname = AvARRAY(pad_name);
3139 ppad = AvARRAY(pad);
3141 for (ix = 1; ix <= AvFILL(pad_name); ix++) {
3142 if (SvPOK(pname[ix]))
3143 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3145 SvFAKE(pname[ix]) ? "FAKE " : "",
3147 (long)I_32(SvNVX(pname[ix])),
3148 (long)SvIVX(pname[ix]));
3151 #endif /* DEBUG_CLOSURES */
3154 cv_clone2(proto, outside)
3161 AV* protopadlist = CvPADLIST(proto);
3162 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3163 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3164 SV** pname = AvARRAY(protopad_name);
3165 SV** ppad = AvARRAY(protopad);
3166 I32 fname = AvFILL(protopad_name);
3167 I32 fpad = AvFILL(protopad);
3171 assert(!CvUNIQUE(proto));
3176 SAVESPTR(comppad_name);
3179 cv = compcv = (CV*)NEWSV(1104,0);
3180 sv_upgrade((SV *)cv, SvTYPE(proto));
3186 New(666, CvMUTEXP(cv), 1, perl_mutex);
3187 MUTEX_INIT(CvMUTEXP(cv));
3189 #endif /* USE_THREADS */
3190 CvFILEGV(cv) = CvFILEGV(proto);
3191 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3192 CvSTASH(cv) = CvSTASH(proto);
3193 CvROOT(cv) = CvROOT(proto);
3194 CvSTART(cv) = CvSTART(proto);
3196 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3199 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3201 comppad_name = newAV();
3202 for (ix = fname; ix >= 0; ix--)
3203 av_store(comppad_name, ix, SvREFCNT_inc(pname[ix]));
3207 comppadlist = newAV();
3208 AvREAL_off(comppadlist);
3209 av_store(comppadlist, 0, (SV*)comppad_name);
3210 av_store(comppadlist, 1, (SV*)comppad);
3211 CvPADLIST(cv) = comppadlist;
3212 av_fill(comppad, AvFILL(protopad));
3213 curpad = AvARRAY(comppad);
3215 av = newAV(); /* will be @_ */
3217 av_store(comppad, 0, (SV*)av);
3218 AvFLAGS(av) = AVf_REIFY;
3220 for (ix = fpad; ix > 0; ix--) {
3221 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3222 if (namesv && namesv != &sv_undef) {
3223 char *name = SvPVX(namesv); /* XXX */
3224 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3225 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3226 CvOUTSIDE(cv), cxstack_ix);
3228 curpad[ix] = SvREFCNT_inc(ppad[ix]);
3230 croak("panic: cv_clone: %s", name);
3232 else { /* our own lexical */
3235 /* anon code -- we'll come back for it */
3236 sv = SvREFCNT_inc(ppad[ix]);
3238 else if (*name == '@')
3240 else if (*name == '%')
3250 SV* sv = NEWSV(0,0);
3256 /* Now that vars are all in place, clone nested closures. */
3258 for (ix = fpad; ix > 0; ix--) {
3259 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3261 && namesv != &sv_undef
3262 && !(SvFLAGS(namesv) & SVf_FAKE)
3263 && *SvPVX(namesv) == '&'
3264 && CvCLONE(ppad[ix]))
3266 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3267 SvREFCNT_dec(ppad[ix]);
3270 curpad[ix] = (SV*)kid;
3274 #ifdef DEBUG_CLOSURES
3275 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3277 PerlIO_printf(Perl_debug_log, " from:\n");
3279 PerlIO_printf(Perl_debug_log, " to:\n");
3291 return cv_clone2(proto, CvOUTSIDE(proto));
3295 cv_ckproto(cv, gv, p)
3300 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3301 SV* msg = sv_newmortal();
3305 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3306 sv_setpv(msg, "Prototype mismatch:");
3308 sv_catpvf(msg, " sub %_", name);
3310 sv_catpvf(msg, " (%s)", SvPVX(cv));
3311 sv_catpv(msg, " vs ");
3313 sv_catpvf(msg, "(%s)", p);
3315 sv_catpv(msg, "none");
3327 if (!cv || !SvPOK(cv) || SvCUR(cv))
3331 for (o = CvSTART(cv); o; o = o->op_next) {
3332 OPCODE type = o->op_type;
3334 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3336 if (type == OP_LEAVESUB || type == OP_RETURN)
3340 if (type == OP_CONST)
3342 else if (type == OP_PADSV) {
3343 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3344 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3345 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3357 newSUB(floor,o,proto,block)
3364 char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch;
3365 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3366 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
3375 if (!name || GvCVGEN(gv))
3377 else if (cv = GvCV(gv)) {
3378 cv_ckproto(cv, gv, ps);
3379 /* already defined (or promised)? */
3380 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3383 /* just a "sub foo;" when &foo is already defined */
3387 /* ahem, death to those who redefine active sort subs */
3388 if (curstack == sortstack && sortcop == CvSTART(cv))
3389 croak("Can't redefine active sort subroutine %s", name);
3390 const_sv = cv_const_sv(cv);
3391 if (const_sv || dowarn) {
3392 line_t oldline = curcop->cop_line;
3393 curcop->cop_line = copline;
3394 warn(const_sv ? "Constant subroutine %s redefined"
3395 : "Subroutine %s redefined", name);
3396 curcop->cop_line = oldline;
3402 if (cv) { /* must reuse cv if autoloaded */
3404 CvFLAGS(cv) = CvFLAGS(compcv);
3405 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
3406 CvOUTSIDE(compcv) = 0;
3407 CvPADLIST(cv) = CvPADLIST(compcv);
3408 CvPADLIST(compcv) = 0;
3409 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
3410 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3411 SvREFCNT_dec(compcv);
3421 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3422 CvFILEGV(cv) = curcop->cop_filegv;
3423 CvSTASH(cv) = curstash;
3426 New(666, CvMUTEXP(cv), 1, perl_mutex);
3427 MUTEX_INIT(CvMUTEXP(cv));
3428 #endif /* USE_THREADS */
3431 sv_setpv((SV*)cv, ps);
3437 char *s = strrchr(name, ':');
3439 if (strEQ(s, "BEGIN")) {
3441 "BEGIN not safe after errors--compilation aborted";
3445 /* force display of errors found but not reported */
3446 sv_catpv(errsv, not_safe);
3447 croak("%s", SvPV(errsv, na));
3458 if (AvFILL(comppad_name) < AvFILL(comppad))
3459 av_store(comppad_name, AvFILL(comppad), Nullsv);
3462 SV **namep = AvARRAY(comppad_name);
3463 for (ix = AvFILL(comppad); ix > 0; ix--) {
3466 if (SvIMMORTAL(curpad[ix]))
3469 * The only things that a clonable function needs in its
3470 * pad are references to outer lexicals and anonymous subs.
3471 * The rest are created anew during cloning.
3473 if (!((namesv = namep[ix]) != Nullsv &&
3474 namesv != &sv_undef &&
3476 *SvPVX(namesv) == '&')))
3478 SvREFCNT_dec(curpad[ix]);
3479 curpad[ix] = Nullsv;
3484 AV *av = newAV(); /* Will be @_ */
3486 av_store(comppad, 0, (SV*)av);
3487 AvFLAGS(av) = AVf_REIFY;
3489 for (ix = AvFILL(comppad); ix > 0; ix--) {
3490 if (SvIMMORTAL(curpad[ix]))
3492 if (!SvPADMY(curpad[ix]))
3493 SvPADTMP_on(curpad[ix]);
3497 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3498 CvSTART(cv) = LINKLIST(CvROOT(cv));
3499 CvROOT(cv)->op_next = 0;
3505 if (PERLDB_SUBLINE && curstash != debstash) {
3506 SV *sv = NEWSV(0,0);
3507 SV *tmpstr = sv_newmortal();
3508 static GV *db_postponed;
3512 sv_setpvf(sv, "%_:%ld-%ld",
3513 GvSV(curcop->cop_filegv),
3514 (long)subline, (long)curcop->cop_line);
3515 gv_efullname3(tmpstr, gv, Nullch);
3516 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3517 if (!db_postponed) {
3518 db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3520 hv = GvHVn(db_postponed);
3521 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3522 && (cv = GvCV(db_postponed))) {
3527 perl_call_sv((SV*)cv, G_DISCARD);
3531 if ((s = strrchr(name,':')))
3535 if (strEQ(s, "BEGIN")) {
3536 I32 oldscope = scopestack_ix;
3538 SAVESPTR(compiling.cop_filegv);
3539 SAVEI16(compiling.cop_line);
3546 DEBUG_x( dump_sub(gv) );
3547 av_push(beginav, (SV *)cv);
3549 call_list(oldscope, beginav);
3551 curcop = &compiling;
3554 else if (strEQ(s, "END") && !error_count) {
3557 av_unshift(endav, 1);
3558 av_store(endav, 0, (SV *)cv);
3561 else if (strEQ(s, "INIT") && !error_count) {
3564 av_push(initav, SvREFCNT_inc(cv));
3576 newXSUB(name, ix, subaddr, filename)
3582 CV* cv = newXS(name, (void(*)())subaddr, filename);
3584 CvXSUBANY(cv).any_i32 = ix;
3590 newXS(name, subaddr, filename)
3592 void (*subaddr) _((CV*));
3596 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3599 if (cv = (name ? GvCV(gv) : Nullcv)) {
3601 /* just a cached method */
3605 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3606 /* already defined (or promised) */
3608 line_t oldline = curcop->cop_line;
3609 curcop->cop_line = copline;
3610 warn("Subroutine %s redefined",name);
3611 curcop->cop_line = oldline;
3618 if (cv) /* must reuse cv if autoloaded */
3621 cv = (CV*)NEWSV(1105,0);
3622 sv_upgrade((SV *)cv, SVt_PVCV);
3629 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3631 New(666, CvMUTEXP(cv), 1, perl_mutex);
3632 MUTEX_INIT(CvMUTEXP(cv));
3634 #endif /* USE_THREADS */
3635 CvFILEGV(cv) = gv_fetchfile(filename);
3636 CvXSUB(cv) = subaddr;
3639 char *s = strrchr(name,':');
3644 if (strEQ(s, "BEGIN")) {
3647 av_push(beginav, (SV *)cv);
3650 else if (strEQ(s, "END")) {
3653 av_unshift(endav, 1);
3654 av_store(endav, 0, (SV *)cv);
3657 else if (strEQ(s, "INIT")) {
3660 av_push(initav, (SV *)cv);
3670 newFORM(floor,o,block)
3682 name = SvPVx(cSVOPo->op_sv, na);
3685 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3687 if (cv = GvFORM(gv)) {
3689 line_t oldline = curcop->cop_line;
3691 curcop->cop_line = copline;
3692 warn("Format %s redefined",name);
3693 curcop->cop_line = oldline;
3699 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3700 CvFILEGV(cv) = curcop->cop_filegv;
3702 for (ix = AvFILL(comppad); ix > 0; ix--) {
3703 if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix]))
3704 SvPADTMP_on(curpad[ix]);
3707 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3708 CvSTART(cv) = LINKLIST(CvROOT(cv));
3709 CvROOT(cv)->op_next = 0;
3720 return newUNOP(OP_REFGEN, 0,
3721 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3728 return newUNOP(OP_REFGEN, 0,
3729 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3733 newANONSUB(floor, proto, block)
3738 return newUNOP(OP_REFGEN, 0,
3739 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3746 switch (o->op_type) {
3748 o->op_type = OP_PADAV;
3749 o->op_ppaddr = ppaddr[OP_PADAV];
3750 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3753 o->op_type = OP_RV2AV;
3754 o->op_ppaddr = ppaddr[OP_RV2AV];
3759 warn("oops: oopsAV");
3769 switch (o->op_type) {
3772 o->op_type = OP_PADHV;
3773 o->op_ppaddr = ppaddr[OP_PADHV];
3774 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3778 o->op_type = OP_RV2HV;
3779 o->op_ppaddr = ppaddr[OP_RV2HV];
3784 warn("oops: oopsHV");
3794 if (o->op_type == OP_PADANY) {
3795 o->op_type = OP_PADAV;
3796 o->op_ppaddr = ppaddr[OP_PADAV];
3799 return newUNOP(OP_RV2AV, 0, scalar(o));
3807 if (type == OP_MAPSTART)
3808 return newUNOP(OP_NULL, 0, o);
3809 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3816 if (o->op_type == OP_PADANY) {
3817 o->op_type = OP_PADHV;
3818 o->op_ppaddr = ppaddr[OP_PADHV];
3821 return newUNOP(OP_RV2HV, 0, scalar(o));
3828 croak("NOT IMPL LINE %d",__LINE__);
3838 return newUNOP(OP_RV2CV, flags, scalar(o));
3845 if (o->op_type == OP_PADANY) {
3846 o->op_type = OP_PADSV;
3847 o->op_ppaddr = ppaddr[OP_PADSV];
3850 else if (o->op_type == OP_SPECIFIC)
3852 return newUNOP(OP_RV2SV, 0, scalar(o));
3855 /* Check routines. */
3864 name = NEWSV(1106,0);
3865 sv_upgrade(name, SVt_PVNV);
3866 sv_setpvn(name, "&", 1);
3869 ix = pad_alloc(o->op_type, SVs_PADMY);
3870 av_store(comppad_name, ix, name);
3871 av_store(comppad, ix, cSVOPo->op_sv);
3872 SvPADMY_on(cSVOPo->op_sv);
3873 cSVOPo->op_sv = Nullsv;
3874 cSVOPo->op_targ = ix;
3882 o->op_private = hints;
3890 if (cUNOPo->op_first->op_type == OP_CONCAT)
3891 o->op_flags |= OPf_STACKED;
3899 if (o->op_flags & OPf_KIDS) {
3902 OPCODE type = o->op_type;
3903 o = modkids(ck_fun(o), type);
3904 kid = cUNOPo->op_first;
3905 newop = kUNOP->op_first->op_sibling;
3907 (newop->op_sibling ||
3908 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3909 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3910 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3914 op_free(kUNOP->op_first);
3915 kUNOP->op_first = newop;
3917 o->op_ppaddr = ppaddr[++o->op_type];
3927 if (o->op_flags & OPf_KIDS) {
3928 OP *kid = cUNOPo->op_first;
3929 if (kid->op_type == OP_HSLICE)
3930 o->op_private |= OPpSLICE;
3931 else if (kid->op_type != OP_HELEM)
3932 croak("%s argument is not a HASH element or slice",
3933 op_desc[o->op_type]);
3943 I32 type = o->op_type;
3945 if (o->op_flags & OPf_KIDS) {
3946 if (cLISTOPo->op_first->op_type == OP_STUB) {
3948 o = newUNOP(type, OPf_SPECIAL,
3949 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
3960 hints |= HINT_BLOCK_SCOPE;
3961 if (o->op_flags & OPf_KIDS) {
3962 SVOP *kid = (SVOP*)cUNOPo->op_first;
3965 o->op_flags &= ~OPf_KIDS;
3968 else if (kid->op_type == OP_LINESEQ) {
3971 kid->op_next = o->op_next;
3972 cUNOPo->op_first = 0;
3975 Newz(1101, enter, 1, LOGOP);
3976 enter->op_type = OP_ENTERTRY;
3977 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3978 enter->op_private = 0;
3980 /* establish postfix order */
3981 enter->op_next = (OP*)enter;
3983 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3984 o->op_type = OP_LEAVETRY;
3985 o->op_ppaddr = ppaddr[OP_LEAVETRY];
3986 enter->op_other = o;
3992 o = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3994 o->op_targ = (PADOFFSET)hints;
4003 if (o->op_flags & OPf_STACKED) {
4005 kid = cUNOPo->op_first->op_sibling;
4006 if (kid->op_type == OP_RV2GV)
4019 if (o->op_flags & OPf_KIDS) {
4020 OP *kid = cUNOPo->op_first;
4021 if (kid->op_type != OP_HELEM)
4022 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4032 o = fold_constants(o);
4033 if (o->op_type == OP_CONST)
4043 SVOP *kid = (SVOP*)cUNOPo->op_first;
4045 o->op_private |= (hints & HINT_STRICT_REFS);
4046 if (kid->op_type == OP_CONST) {
4051 name = SvPV(kid->op_sv, na);
4052 if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4053 char *badthing = Nullch;
4054 switch (o->op_type) {
4056 badthing = "a SCALAR";
4059 badthing = "an ARRAY";
4062 badthing = "a HASH";
4067 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4070 kid->op_type = OP_GV;
4071 iscv = (o->op_type == OP_RV2CV) * 2;
4072 for (gv = 0; !gv; iscv++) {
4074 * This is a little tricky. We only want to add the symbol if we
4075 * didn't add it in the lexer. Otherwise we get duplicate strict
4076 * warnings. But if we didn't add it in the lexer, we must at
4077 * least pretend like we wanted to add it even if it existed before,
4078 * or we get possible typo warnings. OPpCONST_ENTERED says
4079 * whether the lexer already added THIS instance of this symbol.
4081 gv = gv_fetchpv(name,
4082 iscv | !(kid->op_private & OPpCONST_ENTERED),
4085 : o->op_type == OP_RV2SV
4087 : o->op_type == OP_RV2AV
4089 : o->op_type == OP_RV2HV
4093 SvREFCNT_dec(kid->op_sv);
4094 kid->op_sv = SvREFCNT_inc(gv);
4104 I32 type = o->op_type;
4106 if (o->op_flags & OPf_REF)
4109 if (o->op_flags & OPf_KIDS) {
4110 SVOP *kid = (SVOP*)cUNOPo->op_first;
4112 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4113 OP *newop = newGVOP(type, OPf_REF,
4114 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
4121 if (type == OP_FTTTY)
4122 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4125 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4139 int type = o->op_type;
4140 register I32 oa = opargs[type] >> OASHIFT;
4142 if (o->op_flags & OPf_STACKED) {
4143 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4146 return no_fh_allowed(o);
4149 if (o->op_flags & OPf_KIDS) {
4150 tokid = &cLISTOPo->op_first;
4151 kid = cLISTOPo->op_first;
4152 if (kid->op_type == OP_PUSHMARK ||
4153 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4155 tokid = &kid->op_sibling;
4156 kid = kid->op_sibling;
4158 if (!kid && opargs[type] & OA_DEFGV)
4159 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
4163 sibl = kid->op_sibling;
4177 if (kid->op_type == OP_CONST &&
4178 (kid->op_private & OPpCONST_BARE)) {
4179 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4180 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4181 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4183 warn("Array @%s missing the @ in argument %ld of %s()",
4184 name, (long)numargs, op_desc[type]);
4187 kid->op_sibling = sibl;
4190 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4191 bad_type(numargs, "array", op_desc[o->op_type], kid);
4195 if (kid->op_type == OP_CONST &&
4196 (kid->op_private & OPpCONST_BARE)) {
4197 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
4198 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4199 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4201 warn("Hash %%%s missing the %% in argument %ld of %s()",
4202 name, (long)numargs, op_desc[type]);
4205 kid->op_sibling = sibl;
4208 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4209 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4214 OP *newop = newUNOP(OP_NULL, 0, kid);
4215 kid->op_sibling = 0;
4217 newop->op_next = newop;
4219 kid->op_sibling = sibl;
4224 if (kid->op_type != OP_GV) {
4225 if (kid->op_type == OP_CONST &&
4226 (kid->op_private & OPpCONST_BARE)) {
4227 OP *newop = newGVOP(OP_GV, 0,
4228 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
4234 kid->op_sibling = 0;
4235 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4237 kid->op_sibling = sibl;
4243 mod(scalar(kid), type);
4247 tokid = &kid->op_sibling;
4248 kid = kid->op_sibling;
4250 o->op_private |= numargs;
4252 return too_many_arguments(o,op_desc[o->op_type]);
4255 else if (opargs[type] & OA_DEFGV) {
4257 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
4261 while (oa & OA_OPTIONAL)
4263 if (oa && oa != OA_LIST)
4264 return too_few_arguments(o,op_desc[o->op_type]);
4275 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4276 append_elem(OP_GLOB, o, newSVREF(newGVOP(OP_GV, 0, defgv)));
4278 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4279 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4281 if (gv && GvIMPORTED_CV(gv)) {
4282 static int glob_index;
4284 append_elem(OP_GLOB, o,
4285 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4286 o->op_type = OP_LIST;
4287 o->op_ppaddr = ppaddr[OP_LIST];
4288 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4289 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4290 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4291 append_elem(OP_LIST, o,
4292 scalar(newUNOP(OP_RV2CV, 0,
4293 newGVOP(OP_GV, 0, gv)))));
4294 o = newUNOP(OP_NULL, 0, ck_subr(o));
4295 o->op_targ = OP_GLOB; /* hint at what it used to be */
4298 gv = newGVgen("main");
4300 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4311 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4313 o->op_ppaddr = ppaddr[OP_GREPSTART];
4314 Newz(1101, gwop, 1, LOGOP);
4316 if (o->op_flags & OPf_STACKED) {
4319 kid = cLISTOPo->op_first->op_sibling;
4320 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4323 kid->op_next = (OP*)gwop;
4324 o->op_flags &= ~OPf_STACKED;
4326 kid = cLISTOPo->op_first->op_sibling;
4327 if (type == OP_MAPWHILE)
4334 kid = cLISTOPo->op_first->op_sibling;
4335 if (kid->op_type != OP_NULL)
4336 croak("panic: ck_grep");
4337 kid = kUNOP->op_first;
4339 gwop->op_type = type;
4340 gwop->op_ppaddr = ppaddr[type];
4341 gwop->op_first = listkids(o);
4342 gwop->op_flags |= OPf_KIDS;
4343 gwop->op_private = 1;
4344 gwop->op_other = LINKLIST(kid);
4345 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4346 kid->op_next = (OP*)gwop;
4348 kid = cLISTOPo->op_first->op_sibling;
4349 if (!kid || !kid->op_sibling)
4350 return too_few_arguments(o,op_desc[o->op_type]);
4351 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4352 mod(kid, OP_GREPSTART);
4361 if (o->op_flags & OPf_KIDS) {
4362 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4363 if (kid && kid->op_type == OP_CONST)
4364 fbm_compile(((SVOP*)kid)->op_sv);
4373 /* XXX length optimization goes here */
4381 OPCODE type = o->op_type;
4382 return modkids(ck_fun(o), type);
4389 OPCODE type = o->op_type;
4390 return refkids(ck_fun(o), type);
4399 kid = cLISTOPo->op_first;
4402 kid = cLISTOPo->op_first;
4404 if (kid->op_type == OP_PUSHMARK)
4405 kid = kid->op_sibling;
4406 if (kid && o->op_flags & OPf_STACKED)
4407 kid = kid->op_sibling;
4408 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4409 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4410 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4411 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4412 cLISTOPo->op_first->op_sibling = kid;
4413 cLISTOPo->op_last = kid;
4414 kid = kid->op_sibling;
4419 append_elem(o->op_type, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4425 if (hints & HINT_LOCALE)
4426 o->op_private |= OPpLOCALE;
4440 if (hints & HINT_LOCALE)
4441 o->op_private |= OPpLOCALE;
4453 if (hints & HINT_LOCALE)
4454 o->op_private |= OPpLOCALE;
4464 o->op_private |= OPpRUNTIME;
4479 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4480 o->op_private |= OPpREPEAT_DOLIST;
4481 cBINOPo->op_first = force_list(cBINOPo->op_first);
4492 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4493 SVOP *kid = (SVOP*)cUNOPo->op_first;
4495 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4497 for (s = SvPVX(kid->op_sv); *s; s++) {
4498 if (*s == ':' && s[1] == ':') {
4500 Move(s+2, s+1, strlen(s+2)+1, char);
4501 --SvCUR(kid->op_sv);
4504 sv_catpvn(kid->op_sv, ".pm", 3);
4514 croak("NOT IMPL LINE %d",__LINE__);
4524 if (o->op_flags & OPf_KIDS) {
4525 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4526 if (kid && kid->op_sibling) {
4527 o->op_type = OP_SSELECT;
4528 o->op_ppaddr = ppaddr[OP_SSELECT];
4530 return fold_constants(o);
4534 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4535 if (kid && kid->op_type == OP_RV2GV)
4536 kid->op_private &= ~HINT_STRICT_REFS;
4544 I32 type = o->op_type;
4546 if (!(o->op_flags & OPf_KIDS)) {
4552 argop = newOP(OP_PADAV, OPf_REF);
4553 argop->op_targ = 0; /* curpad[0] is @_ */
4556 argop = newUNOP(OP_RV2AV, 0,
4557 scalar(newGVOP(OP_GV, 0,
4558 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4561 argop = newUNOP(OP_RV2AV, 0,
4562 scalar(newGVOP(OP_GV, 0, subline ?
4563 defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4564 #endif /* USE_THREADS */
4565 return newUNOP(type, 0, scalar(argop));
4567 return scalar(modkids(ck_fun(o), type));
4576 if (hints & HINT_LOCALE)
4577 o->op_private |= OPpLOCALE;
4580 if (o->op_flags & OPf_STACKED) {
4581 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4583 kid = kUNOP->op_first; /* get past rv2gv */
4585 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4587 if (kid->op_type == OP_SCOPE) {
4591 else if (kid->op_type == OP_LEAVE) {
4592 if (o->op_type == OP_SORT) {
4593 null(kid); /* wipe out leave */
4596 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4597 if (k->op_next == kid)
4602 kid->op_next = 0; /* just disconnect the leave */
4603 k = kLISTOP->op_first;
4607 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4608 null(kid); /* wipe out rv2gv */
4609 if (o->op_type == OP_SORT)
4613 o->op_flags |= OPf_SPECIAL;
4627 if (o->op_flags & OPf_STACKED)
4628 return no_fh_allowed(o);
4630 kid = cLISTOPo->op_first;
4631 if (kid->op_type != OP_NULL)
4632 croak("panic: ck_split");
4633 kid = kid->op_sibling;
4634 op_free(cLISTOPo->op_first);
4635 cLISTOPo->op_first = kid;
4637 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4638 cLISTOPo->op_last = kid; /* There was only one element previously */
4641 if (kid->op_type != OP_MATCH) {
4642 OP *sibl = kid->op_sibling;
4643 kid->op_sibling = 0;
4644 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4645 if (cLISTOPo->op_first == cLISTOPo->op_last)
4646 cLISTOPo->op_last = kid;
4647 cLISTOPo->op_first = kid;
4648 kid->op_sibling = sibl;
4651 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
4652 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
4656 kid->op_type = OP_PUSHRE;
4657 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4660 if (!kid->op_sibling)
4661 append_elem(OP_SPLIT, o, newSVREF(newGVOP(OP_GV, 0, defgv)) );
4663 kid = kid->op_sibling;
4666 if (!kid->op_sibling)
4667 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4669 kid = kid->op_sibling;
4672 if (kid->op_sibling)
4673 return too_many_arguments(o,op_desc[o->op_type]);
4683 OP *prev = ((cUNOPo->op_first->op_sibling)
4684 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4685 OP *o2 = prev->op_sibling;
4693 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4694 if (cvop->op_type == OP_RV2CV) {
4696 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4697 null(cvop); /* disable rv2cv */
4698 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4699 if (tmpop->op_type == OP_GV) {
4700 cv = GvCVu(tmpop->op_sv);
4701 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4702 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4703 proto = SvPV((SV*)cv, na);
4707 o->op_private |= (hints & HINT_STRICT_REFS);
4708 if (PERLDB_SUB && curstash != debstash)
4709 o->op_private |= OPpENTERSUB_DB;
4710 while (o2 != cvop) {
4714 return too_many_arguments(o, gv_ename(namegv));
4732 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4733 bad_type(arg, "block", gv_ename(namegv), o2);
4738 if (o2->op_type == OP_RV2GV)
4742 o2 = newUNOP(OP_RV2GV, 0, kid);
4743 o2->op_sibling = kid->op_sibling;
4744 kid->op_sibling = 0;
4745 prev->op_sibling = o;
4753 if (o2->op_type != OP_RV2GV)
4754 bad_type(arg, "symbol", gv_ename(namegv), o2);
4757 if (o2->op_type != OP_RV2CV)
4758 bad_type(arg, "sub", gv_ename(namegv), o2);
4761 if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV)
4762 bad_type(arg, "scalar", gv_ename(namegv), o2);
4765 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4766 bad_type(arg, "array", gv_ename(namegv), o2);
4769 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4770 bad_type(arg, "hash", gv_ename(namegv), o2);
4774 o2 = newUNOP(OP_REFGEN, 0, kid);
4775 o2->op_sibling = kid->op_sibling;
4776 kid->op_sibling = 0;
4777 prev->op_sibling = o2;
4788 croak("Malformed prototype for %s: %s",
4789 gv_ename(namegv), SvPV((SV*)cv, na));
4794 mod(o2, OP_ENTERSUB);
4796 o2 = o2->op_sibling;
4798 if (proto && !optional &&
4799 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4800 return too_few_arguments(o, gv_ename(namegv));
4808 SvREADONLY_on(cSVOPo->op_sv);
4816 if (o->op_flags & OPf_KIDS) {
4817 SVOP *kid = (SVOP*)cUNOPo->op_first;
4819 if (kid->op_type == OP_NULL)
4820 kid = (SVOP*)kid->op_sibling;
4822 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4823 o->op_flags |= OPf_SPECIAL;
4828 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4835 register OP* oldop = 0;
4836 if (!o || o->op_seq)
4841 for (; o; o = o->op_next) {
4847 switch (o->op_type) {
4850 curcop = ((COP*)o); /* for warnings */
4851 o->op_seq = op_seqmax++;
4862 if (o->op_next->op_type == OP_STRINGIFY)
4864 o->op_seq = op_seqmax++;
4867 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
4868 o->op_seq = op_seqmax++;
4869 break; /* Scalar stub must produce undef. List stub is noop */
4873 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4874 curcop = ((COP*)op);
4880 if (oldop && o->op_next) {
4881 oldop->op_next = o->op_next;
4884 o->op_seq = op_seqmax++;
4888 if (o->op_next->op_type == OP_RV2SV) {
4889 if (!(o->op_next->op_private & OPpDEREF)) {
4891 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4892 o->op_next = o->op_next->op_next;
4893 o->op_type = OP_GVSV;
4894 o->op_ppaddr = ppaddr[OP_GVSV];
4897 else if (o->op_next->op_type == OP_RV2AV) {
4898 OP* pop = o->op_next->op_next;
4900 if (pop->op_type == OP_CONST &&
4901 (op = pop->op_next) &&
4902 pop->op_next->op_type == OP_AELEM &&
4903 !(pop->op_next->op_private &
4904 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
4905 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4909 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4913 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4914 o->op_next = pop->op_next->op_next;
4915 o->op_type = OP_AELEMFAST;
4916 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4917 o->op_private = (U8)i;
4918 GvAVn(((GVOP*)o)->op_gv);
4921 o->op_seq = op_seqmax++;
4925 if (o->op_next->op_type == OP_RV2AV
4926 && (o->op_next->op_flags && OPf_REF))
4929 o->op_next = o->op_next->op_next;
4934 if (o->op_next->op_type == OP_RV2HV
4935 && (o->op_next->op_flags && OPf_REF))
4938 o->op_next = o->op_next->op_next;
4946 o->op_seq = op_seqmax++;
4947 peep(cLOGOP->op_other);
4951 o->op_seq = op_seqmax++;
4952 peep(cCONDOP->op_true);
4953 peep(cCONDOP->op_false);
4957 o->op_seq = op_seqmax++;
4958 peep(cLOOP->op_redoop);
4959 peep(cLOOP->op_nextop);
4960 peep(cLOOP->op_lastop);
4965 o->op_seq = op_seqmax++;
4966 peep(cPMOP->op_pmreplstart);
4970 o->op_seq = op_seqmax++;
4971 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4972 if (o->op_next->op_sibling &&
4973 o->op_next->op_sibling->op_type != OP_DIE) {
4974 line_t oldline = curcop->cop_line;
4976 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4977 warn("Statement unlikely to be reached");
4978 warn("(Maybe you meant system() when you said exec()?)\n");
4979 curcop->cop_line = oldline;
4993 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
4994 || ((BINOP*)o)->op_last->op_type != OP_CONST)
4996 rop = (UNOP*)((BINOP*)o)->op_first;
4997 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
4999 lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE);
5000 if (!SvOBJECT(lexname))
5002 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5003 if (!fields || !GvHV(*fields))
5005 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5006 key = SvPV(*svp, keylen);
5007 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5009 croak("No such field \"%s\" in variable %s of type %s",
5010 key, SvPV(lexname, na), HvNAME(SvSTASH(lexname)));
5012 ind = SvIV(*indsvp);
5014 croak("Bad index while coercing array into hash");
5015 rop->op_type = OP_RV2AV;
5016 rop->op_ppaddr = ppaddr[OP_RV2AV];
5017 o->op_type = OP_AELEM;
5018 o->op_ppaddr = ppaddr[OP_AELEM];
5020 *svp = newSViv(ind);
5025 o->op_seq = op_seqmax++;