1 /* $RCSfile: cmd.h,v $$Revision: 4.1 $$Date: 92/08/07 17:19:19 $
3 * Copyright (c) 1991, 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.
14 /* Lowest byte of opargs */
16 #define OA_FOLDCONST 2
17 #define OA_RETSCALAR 4
19 #define OA_RETINTEGER 16
20 #define OA_OTHERINT 32
21 #define OA_DANGEROUS 64
23 /* Remaining nybbles of opargs */
30 #define OA_SCALARREF 7
48 sprintf(tokenbuf,"Missing comma after first argument to %s function",
49 op_name[op->op_type]);
58 sprintf(tokenbuf,"Not enough arguments for %s", op_name[op->op_type]);
64 too_many_arguments(op)
67 sprintf(tokenbuf,"Too many arguments for %s", op_name[op->op_type]);
73 bad_type(n, t, op, kid)
79 sprintf(tokenbuf, "Type of arg %d to %s must be %s (not %s)",
80 n, op_name[op->op_type], t, op_name[kid->op_type]);
85 /* "register" allocation */
91 PADOFFSET off = pad_alloc(OP_PADSV, SVs_PADMY);
93 sv_upgrade(sv, SVt_PVNV);
95 av_store(comppad_name, off, sv);
96 SvNVX(sv) = (double)cop_seqmax;
97 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
98 if (!min_intro_pending)
99 min_intro_pending = off;
100 max_intro_pending = off;
102 av_store(comppad, off, (SV*)newAV());
103 else if (*name == '%')
104 av_store(comppad, off, (SV*)newHV());
105 SvPADMY_on(curpad[off]);
115 SV **svp = AvARRAY(comppad_name);
117 register CONTEXT *cx;
122 I32 seq = cop_seqmax;
124 /* The one we're looking for is probably just before comppad_name_fill. */
125 for (off = comppad_name_fill; off > 0; off--) {
126 if ((sv = svp[off]) &&
128 seq > (I32)SvNVX(sv) &&
129 strEQ(SvPVX(sv), name))
131 return (PADOFFSET)off;
135 /* Nothing in current lexical context--try eval's context, if any.
136 * This is necessary to let the perldb get at lexically scoped variables.
137 * XXX This will also probably interact badly with eval tree caching.
141 for (i = cxstack_ix; i >= 0; i--) {
143 switch (cx->cx_type) {
153 if (debstash && CvSTASH(cv) == debstash) /* ignore DB'* scope */
155 seq = cxstack[i+1].blk_oldcop->cop_seq;
156 curlist = CvPADLIST(cv);
157 curname = (AV*)*av_fetch(curlist, 0, FALSE);
158 svp = AvARRAY(curname);
159 for (off = AvFILL(curname); off > 0; off--) {
160 if ((sv = svp[off]) &&
162 seq > (I32)SvNVX(sv) &&
163 strEQ(SvPVX(sv), name))
165 PADOFFSET newoff = pad_alloc(OP_PADSV, SVs_PADMY);
166 AV *oldpad = (AV*)*av_fetch(curlist, CvDEPTH(cv), FALSE);
167 SV *oldsv = *av_fetch(oldpad, off, TRUE);
169 sv_upgrade(sv, SVt_PVNV);
171 av_store(comppad_name, newoff, sv);
172 SvNVX(sv) = (double)curcop->cop_seq;
173 SvIVX(sv) = 999999999; /* A ref, intro immediately */
174 av_store(comppad, newoff, SvREFCNT_inc(oldsv));
190 SV **svp = AvARRAY(comppad_name);
192 if (min_intro_pending && fill < min_intro_pending) {
193 for (off = max_intro_pending; off >= min_intro_pending; off--) {
195 warn("%s never introduced", SvPVX(sv));
198 /* "Deintroduce" my variables that are leaving with this scope. */
199 for (off = AvFILL(comppad_name); off > fill; off--) {
201 SvIVX(sv) = cop_seqmax;
206 pad_alloc(optype,tmptype)
213 if (AvARRAY(comppad) != curpad)
214 croak("panic: pad_alloc");
215 if (tmptype & SVs_PADMY) {
217 sv = *av_fetch(comppad, AvFILL(comppad) + 1, TRUE);
218 } while (SvPADBUSY(sv)); /* need a fresh one */
219 retval = AvFILL(comppad);
223 sv = *av_fetch(comppad, ++padix, TRUE);
224 } while (SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY));
227 SvFLAGS(sv) |= tmptype;
228 curpad = AvARRAY(comppad);
229 DEBUG_X(fprintf(stderr, "Pad alloc %d for %s\n", retval, op_name[optype]));
230 return (PADOFFSET)retval;
239 #endif /* STANDARD_C */
242 croak("panic: pad_sv po");
243 DEBUG_X(fprintf(stderr, "Pad sv %d\n", po));
244 return curpad[po]; /* eventually we'll turn this into a macro */
252 pad_free(PADOFFSET po)
253 #endif /* STANDARD_C */
255 if (AvARRAY(comppad) != curpad)
256 croak("panic: pad_free curpad");
258 croak("panic: pad_free po");
259 DEBUG_X(fprintf(stderr, "Pad free %d\n", po));
261 SvPADTMP_off(curpad[po]);
271 pad_swipe(PADOFFSET po)
272 #endif /* STANDARD_C */
274 if (AvARRAY(comppad) != curpad)
275 croak("panic: pad_swipe curpad");
277 croak("panic: pad_swipe po");
278 DEBUG_X(fprintf(stderr, "Pad swipe %d\n", po));
279 curpad[po] = NEWSV(0,0);
280 SvPADTMP_off(curpad[po]);
290 if (AvARRAY(comppad) != curpad)
291 croak("panic: pad_reset curpad");
292 DEBUG_X(fprintf(stderr, "Pad reset\n"));
293 for (po = AvMAX(comppad); po > 0; po--) {
295 SvPADTMP_off(curpad[po]);
311 if (op->op_flags & OPf_KIDS) {
312 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling)
317 switch (op->op_type) {
319 op->op_targ = 0; /* Was holding old type, if any. */
323 SvREFCNT_dec((SV*)cGVOP->op_gv);
327 SvREFCNT_dec(cCOP->cop_filegv);
330 SvREFCNT_dec(cSVOP->op_sv);
335 pad_free(op->op_targ);
344 if (op->op_type != OP_NULL && op->op_targ > 0)
345 pad_free(op->op_targ);
346 op->op_targ = op->op_type;
347 op->op_type = OP_NULL;
348 op->op_ppaddr = ppaddr[OP_NULL];
355 OP* kid = cLISTOP->op_first;
356 assert(kid->op_type == OP_PUSHMARK);
357 cLISTOP->op_first = kid->op_sibling;
362 /* Contextualizers */
364 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
375 /* establish postfix order */
376 if (cUNOP->op_first) {
377 op->op_next = LINKLIST(cUNOP->op_first);
378 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling) {
380 kid->op_next = LINKLIST(kid->op_sibling);
396 if (op && op->op_flags & OPf_KIDS) {
397 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
408 op->op_type == OP_SASSIGN && cBINOP->op_first->op_type == OP_CONST)
409 warn("Found = in conditional, should be ==");
419 if (!op || (op->op_flags & OPf_KNOW)) /* assumes no premature commitment */
422 op->op_flags &= ~OPf_LIST;
423 op->op_flags |= OPf_KNOW;
425 switch (op->op_type) {
427 scalar(cBINOP->op_first);
432 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
439 if (op->op_flags & OPf_KIDS) {
440 for (kid = cUNOP->op_first; kid; kid = kid->op_sibling)
449 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
471 if (op->op_flags & OPf_LIST)
474 op->op_flags |= OPf_KNOW;
476 switch (op->op_type) {
478 if (!(opargs[op->op_type] & OA_FOLDCONST))
480 if (op->op_flags & OPf_STACKED)
553 if (!(op->op_flags & OPf_INTRO))
554 useless = op_name[op->op_type];
561 if (!(op->op_flags & OPf_INTRO))
562 useless = "a variable";
567 curcop = ((COP*)op); /* for warning above */
573 useless = "a constant";
574 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
576 else if (SvPOK(sv)) {
577 if (strnEQ(SvPVX(sv), "di", 2) ||
578 strnEQ(SvPVX(sv), "ig", 2))
582 null(op); /* don't execute a constant */
583 SvREFCNT_dec(sv); /* don't even remember it */
587 op->op_type = OP_PREINC; /* pre-increment is faster */
588 op->op_ppaddr = ppaddr[OP_PREINC];
592 op->op_type = OP_PREDEC; /* pre-decrement is faster */
593 op->op_ppaddr = ppaddr[OP_PREDEC];
597 scalarvoid(cBINOP->op_first);
598 useless = op_name[op->op_type];
604 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
611 if (!(op->op_flags & OPf_KIDS))
618 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
622 if (useless && dowarn)
623 warn("Useless use of %s in void context", useless);
632 if (op && op->op_flags & OPf_KIDS) {
633 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
645 if (!op || (op->op_flags & OPf_KNOW)) /* assumes no premature commitment */
648 op->op_flags |= (OPf_KNOW | OPf_LIST);
650 switch (op->op_type) {
653 list(cBINOP->op_first);
658 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
665 if (!(op->op_flags & OPf_KIDS))
667 if (!op->op_next && cUNOP->op_first->op_type == OP_FLOP) {
668 list(cBINOP->op_first);
669 return gen_constant_list(op);
678 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
697 if (op->op_type == OP_LINESEQ ||
698 op->op_type == OP_SCOPE ||
699 op->op_type == OP_LEAVE ||
700 op->op_type == OP_LEAVETRY)
702 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling) {
703 if (kid->op_sibling) {
709 op->op_flags &= ~OPf_PARENS;
711 op->op_flags |= OPf_PARENS;
714 op = newOP(OP_STUB, 0);
724 if (op && op->op_flags & OPf_KIDS) {
725 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
744 switch (op->op_type) {
746 if ((type == OP_UNDEF) && !(op->op_flags & OPf_STACKED)) {
747 op->op_type = OP_RV2CV; /* entersubr => rv2cv */
748 op->op_ppaddr = ppaddr[OP_RV2CV];
749 null(cUNOP->op_first); /* disable pushmark */
754 sprintf(tokenbuf, "Can't modify %s in %s",
755 op_name[op->op_type],
756 type ? op_name[type] : "local");
761 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
768 ref(cUNOP->op_first, op->op_type);
778 if (type == OP_RV2AV || type == OP_RV2HV)
779 op->op_private = type;
780 ref(cUNOP->op_first, op->op_type);
802 pad_free(op->op_targ);
803 op->op_targ = pad_alloc(op->op_type, SVs_PADMY);
804 sv = PAD_SV(op->op_targ);
805 sv_upgrade(sv, SVt_PVLV);
806 sv_magic(sv, 0, op->op_type == OP_VEC ? 'v' : 'x', 0, 0);
807 curpad[op->op_targ] = sv;
810 if (op->op_flags & OPf_KIDS)
811 mod(cBINOP->op_first, type);
815 ref(cBINOP->op_first, op->op_type);
816 if (type == OP_RV2AV || type == OP_RV2HV)
817 op->op_private = type;
823 if (!(op->op_flags & OPf_KIDS))
825 mod(cLISTOP->op_last, type);
829 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
833 op->op_flags |= OPf_LVAL;
835 op->op_flags &= ~OPf_SPECIAL;
836 op->op_flags |= OPf_INTRO;
838 else if (type == OP_AASSIGN || type == OP_SASSIGN)
839 op->op_flags |= OPf_SPECIAL;
849 if (op && op->op_flags & OPf_KIDS) {
850 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
867 switch (op->op_type) {
869 if ((type == OP_REFGEN || type == OP_DEFINED)
870 && !(op->op_flags & (OPf_STACKED|OPf_PARENS))) {
871 op->op_type = OP_RV2CV; /* entersubr => rv2cv */
872 op->op_ppaddr = ppaddr[OP_RV2CV];
873 null(cUNOP->op_first);
878 for (kid = cUNOP->op_first->op_sibling; kid; kid = kid->op_sibling)
882 if (type == OP_RV2AV || type == OP_RV2HV)
883 op->op_private = type;
884 ref(cUNOP->op_first, op->op_type);
889 op->op_flags |= OPf_LVAL;
892 ref(cUNOP->op_first, op->op_type);
897 op->op_flags |= OPf_LVAL;
902 if (!(op->op_flags & OPf_KIDS))
904 ref(cBINOP->op_first, type);
908 ref(cBINOP->op_first, op->op_type);
909 if (type == OP_RV2AV || type == OP_RV2HV || type == OP_REFGEN) {
910 op->op_private = type;
911 op->op_flags |= OPf_LVAL;
919 if (!(op->op_flags & OPf_KIDS))
921 ref(cLISTOP->op_last, type);
940 if (type == OP_LIST) {
941 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
944 else if (type != OP_PADSV &&
949 sprintf(tokenbuf, "Can't declare %s in my", op_name[op->op_type]);
953 op->op_flags |= OPf_LVAL|OPf_INTRO;
962 o->op_flags |= OPf_PARENS;
967 bind_match(type, left, right)
974 if (right->op_type == OP_MATCH ||
975 right->op_type == OP_SUBST ||
976 right->op_type == OP_TRANS) {
977 right->op_flags |= OPf_STACKED;
978 if (right->op_type != OP_MATCH)
979 left = mod(left, right->op_type);
980 if (right->op_type == OP_TRANS)
981 op = newBINOP(OP_NULL, 0, scalar(left), right);
983 op = prepend_elem(right->op_type, scalar(left), right);
985 return newUNOP(OP_NOT, 0, scalar(op));
989 return bind_match(type, left,
990 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
999 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1000 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(op));
1008 if (o->op_flags & OPf_PARENS) {
1009 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1010 o->op_type = OP_LEAVE;
1011 o->op_ppaddr = ppaddr[OP_LEAVE];
1014 if (o->op_type == OP_LINESEQ) {
1016 o->op_type = OP_SCOPE;
1017 o->op_ppaddr = ppaddr[OP_SCOPE];
1018 kid = ((LISTOP*)o)->op_first;
1019 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
1023 o = newUNOP(OP_SCOPE, 0, o);
1030 block_head(o, startp)
1038 o = scope(sawparens(scalarvoid(o)));
1039 curcop = &compiling;
1040 *startp = LINKLIST(o);
1051 if (o->op_flags & OPf_PARENS)
1055 if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') {
1057 for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1058 if (*s == ';' || *s == '=' && (s[1] == '@' || s[2] == '@'))
1059 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1066 return mod(o, OP_NULL); /* a bit kludgey */
1073 if (o->op_type == OP_LIST) {
1074 o = convert(OP_JOIN, 0,
1075 prepend_elem(OP_LIST,
1076 newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE))),
1087 I32 type = o->op_type;
1090 if (opargs[type] & OA_RETSCALAR)
1092 if (opargs[type] & OA_TARGET)
1093 o->op_targ = pad_alloc(type, SVs_PADTMP);
1095 if (!(opargs[type] & OA_FOLDCONST))
1098 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1099 if (curop->op_type != OP_CONST &&
1100 curop->op_type != OP_LIST &&
1101 curop->op_type != OP_SCALAR &&
1102 curop->op_type != OP_PUSHMARK) {
1107 curop = LINKLIST(o);
1111 if (o->op_targ && *stack_sp == PAD_SV(o->op_targ))
1112 pad_swipe(o->op_targ);
1114 if (type == OP_RV2GV)
1115 return newGVOP(OP_GV, 0, *(stack_sp--));
1117 return newSVOP(OP_CONST, 0, *(stack_sp--));
1120 if (!(opargs[type] & OA_OTHERINT))
1122 if (!(o->op_flags & OPf_KIDS))
1125 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1126 if (curop->op_type == OP_CONST) {
1127 if (SvIOK(((SVOP*)curop)->op_sv))
1131 if (opargs[curop->op_type] & OA_RETINTEGER)
1136 o->op_ppaddr = ppaddr[++(o->op_type)];
1141 gen_constant_list(o)
1148 I32 oldtmps_floor = tmps_floor;
1152 tmpmark = stack_sp - stack_base;
1153 anonop = newANONLIST(o);
1154 curop = LINKLIST(anonop);
1155 anonop->op_next = 0;
1158 tmpsp = stack_sp - stack_base;
1159 tmps_floor = oldtmps_floor;
1160 stack_sp = stack_base + tmpmark;
1162 o->op_type = OP_RV2AV;
1163 o->op_ppaddr = ppaddr[OP_RV2AV];
1165 curop = ((UNOP*)o)->op_first;
1166 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, newSVsv(stack_sp[1]));
1168 curop = ((UNOP*)anonop)->op_first;
1169 curop = ((UNOP*)curop)->op_first;
1170 curop->op_sibling = 0;
1178 convert(type, flags, op)
1186 if (!op || op->op_type != OP_LIST)
1187 op = newLISTOP(OP_LIST, 0, op, Nullop);
1189 if (!(opargs[type] & OA_MARK))
1190 null(cLISTOP->op_first);
1193 op->op_ppaddr = ppaddr[type];
1194 op->op_flags |= flags;
1196 op = (*check[type])(op);
1197 if (op->op_type != type)
1200 if (cLISTOP->op_children < 7) {
1201 /* XXX do we really need to do this if we're done appending?? */
1202 for (kid = cLISTOP->op_first; kid; kid = kid->op_sibling)
1204 cLISTOP->op_last = last; /* in case check substituted last arg */
1207 return fold_constants(op);
1210 /* List constructors */
1213 append_elem(type, first, last)
1224 if (first->op_type == type) {
1225 if (first->op_flags & OPf_KIDS)
1226 ((LISTOP*)first)->op_last->op_sibling = last;
1228 first->op_flags |= OPf_KIDS;
1229 ((LISTOP*)first)->op_first = last;
1231 ((LISTOP*)first)->op_last = last;
1232 ((LISTOP*)first)->op_children++;
1236 return newLISTOP(type, 0, first, last);
1240 append_list(type, first, last)
1251 if (first->op_type != type)
1252 return prepend_elem(type, (OP*)first, (OP*)last);
1254 if (last->op_type != type)
1255 return append_elem(type, (OP*)first, (OP*)last);
1257 first->op_last->op_sibling = last->op_first;
1258 first->op_last = last->op_last;
1259 first->op_children += last->op_children;
1260 if (first->op_children)
1261 last->op_flags |= OPf_KIDS;
1268 prepend_elem(type, first, last)
1279 if (last->op_type == type) {
1280 if (type == OP_LIST) { /* already a PUSHMARK there */
1281 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1282 ((LISTOP*)last)->op_first->op_sibling = first;
1285 if (!(last->op_flags & OPf_KIDS)) {
1286 ((LISTOP*)last)->op_last = first;
1287 last->op_flags |= OPf_KIDS;
1289 first->op_sibling = ((LISTOP*)last)->op_first;
1290 ((LISTOP*)last)->op_first = first;
1292 ((LISTOP*)last)->op_children++;
1296 return newLISTOP(type, 0, first, last);
1304 return newOP(OP_STUB, 0);
1311 if (!op || op->op_type != OP_LIST)
1312 op = newLISTOP(OP_LIST, 0, op, Nullop);
1318 newLISTOP(type, flags, first, last)
1326 Newz(1101, listop, 1, LISTOP);
1328 listop->op_type = type;
1329 listop->op_ppaddr = ppaddr[type];
1330 listop->op_children = (first != 0) + (last != 0);
1331 listop->op_flags = flags;
1335 else if (!first && last)
1338 first->op_sibling = last;
1339 listop->op_first = first;
1340 listop->op_last = last;
1341 if (type == OP_LIST) {
1343 pushop = newOP(OP_PUSHMARK, 0);
1344 pushop->op_sibling = first;
1345 listop->op_first = pushop;
1346 listop->op_flags |= OPf_KIDS;
1348 listop->op_last = pushop;
1350 else if (listop->op_children)
1351 listop->op_flags |= OPf_KIDS;
1362 Newz(1101, op, 1, OP);
1364 op->op_ppaddr = ppaddr[type];
1365 op->op_flags = flags;
1368 /* op->op_private = 0; */
1369 if (opargs[type] & OA_RETSCALAR)
1371 if (opargs[type] & OA_TARGET)
1372 op->op_targ = pad_alloc(type, SVs_PADTMP);
1373 return (*check[type])(op);
1377 newUNOP(type, flags, first)
1385 first = newOP(OP_STUB, 0);
1386 if (opargs[type] & OA_MARK)
1387 first = force_list(first);
1388 else if (first->op_type == OP_LIST)
1391 Newz(1101, unop, 1, UNOP);
1392 unop->op_type = type;
1393 unop->op_ppaddr = ppaddr[type];
1394 unop->op_first = first;
1395 unop->op_flags = flags | OPf_KIDS;
1396 unop->op_private = 1;
1398 unop = (UNOP*)(*check[type])((OP*)unop);
1402 return fold_constants(unop);
1406 newBINOP(type, flags, first, last)
1413 Newz(1101, binop, 1, BINOP);
1416 first = newOP(OP_NULL, 0);
1418 binop->op_type = type;
1419 binop->op_ppaddr = ppaddr[type];
1420 binop->op_first = first;
1421 binop->op_flags = flags | OPf_KIDS;
1424 binop->op_private = 1;
1427 binop->op_private = 2;
1428 first->op_sibling = last;
1431 binop = (BINOP*)(*check[type])((OP*)binop);
1435 binop->op_last = last = binop->op_first->op_sibling;
1437 return fold_constants(binop);
1441 pmtrans(op, expr, repl)
1446 PMOP *pm = (PMOP*)op;
1447 SV *tstr = ((SVOP*)expr)->op_sv;
1448 SV *rstr = ((SVOP*)repl)->op_sv;
1451 register char *t = SvPV(tstr, tlen);
1452 register char *r = SvPV(rstr, rlen);
1458 register short *tbl;
1460 tbl = (short*)cPVOP->op_pv;
1461 complement = op->op_private & OPpTRANS_COMPLEMENT;
1462 delete = op->op_private & OPpTRANS_DELETE;
1463 squash = op->op_private & OPpTRANS_SQUASH;
1466 Zero(tbl, 256, short);
1467 for (i = 0; i < tlen; i++)
1468 tbl[t[i] & 0377] = -1;
1469 for (i = 0, j = 0; i < 256; i++) {
1475 tbl[i] = r[j-1] & 0377;
1480 tbl[i] = r[j++] & 0377;
1485 if (!rlen && !delete) {
1488 for (i = 0; i < 256; i++)
1490 for (i = 0, j = 0; i < tlen; i++,j++) {
1493 if (tbl[t[i] & 0377] == -1)
1494 tbl[t[i] & 0377] = -2;
1499 if (tbl[t[i] & 0377] == -1)
1500 tbl[t[i] & 0377] = r[j] & 0377;
1510 newPMOP(type, flags)
1516 Newz(1101, pmop, 1, PMOP);
1517 pmop->op_type = type;
1518 pmop->op_ppaddr = ppaddr[type];
1519 pmop->op_flags = flags;
1520 pmop->op_private = 0;
1522 /* link into pm list */
1523 if (type != OP_TRANS) {
1524 pmop->op_pmnext = HvPMROOT(curstash);
1525 HvPMROOT(curstash) = pmop;
1532 pmruntime(op, expr, repl)
1540 if (op->op_type == OP_TRANS)
1541 return pmtrans(op, expr, repl);
1545 if (expr->op_type == OP_CONST) {
1547 SV *pat = ((SVOP*)expr)->op_sv;
1548 char *p = SvPV(pat, plen);
1549 if ((op->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
1550 sv_setpvn(pat, "\\s+", 3);
1551 p = SvPV(pat, plen);
1552 pm->op_pmflags |= PMf_SKIPWHITE;
1554 scan_prefix(pm, p, plen);
1555 if (pm->op_pmshort && (pm->op_pmflags & PMf_SCANFIRST))
1556 fbm_compile(pm->op_pmshort, pm->op_pmflags & PMf_FOLD);
1557 pm->op_pmregexp = regcomp(p, p + plen, pm->op_pmflags & PMf_FOLD);
1562 if (pm->op_pmflags & PMf_KEEP)
1563 expr = newUNOP(OP_REGCMAYBE,0,expr);
1565 Newz(1101, rcop, 1, LOGOP);
1566 rcop->op_type = OP_REGCOMP;
1567 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
1568 rcop->op_first = scalar(expr);
1569 rcop->op_flags |= OPf_KIDS;
1570 rcop->op_private = 1;
1571 rcop->op_other = op;
1573 /* establish postfix order */
1574 if (pm->op_pmflags & PMf_KEEP) {
1576 rcop->op_next = expr;
1577 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
1580 rcop->op_next = LINKLIST(expr);
1581 expr->op_next = (OP*)rcop;
1584 prepend_elem(op->op_type, scalar((OP*)rcop), op);
1588 if (repl->op_type == OP_CONST) {
1589 pm->op_pmflags |= PMf_CONST;
1590 prepend_elem(op->op_type, scalar(repl), op);
1595 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
1596 if (opargs[curop->op_type] & OA_DANGEROUS) {
1597 if (curop->op_type == OP_GV) {
1598 GV *gv = ((GVOP*)curop)->op_gv;
1599 if (strchr("&`'123456789+", *GvENAME(gv)))
1602 else if (curop->op_type == OP_RV2CV)
1604 else if (curop->op_type == OP_RV2SV ||
1605 curop->op_type == OP_RV2AV ||
1606 curop->op_type == OP_RV2HV ||
1607 curop->op_type == OP_RV2GV) {
1608 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
1616 if (curop == repl) {
1617 pm->op_pmflags |= PMf_CONST; /* const for long enough */
1618 prepend_elem(op->op_type, scalar(repl), op);
1621 Newz(1101, rcop, 1, LOGOP);
1622 rcop->op_type = OP_SUBSTCONT;
1623 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
1624 rcop->op_first = scalar(repl);
1625 rcop->op_flags |= OPf_KIDS;
1626 rcop->op_private = 1;
1627 rcop->op_other = op;
1629 /* establish postfix order */
1630 rcop->op_next = LINKLIST(repl);
1631 repl->op_next = (OP*)rcop;
1633 pm->op_pmreplroot = scalar((OP*)rcop);
1634 pm->op_pmreplstart = LINKLIST(rcop);
1644 newSVOP(type, flags, sv)
1650 Newz(1101, svop, 1, SVOP);
1651 svop->op_type = type;
1652 svop->op_ppaddr = ppaddr[type];
1654 svop->op_next = (OP*)svop;
1655 svop->op_flags = flags;
1656 if (opargs[type] & OA_RETSCALAR)
1658 if (opargs[type] & OA_TARGET)
1659 svop->op_targ = pad_alloc(type, SVs_PADTMP);
1660 return (*check[type])((OP*)svop);
1664 newGVOP(type, flags, gv)
1670 Newz(1101, gvop, 1, GVOP);
1671 gvop->op_type = type;
1672 gvop->op_ppaddr = ppaddr[type];
1673 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
1674 gvop->op_next = (OP*)gvop;
1675 gvop->op_flags = flags;
1676 if (opargs[type] & OA_RETSCALAR)
1678 if (opargs[type] & OA_TARGET)
1679 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
1680 return (*check[type])((OP*)gvop);
1684 newPVOP(type, flags, pv)
1690 Newz(1101, pvop, 1, PVOP);
1691 pvop->op_type = type;
1692 pvop->op_ppaddr = ppaddr[type];
1694 pvop->op_next = (OP*)pvop;
1695 pvop->op_flags = flags;
1696 if (opargs[type] & OA_RETSCALAR)
1698 if (opargs[type] & OA_TARGET)
1699 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
1700 return (*check[type])((OP*)pvop);
1704 newCVOP(type, flags, cv, cont)
1711 Newz(1101, cvop, 1, CVOP);
1712 cvop->op_type = type;
1713 cvop->op_ppaddr = ppaddr[type];
1715 cvop->op_cont = cont;
1716 cvop->op_next = (OP*)cvop;
1717 cvop->op_flags = flags;
1718 if (opargs[type] & OA_RETSCALAR)
1720 if (opargs[type] & OA_TARGET)
1721 cvop->op_targ = pad_alloc(type, SVs_PADTMP);
1722 return (*check[type])((OP*)cvop);
1731 save_hptr(&curstash);
1732 save_item(curstname);
1737 curstash = fetch_stash(sv,TRUE);
1738 name = SvPV(sv, len);
1739 sv_setpvn(curstname, name, len);
1743 sv_setpv(curstname,"<none>");
1751 fetch_stash(sv,create)
1758 char *name = SvPV(sv, na);
1759 sprintf(tmpbuf,"%s::",name);
1760 tmpgv = gv_fetchpv(tmpbuf,create);
1764 GvHV(tmpgv) = newHV();
1765 stash = GvHV(tmpgv);
1767 HvNAME(stash) = savestr(name);
1772 newSLICEOP(flags, subscript, listval)
1777 return newBINOP(OP_LSLICE, flags,
1778 list(force_list(subscript)),
1779 list(force_list(listval)) );
1789 if (op->op_type == OP_NULL && op->op_flags & OPf_KIDS)
1790 op = cUNOP->op_first;
1792 if (op->op_type == OP_COND_EXPR) {
1793 I32 t = list_assignment(cCONDOP->op_first->op_sibling);
1794 I32 f = list_assignment(cCONDOP->op_first->op_sibling->op_sibling);
1799 yyerror("Assignment to both a list and a scalar");
1803 if (op->op_type == OP_LIST || op->op_flags & OPf_PARENS ||
1804 op->op_type == OP_RV2AV || op->op_type == OP_RV2HV ||
1805 op->op_type == OP_ASLICE || op->op_type == OP_HSLICE)
1808 if (op->op_type == OP_PADAV || op->op_type == OP_PADHV)
1811 if (op->op_type == OP_RV2SV)
1818 newASSIGNOP(flags, left, right)
1825 if (list_assignment(left)) {
1827 left = mod(left, OP_AASSIGN);
1828 if (right && right->op_type == OP_SPLIT) {
1829 if ((op = ((LISTOP*)right)->op_first) && op->op_type == OP_PUSHRE) {
1830 PMOP *pm = (PMOP*)op;
1831 if (left->op_type == OP_RV2AV) {
1832 op = ((UNOP*)left)->op_first;
1833 if (op->op_type == OP_GV && !pm->op_pmreplroot) {
1834 pm->op_pmreplroot = (OP*)((GVOP*)op)->op_gv;
1835 pm->op_pmflags |= PMf_ONCE;
1841 if (modcount < 10000) {
1842 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
1844 sv_setiv(sv, modcount+1);
1849 op = newBINOP(OP_AASSIGN, flags,
1850 list(force_list(right)),
1851 list(force_list(left)) );
1853 if (!(left->op_flags & OPf_INTRO)) {
1854 static int generation = 0;
1858 for (curop = LINKLIST(op); curop != op; curop = LINKLIST(curop)) {
1859 if (opargs[curop->op_type] & OA_DANGEROUS) {
1860 if (curop->op_type == OP_GV) {
1861 GV *gv = ((GVOP*)curop)->op_gv;
1862 if (gv == defgv || SvCUR(gv) == generation)
1864 SvCUR(gv) = generation;
1866 else if (curop->op_type == OP_RV2CV)
1868 else if (curop->op_type == OP_RV2SV ||
1869 curop->op_type == OP_RV2AV ||
1870 curop->op_type == OP_RV2HV ||
1871 curop->op_type == OP_RV2GV) {
1872 if (lastop->op_type != OP_GV) /* funny deref? */
1881 op->op_private = OPpASSIGN_COMMON;
1886 right = newOP(OP_UNDEF, 0);
1887 if (right->op_type == OP_READLINE) {
1888 right->op_flags |= OPf_STACKED;
1889 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
1892 op = newBINOP(OP_SASSIGN, flags,
1893 scalar(right), mod(scalar(left), OP_SASSIGN) );
1898 newSTATEOP(flags, label, op)
1905 /* Introduce my variables. */
1906 if (min_intro_pending) {
1907 SV **svp = AvARRAY(comppad_name);
1910 for (i = min_intro_pending; i <= max_intro_pending; i++) {
1912 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
1914 min_intro_pending = 0;
1915 comppad_name_fill = max_intro_pending; /* Needn't search higher */
1918 Newz(1101, cop, 1, COP);
1919 if (perldb && curcop->cop_line && curstash != debstash) {
1920 cop->op_type = OP_DBSTATE;
1921 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
1924 cop->op_type = OP_NEXTSTATE;
1925 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
1927 cop->op_flags = flags;
1928 cop->op_private = 0;
1929 cop->op_next = (OP*)cop;
1932 cop->cop_label = label;
1933 needblockscope = TRUE;
1935 cop->cop_seq = cop_seqmax++;
1937 if (copline == NOLINE)
1938 cop->cop_line = curcop->cop_line;
1940 cop->cop_line = copline;
1943 cop->cop_filegv = SvREFCNT_inc(curcop->cop_filegv);
1944 cop->cop_stash = curstash;
1946 if (perldb && curstash != debstash) {
1947 SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE);
1948 if (svp && *svp != &sv_undef && !SvIOK(*svp)) {
1951 SvSTASH(*svp) = (HV*)cop;
1955 return prepend_elem(OP_LINESEQ, (OP*)cop, op);
1959 newLOGOP(type, flags, first, other)
1968 scalarboolean(first);
1969 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
1970 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
1971 if (type == OP_AND || type == OP_OR) {
1977 first = cUNOP->op_first;
1979 first->op_next = op->op_next;
1980 cUNOP->op_first = Nullop;
1984 if (first->op_type == OP_CONST) {
1985 if (dowarn && (first->op_private & OPpCONST_BARE))
1986 warn("Probable precedence problem on %s", op_name[type]);
1987 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
1996 else if (first->op_type == OP_WANTARRAY) {
2006 Newz(1101, logop, 1, LOGOP);
2008 logop->op_type = type;
2009 logop->op_ppaddr = ppaddr[type];
2010 logop->op_first = first;
2011 logop->op_flags = flags | OPf_KIDS;
2012 logop->op_other = LINKLIST(other);
2013 logop->op_private = 1;
2015 /* establish postfix order */
2016 logop->op_next = LINKLIST(first);
2017 first->op_next = (OP*)logop;
2018 first->op_sibling = other;
2020 op = newUNOP(OP_NULL, 0, (OP*)logop);
2021 other->op_next = op;
2027 newCONDOP(flags, first, true, false)
2037 return newLOGOP(OP_AND, 0, first, true);
2039 return newLOGOP(OP_OR, 0, first, false);
2041 scalarboolean(first);
2042 if (first->op_type == OP_CONST) {
2043 if (SvTRUE(((SVOP*)first)->op_sv)) {
2054 else if (first->op_type == OP_WANTARRAY) {
2058 Newz(1101, condop, 1, CONDOP);
2060 condop->op_type = OP_COND_EXPR;
2061 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2062 condop->op_first = first;
2063 condop->op_flags = flags | OPf_KIDS;
2064 condop->op_true = LINKLIST(true);
2065 condop->op_false = LINKLIST(false);
2066 condop->op_private = 1;
2068 /* establish postfix order */
2069 condop->op_next = LINKLIST(first);
2070 first->op_next = (OP*)condop;
2072 first->op_sibling = true;
2073 true->op_sibling = false;
2074 op = newUNOP(OP_NULL, 0, (OP*)condop);
2077 false->op_next = op;
2083 newRANGE(flags, left, right)
2093 Newz(1101, condop, 1, CONDOP);
2095 condop->op_type = OP_RANGE;
2096 condop->op_ppaddr = ppaddr[OP_RANGE];
2097 condop->op_first = left;
2098 condop->op_flags = OPf_KIDS;
2099 condop->op_true = LINKLIST(left);
2100 condop->op_false = LINKLIST(right);
2101 condop->op_private = 1;
2103 left->op_sibling = right;
2105 condop->op_next = (OP*)condop;
2106 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2107 flop = newUNOP(OP_FLOP, 0, flip);
2108 op = newUNOP(OP_NULL, 0, flop);
2111 left->op_next = flip;
2112 right->op_next = flop;
2114 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2115 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2116 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2117 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2119 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2120 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2123 if (!flip->op_private || !flop->op_private)
2124 linklist(op); /* blow off optimizer unless constant */
2130 newLOOPOP(flags, debuggable, expr, block)
2138 int once = block && block->op_flags & OPf_SPECIAL &&
2139 (block->op_type == OP_ENTERSUBR || block->op_type == OP_NULL);
2142 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2143 return block; /* do {} while 0 does once */
2144 else if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB)
2145 expr = newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), expr);
2148 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2149 op = newLOGOP(OP_AND, 0, expr, listop);
2151 ((LISTOP*)listop)->op_last->op_next = LINKLIST(op);
2153 if (once && op != listop)
2154 op->op_next = ((LOGOP*)cUNOP->op_first)->op_other;
2156 op->op_flags |= flags;
2161 newWHILEOP(flags, debuggable, loop, expr, block, cont)
2175 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB))
2176 expr = newASSIGNOP(0, newSVREF(newGVOP(OP_GV, 0, defgv)), expr);
2179 block = newOP(OP_NULL, 0);
2182 next = LINKLIST(cont);
2184 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
2186 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
2187 redo = LINKLIST(listop);
2190 op = newLOGOP(OP_AND, 0, expr, scalar(listop));
2191 if (op == expr) { /* oops, it's a while (0) */
2194 return Nullop; /* (listop already freed by newLOGOP) */
2196 ((LISTOP*)listop)->op_last->op_next = condop =
2197 (op == listop ? redo : LINKLIST(op));
2205 Newz(1101,loop,1,LOOP);
2206 loop->op_type = OP_ENTERLOOP;
2207 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
2208 loop->op_private = 0;
2209 loop->op_next = (OP*)loop;
2212 op = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, op);
2214 loop->op_redoop = redo;
2215 loop->op_lastop = op;
2218 loop->op_nextop = next;
2220 loop->op_nextop = op;
2222 op->op_flags |= flags;
2228 newFOROP(flags,label,forline,sv,expr,block,cont)
2237 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
2238 #endif /* STANDARD_C */
2244 if (sv->op_type == OP_RV2SV) {
2246 sv = cUNOP->op_first;
2248 cUNOP->op_first = Nullop;
2252 croak("Can't use %s for loop variable", op_name[sv->op_type]);
2255 sv = newGVOP(OP_GV, 0, defgv);
2257 loop = (LOOP*)list(convert(OP_ENTERITER, 0,
2258 append_elem(OP_LIST, force_list(expr), scalar(sv))));
2259 return newSTATEOP(0, label, newWHILEOP(flags, 1,
2260 loop, newOP(OP_ITER, 0), block, cont));
2264 newLOOPEX(type, label)
2269 if (type != OP_GOTO || label->op_type == OP_CONST) {
2270 op = newPVOP(type, 0, savestr(SvPVx(((SVOP*)label)->op_sv, na)));
2274 if (label->op_type == OP_ENTERSUBR)
2275 label = newUNOP(OP_REFGEN, 0, ref(label, OP_REFGEN));
2276 op = newUNOP(type, OPf_STACKED, label);
2278 needblockscope = TRUE;
2286 if (!CvUSERSUB(cv) && CvROOT(cv)) {
2288 if (CvPADLIST(cv)) {
2289 SV** svp = av_fetch(CvPADLIST(cv), 0, FALSE);
2293 comppad = (AV*)*svp; /* Need same context we had compiling */
2294 curpad = AvARRAY(comppad);
2297 op_free(CvROOT(cv));
2298 CvROOT(cv) = Nullop;
2300 warn("Deleting active subroutine"); /* XXX */
2301 if (CvPADLIST(cv)) {
2302 I32 i = AvFILL(CvPADLIST(cv));
2304 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
2308 av_free((AV*)CvPADLIST(cv));
2310 SvREFCNT_dec(CvGV(cv));
2316 newSUB(floor,op,block)
2322 char *name = SvPVx(cSVOP->op_sv, na);
2323 GV *gv = gv_fetchpv(name,2);
2328 if ((cv = GvCV(gv)) && !GvCVGEN(gv)) {
2330 CvDELETED(cv) = TRUE; /* probably an autoloader */
2332 if (dowarn && CvROOT(cv)) {
2333 line_t oldline = curcop->cop_line;
2335 curcop->cop_line = copline;
2336 warn("Subroutine %s redefined",name);
2337 curcop->cop_line = oldline;
2343 sv_upgrade(cv, SVt_PVCV);
2347 CvFILEGV(cv) = curcop->cop_filegv;
2348 CvGV(cv) = SvREFCNT_inc(gv);
2349 CvSTASH(cv) = curstash;
2352 av_store(av, 0, Nullsv);
2353 av_store(comppad, 0, (SV*)av);
2359 if (AvFILL(comppad_name) < AvFILL(comppad))
2360 av_store(comppad_name, AvFILL(comppad), Nullsv);
2361 av_store(av, 0, (SV*)comppad_name);
2362 av_store(av, 1, (SV*)comppad);
2365 comppad_name = newAV();
2374 CvROOT(cv) = newUNOP(OP_LEAVESUBR, 0, scalarseq(block));
2375 CvSTART(cv) = LINKLIST(CvROOT(cv));
2376 CvROOT(cv)->op_next = 0;
2378 CvDELETED(cv) = FALSE;
2379 if (s = strrchr(name,':'))
2383 if (strEQ(s, "BEGIN")) {
2384 line_t oldline = compiling.cop_line;
2387 SAVESPTR(compiling.cop_filegv);
2391 av_push(beginav, cv);
2392 DEBUG_x( dump_sub(gv) );
2396 rspara = (nrslen == 2);
2403 curcop = &compiling;
2404 curcop->cop_line = oldline; /* might have recursed to yylex */
2407 else if (strEQ(s, "END")) {
2410 av_unshift(endav, 1);
2411 av_store(endav, 0, SvREFCNT_inc(cv));
2413 if (perldb && curstash != debstash) {
2415 SV *tmpstr = sv_newmortal();
2417 sprintf(buf,"%s:%ld",SvPVX(GvSV(curcop->cop_filegv)), subline);
2418 sv = newSVpv(buf,0);
2420 sprintf(buf,"%ld",(long)curcop->cop_line);
2422 gv_efullname(tmpstr,gv);
2423 hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
2431 newXSUB(name, ix, subaddr, filename)
2438 GV *gv = gv_fetchpv(name,2);
2442 if ((cv = GvCV(gv)) && !GvCVGEN(gv)) {
2444 warn("Subroutine %s redefined",name);
2445 if (!CvUSERSUB(cv) && CvROOT(cv)) {
2446 op_free(CvROOT(cv));
2447 CvROOT(cv) = Nullop;
2452 sv_upgrade(cv, SVt_PVCV);
2455 CvGV(cv) = SvREFCNT_inc(gv);
2457 CvFILEGV(cv) = gv_fetchfile(filename);
2458 CvUSERSUB(cv) = subaddr;
2459 CvUSERINDEX(cv) = ix;
2460 CvDELETED(cv) = FALSE;
2461 if (s = strrchr(name,':'))
2465 if (strEQ(s, "BEGIN")) {
2468 av_push(beginav, SvREFCNT_inc(gv));
2470 else if (strEQ(s, "END")) {
2473 av_unshift(endav, 1);
2474 av_store(endav, 0, SvREFCNT_inc(gv));
2479 newFORM(floor,op,block)
2490 name = SvPVx(cSVOP->op_sv, na);
2493 gv = gv_fetchpv(name,TRUE);
2494 if (cv = GvFORM(gv)) {
2496 line_t oldline = curcop->cop_line;
2498 curcop->cop_line = copline;
2499 warn("Format %s redefined",name);
2500 curcop->cop_line = oldline;
2505 sv_upgrade(cv, SVt_PVFM);
2508 CvGV(cv) = SvREFCNT_inc(gv);
2509 CvFILEGV(cv) = curcop->cop_filegv;
2511 CvPADLIST(cv) = av = newAV();
2513 av_store(av, 1, (SV*)comppad);
2516 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
2517 CvSTART(cv) = LINKLIST(CvROOT(cv));
2518 CvROOT(cv)->op_next = 0;
2520 CvDELETED(cv) = FALSE;
2533 Newz(1101, mop, 1, LOGOP);
2534 mop->op_type = OP_METHOD;
2535 mop->op_ppaddr = ppaddr[OP_METHOD];
2536 mop->op_first = scalar(ref);
2537 mop->op_flags |= OPf_KIDS;
2538 mop->op_private = 1;
2539 mop->op_other = LINKLIST(name);
2540 mop->op_targ = pad_alloc(OP_METHOD, SVs_PADTMP);
2541 mop->op_next = LINKLIST(ref);
2542 ref->op_next = (OP*)mop;
2543 return scalar((OP*)mop);
2550 return newUNOP(OP_REFGEN, 0,
2551 ref(list(convert(OP_ANONLIST, 0, op)), OP_REFGEN));
2558 return newUNOP(OP_REFGEN, 0,
2559 ref(list(convert(OP_ANONHASH, 0, op)), OP_REFGEN));
2566 switch (o->op_type) {
2568 o->op_type = OP_PADAV;
2569 o->op_ppaddr = ppaddr[OP_PADAV];
2570 return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV);
2573 o->op_type = OP_RV2AV;
2574 o->op_ppaddr = ppaddr[OP_RV2AV];
2579 warn("oops: oopsAV");
2589 switch (o->op_type) {
2592 o->op_type = OP_PADHV;
2593 o->op_ppaddr = ppaddr[OP_PADHV];
2594 return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV);
2598 o->op_type = OP_RV2HV;
2599 o->op_ppaddr = ppaddr[OP_RV2HV];
2604 warn("oops: oopsHV");
2614 if (o->op_type == OP_PADANY) {
2615 o->op_type = OP_PADAV;
2616 o->op_ppaddr = ppaddr[OP_PADAV];
2619 return newUNOP(OP_RV2AV, 0, scalar(o));
2626 return newUNOP(OP_RV2GV, 0, scalar(o));
2633 if (o->op_type == OP_PADANY) {
2634 o->op_type = OP_PADHV;
2635 o->op_ppaddr = ppaddr[OP_PADHV];
2638 return newUNOP(OP_RV2HV, 0, scalar(o));
2645 croak("NOT IMPL LINE %d",__LINE__);
2654 return newUNOP(OP_RV2CV, 0, scalar(o));
2661 if (o->op_type == OP_PADANY) {
2662 o->op_type = OP_PADSV;
2663 o->op_ppaddr = ppaddr[OP_PADSV];
2666 return newUNOP(OP_RV2SV, 0, scalar(o));
2669 /* Check routines. */
2675 if (cUNOP->op_first->op_type == OP_CONCAT)
2676 op->op_flags |= OPf_STACKED;
2684 if (op->op_flags & OPf_KIDS) {
2686 op = modkids(ck_fun(op), op->op_type);
2687 if (op->op_private != 1)
2689 newop = cUNOP->op_first->op_sibling;
2690 if (!newop || newop->op_type != OP_RV2SV)
2692 op_free(cUNOP->op_first);
2693 cUNOP->op_first = newop;
2695 op->op_type = OP_SCHOP;
2696 op->op_ppaddr = ppaddr[OP_SCHOP];
2704 I32 type = op->op_type;
2706 if (op->op_flags & OPf_KIDS) {
2707 if (cLISTOP->op_first->op_type == OP_STUB) {
2709 op = newUNOP(type, OPf_SPECIAL,
2710 newGVOP(OP_GV, 0, gv_fetchpv("main'ARGV", TRUE)));
2721 needblockscope = TRUE;
2722 if (op->op_flags & OPf_KIDS) {
2723 SVOP *kid = (SVOP*)cUNOP->op_first;
2726 op->op_flags &= ~OPf_KIDS;
2729 else if (kid->op_type == OP_LINESEQ) {
2732 kid->op_next = op->op_next;
2733 cUNOP->op_first = 0;
2736 Newz(1101, enter, 1, LOGOP);
2737 enter->op_type = OP_ENTERTRY;
2738 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
2739 enter->op_private = 0;
2741 /* establish postfix order */
2742 enter->op_next = (OP*)enter;
2744 op = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
2745 op->op_type = OP_LEAVETRY;
2746 op->op_ppaddr = ppaddr[OP_LEAVETRY];
2747 enter->op_other = op;
2753 op = newUNOP(OP_ENTEREVAL, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
2763 if (op->op_flags & OPf_STACKED) {
2765 kid = cUNOP->op_first->op_sibling;
2766 if (kid->op_type == OP_RV2GV)
2778 o = fold_constants(o);
2779 if (o->op_type == OP_CONST)
2788 SVOP *kid = (SVOP*)cUNOP->op_first;
2789 if (kid->op_type == OP_CONST) {
2790 kid->op_type = OP_GV;
2791 kid->op_sv = SvREFCNT_inc(gv_fetchpv(SvPVx(kid->op_sv, na),
2792 1+(op->op_type==OP_RV2CV)));
2808 I32 type = op->op_type;
2810 if (op->op_flags & OPf_SPECIAL)
2813 if (op->op_flags & OPf_KIDS) {
2814 SVOP *kid = (SVOP*)cUNOP->op_first;
2816 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
2817 OP *newop = newGVOP(type, OPf_SPECIAL,
2818 gv_fetchpv(SvPVx(kid->op_sv, na), TRUE));
2825 if (type == OP_FTTTY)
2826 return newGVOP(type, OPf_SPECIAL, gv_fetchpv("main'STDIN", TRUE));
2828 return newUNOP(type, 0, newSVREF(newGVOP(OP_GV, 0, defgv)));
2841 register I32 oa = opargs[op->op_type] >> 8;
2843 if (op->op_flags & OPf_STACKED) {
2844 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
2847 return no_fh_allowed(op);
2850 if (op->op_flags & OPf_KIDS) {
2851 tokid = &cLISTOP->op_first;
2852 kid = cLISTOP->op_first;
2853 if (kid->op_type == OP_PUSHMARK ||
2854 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
2856 tokid = &kid->op_sibling;
2857 kid = kid->op_sibling;
2862 sibl = kid->op_sibling;
2876 if (kid->op_type == OP_CONST &&
2877 (kid->op_private & OPpCONST_BARE)) {
2878 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
2879 OP *newop = newAVREF(newGVOP(OP_GV, 0,
2880 gv_fetchpv(name, TRUE) ));
2882 warn("Array @%s missing the @ in argument %d of %s()",
2883 name, numargs, op_name[op->op_type]);
2886 kid->op_sibling = sibl;
2889 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
2890 bad_type(numargs, "array", op, kid);
2891 mod(kid, op->op_type);
2894 if (kid->op_type == OP_CONST &&
2895 (kid->op_private & OPpCONST_BARE)) {
2896 char *name = SvPVx(((SVOP*)kid)->op_sv, na);
2897 OP *newop = newHVREF(newGVOP(OP_GV, 0,
2898 gv_fetchpv(name, TRUE) ));
2900 warn("Hash %%%s missing the %% in argument %d of %s()",
2901 name, numargs, op_name[op->op_type]);
2904 kid->op_sibling = sibl;
2907 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
2908 bad_type(numargs, "hash", op, kid);
2909 mod(kid, op->op_type);
2913 OP *newop = newUNOP(OP_NULL, 0, scalar(kid));
2914 kid->op_sibling = 0;
2916 newop->op_next = newop;
2918 kid->op_sibling = sibl;
2923 if (kid->op_type != OP_GV) {
2924 if (kid->op_type == OP_CONST &&
2925 (kid->op_private & OPpCONST_BARE)) {
2926 OP *newop = newGVOP(OP_GV, 0,
2927 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE) );
2932 kid->op_sibling = 0;
2933 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
2935 kid->op_sibling = sibl;
2941 mod(scalar(kid), op->op_type);
2945 tokid = &kid->op_sibling;
2946 kid = kid->op_sibling;
2948 op->op_private = numargs;
2950 return too_many_arguments(op);
2954 while (oa & OA_OPTIONAL)
2956 if (oa && oa != OA_LIST)
2957 return too_few_arguments(op);
2966 GV *gv = newGVgen();
2968 append_elem(OP_GLOB, op, newGVOP(OP_GV, 0, gv));
2980 if (op->op_flags & OPf_STACKED) {
2982 op->op_flags &= ~OPf_STACKED;
2987 kid = cLISTOP->op_first->op_sibling;
2988 if (kid->op_type != OP_NULL)
2989 croak("panic: ck_grep");
2990 kid = kUNOP->op_first;
2992 Newz(1101, gwop, 1, LOGOP);
2993 gwop->op_type = OP_GREPWHILE;
2994 gwop->op_ppaddr = ppaddr[OP_GREPWHILE];
2995 gwop->op_first = list(op);
2996 gwop->op_flags |= OPf_KIDS;
2997 gwop->op_private = 1;
2998 gwop->op_other = LINKLIST(kid);
2999 gwop->op_targ = pad_alloc(OP_GREPWHILE, SVs_PADTMP);
3000 kid->op_next = (OP*)gwop;
3009 if (op->op_flags & OPf_KIDS) {
3010 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3011 if (kid && kid->op_type == OP_CONST)
3012 fbm_compile(((SVOP*)kid)->op_sv, 0);
3021 /* XXX length optimization goes here */
3029 return modkids(ck_fun(op), op->op_type);
3036 return refkids(ck_fun(op), op->op_type);
3045 kid = cLISTOP->op_first;
3047 op = force_list(op);
3048 kid = cLISTOP->op_first;
3050 if (kid->op_type == OP_PUSHMARK)
3051 kid = kid->op_sibling;
3052 if (kid && op->op_flags & OPf_STACKED)
3053 kid = kid->op_sibling;
3054 else if (kid && !kid->op_sibling) { /* print HANDLE; */
3055 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
3056 op->op_flags |= OPf_STACKED; /* make it a filehandle */
3057 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
3058 cLISTOP->op_first->op_sibling = kid;
3059 cLISTOP->op_last = kid;
3060 kid = kid->op_sibling;
3065 append_elem(op->op_type, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
3067 return listkids(op);
3074 cPMOP->op_pmflags |= PMf_RUNTIME;
3089 if (cBINOP->op_first->op_flags & OPf_PARENS) {
3090 op->op_private = OPpREPEAT_DOLIST;
3091 cBINOP->op_first = force_list(cBINOP->op_first);
3102 if (op->op_flags & OPf_KIDS) { /* Shall we fake a BEGIN {}? */
3103 SVOP *kid = (SVOP*)cUNOP->op_first;
3105 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
3106 char *name = SvPVX(subname);
3108 sv_catpvn(kid->op_sv, ".pm", 3);
3109 if (s = strrchr(name,':'))
3113 if (strNE(s, "BEGIN")) {
3114 op = newSTATEOP(0, Nullch, op);
3115 newSUB(start_subparse(),
3116 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
3118 return newOP(OP_STUB,0);
3129 croak("NOT IMPL LINE %d",__LINE__);
3138 if (op->op_flags & OPf_KIDS) {
3139 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3140 if (kid->op_sibling) {
3141 op->op_type = OP_SSELECT;
3142 op->op_ppaddr = ppaddr[OP_SSELECT];
3144 return fold_constants(op);
3154 I32 type = op->op_type;
3156 if (!(op->op_flags & OPf_KIDS)) {
3158 return newUNOP(type, 0,
3159 scalar(newUNOP(OP_RV2AV, 0,
3160 scalar(newGVOP(OP_GV, 0,
3161 gv_fetchpv((subline ? "_" : "ARGV"), TRUE) )))));
3163 return scalar(modkids(ck_fun(op), type));
3170 if (op->op_flags & OPf_STACKED) {
3171 OP *kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3173 kid = kUNOP->op_first; /* get past rv2gv */
3175 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
3177 if (kid->op_type == OP_SCOPE) {
3182 else if (kid->op_type == OP_LEAVE) {
3183 null(kid); /* wipe out leave */
3186 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
3187 if (k->op_next == kid)
3190 peep(kLISTOP->op_first);
3192 kid = cLISTOP->op_first->op_sibling; /* get past pushmark */
3193 null(kid); /* wipe out rv2gv */
3195 op->op_flags |= OPf_SPECIAL;
3208 if (op->op_flags & OPf_STACKED)
3209 return no_fh_allowed(op);
3211 kid = cLISTOP->op_first;
3212 if (kid->op_type != OP_NULL)
3213 croak("panic: ck_split");
3214 kid = kid->op_sibling;
3215 op_free(cLISTOP->op_first);
3216 cLISTOP->op_first = kid;
3218 cLISTOP->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
3220 if (kid->op_type != OP_MATCH) {
3221 OP *sibl = kid->op_sibling;
3222 kid->op_sibling = 0;
3223 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
3224 if (cLISTOP->op_first == cLISTOP->op_last)
3225 cLISTOP->op_last = kid;
3226 cLISTOP->op_first = kid;
3227 kid->op_sibling = sibl;
3230 if (pm->op_pmshort && !(pm->op_pmflags & PMf_ALL)) {
3231 SvREFCNT_dec(pm->op_pmshort); /* can't use substring to optimize */
3235 kid->op_type = OP_PUSHRE;
3236 kid->op_ppaddr = ppaddr[OP_PUSHRE];
3239 if (!kid->op_sibling)
3240 append_elem(OP_SPLIT, op, newSVREF(newGVOP(OP_GV, 0, defgv)) );
3242 kid = kid->op_sibling;
3245 if (!kid->op_sibling)
3246 append_elem(OP_SPLIT, op, newSVOP(OP_CONST, 0, newSViv(0)));
3248 kid = kid->op_sibling;
3251 if (kid->op_sibling)
3252 return too_many_arguments(op);
3261 OP *o = ((cUNOP->op_first->op_sibling)
3262 ? cUNOP : ((UNOP*)cUNOP->op_first))->op_first->op_sibling;
3264 if (o->op_type == OP_RV2CV)
3265 null(o); /* disable rv2cv */
3267 if (perldb && curstash != debstash)
3268 op->op_private |= OPpSUBR_DB;
3276 SvREADONLY_on(cSVOP->op_sv);
3284 if (op->op_flags & OPf_KIDS) {
3285 SVOP *kid = (SVOP*)cUNOP->op_first;
3287 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
3288 op->op_flags |= OPf_SPECIAL;
3293 /* A peephole optimizer. We visit the ops in the order they're to execute. */
3299 register OP* oldop = 0;
3300 if (!op || op->op_seq)
3302 for (; op; op = op->op_next) {
3305 switch (op->op_type) {
3307 if ((op->op_flags & (OPf_KNOW|OPf_LIST)) != (OPf_KNOW|OPf_LIST)) {
3308 op->op_seq = ++op_seqmax;
3309 break; /* Scalar stub must produce undef. List stub is noop */
3317 oldop->op_next = op->op_next;
3320 op->op_seq = ++op_seqmax;
3324 if (op->op_next->op_type == OP_RV2SV) {
3325 if (op->op_next->op_private < OP_RV2GV) {
3327 op->op_flags |= op->op_next->op_flags & OPf_INTRO;
3328 op->op_next = op->op_next->op_next;
3329 op->op_type = OP_GVSV;
3330 op->op_ppaddr = ppaddr[OP_GVSV];
3333 else if (op->op_next->op_type == OP_RV2AV) {
3334 OP* pop = op->op_next->op_next;
3336 if (pop->op_type == OP_CONST &&
3337 pop->op_next->op_type == OP_AELEM &&
3338 pop->op_next->op_private < OP_RV2GV &&
3339 !(pop->op_next->op_flags & OPf_INTRO) &&
3340 (i = SvIV(((SVOP*)pop)->op_sv)) <= 255 &&
3346 op->op_flags &= ~OPf_LVAL;
3347 op->op_flags |= pop->op_next->op_flags & OPf_LVAL;
3348 op->op_next = pop->op_next->op_next;
3349 op->op_type = OP_AELEMFAST;
3350 op->op_ppaddr = ppaddr[OP_AELEMFAST];
3352 GvAVn((GV*)cSVOP->op_sv);
3355 op->op_seq = ++op_seqmax;
3361 op->op_seq = ++op_seqmax;
3362 peep(cLOGOP->op_other);
3366 op->op_seq = ++op_seqmax;
3367 peep(cCONDOP->op_true);
3368 peep(cCONDOP->op_false);
3372 op->op_seq = ++op_seqmax;
3373 peep(cLOOP->op_redoop);
3374 peep(cLOOP->op_nextop);
3375 peep(cLOOP->op_lastop);
3380 op->op_seq = ++op_seqmax;
3381 peep(cPMOP->op_pmreplroot);
3385 op->op_seq = ++op_seqmax;