3 * Copyright (c) 1991-1994, 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
21 #define USE_OP_MASK /* Turned on by default in 5.002beta1h */
25 * In the following definition, the ", (OP *) op" is just to make the compiler
26 * think the expression is of the right type: croak actually does a Siglongjmp.
28 #define CHECKOP(type,op) \
29 ((op_mask && op_mask[type]) \
30 ? (croak("%s trapped by operation mask", op_desc[type]), (OP*)op) \
31 : (*check[type])((OP*)op))
33 #define CHECKOP(type,op) (*check[type])(op)
34 #endif /* USE_OP_MASK */
36 static I32 list_assignment _((OP *op));
37 static OP *bad_type _((I32 n, char *t, char *name, OP *kid));
38 static OP *modkids _((OP *op, I32 type));
39 static OP *no_fh_allowed _((OP *op));
40 static OP *scalarboolean _((OP *op));
41 static OP *too_few_arguments _((OP *op, char* name));
42 static OP *too_many_arguments _((OP *op, char* name));
43 static void null _((OP* op));
44 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, I32 seq,
45 CV* startcv, I32 cx_ix));
51 SV* tmpsv = sv_newmortal();
52 gv_efullname3(tmpsv, CvGV(cv), Nullch);
53 return SvPV(tmpsv,na);
60 sprintf(tokenbuf,"Missing comma after first argument to %s function",
61 op_desc[op->op_type]);
67 too_few_arguments(op, name)
71 sprintf(tokenbuf,"Not enough arguments for %s", name);
77 too_many_arguments(op, name)
81 sprintf(tokenbuf,"Too many arguments for %s", name);
87 bad_type(n, t, name, kid)
93 sprintf(tokenbuf, "Type of arg %d to %s must be %s (not %s)",
94 (int) n, name, t, op_desc[kid->op_type]);
103 int type = op->op_type;
104 if (type != OP_AELEM && type != OP_HELEM) {
105 sprintf(tokenbuf, "Can't use subscript on %s", op_desc[type]);
107 if (type == OP_RV2HV || type == OP_ENTERSUB)
108 warn("(Did you mean $ or @ instead of %c?)\n",
109 type == OP_RV2HV ? '%' : '&');
113 /* "register" allocation */
122 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
123 if (!isprint(name[1]))
124 sprintf(name+1, "^%c", name[1] ^ 64); /* XXX is tokenbuf, really */
125 croak("Can't use global %s in \"my\"",name);
127 if (AvFILL(comppad_name) >= 0) {
128 SV **svp = AvARRAY(comppad_name);
129 for (off = AvFILL(comppad_name); off > comppad_name_floor; off--) {
132 && SvIVX(sv) == 999999999 /* var is in open scope */
133 && strEQ(name, SvPVX(sv)))
135 warn("\"my\" variable %s masks earlier declaration in same scope", name);
140 off = pad_alloc(OP_PADSV, SVs_PADMY);
142 sv_upgrade(sv, SVt_PVNV);
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, I32 seq, CV* startcv, I32 cx_ix)
174 register CONTEXT *cx;
177 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
178 AV* curlist = CvPADLIST(cv);
179 SV** svp = av_fetch(curlist, 0, FALSE);
181 if (!svp || *svp == &sv_undef)
184 svp = AvARRAY(curname);
185 for (off = AvFILL(curname); off > 0; off--) {
186 if ((sv = svp[off]) &&
189 seq > (I32)SvNVX(sv) &&
190 strEQ(SvPVX(sv), name))
192 I32 depth = CvDEPTH(cv) ? CvDEPTH(cv) : 1;
193 AV *oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
194 SV *oldsv = *av_fetch(oldpad, off, TRUE);
195 if (!newoff) { /* Not a mere clone operation. */
196 SV *sv = NEWSV(1103,0);
197 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
198 sv_upgrade(sv, SVt_PVNV);
200 av_store(comppad_name, newoff, sv);
201 SvNVX(sv) = (double)curcop->cop_seq;
202 SvIVX(sv) = 999999999; /* A ref, intro immediately */
203 SvFLAGS(sv) |= SVf_FAKE;
205 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
212 /* Nothing in current lexical context--try eval's context, if any.
213 * This is necessary to let the perldb get at lexically scoped variables.
214 * XXX This will also probably interact badly with eval tree caching.
218 for (i = cx_ix; i >= 0; i--) {
220 switch (cx->cx_type) {
222 if (i == 0 && saweval) {
223 seq = cxstack[saweval].blk_oldcop->cop_seq;
224 return pad_findlex(name, newoff, seq, main_cv, 0);
228 if (cx->blk_eval.old_op_type != OP_ENTEREVAL &&
229 cx->blk_eval.old_op_type != OP_ENTERTRY)
230 return 0; /* require must have its own scope */
237 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
238 saweval = i; /* so we know where we were called from */
241 seq = cxstack[saweval].blk_oldcop->cop_seq;
242 return pad_findlex(name, newoff, seq, cv, i-1);
255 SV **svp = AvARRAY(comppad_name);
256 I32 seq = cop_seqmax;
258 /* The one we're looking for is probably just before comppad_name_fill. */
259 for (off = AvFILL(comppad_name); off > 0; off--) {
260 if ((sv = svp[off]) &&
263 seq > (I32)SvNVX(sv) &&
264 strEQ(SvPVX(sv), name))
266 return (PADOFFSET)off;
270 /* See if it's in a nested scope */
271 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
283 SV **svp = AvARRAY(comppad_name);
285 if (min_intro_pending && fill < min_intro_pending) {
286 for (off = max_intro_pending; off >= min_intro_pending; off--) {
287 if ((sv = svp[off]) && sv != &sv_undef)
288 warn("%s never introduced", SvPVX(sv));
291 /* "Deintroduce" my variables that are leaving with this scope. */
292 for (off = AvFILL(comppad_name); off > fill; off--) {
293 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
294 SvIVX(sv) = cop_seqmax;
299 pad_alloc(optype,tmptype)
306 if (AvARRAY(comppad) != curpad)
307 croak("panic: pad_alloc");
308 if (pad_reset_pending)
310 if (tmptype & SVs_PADMY) {
312 sv = *av_fetch(comppad, AvFILL(comppad) + 1, TRUE);
313 } while (SvPADBUSY(sv)); /* need a fresh one */
314 retval = AvFILL(comppad);
318 sv = *av_fetch(comppad, ++padix, TRUE);
319 } while (SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY));
322 SvFLAGS(sv) |= tmptype;
323 curpad = AvARRAY(comppad);
324 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad alloc %ld for %s\n", (long) retval, op_name[optype]));
325 return (PADOFFSET)retval;
329 #ifndef CAN_PROTOTYPE
334 #endif /* CAN_PROTOTYPE */
337 croak("panic: pad_sv po");
338 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad sv %d\n", po));
339 return curpad[po]; /* eventually we'll turn this into a macro */
343 #ifndef CAN_PROTOTYPE
347 pad_free(PADOFFSET po)
348 #endif /* CAN_PROTOTYPE */
352 if (AvARRAY(comppad) != curpad)
353 croak("panic: pad_free curpad");
355 croak("panic: pad_free po");
356 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad free %d\n", po));
357 if (curpad[po] && curpad[po] != &sv_undef)
358 SvPADTMP_off(curpad[po]);
364 #ifndef CAN_PROTOTYPE
368 pad_swipe(PADOFFSET po)
369 #endif /* CAN_PROTOTYPE */
371 if (AvARRAY(comppad) != curpad)
372 croak("panic: pad_swipe curpad");
374 croak("panic: pad_swipe po");
375 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad swipe %d\n", po));
376 SvPADTMP_off(curpad[po]);
377 curpad[po] = NEWSV(1107,0);
378 SvPADTMP_on(curpad[po]);
388 if (AvARRAY(comppad) != curpad)
389 croak("panic: pad_reset curpad");
390 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad reset\n"));
391 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
392 for (po = AvMAX(comppad); po > padix_floor; po--) {
393 if (curpad[po] && curpad[po] != &sv_undef)
394 SvPADTMP_off(curpad[po]);
398 pad_reset_pending = FALSE;
407 register OP *kid, *nextkid;
409 if (!op || op->op_seq == (U16)-1)
412 if (op->op_flags & OPf_KIDS) {
413 for (kid = cUNOP->op_first; kid; kid = nextkid) {
414 nextkid = kid->op_sibling; /* Get before next freeing kid */
419 switch (op->op_type) {
421 op->op_targ = 0; /* Was holding old type, if any. */
424 op->op_targ = 0; /* Was holding hints. */
428 SvREFCNT_dec(cGVOP->op_gv);
432 SvREFCNT_dec(cCOP->cop_filegv);
434 /* case OP_ANONCODE: XXX breaks eval of anon subs in closures (cf. Opcode) */
436 SvREFCNT_dec(cSVOP->op_sv);
442 if (op->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
446 Safefree(cPVOP->op_pv);
449 op_free(cPMOP->op_pmreplroot);
453 pregfree(cPMOP->op_pmregexp);
454 SvREFCNT_dec(cPMOP->op_pmshort);
461 pad_free(op->op_targ);
470 if (op->op_type != OP_NULL && op->op_targ > 0)
471 pad_free(op->op_targ);
472 op->op_targ = op->op_type;
473 op->op_type = OP_NULL;
474 op->op_ppaddr = ppaddr[OP_NULL];
477 /* Contextualizers */
479 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
490 /* establish postfix order */
491 if (cUNOP->op_first) {
492 op->op_next = LINKLIST(cUNOP->op_first);
493 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling) {
495 kid->op_next = LINKLIST(kid->op_sibling);
511 if (op && op->op_flags & OPf_KIDS) {
512 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
523 op->op_type == OP_SASSIGN && cBINOP->op_first->op_type == OP_CONST) {
524 line_t oldline = curcop->cop_line;
526 if (copline != NOLINE)
527 curcop->cop_line = copline;
528 warn("Found = in conditional, should be ==");
529 curcop->cop_line = oldline;
540 /* assumes no premature commitment */
541 if (!op || (op->op_flags & OPf_KNOW) || error_count)
544 op->op_flags &= ~OPf_LIST;
545 op->op_flags |= OPf_KNOW;
547 switch (op->op_type) {
549 if (op->op_private & OPpREPEAT_DOLIST)
550 null(((LISTOP*)cBINOP->op_first)->op_first);
551 scalar(cBINOP->op_first);
556 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
560 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
561 if (!kPMOP->op_pmreplroot)
562 deprecate("implicit split to @_");
569 if (op->op_flags & OPf_KIDS) {
570 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling)
576 scalar(cLISTOP->op_first);
581 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
601 if (!op || error_count)
603 if (op->op_flags & OPf_LIST)
606 op->op_flags |= OPf_KNOW;
608 switch (op->op_type) {
610 if (!(opargs[op->op_type] & OA_FOLDCONST))
612 if (op->op_flags & OPf_STACKED)
685 if (!(op->op_private & OPpLVAL_INTRO))
686 useless = op_desc[op->op_type];
693 if (!(op->op_private & OPpLVAL_INTRO) &&
694 (!op->op_sibling || op->op_sibling->op_type != OP_READLINE))
695 useless = "a variable";
700 curcop = ((COP*)op); /* for warning below */
706 useless = "a constant";
707 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
709 else if (SvPOK(sv)) {
710 if (strnEQ(SvPVX(sv), "di", 2) ||
711 strnEQ(SvPVX(sv), "ds", 2) ||
712 strnEQ(SvPVX(sv), "ig", 2))
716 null(op); /* don't execute a constant */
717 SvREFCNT_dec(sv); /* don't even remember it */
721 op->op_type = OP_PREINC; /* pre-increment is faster */
722 op->op_ppaddr = ppaddr[OP_PREINC];
726 op->op_type = OP_PREDEC; /* pre-decrement is faster */
727 op->op_ppaddr = ppaddr[OP_PREDEC];
731 scalarvoid(cBINOP->op_first);
732 useless = op_desc[op->op_type];
738 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
742 if (op->op_targ == OP_NEXTSTATE || op->op_targ == OP_DBSTATE)
743 curcop = ((COP*)op); /* for warning below */
744 if (op->op_flags & OPf_STACKED)
749 if (!(op->op_flags & OPf_KIDS))
755 op->op_private |= OPpLEAVE_VOID;
758 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
762 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
763 if (!kPMOP->op_pmreplroot)
764 deprecate("implicit split to @_");
768 op->op_private |= OPpLEAVE_VOID;
771 if (useless && dowarn)
772 warn("Useless use of %s in void context", useless);
781 if (op && op->op_flags & OPf_KIDS) {
782 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
794 /* assumes no premature commitment */
795 if (!op || (op->op_flags & OPf_KNOW) || error_count)
798 op->op_flags |= (OPf_KNOW | OPf_LIST);
800 switch (op->op_type) {
803 list(cBINOP->op_first);
808 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
815 if (!(op->op_flags & OPf_KIDS))
817 if (!op->op_next && cUNOP->op_first->op_type == OP_FLOP) {
818 list(cBINOP->op_first);
819 return gen_constant_list(op);
826 list(cLISTOP->op_first);
830 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
849 if (op->op_type == OP_LINESEQ ||
850 op->op_type == OP_SCOPE ||
851 op->op_type == OP_LEAVE ||
852 op->op_type == OP_LEAVETRY)
854 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
855 if (kid->op_sibling) {
861 op->op_flags &= ~OPf_PARENS;
862 if (hints & HINT_BLOCK_SCOPE)
863 op->op_flags |= OPf_PARENS;
866 op = newOP(OP_STUB, 0);
876 if (op && op->op_flags & OPf_KIDS) {
877 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
894 if (!op || error_count)
897 switch (op->op_type) {
899 if (!(op->op_private & (OPpCONST_ARYBASE)))
901 if (eval_start && eval_start->op_type == OP_CONST) {
902 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
906 SAVEI32(compiling.cop_arybase);
907 compiling.cop_arybase = 0;
909 else if (type == OP_REFGEN)
912 croak("That use of $[ is unsupported");
915 if ((type == OP_UNDEF || type == OP_REFGEN) &&
916 !(op->op_flags & OPf_STACKED)) {
917 op->op_type = OP_RV2CV; /* entersub => rv2cv */
918 op->op_ppaddr = ppaddr[OP_RV2CV];
919 assert(cUNOP->op_first->op_type == OP_NULL);
920 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
926 /* grep, foreach, subcalls, refgen */
927 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
929 sprintf(tokenbuf, "Can't modify %s in %s",
930 op_desc[op->op_type],
931 type ? op_desc[type] : "local");
955 if (!(op->op_flags & OPf_STACKED))
961 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
967 if (type == OP_REFGEN && op->op_flags & OPf_PARENS) {
969 return op; /* Treat \(@foo) like ordinary list. */
973 ref(cUNOP->op_first, op->op_type);
985 if (!type && cUNOP->op_first->op_type != OP_GV)
986 croak("Can't localize a reference");
987 ref(cUNOP->op_first, op->op_type);
1000 if (type == OP_REFGEN && op->op_flags & OPf_PARENS)
1001 return op; /* Treat \(@foo) like ordinary list. */
1006 croak("Can't localize lexical variable %s",
1007 SvPV(*av_fetch(comppad_name, op->op_targ, 4), na));
1014 if (type != OP_SASSIGN)
1027 pad_free(op->op_targ);
1028 op->op_targ = pad_alloc(op->op_type, SVs_PADMY);
1029 sv = PAD_SV(op->op_targ);
1030 sv_upgrade(sv, SVt_PVLV);
1031 sv_magic(sv, Nullsv, mtype, Nullch, 0);
1032 curpad[op->op_targ] = sv;
1033 if (op->op_flags & OPf_KIDS)
1034 mod(cBINOP->op_first->op_sibling, type);
1039 ref(cBINOP->op_first, op->op_type);
1046 if (op->op_flags & OPf_KIDS)
1047 mod(cLISTOP->op_last, type);
1051 if (!(op->op_flags & OPf_KIDS))
1053 if (op->op_targ != OP_LIST) {
1054 mod(cBINOP->op_first, type);
1059 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1063 op->op_flags |= OPf_MOD;
1065 if (type == OP_AASSIGN || type == OP_SASSIGN)
1066 op->op_flags |= OPf_SPECIAL|OPf_REF;
1068 op->op_private |= OPpLVAL_INTRO;
1069 op->op_flags &= ~OPf_SPECIAL;
1071 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1072 op->op_flags |= OPf_REF;
1082 if (op && op->op_flags & OPf_KIDS) {
1083 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1096 if (!op || error_count)
1099 switch (op->op_type) {
1101 if ((type == OP_DEFINED) &&
1102 !(op->op_flags & OPf_STACKED)) {
1103 op->op_type = OP_RV2CV; /* entersub => rv2cv */
1104 op->op_ppaddr = ppaddr[OP_RV2CV];
1105 assert(cUNOP->op_first->op_type == OP_NULL);
1106 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
1107 op->op_flags |= OPf_SPECIAL;
1112 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
1116 ref(cUNOP->op_first, op->op_type);
1119 if (type == OP_RV2AV || type == OP_RV2HV) {
1120 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV : OPpDEREF_HV);
1121 op->op_flags |= OPf_MOD;
1127 op->op_flags |= OPf_REF;
1130 ref(cUNOP->op_first, op->op_type);
1135 op->op_flags |= OPf_REF;
1140 if (!(op->op_flags & OPf_KIDS))
1142 ref(cBINOP->op_first, type);
1146 ref(cBINOP->op_first, op->op_type);
1147 if (type == OP_RV2AV || type == OP_RV2HV) {
1148 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV : OPpDEREF_HV);
1149 op->op_flags |= OPf_MOD;
1157 if (!(op->op_flags & OPf_KIDS))
1159 ref(cLISTOP->op_last, type);
1175 if (!op || error_count)
1179 if (type == OP_LIST) {
1180 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1183 else if (type != OP_PADSV &&
1186 type != OP_PUSHMARK)
1188 sprintf(tokenbuf, "Can't declare %s in my", op_desc[op->op_type]);
1192 op->op_flags |= OPf_MOD;
1193 op->op_private |= OPpLVAL_INTRO;
1202 o->op_flags |= OPf_PARENS;
1207 bind_match(type, left, right)
1214 if (right->op_type == OP_MATCH ||
1215 right->op_type == OP_SUBST ||
1216 right->op_type == OP_TRANS) {
1217 right->op_flags |= OPf_STACKED;
1218 if (right->op_type != OP_MATCH)
1219 left = mod(left, right->op_type);
1220 if (right->op_type == OP_TRANS)
1221 op = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1223 op = prepend_elem(right->op_type, scalar(left), right);
1225 return newUNOP(OP_NOT, 0, scalar(op));
1229 return bind_match(type, left,
1230 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1239 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1240 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(op));
1248 if (o->op_flags & OPf_PARENS || perldb || tainting) {
1249 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1250 o->op_type = OP_LEAVE;
1251 o->op_ppaddr = ppaddr[OP_LEAVE];
1254 if (o->op_type == OP_LINESEQ) {
1256 o->op_type = OP_SCOPE;
1257 o->op_ppaddr = ppaddr[OP_SCOPE];
1258 kid = ((LISTOP*)o)->op_first;
1259 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1260 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1265 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1275 int retval = savestack_ix;
1276 SAVEI32(comppad_name_floor);
1278 if ((comppad_name_fill = AvFILL(comppad_name)) > 0)
1279 comppad_name_floor = comppad_name_fill;
1281 comppad_name_floor = 0;
1283 SAVEI32(min_intro_pending);
1284 SAVEI32(max_intro_pending);
1285 min_intro_pending = 0;
1286 SAVEI32(comppad_name_fill);
1287 SAVEI32(padix_floor);
1288 padix_floor = padix;
1289 pad_reset_pending = FALSE;
1291 hints &= ~HINT_BLOCK_SCOPE;
1296 block_end(line, floor, seq)
1301 int needblockscope = hints & HINT_BLOCK_SCOPE;
1302 OP* retval = scalarseq(seq);
1303 if (copline > (line_t)line)
1306 pad_reset_pending = FALSE;
1308 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1309 pad_leavemy(comppad_name_fill);
1318 eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), op);
1319 eval_start = linklist(eval_root);
1320 eval_root->op_next = 0;
1328 main_root = scope(sawparens(scalarvoid(op)));
1329 curcop = &compiling;
1330 main_start = LINKLIST(main_root);
1331 main_root->op_next = 0;
1343 if (o->op_flags & OPf_PARENS)
1347 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1349 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1350 if (*s == ';' || *s == '=')
1351 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1358 return mod(o, OP_NULL); /* a bit kludgey */
1365 if (o->op_type == OP_LIST) {
1366 o = convert(OP_JOIN, 0,
1367 prepend_elem(OP_LIST,
1368 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1379 I32 type = o->op_type;
1382 if (opargs[type] & OA_RETSCALAR)
1384 if (opargs[type] & OA_TARGET)
1385 o->op_targ = pad_alloc(type, SVs_PADTMP);
1387 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1388 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1390 if (!(opargs[type] & OA_FOLDCONST))
1394 goto nope; /* Don't try to run w/ errors */
1396 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1397 if (curop->op_type != OP_CONST &&
1398 curop->op_type != OP_LIST &&
1399 curop->op_type != OP_SCALAR &&
1400 curop->op_type != OP_NULL &&
1401 curop->op_type != OP_PUSHMARK) {
1406 curop = LINKLIST(o);
1411 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1412 pad_swipe(o->op_targ);
1413 else if (SvTEMP(sv)) { /* grab mortal temp? */
1414 (void)SvREFCNT_inc(sv);
1418 if (type == OP_RV2GV)
1419 return newGVOP(OP_GV, 0, (GV*)sv);
1421 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1423 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1428 SvIOK_off(sv); /* undo SvIV() damage */
1430 return newSVOP(OP_CONST, 0, sv);
1434 if (!(opargs[type] & OA_OTHERINT))
1437 if (!(hints & HINT_INTEGER)) {
1438 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1441 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1442 if (curop->op_type == OP_CONST) {
1443 if (SvIOK(((SVOP*)curop)->op_sv))
1447 if (opargs[curop->op_type] & OA_RETINTEGER)
1451 o->op_ppaddr = ppaddr[++(o->op_type)];
1458 gen_constant_list(o)
1462 I32 oldtmps_floor = tmps_floor;
1466 return o; /* Don't attempt to run with errors */
1468 op = curop = LINKLIST(o);
1474 tmps_floor = oldtmps_floor;
1476 o->op_type = OP_RV2AV;
1477 o->op_ppaddr = ppaddr[OP_RV2AV];
1478 curop = ((UNOP*)o)->op_first;
1479 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1486 convert(type, flags, op)
1494 if (!op || op->op_type != OP_LIST)
1495 op = newLISTOP(OP_LIST, 0, op, Nullop);
1497 op->op_flags &= ~(OPf_KNOW|OPf_LIST);
1499 if (!(opargs[type] & OA_MARK))
1500 null(cLISTOP->op_first);
1503 op->op_ppaddr = ppaddr[type];
1504 op->op_flags |= flags;
1506 op = CHECKOP(type, op);
1507 if (op->op_type != type)
1510 if (cLISTOP->op_children < 7) {
1511 /* XXX do we really need to do this if we're done appending?? */
1512 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1514 cLISTOP->op_last = last; /* in case check substituted last arg */
1517 return fold_constants(op);
1520 /* List constructors */
1523 append_elem(type, first, last)
1534 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1535 return newLISTOP(type, 0, first, last);
1537 if (first->op_flags & OPf_KIDS)
1538 ((LISTOP*)first)->op_last->op_sibling = last;
1540 first->op_flags |= OPf_KIDS;
1541 ((LISTOP*)first)->op_first = last;
1543 ((LISTOP*)first)->op_last = last;
1544 ((LISTOP*)first)->op_children++;
1549 append_list(type, first, last)
1560 if (first->op_type != type)
1561 return prepend_elem(type, (OP*)first, (OP*)last);
1563 if (last->op_type != type)
1564 return append_elem(type, (OP*)first, (OP*)last);
1566 first->op_last->op_sibling = last->op_first;
1567 first->op_last = last->op_last;
1568 first->op_children += last->op_children;
1569 if (first->op_children)
1570 last->op_flags |= OPf_KIDS;
1577 prepend_elem(type, first, last)
1588 if (last->op_type == type) {
1589 if (type == OP_LIST) { /* already a PUSHMARK there */
1590 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1591 ((LISTOP*)last)->op_first->op_sibling = first;
1594 if (!(last->op_flags & OPf_KIDS)) {
1595 ((LISTOP*)last)->op_last = first;
1596 last->op_flags |= OPf_KIDS;
1598 first->op_sibling = ((LISTOP*)last)->op_first;
1599 ((LISTOP*)last)->op_first = first;
1601 ((LISTOP*)last)->op_children++;
1605 return newLISTOP(type, 0, first, last);
1613 return newOP(OP_STUB, 0);
1620 if (!op || op->op_type != OP_LIST)
1621 op = newLISTOP(OP_LIST, 0, op, Nullop);
1627 newLISTOP(type, flags, first, last)
1635 Newz(1101, listop, 1, LISTOP);
1637 listop->op_type = type;
1638 listop->op_ppaddr = ppaddr[type];
1639 listop->op_children = (first != 0) + (last != 0);
1640 listop->op_flags = flags;
1644 else if (!first && last)
1647 first->op_sibling = last;
1648 listop->op_first = first;
1649 listop->op_last = last;
1650 if (type == OP_LIST) {
1652 pushop = newOP(OP_PUSHMARK, 0);
1653 pushop->op_sibling = first;
1654 listop->op_first = pushop;
1655 listop->op_flags |= OPf_KIDS;
1657 listop->op_last = pushop;
1659 else if (listop->op_children)
1660 listop->op_flags |= OPf_KIDS;
1671 Newz(1101, op, 1, OP);
1673 op->op_ppaddr = ppaddr[type];
1674 op->op_flags = flags;
1677 op->op_private = 0 + (flags >> 8);
1678 if (opargs[type] & OA_RETSCALAR)
1680 if (opargs[type] & OA_TARGET)
1681 op->op_targ = pad_alloc(type, SVs_PADTMP);
1682 return CHECKOP(type, op);
1686 newUNOP(type, flags, first)
1694 first = newOP(OP_STUB, 0);
1695 if (opargs[type] & OA_MARK)
1696 first = force_list(first);
1698 Newz(1101, unop, 1, UNOP);
1699 unop->op_type = type;
1700 unop->op_ppaddr = ppaddr[type];
1701 unop->op_first = first;
1702 unop->op_flags = flags | OPf_KIDS;
1703 unop->op_private = 1 | (flags >> 8);
1705 unop = (UNOP*) CHECKOP(type, unop);
1709 return fold_constants((OP *) unop);
1713 newBINOP(type, flags, first, last)
1720 Newz(1101, binop, 1, BINOP);
1723 first = newOP(OP_NULL, 0);
1725 binop->op_type = type;
1726 binop->op_ppaddr = ppaddr[type];
1727 binop->op_first = first;
1728 binop->op_flags = flags | OPf_KIDS;
1731 binop->op_private = 1 | (flags >> 8);
1734 binop->op_private = 2 | (flags >> 8);
1735 first->op_sibling = last;
1738 binop = (BINOP*)CHECKOP(type, binop);
1742 binop->op_last = last = binop->op_first->op_sibling;
1744 return fold_constants((OP *)binop);
1748 pmtrans(op, expr, repl)
1753 SV *tstr = ((SVOP*)expr)->op_sv;
1754 SV *rstr = ((SVOP*)repl)->op_sv;
1757 register U8 *t = (U8*)SvPV(tstr, tlen);
1758 register U8 *r = (U8*)SvPV(rstr, rlen);
1763 register short *tbl;
1765 tbl = (short*)cPVOP->op_pv;
1766 complement = op->op_private & OPpTRANS_COMPLEMENT;
1767 delete = op->op_private & OPpTRANS_DELETE;
1768 /* squash = op->op_private & OPpTRANS_SQUASH; */
1771 Zero(tbl, 256, short);
1772 for (i = 0; i < tlen; i++)
1774 for (i = 0, j = 0; i < 256; i++) {
1790 if (!rlen && !delete) {
1793 for (i = 0; i < 256; i++)
1795 for (i = 0, j = 0; i < tlen; i++,j++) {
1798 if (tbl[t[i]] == -1)
1804 if (tbl[t[i]] == -1)
1815 newPMOP(type, flags)
1821 Newz(1101, pmop, 1, PMOP);
1822 pmop->op_type = type;
1823 pmop->op_ppaddr = ppaddr[type];
1824 pmop->op_flags = flags;
1825 pmop->op_private = 0 | (flags >> 8);
1827 /* link into pm list */
1828 if (type != OP_TRANS && curstash) {
1829 pmop->op_pmnext = HvPMROOT(curstash);
1830 HvPMROOT(curstash) = pmop;
1837 pmruntime(op, expr, repl)
1845 if (op->op_type == OP_TRANS)
1846 return pmtrans(op, expr, repl);
1850 if (expr->op_type == OP_CONST) {
1852 SV *pat = ((SVOP*)expr)->op_sv;
1853 char *p = SvPV(pat, plen);
1854 if ((op->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
1855 sv_setpvn(pat, "\\s+", 3);
1856 p = SvPV(pat, plen);
1857 pm->op_pmflags |= PMf_SKIPWHITE;
1859 pm->op_pmregexp = pregcomp(p, p + plen, pm);
1860 if (strEQ("\\s+", pm->op_pmregexp->precomp))
1861 pm->op_pmflags |= PMf_WHITE;
1866 if (pm->op_pmflags & PMf_KEEP)
1867 expr = newUNOP(OP_REGCMAYBE,0,expr);
1869 Newz(1101, rcop, 1, LOGOP);
1870 rcop->op_type = OP_REGCOMP;
1871 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
1872 rcop->op_first = scalar(expr);
1873 rcop->op_flags |= OPf_KIDS;
1874 rcop->op_private = 1;
1875 rcop->op_other = op;
1877 /* establish postfix order */
1878 if (pm->op_pmflags & PMf_KEEP) {
1880 rcop->op_next = expr;
1881 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
1884 rcop->op_next = LINKLIST(expr);
1885 expr->op_next = (OP*)rcop;
1888 prepend_elem(op->op_type, scalar((OP*)rcop), op);
1893 if (pm->op_pmflags & PMf_EVAL)
1895 else if (repl->op_type == OP_CONST)
1899 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
1900 if (opargs[curop->op_type] & OA_DANGEROUS) {
1901 if (curop->op_type == OP_GV) {
1902 GV *gv = ((GVOP*)curop)->op_gv;
1903 if (strchr("&`'123456789+", *GvENAME(gv)))
1906 else if (curop->op_type == OP_RV2CV)
1908 else if (curop->op_type == OP_RV2SV ||
1909 curop->op_type == OP_RV2AV ||
1910 curop->op_type == OP_RV2HV ||
1911 curop->op_type == OP_RV2GV) {
1912 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
1915 else if (curop->op_type == OP_PADSV ||
1916 curop->op_type == OP_PADAV ||
1917 curop->op_type == OP_PADHV ||
1918 curop->op_type == OP_PADANY) {
1927 if (curop == repl) {
1928 pm->op_pmflags |= PMf_CONST; /* const for long enough */
1929 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
1930 prepend_elem(op->op_type, scalar(repl), op);
1933 Newz(1101, rcop, 1, LOGOP);
1934 rcop->op_type = OP_SUBSTCONT;
1935 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
1936 rcop->op_first = scalar(repl);
1937 rcop->op_flags |= OPf_KIDS;
1938 rcop->op_private = 1;
1939 rcop->op_other = op;
1941 /* establish postfix order */
1942 rcop->op_next = LINKLIST(repl);
1943 repl->op_next = (OP*)rcop;
1945 pm->op_pmreplroot = scalar((OP*)rcop);
1946 pm->op_pmreplstart = LINKLIST(rcop);
1955 newSVOP(type, flags, sv)
1961 Newz(1101, svop, 1, SVOP);
1962 svop->op_type = type;
1963 svop->op_ppaddr = ppaddr[type];
1965 svop->op_next = (OP*)svop;
1966 svop->op_flags = flags;
1967 if (opargs[type] & OA_RETSCALAR)
1969 if (opargs[type] & OA_TARGET)
1970 svop->op_targ = pad_alloc(type, SVs_PADTMP);
1971 return CHECKOP(type, svop);
1975 newGVOP(type, flags, gv)
1981 Newz(1101, gvop, 1, GVOP);
1982 gvop->op_type = type;
1983 gvop->op_ppaddr = ppaddr[type];
1984 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
1985 gvop->op_next = (OP*)gvop;
1986 gvop->op_flags = flags;
1987 if (opargs[type] & OA_RETSCALAR)
1989 if (opargs[type] & OA_TARGET)
1990 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
1991 return CHECKOP(type, gvop);
1995 newPVOP(type, flags, pv)
2001 Newz(1101, pvop, 1, PVOP);
2002 pvop->op_type = type;
2003 pvop->op_ppaddr = ppaddr[type];
2005 pvop->op_next = (OP*)pvop;
2006 pvop->op_flags = flags;
2007 if (opargs[type] & OA_RETSCALAR)
2009 if (opargs[type] & OA_TARGET)
2010 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2011 return CHECKOP(type, pvop);
2020 save_hptr(&curstash);
2021 save_item(curstname);
2026 name = SvPV(sv, len);
2027 curstash = gv_stashpvn(name,len,TRUE);
2028 sv_setpvn(curstname, name, len);
2032 sv_setpv(curstname,"<none>");
2040 utilize(aver, floor, version, id, arg)
2053 if (id->op_type != OP_CONST)
2054 croak("Module name must be constant");
2058 if(version != Nullop) {
2059 SV *vesv = ((SVOP*)version)->op_sv;
2061 if (arg == Nullop && !SvNIOK(vesv)) {
2068 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2069 croak("Version number must be constant number");
2071 /* Make copy of id so we don't free it twice */
2072 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2074 /* Fake up a method call to VERSION */
2075 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2076 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2077 append_elem(OP_LIST,
2078 prepend_elem(OP_LIST, pack, list(version)),
2079 newUNOP(OP_METHOD, 0, meth)));
2083 /* Fake up an import/unimport */
2084 if (arg && arg->op_type == OP_STUB)
2085 imop = arg; /* no import on explicit () */
2086 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2087 imop = Nullop; /* use 5.0; */
2090 /* Make copy of id so we don't free it twice */
2091 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2092 meth = newSVOP(OP_CONST, 0,
2094 ? newSVpv("import", 6)
2095 : newSVpv("unimport", 8)
2097 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2098 append_elem(OP_LIST,
2099 prepend_elem(OP_LIST, pack, list(arg)),
2100 newUNOP(OP_METHOD, 0, meth)));
2103 /* Fake up a require */
2104 rqop = newUNOP(OP_REQUIRE, 0, id);
2106 /* Fake up the BEGIN {}, which does its thing immediately. */
2108 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2110 append_elem(OP_LINESEQ,
2111 append_elem(OP_LINESEQ,
2112 newSTATEOP(0, Nullch, rqop),
2113 newSTATEOP(0, Nullch, veop)),
2114 newSTATEOP(0, Nullch, imop) ));
2121 newSLICEOP(flags, subscript, listval)
2126 return newBINOP(OP_LSLICE, flags,
2127 list(force_list(subscript)),
2128 list(force_list(listval)) );
2138 if (op->op_type == OP_NULL && op->op_flags & OPf_KIDS)
2139 op = cUNOP->op_first;
2141 if (op->op_type == OP_COND_EXPR) {
2142 I32 t = list_assignment(cCONDOP->op_first->op_sibling);
2143 I32 f = list_assignment(cCONDOP->op_first->op_sibling->op_sibling);
2148 yyerror("Assignment to both a list and a scalar");
2152 if (op->op_type == OP_LIST || op->op_flags & OPf_PARENS ||
2153 op->op_type == OP_RV2AV || op->op_type == OP_RV2HV ||
2154 op->op_type == OP_ASLICE || op->op_type == OP_HSLICE)
2157 if (op->op_type == OP_PADAV || op->op_type == OP_PADHV)
2160 if (op->op_type == OP_RV2SV)
2167 newASSIGNOP(flags, left, optype, right)
2176 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2177 return newLOGOP(optype, 0,
2178 mod(scalar(left), optype),
2179 newUNOP(OP_SASSIGN, 0, scalar(right)));
2182 return newBINOP(optype, OPf_STACKED,
2183 mod(scalar(left), optype), scalar(right));
2187 if (list_assignment(left)) {
2189 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2190 left = mod(left, OP_AASSIGN);
2198 op = newBINOP(OP_AASSIGN, flags,
2199 list(force_list(right)),
2200 list(force_list(left)) );
2201 op->op_private = 0 | (flags >> 8);
2202 if (!(left->op_private & OPpLVAL_INTRO)) {
2203 static int generation = 100;
2207 for (curop = LINKLIST(op); curop != op; curop = LINKLIST(curop)) {
2208 if (opargs[curop->op_type] & OA_DANGEROUS) {
2209 if (curop->op_type == OP_GV) {
2210 GV *gv = ((GVOP*)curop)->op_gv;
2211 if (gv == defgv || SvCUR(gv) == generation)
2213 SvCUR(gv) = generation;
2215 else if (curop->op_type == OP_PADSV ||
2216 curop->op_type == OP_PADAV ||
2217 curop->op_type == OP_PADHV ||
2218 curop->op_type == OP_PADANY) {
2219 SV **svp = AvARRAY(comppad_name);
2220 SV *sv = svp[curop->op_targ];
2221 if (SvCUR(sv) == generation)
2223 SvCUR(sv) = generation; /* (SvCUR not used any more) */
2225 else if (curop->op_type == OP_RV2CV)
2227 else if (curop->op_type == OP_RV2SV ||
2228 curop->op_type == OP_RV2AV ||
2229 curop->op_type == OP_RV2HV ||
2230 curop->op_type == OP_RV2GV) {
2231 if (lastop->op_type != OP_GV) /* funny deref? */
2240 op->op_private = OPpASSIGN_COMMON;
2242 if (right && right->op_type == OP_SPLIT) {
2244 if ((tmpop = ((LISTOP*)right)->op_first) &&
2245 tmpop->op_type == OP_PUSHRE)
2247 PMOP *pm = (PMOP*)tmpop;
2248 if (left->op_type == OP_RV2AV &&
2249 !(left->op_private & OPpLVAL_INTRO) &&
2250 !(op->op_private & OPpASSIGN_COMMON) )
2252 tmpop = ((UNOP*)left)->op_first;
2253 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2254 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2255 pm->op_pmflags |= PMf_ONCE;
2256 tmpop = ((UNOP*)op)->op_first; /* to list (nulled) */
2257 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2258 tmpop->op_sibling = Nullop; /* don't free split */
2259 right->op_next = tmpop->op_next; /* fix starting loc */
2260 op_free(op); /* blow off assign */
2261 right->op_flags &= ~(OPf_KNOW|OPf_LIST);
2262 /* "I don't know and I don't care." */
2267 if (modcount < 10000 &&
2268 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2270 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2272 sv_setiv(sv, modcount+1);
2280 right = newOP(OP_UNDEF, 0);
2281 if (right->op_type == OP_READLINE) {
2282 right->op_flags |= OPf_STACKED;
2283 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2286 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2287 op = newBINOP(OP_SASSIGN, flags,
2288 scalar(right), mod(scalar(left), OP_SASSIGN) );
2300 newSTATEOP(flags, label, op)
2307 /* Introduce my variables. */
2308 if (min_intro_pending) {
2309 SV **svp = AvARRAY(comppad_name);
2312 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2313 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2314 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2315 SvNVX(sv) = (double)cop_seqmax;
2318 min_intro_pending = 0;
2319 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2322 Newz(1101, cop, 1, COP);
2323 if (perldb && curcop->cop_line && curstash != debstash) {
2324 cop->op_type = OP_DBSTATE;
2325 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2328 cop->op_type = OP_NEXTSTATE;
2329 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2331 cop->op_flags = flags;
2332 cop->op_private = 0 | (flags >> 8);
2333 cop->op_next = (OP*)cop;
2336 cop->cop_label = label;
2337 hints |= HINT_BLOCK_SCOPE;
2339 cop->cop_seq = cop_seqmax++;
2340 cop->cop_arybase = curcop->cop_arybase;
2342 if (copline == NOLINE)
2343 cop->cop_line = curcop->cop_line;
2345 cop->cop_line = copline;
2348 cop->cop_filegv = GvREFCNT_inc(curcop->cop_filegv);
2349 cop->cop_stash = curstash;
2351 if (perldb && curstash != debstash) {
2352 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2353 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2354 (void)SvIOK_on(*svp);
2356 SvSTASH(*svp) = (HV*)cop;
2360 return prepend_elem(OP_LINESEQ, (OP*)cop, op);
2364 newLOGOP(type, flags, first, other)
2373 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2374 return newBINOP(type, flags, scalar(first), scalar(other));
2376 scalarboolean(first);
2377 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2378 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2379 if (type == OP_AND || type == OP_OR) {
2385 first = cUNOP->op_first;
2387 first->op_next = op->op_next;
2388 cUNOP->op_first = Nullop;
2392 if (first->op_type == OP_CONST) {
2393 if (dowarn && (first->op_private & OPpCONST_BARE))
2394 warn("Probable precedence problem on %s", op_desc[type]);
2395 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2404 else if (first->op_type == OP_WANTARRAY) {
2414 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2415 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2417 Newz(1101, logop, 1, LOGOP);
2419 logop->op_type = type;
2420 logop->op_ppaddr = ppaddr[type];
2421 logop->op_first = first;
2422 logop->op_flags = flags | OPf_KIDS;
2423 logop->op_other = LINKLIST(other);
2424 logop->op_private = 1 | (flags >> 8);
2426 /* establish postfix order */
2427 logop->op_next = LINKLIST(first);
2428 first->op_next = (OP*)logop;
2429 first->op_sibling = other;
2431 op = newUNOP(OP_NULL, 0, (OP*)logop);
2432 other->op_next = op;
2438 newCONDOP(flags, first, trueop, falseop)
2448 return newLOGOP(OP_AND, 0, first, trueop);
2450 return newLOGOP(OP_OR, 0, first, falseop);
2452 scalarboolean(first);
2453 if (first->op_type == OP_CONST) {
2454 if (SvTRUE(((SVOP*)first)->op_sv)) {
2465 else if (first->op_type == OP_WANTARRAY) {
2469 Newz(1101, condop, 1, CONDOP);
2471 condop->op_type = OP_COND_EXPR;
2472 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2473 condop->op_first = first;
2474 condop->op_flags = flags | OPf_KIDS;
2475 condop->op_true = LINKLIST(trueop);
2476 condop->op_false = LINKLIST(falseop);
2477 condop->op_private = 1 | (flags >> 8);
2479 /* establish postfix order */
2480 condop->op_next = LINKLIST(first);
2481 first->op_next = (OP*)condop;
2483 first->op_sibling = trueop;
2484 trueop->op_sibling = falseop;
2485 op = newUNOP(OP_NULL, 0, (OP*)condop);
2487 trueop->op_next = op;
2488 falseop->op_next = op;
2494 newRANGE(flags, left, right)
2504 Newz(1101, condop, 1, CONDOP);
2506 condop->op_type = OP_RANGE;
2507 condop->op_ppaddr = ppaddr[OP_RANGE];
2508 condop->op_first = left;
2509 condop->op_flags = OPf_KIDS;
2510 condop->op_true = LINKLIST(left);
2511 condop->op_false = LINKLIST(right);
2512 condop->op_private = 1 | (flags >> 8);
2514 left->op_sibling = right;
2516 condop->op_next = (OP*)condop;
2517 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2518 flop = newUNOP(OP_FLOP, 0, flip);
2519 op = newUNOP(OP_NULL, 0, flop);
2522 left->op_next = flip;
2523 right->op_next = flop;
2525 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2526 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2527 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2528 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2530 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2531 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2534 if (!flip->op_private || !flop->op_private)
2535 linklist(op); /* blow off optimizer unless constant */
2541 newLOOPOP(flags, debuggable, expr, block)
2549 int once = block && block->op_flags & OPf_SPECIAL &&
2550 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2553 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2554 return block; /* do {} while 0 does once */
2555 else if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB)
2556 expr = newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr);
2559 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2560 op = newLOGOP(OP_AND, 0, expr, listop);
2562 ((LISTOP*)listop)->op_last->op_next = LINKLIST(op);
2564 if (once && op != listop)
2565 op->op_next = ((LOGOP*)cUNOP->op_first)->op_other;
2568 op = newUNOP(OP_NULL, 0, op); /* or do {} while 1 loses outer block */
2570 op->op_flags |= flags;
2572 op->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2577 newWHILEOP(flags, debuggable, loop, expr, block, cont)
2591 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB)) {
2592 expr = newUNOP(OP_DEFINED, 0,
2593 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2597 block = newOP(OP_NULL, 0);
2600 next = LINKLIST(cont);
2602 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2604 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2605 redo = LINKLIST(listop);
2608 op = newLOGOP(OP_AND, 0, expr, scalar(listop));
2609 if (op == expr && op->op_type == OP_CONST && !SvTRUE(cSVOP->op_sv)) {
2610 op_free(expr); /* oops, it's a while (0) */
2612 return Nullop; /* (listop already freed by newLOGOP) */
2614 ((LISTOP*)listop)->op_last->op_next = condop =
2615 (op == listop ? redo : LINKLIST(op));
2623 Newz(1101,loop,1,LOOP);
2624 loop->op_type = OP_ENTERLOOP;
2625 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2626 loop->op_private = 0;
2627 loop->op_next = (OP*)loop;
2630 op = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, op);
2632 loop->op_redoop = redo;
2633 loop->op_lastop = op;
2636 loop->op_nextop = next;
2638 loop->op_nextop = op;
2640 op->op_flags |= flags;
2641 op->op_private |= (flags >> 8);
2646 #ifndef CAN_PROTOTYPE
2647 newFOROP(flags,label,forline,sv,expr,block,cont)
2656 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2657 #endif /* CAN_PROTOTYPE */
2665 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2666 sv->op_type = OP_RV2GV;
2667 sv->op_ppaddr = ppaddr[OP_RV2GV];
2669 else if (sv->op_type == OP_PADSV) { /* private variable */
2670 padoff = sv->op_targ;
2675 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2678 sv = newGVOP(OP_GV, 0, defgv);
2680 if (expr->op_type == OP_RV2AV) {
2681 expr = scalar(ref(expr, OP_ITER));
2682 iterflags |= OPf_STACKED;
2684 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2685 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2687 assert(!loop->op_next);
2688 Renew(loop, 1, LOOP);
2689 loop->op_targ = padoff;
2690 return newSTATEOP(0, label, newWHILEOP(flags, 1, loop,
2691 newOP(OP_ITER, 0), block, cont));
2695 newLOOPEX(type, label)
2700 if (type != OP_GOTO || label->op_type == OP_CONST) {
2701 op = newPVOP(type, 0, savepv(
2702 label->op_type == OP_CONST
2703 ? SvPVx(((SVOP*)label)->op_sv, na)
2708 if (label->op_type == OP_ENTERSUB)
2709 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2710 op = newUNOP(type, OPf_STACKED, label);
2712 hints |= HINT_BLOCK_SCOPE;
2720 if (!CvXSUB(cv) && CvROOT(cv)) {
2722 croak("Can't undef active subroutine");
2729 op_free(CvROOT(cv));
2730 CvROOT(cv) = Nullop;
2733 SvREFCNT_dec(CvGV(cv));
2735 SvREFCNT_dec(CvOUTSIDE(cv));
2736 CvOUTSIDE(cv) = Nullcv;
2737 if (CvPADLIST(cv)) {
2738 I32 i = AvFILL(CvPADLIST(cv));
2740 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
2744 SvREFCNT_dec((SV*)CvPADLIST(cv));
2745 CvPADLIST(cv) = Nullav;
2755 AV* protopadlist = CvPADLIST(proto);
2756 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
2757 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
2758 SV** svp = AvARRAY(protopad);
2767 cv = compcv = (CV*)NEWSV(1104,0);
2768 sv_upgrade((SV *)cv, SVt_PVCV);
2771 CvFILEGV(cv) = CvFILEGV(proto);
2772 CvGV(cv) = GvREFCNT_inc(CvGV(proto));
2773 CvSTASH(cv) = CvSTASH(proto);
2774 CvROOT(cv) = CvROOT(proto);
2775 CvSTART(cv) = CvSTART(proto);
2776 if (CvOUTSIDE(proto))
2777 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc((SV*)CvOUTSIDE(proto));
2781 comppadlist = newAV();
2782 AvREAL_off(comppadlist);
2783 av_store(comppadlist, 0, SvREFCNT_inc((SV*)protopad_name));
2784 av_store(comppadlist, 1, (SV*)comppad);
2785 CvPADLIST(cv) = comppadlist;
2786 av_extend(comppad, AvFILL(protopad));
2787 curpad = AvARRAY(comppad);
2789 av = newAV(); /* will be @_ */
2791 av_store(comppad, 0, (SV*)av);
2792 AvFLAGS(av) = AVf_REIFY;
2794 svp = AvARRAY(protopad_name);
2795 for ( ix = AvFILL(protopad); ix > 0; ix--) {
2797 if (svp[ix] != &sv_undef) {
2798 char *name = SvPVX(svp[ix]); /* XXX */
2799 if (SvFLAGS(svp[ix]) & SVf_FAKE) { /* lexical from outside? */
2800 I32 off = pad_findlex(name,ix,curcop->cop_seq, CvOUTSIDE(proto),
2803 croak("panic: cv_clone: %s", name);
2805 else { /* our own lexical */
2807 av_store(comppad, ix, sv = (SV*)newAV());
2808 else if (*name == '%')
2809 av_store(comppad, ix, sv = (SV*)newHV());
2811 av_store(comppad, ix, sv = NEWSV(0,0));
2816 av_store(comppad, ix, sv = NEWSV(0,0));
2832 if(cv && SvPOK(cv) && !SvCUR(cv)) {
2833 for (o = CvSTART(cv); o; o = o->op_next) {
2834 OPCODE type = o->op_type;
2836 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
2838 if (type == OP_LEAVESUB || type == OP_RETURN)
2840 if (type != OP_CONST || sv)
2843 sv = ((SVOP*)o)->op_sv;
2850 newSUB(floor,op,proto,block)
2857 char *name = op ? SvPVx(cSVOP->op_sv, na) : "__ANON__";
2858 GV* gv = gv_fetchpv(name, GV_ADDMULTI, SVt_PVCV);
2865 if (cv = GvCV(gv)) {
2867 cv = 0; /* just a cached method */
2868 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
2869 SV* const_sv = cv_const_sv(cv);
2871 char *p = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch;
2873 if((!proto != !SvPOK(cv)) || (p && strNE(SvPV((SV*)cv,na), p))) {
2874 warn("Prototype mismatch: (%s) vs (%s)",
2875 SvPOK(cv) ? SvPV((SV*)cv,na) : "none",
2879 if ((const_sv || dowarn) && strNE(name, "BEGIN")) {/* already defined (or promised)? */
2880 line_t oldline = curcop->cop_line;
2882 curcop->cop_line = copline;
2883 warn(const_sv ? "Constant subroutine %s redefined"
2884 : "Subroutine %s redefined",name);
2885 curcop->cop_line = oldline;
2891 if (cv) { /* must reuse cv if autoloaded */
2893 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
2894 CvOUTSIDE(compcv) = 0;
2895 CvPADLIST(cv) = CvPADLIST(compcv);
2896 CvPADLIST(compcv) = 0;
2897 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
2898 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
2899 SvREFCNT_dec(compcv);
2906 CvFILEGV(cv) = curcop->cop_filegv;
2907 CvGV(cv) = GvREFCNT_inc(gv);
2908 CvSTASH(cv) = curstash;
2911 char *p = SvPVx(((SVOP*)proto)->op_sv, na);
2912 sv_setpv((SV*)cv, p);
2928 av = newAV(); /* Will be @_ */
2930 av_store(comppad, 0, (SV*)av);
2931 AvFLAGS(av) = AVf_REIFY;
2933 for (ix = AvFILL(comppad); ix > 0; ix--) {
2934 if (!SvPADMY(curpad[ix]))
2935 SvPADTMP_on(curpad[ix]);
2938 if (AvFILL(comppad_name) < AvFILL(comppad))
2939 av_store(comppad_name, AvFILL(comppad), Nullsv);
2941 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
2942 CvSTART(cv) = LINKLIST(CvROOT(cv));
2943 CvROOT(cv)->op_next = 0;
2945 if (s = strrchr(name,':'))
2949 if (strEQ(s, "BEGIN") && !error_count) {
2950 line_t oldline = compiling.cop_line;
2954 SAVESPTR(compiling.cop_filegv);
2958 av_push(beginav, (SV *)cv);
2959 DEBUG_x( dump_sub(gv) );
2960 rs = SvREFCNT_inc(nrs);
2963 if (GvCV(gv) == cv) { /* Detach it. */
2965 GvCV(gv) = 0; /* Was above calllist, why? IZ */
2969 curcop = &compiling;
2970 curcop->cop_line = oldline; /* might have recursed to yylex */
2973 else if (strEQ(s, "END") && !error_count) {
2976 av_unshift(endav, 1);
2977 av_store(endav, 0, SvREFCNT_inc(cv));
2979 if (perldb && curstash != debstash) {
2981 SV *tmpstr = sv_newmortal();
2982 static GV *db_postponed;
2986 sprintf(buf,"%s:%ld",SvPVX(GvSV(curcop->cop_filegv)), (long)subline);
2987 sv = newSVpv(buf,0);
2989 sprintf(buf,"%ld",(long)curcop->cop_line);
2991 gv_efullname3(tmpstr, gv, Nullch);
2992 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
2993 if (!db_postponed) {
2994 db_postponed = gv_fetchpv("DB::postponed", TRUE, SVt_PVHV);
2996 hv = GvHVn(db_postponed);
2997 if (HvFILL(hv) >= 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
2998 && (cv = GvCV(db_postponed))) {
3003 perl_call_sv((SV*)cv, G_DISCARD);
3010 GvCV(gv) = 0; /* Will remember in SVOP instead. */
3018 newXSUB(name, ix, subaddr, filename)
3024 CV* cv = newXS(name, (void(*)())subaddr, filename);
3026 CvXSUBANY(cv).any_i32 = ix;
3032 newXS(name, subaddr, filename)
3034 void (*subaddr) _((CV*));
3038 GV *gv = gv_fetchpv((name ? name : "__ANON__"), GV_ADDMULTI, SVt_PVCV);
3043 if (cv = GvCV(gv)) {
3045 cv = 0; /* just a cached method */
3046 else if (CvROOT(cv) || CvXSUB(cv)) { /* already defined? */
3048 line_t oldline = curcop->cop_line;
3050 curcop->cop_line = copline;
3051 warn("Subroutine %s redefined",name);
3052 curcop->cop_line = oldline;
3058 if (cv) { /* must reuse cv if autoloaded */
3059 assert(SvREFCNT(CvGV(cv)) > 1);
3060 SvREFCNT_dec(CvGV(cv));
3063 cv = (CV*)NEWSV(1105,0);
3064 sv_upgrade((SV *)cv, SVt_PVCV);
3067 CvGV(cv) = GvREFCNT_inc(gv);
3069 CvFILEGV(cv) = gv_fetchfile(filename);
3070 CvXSUB(cv) = subaddr;
3073 else if (s = strrchr(name,':'))
3077 if (strEQ(s, "BEGIN")) {
3080 av_push(beginav, SvREFCNT_inc(gv));
3082 else if (strEQ(s, "END")) {
3085 av_unshift(endav, 1);
3086 av_store(endav, 0, SvREFCNT_inc(gv));
3089 GvCV(gv) = 0; /* Will remember elsewhere instead. */
3096 newFORM(floor,op,block)
3107 name = SvPVx(cSVOP->op_sv, na);
3110 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3112 if (cv = GvFORM(gv)) {
3114 line_t oldline = curcop->cop_line;
3116 curcop->cop_line = copline;
3117 warn("Format %s redefined",name);
3118 curcop->cop_line = oldline;
3124 CvGV(cv) = GvREFCNT_inc(gv);
3125 CvFILEGV(cv) = curcop->cop_filegv;
3127 for (ix = AvFILL(comppad); ix > 0; ix--) {
3128 if (!SvPADMY(curpad[ix]))
3129 SvPADTMP_on(curpad[ix]);
3132 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3133 CvSTART(cv) = LINKLIST(CvROOT(cv));
3134 CvROOT(cv)->op_next = 0;
3146 return newUNOP(OP_REFGEN, 0,
3147 mod(list(convert(OP_ANONLIST, 0, op)), OP_REFGEN));
3154 return newUNOP(OP_REFGEN, 0,
3155 mod(list(convert(OP_ANONHASH, 0, op)), OP_REFGEN));
3159 newANONSUB(floor, proto, block)
3164 return newUNOP(OP_REFGEN, 0,
3165 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3172 switch (o->op_type) {
3174 o->op_type = OP_PADAV;
3175 o->op_ppaddr = ppaddr[OP_PADAV];
3176 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3179 o->op_type = OP_RV2AV;
3180 o->op_ppaddr = ppaddr[OP_RV2AV];
3185 warn("oops: oopsAV");
3195 switch (o->op_type) {
3198 o->op_type = OP_PADHV;
3199 o->op_ppaddr = ppaddr[OP_PADHV];
3200 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3204 o->op_type = OP_RV2HV;
3205 o->op_ppaddr = ppaddr[OP_RV2HV];
3210 warn("oops: oopsHV");
3220 if (o->op_type == OP_PADANY) {
3221 o->op_type = OP_PADAV;
3222 o->op_ppaddr = ppaddr[OP_PADAV];
3225 return newUNOP(OP_RV2AV, 0, scalar(o));
3233 if (type == OP_MAPSTART)
3234 return newUNOP(OP_NULL, 0, o);
3235 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3242 if (o->op_type == OP_PADANY) {
3243 o->op_type = OP_PADHV;
3244 o->op_ppaddr = ppaddr[OP_PADHV];
3247 return newUNOP(OP_RV2HV, 0, scalar(o));
3254 croak("NOT IMPL LINE %d",__LINE__);
3264 return newUNOP(OP_RV2CV, flags, scalar(o));
3271 if (o->op_type == OP_PADANY) {
3272 o->op_type = OP_PADSV;
3273 o->op_ppaddr = ppaddr[OP_PADSV];
3276 return newUNOP(OP_RV2SV, 0, scalar(o));
3279 /* Check routines. */
3285 op->op_private = hints;
3293 if (cUNOP->op_first->op_type == OP_CONCAT)
3294 op->op_flags |= OPf_STACKED;
3302 if (op->op_flags & OPf_KIDS) {
3305 op = modkids(ck_fun(op), op->op_type);
3306 kid = cUNOP->op_first;
3307 newop = kUNOP->op_first->op_sibling;
3309 (newop->op_sibling ||
3310 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3311 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3312 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3316 op_free(kUNOP->op_first);
3317 kUNOP->op_first = newop;
3319 op->op_ppaddr = ppaddr[++op->op_type];
3328 if (op->op_flags & OPf_KIDS) {
3329 OP *kid = cUNOP->op_first;
3330 if (kid->op_type != OP_HELEM)
3331 croak("%s argument is not a HASH element", op_desc[op->op_type]);
3341 I32 type = op->op_type;
3343 if (op->op_flags & OPf_KIDS) {
3344 if (cLISTOP->op_first->op_type == OP_STUB) {
3346 op = newUNOP(type, OPf_SPECIAL,
3347 newGVOP(OP_GV, 0, gv_fetchpv("main'ARGV", TRUE, SVt_PVAV)));
3358 hints |= HINT_BLOCK_SCOPE;
3359 if (op->op_flags & OPf_KIDS) {
3360 SVOP *kid = (SVOP*)cUNOP->op_first;
3363 op->op_flags &= ~OPf_KIDS;
3366 else if (kid->op_type == OP_LINESEQ) {
3369 kid->op_next = op->op_next;
3370 cUNOP->op_first = 0;
3373 Newz(1101, enter, 1, LOGOP);
3374 enter->op_type = OP_ENTERTRY;
3375 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3376 enter->op_private = 0;
3378 /* establish postfix order */
3379 enter->op_next = (OP*)enter;
3381 op = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3382 op->op_type = OP_LEAVETRY;
3383 op->op_ppaddr = ppaddr[OP_LEAVETRY];
3384 enter->op_other = op;
3390 op = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3392 op->op_targ = (PADOFFSET)hints;
3401 if (op->op_flags & OPf_STACKED) {
3403 kid = cUNOP->op_first->op_sibling;
3404 if (kid->op_type == OP_RV2GV)
3416 o = fold_constants(o);
3417 if (o->op_type == OP_CONST)
3426 SVOP *kid = (SVOP*)cUNOP->op_first;
3428 op->op_private |= (hints & HINT_STRICT_REFS);
3429 if (kid->op_type == OP_CONST) {
3430 int iscv = (op->op_type==OP_RV2CV)*2;
3432 kid->op_type = OP_GV;
3433 for (gv = 0; !gv; iscv++) {
3435 * This is a little tricky. We only want to add the symbol if we
3436 * didn't add it in the lexer. Otherwise we get duplicate strict
3437 * warnings. But if we didn't add it in the lexer, we must at
3438 * least pretend like we wanted to add it even if it existed before,
3439 * or we get possible typo warnings. OPpCONST_ENTERED says
3440 * whether the lexer already added THIS instance of this symbol.
3442 gv = gv_fetchpv(SvPVx(kid->op_sv, na),
3443 iscv | !(kid->op_private & OPpCONST_ENTERED),
3446 : op->op_type == OP_RV2SV
3448 : op->op_type == OP_RV2AV
3450 : op->op_type == OP_RV2HV
3454 SvREFCNT_dec(kid->op_sv);
3455 kid->op_sv = SvREFCNT_inc(gv);
3471 I32 type = op->op_type;
3473 if (op->op_flags & OPf_REF)
3476 if (op->op_flags & OPf_KIDS) {
3477 SVOP *kid = (SVOP*)cUNOP->op_first;
3479 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3480 OP *newop = newGVOP(type, OPf_REF,
3481 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
3488 if (type == OP_FTTTY)
3489 return newGVOP(type, OPf_REF, gv_fetchpv("main'STDIN", TRUE,
3492 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3505 int type = op->op_type;
3506 register I32 oa = opargs[type] >> OASHIFT;
3508 if (op->op_flags & OPf_STACKED) {
3509 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
3512 return no_fh_allowed(op);
3515 if (op->op_flags & OPf_KIDS) {
3516 tokid = &cLISTOP->op_first;
3517 kid = cLISTOP->op_first;
3518 if (kid->op_type == OP_PUSHMARK ||
3519 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
3521 tokid = &kid->op_sibling;
3522 kid = kid->op_sibling;
3524 if (!kid && opargs[type] & OA_DEFGV)
3525 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
3529 sibl = kid->op_sibling;
3543 if (kid->op_type == OP_CONST &&
3544 (kid->op_private & OPpCONST_BARE)) {
3545 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
3546 OP *newop = newAVREF(newGVOP(OP_GV, 0,
3547 gv_fetchpv(name, TRUE, SVt_PVAV) ));
3549 warn("Array @%s missing the @ in argument %d of %s()",
3550 name, numargs, op_desc[type]);
3553 kid->op_sibling = sibl;
3556 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
3557 bad_type(numargs, "array", op_desc[op->op_type], kid);
3561 if (kid->op_type == OP_CONST &&
3562 (kid->op_private & OPpCONST_BARE)) {
3563 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
3564 OP *newop = newHVREF(newGVOP(OP_GV, 0,
3565 gv_fetchpv(name, TRUE, SVt_PVHV) ));
3567 warn("Hash %%%s missing the %% in argument %d of %s()",
3568 name, numargs, op_desc[type]);
3571 kid->op_sibling = sibl;
3574 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
3575 bad_type(numargs, "hash", op_desc[op->op_type], kid);
3580 OP *newop = newUNOP(OP_NULL, 0, kid);
3581 kid->op_sibling = 0;
3583 newop->op_next = newop;
3585 kid->op_sibling = sibl;
3590 if (kid->op_type != OP_GV) {
3591 if (kid->op_type == OP_CONST &&
3592 (kid->op_private & OPpCONST_BARE)) {
3593 OP *newop = newGVOP(OP_GV, 0,
3594 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
3600 kid->op_sibling = 0;
3601 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
3603 kid->op_sibling = sibl;
3609 mod(scalar(kid), type);
3613 tokid = &kid->op_sibling;
3614 kid = kid->op_sibling;
3616 op->op_private |= numargs;
3618 return too_many_arguments(op,op_desc[op->op_type]);
3621 else if (opargs[type] & OA_DEFGV) {
3623 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3627 while (oa & OA_OPTIONAL)
3629 if (oa && oa != OA_LIST)
3630 return too_few_arguments(op,op_desc[op->op_type]);
3639 GV *gv = gv_fetchpv("glob", FALSE, SVt_PVCV);
3641 if (gv && GvIMPORTED_CV(gv)) {
3642 op->op_type = OP_LIST;
3643 op->op_ppaddr = ppaddr[OP_LIST];
3644 op = newUNOP(OP_ENTERSUB, OPf_STACKED,
3645 append_elem(OP_LIST, op,
3646 scalar(newUNOP(OP_RV2CV, 0,
3647 newGVOP(OP_GV, 0, gv)))));
3650 gv = newGVgen("main");
3652 append_elem(OP_GLOB, op, newGVOP(OP_GV, 0, gv));
3663 OPCODE type = op->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
3665 op->op_ppaddr = ppaddr[OP_GREPSTART];
3666 Newz(1101, gwop, 1, LOGOP);
3668 if (op->op_flags & OPf_STACKED) {
3671 kid = cLISTOP->op_first->op_sibling;
3672 for (k = cLISTOP->op_first->op_sibling->op_next; k; k = k->op_next) {
3675 kid->op_next = (OP*)gwop;
3676 op->op_flags &= ~OPf_STACKED;
3678 kid = cLISTOP->op_first->op_sibling;
3679 if (type == OP_MAPWHILE)
3686 kid = cLISTOP->op_first->op_sibling;
3687 if (kid->op_type != OP_NULL)
3688 croak("panic: ck_grep");
3689 kid = kUNOP->op_first;
3691 gwop->op_type = type;
3692 gwop->op_ppaddr = ppaddr[type];
3693 gwop->op_first = listkids(op);
3694 gwop->op_flags |= OPf_KIDS;
3695 gwop->op_private = 1;
3696 gwop->op_other = LINKLIST(kid);
3697 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
3698 kid->op_next = (OP*)gwop;
3700 kid = cLISTOP->op_first->op_sibling;
3701 if (!kid || !kid->op_sibling)
3702 return too_few_arguments(op,op_desc[op->op_type]);
3703 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
3704 mod(kid, OP_GREPSTART);
3713 if (op->op_flags & OPf_KIDS) {
3714 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3715 if (kid && kid->op_type == OP_CONST)
3716 fbm_compile(((SVOP*)kid)->op_sv, 0);
3725 /* XXX length optimization goes here */
3733 return modkids(ck_fun(op), op->op_type);
3740 return refkids(ck_fun(op), op->op_type);
3749 kid = cLISTOP->op_first;
3751 op = force_list(op);
3752 kid = cLISTOP->op_first;
3754 if (kid->op_type == OP_PUSHMARK)
3755 kid = kid->op_sibling;
3756 if (kid && op->op_flags & OPf_STACKED)
3757 kid = kid->op_sibling;
3758 else if (kid && !kid->op_sibling) { /* print HANDLE; */
3759 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
3760 op->op_flags |= OPf_STACKED; /* make it a filehandle */
3761 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
3762 cLISTOP->op_first->op_sibling = kid;
3763 cLISTOP->op_last = kid;
3764 kid = kid->op_sibling;
3769 append_elem(op->op_type, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
3771 return listkids(op);
3778 cPMOP->op_pmflags |= PMf_RUNTIME;
3779 cPMOP->op_pmpermflags |= PMf_RUNTIME;
3794 if (cBINOP->op_first->op_flags & OPf_PARENS) {
3795 op->op_private |= OPpREPEAT_DOLIST;
3796 cBINOP->op_first = force_list(cBINOP->op_first);
3807 if (op->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
3808 SVOP *kid = (SVOP*)cUNOP->op_first;
3810 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3812 for (s = SvPVX(kid->op_sv); *s; s++) {
3813 if (*s == ':' && s[1] == ':') {
3815 Move(s+2, s+1, strlen(s+2)+1, char);
3816 --SvCUR(kid->op_sv);
3819 sv_catpvn(kid->op_sv, ".pm", 3);
3829 croak("NOT IMPL LINE %d",__LINE__);
3839 if (op->op_flags & OPf_KIDS) {
3840 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3841 if (kid && kid->op_sibling) {
3842 op->op_type = OP_SSELECT;
3843 op->op_ppaddr = ppaddr[OP_SSELECT];
3845 return fold_constants(op);
3849 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3850 if (kid && kid->op_type == OP_RV2GV)
3851 kid->op_private &= ~HINT_STRICT_REFS;
3859 I32 type = op->op_type;
3861 if (!(op->op_flags & OPf_KIDS)) {
3863 return newUNOP(type, 0,
3864 scalar(newUNOP(OP_RV2AV, 0,
3865 scalar(newGVOP(OP_GV, 0, subline
3867 : gv_fetchpv("ARGV", TRUE, SVt_PVAV) )))));
3869 return scalar(modkids(ck_fun(op), type));
3876 if (op->op_flags & OPf_STACKED) {
3877 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3879 kid = kUNOP->op_first; /* get past rv2gv */
3881 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
3883 if (kid->op_type == OP_SCOPE) {
3887 else if (kid->op_type == OP_LEAVE) {
3888 if (op->op_type == OP_SORT) {
3889 null(kid); /* wipe out leave */
3892 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
3893 if (k->op_next == kid)
3898 kid->op_next = 0; /* just disconnect the leave */
3899 k = kLISTOP->op_first;
3903 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3904 null(kid); /* wipe out rv2gv */
3905 if (op->op_type == OP_SORT)
3909 op->op_flags |= OPf_SPECIAL;
3922 if (op->op_flags & OPf_STACKED)
3923 return no_fh_allowed(op);
3925 kid = cLISTOP->op_first;
3926 if (kid->op_type != OP_NULL)
3927 croak("panic: ck_split");
3928 kid = kid->op_sibling;
3929 op_free(cLISTOP->op_first);
3930 cLISTOP->op_first = kid;
3932 cLISTOP->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
3933 cLISTOP->op_last = kid; /* There was only one element previously */
3936 if (kid->op_type != OP_MATCH) {
3937 OP *sibl = kid->op_sibling;
3938 kid->op_sibling = 0;
3939 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
3940 if (cLISTOP->op_first == cLISTOP->op_last)
3941 cLISTOP->op_last = kid;
3942 cLISTOP->op_first = kid;
3943 kid->op_sibling = sibl;
3946 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
3947 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
3951 kid->op_type = OP_PUSHRE;
3952 kid->op_ppaddr = ppaddr[OP_PUSHRE];
3955 if (!kid->op_sibling)
3956 append_elem(OP_SPLIT, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
3958 kid = kid->op_sibling;
3961 if (!kid->op_sibling)
3962 append_elem(OP_SPLIT, op, newSVOP(OP_CONST, 0, newSViv(0)));
3964 kid = kid->op_sibling;
3967 if (kid->op_sibling)
3968 return too_many_arguments(op,op_desc[op->op_type]);
3977 OP *prev = ((cUNOP->op_first->op_sibling)
3978 ? cUNOP : ((UNOP*)cUNOP->op_first))->op_first;
3979 OP *o = prev->op_sibling;
3986 for (cvop = o; cvop->op_sibling; cvop = cvop->op_sibling) ;
3987 if (cvop->op_type == OP_RV2CV) {
3989 op->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
3990 null(cvop); /* disable rv2cv */
3991 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
3992 if (tmpop->op_type == OP_GV) {
3993 cv = GvCV(tmpop->op_sv);
3994 if (cv && SvPOK(cv) && !(op->op_private & OPpENTERSUB_AMPER))
3995 proto = SvPV((SV*)cv,na);
3998 op->op_private |= (hints & HINT_STRICT_REFS);
3999 if (perldb && curstash != debstash)
4000 op->op_private |= OPpENTERSUB_DB;
4005 return too_many_arguments(op, CvNAME(cv));
4023 if (o->op_type != OP_REFGEN && o->op_type != OP_UNDEF)
4024 bad_type(arg, "block", CvNAME(cv), o);
4029 if (o->op_type == OP_RV2GV)
4033 o = newUNOP(OP_RV2GV, 0, kid);
4034 o->op_sibling = kid->op_sibling;
4035 kid->op_sibling = 0;
4036 prev->op_sibling = o;
4044 if (o->op_type != OP_RV2GV)
4045 bad_type(arg, "symbol", CvNAME(cv), o);
4048 if (o->op_type != OP_RV2CV)
4049 bad_type(arg, "sub", CvNAME(cv), o);
4052 if (o->op_type != OP_RV2SV && o->op_type != OP_PADSV)
4053 bad_type(arg, "scalar", CvNAME(cv), o);
4056 if (o->op_type != OP_RV2AV && o->op_type != OP_PADAV)
4057 bad_type(arg, "array", CvNAME(cv), o);
4060 if (o->op_type != OP_RV2HV && o->op_type != OP_PADHV)
4061 bad_type(arg, "hash", CvNAME(cv), o);
4065 o = newUNOP(OP_REFGEN, 0, kid);
4066 o->op_sibling = kid->op_sibling;
4067 kid->op_sibling = 0;
4068 prev->op_sibling = o;
4079 croak("Malformed prototype for %s: %s",
4080 CvNAME(cv),SvPV((SV*)cv,na));
4085 mod(o, OP_ENTERSUB);
4089 if (proto && !optional && *proto == '$')
4090 return too_few_arguments(op, CvNAME(cv));
4098 SvREADONLY_on(cSVOP->op_sv);
4106 if (op->op_flags & OPf_KIDS) {
4107 SVOP *kid = (SVOP*)cUNOP->op_first;
4109 if (kid->op_type == OP_NULL)
4110 kid = (SVOP*)kid->op_sibling;
4112 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4113 op->op_flags |= OPf_SPECIAL;
4118 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4124 register OP* oldop = 0;
4125 if (!o || o->op_seq)
4130 for (; o; o = o->op_next) {
4136 switch (o->op_type) {
4139 curcop = ((COP*)o); /* for warnings */
4140 o->op_seq = op_seqmax++;
4151 if (o->op_next->op_type == OP_STRINGIFY)
4153 o->op_seq = op_seqmax++;
4156 if ((o->op_flags & (OPf_KNOW|OPf_LIST)) != (OPf_KNOW|OPf_LIST)) {
4157 o->op_seq = op_seqmax++;
4158 break; /* Scalar stub must produce undef. List stub is noop */
4162 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4163 curcop = ((COP*)op);
4169 if (oldop && o->op_next) {
4170 oldop->op_next = o->op_next;
4173 o->op_seq = op_seqmax++;
4177 if (o->op_next->op_type == OP_RV2SV) {
4178 if (!(o->op_next->op_private & (OPpDEREF_HV|OPpDEREF_AV))) {
4180 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4181 o->op_next = o->op_next->op_next;
4182 o->op_type = OP_GVSV;
4183 o->op_ppaddr = ppaddr[OP_GVSV];
4186 else if (o->op_next->op_type == OP_RV2AV) {
4187 OP* pop = o->op_next->op_next;
4189 if (pop->op_type == OP_CONST &&
4190 (op = pop->op_next) &&
4191 pop->op_next->op_type == OP_AELEM &&
4192 !(pop->op_next->op_private &
4193 (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)) &&
4194 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4198 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4202 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4203 o->op_next = pop->op_next->op_next;
4204 o->op_type = OP_AELEMFAST;
4205 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4206 o->op_private = (U8)i;
4207 GvAVn((GV*)(((SVOP*)o)->op_sv));
4210 o->op_seq = op_seqmax++;
4217 o->op_seq = op_seqmax++;
4218 peep(cLOGOP->op_other);
4222 o->op_seq = op_seqmax++;
4223 peep(cCONDOP->op_true);
4224 peep(cCONDOP->op_false);
4228 o->op_seq = op_seqmax++;
4229 peep(cLOOP->op_redoop);
4230 peep(cLOOP->op_nextop);
4231 peep(cLOOP->op_lastop);
4236 o->op_seq = op_seqmax++;
4237 peep(cPMOP->op_pmreplstart);
4241 o->op_seq = op_seqmax++;
4242 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4243 if (o->op_next->op_sibling &&
4244 o->op_next->op_sibling->op_type != OP_DIE) {
4245 line_t oldline = curcop->cop_line;
4247 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4248 warn("Statement unlikely to be reached");
4249 warn("(Maybe you meant system() when you said exec()?)\n");
4250 curcop->cop_line = oldline;
4255 o->op_seq = op_seqmax++;