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 longjmp.
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_efullname(tmpsv, CvGV(cv));
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 off = pad_alloc(OP_PADSV, SVs_PADMY);
129 sv_upgrade(sv, SVt_PVNV);
131 av_store(comppad_name, off, sv);
132 SvNVX(sv) = (double)999999999;
133 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
134 if (!min_intro_pending)
135 min_intro_pending = off;
136 max_intro_pending = off;
138 av_store(comppad, off, (SV*)newAV());
139 else if (*name == '%')
140 av_store(comppad, off, (SV*)newHV());
141 SvPADMY_on(curpad[off]);
146 #ifndef CAN_PROTOTYPE
147 pad_findlex(name, newoff, seq, startcv, cx_ix)
154 pad_findlex(char *name, PADOFFSET newoff, I32 seq, CV* startcv, I32 cx_ix)
161 register CONTEXT *cx;
164 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
165 AV* curlist = CvPADLIST(cv);
166 SV** svp = av_fetch(curlist, 0, FALSE);
168 if (!svp || *svp == &sv_undef)
171 svp = AvARRAY(curname);
172 for (off = AvFILL(curname); off > 0; off--) {
173 if ((sv = svp[off]) &&
176 seq > (I32)SvNVX(sv) &&
177 strEQ(SvPVX(sv), name))
179 I32 depth = CvDEPTH(cv) ? CvDEPTH(cv) : 1;
180 AV *oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
181 SV *oldsv = *av_fetch(oldpad, off, TRUE);
182 if (!newoff) { /* Not a mere clone operation. */
183 SV *sv = NEWSV(1103,0);
184 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
185 sv_upgrade(sv, SVt_PVNV);
187 av_store(comppad_name, newoff, sv);
188 SvNVX(sv) = (double)curcop->cop_seq;
189 SvIVX(sv) = 999999999; /* A ref, intro immediately */
190 SvFLAGS(sv) |= SVf_FAKE;
192 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
193 SvFLAGS(compcv) |= SVpcv_CLONE;
199 /* Nothing in current lexical context--try eval's context, if any.
200 * This is necessary to let the perldb get at lexically scoped variables.
201 * XXX This will also probably interact badly with eval tree caching.
205 for (i = cx_ix; i >= 0; i--) {
207 switch (cx->cx_type) {
209 if (i == 0 && saweval) {
210 seq = cxstack[saweval].blk_oldcop->cop_seq;
211 return pad_findlex(name, newoff, seq, main_cv, 0);
215 if (cx->blk_eval.old_op_type != OP_ENTEREVAL &&
216 cx->blk_eval.old_op_type != OP_ENTERTRY)
217 return 0; /* require must have its own scope */
224 if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */
225 saweval = i; /* so we know where we were called from */
228 seq = cxstack[saweval].blk_oldcop->cop_seq;
229 return pad_findlex(name, newoff, seq, cv, i-1);
242 SV **svp = AvARRAY(comppad_name);
243 I32 seq = cop_seqmax;
245 /* The one we're looking for is probably just before comppad_name_fill. */
246 for (off = AvFILL(comppad_name); off > 0; off--) {
247 if ((sv = svp[off]) &&
250 seq > (I32)SvNVX(sv) &&
251 strEQ(SvPVX(sv), name))
253 return (PADOFFSET)off;
257 /* See if it's in a nested scope */
258 off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix);
270 SV **svp = AvARRAY(comppad_name);
272 if (min_intro_pending && fill < min_intro_pending) {
273 for (off = max_intro_pending; off >= min_intro_pending; off--) {
274 if ((sv = svp[off]) && sv != &sv_undef)
275 warn("%s never introduced", SvPVX(sv));
278 /* "Deintroduce" my variables that are leaving with this scope. */
279 for (off = AvFILL(comppad_name); off > fill; off--) {
280 if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999)
281 SvIVX(sv) = cop_seqmax;
286 pad_alloc(optype,tmptype)
293 if (AvARRAY(comppad) != curpad)
294 croak("panic: pad_alloc");
295 if (pad_reset_pending)
297 if (tmptype & SVs_PADMY) {
299 sv = *av_fetch(comppad, AvFILL(comppad) + 1, TRUE);
300 } while (SvPADBUSY(sv)); /* need a fresh one */
301 retval = AvFILL(comppad);
305 sv = *av_fetch(comppad, ++padix, TRUE);
306 } while (SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY));
309 SvFLAGS(sv) |= tmptype;
310 curpad = AvARRAY(comppad);
311 DEBUG_X(fprintf(stderr, "Pad alloc %ld for %s\n", (long) retval, op_name[optype]));
312 return (PADOFFSET)retval;
316 #ifndef CAN_PROTOTYPE
321 #endif /* CAN_PROTOTYPE */
324 croak("panic: pad_sv po");
325 DEBUG_X(fprintf(stderr, "Pad sv %d\n", po));
326 return curpad[po]; /* eventually we'll turn this into a macro */
330 #ifndef CAN_PROTOTYPE
334 pad_free(PADOFFSET po)
335 #endif /* CAN_PROTOTYPE */
339 if (AvARRAY(comppad) != curpad)
340 croak("panic: pad_free curpad");
342 croak("panic: pad_free po");
343 DEBUG_X(fprintf(stderr, "Pad free %d\n", po));
344 if (curpad[po] && curpad[po] != &sv_undef)
345 SvPADTMP_off(curpad[po]);
351 #ifndef CAN_PROTOTYPE
355 pad_swipe(PADOFFSET po)
356 #endif /* CAN_PROTOTYPE */
358 if (AvARRAY(comppad) != curpad)
359 croak("panic: pad_swipe curpad");
361 croak("panic: pad_swipe po");
362 DEBUG_X(fprintf(stderr, "Pad swipe %d\n", po));
363 SvPADTMP_off(curpad[po]);
364 curpad[po] = NEWSV(1107,0);
365 SvPADTMP_on(curpad[po]);
375 if (AvARRAY(comppad) != curpad)
376 croak("panic: pad_reset curpad");
377 DEBUG_X(fprintf(stderr, "Pad reset\n"));
378 if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */
379 for (po = AvMAX(comppad); po > padix_floor; po--) {
380 if (curpad[po] && curpad[po] != &sv_undef)
381 SvPADTMP_off(curpad[po]);
385 pad_reset_pending = FALSE;
394 register OP *kid, *nextkid;
399 if (op->op_flags & OPf_KIDS) {
400 for (kid = cUNOP->op_first; kid; kid = nextkid) {
401 nextkid = kid->op_sibling; /* Get before next freeing kid */
406 switch (op->op_type) {
408 op->op_targ = 0; /* Was holding old type, if any. */
411 op->op_targ = 0; /* Was holding hints. */
415 SvREFCNT_dec(cGVOP->op_gv);
419 SvREFCNT_dec(cCOP->cop_filegv);
422 SvREFCNT_dec(cSVOP->op_sv);
428 if (op->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
432 Safefree(cPVOP->op_pv);
435 op_free(cPMOP->op_pmreplroot);
439 pregfree(cPMOP->op_pmregexp);
440 SvREFCNT_dec(cPMOP->op_pmshort);
447 pad_free(op->op_targ);
456 if (op->op_type != OP_NULL && op->op_targ > 0)
457 pad_free(op->op_targ);
458 op->op_targ = op->op_type;
459 op->op_type = OP_NULL;
460 op->op_ppaddr = ppaddr[OP_NULL];
463 /* Contextualizers */
465 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
476 /* establish postfix order */
477 if (cUNOP->op_first) {
478 op->op_next = LINKLIST(cUNOP->op_first);
479 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling) {
481 kid->op_next = LINKLIST(kid->op_sibling);
497 if (op && op->op_flags & OPf_KIDS) {
498 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
509 op->op_type == OP_SASSIGN && cBINOP->op_first->op_type == OP_CONST) {
510 line_t oldline = curcop->cop_line;
512 if (copline != NOLINE)
513 curcop->cop_line = copline;
514 warn("Found = in conditional, should be ==");
515 curcop->cop_line = oldline;
526 /* assumes no premature commitment */
527 if (!op || (op->op_flags & OPf_KNOW) || error_count)
530 op->op_flags &= ~OPf_LIST;
531 op->op_flags |= OPf_KNOW;
533 switch (op->op_type) {
535 if (op->op_private & OPpREPEAT_DOLIST)
536 null(((LISTOP*)cBINOP->op_first)->op_first);
537 scalar(cBINOP->op_first);
542 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
546 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
547 if (!kPMOP->op_pmreplroot)
548 deprecate("implicit split to @_");
555 if (op->op_flags & OPf_KIDS) {
556 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling)
562 scalar(cLISTOP->op_first);
567 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
587 if (!op || error_count)
589 if (op->op_flags & OPf_LIST)
592 op->op_flags |= OPf_KNOW;
594 switch (op->op_type) {
596 if (!(opargs[op->op_type] & OA_FOLDCONST))
598 if (op->op_flags & OPf_STACKED)
671 if (!(op->op_private & OPpLVAL_INTRO))
672 useless = op_desc[op->op_type];
679 if (!(op->op_private & OPpLVAL_INTRO) &&
680 (!op->op_sibling || op->op_sibling->op_type != OP_READLINE))
681 useless = "a variable";
686 curcop = ((COP*)op); /* for warning below */
692 useless = "a constant";
693 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
695 else if (SvPOK(sv)) {
696 if (strnEQ(SvPVX(sv), "di", 2) ||
697 strnEQ(SvPVX(sv), "ds", 2) ||
698 strnEQ(SvPVX(sv), "ig", 2))
702 null(op); /* don't execute a constant */
703 SvREFCNT_dec(sv); /* don't even remember it */
707 op->op_type = OP_PREINC; /* pre-increment is faster */
708 op->op_ppaddr = ppaddr[OP_PREINC];
712 op->op_type = OP_PREDEC; /* pre-decrement is faster */
713 op->op_ppaddr = ppaddr[OP_PREDEC];
717 scalarvoid(cBINOP->op_first);
718 useless = op_desc[op->op_type];
724 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
728 if (op->op_targ == OP_NEXTSTATE || op->op_targ == OP_DBSTATE)
729 curcop = ((COP*)op); /* for warning below */
730 if (op->op_flags & OPf_STACKED)
735 if (!(op->op_flags & OPf_KIDS))
741 op->op_private |= OPpLEAVE_VOID;
744 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
748 if ((kid = ((LISTOP*)op)->op_first) && kid->op_type == OP_PUSHRE) {
749 if (!kPMOP->op_pmreplroot)
750 deprecate("implicit split to @_");
754 op->op_private |= OPpLEAVE_VOID;
757 if (useless && dowarn)
758 warn("Useless use of %s in void context", useless);
767 if (op && op->op_flags & OPf_KIDS) {
768 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
780 /* assumes no premature commitment */
781 if (!op || (op->op_flags & OPf_KNOW) || error_count)
784 op->op_flags |= (OPf_KNOW | OPf_LIST);
786 switch (op->op_type) {
789 list(cBINOP->op_first);
794 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
801 if (!(op->op_flags & OPf_KIDS))
803 if (!op->op_next && cUNOP->op_first->op_type == OP_FLOP) {
804 list(cBINOP->op_first);
805 return gen_constant_list(op);
812 list(cLISTOP->op_first);
816 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
835 if (op->op_type == OP_LINESEQ ||
836 op->op_type == OP_SCOPE ||
837 op->op_type == OP_LEAVE ||
838 op->op_type == OP_LEAVETRY)
840 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
841 if (kid->op_sibling) {
847 op->op_flags &= ~OPf_PARENS;
848 if (hints & HINT_BLOCK_SCOPE)
849 op->op_flags |= OPf_PARENS;
852 op = newOP(OP_STUB, 0);
862 if (op && op->op_flags & OPf_KIDS) {
863 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
880 if (!op || error_count)
883 switch (op->op_type) {
885 if (!(op->op_private & (OPpCONST_ARYBASE)))
887 if (eval_start && eval_start->op_type == OP_CONST) {
888 compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv);
892 SAVEI32(compiling.cop_arybase);
893 compiling.cop_arybase = 0;
895 else if (type == OP_REFGEN)
898 croak("That use of $[ is unsupported");
901 if ((type == OP_UNDEF || type == OP_REFGEN) &&
902 !(op->op_flags & OPf_STACKED)) {
903 op->op_type = OP_RV2CV; /* entersub => rv2cv */
904 op->op_ppaddr = ppaddr[OP_RV2CV];
905 assert(cUNOP->op_first->op_type == OP_NULL);
906 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
912 /* grep, foreach, subcalls, refgen */
913 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
915 sprintf(tokenbuf, "Can't modify %s in %s",
916 op_desc[op->op_type],
917 type ? op_desc[type] : "local");
941 if (!(op->op_flags & OPf_STACKED))
947 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
953 if (type == OP_REFGEN && op->op_flags & OPf_PARENS) {
955 return op; /* Treat \(@foo) like ordinary list. */
959 ref(cUNOP->op_first, op->op_type);
971 if (!type && cUNOP->op_first->op_type != OP_GV)
972 croak("Can't localize a reference");
973 ref(cUNOP->op_first, op->op_type);
990 croak("Can't localize lexical variable %s",
991 SvPV(*av_fetch(comppad_name, op->op_targ, 4), na));
1006 pad_free(op->op_targ);
1007 op->op_targ = pad_alloc(op->op_type, SVs_PADMY);
1008 sv = PAD_SV(op->op_targ);
1009 sv_upgrade(sv, SVt_PVLV);
1010 sv_magic(sv, Nullsv, mtype, Nullch, 0);
1011 curpad[op->op_targ] = sv;
1012 if (op->op_flags & OPf_KIDS)
1013 mod(cBINOP->op_first->op_sibling, type);
1018 ref(cBINOP->op_first, op->op_type);
1025 if (op->op_flags & OPf_KIDS)
1026 mod(cLISTOP->op_last, type);
1030 if (!(op->op_flags & OPf_KIDS))
1032 if (op->op_targ != OP_LIST) {
1033 mod(cBINOP->op_first, type);
1038 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1042 op->op_flags |= OPf_MOD;
1044 if (type == OP_AASSIGN || type == OP_SASSIGN)
1045 op->op_flags |= OPf_SPECIAL|OPf_REF;
1047 op->op_private |= OPpLVAL_INTRO;
1048 op->op_flags &= ~OPf_SPECIAL;
1050 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1051 op->op_flags |= OPf_REF;
1061 if (op && op->op_flags & OPf_KIDS) {
1062 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1075 if (!op || error_count)
1078 switch (op->op_type) {
1080 if ((type == OP_DEFINED) &&
1081 !(op->op_flags & OPf_STACKED)) {
1082 op->op_type = OP_RV2CV; /* entersub => rv2cv */
1083 op->op_ppaddr = ppaddr[OP_RV2CV];
1084 assert(cUNOP->op_first->op_type == OP_NULL);
1085 null(((LISTOP*)cUNOP->op_first)->op_first); /* disable pushmark */
1086 op->op_flags |= OPf_SPECIAL;
1091 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
1095 ref(cUNOP->op_first, op->op_type);
1098 if (type == OP_RV2AV || type == OP_RV2HV) {
1099 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV : OPpDEREF_HV);
1100 op->op_flags |= OPf_MOD;
1106 op->op_flags |= OPf_REF;
1109 ref(cUNOP->op_first, op->op_type);
1114 op->op_flags |= OPf_REF;
1119 if (!(op->op_flags & OPf_KIDS))
1121 ref(cBINOP->op_first, type);
1125 ref(cBINOP->op_first, op->op_type);
1126 if (type == OP_RV2AV || type == OP_RV2HV) {
1127 op->op_private |= (type == OP_RV2AV ? OPpDEREF_AV : OPpDEREF_HV);
1128 op->op_flags |= OPf_MOD;
1136 if (!(op->op_flags & OPf_KIDS))
1138 ref(cLISTOP->op_last, type);
1154 if (!op || error_count)
1158 if (type == OP_LIST) {
1159 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1162 else if (type != OP_PADSV &&
1165 type != OP_PUSHMARK)
1167 sprintf(tokenbuf, "Can't declare %s in my", op_desc[op->op_type]);
1171 op->op_flags |= OPf_MOD;
1172 op->op_private |= OPpLVAL_INTRO;
1181 o->op_flags |= OPf_PARENS;
1186 bind_match(type, left, right)
1193 if (right->op_type == OP_MATCH ||
1194 right->op_type == OP_SUBST ||
1195 right->op_type == OP_TRANS) {
1196 right->op_flags |= OPf_STACKED;
1197 if (right->op_type != OP_MATCH)
1198 left = mod(left, right->op_type);
1199 if (right->op_type == OP_TRANS)
1200 op = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1202 op = prepend_elem(right->op_type, scalar(left), right);
1204 return newUNOP(OP_NOT, 0, scalar(op));
1208 return bind_match(type, left,
1209 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1218 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1219 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(op));
1227 if (o->op_flags & OPf_PARENS || perldb || tainting) {
1228 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1229 o->op_type = OP_LEAVE;
1230 o->op_ppaddr = ppaddr[OP_LEAVE];
1233 if (o->op_type == OP_LINESEQ) {
1235 o->op_type = OP_SCOPE;
1236 o->op_ppaddr = ppaddr[OP_SCOPE];
1237 kid = ((LISTOP*)o)->op_first;
1238 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1239 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1244 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1253 int retval = savestack_ix;
1254 comppad_name_fill = AvFILL(comppad_name);
1255 SAVEINT(min_intro_pending);
1256 SAVEINT(max_intro_pending);
1257 min_intro_pending = 0;
1258 SAVEINT(comppad_name_fill);
1259 SAVEINT(padix_floor);
1260 padix_floor = padix;
1261 pad_reset_pending = FALSE;
1263 hints &= ~HINT_BLOCK_SCOPE;
1268 block_end(line, floor, seq)
1273 int needblockscope = hints & HINT_BLOCK_SCOPE;
1274 OP* retval = scalarseq(seq);
1275 if (copline > (line_t)line)
1278 pad_reset_pending = FALSE;
1280 hints |= HINT_BLOCK_SCOPE; /* propagate out */
1281 pad_leavemy(comppad_name_fill);
1290 eval_root = newUNOP(OP_LEAVEEVAL, 0, op);
1291 eval_start = linklist(eval_root);
1292 eval_root->op_next = 0;
1300 main_root = scope(sawparens(scalarvoid(op)));
1301 curcop = &compiling;
1302 main_start = LINKLIST(main_root);
1303 main_root->op_next = 0;
1315 if (o->op_flags & OPf_PARENS)
1319 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1321 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1322 if (*s == ';' || *s == '=')
1323 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1330 return mod(o, OP_NULL); /* a bit kludgey */
1337 if (o->op_type == OP_LIST) {
1338 o = convert(OP_JOIN, 0,
1339 prepend_elem(OP_LIST,
1340 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1351 I32 type = o->op_type;
1354 if (opargs[type] & OA_RETSCALAR)
1356 if (opargs[type] & OA_TARGET)
1357 o->op_targ = pad_alloc(type, SVs_PADTMP);
1359 if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER))
1360 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1362 if (!(opargs[type] & OA_FOLDCONST))
1366 goto nope; /* Don't try to run w/ errors */
1368 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1369 if (curop->op_type != OP_CONST &&
1370 curop->op_type != OP_LIST &&
1371 curop->op_type != OP_SCALAR &&
1372 curop->op_type != OP_NULL &&
1373 curop->op_type != OP_PUSHMARK) {
1378 curop = LINKLIST(o);
1383 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1384 pad_swipe(o->op_targ);
1385 else if (SvTEMP(sv)) { /* grab mortal temp? */
1386 (void)SvREFCNT_inc(sv);
1390 if (type == OP_RV2GV)
1391 return newGVOP(OP_GV, 0, sv);
1393 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK) {
1395 if ((double)iv == SvNV(sv)) { /* can we smush double to int */
1400 return newSVOP(OP_CONST, 0, sv);
1404 if (!(opargs[type] & OA_OTHERINT))
1407 if (!(hints & HINT_INTEGER)) {
1410 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1413 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1414 if (curop->op_type == OP_CONST) {
1415 if (SvIOK(((SVOP*)curop)->op_sv)) {
1416 if (SvIVX(((SVOP*)curop)->op_sv) < 0 && vars++)
1417 return o; /* negatives truncate wrong way, alas */
1422 if (opargs[curop->op_type] & OA_RETINTEGER)
1424 if (curop->op_type == OP_PADSV || curop->op_type == OP_RV2SV) {
1427 if (o->op_type >= OP_LT && o->op_type <= OP_NCMP)
1428 continue; /* allow $i < 10000 to integerize */
1432 o->op_ppaddr = ppaddr[++(o->op_type)];
1439 gen_constant_list(o)
1443 I32 oldtmps_floor = tmps_floor;
1447 return o; /* Don't attempt to run with errors */
1449 op = curop = LINKLIST(o);
1455 tmps_floor = oldtmps_floor;
1457 o->op_type = OP_RV2AV;
1458 o->op_ppaddr = ppaddr[OP_RV2AV];
1459 curop = ((UNOP*)o)->op_first;
1460 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--));
1467 convert(type, flags, op)
1475 if (!op || op->op_type != OP_LIST)
1476 op = newLISTOP(OP_LIST, 0, op, Nullop);
1478 op->op_flags &= ~(OPf_KNOW|OPf_LIST);
1480 if (!(opargs[type] & OA_MARK))
1481 null(cLISTOP->op_first);
1484 op->op_ppaddr = ppaddr[type];
1485 op->op_flags |= flags;
1487 op = CHECKOP(type, op);
1488 if (op->op_type != type)
1491 if (cLISTOP->op_children < 7) {
1492 /* XXX do we really need to do this if we're done appending?? */
1493 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1495 cLISTOP->op_last = last; /* in case check substituted last arg */
1498 return fold_constants(op);
1501 /* List constructors */
1504 append_elem(type, first, last)
1515 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1516 return newLISTOP(type, 0, first, last);
1518 if (first->op_flags & OPf_KIDS)
1519 ((LISTOP*)first)->op_last->op_sibling = last;
1521 first->op_flags |= OPf_KIDS;
1522 ((LISTOP*)first)->op_first = last;
1524 ((LISTOP*)first)->op_last = last;
1525 ((LISTOP*)first)->op_children++;
1530 append_list(type, first, last)
1541 if (first->op_type != type)
1542 return prepend_elem(type, (OP*)first, (OP*)last);
1544 if (last->op_type != type)
1545 return append_elem(type, (OP*)first, (OP*)last);
1547 first->op_last->op_sibling = last->op_first;
1548 first->op_last = last->op_last;
1549 first->op_children += last->op_children;
1550 if (first->op_children)
1551 last->op_flags |= OPf_KIDS;
1558 prepend_elem(type, first, last)
1569 if (last->op_type == type) {
1570 if (type == OP_LIST) { /* already a PUSHMARK there */
1571 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1572 ((LISTOP*)last)->op_first->op_sibling = first;
1575 if (!(last->op_flags & OPf_KIDS)) {
1576 ((LISTOP*)last)->op_last = first;
1577 last->op_flags |= OPf_KIDS;
1579 first->op_sibling = ((LISTOP*)last)->op_first;
1580 ((LISTOP*)last)->op_first = first;
1582 ((LISTOP*)last)->op_children++;
1586 return newLISTOP(type, 0, first, last);
1594 return newOP(OP_STUB, 0);
1601 if (!op || op->op_type != OP_LIST)
1602 op = newLISTOP(OP_LIST, 0, op, Nullop);
1608 newLISTOP(type, flags, first, last)
1616 Newz(1101, listop, 1, LISTOP);
1618 listop->op_type = type;
1619 listop->op_ppaddr = ppaddr[type];
1620 listop->op_children = (first != 0) + (last != 0);
1621 listop->op_flags = flags;
1625 else if (!first && last)
1628 first->op_sibling = last;
1629 listop->op_first = first;
1630 listop->op_last = last;
1631 if (type == OP_LIST) {
1633 pushop = newOP(OP_PUSHMARK, 0);
1634 pushop->op_sibling = first;
1635 listop->op_first = pushop;
1636 listop->op_flags |= OPf_KIDS;
1638 listop->op_last = pushop;
1640 else if (listop->op_children)
1641 listop->op_flags |= OPf_KIDS;
1652 Newz(1101, op, 1, OP);
1654 op->op_ppaddr = ppaddr[type];
1655 op->op_flags = flags;
1658 op->op_private = 0 + (flags >> 8);
1659 if (opargs[type] & OA_RETSCALAR)
1661 if (opargs[type] & OA_TARGET)
1662 op->op_targ = pad_alloc(type, SVs_PADTMP);
1663 return CHECKOP(type, op);
1667 newUNOP(type, flags, first)
1675 first = newOP(OP_STUB, 0);
1676 if (opargs[type] & OA_MARK)
1677 first = force_list(first);
1679 Newz(1101, unop, 1, UNOP);
1680 unop->op_type = type;
1681 unop->op_ppaddr = ppaddr[type];
1682 unop->op_first = first;
1683 unop->op_flags = flags | OPf_KIDS;
1684 unop->op_private = 1 | (flags >> 8);
1686 unop = (UNOP*) CHECKOP(type, unop);
1690 return fold_constants((OP *) unop);
1694 newBINOP(type, flags, first, last)
1701 Newz(1101, binop, 1, BINOP);
1704 first = newOP(OP_NULL, 0);
1706 binop->op_type = type;
1707 binop->op_ppaddr = ppaddr[type];
1708 binop->op_first = first;
1709 binop->op_flags = flags | OPf_KIDS;
1712 binop->op_private = 1 | (flags >> 8);
1715 binop->op_private = 2 | (flags >> 8);
1716 first->op_sibling = last;
1719 binop = (BINOP*)CHECKOP(type, binop);
1723 binop->op_last = last = binop->op_first->op_sibling;
1725 return fold_constants((OP *)binop);
1729 pmtrans(op, expr, repl)
1734 SV *tstr = ((SVOP*)expr)->op_sv;
1735 SV *rstr = ((SVOP*)repl)->op_sv;
1738 register U8 *t = (U8*)SvPV(tstr, tlen);
1739 register U8 *r = (U8*)SvPV(rstr, rlen);
1744 register short *tbl;
1746 tbl = (short*)cPVOP->op_pv;
1747 complement = op->op_private & OPpTRANS_COMPLEMENT;
1748 delete = op->op_private & OPpTRANS_DELETE;
1749 /* squash = op->op_private & OPpTRANS_SQUASH; */
1752 Zero(tbl, 256, short);
1753 for (i = 0; i < tlen; i++)
1755 for (i = 0, j = 0; i < 256; i++) {
1771 if (!rlen && !delete) {
1774 for (i = 0; i < 256; i++)
1776 for (i = 0, j = 0; i < tlen; i++,j++) {
1779 if (tbl[t[i]] == -1)
1785 if (tbl[t[i]] == -1)
1796 newPMOP(type, flags)
1802 Newz(1101, pmop, 1, PMOP);
1803 pmop->op_type = type;
1804 pmop->op_ppaddr = ppaddr[type];
1805 pmop->op_flags = flags;
1806 pmop->op_private = 0 | (flags >> 8);
1808 /* link into pm list */
1809 if (type != OP_TRANS && curstash) {
1810 pmop->op_pmnext = HvPMROOT(curstash);
1811 HvPMROOT(curstash) = pmop;
1818 pmruntime(op, expr, repl)
1826 if (op->op_type == OP_TRANS)
1827 return pmtrans(op, expr, repl);
1831 if (expr->op_type == OP_CONST) {
1833 SV *pat = ((SVOP*)expr)->op_sv;
1834 char *p = SvPV(pat, plen);
1835 if ((op->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
1836 sv_setpvn(pat, "\\s+", 3);
1837 p = SvPV(pat, plen);
1838 pm->op_pmflags |= PMf_SKIPWHITE;
1840 pm->op_pmregexp = pregcomp(p, p + plen, pm);
1841 if (strEQ("\\s+", pm->op_pmregexp->precomp))
1842 pm->op_pmflags |= PMf_WHITE;
1847 if (pm->op_pmflags & PMf_KEEP)
1848 expr = newUNOP(OP_REGCMAYBE,0,expr);
1850 Newz(1101, rcop, 1, LOGOP);
1851 rcop->op_type = OP_REGCOMP;
1852 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
1853 rcop->op_first = scalar(expr);
1854 rcop->op_flags |= OPf_KIDS;
1855 rcop->op_private = 1;
1856 rcop->op_other = op;
1858 /* establish postfix order */
1859 if (pm->op_pmflags & PMf_KEEP) {
1861 rcop->op_next = expr;
1862 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
1865 rcop->op_next = LINKLIST(expr);
1866 expr->op_next = (OP*)rcop;
1869 prepend_elem(op->op_type, scalar((OP*)rcop), op);
1874 if (pm->op_pmflags & PMf_EVAL)
1876 else if (repl->op_type == OP_CONST)
1880 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
1881 if (opargs[curop->op_type] & OA_DANGEROUS) {
1882 if (curop->op_type == OP_GV) {
1883 GV *gv = ((GVOP*)curop)->op_gv;
1884 if (strchr("&`'123456789+", *GvENAME(gv)))
1887 else if (curop->op_type == OP_RV2CV)
1889 else if (curop->op_type == OP_RV2SV ||
1890 curop->op_type == OP_RV2AV ||
1891 curop->op_type == OP_RV2HV ||
1892 curop->op_type == OP_RV2GV) {
1893 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
1896 else if (curop->op_type == OP_PADSV ||
1897 curop->op_type == OP_PADAV ||
1898 curop->op_type == OP_PADHV ||
1899 curop->op_type == OP_PADANY) {
1908 if (curop == repl) {
1909 pm->op_pmflags |= PMf_CONST; /* const for long enough */
1910 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
1911 prepend_elem(op->op_type, scalar(repl), op);
1914 Newz(1101, rcop, 1, LOGOP);
1915 rcop->op_type = OP_SUBSTCONT;
1916 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
1917 rcop->op_first = scalar(repl);
1918 rcop->op_flags |= OPf_KIDS;
1919 rcop->op_private = 1;
1920 rcop->op_other = op;
1922 /* establish postfix order */
1923 rcop->op_next = LINKLIST(repl);
1924 repl->op_next = (OP*)rcop;
1926 pm->op_pmreplroot = scalar((OP*)rcop);
1927 pm->op_pmreplstart = LINKLIST(rcop);
1936 newSVOP(type, flags, sv)
1942 Newz(1101, svop, 1, SVOP);
1943 svop->op_type = type;
1944 svop->op_ppaddr = ppaddr[type];
1946 svop->op_next = (OP*)svop;
1947 svop->op_flags = flags;
1948 if (opargs[type] & OA_RETSCALAR)
1950 if (opargs[type] & OA_TARGET)
1951 svop->op_targ = pad_alloc(type, SVs_PADTMP);
1952 return CHECKOP(type, svop);
1956 newGVOP(type, flags, gv)
1962 Newz(1101, gvop, 1, GVOP);
1963 gvop->op_type = type;
1964 gvop->op_ppaddr = ppaddr[type];
1965 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
1966 gvop->op_next = (OP*)gvop;
1967 gvop->op_flags = flags;
1968 if (opargs[type] & OA_RETSCALAR)
1970 if (opargs[type] & OA_TARGET)
1971 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
1972 return CHECKOP(type, gvop);
1976 newPVOP(type, flags, pv)
1982 Newz(1101, pvop, 1, PVOP);
1983 pvop->op_type = type;
1984 pvop->op_ppaddr = ppaddr[type];
1986 pvop->op_next = (OP*)pvop;
1987 pvop->op_flags = flags;
1988 if (opargs[type] & OA_RETSCALAR)
1990 if (opargs[type] & OA_TARGET)
1991 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
1992 return CHECKOP(type, pvop);
2001 save_hptr(&curstash);
2002 save_item(curstname);
2007 name = SvPV(sv, len);
2008 curstash = gv_stashpv(name,TRUE);
2009 sv_setpvn(curstname, name, len);
2013 sv_setpv(curstname,"<none>");
2021 utilize(aver, floor, id, arg)
2032 if (id->op_type != OP_CONST)
2033 croak("Module name must be constant");
2035 /* Fake up an import/unimport */
2036 if (arg && arg->op_type == OP_STUB)
2037 imop = arg; /* no import on explicit () */
2039 /* Make copy of id so we don't free it twice */
2040 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2042 meth = newSVOP(OP_CONST, 0,
2044 ? newSVpv("import", 6)
2045 : newSVpv("unimport", 8)
2047 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2048 append_elem(OP_LIST,
2049 prepend_elem(OP_LIST, pack, list(arg)),
2050 newUNOP(OP_METHOD, 0, meth)));
2053 /* Fake up a require */
2054 rqop = newUNOP(OP_REQUIRE, 0, id);
2056 /* Fake up the BEGIN {}, which does its thing immediately. */
2058 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2060 append_elem(OP_LINESEQ,
2061 newSTATEOP(0, Nullch, rqop),
2062 newSTATEOP(0, Nullch, imop) ));
2069 newSLICEOP(flags, subscript, listval)
2074 return newBINOP(OP_LSLICE, flags,
2075 list(force_list(subscript)),
2076 list(force_list(listval)) );
2086 if (op->op_type == OP_NULL && op->op_flags & OPf_KIDS)
2087 op = cUNOP->op_first;
2089 if (op->op_type == OP_COND_EXPR) {
2090 I32 t = list_assignment(cCONDOP->op_first->op_sibling);
2091 I32 f = list_assignment(cCONDOP->op_first->op_sibling->op_sibling);
2096 yyerror("Assignment to both a list and a scalar");
2100 if (op->op_type == OP_LIST || op->op_flags & OPf_PARENS ||
2101 op->op_type == OP_RV2AV || op->op_type == OP_RV2HV ||
2102 op->op_type == OP_ASLICE || op->op_type == OP_HSLICE)
2105 if (op->op_type == OP_PADAV || op->op_type == OP_PADHV)
2108 if (op->op_type == OP_RV2SV)
2115 newASSIGNOP(flags, left, optype, right)
2124 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2125 return newLOGOP(optype, 0,
2126 mod(scalar(left), optype),
2127 newUNOP(OP_SASSIGN, 0, scalar(right)));
2130 return newBINOP(optype, OPf_STACKED,
2131 mod(scalar(left), optype), scalar(right));
2135 if (list_assignment(left)) {
2137 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2138 left = mod(left, OP_AASSIGN);
2146 op = newBINOP(OP_AASSIGN, flags,
2147 list(force_list(right)),
2148 list(force_list(left)) );
2149 op->op_private = 0 | (flags >> 8);
2150 if (!(left->op_private & OPpLVAL_INTRO)) {
2151 static int generation = 100;
2155 for (curop = LINKLIST(op); curop != op; curop = LINKLIST(curop)) {
2156 if (opargs[curop->op_type] & OA_DANGEROUS) {
2157 if (curop->op_type == OP_GV) {
2158 GV *gv = ((GVOP*)curop)->op_gv;
2159 if (gv == defgv || SvCUR(gv) == generation)
2161 SvCUR(gv) = generation;
2163 else if (curop->op_type == OP_PADSV ||
2164 curop->op_type == OP_PADAV ||
2165 curop->op_type == OP_PADHV ||
2166 curop->op_type == OP_PADANY) {
2167 SV **svp = AvARRAY(comppad_name);
2168 SV *sv = svp[curop->op_targ];
2169 if (SvCUR(sv) == generation)
2171 SvCUR(sv) = generation; /* (SvCUR not used any more) */
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->op_type != OP_GV) /* funny deref? */
2188 op->op_private = OPpASSIGN_COMMON;
2190 if (right && right->op_type == OP_SPLIT) {
2192 if ((tmpop = ((LISTOP*)right)->op_first) &&
2193 tmpop->op_type == OP_PUSHRE)
2195 PMOP *pm = (PMOP*)tmpop;
2196 if (left->op_type == OP_RV2AV &&
2197 !(left->op_private & OPpLVAL_INTRO) &&
2198 !(op->op_private & OPpASSIGN_COMMON) )
2200 tmpop = ((UNOP*)left)->op_first;
2201 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2202 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2203 pm->op_pmflags |= PMf_ONCE;
2204 tmpop = ((UNOP*)op)->op_first; /* to list (nulled) */
2205 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2206 tmpop->op_sibling = Nullop; /* don't free split */
2207 right->op_next = tmpop->op_next; /* fix starting loc */
2208 op_free(op); /* blow off assign */
2213 if (modcount < 10000 &&
2214 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2216 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2218 sv_setiv(sv, modcount+1);
2226 right = newOP(OP_UNDEF, 0);
2227 if (right->op_type == OP_READLINE) {
2228 right->op_flags |= OPf_STACKED;
2229 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2232 eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2233 op = newBINOP(OP_SASSIGN, flags,
2234 scalar(right), mod(scalar(left), OP_SASSIGN) );
2246 newSTATEOP(flags, label, op)
2253 /* Introduce my variables. */
2254 if (min_intro_pending) {
2255 SV **svp = AvARRAY(comppad_name);
2258 for (i = min_intro_pending; i <= max_intro_pending; i++) {
2259 if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) {
2260 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2261 SvNVX(sv) = (double)cop_seqmax;
2264 min_intro_pending = 0;
2265 comppad_name_fill = max_intro_pending; /* Needn't search higher */
2268 Newz(1101, cop, 1, COP);
2269 if (perldb && curcop->cop_line && curstash != debstash) {
2270 cop->op_type = OP_DBSTATE;
2271 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2274 cop->op_type = OP_NEXTSTATE;
2275 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2277 cop->op_flags = flags;
2278 cop->op_private = 0 | (flags >> 8);
2279 cop->op_next = (OP*)cop;
2282 cop->cop_label = label;
2283 hints |= HINT_BLOCK_SCOPE;
2285 cop->cop_seq = cop_seqmax++;
2286 cop->cop_arybase = curcop->cop_arybase;
2288 if (copline == NOLINE)
2289 cop->cop_line = curcop->cop_line;
2291 cop->cop_line = copline;
2294 cop->cop_filegv = SvREFCNT_inc(curcop->cop_filegv);
2295 cop->cop_stash = curstash;
2297 if (perldb && curstash != debstash) {
2298 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2299 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
2301 (void)SvIOK_on(*svp);
2302 SvSTASH(*svp) = (HV*)cop;
2306 return prepend_elem(OP_LINESEQ, (OP*)cop, op);
2310 newLOGOP(type, flags, first, other)
2319 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2320 return newBINOP(type, flags, scalar(first), scalar(other));
2322 scalarboolean(first);
2323 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2324 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2325 if (type == OP_AND || type == OP_OR) {
2331 first = cUNOP->op_first;
2333 first->op_next = op->op_next;
2334 cUNOP->op_first = Nullop;
2338 if (first->op_type == OP_CONST) {
2339 if (dowarn && (first->op_private & OPpCONST_BARE))
2340 warn("Probable precedence problem on %s", op_desc[type]);
2341 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2350 else if (first->op_type == OP_WANTARRAY) {
2360 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2361 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2363 Newz(1101, logop, 1, LOGOP);
2365 logop->op_type = type;
2366 logop->op_ppaddr = ppaddr[type];
2367 logop->op_first = first;
2368 logop->op_flags = flags | OPf_KIDS;
2369 logop->op_other = LINKLIST(other);
2370 logop->op_private = 1 | (flags >> 8);
2372 /* establish postfix order */
2373 logop->op_next = LINKLIST(first);
2374 first->op_next = (OP*)logop;
2375 first->op_sibling = other;
2377 op = newUNOP(OP_NULL, 0, (OP*)logop);
2378 other->op_next = op;
2384 newCONDOP(flags, first, true, false)
2394 return newLOGOP(OP_AND, 0, first, true);
2396 return newLOGOP(OP_OR, 0, first, false);
2398 scalarboolean(first);
2399 if (first->op_type == OP_CONST) {
2400 if (SvTRUE(((SVOP*)first)->op_sv)) {
2411 else if (first->op_type == OP_WANTARRAY) {
2415 Newz(1101, condop, 1, CONDOP);
2417 condop->op_type = OP_COND_EXPR;
2418 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2419 condop->op_first = first;
2420 condop->op_flags = flags | OPf_KIDS;
2421 condop->op_true = LINKLIST(true);
2422 condop->op_false = LINKLIST(false);
2423 condop->op_private = 1 | (flags >> 8);
2425 /* establish postfix order */
2426 condop->op_next = LINKLIST(first);
2427 first->op_next = (OP*)condop;
2429 first->op_sibling = true;
2430 true->op_sibling = false;
2431 op = newUNOP(OP_NULL, 0, (OP*)condop);
2434 false->op_next = op;
2440 newRANGE(flags, left, right)
2450 Newz(1101, condop, 1, CONDOP);
2452 condop->op_type = OP_RANGE;
2453 condop->op_ppaddr = ppaddr[OP_RANGE];
2454 condop->op_first = left;
2455 condop->op_flags = OPf_KIDS;
2456 condop->op_true = LINKLIST(left);
2457 condop->op_false = LINKLIST(right);
2458 condop->op_private = 1 | (flags >> 8);
2460 left->op_sibling = right;
2462 condop->op_next = (OP*)condop;
2463 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2464 flop = newUNOP(OP_FLOP, 0, flip);
2465 op = newUNOP(OP_NULL, 0, flop);
2468 left->op_next = flip;
2469 right->op_next = flop;
2471 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2472 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2473 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2474 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2476 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2477 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2480 if (!flip->op_private || !flop->op_private)
2481 linklist(op); /* blow off optimizer unless constant */
2487 newLOOPOP(flags, debuggable, expr, block)
2495 int once = block && block->op_flags & OPf_SPECIAL &&
2496 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2499 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2500 return block; /* do {} while 0 does once */
2501 else if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB)
2502 expr = newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr);
2505 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2506 op = newLOGOP(OP_AND, 0, expr, listop);
2508 ((LISTOP*)listop)->op_last->op_next = LINKLIST(op);
2510 if (once && op != listop)
2511 op->op_next = ((LOGOP*)cUNOP->op_first)->op_other;
2514 op = newUNOP(OP_NULL, 0, op); /* or do {} while 1 loses outer block */
2516 op->op_flags |= flags;
2518 op->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2523 newWHILEOP(flags, debuggable, loop, expr, block, cont)
2537 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB)) {
2538 expr = newUNOP(OP_DEFINED, 0,
2539 newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), 0, expr) );
2543 block = newOP(OP_NULL, 0);
2546 next = LINKLIST(cont);
2548 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2550 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2551 redo = LINKLIST(listop);
2554 op = newLOGOP(OP_AND, 0, expr, scalar(listop));
2555 if (op == expr && op->op_type == OP_CONST && !SvTRUE(cSVOP->op_sv)) {
2556 op_free(expr); /* oops, it's a while (0) */
2558 return Nullop; /* (listop already freed by newLOGOP) */
2560 ((LISTOP*)listop)->op_last->op_next = condop =
2561 (op == listop ? redo : LINKLIST(op));
2569 Newz(1101,loop,1,LOOP);
2570 loop->op_type = OP_ENTERLOOP;
2571 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2572 loop->op_private = 0;
2573 loop->op_next = (OP*)loop;
2576 op = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, op);
2578 loop->op_redoop = redo;
2579 loop->op_lastop = op;
2582 loop->op_nextop = next;
2584 loop->op_nextop = op;
2586 op->op_flags |= flags;
2587 op->op_private |= (flags >> 8);
2592 #ifndef CAN_PROTOTYPE
2593 newFOROP(flags,label,forline,sv,expr,block,cont)
2602 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2603 #endif /* CAN_PROTOTYPE */
2611 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
2612 sv->op_type = OP_RV2GV;
2613 sv->op_ppaddr = ppaddr[OP_RV2GV];
2615 else if (sv->op_type == OP_PADSV) { /* private variable */
2616 padoff = sv->op_targ;
2621 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
2624 sv = newGVOP(OP_GV, 0, defgv);
2626 if (expr->op_type == OP_RV2AV) {
2627 expr = scalar(ref(expr, OP_ITER));
2628 iterflags |= OPf_STACKED;
2630 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
2631 append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART),
2633 assert(!loop->op_next);
2634 Renew(loop, 1, LOOP);
2635 loop->op_targ = padoff;
2636 return newSTATEOP(0, label, newWHILEOP(flags, 1, loop,
2637 newOP(OP_ITER, 0), block, cont));
2641 newLOOPEX(type, label)
2646 if (type != OP_GOTO || label->op_type == OP_CONST) {
2647 op = newPVOP(type, 0, savepv(
2648 label->op_type == OP_CONST
2649 ? SvPVx(((SVOP*)label)->op_sv, na)
2654 if (label->op_type == OP_ENTERSUB)
2655 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
2656 op = newUNOP(type, OPf_STACKED, label);
2658 hints |= HINT_BLOCK_SCOPE;
2666 if (!CvXSUB(cv) && CvROOT(cv)) {
2668 croak("Can't undef active subroutine");
2674 if (!(SvFLAGS(cv) & SVpcv_CLONED))
2675 op_free(CvROOT(cv));
2676 CvROOT(cv) = Nullop;
2679 SvREFCNT_dec(CvGV(cv));
2681 SvREFCNT_dec(CvOUTSIDE(cv));
2682 CvOUTSIDE(cv) = Nullcv;
2683 if (CvPADLIST(cv)) {
2684 I32 i = AvFILL(CvPADLIST(cv));
2686 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
2690 SvREFCNT_dec((SV*)CvPADLIST(cv));
2691 CvPADLIST(cv) = Nullav;
2701 AV* protopadlist = CvPADLIST(proto);
2702 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
2703 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
2704 SV** svp = AvARRAY(protopad);
2713 cv = compcv = (CV*)NEWSV(1104,0);
2714 sv_upgrade((SV *)cv, SVt_PVCV);
2715 SvFLAGS(cv) |= SVpcv_CLONED;
2717 CvFILEGV(cv) = CvFILEGV(proto);
2718 CvGV(cv) = SvREFCNT_inc(CvGV(proto));
2719 CvSTASH(cv) = CvSTASH(proto);
2720 CvROOT(cv) = CvROOT(proto);
2721 CvSTART(cv) = CvSTART(proto);
2722 if (CvOUTSIDE(proto))
2723 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc((SV*)CvOUTSIDE(proto));
2727 comppadlist = newAV();
2728 AvREAL_off(comppadlist);
2729 av_store(comppadlist, 0, SvREFCNT_inc((SV*)protopad_name));
2730 av_store(comppadlist, 1, (SV*)comppad);
2731 CvPADLIST(cv) = comppadlist;
2732 av_extend(comppad, AvFILL(protopad));
2733 curpad = AvARRAY(comppad);
2735 av = newAV(); /* will be @_ */
2737 av_store(comppad, 0, (SV*)av);
2738 AvFLAGS(av) = AVf_REIFY;
2740 svp = AvARRAY(protopad_name);
2741 for ( ix = AvFILL(protopad); ix > 0; ix--) {
2743 if (svp[ix] != &sv_undef) {
2744 char *name = SvPVX(svp[ix]); /* XXX */
2745 if (SvFLAGS(svp[ix]) & SVf_FAKE) { /* lexical from outside? */
2746 I32 off = pad_findlex(name,ix,curcop->cop_seq, CvOUTSIDE(proto),
2749 croak("panic: cv_clone: %s", name);
2751 else { /* our own lexical */
2753 av_store(comppad, ix, sv = (SV*)newAV());
2754 else if (*name == '%')
2755 av_store(comppad, ix, sv = (SV*)newHV());
2757 av_store(comppad, ix, sv = NEWSV(0,0));
2762 av_store(comppad, ix, sv = NEWSV(0,0));
2772 newSUB(floor,op,proto,block)
2779 char *name = op ? SvPVx(cSVOP->op_sv, na) : "__ANON__";
2780 GV* gv = gv_fetchpv(name, GV_ADDMULTI, SVt_PVCV);
2787 if (cv = GvCV(gv)) {
2789 cv = 0; /* just a cached method */
2790 else if (CvROOT(cv) || CvXSUB(cv) || GvFLAGS(gv) & GVf_IMPORTED) {
2791 if (dowarn) { /* already defined (or promised)? */
2792 line_t oldline = curcop->cop_line;
2794 curcop->cop_line = copline;
2795 warn("Subroutine %s redefined",name);
2796 curcop->cop_line = oldline;
2802 if (cv) { /* must reuse cv if autoloaded */
2804 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
2805 CvOUTSIDE(compcv) = 0;
2806 CvPADLIST(cv) = CvPADLIST(compcv);
2807 CvPADLIST(compcv) = 0;
2808 if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */
2809 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv);
2810 SvREFCNT_dec(compcv);
2817 CvFILEGV(cv) = curcop->cop_filegv;
2818 CvGV(cv) = SvREFCNT_inc(gv);
2819 CvSTASH(cv) = curstash;
2822 char *p = SvPVx(((SVOP*)proto)->op_sv, na);
2823 if (SvPOK(cv) && strNE(SvPV((SV*)cv,na), p))
2824 warn("Prototype mismatch: (%s) vs (%s)", SvPV((SV*)cv, na), p);
2825 sv_setpv((SV*)cv, p);
2841 av = newAV(); /* Will be @_ */
2843 av_store(comppad, 0, (SV*)av);
2844 AvFLAGS(av) = AVf_REIFY;
2846 for (ix = AvFILL(comppad); ix > 0; ix--) {
2847 if (!SvPADMY(curpad[ix]))
2848 SvPADTMP_on(curpad[ix]);
2851 if (AvFILL(comppad_name) < AvFILL(comppad))
2852 av_store(comppad_name, AvFILL(comppad), Nullsv);
2854 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
2855 CvSTART(cv) = LINKLIST(CvROOT(cv));
2856 CvROOT(cv)->op_next = 0;
2858 if (s = strrchr(name,':'))
2862 if (strEQ(s, "BEGIN") && !error_count) {
2863 line_t oldline = compiling.cop_line;
2867 SAVESPTR(compiling.cop_filegv);
2871 av_push(beginav, (SV *)cv);
2872 DEBUG_x( dump_sub(gv) );
2873 rs = SvREFCNT_inc(nrs);
2878 curcop = &compiling;
2879 curcop->cop_line = oldline; /* might have recursed to yylex */
2882 else if (strEQ(s, "END") && !error_count) {
2885 av_unshift(endav, 1);
2886 av_store(endav, 0, SvREFCNT_inc(cv));
2888 if (perldb && curstash != debstash) {
2890 SV *tmpstr = sv_newmortal();
2892 sprintf(buf,"%s:%ld",SvPVX(GvSV(curcop->cop_filegv)), (long)subline);
2893 sv = newSVpv(buf,0);
2895 sprintf(buf,"%ld",(long)curcop->cop_line);
2897 gv_efullname(tmpstr,gv);
2898 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
2904 GvCV(gv) = 0; /* Will remember in SVOP instead. */
2905 SvFLAGS(cv) |= SVpcv_ANON;
2912 newXSUB(name, ix, subaddr, filename)
2918 CV* cv = newXS(name, (void(*)())subaddr, filename);
2919 CvOLDSTYLE(cv) = TRUE;
2920 CvXSUBANY(cv).any_i32 = ix;
2926 newXS(name, subaddr, filename)
2928 void (*subaddr) _((CV*));
2932 GV *gv = gv_fetchpv((name ? name : "__ANON__"), GV_ADDMULTI, SVt_PVCV);
2937 if (cv = GvCV(gv)) {
2939 cv = 0; /* just a cached method */
2940 else if (CvROOT(cv) || CvXSUB(cv)) { /* already defined? */
2942 line_t oldline = curcop->cop_line;
2944 curcop->cop_line = copline;
2945 warn("Subroutine %s redefined",name);
2946 curcop->cop_line = oldline;
2952 if (cv) { /* must reuse cv if autoloaded */
2953 assert(SvREFCNT(CvGV(cv)) > 1);
2954 SvREFCNT_dec(CvGV(cv));
2957 cv = (CV*)NEWSV(1105,0);
2958 sv_upgrade((SV *)cv, SVt_PVCV);
2961 CvGV(cv) = SvREFCNT_inc(gv);
2963 CvFILEGV(cv) = gv_fetchfile(filename);
2964 CvXSUB(cv) = subaddr;
2967 else if (s = strrchr(name,':'))
2971 if (strEQ(s, "BEGIN")) {
2974 av_push(beginav, SvREFCNT_inc(gv));
2976 else if (strEQ(s, "END")) {
2979 av_unshift(endav, 1);
2980 av_store(endav, 0, SvREFCNT_inc(gv));
2983 GvCV(gv) = 0; /* Will remember elsewhere instead. */
2984 SvFLAGS(cv) |= SVpcv_ANON;
2990 newFORM(floor,op,block)
3001 name = SvPVx(cSVOP->op_sv, na);
3004 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3006 if (cv = GvFORM(gv)) {
3008 line_t oldline = curcop->cop_line;
3010 curcop->cop_line = copline;
3011 warn("Format %s redefined",name);
3012 curcop->cop_line = oldline;
3018 CvGV(cv) = SvREFCNT_inc(gv);
3019 CvFILEGV(cv) = curcop->cop_filegv;
3021 for (ix = AvFILL(comppad); ix > 0; ix--) {
3022 if (!SvPADMY(curpad[ix]))
3023 SvPADTMP_on(curpad[ix]);
3026 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3027 CvSTART(cv) = LINKLIST(CvROOT(cv));
3028 CvROOT(cv)->op_next = 0;
3040 return newUNOP(OP_REFGEN, 0,
3041 mod(list(convert(OP_ANONLIST, 0, op)), OP_REFGEN));
3048 return newUNOP(OP_REFGEN, 0,
3049 mod(list(convert(OP_ANONHASH, 0, op)), OP_REFGEN));
3053 newANONSUB(floor, proto, block)
3058 return newUNOP(OP_REFGEN, 0,
3059 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3066 switch (o->op_type) {
3068 o->op_type = OP_PADAV;
3069 o->op_ppaddr = ppaddr[OP_PADAV];
3070 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
3073 o->op_type = OP_RV2AV;
3074 o->op_ppaddr = ppaddr[OP_RV2AV];
3079 warn("oops: oopsAV");
3089 switch (o->op_type) {
3092 o->op_type = OP_PADHV;
3093 o->op_ppaddr = ppaddr[OP_PADHV];
3094 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
3098 o->op_type = OP_RV2HV;
3099 o->op_ppaddr = ppaddr[OP_RV2HV];
3104 warn("oops: oopsHV");
3114 if (o->op_type == OP_PADANY) {
3115 o->op_type = OP_PADAV;
3116 o->op_ppaddr = ppaddr[OP_PADAV];
3119 return newUNOP(OP_RV2AV, 0, scalar(o));
3127 if (type == OP_MAPSTART)
3128 return newUNOP(OP_NULL, 0, o);
3129 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3136 if (o->op_type == OP_PADANY) {
3137 o->op_type = OP_PADHV;
3138 o->op_ppaddr = ppaddr[OP_PADHV];
3141 return newUNOP(OP_RV2HV, 0, scalar(o));
3148 croak("NOT IMPL LINE %d",__LINE__);
3158 return newUNOP(OP_RV2CV, flags, scalar(o));
3165 if (o->op_type == OP_PADANY) {
3166 o->op_type = OP_PADSV;
3167 o->op_ppaddr = ppaddr[OP_PADSV];
3170 return newUNOP(OP_RV2SV, 0, scalar(o));
3173 /* Check routines. */
3179 if (cUNOP->op_first->op_type == OP_CONCAT)
3180 op->op_flags |= OPf_STACKED;
3188 if (op->op_flags & OPf_KIDS) {
3191 op = modkids(ck_fun(op), op->op_type);
3192 kid = cUNOP->op_first;
3193 newop = kUNOP->op_first->op_sibling;
3195 (newop->op_sibling ||
3196 !(opargs[newop->op_type] & OA_RETSCALAR) ||
3197 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
3198 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
3202 op_free(kUNOP->op_first);
3203 kUNOP->op_first = newop;
3205 op->op_ppaddr = ppaddr[++op->op_type];
3214 if (op->op_flags & OPf_KIDS) {
3215 OP *kid = cUNOP->op_first;
3216 if (kid->op_type != OP_HELEM)
3217 croak("%s argument is not a HASH element", op_desc[op->op_type]);
3227 I32 type = op->op_type;
3229 if (op->op_flags & OPf_KIDS) {
3230 if (cLISTOP->op_first->op_type == OP_STUB) {
3232 op = newUNOP(type, OPf_SPECIAL,
3233 newGVOP(OP_GV, 0, gv_fetchpv("main'ARGV", TRUE, SVt_PVAV)));
3244 hints |= HINT_BLOCK_SCOPE;
3245 if (op->op_flags & OPf_KIDS) {
3246 SVOP *kid = (SVOP*)cUNOP->op_first;
3249 op->op_flags &= ~OPf_KIDS;
3252 else if (kid->op_type == OP_LINESEQ) {
3255 kid->op_next = op->op_next;
3256 cUNOP->op_first = 0;
3259 Newz(1101, enter, 1, LOGOP);
3260 enter->op_type = OP_ENTERTRY;
3261 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
3262 enter->op_private = 0;
3264 /* establish postfix order */
3265 enter->op_next = (OP*)enter;
3267 op = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
3268 op->op_type = OP_LEAVETRY;
3269 op->op_ppaddr = ppaddr[OP_LEAVETRY];
3270 enter->op_other = op;
3276 op = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3278 op->op_targ = (PADOFFSET)hints;
3287 if (op->op_flags & OPf_STACKED) {
3289 kid = cUNOP->op_first->op_sibling;
3290 if (kid->op_type == OP_RV2GV)
3302 o = fold_constants(o);
3303 if (o->op_type == OP_CONST)
3312 SVOP *kid = (SVOP*)cUNOP->op_first;
3314 op->op_private |= (hints & HINT_STRICT_REFS);
3315 if (kid->op_type == OP_CONST) {
3316 int iscv = (op->op_type==OP_RV2CV)*2;
3318 kid->op_type = OP_GV;
3319 for (gv = 0; !gv; iscv++) {
3321 * This is a little tricky. We only want to add the symbol if we
3322 * didn't add it in the lexer. Otherwise we get duplicate strict
3323 * warnings. But if we didn't add it in the lexer, we must at
3324 * least pretend like we wanted to add it even if it existed before,
3325 * or we get possible typo warnings. OPpCONST_ENTERED says
3326 * whether the lexer already added THIS instance of this symbol.
3328 gv = gv_fetchpv(SvPVx(kid->op_sv, na),
3329 iscv | !(kid->op_private & OPpCONST_ENTERED),
3332 : op->op_type == OP_RV2SV
3334 : op->op_type == OP_RV2AV
3336 : op->op_type == OP_RV2HV
3340 SvREFCNT_dec(kid->op_sv);
3341 kid->op_sv = SvREFCNT_inc(gv);
3357 I32 type = op->op_type;
3359 if (op->op_flags & OPf_REF)
3362 if (op->op_flags & OPf_KIDS) {
3363 SVOP *kid = (SVOP*)cUNOP->op_first;
3365 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3366 OP *newop = newGVOP(type, OPf_REF,
3367 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO));
3374 if (type == OP_FTTTY)
3375 return newGVOP(type, OPf_REF, gv_fetchpv("main'STDIN", TRUE,
3378 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3391 int type = op->op_type;
3392 register I32 oa = opargs[type] >> OASHIFT;
3394 if (op->op_flags & OPf_STACKED) {
3395 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
3398 return no_fh_allowed(op);
3401 if (op->op_flags & OPf_KIDS) {
3402 tokid = &cLISTOP->op_first;
3403 kid = cLISTOP->op_first;
3404 if (kid->op_type == OP_PUSHMARK ||
3405 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
3407 tokid = &kid->op_sibling;
3408 kid = kid->op_sibling;
3410 if (!kid && opargs[type] & OA_DEFGV)
3411 *tokid = kid = newSVREF(newGVOP(OP_GV, 0, defgv));
3415 sibl = kid->op_sibling;
3429 if (kid->op_type == OP_CONST &&
3430 (kid->op_private & OPpCONST_BARE)) {
3431 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
3432 OP *newop = newAVREF(newGVOP(OP_GV, 0,
3433 gv_fetchpv(name, TRUE, SVt_PVAV) ));
3435 warn("Array @%s missing the @ in argument %d of %s()",
3436 name, numargs, op_desc[type]);
3439 kid->op_sibling = sibl;
3442 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
3443 bad_type(numargs, "array", op_desc[op->op_type], kid);
3447 if (kid->op_type == OP_CONST &&
3448 (kid->op_private & OPpCONST_BARE)) {
3449 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
3450 OP *newop = newHVREF(newGVOP(OP_GV, 0,
3451 gv_fetchpv(name, TRUE, SVt_PVHV) ));
3453 warn("Hash %%%s missing the %% in argument %d of %s()",
3454 name, numargs, op_desc[type]);
3457 kid->op_sibling = sibl;
3460 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
3461 bad_type(numargs, "hash", op_desc[op->op_type], kid);
3466 OP *newop = newUNOP(OP_NULL, 0, kid);
3467 kid->op_sibling = 0;
3469 newop->op_next = newop;
3471 kid->op_sibling = sibl;
3476 if (kid->op_type != OP_GV) {
3477 if (kid->op_type == OP_CONST &&
3478 (kid->op_private & OPpCONST_BARE)) {
3479 OP *newop = newGVOP(OP_GV, 0,
3480 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE,
3486 kid->op_sibling = 0;
3487 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
3489 kid->op_sibling = sibl;
3495 mod(scalar(kid), type);
3499 tokid = &kid->op_sibling;
3500 kid = kid->op_sibling;
3502 op->op_private |= numargs;
3504 return too_many_arguments(op,op_desc[op->op_type]);
3507 else if (opargs[type] & OA_DEFGV) {
3509 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
3513 while (oa & OA_OPTIONAL)
3515 if (oa && oa != OA_LIST)
3516 return too_few_arguments(op,op_desc[op->op_type]);
3525 GV *gv = newGVgen("main");
3527 append_elem(OP_GLOB, op, newGVOP(OP_GV, 0, gv));
3538 OPCODE type = op->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
3540 op->op_ppaddr = ppaddr[OP_GREPSTART];
3541 Newz(1101, gwop, 1, LOGOP);
3543 if (op->op_flags & OPf_STACKED) {
3546 kid = cLISTOP->op_first->op_sibling;
3547 for (k = cLISTOP->op_first->op_sibling->op_next; k; k = k->op_next) {
3550 kid->op_next = (OP*)gwop;
3551 op->op_flags &= ~OPf_STACKED;
3553 kid = cLISTOP->op_first->op_sibling;
3554 if (type == OP_MAPWHILE)
3561 kid = cLISTOP->op_first->op_sibling;
3562 if (kid->op_type != OP_NULL)
3563 croak("panic: ck_grep");
3564 kid = kUNOP->op_first;
3566 gwop->op_type = type;
3567 gwop->op_ppaddr = ppaddr[type];
3568 gwop->op_first = listkids(op);
3569 gwop->op_flags |= OPf_KIDS;
3570 gwop->op_private = 1;
3571 gwop->op_other = LINKLIST(kid);
3572 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
3573 kid->op_next = (OP*)gwop;
3575 kid = cLISTOP->op_first->op_sibling;
3576 if (!kid || !kid->op_sibling)
3577 return too_few_arguments(op,op_desc[op->op_type]);
3578 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
3579 mod(kid, OP_GREPSTART);
3588 if (op->op_flags & OPf_KIDS) {
3589 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3590 if (kid && kid->op_type == OP_CONST)
3591 fbm_compile(((SVOP*)kid)->op_sv, 0);
3600 /* XXX length optimization goes here */
3608 return modkids(ck_fun(op), op->op_type);
3615 return refkids(ck_fun(op), op->op_type);
3624 kid = cLISTOP->op_first;
3626 op = force_list(op);
3627 kid = cLISTOP->op_first;
3629 if (kid->op_type == OP_PUSHMARK)
3630 kid = kid->op_sibling;
3631 if (kid && op->op_flags & OPf_STACKED)
3632 kid = kid->op_sibling;
3633 else if (kid && !kid->op_sibling) { /* print HANDLE; */
3634 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
3635 op->op_flags |= OPf_STACKED; /* make it a filehandle */
3636 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
3637 cLISTOP->op_first->op_sibling = kid;
3638 cLISTOP->op_last = kid;
3639 kid = kid->op_sibling;
3644 append_elem(op->op_type, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
3646 return listkids(op);
3653 cPMOP->op_pmflags |= PMf_RUNTIME;
3654 cPMOP->op_pmpermflags |= PMf_RUNTIME;
3669 if (cBINOP->op_first->op_flags & OPf_PARENS) {
3670 op->op_private |= OPpREPEAT_DOLIST;
3671 cBINOP->op_first = force_list(cBINOP->op_first);
3682 if (op->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
3683 SVOP *kid = (SVOP*)cUNOP->op_first;
3685 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3687 for (s = SvPVX(kid->op_sv); *s; s++) {
3688 if (*s == ':' && s[1] == ':') {
3690 Move(s+2, s+1, strlen(s+2)+1, char);
3691 --SvCUR(kid->op_sv);
3694 sv_catpvn(kid->op_sv, ".pm", 3);
3704 croak("NOT IMPL LINE %d",__LINE__);
3714 if (op->op_flags & OPf_KIDS) {
3715 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3716 if (kid && kid->op_sibling) {
3717 op->op_type = OP_SSELECT;
3718 op->op_ppaddr = ppaddr[OP_SSELECT];
3720 return fold_constants(op);
3724 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3725 if (kid && kid->op_type == OP_RV2GV)
3726 kid->op_private &= ~HINT_STRICT_REFS;
3734 I32 type = op->op_type;
3736 if (!(op->op_flags & OPf_KIDS)) {
3738 return newUNOP(type, 0,
3739 scalar(newUNOP(OP_RV2AV, 0,
3740 scalar(newGVOP(OP_GV, 0,
3741 gv_fetchpv((subline ? "_" : "ARGV"), TRUE, SVt_PVAV) )))));
3743 return scalar(modkids(ck_fun(op), type));
3750 if (op->op_flags & OPf_STACKED) {
3751 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3753 kid = kUNOP->op_first; /* get past rv2gv */
3755 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
3757 if (kid->op_type == OP_SCOPE) {
3761 else if (kid->op_type == OP_LEAVE) {
3762 if (op->op_type == OP_SORT) {
3763 null(kid); /* wipe out leave */
3766 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
3767 if (k->op_next == kid)
3772 kid->op_next = 0; /* just disconnect the leave */
3773 k = kLISTOP->op_first;
3777 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3778 null(kid); /* wipe out rv2gv */
3779 if (op->op_type == OP_SORT)
3783 op->op_flags |= OPf_SPECIAL;
3796 if (op->op_flags & OPf_STACKED)
3797 return no_fh_allowed(op);
3799 kid = cLISTOP->op_first;
3800 if (kid->op_type != OP_NULL)
3801 croak("panic: ck_split");
3802 kid = kid->op_sibling;
3803 op_free(cLISTOP->op_first);
3804 cLISTOP->op_first = kid;
3806 cLISTOP->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
3807 cLISTOP->op_last = kid; /* There was only one element previously */
3810 if (kid->op_type != OP_MATCH) {
3811 OP *sibl = kid->op_sibling;
3812 kid->op_sibling = 0;
3813 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
3814 if (cLISTOP->op_first == cLISTOP->op_last)
3815 cLISTOP->op_last = kid;
3816 cLISTOP->op_first = kid;
3817 kid->op_sibling = sibl;
3820 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
3821 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
3825 kid->op_type = OP_PUSHRE;
3826 kid->op_ppaddr = ppaddr[OP_PUSHRE];
3829 if (!kid->op_sibling)
3830 append_elem(OP_SPLIT, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
3832 kid = kid->op_sibling;
3835 if (!kid->op_sibling)
3836 append_elem(OP_SPLIT, op, newSVOP(OP_CONST, 0, newSViv(0)));
3838 kid = kid->op_sibling;
3841 if (kid->op_sibling)
3842 return too_many_arguments(op,op_desc[op->op_type]);
3851 OP *prev = ((cUNOP->op_first->op_sibling)
3852 ? cUNOP : ((UNOP*)cUNOP->op_first))->op_first;
3853 OP *o = prev->op_sibling;
3860 for (cvop = o; cvop->op_sibling; cvop = cvop->op_sibling) ;
3861 if (cvop->op_type == OP_RV2CV) {
3863 op->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
3864 null(cvop); /* disable rv2cv */
3865 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
3866 if (tmpop->op_type == OP_GV) {
3867 cv = GvCV(tmpop->op_sv);
3868 if (cv && SvPOK(cv) && !(op->op_private & OPpENTERSUB_AMPER))
3869 proto = SvPV((SV*)cv,na);
3872 op->op_private |= (hints & HINT_STRICT_REFS);
3873 if (perldb && curstash != debstash)
3874 op->op_private |= OPpENTERSUB_DB;
3879 return too_many_arguments(op, CvNAME(cv));
3897 if (o->op_type != OP_REFGEN && o->op_type != OP_UNDEF)
3898 bad_type(arg, "block", CvNAME(cv), o);
3903 if (o->op_type == OP_RV2GV)
3907 o = newUNOP(OP_RV2GV, 0, kid);
3908 o->op_sibling = kid->op_sibling;
3909 kid->op_sibling = 0;
3910 prev->op_sibling = o;
3918 if (o->op_type != OP_RV2GV)
3919 bad_type(arg, "symbol", CvNAME(cv), o);
3922 if (o->op_type != OP_RV2CV)
3923 bad_type(arg, "sub", CvNAME(cv), o);
3926 if (o->op_type != OP_RV2SV && o->op_type != OP_PADSV)
3927 bad_type(arg, "scalar", CvNAME(cv), o);
3930 if (o->op_type != OP_RV2AV && o->op_type != OP_PADAV)
3931 bad_type(arg, "array", CvNAME(cv), o);
3934 if (o->op_type != OP_RV2HV && o->op_type != OP_PADHV)
3935 bad_type(arg, "hash", CvNAME(cv), o);
3939 o = newUNOP(OP_REFGEN, 0, kid);
3940 o->op_sibling = kid->op_sibling;
3941 kid->op_sibling = 0;
3942 prev->op_sibling = o;
3950 croak("Malformed prototype for %s: %s",
3951 CvNAME(cv),SvPV((SV*)cv,na));
3956 mod(o, OP_ENTERSUB);
3960 if (proto && !optional && *proto == '$')
3961 return too_few_arguments(op, CvNAME(cv));
3969 SvREADONLY_on(cSVOP->op_sv);
3977 if (op->op_flags & OPf_KIDS) {
3978 SVOP *kid = (SVOP*)cUNOP->op_first;
3980 if (kid->op_type == OP_NULL)
3981 kid = (SVOP*)kid->op_sibling;
3983 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
3984 op->op_flags |= OPf_SPECIAL;
3989 /* A peephole optimizer. We visit the ops in the order they're to execute. */
3995 register OP* oldop = 0;
3996 if (!o || o->op_seq)
4001 for (; o; o = o->op_next) {
4007 switch (o->op_type) {
4010 curcop = ((COP*)o); /* for warnings */
4011 o->op_seq = op_seqmax++;
4022 if (o->op_next->op_type == OP_STRINGIFY)
4024 o->op_seq = op_seqmax++;
4027 if ((o->op_flags & (OPf_KNOW|OPf_LIST)) != (OPf_KNOW|OPf_LIST)) {
4028 o->op_seq = op_seqmax++;
4029 break; /* Scalar stub must produce undef. List stub is noop */
4033 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
4034 curcop = ((COP*)op);
4040 if (oldop && o->op_next) {
4041 oldop->op_next = o->op_next;
4044 o->op_seq = op_seqmax++;
4048 if (o->op_next->op_type == OP_RV2SV) {
4049 if (!(o->op_next->op_private & (OPpDEREF_HV|OPpDEREF_AV))) {
4051 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
4052 o->op_next = o->op_next->op_next;
4053 o->op_type = OP_GVSV;
4054 o->op_ppaddr = ppaddr[OP_GVSV];
4057 else if (o->op_next->op_type == OP_RV2AV) {
4058 OP* pop = o->op_next->op_next;
4060 if (pop->op_type == OP_CONST &&
4061 (op = pop->op_next) &&
4062 pop->op_next->op_type == OP_AELEM &&
4063 !(pop->op_next->op_private &
4064 (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)) &&
4065 (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase)
4069 SvREFCNT_dec(((SVOP*)pop)->op_sv);
4073 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
4074 o->op_next = pop->op_next->op_next;
4075 o->op_type = OP_AELEMFAST;
4076 o->op_ppaddr = ppaddr[OP_AELEMFAST];
4077 o->op_private = (U8)i;
4078 GvAVn((GV*)(((SVOP*)o)->op_sv));
4081 o->op_seq = op_seqmax++;
4088 o->op_seq = op_seqmax++;
4089 peep(cLOGOP->op_other);
4093 o->op_seq = op_seqmax++;
4094 peep(cCONDOP->op_true);
4095 peep(cCONDOP->op_false);
4099 o->op_seq = op_seqmax++;
4100 peep(cLOOP->op_redoop);
4101 peep(cLOOP->op_nextop);
4102 peep(cLOOP->op_lastop);
4107 o->op_seq = op_seqmax++;
4108 peep(cPMOP->op_pmreplstart);
4112 o->op_seq = op_seqmax++;
4113 if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
4114 if (o->op_next->op_sibling &&
4115 o->op_next->op_sibling->op_type != OP_DIE) {
4116 line_t oldline = curcop->cop_line;
4118 curcop->cop_line = ((COP*)o->op_next)->cop_line;
4119 warn("Statement unlikely to be reached");
4120 warn("(Maybe you meant system() when you said exec()?)\n");
4121 curcop->cop_line = oldline;
4126 o->op_seq = op_seqmax++;