3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 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 #define dopoptosub(plop) dopoptosub_at(cxstack, (plop))
50 cxix = dopoptosub(cxstack_ix);
54 switch (cxstack[cxix].blk_gimme) {
67 /* XXXX Should store the old value to allow for tie/overload - and
68 restore in regcomp, where marked with XXXX. */
78 register PMOP *pm = (PMOP*)cLOGOP->op_other;
83 /* prevent recompiling under /o and ithreads. */
84 #if defined(USE_ITHREADS)
85 if (pm->op_pmflags & PMf_KEEP && PM_GETRE(pm)) {
86 if (PL_op->op_flags & OPf_STACKED) {
95 if (PL_op->op_flags & OPf_STACKED) {
96 /* multiple args; concatentate them */
98 tmpstr = PAD_SV(ARGTARG);
99 sv_setpvn(tmpstr, "", 0);
100 while (++MARK <= SP) {
101 if (PL_amagic_generation) {
103 if ((SvAMAGIC(tmpstr) || SvAMAGIC(*MARK)) &&
104 (sv = amagic_call(tmpstr, *MARK, concat_amg, AMGf_assign)))
106 sv_setsv(tmpstr, sv);
110 sv_catsv(tmpstr, *MARK);
119 SV * const sv = SvRV(tmpstr);
121 mg = mg_find(sv, PERL_MAGIC_qr);
124 regexp * const re = reg_temp_copy((regexp *)mg->mg_obj);
125 ReREFCNT_dec(PM_GETRE(pm));
130 const char *t = SvOK(tmpstr) ? SvPV_const(tmpstr, len) : "";
133 /* Check against the last compiled regexp. */
134 if (!re || !re->precomp || re->prelen != (I32)len ||
135 memNE(re->precomp, t, len))
137 const regexp_engine *eng = re ? re->engine : NULL;
138 U32 pm_flags = pm->op_pmflags & PMf_COMPILETIME;
141 PM_SETRE(pm, NULL); /* crucial if regcomp aborts */
142 } else if (PL_curcop->cop_hints_hash) {
143 SV *ptr = Perl_refcounted_he_fetch(aTHX_ PL_curcop->cop_hints_hash, 0,
145 if (ptr && SvIOK(ptr) && SvIV(ptr))
146 eng = INT2PTR(regexp_engine*,SvIV(ptr));
149 if (PL_op->op_flags & OPf_SPECIAL)
150 PL_reginterp_cnt = I32_MAX; /* Mark as safe. */
153 pm_flags |= RXf_UTF8;
156 PM_SETRE(pm, CALLREGCOMP_ENG(eng, tmpstr, pm_flags));
158 PM_SETRE(pm, CALLREGCOMP(tmpstr, pm_flags));
160 PL_reginterp_cnt = 0; /* XXXX Be extra paranoid - needed
161 inside tie/overload accessors. */
167 #ifndef INCOMPLETE_TAINTS
170 re->extflags |= RXf_TAINTED;
172 re->extflags &= ~RXf_TAINTED;
176 if (!PM_GETRE(pm)->prelen && PL_curpm)
180 #if !defined(USE_ITHREADS)
181 /* can't change the optree at runtime either */
182 /* PMf_KEEP is handled differently under threads to avoid these problems */
183 if (pm->op_pmflags & PMf_KEEP) {
184 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
185 cLOGOP->op_first->op_next = PL_op->op_next;
195 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
196 register PMOP * const pm = (PMOP*) cLOGOP->op_other;
197 register SV * const dstr = cx->sb_dstr;
198 register char *s = cx->sb_s;
199 register char *m = cx->sb_m;
200 char *orig = cx->sb_orig;
201 register REGEXP * const rx = cx->sb_rx;
203 REGEXP *old = PM_GETRE(pm);
207 PM_SETRE(pm,ReREFCNT_inc(rx));
210 rxres_restore(&cx->sb_rxres, rx);
211 RX_MATCH_UTF8_set(rx, DO_UTF8(cx->sb_targ));
213 if (cx->sb_iters++) {
214 const I32 saviters = cx->sb_iters;
215 if (cx->sb_iters > cx->sb_maxiters)
216 DIE(aTHX_ "Substitution loop");
218 if (!(cx->sb_rxtainted & 2) && SvTAINTED(TOPs))
219 cx->sb_rxtainted |= 2;
220 sv_catsv(dstr, POPs);
221 FREETMPS; /* Prevent excess tmp stack */
224 if (cx->sb_once || !CALLREGEXEC(rx, s, cx->sb_strend, orig,
225 s == m, cx->sb_targ, NULL,
226 ((cx->sb_rflags & REXEC_COPY_STR)
227 ? (REXEC_IGNOREPOS|REXEC_NOT_FIRST)
228 : (REXEC_COPY_STR|REXEC_IGNOREPOS|REXEC_NOT_FIRST))))
230 SV * const targ = cx->sb_targ;
232 assert(cx->sb_strend >= s);
233 if(cx->sb_strend > s) {
234 if (DO_UTF8(dstr) && !SvUTF8(targ))
235 sv_catpvn_utf8_upgrade(dstr, s, cx->sb_strend - s, nsv);
237 sv_catpvn(dstr, s, cx->sb_strend - s);
239 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
241 #ifdef PERL_OLD_COPY_ON_WRITE
243 sv_force_normal_flags(targ, SV_COW_DROP_PV);
249 SvPV_set(targ, SvPVX(dstr));
250 SvCUR_set(targ, SvCUR(dstr));
251 SvLEN_set(targ, SvLEN(dstr));
254 SvPV_set(dstr, NULL);
256 TAINT_IF(cx->sb_rxtainted & 1);
257 PUSHs(sv_2mortal(newSViv(saviters - 1)));
259 (void)SvPOK_only_UTF8(targ);
260 TAINT_IF(cx->sb_rxtainted);
264 LEAVE_SCOPE(cx->sb_oldsave);
266 RETURNOP(pm->op_next);
268 cx->sb_iters = saviters;
270 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
273 cx->sb_orig = orig = rx->subbeg;
275 cx->sb_strend = s + (cx->sb_strend - m);
277 cx->sb_m = m = rx->offs[0].start + orig;
279 if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
280 sv_catpvn_utf8_upgrade(dstr, s, m - s, nsv);
282 sv_catpvn(dstr, s, m-s);
284 cx->sb_s = rx->offs[0].end + orig;
285 { /* Update the pos() information. */
286 SV * const sv = cx->sb_targ;
289 SvUPGRADE(sv, SVt_PVMG);
290 if (!(mg = mg_find(sv, PERL_MAGIC_regex_global))) {
291 #ifdef PERL_OLD_COPY_ON_WRITE
293 sv_force_normal_flags(sv, 0);
295 mg = sv_magicext(sv, NULL, PERL_MAGIC_regex_global, &PL_vtbl_mglob,
304 (void)ReREFCNT_inc(rx);
305 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
306 rxres_save(&cx->sb_rxres, rx);
307 RETURNOP(pm->op_pmstashstartu.op_pmreplstart);
311 Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
317 if (!p || p[1] < rx->nparens) {
318 #ifdef PERL_OLD_COPY_ON_WRITE
319 i = 7 + rx->nparens * 2;
321 i = 6 + rx->nparens * 2;
330 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? rx->subbeg : NULL);
331 RX_MATCH_COPIED_off(rx);
333 #ifdef PERL_OLD_COPY_ON_WRITE
334 *p++ = PTR2UV(rx->saved_copy);
335 rx->saved_copy = NULL;
340 *p++ = PTR2UV(rx->subbeg);
341 *p++ = (UV)rx->sublen;
342 for (i = 0; i <= rx->nparens; ++i) {
343 *p++ = (UV)rx->offs[i].start;
344 *p++ = (UV)rx->offs[i].end;
349 Perl_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
355 RX_MATCH_COPY_FREE(rx);
356 RX_MATCH_COPIED_set(rx, *p);
359 #ifdef PERL_OLD_COPY_ON_WRITE
361 SvREFCNT_dec (rx->saved_copy);
362 rx->saved_copy = INT2PTR(SV*,*p);
368 rx->subbeg = INT2PTR(char*,*p++);
369 rx->sublen = (I32)(*p++);
370 for (i = 0; i <= rx->nparens; ++i) {
371 rx->offs[i].start = (I32)(*p++);
372 rx->offs[i].end = (I32)(*p++);
377 Perl_rxres_free(pTHX_ void **rsp)
379 UV * const p = (UV*)*rsp;
384 void *tmp = INT2PTR(char*,*p);
387 PoisonFree(*p, 1, sizeof(*p));
389 Safefree(INT2PTR(char*,*p));
391 #ifdef PERL_OLD_COPY_ON_WRITE
393 SvREFCNT_dec (INT2PTR(SV*,p[1]));
403 dVAR; dSP; dMARK; dORIGMARK;
404 register SV * const tmpForm = *++MARK;
409 register SV *sv = NULL;
410 const char *item = NULL;
414 bool chopspace = (strchr(PL_chopset, ' ') != NULL);
415 const char *chophere = NULL;
416 char *linemark = NULL;
418 bool gotsome = FALSE;
420 const STRLEN fudge = SvPOK(tmpForm)
421 ? (SvCUR(tmpForm) * (IN_BYTES ? 1 : 3) + 1) : 0;
422 bool item_is_utf8 = FALSE;
423 bool targ_is_utf8 = FALSE;
425 OP * parseres = NULL;
429 if (!SvMAGICAL(tmpForm) || !SvCOMPILED(tmpForm)) {
430 if (SvREADONLY(tmpForm)) {
431 SvREADONLY_off(tmpForm);
432 parseres = doparseform(tmpForm);
433 SvREADONLY_on(tmpForm);
436 parseres = doparseform(tmpForm);
440 SvPV_force(PL_formtarget, len);
441 if (DO_UTF8(PL_formtarget))
443 t = SvGROW(PL_formtarget, len + fudge + 1); /* XXX SvCUR bad */
445 f = SvPV_const(tmpForm, len);
446 /* need to jump to the next word */
447 fpc = (U32*)(f + len + WORD_ALIGN - SvCUR(tmpForm) % WORD_ALIGN);
451 const char *name = "???";
454 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
455 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
456 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
457 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
458 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
460 case FF_CHECKNL: name = "CHECKNL"; break;
461 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
462 case FF_SPACE: name = "SPACE"; break;
463 case FF_HALFSPACE: name = "HALFSPACE"; break;
464 case FF_ITEM: name = "ITEM"; break;
465 case FF_CHOP: name = "CHOP"; break;
466 case FF_LINEGLOB: name = "LINEGLOB"; break;
467 case FF_NEWLINE: name = "NEWLINE"; break;
468 case FF_MORE: name = "MORE"; break;
469 case FF_LINEMARK: name = "LINEMARK"; break;
470 case FF_END: name = "END"; break;
471 case FF_0DECIMAL: name = "0DECIMAL"; break;
472 case FF_LINESNGL: name = "LINESNGL"; break;
475 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
477 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
488 if (targ_is_utf8 && !SvUTF8(tmpForm)) {
489 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
491 sv_catpvn_utf8_upgrade(PL_formtarget, f, arg, nsv);
492 t = SvEND(PL_formtarget);
495 if (!targ_is_utf8 && DO_UTF8(tmpForm)) {
496 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
498 sv_utf8_upgrade(PL_formtarget);
499 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
500 t = SvEND(PL_formtarget);
520 if (ckWARN(WARN_SYNTAX))
521 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
528 const char *s = item = SvPV_const(sv, len);
531 itemsize = sv_len_utf8(sv);
532 if (itemsize != (I32)len) {
534 if (itemsize > fieldsize) {
535 itemsize = fieldsize;
536 itembytes = itemsize;
537 sv_pos_u2b(sv, &itembytes, 0);
541 send = chophere = s + itembytes;
551 sv_pos_b2u(sv, &itemsize);
555 item_is_utf8 = FALSE;
556 if (itemsize > fieldsize)
557 itemsize = fieldsize;
558 send = chophere = s + itemsize;
572 const char *s = item = SvPV_const(sv, len);
575 itemsize = sv_len_utf8(sv);
576 if (itemsize != (I32)len) {
578 if (itemsize <= fieldsize) {
579 const char *send = chophere = s + itemsize;
592 itemsize = fieldsize;
593 itembytes = itemsize;
594 sv_pos_u2b(sv, &itembytes, 0);
595 send = chophere = s + itembytes;
596 while (s < send || (s == send && isSPACE(*s))) {
606 if (strchr(PL_chopset, *s))
611 itemsize = chophere - item;
612 sv_pos_b2u(sv, &itemsize);
618 item_is_utf8 = FALSE;
619 if (itemsize <= fieldsize) {
620 const char *const send = chophere = s + itemsize;
633 itemsize = fieldsize;
634 send = chophere = s + itemsize;
635 while (s < send || (s == send && isSPACE(*s))) {
645 if (strchr(PL_chopset, *s))
650 itemsize = chophere - item;
656 arg = fieldsize - itemsize;
665 arg = fieldsize - itemsize;
676 const char *s = item;
680 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
682 sv_utf8_upgrade(PL_formtarget);
683 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
684 t = SvEND(PL_formtarget);
688 if (UTF8_IS_CONTINUED(*s)) {
689 STRLEN skip = UTF8SKIP(s);
706 if ( !((*t++ = *s++) & ~31) )
712 if (targ_is_utf8 && !item_is_utf8) {
713 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
715 sv_catpvn_utf8_upgrade(PL_formtarget, s, arg, nsv);
716 for (; t < SvEND(PL_formtarget); t++) {
729 const int ch = *t++ = *s++;
732 if ( !((*t++ = *s++) & ~31) )
741 const char *s = chophere;
759 const char *s = item = SvPV_const(sv, len);
761 if ((item_is_utf8 = DO_UTF8(sv)))
762 itemsize = sv_len_utf8(sv);
764 bool chopped = FALSE;
765 const char *const send = s + len;
767 chophere = s + itemsize;
783 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
785 SvUTF8_on(PL_formtarget);
787 SvCUR_set(sv, chophere - item);
788 sv_catsv(PL_formtarget, sv);
789 SvCUR_set(sv, itemsize);
791 sv_catsv(PL_formtarget, sv);
793 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) - 1);
794 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
795 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
804 #if defined(USE_LONG_DOUBLE)
807 "%#0*.*" PERL_PRIfldbl : "%0*.*" PERL_PRIfldbl);
811 "%#0*.*f" : "%0*.*f");
816 #if defined(USE_LONG_DOUBLE)
818 ((arg & 256) ? "%#*.*" PERL_PRIfldbl : "%*.*" PERL_PRIfldbl);
821 ((arg & 256) ? "%#*.*f" : "%*.*f");
824 /* If the field is marked with ^ and the value is undefined,
826 if ((arg & 512) && !SvOK(sv)) {
834 /* overflow evidence */
835 if (num_overflow(value, fieldsize, arg)) {
841 /* Formats aren't yet marked for locales, so assume "yes". */
843 STORE_NUMERIC_STANDARD_SET_LOCAL();
844 my_snprintf(t, SvLEN(PL_formtarget) - (t - SvPVX(PL_formtarget)), fmt, (int) fieldsize, (int) arg & 255, value);
845 RESTORE_NUMERIC_STANDARD();
852 while (t-- > linemark && *t == ' ') ;
860 if (arg) { /* repeat until fields exhausted? */
862 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
863 lines += FmLINES(PL_formtarget);
866 if (strnEQ(linemark, linemark - arg, arg))
867 DIE(aTHX_ "Runaway format");
870 SvUTF8_on(PL_formtarget);
871 FmLINES(PL_formtarget) = lines;
873 RETURNOP(cLISTOP->op_first);
884 const char *s = chophere;
885 const char *send = item + len;
887 while (isSPACE(*s) && (s < send))
892 arg = fieldsize - itemsize;
899 if (strnEQ(s1," ",3)) {
900 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
911 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
913 SvUTF8_on(PL_formtarget);
914 FmLINES(PL_formtarget) += lines;
926 if (PL_stack_base + *PL_markstack_ptr == SP) {
928 if (GIMME_V == G_SCALAR)
929 XPUSHs(sv_2mortal(newSViv(0)));
930 RETURNOP(PL_op->op_next->op_next);
932 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
933 pp_pushmark(); /* push dst */
934 pp_pushmark(); /* push src */
935 ENTER; /* enter outer scope */
938 if (PL_op->op_private & OPpGREP_LEX)
939 SAVESPTR(PAD_SVl(PL_op->op_targ));
942 ENTER; /* enter inner scope */
945 src = PL_stack_base[*PL_markstack_ptr];
947 if (PL_op->op_private & OPpGREP_LEX)
948 PAD_SVl(PL_op->op_targ) = src;
953 if (PL_op->op_type == OP_MAPSTART)
954 pp_pushmark(); /* push top */
955 return ((LOGOP*)PL_op->op_next)->op_other;
961 const I32 gimme = GIMME_V;
962 I32 items = (SP - PL_stack_base) - *PL_markstack_ptr; /* how many new items */
968 /* first, move source pointer to the next item in the source list */
969 ++PL_markstack_ptr[-1];
971 /* if there are new items, push them into the destination list */
972 if (items && gimme != G_VOID) {
973 /* might need to make room back there first */
974 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
975 /* XXX this implementation is very pessimal because the stack
976 * is repeatedly extended for every set of items. Is possible
977 * to do this without any stack extension or copying at all
978 * by maintaining a separate list over which the map iterates
979 * (like foreach does). --gsar */
981 /* everything in the stack after the destination list moves
982 * towards the end the stack by the amount of room needed */
983 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
985 /* items to shift up (accounting for the moved source pointer) */
986 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
988 /* This optimization is by Ben Tilly and it does
989 * things differently from what Sarathy (gsar)
990 * is describing. The downside of this optimization is
991 * that leaves "holes" (uninitialized and hopefully unused areas)
992 * to the Perl stack, but on the other hand this
993 * shouldn't be a problem. If Sarathy's idea gets
994 * implemented, this optimization should become
995 * irrelevant. --jhi */
997 shift = count; /* Avoid shifting too often --Ben Tilly */
1001 dst = (SP += shift);
1002 PL_markstack_ptr[-1] += shift;
1003 *PL_markstack_ptr += shift;
1007 /* copy the new items down to the destination list */
1008 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
1009 if (gimme == G_ARRAY) {
1011 *dst-- = SvTEMP(TOPs) ? POPs : sv_mortalcopy(POPs);
1014 /* scalar context: we don't care about which values map returns
1015 * (we use undef here). And so we certainly don't want to do mortal
1016 * copies of meaningless values. */
1017 while (items-- > 0) {
1019 *dst-- = &PL_sv_undef;
1023 LEAVE; /* exit inner scope */
1026 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
1028 (void)POPMARK; /* pop top */
1029 LEAVE; /* exit outer scope */
1030 (void)POPMARK; /* pop src */
1031 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1032 (void)POPMARK; /* pop dst */
1033 SP = PL_stack_base + POPMARK; /* pop original mark */
1034 if (gimme == G_SCALAR) {
1035 if (PL_op->op_private & OPpGREP_LEX) {
1036 SV* sv = sv_newmortal();
1037 sv_setiv(sv, items);
1045 else if (gimme == G_ARRAY)
1052 ENTER; /* enter inner scope */
1055 /* set $_ to the new source item */
1056 src = PL_stack_base[PL_markstack_ptr[-1]];
1058 if (PL_op->op_private & OPpGREP_LEX)
1059 PAD_SVl(PL_op->op_targ) = src;
1063 RETURNOP(cLOGOP->op_other);
1072 if (GIMME == G_ARRAY)
1074 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1075 return cLOGOP->op_other;
1085 if (GIMME == G_ARRAY) {
1086 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1090 SV * const targ = PAD_SV(PL_op->op_targ);
1093 if (PL_op->op_private & OPpFLIP_LINENUM) {
1094 if (GvIO(PL_last_in_gv)) {
1095 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1098 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1100 flip = SvIV(sv) == SvIV(GvSV(gv));
1106 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
1107 if (PL_op->op_flags & OPf_SPECIAL) {
1115 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1118 sv_setpvn(TARG, "", 0);
1124 /* This code tries to decide if "$left .. $right" should use the
1125 magical string increment, or if the range is numeric (we make
1126 an exception for .."0" [#18165]). AMS 20021031. */
1128 #define RANGE_IS_NUMERIC(left,right) ( \
1129 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1130 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
1131 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
1132 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
1133 && (!SvOK(right) || looks_like_number(right))))
1139 if (GIMME == G_ARRAY) {
1145 if (RANGE_IS_NUMERIC(left,right)) {
1148 if ((SvOK(left) && SvNV(left) < IV_MIN) ||
1149 (SvOK(right) && SvNV(right) > IV_MAX))
1150 DIE(aTHX_ "Range iterator outside integer range");
1161 SV * const sv = sv_2mortal(newSViv(i++));
1166 SV * const final = sv_mortalcopy(right);
1168 const char * const tmps = SvPV_const(final, len);
1170 SV *sv = sv_mortalcopy(left);
1171 SvPV_force_nolen(sv);
1172 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
1174 if (strEQ(SvPVX_const(sv),tmps))
1176 sv = sv_2mortal(newSVsv(sv));
1183 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
1187 if (PL_op->op_private & OPpFLIP_LINENUM) {
1188 if (GvIO(PL_last_in_gv)) {
1189 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1192 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1193 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1201 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
1202 sv_catpvs(targ, "E0");
1212 static const char * const context_name[] = {
1225 S_dopoptolabel(pTHX_ const char *label)
1230 for (i = cxstack_ix; i >= 0; i--) {
1231 register const PERL_CONTEXT * const cx = &cxstack[i];
1232 switch (CxTYPE(cx)) {
1240 if (ckWARN(WARN_EXITING))
1241 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1242 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1243 if (CxTYPE(cx) == CXt_NULL)
1247 if ( !cx->blk_loop.label || strNE(label, cx->blk_loop.label) ) {
1248 DEBUG_l(Perl_deb(aTHX_ "(Skipping label #%ld %s)\n",
1249 (long)i, cx->blk_loop.label));
1252 DEBUG_l( Perl_deb(aTHX_ "(Found label #%ld %s)\n", (long)i, label));
1262 Perl_dowantarray(pTHX)
1265 const I32 gimme = block_gimme();
1266 return (gimme == G_VOID) ? G_SCALAR : gimme;
1270 Perl_block_gimme(pTHX)
1273 const I32 cxix = dopoptosub(cxstack_ix);
1277 switch (cxstack[cxix].blk_gimme) {
1285 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
1292 Perl_is_lvalue_sub(pTHX)
1295 const I32 cxix = dopoptosub(cxstack_ix);
1296 assert(cxix >= 0); /* We should only be called from inside subs */
1298 if (cxstack[cxix].blk_sub.lval && CvLVALUE(cxstack[cxix].blk_sub.cv))
1299 return cxstack[cxix].blk_sub.lval;
1305 S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
1309 for (i = startingblock; i >= 0; i--) {
1310 register const PERL_CONTEXT * const cx = &cxstk[i];
1311 switch (CxTYPE(cx)) {
1317 DEBUG_l( Perl_deb(aTHX_ "(Found sub #%ld)\n", (long)i));
1325 S_dopoptoeval(pTHX_ I32 startingblock)
1329 for (i = startingblock; i >= 0; i--) {
1330 register const PERL_CONTEXT *cx = &cxstack[i];
1331 switch (CxTYPE(cx)) {
1335 DEBUG_l( Perl_deb(aTHX_ "(Found eval #%ld)\n", (long)i));
1343 S_dopoptoloop(pTHX_ I32 startingblock)
1347 for (i = startingblock; i >= 0; i--) {
1348 register const PERL_CONTEXT * const cx = &cxstack[i];
1349 switch (CxTYPE(cx)) {
1355 if (ckWARN(WARN_EXITING))
1356 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1357 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1358 if ((CxTYPE(cx)) == CXt_NULL)
1362 DEBUG_l( Perl_deb(aTHX_ "(Found loop #%ld)\n", (long)i));
1370 S_dopoptogiven(pTHX_ I32 startingblock)
1374 for (i = startingblock; i >= 0; i--) {
1375 register const PERL_CONTEXT *cx = &cxstack[i];
1376 switch (CxTYPE(cx)) {
1380 DEBUG_l( Perl_deb(aTHX_ "(Found given #%ld)\n", (long)i));
1383 if (CxFOREACHDEF(cx)) {
1384 DEBUG_l( Perl_deb(aTHX_ "(Found foreach #%ld)\n", (long)i));
1393 S_dopoptowhen(pTHX_ I32 startingblock)
1397 for (i = startingblock; i >= 0; i--) {
1398 register const PERL_CONTEXT *cx = &cxstack[i];
1399 switch (CxTYPE(cx)) {
1403 DEBUG_l( Perl_deb(aTHX_ "(Found when #%ld)\n", (long)i));
1411 Perl_dounwind(pTHX_ I32 cxix)
1416 while (cxstack_ix > cxix) {
1418 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
1419 DEBUG_l(PerlIO_printf(Perl_debug_log, "Unwinding block %ld, type %s\n",
1420 (long) cxstack_ix, PL_block_type[CxTYPE(cx)]));
1421 /* Note: we don't need to restore the base context info till the end. */
1422 switch (CxTYPE(cx)) {
1425 continue; /* not break */
1444 PERL_UNUSED_VAR(optype);
1448 Perl_qerror(pTHX_ SV *err)
1452 sv_catsv(ERRSV, err);
1454 sv_catsv(PL_errors, err);
1456 Perl_warn(aTHX_ "%"SVf, SVfARG(err));
1458 ++PL_parser->error_count;
1462 Perl_die_where(pTHX_ const char *message, STRLEN msglen)
1471 if (PL_in_eval & EVAL_KEEPERR) {
1472 static const char prefix[] = "\t(in cleanup) ";
1473 SV * const err = ERRSV;
1474 const char *e = NULL;
1476 sv_setpvn(err,"",0);
1477 else if (SvCUR(err) >= sizeof(prefix)+msglen-1) {
1479 e = SvPV_const(err, len);
1481 if (*e != *message || strNE(e,message))
1485 SvGROW(err, SvCUR(err)+sizeof(prefix)+msglen);
1486 sv_catpvn(err, prefix, sizeof(prefix)-1);
1487 sv_catpvn(err, message, msglen);
1488 if (ckWARN(WARN_MISC)) {
1489 const STRLEN start = SvCUR(err)-msglen-sizeof(prefix)+1;
1490 Perl_warner(aTHX_ packWARN(WARN_MISC), SvPVX_const(err)+start);
1495 sv_setpvn(ERRSV, message, msglen);
1499 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1500 && PL_curstackinfo->si_prev)
1508 register PERL_CONTEXT *cx;
1511 if (cxix < cxstack_ix)
1514 POPBLOCK(cx,PL_curpm);
1515 if (CxTYPE(cx) != CXt_EVAL) {
1517 message = SvPVx_const(ERRSV, msglen);
1518 PerlIO_write(Perl_error_log, (const char *)"panic: die ", 11);
1519 PerlIO_write(Perl_error_log, message, msglen);
1524 if (gimme == G_SCALAR)
1525 *++newsp = &PL_sv_undef;
1526 PL_stack_sp = newsp;
1530 /* LEAVE could clobber PL_curcop (see save_re_context())
1531 * XXX it might be better to find a way to avoid messing with
1532 * PL_curcop in save_re_context() instead, but this is a more
1533 * minimal fix --GSAR */
1534 PL_curcop = cx->blk_oldcop;
1536 if (optype == OP_REQUIRE) {
1537 const char* const msg = SvPVx_nolen_const(ERRSV);
1538 SV * const nsv = cx->blk_eval.old_namesv;
1539 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
1541 DIE(aTHX_ "%sCompilation failed in require",
1542 *msg ? msg : "Unknown error\n");
1544 assert(CxTYPE(cx) == CXt_EVAL);
1545 return cx->blk_eval.retop;
1549 message = SvPVx_const(ERRSV, msglen);
1551 write_to_stderr(message, msglen);
1559 dVAR; dSP; dPOPTOPssrl;
1560 if (SvTRUE(left) != SvTRUE(right))
1570 register I32 cxix = dopoptosub(cxstack_ix);
1571 register const PERL_CONTEXT *cx;
1572 register const PERL_CONTEXT *ccstack = cxstack;
1573 const PERL_SI *top_si = PL_curstackinfo;
1575 const char *stashname;
1582 /* we may be in a higher stacklevel, so dig down deeper */
1583 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1584 top_si = top_si->si_prev;
1585 ccstack = top_si->si_cxstack;
1586 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1589 if (GIMME != G_ARRAY) {
1595 /* caller() should not report the automatic calls to &DB::sub */
1596 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
1597 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1601 cxix = dopoptosub_at(ccstack, cxix - 1);
1604 cx = &ccstack[cxix];
1605 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1606 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
1607 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1608 field below is defined for any cx. */
1609 /* caller() should not report the automatic calls to &DB::sub */
1610 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1611 cx = &ccstack[dbcxix];
1614 stashname = CopSTASHPV(cx->blk_oldcop);
1615 if (GIMME != G_ARRAY) {
1618 PUSHs(&PL_sv_undef);
1621 sv_setpv(TARG, stashname);
1630 PUSHs(&PL_sv_undef);
1632 PUSHs(sv_2mortal(newSVpv(stashname, 0)));
1633 PUSHs(sv_2mortal(newSVpv(OutCopFILE(cx->blk_oldcop), 0)));
1634 PUSHs(sv_2mortal(newSViv((I32)CopLINE(cx->blk_oldcop))));
1637 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1638 GV * const cvgv = CvGV(ccstack[cxix].blk_sub.cv);
1639 /* So is ccstack[dbcxix]. */
1641 SV * const sv = newSV(0);
1642 gv_efullname3(sv, cvgv, NULL);
1643 PUSHs(sv_2mortal(sv));
1644 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1647 PUSHs(sv_2mortal(newSVpvs("(unknown)")));
1648 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1652 PUSHs(sv_2mortal(newSVpvs("(eval)")));
1653 PUSHs(sv_2mortal(newSViv(0)));
1655 gimme = (I32)cx->blk_gimme;
1656 if (gimme == G_VOID)
1657 PUSHs(&PL_sv_undef);
1659 PUSHs(sv_2mortal(newSViv(gimme & G_ARRAY)));
1660 if (CxTYPE(cx) == CXt_EVAL) {
1662 if (cx->blk_eval.old_op_type == OP_ENTEREVAL) {
1663 PUSHs(cx->blk_eval.cur_text);
1667 else if (cx->blk_eval.old_namesv) {
1668 PUSHs(sv_2mortal(newSVsv(cx->blk_eval.old_namesv)));
1671 /* eval BLOCK (try blocks have old_namesv == 0) */
1673 PUSHs(&PL_sv_undef);
1674 PUSHs(&PL_sv_undef);
1678 PUSHs(&PL_sv_undef);
1679 PUSHs(&PL_sv_undef);
1681 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs
1682 && CopSTASH_eq(PL_curcop, PL_debstash))
1684 AV * const ary = cx->blk_sub.argarray;
1685 const int off = AvARRAY(ary) - AvALLOC(ary);
1688 GV* const tmpgv = gv_fetchpvs("DB::args", GV_ADD, SVt_PVAV);
1689 PL_dbargs = GvAV(gv_AVadd(tmpgv));
1691 AvREAL_off(PL_dbargs); /* XXX should be REIFY (see av.h) */
1694 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1695 av_extend(PL_dbargs, AvFILLp(ary) + off);
1696 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1697 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1699 /* XXX only hints propagated via op_private are currently
1700 * visible (others are not easily accessible, since they
1701 * use the global PL_hints) */
1702 PUSHs(sv_2mortal(newSViv(CopHINTS_get(cx->blk_oldcop))));
1705 STRLEN * const old_warnings = cx->blk_oldcop->cop_warnings ;
1707 if (old_warnings == pWARN_NONE ||
1708 (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0))
1709 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
1710 else if (old_warnings == pWARN_ALL ||
1711 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
1712 /* Get the bit mask for $warnings::Bits{all}, because
1713 * it could have been extended by warnings::register */
1715 HV * const bits = get_hv("warnings::Bits", FALSE);
1716 if (bits && (bits_all=hv_fetchs(bits, "all", FALSE))) {
1717 mask = newSVsv(*bits_all);
1720 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1724 mask = newSVpvn((char *) (old_warnings + 1), old_warnings[0]);
1725 PUSHs(sv_2mortal(mask));
1728 PUSHs(cx->blk_oldcop->cop_hints_hash ?
1729 sv_2mortal(newRV_noinc(
1730 (SV*)Perl_refcounted_he_chain_2hv(aTHX_
1731 cx->blk_oldcop->cop_hints_hash)))
1740 const char * const tmps = (MAXARG < 1) ? (const char *)"" : POPpconstx;
1741 sv_reset(tmps, CopSTASH(PL_curcop));
1746 /* like pp_nextstate, but used instead when the debugger is active */
1751 PL_curcop = (COP*)PL_op;
1752 TAINT_NOT; /* Each statement is presumed innocent */
1753 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
1756 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
1757 || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
1760 register PERL_CONTEXT *cx;
1761 const I32 gimme = G_ARRAY;
1763 GV * const gv = PL_DBgv;
1764 register CV * const cv = GvCV(gv);
1767 DIE(aTHX_ "No DB::DB routine defined");
1769 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
1770 /* don't do recursive DB::DB call */
1785 (void)(*CvXSUB(cv))(aTHX_ cv);
1792 PUSHBLOCK(cx, CXt_SUB, SP);
1794 cx->blk_sub.retop = PL_op->op_next;
1797 PAD_SET_CUR_NOSAVE(CvPADLIST(cv), 1);
1798 RETURNOP(CvSTART(cv));
1808 register PERL_CONTEXT *cx;
1809 const I32 gimme = GIMME_V;
1811 U16 cxtype = CXt_LOOP | CXp_FOREACH;
1819 if (PL_op->op_targ) {
1820 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
1821 SvPADSTALE_off(PAD_SVl(PL_op->op_targ));
1822 SAVESETSVFLAGS(PAD_SVl(PL_op->op_targ),
1823 SVs_PADSTALE, SVs_PADSTALE);
1825 #ifndef USE_ITHREADS
1826 svp = &PAD_SVl(PL_op->op_targ); /* "my" variable */
1829 SAVEPADSV(PL_op->op_targ);
1830 iterdata = INT2PTR(void*, PL_op->op_targ);
1831 cxtype |= CXp_PADVAR;
1835 GV * const gv = (GV*)POPs;
1836 svp = &GvSV(gv); /* symbol table variable */
1837 SAVEGENERICSV(*svp);
1840 iterdata = (void*)gv;
1844 if (PL_op->op_private & OPpITER_DEF)
1845 cxtype |= CXp_FOR_DEF;
1849 PUSHBLOCK(cx, cxtype, SP);
1851 PUSHLOOP(cx, iterdata, MARK);
1853 PUSHLOOP(cx, svp, MARK);
1855 if (PL_op->op_flags & OPf_STACKED) {
1856 cx->blk_loop.iterary = (AV*)SvREFCNT_inc(POPs);
1857 if (SvTYPE(cx->blk_loop.iterary) != SVt_PVAV) {
1859 SV * const right = (SV*)cx->blk_loop.iterary;
1862 if (RANGE_IS_NUMERIC(sv,right)) {
1863 if ((SvOK(sv) && SvNV(sv) < IV_MIN) ||
1864 (SvOK(right) && SvNV(right) >= IV_MAX))
1865 DIE(aTHX_ "Range iterator outside integer range");
1866 cx->blk_loop.iterix = SvIV(sv);
1867 cx->blk_loop.itermax = SvIV(right);
1869 /* for correct -Dstv display */
1870 cx->blk_oldsp = sp - PL_stack_base;
1874 cx->blk_loop.iterlval = newSVsv(sv);
1875 (void) SvPV_force_nolen(cx->blk_loop.iterlval);
1876 (void) SvPV_nolen_const(right);
1879 else if (PL_op->op_private & OPpITER_REVERSED) {
1880 cx->blk_loop.itermax = 0;
1881 cx->blk_loop.iterix = AvFILL(cx->blk_loop.iterary) + 1;
1886 cx->blk_loop.iterary = PL_curstack;
1887 AvFILLp(PL_curstack) = SP - PL_stack_base;
1888 if (PL_op->op_private & OPpITER_REVERSED) {
1889 cx->blk_loop.itermax = MARK - PL_stack_base + 1;
1890 cx->blk_loop.iterix = cx->blk_oldsp + 1;
1893 cx->blk_loop.iterix = MARK - PL_stack_base;
1903 register PERL_CONTEXT *cx;
1904 const I32 gimme = GIMME_V;
1910 PUSHBLOCK(cx, CXt_LOOP, SP);
1911 PUSHLOOP(cx, 0, SP);
1919 register PERL_CONTEXT *cx;
1926 assert(CxTYPE(cx) == CXt_LOOP);
1928 newsp = PL_stack_base + cx->blk_loop.resetsp;
1931 if (gimme == G_VOID)
1933 else if (gimme == G_SCALAR) {
1935 *++newsp = sv_mortalcopy(*SP);
1937 *++newsp = &PL_sv_undef;
1941 *++newsp = sv_mortalcopy(*++mark);
1942 TAINT_NOT; /* Each item is independent */
1948 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
1949 PL_curpm = newpm; /* ... and pop $1 et al */
1960 register PERL_CONTEXT *cx;
1961 bool popsub2 = FALSE;
1962 bool clear_errsv = FALSE;
1970 const I32 cxix = dopoptosub(cxstack_ix);
1973 if (CxMULTICALL(cxstack)) { /* In this case we must be in a
1974 * sort block, which is a CXt_NULL
1977 PL_stack_base[1] = *PL_stack_sp;
1978 PL_stack_sp = PL_stack_base + 1;
1982 DIE(aTHX_ "Can't return outside a subroutine");
1984 if (cxix < cxstack_ix)
1987 if (CxMULTICALL(&cxstack[cxix])) {
1988 gimme = cxstack[cxix].blk_gimme;
1989 if (gimme == G_VOID)
1990 PL_stack_sp = PL_stack_base;
1991 else if (gimme == G_SCALAR) {
1992 PL_stack_base[1] = *PL_stack_sp;
1993 PL_stack_sp = PL_stack_base + 1;
1999 switch (CxTYPE(cx)) {
2002 retop = cx->blk_sub.retop;
2003 cxstack_ix++; /* preserve cx entry on stack for use by POPSUB */
2006 if (!(PL_in_eval & EVAL_KEEPERR))
2009 retop = cx->blk_eval.retop;
2013 if (optype == OP_REQUIRE &&
2014 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
2016 /* Unassume the success we assumed earlier. */
2017 SV * const nsv = cx->blk_eval.old_namesv;
2018 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
2019 DIE(aTHX_ "%"SVf" did not return a true value", SVfARG(nsv));
2024 retop = cx->blk_sub.retop;
2027 DIE(aTHX_ "panic: return");
2031 if (gimme == G_SCALAR) {
2034 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2036 *++newsp = SvREFCNT_inc(*SP);
2041 sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
2043 *++newsp = sv_mortalcopy(sv);
2048 *++newsp = (SvTEMP(*SP)) ? *SP : sv_mortalcopy(*SP);
2051 *++newsp = sv_mortalcopy(*SP);
2054 *++newsp = &PL_sv_undef;
2056 else if (gimme == G_ARRAY) {
2057 while (++MARK <= SP) {
2058 *++newsp = (popsub2 && SvTEMP(*MARK))
2059 ? *MARK : sv_mortalcopy(*MARK);
2060 TAINT_NOT; /* Each item is independent */
2063 PL_stack_sp = newsp;
2066 /* Stack values are safe: */
2069 POPSUB(cx,sv); /* release CV and @_ ... */
2073 PL_curpm = newpm; /* ... and pop $1 et al */
2077 sv_setpvn(ERRSV,"",0);
2085 register PERL_CONTEXT *cx;
2096 if (PL_op->op_flags & OPf_SPECIAL) {
2097 cxix = dopoptoloop(cxstack_ix);
2099 DIE(aTHX_ "Can't \"last\" outside a loop block");
2102 cxix = dopoptolabel(cPVOP->op_pv);
2104 DIE(aTHX_ "Label not found for \"last %s\"", cPVOP->op_pv);
2106 if (cxix < cxstack_ix)
2110 cxstack_ix++; /* temporarily protect top context */
2112 switch (CxTYPE(cx)) {
2115 newsp = PL_stack_base + cx->blk_loop.resetsp;
2116 nextop = cx->blk_loop.my_op->op_lastop->op_next;
2120 nextop = cx->blk_sub.retop;
2124 nextop = cx->blk_eval.retop;
2128 nextop = cx->blk_sub.retop;
2131 DIE(aTHX_ "panic: last");
2135 if (gimme == G_SCALAR) {
2137 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*SP))
2138 ? *SP : sv_mortalcopy(*SP);
2140 *++newsp = &PL_sv_undef;
2142 else if (gimme == G_ARRAY) {
2143 while (++MARK <= SP) {
2144 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*MARK))
2145 ? *MARK : sv_mortalcopy(*MARK);
2146 TAINT_NOT; /* Each item is independent */
2154 /* Stack values are safe: */
2157 POPLOOP(cx); /* release loop vars ... */
2161 POPSUB(cx,sv); /* release CV and @_ ... */
2164 PL_curpm = newpm; /* ... and pop $1 et al */
2167 PERL_UNUSED_VAR(optype);
2168 PERL_UNUSED_VAR(gimme);
2176 register PERL_CONTEXT *cx;
2179 if (PL_op->op_flags & OPf_SPECIAL) {
2180 cxix = dopoptoloop(cxstack_ix);
2182 DIE(aTHX_ "Can't \"next\" outside a loop block");
2185 cxix = dopoptolabel(cPVOP->op_pv);
2187 DIE(aTHX_ "Label not found for \"next %s\"", cPVOP->op_pv);
2189 if (cxix < cxstack_ix)
2192 /* clear off anything above the scope we're re-entering, but
2193 * save the rest until after a possible continue block */
2194 inner = PL_scopestack_ix;
2196 if (PL_scopestack_ix < inner)
2197 leave_scope(PL_scopestack[PL_scopestack_ix]);
2198 PL_curcop = cx->blk_oldcop;
2199 return CX_LOOP_NEXTOP_GET(cx);
2206 register PERL_CONTEXT *cx;
2210 if (PL_op->op_flags & OPf_SPECIAL) {
2211 cxix = dopoptoloop(cxstack_ix);
2213 DIE(aTHX_ "Can't \"redo\" outside a loop block");
2216 cxix = dopoptolabel(cPVOP->op_pv);
2218 DIE(aTHX_ "Label not found for \"redo %s\"", cPVOP->op_pv);
2220 if (cxix < cxstack_ix)
2223 redo_op = cxstack[cxix].blk_loop.my_op->op_redoop;
2224 if (redo_op->op_type == OP_ENTER) {
2225 /* pop one less context to avoid $x being freed in while (my $x..) */
2227 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_BLOCK);
2228 redo_op = redo_op->op_next;
2232 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2233 LEAVE_SCOPE(oldsave);
2235 PL_curcop = cx->blk_oldcop;
2240 S_dofindlabel(pTHX_ OP *o, const char *label, OP **opstack, OP **oplimit)
2244 static const char too_deep[] = "Target of goto is too deeply nested";
2247 Perl_croak(aTHX_ too_deep);
2248 if (o->op_type == OP_LEAVE ||
2249 o->op_type == OP_SCOPE ||
2250 o->op_type == OP_LEAVELOOP ||
2251 o->op_type == OP_LEAVESUB ||
2252 o->op_type == OP_LEAVETRY)
2254 *ops++ = cUNOPo->op_first;
2256 Perl_croak(aTHX_ too_deep);
2259 if (o->op_flags & OPf_KIDS) {
2261 /* First try all the kids at this level, since that's likeliest. */
2262 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2263 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
2264 kCOP->cop_label && strEQ(kCOP->cop_label, label))
2267 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2268 if (kid == PL_lastgotoprobe)
2270 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2273 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2274 ops[-1]->op_type == OP_DBSTATE)
2279 if ((o = dofindlabel(kid, label, ops, oplimit)))
2292 register PERL_CONTEXT *cx;
2293 #define GOTO_DEPTH 64
2294 OP *enterops[GOTO_DEPTH];
2295 const char *label = NULL;
2296 const bool do_dump = (PL_op->op_type == OP_DUMP);
2297 static const char must_have_label[] = "goto must have label";
2299 if (PL_op->op_flags & OPf_STACKED) {
2300 SV * const sv = POPs;
2302 /* This egregious kludge implements goto &subroutine */
2303 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2305 register PERL_CONTEXT *cx;
2306 CV* cv = (CV*)SvRV(sv);
2313 if (!CvROOT(cv) && !CvXSUB(cv)) {
2314 const GV * const gv = CvGV(cv);
2318 /* autoloaded stub? */
2319 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2321 autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv),
2322 GvNAMELEN(gv), FALSE);
2323 if (autogv && (cv = GvCV(autogv)))
2325 tmpstr = sv_newmortal();
2326 gv_efullname3(tmpstr, gv, NULL);
2327 DIE(aTHX_ "Goto undefined subroutine &%"SVf"", SVfARG(tmpstr));
2329 DIE(aTHX_ "Goto undefined subroutine");
2332 /* First do some returnish stuff. */
2333 SvREFCNT_inc_simple_void(cv); /* avoid premature free during unwind */
2335 cxix = dopoptosub(cxstack_ix);
2337 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
2338 if (cxix < cxstack_ix)
2342 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2343 if (CxTYPE(cx) == CXt_EVAL) {
2345 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2347 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2349 else if (CxMULTICALL(cx))
2350 DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)");
2351 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs) {
2352 /* put @_ back onto stack */
2353 AV* av = cx->blk_sub.argarray;
2355 items = AvFILLp(av) + 1;
2356 EXTEND(SP, items+1); /* @_ could have been extended. */
2357 Copy(AvARRAY(av), SP + 1, items, SV*);
2358 SvREFCNT_dec(GvAV(PL_defgv));
2359 GvAV(PL_defgv) = cx->blk_sub.savearray;
2361 /* abandon @_ if it got reified */
2366 av_extend(av, items-1);
2368 PAD_SVl(0) = (SV*)(cx->blk_sub.argarray = av);
2371 else if (CvISXSUB(cv)) { /* put GvAV(defgv) back onto stack */
2372 AV* const av = GvAV(PL_defgv);
2373 items = AvFILLp(av) + 1;
2374 EXTEND(SP, items+1); /* @_ could have been extended. */
2375 Copy(AvARRAY(av), SP + 1, items, SV*);
2379 if (CxTYPE(cx) == CXt_SUB &&
2380 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
2381 SvREFCNT_dec(cx->blk_sub.cv);
2382 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2383 LEAVE_SCOPE(oldsave);
2385 /* Now do some callish stuff. */
2387 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2389 OP* const retop = cx->blk_sub.retop;
2394 for (index=0; index<items; index++)
2395 sv_2mortal(SP[-index]);
2398 /* XS subs don't have a CxSUB, so pop it */
2399 POPBLOCK(cx, PL_curpm);
2400 /* Push a mark for the start of arglist */
2403 (void)(*CvXSUB(cv))(aTHX_ cv);
2408 AV* const padlist = CvPADLIST(cv);
2409 if (CxTYPE(cx) == CXt_EVAL) {
2410 PL_in_eval = cx->blk_eval.old_in_eval;
2411 PL_eval_root = cx->blk_eval.old_eval_root;
2412 cx->cx_type = CXt_SUB;
2413 cx->blk_sub.hasargs = 0;
2415 cx->blk_sub.cv = cv;
2416 cx->blk_sub.olddepth = CvDEPTH(cv);
2419 if (CvDEPTH(cv) < 2)
2420 SvREFCNT_inc_simple_void_NN(cv);
2422 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION))
2423 sub_crush_depth(cv);
2424 pad_push(padlist, CvDEPTH(cv));
2427 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
2428 if (cx->blk_sub.hasargs)
2430 AV* const av = (AV*)PAD_SVl(0);
2432 cx->blk_sub.savearray = GvAV(PL_defgv);
2433 GvAV(PL_defgv) = (AV*)SvREFCNT_inc_simple(av);
2434 CX_CURPAD_SAVE(cx->blk_sub);
2435 cx->blk_sub.argarray = av;
2437 if (items >= AvMAX(av) + 1) {
2438 SV **ary = AvALLOC(av);
2439 if (AvARRAY(av) != ary) {
2440 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2443 if (items >= AvMAX(av) + 1) {
2444 AvMAX(av) = items - 1;
2445 Renew(ary,items+1,SV*);
2451 Copy(mark,AvARRAY(av),items,SV*);
2452 AvFILLp(av) = items - 1;
2453 assert(!AvREAL(av));
2455 /* transfer 'ownership' of refcnts to new @_ */
2465 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
2466 Perl_get_db_sub(aTHX_ NULL, cv);
2468 CV * const gotocv = get_cv("DB::goto", FALSE);
2470 PUSHMARK( PL_stack_sp );
2471 call_sv((SV*)gotocv, G_SCALAR | G_NODEBUG);
2476 RETURNOP(CvSTART(cv));
2480 label = SvPV_nolen_const(sv);
2481 if (!(do_dump || *label))
2482 DIE(aTHX_ must_have_label);
2485 else if (PL_op->op_flags & OPf_SPECIAL) {
2487 DIE(aTHX_ must_have_label);
2490 label = cPVOP->op_pv;
2492 if (label && *label) {
2493 OP *gotoprobe = NULL;
2494 bool leaving_eval = FALSE;
2495 bool in_block = FALSE;
2496 PERL_CONTEXT *last_eval_cx = NULL;
2500 PL_lastgotoprobe = NULL;
2502 for (ix = cxstack_ix; ix >= 0; ix--) {
2504 switch (CxTYPE(cx)) {
2506 leaving_eval = TRUE;
2507 if (!CxTRYBLOCK(cx)) {
2508 gotoprobe = (last_eval_cx ?
2509 last_eval_cx->blk_eval.old_eval_root :
2514 /* else fall through */
2516 gotoprobe = cx->blk_oldcop->op_sibling;
2522 gotoprobe = cx->blk_oldcop->op_sibling;
2525 gotoprobe = PL_main_root;
2528 if (CvDEPTH(cx->blk_sub.cv) && !CxMULTICALL(cx)) {
2529 gotoprobe = CvROOT(cx->blk_sub.cv);
2535 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
2538 DIE(aTHX_ "panic: goto");
2539 gotoprobe = PL_main_root;
2543 retop = dofindlabel(gotoprobe, label,
2544 enterops, enterops + GOTO_DEPTH);
2548 PL_lastgotoprobe = gotoprobe;
2551 DIE(aTHX_ "Can't find label %s", label);
2553 /* if we're leaving an eval, check before we pop any frames
2554 that we're not going to punt, otherwise the error
2557 if (leaving_eval && *enterops && enterops[1]) {
2559 for (i = 1; enterops[i]; i++)
2560 if (enterops[i]->op_type == OP_ENTERITER)
2561 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2564 /* pop unwanted frames */
2566 if (ix < cxstack_ix) {
2573 oldsave = PL_scopestack[PL_scopestack_ix];
2574 LEAVE_SCOPE(oldsave);
2577 /* push wanted frames */
2579 if (*enterops && enterops[1]) {
2580 OP * const oldop = PL_op;
2581 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
2582 for (; enterops[ix]; ix++) {
2583 PL_op = enterops[ix];
2584 /* Eventually we may want to stack the needed arguments
2585 * for each op. For now, we punt on the hard ones. */
2586 if (PL_op->op_type == OP_ENTERITER)
2587 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2588 CALL_FPTR(PL_op->op_ppaddr)(aTHX);
2596 if (!retop) retop = PL_main_start;
2598 PL_restartop = retop;
2599 PL_do_undump = TRUE;
2603 PL_restartop = 0; /* hmm, must be GNU unexec().. */
2604 PL_do_undump = FALSE;
2621 if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
2623 VMSISH_HUSHED = VMSISH_HUSHED || (PL_op->op_private & OPpHUSH_VMSISH);
2626 PL_exit_flags |= PERL_EXIT_EXPECTED;
2628 /* KLUDGE: disable exit 0 in BEGIN blocks when we're just compiling */
2629 if (anum || !(PL_minus_c && PL_madskills))
2634 PUSHs(&PL_sv_undef);
2641 S_save_lines(pTHX_ AV *array, SV *sv)
2643 const char *s = SvPVX_const(sv);
2644 const char * const send = SvPVX_const(sv) + SvCUR(sv);
2647 while (s && s < send) {
2649 SV * const tmpstr = newSV_type(SVt_PVMG);
2651 t = strchr(s, '\n');
2657 sv_setpvn(tmpstr, s, t - s);
2658 av_store(array, line++, tmpstr);
2664 S_docatch_body(pTHX)
2672 S_docatch(pTHX_ OP *o)
2676 OP * const oldop = PL_op;
2680 assert(CATCH_GET == TRUE);
2687 assert(cxstack_ix >= 0);
2688 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2689 cxstack[cxstack_ix].blk_eval.cur_top_env = PL_top_env;
2694 /* die caught by an inner eval - continue inner loop */
2696 /* NB XXX we rely on the old popped CxEVAL still being at the top
2697 * of the stack; the way die_where() currently works, this
2698 * assumption is valid. In theory The cur_top_env value should be
2699 * returned in another global, the way retop (aka PL_restartop)
2701 assert(CxTYPE(&cxstack[cxstack_ix+1]) == CXt_EVAL);
2704 && cxstack[cxstack_ix+1].blk_eval.cur_top_env == PL_top_env)
2706 PL_op = PL_restartop;
2723 Perl_sv_compile_2op(pTHX_ SV *sv, OP** startop, const char *code, PAD** padp)
2724 /* sv Text to convert to OP tree. */
2725 /* startop op_free() this to undo. */
2726 /* code Short string id of the caller. */
2728 /* FIXME - how much of this code is common with pp_entereval? */
2729 dVAR; dSP; /* Make POPBLOCK work. */
2735 char tbuf[TYPE_DIGITS(long) + 12 + 10];
2736 char *tmpbuf = tbuf;
2739 CV* runcv = NULL; /* initialise to avoid compiler warnings */
2743 lex_start(sv, NULL, FALSE);
2745 /* switch to eval mode */
2747 if (IN_PERL_COMPILETIME) {
2748 SAVECOPSTASH_FREE(&PL_compiling);
2749 CopSTASH_set(&PL_compiling, PL_curstash);
2751 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
2752 SV * const sv = sv_newmortal();
2753 Perl_sv_setpvf(aTHX_ sv, "_<(%.10seval %lu)[%s:%"IVdf"]",
2754 code, (unsigned long)++PL_evalseq,
2755 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
2760 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(%.10s_eval %lu)", code,
2761 (unsigned long)++PL_evalseq);
2762 SAVECOPFILE_FREE(&PL_compiling);
2763 CopFILE_set(&PL_compiling, tmpbuf+2);
2764 SAVECOPLINE(&PL_compiling);
2765 CopLINE_set(&PL_compiling, 1);
2766 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
2767 deleting the eval's FILEGV from the stash before gv_check() runs
2768 (i.e. before run-time proper). To work around the coredump that
2769 ensues, we always turn GvMULTI_on for any globals that were
2770 introduced within evals. See force_ident(). GSAR 96-10-12 */
2771 safestr = savepvn(tmpbuf, len);
2772 SAVEDELETE(PL_defstash, safestr, len);
2774 #ifdef OP_IN_REGISTER
2780 /* we get here either during compilation, or via pp_regcomp at runtime */
2781 runtime = IN_PERL_RUNTIME;
2783 runcv = find_runcv(NULL);
2786 PL_op->op_type = OP_ENTEREVAL;
2787 PL_op->op_flags = 0; /* Avoid uninit warning. */
2788 PUSHBLOCK(cx, CXt_EVAL|(IN_PERL_COMPILETIME ? 0 : CXp_REAL), SP);
2789 PUSHEVAL(cx, 0, NULL);
2792 (void) doeval(G_SCALAR, startop, runcv, PL_curcop->cop_seq);
2794 (void) doeval(G_SCALAR, startop, PL_compcv, PL_cop_seqmax);
2795 POPBLOCK(cx,PL_curpm);
2798 (*startop)->op_type = OP_NULL;
2799 (*startop)->op_ppaddr = PL_ppaddr[OP_NULL];
2801 /* XXX DAPM do this properly one year */
2802 *padp = (AV*)SvREFCNT_inc_simple(PL_comppad);
2804 if (IN_PERL_COMPILETIME)
2805 CopHINTS_set(&PL_compiling, PL_hints);
2806 #ifdef OP_IN_REGISTER
2809 PERL_UNUSED_VAR(newsp);
2810 PERL_UNUSED_VAR(optype);
2812 return PL_eval_start;
2817 =for apidoc find_runcv
2819 Locate the CV corresponding to the currently executing sub or eval.
2820 If db_seqp is non_null, skip CVs that are in the DB package and populate
2821 *db_seqp with the cop sequence number at the point that the DB:: code was
2822 entered. (allows debuggers to eval in the scope of the breakpoint rather
2823 than in the scope of the debugger itself).
2829 Perl_find_runcv(pTHX_ U32 *db_seqp)
2835 *db_seqp = PL_curcop->cop_seq;
2836 for (si = PL_curstackinfo; si; si = si->si_prev) {
2838 for (ix = si->si_cxix; ix >= 0; ix--) {
2839 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
2840 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
2841 CV * const cv = cx->blk_sub.cv;
2842 /* skip DB:: code */
2843 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
2844 *db_seqp = cx->blk_oldcop->cop_seq;
2849 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
2857 /* Compile a require/do, an eval '', or a /(?{...})/.
2858 * In the last case, startop is non-null, and contains the address of
2859 * a pointer that should be set to the just-compiled code.
2860 * outside is the lexically enclosing CV (if any) that invoked us.
2861 * Returns a bool indicating whether the compile was successful; if so,
2862 * PL_eval_start contains the first op of the compiled ocde; otherwise,
2863 * pushes undef (also croaks if startop != NULL).
2867 S_doeval(pTHX_ int gimme, OP** startop, CV* outside, U32 seq)
2870 OP * const saveop = PL_op;
2872 PL_in_eval = ((saveop && saveop->op_type == OP_REQUIRE)
2873 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
2878 SAVESPTR(PL_compcv);
2879 PL_compcv = (CV*)newSV_type(SVt_PVCV);
2880 CvEVAL_on(PL_compcv);
2881 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2882 cxstack[cxstack_ix].blk_eval.cv = PL_compcv;
2884 CvOUTSIDE_SEQ(PL_compcv) = seq;
2885 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc_simple(outside);
2887 /* set up a scratch pad */
2889 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE);
2890 PL_op = NULL; /* avoid PL_op and PL_curpad referring to different CVs */
2894 SAVEMORTALIZESV(PL_compcv); /* must remain until end of current statement */
2896 /* make sure we compile in the right package */
2898 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
2899 SAVESPTR(PL_curstash);
2900 PL_curstash = CopSTASH(PL_curcop);
2902 /* XXX:ajgo do we really need to alloc an AV for begin/checkunit */
2903 SAVESPTR(PL_beginav);
2904 PL_beginav = newAV();
2905 SAVEFREESV(PL_beginav);
2906 SAVESPTR(PL_unitcheckav);
2907 PL_unitcheckav = newAV();
2908 SAVEFREESV(PL_unitcheckav);
2911 SAVEBOOL(PL_madskills);
2915 /* try to compile it */
2917 PL_eval_root = NULL;
2918 PL_curcop = &PL_compiling;
2919 CopARYBASE_set(PL_curcop, 0);
2920 if (saveop && (saveop->op_type != OP_REQUIRE) && (saveop->op_flags & OPf_SPECIAL))
2921 PL_in_eval |= EVAL_KEEPERR;
2923 sv_setpvn(ERRSV,"",0);
2924 if (yyparse() || PL_parser->error_count || !PL_eval_root) {
2925 SV **newsp; /* Used by POPBLOCK. */
2926 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
2927 I32 optype = 0; /* Might be reset by POPEVAL. */
2932 op_free(PL_eval_root);
2933 PL_eval_root = NULL;
2935 SP = PL_stack_base + POPMARK; /* pop original mark */
2937 POPBLOCK(cx,PL_curpm);
2943 msg = SvPVx_nolen_const(ERRSV);
2944 if (optype == OP_REQUIRE) {
2945 const SV * const nsv = cx->blk_eval.old_namesv;
2946 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
2948 Perl_croak(aTHX_ "%sCompilation failed in require",
2949 *msg ? msg : "Unknown error\n");
2952 POPBLOCK(cx,PL_curpm);
2954 Perl_croak(aTHX_ "%sCompilation failed in regexp",
2955 (*msg ? msg : "Unknown error\n"));
2959 sv_setpvs(ERRSV, "Compilation error");
2962 PERL_UNUSED_VAR(newsp);
2963 PUSHs(&PL_sv_undef);
2967 CopLINE_set(&PL_compiling, 0);
2969 *startop = PL_eval_root;
2971 SAVEFREEOP(PL_eval_root);
2973 /* Set the context for this new optree.
2974 * If the last op is an OP_REQUIRE, force scalar context.
2975 * Otherwise, propagate the context from the eval(). */
2976 if (PL_eval_root->op_type == OP_LEAVEEVAL
2977 && cUNOPx(PL_eval_root)->op_first->op_type == OP_LINESEQ
2978 && cLISTOPx(cUNOPx(PL_eval_root)->op_first)->op_last->op_type
2980 scalar(PL_eval_root);
2981 else if (gimme & G_VOID)
2982 scalarvoid(PL_eval_root);
2983 else if (gimme & G_ARRAY)
2986 scalar(PL_eval_root);
2988 DEBUG_x(dump_eval());
2990 /* Register with debugger: */
2991 if (PERLDB_INTER && saveop && saveop->op_type == OP_REQUIRE) {
2992 CV * const cv = get_cv("DB::postponed", FALSE);
2996 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2998 call_sv((SV*)cv, G_DISCARD);
3003 call_list(PL_scopestack_ix, PL_unitcheckav);
3005 /* compiled okay, so do it */
3007 CvDEPTH(PL_compcv) = 1;
3008 SP = PL_stack_base + POPMARK; /* pop original mark */
3009 PL_op = saveop; /* The caller may need it. */
3010 PL_parser->lex_state = LEX_NOTPARSING; /* $^S needs this. */
3017 S_check_type_and_open(pTHX_ const char *name, const char *mode)
3020 const int st_rc = PerlLIO_stat(name, &st);
3022 if (st_rc < 0 || S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode)) {
3026 return PerlIO_open(name, mode);
3030 S_doopen_pm(pTHX_ const char *name, const char *mode)
3032 #ifndef PERL_DISABLE_PMC
3033 const STRLEN namelen = strlen(name);
3036 if (namelen > 3 && strEQ(name + namelen - 3, ".pm")) {
3037 SV * const pmcsv = Perl_newSVpvf(aTHX_ "%s%c", name, 'c');
3038 const char * const pmc = SvPV_nolen_const(pmcsv);
3040 if (PerlLIO_stat(pmc, &pmcstat) < 0) {
3041 fp = check_type_and_open(name, mode);
3044 fp = check_type_and_open(pmc, mode);
3046 SvREFCNT_dec(pmcsv);
3049 fp = check_type_and_open(name, mode);
3053 return check_type_and_open(name, mode);
3054 #endif /* !PERL_DISABLE_PMC */
3060 register PERL_CONTEXT *cx;
3067 int vms_unixname = 0;
3069 const char *tryname = NULL;
3071 const I32 gimme = GIMME_V;
3072 int filter_has_file = 0;
3073 PerlIO *tryrsfp = NULL;
3074 SV *filter_cache = NULL;
3075 SV *filter_state = NULL;
3076 SV *filter_sub = NULL;
3082 if ( (SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) {
3083 if ( SvVOK(sv) && ckWARN(WARN_PORTABLE) ) { /* require v5.6.1 */
3084 HV * hinthv = GvHV(PL_hintgv);
3086 if (hinthv) ptr = hv_fetchs(hinthv, "v_string", FALSE);
3087 if ( !(ptr && *ptr && SvIOK(*ptr) && SvIV(*ptr)) )
3088 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
3089 "v-string in use/require non-portable");
3091 sv = new_version(sv);
3092 if (!sv_derived_from(PL_patchlevel, "version"))
3093 upg_version(PL_patchlevel, TRUE);
3094 if (cUNOP->op_first->op_type == OP_CONST && cUNOP->op_first->op_private & OPpCONST_NOVER) {
3095 if ( vcmp(sv,PL_patchlevel) <= 0 )
3096 DIE(aTHX_ "Perls since %"SVf" too modern--this is %"SVf", stopped",
3097 SVfARG(vnormal(sv)), SVfARG(vnormal(PL_patchlevel)));
3100 if ( vcmp(sv,PL_patchlevel) > 0 ) {
3103 SV * const req = SvRV(sv);
3104 SV * const pv = *hv_fetchs((HV*)req, "original", FALSE);
3106 /* get the left hand term */
3107 lav = (AV *)SvRV(*hv_fetchs((HV*)req, "version", FALSE));
3109 first = SvIV(*av_fetch(lav,0,0));
3110 if ( first > (int)PERL_REVISION /* probably 'use 6.0' */
3111 || hv_exists((HV*)req, "qv", 2 ) /* qv style */
3112 || av_len(lav) > 1 /* FP with > 3 digits */
3113 || strstr(SvPVX(pv),".0") /* FP with leading 0 */
3115 DIE(aTHX_ "Perl %"SVf" required--this is only "
3116 "%"SVf", stopped", SVfARG(vnormal(req)),
3117 SVfARG(vnormal(PL_patchlevel)));
3119 else { /* probably 'use 5.10' or 'use 5.8' */
3120 SV * hintsv = newSV(0);
3124 second = SvIV(*av_fetch(lav,1,0));
3126 second /= second >= 600 ? 100 : 10;
3127 hintsv = Perl_newSVpvf(aTHX_ "v%d.%d.%d",
3128 (int)first, (int)second,0);
3129 upg_version(hintsv, TRUE);
3131 DIE(aTHX_ "Perl %"SVf" required (did you mean %"SVf"?)"
3132 "--this is only %"SVf", stopped",
3133 SVfARG(vnormal(req)),
3134 SVfARG(vnormal(hintsv)),
3135 SVfARG(vnormal(PL_patchlevel)));
3140 /* We do this only with use, not require. */
3142 /* If we request a version >= 5.6.0, then v-string are OK
3143 so set $^H{v_string} to suppress the v-string warning */
3144 vcmp(sv, sv_2mortal(upg_version(newSVnv(5.006), FALSE))) >= 0) {
3145 HV * hinthv = GvHV(PL_hintgv);
3147 SV *hint = newSViv(1);
3148 (void)hv_stores(hinthv, "v_string", hint);
3149 /* This will call through to Perl_magic_sethint() which in turn
3150 sets PL_hints correctly. */
3153 /* If we request a version >= 5.9.5, load feature.pm with the
3154 * feature bundle that corresponds to the required version. */
3155 if (vcmp(sv, sv_2mortal(upg_version(newSVnv(5.009005), FALSE))) >= 0) {
3156 SV *const importsv = vnormal(sv);
3157 *SvPVX_mutable(importsv) = ':';
3159 Perl_load_module(aTHX_ 0, newSVpvs("feature"), NULL, importsv, NULL);
3166 name = SvPV_const(sv, len);
3167 if (!(name && len > 0 && *name))
3168 DIE(aTHX_ "Null filename used");
3169 TAINT_PROPER("require");
3173 /* The key in the %ENV hash is in the syntax of file passed as the argument
3174 * usually this is in UNIX format, but sometimes in VMS format, which
3175 * can result in a module being pulled in more than once.
3176 * To prevent this, the key must be stored in UNIX format if the VMS
3177 * name can be translated to UNIX.
3179 if ((unixname = tounixspec(name, NULL)) != NULL) {
3180 unixlen = strlen(unixname);
3186 /* if not VMS or VMS name can not be translated to UNIX, pass it
3189 unixname = (char *) name;
3192 if (PL_op->op_type == OP_REQUIRE) {
3193 SV * const * const svp = hv_fetch(GvHVn(PL_incgv),
3194 unixname, unixlen, 0);
3196 if (*svp != &PL_sv_undef)
3199 DIE(aTHX_ "Attempt to reload %s aborted.\n"
3200 "Compilation failed in require", unixname);
3204 /* prepare to compile file */
3206 if (path_is_absolute(name)) {
3208 tryrsfp = doopen_pm(name,PERL_SCRIPT_MODE);
3210 #ifdef MACOS_TRADITIONAL
3214 MacPerl_CanonDir(name, newname, 1);
3215 if (path_is_absolute(newname)) {
3217 tryrsfp = doopen_pm(newname,PERL_SCRIPT_MODE);
3222 AV * const ar = GvAVn(PL_incgv);
3229 for (i = 0; i <= AvFILL(ar); i++) {
3230 SV * const dirsv = *av_fetch(ar, i, TRUE);
3232 if (SvTIED_mg((SV*)ar, PERL_MAGIC_tied))
3239 if (SvTYPE(SvRV(loader)) == SVt_PVAV
3240 && !sv_isobject(loader))
3242 loader = *av_fetch((AV *)SvRV(loader), 0, TRUE);
3245 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
3246 PTR2UV(SvRV(dirsv)), name);
3247 tryname = SvPVX_const(namesv);
3258 if (sv_isobject(loader))
3259 count = call_method("INC", G_ARRAY);
3261 count = call_sv(loader, G_ARRAY);
3264 /* Adjust file name if the hook has set an %INC entry */
3265 svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3267 tryname = SvPVX_const(*svp);
3276 if (SvROK(arg) && (SvTYPE(SvRV(arg)) <= SVt_PVLV)
3277 && !isGV_with_GP(SvRV(arg))) {
3278 filter_cache = SvRV(arg);
3279 SvREFCNT_inc_simple_void_NN(filter_cache);
3286 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVGV) {
3290 if (SvTYPE(arg) == SVt_PVGV) {
3291 IO * const io = GvIO((GV *)arg);
3296 tryrsfp = IoIFP(io);
3297 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3298 PerlIO_close(IoOFP(io));
3309 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3311 SvREFCNT_inc_simple_void_NN(filter_sub);
3314 filter_state = SP[i];
3315 SvREFCNT_inc_simple_void(filter_state);
3319 if (!tryrsfp && (filter_cache || filter_sub)) {
3320 tryrsfp = PerlIO_open(BIT_BUCKET,
3335 filter_has_file = 0;
3337 SvREFCNT_dec(filter_cache);
3338 filter_cache = NULL;
3341 SvREFCNT_dec(filter_state);
3342 filter_state = NULL;
3345 SvREFCNT_dec(filter_sub);
3350 if (!path_is_absolute(name)
3351 #ifdef MACOS_TRADITIONAL
3352 /* We consider paths of the form :a:b ambiguous and interpret them first
3353 as global then as local
3355 || (*name == ':' && name[1] != ':' && strchr(name+2, ':'))
3358 const char *dir = SvOK(dirsv) ? SvPV_nolen_const(dirsv) : "";
3359 #ifdef MACOS_TRADITIONAL
3363 MacPerl_CanonDir(name, buf2, 1);
3364 Perl_sv_setpvf(aTHX_ namesv, "%s%s", MacPerl_CanonDir(dir, buf1, 0), buf2+(buf2[0] == ':'));
3368 if ((unixdir = tounixpath(dir, NULL)) == NULL)
3370 sv_setpv(namesv, unixdir);
3371 sv_catpv(namesv, unixname);
3373 # ifdef __SYMBIAN32__
3374 if (PL_origfilename[0] &&
3375 PL_origfilename[1] == ':' &&
3376 !(dir[0] && dir[1] == ':'))
3377 Perl_sv_setpvf(aTHX_ namesv,
3382 Perl_sv_setpvf(aTHX_ namesv,
3386 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
3390 TAINT_PROPER("require");
3391 tryname = SvPVX_const(namesv);
3392 tryrsfp = doopen_pm(tryname, PERL_SCRIPT_MODE);
3394 if (tryname[0] == '.' && tryname[1] == '/')
3398 else if (errno == EMFILE)
3399 /* no point in trying other paths if out of handles */
3406 SAVECOPFILE_FREE(&PL_compiling);
3407 CopFILE_set(&PL_compiling, tryrsfp ? tryname : name);
3408 SvREFCNT_dec(namesv);
3410 if (PL_op->op_type == OP_REQUIRE) {
3411 const char *msgstr = name;
3412 if(errno == EMFILE) {
3414 = sv_2mortal(Perl_newSVpvf(aTHX_ "%s: %s", msgstr,
3416 msgstr = SvPV_nolen_const(msg);
3418 if (namesv) { /* did we lookup @INC? */
3419 AV * const ar = GvAVn(PL_incgv);
3421 SV * const msg = sv_2mortal(Perl_newSVpvf(aTHX_
3422 "%s in @INC%s%s (@INC contains:",
3424 (instr(msgstr, ".h ")
3425 ? " (change .h to .ph maybe?)" : ""),
3426 (instr(msgstr, ".ph ")
3427 ? " (did you run h2ph?)" : "")
3430 for (i = 0; i <= AvFILL(ar); i++) {
3431 sv_catpvs(msg, " ");
3432 sv_catsv(msg, *av_fetch(ar, i, TRUE));
3434 sv_catpvs(msg, ")");
3435 msgstr = SvPV_nolen_const(msg);
3438 DIE(aTHX_ "Can't locate %s", msgstr);
3444 SETERRNO(0, SS_NORMAL);
3446 /* Assume success here to prevent recursive requirement. */
3447 /* name is never assigned to again, so len is still strlen(name) */
3448 /* Check whether a hook in @INC has already filled %INC */
3450 (void)hv_store(GvHVn(PL_incgv),
3451 unixname, unixlen, newSVpv(CopFILE(&PL_compiling),0),0);
3453 SV** const svp = hv_fetch(GvHVn(PL_incgv), unixname, unixlen, 0);
3455 (void)hv_store(GvHVn(PL_incgv),
3456 unixname, unixlen, SvREFCNT_inc_simple(hook_sv), 0 );
3461 lex_start(NULL, tryrsfp, TRUE);
3465 SAVECOMPILEWARNINGS();
3466 if (PL_dowarn & G_WARN_ALL_ON)
3467 PL_compiling.cop_warnings = pWARN_ALL ;
3468 else if (PL_dowarn & G_WARN_ALL_OFF)
3469 PL_compiling.cop_warnings = pWARN_NONE ;
3471 PL_compiling.cop_warnings = pWARN_STD ;
3473 if (filter_sub || filter_cache) {
3474 SV * const datasv = filter_add(S_run_user_filter, NULL);
3475 IoLINES(datasv) = filter_has_file;
3476 IoTOP_GV(datasv) = (GV *)filter_state;
3477 IoBOTTOM_GV(datasv) = (GV *)filter_sub;
3478 IoFMT_GV(datasv) = (GV *)filter_cache;
3481 /* switch to eval mode */
3482 PUSHBLOCK(cx, CXt_EVAL, SP);
3483 PUSHEVAL(cx, name, NULL);
3484 cx->blk_eval.retop = PL_op->op_next;
3486 SAVECOPLINE(&PL_compiling);
3487 CopLINE_set(&PL_compiling, 0);
3491 /* Store and reset encoding. */
3492 encoding = PL_encoding;
3495 if (doeval(gimme, NULL, NULL, PL_curcop->cop_seq))
3496 op = DOCATCH(PL_eval_start);
3498 op = PL_op->op_next;
3500 /* Restore encoding. */
3501 PL_encoding = encoding;
3509 register PERL_CONTEXT *cx;
3511 const I32 gimme = GIMME_V;
3512 const I32 was = PL_sub_generation;
3513 char tbuf[TYPE_DIGITS(long) + 12];
3514 char *tmpbuf = tbuf;
3520 HV *saved_hh = NULL;
3521 const char * const fakestr = "_<(eval )";
3522 const int fakelen = 9 + 1;
3524 if (PL_op->op_private & OPpEVAL_HAS_HH) {
3525 saved_hh = (HV*) SvREFCNT_inc(POPs);
3529 TAINT_IF(SvTAINTED(sv));
3530 TAINT_PROPER("eval");
3533 lex_start(sv, NULL, FALSE);
3536 /* switch to eval mode */
3538 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
3539 SV * const temp_sv = sv_newmortal();
3540 Perl_sv_setpvf(aTHX_ temp_sv, "_<(eval %lu)[%s:%"IVdf"]",
3541 (unsigned long)++PL_evalseq,
3542 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
3543 tmpbuf = SvPVX(temp_sv);
3544 len = SvCUR(temp_sv);
3547 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(eval %lu)", (unsigned long)++PL_evalseq);
3548 SAVECOPFILE_FREE(&PL_compiling);
3549 CopFILE_set(&PL_compiling, tmpbuf+2);
3550 SAVECOPLINE(&PL_compiling);
3551 CopLINE_set(&PL_compiling, 1);
3552 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
3553 deleting the eval's FILEGV from the stash before gv_check() runs
3554 (i.e. before run-time proper). To work around the coredump that
3555 ensues, we always turn GvMULTI_on for any globals that were
3556 introduced within evals. See force_ident(). GSAR 96-10-12 */
3557 safestr = savepvn(tmpbuf, len);
3558 SAVEDELETE(PL_defstash, safestr, len);
3560 PL_hints = PL_op->op_targ;
3562 GvHV(PL_hintgv) = saved_hh;
3563 SAVECOMPILEWARNINGS();
3564 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
3565 if (PL_compiling.cop_hints_hash) {
3566 Perl_refcounted_he_free(aTHX_ PL_compiling.cop_hints_hash);
3568 PL_compiling.cop_hints_hash = PL_curcop->cop_hints_hash;
3569 if (PL_compiling.cop_hints_hash) {
3571 PL_compiling.cop_hints_hash->refcounted_he_refcnt++;
3572 HINTS_REFCNT_UNLOCK;
3574 /* special case: an eval '' executed within the DB package gets lexically
3575 * placed in the first non-DB CV rather than the current CV - this
3576 * allows the debugger to execute code, find lexicals etc, in the
3577 * scope of the code being debugged. Passing &seq gets find_runcv
3578 * to do the dirty work for us */
3579 runcv = find_runcv(&seq);
3581 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
3582 PUSHEVAL(cx, 0, NULL);
3583 cx->blk_eval.retop = PL_op->op_next;
3585 /* prepare to compile string */
3587 if (PERLDB_LINE && PL_curstash != PL_debstash)
3588 save_lines(CopFILEAV(&PL_compiling), PL_parser->linestr);
3590 ok = doeval(gimme, NULL, runcv, seq);
3591 if (PERLDB_INTER && was != (I32)PL_sub_generation /* Some subs defined here. */
3593 /* Copy in anything fake and short. */
3594 my_strlcpy(safestr, fakestr, fakelen);
3596 return ok ? DOCATCH(PL_eval_start) : PL_op->op_next;
3606 register PERL_CONTEXT *cx;
3608 const U8 save_flags = PL_op -> op_flags;
3613 retop = cx->blk_eval.retop;
3616 if (gimme == G_VOID)
3618 else if (gimme == G_SCALAR) {
3621 if (SvFLAGS(TOPs) & SVs_TEMP)
3624 *MARK = sv_mortalcopy(TOPs);
3628 *MARK = &PL_sv_undef;
3633 /* in case LEAVE wipes old return values */
3634 for (mark = newsp + 1; mark <= SP; mark++) {
3635 if (!(SvFLAGS(*mark) & SVs_TEMP)) {
3636 *mark = sv_mortalcopy(*mark);
3637 TAINT_NOT; /* Each item is independent */
3641 PL_curpm = newpm; /* Don't pop $1 et al till now */
3644 assert(CvDEPTH(PL_compcv) == 1);
3646 CvDEPTH(PL_compcv) = 0;
3649 if (optype == OP_REQUIRE &&
3650 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
3652 /* Unassume the success we assumed earlier. */
3653 SV * const nsv = cx->blk_eval.old_namesv;
3654 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
3655 retop = Perl_die(aTHX_ "%"SVf" did not return a true value", SVfARG(nsv));
3656 /* die_where() did LEAVE, or we won't be here */
3660 if (!(save_flags & OPf_SPECIAL))
3661 sv_setpvn(ERRSV,"",0);
3667 /* Common code for Perl_call_sv and Perl_fold_constants, put here to keep it
3668 close to the related Perl_create_eval_scope. */
3670 Perl_delete_eval_scope(pTHX)
3675 register PERL_CONTEXT *cx;
3682 PERL_UNUSED_VAR(newsp);
3683 PERL_UNUSED_VAR(gimme);
3684 PERL_UNUSED_VAR(optype);
3687 /* Common-ish code salvaged from Perl_call_sv and pp_entertry, because it was
3688 also needed by Perl_fold_constants. */
3690 Perl_create_eval_scope(pTHX_ U32 flags)
3693 const I32 gimme = GIMME_V;
3698 PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), PL_stack_sp);
3701 PL_in_eval = EVAL_INEVAL;
3702 if (flags & G_KEEPERR)
3703 PL_in_eval |= EVAL_KEEPERR;
3705 sv_setpvn(ERRSV,"",0);
3706 if (flags & G_FAKINGEVAL) {
3707 PL_eval_root = PL_op; /* Only needed so that goto works right. */
3715 PERL_CONTEXT * const cx = create_eval_scope(0);
3716 cx->blk_eval.retop = cLOGOP->op_other->op_next;
3717 return DOCATCH(PL_op->op_next);
3726 register PERL_CONTEXT *cx;
3731 PERL_UNUSED_VAR(optype);
3734 if (gimme == G_VOID)
3736 else if (gimme == G_SCALAR) {
3740 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
3743 *MARK = sv_mortalcopy(TOPs);
3747 *MARK = &PL_sv_undef;
3752 /* in case LEAVE wipes old return values */
3754 for (mark = newsp + 1; mark <= SP; mark++) {
3755 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
3756 *mark = sv_mortalcopy(*mark);
3757 TAINT_NOT; /* Each item is independent */
3761 PL_curpm = newpm; /* Don't pop $1 et al till now */
3764 sv_setpvn(ERRSV,"",0);
3771 register PERL_CONTEXT *cx;
3772 const I32 gimme = GIMME_V;
3777 if (PL_op->op_targ == 0) {
3778 SV ** const defsv_p = &GvSV(PL_defgv);
3779 *defsv_p = newSVsv(POPs);
3780 SAVECLEARSV(*defsv_p);
3783 sv_setsv(PAD_SV(PL_op->op_targ), POPs);
3785 PUSHBLOCK(cx, CXt_GIVEN, SP);
3794 register PERL_CONTEXT *cx;
3798 PERL_UNUSED_CONTEXT;
3801 assert(CxTYPE(cx) == CXt_GIVEN);
3806 PL_curpm = newpm; /* pop $1 et al */
3813 /* Helper routines used by pp_smartmatch */
3815 S_make_matcher(pTHX_ regexp *re)
3818 PMOP *matcher = (PMOP *) newPMOP(OP_MATCH, OPf_WANT_SCALAR | OPf_STACKED);
3819 PM_SETRE(matcher, ReREFCNT_inc(re));
3821 SAVEFREEOP((OP *) matcher);
3828 S_matcher_matches_sv(pTHX_ PMOP *matcher, SV *sv)
3833 PL_op = (OP *) matcher;
3838 return (SvTRUEx(POPs));
3842 S_destroy_matcher(pTHX_ PMOP *matcher)
3845 PERL_UNUSED_ARG(matcher);
3850 /* Do a smart match */
3853 return do_smartmatch(NULL, NULL);
3856 /* This version of do_smartmatch() implements the
3857 * table of smart matches that is found in perlsyn.
3860 S_do_smartmatch(pTHX_ HV *seen_this, HV *seen_other)
3865 SV *e = TOPs; /* e is for 'expression' */
3866 SV *d = TOPm1s; /* d is for 'default', as in PL_defgv */
3867 SV *This, *Other; /* 'This' (and Other to match) to play with C++ */
3869 regexp *this_regex, *other_regex;
3871 # define NOT_EMPTY_PROTO(cv) (!SvPOK(cv) || SvCUR(cv) == 0)
3873 # define SM_REF(type) ( \
3874 (SvROK(d) && (SvTYPE(This = SvRV(d)) == SVt_##type) && (Other = e)) \
3875 || (SvROK(e) && (SvTYPE(This = SvRV(e)) == SVt_##type) && (Other = d)))
3877 # define SM_CV_NEP /* Find a code ref without an empty prototype */ \
3878 ((SvROK(d) && (SvTYPE(This = SvRV(d)) == SVt_PVCV) \
3879 && NOT_EMPTY_PROTO(This) && (Other = e)) \
3880 || (SvROK(e) && (SvTYPE(This = SvRV(e)) == SVt_PVCV) \
3881 && NOT_EMPTY_PROTO(This) && (Other = d)))
3883 # define SM_REGEX ( \
3884 (SvROK(d) && SvMAGICAL(This = SvRV(d)) \
3885 && (mg = mg_find(This, PERL_MAGIC_qr)) \
3886 && (this_regex = (regexp *)mg->mg_obj) \
3889 (SvROK(e) && SvMAGICAL(This = SvRV(e)) \
3890 && (mg = mg_find(This, PERL_MAGIC_qr)) \
3891 && (this_regex = (regexp *)mg->mg_obj) \
3895 # define SM_OTHER_REF(type) \
3896 (SvROK(Other) && SvTYPE(SvRV(Other)) == SVt_##type)
3898 # define SM_OTHER_REGEX (SvROK(Other) && SvMAGICAL(SvRV(Other)) \
3899 && (mg = mg_find(SvRV(Other), PERL_MAGIC_qr)) \
3900 && (other_regex = (regexp *)mg->mg_obj))
3903 # define SM_SEEN_THIS(sv) hv_exists_ent(seen_this, \
3904 sv_2mortal(newSViv(PTR2IV(sv))), 0)
3906 # define SM_SEEN_OTHER(sv) hv_exists_ent(seen_other, \
3907 sv_2mortal(newSViv(PTR2IV(sv))), 0)
3909 tryAMAGICbinSET(smart, 0);
3911 SP -= 2; /* Pop the values */
3913 /* Take care only to invoke mg_get() once for each argument.
3914 * Currently we do this by copying the SV if it's magical. */
3917 d = sv_mortalcopy(d);
3924 e = sv_mortalcopy(e);
3929 if ( SM_OTHER_REF(PVCV) && NOT_EMPTY_PROTO(SvRV(Other)) )
3931 if (This == SvRV(Other))
3942 c = call_sv(This, G_SCALAR);
3946 else if (SvTEMP(TOPs))
3947 SvREFCNT_inc_void(TOPs);
3952 else if (SM_REF(PVHV)) {
3953 if (SM_OTHER_REF(PVHV)) {
3954 /* Check that the key-sets are identical */
3956 HV *other_hv = (HV *) SvRV(Other);
3958 bool other_tied = FALSE;
3959 U32 this_key_count = 0,
3960 other_key_count = 0;
3962 /* Tied hashes don't know how many keys they have. */
3963 if (SvTIED_mg(This, PERL_MAGIC_tied)) {
3966 else if (SvTIED_mg((SV *) other_hv, PERL_MAGIC_tied)) {
3967 HV * const temp = other_hv;
3968 other_hv = (HV *) This;
3972 if (SvTIED_mg((SV *) other_hv, PERL_MAGIC_tied))
3975 if (!tied && HvUSEDKEYS((HV *) This) != HvUSEDKEYS(other_hv))
3978 /* The hashes have the same number of keys, so it suffices
3979 to check that one is a subset of the other. */
3980 (void) hv_iterinit((HV *) This);
3981 while ( (he = hv_iternext((HV *) This)) ) {
3983 char * const key = hv_iterkey(he, &key_len);
3987 if(!hv_exists(other_hv, key, key_len)) {
3988 (void) hv_iterinit((HV *) This); /* reset iterator */
3994 (void) hv_iterinit(other_hv);
3995 while ( hv_iternext(other_hv) )
3999 other_key_count = HvUSEDKEYS(other_hv);
4001 if (this_key_count != other_key_count)
4006 else if (SM_OTHER_REF(PVAV)) {
4007 AV * const other_av = (AV *) SvRV(Other);
4008 const I32 other_len = av_len(other_av) + 1;
4011 if (HvUSEDKEYS((HV *) This) != other_len)
4014 for(i = 0; i < other_len; ++i) {
4015 SV ** const svp = av_fetch(other_av, i, FALSE);
4019 if (!svp) /* ??? When can this happen? */
4022 key = SvPV(*svp, key_len);
4023 if(!hv_exists((HV *) This, key, key_len))
4028 else if (SM_OTHER_REGEX) {
4029 PMOP * const matcher = make_matcher(other_regex);
4032 (void) hv_iterinit((HV *) This);
4033 while ( (he = hv_iternext((HV *) This)) ) {
4034 if (matcher_matches_sv(matcher, hv_iterkeysv(he))) {
4035 (void) hv_iterinit((HV *) This);
4036 destroy_matcher(matcher);
4040 destroy_matcher(matcher);
4044 if (hv_exists_ent((HV *) This, Other, 0))
4050 else if (SM_REF(PVAV)) {
4051 if (SM_OTHER_REF(PVAV)) {
4052 AV *other_av = (AV *) SvRV(Other);
4053 if (av_len((AV *) This) != av_len(other_av))
4057 const I32 other_len = av_len(other_av);
4059 if (NULL == seen_this) {
4060 seen_this = newHV();
4061 (void) sv_2mortal((SV *) seen_this);
4063 if (NULL == seen_other) {
4064 seen_this = newHV();
4065 (void) sv_2mortal((SV *) seen_other);
4067 for(i = 0; i <= other_len; ++i) {
4068 SV * const * const this_elem = av_fetch((AV *)This, i, FALSE);
4069 SV * const * const other_elem = av_fetch(other_av, i, FALSE);
4071 if (!this_elem || !other_elem) {
4072 if (this_elem || other_elem)
4075 else if (SM_SEEN_THIS(*this_elem)
4076 || SM_SEEN_OTHER(*other_elem))
4078 if (*this_elem != *other_elem)
4082 (void)hv_store_ent(seen_this,
4083 sv_2mortal(newSViv(PTR2IV(*this_elem))),
4085 (void)hv_store_ent(seen_other,
4086 sv_2mortal(newSViv(PTR2IV(*other_elem))),
4092 (void) do_smartmatch(seen_this, seen_other);
4102 else if (SM_OTHER_REGEX) {
4103 PMOP * const matcher = make_matcher(other_regex);
4104 const I32 this_len = av_len((AV *) This);
4107 for(i = 0; i <= this_len; ++i) {
4108 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4109 if (svp && matcher_matches_sv(matcher, *svp)) {
4110 destroy_matcher(matcher);
4114 destroy_matcher(matcher);
4117 else if (SvIOK(Other) || SvNOK(Other)) {
4120 for(i = 0; i <= AvFILL((AV *) This); ++i) {
4121 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4128 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
4138 else if (SvPOK(Other)) {
4139 const I32 this_len = av_len((AV *) This);
4142 for(i = 0; i <= this_len; ++i) {
4143 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4158 else if (!SvOK(d) || !SvOK(e)) {
4159 if (!SvOK(d) && !SvOK(e))
4164 else if (SM_REGEX) {
4165 PMOP * const matcher = make_matcher(this_regex);
4168 PUSHs(matcher_matches_sv(matcher, Other)
4171 destroy_matcher(matcher);
4174 else if (SM_REF(PVCV)) {
4176 /* This must be a null-prototyped sub, because we
4177 already checked for the other kind. */
4183 c = call_sv(This, G_SCALAR);
4186 PUSHs(&PL_sv_undef);
4187 else if (SvTEMP(TOPs))
4188 SvREFCNT_inc_void(TOPs);
4190 if (SM_OTHER_REF(PVCV)) {
4191 /* This one has to be null-proto'd too.
4192 Call both of 'em, and compare the results */
4194 c = call_sv(SvRV(Other), G_SCALAR);
4197 PUSHs(&PL_sv_undef);
4198 else if (SvTEMP(TOPs))
4199 SvREFCNT_inc_void(TOPs);
4210 else if ( ((SvIOK(d) || SvNOK(d)) && (This = d) && (Other = e))
4211 || ((SvIOK(e) || SvNOK(e)) && (This = e) && (Other = d)) )
4213 if (SvPOK(Other) && !looks_like_number(Other)) {
4214 /* String comparison */
4219 /* Otherwise, numeric comparison */
4222 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
4233 /* As a last resort, use string comparison */
4242 register PERL_CONTEXT *cx;
4243 const I32 gimme = GIMME_V;
4245 /* This is essentially an optimization: if the match
4246 fails, we don't want to push a context and then
4247 pop it again right away, so we skip straight
4248 to the op that follows the leavewhen.
4250 if ((0 == (PL_op->op_flags & OPf_SPECIAL)) && !SvTRUEx(POPs))
4251 return cLOGOP->op_other->op_next;
4256 PUSHBLOCK(cx, CXt_WHEN, SP);
4265 register PERL_CONTEXT *cx;
4271 assert(CxTYPE(cx) == CXt_WHEN);
4276 PL_curpm = newpm; /* pop $1 et al */
4286 register PERL_CONTEXT *cx;
4289 cxix = dopoptowhen(cxstack_ix);
4291 DIE(aTHX_ "Can't \"continue\" outside a when block");
4292 if (cxix < cxstack_ix)
4295 /* clear off anything above the scope we're re-entering */
4296 inner = PL_scopestack_ix;
4298 if (PL_scopestack_ix < inner)
4299 leave_scope(PL_scopestack[PL_scopestack_ix]);
4300 PL_curcop = cx->blk_oldcop;
4301 return cx->blk_givwhen.leave_op;
4308 register PERL_CONTEXT *cx;
4311 cxix = dopoptogiven(cxstack_ix);
4313 if (PL_op->op_flags & OPf_SPECIAL)
4314 DIE(aTHX_ "Can't use when() outside a topicalizer");
4316 DIE(aTHX_ "Can't \"break\" outside a given block");
4318 if (CxFOREACH(&cxstack[cxix]) && (0 == (PL_op->op_flags & OPf_SPECIAL)))
4319 DIE(aTHX_ "Can't \"break\" in a loop topicalizer");
4321 if (cxix < cxstack_ix)
4324 /* clear off anything above the scope we're re-entering */
4325 inner = PL_scopestack_ix;
4327 if (PL_scopestack_ix < inner)
4328 leave_scope(PL_scopestack[PL_scopestack_ix]);
4329 PL_curcop = cx->blk_oldcop;
4332 return CX_LOOP_NEXTOP_GET(cx);
4334 return cx->blk_givwhen.leave_op;
4338 S_doparseform(pTHX_ SV *sv)
4341 register char *s = SvPV_force(sv, len);
4342 register char * const send = s + len;
4343 register char *base = NULL;
4344 register I32 skipspaces = 0;
4345 bool noblank = FALSE;
4346 bool repeat = FALSE;
4347 bool postspace = FALSE;
4353 bool unchopnum = FALSE;
4354 int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */
4357 Perl_croak(aTHX_ "Null picture in formline");
4359 /* estimate the buffer size needed */
4360 for (base = s; s <= send; s++) {
4361 if (*s == '\n' || *s == '@' || *s == '^')
4367 Newx(fops, maxops, U32);
4372 *fpc++ = FF_LINEMARK;
4373 noblank = repeat = FALSE;
4391 case ' ': case '\t':
4398 } /* else FALL THROUGH */
4406 *fpc++ = FF_LITERAL;
4414 *fpc++ = (U16)skipspaces;
4418 *fpc++ = FF_NEWLINE;
4422 arg = fpc - linepc + 1;
4429 *fpc++ = FF_LINEMARK;
4430 noblank = repeat = FALSE;
4439 ischop = s[-1] == '^';
4445 arg = (s - base) - 1;
4447 *fpc++ = FF_LITERAL;
4455 *fpc++ = 2; /* skip the @* or ^* */
4457 *fpc++ = FF_LINESNGL;
4460 *fpc++ = FF_LINEGLOB;
4462 else if (*s == '#' || (*s == '.' && s[1] == '#')) {
4463 arg = ischop ? 512 : 0;
4468 const char * const f = ++s;
4471 arg |= 256 + (s - f);
4473 *fpc++ = s - base; /* fieldsize for FETCH */
4474 *fpc++ = FF_DECIMAL;
4476 unchopnum |= ! ischop;
4478 else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
4479 arg = ischop ? 512 : 0;
4481 s++; /* skip the '0' first */
4485 const char * const f = ++s;
4488 arg |= 256 + (s - f);
4490 *fpc++ = s - base; /* fieldsize for FETCH */
4491 *fpc++ = FF_0DECIMAL;
4493 unchopnum |= ! ischop;
4497 bool ismore = FALSE;
4500 while (*++s == '>') ;
4501 prespace = FF_SPACE;
4503 else if (*s == '|') {
4504 while (*++s == '|') ;
4505 prespace = FF_HALFSPACE;
4510 while (*++s == '<') ;
4513 if (*s == '.' && s[1] == '.' && s[2] == '.') {
4517 *fpc++ = s - base; /* fieldsize for FETCH */
4519 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
4522 *fpc++ = (U16)prespace;
4536 assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */