3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * Now far ahead the Road has gone,
13 * And I must follow, if I can,
14 * Pursuing it with eager feet,
15 * Until it joins some larger way
16 * Where many paths and errands meet.
17 * And whither then? I cannot say.
20 /* This file contains control-oriented pp ("push/pop") functions that
21 * execute the opcodes that make up a perl program. A typical pp function
22 * expects to find its arguments on the stack, and usually pushes its
23 * results onto the stack, hence the 'pp' terminology. Each OP structure
24 * contains a pointer to the relevant pp_foo() function.
26 * Control-oriented means things like pp_enteriter() and pp_next(), which
27 * alter the flow of control of the program.
32 #define PERL_IN_PP_CTL_C
36 #define WORD_ALIGN sizeof(U32)
39 #define DOCATCH(o) ((CATCH_GET == TRUE) ? docatch(o) : (o))
41 static I32 run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen);
49 cxix = dopoptosub(cxstack_ix);
53 switch (cxstack[cxix].blk_gimme) {
70 /* XXXX Should store the old value to allow for tie/overload - and
71 restore in regcomp, where marked with XXXX. */
80 register PMOP *pm = (PMOP*)cLOGOP->op_other;
82 MAGIC *mg = Null(MAGIC*);
84 /* prevent recompiling under /o and ithreads. */
85 #if defined(USE_ITHREADS)
86 if (pm->op_pmflags & PMf_KEEP && PM_GETRE(pm)) {
87 if (PL_op->op_flags & OPf_STACKED) {
96 if (PL_op->op_flags & OPf_STACKED) {
97 /* multiple args; concatentate them */
99 tmpstr = PAD_SV(ARGTARG);
100 sv_setpvn(tmpstr, "", 0);
101 while (++MARK <= SP) {
102 if (PL_amagic_generation) {
104 if ((SvAMAGIC(tmpstr) || SvAMAGIC(*MARK)) &&
105 (sv = amagic_call(tmpstr, *MARK, concat_amg, AMGf_assign)))
107 sv_setsv(tmpstr, sv);
111 sv_catsv(tmpstr, *MARK);
120 SV *sv = SvRV(tmpstr);
122 mg = mg_find(sv, PERL_MAGIC_qr);
125 regexp *re = (regexp *)mg->mg_obj;
126 ReREFCNT_dec(PM_GETRE(pm));
127 PM_SETRE(pm, ReREFCNT_inc(re));
131 const char *t = SvPV_const(tmpstr, len);
133 /* Check against the last compiled regexp. */
134 if (!PM_GETRE(pm) || !PM_GETRE(pm)->precomp ||
135 PM_GETRE(pm)->prelen != (I32)len ||
136 memNE(PM_GETRE(pm)->precomp, t, len))
139 ReREFCNT_dec(PM_GETRE(pm));
140 PM_SETRE(pm, Null(REGEXP*)); /* crucial if regcomp aborts */
142 if (PL_op->op_flags & OPf_SPECIAL)
143 PL_reginterp_cnt = I32_MAX; /* Mark as safe. */
145 pm->op_pmflags = pm->op_pmpermflags; /* reset case sensitivity */
147 pm->op_pmdynflags |= PMdf_DYN_UTF8;
149 pm->op_pmdynflags &= ~PMdf_DYN_UTF8;
150 if (pm->op_pmdynflags & PMdf_UTF8)
151 t = (char*)bytes_to_utf8((U8*)t, &len);
153 PM_SETRE(pm, CALLREGCOMP(aTHX_ (char *)t, (char *)t + len, pm));
154 if (!DO_UTF8(tmpstr) && (pm->op_pmdynflags & PMdf_UTF8))
156 PL_reginterp_cnt = 0; /* XXXX Be extra paranoid - needed
157 inside tie/overload accessors. */
161 #ifndef INCOMPLETE_TAINTS
164 pm->op_pmdynflags |= PMdf_TAINTED;
166 pm->op_pmdynflags &= ~PMdf_TAINTED;
170 if (!PM_GETRE(pm)->prelen && PL_curpm)
172 else if (strEQ("\\s+", PM_GETRE(pm)->precomp))
173 pm->op_pmflags |= PMf_WHITE;
175 pm->op_pmflags &= ~PMf_WHITE;
177 /* XXX runtime compiled output needs to move to the pad */
178 if (pm->op_pmflags & PMf_KEEP) {
179 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
180 #if !defined(USE_ITHREADS)
181 /* XXX can't change the optree at runtime either */
182 cLOGOP->op_first->op_next = PL_op->op_next;
191 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
192 register PMOP * const pm = (PMOP*) cLOGOP->op_other;
193 register SV * const dstr = cx->sb_dstr;
194 register char *s = cx->sb_s;
195 register char *m = cx->sb_m;
196 char *orig = cx->sb_orig;
197 register REGEXP * const rx = cx->sb_rx;
199 REGEXP *old = PM_GETRE(pm);
206 rxres_restore(&cx->sb_rxres, rx);
207 RX_MATCH_UTF8_set(rx, SvUTF8(cx->sb_targ));
209 if (cx->sb_iters++) {
210 const I32 saviters = cx->sb_iters;
211 if (cx->sb_iters > cx->sb_maxiters)
212 DIE(aTHX_ "Substitution loop");
214 if (!(cx->sb_rxtainted & 2) && SvTAINTED(TOPs))
215 cx->sb_rxtainted |= 2;
216 sv_catsv(dstr, POPs);
219 if (cx->sb_once || !CALLREGEXEC(aTHX_ rx, s, cx->sb_strend, orig,
220 s == m, cx->sb_targ, NULL,
221 ((cx->sb_rflags & REXEC_COPY_STR)
222 ? (REXEC_IGNOREPOS|REXEC_NOT_FIRST)
223 : (REXEC_COPY_STR|REXEC_IGNOREPOS|REXEC_NOT_FIRST))))
225 SV *targ = cx->sb_targ;
227 assert(cx->sb_strend >= s);
228 if(cx->sb_strend > s) {
229 if (DO_UTF8(dstr) && !SvUTF8(targ))
230 sv_catpvn_utf8_upgrade(dstr, s, cx->sb_strend - s, nsv);
232 sv_catpvn(dstr, s, cx->sb_strend - s);
234 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
236 #ifdef PERL_OLD_COPY_ON_WRITE
238 sv_force_normal_flags(targ, SV_COW_DROP_PV);
244 SvPV_set(targ, SvPVX(dstr));
245 SvCUR_set(targ, SvCUR(dstr));
246 SvLEN_set(targ, SvLEN(dstr));
249 SvPV_set(dstr, (char*)0);
252 TAINT_IF(cx->sb_rxtainted & 1);
253 PUSHs(sv_2mortal(newSViv(saviters - 1)));
255 (void)SvPOK_only_UTF8(targ);
256 TAINT_IF(cx->sb_rxtainted);
260 LEAVE_SCOPE(cx->sb_oldsave);
263 RETURNOP(pm->op_next);
265 cx->sb_iters = saviters;
267 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
270 cx->sb_orig = orig = rx->subbeg;
272 cx->sb_strend = s + (cx->sb_strend - m);
274 cx->sb_m = m = rx->startp[0] + orig;
276 if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
277 sv_catpvn_utf8_upgrade(dstr, s, m - s, nsv);
279 sv_catpvn(dstr, s, m-s);
281 cx->sb_s = rx->endp[0] + orig;
282 { /* Update the pos() information. */
283 SV *sv = cx->sb_targ;
286 if (SvTYPE(sv) < SVt_PVMG)
287 SvUPGRADE(sv, SVt_PVMG);
288 if (!(mg = mg_find(sv, PERL_MAGIC_regex_global))) {
289 sv_magic(sv, Nullsv, PERL_MAGIC_regex_global, Nullch, 0);
290 mg = mg_find(sv, PERL_MAGIC_regex_global);
298 (void)ReREFCNT_inc(rx);
299 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
300 rxres_save(&cx->sb_rxres, rx);
301 RETURNOP(pm->op_pmreplstart);
305 Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
310 if (!p || p[1] < rx->nparens) {
311 #ifdef PERL_OLD_COPY_ON_WRITE
312 i = 7 + rx->nparens * 2;
314 i = 6 + rx->nparens * 2;
323 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? rx->subbeg : Nullch);
324 RX_MATCH_COPIED_off(rx);
326 #ifdef PERL_OLD_COPY_ON_WRITE
327 *p++ = PTR2UV(rx->saved_copy);
328 rx->saved_copy = Nullsv;
333 *p++ = PTR2UV(rx->subbeg);
334 *p++ = (UV)rx->sublen;
335 for (i = 0; i <= rx->nparens; ++i) {
336 *p++ = (UV)rx->startp[i];
337 *p++ = (UV)rx->endp[i];
342 Perl_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
347 RX_MATCH_COPY_FREE(rx);
348 RX_MATCH_COPIED_set(rx, *p);
351 #ifdef PERL_OLD_COPY_ON_WRITE
353 SvREFCNT_dec (rx->saved_copy);
354 rx->saved_copy = INT2PTR(SV*,*p);
360 rx->subbeg = INT2PTR(char*,*p++);
361 rx->sublen = (I32)(*p++);
362 for (i = 0; i <= rx->nparens; ++i) {
363 rx->startp[i] = (I32)(*p++);
364 rx->endp[i] = (I32)(*p++);
369 Perl_rxres_free(pTHX_ void **rsp)
375 void *tmp = INT2PTR(char*,*p);
378 Poison(*p, 1, sizeof(*p));
380 Safefree(INT2PTR(char*,*p));
382 #ifdef PERL_OLD_COPY_ON_WRITE
384 SvREFCNT_dec (INT2PTR(SV*,p[1]));
394 dSP; dMARK; dORIGMARK;
395 register SV *tmpForm = *++MARK;
400 register SV *sv = Nullsv;
401 const char *item = Nullch;
405 bool chopspace = (strchr(PL_chopset, ' ') != Nullch);
406 const char *chophere = Nullch;
407 char *linemark = Nullch;
409 bool gotsome = FALSE;
411 STRLEN fudge = SvPOK(tmpForm)
412 ? (SvCUR(tmpForm) * (IN_BYTES ? 1 : 3) + 1) : 0;
413 bool item_is_utf8 = FALSE;
414 bool targ_is_utf8 = FALSE;
420 if (!SvMAGICAL(tmpForm) || !SvCOMPILED(tmpForm)) {
421 if (SvREADONLY(tmpForm)) {
422 SvREADONLY_off(tmpForm);
423 parseres = doparseform(tmpForm);
424 SvREADONLY_on(tmpForm);
427 parseres = doparseform(tmpForm);
431 SvPV_force(PL_formtarget, len);
432 if (DO_UTF8(PL_formtarget))
434 t = SvGROW(PL_formtarget, len + fudge + 1); /* XXX SvCUR bad */
436 f = SvPV_const(tmpForm, len);
437 /* need to jump to the next word */
438 fpc = (U32*)(f + len + WORD_ALIGN - SvCUR(tmpForm) % WORD_ALIGN);
442 const char *name = "???";
445 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
446 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
447 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
448 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
449 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
451 case FF_CHECKNL: name = "CHECKNL"; break;
452 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
453 case FF_SPACE: name = "SPACE"; break;
454 case FF_HALFSPACE: name = "HALFSPACE"; break;
455 case FF_ITEM: name = "ITEM"; break;
456 case FF_CHOP: name = "CHOP"; break;
457 case FF_LINEGLOB: name = "LINEGLOB"; break;
458 case FF_NEWLINE: name = "NEWLINE"; break;
459 case FF_MORE: name = "MORE"; break;
460 case FF_LINEMARK: name = "LINEMARK"; break;
461 case FF_END: name = "END"; break;
462 case FF_0DECIMAL: name = "0DECIMAL"; break;
463 case FF_LINESNGL: name = "LINESNGL"; break;
466 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
468 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
479 if (targ_is_utf8 && !SvUTF8(tmpForm)) {
480 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
482 sv_catpvn_utf8_upgrade(PL_formtarget, f, arg, nsv);
483 t = SvEND(PL_formtarget);
486 if (!targ_is_utf8 && DO_UTF8(tmpForm)) {
487 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
489 sv_utf8_upgrade(PL_formtarget);
490 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
491 t = SvEND(PL_formtarget);
511 if (ckWARN(WARN_SYNTAX))
512 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
519 const char *s = item = SvPV_const(sv, len);
522 itemsize = sv_len_utf8(sv);
523 if (itemsize != (I32)len) {
525 if (itemsize > fieldsize) {
526 itemsize = fieldsize;
527 itembytes = itemsize;
528 sv_pos_u2b(sv, &itembytes, 0);
532 send = chophere = s + itembytes;
542 sv_pos_b2u(sv, &itemsize);
546 item_is_utf8 = FALSE;
547 if (itemsize > fieldsize)
548 itemsize = fieldsize;
549 send = chophere = s + itemsize;
563 const char *s = item = SvPV_const(sv, len);
566 itemsize = sv_len_utf8(sv);
567 if (itemsize != (I32)len) {
569 if (itemsize <= fieldsize) {
570 const char *send = chophere = s + itemsize;
583 itemsize = fieldsize;
584 itembytes = itemsize;
585 sv_pos_u2b(sv, &itembytes, 0);
586 send = chophere = s + itembytes;
587 while (s < send || (s == send && isSPACE(*s))) {
597 if (strchr(PL_chopset, *s))
602 itemsize = chophere - item;
603 sv_pos_b2u(sv, &itemsize);
609 item_is_utf8 = FALSE;
610 if (itemsize <= fieldsize) {
611 const char *const send = chophere = s + itemsize;
624 itemsize = fieldsize;
625 send = chophere = s + itemsize;
626 while (s < send || (s == send && isSPACE(*s))) {
636 if (strchr(PL_chopset, *s))
641 itemsize = chophere - item;
647 arg = fieldsize - itemsize;
656 arg = fieldsize - itemsize;
667 const char *s = item;
671 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
673 sv_utf8_upgrade(PL_formtarget);
674 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
675 t = SvEND(PL_formtarget);
679 if (UTF8_IS_CONTINUED(*s)) {
680 STRLEN skip = UTF8SKIP(s);
697 if ( !((*t++ = *s++) & ~31) )
703 if (targ_is_utf8 && !item_is_utf8) {
704 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
706 sv_catpvn_utf8_upgrade(PL_formtarget, s, arg, nsv);
707 for (; t < SvEND(PL_formtarget); t++) {
720 const int ch = *t++ = *s++;
723 if ( !((*t++ = *s++) & ~31) )
732 const char *s = chophere;
734 while (*s && isSPACE(*s))
750 const char *s = item = SvPV_const(sv, len);
752 if ((item_is_utf8 = DO_UTF8(sv)))
753 itemsize = sv_len_utf8(sv);
755 bool chopped = FALSE;
756 const char *const send = s + len;
758 chophere = s + itemsize;
774 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
776 SvUTF8_on(PL_formtarget);
778 SvCUR_set(sv, chophere - item);
779 sv_catsv(PL_formtarget, sv);
780 SvCUR_set(sv, itemsize);
782 sv_catsv(PL_formtarget, sv);
784 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) - 1);
785 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
786 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
795 #if defined(USE_LONG_DOUBLE)
796 fmt = (arg & 256) ? "%#0*.*" PERL_PRIfldbl : "%0*.*" PERL_PRIfldbl;
798 fmt = (arg & 256) ? "%#0*.*f" : "%0*.*f";
803 #if defined(USE_LONG_DOUBLE)
804 fmt = (arg & 256) ? "%#*.*" PERL_PRIfldbl : "%*.*" PERL_PRIfldbl;
806 fmt = (arg & 256) ? "%#*.*f" : "%*.*f";
809 /* If the field is marked with ^ and the value is undefined,
811 if ((arg & 512) && !SvOK(sv)) {
819 /* overflow evidence */
820 if (num_overflow(value, fieldsize, arg)) {
826 /* Formats aren't yet marked for locales, so assume "yes". */
828 STORE_NUMERIC_STANDARD_SET_LOCAL();
829 sprintf(t, fmt, (int) fieldsize, (int) arg & 255, value);
830 RESTORE_NUMERIC_STANDARD();
837 while (t-- > linemark && *t == ' ') ;
845 if (arg) { /* repeat until fields exhausted? */
847 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
848 lines += FmLINES(PL_formtarget);
851 if (strnEQ(linemark, linemark - arg, arg))
852 DIE(aTHX_ "Runaway format");
855 SvUTF8_on(PL_formtarget);
856 FmLINES(PL_formtarget) = lines;
858 RETURNOP(cLISTOP->op_first);
869 const char *s = chophere;
870 const char *send = item + len;
872 while (*s && isSPACE(*s) && s < send)
877 arg = fieldsize - itemsize;
884 if (strnEQ(s1," ",3)) {
885 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
896 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
898 SvUTF8_on(PL_formtarget);
899 FmLINES(PL_formtarget) += lines;
911 if (PL_stack_base + *PL_markstack_ptr == SP) {
913 if (GIMME_V == G_SCALAR)
914 XPUSHs(sv_2mortal(newSViv(0)));
915 RETURNOP(PL_op->op_next->op_next);
917 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
918 pp_pushmark(); /* push dst */
919 pp_pushmark(); /* push src */
920 ENTER; /* enter outer scope */
923 if (PL_op->op_private & OPpGREP_LEX)
924 SAVESPTR(PAD_SVl(PL_op->op_targ));
927 ENTER; /* enter inner scope */
930 src = PL_stack_base[*PL_markstack_ptr];
932 if (PL_op->op_private & OPpGREP_LEX)
933 PAD_SVl(PL_op->op_targ) = src;
938 if (PL_op->op_type == OP_MAPSTART)
939 pp_pushmark(); /* push top */
940 return ((LOGOP*)PL_op->op_next)->op_other;
945 DIE(aTHX_ "panic: mapstart"); /* uses grepstart */
951 const I32 gimme = GIMME_V;
952 I32 items = (SP - PL_stack_base) - *PL_markstack_ptr; /* how many new items */
958 /* first, move source pointer to the next item in the source list */
959 ++PL_markstack_ptr[-1];
961 /* if there are new items, push them into the destination list */
962 if (items && gimme != G_VOID) {
963 /* might need to make room back there first */
964 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
965 /* XXX this implementation is very pessimal because the stack
966 * is repeatedly extended for every set of items. Is possible
967 * to do this without any stack extension or copying at all
968 * by maintaining a separate list over which the map iterates
969 * (like foreach does). --gsar */
971 /* everything in the stack after the destination list moves
972 * towards the end the stack by the amount of room needed */
973 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
975 /* items to shift up (accounting for the moved source pointer) */
976 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
978 /* This optimization is by Ben Tilly and it does
979 * things differently from what Sarathy (gsar)
980 * is describing. The downside of this optimization is
981 * that leaves "holes" (uninitialized and hopefully unused areas)
982 * to the Perl stack, but on the other hand this
983 * shouldn't be a problem. If Sarathy's idea gets
984 * implemented, this optimization should become
985 * irrelevant. --jhi */
987 shift = count; /* Avoid shifting too often --Ben Tilly */
992 PL_markstack_ptr[-1] += shift;
993 *PL_markstack_ptr += shift;
997 /* copy the new items down to the destination list */
998 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
999 if (gimme == G_ARRAY) {
1001 *dst-- = SvTEMP(TOPs) ? POPs : sv_mortalcopy(POPs);
1004 /* scalar context: we don't care about which values map returns
1005 * (we use undef here). And so we certainly don't want to do mortal
1006 * copies of meaningless values. */
1007 while (items-- > 0) {
1009 *dst-- = &PL_sv_undef;
1013 LEAVE; /* exit inner scope */
1016 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
1018 (void)POPMARK; /* pop top */
1019 LEAVE; /* exit outer scope */
1020 (void)POPMARK; /* pop src */
1021 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1022 (void)POPMARK; /* pop dst */
1023 SP = PL_stack_base + POPMARK; /* pop original mark */
1024 if (gimme == G_SCALAR) {
1025 if (PL_op->op_private & OPpGREP_LEX) {
1026 SV* sv = sv_newmortal();
1027 sv_setiv(sv, items);
1035 else if (gimme == G_ARRAY)
1042 ENTER; /* enter inner scope */
1045 /* set $_ to the new source item */
1046 src = PL_stack_base[PL_markstack_ptr[-1]];
1048 if (PL_op->op_private & OPpGREP_LEX)
1049 PAD_SVl(PL_op->op_targ) = src;
1053 RETURNOP(cLOGOP->op_other);
1061 if (GIMME == G_ARRAY)
1063 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1064 return cLOGOP->op_other;
1073 if (GIMME == G_ARRAY) {
1074 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1078 SV *targ = PAD_SV(PL_op->op_targ);
1081 if (PL_op->op_private & OPpFLIP_LINENUM) {
1082 if (GvIO(PL_last_in_gv)) {
1083 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1086 GV *gv = gv_fetchpv(".", TRUE, SVt_PV);
1087 if (gv && GvSV(gv)) flip = SvIV(sv) == SvIV(GvSV(gv));
1093 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
1094 if (PL_op->op_flags & OPf_SPECIAL) {
1102 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1105 sv_setpvn(TARG, "", 0);
1111 /* This code tries to decide if "$left .. $right" should use the
1112 magical string increment, or if the range is numeric (we make
1113 an exception for .."0" [#18165]). AMS 20021031. */
1115 #define RANGE_IS_NUMERIC(left,right) ( \
1116 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1117 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
1118 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
1119 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
1120 && (!SvOK(right) || looks_like_number(right))))
1126 if (GIMME == G_ARRAY) {
1129 if (SvGMAGICAL(left))
1131 if (SvGMAGICAL(right))
1134 if (RANGE_IS_NUMERIC(left,right)) {
1137 if ((SvOK(left) && SvNV(left) < IV_MIN) ||
1138 (SvOK(right) && SvNV(right) > IV_MAX))
1139 DIE(aTHX_ "Range iterator outside integer range");
1150 SV * const sv = sv_2mortal(newSViv(i++));
1155 SV *final = sv_mortalcopy(right);
1157 const char *tmps = SvPV_const(final, len);
1159 SV *sv = sv_mortalcopy(left);
1160 SvPV_force_nolen(sv);
1161 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
1163 if (strEQ(SvPVX_const(sv),tmps))
1165 sv = sv_2mortal(newSVsv(sv));
1172 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
1176 if (PL_op->op_private & OPpFLIP_LINENUM) {
1177 if (GvIO(PL_last_in_gv)) {
1178 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1181 GV * const gv = gv_fetchpv(".", TRUE, SVt_PV);
1182 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1190 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
1191 sv_catpvn(targ, "E0", 2);
1201 static const char * const context_name[] = {
1212 S_dopoptolabel(pTHX_ const char *label)
1216 for (i = cxstack_ix; i >= 0; i--) {
1217 register const PERL_CONTEXT * const cx = &cxstack[i];
1218 switch (CxTYPE(cx)) {
1224 if (ckWARN(WARN_EXITING))
1225 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1226 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1227 if (CxTYPE(cx) == CXt_NULL)
1231 if ( !cx->blk_loop.label || strNE(label, cx->blk_loop.label) ) {
1232 DEBUG_l(Perl_deb(aTHX_ "(Skipping label #%ld %s)\n",
1233 (long)i, cx->blk_loop.label));
1236 DEBUG_l( Perl_deb(aTHX_ "(Found label #%ld %s)\n", (long)i, label));
1244 Perl_dowantarray(pTHX)
1246 const I32 gimme = block_gimme();
1247 return (gimme == G_VOID) ? G_SCALAR : gimme;
1251 Perl_block_gimme(pTHX)
1253 const I32 cxix = dopoptosub(cxstack_ix);
1257 switch (cxstack[cxix].blk_gimme) {
1265 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
1272 Perl_is_lvalue_sub(pTHX)
1274 const I32 cxix = dopoptosub(cxstack_ix);
1275 assert(cxix >= 0); /* We should only be called from inside subs */
1277 if (cxstack[cxix].blk_sub.lval && CvLVALUE(cxstack[cxix].blk_sub.cv))
1278 return cxstack[cxix].blk_sub.lval;
1284 S_dopoptosub(pTHX_ I32 startingblock)
1286 return dopoptosub_at(cxstack, startingblock);
1290 S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
1293 for (i = startingblock; i >= 0; i--) {
1294 register const PERL_CONTEXT * const cx = &cxstk[i];
1295 switch (CxTYPE(cx)) {
1301 DEBUG_l( Perl_deb(aTHX_ "(Found sub #%ld)\n", (long)i));
1309 S_dopoptoeval(pTHX_ I32 startingblock)
1312 for (i = startingblock; i >= 0; i--) {
1313 register const PERL_CONTEXT *cx = &cxstack[i];
1314 switch (CxTYPE(cx)) {
1318 DEBUG_l( Perl_deb(aTHX_ "(Found eval #%ld)\n", (long)i));
1326 S_dopoptoloop(pTHX_ I32 startingblock)
1329 for (i = startingblock; i >= 0; i--) {
1330 register const PERL_CONTEXT * const cx = &cxstack[i];
1331 switch (CxTYPE(cx)) {
1337 if (ckWARN(WARN_EXITING))
1338 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1339 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1340 if ((CxTYPE(cx)) == CXt_NULL)
1344 DEBUG_l( Perl_deb(aTHX_ "(Found loop #%ld)\n", (long)i));
1352 Perl_dounwind(pTHX_ I32 cxix)
1356 while (cxstack_ix > cxix) {
1358 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
1359 DEBUG_l(PerlIO_printf(Perl_debug_log, "Unwinding block %ld, type %s\n",
1360 (long) cxstack_ix, PL_block_type[CxTYPE(cx)]));
1361 /* Note: we don't need to restore the base context info till the end. */
1362 switch (CxTYPE(cx)) {
1365 continue; /* not break */
1384 PERL_UNUSED_VAR(optype);
1388 Perl_qerror(pTHX_ SV *err)
1391 sv_catsv(ERRSV, err);
1393 sv_catsv(PL_errors, err);
1395 Perl_warn(aTHX_ "%"SVf, err);
1400 Perl_die_where(pTHX_ const char *message, STRLEN msglen)
1409 if (PL_in_eval & EVAL_KEEPERR) {
1410 static const char prefix[] = "\t(in cleanup) ";
1412 const char *e = Nullch;
1414 sv_setpvn(err,"",0);
1415 else if (SvCUR(err) >= sizeof(prefix)+msglen-1) {
1417 e = SvPV_const(err, len);
1419 if (*e != *message || strNE(e,message))
1423 SvGROW(err, SvCUR(err)+sizeof(prefix)+msglen);
1424 sv_catpvn(err, prefix, sizeof(prefix)-1);
1425 sv_catpvn(err, message, msglen);
1426 if (ckWARN(WARN_MISC)) {
1427 const STRLEN start = SvCUR(err)-msglen-sizeof(prefix)+1;
1428 Perl_warner(aTHX_ packWARN(WARN_MISC), SvPVX_const(err)+start);
1433 sv_setpvn(ERRSV, message, msglen);
1437 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1438 && PL_curstackinfo->si_prev)
1446 register PERL_CONTEXT *cx;
1449 if (cxix < cxstack_ix)
1452 POPBLOCK(cx,PL_curpm);
1453 if (CxTYPE(cx) != CXt_EVAL) {
1455 message = SvPVx_const(ERRSV, msglen);
1456 PerlIO_write(Perl_error_log, "panic: die ", 11);
1457 PerlIO_write(Perl_error_log, message, msglen);
1462 if (gimme == G_SCALAR)
1463 *++newsp = &PL_sv_undef;
1464 PL_stack_sp = newsp;
1468 /* LEAVE could clobber PL_curcop (see save_re_context())
1469 * XXX it might be better to find a way to avoid messing with
1470 * PL_curcop in save_re_context() instead, but this is a more
1471 * minimal fix --GSAR */
1472 PL_curcop = cx->blk_oldcop;
1474 if (optype == OP_REQUIRE) {
1475 const char* msg = SvPVx_nolen_const(ERRSV);
1476 SV * const nsv = cx->blk_eval.old_namesv;
1477 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
1479 DIE(aTHX_ "%sCompilation failed in require",
1480 *msg ? msg : "Unknown error\n");
1482 assert(CxTYPE(cx) == CXt_EVAL);
1483 return cx->blk_eval.retop;
1487 message = SvPVx_const(ERRSV, msglen);
1489 write_to_stderr(message, msglen);
1498 if (SvTRUE(left) != SvTRUE(right))
1510 RETURNOP(cLOGOP->op_other);
1519 RETURNOP(cLOGOP->op_other);
1528 if (!sv || !SvANY(sv)) {
1529 RETURNOP(cLOGOP->op_other);
1532 switch (SvTYPE(sv)) {
1534 if (AvMAX(sv) >= 0 || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
1538 if (HvARRAY(sv) || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
1542 if (CvROOT(sv) || CvXSUB(sv))
1552 RETURNOP(cLOGOP->op_other);
1558 register I32 cxix = dopoptosub(cxstack_ix);
1559 register const PERL_CONTEXT *cx;
1560 register const PERL_CONTEXT *ccstack = cxstack;
1561 const PERL_SI *top_si = PL_curstackinfo;
1563 const char *stashname;
1570 /* we may be in a higher stacklevel, so dig down deeper */
1571 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1572 top_si = top_si->si_prev;
1573 ccstack = top_si->si_cxstack;
1574 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1577 if (GIMME != G_ARRAY) {
1583 /* caller() should not report the automatic calls to &DB::sub */
1584 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
1585 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1589 cxix = dopoptosub_at(ccstack, cxix - 1);
1592 cx = &ccstack[cxix];
1593 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1594 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
1595 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1596 field below is defined for any cx. */
1597 /* caller() should not report the automatic calls to &DB::sub */
1598 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1599 cx = &ccstack[dbcxix];
1602 stashname = CopSTASHPV(cx->blk_oldcop);
1603 if (GIMME != G_ARRAY) {
1606 PUSHs(&PL_sv_undef);
1609 sv_setpv(TARG, stashname);
1618 PUSHs(&PL_sv_undef);
1620 PUSHs(sv_2mortal(newSVpv(stashname, 0)));
1621 PUSHs(sv_2mortal(newSVpv(OutCopFILE(cx->blk_oldcop), 0)));
1622 PUSHs(sv_2mortal(newSViv((I32)CopLINE(cx->blk_oldcop))));
1625 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1626 GV *cvgv = CvGV(ccstack[cxix].blk_sub.cv);
1627 /* So is ccstack[dbcxix]. */
1629 SV * const sv = NEWSV(49, 0);
1630 gv_efullname3(sv, cvgv, Nullch);
1631 PUSHs(sv_2mortal(sv));
1632 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1635 PUSHs(sv_2mortal(newSVpvn("(unknown)",9)));
1636 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1640 PUSHs(sv_2mortal(newSVpvn("(eval)",6)));
1641 PUSHs(sv_2mortal(newSViv(0)));
1643 gimme = (I32)cx->blk_gimme;
1644 if (gimme == G_VOID)
1645 PUSHs(&PL_sv_undef);
1647 PUSHs(sv_2mortal(newSViv(gimme & G_ARRAY)));
1648 if (CxTYPE(cx) == CXt_EVAL) {
1650 if (cx->blk_eval.old_op_type == OP_ENTEREVAL) {
1651 PUSHs(cx->blk_eval.cur_text);
1655 else if (cx->blk_eval.old_namesv) {
1656 PUSHs(sv_2mortal(newSVsv(cx->blk_eval.old_namesv)));
1659 /* eval BLOCK (try blocks have old_namesv == 0) */
1661 PUSHs(&PL_sv_undef);
1662 PUSHs(&PL_sv_undef);
1666 PUSHs(&PL_sv_undef);
1667 PUSHs(&PL_sv_undef);
1669 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs
1670 && CopSTASH_eq(PL_curcop, PL_debstash))
1672 AV * const ary = cx->blk_sub.argarray;
1673 const int off = AvARRAY(ary) - AvALLOC(ary);
1677 PL_dbargs = GvAV(gv_AVadd(tmpgv = gv_fetchpv("DB::args", TRUE,
1680 AvREAL_off(PL_dbargs); /* XXX should be REIFY (see av.h) */
1683 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1684 av_extend(PL_dbargs, AvFILLp(ary) + off);
1685 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1686 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1688 /* XXX only hints propagated via op_private are currently
1689 * visible (others are not easily accessible, since they
1690 * use the global PL_hints) */
1691 PUSHs(sv_2mortal(newSViv((I32)cx->blk_oldcop->op_private &
1692 HINT_PRIVATE_MASK)));
1695 SV * old_warnings = cx->blk_oldcop->cop_warnings ;
1697 if (old_warnings == pWARN_NONE ||
1698 (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0))
1699 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
1700 else if (old_warnings == pWARN_ALL ||
1701 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
1702 /* Get the bit mask for $warnings::Bits{all}, because
1703 * it could have been extended by warnings::register */
1705 HV *bits = get_hv("warnings::Bits", FALSE);
1706 if (bits && (bits_all=hv_fetch(bits, "all", 3, FALSE))) {
1707 mask = newSVsv(*bits_all);
1710 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1714 mask = newSVsv(old_warnings);
1715 PUSHs(sv_2mortal(mask));
1729 sv_reset(tmps, CopSTASH(PL_curcop));
1739 /* like pp_nextstate, but used instead when the debugger is active */
1744 PL_curcop = (COP*)PL_op;
1745 TAINT_NOT; /* Each statement is presumed innocent */
1746 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
1749 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
1750 || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
1754 register PERL_CONTEXT *cx;
1755 const I32 gimme = G_ARRAY;
1762 DIE(aTHX_ "No DB::DB routine defined");
1764 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
1765 /* don't do recursive DB::DB call */
1777 PUSHBLOCK(cx, CXt_SUB, SP);
1779 cx->blk_sub.retop = PL_op->op_next;
1781 PAD_SET_CUR(CvPADLIST(cv),1);
1782 RETURNOP(CvSTART(cv));
1796 register PERL_CONTEXT *cx;
1797 const I32 gimme = GIMME_V;
1799 U32 cxtype = CXt_LOOP;
1807 if (PL_op->op_targ) {
1808 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
1809 SvPADSTALE_off(PAD_SVl(PL_op->op_targ));
1810 SAVESETSVFLAGS(PAD_SVl(PL_op->op_targ),
1811 SVs_PADSTALE, SVs_PADSTALE);
1813 #ifndef USE_ITHREADS
1814 svp = &PAD_SVl(PL_op->op_targ); /* "my" variable */
1817 SAVEPADSV(PL_op->op_targ);
1818 iterdata = INT2PTR(void*, PL_op->op_targ);
1819 cxtype |= CXp_PADVAR;
1824 svp = &GvSV(gv); /* symbol table variable */
1825 SAVEGENERICSV(*svp);
1828 iterdata = (void*)gv;
1834 PUSHBLOCK(cx, cxtype, SP);
1836 PUSHLOOP(cx, iterdata, MARK);
1838 PUSHLOOP(cx, svp, MARK);
1840 if (PL_op->op_flags & OPf_STACKED) {
1841 cx->blk_loop.iterary = (AV*)SvREFCNT_inc(POPs);
1842 if (SvTYPE(cx->blk_loop.iterary) != SVt_PVAV) {
1844 SV *right = (SV*)cx->blk_loop.iterary;
1845 if (RANGE_IS_NUMERIC(sv,right)) {
1846 if ((SvOK(sv) && SvNV(sv) < IV_MIN) ||
1847 (SvOK(right) && SvNV(right) >= IV_MAX))
1848 DIE(aTHX_ "Range iterator outside integer range");
1849 cx->blk_loop.iterix = SvIV(sv);
1850 cx->blk_loop.itermax = SvIV(right);
1853 cx->blk_loop.iterlval = newSVsv(sv);
1854 (void) SvPV_force_nolen(cx->blk_loop.iterlval);
1855 (void) SvPV_nolen_const(right);
1858 else if (PL_op->op_private & OPpITER_REVERSED) {
1859 cx->blk_loop.itermax = -1;
1860 cx->blk_loop.iterix = AvFILL(cx->blk_loop.iterary);
1865 cx->blk_loop.iterary = PL_curstack;
1866 AvFILLp(PL_curstack) = SP - PL_stack_base;
1867 if (PL_op->op_private & OPpITER_REVERSED) {
1868 cx->blk_loop.itermax = MARK - PL_stack_base;
1869 cx->blk_loop.iterix = cx->blk_oldsp;
1872 cx->blk_loop.iterix = MARK - PL_stack_base;
1882 register PERL_CONTEXT *cx;
1883 const I32 gimme = GIMME_V;
1889 PUSHBLOCK(cx, CXt_LOOP, SP);
1890 PUSHLOOP(cx, 0, SP);
1898 register PERL_CONTEXT *cx;
1905 assert(CxTYPE(cx) == CXt_LOOP);
1907 newsp = PL_stack_base + cx->blk_loop.resetsp;
1910 if (gimme == G_VOID)
1912 else if (gimme == G_SCALAR) {
1914 *++newsp = sv_mortalcopy(*SP);
1916 *++newsp = &PL_sv_undef;
1920 *++newsp = sv_mortalcopy(*++mark);
1921 TAINT_NOT; /* Each item is independent */
1927 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
1928 PL_curpm = newpm; /* ... and pop $1 et al */
1940 register PERL_CONTEXT *cx;
1941 bool popsub2 = FALSE;
1942 bool clear_errsv = FALSE;
1950 if (PL_curstackinfo->si_type == PERLSI_SORT) {
1951 if (cxstack_ix == PL_sortcxix
1952 || dopoptosub(cxstack_ix) <= PL_sortcxix)
1954 if (cxstack_ix > PL_sortcxix)
1955 dounwind(PL_sortcxix);
1956 AvARRAY(PL_curstack)[1] = *SP;
1957 PL_stack_sp = PL_stack_base + 1;
1962 cxix = dopoptosub(cxstack_ix);
1964 DIE(aTHX_ "Can't return outside a subroutine");
1965 if (cxix < cxstack_ix)
1969 switch (CxTYPE(cx)) {
1972 retop = cx->blk_sub.retop;
1973 cxstack_ix++; /* preserve cx entry on stack for use by POPSUB */
1976 if (!(PL_in_eval & EVAL_KEEPERR))
1979 retop = cx->blk_eval.retop;
1983 if (optype == OP_REQUIRE &&
1984 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
1986 /* Unassume the success we assumed earlier. */
1987 SV * const nsv = cx->blk_eval.old_namesv;
1988 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
1989 DIE(aTHX_ "%"SVf" did not return a true value", nsv);
1994 retop = cx->blk_sub.retop;
1997 DIE(aTHX_ "panic: return");
2001 if (gimme == G_SCALAR) {
2004 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2006 *++newsp = SvREFCNT_inc(*SP);
2011 sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
2013 *++newsp = sv_mortalcopy(sv);
2018 *++newsp = (SvTEMP(*SP)) ? *SP : sv_mortalcopy(*SP);
2021 *++newsp = sv_mortalcopy(*SP);
2024 *++newsp = &PL_sv_undef;
2026 else if (gimme == G_ARRAY) {
2027 while (++MARK <= SP) {
2028 *++newsp = (popsub2 && SvTEMP(*MARK))
2029 ? *MARK : sv_mortalcopy(*MARK);
2030 TAINT_NOT; /* Each item is independent */
2033 PL_stack_sp = newsp;
2036 /* Stack values are safe: */
2039 POPSUB(cx,sv); /* release CV and @_ ... */
2043 PL_curpm = newpm; /* ... and pop $1 et al */
2047 sv_setpvn(ERRSV,"",0);
2055 register PERL_CONTEXT *cx;
2066 if (PL_op->op_flags & OPf_SPECIAL) {
2067 cxix = dopoptoloop(cxstack_ix);
2069 DIE(aTHX_ "Can't \"last\" outside a loop block");
2072 cxix = dopoptolabel(cPVOP->op_pv);
2074 DIE(aTHX_ "Label not found for \"last %s\"", cPVOP->op_pv);
2076 if (cxix < cxstack_ix)
2080 cxstack_ix++; /* temporarily protect top context */
2082 switch (CxTYPE(cx)) {
2085 newsp = PL_stack_base + cx->blk_loop.resetsp;
2086 nextop = cx->blk_loop.last_op->op_next;
2090 nextop = cx->blk_sub.retop;
2094 nextop = cx->blk_eval.retop;
2098 nextop = cx->blk_sub.retop;
2101 DIE(aTHX_ "panic: last");
2105 if (gimme == G_SCALAR) {
2107 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*SP))
2108 ? *SP : sv_mortalcopy(*SP);
2110 *++newsp = &PL_sv_undef;
2112 else if (gimme == G_ARRAY) {
2113 while (++MARK <= SP) {
2114 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*MARK))
2115 ? *MARK : sv_mortalcopy(*MARK);
2116 TAINT_NOT; /* Each item is independent */
2124 /* Stack values are safe: */
2127 POPLOOP(cx); /* release loop vars ... */
2131 POPSUB(cx,sv); /* release CV and @_ ... */
2134 PL_curpm = newpm; /* ... and pop $1 et al */
2137 PERL_UNUSED_VAR(optype);
2138 PERL_UNUSED_VAR(gimme);
2146 register PERL_CONTEXT *cx;
2149 if (PL_op->op_flags & OPf_SPECIAL) {
2150 cxix = dopoptoloop(cxstack_ix);
2152 DIE(aTHX_ "Can't \"next\" outside a loop block");
2155 cxix = dopoptolabel(cPVOP->op_pv);
2157 DIE(aTHX_ "Label not found for \"next %s\"", cPVOP->op_pv);
2159 if (cxix < cxstack_ix)
2162 /* clear off anything above the scope we're re-entering, but
2163 * save the rest until after a possible continue block */
2164 inner = PL_scopestack_ix;
2166 if (PL_scopestack_ix < inner)
2167 leave_scope(PL_scopestack[PL_scopestack_ix]);
2168 PL_curcop = cx->blk_oldcop;
2169 return cx->blk_loop.next_op;
2176 register PERL_CONTEXT *cx;
2180 if (PL_op->op_flags & OPf_SPECIAL) {
2181 cxix = dopoptoloop(cxstack_ix);
2183 DIE(aTHX_ "Can't \"redo\" outside a loop block");
2186 cxix = dopoptolabel(cPVOP->op_pv);
2188 DIE(aTHX_ "Label not found for \"redo %s\"", cPVOP->op_pv);
2190 if (cxix < cxstack_ix)
2193 redo_op = cxstack[cxix].blk_loop.redo_op;
2194 if (redo_op->op_type == OP_ENTER) {
2195 /* pop one less context to avoid $x being freed in while (my $x..) */
2197 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_BLOCK);
2198 redo_op = redo_op->op_next;
2202 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2203 LEAVE_SCOPE(oldsave);
2205 PL_curcop = cx->blk_oldcop;
2210 S_dofindlabel(pTHX_ OP *o, const char *label, OP **opstack, OP **oplimit)
2214 static const char too_deep[] = "Target of goto is too deeply nested";
2217 Perl_croak(aTHX_ too_deep);
2218 if (o->op_type == OP_LEAVE ||
2219 o->op_type == OP_SCOPE ||
2220 o->op_type == OP_LEAVELOOP ||
2221 o->op_type == OP_LEAVESUB ||
2222 o->op_type == OP_LEAVETRY)
2224 *ops++ = cUNOPo->op_first;
2226 Perl_croak(aTHX_ too_deep);
2229 if (o->op_flags & OPf_KIDS) {
2230 /* First try all the kids at this level, since that's likeliest. */
2231 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2232 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
2233 kCOP->cop_label && strEQ(kCOP->cop_label, label))
2236 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2237 if (kid == PL_lastgotoprobe)
2239 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2242 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2243 ops[-1]->op_type == OP_DBSTATE)
2248 if ((o = dofindlabel(kid, label, ops, oplimit)))
2267 register PERL_CONTEXT *cx;
2268 #define GOTO_DEPTH 64
2269 OP *enterops[GOTO_DEPTH];
2270 const char *label = 0;
2271 const bool do_dump = (PL_op->op_type == OP_DUMP);
2272 static const char must_have_label[] = "goto must have label";
2274 if (PL_op->op_flags & OPf_STACKED) {
2275 SV * const sv = POPs;
2277 /* This egregious kludge implements goto &subroutine */
2278 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2280 register PERL_CONTEXT *cx;
2281 CV* cv = (CV*)SvRV(sv);
2288 if (!CvROOT(cv) && !CvXSUB(cv)) {
2289 const GV * const gv = CvGV(cv);
2293 /* autoloaded stub? */
2294 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2296 autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv),
2297 GvNAMELEN(gv), FALSE);
2298 if (autogv && (cv = GvCV(autogv)))
2300 tmpstr = sv_newmortal();
2301 gv_efullname3(tmpstr, gv, Nullch);
2302 DIE(aTHX_ "Goto undefined subroutine &%"SVf"",tmpstr);
2304 DIE(aTHX_ "Goto undefined subroutine");
2307 /* First do some returnish stuff. */
2308 (void)SvREFCNT_inc(cv); /* avoid premature free during unwind */
2310 cxix = dopoptosub(cxstack_ix);
2312 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
2313 if (cxix < cxstack_ix)
2317 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2318 if (CxTYPE(cx) == CXt_EVAL) {
2320 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2322 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2324 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs) {
2325 /* put @_ back onto stack */
2326 AV* av = cx->blk_sub.argarray;
2328 items = AvFILLp(av) + 1;
2329 EXTEND(SP, items+1); /* @_ could have been extended. */
2330 Copy(AvARRAY(av), SP + 1, items, SV*);
2331 SvREFCNT_dec(GvAV(PL_defgv));
2332 GvAV(PL_defgv) = cx->blk_sub.savearray;
2334 /* abandon @_ if it got reified */
2339 av_extend(av, items-1);
2341 PAD_SVl(0) = (SV*)(cx->blk_sub.argarray = av);
2344 else if (CvXSUB(cv)) { /* put GvAV(defgv) back onto stack */
2346 av = GvAV(PL_defgv);
2347 items = AvFILLp(av) + 1;
2348 EXTEND(SP, items+1); /* @_ could have been extended. */
2349 Copy(AvARRAY(av), SP + 1, items, SV*);
2353 if (CxTYPE(cx) == CXt_SUB &&
2354 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
2355 SvREFCNT_dec(cx->blk_sub.cv);
2356 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2357 LEAVE_SCOPE(oldsave);
2359 /* Now do some callish stuff. */
2361 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2363 OP* retop = cx->blk_sub.retop;
2366 for (index=0; index<items; index++)
2367 sv_2mortal(SP[-index]);
2369 #ifdef PERL_XSUB_OLDSTYLE
2370 if (CvOLDSTYLE(cv)) {
2371 I32 (*fp3)(int,int,int);
2376 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2377 items = (*fp3)(CvXSUBANY(cv).any_i32,
2378 mark - PL_stack_base + 1,
2380 SP = PL_stack_base + items;
2383 #endif /* PERL_XSUB_OLDSTYLE */
2388 /* XS subs don't have a CxSUB, so pop it */
2389 POPBLOCK(cx, PL_curpm);
2390 /* Push a mark for the start of arglist */
2393 (void)(*CvXSUB(cv))(aTHX_ cv);
2394 /* Put these at the bottom since the vars are set but not used */
2395 PERL_UNUSED_VAR(newsp);
2396 PERL_UNUSED_VAR(gimme);
2402 AV* padlist = CvPADLIST(cv);
2403 if (CxTYPE(cx) == CXt_EVAL) {
2404 PL_in_eval = cx->blk_eval.old_in_eval;
2405 PL_eval_root = cx->blk_eval.old_eval_root;
2406 cx->cx_type = CXt_SUB;
2407 cx->blk_sub.hasargs = 0;
2409 cx->blk_sub.cv = cv;
2410 cx->blk_sub.olddepth = (U16)CvDEPTH(cv);
2413 if (CvDEPTH(cv) < 2)
2414 (void)SvREFCNT_inc(cv);
2416 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION))
2417 sub_crush_depth(cv);
2418 pad_push(padlist, CvDEPTH(cv));
2420 PAD_SET_CUR(padlist, CvDEPTH(cv));
2421 if (cx->blk_sub.hasargs)
2423 AV* av = (AV*)PAD_SVl(0);
2426 cx->blk_sub.savearray = GvAV(PL_defgv);
2427 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2428 CX_CURPAD_SAVE(cx->blk_sub);
2429 cx->blk_sub.argarray = av;
2431 if (items >= AvMAX(av) + 1) {
2433 if (AvARRAY(av) != ary) {
2434 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2435 SvPV_set(av, (char*)ary);
2437 if (items >= AvMAX(av) + 1) {
2438 AvMAX(av) = items - 1;
2439 Renew(ary,items+1,SV*);
2441 SvPV_set(av, (char*)ary);
2445 Copy(mark,AvARRAY(av),items,SV*);
2446 AvFILLp(av) = items - 1;
2447 assert(!AvREAL(av));
2449 /* transfer 'ownership' of refcnts to new @_ */
2459 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
2461 * We do not care about using sv to call CV;
2462 * it's for informational purposes only.
2464 SV *sv = GvSV(PL_DBsub);
2468 if (PERLDB_SUB_NN) {
2469 int type = SvTYPE(sv);
2470 if (type < SVt_PVIV && type != SVt_IV)
2471 sv_upgrade(sv, SVt_PVIV);
2473 SvIV_set(sv, PTR2IV(cv)); /* Do it the quickest way */
2475 gv_efullname3(sv, CvGV(cv), Nullch);
2478 && (gotocv = get_cv("DB::goto", FALSE)) ) {
2479 PUSHMARK( PL_stack_sp );
2480 call_sv((SV*)gotocv, G_SCALAR | G_NODEBUG);
2484 RETURNOP(CvSTART(cv));
2488 label = SvPV_nolen_const(sv);
2489 if (!(do_dump || *label))
2490 DIE(aTHX_ must_have_label);
2493 else if (PL_op->op_flags & OPf_SPECIAL) {
2495 DIE(aTHX_ must_have_label);
2498 label = cPVOP->op_pv;
2500 if (label && *label) {
2502 bool leaving_eval = FALSE;
2503 bool in_block = FALSE;
2504 PERL_CONTEXT *last_eval_cx = 0;
2508 PL_lastgotoprobe = 0;
2510 for (ix = cxstack_ix; ix >= 0; ix--) {
2512 switch (CxTYPE(cx)) {
2514 leaving_eval = TRUE;
2515 if (!CxTRYBLOCK(cx)) {
2516 gotoprobe = (last_eval_cx ?
2517 last_eval_cx->blk_eval.old_eval_root :
2522 /* else fall through */
2524 gotoprobe = cx->blk_oldcop->op_sibling;
2530 gotoprobe = cx->blk_oldcop->op_sibling;
2533 gotoprobe = PL_main_root;
2536 if (CvDEPTH(cx->blk_sub.cv)) {
2537 gotoprobe = CvROOT(cx->blk_sub.cv);
2543 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
2546 DIE(aTHX_ "panic: goto");
2547 gotoprobe = PL_main_root;
2551 retop = dofindlabel(gotoprobe, label,
2552 enterops, enterops + GOTO_DEPTH);
2556 PL_lastgotoprobe = gotoprobe;
2559 DIE(aTHX_ "Can't find label %s", label);
2561 /* if we're leaving an eval, check before we pop any frames
2562 that we're not going to punt, otherwise the error
2565 if (leaving_eval && *enterops && enterops[1]) {
2567 for (i = 1; enterops[i]; i++)
2568 if (enterops[i]->op_type == OP_ENTERITER)
2569 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2572 /* pop unwanted frames */
2574 if (ix < cxstack_ix) {
2581 oldsave = PL_scopestack[PL_scopestack_ix];
2582 LEAVE_SCOPE(oldsave);
2585 /* push wanted frames */
2587 if (*enterops && enterops[1]) {
2589 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
2590 for (; enterops[ix]; ix++) {
2591 PL_op = enterops[ix];
2592 /* Eventually we may want to stack the needed arguments
2593 * for each op. For now, we punt on the hard ones. */
2594 if (PL_op->op_type == OP_ENTERITER)
2595 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2596 CALL_FPTR(PL_op->op_ppaddr)(aTHX);
2604 if (!retop) retop = PL_main_start;
2606 PL_restartop = retop;
2607 PL_do_undump = TRUE;
2611 PL_restartop = 0; /* hmm, must be GNU unexec().. */
2612 PL_do_undump = FALSE;
2628 if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
2630 VMSISH_HUSHED = VMSISH_HUSHED || (PL_op->op_private & OPpHUSH_VMSISH);
2633 PL_exit_flags |= PERL_EXIT_EXPECTED;
2635 PUSHs(&PL_sv_undef);
2643 const NV value = SvNVx(GvSV(cCOP->cop_gv));
2644 register I32 match = I_32(value);
2647 if (((NV)match) > value)
2648 --match; /* was fractional--truncate other way */
2650 match -= cCOP->uop.scop.scop_offset;
2653 else if (match > cCOP->uop.scop.scop_max)
2654 match = cCOP->uop.scop.scop_max;
2655 PL_op = cCOP->uop.scop.scop_next[match];
2665 PL_op = PL_op->op_next; /* can't assume anything */
2667 match = *(SvPVx_nolen_const(GvSV(cCOP->cop_gv))) & 255;
2668 match -= cCOP->uop.scop.scop_offset;
2671 else if (match > cCOP->uop.scop.scop_max)
2672 match = cCOP->uop.scop.scop_max;
2673 PL_op = cCOP->uop.scop.scop_next[match];
2682 S_save_lines(pTHX_ AV *array, SV *sv)
2684 const char *s = SvPVX_const(sv);
2685 const char *send = SvPVX_const(sv) + SvCUR(sv);
2688 while (s && s < send) {
2690 SV *tmpstr = NEWSV(85,0);
2692 sv_upgrade(tmpstr, SVt_PVMG);
2693 t = strchr(s, '\n');
2699 sv_setpvn(tmpstr, s, t - s);
2700 av_store(array, line++, tmpstr);
2706 S_docatch_body(pTHX)
2713 S_docatch(pTHX_ OP *o)
2716 OP * const oldop = PL_op;
2720 assert(CATCH_GET == TRUE);
2727 assert(cxstack_ix >= 0);
2728 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2729 cxstack[cxstack_ix].blk_eval.cur_top_env = PL_top_env;
2734 /* die caught by an inner eval - continue inner loop */
2736 /* NB XXX we rely on the old popped CxEVAL still being at the top
2737 * of the stack; the way die_where() currently works, this
2738 * assumption is valid. In theory The cur_top_env value should be
2739 * returned in another global, the way retop (aka PL_restartop)
2741 assert(CxTYPE(&cxstack[cxstack_ix+1]) == CXt_EVAL);
2744 && cxstack[cxstack_ix+1].blk_eval.cur_top_env == PL_top_env)
2746 PL_op = PL_restartop;
2763 Perl_sv_compile_2op(pTHX_ SV *sv, OP** startop, const char *code, PAD** padp)
2764 /* sv Text to convert to OP tree. */
2765 /* startop op_free() this to undo. */
2766 /* code Short string id of the caller. */
2768 dVAR; dSP; /* Make POPBLOCK work. */
2775 char tbuf[TYPE_DIGITS(long) + 12 + 10];
2776 char *tmpbuf = tbuf;
2779 CV* runcv = Nullcv; /* initialise to avoid compiler warnings */
2784 /* switch to eval mode */
2786 if (IN_PERL_COMPILETIME) {
2787 SAVECOPSTASH_FREE(&PL_compiling);
2788 CopSTASH_set(&PL_compiling, PL_curstash);
2790 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
2791 SV * const sv = sv_newmortal();
2792 Perl_sv_setpvf(aTHX_ sv, "_<(%.10seval %lu)[%s:%"IVdf"]",
2793 code, (unsigned long)++PL_evalseq,
2794 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
2798 sprintf(tmpbuf, "_<(%.10s_eval %lu)", code, (unsigned long)++PL_evalseq);
2799 SAVECOPFILE_FREE(&PL_compiling);
2800 CopFILE_set(&PL_compiling, tmpbuf+2);
2801 SAVECOPLINE(&PL_compiling);
2802 CopLINE_set(&PL_compiling, 1);
2803 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
2804 deleting the eval's FILEGV from the stash before gv_check() runs
2805 (i.e. before run-time proper). To work around the coredump that
2806 ensues, we always turn GvMULTI_on for any globals that were
2807 introduced within evals. See force_ident(). GSAR 96-10-12 */
2808 safestr = savepv(tmpbuf);
2809 SAVEDELETE(PL_defstash, safestr, strlen(safestr));
2811 #ifdef OP_IN_REGISTER
2817 /* we get here either during compilation, or via pp_regcomp at runtime */
2818 runtime = IN_PERL_RUNTIME;
2820 runcv = find_runcv(NULL);
2823 PL_op->op_type = OP_ENTEREVAL;
2824 PL_op->op_flags = 0; /* Avoid uninit warning. */
2825 PUSHBLOCK(cx, CXt_EVAL|(IN_PERL_COMPILETIME ? 0 : CXp_REAL), SP);
2826 PUSHEVAL(cx, 0, Nullgv);
2829 rop = doeval(G_SCALAR, startop, runcv, PL_curcop->cop_seq);
2831 rop = doeval(G_SCALAR, startop, PL_compcv, PL_cop_seqmax);
2832 POPBLOCK(cx,PL_curpm);
2835 (*startop)->op_type = OP_NULL;
2836 (*startop)->op_ppaddr = PL_ppaddr[OP_NULL];
2838 /* XXX DAPM do this properly one year */
2839 *padp = (AV*)SvREFCNT_inc(PL_comppad);
2841 if (IN_PERL_COMPILETIME)
2842 PL_compiling.op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
2843 #ifdef OP_IN_REGISTER
2846 PERL_UNUSED_VAR(newsp);
2847 PERL_UNUSED_VAR(optype);
2854 =for apidoc find_runcv
2856 Locate the CV corresponding to the currently executing sub or eval.
2857 If db_seqp is non_null, skip CVs that are in the DB package and populate
2858 *db_seqp with the cop sequence number at the point that the DB:: code was
2859 entered. (allows debuggers to eval in the scope of the breakpoint rather
2860 than in in the scope of the debugger itself).
2866 Perl_find_runcv(pTHX_ U32 *db_seqp)
2871 *db_seqp = PL_curcop->cop_seq;
2872 for (si = PL_curstackinfo; si; si = si->si_prev) {
2874 for (ix = si->si_cxix; ix >= 0; ix--) {
2875 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
2876 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
2877 CV * const cv = cx->blk_sub.cv;
2878 /* skip DB:: code */
2879 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
2880 *db_seqp = cx->blk_oldcop->cop_seq;
2885 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
2893 /* Compile a require/do, an eval '', or a /(?{...})/.
2894 * In the last case, startop is non-null, and contains the address of
2895 * a pointer that should be set to the just-compiled code.
2896 * outside is the lexically enclosing CV (if any) that invoked us.
2899 /* With USE_5005THREADS, eval_owner must be held on entry to doeval */
2901 S_doeval(pTHX_ int gimme, OP** startop, CV* outside, U32 seq)
2906 PL_in_eval = ((saveop && saveop->op_type == OP_REQUIRE)
2907 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
2912 SAVESPTR(PL_compcv);
2913 PL_compcv = (CV*)NEWSV(1104,0);
2914 sv_upgrade((SV *)PL_compcv, SVt_PVCV);
2915 CvEVAL_on(PL_compcv);
2916 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2917 cxstack[cxstack_ix].blk_eval.cv = PL_compcv;
2919 CvOUTSIDE_SEQ(PL_compcv) = seq;
2920 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outside);
2922 /* set up a scratch pad */
2924 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE);
2927 SAVEMORTALIZESV(PL_compcv); /* must remain until end of current statement */
2929 /* make sure we compile in the right package */
2931 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
2932 SAVESPTR(PL_curstash);
2933 PL_curstash = CopSTASH(PL_curcop);
2935 SAVESPTR(PL_beginav);
2936 PL_beginav = newAV();
2937 SAVEFREESV(PL_beginav);
2938 SAVEI32(PL_error_count);
2940 /* try to compile it */
2942 PL_eval_root = Nullop;
2944 PL_curcop = &PL_compiling;
2945 PL_curcop->cop_arybase = 0;
2946 if (saveop && saveop->op_flags & OPf_SPECIAL)
2947 PL_in_eval |= EVAL_KEEPERR;
2949 sv_setpvn(ERRSV,"",0);
2950 if (yyparse() || PL_error_count || !PL_eval_root) {
2951 SV **newsp; /* Used by POPBLOCK. */
2952 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
2953 I32 optype = 0; /* Might be reset by POPEVAL. */
2958 op_free(PL_eval_root);
2959 PL_eval_root = Nullop;
2961 SP = PL_stack_base + POPMARK; /* pop original mark */
2963 POPBLOCK(cx,PL_curpm);
2969 msg = SvPVx_nolen_const(ERRSV);
2970 if (optype == OP_REQUIRE) {
2971 const SV * const nsv = cx->blk_eval.old_namesv;
2972 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
2974 DIE(aTHX_ "%sCompilation failed in require",
2975 *msg ? msg : "Unknown error\n");
2978 POPBLOCK(cx,PL_curpm);
2980 Perl_croak(aTHX_ "%sCompilation failed in regexp",
2981 (*msg ? msg : "Unknown error\n"));
2985 sv_setpv(ERRSV, "Compilation error");
2988 PERL_UNUSED_VAR(newsp);
2991 CopLINE_set(&PL_compiling, 0);
2993 *startop = PL_eval_root;
2995 SAVEFREEOP(PL_eval_root);
2997 /* Set the context for this new optree.
2998 * If the last op is an OP_REQUIRE, force scalar context.
2999 * Otherwise, propagate the context from the eval(). */
3000 if (PL_eval_root->op_type == OP_LEAVEEVAL
3001 && cUNOPx(PL_eval_root)->op_first->op_type == OP_LINESEQ
3002 && cLISTOPx(cUNOPx(PL_eval_root)->op_first)->op_last->op_type
3004 scalar(PL_eval_root);
3005 else if (gimme & G_VOID)
3006 scalarvoid(PL_eval_root);
3007 else if (gimme & G_ARRAY)
3010 scalar(PL_eval_root);
3012 DEBUG_x(dump_eval());
3014 /* Register with debugger: */
3015 if (PERLDB_INTER && saveop->op_type == OP_REQUIRE) {
3016 CV *cv = get_cv("DB::postponed", FALSE);
3020 XPUSHs((SV*)CopFILEGV(&PL_compiling));
3022 call_sv((SV*)cv, G_DISCARD);
3026 /* compiled okay, so do it */
3028 CvDEPTH(PL_compcv) = 1;
3029 SP = PL_stack_base + POPMARK; /* pop original mark */
3030 PL_op = saveop; /* The caller may need it. */
3031 PL_lex_state = LEX_NOTPARSING; /* $^S needs this. */
3033 RETURNOP(PL_eval_start);
3037 S_doopen_pm(pTHX_ const char *name, const char *mode)
3039 #ifndef PERL_DISABLE_PMC
3040 const STRLEN namelen = strlen(name);
3043 if (namelen > 3 && strEQ(name + namelen - 3, ".pm")) {
3044 SV * const pmcsv = Perl_newSVpvf(aTHX_ "%s%c", name, 'c');
3045 const char * const pmc = SvPV_nolen_const(pmcsv);
3047 if (PerlLIO_stat(pmc, &pmcstat) < 0) {
3048 fp = PerlIO_open(name, mode);
3052 if (PerlLIO_stat(name, &pmstat) < 0 ||
3053 pmstat.st_mtime < pmcstat.st_mtime)
3055 fp = PerlIO_open(pmc, mode);
3058 fp = PerlIO_open(name, mode);
3061 SvREFCNT_dec(pmcsv);
3064 fp = PerlIO_open(name, mode);
3068 return PerlIO_open(name, mode);
3069 #endif /* !PERL_DISABLE_PMC */
3075 register PERL_CONTEXT *cx;
3079 const char *tryname = Nullch;
3080 SV *namesv = Nullsv;
3082 const I32 gimme = GIMME_V;
3083 PerlIO *tryrsfp = 0;
3084 int filter_has_file = 0;
3085 GV *filter_child_proc = 0;
3086 SV *filter_state = 0;
3093 if ( (SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) {
3094 if ( SvVOK(sv) && ckWARN(WARN_PORTABLE) ) /* require v5.6.1 */
3095 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
3096 "v-string in use/require non-portable");
3098 sv = new_version(sv);
3099 if (!sv_derived_from(PL_patchlevel, "version"))
3100 (void *)upg_version(PL_patchlevel);
3101 if ( vcmp(sv,PL_patchlevel) > 0 )
3102 DIE(aTHX_ "Perl %"SVf" required--this is only %"SVf", stopped",
3103 vnormal(sv), vnormal(PL_patchlevel));
3107 name = SvPV_const(sv, len);
3108 if (!(name && len > 0 && *name))
3109 DIE(aTHX_ "Null filename used");
3110 TAINT_PROPER("require");
3111 if (PL_op->op_type == OP_REQUIRE &&
3112 (svp = hv_fetch(GvHVn(PL_incgv), name, len, 0))) {
3113 if (*svp != &PL_sv_undef)
3116 DIE(aTHX_ "Compilation failed in require");
3119 /* prepare to compile file */
3121 if (path_is_absolute(name)) {
3123 tryrsfp = doopen_pm(name,PERL_SCRIPT_MODE);
3125 #ifdef MACOS_TRADITIONAL
3129 MacPerl_CanonDir(name, newname, 1);
3130 if (path_is_absolute(newname)) {
3132 tryrsfp = doopen_pm(newname,PERL_SCRIPT_MODE);
3137 AV *ar = GvAVn(PL_incgv);
3141 if ((unixname = tounixspec(name, Nullch)) != Nullch)
3144 namesv = NEWSV(806, 0);
3145 for (i = 0; i <= AvFILL(ar); i++) {
3146 SV *dirsv = *av_fetch(ar, i, TRUE);
3152 if (SvTYPE(SvRV(loader)) == SVt_PVAV
3153 && !sv_isobject(loader))
3155 loader = *av_fetch((AV *)SvRV(loader), 0, TRUE);
3158 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
3159 PTR2UV(SvRV(dirsv)), name);
3160 tryname = SvPVX_const(namesv);
3171 if (sv_isobject(loader))
3172 count = call_method("INC", G_ARRAY);
3174 count = call_sv(loader, G_ARRAY);
3184 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVGV) {
3188 if (SvTYPE(arg) == SVt_PVGV) {
3189 IO *io = GvIO((GV *)arg);
3194 tryrsfp = IoIFP(io);
3195 if (IoTYPE(io) == IoTYPE_PIPE) {
3196 /* reading from a child process doesn't
3197 nest -- when returning from reading
3198 the inner module, the outer one is
3199 unreadable (closed?) I've tried to
3200 save the gv to manage the lifespan of
3201 the pipe, but this didn't help. XXX */
3202 filter_child_proc = (GV *)arg;
3203 (void)SvREFCNT_inc(filter_child_proc);
3206 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3207 PerlIO_close(IoOFP(io));
3219 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3221 (void)SvREFCNT_inc(filter_sub);
3224 filter_state = SP[i];
3225 (void)SvREFCNT_inc(filter_state);
3229 tryrsfp = PerlIO_open("/dev/null",
3245 filter_has_file = 0;
3246 if (filter_child_proc) {
3247 SvREFCNT_dec(filter_child_proc);
3248 filter_child_proc = 0;
3251 SvREFCNT_dec(filter_state);
3255 SvREFCNT_dec(filter_sub);
3260 if (!path_is_absolute(name)
3261 #ifdef MACOS_TRADITIONAL
3262 /* We consider paths of the form :a:b ambiguous and interpret them first
3263 as global then as local
3265 || (*name == ':' && name[1] != ':' && strchr(name+2, ':'))
3268 const char *dir = SvPVx_nolen_const(dirsv);
3269 #ifdef MACOS_TRADITIONAL
3273 MacPerl_CanonDir(name, buf2, 1);
3274 Perl_sv_setpvf(aTHX_ namesv, "%s%s", MacPerl_CanonDir(dir, buf1, 0), buf2+(buf2[0] == ':'));
3278 if ((unixdir = tounixpath(dir, Nullch)) == Nullch)
3280 sv_setpv(namesv, unixdir);
3281 sv_catpv(namesv, unixname);
3284 if (PL_origfilename[0] &&
3285 PL_origfilename[1] == ':' &&
3286 !(dir[0] && dir[1] == ':'))
3287 Perl_sv_setpvf(aTHX_ namesv,
3292 Perl_sv_setpvf(aTHX_ namesv,
3296 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
3300 TAINT_PROPER("require");
3301 tryname = SvPVX_const(namesv);
3302 tryrsfp = doopen_pm(tryname, PERL_SCRIPT_MODE);
3304 if (tryname[0] == '.' && tryname[1] == '/')
3313 SAVECOPFILE_FREE(&PL_compiling);
3314 CopFILE_set(&PL_compiling, tryrsfp ? tryname : name);
3315 SvREFCNT_dec(namesv);
3317 if (PL_op->op_type == OP_REQUIRE) {
3318 const char *msgstr = name;
3319 if (namesv) { /* did we lookup @INC? */
3320 SV *msg = sv_2mortal(newSVpv(msgstr,0));
3321 SV *dirmsgsv = NEWSV(0, 0);
3322 AV *ar = GvAVn(PL_incgv);
3324 sv_catpvn(msg, " in @INC", 8);
3325 if (instr(SvPVX_const(msg), ".h "))
3326 sv_catpv(msg, " (change .h to .ph maybe?)");
3327 if (instr(SvPVX_const(msg), ".ph "))
3328 sv_catpv(msg, " (did you run h2ph?)");
3329 sv_catpv(msg, " (@INC contains:");
3330 for (i = 0; i <= AvFILL(ar); i++) {
3331 const char *dir = SvPVx_nolen_const(*av_fetch(ar, i, TRUE));
3332 Perl_sv_setpvf(aTHX_ dirmsgsv, " %s", dir);
3333 sv_catsv(msg, dirmsgsv);
3335 sv_catpvn(msg, ")", 1);
3336 SvREFCNT_dec(dirmsgsv);
3337 msgstr = SvPV_nolen_const(msg);
3339 DIE(aTHX_ "Can't locate %s", msgstr);
3345 SETERRNO(0, SS_NORMAL);
3347 /* Assume success here to prevent recursive requirement. */
3349 /* Check whether a hook in @INC has already filled %INC */
3350 if (!hook_sv || !(svp = hv_fetch(GvHVn(PL_incgv), name, len, 0))) {
3351 (void)hv_store(GvHVn(PL_incgv), name, len,
3352 (hook_sv ? SvREFCNT_inc(hook_sv)
3353 : newSVpv(CopFILE(&PL_compiling), 0)),
3359 lex_start(sv_2mortal(newSVpvn("",0)));
3360 SAVEGENERICSV(PL_rsfp_filters);
3361 PL_rsfp_filters = Nullav;
3366 SAVESPTR(PL_compiling.cop_warnings);
3367 if (PL_dowarn & G_WARN_ALL_ON)
3368 PL_compiling.cop_warnings = pWARN_ALL ;
3369 else if (PL_dowarn & G_WARN_ALL_OFF)
3370 PL_compiling.cop_warnings = pWARN_NONE ;
3371 else if (PL_taint_warn)
3372 PL_compiling.cop_warnings = newSVpvn(WARN_TAINTstring, WARNsize);
3374 PL_compiling.cop_warnings = pWARN_STD ;
3375 SAVESPTR(PL_compiling.cop_io);
3376 PL_compiling.cop_io = Nullsv;
3378 if (filter_sub || filter_child_proc) {
3379 SV *datasv = filter_add(run_user_filter, Nullsv);
3380 IoLINES(datasv) = filter_has_file;
3381 IoFMT_GV(datasv) = (GV *)filter_child_proc;
3382 IoTOP_GV(datasv) = (GV *)filter_state;
3383 IoBOTTOM_GV(datasv) = (GV *)filter_sub;
3386 /* switch to eval mode */
3387 PUSHBLOCK(cx, CXt_EVAL, SP);
3388 PUSHEVAL(cx, name, Nullgv);
3389 cx->blk_eval.retop = PL_op->op_next;
3391 SAVECOPLINE(&PL_compiling);
3392 CopLINE_set(&PL_compiling, 0);
3396 /* Store and reset encoding. */
3397 encoding = PL_encoding;
3398 PL_encoding = Nullsv;
3400 op = DOCATCH(doeval(gimme, NULL, Nullcv, PL_curcop->cop_seq));
3402 /* Restore encoding. */
3403 PL_encoding = encoding;
3410 return pp_require();
3416 register PERL_CONTEXT *cx;
3418 const I32 gimme = GIMME_V, was = PL_sub_generation;
3419 char tbuf[TYPE_DIGITS(long) + 12];
3420 char *tmpbuf = tbuf;
3427 if (!SvPV_const(sv,len))
3429 TAINT_PROPER("eval");
3435 /* switch to eval mode */
3437 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
3438 SV *sv = sv_newmortal();
3439 Perl_sv_setpvf(aTHX_ sv, "_<(eval %lu)[%s:%"IVdf"]",
3440 (unsigned long)++PL_evalseq,
3441 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
3445 sprintf(tmpbuf, "_<(eval %lu)", (unsigned long)++PL_evalseq);
3446 SAVECOPFILE_FREE(&PL_compiling);
3447 CopFILE_set(&PL_compiling, tmpbuf+2);
3448 SAVECOPLINE(&PL_compiling);
3449 CopLINE_set(&PL_compiling, 1);
3450 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
3451 deleting the eval's FILEGV from the stash before gv_check() runs
3452 (i.e. before run-time proper). To work around the coredump that
3453 ensues, we always turn GvMULTI_on for any globals that were
3454 introduced within evals. See force_ident(). GSAR 96-10-12 */
3455 safestr = savepv(tmpbuf);
3456 SAVEDELETE(PL_defstash, safestr, strlen(safestr));
3458 PL_hints = PL_op->op_targ;
3459 SAVESPTR(PL_compiling.cop_warnings);
3460 if (specialWARN(PL_curcop->cop_warnings))
3461 PL_compiling.cop_warnings = PL_curcop->cop_warnings;
3463 PL_compiling.cop_warnings = newSVsv(PL_curcop->cop_warnings);
3464 SAVEFREESV(PL_compiling.cop_warnings);
3466 SAVESPTR(PL_compiling.cop_io);
3467 if (specialCopIO(PL_curcop->cop_io))
3468 PL_compiling.cop_io = PL_curcop->cop_io;
3470 PL_compiling.cop_io = newSVsv(PL_curcop->cop_io);
3471 SAVEFREESV(PL_compiling.cop_io);
3473 /* special case: an eval '' executed within the DB package gets lexically
3474 * placed in the first non-DB CV rather than the current CV - this
3475 * allows the debugger to execute code, find lexicals etc, in the
3476 * scope of the code being debugged. Passing &seq gets find_runcv
3477 * to do the dirty work for us */
3478 runcv = find_runcv(&seq);
3480 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
3481 PUSHEVAL(cx, 0, Nullgv);
3482 cx->blk_eval.retop = PL_op->op_next;
3484 /* prepare to compile string */
3486 if (PERLDB_LINE && PL_curstash != PL_debstash)
3487 save_lines(CopFILEAV(&PL_compiling), PL_linestr);
3489 ret = doeval(gimme, NULL, runcv, seq);
3490 if (PERLDB_INTER && was != (I32)PL_sub_generation /* Some subs defined here. */
3491 && ret != PL_op->op_next) { /* Successive compilation. */
3492 strcpy(safestr, "_<(eval )"); /* Anything fake and short. */
3494 return DOCATCH(ret);
3504 register PERL_CONTEXT *cx;
3506 const U8 save_flags = PL_op -> op_flags;
3511 retop = cx->blk_eval.retop;
3514 if (gimme == G_VOID)
3516 else if (gimme == G_SCALAR) {
3519 if (SvFLAGS(TOPs) & SVs_TEMP)
3522 *MARK = sv_mortalcopy(TOPs);
3526 *MARK = &PL_sv_undef;
3531 /* in case LEAVE wipes old return values */
3532 for (mark = newsp + 1; mark <= SP; mark++) {
3533 if (!(SvFLAGS(*mark) & SVs_TEMP)) {
3534 *mark = sv_mortalcopy(*mark);
3535 TAINT_NOT; /* Each item is independent */
3539 PL_curpm = newpm; /* Don't pop $1 et al till now */
3542 assert(CvDEPTH(PL_compcv) == 1);
3544 CvDEPTH(PL_compcv) = 0;
3547 if (optype == OP_REQUIRE &&
3548 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
3550 /* Unassume the success we assumed earlier. */
3551 SV * const nsv = cx->blk_eval.old_namesv;
3552 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
3553 retop = Perl_die(aTHX_ "%"SVf" did not return a true value", nsv);
3554 /* die_where() did LEAVE, or we won't be here */
3558 if (!(save_flags & OPf_SPECIAL))
3559 sv_setpvn(ERRSV,"",0);
3568 register PERL_CONTEXT *cx;
3569 const I32 gimme = GIMME_V;
3574 PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), SP);
3576 cx->blk_eval.retop = cLOGOP->op_other->op_next;
3578 PL_in_eval = EVAL_INEVAL;
3579 sv_setpvn(ERRSV,"",0);
3581 return DOCATCH(PL_op->op_next);
3591 register PERL_CONTEXT *cx;
3596 PERL_UNUSED_VAR(optype);
3599 if (gimme == G_VOID)
3601 else if (gimme == G_SCALAR) {
3604 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
3607 *MARK = sv_mortalcopy(TOPs);
3611 *MARK = &PL_sv_undef;
3616 /* in case LEAVE wipes old return values */
3617 for (mark = newsp + 1; mark <= SP; mark++) {
3618 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
3619 *mark = sv_mortalcopy(*mark);
3620 TAINT_NOT; /* Each item is independent */
3624 PL_curpm = newpm; /* Don't pop $1 et al till now */
3627 sv_setpvn(ERRSV,"",0);
3632 S_doparseform(pTHX_ SV *sv)
3635 register char *s = SvPV_force(sv, len);
3636 register char *send = s + len;
3637 register char *base = Nullch;
3638 register I32 skipspaces = 0;
3639 bool noblank = FALSE;
3640 bool repeat = FALSE;
3641 bool postspace = FALSE;
3647 bool unchopnum = FALSE;
3648 int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */
3651 Perl_croak(aTHX_ "Null picture in formline");
3653 /* estimate the buffer size needed */
3654 for (base = s; s <= send; s++) {
3655 if (*s == '\n' || *s == '@' || *s == '^')
3661 New(804, fops, maxops, U32);
3666 *fpc++ = FF_LINEMARK;
3667 noblank = repeat = FALSE;
3685 case ' ': case '\t':
3692 } /* else FALL THROUGH */
3700 *fpc++ = FF_LITERAL;
3708 *fpc++ = (U16)skipspaces;
3712 *fpc++ = FF_NEWLINE;
3716 arg = fpc - linepc + 1;
3723 *fpc++ = FF_LINEMARK;
3724 noblank = repeat = FALSE;
3733 ischop = s[-1] == '^';
3739 arg = (s - base) - 1;
3741 *fpc++ = FF_LITERAL;
3749 *fpc++ = 2; /* skip the @* or ^* */
3751 *fpc++ = FF_LINESNGL;
3754 *fpc++ = FF_LINEGLOB;
3756 else if (*s == '#' || (*s == '.' && s[1] == '#')) {
3757 arg = ischop ? 512 : 0;
3762 const char * const f = ++s;
3765 arg |= 256 + (s - f);
3767 *fpc++ = s - base; /* fieldsize for FETCH */
3768 *fpc++ = FF_DECIMAL;
3770 unchopnum |= ! ischop;
3772 else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
3773 arg = ischop ? 512 : 0;
3775 s++; /* skip the '0' first */
3779 const char * const f = ++s;
3782 arg |= 256 + (s - f);
3784 *fpc++ = s - base; /* fieldsize for FETCH */
3785 *fpc++ = FF_0DECIMAL;
3787 unchopnum |= ! ischop;
3791 bool ismore = FALSE;
3794 while (*++s == '>') ;
3795 prespace = FF_SPACE;
3797 else if (*s == '|') {
3798 while (*++s == '|') ;
3799 prespace = FF_HALFSPACE;
3804 while (*++s == '<') ;
3807 if (*s == '.' && s[1] == '.' && s[2] == '.') {
3811 *fpc++ = s - base; /* fieldsize for FETCH */
3813 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
3816 *fpc++ = (U16)prespace;
3830 assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */
3832 { /* need to jump to the next word */
3834 z = WORD_ALIGN - SvCUR(sv) % WORD_ALIGN;
3835 SvGROW(sv, SvCUR(sv) + z + arg * sizeof(U32) + 4);
3836 s = SvPVX(sv) + SvCUR(sv) + z;
3838 Copy(fops, s, arg, U32);
3840 sv_magic(sv, Nullsv, PERL_MAGIC_fm, Nullch, 0);
3843 if (unchopnum && repeat)
3844 DIE(aTHX_ "Repeated format line will never terminate (~~ and @#)");
3850 S_num_overflow(NV value, I32 fldsize, I32 frcsize)
3852 /* Can value be printed in fldsize chars, using %*.*f ? */
3856 int intsize = fldsize - (value < 0 ? 1 : 0);
3863 while (intsize--) pwr *= 10.0;
3864 while (frcsize--) eps /= 10.0;
3867 if (value + eps >= pwr)
3870 if (value - eps <= -pwr)
3877 run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen)
3880 SV *datasv = FILTER_DATA(idx);
3881 const int filter_has_file = IoLINES(datasv);
3882 GV *filter_child_proc = (GV *)IoFMT_GV(datasv);
3883 SV *filter_state = (SV *)IoTOP_GV(datasv);
3884 SV *filter_sub = (SV *)IoBOTTOM_GV(datasv);
3887 /* I was having segfault trouble under Linux 2.2.5 after a
3888 parse error occured. (Had to hack around it with a test
3889 for PL_error_count == 0.) Solaris doesn't segfault --
3890 not sure where the trouble is yet. XXX */
3892 if (filter_has_file) {
3893 len = FILTER_READ(idx+1, buf_sv, maxlen);
3896 if (filter_sub && len >= 0) {
3907 PUSHs(sv_2mortal(newSViv(maxlen)));
3909 PUSHs(filter_state);
3912 count = call_sv(filter_sub, G_SCALAR);
3928 IoLINES(datasv) = 0;
3929 if (filter_child_proc) {
3930 SvREFCNT_dec(filter_child_proc);
3931 IoFMT_GV(datasv) = Nullgv;
3934 SvREFCNT_dec(filter_state);
3935 IoTOP_GV(datasv) = Nullgv;
3938 SvREFCNT_dec(filter_sub);
3939 IoBOTTOM_GV(datasv) = Nullgv;
3941 filter_del(run_user_filter);
3947 /* perhaps someone can come up with a better name for
3948 this? it is not really "absolute", per se ... */
3950 S_path_is_absolute(pTHX_ const char *name)
3952 if (PERL_FILE_IS_ABSOLUTE(name)
3953 #ifdef MACOS_TRADITIONAL
3956 || (*name == '.' && (name[1] == '/' ||
3957 (name[1] == '.' && name[2] == '/'))))
3968 * c-indentation-style: bsd
3970 * indent-tabs-mode: t
3973 * ex: set ts=8 sts=4 sw=4 noet: