3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
22 #define CHECKCALL this->*check
24 #define CHECKCALL *check
28 * In the following definition, the ", Nullop" is just to make the compiler
29 * think the expression is of the right type: croak actually does a Siglongjmp.
31 #define CHECKOP(type,o) \
32 ((PL_op_mask && PL_op_mask[type]) \
33 ? ( op_free((OP*)o), \
34 croak("%s trapped by operation mask", op_desc[type]), \
36 : (CHECKCALL[type])((OP*)o))
38 static bool scalar_mod_type _((OP *o, I32 type));
40 static I32 list_assignment _((OP *o));
41 static void bad_type _((I32 n, char *t, char *name, OP *kid));
42 static OP *modkids _((OP *o, I32 type));
43 static OP *no_fh_allowed _((OP *o));
44 static OP *scalarboolean _((OP *o));
45 static OP *too_few_arguments _((OP *o, char* name));
46 static OP *too_many_arguments _((OP *o, char* name));
47 static void null _((OP* o));
48 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
49 CV* startcv, I32 cx_ix));
50 static OP *newDEFSVOP _((void));
51 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
57 SV* tmpsv = sv_newmortal();
58 gv_efullname3(tmpsv, gv, Nullch);
59 return SvPV(tmpsv,PL_na);
65 yyerror(form("Missing comma after first argument to %s function",
66 op_desc[o->op_type]));
71 too_few_arguments(OP *o, char *name)
73 yyerror(form("Not enough arguments for %s", name));
78 too_many_arguments(OP *o, char *name)
80 yyerror(form("Too many arguments for %s", name));
85 bad_type(I32 n, char *t, char *name, OP *kid)
87 yyerror(form("Type of arg %d to %s must be %s (not %s)",
88 (int)n, name, t, op_desc[kid->op_type]));
94 int type = o->op_type;
95 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
96 yyerror(form("Can't use subscript on %s", op_desc[type]));
97 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
100 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
101 type == OP_ENTERSUB ? '&' : '%'));
105 sv_catsv(GvSV(PL_errgv), msg);
107 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
112 /* "register" allocation */
115 pad_allocmy(char *name)
121 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
122 if (!isPRINT(name[1])) {
124 name[2] = toCTRL(name[1]);
127 croak("Can't use global %s in \"my\"",name);
129 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
130 SV **svp = AvARRAY(PL_comppad_name);
131 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
133 && sv != &PL_sv_undef
134 && SvIVX(sv) == 999999999 /* var is in open scope */
135 && strEQ(name, SvPVX(sv)))
138 "\"my\" variable %s masks earlier declaration in same scope",
144 off = pad_alloc(OP_PADSV, SVs_PADMY);
146 sv_upgrade(sv, SVt_PVNV);
148 if (PL_in_my_stash) {
150 croak("Can't declare class for non-scalar %s in \"my\"",name);
152 (void)SvUPGRADE(sv, SVt_PVMG);
153 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
156 av_store(PL_comppad_name, off, sv);
157 SvNVX(sv) = (double)999999999;
158 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
159 if (!PL_min_intro_pending)
160 PL_min_intro_pending = off;
161 PL_max_intro_pending = off;
163 av_store(PL_comppad, off, (SV*)newAV());
164 else if (*name == '%')
165 av_store(PL_comppad, off, (SV*)newHV());
166 SvPADMY_on(PL_curpad[off]);
171 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
178 register PERL_CONTEXT *cx;
181 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
182 AV *curlist = CvPADLIST(cv);
183 SV **svp = av_fetch(curlist, 0, FALSE);
186 if (!svp || *svp == &PL_sv_undef)
189 svp = AvARRAY(curname);
190 for (off = AvFILLp(curname); off > 0; off--) {
191 if ((sv = svp[off]) &&
192 sv != &PL_sv_undef &&
194 seq > I_32(SvNVX(sv)) &&
195 strEQ(SvPVX(sv), name))
206 return 0; /* don't clone from inactive stack frame */
210 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
211 oldsv = *av_fetch(oldpad, off, TRUE);
212 if (!newoff) { /* Not a mere clone operation. */
213 SV *namesv = NEWSV(1103,0);
214 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
215 sv_upgrade(namesv, SVt_PVNV);
216 sv_setpv(namesv, name);
217 av_store(PL_comppad_name, newoff, namesv);
218 SvNVX(namesv) = (double)PL_curcop->cop_seq;
219 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
220 SvFAKE_on(namesv); /* A ref, not a real var */
221 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
222 /* "It's closures all the way down." */
223 CvCLONE_on(PL_compcv);
225 if (CvANON(PL_compcv))
226 oldsv = Nullsv; /* no need to keep ref */
231 bcv && bcv != cv && !CvCLONE(bcv);
232 bcv = CvOUTSIDE(bcv)) {
236 if (ckWARN(WARN_CLOSURE) && !CvUNIQUE(cv))
238 "Variable \"%s\" may be unavailable",
245 else if (!CvUNIQUE(PL_compcv)) {
246 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
248 "Variable \"%s\" will not stay shared", name);
251 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
257 /* Nothing in current lexical context--try eval's context, if any.
258 * This is necessary to let the perldb get at lexically scoped variables.
259 * XXX This will also probably interact badly with eval tree caching.
263 for (i = cx_ix; i >= 0; i--) {
265 switch (cx->cx_type) {
267 if (i == 0 && saweval) {
268 seq = cxstack[saweval].blk_oldcop->cop_seq;
269 return pad_findlex(name, newoff, seq, PL_main_cv, 0);
273 switch (cx->blk_eval.old_op_type) {
278 /* require must have its own scope */
286 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
287 saweval = i; /* so we know where we were called from */
290 seq = cxstack[saweval].blk_oldcop->cop_seq;
291 return pad_findlex(name, newoff, seq, cv, i-1);
299 pad_findmy(char *name)
305 SV **svp = AvARRAY(PL_comppad_name);
306 U32 seq = PL_cop_seqmax;
310 * Special case to get lexical (and hence per-thread) @_.
311 * XXX I need to find out how to tell at parse-time whether use
312 * of @_ should refer to a lexical (from a sub) or defgv (global
313 * scope and maybe weird sub-ish things like formats). See
314 * startsub in perly.y. It's possible that @_ could be lexical
315 * (at least from subs) even in non-threaded perl.
317 if (strEQ(name, "@_"))
318 return 0; /* success. (NOT_IN_PAD indicates failure) */
319 #endif /* USE_THREADS */
321 /* The one we're looking for is probably just before comppad_name_fill. */
322 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
323 if ((sv = svp[off]) &&
324 sv != &PL_sv_undef &&
327 seq > I_32(SvNVX(sv)))) &&
328 strEQ(SvPVX(sv), name))
331 return (PADOFFSET)off;
332 pendoff = off; /* this pending def. will override import */
336 /* See if it's in a nested scope */
337 off = pad_findlex(name, 0, seq, CvOUTSIDE(PL_compcv), cxstack_ix);
339 /* If there is a pending local definition, this new alias must die */
341 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
342 return off; /* pad_findlex returns 0 for failure...*/
344 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
348 pad_leavemy(I32 fill)
351 SV **svp = AvARRAY(PL_comppad_name);
353 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
354 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
355 if ((sv = svp[off]) && sv != &PL_sv_undef)
356 warn("%s never introduced", SvPVX(sv));
359 /* "Deintroduce" my variables that are leaving with this scope. */
360 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
361 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == 999999999)
362 SvIVX(sv) = PL_cop_seqmax;
367 pad_alloc(I32 optype, U32 tmptype)
373 if (AvARRAY(PL_comppad) != PL_curpad)
374 croak("panic: pad_alloc");
375 if (PL_pad_reset_pending)
377 if (tmptype & SVs_PADMY) {
379 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
380 } while (SvPADBUSY(sv)); /* need a fresh one */
381 retval = AvFILLp(PL_comppad);
384 SV **names = AvARRAY(PL_comppad_name);
385 SSize_t names_fill = AvFILLp(PL_comppad_name);
388 * "foreach" index vars temporarily become aliases to non-"my"
389 * values. Thus we must skip, not just pad values that are
390 * marked as current pad values, but also those with names.
392 if (++PL_padix <= names_fill &&
393 (sv = names[PL_padix]) && sv != &PL_sv_undef)
395 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
396 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
401 SvFLAGS(sv) |= tmptype;
402 PL_curpad = AvARRAY(PL_comppad);
404 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
405 (unsigned long) thr, (unsigned long) PL_curpad,
406 (long) retval, op_name[optype]));
408 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
409 (unsigned long) PL_curpad,
410 (long) retval, op_name[optype]));
411 #endif /* USE_THREADS */
412 return (PADOFFSET)retval;
420 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
421 (unsigned long) thr, (unsigned long) PL_curpad, po));
424 croak("panic: pad_sv po");
425 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
426 (unsigned long) PL_curpad, po));
427 #endif /* USE_THREADS */
428 return PL_curpad[po]; /* eventually we'll turn this into a macro */
432 pad_free(PADOFFSET po)
437 if (AvARRAY(PL_comppad) != PL_curpad)
438 croak("panic: pad_free curpad");
440 croak("panic: pad_free po");
442 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
443 (unsigned long) thr, (unsigned long) PL_curpad, po));
445 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
446 (unsigned long) PL_curpad, po));
447 #endif /* USE_THREADS */
448 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
449 SvPADTMP_off(PL_curpad[po]);
450 if ((I32)po < PL_padix)
455 pad_swipe(PADOFFSET po)
458 if (AvARRAY(PL_comppad) != PL_curpad)
459 croak("panic: pad_swipe curpad");
461 croak("panic: pad_swipe po");
463 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
464 (unsigned long) thr, (unsigned long) PL_curpad, po));
466 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
467 (unsigned long) PL_curpad, po));
468 #endif /* USE_THREADS */
469 SvPADTMP_off(PL_curpad[po]);
470 PL_curpad[po] = NEWSV(1107,0);
471 SvPADTMP_on(PL_curpad[po]);
472 if ((I32)po < PL_padix)
476 /* XXX pad_reset() is currently disabled because it results in serious bugs.
477 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
478 * on the stack by OPs that use them, there are several ways to get an alias
479 * to a shared TARG. Such an alias will change randomly and unpredictably.
480 * We avoid doing this until we can think of a Better Way.
485 #ifdef USE_BROKEN_PAD_RESET
489 if (AvARRAY(PL_comppad) != PL_curpad)
490 croak("panic: pad_reset curpad");
492 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
493 (unsigned long) thr, (unsigned long) PL_curpad));
495 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
496 (unsigned long) PL_curpad));
497 #endif /* USE_THREADS */
498 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
499 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
500 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
501 SvPADTMP_off(PL_curpad[po]);
503 PL_padix = PL_padix_floor;
506 PL_pad_reset_pending = FALSE;
510 /* find_threadsv is not reentrant */
512 find_threadsv(char *name)
518 /* We currently only handle names of a single character */
519 p = strchr(PL_threadsv_names, *name);
522 key = p - PL_threadsv_names;
523 svp = av_fetch(thr->threadsv, key, FALSE);
525 SV *sv = NEWSV(0, 0);
526 av_store(thr->threadsv, key, sv);
527 thr->threadsvp = AvARRAY(thr->threadsv);
529 * Some magic variables used to be automagically initialised
530 * in gv_fetchpv. Those which are now per-thread magicals get
531 * initialised here instead.
537 sv_setpv(sv, "\034");
538 sv_magic(sv, 0, 0, name, 1);
543 PL_sawampersand = TRUE;
547 /* XXX %! tied to Errno.pm needs to be added here.
548 * See gv_fetchpv(). */
552 sv_magic(sv, 0, 0, name, 1);
554 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
555 "find_threadsv: new SV %p for $%s%c\n",
556 sv, (*name < 32) ? "^" : "",
557 (*name < 32) ? toCTRL(*name) : *name));
561 #endif /* USE_THREADS */
568 register OP *kid, *nextkid;
570 if (!o || o->op_seq == (U16)-1)
573 if (o->op_flags & OPf_KIDS) {
574 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
575 nextkid = kid->op_sibling; /* Get before next freeing kid */
580 switch (o->op_type) {
582 o->op_targ = 0; /* Was holding old type, if any. */
585 o->op_targ = 0; /* Was holding hints. */
589 if (!(o->op_flags & OPf_SPECIAL))
593 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
595 #endif /* USE_THREADS */
597 if (!(o->op_flags & OPf_REF)
598 || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
604 SvREFCNT_dec(cGVOPo->op_gv);
608 Safefree(cCOPo->cop_label);
609 SvREFCNT_dec(cCOPo->cop_filegv);
610 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
611 SvREFCNT_dec(cCOPo->cop_warnings);
614 SvREFCNT_dec(cSVOPo->op_sv);
620 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
624 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
625 SvREFCNT_dec(cSVOPo->op_sv);
627 Safefree(cPVOPo->op_pv);
630 op_free(cPMOPo->op_pmreplroot);
635 ReREFCNT_dec(cPMOPo->op_pmregexp);
640 pad_free(o->op_targ);
648 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
649 pad_free(o->op_targ);
650 o->op_targ = o->op_type;
651 o->op_type = OP_NULL;
652 o->op_ppaddr = ppaddr[OP_NULL];
655 /* Contextualizers */
657 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
667 /* establish postfix order */
668 if (cUNOPo->op_first) {
669 o->op_next = LINKLIST(cUNOPo->op_first);
670 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
672 kid->op_next = LINKLIST(kid->op_sibling);
687 if (o && o->op_flags & OPf_KIDS) {
688 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
697 if (ckWARN(WARN_SYNTAX) &&
698 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
700 line_t oldline = PL_curcop->cop_line;
702 if (PL_copline != NOLINE)
703 PL_curcop->cop_line = PL_copline;
704 warner(WARN_SYNTAX, "Found = in conditional, should be ==");
705 PL_curcop->cop_line = oldline;
715 /* assumes no premature commitment */
716 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
717 || o->op_type == OP_RETURN)
720 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
722 switch (o->op_type) {
724 if (o->op_private & OPpREPEAT_DOLIST)
725 null(((LISTOP*)cBINOPo->op_first)->op_first);
726 scalar(cBINOPo->op_first);
731 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
735 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
736 if (!kPMOP->op_pmreplroot)
737 deprecate("implicit split to @_");
745 if (o->op_flags & OPf_KIDS) {
746 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
752 kid = cLISTOPo->op_first;
754 while (kid = kid->op_sibling) {
760 WITH_THR(PL_curcop = &PL_compiling);
765 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
771 WITH_THR(PL_curcop = &PL_compiling);
784 /* assumes no premature commitment */
785 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || PL_error_count
786 || o->op_type == OP_RETURN)
789 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
791 switch (o->op_type) {
793 if (!(opargs[o->op_type] & OA_FOLDCONST))
797 if (o->op_flags & OPf_STACKED)
801 if (o->op_private == 4)
872 if (!(o->op_private & OPpLVAL_INTRO))
873 useless = op_desc[o->op_type];
880 if (!(o->op_private & OPpLVAL_INTRO) &&
881 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
882 useless = "a variable";
887 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
892 if (ckWARN(WARN_VOID)) {
893 useless = "a constant";
894 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
896 else if (SvPOK(sv)) {
897 if (strnEQ(SvPVX(sv), "di", 2) ||
898 strnEQ(SvPVX(sv), "ds", 2) ||
899 strnEQ(SvPVX(sv), "ig", 2))
903 null(o); /* don't execute a constant */
904 SvREFCNT_dec(sv); /* don't even remember it */
908 o->op_type = OP_PREINC; /* pre-increment is faster */
909 o->op_ppaddr = ppaddr[OP_PREINC];
913 o->op_type = OP_PREDEC; /* pre-decrement is faster */
914 o->op_ppaddr = ppaddr[OP_PREDEC];
920 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
925 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
926 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
927 if (o->op_flags & OPf_STACKED)
933 if (!(o->op_flags & OPf_KIDS))
942 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
949 /* all requires must return a boolean value */
950 o->op_flags &= ~OPf_WANT;
953 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
954 if (!kPMOP->op_pmreplroot)
955 deprecate("implicit split to @_");
959 if (useless && ckWARN(WARN_VOID))
960 warner(WARN_VOID, "Useless use of %s in void context", useless);
968 if (o && o->op_flags & OPf_KIDS) {
969 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
980 /* assumes no premature commitment */
981 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
982 || o->op_type == OP_RETURN)
985 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
987 switch (o->op_type) {
990 list(cBINOPo->op_first);
995 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1003 if (!(o->op_flags & OPf_KIDS))
1005 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1006 list(cBINOPo->op_first);
1007 return gen_constant_list(o);
1014 kid = cLISTOPo->op_first;
1016 while (kid = kid->op_sibling) {
1017 if (kid->op_sibling)
1022 WITH_THR(PL_curcop = &PL_compiling);
1026 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1027 if (kid->op_sibling)
1032 WITH_THR(PL_curcop = &PL_compiling);
1035 /* all requires must return a boolean value */
1036 o->op_flags &= ~OPf_WANT;
1048 if (o->op_type == OP_LINESEQ ||
1049 o->op_type == OP_SCOPE ||
1050 o->op_type == OP_LEAVE ||
1051 o->op_type == OP_LEAVETRY)
1054 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1055 if (kid->op_sibling) {
1059 PL_curcop = &PL_compiling;
1061 o->op_flags &= ~OPf_PARENS;
1062 if (PL_hints & HINT_BLOCK_SCOPE)
1063 o->op_flags |= OPf_PARENS;
1066 o = newOP(OP_STUB, 0);
1071 modkids(OP *o, I32 type)
1074 if (o && o->op_flags & OPf_KIDS) {
1075 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1082 mod(OP *o, I32 type)
1088 if (!o || PL_error_count)
1091 switch (o->op_type) {
1096 if (!(o->op_private & (OPpCONST_ARYBASE)))
1098 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1099 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1103 SAVEI32(PL_compiling.cop_arybase);
1104 PL_compiling.cop_arybase = 0;
1106 else if (type == OP_REFGEN)
1109 croak("That use of $[ is unsupported");
1112 if (o->op_flags & OPf_PARENS)
1116 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1117 !(o->op_flags & OPf_STACKED)) {
1118 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1119 o->op_ppaddr = ppaddr[OP_RV2CV];
1120 assert(cUNOPo->op_first->op_type == OP_NULL);
1121 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1127 /* grep, foreach, subcalls, refgen */
1128 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1130 yyerror(form("Can't modify %s in %s",
1131 op_desc[o->op_type],
1132 type ? op_desc[type] : "local"));
1146 case OP_RIGHT_SHIFT:
1155 if (!(o->op_flags & OPf_STACKED))
1161 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1167 if (!type && cUNOPo->op_first->op_type != OP_GV)
1168 croak("Can't localize through a reference");
1169 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1170 PL_modcount = 10000;
1171 return o; /* Treat \(@foo) like ordinary list. */
1175 if (scalar_mod_type(o, type))
1177 ref(cUNOPo->op_first, o->op_type);
1186 PL_modcount = 10000;
1189 if (!type && cUNOPo->op_first->op_type != OP_GV)
1190 croak("Can't localize through a reference");
1191 ref(cUNOPo->op_first, o->op_type);
1195 PL_hints |= HINT_BLOCK_SCOPE;
1203 PL_modcount = 10000;
1204 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1205 return o; /* Treat \(@foo) like ordinary list. */
1206 if (scalar_mod_type(o, type))
1212 croak("Can't localize lexical variable %s",
1213 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), PL_na));
1218 PL_modcount++; /* XXX ??? */
1220 #endif /* USE_THREADS */
1226 if (type != OP_SASSIGN)
1230 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1236 pad_free(o->op_targ);
1237 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1238 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1239 if (o->op_flags & OPf_KIDS)
1240 mod(cBINOPo->op_first->op_sibling, type);
1245 ref(cBINOPo->op_first, o->op_type);
1246 if (type == OP_ENTERSUB &&
1247 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1248 o->op_private |= OPpLVAL_DEFER;
1255 if (o->op_flags & OPf_KIDS)
1256 mod(cLISTOPo->op_last, type);
1260 if (!(o->op_flags & OPf_KIDS))
1262 if (o->op_targ != OP_LIST) {
1263 mod(cBINOPo->op_first, type);
1268 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1272 o->op_flags |= OPf_MOD;
1274 if (type == OP_AASSIGN || type == OP_SASSIGN)
1275 o->op_flags |= OPf_SPECIAL|OPf_REF;
1277 o->op_private |= OPpLVAL_INTRO;
1278 o->op_flags &= ~OPf_SPECIAL;
1279 PL_hints |= HINT_BLOCK_SCOPE;
1281 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1282 o->op_flags |= OPf_REF;
1287 scalar_mod_type(OP *o, I32 type)
1291 if (o->op_type == OP_RV2GV)
1315 case OP_RIGHT_SHIFT:
1325 case OP_ANDASSIGN: /* may work later */
1326 case OP_ORASSIGN: /* may work later */
1334 refkids(OP *o, I32 type)
1337 if (o && o->op_flags & OPf_KIDS) {
1338 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1345 ref(OP *o, I32 type)
1349 if (!o || PL_error_count)
1352 switch (o->op_type) {
1354 if ((type == OP_DEFINED || type == OP_LOCK) &&
1355 !(o->op_flags & OPf_STACKED)) {
1356 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1357 o->op_ppaddr = ppaddr[OP_RV2CV];
1358 assert(cUNOPo->op_first->op_type == OP_NULL);
1359 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1360 o->op_flags |= OPf_SPECIAL;
1365 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1369 ref(cUNOPo->op_first, o->op_type);
1372 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1373 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1374 : type == OP_RV2HV ? OPpDEREF_HV
1376 o->op_flags |= OPf_MOD;
1381 o->op_flags |= OPf_MOD; /* XXX ??? */
1386 o->op_flags |= OPf_REF;
1389 ref(cUNOPo->op_first, o->op_type);
1394 o->op_flags |= OPf_REF;
1399 if (!(o->op_flags & OPf_KIDS))
1401 ref(cBINOPo->op_first, type);
1405 ref(cBINOPo->op_first, o->op_type);
1406 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1407 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1408 : type == OP_RV2HV ? OPpDEREF_HV
1410 o->op_flags |= OPf_MOD;
1418 if (!(o->op_flags & OPf_KIDS))
1420 ref(cLISTOPo->op_last, type);
1435 if (!o || PL_error_count)
1439 if (type == OP_LIST) {
1440 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1442 } else if (type == OP_UNDEF) {
1444 } else if (type != OP_PADSV &&
1447 type != OP_PUSHMARK)
1449 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1452 o->op_flags |= OPf_MOD;
1453 o->op_private |= OPpLVAL_INTRO;
1461 o->op_flags |= OPf_PARENS;
1466 bind_match(I32 type, OP *left, OP *right)
1470 if (ckWARN(WARN_UNSAFE) &&
1471 (left->op_type == OP_RV2AV ||
1472 left->op_type == OP_RV2HV ||
1473 left->op_type == OP_PADAV ||
1474 left->op_type == OP_PADHV)) {
1475 char *desc = op_desc[(right->op_type == OP_SUBST ||
1476 right->op_type == OP_TRANS)
1477 ? right->op_type : OP_MATCH];
1478 char *sample = ((left->op_type == OP_RV2AV ||
1479 left->op_type == OP_PADAV)
1480 ? "@array" : "%hash");
1482 "Applying %s to %s will act on scalar(%s)",
1483 desc, sample, sample);
1486 if (right->op_type == OP_MATCH ||
1487 right->op_type == OP_SUBST ||
1488 right->op_type == OP_TRANS) {
1489 right->op_flags |= OPf_STACKED;
1490 if (right->op_type != OP_MATCH)
1491 left = mod(left, right->op_type);
1492 if (right->op_type == OP_TRANS)
1493 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1495 o = prepend_elem(right->op_type, scalar(left), right);
1497 return newUNOP(OP_NOT, 0, scalar(o));
1501 return bind_match(type, left,
1502 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1510 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1511 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1518 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1519 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1520 o->op_type = OP_LEAVE;
1521 o->op_ppaddr = ppaddr[OP_LEAVE];
1524 if (o->op_type == OP_LINESEQ) {
1526 o->op_type = OP_SCOPE;
1527 o->op_ppaddr = ppaddr[OP_SCOPE];
1528 kid = ((LISTOP*)o)->op_first;
1529 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1530 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1535 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1545 SAVESPTR(GvHV(PL_hintgv));
1546 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1547 SAVEFREESV(GvHV(PL_hintgv));
1551 block_start(int full)
1554 int retval = PL_savestack_ix;
1556 SAVEI32(PL_comppad_name_floor);
1558 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1559 PL_comppad_name_floor = PL_comppad_name_fill;
1561 PL_comppad_name_floor = 0;
1563 SAVEI32(PL_min_intro_pending);
1564 SAVEI32(PL_max_intro_pending);
1565 PL_min_intro_pending = 0;
1566 SAVEI32(PL_comppad_name_fill);
1567 SAVEI32(PL_padix_floor);
1568 PL_padix_floor = PL_padix;
1569 PL_pad_reset_pending = FALSE;
1571 PL_hints &= ~HINT_BLOCK_SCOPE;
1572 SAVEPPTR(compiling.cop_warnings);
1573 if (PL_compiling.cop_warnings != WARN_ALL &&
1574 PL_compiling.cop_warnings != WARN_NONE) {
1575 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1576 SAVEFREESV(PL_compiling.cop_warnings) ;
1584 block_end(I32 floor, OP *seq)
1587 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1588 OP* retval = scalarseq(seq);
1590 PL_pad_reset_pending = FALSE;
1591 compiling.op_private = PL_hints;
1593 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1594 pad_leavemy(PL_comppad_name_fill);
1603 OP *o = newOP(OP_THREADSV, 0);
1604 o->op_targ = find_threadsv("_");
1607 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1608 #endif /* USE_THREADS */
1616 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1617 PL_eval_start = linklist(PL_eval_root);
1618 PL_eval_root->op_next = 0;
1619 peep(PL_eval_start);
1624 PL_main_root = scope(sawparens(scalarvoid(o)));
1625 PL_curcop = &PL_compiling;
1626 PL_main_start = LINKLIST(PL_main_root);
1627 PL_main_root->op_next = 0;
1628 peep(PL_main_start);
1631 /* Register with debugger */
1633 CV *cv = perl_get_cv("DB::postponed", FALSE);
1637 XPUSHs((SV*)PL_compiling.cop_filegv);
1639 perl_call_sv((SV*)cv, G_DISCARD);
1646 localize(OP *o, I32 lex)
1648 if (o->op_flags & OPf_PARENS)
1651 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1653 for (s = PL_bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1654 if (*s == ';' || *s == '=')
1655 warner(WARN_PARENTHESIS, "Parens missing around \"%s\" list",
1656 lex ? "my" : "local");
1660 PL_in_my_stash = Nullhv;
1664 return mod(o, OP_NULL); /* a bit kludgey */
1670 if (o->op_type == OP_LIST) {
1673 o2 = newOP(OP_THREADSV, 0);
1674 o2->op_targ = find_threadsv(";");
1676 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1677 #endif /* USE_THREADS */
1678 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1684 fold_constants(register OP *o)
1688 I32 type = o->op_type;
1691 if (opargs[type] & OA_RETSCALAR)
1693 if (opargs[type] & OA_TARGET)
1694 o->op_targ = pad_alloc(type, SVs_PADTMP);
1696 if ((opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1697 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1699 if (!(opargs[type] & OA_FOLDCONST))
1714 if (o->op_private & OPpLOCALE)
1719 goto nope; /* Don't try to run w/ errors */
1721 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1722 if (curop->op_type != OP_CONST &&
1723 curop->op_type != OP_LIST &&
1724 curop->op_type != OP_SCALAR &&
1725 curop->op_type != OP_NULL &&
1726 curop->op_type != OP_PUSHMARK) {
1731 curop = LINKLIST(o);
1735 sv = *(PL_stack_sp--);
1736 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1737 pad_swipe(o->op_targ);
1738 else if (SvTEMP(sv)) { /* grab mortal temp? */
1739 (void)SvREFCNT_inc(sv);
1743 if (type == OP_RV2GV)
1744 return newGVOP(OP_GV, 0, (GV*)sv);
1746 /* try to smush double to int, but don't smush -2.0 to -2 */
1747 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1751 if ((double)iv == SvNV(sv)) {
1756 SvIOK_off(sv); /* undo SvIV() damage */
1758 return newSVOP(OP_CONST, 0, sv);
1762 if (!(opargs[type] & OA_OTHERINT))
1765 if (!(PL_hints & HINT_INTEGER)) {
1766 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1769 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1770 if (curop->op_type == OP_CONST) {
1771 if (SvIOK(((SVOP*)curop)->op_sv))
1775 if (opargs[curop->op_type] & OA_RETINTEGER)
1779 o->op_ppaddr = ppaddr[++(o->op_type)];
1786 gen_constant_list(register OP *o)
1790 I32 oldtmps_floor = PL_tmps_floor;
1794 return o; /* Don't attempt to run with errors */
1796 PL_op = curop = LINKLIST(o);
1802 PL_tmps_floor = oldtmps_floor;
1804 o->op_type = OP_RV2AV;
1805 o->op_ppaddr = ppaddr[OP_RV2AV];
1806 curop = ((UNOP*)o)->op_first;
1807 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1814 convert(I32 type, I32 flags, OP *o)
1819 if (!o || o->op_type != OP_LIST)
1820 o = newLISTOP(OP_LIST, 0, o, Nullop);
1822 o->op_flags &= ~OPf_WANT;
1824 if (!(opargs[type] & OA_MARK))
1825 null(cLISTOPo->op_first);
1828 o->op_ppaddr = ppaddr[type];
1829 o->op_flags |= flags;
1831 o = CHECKOP(type, o);
1832 if (o->op_type != type)
1835 if (cLISTOPo->op_children < 7) {
1836 /* XXX do we really need to do this if we're done appending?? */
1837 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1839 cLISTOPo->op_last = last; /* in case check substituted last arg */
1842 return fold_constants(o);
1845 /* List constructors */
1848 append_elem(I32 type, OP *first, OP *last)
1856 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1857 return newLISTOP(type, 0, first, last);
1859 if (first->op_flags & OPf_KIDS)
1860 ((LISTOP*)first)->op_last->op_sibling = last;
1862 first->op_flags |= OPf_KIDS;
1863 ((LISTOP*)first)->op_first = last;
1865 ((LISTOP*)first)->op_last = last;
1866 ((LISTOP*)first)->op_children++;
1871 append_list(I32 type, LISTOP *first, LISTOP *last)
1879 if (first->op_type != type)
1880 return prepend_elem(type, (OP*)first, (OP*)last);
1882 if (last->op_type != type)
1883 return append_elem(type, (OP*)first, (OP*)last);
1885 first->op_last->op_sibling = last->op_first;
1886 first->op_last = last->op_last;
1887 first->op_children += last->op_children;
1888 if (first->op_children)
1889 last->op_flags |= OPf_KIDS;
1896 prepend_elem(I32 type, OP *first, OP *last)
1904 if (last->op_type == type) {
1905 if (type == OP_LIST) { /* already a PUSHMARK there */
1906 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1907 ((LISTOP*)last)->op_first->op_sibling = first;
1910 if (!(last->op_flags & OPf_KIDS)) {
1911 ((LISTOP*)last)->op_last = first;
1912 last->op_flags |= OPf_KIDS;
1914 first->op_sibling = ((LISTOP*)last)->op_first;
1915 ((LISTOP*)last)->op_first = first;
1917 ((LISTOP*)last)->op_children++;
1921 return newLISTOP(type, 0, first, last);
1929 return newOP(OP_STUB, 0);
1935 if (!o || o->op_type != OP_LIST)
1936 o = newLISTOP(OP_LIST, 0, o, Nullop);
1942 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1946 Newz(1101, listop, 1, LISTOP);
1948 listop->op_type = type;
1949 listop->op_ppaddr = ppaddr[type];
1950 listop->op_children = (first != 0) + (last != 0);
1951 listop->op_flags = flags;
1955 else if (!first && last)
1958 first->op_sibling = last;
1959 listop->op_first = first;
1960 listop->op_last = last;
1961 if (type == OP_LIST) {
1963 pushop = newOP(OP_PUSHMARK, 0);
1964 pushop->op_sibling = first;
1965 listop->op_first = pushop;
1966 listop->op_flags |= OPf_KIDS;
1968 listop->op_last = pushop;
1970 else if (listop->op_children)
1971 listop->op_flags |= OPf_KIDS;
1977 newOP(I32 type, I32 flags)
1980 Newz(1101, o, 1, OP);
1982 o->op_ppaddr = ppaddr[type];
1983 o->op_flags = flags;
1986 o->op_private = 0 + (flags >> 8);
1987 if (opargs[type] & OA_RETSCALAR)
1989 if (opargs[type] & OA_TARGET)
1990 o->op_targ = pad_alloc(type, SVs_PADTMP);
1991 return CHECKOP(type, o);
1995 newUNOP(I32 type, I32 flags, OP *first)
2000 first = newOP(OP_STUB, 0);
2001 if (opargs[type] & OA_MARK)
2002 first = force_list(first);
2004 Newz(1101, unop, 1, UNOP);
2005 unop->op_type = type;
2006 unop->op_ppaddr = ppaddr[type];
2007 unop->op_first = first;
2008 unop->op_flags = flags | OPf_KIDS;
2009 unop->op_private = 1 | (flags >> 8);
2010 unop = (UNOP*) CHECKOP(type, unop);
2014 return fold_constants((OP *) unop);
2018 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2021 Newz(1101, binop, 1, BINOP);
2024 first = newOP(OP_NULL, 0);
2026 binop->op_type = type;
2027 binop->op_ppaddr = ppaddr[type];
2028 binop->op_first = first;
2029 binop->op_flags = flags | OPf_KIDS;
2032 binop->op_private = 1 | (flags >> 8);
2035 binop->op_private = 2 | (flags >> 8);
2036 first->op_sibling = last;
2039 binop = (BINOP*)CHECKOP(type, binop);
2043 binop->op_last = last = binop->op_first->op_sibling;
2045 return fold_constants((OP *)binop);
2049 utf8compare(const void *a, const void *b)
2052 for (i = 0; i < 10; i++) {
2053 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2055 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2062 pmtrans(OP *o, OP *expr, OP *repl)
2064 SV *tstr = ((SVOP*)expr)->op_sv;
2065 SV *rstr = ((SVOP*)repl)->op_sv;
2068 register U8 *t = (U8*)SvPV(tstr, tlen);
2069 register U8 *r = (U8*)SvPV(rstr, rlen);
2075 register short *tbl;
2077 complement = o->op_private & OPpTRANS_COMPLEMENT;
2078 del = o->op_private & OPpTRANS_DELETE;
2079 squash = o->op_private & OPpTRANS_SQUASH;
2081 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2082 SV* listsv = newSVpv("# comment\n",0);
2084 U8* tend = t + tlen;
2085 U8* rend = r + rlen;
2101 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2102 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2108 New(1109, cp, tlen, U8*);
2110 transv = newSVpv("",0);
2119 qsort(cp, i, sizeof(U8*), utf8compare);
2120 for (j = 0; j < i; j++) {
2122 UV val = utf8_to_uv(s, &ulen);
2124 diff = val - nextmin;
2126 t = uv_to_utf8(tmpbuf,nextmin);
2127 sv_catpvn(transv, tmpbuf, t - tmpbuf);
2129 t = uv_to_utf8(tmpbuf, val - 1);
2130 sv_catpvn(transv, "\377", 1);
2131 sv_catpvn(transv, tmpbuf, t - tmpbuf);
2135 val = utf8_to_uv(s+1, &ulen);
2139 t = uv_to_utf8(tmpbuf,nextmin);
2140 sv_catpvn(transv, tmpbuf, t - tmpbuf);
2141 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2142 sv_catpvn(transv, "\377", 1);
2143 sv_catpvn(transv, tmpbuf, t - tmpbuf);
2145 tlen = SvCUR(transv);
2148 else if (!rlen && !del) {
2149 r = t; rlen = tlen; rend = tend;
2150 if (!squash && to_utf && from_utf)
2151 o->op_private |= OPpTRANS_COUNTONLY;
2154 while (t < tend || tfirst <= tlast) {
2155 /* see if we need more "t" chars */
2156 if (tfirst > tlast) {
2157 tfirst = (I32)utf8_to_uv(t, &ulen);
2159 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2160 tlast = (I32)utf8_to_uv(++t, &ulen);
2167 /* now see if we need more "r" chars */
2168 if (rfirst > rlast) {
2170 rfirst = (I32)utf8_to_uv(r, &ulen);
2172 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2173 rlast = (I32)utf8_to_uv(++r, &ulen);
2182 rfirst = rlast = 0xffffffff;
2186 /* now see which range will peter our first, if either. */
2187 tdiff = tlast - tfirst;
2188 rdiff = rlast - rfirst;
2195 if (rfirst == 0xffffffff) {
2196 diff = tdiff; /* oops, pretend rdiff is infinite */
2198 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2200 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2204 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2206 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2208 if (rfirst + diff > max)
2209 max = rfirst + diff;
2214 else if (rfirst <= 0x800)
2215 grows |= (tfirst < 0x80);
2216 else if (rfirst <= 0x10000)
2217 grows |= (tfirst < 0x800);
2218 else if (rfirst <= 0x200000)
2219 grows |= (tfirst < 0x10000);
2220 else if (rfirst <= 0x4000000)
2221 grows |= (tfirst < 0x200000);
2222 else if (rfirst <= 0x80000000)
2223 grows |= (tfirst < 0x4000000);
2235 else if (max > 0xff)
2240 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2241 SvREFCNT_dec(listsv);
2243 SvREFCNT_dec(transv);
2245 if (!del && havefinal)
2246 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2248 if (grows && to_utf)
2249 o->op_private |= OPpTRANS_GROWS;
2256 tbl = (short*)cPVOPo->op_pv;
2258 Zero(tbl, 256, short);
2259 for (i = 0; i < tlen; i++)
2261 for (i = 0, j = 0; i < 256; i++) {
2277 if (!rlen && !del) {
2280 o->op_private |= OPpTRANS_COUNTONLY;
2282 for (i = 0; i < 256; i++)
2284 for (i = 0, j = 0; i < tlen; i++,j++) {
2287 if (tbl[t[i]] == -1)
2293 if (tbl[t[i]] == -1)
2304 newPMOP(I32 type, I32 flags)
2309 Newz(1101, pmop, 1, PMOP);
2310 pmop->op_type = type;
2311 pmop->op_ppaddr = ppaddr[type];
2312 pmop->op_flags = flags;
2313 pmop->op_private = 0 | (flags >> 8);
2315 if (PL_hints & HINT_RE_TAINT)
2316 pmop->op_pmpermflags |= PMf_RETAINT;
2317 if (PL_hints & HINT_LOCALE)
2318 pmop->op_pmpermflags |= PMf_LOCALE;
2319 pmop->op_pmflags = pmop->op_pmpermflags;
2321 /* link into pm list */
2322 if (type != OP_TRANS && PL_curstash) {
2323 pmop->op_pmnext = HvPMROOT(PL_curstash);
2324 HvPMROOT(PL_curstash) = pmop;
2331 pmruntime(OP *o, OP *expr, OP *repl)
2336 I32 repl_has_vars = 0;
2338 if (o->op_type == OP_TRANS)
2339 return pmtrans(o, expr, repl);
2341 PL_hints |= HINT_BLOCK_SCOPE;
2344 if (expr->op_type == OP_CONST) {
2346 SV *pat = ((SVOP*)expr)->op_sv;
2347 char *p = SvPV(pat, plen);
2348 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2349 sv_setpvn(pat, "\\s+", 3);
2350 p = SvPV(pat, plen);
2351 pm->op_pmflags |= PMf_SKIPWHITE;
2353 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2354 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2355 pm->op_pmflags |= PMf_WHITE;
2359 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2360 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2362 : OP_REGCMAYBE),0,expr);
2364 Newz(1101, rcop, 1, LOGOP);
2365 rcop->op_type = OP_REGCOMP;
2366 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2367 rcop->op_first = scalar(expr);
2368 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2369 ? (OPf_SPECIAL | OPf_KIDS)
2371 rcop->op_private = 1;
2374 /* establish postfix order */
2375 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2377 rcop->op_next = expr;
2378 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2381 rcop->op_next = LINKLIST(expr);
2382 expr->op_next = (OP*)rcop;
2385 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2390 if (pm->op_pmflags & PMf_EVAL)
2393 else if (repl->op_type == OP_THREADSV
2394 && strchr("&`'123456789+",
2395 PL_threadsv_names[repl->op_targ]))
2399 #endif /* USE_THREADS */
2400 else if (repl->op_type == OP_CONST)
2404 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2405 if (opargs[curop->op_type] & OA_DANGEROUS) {
2407 if (curop->op_type == OP_THREADSV) {
2409 if (strchr("&`'123456789+", curop->op_private))
2413 if (curop->op_type == OP_GV) {
2414 GV *gv = ((GVOP*)curop)->op_gv;
2416 if (strchr("&`'123456789+", *GvENAME(gv)))
2419 #endif /* USE_THREADS */
2420 else if (curop->op_type == OP_RV2CV)
2422 else if (curop->op_type == OP_RV2SV ||
2423 curop->op_type == OP_RV2AV ||
2424 curop->op_type == OP_RV2HV ||
2425 curop->op_type == OP_RV2GV) {
2426 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2429 else if (curop->op_type == OP_PADSV ||
2430 curop->op_type == OP_PADAV ||
2431 curop->op_type == OP_PADHV ||
2432 curop->op_type == OP_PADANY) {
2435 else if (curop->op_type == OP_PUSHRE)
2436 ; /* Okay here, dangerous in newASSIGNOP */
2445 && (!pm->op_pmregexp
2446 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2447 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2448 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2449 prepend_elem(o->op_type, scalar(repl), o);
2452 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2453 pm->op_pmflags |= PMf_MAYBE_CONST;
2454 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2456 Newz(1101, rcop, 1, LOGOP);
2457 rcop->op_type = OP_SUBSTCONT;
2458 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2459 rcop->op_first = scalar(repl);
2460 rcop->op_flags |= OPf_KIDS;
2461 rcop->op_private = 1;
2464 /* establish postfix order */
2465 rcop->op_next = LINKLIST(repl);
2466 repl->op_next = (OP*)rcop;
2468 pm->op_pmreplroot = scalar((OP*)rcop);
2469 pm->op_pmreplstart = LINKLIST(rcop);
2478 newSVOP(I32 type, I32 flags, SV *sv)
2481 Newz(1101, svop, 1, SVOP);
2482 svop->op_type = type;
2483 svop->op_ppaddr = ppaddr[type];
2485 svop->op_next = (OP*)svop;
2486 svop->op_flags = flags;
2487 if (opargs[type] & OA_RETSCALAR)
2489 if (opargs[type] & OA_TARGET)
2490 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2491 return CHECKOP(type, svop);
2495 newGVOP(I32 type, I32 flags, GV *gv)
2499 Newz(1101, gvop, 1, GVOP);
2500 gvop->op_type = type;
2501 gvop->op_ppaddr = ppaddr[type];
2502 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2503 gvop->op_next = (OP*)gvop;
2504 gvop->op_flags = flags;
2505 if (opargs[type] & OA_RETSCALAR)
2507 if (opargs[type] & OA_TARGET)
2508 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2509 return CHECKOP(type, gvop);
2513 newPVOP(I32 type, I32 flags, char *pv)
2516 Newz(1101, pvop, 1, PVOP);
2517 pvop->op_type = type;
2518 pvop->op_ppaddr = ppaddr[type];
2520 pvop->op_next = (OP*)pvop;
2521 pvop->op_flags = flags;
2522 if (opargs[type] & OA_RETSCALAR)
2524 if (opargs[type] & OA_TARGET)
2525 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2526 return CHECKOP(type, pvop);
2535 save_hptr(&PL_curstash);
2536 save_item(PL_curstname);
2541 name = SvPV(sv, len);
2542 PL_curstash = gv_stashpvn(name,len,TRUE);
2543 sv_setpvn(PL_curstname, name, len);
2547 sv_setpv(PL_curstname,"<none>");
2548 PL_curstash = Nullhv;
2550 PL_copline = NOLINE;
2555 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2563 if (id->op_type != OP_CONST)
2564 croak("Module name must be constant");
2568 if(version != Nullop) {
2569 SV *vesv = ((SVOP*)version)->op_sv;
2571 if (arg == Nullop && !SvNIOK(vesv)) {
2578 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2579 croak("Version number must be constant number");
2581 /* Make copy of id so we don't free it twice */
2582 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2584 /* Fake up a method call to VERSION */
2585 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2586 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2587 append_elem(OP_LIST,
2588 prepend_elem(OP_LIST, pack, list(version)),
2589 newUNOP(OP_METHOD, 0, meth)));
2593 /* Fake up an import/unimport */
2594 if (arg && arg->op_type == OP_STUB)
2595 imop = arg; /* no import on explicit () */
2596 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2597 imop = Nullop; /* use 5.0; */
2600 /* Make copy of id so we don't free it twice */
2601 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2602 meth = newSVOP(OP_CONST, 0,
2604 ? newSVpv("import", 6)
2605 : newSVpv("unimport", 8)
2607 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2608 append_elem(OP_LIST,
2609 prepend_elem(OP_LIST, pack, list(arg)),
2610 newUNOP(OP_METHOD, 0, meth)));
2613 /* Fake up a require */
2614 rqop = newUNOP(OP_REQUIRE, 0, id);
2616 /* Fake up the BEGIN {}, which does its thing immediately. */
2618 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2620 append_elem(OP_LINESEQ,
2621 append_elem(OP_LINESEQ,
2622 newSTATEOP(0, Nullch, rqop),
2623 newSTATEOP(0, Nullch, veop)),
2624 newSTATEOP(0, Nullch, imop) ));
2626 PL_copline = NOLINE;
2631 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2633 return newBINOP(OP_LSLICE, flags,
2634 list(force_list(subscript)),
2635 list(force_list(listval)) );
2639 list_assignment(register OP *o)
2644 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2645 o = cUNOPo->op_first;
2647 if (o->op_type == OP_COND_EXPR) {
2648 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2649 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2654 yyerror("Assignment to both a list and a scalar");
2658 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2659 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2660 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2663 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2666 if (o->op_type == OP_RV2SV)
2673 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2678 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2679 return newLOGOP(optype, 0,
2680 mod(scalar(left), optype),
2681 newUNOP(OP_SASSIGN, 0, scalar(right)));
2684 return newBINOP(optype, OPf_STACKED,
2685 mod(scalar(left), optype), scalar(right));
2689 if (list_assignment(left)) {
2692 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2693 left = mod(left, OP_AASSIGN);
2701 o = newBINOP(OP_AASSIGN, flags,
2702 list(force_list(right)),
2703 list(force_list(left)) );
2704 o->op_private = 0 | (flags >> 8);
2705 if (!(left->op_private & OPpLVAL_INTRO)) {
2709 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2710 if (opargs[curop->op_type] & OA_DANGEROUS) {
2711 if (curop->op_type == OP_GV) {
2712 GV *gv = ((GVOP*)curop)->op_gv;
2713 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2715 SvCUR(gv) = PL_generation;
2717 else if (curop->op_type == OP_PADSV ||
2718 curop->op_type == OP_PADAV ||
2719 curop->op_type == OP_PADHV ||
2720 curop->op_type == OP_PADANY) {
2721 SV **svp = AvARRAY(PL_comppad_name);
2722 SV *sv = svp[curop->op_targ];
2723 if (SvCUR(sv) == PL_generation)
2725 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2727 else if (curop->op_type == OP_RV2CV)
2729 else if (curop->op_type == OP_RV2SV ||
2730 curop->op_type == OP_RV2AV ||
2731 curop->op_type == OP_RV2HV ||
2732 curop->op_type == OP_RV2GV) {
2733 if (lastop->op_type != OP_GV) /* funny deref? */
2736 else if (curop->op_type == OP_PUSHRE) {
2737 if (((PMOP*)curop)->op_pmreplroot) {
2738 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2739 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2741 SvCUR(gv) = PL_generation;
2750 o->op_private = OPpASSIGN_COMMON;
2752 if (right && right->op_type == OP_SPLIT) {
2754 if ((tmpop = ((LISTOP*)right)->op_first) &&
2755 tmpop->op_type == OP_PUSHRE)
2757 PMOP *pm = (PMOP*)tmpop;
2758 if (left->op_type == OP_RV2AV &&
2759 !(left->op_private & OPpLVAL_INTRO) &&
2760 !(o->op_private & OPpASSIGN_COMMON) )
2762 tmpop = ((UNOP*)left)->op_first;
2763 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2764 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2765 pm->op_pmflags |= PMf_ONCE;
2766 tmpop = cUNOPo->op_first; /* to list (nulled) */
2767 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2768 tmpop->op_sibling = Nullop; /* don't free split */
2769 right->op_next = tmpop->op_next; /* fix starting loc */
2770 op_free(o); /* blow off assign */
2771 right->op_flags &= ~OPf_WANT;
2772 /* "I don't know and I don't care." */
2777 if (PL_modcount < 10000 &&
2778 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2780 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2782 sv_setiv(sv, PL_modcount+1);
2790 right = newOP(OP_UNDEF, 0);
2791 if (right->op_type == OP_READLINE) {
2792 right->op_flags |= OPf_STACKED;
2793 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2796 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2797 o = newBINOP(OP_SASSIGN, flags,
2798 scalar(right), mod(scalar(left), OP_SASSIGN) );
2810 newSTATEOP(I32 flags, char *label, OP *o)
2813 U32 seq = intro_my();
2816 Newz(1101, cop, 1, COP);
2817 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2818 cop->op_type = OP_DBSTATE;
2819 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2822 cop->op_type = OP_NEXTSTATE;
2823 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2825 cop->op_flags = flags;
2826 cop->op_private = (PL_hints & HINT_UTF8);
2828 cop->op_private |= NATIVE_HINTS;
2830 compiling.op_private = cop->op_private;
2831 cop->op_next = (OP*)cop;
2834 cop->cop_label = label;
2835 PL_hints |= HINT_BLOCK_SCOPE;
2838 cop->cop_arybase = PL_curcop->cop_arybase;
2839 if (PL_curcop->cop_warnings == WARN_NONE
2840 || PL_curcop->cop_warnings == WARN_ALL)
2841 cop->cop_warnings = PL_curcop->cop_warnings ;
2843 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
2846 if (PL_copline == NOLINE)
2847 cop->cop_line = PL_curcop->cop_line;
2849 cop->cop_line = PL_copline;
2850 PL_copline = NOLINE;
2852 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2853 cop->cop_stash = PL_curstash;
2855 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2856 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2857 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2858 (void)SvIOK_on(*svp);
2860 SvSTASH(*svp) = (HV*)cop;
2864 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2867 /* "Introduce" my variables to visible status. */
2875 if (! PL_min_intro_pending)
2876 return PL_cop_seqmax;
2878 svp = AvARRAY(PL_comppad_name);
2879 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2880 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2881 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2882 SvNVX(sv) = (double)PL_cop_seqmax;
2885 PL_min_intro_pending = 0;
2886 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2887 return PL_cop_seqmax++;
2891 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2893 return new_logop(type, flags, &first, &other);
2897 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2902 OP *first = *firstp;
2903 OP *other = *otherp;
2905 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2906 return newBINOP(type, flags, scalar(first), scalar(other));
2908 scalarboolean(first);
2909 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2910 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2911 if (type == OP_AND || type == OP_OR) {
2917 first = *firstp = cUNOPo->op_first;
2919 first->op_next = o->op_next;
2920 cUNOPo->op_first = Nullop;
2924 if (first->op_type == OP_CONST) {
2925 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
2926 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
2928 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2939 else if (first->op_type == OP_WANTARRAY) {
2945 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
2946 OP *k1 = ((UNOP*)first)->op_first;
2947 OP *k2 = k1->op_sibling;
2949 switch (first->op_type)
2952 if (k2 && k2->op_type == OP_READLINE
2953 && (k2->op_flags & OPf_STACKED)
2954 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2955 warnop = k2->op_type;
2959 if (k1->op_type == OP_READDIR
2960 || k1->op_type == OP_GLOB
2961 || k1->op_type == OP_EACH)
2962 warnop = k1->op_type;
2966 line_t oldline = PL_curcop->cop_line;
2967 PL_curcop->cop_line = PL_copline;
2969 "Value of %s%s can be \"0\"; test with defined()",
2971 ((warnop == OP_READLINE || warnop == OP_GLOB)
2972 ? " construct" : "() operator"));
2973 PL_curcop->cop_line = oldline;
2980 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2981 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2983 Newz(1101, logop, 1, LOGOP);
2985 logop->op_type = type;
2986 logop->op_ppaddr = ppaddr[type];
2987 logop->op_first = first;
2988 logop->op_flags = flags | OPf_KIDS;
2989 logop->op_other = LINKLIST(other);
2990 logop->op_private = 1 | (flags >> 8);
2992 /* establish postfix order */
2993 logop->op_next = LINKLIST(first);
2994 first->op_next = (OP*)logop;
2995 first->op_sibling = other;
2997 o = newUNOP(OP_NULL, 0, (OP*)logop);
3004 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3011 return newLOGOP(OP_AND, 0, first, trueop);
3013 return newLOGOP(OP_OR, 0, first, falseop);
3015 scalarboolean(first);
3016 if (first->op_type == OP_CONST) {
3017 if (SvTRUE(((SVOP*)first)->op_sv)) {
3028 else if (first->op_type == OP_WANTARRAY) {
3032 Newz(1101, condop, 1, CONDOP);
3034 condop->op_type = OP_COND_EXPR;
3035 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
3036 condop->op_first = first;
3037 condop->op_flags = flags | OPf_KIDS;
3038 condop->op_true = LINKLIST(trueop);
3039 condop->op_false = LINKLIST(falseop);
3040 condop->op_private = 1 | (flags >> 8);
3042 /* establish postfix order */
3043 condop->op_next = LINKLIST(first);
3044 first->op_next = (OP*)condop;
3046 first->op_sibling = trueop;
3047 trueop->op_sibling = falseop;
3048 o = newUNOP(OP_NULL, 0, (OP*)condop);
3050 trueop->op_next = o;
3051 falseop->op_next = o;
3057 newRANGE(I32 flags, OP *left, OP *right)
3065 Newz(1101, condop, 1, CONDOP);
3067 condop->op_type = OP_RANGE;
3068 condop->op_ppaddr = ppaddr[OP_RANGE];
3069 condop->op_first = left;
3070 condop->op_flags = OPf_KIDS;
3071 condop->op_true = LINKLIST(left);
3072 condop->op_false = LINKLIST(right);
3073 condop->op_private = 1 | (flags >> 8);
3075 left->op_sibling = right;
3077 condop->op_next = (OP*)condop;
3078 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3079 flop = newUNOP(OP_FLOP, 0, flip);
3080 o = newUNOP(OP_NULL, 0, flop);
3083 left->op_next = flip;
3084 right->op_next = flop;
3086 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3087 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3088 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3089 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3091 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3092 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3095 if (!flip->op_private || !flop->op_private)
3096 linklist(o); /* blow off optimizer unless constant */
3102 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3107 int once = block && block->op_flags & OPf_SPECIAL &&
3108 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3111 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3112 return block; /* do {} while 0 does once */
3113 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3114 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3115 expr = newUNOP(OP_DEFINED, 0,
3116 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3117 } else if (expr->op_flags & OPf_KIDS) {
3118 OP *k1 = ((UNOP*)expr)->op_first;
3119 OP *k2 = (k1) ? k1->op_sibling : NULL;
3120 switch (expr->op_type) {
3122 if (k2 && k2->op_type == OP_READLINE
3123 && (k2->op_flags & OPf_STACKED)
3124 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3125 expr = newUNOP(OP_DEFINED, 0, expr);
3129 if (k1->op_type == OP_READDIR
3130 || k1->op_type == OP_GLOB
3131 || k1->op_type == OP_EACH)
3132 expr = newUNOP(OP_DEFINED, 0, expr);
3138 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3139 o = new_logop(OP_AND, 0, &expr, &listop);
3142 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3144 if (once && o != listop)
3145 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3148 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3150 o->op_flags |= flags;
3152 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3157 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3166 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3167 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3168 expr = newUNOP(OP_DEFINED, 0,
3169 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3170 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3171 OP *k1 = ((UNOP*)expr)->op_first;
3172 OP *k2 = (k1) ? k1->op_sibling : NULL;
3173 switch (expr->op_type) {
3175 if (k2 && k2->op_type == OP_READLINE
3176 && (k2->op_flags & OPf_STACKED)
3177 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3178 expr = newUNOP(OP_DEFINED, 0, expr);
3182 if (k1->op_type == OP_READDIR
3183 || k1->op_type == OP_GLOB
3184 || k1->op_type == OP_EACH)
3185 expr = newUNOP(OP_DEFINED, 0, expr);
3191 block = newOP(OP_NULL, 0);
3194 next = LINKLIST(cont);
3196 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3197 if ((line_t)whileline != NOLINE) {
3198 PL_copline = whileline;
3199 cont = append_elem(OP_LINESEQ, cont,
3200 newSTATEOP(0, Nullch, Nullop));
3204 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3205 redo = LINKLIST(listop);
3208 PL_copline = whileline;
3210 o = new_logop(OP_AND, 0, &expr, &listop);
3211 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3212 op_free(expr); /* oops, it's a while (0) */
3214 return Nullop; /* listop already freed by new_logop */
3217 ((LISTOP*)listop)->op_last->op_next = condop =
3218 (o == listop ? redo : LINKLIST(o));
3226 Newz(1101,loop,1,LOOP);
3227 loop->op_type = OP_ENTERLOOP;
3228 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
3229 loop->op_private = 0;
3230 loop->op_next = (OP*)loop;
3233 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3235 loop->op_redoop = redo;
3236 loop->op_lastop = o;
3239 loop->op_nextop = next;
3241 loop->op_nextop = o;
3243 o->op_flags |= flags;
3244 o->op_private |= (flags >> 8);
3249 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3257 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3258 sv->op_type = OP_RV2GV;
3259 sv->op_ppaddr = ppaddr[OP_RV2GV];
3261 else if (sv->op_type == OP_PADSV) { /* private variable */
3262 padoff = sv->op_targ;
3266 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3267 padoff = sv->op_targ;
3268 iterflags |= OPf_SPECIAL;
3273 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3277 padoff = find_threadsv("_");
3278 iterflags |= OPf_SPECIAL;
3280 sv = newGVOP(OP_GV, 0, PL_defgv);
3283 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3284 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3285 iterflags |= OPf_STACKED;
3287 else if (expr->op_type == OP_NULL &&
3288 (expr->op_flags & OPf_KIDS) &&
3289 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3291 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3292 * set the STACKED flag to indicate that these values are to be
3293 * treated as min/max values by 'pp_iterinit'.
3295 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3296 CONDOP* range = (CONDOP*) flip->op_first;
3297 OP* left = range->op_first;
3298 OP* right = left->op_sibling;
3301 range->op_flags &= ~OPf_KIDS;
3302 range->op_first = Nullop;
3304 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3305 listop->op_first->op_next = range->op_true;
3306 left->op_next = range->op_false;
3307 right->op_next = (OP*)listop;
3308 listop->op_next = listop->op_first;
3311 expr = (OP*)(listop);
3313 iterflags |= OPf_STACKED;
3316 expr = mod(force_list(expr), OP_GREPSTART);
3320 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3321 append_elem(OP_LIST, expr, scalar(sv))));
3322 assert(!loop->op_next);
3323 Renew(loop, 1, LOOP);
3324 loop->op_targ = padoff;
3325 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3326 PL_copline = forline;
3327 return newSTATEOP(0, label, wop);
3331 newLOOPEX(I32 type, OP *label)
3335 if (type != OP_GOTO || label->op_type == OP_CONST) {
3336 /* "last()" means "last" */
3337 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3338 o = newOP(type, OPf_SPECIAL);
3340 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3341 ? SvPVx(((SVOP*)label)->op_sv, PL_na)
3347 if (label->op_type == OP_ENTERSUB)
3348 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3349 o = newUNOP(type, OPf_STACKED, label);
3351 PL_hints |= HINT_BLOCK_SCOPE;
3361 MUTEX_DESTROY(CvMUTEXP(cv));
3362 Safefree(CvMUTEXP(cv));
3365 #endif /* USE_THREADS */
3367 if (!CvXSUB(cv) && CvROOT(cv)) {
3369 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3370 croak("Can't undef active subroutine");
3373 croak("Can't undef active subroutine");
3374 #endif /* USE_THREADS */
3377 SAVESPTR(PL_curpad);
3381 op_free(CvROOT(cv));
3382 CvROOT(cv) = Nullop;
3385 SvPOK_off((SV*)cv); /* forget prototype */
3387 SvREFCNT_dec(CvGV(cv));
3389 SvREFCNT_dec(CvOUTSIDE(cv));
3390 CvOUTSIDE(cv) = Nullcv;
3391 if (CvPADLIST(cv)) {
3392 /* may be during global destruction */
3393 if (SvREFCNT(CvPADLIST(cv))) {
3394 I32 i = AvFILLp(CvPADLIST(cv));
3396 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3397 SV* sv = svp ? *svp : Nullsv;
3400 if (sv == (SV*)PL_comppad_name)
3401 PL_comppad_name = Nullav;
3402 else if (sv == (SV*)PL_comppad) {
3403 PL_comppad = Nullav;
3404 PL_curpad = Null(SV**);
3408 SvREFCNT_dec((SV*)CvPADLIST(cv));
3410 CvPADLIST(cv) = Nullav;
3414 #ifdef DEBUG_CLOSURES
3419 CV *outside = CvOUTSIDE(cv);
3420 AV* padlist = CvPADLIST(cv);
3427 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3429 (CvANON(cv) ? "ANON"
3430 : (cv == PL_main_cv) ? "MAIN"
3431 : CvUNIQUE(outside) ? "UNIQUE"
3432 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3435 : CvANON(outside) ? "ANON"
3436 : (outside == PL_main_cv) ? "MAIN"
3437 : CvUNIQUE(outside) ? "UNIQUE"
3438 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3443 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3444 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3445 pname = AvARRAY(pad_name);
3446 ppad = AvARRAY(pad);
3448 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3449 if (SvPOK(pname[ix]))
3450 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3452 SvFAKE(pname[ix]) ? "FAKE " : "",
3454 (long)I_32(SvNVX(pname[ix])),
3455 (long)SvIVX(pname[ix]));
3458 #endif /* DEBUG_CLOSURES */
3461 cv_clone2(CV *proto, CV *outside)
3466 AV* protopadlist = CvPADLIST(proto);
3467 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3468 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3469 SV** pname = AvARRAY(protopad_name);
3470 SV** ppad = AvARRAY(protopad);
3471 I32 fname = AvFILLp(protopad_name);
3472 I32 fpad = AvFILLp(protopad);
3476 assert(!CvUNIQUE(proto));
3479 SAVESPTR(PL_curpad);
3480 SAVESPTR(PL_comppad);
3481 SAVESPTR(PL_comppad_name);
3482 SAVESPTR(PL_compcv);
3484 cv = PL_compcv = (CV*)NEWSV(1104,0);
3485 sv_upgrade((SV *)cv, SvTYPE(proto));
3491 New(666, CvMUTEXP(cv), 1, perl_mutex);
3492 MUTEX_INIT(CvMUTEXP(cv));
3494 #endif /* USE_THREADS */
3495 CvFILEGV(cv) = CvFILEGV(proto);
3496 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3497 CvSTASH(cv) = CvSTASH(proto);
3498 CvROOT(cv) = CvROOT(proto);
3499 CvSTART(cv) = CvSTART(proto);
3501 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3504 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3506 PL_comppad_name = newAV();
3507 for (ix = fname; ix >= 0; ix--)
3508 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3510 PL_comppad = newAV();
3512 comppadlist = newAV();
3513 AvREAL_off(comppadlist);
3514 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3515 av_store(comppadlist, 1, (SV*)PL_comppad);
3516 CvPADLIST(cv) = comppadlist;
3517 av_fill(PL_comppad, AvFILLp(protopad));
3518 PL_curpad = AvARRAY(PL_comppad);
3520 av = newAV(); /* will be @_ */
3522 av_store(PL_comppad, 0, (SV*)av);
3523 AvFLAGS(av) = AVf_REIFY;
3525 for (ix = fpad; ix > 0; ix--) {
3526 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3527 if (namesv && namesv != &PL_sv_undef) {
3528 char *name = SvPVX(namesv); /* XXX */
3529 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3530 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3531 CvOUTSIDE(cv), cxstack_ix);
3533 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3535 croak("panic: cv_clone: %s", name);
3537 else { /* our own lexical */
3540 /* anon code -- we'll come back for it */
3541 sv = SvREFCNT_inc(ppad[ix]);
3543 else if (*name == '@')
3545 else if (*name == '%')
3555 SV* sv = NEWSV(0,0);
3561 /* Now that vars are all in place, clone nested closures. */
3563 for (ix = fpad; ix > 0; ix--) {
3564 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3566 && namesv != &PL_sv_undef
3567 && !(SvFLAGS(namesv) & SVf_FAKE)
3568 && *SvPVX(namesv) == '&'
3569 && CvCLONE(ppad[ix]))
3571 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3572 SvREFCNT_dec(ppad[ix]);
3575 PL_curpad[ix] = (SV*)kid;
3579 #ifdef DEBUG_CLOSURES
3580 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3582 PerlIO_printf(Perl_debug_log, " from:\n");
3584 PerlIO_printf(Perl_debug_log, " to:\n");
3595 return cv_clone2(proto, CvOUTSIDE(proto));
3599 cv_ckproto(CV *cv, GV *gv, char *p)
3601 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3602 SV* msg = sv_newmortal();
3606 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3607 sv_setpv(msg, "Prototype mismatch:");
3609 sv_catpvf(msg, " sub %_", name);
3611 sv_catpvf(msg, " (%s)", SvPVX(cv));
3612 sv_catpv(msg, " vs ");
3614 sv_catpvf(msg, "(%s)", p);
3616 sv_catpv(msg, "none");
3624 if (!cv || !SvPOK(cv) || SvCUR(cv))
3626 return op_const_sv(CvSTART(cv), cv);
3630 op_const_sv(OP *o, CV *cv)
3637 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3638 o = cLISTOPo->op_first->op_sibling;
3640 for (; o; o = o->op_next) {
3641 OPCODE type = o->op_type;
3643 if(sv && o->op_next == o)
3645 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3647 if (type == OP_LEAVESUB || type == OP_RETURN)
3651 if (type == OP_CONST)
3653 else if (type == OP_PADSV && cv) {
3654 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3655 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3656 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3668 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3671 char *name = o ? SvPVx(cSVOPo->op_sv, PL_na) : Nullch;
3672 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3673 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3674 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, PL_na) : Nullch;
3683 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3684 maximum a prototype before. */
3685 if (SvTYPE(gv) > SVt_NULL) {
3686 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3687 warn("Runaway prototype");
3688 cv_ckproto((CV*)gv, NULL, ps);
3691 sv_setpv((SV*)gv, ps);
3693 sv_setiv((SV*)gv, -1);
3694 SvREFCNT_dec(PL_compcv);
3695 cv = PL_compcv = NULL;
3696 PL_sub_generation++;
3700 if (!name || GvCVGEN(gv))
3702 else if (cv = GvCV(gv)) {
3703 cv_ckproto(cv, gv, ps);
3704 /* already defined (or promised)? */
3705 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3707 bool const_changed = TRUE;
3709 /* just a "sub foo;" when &foo is already defined */
3710 SAVEFREESV(PL_compcv);
3713 /* ahem, death to those who redefine active sort subs */
3714 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3715 croak("Can't redefine active sort subroutine %s", name);
3716 if(const_sv = cv_const_sv(cv))
3717 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3718 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3719 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3720 && HvNAME(GvSTASH(CvGV(cv)))
3721 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3723 line_t oldline = PL_curcop->cop_line;
3724 PL_curcop->cop_line = PL_copline;
3725 warner(WARN_REDEFINE,
3726 const_sv ? "Constant subroutine %s redefined"
3727 : "Subroutine %s redefined", name);
3728 PL_curcop->cop_line = oldline;
3734 if (cv) { /* must reuse cv if autoloaded */
3736 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3737 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3738 CvOUTSIDE(PL_compcv) = 0;
3739 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3740 CvPADLIST(PL_compcv) = 0;
3741 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3742 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3743 SvREFCNT_dec(PL_compcv);
3750 PL_sub_generation++;
3753 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3754 CvFILEGV(cv) = PL_curcop->cop_filegv;
3755 CvSTASH(cv) = PL_curstash;
3759 New(666, CvMUTEXP(cv), 1, perl_mutex);
3760 MUTEX_INIT(CvMUTEXP(cv));
3761 #endif /* USE_THREADS */
3764 sv_setpv((SV*)cv, ps);
3766 if (PL_error_count) {
3770 char *s = strrchr(name, ':');
3772 if (strEQ(s, "BEGIN")) {
3774 "BEGIN not safe after errors--compilation aborted";
3778 /* force display of errors found but not reported */
3779 sv_catpv(ERRSV, not_safe);
3780 croak("%s", SvPVx(ERRSV, PL_na));
3787 PL_copline = NOLINE;
3792 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3793 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3796 SV **namep = AvARRAY(PL_comppad_name);
3797 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3800 if (SvIMMORTAL(PL_curpad[ix]))
3803 * The only things that a clonable function needs in its
3804 * pad are references to outer lexicals and anonymous subs.
3805 * The rest are created anew during cloning.
3807 if (!((namesv = namep[ix]) != Nullsv &&
3808 namesv != &PL_sv_undef &&
3810 *SvPVX(namesv) == '&')))
3812 SvREFCNT_dec(PL_curpad[ix]);
3813 PL_curpad[ix] = Nullsv;
3818 AV *av = newAV(); /* Will be @_ */
3820 av_store(PL_comppad, 0, (SV*)av);
3821 AvFLAGS(av) = AVf_REIFY;
3823 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3824 if (SvIMMORTAL(PL_curpad[ix]))
3826 if (!SvPADMY(PL_curpad[ix]))
3827 SvPADTMP_on(PL_curpad[ix]);
3831 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3832 CvSTART(cv) = LINKLIST(CvROOT(cv));
3833 CvROOT(cv)->op_next = 0;
3839 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3840 SV *sv = NEWSV(0,0);
3841 SV *tmpstr = sv_newmortal();
3842 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3846 sv_setpvf(sv, "%_:%ld-%ld",
3847 GvSV(PL_curcop->cop_filegv),
3848 (long)PL_subline, (long)PL_curcop->cop_line);
3849 gv_efullname3(tmpstr, gv, Nullch);
3850 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3851 hv = GvHVn(db_postponed);
3852 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3853 && (cv = GvCV(db_postponed))) {
3858 perl_call_sv((SV*)cv, G_DISCARD);
3862 if ((s = strrchr(name,':')))
3866 if (strEQ(s, "BEGIN")) {
3867 I32 oldscope = PL_scopestack_ix;
3869 SAVESPTR(PL_compiling.cop_filegv);
3870 SAVEI16(PL_compiling.cop_line);
3872 sv_setsv(PL_rs, PL_nrs);
3875 PL_beginav = newAV();
3876 DEBUG_x( dump_sub(gv) );
3877 av_push(PL_beginav, (SV *)cv);
3879 call_list(oldscope, PL_beginav);
3881 PL_curcop = &PL_compiling;
3882 PL_compiling.op_private = PL_hints;
3885 else if (strEQ(s, "END") && !PL_error_count) {
3888 av_unshift(PL_endav, 1);
3889 av_store(PL_endav, 0, (SV *)cv);
3892 else if (strEQ(s, "INIT") && !PL_error_count) {
3894 PL_initav = newAV();
3895 av_push(PL_initav, SvREFCNT_inc(cv));
3901 PL_copline = NOLINE;
3907 newCONSTSUB(HV *stash, char *name, SV *sv)
3910 U32 oldhints = PL_hints;
3911 HV *old_cop_stash = PL_curcop->cop_stash;
3912 HV *old_curstash = PL_curstash;
3913 line_t oldline = PL_curcop->cop_line;
3914 PL_curcop->cop_line = PL_copline;
3916 PL_hints &= ~HINT_BLOCK_SCOPE;
3918 PL_curstash = PL_curcop->cop_stash = stash;
3921 start_subparse(FALSE, 0),
3922 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3923 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
3924 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3927 PL_hints = oldhints;
3928 PL_curcop->cop_stash = old_cop_stash;
3929 PL_curstash = old_curstash;
3930 PL_curcop->cop_line = oldline;
3934 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3937 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3940 if (cv = (name ? GvCV(gv) : Nullcv)) {
3942 /* just a cached method */
3946 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3947 /* already defined (or promised) */
3948 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
3949 && HvNAME(GvSTASH(CvGV(cv)))
3950 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3951 line_t oldline = PL_curcop->cop_line;
3952 PL_curcop->cop_line = PL_copline;
3953 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
3954 PL_curcop->cop_line = oldline;
3961 if (cv) /* must reuse cv if autoloaded */
3964 cv = (CV*)NEWSV(1105,0);
3965 sv_upgrade((SV *)cv, SVt_PVCV);
3969 PL_sub_generation++;
3972 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3974 New(666, CvMUTEXP(cv), 1, perl_mutex);
3975 MUTEX_INIT(CvMUTEXP(cv));
3977 #endif /* USE_THREADS */
3978 CvFILEGV(cv) = gv_fetchfile(filename);
3979 CvXSUB(cv) = subaddr;
3982 char *s = strrchr(name,':');
3987 if (strEQ(s, "BEGIN")) {
3989 PL_beginav = newAV();
3990 av_push(PL_beginav, (SV *)cv);
3993 else if (strEQ(s, "END")) {
3996 av_unshift(PL_endav, 1);
3997 av_store(PL_endav, 0, (SV *)cv);
4000 else if (strEQ(s, "INIT")) {
4002 PL_initav = newAV();
4003 av_push(PL_initav, (SV *)cv);
4013 newFORM(I32 floor, OP *o, OP *block)
4022 name = SvPVx(cSVOPo->op_sv, PL_na);
4025 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4027 if (cv = GvFORM(gv)) {
4028 if (ckWARN(WARN_REDEFINE)) {
4029 line_t oldline = PL_curcop->cop_line;
4031 PL_curcop->cop_line = PL_copline;
4032 warner(WARN_REDEFINE, "Format %s redefined",name);
4033 PL_curcop->cop_line = oldline;
4039 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4040 CvFILEGV(cv) = PL_curcop->cop_filegv;
4042 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4043 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4044 SvPADTMP_on(PL_curpad[ix]);
4047 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4048 CvSTART(cv) = LINKLIST(CvROOT(cv));
4049 CvROOT(cv)->op_next = 0;
4052 PL_copline = NOLINE;
4059 return newUNOP(OP_REFGEN, 0,
4060 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4066 return newUNOP(OP_REFGEN, 0,
4067 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4071 newANONSUB(I32 floor, OP *proto, OP *block)
4073 return newUNOP(OP_REFGEN, 0,
4074 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4080 switch (o->op_type) {
4082 o->op_type = OP_PADAV;
4083 o->op_ppaddr = ppaddr[OP_PADAV];
4084 return ref(o, OP_RV2AV);
4087 o->op_type = OP_RV2AV;
4088 o->op_ppaddr = ppaddr[OP_RV2AV];
4093 warn("oops: oopsAV");
4102 switch (o->op_type) {
4105 o->op_type = OP_PADHV;
4106 o->op_ppaddr = ppaddr[OP_PADHV];
4107 return ref(o, OP_RV2HV);
4111 o->op_type = OP_RV2HV;
4112 o->op_ppaddr = ppaddr[OP_RV2HV];
4117 warn("oops: oopsHV");
4126 if (o->op_type == OP_PADANY) {
4127 o->op_type = OP_PADAV;
4128 o->op_ppaddr = ppaddr[OP_PADAV];
4131 return newUNOP(OP_RV2AV, 0, scalar(o));
4135 newGVREF(I32 type, OP *o)
4137 if (type == OP_MAPSTART)
4138 return newUNOP(OP_NULL, 0, o);
4139 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4145 if (o->op_type == OP_PADANY) {
4146 o->op_type = OP_PADHV;
4147 o->op_ppaddr = ppaddr[OP_PADHV];
4150 return newUNOP(OP_RV2HV, 0, scalar(o));
4156 croak("NOT IMPL LINE %d",__LINE__);
4162 newCVREF(I32 flags, OP *o)
4164 return newUNOP(OP_RV2CV, flags, scalar(o));
4170 if (o->op_type == OP_PADANY) {
4171 o->op_type = OP_PADSV;
4172 o->op_ppaddr = ppaddr[OP_PADSV];
4175 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4176 o->op_flags |= OPpDONE_SVREF;
4179 return newUNOP(OP_RV2SV, 0, scalar(o));
4182 /* Check routines. */
4190 name = NEWSV(1106,0);
4191 sv_upgrade(name, SVt_PVNV);
4192 sv_setpvn(name, "&", 1);
4195 ix = pad_alloc(o->op_type, SVs_PADMY);
4196 av_store(PL_comppad_name, ix, name);
4197 av_store(PL_comppad, ix, cSVOPo->op_sv);
4198 SvPADMY_on(cSVOPo->op_sv);
4199 cSVOPo->op_sv = Nullsv;
4200 cSVOPo->op_targ = ix;
4207 o->op_private = PL_hints;
4214 if (cUNOPo->op_first->op_type == OP_CONCAT)
4215 o->op_flags |= OPf_STACKED;
4222 if (o->op_flags & OPf_KIDS) {
4225 OPCODE type = o->op_type;
4226 o = modkids(ck_fun(o), type);
4227 kid = cUNOPo->op_first;
4228 newop = kUNOP->op_first->op_sibling;
4230 (newop->op_sibling ||
4231 !(opargs[newop->op_type] & OA_RETSCALAR) ||
4232 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4233 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4237 op_free(kUNOP->op_first);
4238 kUNOP->op_first = newop;
4240 o->op_ppaddr = ppaddr[++o->op_type];
4249 if (o->op_flags & OPf_KIDS) {
4250 OP *kid = cUNOPo->op_first;
4251 if (kid->op_type == OP_HSLICE)
4252 o->op_private |= OPpSLICE;
4253 else if (kid->op_type != OP_HELEM)
4254 croak("%s argument is not a HASH element or slice",
4255 op_desc[o->op_type]);
4264 I32 type = o->op_type;
4266 if (o->op_flags & OPf_KIDS) {
4267 if (cLISTOPo->op_first->op_type == OP_STUB) {
4269 o = newUNOP(type, OPf_SPECIAL,
4270 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4280 PL_hints |= HINT_BLOCK_SCOPE;
4281 if (o->op_flags & OPf_KIDS) {
4282 SVOP *kid = (SVOP*)cUNOPo->op_first;
4285 o->op_flags &= ~OPf_KIDS;
4288 else if (kid->op_type == OP_LINESEQ) {
4291 kid->op_next = o->op_next;
4292 cUNOPo->op_first = 0;
4295 Newz(1101, enter, 1, LOGOP);
4296 enter->op_type = OP_ENTERTRY;
4297 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4298 enter->op_private = 0;
4300 /* establish postfix order */
4301 enter->op_next = (OP*)enter;
4303 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4304 o->op_type = OP_LEAVETRY;
4305 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4306 enter->op_other = o;
4314 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4316 o->op_targ = (PADOFFSET)PL_hints;
4324 if (o->op_flags & OPf_STACKED) {
4326 kid = cUNOPo->op_first->op_sibling;
4327 if (kid->op_type == OP_RV2GV)
4339 if (o->op_flags & OPf_KIDS) {
4340 OP *kid = cUNOPo->op_first;
4341 if (kid->op_type != OP_HELEM)
4342 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4349 ck_gvconst(register OP *o)
4351 o = fold_constants(o);
4352 if (o->op_type == OP_CONST)
4358 ck_rvconst(register OP *o)
4361 SVOP *kid = (SVOP*)cUNOPo->op_first;
4363 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4364 if (kid->op_type == OP_CONST) {
4369 name = SvPV(kid->op_sv, PL_na);
4370 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4371 char *badthing = Nullch;
4372 switch (o->op_type) {
4374 badthing = "a SCALAR";
4377 badthing = "an ARRAY";
4380 badthing = "a HASH";
4385 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4389 * This is a little tricky. We only want to add the symbol if we
4390 * didn't add it in the lexer. Otherwise we get duplicate strict
4391 * warnings. But if we didn't add it in the lexer, we must at
4392 * least pretend like we wanted to add it even if it existed before,
4393 * or we get possible typo warnings. OPpCONST_ENTERED says
4394 * whether the lexer already added THIS instance of this symbol.
4396 iscv = (o->op_type == OP_RV2CV) * 2;
4398 gv = gv_fetchpv(name,
4399 iscv | !(kid->op_private & OPpCONST_ENTERED),
4402 : o->op_type == OP_RV2SV
4404 : o->op_type == OP_RV2AV
4406 : o->op_type == OP_RV2HV
4409 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4411 kid->op_type = OP_GV;
4412 SvREFCNT_dec(kid->op_sv);
4413 kid->op_sv = SvREFCNT_inc(gv);
4423 I32 type = o->op_type;
4425 if (o->op_flags & OPf_REF)
4428 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4429 SVOP *kid = (SVOP*)cUNOPo->op_first;
4431 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4432 OP *newop = newGVOP(type, OPf_REF,
4433 gv_fetchpv(SvPVx(kid->op_sv, PL_na), TRUE, SVt_PVIO));
4440 if (type == OP_FTTTY)
4441 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4444 return newUNOP(type, 0, newDEFSVOP());
4457 int type = o->op_type;
4458 register I32 oa = opargs[type] >> OASHIFT;
4460 if (o->op_flags & OPf_STACKED) {
4461 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4464 return no_fh_allowed(o);
4467 if (o->op_flags & OPf_KIDS) {
4468 tokid = &cLISTOPo->op_first;
4469 kid = cLISTOPo->op_first;
4470 if (kid->op_type == OP_PUSHMARK ||
4471 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4473 tokid = &kid->op_sibling;
4474 kid = kid->op_sibling;
4476 if (!kid && opargs[type] & OA_DEFGV)
4477 *tokid = kid = newDEFSVOP();
4481 sibl = kid->op_sibling;
4495 if (kid->op_type == OP_CONST &&
4496 (kid->op_private & OPpCONST_BARE)) {
4497 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4498 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4499 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4500 if (ckWARN(WARN_SYNTAX))
4502 "Array @%s missing the @ in argument %ld of %s()",
4503 name, (long)numargs, op_desc[type]);
4506 kid->op_sibling = sibl;
4509 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4510 bad_type(numargs, "array", op_desc[o->op_type], kid);
4514 if (kid->op_type == OP_CONST &&
4515 (kid->op_private & OPpCONST_BARE)) {
4516 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4517 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4518 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4519 if (ckWARN(WARN_SYNTAX))
4521 "Hash %%%s missing the %% in argument %ld of %s()",
4522 name, (long)numargs, op_desc[type]);
4525 kid->op_sibling = sibl;
4528 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4529 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4534 OP *newop = newUNOP(OP_NULL, 0, kid);
4535 kid->op_sibling = 0;
4537 newop->op_next = newop;
4539 kid->op_sibling = sibl;
4544 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4545 if (kid->op_type == OP_CONST &&
4546 (kid->op_private & OPpCONST_BARE)) {
4547 OP *newop = newGVOP(OP_GV, 0,
4548 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, PL_na), TRUE,
4554 kid->op_sibling = 0;
4555 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4557 kid->op_sibling = sibl;
4563 mod(scalar(kid), type);
4567 tokid = &kid->op_sibling;
4568 kid = kid->op_sibling;
4570 o->op_private |= numargs;
4572 return too_many_arguments(o,op_desc[o->op_type]);
4575 else if (opargs[type] & OA_DEFGV) {
4577 return newUNOP(type, 0, newDEFSVOP());
4581 while (oa & OA_OPTIONAL)
4583 if (oa && oa != OA_LIST)
4584 return too_few_arguments(o,op_desc[o->op_type]);
4594 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4595 append_elem(OP_GLOB, o, newDEFSVOP());
4597 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4598 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4600 if (gv && GvIMPORTED_CV(gv)) {
4601 static int glob_index;
4603 append_elem(OP_GLOB, o,
4604 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4605 o->op_type = OP_LIST;
4606 o->op_ppaddr = ppaddr[OP_LIST];
4607 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4608 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4609 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4610 append_elem(OP_LIST, o,
4611 scalar(newUNOP(OP_RV2CV, 0,
4612 newGVOP(OP_GV, 0, gv)))));
4613 o = newUNOP(OP_NULL, 0, ck_subr(o));
4614 o->op_targ = OP_GLOB; /* hint at what it used to be */
4617 gv = newGVgen("main");
4619 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4629 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4631 o->op_ppaddr = ppaddr[OP_GREPSTART];
4632 Newz(1101, gwop, 1, LOGOP);
4634 if (o->op_flags & OPf_STACKED) {
4637 kid = cLISTOPo->op_first->op_sibling;
4638 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4641 kid->op_next = (OP*)gwop;
4642 o->op_flags &= ~OPf_STACKED;
4644 kid = cLISTOPo->op_first->op_sibling;
4645 if (type == OP_MAPWHILE)
4652 kid = cLISTOPo->op_first->op_sibling;
4653 if (kid->op_type != OP_NULL)
4654 croak("panic: ck_grep");
4655 kid = kUNOP->op_first;
4657 gwop->op_type = type;
4658 gwop->op_ppaddr = ppaddr[type];
4659 gwop->op_first = listkids(o);
4660 gwop->op_flags |= OPf_KIDS;
4661 gwop->op_private = 1;
4662 gwop->op_other = LINKLIST(kid);
4663 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4664 kid->op_next = (OP*)gwop;
4666 kid = cLISTOPo->op_first->op_sibling;
4667 if (!kid || !kid->op_sibling)
4668 return too_few_arguments(o,op_desc[o->op_type]);
4669 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4670 mod(kid, OP_GREPSTART);
4678 if (o->op_flags & OPf_KIDS) {
4679 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4680 if (kid && kid->op_type == OP_CONST)
4681 fbm_compile(((SVOP*)kid)->op_sv, 0);
4687 ck_lengthconst(OP *o)
4689 /* XXX length optimization goes here */
4696 OPCODE type = o->op_type;
4697 return modkids(ck_fun(o), type);
4703 OPCODE type = o->op_type;
4704 return refkids(ck_fun(o), type);
4712 kid = cLISTOPo->op_first;
4715 kid = cLISTOPo->op_first;
4717 if (kid->op_type == OP_PUSHMARK)
4718 kid = kid->op_sibling;
4719 if (kid && o->op_flags & OPf_STACKED)
4720 kid = kid->op_sibling;
4721 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4722 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4723 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4724 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4725 cLISTOPo->op_first->op_sibling = kid;
4726 cLISTOPo->op_last = kid;
4727 kid = kid->op_sibling;
4732 append_elem(o->op_type, o, newDEFSVOP());
4738 if (PL_hints & HINT_LOCALE)
4739 o->op_private |= OPpLOCALE;
4746 ck_fun_locale(OP *o)
4752 if (PL_hints & HINT_LOCALE)
4753 o->op_private |= OPpLOCALE;
4764 if (PL_hints & HINT_LOCALE)
4765 o->op_private |= OPpLOCALE;
4774 o->op_private |= OPpRUNTIME;
4787 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4788 o->op_private |= OPpREPEAT_DOLIST;
4789 cBINOPo->op_first = force_list(cBINOPo->op_first);
4799 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4800 SVOP *kid = (SVOP*)cUNOPo->op_first;
4802 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4804 for (s = SvPVX(kid->op_sv); *s; s++) {
4805 if (*s == ':' && s[1] == ':') {
4807 Move(s+2, s+1, strlen(s+2)+1, char);
4808 --SvCUR(kid->op_sv);
4811 sv_catpvn(kid->op_sv, ".pm", 3);
4820 croak("NOT IMPL LINE %d",__LINE__);
4829 if (o->op_flags & OPf_KIDS) {
4830 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4831 if (kid && kid->op_sibling) {
4832 o->op_type = OP_SSELECT;
4833 o->op_ppaddr = ppaddr[OP_SSELECT];
4835 return fold_constants(o);
4839 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4840 if (kid && kid->op_type == OP_RV2GV)
4841 kid->op_private &= ~HINT_STRICT_REFS;
4848 I32 type = o->op_type;
4850 if (!(o->op_flags & OPf_KIDS)) {
4855 if (!CvUNIQUE(PL_compcv)) {
4856 argop = newOP(OP_PADAV, OPf_REF);
4857 argop->op_targ = 0; /* PL_curpad[0] is @_ */
4860 argop = newUNOP(OP_RV2AV, 0,
4861 scalar(newGVOP(OP_GV, 0,
4862 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4865 argop = newUNOP(OP_RV2AV, 0,
4866 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
4867 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4868 #endif /* USE_THREADS */
4869 return newUNOP(type, 0, scalar(argop));
4871 return scalar(modkids(ck_fun(o), type));
4879 if (PL_hints & HINT_LOCALE)
4880 o->op_private |= OPpLOCALE;
4883 if (o->op_flags & OPf_STACKED) {
4884 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4886 kid = kUNOP->op_first; /* get past rv2gv */
4888 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4890 if (kid->op_type == OP_SCOPE) {
4894 else if (kid->op_type == OP_LEAVE) {
4895 if (o->op_type == OP_SORT) {
4896 null(kid); /* wipe out leave */
4899 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4900 if (k->op_next == kid)
4905 kid->op_next = 0; /* just disconnect the leave */
4906 k = kLISTOP->op_first;
4910 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4911 null(kid); /* wipe out rv2gv */
4912 if (o->op_type == OP_SORT)
4916 o->op_flags |= OPf_SPECIAL;
4928 if (o->op_flags & OPf_STACKED)
4929 return no_fh_allowed(o);
4931 kid = cLISTOPo->op_first;
4932 if (kid->op_type != OP_NULL)
4933 croak("panic: ck_split");
4934 kid = kid->op_sibling;
4935 op_free(cLISTOPo->op_first);
4936 cLISTOPo->op_first = kid;
4938 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4939 cLISTOPo->op_last = kid; /* There was only one element previously */
4942 if (kid->op_type != OP_MATCH) {
4943 OP *sibl = kid->op_sibling;
4944 kid->op_sibling = 0;
4945 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4946 if (cLISTOPo->op_first == cLISTOPo->op_last)
4947 cLISTOPo->op_last = kid;
4948 cLISTOPo->op_first = kid;
4949 kid->op_sibling = sibl;
4952 kid->op_type = OP_PUSHRE;
4953 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4956 if (!kid->op_sibling)
4957 append_elem(OP_SPLIT, o, newDEFSVOP());
4959 kid = kid->op_sibling;
4962 if (!kid->op_sibling)
4963 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4965 kid = kid->op_sibling;
4968 if (kid->op_sibling)
4969 return too_many_arguments(o,op_desc[o->op_type]);
4978 OP *prev = ((cUNOPo->op_first->op_sibling)
4979 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4980 OP *o2 = prev->op_sibling;
4988 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4989 if (cvop->op_type == OP_RV2CV) {
4991 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4992 null(cvop); /* disable rv2cv */
4993 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4994 if (tmpop->op_type == OP_GV) {
4995 cv = GvCVu(tmpop->op_sv);
4996 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4997 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4998 proto = SvPV((SV*)cv, PL_na);
5002 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5003 if (PERLDB_SUB && PL_curstash != PL_debstash)
5004 o->op_private |= OPpENTERSUB_DB;
5005 while (o2 != cvop) {
5009 return too_many_arguments(o, gv_ename(namegv));
5027 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5028 bad_type(arg, "block", gv_ename(namegv), o2);
5033 if (o2->op_type == OP_RV2GV)
5037 OP* sib = kid->op_sibling;
5038 kid->op_sibling = 0;
5039 o2 = newUNOP(OP_RV2GV, 0, kid);
5040 o2->op_sibling = sib;
5041 prev->op_sibling = o2;
5049 if (o2->op_type != OP_RV2GV)
5050 bad_type(arg, "symbol", gv_ename(namegv), o2);
5053 if (o2->op_type != OP_RV2CV)
5054 bad_type(arg, "sub", gv_ename(namegv), o2);
5057 if (o2->op_type != OP_RV2SV
5058 && o2->op_type != OP_PADSV
5059 && o2->op_type != OP_THREADSV)
5061 bad_type(arg, "scalar", gv_ename(namegv), o2);
5065 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5066 bad_type(arg, "array", gv_ename(namegv), o2);
5069 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5070 bad_type(arg, "hash", gv_ename(namegv), o2);
5074 OP* sib = kid->op_sibling;
5075 kid->op_sibling = 0;
5076 o2 = newUNOP(OP_REFGEN, 0, kid);
5077 o2->op_sibling = sib;
5078 prev->op_sibling = o2;
5089 croak("Malformed prototype for %s: %s",
5090 gv_ename(namegv), SvPV((SV*)cv, PL_na));
5095 mod(o2, OP_ENTERSUB);
5097 o2 = o2->op_sibling;
5099 if (proto && !optional &&
5100 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5101 return too_few_arguments(o, gv_ename(namegv));
5108 SvREADONLY_on(cSVOPo->op_sv);
5115 if (o->op_flags & OPf_KIDS) {
5116 SVOP *kid = (SVOP*)cUNOPo->op_first;
5118 if (kid->op_type == OP_NULL)
5119 kid = (SVOP*)kid->op_sibling;
5121 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5122 o->op_flags |= OPf_SPECIAL;
5127 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5130 peep(register OP *o)
5133 register OP* oldop = 0;
5134 if (!o || o->op_seq)
5138 SAVESPTR(PL_curcop);
5139 for (; o; o = o->op_next) {
5145 switch (o->op_type) {
5148 PL_curcop = ((COP*)o); /* for warnings */
5149 o->op_seq = PL_op_seqmax++;
5160 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5162 o->op_seq = PL_op_seqmax++;
5165 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5166 o->op_seq = PL_op_seqmax++;
5167 break; /* Scalar stub must produce undef. List stub is noop */
5171 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5172 PL_curcop = ((COP*)o);
5178 if (oldop && o->op_next) {
5179 oldop->op_next = o->op_next;
5182 o->op_seq = PL_op_seqmax++;
5186 if (o->op_next->op_type == OP_RV2SV) {
5187 if (!(o->op_next->op_private & OPpDEREF)) {
5189 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5190 o->op_next = o->op_next->op_next;
5191 o->op_type = OP_GVSV;
5192 o->op_ppaddr = ppaddr[OP_GVSV];
5195 else if (o->op_next->op_type == OP_RV2AV) {
5196 OP* pop = o->op_next->op_next;
5198 if (pop->op_type == OP_CONST &&
5199 (PL_op = pop->op_next) &&
5200 pop->op_next->op_type == OP_AELEM &&
5201 !(pop->op_next->op_private &
5202 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5203 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5207 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5211 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5212 o->op_next = pop->op_next->op_next;
5213 o->op_type = OP_AELEMFAST;
5214 o->op_ppaddr = ppaddr[OP_AELEMFAST];
5215 o->op_private = (U8)i;
5216 GvAVn(((GVOP*)o)->op_gv);
5219 o->op_seq = PL_op_seqmax++;
5226 o->op_seq = PL_op_seqmax++;
5227 while (cLOGOP->op_other->op_type == OP_NULL)
5228 cLOGOP->op_other = cLOGOP->op_other->op_next;
5229 peep(cLOGOP->op_other);
5233 o->op_seq = PL_op_seqmax++;
5234 peep(cCONDOP->op_true);
5235 peep(cCONDOP->op_false);
5239 o->op_seq = PL_op_seqmax++;
5240 peep(cLOOP->op_redoop);
5241 peep(cLOOP->op_nextop);
5242 peep(cLOOP->op_lastop);
5248 o->op_seq = PL_op_seqmax++;
5249 peep(cPMOP->op_pmreplstart);
5253 o->op_seq = PL_op_seqmax++;
5254 if (ckWARN(WARN_SYNTAX) && o->op_next
5255 && o->op_next->op_type == OP_NEXTSTATE) {
5256 if (o->op_next->op_sibling &&
5257 o->op_next->op_sibling->op_type != OP_EXIT &&
5258 o->op_next->op_sibling->op_type != OP_WARN &&
5259 o->op_next->op_sibling->op_type != OP_DIE) {
5260 line_t oldline = PL_curcop->cop_line;
5262 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5263 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5264 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5265 PL_curcop->cop_line = oldline;
5279 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5280 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5282 rop = (UNOP*)((BINOP*)o)->op_first;
5283 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5285 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5286 if (!SvOBJECT(lexname))
5288 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5289 if (!fields || !GvHV(*fields))
5291 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5292 key = SvPV(*svp, keylen);
5293 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5295 croak("No such field \"%s\" in variable %s of type %s",
5296 key, SvPV(lexname, PL_na), HvNAME(SvSTASH(lexname)));
5298 ind = SvIV(*indsvp);
5300 croak("Bad index while coercing array into hash");
5301 rop->op_type = OP_RV2AV;
5302 rop->op_ppaddr = ppaddr[OP_RV2AV];
5303 o->op_type = OP_AELEM;
5304 o->op_ppaddr = ppaddr[OP_AELEM];
5306 *svp = newSViv(ind);
5311 o->op_seq = PL_op_seqmax++;