3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, 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))
48 cxix = dopoptosub(cxstack_ix);
52 switch (cxstack[cxix].blk_gimme) {
65 /* XXXX Should store the old value to allow for tie/overload - and
66 restore in regcomp, where marked with XXXX. */
76 register PMOP *pm = (PMOP*)cLOGOP->op_other;
80 /* prevent recompiling under /o and ithreads. */
81 #if defined(USE_ITHREADS)
82 if (pm->op_pmflags & PMf_KEEP && PM_GETRE(pm)) {
83 if (PL_op->op_flags & OPf_STACKED) {
92 if (PL_op->op_flags & OPf_STACKED) {
93 /* multiple args; concatentate them */
95 tmpstr = PAD_SV(ARGTARG);
96 sv_setpvn(tmpstr, "", 0);
97 while (++MARK <= SP) {
98 if (PL_amagic_generation) {
100 if ((SvAMAGIC(tmpstr) || SvAMAGIC(*MARK)) &&
101 (sv = amagic_call(tmpstr, *MARK, concat_amg, AMGf_assign)))
103 sv_setsv(tmpstr, sv);
107 sv_catsv(tmpstr, *MARK);
116 SV * const sv = SvRV(tmpstr);
118 mg = mg_find(sv, PERL_MAGIC_qr);
121 regexp * const re = (regexp *)mg->mg_obj;
122 ReREFCNT_dec(PM_GETRE(pm));
123 PM_SETRE(pm, ReREFCNT_inc(re));
127 const char *t = SvPV_const(tmpstr, len);
128 regexp * const re = PM_GETRE(pm);
130 /* Check against the last compiled regexp. */
131 if (!re || !re->precomp || re->prelen != (I32)len ||
132 memNE(re->precomp, t, len))
134 const regexp_engine *eng = re ? re->engine : NULL;
138 PM_SETRE(pm, NULL); /* crucial if regcomp aborts */
139 } else if (PL_curcop->cop_hints_hash) {
140 SV *ptr = Perl_refcounted_he_fetch(aTHX_ PL_curcop->cop_hints_hash, 0,
142 if (ptr && SvIOK(ptr) && SvIV(ptr))
143 eng = INT2PTR(regexp_engine*,SvIV(ptr));
146 if (PL_op->op_flags & OPf_SPECIAL)
147 PL_reginterp_cnt = I32_MAX; /* Mark as safe. */
149 pm->op_pmflags = pm->op_pmpermflags; /* reset case sensitivity */
151 pm->op_pmdynflags |= PMdf_DYN_UTF8;
153 pm->op_pmdynflags &= ~PMdf_DYN_UTF8;
154 if (pm->op_pmdynflags & PMdf_UTF8)
155 t = (char*)bytes_to_utf8((U8*)t, &len);
158 PM_SETRE(pm, CALLREGCOMP_ENG(eng,(char *)t, (char *)t + len, pm));
160 PM_SETRE(pm, CALLREGCOMP((char *)t, (char *)t + len, pm));
162 if (!DO_UTF8(tmpstr) && (pm->op_pmdynflags & PMdf_UTF8))
164 PL_reginterp_cnt = 0; /* XXXX Be extra paranoid - needed
165 inside tie/overload accessors. */
169 #ifndef INCOMPLETE_TAINTS
172 pm->op_pmdynflags |= PMdf_TAINTED;
174 pm->op_pmdynflags &= ~PMdf_TAINTED;
178 if (!PM_GETRE(pm)->prelen && PL_curpm)
180 else if (strEQ("\\s+", PM_GETRE(pm)->precomp))
181 pm->op_pmflags |= PMf_WHITE;
183 pm->op_pmflags &= ~PMf_WHITE;
185 /* XXX runtime compiled output needs to move to the pad */
186 if (pm->op_pmflags & PMf_KEEP) {
187 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
188 #if !defined(USE_ITHREADS)
189 /* XXX can't change the optree at runtime either */
190 cLOGOP->op_first->op_next = PL_op->op_next;
200 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
201 register PMOP * const pm = (PMOP*) cLOGOP->op_other;
202 register SV * const dstr = cx->sb_dstr;
203 register char *s = cx->sb_s;
204 register char *m = cx->sb_m;
205 char *orig = cx->sb_orig;
206 register REGEXP * const rx = cx->sb_rx;
208 REGEXP *old = PM_GETRE(pm);
212 PM_SETRE(pm,ReREFCNT_inc(rx));
215 rxres_restore(&cx->sb_rxres, rx);
216 RX_MATCH_UTF8_set(rx, DO_UTF8(cx->sb_targ));
218 if (cx->sb_iters++) {
219 const I32 saviters = cx->sb_iters;
220 if (cx->sb_iters > cx->sb_maxiters)
221 DIE(aTHX_ "Substitution loop");
223 if (!(cx->sb_rxtainted & 2) && SvTAINTED(TOPs))
224 cx->sb_rxtainted |= 2;
225 sv_catsv(dstr, POPs);
226 FREETMPS; /* Prevent excess tmp stack */
229 if (cx->sb_once || !CALLREGEXEC(rx, s, cx->sb_strend, orig,
230 s == m, cx->sb_targ, NULL,
231 ((cx->sb_rflags & REXEC_COPY_STR)
232 ? (REXEC_IGNOREPOS|REXEC_NOT_FIRST)
233 : (REXEC_COPY_STR|REXEC_IGNOREPOS|REXEC_NOT_FIRST))))
235 SV * const targ = cx->sb_targ;
237 assert(cx->sb_strend >= s);
238 if(cx->sb_strend > s) {
239 if (DO_UTF8(dstr) && !SvUTF8(targ))
240 sv_catpvn_utf8_upgrade(dstr, s, cx->sb_strend - s, nsv);
242 sv_catpvn(dstr, s, cx->sb_strend - s);
244 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
246 #ifdef PERL_OLD_COPY_ON_WRITE
248 sv_force_normal_flags(targ, SV_COW_DROP_PV);
254 SvPV_set(targ, SvPVX(dstr));
255 SvCUR_set(targ, SvCUR(dstr));
256 SvLEN_set(targ, SvLEN(dstr));
259 SvPV_set(dstr, NULL);
261 TAINT_IF(cx->sb_rxtainted & 1);
262 PUSHs(sv_2mortal(newSViv(saviters - 1)));
264 (void)SvPOK_only_UTF8(targ);
265 TAINT_IF(cx->sb_rxtainted);
269 LEAVE_SCOPE(cx->sb_oldsave);
271 RETURNOP(pm->op_next);
273 cx->sb_iters = saviters;
275 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
278 cx->sb_orig = orig = rx->subbeg;
280 cx->sb_strend = s + (cx->sb_strend - m);
282 cx->sb_m = m = rx->startp[0] + orig;
284 if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
285 sv_catpvn_utf8_upgrade(dstr, s, m - s, nsv);
287 sv_catpvn(dstr, s, m-s);
289 cx->sb_s = rx->endp[0] + orig;
290 { /* Update the pos() information. */
291 SV * const sv = cx->sb_targ;
294 if (SvTYPE(sv) < SVt_PVMG)
295 SvUPGRADE(sv, SVt_PVMG);
296 if (!(mg = mg_find(sv, PERL_MAGIC_regex_global))) {
297 #ifdef PERL_OLD_COPY_ON_WRITE
299 sv_force_normal_flags(sv, 0);
301 mg = sv_magicext(sv, NULL, PERL_MAGIC_regex_global, &PL_vtbl_mglob,
310 (void)ReREFCNT_inc(rx);
311 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
312 rxres_save(&cx->sb_rxres, rx);
313 RETURNOP(pm->op_pmreplstart);
317 Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
323 if (!p || p[1] < rx->nparens) {
324 #ifdef PERL_OLD_COPY_ON_WRITE
325 i = 7 + rx->nparens * 2;
327 i = 6 + rx->nparens * 2;
336 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? rx->subbeg : NULL);
337 RX_MATCH_COPIED_off(rx);
339 #ifdef PERL_OLD_COPY_ON_WRITE
340 *p++ = PTR2UV(rx->saved_copy);
341 rx->saved_copy = NULL;
346 *p++ = PTR2UV(rx->subbeg);
347 *p++ = (UV)rx->sublen;
348 for (i = 0; i <= rx->nparens; ++i) {
349 *p++ = (UV)rx->startp[i];
350 *p++ = (UV)rx->endp[i];
355 Perl_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
361 RX_MATCH_COPY_FREE(rx);
362 RX_MATCH_COPIED_set(rx, *p);
365 #ifdef PERL_OLD_COPY_ON_WRITE
367 SvREFCNT_dec (rx->saved_copy);
368 rx->saved_copy = INT2PTR(SV*,*p);
374 rx->subbeg = INT2PTR(char*,*p++);
375 rx->sublen = (I32)(*p++);
376 for (i = 0; i <= rx->nparens; ++i) {
377 rx->startp[i] = (I32)(*p++);
378 rx->endp[i] = (I32)(*p++);
383 Perl_rxres_free(pTHX_ void **rsp)
385 UV * const p = (UV*)*rsp;
390 void *tmp = INT2PTR(char*,*p);
393 PoisonFree(*p, 1, sizeof(*p));
395 Safefree(INT2PTR(char*,*p));
397 #ifdef PERL_OLD_COPY_ON_WRITE
399 SvREFCNT_dec (INT2PTR(SV*,p[1]));
409 dVAR; dSP; dMARK; dORIGMARK;
410 register SV * const tmpForm = *++MARK;
415 register SV *sv = NULL;
416 const char *item = NULL;
420 bool chopspace = (strchr(PL_chopset, ' ') != NULL);
421 const char *chophere = NULL;
422 char *linemark = NULL;
424 bool gotsome = FALSE;
426 const STRLEN fudge = SvPOK(tmpForm)
427 ? (SvCUR(tmpForm) * (IN_BYTES ? 1 : 3) + 1) : 0;
428 bool item_is_utf8 = FALSE;
429 bool targ_is_utf8 = FALSE;
431 OP * parseres = NULL;
435 if (!SvMAGICAL(tmpForm) || !SvCOMPILED(tmpForm)) {
436 if (SvREADONLY(tmpForm)) {
437 SvREADONLY_off(tmpForm);
438 parseres = doparseform(tmpForm);
439 SvREADONLY_on(tmpForm);
442 parseres = doparseform(tmpForm);
446 SvPV_force(PL_formtarget, len);
447 if (DO_UTF8(PL_formtarget))
449 t = SvGROW(PL_formtarget, len + fudge + 1); /* XXX SvCUR bad */
451 f = SvPV_const(tmpForm, len);
452 /* need to jump to the next word */
453 fpc = (U32*)(f + len + WORD_ALIGN - SvCUR(tmpForm) % WORD_ALIGN);
457 const char *name = "???";
460 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
461 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
462 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
463 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
464 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
466 case FF_CHECKNL: name = "CHECKNL"; break;
467 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
468 case FF_SPACE: name = "SPACE"; break;
469 case FF_HALFSPACE: name = "HALFSPACE"; break;
470 case FF_ITEM: name = "ITEM"; break;
471 case FF_CHOP: name = "CHOP"; break;
472 case FF_LINEGLOB: name = "LINEGLOB"; break;
473 case FF_NEWLINE: name = "NEWLINE"; break;
474 case FF_MORE: name = "MORE"; break;
475 case FF_LINEMARK: name = "LINEMARK"; break;
476 case FF_END: name = "END"; break;
477 case FF_0DECIMAL: name = "0DECIMAL"; break;
478 case FF_LINESNGL: name = "LINESNGL"; break;
481 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
483 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
494 if (targ_is_utf8 && !SvUTF8(tmpForm)) {
495 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
497 sv_catpvn_utf8_upgrade(PL_formtarget, f, arg, nsv);
498 t = SvEND(PL_formtarget);
501 if (!targ_is_utf8 && DO_UTF8(tmpForm)) {
502 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
504 sv_utf8_upgrade(PL_formtarget);
505 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
506 t = SvEND(PL_formtarget);
526 if (ckWARN(WARN_SYNTAX))
527 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
534 const char *s = item = SvPV_const(sv, len);
537 itemsize = sv_len_utf8(sv);
538 if (itemsize != (I32)len) {
540 if (itemsize > fieldsize) {
541 itemsize = fieldsize;
542 itembytes = itemsize;
543 sv_pos_u2b(sv, &itembytes, 0);
547 send = chophere = s + itembytes;
557 sv_pos_b2u(sv, &itemsize);
561 item_is_utf8 = FALSE;
562 if (itemsize > fieldsize)
563 itemsize = fieldsize;
564 send = chophere = s + itemsize;
578 const char *s = item = SvPV_const(sv, len);
581 itemsize = sv_len_utf8(sv);
582 if (itemsize != (I32)len) {
584 if (itemsize <= fieldsize) {
585 const char *send = chophere = s + itemsize;
598 itemsize = fieldsize;
599 itembytes = itemsize;
600 sv_pos_u2b(sv, &itembytes, 0);
601 send = chophere = s + itembytes;
602 while (s < send || (s == send && isSPACE(*s))) {
612 if (strchr(PL_chopset, *s))
617 itemsize = chophere - item;
618 sv_pos_b2u(sv, &itemsize);
624 item_is_utf8 = FALSE;
625 if (itemsize <= fieldsize) {
626 const char *const send = chophere = s + itemsize;
639 itemsize = fieldsize;
640 send = chophere = s + itemsize;
641 while (s < send || (s == send && isSPACE(*s))) {
651 if (strchr(PL_chopset, *s))
656 itemsize = chophere - item;
662 arg = fieldsize - itemsize;
671 arg = fieldsize - itemsize;
682 const char *s = item;
686 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
688 sv_utf8_upgrade(PL_formtarget);
689 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
690 t = SvEND(PL_formtarget);
694 if (UTF8_IS_CONTINUED(*s)) {
695 STRLEN skip = UTF8SKIP(s);
712 if ( !((*t++ = *s++) & ~31) )
718 if (targ_is_utf8 && !item_is_utf8) {
719 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
721 sv_catpvn_utf8_upgrade(PL_formtarget, s, arg, nsv);
722 for (; t < SvEND(PL_formtarget); t++) {
735 const int ch = *t++ = *s++;
738 if ( !((*t++ = *s++) & ~31) )
747 const char *s = chophere;
765 const char *s = item = SvPV_const(sv, len);
767 if ((item_is_utf8 = DO_UTF8(sv)))
768 itemsize = sv_len_utf8(sv);
770 bool chopped = FALSE;
771 const char *const send = s + len;
773 chophere = s + itemsize;
789 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
791 SvUTF8_on(PL_formtarget);
793 SvCUR_set(sv, chophere - item);
794 sv_catsv(PL_formtarget, sv);
795 SvCUR_set(sv, itemsize);
797 sv_catsv(PL_formtarget, sv);
799 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) - 1);
800 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
801 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
810 #if defined(USE_LONG_DOUBLE)
813 "%#0*.*" PERL_PRIfldbl : "%0*.*" PERL_PRIfldbl);
817 "%#0*.*f" : "%0*.*f");
822 #if defined(USE_LONG_DOUBLE)
824 ((arg & 256) ? "%#*.*" PERL_PRIfldbl : "%*.*" PERL_PRIfldbl);
827 ((arg & 256) ? "%#*.*f" : "%*.*f");
830 /* If the field is marked with ^ and the value is undefined,
832 if ((arg & 512) && !SvOK(sv)) {
840 /* overflow evidence */
841 if (num_overflow(value, fieldsize, arg)) {
847 /* Formats aren't yet marked for locales, so assume "yes". */
849 STORE_NUMERIC_STANDARD_SET_LOCAL();
850 my_snprintf(t, SvLEN(PL_formtarget) - (t - SvPVX(PL_formtarget)), fmt, (int) fieldsize, (int) arg & 255, value);
851 RESTORE_NUMERIC_STANDARD();
858 while (t-- > linemark && *t == ' ') ;
866 if (arg) { /* repeat until fields exhausted? */
868 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
869 lines += FmLINES(PL_formtarget);
872 if (strnEQ(linemark, linemark - arg, arg))
873 DIE(aTHX_ "Runaway format");
876 SvUTF8_on(PL_formtarget);
877 FmLINES(PL_formtarget) = lines;
879 RETURNOP(cLISTOP->op_first);
890 const char *s = chophere;
891 const char *send = item + len;
893 while (isSPACE(*s) && (s < send))
898 arg = fieldsize - itemsize;
905 if (strnEQ(s1," ",3)) {
906 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
917 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
919 SvUTF8_on(PL_formtarget);
920 FmLINES(PL_formtarget) += lines;
932 if (PL_stack_base + *PL_markstack_ptr == SP) {
934 if (GIMME_V == G_SCALAR)
935 XPUSHs(sv_2mortal(newSViv(0)));
936 RETURNOP(PL_op->op_next->op_next);
938 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
939 pp_pushmark(); /* push dst */
940 pp_pushmark(); /* push src */
941 ENTER; /* enter outer scope */
944 if (PL_op->op_private & OPpGREP_LEX)
945 SAVESPTR(PAD_SVl(PL_op->op_targ));
948 ENTER; /* enter inner scope */
951 src = PL_stack_base[*PL_markstack_ptr];
953 if (PL_op->op_private & OPpGREP_LEX)
954 PAD_SVl(PL_op->op_targ) = src;
959 if (PL_op->op_type == OP_MAPSTART)
960 pp_pushmark(); /* push top */
961 return ((LOGOP*)PL_op->op_next)->op_other;
967 const I32 gimme = GIMME_V;
968 I32 items = (SP - PL_stack_base) - *PL_markstack_ptr; /* how many new items */
974 /* first, move source pointer to the next item in the source list */
975 ++PL_markstack_ptr[-1];
977 /* if there are new items, push them into the destination list */
978 if (items && gimme != G_VOID) {
979 /* might need to make room back there first */
980 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
981 /* XXX this implementation is very pessimal because the stack
982 * is repeatedly extended for every set of items. Is possible
983 * to do this without any stack extension or copying at all
984 * by maintaining a separate list over which the map iterates
985 * (like foreach does). --gsar */
987 /* everything in the stack after the destination list moves
988 * towards the end the stack by the amount of room needed */
989 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
991 /* items to shift up (accounting for the moved source pointer) */
992 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
994 /* This optimization is by Ben Tilly and it does
995 * things differently from what Sarathy (gsar)
996 * is describing. The downside of this optimization is
997 * that leaves "holes" (uninitialized and hopefully unused areas)
998 * to the Perl stack, but on the other hand this
999 * shouldn't be a problem. If Sarathy's idea gets
1000 * implemented, this optimization should become
1001 * irrelevant. --jhi */
1003 shift = count; /* Avoid shifting too often --Ben Tilly */
1007 dst = (SP += shift);
1008 PL_markstack_ptr[-1] += shift;
1009 *PL_markstack_ptr += shift;
1013 /* copy the new items down to the destination list */
1014 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
1015 if (gimme == G_ARRAY) {
1017 *dst-- = SvTEMP(TOPs) ? POPs : sv_mortalcopy(POPs);
1020 /* scalar context: we don't care about which values map returns
1021 * (we use undef here). And so we certainly don't want to do mortal
1022 * copies of meaningless values. */
1023 while (items-- > 0) {
1025 *dst-- = &PL_sv_undef;
1029 LEAVE; /* exit inner scope */
1032 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
1034 (void)POPMARK; /* pop top */
1035 LEAVE; /* exit outer scope */
1036 (void)POPMARK; /* pop src */
1037 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1038 (void)POPMARK; /* pop dst */
1039 SP = PL_stack_base + POPMARK; /* pop original mark */
1040 if (gimme == G_SCALAR) {
1041 if (PL_op->op_private & OPpGREP_LEX) {
1042 SV* sv = sv_newmortal();
1043 sv_setiv(sv, items);
1051 else if (gimme == G_ARRAY)
1058 ENTER; /* enter inner scope */
1061 /* set $_ to the new source item */
1062 src = PL_stack_base[PL_markstack_ptr[-1]];
1064 if (PL_op->op_private & OPpGREP_LEX)
1065 PAD_SVl(PL_op->op_targ) = src;
1069 RETURNOP(cLOGOP->op_other);
1078 if (GIMME == G_ARRAY)
1080 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1081 return cLOGOP->op_other;
1091 if (GIMME == G_ARRAY) {
1092 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1096 SV * const targ = PAD_SV(PL_op->op_targ);
1099 if (PL_op->op_private & OPpFLIP_LINENUM) {
1100 if (GvIO(PL_last_in_gv)) {
1101 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1104 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1106 flip = SvIV(sv) == SvIV(GvSV(gv));
1112 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
1113 if (PL_op->op_flags & OPf_SPECIAL) {
1121 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1124 sv_setpvn(TARG, "", 0);
1130 /* This code tries to decide if "$left .. $right" should use the
1131 magical string increment, or if the range is numeric (we make
1132 an exception for .."0" [#18165]). AMS 20021031. */
1134 #define RANGE_IS_NUMERIC(left,right) ( \
1135 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1136 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
1137 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
1138 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
1139 && (!SvOK(right) || looks_like_number(right))))
1145 if (GIMME == G_ARRAY) {
1151 if (RANGE_IS_NUMERIC(left,right)) {
1154 if ((SvOK(left) && SvNV(left) < IV_MIN) ||
1155 (SvOK(right) && SvNV(right) > IV_MAX))
1156 DIE(aTHX_ "Range iterator outside integer range");
1167 SV * const sv = sv_2mortal(newSViv(i++));
1172 SV * const final = sv_mortalcopy(right);
1174 const char * const tmps = SvPV_const(final, len);
1176 SV *sv = sv_mortalcopy(left);
1177 SvPV_force_nolen(sv);
1178 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
1180 if (strEQ(SvPVX_const(sv),tmps))
1182 sv = sv_2mortal(newSVsv(sv));
1189 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
1193 if (PL_op->op_private & OPpFLIP_LINENUM) {
1194 if (GvIO(PL_last_in_gv)) {
1195 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1198 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1199 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1207 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
1208 sv_catpvs(targ, "E0");
1218 static const char * const context_name[] = {
1231 S_dopoptolabel(pTHX_ const char *label)
1236 for (i = cxstack_ix; i >= 0; i--) {
1237 register const PERL_CONTEXT * const cx = &cxstack[i];
1238 switch (CxTYPE(cx)) {
1246 if (ckWARN(WARN_EXITING))
1247 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1248 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1249 if (CxTYPE(cx) == CXt_NULL)
1253 if ( !cx->blk_loop.label || strNE(label, cx->blk_loop.label) ) {
1254 DEBUG_l(Perl_deb(aTHX_ "(Skipping label #%ld %s)\n",
1255 (long)i, cx->blk_loop.label));
1258 DEBUG_l( Perl_deb(aTHX_ "(Found label #%ld %s)\n", (long)i, label));
1268 Perl_dowantarray(pTHX)
1271 const I32 gimme = block_gimme();
1272 return (gimme == G_VOID) ? G_SCALAR : gimme;
1276 Perl_block_gimme(pTHX)
1279 const I32 cxix = dopoptosub(cxstack_ix);
1283 switch (cxstack[cxix].blk_gimme) {
1291 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
1298 Perl_is_lvalue_sub(pTHX)
1301 const I32 cxix = dopoptosub(cxstack_ix);
1302 assert(cxix >= 0); /* We should only be called from inside subs */
1304 if (cxstack[cxix].blk_sub.lval && CvLVALUE(cxstack[cxix].blk_sub.cv))
1305 return cxstack[cxix].blk_sub.lval;
1311 S_dopoptosub(pTHX_ I32 startingblock)
1314 return dopoptosub_at(cxstack, startingblock);
1318 S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
1322 for (i = startingblock; i >= 0; i--) {
1323 register const PERL_CONTEXT * const cx = &cxstk[i];
1324 switch (CxTYPE(cx)) {
1330 DEBUG_l( Perl_deb(aTHX_ "(Found sub #%ld)\n", (long)i));
1338 S_dopoptoeval(pTHX_ I32 startingblock)
1342 for (i = startingblock; i >= 0; i--) {
1343 register const PERL_CONTEXT *cx = &cxstack[i];
1344 switch (CxTYPE(cx)) {
1348 DEBUG_l( Perl_deb(aTHX_ "(Found eval #%ld)\n", (long)i));
1356 S_dopoptoloop(pTHX_ I32 startingblock)
1360 for (i = startingblock; i >= 0; i--) {
1361 register const PERL_CONTEXT * const cx = &cxstack[i];
1362 switch (CxTYPE(cx)) {
1368 if (ckWARN(WARN_EXITING))
1369 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1370 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1371 if ((CxTYPE(cx)) == CXt_NULL)
1375 DEBUG_l( Perl_deb(aTHX_ "(Found loop #%ld)\n", (long)i));
1383 S_dopoptogiven(pTHX_ I32 startingblock)
1387 for (i = startingblock; i >= 0; i--) {
1388 register const PERL_CONTEXT *cx = &cxstack[i];
1389 switch (CxTYPE(cx)) {
1393 DEBUG_l( Perl_deb(aTHX_ "(Found given #%ld)\n", (long)i));
1396 if (CxFOREACHDEF(cx)) {
1397 DEBUG_l( Perl_deb(aTHX_ "(Found foreach #%ld)\n", (long)i));
1406 S_dopoptowhen(pTHX_ I32 startingblock)
1410 for (i = startingblock; i >= 0; i--) {
1411 register const PERL_CONTEXT *cx = &cxstack[i];
1412 switch (CxTYPE(cx)) {
1416 DEBUG_l( Perl_deb(aTHX_ "(Found when #%ld)\n", (long)i));
1424 Perl_dounwind(pTHX_ I32 cxix)
1429 while (cxstack_ix > cxix) {
1431 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
1432 DEBUG_l(PerlIO_printf(Perl_debug_log, "Unwinding block %ld, type %s\n",
1433 (long) cxstack_ix, PL_block_type[CxTYPE(cx)]));
1434 /* Note: we don't need to restore the base context info till the end. */
1435 switch (CxTYPE(cx)) {
1438 continue; /* not break */
1457 PERL_UNUSED_VAR(optype);
1461 Perl_qerror(pTHX_ SV *err)
1465 sv_catsv(ERRSV, err);
1467 sv_catsv(PL_errors, err);
1469 Perl_warn(aTHX_ "%"SVf, (void*)err);
1474 Perl_die_where(pTHX_ const char *message, STRLEN msglen)
1483 if (PL_in_eval & EVAL_KEEPERR) {
1484 static const char prefix[] = "\t(in cleanup) ";
1485 SV * const err = ERRSV;
1486 const char *e = NULL;
1488 sv_setpvn(err,"",0);
1489 else if (SvCUR(err) >= sizeof(prefix)+msglen-1) {
1491 e = SvPV_const(err, len);
1493 if (*e != *message || strNE(e,message))
1497 SvGROW(err, SvCUR(err)+sizeof(prefix)+msglen);
1498 sv_catpvn(err, prefix, sizeof(prefix)-1);
1499 sv_catpvn(err, message, msglen);
1500 if (ckWARN(WARN_MISC)) {
1501 const STRLEN start = SvCUR(err)-msglen-sizeof(prefix)+1;
1502 Perl_warner(aTHX_ packWARN(WARN_MISC), SvPVX_const(err)+start);
1507 sv_setpvn(ERRSV, message, msglen);
1511 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1512 && PL_curstackinfo->si_prev)
1520 register PERL_CONTEXT *cx;
1523 if (cxix < cxstack_ix)
1526 POPBLOCK(cx,PL_curpm);
1527 if (CxTYPE(cx) != CXt_EVAL) {
1529 message = SvPVx_const(ERRSV, msglen);
1530 PerlIO_write(Perl_error_log, (const char *)"panic: die ", 11);
1531 PerlIO_write(Perl_error_log, message, msglen);
1536 if (gimme == G_SCALAR)
1537 *++newsp = &PL_sv_undef;
1538 PL_stack_sp = newsp;
1542 /* LEAVE could clobber PL_curcop (see save_re_context())
1543 * XXX it might be better to find a way to avoid messing with
1544 * PL_curcop in save_re_context() instead, but this is a more
1545 * minimal fix --GSAR */
1546 PL_curcop = cx->blk_oldcop;
1548 if (optype == OP_REQUIRE) {
1549 const char* const msg = SvPVx_nolen_const(ERRSV);
1550 SV * const nsv = cx->blk_eval.old_namesv;
1551 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
1553 DIE(aTHX_ "%sCompilation failed in require",
1554 *msg ? msg : "Unknown error\n");
1556 assert(CxTYPE(cx) == CXt_EVAL);
1557 return cx->blk_eval.retop;
1561 message = SvPVx_const(ERRSV, msglen);
1563 write_to_stderr(message, msglen);
1571 dVAR; dSP; dPOPTOPssrl;
1572 if (SvTRUE(left) != SvTRUE(right))
1582 register I32 cxix = dopoptosub(cxstack_ix);
1583 register const PERL_CONTEXT *cx;
1584 register const PERL_CONTEXT *ccstack = cxstack;
1585 const PERL_SI *top_si = PL_curstackinfo;
1587 const char *stashname;
1594 /* we may be in a higher stacklevel, so dig down deeper */
1595 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1596 top_si = top_si->si_prev;
1597 ccstack = top_si->si_cxstack;
1598 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1601 if (GIMME != G_ARRAY) {
1607 /* caller() should not report the automatic calls to &DB::sub */
1608 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
1609 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1613 cxix = dopoptosub_at(ccstack, cxix - 1);
1616 cx = &ccstack[cxix];
1617 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1618 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
1619 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1620 field below is defined for any cx. */
1621 /* caller() should not report the automatic calls to &DB::sub */
1622 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1623 cx = &ccstack[dbcxix];
1626 stashname = CopSTASHPV(cx->blk_oldcop);
1627 if (GIMME != G_ARRAY) {
1630 PUSHs(&PL_sv_undef);
1633 sv_setpv(TARG, stashname);
1642 PUSHs(&PL_sv_undef);
1644 PUSHs(sv_2mortal(newSVpv(stashname, 0)));
1645 PUSHs(sv_2mortal(newSVpv(OutCopFILE(cx->blk_oldcop), 0)));
1646 PUSHs(sv_2mortal(newSViv((I32)CopLINE(cx->blk_oldcop))));
1649 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1650 GV * const cvgv = CvGV(ccstack[cxix].blk_sub.cv);
1651 /* So is ccstack[dbcxix]. */
1653 SV * const sv = newSV(0);
1654 gv_efullname3(sv, cvgv, NULL);
1655 PUSHs(sv_2mortal(sv));
1656 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1659 PUSHs(sv_2mortal(newSVpvs("(unknown)")));
1660 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1664 PUSHs(sv_2mortal(newSVpvs("(eval)")));
1665 PUSHs(sv_2mortal(newSViv(0)));
1667 gimme = (I32)cx->blk_gimme;
1668 if (gimme == G_VOID)
1669 PUSHs(&PL_sv_undef);
1671 PUSHs(sv_2mortal(newSViv(gimme & G_ARRAY)));
1672 if (CxTYPE(cx) == CXt_EVAL) {
1674 if (cx->blk_eval.old_op_type == OP_ENTEREVAL) {
1675 PUSHs(cx->blk_eval.cur_text);
1679 else if (cx->blk_eval.old_namesv) {
1680 PUSHs(sv_2mortal(newSVsv(cx->blk_eval.old_namesv)));
1683 /* eval BLOCK (try blocks have old_namesv == 0) */
1685 PUSHs(&PL_sv_undef);
1686 PUSHs(&PL_sv_undef);
1690 PUSHs(&PL_sv_undef);
1691 PUSHs(&PL_sv_undef);
1693 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs
1694 && CopSTASH_eq(PL_curcop, PL_debstash))
1696 AV * const ary = cx->blk_sub.argarray;
1697 const int off = AvARRAY(ary) - AvALLOC(ary);
1700 GV* const tmpgv = gv_fetchpvs("DB::args", GV_ADD, SVt_PVAV);
1701 PL_dbargs = GvAV(gv_AVadd(tmpgv));
1703 AvREAL_off(PL_dbargs); /* XXX should be REIFY (see av.h) */
1706 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1707 av_extend(PL_dbargs, AvFILLp(ary) + off);
1708 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1709 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1711 /* XXX only hints propagated via op_private are currently
1712 * visible (others are not easily accessible, since they
1713 * use the global PL_hints) */
1714 PUSHs(sv_2mortal(newSViv(CopHINTS_get(cx->blk_oldcop))));
1717 STRLEN * const old_warnings = cx->blk_oldcop->cop_warnings ;
1719 if (old_warnings == pWARN_NONE ||
1720 (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0))
1721 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
1722 else if (old_warnings == pWARN_ALL ||
1723 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
1724 /* Get the bit mask for $warnings::Bits{all}, because
1725 * it could have been extended by warnings::register */
1727 HV * const bits = get_hv("warnings::Bits", FALSE);
1728 if (bits && (bits_all=hv_fetchs(bits, "all", FALSE))) {
1729 mask = newSVsv(*bits_all);
1732 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1736 mask = newSVpvn((char *) (old_warnings + 1), old_warnings[0]);
1737 PUSHs(sv_2mortal(mask));
1740 PUSHs(cx->blk_oldcop->cop_hints_hash ?
1741 sv_2mortal(newRV_noinc(
1742 (SV*)Perl_refcounted_he_chain_2hv(aTHX_
1743 cx->blk_oldcop->cop_hints_hash)))
1752 const char * const tmps = (MAXARG < 1) ? (const char *)"" : POPpconstx;
1753 sv_reset(tmps, CopSTASH(PL_curcop));
1758 /* like pp_nextstate, but used instead when the debugger is active */
1763 PL_curcop = (COP*)PL_op;
1764 TAINT_NOT; /* Each statement is presumed innocent */
1765 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
1768 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
1769 || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
1772 register PERL_CONTEXT *cx;
1773 const I32 gimme = G_ARRAY;
1775 GV * const gv = PL_DBgv;
1776 register CV * const cv = GvCV(gv);
1779 DIE(aTHX_ "No DB::DB routine defined");
1781 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
1782 /* don't do recursive DB::DB call */
1797 (void)(*CvXSUB(cv))(aTHX_ cv);
1804 PUSHBLOCK(cx, CXt_SUB, SP);
1806 cx->blk_sub.retop = PL_op->op_next;
1809 PAD_SET_CUR_NOSAVE(CvPADLIST(cv), 1);
1810 RETURNOP(CvSTART(cv));
1820 register PERL_CONTEXT *cx;
1821 const I32 gimme = GIMME_V;
1823 U16 cxtype = CXt_LOOP | CXp_FOREACH;
1831 if (PL_op->op_targ) {
1832 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
1833 SvPADSTALE_off(PAD_SVl(PL_op->op_targ));
1834 SAVESETSVFLAGS(PAD_SVl(PL_op->op_targ),
1835 SVs_PADSTALE, SVs_PADSTALE);
1837 #ifndef USE_ITHREADS
1838 svp = &PAD_SVl(PL_op->op_targ); /* "my" variable */
1841 SAVEPADSV(PL_op->op_targ);
1842 iterdata = INT2PTR(void*, PL_op->op_targ);
1843 cxtype |= CXp_PADVAR;
1847 GV * const gv = (GV*)POPs;
1848 svp = &GvSV(gv); /* symbol table variable */
1849 SAVEGENERICSV(*svp);
1852 iterdata = (void*)gv;
1856 if (PL_op->op_private & OPpITER_DEF)
1857 cxtype |= CXp_FOR_DEF;
1861 PUSHBLOCK(cx, cxtype, SP);
1863 PUSHLOOP(cx, iterdata, MARK);
1865 PUSHLOOP(cx, svp, MARK);
1867 if (PL_op->op_flags & OPf_STACKED) {
1868 cx->blk_loop.iterary = (AV*)SvREFCNT_inc(POPs);
1869 if (SvTYPE(cx->blk_loop.iterary) != SVt_PVAV) {
1871 SV * const right = (SV*)cx->blk_loop.iterary;
1874 if (RANGE_IS_NUMERIC(sv,right)) {
1875 if ((SvOK(sv) && SvNV(sv) < IV_MIN) ||
1876 (SvOK(right) && SvNV(right) >= IV_MAX))
1877 DIE(aTHX_ "Range iterator outside integer range");
1878 cx->blk_loop.iterix = SvIV(sv);
1879 cx->blk_loop.itermax = SvIV(right);
1881 /* for correct -Dstv display */
1882 cx->blk_oldsp = sp - PL_stack_base;
1886 cx->blk_loop.iterlval = newSVsv(sv);
1887 (void) SvPV_force_nolen(cx->blk_loop.iterlval);
1888 (void) SvPV_nolen_const(right);
1891 else if (PL_op->op_private & OPpITER_REVERSED) {
1892 cx->blk_loop.itermax = 0;
1893 cx->blk_loop.iterix = AvFILL(cx->blk_loop.iterary) + 1;
1898 cx->blk_loop.iterary = PL_curstack;
1899 AvFILLp(PL_curstack) = SP - PL_stack_base;
1900 if (PL_op->op_private & OPpITER_REVERSED) {
1901 cx->blk_loop.itermax = MARK - PL_stack_base + 1;
1902 cx->blk_loop.iterix = cx->blk_oldsp + 1;
1905 cx->blk_loop.iterix = MARK - PL_stack_base;
1915 register PERL_CONTEXT *cx;
1916 const I32 gimme = GIMME_V;
1922 PUSHBLOCK(cx, CXt_LOOP, SP);
1923 PUSHLOOP(cx, 0, SP);
1931 register PERL_CONTEXT *cx;
1938 assert(CxTYPE(cx) == CXt_LOOP);
1940 newsp = PL_stack_base + cx->blk_loop.resetsp;
1943 if (gimme == G_VOID)
1945 else if (gimme == G_SCALAR) {
1947 *++newsp = sv_mortalcopy(*SP);
1949 *++newsp = &PL_sv_undef;
1953 *++newsp = sv_mortalcopy(*++mark);
1954 TAINT_NOT; /* Each item is independent */
1960 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
1961 PL_curpm = newpm; /* ... and pop $1 et al */
1972 register PERL_CONTEXT *cx;
1973 bool popsub2 = FALSE;
1974 bool clear_errsv = FALSE;
1982 const I32 cxix = dopoptosub(cxstack_ix);
1985 if (CxMULTICALL(cxstack)) { /* In this case we must be in a
1986 * sort block, which is a CXt_NULL
1989 PL_stack_base[1] = *PL_stack_sp;
1990 PL_stack_sp = PL_stack_base + 1;
1994 DIE(aTHX_ "Can't return outside a subroutine");
1996 if (cxix < cxstack_ix)
1999 if (CxMULTICALL(&cxstack[cxix])) {
2000 gimme = cxstack[cxix].blk_gimme;
2001 if (gimme == G_VOID)
2002 PL_stack_sp = PL_stack_base;
2003 else if (gimme == G_SCALAR) {
2004 PL_stack_base[1] = *PL_stack_sp;
2005 PL_stack_sp = PL_stack_base + 1;
2011 switch (CxTYPE(cx)) {
2014 retop = cx->blk_sub.retop;
2015 cxstack_ix++; /* preserve cx entry on stack for use by POPSUB */
2018 if (!(PL_in_eval & EVAL_KEEPERR))
2021 retop = cx->blk_eval.retop;
2025 if (optype == OP_REQUIRE &&
2026 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
2028 /* Unassume the success we assumed earlier. */
2029 SV * const nsv = cx->blk_eval.old_namesv;
2030 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
2031 DIE(aTHX_ "%"SVf" did not return a true value", (void*)nsv);
2036 retop = cx->blk_sub.retop;
2039 DIE(aTHX_ "panic: return");
2043 if (gimme == G_SCALAR) {
2046 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2048 *++newsp = SvREFCNT_inc(*SP);
2053 sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
2055 *++newsp = sv_mortalcopy(sv);
2060 *++newsp = (SvTEMP(*SP)) ? *SP : sv_mortalcopy(*SP);
2063 *++newsp = sv_mortalcopy(*SP);
2066 *++newsp = &PL_sv_undef;
2068 else if (gimme == G_ARRAY) {
2069 while (++MARK <= SP) {
2070 *++newsp = (popsub2 && SvTEMP(*MARK))
2071 ? *MARK : sv_mortalcopy(*MARK);
2072 TAINT_NOT; /* Each item is independent */
2075 PL_stack_sp = newsp;
2078 /* Stack values are safe: */
2081 POPSUB(cx,sv); /* release CV and @_ ... */
2085 PL_curpm = newpm; /* ... and pop $1 et al */
2089 sv_setpvn(ERRSV,"",0);
2097 register PERL_CONTEXT *cx;
2108 if (PL_op->op_flags & OPf_SPECIAL) {
2109 cxix = dopoptoloop(cxstack_ix);
2111 DIE(aTHX_ "Can't \"last\" outside a loop block");
2114 cxix = dopoptolabel(cPVOP->op_pv);
2116 DIE(aTHX_ "Label not found for \"last %s\"", cPVOP->op_pv);
2118 if (cxix < cxstack_ix)
2122 cxstack_ix++; /* temporarily protect top context */
2124 switch (CxTYPE(cx)) {
2127 newsp = PL_stack_base + cx->blk_loop.resetsp;
2128 nextop = cx->blk_loop.my_op->op_lastop->op_next;
2132 nextop = cx->blk_sub.retop;
2136 nextop = cx->blk_eval.retop;
2140 nextop = cx->blk_sub.retop;
2143 DIE(aTHX_ "panic: last");
2147 if (gimme == G_SCALAR) {
2149 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*SP))
2150 ? *SP : sv_mortalcopy(*SP);
2152 *++newsp = &PL_sv_undef;
2154 else if (gimme == G_ARRAY) {
2155 while (++MARK <= SP) {
2156 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*MARK))
2157 ? *MARK : sv_mortalcopy(*MARK);
2158 TAINT_NOT; /* Each item is independent */
2166 /* Stack values are safe: */
2169 POPLOOP(cx); /* release loop vars ... */
2173 POPSUB(cx,sv); /* release CV and @_ ... */
2176 PL_curpm = newpm; /* ... and pop $1 et al */
2179 PERL_UNUSED_VAR(optype);
2180 PERL_UNUSED_VAR(gimme);
2188 register PERL_CONTEXT *cx;
2191 if (PL_op->op_flags & OPf_SPECIAL) {
2192 cxix = dopoptoloop(cxstack_ix);
2194 DIE(aTHX_ "Can't \"next\" outside a loop block");
2197 cxix = dopoptolabel(cPVOP->op_pv);
2199 DIE(aTHX_ "Label not found for \"next %s\"", cPVOP->op_pv);
2201 if (cxix < cxstack_ix)
2204 /* clear off anything above the scope we're re-entering, but
2205 * save the rest until after a possible continue block */
2206 inner = PL_scopestack_ix;
2208 if (PL_scopestack_ix < inner)
2209 leave_scope(PL_scopestack[PL_scopestack_ix]);
2210 PL_curcop = cx->blk_oldcop;
2211 return CX_LOOP_NEXTOP_GET(cx);
2218 register PERL_CONTEXT *cx;
2222 if (PL_op->op_flags & OPf_SPECIAL) {
2223 cxix = dopoptoloop(cxstack_ix);
2225 DIE(aTHX_ "Can't \"redo\" outside a loop block");
2228 cxix = dopoptolabel(cPVOP->op_pv);
2230 DIE(aTHX_ "Label not found for \"redo %s\"", cPVOP->op_pv);
2232 if (cxix < cxstack_ix)
2235 redo_op = cxstack[cxix].blk_loop.my_op->op_redoop;
2236 if (redo_op->op_type == OP_ENTER) {
2237 /* pop one less context to avoid $x being freed in while (my $x..) */
2239 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_BLOCK);
2240 redo_op = redo_op->op_next;
2244 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2245 LEAVE_SCOPE(oldsave);
2247 PL_curcop = cx->blk_oldcop;
2252 S_dofindlabel(pTHX_ OP *o, const char *label, OP **opstack, OP **oplimit)
2256 static const char too_deep[] = "Target of goto is too deeply nested";
2259 Perl_croak(aTHX_ too_deep);
2260 if (o->op_type == OP_LEAVE ||
2261 o->op_type == OP_SCOPE ||
2262 o->op_type == OP_LEAVELOOP ||
2263 o->op_type == OP_LEAVESUB ||
2264 o->op_type == OP_LEAVETRY)
2266 *ops++ = cUNOPo->op_first;
2268 Perl_croak(aTHX_ too_deep);
2271 if (o->op_flags & OPf_KIDS) {
2273 /* First try all the kids at this level, since that's likeliest. */
2274 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2275 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
2276 kCOP->cop_label && strEQ(kCOP->cop_label, label))
2279 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2280 if (kid == PL_lastgotoprobe)
2282 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2285 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2286 ops[-1]->op_type == OP_DBSTATE)
2291 if ((o = dofindlabel(kid, label, ops, oplimit)))
2304 register PERL_CONTEXT *cx;
2305 #define GOTO_DEPTH 64
2306 OP *enterops[GOTO_DEPTH];
2307 const char *label = NULL;
2308 const bool do_dump = (PL_op->op_type == OP_DUMP);
2309 static const char must_have_label[] = "goto must have label";
2311 if (PL_op->op_flags & OPf_STACKED) {
2312 SV * const sv = POPs;
2314 /* This egregious kludge implements goto &subroutine */
2315 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2317 register PERL_CONTEXT *cx;
2318 CV* cv = (CV*)SvRV(sv);
2325 if (!CvROOT(cv) && !CvXSUB(cv)) {
2326 const GV * const gv = CvGV(cv);
2330 /* autoloaded stub? */
2331 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2333 autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv),
2334 GvNAMELEN(gv), FALSE);
2335 if (autogv && (cv = GvCV(autogv)))
2337 tmpstr = sv_newmortal();
2338 gv_efullname3(tmpstr, gv, NULL);
2339 DIE(aTHX_ "Goto undefined subroutine &%"SVf"",(void*)tmpstr);
2341 DIE(aTHX_ "Goto undefined subroutine");
2344 /* First do some returnish stuff. */
2345 SvREFCNT_inc_simple_void(cv); /* avoid premature free during unwind */
2347 cxix = dopoptosub(cxstack_ix);
2349 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
2350 if (cxix < cxstack_ix)
2354 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2355 if (CxTYPE(cx) == CXt_EVAL) {
2357 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2359 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2361 else if (CxMULTICALL(cx))
2362 DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)");
2363 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs) {
2364 /* put @_ back onto stack */
2365 AV* av = cx->blk_sub.argarray;
2367 items = AvFILLp(av) + 1;
2368 EXTEND(SP, items+1); /* @_ could have been extended. */
2369 Copy(AvARRAY(av), SP + 1, items, SV*);
2370 SvREFCNT_dec(GvAV(PL_defgv));
2371 GvAV(PL_defgv) = cx->blk_sub.savearray;
2373 /* abandon @_ if it got reified */
2378 av_extend(av, items-1);
2380 PAD_SVl(0) = (SV*)(cx->blk_sub.argarray = av);
2383 else if (CvISXSUB(cv)) { /* put GvAV(defgv) back onto stack */
2384 AV* const av = GvAV(PL_defgv);
2385 items = AvFILLp(av) + 1;
2386 EXTEND(SP, items+1); /* @_ could have been extended. */
2387 Copy(AvARRAY(av), SP + 1, items, SV*);
2391 if (CxTYPE(cx) == CXt_SUB &&
2392 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
2393 SvREFCNT_dec(cx->blk_sub.cv);
2394 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2395 LEAVE_SCOPE(oldsave);
2397 /* Now do some callish stuff. */
2399 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2401 OP* const retop = cx->blk_sub.retop;
2406 for (index=0; index<items; index++)
2407 sv_2mortal(SP[-index]);
2410 /* XS subs don't have a CxSUB, so pop it */
2411 POPBLOCK(cx, PL_curpm);
2412 /* Push a mark for the start of arglist */
2415 (void)(*CvXSUB(cv))(aTHX_ cv);
2420 AV* const padlist = CvPADLIST(cv);
2421 if (CxTYPE(cx) == CXt_EVAL) {
2422 PL_in_eval = cx->blk_eval.old_in_eval;
2423 PL_eval_root = cx->blk_eval.old_eval_root;
2424 cx->cx_type = CXt_SUB;
2425 cx->blk_sub.hasargs = 0;
2427 cx->blk_sub.cv = cv;
2428 cx->blk_sub.olddepth = CvDEPTH(cv);
2431 if (CvDEPTH(cv) < 2)
2432 SvREFCNT_inc_simple_void_NN(cv);
2434 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION))
2435 sub_crush_depth(cv);
2436 pad_push(padlist, CvDEPTH(cv));
2439 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
2440 if (cx->blk_sub.hasargs)
2442 AV* const av = (AV*)PAD_SVl(0);
2444 cx->blk_sub.savearray = GvAV(PL_defgv);
2445 GvAV(PL_defgv) = (AV*)SvREFCNT_inc_simple(av);
2446 CX_CURPAD_SAVE(cx->blk_sub);
2447 cx->blk_sub.argarray = av;
2449 if (items >= AvMAX(av) + 1) {
2450 SV **ary = AvALLOC(av);
2451 if (AvARRAY(av) != ary) {
2452 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2453 SvPV_set(av, (char*)ary);
2455 if (items >= AvMAX(av) + 1) {
2456 AvMAX(av) = items - 1;
2457 Renew(ary,items+1,SV*);
2459 SvPV_set(av, (char*)ary);
2463 Copy(mark,AvARRAY(av),items,SV*);
2464 AvFILLp(av) = items - 1;
2465 assert(!AvREAL(av));
2467 /* transfer 'ownership' of refcnts to new @_ */
2477 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
2479 * We do not care about using sv to call CV;
2480 * it's for informational purposes only.
2482 SV * const sv = GvSV(PL_DBsub);
2484 if (PERLDB_SUB_NN) {
2485 const int type = SvTYPE(sv);
2486 if (type < SVt_PVIV && type != SVt_IV)
2487 sv_upgrade(sv, SVt_PVIV);
2489 SvIV_set(sv, PTR2IV(cv)); /* Do it the quickest way */
2491 gv_efullname3(sv, CvGV(cv), NULL);
2494 CV * const gotocv = get_cv("DB::goto", FALSE);
2496 PUSHMARK( PL_stack_sp );
2497 call_sv((SV*)gotocv, G_SCALAR | G_NODEBUG);
2502 RETURNOP(CvSTART(cv));
2506 label = SvPV_nolen_const(sv);
2507 if (!(do_dump || *label))
2508 DIE(aTHX_ must_have_label);
2511 else if (PL_op->op_flags & OPf_SPECIAL) {
2513 DIE(aTHX_ must_have_label);
2516 label = cPVOP->op_pv;
2518 if (label && *label) {
2519 OP *gotoprobe = NULL;
2520 bool leaving_eval = FALSE;
2521 bool in_block = FALSE;
2522 PERL_CONTEXT *last_eval_cx = NULL;
2526 PL_lastgotoprobe = NULL;
2528 for (ix = cxstack_ix; ix >= 0; ix--) {
2530 switch (CxTYPE(cx)) {
2532 leaving_eval = TRUE;
2533 if (!CxTRYBLOCK(cx)) {
2534 gotoprobe = (last_eval_cx ?
2535 last_eval_cx->blk_eval.old_eval_root :
2540 /* else fall through */
2542 gotoprobe = cx->blk_oldcop->op_sibling;
2548 gotoprobe = cx->blk_oldcop->op_sibling;
2551 gotoprobe = PL_main_root;
2554 if (CvDEPTH(cx->blk_sub.cv) && !CxMULTICALL(cx)) {
2555 gotoprobe = CvROOT(cx->blk_sub.cv);
2561 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
2564 DIE(aTHX_ "panic: goto");
2565 gotoprobe = PL_main_root;
2569 retop = dofindlabel(gotoprobe, label,
2570 enterops, enterops + GOTO_DEPTH);
2574 PL_lastgotoprobe = gotoprobe;
2577 DIE(aTHX_ "Can't find label %s", label);
2579 /* if we're leaving an eval, check before we pop any frames
2580 that we're not going to punt, otherwise the error
2583 if (leaving_eval && *enterops && enterops[1]) {
2585 for (i = 1; enterops[i]; i++)
2586 if (enterops[i]->op_type == OP_ENTERITER)
2587 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2590 /* pop unwanted frames */
2592 if (ix < cxstack_ix) {
2599 oldsave = PL_scopestack[PL_scopestack_ix];
2600 LEAVE_SCOPE(oldsave);
2603 /* push wanted frames */
2605 if (*enterops && enterops[1]) {
2606 OP * const oldop = PL_op;
2607 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
2608 for (; enterops[ix]; ix++) {
2609 PL_op = enterops[ix];
2610 /* Eventually we may want to stack the needed arguments
2611 * for each op. For now, we punt on the hard ones. */
2612 if (PL_op->op_type == OP_ENTERITER)
2613 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2614 CALL_FPTR(PL_op->op_ppaddr)(aTHX);
2622 if (!retop) retop = PL_main_start;
2624 PL_restartop = retop;
2625 PL_do_undump = TRUE;
2629 PL_restartop = 0; /* hmm, must be GNU unexec().. */
2630 PL_do_undump = FALSE;
2647 if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
2649 VMSISH_HUSHED = VMSISH_HUSHED || (PL_op->op_private & OPpHUSH_VMSISH);
2652 PL_exit_flags |= PERL_EXIT_EXPECTED;
2654 /* KLUDGE: disable exit 0 in BEGIN blocks when we're just compiling */
2655 if (anum || !(PL_minus_c && PL_madskills))
2660 PUSHs(&PL_sv_undef);
2667 S_save_lines(pTHX_ AV *array, SV *sv)
2669 const char *s = SvPVX_const(sv);
2670 const char * const send = SvPVX_const(sv) + SvCUR(sv);
2673 while (s && s < send) {
2675 SV * const tmpstr = newSV(0);
2677 sv_upgrade(tmpstr, SVt_PVMG);
2678 t = strchr(s, '\n');
2684 sv_setpvn(tmpstr, s, t - s);
2685 av_store(array, line++, tmpstr);
2691 S_docatch_body(pTHX)
2699 S_docatch(pTHX_ OP *o)
2703 OP * const oldop = PL_op;
2707 assert(CATCH_GET == TRUE);
2714 assert(cxstack_ix >= 0);
2715 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2716 cxstack[cxstack_ix].blk_eval.cur_top_env = PL_top_env;
2721 /* die caught by an inner eval - continue inner loop */
2723 /* NB XXX we rely on the old popped CxEVAL still being at the top
2724 * of the stack; the way die_where() currently works, this
2725 * assumption is valid. In theory The cur_top_env value should be
2726 * returned in another global, the way retop (aka PL_restartop)
2728 assert(CxTYPE(&cxstack[cxstack_ix+1]) == CXt_EVAL);
2731 && cxstack[cxstack_ix+1].blk_eval.cur_top_env == PL_top_env)
2733 PL_op = PL_restartop;
2750 Perl_sv_compile_2op(pTHX_ SV *sv, OP** startop, const char *code, PAD** padp)
2751 /* sv Text to convert to OP tree. */
2752 /* startop op_free() this to undo. */
2753 /* code Short string id of the caller. */
2755 /* FIXME - how much of this code is common with pp_entereval? */
2756 dVAR; dSP; /* Make POPBLOCK work. */
2763 char tbuf[TYPE_DIGITS(long) + 12 + 10];
2764 char *tmpbuf = tbuf;
2767 CV* runcv = NULL; /* initialise to avoid compiler warnings */
2773 /* switch to eval mode */
2775 if (IN_PERL_COMPILETIME) {
2776 SAVECOPSTASH_FREE(&PL_compiling);
2777 CopSTASH_set(&PL_compiling, PL_curstash);
2779 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
2780 SV * const sv = sv_newmortal();
2781 Perl_sv_setpvf(aTHX_ sv, "_<(%.10seval %lu)[%s:%"IVdf"]",
2782 code, (unsigned long)++PL_evalseq,
2783 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
2788 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(%.10s_eval %lu)", code,
2789 (unsigned long)++PL_evalseq);
2790 SAVECOPFILE_FREE(&PL_compiling);
2791 CopFILE_set(&PL_compiling, tmpbuf+2);
2792 SAVECOPLINE(&PL_compiling);
2793 CopLINE_set(&PL_compiling, 1);
2794 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
2795 deleting the eval's FILEGV from the stash before gv_check() runs
2796 (i.e. before run-time proper). To work around the coredump that
2797 ensues, we always turn GvMULTI_on for any globals that were
2798 introduced within evals. See force_ident(). GSAR 96-10-12 */
2799 safestr = savepvn(tmpbuf, len);
2800 SAVEDELETE(PL_defstash, safestr, len);
2802 #ifdef OP_IN_REGISTER
2808 /* we get here either during compilation, or via pp_regcomp at runtime */
2809 runtime = IN_PERL_RUNTIME;
2811 runcv = find_runcv(NULL);
2814 PL_op->op_type = OP_ENTEREVAL;
2815 PL_op->op_flags = 0; /* Avoid uninit warning. */
2816 PUSHBLOCK(cx, CXt_EVAL|(IN_PERL_COMPILETIME ? 0 : CXp_REAL), SP);
2817 PUSHEVAL(cx, 0, NULL);
2820 rop = doeval(G_SCALAR, startop, runcv, PL_curcop->cop_seq);
2822 rop = doeval(G_SCALAR, startop, PL_compcv, PL_cop_seqmax);
2823 POPBLOCK(cx,PL_curpm);
2826 (*startop)->op_type = OP_NULL;
2827 (*startop)->op_ppaddr = PL_ppaddr[OP_NULL];
2829 /* XXX DAPM do this properly one year */
2830 *padp = (AV*)SvREFCNT_inc_simple(PL_comppad);
2832 if (IN_PERL_COMPILETIME)
2833 CopHINTS_set(&PL_compiling, PL_hints);
2834 #ifdef OP_IN_REGISTER
2837 PERL_UNUSED_VAR(newsp);
2838 PERL_UNUSED_VAR(optype);
2845 =for apidoc find_runcv
2847 Locate the CV corresponding to the currently executing sub or eval.
2848 If db_seqp is non_null, skip CVs that are in the DB package and populate
2849 *db_seqp with the cop sequence number at the point that the DB:: code was
2850 entered. (allows debuggers to eval in the scope of the breakpoint rather
2851 than in the scope of the debugger itself).
2857 Perl_find_runcv(pTHX_ U32 *db_seqp)
2863 *db_seqp = PL_curcop->cop_seq;
2864 for (si = PL_curstackinfo; si; si = si->si_prev) {
2866 for (ix = si->si_cxix; ix >= 0; ix--) {
2867 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
2868 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
2869 CV * const cv = cx->blk_sub.cv;
2870 /* skip DB:: code */
2871 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
2872 *db_seqp = cx->blk_oldcop->cop_seq;
2877 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
2885 /* Compile a require/do, an eval '', or a /(?{...})/.
2886 * In the last case, startop is non-null, and contains the address of
2887 * a pointer that should be set to the just-compiled code.
2888 * outside is the lexically enclosing CV (if any) that invoked us.
2891 /* With USE_5005THREADS, eval_owner must be held on entry to doeval */
2893 S_doeval(pTHX_ int gimme, OP** startop, CV* outside, U32 seq)
2896 OP * const saveop = PL_op;
2898 PL_in_eval = ((saveop && saveop->op_type == OP_REQUIRE)
2899 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
2904 SAVESPTR(PL_compcv);
2905 PL_compcv = (CV*)newSV(0);
2906 sv_upgrade((SV *)PL_compcv, SVt_PVCV);
2907 CvEVAL_on(PL_compcv);
2908 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2909 cxstack[cxstack_ix].blk_eval.cv = PL_compcv;
2911 CvOUTSIDE_SEQ(PL_compcv) = seq;
2912 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc_simple(outside);
2914 /* set up a scratch pad */
2916 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE);
2917 PL_op = NULL; /* avoid PL_op and PL_curpad referring to different CVs */
2921 SAVEMORTALIZESV(PL_compcv); /* must remain until end of current statement */
2923 /* make sure we compile in the right package */
2925 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
2926 SAVESPTR(PL_curstash);
2927 PL_curstash = CopSTASH(PL_curcop);
2929 /* XXX:ajgo do we really need to alloc an AV for begin/checkunit */
2930 SAVESPTR(PL_beginav);
2931 PL_beginav = newAV();
2932 SAVEFREESV(PL_beginav);
2933 SAVESPTR(PL_unitcheckav);
2934 PL_unitcheckav = newAV();
2935 SAVEFREESV(PL_unitcheckav);
2936 SAVEI32(PL_error_count);
2939 SAVEI32(PL_madskills);
2943 /* try to compile it */
2945 PL_eval_root = NULL;
2947 PL_curcop = &PL_compiling;
2948 CopARYBASE_set(PL_curcop, 0);
2949 if (saveop && (saveop->op_type != OP_REQUIRE) && (saveop->op_flags & OPf_SPECIAL))
2950 PL_in_eval |= EVAL_KEEPERR;
2952 sv_setpvn(ERRSV,"",0);
2953 if (yyparse() || PL_error_count || !PL_eval_root) {
2954 SV **newsp; /* Used by POPBLOCK. */
2955 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
2956 I32 optype = 0; /* Might be reset by POPEVAL. */
2961 op_free(PL_eval_root);
2962 PL_eval_root = NULL;
2964 SP = PL_stack_base + POPMARK; /* pop original mark */
2966 POPBLOCK(cx,PL_curpm);
2972 msg = SvPVx_nolen_const(ERRSV);
2973 if (optype == OP_REQUIRE) {
2974 const SV * const nsv = cx->blk_eval.old_namesv;
2975 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
2977 DIE(aTHX_ "%sCompilation failed in require",
2978 *msg ? msg : "Unknown error\n");
2981 POPBLOCK(cx,PL_curpm);
2983 Perl_croak(aTHX_ "%sCompilation failed in regexp",
2984 (*msg ? msg : "Unknown error\n"));
2988 sv_setpv(ERRSV, "Compilation error");
2991 PERL_UNUSED_VAR(newsp);
2994 CopLINE_set(&PL_compiling, 0);
2996 *startop = PL_eval_root;
2998 SAVEFREEOP(PL_eval_root);
3000 /* Set the context for this new optree.
3001 * If the last op is an OP_REQUIRE, force scalar context.
3002 * Otherwise, propagate the context from the eval(). */
3003 if (PL_eval_root->op_type == OP_LEAVEEVAL
3004 && cUNOPx(PL_eval_root)->op_first->op_type == OP_LINESEQ
3005 && cLISTOPx(cUNOPx(PL_eval_root)->op_first)->op_last->op_type
3007 scalar(PL_eval_root);
3008 else if (gimme & G_VOID)
3009 scalarvoid(PL_eval_root);
3010 else if (gimme & G_ARRAY)
3013 scalar(PL_eval_root);
3015 DEBUG_x(dump_eval());
3017 /* Register with debugger: */
3018 if (PERLDB_INTER && saveop && saveop->op_type == OP_REQUIRE) {
3019 CV * const cv = get_cv("DB::postponed", FALSE);
3023 XPUSHs((SV*)CopFILEGV(&PL_compiling));
3025 call_sv((SV*)cv, G_DISCARD);
3030 call_list(PL_scopestack_ix, PL_unitcheckav);
3032 /* compiled okay, so do it */
3034 CvDEPTH(PL_compcv) = 1;
3035 SP = PL_stack_base + POPMARK; /* pop original mark */
3036 PL_op = saveop; /* The caller may need it. */
3037 PL_lex_state = LEX_NOTPARSING; /* $^S needs this. */
3039 RETURNOP(PL_eval_start);
3043 S_check_type_and_open(pTHX_ const char *name, const char *mode)
3046 const int st_rc = PerlLIO_stat(name, &st);
3048 if (st_rc < 0 || S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode)) {
3052 return PerlIO_open(name, mode);
3056 S_doopen_pm(pTHX_ const char *name, const char *mode)
3058 #ifndef PERL_DISABLE_PMC
3059 const STRLEN namelen = strlen(name);
3062 if (namelen > 3 && strEQ(name + namelen - 3, ".pm")) {
3063 SV * const pmcsv = Perl_newSVpvf(aTHX_ "%s%c", name, 'c');
3064 const char * const pmc = SvPV_nolen_const(pmcsv);
3066 if (PerlLIO_stat(pmc, &pmcstat) < 0) {
3067 fp = check_type_and_open(name, mode);
3070 fp = check_type_and_open(pmc, mode);
3072 SvREFCNT_dec(pmcsv);
3075 fp = check_type_and_open(name, mode);
3079 return check_type_and_open(name, mode);
3080 #endif /* !PERL_DISABLE_PMC */
3086 register PERL_CONTEXT *cx;
3090 const char *tryname = NULL;
3092 const I32 gimme = GIMME_V;
3093 int filter_has_file = 0;
3094 PerlIO *tryrsfp = NULL;
3095 SV *filter_cache = NULL;
3096 SV *filter_state = NULL;
3097 SV *filter_sub = NULL;
3103 if ( (SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) {
3104 if ( SvVOK(sv) && ckWARN(WARN_PORTABLE) ) /* require v5.6.1 */
3105 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
3106 "v-string in use/require non-portable");
3108 sv = new_version(sv);
3109 if (!sv_derived_from(PL_patchlevel, "version"))
3110 upg_version(PL_patchlevel);
3111 if (cUNOP->op_first->op_type == OP_CONST && cUNOP->op_first->op_private & OPpCONST_NOVER) {
3112 if ( vcmp(sv,PL_patchlevel) <= 0 )
3113 DIE(aTHX_ "Perls since %"SVf" too modern--this is %"SVf", stopped",
3114 (void*)vnormal(sv), (void*)vnormal(PL_patchlevel));
3117 if ( vcmp(sv,PL_patchlevel) > 0 )
3118 DIE(aTHX_ "Perl %"SVf" required--this is only %"SVf", stopped",
3119 (void*)vnormal(sv), (void*)vnormal(PL_patchlevel));
3124 name = SvPV_const(sv, len);
3125 if (!(name && len > 0 && *name))
3126 DIE(aTHX_ "Null filename used");
3127 TAINT_PROPER("require");
3128 if (PL_op->op_type == OP_REQUIRE) {
3129 SV * const * const svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3131 if (*svp != &PL_sv_undef)
3134 DIE(aTHX_ "Compilation failed in require");
3138 /* prepare to compile file */
3140 if (path_is_absolute(name)) {
3142 tryrsfp = doopen_pm(name,PERL_SCRIPT_MODE);
3144 #ifdef MACOS_TRADITIONAL
3148 MacPerl_CanonDir(name, newname, 1);
3149 if (path_is_absolute(newname)) {
3151 tryrsfp = doopen_pm(newname,PERL_SCRIPT_MODE);
3156 AV * const ar = GvAVn(PL_incgv);
3160 if ((unixname = tounixspec(name, NULL)) != NULL)
3164 for (i = 0; i <= AvFILL(ar); i++) {
3165 SV * const dirsv = *av_fetch(ar, i, TRUE);
3171 if (SvTYPE(SvRV(loader)) == SVt_PVAV
3172 && !sv_isobject(loader))
3174 loader = *av_fetch((AV *)SvRV(loader), 0, TRUE);
3177 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
3178 PTR2UV(SvRV(dirsv)), name);
3179 tryname = SvPVX_const(namesv);
3190 if (sv_isobject(loader))
3191 count = call_method("INC", G_ARRAY);
3193 count = call_sv(loader, G_ARRAY);
3203 if (SvROK(arg) && (SvTYPE(SvRV(arg)) <= SVt_PVLV)
3204 && !isGV_with_GP(SvRV(arg))) {
3205 filter_cache = SvRV(arg);
3206 SvREFCNT_inc_simple_void_NN(filter_cache);
3213 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVGV) {
3217 if (SvTYPE(arg) == SVt_PVGV) {
3218 IO * const io = GvIO((GV *)arg);
3223 tryrsfp = IoIFP(io);
3224 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3225 PerlIO_close(IoOFP(io));
3236 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3238 SvREFCNT_inc_simple_void_NN(filter_sub);
3241 filter_state = SP[i];
3242 SvREFCNT_inc_simple_void(filter_state);
3246 if (!tryrsfp && (filter_cache || filter_sub)) {
3247 tryrsfp = PerlIO_open(BIT_BUCKET,
3262 filter_has_file = 0;
3264 SvREFCNT_dec(filter_cache);
3265 filter_cache = NULL;
3268 SvREFCNT_dec(filter_state);
3269 filter_state = NULL;
3272 SvREFCNT_dec(filter_sub);
3277 if (!path_is_absolute(name)
3278 #ifdef MACOS_TRADITIONAL
3279 /* We consider paths of the form :a:b ambiguous and interpret them first
3280 as global then as local
3282 || (*name == ':' && name[1] != ':' && strchr(name+2, ':'))
3285 const char *dir = SvPVx_nolen_const(dirsv);
3286 #ifdef MACOS_TRADITIONAL
3290 MacPerl_CanonDir(name, buf2, 1);
3291 Perl_sv_setpvf(aTHX_ namesv, "%s%s", MacPerl_CanonDir(dir, buf1, 0), buf2+(buf2[0] == ':'));
3295 if ((unixdir = tounixpath(dir, NULL)) == NULL)
3297 sv_setpv(namesv, unixdir);
3298 sv_catpv(namesv, unixname);
3300 # ifdef __SYMBIAN32__
3301 if (PL_origfilename[0] &&
3302 PL_origfilename[1] == ':' &&
3303 !(dir[0] && dir[1] == ':'))
3304 Perl_sv_setpvf(aTHX_ namesv,
3309 Perl_sv_setpvf(aTHX_ namesv,
3313 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
3317 TAINT_PROPER("require");
3318 tryname = SvPVX_const(namesv);
3319 tryrsfp = doopen_pm(tryname, PERL_SCRIPT_MODE);
3321 if (tryname[0] == '.' && tryname[1] == '/')
3325 else if (errno == EMFILE)
3326 /* no point in trying other paths if out of handles */
3333 SAVECOPFILE_FREE(&PL_compiling);
3334 CopFILE_set(&PL_compiling, tryrsfp ? tryname : name);
3335 SvREFCNT_dec(namesv);
3337 if (PL_op->op_type == OP_REQUIRE) {
3338 const char *msgstr = name;
3339 if(errno == EMFILE) {
3341 = sv_2mortal(Perl_newSVpvf(aTHX_ "%s: %s", msgstr,
3343 msgstr = SvPV_nolen_const(msg);
3345 if (namesv) { /* did we lookup @INC? */
3346 AV * const ar = GvAVn(PL_incgv);
3348 SV * const msg = sv_2mortal(Perl_newSVpvf(aTHX_
3349 "%s in @INC%s%s (@INC contains:",
3351 (instr(msgstr, ".h ")
3352 ? " (change .h to .ph maybe?)" : ""),
3353 (instr(msgstr, ".ph ")
3354 ? " (did you run h2ph?)" : "")
3357 for (i = 0; i <= AvFILL(ar); i++) {
3358 sv_catpvs(msg, " ");
3359 sv_catsv(msg, *av_fetch(ar, i, TRUE));
3361 sv_catpvs(msg, ")");
3362 msgstr = SvPV_nolen_const(msg);
3365 DIE(aTHX_ "Can't locate %s", msgstr);
3371 SETERRNO(0, SS_NORMAL);
3373 /* Assume success here to prevent recursive requirement. */
3374 /* name is never assigned to again, so len is still strlen(name) */
3375 /* Check whether a hook in @INC has already filled %INC */
3377 (void)hv_store(GvHVn(PL_incgv), name, len, newSVpv(CopFILE(&PL_compiling),0),0);
3379 SV** const svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3381 (void)hv_store(GvHVn(PL_incgv), name, len, SvREFCNT_inc_simple(hook_sv), 0 );
3386 lex_start(sv_2mortal(newSVpvs("")));
3387 SAVEGENERICSV(PL_rsfp_filters);
3388 PL_rsfp_filters = NULL;
3393 SAVECOMPILEWARNINGS();
3394 if (PL_dowarn & G_WARN_ALL_ON)
3395 PL_compiling.cop_warnings = pWARN_ALL ;
3396 else if (PL_dowarn & G_WARN_ALL_OFF)
3397 PL_compiling.cop_warnings = pWARN_NONE ;
3398 else if (PL_taint_warn) {
3399 PL_compiling.cop_warnings
3400 = Perl_new_warnings_bitfield(aTHX_ NULL, WARN_TAINTstring, WARNsize);
3403 PL_compiling.cop_warnings = pWARN_STD ;
3405 if (filter_sub || filter_cache) {
3406 SV * const datasv = filter_add(S_run_user_filter, NULL);
3407 IoLINES(datasv) = filter_has_file;
3408 IoTOP_GV(datasv) = (GV *)filter_state;
3409 IoBOTTOM_GV(datasv) = (GV *)filter_sub;
3410 IoFMT_GV(datasv) = (GV *)filter_cache;
3413 /* switch to eval mode */
3414 PUSHBLOCK(cx, CXt_EVAL, SP);
3415 PUSHEVAL(cx, name, NULL);
3416 cx->blk_eval.retop = PL_op->op_next;
3418 SAVECOPLINE(&PL_compiling);
3419 CopLINE_set(&PL_compiling, 0);
3423 /* Store and reset encoding. */
3424 encoding = PL_encoding;
3427 op = DOCATCH(doeval(gimme, NULL, NULL, PL_curcop->cop_seq));
3429 /* Restore encoding. */
3430 PL_encoding = encoding;
3438 register PERL_CONTEXT *cx;
3440 const I32 gimme = GIMME_V;
3441 const I32 was = PL_sub_generation;
3442 char tbuf[TYPE_DIGITS(long) + 12];
3443 char *tmpbuf = tbuf;
3449 HV *saved_hh = NULL;
3450 const char * const fakestr = "_<(eval )";
3451 const int fakelen = 9 + 1;
3453 if (PL_op->op_private & OPpEVAL_HAS_HH) {
3454 saved_hh = (HV*) SvREFCNT_inc(POPs);
3458 if (!SvPV_nolen_const(sv))
3460 TAINT_PROPER("eval");
3466 /* switch to eval mode */
3468 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
3469 SV * const temp_sv = sv_newmortal();
3470 Perl_sv_setpvf(aTHX_ temp_sv, "_<(eval %lu)[%s:%"IVdf"]",
3471 (unsigned long)++PL_evalseq,
3472 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
3473 tmpbuf = SvPVX(temp_sv);
3474 len = SvCUR(temp_sv);
3477 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(eval %lu)", (unsigned long)++PL_evalseq);
3478 SAVECOPFILE_FREE(&PL_compiling);
3479 CopFILE_set(&PL_compiling, tmpbuf+2);
3480 SAVECOPLINE(&PL_compiling);
3481 CopLINE_set(&PL_compiling, 1);
3482 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
3483 deleting the eval's FILEGV from the stash before gv_check() runs
3484 (i.e. before run-time proper). To work around the coredump that
3485 ensues, we always turn GvMULTI_on for any globals that were
3486 introduced within evals. See force_ident(). GSAR 96-10-12 */
3487 safestr = savepvn(tmpbuf, len);
3488 SAVEDELETE(PL_defstash, safestr, len);
3490 PL_hints = PL_op->op_targ;
3492 GvHV(PL_hintgv) = saved_hh;
3493 SAVECOMPILEWARNINGS();
3494 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
3495 if (PL_compiling.cop_hints_hash) {
3496 Perl_refcounted_he_free(aTHX_ PL_compiling.cop_hints_hash);
3498 PL_compiling.cop_hints_hash = PL_curcop->cop_hints_hash;
3499 if (PL_compiling.cop_hints_hash) {
3501 PL_compiling.cop_hints_hash->refcounted_he_refcnt++;
3502 HINTS_REFCNT_UNLOCK;
3504 /* special case: an eval '' executed within the DB package gets lexically
3505 * placed in the first non-DB CV rather than the current CV - this
3506 * allows the debugger to execute code, find lexicals etc, in the
3507 * scope of the code being debugged. Passing &seq gets find_runcv
3508 * to do the dirty work for us */
3509 runcv = find_runcv(&seq);
3511 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
3512 PUSHEVAL(cx, 0, NULL);
3513 cx->blk_eval.retop = PL_op->op_next;
3515 /* prepare to compile string */
3517 if (PERLDB_LINE && PL_curstash != PL_debstash)
3518 save_lines(CopFILEAV(&PL_compiling), PL_linestr);
3520 ret = doeval(gimme, NULL, runcv, seq);
3521 if (PERLDB_INTER && was != (I32)PL_sub_generation /* Some subs defined here. */
3522 && ret != PL_op->op_next) { /* Successive compilation. */
3523 /* Copy in anything fake and short. */
3524 my_strlcpy(safestr, fakestr, fakelen);
3526 return DOCATCH(ret);
3536 register PERL_CONTEXT *cx;
3538 const U8 save_flags = PL_op -> op_flags;
3543 retop = cx->blk_eval.retop;
3546 if (gimme == G_VOID)
3548 else if (gimme == G_SCALAR) {
3551 if (SvFLAGS(TOPs) & SVs_TEMP)
3554 *MARK = sv_mortalcopy(TOPs);
3558 *MARK = &PL_sv_undef;
3563 /* in case LEAVE wipes old return values */
3564 for (mark = newsp + 1; mark <= SP; mark++) {
3565 if (!(SvFLAGS(*mark) & SVs_TEMP)) {
3566 *mark = sv_mortalcopy(*mark);
3567 TAINT_NOT; /* Each item is independent */
3571 PL_curpm = newpm; /* Don't pop $1 et al till now */
3574 assert(CvDEPTH(PL_compcv) == 1);
3576 CvDEPTH(PL_compcv) = 0;
3579 if (optype == OP_REQUIRE &&
3580 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
3582 /* Unassume the success we assumed earlier. */
3583 SV * const nsv = cx->blk_eval.old_namesv;
3584 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
3585 retop = Perl_die(aTHX_ "%"SVf" did not return a true value", (void*)nsv);
3586 /* die_where() did LEAVE, or we won't be here */
3590 if (!(save_flags & OPf_SPECIAL))
3591 sv_setpvn(ERRSV,"",0);
3597 /* Common code for Perl_call_sv and Perl_fold_constants, put here to keep it
3598 close to the related Perl_create_eval_scope. */
3600 Perl_delete_eval_scope(pTHX)
3605 register PERL_CONTEXT *cx;
3612 PERL_UNUSED_VAR(newsp);
3613 PERL_UNUSED_VAR(gimme);
3614 PERL_UNUSED_VAR(optype);
3617 /* Common-ish code salvaged from Perl_call_sv and pp_entertry, because it was
3618 also needed by Perl_fold_constants. */
3620 Perl_create_eval_scope(pTHX_ U32 flags)
3623 const I32 gimme = GIMME_V;
3628 PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), PL_stack_sp);
3630 PL_eval_root = PL_op; /* Only needed so that goto works right. */
3632 PL_in_eval = EVAL_INEVAL;
3633 if (flags & G_KEEPERR)
3634 PL_in_eval |= EVAL_KEEPERR;
3636 sv_setpvn(ERRSV,"",0);
3637 if (flags & G_FAKINGEVAL) {
3638 PL_eval_root = PL_op; /* Only needed so that goto works right. */
3646 PERL_CONTEXT * const cx = create_eval_scope(0);
3647 cx->blk_eval.retop = cLOGOP->op_other->op_next;
3648 return DOCATCH(PL_op->op_next);
3657 register PERL_CONTEXT *cx;
3662 PERL_UNUSED_VAR(optype);
3665 if (gimme == G_VOID)
3667 else if (gimme == G_SCALAR) {
3671 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
3674 *MARK = sv_mortalcopy(TOPs);
3678 *MARK = &PL_sv_undef;
3683 /* in case LEAVE wipes old return values */
3685 for (mark = newsp + 1; mark <= SP; mark++) {
3686 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
3687 *mark = sv_mortalcopy(*mark);
3688 TAINT_NOT; /* Each item is independent */
3692 PL_curpm = newpm; /* Don't pop $1 et al till now */
3695 sv_setpvn(ERRSV,"",0);
3702 register PERL_CONTEXT *cx;
3703 const I32 gimme = GIMME_V;
3708 if (PL_op->op_targ == 0) {
3709 SV ** const defsv_p = &GvSV(PL_defgv);
3710 *defsv_p = newSVsv(POPs);
3711 SAVECLEARSV(*defsv_p);
3714 sv_setsv(PAD_SV(PL_op->op_targ), POPs);
3716 PUSHBLOCK(cx, CXt_GIVEN, SP);
3725 register PERL_CONTEXT *cx;
3729 PERL_UNUSED_CONTEXT;
3732 assert(CxTYPE(cx) == CXt_GIVEN);
3737 PL_curpm = newpm; /* pop $1 et al */
3744 /* Helper routines used by pp_smartmatch */
3747 S_make_matcher(pTHX_ regexp *re)
3750 PMOP *matcher = (PMOP *) newPMOP(OP_MATCH, OPf_WANT_SCALAR | OPf_STACKED);
3751 PM_SETRE(matcher, ReREFCNT_inc(re));
3753 SAVEFREEOP((OP *) matcher);
3761 S_matcher_matches_sv(pTHX_ PMOP *matcher, SV *sv)
3766 PL_op = (OP *) matcher;
3771 return (SvTRUEx(POPs));
3776 S_destroy_matcher(pTHX_ PMOP *matcher)
3779 PERL_UNUSED_ARG(matcher);
3784 /* Do a smart match */
3787 return do_smartmatch(NULL, NULL);
3790 /* This version of do_smartmatch() implements the
3791 * table of smart matches that is found in perlsyn.
3795 S_do_smartmatch(pTHX_ HV *seen_this, HV *seen_other)
3800 SV *e = TOPs; /* e is for 'expression' */
3801 SV *d = TOPm1s; /* d is for 'default', as in PL_defgv */
3802 SV *This, *Other; /* 'This' (and Other to match) to play with C++ */
3804 regexp *this_regex, *other_regex;
3806 # define NOT_EMPTY_PROTO(cv) (!SvPOK(cv) || SvCUR(cv) == 0)
3808 # define SM_REF(type) ( \
3809 (SvROK(d) && (SvTYPE(This = SvRV(d)) == SVt_##type) && (Other = e)) \
3810 || (SvROK(e) && (SvTYPE(This = SvRV(e)) == SVt_##type) && (Other = d)))
3812 # define SM_CV_NEP /* Find a code ref without an empty prototype */ \
3813 ((SvROK(d) && (SvTYPE(This = SvRV(d)) == SVt_PVCV) \
3814 && NOT_EMPTY_PROTO(This) && (Other = e)) \
3815 || (SvROK(e) && (SvTYPE(This = SvRV(e)) == SVt_PVCV) \
3816 && NOT_EMPTY_PROTO(This) && (Other = d)))
3818 # define SM_REGEX ( \
3819 (SvROK(d) && SvMAGICAL(This = SvRV(d)) \
3820 && (mg = mg_find(This, PERL_MAGIC_qr)) \
3821 && (this_regex = (regexp *)mg->mg_obj) \
3824 (SvROK(e) && SvMAGICAL(This = SvRV(e)) \
3825 && (mg = mg_find(This, PERL_MAGIC_qr)) \
3826 && (this_regex = (regexp *)mg->mg_obj) \
3830 # define SM_OTHER_REF(type) \
3831 (SvROK(Other) && SvTYPE(SvRV(Other)) == SVt_##type)
3833 # define SM_OTHER_REGEX (SvROK(Other) && SvMAGICAL(SvRV(Other)) \
3834 && (mg = mg_find(SvRV(Other), PERL_MAGIC_qr)) \
3835 && (other_regex = (regexp *)mg->mg_obj))
3838 # define SM_SEEN_THIS(sv) hv_exists_ent(seen_this, \
3839 sv_2mortal(newSViv(PTR2IV(sv))), 0)
3841 # define SM_SEEN_OTHER(sv) hv_exists_ent(seen_other, \
3842 sv_2mortal(newSViv(PTR2IV(sv))), 0)
3844 tryAMAGICbinSET(smart, 0);
3846 SP -= 2; /* Pop the values */
3848 /* Take care only to invoke mg_get() once for each argument.
3849 * Currently we do this by copying the SV if it's magical. */
3852 d = sv_mortalcopy(d);
3859 e = sv_mortalcopy(e);
3864 if ( SM_OTHER_REF(PVCV) && NOT_EMPTY_PROTO(SvRV(Other)) )
3866 if (This == SvRV(Other))
3877 c = call_sv(This, G_SCALAR);
3881 else if (SvTEMP(TOPs))
3882 SvREFCNT_inc_void(TOPs);
3887 else if (SM_REF(PVHV)) {
3888 if (SM_OTHER_REF(PVHV)) {
3889 /* Check that the key-sets are identical */
3891 HV *other_hv = (HV *) SvRV(Other);
3893 bool other_tied = FALSE;
3894 U32 this_key_count = 0,
3895 other_key_count = 0;
3897 /* Tied hashes don't know how many keys they have. */
3898 if (SvTIED_mg(This, PERL_MAGIC_tied)) {
3901 else if (SvTIED_mg((SV *) other_hv, PERL_MAGIC_tied)) {
3902 HV * const temp = other_hv;
3903 other_hv = (HV *) This;
3907 if (SvTIED_mg((SV *) other_hv, PERL_MAGIC_tied))
3910 if (!tied && HvUSEDKEYS((HV *) This) != HvUSEDKEYS(other_hv))
3913 /* The hashes have the same number of keys, so it suffices
3914 to check that one is a subset of the other. */
3915 (void) hv_iterinit((HV *) This);
3916 while ( (he = hv_iternext((HV *) This)) ) {
3918 char * const key = hv_iterkey(he, &key_len);
3922 if(!hv_exists(other_hv, key, key_len)) {
3923 (void) hv_iterinit((HV *) This); /* reset iterator */
3929 (void) hv_iterinit(other_hv);
3930 while ( hv_iternext(other_hv) )
3934 other_key_count = HvUSEDKEYS(other_hv);
3936 if (this_key_count != other_key_count)
3941 else if (SM_OTHER_REF(PVAV)) {
3942 AV * const other_av = (AV *) SvRV(Other);
3943 const I32 other_len = av_len(other_av) + 1;
3946 if (HvUSEDKEYS((HV *) This) != other_len)
3949 for(i = 0; i < other_len; ++i) {
3950 SV ** const svp = av_fetch(other_av, i, FALSE);
3954 if (!svp) /* ??? When can this happen? */
3957 key = SvPV(*svp, key_len);
3958 if(!hv_exists((HV *) This, key, key_len))
3963 else if (SM_OTHER_REGEX) {
3964 PMOP * const matcher = make_matcher(other_regex);
3967 (void) hv_iterinit((HV *) This);
3968 while ( (he = hv_iternext((HV *) This)) ) {
3969 if (matcher_matches_sv(matcher, hv_iterkeysv(he))) {
3970 (void) hv_iterinit((HV *) This);
3971 destroy_matcher(matcher);
3975 destroy_matcher(matcher);
3979 if (hv_exists_ent((HV *) This, Other, 0))
3985 else if (SM_REF(PVAV)) {
3986 if (SM_OTHER_REF(PVAV)) {
3987 AV *other_av = (AV *) SvRV(Other);
3988 if (av_len((AV *) This) != av_len(other_av))
3992 const I32 other_len = av_len(other_av);
3994 if (NULL == seen_this) {
3995 seen_this = newHV();
3996 (void) sv_2mortal((SV *) seen_this);
3998 if (NULL == seen_other) {
3999 seen_this = newHV();
4000 (void) sv_2mortal((SV *) seen_other);
4002 for(i = 0; i <= other_len; ++i) {
4003 SV * const * const this_elem = av_fetch((AV *)This, i, FALSE);
4004 SV * const * const other_elem = av_fetch(other_av, i, FALSE);
4006 if (!this_elem || !other_elem) {
4007 if (this_elem || other_elem)
4010 else if (SM_SEEN_THIS(*this_elem)
4011 || SM_SEEN_OTHER(*other_elem))
4013 if (*this_elem != *other_elem)
4017 hv_store_ent(seen_this,
4018 sv_2mortal(newSViv(PTR2IV(*this_elem))),
4020 hv_store_ent(seen_other,
4021 sv_2mortal(newSViv(PTR2IV(*other_elem))),
4027 (void) do_smartmatch(seen_this, seen_other);
4037 else if (SM_OTHER_REGEX) {
4038 PMOP * const matcher = make_matcher(other_regex);
4039 const I32 this_len = av_len((AV *) This);
4042 for(i = 0; i <= this_len; ++i) {
4043 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4044 if (svp && matcher_matches_sv(matcher, *svp)) {
4045 destroy_matcher(matcher);
4049 destroy_matcher(matcher);
4052 else if (SvIOK(Other) || SvNOK(Other)) {
4055 for(i = 0; i <= AvFILL((AV *) This); ++i) {
4056 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4063 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
4073 else if (SvPOK(Other)) {
4074 const I32 this_len = av_len((AV *) This);
4077 for(i = 0; i <= this_len; ++i) {
4078 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4093 else if (!SvOK(d) || !SvOK(e)) {
4094 if (!SvOK(d) && !SvOK(e))
4099 else if (SM_REGEX) {
4100 PMOP * const matcher = make_matcher(this_regex);
4103 PUSHs(matcher_matches_sv(matcher, Other)
4106 destroy_matcher(matcher);
4109 else if (SM_REF(PVCV)) {
4111 /* This must be a null-prototyped sub, because we
4112 already checked for the other kind. */
4118 c = call_sv(This, G_SCALAR);
4121 PUSHs(&PL_sv_undef);
4122 else if (SvTEMP(TOPs))
4123 SvREFCNT_inc_void(TOPs);
4125 if (SM_OTHER_REF(PVCV)) {
4126 /* This one has to be null-proto'd too.
4127 Call both of 'em, and compare the results */
4129 c = call_sv(SvRV(Other), G_SCALAR);
4132 PUSHs(&PL_sv_undef);
4133 else if (SvTEMP(TOPs))
4134 SvREFCNT_inc_void(TOPs);
4145 else if ( ((SvIOK(d) || SvNOK(d)) && (This = d) && (Other = e))
4146 || ((SvIOK(e) || SvNOK(e)) && (This = e) && (Other = d)) )
4148 if (SvPOK(Other) && !looks_like_number(Other)) {
4149 /* String comparison */
4154 /* Otherwise, numeric comparison */
4157 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
4168 /* As a last resort, use string comparison */
4177 register PERL_CONTEXT *cx;
4178 const I32 gimme = GIMME_V;
4180 /* This is essentially an optimization: if the match
4181 fails, we don't want to push a context and then
4182 pop it again right away, so we skip straight
4183 to the op that follows the leavewhen.
4185 if ((0 == (PL_op->op_flags & OPf_SPECIAL)) && !SvTRUEx(POPs))
4186 return cLOGOP->op_other->op_next;
4191 PUSHBLOCK(cx, CXt_WHEN, SP);
4200 register PERL_CONTEXT *cx;
4206 assert(CxTYPE(cx) == CXt_WHEN);
4211 PL_curpm = newpm; /* pop $1 et al */
4221 register PERL_CONTEXT *cx;
4224 cxix = dopoptowhen(cxstack_ix);
4226 DIE(aTHX_ "Can't \"continue\" outside a when block");
4227 if (cxix < cxstack_ix)
4230 /* clear off anything above the scope we're re-entering */
4231 inner = PL_scopestack_ix;
4233 if (PL_scopestack_ix < inner)
4234 leave_scope(PL_scopestack[PL_scopestack_ix]);
4235 PL_curcop = cx->blk_oldcop;
4236 return cx->blk_givwhen.leave_op;
4243 register PERL_CONTEXT *cx;
4246 cxix = dopoptogiven(cxstack_ix);
4248 if (PL_op->op_flags & OPf_SPECIAL)
4249 DIE(aTHX_ "Can't use when() outside a topicalizer");
4251 DIE(aTHX_ "Can't \"break\" outside a given block");
4253 if (CxFOREACH(&cxstack[cxix]) && (0 == (PL_op->op_flags & OPf_SPECIAL)))
4254 DIE(aTHX_ "Can't \"break\" in a loop topicalizer");
4256 if (cxix < cxstack_ix)
4259 /* clear off anything above the scope we're re-entering */
4260 inner = PL_scopestack_ix;
4262 if (PL_scopestack_ix < inner)
4263 leave_scope(PL_scopestack[PL_scopestack_ix]);
4264 PL_curcop = cx->blk_oldcop;
4267 return CX_LOOP_NEXTOP_GET(cx);
4269 return cx->blk_givwhen.leave_op;
4273 S_doparseform(pTHX_ SV *sv)
4276 register char *s = SvPV_force(sv, len);
4277 register char * const send = s + len;
4278 register char *base = NULL;
4279 register I32 skipspaces = 0;
4280 bool noblank = FALSE;
4281 bool repeat = FALSE;
4282 bool postspace = FALSE;
4288 bool unchopnum = FALSE;
4289 int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */
4292 Perl_croak(aTHX_ "Null picture in formline");
4294 /* estimate the buffer size needed */
4295 for (base = s; s <= send; s++) {
4296 if (*s == '\n' || *s == '@' || *s == '^')
4302 Newx(fops, maxops, U32);
4307 *fpc++ = FF_LINEMARK;
4308 noblank = repeat = FALSE;
4326 case ' ': case '\t':
4333 } /* else FALL THROUGH */
4341 *fpc++ = FF_LITERAL;
4349 *fpc++ = (U16)skipspaces;
4353 *fpc++ = FF_NEWLINE;
4357 arg = fpc - linepc + 1;
4364 *fpc++ = FF_LINEMARK;
4365 noblank = repeat = FALSE;
4374 ischop = s[-1] == '^';
4380 arg = (s - base) - 1;
4382 *fpc++ = FF_LITERAL;
4390 *fpc++ = 2; /* skip the @* or ^* */
4392 *fpc++ = FF_LINESNGL;
4395 *fpc++ = FF_LINEGLOB;
4397 else if (*s == '#' || (*s == '.' && s[1] == '#')) {
4398 arg = ischop ? 512 : 0;
4403 const char * const f = ++s;
4406 arg |= 256 + (s - f);
4408 *fpc++ = s - base; /* fieldsize for FETCH */
4409 *fpc++ = FF_DECIMAL;
4411 unchopnum |= ! ischop;
4413 else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
4414 arg = ischop ? 512 : 0;
4416 s++; /* skip the '0' first */
4420 const char * const f = ++s;
4423 arg |= 256 + (s - f);
4425 *fpc++ = s - base; /* fieldsize for FETCH */
4426 *fpc++ = FF_0DECIMAL;
4428 unchopnum |= ! ischop;
4432 bool ismore = FALSE;
4435 while (*++s == '>') ;
4436 prespace = FF_SPACE;
4438 else if (*s == '|') {
4439 while (*++s == '|') ;
4440 prespace = FF_HALFSPACE;
4445 while (*++s == '<') ;
4448 if (*s == '.' && s[1] == '.' && s[2] == '.') {
4452 *fpc++ = s - base; /* fieldsize for FETCH */
4454 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
4457 *fpc++ = (U16)prespace;
4471 assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */
4473 { /* need to jump to the next word */
4475 z = WORD_ALIGN - SvCUR(sv) % WORD_ALIGN;
4476 SvGROW(sv, SvCUR(sv) + z + arg * sizeof(U32) + 4);
4477 s = SvPVX(sv) + SvCUR(sv) + z;
4479 Copy(fops, s, arg, U32);
4481 sv_magic(sv, NULL, PERL_MAGIC_fm, NULL, 0);
4484 if (unchopnum && repeat)
4485 DIE(aTHX_ "Repeated format line will never terminate (~~ and @#)");
4491 S_num_overflow(NV value, I32 fldsize, I32 frcsize)
4493 /* Can value be printed in fldsize chars, using %*.*f ? */
4497 int intsize = fldsize - (value < 0 ? 1 : 0);
4504 while (intsize--) pwr *= 10.0;
4505 while (frcsize--) eps /= 10.0;
4508 if (value + eps >= pwr)
4511 if (value - eps <= -pwr)
4518 S_run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen)
4521 SV * const datasv = FILTER_DATA(idx);
4522 const int filter_has_file = IoLINES(datasv);
4523 SV * const filter_state = (SV *)IoTOP_GV(datasv);
4524 SV * const filter_sub = (SV *)IoBOTTOM_GV(datasv);
4528 const char *got_p = NULL;
4529 const char *prune_from = NULL;
4530 bool read_from_cache = FALSE;
4533 assert(maxlen >= 0);
4536 /* I was having segfault trouble under Linux 2.2.5 after a
4537 parse error occured. (Had to hack around it with a test
4538 for PL_error_count == 0.) Solaris doesn't segfault --
4539 not sure where the trouble is yet. XXX */
4541 if (IoFMT_GV(datasv)) {
4542 SV *const cache = (SV *)IoFMT_GV(datasv);
4545 const char *cache_p = SvPV(cache, cache_len);
4549 /* Running in block mode and we have some cached data already.
4551 if (cache_len >= umaxlen) {
4552 /* In fact, so much data we don't even need to call