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 || SvIVX(sv) == 0)
135 && strEQ(name, SvPVX(sv)))
138 "\"my\" variable %s masks earlier declaration in same %s",
139 name, (SvIVX(sv) == 999999999 ? "scope" : "statement"));
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 (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
699 if (ckWARN(WARN_SYNTAX)) {
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;
716 /* assumes no premature commitment */
717 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
718 || o->op_type == OP_RETURN)
721 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
723 switch (o->op_type) {
725 if (o->op_private & OPpREPEAT_DOLIST)
726 null(((LISTOP*)cBINOPo->op_first)->op_first);
727 scalar(cBINOPo->op_first);
732 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
736 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
737 if (!kPMOP->op_pmreplroot)
738 deprecate("implicit split to @_");
746 if (o->op_flags & OPf_KIDS) {
747 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
753 kid = cLISTOPo->op_first;
755 while (kid = kid->op_sibling) {
761 WITH_THR(PL_curcop = &PL_compiling);
766 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
772 WITH_THR(PL_curcop = &PL_compiling);
785 /* assumes no premature commitment */
786 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || PL_error_count
787 || o->op_type == OP_RETURN)
790 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
792 switch (o->op_type) {
794 if (!(opargs[o->op_type] & OA_FOLDCONST))
798 if (o->op_flags & OPf_STACKED)
802 if (o->op_private == 4)
873 if (!(o->op_private & OPpLVAL_INTRO))
874 useless = op_desc[o->op_type];
881 if (!(o->op_private & OPpLVAL_INTRO) &&
882 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
883 useless = "a variable";
888 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
895 if (ckWARN(WARN_VOID)) {
896 useless = "a constant";
897 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
899 else if (SvPOK(sv)) {
900 if (strnEQ(SvPVX(sv), "di", 2) ||
901 strnEQ(SvPVX(sv), "ds", 2) ||
902 strnEQ(SvPVX(sv), "ig", 2))
907 null(o); /* don't execute a constant */
908 SvREFCNT_dec(sv); /* don't even remember it */
912 o->op_type = OP_PREINC; /* pre-increment is faster */
913 o->op_ppaddr = ppaddr[OP_PREINC];
917 o->op_type = OP_PREDEC; /* pre-decrement is faster */
918 o->op_ppaddr = ppaddr[OP_PREDEC];
924 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
929 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
930 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
931 if (o->op_flags & OPf_STACKED)
937 if (!(o->op_flags & OPf_KIDS))
946 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
953 /* all requires must return a boolean value */
954 o->op_flags &= ~OPf_WANT;
957 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
958 if (!kPMOP->op_pmreplroot)
959 deprecate("implicit split to @_");
965 if (ckWARN(WARN_VOID))
966 warner(WARN_VOID, "Useless use of %s in void context", useless);
975 if (o && o->op_flags & OPf_KIDS) {
976 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
987 /* assumes no premature commitment */
988 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
989 || o->op_type == OP_RETURN)
992 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
994 switch (o->op_type) {
997 list(cBINOPo->op_first);
1002 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1010 if (!(o->op_flags & OPf_KIDS))
1012 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1013 list(cBINOPo->op_first);
1014 return gen_constant_list(o);
1021 kid = cLISTOPo->op_first;
1023 while (kid = kid->op_sibling) {
1024 if (kid->op_sibling)
1029 WITH_THR(PL_curcop = &PL_compiling);
1033 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1034 if (kid->op_sibling)
1039 WITH_THR(PL_curcop = &PL_compiling);
1042 /* all requires must return a boolean value */
1043 o->op_flags &= ~OPf_WANT;
1055 if (o->op_type == OP_LINESEQ ||
1056 o->op_type == OP_SCOPE ||
1057 o->op_type == OP_LEAVE ||
1058 o->op_type == OP_LEAVETRY)
1061 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1062 if (kid->op_sibling) {
1066 PL_curcop = &PL_compiling;
1068 o->op_flags &= ~OPf_PARENS;
1069 if (PL_hints & HINT_BLOCK_SCOPE)
1070 o->op_flags |= OPf_PARENS;
1073 o = newOP(OP_STUB, 0);
1078 modkids(OP *o, I32 type)
1081 if (o && o->op_flags & OPf_KIDS) {
1082 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1089 mod(OP *o, I32 type)
1095 if (!o || PL_error_count)
1098 switch (o->op_type) {
1103 if (!(o->op_private & (OPpCONST_ARYBASE)))
1105 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1106 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1110 SAVEI32(PL_compiling.cop_arybase);
1111 PL_compiling.cop_arybase = 0;
1113 else if (type == OP_REFGEN)
1116 croak("That use of $[ is unsupported");
1119 if (o->op_flags & OPf_PARENS)
1123 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1124 !(o->op_flags & OPf_STACKED)) {
1125 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1126 o->op_ppaddr = ppaddr[OP_RV2CV];
1127 assert(cUNOPo->op_first->op_type == OP_NULL);
1128 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1134 /* grep, foreach, subcalls, refgen */
1135 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1137 yyerror(form("Can't modify %s in %s",
1138 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1139 ? "do block" : op_desc[o->op_type]),
1140 type ? op_desc[type] : "local"));
1154 case OP_RIGHT_SHIFT:
1163 if (!(o->op_flags & OPf_STACKED))
1169 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1175 if (!type && cUNOPo->op_first->op_type != OP_GV)
1176 croak("Can't localize through a reference");
1177 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1178 PL_modcount = 10000;
1179 return o; /* Treat \(@foo) like ordinary list. */
1183 if (scalar_mod_type(o, type))
1185 ref(cUNOPo->op_first, o->op_type);
1194 PL_modcount = 10000;
1197 if (!type && cUNOPo->op_first->op_type != OP_GV)
1198 croak("Can't localize through a reference");
1199 ref(cUNOPo->op_first, o->op_type);
1203 PL_hints |= HINT_BLOCK_SCOPE;
1211 PL_modcount = 10000;
1212 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1213 return o; /* Treat \(@foo) like ordinary list. */
1214 if (scalar_mod_type(o, type))
1220 croak("Can't localize lexical variable %s",
1221 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), PL_na));
1226 PL_modcount++; /* XXX ??? */
1228 #endif /* USE_THREADS */
1234 if (type != OP_SASSIGN)
1238 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1244 pad_free(o->op_targ);
1245 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1246 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1247 if (o->op_flags & OPf_KIDS)
1248 mod(cBINOPo->op_first->op_sibling, type);
1253 ref(cBINOPo->op_first, o->op_type);
1254 if (type == OP_ENTERSUB &&
1255 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1256 o->op_private |= OPpLVAL_DEFER;
1263 if (o->op_flags & OPf_KIDS)
1264 mod(cLISTOPo->op_last, type);
1268 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1270 else if (!(o->op_flags & OPf_KIDS))
1272 if (o->op_targ != OP_LIST) {
1273 mod(cBINOPo->op_first, type);
1278 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1282 o->op_flags |= OPf_MOD;
1284 if (type == OP_AASSIGN || type == OP_SASSIGN)
1285 o->op_flags |= OPf_SPECIAL|OPf_REF;
1287 o->op_private |= OPpLVAL_INTRO;
1288 o->op_flags &= ~OPf_SPECIAL;
1289 PL_hints |= HINT_BLOCK_SCOPE;
1291 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1292 o->op_flags |= OPf_REF;
1297 scalar_mod_type(OP *o, I32 type)
1301 if (o->op_type == OP_RV2GV)
1325 case OP_RIGHT_SHIFT:
1335 case OP_ANDASSIGN: /* may work later */
1336 case OP_ORASSIGN: /* may work later */
1344 refkids(OP *o, I32 type)
1347 if (o && o->op_flags & OPf_KIDS) {
1348 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1355 ref(OP *o, I32 type)
1359 if (!o || PL_error_count)
1362 switch (o->op_type) {
1364 if ((type == OP_DEFINED || type == OP_LOCK) &&
1365 !(o->op_flags & OPf_STACKED)) {
1366 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1367 o->op_ppaddr = ppaddr[OP_RV2CV];
1368 assert(cUNOPo->op_first->op_type == OP_NULL);
1369 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1370 o->op_flags |= OPf_SPECIAL;
1375 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1379 ref(cUNOPo->op_first, o->op_type);
1382 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1383 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1384 : type == OP_RV2HV ? OPpDEREF_HV
1386 o->op_flags |= OPf_MOD;
1391 o->op_flags |= OPf_MOD; /* XXX ??? */
1396 o->op_flags |= OPf_REF;
1399 ref(cUNOPo->op_first, o->op_type);
1404 o->op_flags |= OPf_REF;
1409 if (!(o->op_flags & OPf_KIDS))
1411 ref(cBINOPo->op_first, type);
1415 ref(cBINOPo->op_first, o->op_type);
1416 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1417 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1418 : type == OP_RV2HV ? OPpDEREF_HV
1420 o->op_flags |= OPf_MOD;
1428 if (!(o->op_flags & OPf_KIDS))
1430 ref(cLISTOPo->op_last, type);
1445 if (!o || PL_error_count)
1449 if (type == OP_LIST) {
1450 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1452 } else if (type == OP_UNDEF) {
1454 } else if (type != OP_PADSV &&
1457 type != OP_PUSHMARK)
1459 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1462 o->op_flags |= OPf_MOD;
1463 o->op_private |= OPpLVAL_INTRO;
1471 o->op_flags |= OPf_PARENS;
1476 bind_match(I32 type, OP *left, OP *right)
1481 if (ckWARN(WARN_UNSAFE) &&
1482 (left->op_type == OP_RV2AV ||
1483 left->op_type == OP_RV2HV ||
1484 left->op_type == OP_PADAV ||
1485 left->op_type == OP_PADHV)) {
1486 char *desc = op_desc[(right->op_type == OP_SUBST ||
1487 right->op_type == OP_TRANS)
1488 ? right->op_type : OP_MATCH];
1489 char *sample = ((left->op_type == OP_RV2AV ||
1490 left->op_type == OP_PADAV)
1491 ? "@array" : "%hash");
1493 "Applying %s to %s will act on scalar(%s)",
1494 desc, sample, sample);
1497 if (right->op_type == OP_MATCH ||
1498 right->op_type == OP_SUBST ||
1499 right->op_type == OP_TRANS) {
1500 right->op_flags |= OPf_STACKED;
1501 if (right->op_type != OP_MATCH)
1502 left = mod(left, right->op_type);
1503 if (right->op_type == OP_TRANS)
1504 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1506 o = prepend_elem(right->op_type, scalar(left), right);
1508 return newUNOP(OP_NOT, 0, scalar(o));
1512 return bind_match(type, left,
1513 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1521 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1522 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1529 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1530 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1531 o->op_type = OP_LEAVE;
1532 o->op_ppaddr = ppaddr[OP_LEAVE];
1535 if (o->op_type == OP_LINESEQ) {
1537 o->op_type = OP_SCOPE;
1538 o->op_ppaddr = ppaddr[OP_SCOPE];
1539 kid = ((LISTOP*)o)->op_first;
1540 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1541 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1546 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1556 SAVESPTR(GvHV(PL_hintgv));
1557 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1558 SAVEFREESV(GvHV(PL_hintgv));
1562 block_start(int full)
1565 int retval = PL_savestack_ix;
1567 SAVEI32(PL_comppad_name_floor);
1569 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1570 PL_comppad_name_floor = PL_comppad_name_fill;
1572 PL_comppad_name_floor = 0;
1574 SAVEI32(PL_min_intro_pending);
1575 SAVEI32(PL_max_intro_pending);
1576 PL_min_intro_pending = 0;
1577 SAVEI32(PL_comppad_name_fill);
1578 SAVEI32(PL_padix_floor);
1579 PL_padix_floor = PL_padix;
1580 PL_pad_reset_pending = FALSE;
1582 PL_hints &= ~HINT_BLOCK_SCOPE;
1583 SAVEPPTR(compiling.cop_warnings);
1584 if (PL_compiling.cop_warnings != WARN_ALL &&
1585 PL_compiling.cop_warnings != WARN_NONE) {
1586 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1587 SAVEFREESV(PL_compiling.cop_warnings) ;
1595 block_end(I32 floor, OP *seq)
1598 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1599 OP* retval = scalarseq(seq);
1601 PL_pad_reset_pending = FALSE;
1602 compiling.op_private = PL_hints;
1604 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1605 pad_leavemy(PL_comppad_name_fill);
1614 OP *o = newOP(OP_THREADSV, 0);
1615 o->op_targ = find_threadsv("_");
1618 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1619 #endif /* USE_THREADS */
1627 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1628 PL_eval_start = linklist(PL_eval_root);
1629 PL_eval_root->op_next = 0;
1630 peep(PL_eval_start);
1635 PL_main_root = scope(sawparens(scalarvoid(o)));
1636 PL_curcop = &PL_compiling;
1637 PL_main_start = LINKLIST(PL_main_root);
1638 PL_main_root->op_next = 0;
1639 peep(PL_main_start);
1642 /* Register with debugger */
1644 CV *cv = perl_get_cv("DB::postponed", FALSE);
1648 XPUSHs((SV*)PL_compiling.cop_filegv);
1650 perl_call_sv((SV*)cv, G_DISCARD);
1657 localize(OP *o, I32 lex)
1659 if (o->op_flags & OPf_PARENS)
1663 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1665 for (s = PL_bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1666 if (*s == ';' || *s == '=')
1667 warner(WARN_PARENTHESIS, "Parens missing around \"%s\" list",
1668 lex ? "my" : "local");
1672 PL_in_my_stash = Nullhv;
1676 return mod(o, OP_NULL); /* a bit kludgey */
1682 if (o->op_type == OP_LIST) {
1685 o2 = newOP(OP_THREADSV, 0);
1686 o2->op_targ = find_threadsv(";");
1688 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1689 #endif /* USE_THREADS */
1690 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1696 fold_constants(register OP *o)
1700 I32 type = o->op_type;
1703 if (opargs[type] & OA_RETSCALAR)
1705 if (opargs[type] & OA_TARGET)
1706 o->op_targ = pad_alloc(type, SVs_PADTMP);
1708 if ((opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1709 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1711 if (!(opargs[type] & OA_FOLDCONST))
1726 if (o->op_private & OPpLOCALE)
1731 goto nope; /* Don't try to run w/ errors */
1733 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1734 if (curop->op_type != OP_CONST &&
1735 curop->op_type != OP_LIST &&
1736 curop->op_type != OP_SCALAR &&
1737 curop->op_type != OP_NULL &&
1738 curop->op_type != OP_PUSHMARK) {
1743 curop = LINKLIST(o);
1747 sv = *(PL_stack_sp--);
1748 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1749 pad_swipe(o->op_targ);
1750 else if (SvTEMP(sv)) { /* grab mortal temp? */
1751 (void)SvREFCNT_inc(sv);
1755 if (type == OP_RV2GV)
1756 return newGVOP(OP_GV, 0, (GV*)sv);
1758 /* try to smush double to int, but don't smush -2.0 to -2 */
1759 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1763 if ((double)iv == SvNV(sv)) {
1768 SvIOK_off(sv); /* undo SvIV() damage */
1770 return newSVOP(OP_CONST, 0, sv);
1774 if (!(opargs[type] & OA_OTHERINT))
1777 if (!(PL_hints & HINT_INTEGER)) {
1778 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1781 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1782 if (curop->op_type == OP_CONST) {
1783 if (SvIOK(((SVOP*)curop)->op_sv))
1787 if (opargs[curop->op_type] & OA_RETINTEGER)
1791 o->op_ppaddr = ppaddr[++(o->op_type)];
1798 gen_constant_list(register OP *o)
1802 I32 oldtmps_floor = PL_tmps_floor;
1806 return o; /* Don't attempt to run with errors */
1808 PL_op = curop = LINKLIST(o);
1814 PL_tmps_floor = oldtmps_floor;
1816 o->op_type = OP_RV2AV;
1817 o->op_ppaddr = ppaddr[OP_RV2AV];
1818 curop = ((UNOP*)o)->op_first;
1819 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1826 convert(I32 type, I32 flags, OP *o)
1831 if (!o || o->op_type != OP_LIST)
1832 o = newLISTOP(OP_LIST, 0, o, Nullop);
1834 o->op_flags &= ~OPf_WANT;
1836 if (!(opargs[type] & OA_MARK))
1837 null(cLISTOPo->op_first);
1840 o->op_ppaddr = ppaddr[type];
1841 o->op_flags |= flags;
1843 o = CHECKOP(type, o);
1844 if (o->op_type != type)
1847 if (cLISTOPo->op_children < 7) {
1848 /* XXX do we really need to do this if we're done appending?? */
1849 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1851 cLISTOPo->op_last = last; /* in case check substituted last arg */
1854 return fold_constants(o);
1857 /* List constructors */
1860 append_elem(I32 type, OP *first, OP *last)
1868 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1869 return newLISTOP(type, 0, first, last);
1871 if (first->op_flags & OPf_KIDS)
1872 ((LISTOP*)first)->op_last->op_sibling = last;
1874 first->op_flags |= OPf_KIDS;
1875 ((LISTOP*)first)->op_first = last;
1877 ((LISTOP*)first)->op_last = last;
1878 ((LISTOP*)first)->op_children++;
1883 append_list(I32 type, LISTOP *first, LISTOP *last)
1891 if (first->op_type != type)
1892 return prepend_elem(type, (OP*)first, (OP*)last);
1894 if (last->op_type != type)
1895 return append_elem(type, (OP*)first, (OP*)last);
1897 first->op_last->op_sibling = last->op_first;
1898 first->op_last = last->op_last;
1899 first->op_children += last->op_children;
1900 if (first->op_children)
1901 last->op_flags |= OPf_KIDS;
1908 prepend_elem(I32 type, OP *first, OP *last)
1916 if (last->op_type == type) {
1917 if (type == OP_LIST) { /* already a PUSHMARK there */
1918 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1919 ((LISTOP*)last)->op_first->op_sibling = first;
1922 if (!(last->op_flags & OPf_KIDS)) {
1923 ((LISTOP*)last)->op_last = first;
1924 last->op_flags |= OPf_KIDS;
1926 first->op_sibling = ((LISTOP*)last)->op_first;
1927 ((LISTOP*)last)->op_first = first;
1929 ((LISTOP*)last)->op_children++;
1933 return newLISTOP(type, 0, first, last);
1941 return newOP(OP_STUB, 0);
1947 if (!o || o->op_type != OP_LIST)
1948 o = newLISTOP(OP_LIST, 0, o, Nullop);
1954 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1958 Newz(1101, listop, 1, LISTOP);
1960 listop->op_type = type;
1961 listop->op_ppaddr = ppaddr[type];
1962 listop->op_children = (first != 0) + (last != 0);
1963 listop->op_flags = flags;
1967 else if (!first && last)
1970 first->op_sibling = last;
1971 listop->op_first = first;
1972 listop->op_last = last;
1973 if (type == OP_LIST) {
1975 pushop = newOP(OP_PUSHMARK, 0);
1976 pushop->op_sibling = first;
1977 listop->op_first = pushop;
1978 listop->op_flags |= OPf_KIDS;
1980 listop->op_last = pushop;
1982 else if (listop->op_children)
1983 listop->op_flags |= OPf_KIDS;
1989 newOP(I32 type, I32 flags)
1992 Newz(1101, o, 1, OP);
1994 o->op_ppaddr = ppaddr[type];
1995 o->op_flags = flags;
1998 o->op_private = 0 + (flags >> 8);
1999 if (opargs[type] & OA_RETSCALAR)
2001 if (opargs[type] & OA_TARGET)
2002 o->op_targ = pad_alloc(type, SVs_PADTMP);
2003 return CHECKOP(type, o);
2007 newUNOP(I32 type, I32 flags, OP *first)
2012 first = newOP(OP_STUB, 0);
2013 if (opargs[type] & OA_MARK)
2014 first = force_list(first);
2016 Newz(1101, unop, 1, UNOP);
2017 unop->op_type = type;
2018 unop->op_ppaddr = ppaddr[type];
2019 unop->op_first = first;
2020 unop->op_flags = flags | OPf_KIDS;
2021 unop->op_private = 1 | (flags >> 8);
2022 unop = (UNOP*) CHECKOP(type, unop);
2026 return fold_constants((OP *) unop);
2030 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2033 Newz(1101, binop, 1, BINOP);
2036 first = newOP(OP_NULL, 0);
2038 binop->op_type = type;
2039 binop->op_ppaddr = ppaddr[type];
2040 binop->op_first = first;
2041 binop->op_flags = flags | OPf_KIDS;
2044 binop->op_private = 1 | (flags >> 8);
2047 binop->op_private = 2 | (flags >> 8);
2048 first->op_sibling = last;
2051 binop = (BINOP*)CHECKOP(type, binop);
2055 binop->op_last = last = binop->op_first->op_sibling;
2057 return fold_constants((OP *)binop);
2061 utf8compare(const void *a, const void *b)
2064 for (i = 0; i < 10; i++) {
2065 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2067 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2074 pmtrans(OP *o, OP *expr, OP *repl)
2076 SV *tstr = ((SVOP*)expr)->op_sv;
2077 SV *rstr = ((SVOP*)repl)->op_sv;
2080 register U8 *t = (U8*)SvPV(tstr, tlen);
2081 register U8 *r = (U8*)SvPV(rstr, rlen);
2087 register short *tbl;
2089 complement = o->op_private & OPpTRANS_COMPLEMENT;
2090 del = o->op_private & OPpTRANS_DELETE;
2091 squash = o->op_private & OPpTRANS_SQUASH;
2093 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2094 SV* listsv = newSVpv("# comment\n",0);
2096 U8* tend = t + tlen;
2097 U8* rend = r + rlen;
2113 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2114 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2120 New(1109, cp, tlen, U8*);
2122 transv = newSVpv("",0);
2131 qsort(cp, i, sizeof(U8*), utf8compare);
2132 for (j = 0; j < i; j++) {
2134 UV val = utf8_to_uv(s, &ulen);
2136 diff = val - nextmin;
2138 t = uv_to_utf8(tmpbuf,nextmin);
2139 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2141 t = uv_to_utf8(tmpbuf, val - 1);
2142 sv_catpvn(transv, "\377", 1);
2143 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2147 val = utf8_to_uv(s+1, &ulen);
2151 t = uv_to_utf8(tmpbuf,nextmin);
2152 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2153 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2154 sv_catpvn(transv, "\377", 1);
2155 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2156 t = (U8*)SvPVX(transv);
2157 tlen = SvCUR(transv);
2160 else if (!rlen && !del) {
2161 r = t; rlen = tlen; rend = tend;
2164 if (to_utf && from_utf) { /* only counting characters */
2165 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2166 o->op_private |= OPpTRANS_IDENTICAL;
2168 else { /* straight latin-1 translation */
2169 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2170 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2171 o->op_private |= OPpTRANS_IDENTICAL;
2175 while (t < tend || tfirst <= tlast) {
2176 /* see if we need more "t" chars */
2177 if (tfirst > tlast) {
2178 tfirst = (I32)utf8_to_uv(t, &ulen);
2180 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2181 tlast = (I32)utf8_to_uv(++t, &ulen);
2188 /* now see if we need more "r" chars */
2189 if (rfirst > rlast) {
2191 rfirst = (I32)utf8_to_uv(r, &ulen);
2193 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2194 rlast = (I32)utf8_to_uv(++r, &ulen);
2203 rfirst = rlast = 0xffffffff;
2207 /* now see which range will peter our first, if either. */
2208 tdiff = tlast - tfirst;
2209 rdiff = rlast - rfirst;
2216 if (rfirst == 0xffffffff) {
2217 diff = tdiff; /* oops, pretend rdiff is infinite */
2219 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2221 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2225 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2227 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2229 if (rfirst + diff > max)
2230 max = rfirst + diff;
2235 else if (rfirst <= 0x800)
2236 grows |= (tfirst < 0x80);
2237 else if (rfirst <= 0x10000)
2238 grows |= (tfirst < 0x800);
2239 else if (rfirst <= 0x200000)
2240 grows |= (tfirst < 0x10000);
2241 else if (rfirst <= 0x4000000)
2242 grows |= (tfirst < 0x200000);
2243 else if (rfirst <= 0x80000000)
2244 grows |= (tfirst < 0x4000000);
2256 else if (max > 0xff)
2261 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2262 SvREFCNT_dec(listsv);
2264 SvREFCNT_dec(transv);
2266 if (!del && havefinal)
2267 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2269 if (grows && to_utf)
2270 o->op_private |= OPpTRANS_GROWS;
2277 tbl = (short*)cPVOPo->op_pv;
2279 Zero(tbl, 256, short);
2280 for (i = 0; i < tlen; i++)
2282 for (i = 0, j = 0; i < 256; i++) {
2298 if (!rlen && !del) {
2301 o->op_private |= OPpTRANS_IDENTICAL;
2303 for (i = 0; i < 256; i++)
2305 for (i = 0, j = 0; i < tlen; i++,j++) {
2308 if (tbl[t[i]] == -1)
2314 if (tbl[t[i]] == -1)
2325 newPMOP(I32 type, I32 flags)
2330 Newz(1101, pmop, 1, PMOP);
2331 pmop->op_type = type;
2332 pmop->op_ppaddr = ppaddr[type];
2333 pmop->op_flags = flags;
2334 pmop->op_private = 0 | (flags >> 8);
2336 if (PL_hints & HINT_RE_TAINT)
2337 pmop->op_pmpermflags |= PMf_RETAINT;
2338 if (PL_hints & HINT_LOCALE)
2339 pmop->op_pmpermflags |= PMf_LOCALE;
2340 pmop->op_pmflags = pmop->op_pmpermflags;
2342 /* link into pm list */
2343 if (type != OP_TRANS && PL_curstash) {
2344 pmop->op_pmnext = HvPMROOT(PL_curstash);
2345 HvPMROOT(PL_curstash) = pmop;
2352 pmruntime(OP *o, OP *expr, OP *repl)
2357 I32 repl_has_vars = 0;
2359 if (o->op_type == OP_TRANS)
2360 return pmtrans(o, expr, repl);
2362 PL_hints |= HINT_BLOCK_SCOPE;
2365 if (expr->op_type == OP_CONST) {
2367 SV *pat = ((SVOP*)expr)->op_sv;
2368 char *p = SvPV(pat, plen);
2369 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2370 sv_setpvn(pat, "\\s+", 3);
2371 p = SvPV(pat, plen);
2372 pm->op_pmflags |= PMf_SKIPWHITE;
2374 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2375 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2376 pm->op_pmflags |= PMf_WHITE;
2380 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2381 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2383 : OP_REGCMAYBE),0,expr);
2385 Newz(1101, rcop, 1, LOGOP);
2386 rcop->op_type = OP_REGCOMP;
2387 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2388 rcop->op_first = scalar(expr);
2389 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2390 ? (OPf_SPECIAL | OPf_KIDS)
2392 rcop->op_private = 1;
2395 /* establish postfix order */
2396 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2398 rcop->op_next = expr;
2399 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2402 rcop->op_next = LINKLIST(expr);
2403 expr->op_next = (OP*)rcop;
2406 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2411 if (pm->op_pmflags & PMf_EVAL)
2414 else if (repl->op_type == OP_THREADSV
2415 && strchr("&`'123456789+",
2416 PL_threadsv_names[repl->op_targ]))
2420 #endif /* USE_THREADS */
2421 else if (repl->op_type == OP_CONST)
2425 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2426 if (opargs[curop->op_type] & OA_DANGEROUS) {
2428 if (curop->op_type == OP_THREADSV) {
2430 if (strchr("&`'123456789+", curop->op_private))
2434 if (curop->op_type == OP_GV) {
2435 GV *gv = ((GVOP*)curop)->op_gv;
2437 if (strchr("&`'123456789+", *GvENAME(gv)))
2440 #endif /* USE_THREADS */
2441 else if (curop->op_type == OP_RV2CV)
2443 else if (curop->op_type == OP_RV2SV ||
2444 curop->op_type == OP_RV2AV ||
2445 curop->op_type == OP_RV2HV ||
2446 curop->op_type == OP_RV2GV) {
2447 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2450 else if (curop->op_type == OP_PADSV ||
2451 curop->op_type == OP_PADAV ||
2452 curop->op_type == OP_PADHV ||
2453 curop->op_type == OP_PADANY) {
2456 else if (curop->op_type == OP_PUSHRE)
2457 ; /* Okay here, dangerous in newASSIGNOP */
2466 && (!pm->op_pmregexp
2467 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2468 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2469 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2470 prepend_elem(o->op_type, scalar(repl), o);
2473 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2474 pm->op_pmflags |= PMf_MAYBE_CONST;
2475 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2477 Newz(1101, rcop, 1, LOGOP);
2478 rcop->op_type = OP_SUBSTCONT;
2479 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2480 rcop->op_first = scalar(repl);
2481 rcop->op_flags |= OPf_KIDS;
2482 rcop->op_private = 1;
2485 /* establish postfix order */
2486 rcop->op_next = LINKLIST(repl);
2487 repl->op_next = (OP*)rcop;
2489 pm->op_pmreplroot = scalar((OP*)rcop);
2490 pm->op_pmreplstart = LINKLIST(rcop);
2499 newSVOP(I32 type, I32 flags, SV *sv)
2502 Newz(1101, svop, 1, SVOP);
2503 svop->op_type = type;
2504 svop->op_ppaddr = ppaddr[type];
2506 svop->op_next = (OP*)svop;
2507 svop->op_flags = flags;
2508 if (opargs[type] & OA_RETSCALAR)
2510 if (opargs[type] & OA_TARGET)
2511 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2512 return CHECKOP(type, svop);
2516 newGVOP(I32 type, I32 flags, GV *gv)
2520 Newz(1101, gvop, 1, GVOP);
2521 gvop->op_type = type;
2522 gvop->op_ppaddr = ppaddr[type];
2523 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2524 gvop->op_next = (OP*)gvop;
2525 gvop->op_flags = flags;
2526 if (opargs[type] & OA_RETSCALAR)
2528 if (opargs[type] & OA_TARGET)
2529 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2530 return CHECKOP(type, gvop);
2534 newPVOP(I32 type, I32 flags, char *pv)
2537 Newz(1101, pvop, 1, PVOP);
2538 pvop->op_type = type;
2539 pvop->op_ppaddr = ppaddr[type];
2541 pvop->op_next = (OP*)pvop;
2542 pvop->op_flags = flags;
2543 if (opargs[type] & OA_RETSCALAR)
2545 if (opargs[type] & OA_TARGET)
2546 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2547 return CHECKOP(type, pvop);
2556 save_hptr(&PL_curstash);
2557 save_item(PL_curstname);
2562 name = SvPV(sv, len);
2563 PL_curstash = gv_stashpvn(name,len,TRUE);
2564 sv_setpvn(PL_curstname, name, len);
2568 sv_setpv(PL_curstname,"<none>");
2569 PL_curstash = Nullhv;
2571 PL_copline = NOLINE;
2576 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2585 if (id->op_type != OP_CONST)
2586 croak("Module name must be constant");
2590 if(version != Nullop) {
2591 SV *vesv = ((SVOP*)version)->op_sv;
2593 if (arg == Nullop && !SvNIOK(vesv)) {
2600 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2601 croak("Version number must be constant number");
2603 /* Make copy of id so we don't free it twice */
2604 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2606 /* Fake up a method call to VERSION */
2607 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2608 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2609 append_elem(OP_LIST,
2610 prepend_elem(OP_LIST, pack, list(version)),
2611 newUNOP(OP_METHOD, 0, meth)));
2615 /* Fake up an import/unimport */
2616 if (arg && arg->op_type == OP_STUB)
2617 imop = arg; /* no import on explicit () */
2618 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2619 imop = Nullop; /* use 5.0; */
2622 /* Make copy of id so we don't free it twice */
2623 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2624 meth = newSVOP(OP_CONST, 0,
2626 ? newSVpv("import", 6)
2627 : newSVpv("unimport", 8)
2629 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2630 append_elem(OP_LIST,
2631 prepend_elem(OP_LIST, pack, list(arg)),
2632 newUNOP(OP_METHOD, 0, meth)));
2635 /* Fake up a require, handle override, if any */
2636 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2637 if (!(gv && GvIMPORTED_CV(gv)))
2638 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2640 if (gv && GvIMPORTED_CV(gv)) {
2641 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2642 append_elem(OP_LIST, id,
2643 scalar(newUNOP(OP_RV2CV, 0,
2648 rqop = newUNOP(OP_REQUIRE, 0, id);
2651 /* Fake up the BEGIN {}, which does its thing immediately. */
2653 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2655 append_elem(OP_LINESEQ,
2656 append_elem(OP_LINESEQ,
2657 newSTATEOP(0, Nullch, rqop),
2658 newSTATEOP(0, Nullch, veop)),
2659 newSTATEOP(0, Nullch, imop) ));
2661 PL_copline = NOLINE;
2671 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2672 if (!(gv && GvIMPORTED_CV(gv)))
2673 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2675 if (gv && GvIMPORTED_CV(gv)) {
2676 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2677 append_elem(OP_LIST, term,
2678 scalar(newUNOP(OP_RV2CV, 0,
2683 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2689 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2691 return newBINOP(OP_LSLICE, flags,
2692 list(force_list(subscript)),
2693 list(force_list(listval)) );
2697 list_assignment(register OP *o)
2702 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2703 o = cUNOPo->op_first;
2705 if (o->op_type == OP_COND_EXPR) {
2706 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2707 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2712 yyerror("Assignment to both a list and a scalar");
2716 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2717 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2718 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2721 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2724 if (o->op_type == OP_RV2SV)
2731 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2736 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2737 return newLOGOP(optype, 0,
2738 mod(scalar(left), optype),
2739 newUNOP(OP_SASSIGN, 0, scalar(right)));
2742 return newBINOP(optype, OPf_STACKED,
2743 mod(scalar(left), optype), scalar(right));
2747 if (list_assignment(left)) {
2750 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2751 left = mod(left, OP_AASSIGN);
2759 o = newBINOP(OP_AASSIGN, flags,
2760 list(force_list(right)),
2761 list(force_list(left)) );
2762 o->op_private = 0 | (flags >> 8);
2763 if (!(left->op_private & OPpLVAL_INTRO)) {
2767 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2768 if (opargs[curop->op_type] & OA_DANGEROUS) {
2769 if (curop->op_type == OP_GV) {
2770 GV *gv = ((GVOP*)curop)->op_gv;
2771 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2773 SvCUR(gv) = PL_generation;
2775 else if (curop->op_type == OP_PADSV ||
2776 curop->op_type == OP_PADAV ||
2777 curop->op_type == OP_PADHV ||
2778 curop->op_type == OP_PADANY) {
2779 SV **svp = AvARRAY(PL_comppad_name);
2780 SV *sv = svp[curop->op_targ];
2781 if (SvCUR(sv) == PL_generation)
2783 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2785 else if (curop->op_type == OP_RV2CV)
2787 else if (curop->op_type == OP_RV2SV ||
2788 curop->op_type == OP_RV2AV ||
2789 curop->op_type == OP_RV2HV ||
2790 curop->op_type == OP_RV2GV) {
2791 if (lastop->op_type != OP_GV) /* funny deref? */
2794 else if (curop->op_type == OP_PUSHRE) {
2795 if (((PMOP*)curop)->op_pmreplroot) {
2796 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2797 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2799 SvCUR(gv) = PL_generation;
2808 o->op_private = OPpASSIGN_COMMON;
2810 if (right && right->op_type == OP_SPLIT) {
2812 if ((tmpop = ((LISTOP*)right)->op_first) &&
2813 tmpop->op_type == OP_PUSHRE)
2815 PMOP *pm = (PMOP*)tmpop;
2816 if (left->op_type == OP_RV2AV &&
2817 !(left->op_private & OPpLVAL_INTRO) &&
2818 !(o->op_private & OPpASSIGN_COMMON) )
2820 tmpop = ((UNOP*)left)->op_first;
2821 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2822 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2823 pm->op_pmflags |= PMf_ONCE;
2824 tmpop = cUNOPo->op_first; /* to list (nulled) */
2825 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2826 tmpop->op_sibling = Nullop; /* don't free split */
2827 right->op_next = tmpop->op_next; /* fix starting loc */
2828 op_free(o); /* blow off assign */
2829 right->op_flags &= ~OPf_WANT;
2830 /* "I don't know and I don't care." */
2835 if (PL_modcount < 10000 &&
2836 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2838 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2840 sv_setiv(sv, PL_modcount+1);
2848 right = newOP(OP_UNDEF, 0);
2849 if (right->op_type == OP_READLINE) {
2850 right->op_flags |= OPf_STACKED;
2851 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2854 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2855 o = newBINOP(OP_SASSIGN, flags,
2856 scalar(right), mod(scalar(left), OP_SASSIGN) );
2868 newSTATEOP(I32 flags, char *label, OP *o)
2871 U32 seq = intro_my();
2874 Newz(1101, cop, 1, COP);
2875 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2876 cop->op_type = OP_DBSTATE;
2877 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2880 cop->op_type = OP_NEXTSTATE;
2881 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2883 cop->op_flags = flags;
2884 cop->op_private = (PL_hints & HINT_UTF8);
2886 cop->op_private |= NATIVE_HINTS;
2888 compiling.op_private = cop->op_private;
2889 cop->op_next = (OP*)cop;
2892 cop->cop_label = label;
2893 PL_hints |= HINT_BLOCK_SCOPE;
2896 cop->cop_arybase = PL_curcop->cop_arybase;
2897 if (PL_curcop->cop_warnings == WARN_NONE
2898 || PL_curcop->cop_warnings == WARN_ALL)
2899 cop->cop_warnings = PL_curcop->cop_warnings ;
2901 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
2904 if (PL_copline == NOLINE)
2905 cop->cop_line = PL_curcop->cop_line;
2907 cop->cop_line = PL_copline;
2908 PL_copline = NOLINE;
2910 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2911 cop->cop_stash = PL_curstash;
2913 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2914 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2915 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2916 (void)SvIOK_on(*svp);
2918 SvSTASH(*svp) = (HV*)cop;
2922 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2925 /* "Introduce" my variables to visible status. */
2933 if (! PL_min_intro_pending)
2934 return PL_cop_seqmax;
2936 svp = AvARRAY(PL_comppad_name);
2937 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2938 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2939 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2940 SvNVX(sv) = (double)PL_cop_seqmax;
2943 PL_min_intro_pending = 0;
2944 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2945 return PL_cop_seqmax++;
2949 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2951 return new_logop(type, flags, &first, &other);
2955 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2960 OP *first = *firstp;
2961 OP *other = *otherp;
2963 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2964 return newBINOP(type, flags, scalar(first), scalar(other));
2966 scalarboolean(first);
2967 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2968 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2969 if (type == OP_AND || type == OP_OR) {
2975 first = *firstp = cUNOPo->op_first;
2977 first->op_next = o->op_next;
2978 cUNOPo->op_first = Nullop;
2982 if (first->op_type == OP_CONST) {
2983 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
2984 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
2986 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2997 else if (first->op_type == OP_WANTARRAY) {
3003 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3004 OP *k1 = ((UNOP*)first)->op_first;
3005 OP *k2 = k1->op_sibling;
3007 switch (first->op_type)
3010 if (k2 && k2->op_type == OP_READLINE
3011 && (k2->op_flags & OPf_STACKED)
3012 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3013 warnop = k2->op_type;
3017 if (k1->op_type == OP_READDIR
3018 || k1->op_type == OP_GLOB
3019 || k1->op_type == OP_EACH)
3020 warnop = k1->op_type;
3024 line_t oldline = PL_curcop->cop_line;
3025 PL_curcop->cop_line = PL_copline;
3027 "Value of %s%s can be \"0\"; test with defined()",
3029 ((warnop == OP_READLINE || warnop == OP_GLOB)
3030 ? " construct" : "() operator"));
3031 PL_curcop->cop_line = oldline;
3038 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3039 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3041 Newz(1101, logop, 1, LOGOP);
3043 logop->op_type = type;
3044 logop->op_ppaddr = ppaddr[type];
3045 logop->op_first = first;
3046 logop->op_flags = flags | OPf_KIDS;
3047 logop->op_other = LINKLIST(other);
3048 logop->op_private = 1 | (flags >> 8);
3050 /* establish postfix order */
3051 logop->op_next = LINKLIST(first);
3052 first->op_next = (OP*)logop;
3053 first->op_sibling = other;
3055 o = newUNOP(OP_NULL, 0, (OP*)logop);
3062 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3069 return newLOGOP(OP_AND, 0, first, trueop);
3071 return newLOGOP(OP_OR, 0, first, falseop);
3073 scalarboolean(first);
3074 if (first->op_type == OP_CONST) {
3075 if (SvTRUE(((SVOP*)first)->op_sv)) {
3086 else if (first->op_type == OP_WANTARRAY) {
3090 Newz(1101, condop, 1, CONDOP);
3092 condop->op_type = OP_COND_EXPR;
3093 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
3094 condop->op_first = first;
3095 condop->op_flags = flags | OPf_KIDS;
3096 condop->op_true = LINKLIST(trueop);
3097 condop->op_false = LINKLIST(falseop);
3098 condop->op_private = 1 | (flags >> 8);
3100 /* establish postfix order */
3101 condop->op_next = LINKLIST(first);
3102 first->op_next = (OP*)condop;
3104 first->op_sibling = trueop;
3105 trueop->op_sibling = falseop;
3106 o = newUNOP(OP_NULL, 0, (OP*)condop);
3108 trueop->op_next = o;
3109 falseop->op_next = o;
3115 newRANGE(I32 flags, OP *left, OP *right)
3123 Newz(1101, condop, 1, CONDOP);
3125 condop->op_type = OP_RANGE;
3126 condop->op_ppaddr = ppaddr[OP_RANGE];
3127 condop->op_first = left;
3128 condop->op_flags = OPf_KIDS;
3129 condop->op_true = LINKLIST(left);
3130 condop->op_false = LINKLIST(right);
3131 condop->op_private = 1 | (flags >> 8);
3133 left->op_sibling = right;
3135 condop->op_next = (OP*)condop;
3136 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3137 flop = newUNOP(OP_FLOP, 0, flip);
3138 o = newUNOP(OP_NULL, 0, flop);
3141 left->op_next = flip;
3142 right->op_next = flop;
3144 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3145 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3146 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3147 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3149 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3150 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3153 if (!flip->op_private || !flop->op_private)
3154 linklist(o); /* blow off optimizer unless constant */
3160 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3165 int once = block && block->op_flags & OPf_SPECIAL &&
3166 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3169 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3170 return block; /* do {} while 0 does once */
3171 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3172 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3173 expr = newUNOP(OP_DEFINED, 0,
3174 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3175 } else if (expr->op_flags & OPf_KIDS) {
3176 OP *k1 = ((UNOP*)expr)->op_first;
3177 OP *k2 = (k1) ? k1->op_sibling : NULL;
3178 switch (expr->op_type) {
3180 if (k2 && k2->op_type == OP_READLINE
3181 && (k2->op_flags & OPf_STACKED)
3182 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3183 expr = newUNOP(OP_DEFINED, 0, expr);
3187 if (k1->op_type == OP_READDIR
3188 || k1->op_type == OP_GLOB
3189 || k1->op_type == OP_EACH)
3190 expr = newUNOP(OP_DEFINED, 0, expr);
3196 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3197 o = new_logop(OP_AND, 0, &expr, &listop);
3200 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3202 if (once && o != listop)
3203 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3206 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3208 o->op_flags |= flags;
3210 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3215 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3224 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3225 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3226 expr = newUNOP(OP_DEFINED, 0,
3227 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3228 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3229 OP *k1 = ((UNOP*)expr)->op_first;
3230 OP *k2 = (k1) ? k1->op_sibling : NULL;
3231 switch (expr->op_type) {
3233 if (k2 && k2->op_type == OP_READLINE
3234 && (k2->op_flags & OPf_STACKED)
3235 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3236 expr = newUNOP(OP_DEFINED, 0, expr);
3240 if (k1->op_type == OP_READDIR
3241 || k1->op_type == OP_GLOB
3242 || k1->op_type == OP_EACH)
3243 expr = newUNOP(OP_DEFINED, 0, expr);
3249 block = newOP(OP_NULL, 0);
3252 next = LINKLIST(cont);
3254 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3255 if ((line_t)whileline != NOLINE) {
3256 PL_copline = whileline;
3257 cont = append_elem(OP_LINESEQ, cont,
3258 newSTATEOP(0, Nullch, Nullop));
3262 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3263 redo = LINKLIST(listop);
3266 PL_copline = whileline;
3268 o = new_logop(OP_AND, 0, &expr, &listop);
3269 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3270 op_free(expr); /* oops, it's a while (0) */
3272 return Nullop; /* listop already freed by new_logop */
3275 ((LISTOP*)listop)->op_last->op_next = condop =
3276 (o == listop ? redo : LINKLIST(o));
3284 Newz(1101,loop,1,LOOP);
3285 loop->op_type = OP_ENTERLOOP;
3286 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
3287 loop->op_private = 0;
3288 loop->op_next = (OP*)loop;
3291 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3293 loop->op_redoop = redo;
3294 loop->op_lastop = o;
3297 loop->op_nextop = next;
3299 loop->op_nextop = o;
3301 o->op_flags |= flags;
3302 o->op_private |= (flags >> 8);
3307 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3315 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3316 sv->op_type = OP_RV2GV;
3317 sv->op_ppaddr = ppaddr[OP_RV2GV];
3319 else if (sv->op_type == OP_PADSV) { /* private variable */
3320 padoff = sv->op_targ;
3324 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3325 padoff = sv->op_targ;
3326 iterflags |= OPf_SPECIAL;
3331 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3335 padoff = find_threadsv("_");
3336 iterflags |= OPf_SPECIAL;
3338 sv = newGVOP(OP_GV, 0, PL_defgv);
3341 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3342 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3343 iterflags |= OPf_STACKED;
3345 else if (expr->op_type == OP_NULL &&
3346 (expr->op_flags & OPf_KIDS) &&
3347 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3349 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3350 * set the STACKED flag to indicate that these values are to be
3351 * treated as min/max values by 'pp_iterinit'.
3353 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3354 CONDOP* range = (CONDOP*) flip->op_first;
3355 OP* left = range->op_first;
3356 OP* right = left->op_sibling;
3359 range->op_flags &= ~OPf_KIDS;
3360 range->op_first = Nullop;
3362 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3363 listop->op_first->op_next = range->op_true;
3364 left->op_next = range->op_false;
3365 right->op_next = (OP*)listop;
3366 listop->op_next = listop->op_first;
3369 expr = (OP*)(listop);
3371 iterflags |= OPf_STACKED;
3374 expr = mod(force_list(expr), OP_GREPSTART);
3378 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3379 append_elem(OP_LIST, expr, scalar(sv))));
3380 assert(!loop->op_next);
3381 Renew(loop, 1, LOOP);
3382 loop->op_targ = padoff;
3383 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3384 PL_copline = forline;
3385 return newSTATEOP(0, label, wop);
3389 newLOOPEX(I32 type, OP *label)
3393 if (type != OP_GOTO || label->op_type == OP_CONST) {
3394 /* "last()" means "last" */
3395 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3396 o = newOP(type, OPf_SPECIAL);
3398 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3399 ? SvPVx(((SVOP*)label)->op_sv, PL_na)
3405 if (label->op_type == OP_ENTERSUB)
3406 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3407 o = newUNOP(type, OPf_STACKED, label);
3409 PL_hints |= HINT_BLOCK_SCOPE;
3419 MUTEX_DESTROY(CvMUTEXP(cv));
3420 Safefree(CvMUTEXP(cv));
3423 #endif /* USE_THREADS */
3425 if (!CvXSUB(cv) && CvROOT(cv)) {
3427 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3428 croak("Can't undef active subroutine");
3431 croak("Can't undef active subroutine");
3432 #endif /* USE_THREADS */
3435 SAVESPTR(PL_curpad);
3439 op_free(CvROOT(cv));
3440 CvROOT(cv) = Nullop;
3443 SvPOK_off((SV*)cv); /* forget prototype */
3445 SvREFCNT_dec(CvGV(cv));
3447 SvREFCNT_dec(CvOUTSIDE(cv));
3448 CvOUTSIDE(cv) = Nullcv;
3449 if (CvPADLIST(cv)) {
3450 /* may be during global destruction */
3451 if (SvREFCNT(CvPADLIST(cv))) {
3452 I32 i = AvFILLp(CvPADLIST(cv));
3454 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3455 SV* sv = svp ? *svp : Nullsv;
3458 if (sv == (SV*)PL_comppad_name)
3459 PL_comppad_name = Nullav;
3460 else if (sv == (SV*)PL_comppad) {
3461 PL_comppad = Nullav;
3462 PL_curpad = Null(SV**);
3466 SvREFCNT_dec((SV*)CvPADLIST(cv));
3468 CvPADLIST(cv) = Nullav;
3472 #ifdef DEBUG_CLOSURES
3477 CV *outside = CvOUTSIDE(cv);
3478 AV* padlist = CvPADLIST(cv);
3485 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3487 (CvANON(cv) ? "ANON"
3488 : (cv == PL_main_cv) ? "MAIN"
3489 : CvUNIQUE(outside) ? "UNIQUE"
3490 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3493 : CvANON(outside) ? "ANON"
3494 : (outside == PL_main_cv) ? "MAIN"
3495 : CvUNIQUE(outside) ? "UNIQUE"
3496 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3501 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3502 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3503 pname = AvARRAY(pad_name);
3504 ppad = AvARRAY(pad);
3506 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3507 if (SvPOK(pname[ix]))
3508 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3510 SvFAKE(pname[ix]) ? "FAKE " : "",
3512 (long)I_32(SvNVX(pname[ix])),
3513 (long)SvIVX(pname[ix]));
3516 #endif /* DEBUG_CLOSURES */
3519 cv_clone2(CV *proto, CV *outside)
3524 AV* protopadlist = CvPADLIST(proto);
3525 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3526 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3527 SV** pname = AvARRAY(protopad_name);
3528 SV** ppad = AvARRAY(protopad);
3529 I32 fname = AvFILLp(protopad_name);
3530 I32 fpad = AvFILLp(protopad);
3534 assert(!CvUNIQUE(proto));
3537 SAVESPTR(PL_curpad);
3538 SAVESPTR(PL_comppad);
3539 SAVESPTR(PL_comppad_name);
3540 SAVESPTR(PL_compcv);
3542 cv = PL_compcv = (CV*)NEWSV(1104,0);
3543 sv_upgrade((SV *)cv, SvTYPE(proto));
3549 New(666, CvMUTEXP(cv), 1, perl_mutex);
3550 MUTEX_INIT(CvMUTEXP(cv));
3552 #endif /* USE_THREADS */
3553 CvFILEGV(cv) = CvFILEGV(proto);
3554 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3555 CvSTASH(cv) = CvSTASH(proto);
3556 CvROOT(cv) = CvROOT(proto);
3557 CvSTART(cv) = CvSTART(proto);
3559 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3562 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3564 PL_comppad_name = newAV();
3565 for (ix = fname; ix >= 0; ix--)
3566 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3568 PL_comppad = newAV();
3570 comppadlist = newAV();
3571 AvREAL_off(comppadlist);
3572 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3573 av_store(comppadlist, 1, (SV*)PL_comppad);
3574 CvPADLIST(cv) = comppadlist;
3575 av_fill(PL_comppad, AvFILLp(protopad));
3576 PL_curpad = AvARRAY(PL_comppad);
3578 av = newAV(); /* will be @_ */
3580 av_store(PL_comppad, 0, (SV*)av);
3581 AvFLAGS(av) = AVf_REIFY;
3583 for (ix = fpad; ix > 0; ix--) {
3584 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3585 if (namesv && namesv != &PL_sv_undef) {
3586 char *name = SvPVX(namesv); /* XXX */
3587 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3588 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3589 CvOUTSIDE(cv), cxstack_ix);
3591 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3593 croak("panic: cv_clone: %s", name);
3595 else { /* our own lexical */
3598 /* anon code -- we'll come back for it */
3599 sv = SvREFCNT_inc(ppad[ix]);
3601 else if (*name == '@')
3603 else if (*name == '%')
3613 SV* sv = NEWSV(0,0);
3619 /* Now that vars are all in place, clone nested closures. */
3621 for (ix = fpad; ix > 0; ix--) {
3622 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3624 && namesv != &PL_sv_undef
3625 && !(SvFLAGS(namesv) & SVf_FAKE)
3626 && *SvPVX(namesv) == '&'
3627 && CvCLONE(ppad[ix]))
3629 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3630 SvREFCNT_dec(ppad[ix]);
3633 PL_curpad[ix] = (SV*)kid;
3637 #ifdef DEBUG_CLOSURES
3638 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3640 PerlIO_printf(Perl_debug_log, " from:\n");
3642 PerlIO_printf(Perl_debug_log, " to:\n");
3653 return cv_clone2(proto, CvOUTSIDE(proto));
3657 cv_ckproto(CV *cv, GV *gv, char *p)
3659 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3660 SV* msg = sv_newmortal();
3664 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3665 sv_setpv(msg, "Prototype mismatch:");
3667 sv_catpvf(msg, " sub %_", name);
3669 sv_catpvf(msg, " (%s)", SvPVX(cv));
3670 sv_catpv(msg, " vs ");
3672 sv_catpvf(msg, "(%s)", p);
3674 sv_catpv(msg, "none");
3682 if (!cv || !SvPOK(cv) || SvCUR(cv))
3684 return op_const_sv(CvSTART(cv), cv);
3688 op_const_sv(OP *o, CV *cv)
3695 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3696 o = cLISTOPo->op_first->op_sibling;
3698 for (; o; o = o->op_next) {
3699 OPCODE type = o->op_type;
3701 if(sv && o->op_next == o)
3703 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3705 if (type == OP_LEAVESUB || type == OP_RETURN)
3709 if (type == OP_CONST)
3711 else if (type == OP_PADSV && cv) {
3712 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3713 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3714 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3726 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3729 char *name = o ? SvPVx(cSVOPo->op_sv, PL_na) : Nullch;
3730 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3731 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3732 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, PL_na) : Nullch;
3741 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3742 maximum a prototype before. */
3743 if (SvTYPE(gv) > SVt_NULL) {
3744 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3745 warn("Runaway prototype");
3746 cv_ckproto((CV*)gv, NULL, ps);
3749 sv_setpv((SV*)gv, ps);
3751 sv_setiv((SV*)gv, -1);
3752 SvREFCNT_dec(PL_compcv);
3753 cv = PL_compcv = NULL;
3754 PL_sub_generation++;
3758 if (!name || GvCVGEN(gv))
3760 else if (cv = GvCV(gv)) {
3761 cv_ckproto(cv, gv, ps);
3762 /* already defined (or promised)? */
3763 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3765 bool const_changed = TRUE;
3767 /* just a "sub foo;" when &foo is already defined */
3768 SAVEFREESV(PL_compcv);
3771 /* ahem, death to those who redefine active sort subs */
3772 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3773 croak("Can't redefine active sort subroutine %s", name);
3774 if(const_sv = cv_const_sv(cv))
3775 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3776 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3777 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3778 && HvNAME(GvSTASH(CvGV(cv)))
3779 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3781 line_t oldline = PL_curcop->cop_line;
3782 PL_curcop->cop_line = PL_copline;
3783 warner(WARN_REDEFINE,
3784 const_sv ? "Constant subroutine %s redefined"
3785 : "Subroutine %s redefined", name);
3786 PL_curcop->cop_line = oldline;
3792 if (cv) { /* must reuse cv if autoloaded */
3794 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3795 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3796 CvOUTSIDE(PL_compcv) = 0;
3797 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3798 CvPADLIST(PL_compcv) = 0;
3799 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3800 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3801 SvREFCNT_dec(PL_compcv);
3808 PL_sub_generation++;
3811 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3812 CvFILEGV(cv) = PL_curcop->cop_filegv;
3813 CvSTASH(cv) = PL_curstash;
3817 New(666, CvMUTEXP(cv), 1, perl_mutex);
3818 MUTEX_INIT(CvMUTEXP(cv));
3819 #endif /* USE_THREADS */
3822 sv_setpv((SV*)cv, ps);
3824 if (PL_error_count) {
3828 char *s = strrchr(name, ':');
3830 if (strEQ(s, "BEGIN")) {
3832 "BEGIN not safe after errors--compilation aborted";
3836 /* force display of errors found but not reported */
3837 sv_catpv(ERRSV, not_safe);
3838 croak("%s", SvPVx(ERRSV, PL_na));
3845 PL_copline = NOLINE;
3850 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3851 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3854 SV **namep = AvARRAY(PL_comppad_name);
3855 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3858 if (SvIMMORTAL(PL_curpad[ix]))
3861 * The only things that a clonable function needs in its
3862 * pad are references to outer lexicals and anonymous subs.
3863 * The rest are created anew during cloning.
3865 if (!((namesv = namep[ix]) != Nullsv &&
3866 namesv != &PL_sv_undef &&
3868 *SvPVX(namesv) == '&')))
3870 SvREFCNT_dec(PL_curpad[ix]);
3871 PL_curpad[ix] = Nullsv;
3876 AV *av = newAV(); /* Will be @_ */
3878 av_store(PL_comppad, 0, (SV*)av);
3879 AvFLAGS(av) = AVf_REIFY;
3881 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3882 if (SvIMMORTAL(PL_curpad[ix]))
3884 if (!SvPADMY(PL_curpad[ix]))
3885 SvPADTMP_on(PL_curpad[ix]);
3889 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3890 CvSTART(cv) = LINKLIST(CvROOT(cv));
3891 CvROOT(cv)->op_next = 0;
3897 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3898 SV *sv = NEWSV(0,0);
3899 SV *tmpstr = sv_newmortal();
3900 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3904 sv_setpvf(sv, "%_:%ld-%ld",
3905 GvSV(PL_curcop->cop_filegv),
3906 (long)PL_subline, (long)PL_curcop->cop_line);
3907 gv_efullname3(tmpstr, gv, Nullch);
3908 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3909 hv = GvHVn(db_postponed);
3910 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3911 && (cv = GvCV(db_postponed))) {
3916 perl_call_sv((SV*)cv, G_DISCARD);
3920 if ((s = strrchr(name,':')))
3924 if (strEQ(s, "BEGIN")) {
3925 I32 oldscope = PL_scopestack_ix;
3927 SAVESPTR(PL_compiling.cop_filegv);
3928 SAVEI16(PL_compiling.cop_line);
3930 sv_setsv(PL_rs, PL_nrs);
3933 PL_beginav = newAV();
3934 DEBUG_x( dump_sub(gv) );
3935 av_push(PL_beginav, (SV *)cv);
3937 call_list(oldscope, PL_beginav);
3939 PL_curcop = &PL_compiling;
3940 PL_compiling.op_private = PL_hints;
3943 else if (strEQ(s, "END") && !PL_error_count) {
3946 av_unshift(PL_endav, 1);
3947 av_store(PL_endav, 0, (SV *)cv);
3950 else if (strEQ(s, "INIT") && !PL_error_count) {
3952 PL_initav = newAV();
3953 av_push(PL_initav, SvREFCNT_inc(cv));
3959 PL_copline = NOLINE;
3965 newCONSTSUB(HV *stash, char *name, SV *sv)
3968 U32 oldhints = PL_hints;
3969 HV *old_cop_stash = PL_curcop->cop_stash;
3970 HV *old_curstash = PL_curstash;
3971 line_t oldline = PL_curcop->cop_line;
3972 PL_curcop->cop_line = PL_copline;
3974 PL_hints &= ~HINT_BLOCK_SCOPE;
3976 PL_curstash = PL_curcop->cop_stash = stash;
3979 start_subparse(FALSE, 0),
3980 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3981 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
3982 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3985 PL_hints = oldhints;
3986 PL_curcop->cop_stash = old_cop_stash;
3987 PL_curstash = old_curstash;
3988 PL_curcop->cop_line = oldline;
3992 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3995 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3998 if (cv = (name ? GvCV(gv) : Nullcv)) {
4000 /* just a cached method */
4004 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4005 /* already defined (or promised) */
4006 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4007 && HvNAME(GvSTASH(CvGV(cv)))
4008 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4009 line_t oldline = PL_curcop->cop_line;
4010 PL_curcop->cop_line = PL_copline;
4011 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
4012 PL_curcop->cop_line = oldline;
4019 if (cv) /* must reuse cv if autoloaded */
4022 cv = (CV*)NEWSV(1105,0);
4023 sv_upgrade((SV *)cv, SVt_PVCV);
4027 PL_sub_generation++;
4030 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4032 New(666, CvMUTEXP(cv), 1, perl_mutex);
4033 MUTEX_INIT(CvMUTEXP(cv));
4035 #endif /* USE_THREADS */
4036 CvFILEGV(cv) = gv_fetchfile(filename);
4037 CvXSUB(cv) = subaddr;
4040 char *s = strrchr(name,':');
4045 if (strEQ(s, "BEGIN")) {
4047 PL_beginav = newAV();
4048 av_push(PL_beginav, (SV *)cv);
4051 else if (strEQ(s, "END")) {
4054 av_unshift(PL_endav, 1);
4055 av_store(PL_endav, 0, (SV *)cv);
4058 else if (strEQ(s, "INIT")) {
4060 PL_initav = newAV();
4061 av_push(PL_initav, (SV *)cv);
4072 newFORM(I32 floor, OP *o, OP *block)
4081 name = SvPVx(cSVOPo->op_sv, PL_na);
4084 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4086 if (cv = GvFORM(gv)) {
4087 if (ckWARN(WARN_REDEFINE)) {
4088 line_t oldline = PL_curcop->cop_line;
4090 PL_curcop->cop_line = PL_copline;
4091 warner(WARN_REDEFINE, "Format %s redefined",name);
4092 PL_curcop->cop_line = oldline;
4098 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4099 CvFILEGV(cv) = PL_curcop->cop_filegv;
4101 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4102 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4103 SvPADTMP_on(PL_curpad[ix]);
4106 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4107 CvSTART(cv) = LINKLIST(CvROOT(cv));
4108 CvROOT(cv)->op_next = 0;
4111 PL_copline = NOLINE;
4118 return newUNOP(OP_REFGEN, 0,
4119 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4125 return newUNOP(OP_REFGEN, 0,
4126 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4130 newANONSUB(I32 floor, OP *proto, OP *block)
4132 return newUNOP(OP_REFGEN, 0,
4133 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4139 switch (o->op_type) {
4141 o->op_type = OP_PADAV;
4142 o->op_ppaddr = ppaddr[OP_PADAV];
4143 return ref(o, OP_RV2AV);
4146 o->op_type = OP_RV2AV;
4147 o->op_ppaddr = ppaddr[OP_RV2AV];
4152 warn("oops: oopsAV");
4161 switch (o->op_type) {
4164 o->op_type = OP_PADHV;
4165 o->op_ppaddr = ppaddr[OP_PADHV];
4166 return ref(o, OP_RV2HV);
4170 o->op_type = OP_RV2HV;
4171 o->op_ppaddr = ppaddr[OP_RV2HV];
4176 warn("oops: oopsHV");
4185 if (o->op_type == OP_PADANY) {
4186 o->op_type = OP_PADAV;
4187 o->op_ppaddr = ppaddr[OP_PADAV];
4190 return newUNOP(OP_RV2AV, 0, scalar(o));
4194 newGVREF(I32 type, OP *o)
4196 if (type == OP_MAPSTART)
4197 return newUNOP(OP_NULL, 0, o);
4198 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4204 if (o->op_type == OP_PADANY) {
4205 o->op_type = OP_PADHV;
4206 o->op_ppaddr = ppaddr[OP_PADHV];
4209 return newUNOP(OP_RV2HV, 0, scalar(o));
4215 croak("NOT IMPL LINE %d",__LINE__);
4221 newCVREF(I32 flags, OP *o)
4223 return newUNOP(OP_RV2CV, flags, scalar(o));
4229 if (o->op_type == OP_PADANY) {
4230 o->op_type = OP_PADSV;
4231 o->op_ppaddr = ppaddr[OP_PADSV];
4234 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4235 o->op_flags |= OPpDONE_SVREF;
4238 return newUNOP(OP_RV2SV, 0, scalar(o));
4241 /* Check routines. */
4249 name = NEWSV(1106,0);
4250 sv_upgrade(name, SVt_PVNV);
4251 sv_setpvn(name, "&", 1);
4254 ix = pad_alloc(o->op_type, SVs_PADMY);
4255 av_store(PL_comppad_name, ix, name);
4256 av_store(PL_comppad, ix, cSVOPo->op_sv);
4257 SvPADMY_on(cSVOPo->op_sv);
4258 cSVOPo->op_sv = Nullsv;
4259 cSVOPo->op_targ = ix;
4266 o->op_private = PL_hints;
4273 if (cUNOPo->op_first->op_type == OP_CONCAT)
4274 o->op_flags |= OPf_STACKED;
4281 if (o->op_flags & OPf_KIDS) {
4284 OPCODE type = o->op_type;
4285 o = modkids(ck_fun(o), type);
4286 kid = cUNOPo->op_first;
4287 newop = kUNOP->op_first->op_sibling;
4289 (newop->op_sibling ||
4290 !(opargs[newop->op_type] & OA_RETSCALAR) ||
4291 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4292 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4296 op_free(kUNOP->op_first);
4297 kUNOP->op_first = newop;
4299 o->op_ppaddr = ppaddr[++o->op_type];
4308 if (o->op_flags & OPf_KIDS) {
4309 OP *kid = cUNOPo->op_first;
4310 if (kid->op_type == OP_HSLICE)
4311 o->op_private |= OPpSLICE;
4312 else if (kid->op_type != OP_HELEM)
4313 croak("%s argument is not a HASH element or slice",
4314 op_desc[o->op_type]);
4323 I32 type = o->op_type;
4325 if (o->op_flags & OPf_KIDS) {
4326 if (cLISTOPo->op_first->op_type == OP_STUB) {
4328 o = newUNOP(type, OPf_SPECIAL,
4329 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4339 PL_hints |= HINT_BLOCK_SCOPE;
4340 if (o->op_flags & OPf_KIDS) {
4341 SVOP *kid = (SVOP*)cUNOPo->op_first;
4344 o->op_flags &= ~OPf_KIDS;
4347 else if (kid->op_type == OP_LINESEQ) {
4350 kid->op_next = o->op_next;
4351 cUNOPo->op_first = 0;
4354 Newz(1101, enter, 1, LOGOP);
4355 enter->op_type = OP_ENTERTRY;
4356 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4357 enter->op_private = 0;
4359 /* establish postfix order */
4360 enter->op_next = (OP*)enter;
4362 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4363 o->op_type = OP_LEAVETRY;
4364 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4365 enter->op_other = o;
4373 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4375 o->op_targ = (PADOFFSET)PL_hints;
4383 if (o->op_flags & OPf_STACKED) {
4385 kid = cUNOPo->op_first->op_sibling;
4386 if (kid->op_type == OP_RV2GV)
4398 if (o->op_flags & OPf_KIDS) {
4399 OP *kid = cUNOPo->op_first;
4400 if (kid->op_type != OP_HELEM)
4401 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4408 ck_gvconst(register OP *o)
4410 o = fold_constants(o);
4411 if (o->op_type == OP_CONST)
4417 ck_rvconst(register OP *o)
4420 SVOP *kid = (SVOP*)cUNOPo->op_first;
4422 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4423 if (kid->op_type == OP_CONST) {
4428 name = SvPV(kid->op_sv, PL_na);
4429 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4430 char *badthing = Nullch;
4431 switch (o->op_type) {
4433 badthing = "a SCALAR";
4436 badthing = "an ARRAY";
4439 badthing = "a HASH";
4444 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4448 * This is a little tricky. We only want to add the symbol if we
4449 * didn't add it in the lexer. Otherwise we get duplicate strict
4450 * warnings. But if we didn't add it in the lexer, we must at
4451 * least pretend like we wanted to add it even if it existed before,
4452 * or we get possible typo warnings. OPpCONST_ENTERED says
4453 * whether the lexer already added THIS instance of this symbol.
4455 iscv = (o->op_type == OP_RV2CV) * 2;
4457 gv = gv_fetchpv(name,
4458 iscv | !(kid->op_private & OPpCONST_ENTERED),
4461 : o->op_type == OP_RV2SV
4463 : o->op_type == OP_RV2AV
4465 : o->op_type == OP_RV2HV
4468 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4470 kid->op_type = OP_GV;
4471 SvREFCNT_dec(kid->op_sv);
4472 kid->op_sv = SvREFCNT_inc(gv);
4482 I32 type = o->op_type;
4484 if (o->op_flags & OPf_REF)
4487 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4488 SVOP *kid = (SVOP*)cUNOPo->op_first;
4490 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4491 OP *newop = newGVOP(type, OPf_REF,
4492 gv_fetchpv(SvPVx(kid->op_sv, PL_na), TRUE, SVt_PVIO));
4499 if (type == OP_FTTTY)
4500 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4503 return newUNOP(type, 0, newDEFSVOP());
4516 int type = o->op_type;
4517 register I32 oa = opargs[type] >> OASHIFT;
4519 if (o->op_flags & OPf_STACKED) {
4520 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4523 return no_fh_allowed(o);
4526 if (o->op_flags & OPf_KIDS) {
4527 tokid = &cLISTOPo->op_first;
4528 kid = cLISTOPo->op_first;
4529 if (kid->op_type == OP_PUSHMARK ||
4530 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4532 tokid = &kid->op_sibling;
4533 kid = kid->op_sibling;
4535 if (!kid && opargs[type] & OA_DEFGV)
4536 *tokid = kid = newDEFSVOP();
4540 sibl = kid->op_sibling;
4554 if (kid->op_type == OP_CONST &&
4555 (kid->op_private & OPpCONST_BARE)) {
4556 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4557 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4558 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4559 if (ckWARN(WARN_SYNTAX))
4561 "Array @%s missing the @ in argument %ld of %s()",
4562 name, (long)numargs, op_desc[type]);
4565 kid->op_sibling = sibl;
4568 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4569 bad_type(numargs, "array", op_desc[o->op_type], kid);
4573 if (kid->op_type == OP_CONST &&
4574 (kid->op_private & OPpCONST_BARE)) {
4575 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4576 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4577 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4578 if (ckWARN(WARN_SYNTAX))
4580 "Hash %%%s missing the %% in argument %ld of %s()",
4581 name, (long)numargs, op_desc[type]);
4584 kid->op_sibling = sibl;
4587 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4588 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4593 OP *newop = newUNOP(OP_NULL, 0, kid);
4594 kid->op_sibling = 0;
4596 newop->op_next = newop;
4598 kid->op_sibling = sibl;
4603 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4604 if (kid->op_type == OP_CONST &&
4605 (kid->op_private & OPpCONST_BARE)) {
4606 OP *newop = newGVOP(OP_GV, 0,
4607 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, PL_na), TRUE,
4613 kid->op_sibling = 0;
4614 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4616 kid->op_sibling = sibl;
4622 mod(scalar(kid), type);
4626 tokid = &kid->op_sibling;
4627 kid = kid->op_sibling;
4629 o->op_private |= numargs;
4631 return too_many_arguments(o,op_desc[o->op_type]);
4634 else if (opargs[type] & OA_DEFGV) {
4636 return newUNOP(type, 0, newDEFSVOP());
4640 while (oa & OA_OPTIONAL)
4642 if (oa && oa != OA_LIST)
4643 return too_few_arguments(o,op_desc[o->op_type]);
4653 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4654 append_elem(OP_GLOB, o, newDEFSVOP());
4656 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4657 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4659 if (gv && GvIMPORTED_CV(gv)) {
4660 static int glob_index;
4662 append_elem(OP_GLOB, o,
4663 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4664 o->op_type = OP_LIST;
4665 o->op_ppaddr = ppaddr[OP_LIST];
4666 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4667 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4668 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4669 append_elem(OP_LIST, o,
4670 scalar(newUNOP(OP_RV2CV, 0,
4671 newGVOP(OP_GV, 0, gv)))));
4672 o = newUNOP(OP_NULL, 0, ck_subr(o));
4673 o->op_targ = OP_GLOB; /* hint at what it used to be */
4676 gv = newGVgen("main");
4678 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4688 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4690 o->op_ppaddr = ppaddr[OP_GREPSTART];
4691 Newz(1101, gwop, 1, LOGOP);
4693 if (o->op_flags & OPf_STACKED) {
4696 kid = cLISTOPo->op_first->op_sibling;
4697 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4700 kid->op_next = (OP*)gwop;
4701 o->op_flags &= ~OPf_STACKED;
4703 kid = cLISTOPo->op_first->op_sibling;
4704 if (type == OP_MAPWHILE)
4711 kid = cLISTOPo->op_first->op_sibling;
4712 if (kid->op_type != OP_NULL)
4713 croak("panic: ck_grep");
4714 kid = kUNOP->op_first;
4716 gwop->op_type = type;
4717 gwop->op_ppaddr = ppaddr[type];
4718 gwop->op_first = listkids(o);
4719 gwop->op_flags |= OPf_KIDS;
4720 gwop->op_private = 1;
4721 gwop->op_other = LINKLIST(kid);
4722 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4723 kid->op_next = (OP*)gwop;
4725 kid = cLISTOPo->op_first->op_sibling;
4726 if (!kid || !kid->op_sibling)
4727 return too_few_arguments(o,op_desc[o->op_type]);
4728 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4729 mod(kid, OP_GREPSTART);
4737 if (o->op_flags & OPf_KIDS) {
4738 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4740 kid = kid->op_sibling; /* get past "big" */
4741 if (kid && kid->op_type == OP_CONST)
4742 fbm_compile(((SVOP*)kid)->op_sv, 0);
4748 ck_lengthconst(OP *o)
4750 /* XXX length optimization goes here */
4757 OPCODE type = o->op_type;
4758 return modkids(ck_fun(o), type);
4764 OPCODE type = o->op_type;
4765 return refkids(ck_fun(o), type);
4773 kid = cLISTOPo->op_first;
4776 kid = cLISTOPo->op_first;
4778 if (kid->op_type == OP_PUSHMARK)
4779 kid = kid->op_sibling;
4780 if (kid && o->op_flags & OPf_STACKED)
4781 kid = kid->op_sibling;
4782 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4783 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4784 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4785 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4786 cLISTOPo->op_first->op_sibling = kid;
4787 cLISTOPo->op_last = kid;
4788 kid = kid->op_sibling;
4793 append_elem(o->op_type, o, newDEFSVOP());
4799 if (PL_hints & HINT_LOCALE)
4800 o->op_private |= OPpLOCALE;
4807 ck_fun_locale(OP *o)
4813 if (PL_hints & HINT_LOCALE)
4814 o->op_private |= OPpLOCALE;
4825 if (PL_hints & HINT_LOCALE)
4826 o->op_private |= OPpLOCALE;
4835 o->op_private |= OPpRUNTIME;
4848 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4849 o->op_private |= OPpREPEAT_DOLIST;
4850 cBINOPo->op_first = force_list(cBINOPo->op_first);
4860 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4861 SVOP *kid = (SVOP*)cUNOPo->op_first;
4863 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4865 for (s = SvPVX(kid->op_sv); *s; s++) {
4866 if (*s == ':' && s[1] == ':') {
4868 Move(s+2, s+1, strlen(s+2)+1, char);
4869 --SvCUR(kid->op_sv);
4872 sv_catpvn(kid->op_sv, ".pm", 3);
4881 croak("NOT IMPL LINE %d",__LINE__);
4890 if (o->op_flags & OPf_KIDS) {
4891 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4892 if (kid && kid->op_sibling) {
4893 o->op_type = OP_SSELECT;
4894 o->op_ppaddr = ppaddr[OP_SSELECT];
4896 return fold_constants(o);
4900 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4901 if (kid && kid->op_type == OP_RV2GV)
4902 kid->op_private &= ~HINT_STRICT_REFS;
4909 I32 type = o->op_type;
4911 if (!(o->op_flags & OPf_KIDS)) {
4916 if (!CvUNIQUE(PL_compcv)) {
4917 argop = newOP(OP_PADAV, OPf_REF);
4918 argop->op_targ = 0; /* PL_curpad[0] is @_ */
4921 argop = newUNOP(OP_RV2AV, 0,
4922 scalar(newGVOP(OP_GV, 0,
4923 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4926 argop = newUNOP(OP_RV2AV, 0,
4927 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
4928 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4929 #endif /* USE_THREADS */
4930 return newUNOP(type, 0, scalar(argop));
4932 return scalar(modkids(ck_fun(o), type));
4940 if (PL_hints & HINT_LOCALE)
4941 o->op_private |= OPpLOCALE;
4944 if (o->op_flags & OPf_STACKED) {
4945 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4947 kid = kUNOP->op_first; /* get past rv2gv */
4949 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4951 if (kid->op_type == OP_SCOPE) {
4955 else if (kid->op_type == OP_LEAVE) {
4956 if (o->op_type == OP_SORT) {
4957 null(kid); /* wipe out leave */
4960 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4961 if (k->op_next == kid)
4966 kid->op_next = 0; /* just disconnect the leave */
4967 k = kLISTOP->op_first;
4971 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4972 null(kid); /* wipe out rv2gv */
4973 if (o->op_type == OP_SORT)
4977 o->op_flags |= OPf_SPECIAL;
4989 if (o->op_flags & OPf_STACKED)
4990 return no_fh_allowed(o);
4992 kid = cLISTOPo->op_first;
4993 if (kid->op_type != OP_NULL)
4994 croak("panic: ck_split");
4995 kid = kid->op_sibling;
4996 op_free(cLISTOPo->op_first);
4997 cLISTOPo->op_first = kid;
4999 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
5000 cLISTOPo->op_last = kid; /* There was only one element previously */
5003 if (kid->op_type != OP_MATCH) {
5004 OP *sibl = kid->op_sibling;
5005 kid->op_sibling = 0;
5006 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5007 if (cLISTOPo->op_first == cLISTOPo->op_last)
5008 cLISTOPo->op_last = kid;
5009 cLISTOPo->op_first = kid;
5010 kid->op_sibling = sibl;
5013 kid->op_type = OP_PUSHRE;
5014 kid->op_ppaddr = ppaddr[OP_PUSHRE];
5017 if (!kid->op_sibling)
5018 append_elem(OP_SPLIT, o, newDEFSVOP());
5020 kid = kid->op_sibling;
5023 if (!kid->op_sibling)
5024 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5026 kid = kid->op_sibling;
5029 if (kid->op_sibling)
5030 return too_many_arguments(o,op_desc[o->op_type]);
5039 OP *prev = ((cUNOPo->op_first->op_sibling)
5040 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5041 OP *o2 = prev->op_sibling;
5049 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5050 if (cvop->op_type == OP_RV2CV) {
5052 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5053 null(cvop); /* disable rv2cv */
5054 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5055 if (tmpop->op_type == OP_GV) {
5056 cv = GvCVu(tmpop->op_sv);
5057 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5058 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5059 proto = SvPV((SV*)cv, PL_na);
5063 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5064 if (PERLDB_SUB && PL_curstash != PL_debstash)
5065 o->op_private |= OPpENTERSUB_DB;
5066 while (o2 != cvop) {
5070 return too_many_arguments(o, gv_ename(namegv));
5088 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5089 bad_type(arg, "block", gv_ename(namegv), o2);
5094 if (o2->op_type == OP_RV2GV)
5098 OP* sib = kid->op_sibling;
5099 kid->op_sibling = 0;
5100 o2 = newUNOP(OP_RV2GV, 0, kid);
5101 o2->op_sibling = sib;
5102 prev->op_sibling = o2;
5110 if (o2->op_type != OP_RV2GV)
5111 bad_type(arg, "symbol", gv_ename(namegv), o2);
5114 if (o2->op_type != OP_RV2CV)
5115 bad_type(arg, "sub", gv_ename(namegv), o2);
5118 if (o2->op_type != OP_RV2SV
5119 && o2->op_type != OP_PADSV
5120 && o2->op_type != OP_THREADSV)
5122 bad_type(arg, "scalar", gv_ename(namegv), o2);
5126 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5127 bad_type(arg, "array", gv_ename(namegv), o2);
5130 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5131 bad_type(arg, "hash", gv_ename(namegv), o2);
5135 OP* sib = kid->op_sibling;
5136 kid->op_sibling = 0;
5137 o2 = newUNOP(OP_REFGEN, 0, kid);
5138 o2->op_sibling = sib;
5139 prev->op_sibling = o2;
5150 croak("Malformed prototype for %s: %s",
5151 gv_ename(namegv), SvPV((SV*)cv, PL_na));
5156 mod(o2, OP_ENTERSUB);
5158 o2 = o2->op_sibling;
5160 if (proto && !optional &&
5161 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5162 return too_few_arguments(o, gv_ename(namegv));
5169 SvREADONLY_on(cSVOPo->op_sv);
5176 if (o->op_flags & OPf_KIDS) {
5177 SVOP *kid = (SVOP*)cUNOPo->op_first;
5179 if (kid->op_type == OP_NULL)
5180 kid = (SVOP*)kid->op_sibling;
5182 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5183 o->op_flags |= OPf_SPECIAL;
5188 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5191 peep(register OP *o)
5194 register OP* oldop = 0;
5195 if (!o || o->op_seq)
5199 SAVESPTR(PL_curcop);
5200 for (; o; o = o->op_next) {
5206 switch (o->op_type) {
5209 PL_curcop = ((COP*)o); /* for warnings */
5210 o->op_seq = PL_op_seqmax++;
5221 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5223 o->op_seq = PL_op_seqmax++;
5226 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5227 o->op_seq = PL_op_seqmax++;
5228 break; /* Scalar stub must produce undef. List stub is noop */
5232 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5233 PL_curcop = ((COP*)o);
5239 if (oldop && o->op_next) {
5240 oldop->op_next = o->op_next;
5243 o->op_seq = PL_op_seqmax++;
5247 if (o->op_next->op_type == OP_RV2SV) {
5248 if (!(o->op_next->op_private & OPpDEREF)) {
5250 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5251 o->op_next = o->op_next->op_next;
5252 o->op_type = OP_GVSV;
5253 o->op_ppaddr = ppaddr[OP_GVSV];
5256 else if (o->op_next->op_type == OP_RV2AV) {
5257 OP* pop = o->op_next->op_next;
5259 if (pop->op_type == OP_CONST &&
5260 (PL_op = pop->op_next) &&
5261 pop->op_next->op_type == OP_AELEM &&
5262 !(pop->op_next->op_private &
5263 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5264 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5268 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5272 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5273 o->op_next = pop->op_next->op_next;
5274 o->op_type = OP_AELEMFAST;
5275 o->op_ppaddr = ppaddr[OP_AELEMFAST];
5276 o->op_private = (U8)i;
5277 GvAVn(((GVOP*)o)->op_gv);
5280 o->op_seq = PL_op_seqmax++;
5287 o->op_seq = PL_op_seqmax++;
5288 while (cLOGOP->op_other->op_type == OP_NULL)
5289 cLOGOP->op_other = cLOGOP->op_other->op_next;
5290 peep(cLOGOP->op_other);
5294 o->op_seq = PL_op_seqmax++;
5295 peep(cCONDOP->op_true);
5296 peep(cCONDOP->op_false);
5300 o->op_seq = PL_op_seqmax++;
5301 peep(cLOOP->op_redoop);
5302 peep(cLOOP->op_nextop);
5303 peep(cLOOP->op_lastop);
5309 o->op_seq = PL_op_seqmax++;
5310 peep(cPMOP->op_pmreplstart);
5314 o->op_seq = PL_op_seqmax++;
5315 if (ckWARN(WARN_SYNTAX) && o->op_next
5316 && o->op_next->op_type == OP_NEXTSTATE) {
5317 if (o->op_next->op_sibling &&
5318 o->op_next->op_sibling->op_type != OP_EXIT &&
5319 o->op_next->op_sibling->op_type != OP_WARN &&
5320 o->op_next->op_sibling->op_type != OP_DIE) {
5321 line_t oldline = PL_curcop->cop_line;
5323 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5324 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5325 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5326 PL_curcop->cop_line = oldline;
5340 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5341 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5343 rop = (UNOP*)((BINOP*)o)->op_first;
5344 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5346 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5347 if (!SvOBJECT(lexname))
5349 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5350 if (!fields || !GvHV(*fields))
5352 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5353 key = SvPV(*svp, keylen);
5354 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5356 croak("No such field \"%s\" in variable %s of type %s",
5357 key, SvPV(lexname, PL_na), HvNAME(SvSTASH(lexname)));
5359 ind = SvIV(*indsvp);
5361 croak("Bad index while coercing array into hash");
5362 rop->op_type = OP_RV2AV;
5363 rop->op_ppaddr = ppaddr[OP_RV2AV];
5364 o->op_type = OP_AELEM;
5365 o->op_ppaddr = ppaddr[OP_AELEM];
5367 *svp = newSViv(ind);
5372 o->op_seq = PL_op_seqmax++;