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;
82 /* prevent recompiling under /o and ithreads. */
83 #if defined(USE_ITHREADS)
84 if (pm->op_pmflags & PMf_KEEP && PM_GETRE(pm)) {
85 if (PL_op->op_flags & OPf_STACKED) {
94 if (PL_op->op_flags & OPf_STACKED) {
95 /* multiple args; concatentate them */
97 tmpstr = PAD_SV(ARGTARG);
98 sv_setpvn(tmpstr, "", 0);
99 while (++MARK <= SP) {
100 if (PL_amagic_generation) {
102 if ((SvAMAGIC(tmpstr) || SvAMAGIC(*MARK)) &&
103 (sv = amagic_call(tmpstr, *MARK, concat_amg, AMGf_assign)))
105 sv_setsv(tmpstr, sv);
109 sv_catsv(tmpstr, *MARK);
118 SV * const sv = SvRV(tmpstr);
119 if (SvTYPE(sv) == SVt_REGEXP)
123 re = reg_temp_copy(re);
124 ReREFCNT_dec(PM_GETRE(pm));
129 const char *t = SvOK(tmpstr) ? SvPV_const(tmpstr, len) : "";
131 assert (re != (REGEXP*) &PL_sv_undef);
133 /* Check against the last compiled regexp. */
134 if (!re || !RX_PRECOMP(re) || RX_PRELEN(re) != len ||
135 memNE(RX_PRECOMP(re), t, len))
137 const regexp_engine *eng = re ? RX_ENGINE(re) : NULL;
138 U32 pm_flags = pm->op_pmflags & PMf_COMPILETIME;
142 PM_SETRE(pm, (REGEXP*) &PL_sv_undef);
144 PM_SETRE(pm, NULL); /* crucial if regcomp aborts */
146 } else if (PL_curcop->cop_hints_hash) {
147 SV *ptr = Perl_refcounted_he_fetch(aTHX_ PL_curcop->cop_hints_hash, 0,
149 if (ptr && SvIOK(ptr) && SvIV(ptr))
150 eng = INT2PTR(regexp_engine*,SvIV(ptr));
153 if (PL_op->op_flags & OPf_SPECIAL)
154 PL_reginterp_cnt = I32_MAX; /* Mark as safe. */
156 if (DO_UTF8(tmpstr)) {
157 assert (SvUTF8(tmpstr));
158 } else if (SvUTF8(tmpstr)) {
159 /* Not doing UTF-8, despite what the SV says. Is this only if
160 we're trapped in use 'bytes'? */
161 /* Make a copy of the octet sequence, but without the flag on,
162 as the compiler now honours the SvUTF8 flag on tmpstr. */
164 const char *const p = SvPV(tmpstr, len);
165 tmpstr = newSVpvn_flags(p, len, SVs_TEMP);
169 PM_SETRE(pm, CALLREGCOMP_ENG(eng, tmpstr, pm_flags));
171 PM_SETRE(pm, CALLREGCOMP(tmpstr, pm_flags));
173 PL_reginterp_cnt = 0; /* XXXX Be extra paranoid - needed
174 inside tie/overload accessors. */
180 #ifndef INCOMPLETE_TAINTS
183 RX_EXTFLAGS(re) |= RXf_TAINTED;
185 RX_EXTFLAGS(re) &= ~RXf_TAINTED;
189 if (!RX_PRELEN(PM_GETRE(pm)) && PL_curpm)
193 #if !defined(USE_ITHREADS)
194 /* can't change the optree at runtime either */
195 /* PMf_KEEP is handled differently under threads to avoid these problems */
196 if (pm->op_pmflags & PMf_KEEP) {
197 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
198 cLOGOP->op_first->op_next = PL_op->op_next;
208 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
209 register PMOP * const pm = (PMOP*) cLOGOP->op_other;
210 register SV * const dstr = cx->sb_dstr;
211 register char *s = cx->sb_s;
212 register char *m = cx->sb_m;
213 char *orig = cx->sb_orig;
214 register REGEXP * const rx = cx->sb_rx;
216 REGEXP *old = PM_GETRE(pm);
220 PM_SETRE(pm,ReREFCNT_inc(rx));
223 rxres_restore(&cx->sb_rxres, rx);
224 RX_MATCH_UTF8_set(rx, DO_UTF8(cx->sb_targ));
226 if (cx->sb_iters++) {
227 const I32 saviters = cx->sb_iters;
228 if (cx->sb_iters > cx->sb_maxiters)
229 DIE(aTHX_ "Substitution loop");
231 if (!(cx->sb_rxtainted & 2) && SvTAINTED(TOPs))
232 cx->sb_rxtainted |= 2;
233 sv_catsv(dstr, POPs);
234 FREETMPS; /* Prevent excess tmp stack */
237 if (CxONCE(cx) || !CALLREGEXEC(rx, s, cx->sb_strend, orig,
238 s == m, cx->sb_targ, NULL,
239 ((cx->sb_rflags & REXEC_COPY_STR)
240 ? (REXEC_IGNOREPOS|REXEC_NOT_FIRST)
241 : (REXEC_COPY_STR|REXEC_IGNOREPOS|REXEC_NOT_FIRST))))
243 SV * const targ = cx->sb_targ;
245 assert(cx->sb_strend >= s);
246 if(cx->sb_strend > s) {
247 if (DO_UTF8(dstr) && !SvUTF8(targ))
248 sv_catpvn_utf8_upgrade(dstr, s, cx->sb_strend - s, nsv);
250 sv_catpvn(dstr, s, cx->sb_strend - s);
252 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
254 #ifdef PERL_OLD_COPY_ON_WRITE
256 sv_force_normal_flags(targ, SV_COW_DROP_PV);
262 SvPV_set(targ, SvPVX(dstr));
263 SvCUR_set(targ, SvCUR(dstr));
264 SvLEN_set(targ, SvLEN(dstr));
267 SvPV_set(dstr, NULL);
269 TAINT_IF(cx->sb_rxtainted & 1);
270 mPUSHi(saviters - 1);
272 (void)SvPOK_only_UTF8(targ);
273 TAINT_IF(cx->sb_rxtainted);
277 LEAVE_SCOPE(cx->sb_oldsave);
279 RETURNOP(pm->op_next);
281 cx->sb_iters = saviters;
283 if (RX_MATCH_COPIED(rx) && RX_SUBBEG(rx) != orig) {
286 cx->sb_orig = orig = RX_SUBBEG(rx);
288 cx->sb_strend = s + (cx->sb_strend - m);
290 cx->sb_m = m = RX_OFFS(rx)[0].start + orig;
292 if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
293 sv_catpvn_utf8_upgrade(dstr, s, m - s, nsv);
295 sv_catpvn(dstr, s, m-s);
297 cx->sb_s = RX_OFFS(rx)[0].end + orig;
298 { /* Update the pos() information. */
299 SV * const sv = cx->sb_targ;
302 SvUPGRADE(sv, SVt_PVMG);
303 if (!(mg = mg_find(sv, PERL_MAGIC_regex_global))) {
304 #ifdef PERL_OLD_COPY_ON_WRITE
306 sv_force_normal_flags(sv, 0);
308 mg = sv_magicext(sv, NULL, PERL_MAGIC_regex_global, &PL_vtbl_mglob,
317 (void)ReREFCNT_inc(rx);
318 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
319 rxres_save(&cx->sb_rxres, rx);
320 RETURNOP(pm->op_pmstashstartu.op_pmreplstart);
324 Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
330 if (!p || p[1] < RX_NPARENS(rx)) {
331 #ifdef PERL_OLD_COPY_ON_WRITE
332 i = 7 + RX_NPARENS(rx) * 2;
334 i = 6 + RX_NPARENS(rx) * 2;
343 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? RX_SUBBEG(rx) : NULL);
344 RX_MATCH_COPIED_off(rx);
346 #ifdef PERL_OLD_COPY_ON_WRITE
347 *p++ = PTR2UV(RX_SAVED_COPY(rx));
348 RX_SAVED_COPY(rx) = NULL;
351 *p++ = RX_NPARENS(rx);
353 *p++ = PTR2UV(RX_SUBBEG(rx));
354 *p++ = (UV)RX_SUBLEN(rx);
355 for (i = 0; i <= RX_NPARENS(rx); ++i) {
356 *p++ = (UV)RX_OFFS(rx)[i].start;
357 *p++ = (UV)RX_OFFS(rx)[i].end;
362 Perl_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
368 RX_MATCH_COPY_FREE(rx);
369 RX_MATCH_COPIED_set(rx, *p);
372 #ifdef PERL_OLD_COPY_ON_WRITE
373 if (RX_SAVED_COPY(rx))
374 SvREFCNT_dec (RX_SAVED_COPY(rx));
375 RX_SAVED_COPY(rx) = INT2PTR(SV*,*p);
379 RX_NPARENS(rx) = *p++;
381 RX_SUBBEG(rx) = INT2PTR(char*,*p++);
382 RX_SUBLEN(rx) = (I32)(*p++);
383 for (i = 0; i <= RX_NPARENS(rx); ++i) {
384 RX_OFFS(rx)[i].start = (I32)(*p++);
385 RX_OFFS(rx)[i].end = (I32)(*p++);
390 Perl_rxres_free(pTHX_ void **rsp)
392 UV * const p = (UV*)*rsp;
397 void *tmp = INT2PTR(char*,*p);
400 PoisonFree(*p, 1, sizeof(*p));
402 Safefree(INT2PTR(char*,*p));
404 #ifdef PERL_OLD_COPY_ON_WRITE
406 SvREFCNT_dec (INT2PTR(SV*,p[1]));
416 dVAR; dSP; dMARK; dORIGMARK;
417 register SV * const tmpForm = *++MARK;
422 register SV *sv = NULL;
423 const char *item = NULL;
427 bool chopspace = (strchr(PL_chopset, ' ') != NULL);
428 const char *chophere = NULL;
429 char *linemark = NULL;
431 bool gotsome = FALSE;
433 const STRLEN fudge = SvPOK(tmpForm)
434 ? (SvCUR(tmpForm) * (IN_BYTES ? 1 : 3) + 1) : 0;
435 bool item_is_utf8 = FALSE;
436 bool targ_is_utf8 = FALSE;
438 OP * parseres = NULL;
442 if (!SvMAGICAL(tmpForm) || !SvCOMPILED(tmpForm)) {
443 if (SvREADONLY(tmpForm)) {
444 SvREADONLY_off(tmpForm);
445 parseres = doparseform(tmpForm);
446 SvREADONLY_on(tmpForm);
449 parseres = doparseform(tmpForm);
453 SvPV_force(PL_formtarget, len);
454 if (DO_UTF8(PL_formtarget))
456 t = SvGROW(PL_formtarget, len + fudge + 1); /* XXX SvCUR bad */
458 f = SvPV_const(tmpForm, len);
459 /* need to jump to the next word */
460 fpc = (U32*)(f + len + WORD_ALIGN - SvCUR(tmpForm) % WORD_ALIGN);
464 const char *name = "???";
467 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
468 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
469 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
470 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
471 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
473 case FF_CHECKNL: name = "CHECKNL"; break;
474 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
475 case FF_SPACE: name = "SPACE"; break;
476 case FF_HALFSPACE: name = "HALFSPACE"; break;
477 case FF_ITEM: name = "ITEM"; break;
478 case FF_CHOP: name = "CHOP"; break;
479 case FF_LINEGLOB: name = "LINEGLOB"; break;
480 case FF_NEWLINE: name = "NEWLINE"; break;
481 case FF_MORE: name = "MORE"; break;
482 case FF_LINEMARK: name = "LINEMARK"; break;
483 case FF_END: name = "END"; break;
484 case FF_0DECIMAL: name = "0DECIMAL"; break;
485 case FF_LINESNGL: name = "LINESNGL"; break;
488 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
490 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
501 if (targ_is_utf8 && !SvUTF8(tmpForm)) {
502 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
504 sv_catpvn_utf8_upgrade(PL_formtarget, f, arg, nsv);
505 t = SvEND(PL_formtarget);
508 if (!targ_is_utf8 && DO_UTF8(tmpForm)) {
509 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
511 sv_utf8_upgrade(PL_formtarget);
512 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
513 t = SvEND(PL_formtarget);
533 if (ckWARN(WARN_SYNTAX))
534 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
541 const char *s = item = SvPV_const(sv, len);
544 itemsize = sv_len_utf8(sv);
545 if (itemsize != (I32)len) {
547 if (itemsize > fieldsize) {
548 itemsize = fieldsize;
549 itembytes = itemsize;
550 sv_pos_u2b(sv, &itembytes, 0);
554 send = chophere = s + itembytes;
564 sv_pos_b2u(sv, &itemsize);
568 item_is_utf8 = FALSE;
569 if (itemsize > fieldsize)
570 itemsize = fieldsize;
571 send = chophere = s + itemsize;
585 const char *s = item = SvPV_const(sv, len);
588 itemsize = sv_len_utf8(sv);
589 if (itemsize != (I32)len) {
591 if (itemsize <= fieldsize) {
592 const char *send = chophere = s + itemsize;
605 itemsize = fieldsize;
606 itembytes = itemsize;
607 sv_pos_u2b(sv, &itembytes, 0);
608 send = chophere = s + itembytes;
609 while (s < send || (s == send && isSPACE(*s))) {
619 if (strchr(PL_chopset, *s))
624 itemsize = chophere - item;
625 sv_pos_b2u(sv, &itemsize);
631 item_is_utf8 = FALSE;
632 if (itemsize <= fieldsize) {
633 const char *const send = chophere = s + itemsize;
646 itemsize = fieldsize;
647 send = chophere = s + itemsize;
648 while (s < send || (s == send && isSPACE(*s))) {
658 if (strchr(PL_chopset, *s))
663 itemsize = chophere - item;
669 arg = fieldsize - itemsize;
678 arg = fieldsize - itemsize;
689 const char *s = item;
693 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
695 sv_utf8_upgrade(PL_formtarget);
696 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
697 t = SvEND(PL_formtarget);
701 if (UTF8_IS_CONTINUED(*s)) {
702 STRLEN skip = UTF8SKIP(s);
719 if ( !((*t++ = *s++) & ~31) )
725 if (targ_is_utf8 && !item_is_utf8) {
726 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
728 sv_catpvn_utf8_upgrade(PL_formtarget, s, arg, nsv);
729 for (; t < SvEND(PL_formtarget); t++) {
742 const int ch = *t++ = *s++;
745 if ( !((*t++ = *s++) & ~31) )
754 const char *s = chophere;
772 const char *s = item = SvPV_const(sv, len);
774 if ((item_is_utf8 = DO_UTF8(sv)))
775 itemsize = sv_len_utf8(sv);
777 bool chopped = FALSE;
778 const char *const send = s + len;
780 chophere = s + itemsize;
796 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
798 SvUTF8_on(PL_formtarget);
800 SvCUR_set(sv, chophere - item);
801 sv_catsv(PL_formtarget, sv);
802 SvCUR_set(sv, itemsize);
804 sv_catsv(PL_formtarget, sv);
806 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) - 1);
807 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
808 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
817 #if defined(USE_LONG_DOUBLE)
820 "%#0*.*" PERL_PRIfldbl : "%0*.*" PERL_PRIfldbl);
824 "%#0*.*f" : "%0*.*f");
829 #if defined(USE_LONG_DOUBLE)
831 ((arg & 256) ? "%#*.*" PERL_PRIfldbl : "%*.*" PERL_PRIfldbl);
834 ((arg & 256) ? "%#*.*f" : "%*.*f");
837 /* If the field is marked with ^ and the value is undefined,
839 if ((arg & 512) && !SvOK(sv)) {
847 /* overflow evidence */
848 if (num_overflow(value, fieldsize, arg)) {
854 /* Formats aren't yet marked for locales, so assume "yes". */
856 STORE_NUMERIC_STANDARD_SET_LOCAL();
857 my_snprintf(t, SvLEN(PL_formtarget) - (t - SvPVX(PL_formtarget)), fmt, (int) fieldsize, (int) arg & 255, value);
858 RESTORE_NUMERIC_STANDARD();
865 while (t-- > linemark && *t == ' ') ;
873 if (arg) { /* repeat until fields exhausted? */
875 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
876 lines += FmLINES(PL_formtarget);
879 if (strnEQ(linemark, linemark - arg, arg))
880 DIE(aTHX_ "Runaway format");
883 SvUTF8_on(PL_formtarget);
884 FmLINES(PL_formtarget) = lines;
886 RETURNOP(cLISTOP->op_first);
897 const char *s = chophere;
898 const char *send = item + len;
900 while (isSPACE(*s) && (s < send))
905 arg = fieldsize - itemsize;
912 if (strnEQ(s1," ",3)) {
913 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
924 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
926 SvUTF8_on(PL_formtarget);
927 FmLINES(PL_formtarget) += lines;
939 if (PL_stack_base + *PL_markstack_ptr == SP) {
941 if (GIMME_V == G_SCALAR)
943 RETURNOP(PL_op->op_next->op_next);
945 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
946 pp_pushmark(); /* push dst */
947 pp_pushmark(); /* push src */
948 ENTER; /* enter outer scope */
951 if (PL_op->op_private & OPpGREP_LEX)
952 SAVESPTR(PAD_SVl(PL_op->op_targ));
955 ENTER; /* enter inner scope */
958 src = PL_stack_base[*PL_markstack_ptr];
960 if (PL_op->op_private & OPpGREP_LEX)
961 PAD_SVl(PL_op->op_targ) = src;
966 if (PL_op->op_type == OP_MAPSTART)
967 pp_pushmark(); /* push top */
968 return ((LOGOP*)PL_op->op_next)->op_other;
974 const I32 gimme = GIMME_V;
975 I32 items = (SP - PL_stack_base) - *PL_markstack_ptr; /* how many new items */
981 /* first, move source pointer to the next item in the source list */
982 ++PL_markstack_ptr[-1];
984 /* if there are new items, push them into the destination list */
985 if (items && gimme != G_VOID) {
986 /* might need to make room back there first */
987 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
988 /* XXX this implementation is very pessimal because the stack
989 * is repeatedly extended for every set of items. Is possible
990 * to do this without any stack extension or copying at all
991 * by maintaining a separate list over which the map iterates
992 * (like foreach does). --gsar */
994 /* everything in the stack after the destination list moves
995 * towards the end the stack by the amount of room needed */
996 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
998 /* items to shift up (accounting for the moved source pointer) */
999 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
1001 /* This optimization is by Ben Tilly and it does
1002 * things differently from what Sarathy (gsar)
1003 * is describing. The downside of this optimization is
1004 * that leaves "holes" (uninitialized and hopefully unused areas)
1005 * to the Perl stack, but on the other hand this
1006 * shouldn't be a problem. If Sarathy's idea gets
1007 * implemented, this optimization should become
1008 * irrelevant. --jhi */
1010 shift = count; /* Avoid shifting too often --Ben Tilly */
1014 dst = (SP += shift);
1015 PL_markstack_ptr[-1] += shift;
1016 *PL_markstack_ptr += shift;
1020 /* copy the new items down to the destination list */
1021 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
1022 if (gimme == G_ARRAY) {
1024 *dst-- = SvTEMP(TOPs) ? POPs : sv_mortalcopy(POPs);
1027 /* scalar context: we don't care about which values map returns
1028 * (we use undef here). And so we certainly don't want to do mortal
1029 * copies of meaningless values. */
1030 while (items-- > 0) {
1032 *dst-- = &PL_sv_undef;
1036 LEAVE; /* exit inner scope */
1039 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
1041 (void)POPMARK; /* pop top */
1042 LEAVE; /* exit outer scope */
1043 (void)POPMARK; /* pop src */
1044 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1045 (void)POPMARK; /* pop dst */
1046 SP = PL_stack_base + POPMARK; /* pop original mark */
1047 if (gimme == G_SCALAR) {
1048 if (PL_op->op_private & OPpGREP_LEX) {
1049 SV* sv = sv_newmortal();
1050 sv_setiv(sv, items);
1058 else if (gimme == G_ARRAY)
1065 ENTER; /* enter inner scope */
1068 /* set $_ to the new source item */
1069 src = PL_stack_base[PL_markstack_ptr[-1]];
1071 if (PL_op->op_private & OPpGREP_LEX)
1072 PAD_SVl(PL_op->op_targ) = src;
1076 RETURNOP(cLOGOP->op_other);
1085 if (GIMME == G_ARRAY)
1087 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1088 return cLOGOP->op_other;
1098 if (GIMME == G_ARRAY) {
1099 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1103 SV * const targ = PAD_SV(PL_op->op_targ);
1106 if (PL_op->op_private & OPpFLIP_LINENUM) {
1107 if (GvIO(PL_last_in_gv)) {
1108 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1111 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1113 flip = SvIV(sv) == SvIV(GvSV(gv));
1119 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
1120 if (PL_op->op_flags & OPf_SPECIAL) {
1128 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1131 sv_setpvn(TARG, "", 0);
1137 /* This code tries to decide if "$left .. $right" should use the
1138 magical string increment, or if the range is numeric (we make
1139 an exception for .."0" [#18165]). AMS 20021031. */
1141 #define RANGE_IS_NUMERIC(left,right) ( \
1142 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1143 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
1144 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
1145 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
1146 && (!SvOK(right) || looks_like_number(right))))
1152 if (GIMME == G_ARRAY) {
1158 if (RANGE_IS_NUMERIC(left,right)) {
1161 if ((SvOK(left) && SvNV(left) < IV_MIN) ||
1162 (SvOK(right) && SvNV(right) > IV_MAX))
1163 DIE(aTHX_ "Range iterator outside integer range");
1174 SV * const sv = sv_2mortal(newSViv(i++));
1179 SV * const final = sv_mortalcopy(right);
1181 const char * const tmps = SvPV_const(final, len);
1183 SV *sv = sv_mortalcopy(left);
1184 SvPV_force_nolen(sv);
1185 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
1187 if (strEQ(SvPVX_const(sv),tmps))
1189 sv = sv_2mortal(newSVsv(sv));
1196 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
1200 if (PL_op->op_private & OPpFLIP_LINENUM) {
1201 if (GvIO(PL_last_in_gv)) {
1202 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1205 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1206 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1214 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
1215 sv_catpvs(targ, "E0");
1225 static const char * const context_name[] = {
1238 S_dopoptolabel(pTHX_ const char *label)
1243 for (i = cxstack_ix; i >= 0; i--) {
1244 register const PERL_CONTEXT * const cx = &cxstack[i];
1245 switch (CxTYPE(cx)) {
1253 if (ckWARN(WARN_EXITING))
1254 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1255 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1256 if (CxTYPE(cx) == CXt_NULL)
1259 case CXt_LOOP_LAZYIV:
1260 case CXt_LOOP_STACK:
1262 case CXt_LOOP_PLAIN:
1263 if ( !CxLABEL(cx) || strNE(label, CxLABEL(cx)) ) {
1264 DEBUG_l(Perl_deb(aTHX_ "(Skipping label #%ld %s)\n",
1265 (long)i, CxLABEL(cx)));
1268 DEBUG_l( Perl_deb(aTHX_ "(Found label #%ld %s)\n", (long)i, label));
1278 Perl_dowantarray(pTHX)
1281 const I32 gimme = block_gimme();
1282 return (gimme == G_VOID) ? G_SCALAR : gimme;
1286 Perl_block_gimme(pTHX)
1289 const I32 cxix = dopoptosub(cxstack_ix);
1293 switch (cxstack[cxix].blk_gimme) {
1301 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
1308 Perl_is_lvalue_sub(pTHX)
1311 const I32 cxix = dopoptosub(cxstack_ix);
1312 assert(cxix >= 0); /* We should only be called from inside subs */
1314 if (CxLVAL(cxstack + cxix) && CvLVALUE(cxstack[cxix].blk_sub.cv))
1315 return CxLVAL(cxstack + cxix);
1321 S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
1325 for (i = startingblock; i >= 0; i--) {
1326 register const PERL_CONTEXT * const cx = &cxstk[i];
1327 switch (CxTYPE(cx)) {
1333 DEBUG_l( Perl_deb(aTHX_ "(Found sub #%ld)\n", (long)i));
1341 S_dopoptoeval(pTHX_ I32 startingblock)
1345 for (i = startingblock; i >= 0; i--) {
1346 register const PERL_CONTEXT *cx = &cxstack[i];
1347 switch (CxTYPE(cx)) {
1351 DEBUG_l( Perl_deb(aTHX_ "(Found eval #%ld)\n", (long)i));
1359 S_dopoptoloop(pTHX_ I32 startingblock)
1363 for (i = startingblock; i >= 0; i--) {
1364 register const PERL_CONTEXT * const cx = &cxstack[i];
1365 switch (CxTYPE(cx)) {
1371 if (ckWARN(WARN_EXITING))
1372 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1373 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1374 if ((CxTYPE(cx)) == CXt_NULL)
1377 case CXt_LOOP_LAZYIV:
1378 case CXt_LOOP_STACK:
1380 case CXt_LOOP_PLAIN:
1381 DEBUG_l( Perl_deb(aTHX_ "(Found loop #%ld)\n", (long)i));
1389 S_dopoptogiven(pTHX_ I32 startingblock)
1393 for (i = startingblock; i >= 0; i--) {
1394 register const PERL_CONTEXT *cx = &cxstack[i];
1395 switch (CxTYPE(cx)) {
1399 DEBUG_l( Perl_deb(aTHX_ "(Found given #%ld)\n", (long)i));
1401 case CXt_LOOP_PLAIN:
1402 assert(!CxFOREACHDEF(cx));
1404 case CXt_LOOP_LAZYIV:
1405 case CXt_LOOP_STACK:
1407 if (CxFOREACHDEF(cx)) {
1408 DEBUG_l( Perl_deb(aTHX_ "(Found foreach #%ld)\n", (long)i));
1417 S_dopoptowhen(pTHX_ I32 startingblock)
1421 for (i = startingblock; i >= 0; i--) {
1422 register const PERL_CONTEXT *cx = &cxstack[i];
1423 switch (CxTYPE(cx)) {
1427 DEBUG_l( Perl_deb(aTHX_ "(Found when #%ld)\n", (long)i));
1435 Perl_dounwind(pTHX_ I32 cxix)
1440 while (cxstack_ix > cxix) {
1442 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
1443 DEBUG_l(PerlIO_printf(Perl_debug_log, "Unwinding block %ld, type %s\n",
1444 (long) cxstack_ix, PL_block_type[CxTYPE(cx)]));
1445 /* Note: we don't need to restore the base context info till the end. */
1446 switch (CxTYPE(cx)) {
1449 continue; /* not break */
1457 case CXt_LOOP_LAZYIV:
1458 case CXt_LOOP_STACK:
1460 case CXt_LOOP_PLAIN:
1471 PERL_UNUSED_VAR(optype);
1475 Perl_qerror(pTHX_ SV *err)
1479 sv_catsv(ERRSV, err);
1481 sv_catsv(PL_errors, err);
1483 Perl_warn(aTHX_ "%"SVf, SVfARG(err));
1485 ++PL_parser->error_count;
1489 Perl_die_where(pTHX_ const char *message, STRLEN msglen)
1498 if (PL_in_eval & EVAL_KEEPERR) {
1499 static const char prefix[] = "\t(in cleanup) ";
1500 SV * const err = ERRSV;
1501 const char *e = NULL;
1503 sv_setpvn(err,"",0);
1504 else if (SvCUR(err) >= sizeof(prefix)+msglen-1) {
1506 e = SvPV_const(err, len);
1508 if (*e != *message || strNE(e,message))
1512 SvGROW(err, SvCUR(err)+sizeof(prefix)+msglen);
1513 sv_catpvn(err, prefix, sizeof(prefix)-1);
1514 sv_catpvn(err, message, msglen);
1515 if (ckWARN(WARN_MISC)) {
1516 const STRLEN start = SvCUR(err)-msglen-sizeof(prefix)+1;
1517 Perl_warner(aTHX_ packWARN(WARN_MISC), SvPVX_const(err)+start);
1522 sv_setpvn(ERRSV, message, msglen);
1526 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1527 && PL_curstackinfo->si_prev)
1535 register PERL_CONTEXT *cx;
1538 if (cxix < cxstack_ix)
1541 POPBLOCK(cx,PL_curpm);
1542 if (CxTYPE(cx) != CXt_EVAL) {
1544 message = SvPVx_const(ERRSV, msglen);
1545 PerlIO_write(Perl_error_log, (const char *)"panic: die ", 11);
1546 PerlIO_write(Perl_error_log, message, msglen);
1551 if (gimme == G_SCALAR)
1552 *++newsp = &PL_sv_undef;
1553 PL_stack_sp = newsp;
1557 /* LEAVE could clobber PL_curcop (see save_re_context())
1558 * XXX it might be better to find a way to avoid messing with
1559 * PL_curcop in save_re_context() instead, but this is a more
1560 * minimal fix --GSAR */
1561 PL_curcop = cx->blk_oldcop;
1563 if (optype == OP_REQUIRE) {
1564 const char* const msg = SvPVx_nolen_const(ERRSV);
1565 SV * const nsv = cx->blk_eval.old_namesv;
1566 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
1568 DIE(aTHX_ "%sCompilation failed in require",
1569 *msg ? msg : "Unknown error\n");
1571 assert(CxTYPE(cx) == CXt_EVAL);
1572 return cx->blk_eval.retop;
1576 message = SvPVx_const(ERRSV, msglen);
1578 write_to_stderr(message, msglen);
1586 dVAR; dSP; dPOPTOPssrl;
1587 if (SvTRUE(left) != SvTRUE(right))
1597 register I32 cxix = dopoptosub(cxstack_ix);
1598 register const PERL_CONTEXT *cx;
1599 register const PERL_CONTEXT *ccstack = cxstack;
1600 const PERL_SI *top_si = PL_curstackinfo;
1602 const char *stashname;
1609 /* we may be in a higher stacklevel, so dig down deeper */
1610 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1611 top_si = top_si->si_prev;
1612 ccstack = top_si->si_cxstack;
1613 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1616 if (GIMME != G_ARRAY) {
1622 /* caller() should not report the automatic calls to &DB::sub */
1623 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
1624 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1628 cxix = dopoptosub_at(ccstack, cxix - 1);
1631 cx = &ccstack[cxix];
1632 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1633 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
1634 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1635 field below is defined for any cx. */
1636 /* caller() should not report the automatic calls to &DB::sub */
1637 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1638 cx = &ccstack[dbcxix];
1641 stashname = CopSTASHPV(cx->blk_oldcop);
1642 if (GIMME != G_ARRAY) {
1645 PUSHs(&PL_sv_undef);
1648 sv_setpv(TARG, stashname);
1657 PUSHs(&PL_sv_undef);
1659 mPUSHs(newSVpv(stashname, 0));
1660 mPUSHs(newSVpv(OutCopFILE(cx->blk_oldcop), 0));
1661 mPUSHi((I32)CopLINE(cx->blk_oldcop));
1664 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1665 GV * const cvgv = CvGV(ccstack[cxix].blk_sub.cv);
1666 /* So is ccstack[dbcxix]. */
1668 SV * const sv = newSV(0);
1669 gv_efullname3(sv, cvgv, NULL);
1671 PUSHs(boolSV(CxHASARGS(cx)));
1674 PUSHs(newSVpvs_flags("(unknown)", SVs_TEMP));
1675 PUSHs(boolSV(CxHASARGS(cx)));
1679 PUSHs(newSVpvs_flags("(eval)", SVs_TEMP));
1682 gimme = (I32)cx->blk_gimme;
1683 if (gimme == G_VOID)
1684 PUSHs(&PL_sv_undef);
1686 PUSHs(boolSV((gimme & G_WANT) == G_ARRAY));
1687 if (CxTYPE(cx) == CXt_EVAL) {
1689 if (CxOLD_OP_TYPE(cx) == OP_ENTEREVAL) {
1690 PUSHs(cx->blk_eval.cur_text);
1694 else if (cx->blk_eval.old_namesv) {
1695 mPUSHs(newSVsv(cx->blk_eval.old_namesv));
1698 /* eval BLOCK (try blocks have old_namesv == 0) */
1700 PUSHs(&PL_sv_undef);
1701 PUSHs(&PL_sv_undef);
1705 PUSHs(&PL_sv_undef);
1706 PUSHs(&PL_sv_undef);
1708 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)
1709 && CopSTASH_eq(PL_curcop, PL_debstash))
1711 AV * const ary = cx->blk_sub.argarray;
1712 const int off = AvARRAY(ary) - AvALLOC(ary);
1715 GV* const tmpgv = gv_fetchpvs("DB::args", GV_ADD, SVt_PVAV);
1716 PL_dbargs = GvAV(gv_AVadd(tmpgv));
1718 AvREAL_off(PL_dbargs); /* XXX should be REIFY (see av.h) */
1721 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1722 av_extend(PL_dbargs, AvFILLp(ary) + off);
1723 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1724 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1726 /* XXX only hints propagated via op_private are currently
1727 * visible (others are not easily accessible, since they
1728 * use the global PL_hints) */
1729 mPUSHi(CopHINTS_get(cx->blk_oldcop));
1732 STRLEN * const old_warnings = cx->blk_oldcop->cop_warnings ;
1734 if (old_warnings == pWARN_NONE ||
1735 (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0))
1736 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
1737 else if (old_warnings == pWARN_ALL ||
1738 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
1739 /* Get the bit mask for $warnings::Bits{all}, because
1740 * it could have been extended by warnings::register */
1742 HV * const bits = get_hv("warnings::Bits", FALSE);
1743 if (bits && (bits_all=hv_fetchs(bits, "all", FALSE))) {
1744 mask = newSVsv(*bits_all);
1747 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1751 mask = newSVpvn((char *) (old_warnings + 1), old_warnings[0]);
1755 PUSHs(cx->blk_oldcop->cop_hints_hash ?
1756 sv_2mortal(newRV_noinc(
1757 (SV*)Perl_refcounted_he_chain_2hv(aTHX_
1758 cx->blk_oldcop->cop_hints_hash)))
1767 const char * const tmps = (MAXARG < 1) ? (const char *)"" : POPpconstx;
1768 sv_reset(tmps, CopSTASH(PL_curcop));
1773 /* like pp_nextstate, but used instead when the debugger is active */
1778 PL_curcop = (COP*)PL_op;
1779 TAINT_NOT; /* Each statement is presumed innocent */
1780 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
1783 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
1784 || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
1787 register PERL_CONTEXT *cx;
1788 const I32 gimme = G_ARRAY;
1790 GV * const gv = PL_DBgv;
1791 register CV * const cv = GvCV(gv);
1794 DIE(aTHX_ "No DB::DB routine defined");
1796 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
1797 /* don't do recursive DB::DB call */
1812 (void)(*CvXSUB(cv))(aTHX_ cv);
1819 PUSHBLOCK(cx, CXt_SUB, SP);
1821 cx->blk_sub.retop = PL_op->op_next;
1824 PAD_SET_CUR_NOSAVE(CvPADLIST(cv), 1);
1825 RETURNOP(CvSTART(cv));
1835 register PERL_CONTEXT *cx;
1836 const I32 gimme = GIMME_V;
1846 if (PL_op->op_targ) {
1847 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
1848 SvPADSTALE_off(PAD_SVl(PL_op->op_targ));
1849 SAVESETSVFLAGS(PAD_SVl(PL_op->op_targ),
1850 SVs_PADSTALE, SVs_PADSTALE);
1852 #ifndef USE_ITHREADS
1853 svp = &PAD_SVl(PL_op->op_targ); /* "my" variable */
1856 SAVEPADSV(PL_op->op_targ);
1857 iterdata = INT2PTR(void*, PL_op->op_targ);
1858 cxtype |= CXp_PADVAR;
1862 GV * const gv = (GV*)POPs;
1863 svp = &GvSV(gv); /* symbol table variable */
1864 SAVEGENERICSV(*svp);
1867 iterdata = (void*)gv;
1871 if (PL_op->op_private & OPpITER_DEF)
1872 cxtype |= CXp_FOR_DEF;
1876 cxtype |= (PL_op->op_flags & OPf_STACKED) ? CXt_LOOP_FOR : CXt_LOOP_STACK;
1877 PUSHBLOCK(cx, cxtype, SP);
1879 PUSHLOOP_FOR(cx, iterdata, MARK);
1881 PUSHLOOP_FOR(cx, svp, MARK);
1883 if (PL_op->op_flags & OPf_STACKED) {
1884 cx->blk_loop.ary_min_u.iterary = (AV*)SvREFCNT_inc(POPs);
1885 if (SvTYPE(cx->blk_loop.ary_min_u.iterary) != SVt_PVAV) {
1887 SV * const right = (SV*)cx->blk_loop.ary_min_u.iterary;
1890 if (RANGE_IS_NUMERIC(sv,right)) {
1891 cx->cx_type |= CXt_LOOP_LAZYIV;
1892 /* Make sure that no-one re-orders cop.h and breaks our
1894 assert(CxTYPE(cx) == CXt_LOOP_LAZYIV);
1895 #ifdef NV_PRESERVES_UV
1896 if ((SvOK(sv) && ((SvNV(sv) < (NV)IV_MIN) ||
1897 (SvNV(sv) > (NV)IV_MAX)))
1899 (SvOK(right) && ((SvNV(right) > (NV)IV_MAX) ||
1900 (SvNV(right) < (NV)IV_MIN))))
1902 if ((SvOK(sv) && ((SvNV(sv) <= (NV)IV_MIN)
1905 ((SvUV(sv) > (UV)IV_MAX) ||
1906 (SvNV(sv) > (NV)UV_MAX)))))
1908 (SvOK(right) && ((SvNV(right) <= (NV)IV_MIN)
1910 ((SvNV(right) > 0) &&
1911 ((SvUV(right) > (UV)IV_MAX) ||
1912 (SvNV(right) > (NV)UV_MAX))))))
1914 DIE(aTHX_ "Range iterator outside integer range");
1915 cx->blk_loop.iterix = SvIV(sv);
1916 cx->blk_loop.lval_max_u.itermax = SvIV(right);
1918 /* for correct -Dstv display */
1919 cx->blk_oldsp = sp - PL_stack_base;
1923 cx->blk_loop.lval_max_u.iterlval = newSVsv(sv);
1924 (void) SvPV_force_nolen(cx->blk_loop.lval_max_u.iterlval);
1925 (void) SvPV_nolen_const(right);
1928 else if (PL_op->op_private & OPpITER_REVERSED) {
1929 cx->blk_loop.iterix = AvFILL(cx->blk_loop.ary_min_u.iterary) + 1;
1934 if (PL_op->op_private & OPpITER_REVERSED) {
1935 cx->blk_loop.ary_min_u.itermin = MARK - PL_stack_base + 1;
1936 cx->blk_loop.iterix = cx->blk_oldsp + 1;
1939 cx->blk_loop.iterix = MARK - PL_stack_base;
1949 register PERL_CONTEXT *cx;
1950 const I32 gimme = GIMME_V;
1956 PUSHBLOCK(cx, CXt_LOOP_PLAIN, SP);
1957 PUSHLOOP_PLAIN(cx, SP);
1965 register PERL_CONTEXT *cx;
1972 assert(CxTYPE_is_LOOP(cx));
1974 newsp = PL_stack_base + cx->blk_loop.resetsp;
1977 if (gimme == G_VOID)
1979 else if (gimme == G_SCALAR) {
1981 *++newsp = sv_mortalcopy(*SP);
1983 *++newsp = &PL_sv_undef;
1987 *++newsp = sv_mortalcopy(*++mark);
1988 TAINT_NOT; /* Each item is independent */
1994 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
1995 PL_curpm = newpm; /* ... and pop $1 et al */
2006 register PERL_CONTEXT *cx;
2007 bool popsub2 = FALSE;
2008 bool clear_errsv = FALSE;
2016 const I32 cxix = dopoptosub(cxstack_ix);
2019 if (CxMULTICALL(cxstack)) { /* In this case we must be in a
2020 * sort block, which is a CXt_NULL
2023 PL_stack_base[1] = *PL_stack_sp;
2024 PL_stack_sp = PL_stack_base + 1;
2028 DIE(aTHX_ "Can't return outside a subroutine");
2030 if (cxix < cxstack_ix)
2033 if (CxMULTICALL(&cxstack[cxix])) {
2034 gimme = cxstack[cxix].blk_gimme;
2035 if (gimme == G_VOID)
2036 PL_stack_sp = PL_stack_base;
2037 else if (gimme == G_SCALAR) {
2038 PL_stack_base[1] = *PL_stack_sp;
2039 PL_stack_sp = PL_stack_base + 1;
2045 switch (CxTYPE(cx)) {
2048 retop = cx->blk_sub.retop;
2049 cxstack_ix++; /* preserve cx entry on stack for use by POPSUB */
2052 if (!(PL_in_eval & EVAL_KEEPERR))
2055 retop = cx->blk_eval.retop;
2059 if (optype == OP_REQUIRE &&
2060 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
2062 /* Unassume the success we assumed earlier. */
2063 SV * const nsv = cx->blk_eval.old_namesv;
2064 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
2065 DIE(aTHX_ "%"SVf" did not return a true value", SVfARG(nsv));
2070 retop = cx->blk_sub.retop;
2073 DIE(aTHX_ "panic: return");
2077 if (gimme == G_SCALAR) {
2080 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2082 *++newsp = SvREFCNT_inc(*SP);
2087 sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
2089 *++newsp = sv_mortalcopy(sv);
2094 *++newsp = (SvTEMP(*SP)) ? *SP : sv_mortalcopy(*SP);
2097 *++newsp = sv_mortalcopy(*SP);
2100 *++newsp = &PL_sv_undef;
2102 else if (gimme == G_ARRAY) {
2103 while (++MARK <= SP) {
2104 *++newsp = (popsub2 && SvTEMP(*MARK))
2105 ? *MARK : sv_mortalcopy(*MARK);
2106 TAINT_NOT; /* Each item is independent */
2109 PL_stack_sp = newsp;
2112 /* Stack values are safe: */
2115 POPSUB(cx,sv); /* release CV and @_ ... */
2119 PL_curpm = newpm; /* ... and pop $1 et al */
2123 sv_setpvn(ERRSV,"",0);
2131 register PERL_CONTEXT *cx;
2142 if (PL_op->op_flags & OPf_SPECIAL) {
2143 cxix = dopoptoloop(cxstack_ix);
2145 DIE(aTHX_ "Can't \"last\" outside a loop block");
2148 cxix = dopoptolabel(cPVOP->op_pv);
2150 DIE(aTHX_ "Label not found for \"last %s\"", cPVOP->op_pv);
2152 if (cxix < cxstack_ix)
2156 cxstack_ix++; /* temporarily protect top context */
2158 switch (CxTYPE(cx)) {
2159 case CXt_LOOP_LAZYIV:
2160 case CXt_LOOP_STACK:
2162 case CXt_LOOP_PLAIN:
2164 newsp = PL_stack_base + cx->blk_loop.resetsp;
2165 nextop = cx->blk_loop.my_op->op_lastop->op_next;
2169 nextop = cx->blk_sub.retop;
2173 nextop = cx->blk_eval.retop;
2177 nextop = cx->blk_sub.retop;
2180 DIE(aTHX_ "panic: last");
2184 if (gimme == G_SCALAR) {
2186 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*SP))
2187 ? *SP : sv_mortalcopy(*SP);
2189 *++newsp = &PL_sv_undef;
2191 else if (gimme == G_ARRAY) {
2192 while (++MARK <= SP) {
2193 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*MARK))
2194 ? *MARK : sv_mortalcopy(*MARK);
2195 TAINT_NOT; /* Each item is independent */
2203 /* Stack values are safe: */
2205 case CXt_LOOP_LAZYIV:
2206 case CXt_LOOP_PLAIN:
2207 case CXt_LOOP_STACK:
2209 POPLOOP(cx); /* release loop vars ... */
2213 POPSUB(cx,sv); /* release CV and @_ ... */
2216 PL_curpm = newpm; /* ... and pop $1 et al */
2219 PERL_UNUSED_VAR(optype);
2220 PERL_UNUSED_VAR(gimme);
2228 register PERL_CONTEXT *cx;
2231 if (PL_op->op_flags & OPf_SPECIAL) {
2232 cxix = dopoptoloop(cxstack_ix);
2234 DIE(aTHX_ "Can't \"next\" outside a loop block");
2237 cxix = dopoptolabel(cPVOP->op_pv);
2239 DIE(aTHX_ "Label not found for \"next %s\"", cPVOP->op_pv);
2241 if (cxix < cxstack_ix)
2244 /* clear off anything above the scope we're re-entering, but
2245 * save the rest until after a possible continue block */
2246 inner = PL_scopestack_ix;
2248 if (PL_scopestack_ix < inner)
2249 leave_scope(PL_scopestack[PL_scopestack_ix]);
2250 PL_curcop = cx->blk_oldcop;
2251 return CX_LOOP_NEXTOP_GET(cx);
2258 register PERL_CONTEXT *cx;
2262 if (PL_op->op_flags & OPf_SPECIAL) {
2263 cxix = dopoptoloop(cxstack_ix);
2265 DIE(aTHX_ "Can't \"redo\" outside a loop block");
2268 cxix = dopoptolabel(cPVOP->op_pv);
2270 DIE(aTHX_ "Label not found for \"redo %s\"", cPVOP->op_pv);
2272 if (cxix < cxstack_ix)
2275 redo_op = cxstack[cxix].blk_loop.my_op->op_redoop;
2276 if (redo_op->op_type == OP_ENTER) {
2277 /* pop one less context to avoid $x being freed in while (my $x..) */
2279 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_BLOCK);
2280 redo_op = redo_op->op_next;
2284 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2285 LEAVE_SCOPE(oldsave);
2287 PL_curcop = cx->blk_oldcop;
2292 S_dofindlabel(pTHX_ OP *o, const char *label, OP **opstack, OP **oplimit)
2296 static const char too_deep[] = "Target of goto is too deeply nested";
2299 Perl_croak(aTHX_ too_deep);
2300 if (o->op_type == OP_LEAVE ||
2301 o->op_type == OP_SCOPE ||
2302 o->op_type == OP_LEAVELOOP ||
2303 o->op_type == OP_LEAVESUB ||
2304 o->op_type == OP_LEAVETRY)
2306 *ops++ = cUNOPo->op_first;
2308 Perl_croak(aTHX_ too_deep);
2311 if (o->op_flags & OPf_KIDS) {
2313 /* First try all the kids at this level, since that's likeliest. */
2314 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2315 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
2316 kCOP->cop_label && strEQ(kCOP->cop_label, label))
2319 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2320 if (kid == PL_lastgotoprobe)
2322 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2325 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2326 ops[-1]->op_type == OP_DBSTATE)
2331 if ((o = dofindlabel(kid, label, ops, oplimit)))
2344 register PERL_CONTEXT *cx;
2345 #define GOTO_DEPTH 64
2346 OP *enterops[GOTO_DEPTH];
2347 const char *label = NULL;
2348 const bool do_dump = (PL_op->op_type == OP_DUMP);
2349 static const char must_have_label[] = "goto must have label";
2351 if (PL_op->op_flags & OPf_STACKED) {
2352 SV * const sv = POPs;
2354 /* This egregious kludge implements goto &subroutine */
2355 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2357 register PERL_CONTEXT *cx;
2358 CV* cv = (CV*)SvRV(sv);
2365 if (!CvROOT(cv) && !CvXSUB(cv)) {
2366 const GV * const gv = CvGV(cv);
2370 /* autoloaded stub? */
2371 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2373 autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv),
2374 GvNAMELEN(gv), FALSE);
2375 if (autogv && (cv = GvCV(autogv)))
2377 tmpstr = sv_newmortal();
2378 gv_efullname3(tmpstr, gv, NULL);
2379 DIE(aTHX_ "Goto undefined subroutine &%"SVf"", SVfARG(tmpstr));
2381 DIE(aTHX_ "Goto undefined subroutine");
2384 /* First do some returnish stuff. */
2385 SvREFCNT_inc_simple_void(cv); /* avoid premature free during unwind */
2387 cxix = dopoptosub(cxstack_ix);
2389 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
2390 if (cxix < cxstack_ix)
2394 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2395 if (CxTYPE(cx) == CXt_EVAL) {
2397 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2399 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2401 else if (CxMULTICALL(cx))
2402 DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)");
2403 if (CxTYPE(cx) == CXt_SUB && CxHASARGS(cx)) {
2404 /* put @_ back onto stack */
2405 AV* av = cx->blk_sub.argarray;
2407 items = AvFILLp(av) + 1;
2408 EXTEND(SP, items+1); /* @_ could have been extended. */
2409 Copy(AvARRAY(av), SP + 1, items, SV*);
2410 SvREFCNT_dec(GvAV(PL_defgv));
2411 GvAV(PL_defgv) = cx->blk_sub.savearray;
2413 /* abandon @_ if it got reified */
2418 av_extend(av, items-1);
2420 PAD_SVl(0) = (SV*)(cx->blk_sub.argarray = av);
2423 else if (CvISXSUB(cv)) { /* put GvAV(defgv) back onto stack */
2424 AV* const av = GvAV(PL_defgv);
2425 items = AvFILLp(av) + 1;
2426 EXTEND(SP, items+1); /* @_ could have been extended. */
2427 Copy(AvARRAY(av), SP + 1, items, SV*);
2431 if (CxTYPE(cx) == CXt_SUB &&
2432 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
2433 SvREFCNT_dec(cx->blk_sub.cv);
2434 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2435 LEAVE_SCOPE(oldsave);
2437 /* Now do some callish stuff. */
2439 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2441 OP* const retop = cx->blk_sub.retop;
2446 for (index=0; index<items; index++)
2447 sv_2mortal(SP[-index]);
2450 /* XS subs don't have a CxSUB, so pop it */
2451 POPBLOCK(cx, PL_curpm);
2452 /* Push a mark for the start of arglist */
2455 (void)(*CvXSUB(cv))(aTHX_ cv);
2460 AV* const padlist = CvPADLIST(cv);
2461 if (CxTYPE(cx) == CXt_EVAL) {
2462 PL_in_eval = CxOLD_IN_EVAL(cx);
2463 PL_eval_root = cx->blk_eval.old_eval_root;
2464 cx->cx_type = CXt_SUB;
2466 cx->blk_sub.cv = cv;
2467 cx->blk_sub.olddepth = CvDEPTH(cv);
2470 if (CvDEPTH(cv) < 2)
2471 SvREFCNT_inc_simple_void_NN(cv);
2473 if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION))
2474 sub_crush_depth(cv);
2475 pad_push(padlist, CvDEPTH(cv));
2478 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
2481 AV* const av = (AV*)PAD_SVl(0);
2483 cx->blk_sub.savearray = GvAV(PL_defgv);
2484 GvAV(PL_defgv) = (AV*)SvREFCNT_inc_simple(av);
2485 CX_CURPAD_SAVE(cx->blk_sub);
2486 cx->blk_sub.argarray = av;
2488 if (items >= AvMAX(av) + 1) {
2489 SV **ary = AvALLOC(av);
2490 if (AvARRAY(av) != ary) {
2491 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2494 if (items >= AvMAX(av) + 1) {
2495 AvMAX(av) = items - 1;
2496 Renew(ary,items+1,SV*);
2502 Copy(mark,AvARRAY(av),items,SV*);
2503 AvFILLp(av) = items - 1;
2504 assert(!AvREAL(av));
2506 /* transfer 'ownership' of refcnts to new @_ */
2516 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
2517 Perl_get_db_sub(aTHX_ NULL, cv);
2519 CV * const gotocv = get_cv("DB::goto", FALSE);
2521 PUSHMARK( PL_stack_sp );
2522 call_sv((SV*)gotocv, G_SCALAR | G_NODEBUG);
2527 RETURNOP(CvSTART(cv));
2531 label = SvPV_nolen_const(sv);
2532 if (!(do_dump || *label))
2533 DIE(aTHX_ must_have_label);
2536 else if (PL_op->op_flags & OPf_SPECIAL) {
2538 DIE(aTHX_ must_have_label);
2541 label = cPVOP->op_pv;
2543 if (label && *label) {
2544 OP *gotoprobe = NULL;
2545 bool leaving_eval = FALSE;
2546 bool in_block = FALSE;
2547 PERL_CONTEXT *last_eval_cx = NULL;
2551 PL_lastgotoprobe = NULL;
2553 for (ix = cxstack_ix; ix >= 0; ix--) {
2555 switch (CxTYPE(cx)) {
2557 leaving_eval = TRUE;
2558 if (!CxTRYBLOCK(cx)) {
2559 gotoprobe = (last_eval_cx ?
2560 last_eval_cx->blk_eval.old_eval_root :
2565 /* else fall through */
2566 case CXt_LOOP_LAZYIV:
2567 case CXt_LOOP_STACK:
2569 case CXt_LOOP_PLAIN:
2570 gotoprobe = cx->blk_oldcop->op_sibling;
2576 gotoprobe = cx->blk_oldcop->op_sibling;
2579 gotoprobe = PL_main_root;
2582 if (CvDEPTH(cx->blk_sub.cv) && !CxMULTICALL(cx)) {
2583 gotoprobe = CvROOT(cx->blk_sub.cv);
2589 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
2592 DIE(aTHX_ "panic: goto");
2593 gotoprobe = PL_main_root;
2597 retop = dofindlabel(gotoprobe, label,
2598 enterops, enterops + GOTO_DEPTH);
2602 PL_lastgotoprobe = gotoprobe;
2605 DIE(aTHX_ "Can't find label %s", label);
2607 /* if we're leaving an eval, check before we pop any frames
2608 that we're not going to punt, otherwise the error
2611 if (leaving_eval && *enterops && enterops[1]) {
2613 for (i = 1; enterops[i]; i++)
2614 if (enterops[i]->op_type == OP_ENTERITER)
2615 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2618 /* pop unwanted frames */
2620 if (ix < cxstack_ix) {
2627 oldsave = PL_scopestack[PL_scopestack_ix];
2628 LEAVE_SCOPE(oldsave);
2631 /* push wanted frames */
2633 if (*enterops && enterops[1]) {
2634 OP * const oldop = PL_op;
2635 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
2636 for (; enterops[ix]; ix++) {
2637 PL_op = enterops[ix];
2638 /* Eventually we may want to stack the needed arguments
2639 * for each op. For now, we punt on the hard ones. */
2640 if (PL_op->op_type == OP_ENTERITER)
2641 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2642 CALL_FPTR(PL_op->op_ppaddr)(aTHX);
2650 if (!retop) retop = PL_main_start;
2652 PL_restartop = retop;
2653 PL_do_undump = TRUE;
2657 PL_restartop = 0; /* hmm, must be GNU unexec().. */
2658 PL_do_undump = FALSE;
2675 if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
2677 VMSISH_HUSHED = VMSISH_HUSHED || (PL_op->op_private & OPpHUSH_VMSISH);
2680 PL_exit_flags |= PERL_EXIT_EXPECTED;
2682 /* KLUDGE: disable exit 0 in BEGIN blocks when we're just compiling */
2683 if (anum || !(PL_minus_c && PL_madskills))
2688 PUSHs(&PL_sv_undef);
2695 S_save_lines(pTHX_ AV *array, SV *sv)
2697 const char *s = SvPVX_const(sv);
2698 const char * const send = SvPVX_const(sv) + SvCUR(sv);
2701 while (s && s < send) {
2703 SV * const tmpstr = newSV_type(SVt_PVMG);
2705 t = strchr(s, '\n');
2711 sv_setpvn(tmpstr, s, t - s);
2712 av_store(array, line++, tmpstr);
2718 S_docatch(pTHX_ OP *o)
2722 OP * const oldop = PL_op;
2726 assert(CATCH_GET == TRUE);
2733 assert(cxstack_ix >= 0);
2734 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2735 cxstack[cxstack_ix].blk_eval.cur_top_env = PL_top_env;
2740 /* die caught by an inner eval - continue inner loop */
2742 /* NB XXX we rely on the old popped CxEVAL still being at the top
2743 * of the stack; the way die_where() currently works, this
2744 * assumption is valid. In theory The cur_top_env value should be
2745 * returned in another global, the way retop (aka PL_restartop)
2747 assert(CxTYPE(&cxstack[cxstack_ix+1]) == CXt_EVAL);
2750 && cxstack[cxstack_ix+1].blk_eval.cur_top_env == PL_top_env)
2752 PL_op = PL_restartop;
2769 Perl_sv_compile_2op(pTHX_ SV *sv, OP** startop, const char *code, PAD** padp)
2770 /* sv Text to convert to OP tree. */
2771 /* startop op_free() this to undo. */
2772 /* code Short string id of the caller. */
2774 /* FIXME - how much of this code is common with pp_entereval? */
2775 dVAR; dSP; /* Make POPBLOCK work. */
2781 char tbuf[TYPE_DIGITS(long) + 12 + 10];
2782 char *tmpbuf = tbuf;
2785 CV* runcv = NULL; /* initialise to avoid compiler warnings */
2789 lex_start(sv, NULL, FALSE);
2791 /* switch to eval mode */
2793 if (IN_PERL_COMPILETIME) {
2794 SAVECOPSTASH_FREE(&PL_compiling);
2795 CopSTASH_set(&PL_compiling, PL_curstash);
2797 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
2798 SV * const sv = sv_newmortal();
2799 Perl_sv_setpvf(aTHX_ sv, "_<(%.10seval %lu)[%s:%"IVdf"]",
2800 code, (unsigned long)++PL_evalseq,
2801 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
2806 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(%.10s_eval %lu)", code,
2807 (unsigned long)++PL_evalseq);
2808 SAVECOPFILE_FREE(&PL_compiling);
2809 CopFILE_set(&PL_compiling, tmpbuf+2);
2810 SAVECOPLINE(&PL_compiling);
2811 CopLINE_set(&PL_compiling, 1);
2812 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
2813 deleting the eval's FILEGV from the stash before gv_check() runs
2814 (i.e. before run-time proper). To work around the coredump that
2815 ensues, we always turn GvMULTI_on for any globals that were
2816 introduced within evals. See force_ident(). GSAR 96-10-12 */
2817 safestr = savepvn(tmpbuf, len);
2818 SAVEDELETE(PL_defstash, safestr, len);
2820 #ifdef OP_IN_REGISTER
2826 /* we get here either during compilation, or via pp_regcomp at runtime */
2827 runtime = IN_PERL_RUNTIME;
2829 runcv = find_runcv(NULL);
2832 PL_op->op_type = OP_ENTEREVAL;
2833 PL_op->op_flags = 0; /* Avoid uninit warning. */
2834 PUSHBLOCK(cx, CXt_EVAL|(IN_PERL_COMPILETIME ? 0 : CXp_REAL), SP);
2835 PUSHEVAL(cx, 0, NULL);
2838 (void) doeval(G_SCALAR, startop, runcv, PL_curcop->cop_seq);
2840 (void) doeval(G_SCALAR, startop, PL_compcv, PL_cop_seqmax);
2841 POPBLOCK(cx,PL_curpm);
2844 (*startop)->op_type = OP_NULL;
2845 (*startop)->op_ppaddr = PL_ppaddr[OP_NULL];
2847 /* XXX DAPM do this properly one year */
2848 *padp = (AV*)SvREFCNT_inc_simple(PL_comppad);
2850 if (IN_PERL_COMPILETIME)
2851 CopHINTS_set(&PL_compiling, PL_hints);
2852 #ifdef OP_IN_REGISTER
2855 PERL_UNUSED_VAR(newsp);
2856 PERL_UNUSED_VAR(optype);
2858 return PL_eval_start;
2863 =for apidoc find_runcv
2865 Locate the CV corresponding to the currently executing sub or eval.
2866 If db_seqp is non_null, skip CVs that are in the DB package and populate
2867 *db_seqp with the cop sequence number at the point that the DB:: code was
2868 entered. (allows debuggers to eval in the scope of the breakpoint rather
2869 than in the scope of the debugger itself).
2875 Perl_find_runcv(pTHX_ U32 *db_seqp)
2881 *db_seqp = PL_curcop->cop_seq;
2882 for (si = PL_curstackinfo; si; si = si->si_prev) {
2884 for (ix = si->si_cxix; ix >= 0; ix--) {
2885 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
2886 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
2887 CV * const cv = cx->blk_sub.cv;
2888 /* skip DB:: code */
2889 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
2890 *db_seqp = cx->blk_oldcop->cop_seq;
2895 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
2903 /* Compile a require/do, an eval '', or a /(?{...})/.
2904 * In the last case, startop is non-null, and contains the address of
2905 * a pointer that should be set to the just-compiled code.
2906 * outside is the lexically enclosing CV (if any) that invoked us.
2907 * Returns a bool indicating whether the compile was successful; if so,
2908 * PL_eval_start contains the first op of the compiled ocde; otherwise,
2909 * pushes undef (also croaks if startop != NULL).
2913 S_doeval(pTHX_ int gimme, OP** startop, CV* outside, U32 seq)
2916 OP * const saveop = PL_op;
2918 PL_in_eval = ((saveop && saveop->op_type == OP_REQUIRE)
2919 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
2924 SAVESPTR(PL_compcv);
2925 PL_compcv = (CV*)newSV_type(SVt_PVCV);
2926 CvEVAL_on(PL_compcv);
2927 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2928 cxstack[cxstack_ix].blk_eval.cv = PL_compcv;
2930 CvOUTSIDE_SEQ(PL_compcv) = seq;
2931 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc_simple(outside);
2933 /* set up a scratch pad */
2935 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE);
2936 PL_op = NULL; /* avoid PL_op and PL_curpad referring to different CVs */
2940 SAVEMORTALIZESV(PL_compcv); /* must remain until end of current statement */
2942 /* make sure we compile in the right package */
2944 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
2945 SAVESPTR(PL_curstash);
2946 PL_curstash = CopSTASH(PL_curcop);
2948 /* XXX:ajgo do we really need to alloc an AV for begin/checkunit */
2949 SAVESPTR(PL_beginav);
2950 PL_beginav = newAV();
2951 SAVEFREESV(PL_beginav);
2952 SAVESPTR(PL_unitcheckav);
2953 PL_unitcheckav = newAV();
2954 SAVEFREESV(PL_unitcheckav);
2957 SAVEBOOL(PL_madskills);
2961 /* try to compile it */
2963 PL_eval_root = NULL;
2964 PL_curcop = &PL_compiling;
2965 CopARYBASE_set(PL_curcop, 0);
2966 if (saveop && (saveop->op_type != OP_REQUIRE) && (saveop->op_flags & OPf_SPECIAL))
2967 PL_in_eval |= EVAL_KEEPERR;
2969 sv_setpvn(ERRSV,"",0);
2970 if (yyparse() || PL_parser->error_count || !PL_eval_root) {
2971 SV **newsp; /* Used by POPBLOCK. */
2972 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
2973 I32 optype = 0; /* Might be reset by POPEVAL. */
2978 op_free(PL_eval_root);
2979 PL_eval_root = NULL;
2981 SP = PL_stack_base + POPMARK; /* pop original mark */
2983 POPBLOCK(cx,PL_curpm);
2989 msg = SvPVx_nolen_const(ERRSV);
2990 if (optype == OP_REQUIRE) {
2991 const SV * const nsv = cx->blk_eval.old_namesv;
2992 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
2994 Perl_croak(aTHX_ "%sCompilation failed in require",
2995 *msg ? msg : "Unknown error\n");
2998 POPBLOCK(cx,PL_curpm);
3000 Perl_croak(aTHX_ "%sCompilation failed in regexp",
3001 (*msg ? msg : "Unknown error\n"));
3005 sv_setpvs(ERRSV, "Compilation error");
3008 PERL_UNUSED_VAR(newsp);
3009 PUSHs(&PL_sv_undef);
3013 CopLINE_set(&PL_compiling, 0);
3015 *startop = PL_eval_root;
3017 SAVEFREEOP(PL_eval_root);
3019 /* Set the context for this new optree.
3020 * If the last op is an OP_REQUIRE, force scalar context.
3021 * Otherwise, propagate the context from the eval(). */
3022 if (PL_eval_root->op_type == OP_LEAVEEVAL
3023 && cUNOPx(PL_eval_root)->op_first->op_type == OP_LINESEQ
3024 && cLISTOPx(cUNOPx(PL_eval_root)->op_first)->op_last->op_type
3026 scalar(PL_eval_root);
3027 else if ((gimme & G_WANT) == G_VOID)
3028 scalarvoid(PL_eval_root);
3029 else if ((gimme & G_WANT) == G_ARRAY)
3032 scalar(PL_eval_root);
3034 DEBUG_x(dump_eval());
3036 /* Register with debugger: */
3037 if (PERLDB_INTER && saveop && saveop->op_type == OP_REQUIRE) {
3038 CV * const cv = get_cv("DB::postponed", FALSE);
3042 XPUSHs((SV*)CopFILEGV(&PL_compiling));
3044 call_sv((SV*)cv, G_DISCARD);
3049 call_list(PL_scopestack_ix, PL_unitcheckav);
3051 /* compiled okay, so do it */
3053 CvDEPTH(PL_compcv) = 1;
3054 SP = PL_stack_base + POPMARK; /* pop original mark */
3055 PL_op = saveop; /* The caller may need it. */
3056 PL_parser->lex_state = LEX_NOTPARSING; /* $^S needs this. */
3063 S_check_type_and_open(pTHX_ const char *name)
3066 const int st_rc = PerlLIO_stat(name, &st);
3068 if (st_rc < 0 || S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode)) {
3072 return PerlIO_open(name, PERL_SCRIPT_MODE);
3075 #ifndef PERL_DISABLE_PMC
3077 S_doopen_pm(pTHX_ const char *name, const STRLEN namelen)
3081 if (namelen > 3 && memEQs(name + namelen - 3, 3, ".pm")) {
3082 SV *const pmcsv = newSV(namelen + 2);
3083 char *const pmc = SvPVX(pmcsv);
3086 memcpy(pmc, name, namelen);
3088 pmc[namelen + 1] = '\0';
3090 if (PerlLIO_stat(pmc, &pmcstat) < 0) {
3091 fp = check_type_and_open(name);
3094 fp = check_type_and_open(pmc);
3096 SvREFCNT_dec(pmcsv);
3099 fp = check_type_and_open(name);
3104 # define doopen_pm(name, namelen) check_type_and_open(name)
3105 #endif /* !PERL_DISABLE_PMC */
3110 register PERL_CONTEXT *cx;
3117 int vms_unixname = 0;
3119 const char *tryname = NULL;
3121 const I32 gimme = GIMME_V;
3122 int filter_has_file = 0;
3123 PerlIO *tryrsfp = NULL;
3124 SV *filter_cache = NULL;
3125 SV *filter_state = NULL;
3126 SV *filter_sub = NULL;
3132 if ( (SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) {
3133 sv = new_version(sv);
3134 if (!sv_derived_from(PL_patchlevel, "version"))
3135 upg_version(PL_patchlevel, TRUE);
3136 if (cUNOP->op_first->op_type == OP_CONST && cUNOP->op_first->op_private & OPpCONST_NOVER) {
3137 if ( vcmp(sv,PL_patchlevel) <= 0 )
3138 DIE(aTHX_ "Perls since %"SVf" too modern--this is %"SVf", stopped",
3139 SVfARG(vnormal(sv)), SVfARG(vnormal(PL_patchlevel)));
3142 if ( vcmp(sv,PL_patchlevel) > 0 ) {
3145 SV * const req = SvRV(sv);
3146 SV * const pv = *hv_fetchs((HV*)req, "original", FALSE);
3148 /* get the left hand term */
3149 lav = (AV *)SvRV(*hv_fetchs((HV*)req, "version", FALSE));
3151 first = SvIV(*av_fetch(lav,0,0));
3152 if ( first > (int)PERL_REVISION /* probably 'use 6.0' */
3153 || hv_exists((HV*)req, "qv", 2 ) /* qv style */
3154 || av_len(lav) > 1 /* FP with > 3 digits */
3155 || strstr(SvPVX(pv),".0") /* FP with leading 0 */
3157 DIE(aTHX_ "Perl %"SVf" required--this is only "
3158 "%"SVf", stopped", SVfARG(vnormal(req)),
3159 SVfARG(vnormal(PL_patchlevel)));
3161 else { /* probably 'use 5.10' or 'use 5.8' */
3162 SV * hintsv = newSV(0);
3166 second = SvIV(*av_fetch(lav,1,0));
3168 second /= second >= 600 ? 100 : 10;
3169 hintsv = Perl_newSVpvf(aTHX_ "v%d.%d.%d",
3170 (int)first, (int)second,0);
3171 upg_version(hintsv, TRUE);
3173 DIE(aTHX_ "Perl %"SVf" required (did you mean %"SVf"?)"
3174 "--this is only %"SVf", stopped",
3175 SVfARG(vnormal(req)),
3176 SVfARG(vnormal(hintsv)),
3177 SVfARG(vnormal(PL_patchlevel)));
3182 /* We do this only with use, not require. */
3184 /* If we request a version >= 5.9.5, load feature.pm with the
3185 * feature bundle that corresponds to the required version. */
3186 vcmp(sv, sv_2mortal(upg_version(newSVnv(5.009005), FALSE))) >= 0) {
3187 SV *const importsv = vnormal(sv);
3188 *SvPVX_mutable(importsv) = ':';
3190 Perl_load_module(aTHX_ 0, newSVpvs("feature"), NULL, importsv, NULL);
3196 name = SvPV_const(sv, len);
3197 if (!(name && len > 0 && *name))
3198 DIE(aTHX_ "Null filename used");
3199 TAINT_PROPER("require");
3203 /* The key in the %ENV hash is in the syntax of file passed as the argument
3204 * usually this is in UNIX format, but sometimes in VMS format, which
3205 * can result in a module being pulled in more than once.
3206 * To prevent this, the key must be stored in UNIX format if the VMS
3207 * name can be translated to UNIX.
3209 if ((unixname = tounixspec(name, NULL)) != NULL) {
3210 unixlen = strlen(unixname);
3216 /* if not VMS or VMS name can not be translated to UNIX, pass it
3219 unixname = (char *) name;
3222 if (PL_op->op_type == OP_REQUIRE) {
3223 SV * const * const svp = hv_fetch(GvHVn(PL_incgv),
3224 unixname, unixlen, 0);
3226 if (*svp != &PL_sv_undef)
3229 DIE(aTHX_ "Attempt to reload %s aborted.\n"
3230 "Compilation failed in require", unixname);
3234 /* prepare to compile file */
3236 if (path_is_absolute(name)) {
3238 tryrsfp = doopen_pm(name, len);
3240 #ifdef MACOS_TRADITIONAL
3244 MacPerl_CanonDir(name, newname, 1);
3245 if (path_is_absolute(newname)) {
3247 tryrsfp = doopen_pm(newname, strlen(newname));
3252 AV * const ar = GvAVn(PL_incgv);
3258 namesv = newSV_type(SVt_PV);
3259 for (i = 0; i <= AvFILL(ar); i++) {
3260 SV * const dirsv = *av_fetch(ar, i, TRUE);
3262 if (SvTIED_mg((SV*)ar, PERL_MAGIC_tied))
3269 if (SvTYPE(SvRV(loader)) == SVt_PVAV
3270 && !sv_isobject(loader))
3272 loader = *av_fetch((AV *)SvRV(loader), 0, TRUE);
3275 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
3276 PTR2UV(SvRV(dirsv)), name);
3277 tryname = SvPVX_const(namesv);
3288 if (sv_isobject(loader))
3289 count = call_method("INC", G_ARRAY);
3291 count = call_sv(loader, G_ARRAY);
3294 /* Adjust file name if the hook has set an %INC entry */
3295 svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3297 tryname = SvPVX_const(*svp);
3306 if (SvROK(arg) && (SvTYPE(SvRV(arg)) <= SVt_PVLV)
3307 && !isGV_with_GP(SvRV(arg))) {
3308 filter_cache = SvRV(arg);
3309 SvREFCNT_inc_simple_void_NN(filter_cache);
3316 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVGV) {
3320 if (SvTYPE(arg) == SVt_PVGV) {
3321 IO * const io = GvIO((GV *)arg);
3326 tryrsfp = IoIFP(io);
3327 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3328 PerlIO_close(IoOFP(io));
3339 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3341 SvREFCNT_inc_simple_void_NN(filter_sub);
3344 filter_state = SP[i];
3345 SvREFCNT_inc_simple_void(filter_state);
3349 if (!tryrsfp && (filter_cache || filter_sub)) {
3350 tryrsfp = PerlIO_open(BIT_BUCKET,
3365 filter_has_file = 0;
3367 SvREFCNT_dec(filter_cache);
3368 filter_cache = NULL;
3371 SvREFCNT_dec(filter_state);
3372 filter_state = NULL;
3375 SvREFCNT_dec(filter_sub);
3380 if (!path_is_absolute(name)
3381 #ifdef MACOS_TRADITIONAL
3382 /* We consider paths of the form :a:b ambiguous and interpret them first
3383 as global then as local
3385 || (*name == ':' && name[1] != ':' && strchr(name+2, ':'))
3392 dir = SvPV_const(dirsv, dirlen);
3398 #ifdef MACOS_TRADITIONAL
3402 MacPerl_CanonDir(name, buf2, 1);
3403 Perl_sv_setpvf(aTHX_ namesv, "%s%s", MacPerl_CanonDir(dir, buf1, 0), buf2+(buf2[0] == ':'));
3407 if ((unixdir = tounixpath(dir, NULL)) == NULL)
3409 sv_setpv(namesv, unixdir);
3410 sv_catpv(namesv, unixname);
3412 # ifdef __SYMBIAN32__
3413 if (PL_origfilename[0] &&
3414 PL_origfilename[1] == ':' &&
3415 !(dir[0] && dir[1] == ':'))
3416 Perl_sv_setpvf(aTHX_ namesv,
3421 Perl_sv_setpvf(aTHX_ namesv,
3425 /* The equivalent of
3426 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
3427 but without the need to parse the format string, or
3428 call strlen on either pointer, and with the correct
3429 allocation up front. */
3431 char *tmp = SvGROW(namesv, dirlen + len + 2);
3433 memcpy(tmp, dir, dirlen);
3436 /* name came from an SV, so it will have a '\0' at the
3437 end that we can copy as part of this memcpy(). */
3438 memcpy(tmp, name, len + 1);
3440 SvCUR_set(namesv, dirlen + len + 1);
3442 /* Don't even actually have to turn SvPOK_on() as we
3443 access it directly with SvPVX() below. */
3448 TAINT_PROPER("require");
3449 tryname = SvPVX_const(namesv);
3450 tryrsfp = doopen_pm(tryname, SvCUR(namesv));
3452 if (tryname[0] == '.' && tryname[1] == '/')
3456 else if (errno == EMFILE)
3457 /* no point in trying other paths if out of handles */
3464 SAVECOPFILE_FREE(&PL_compiling);
3465 CopFILE_set(&PL_compiling, tryrsfp ? tryname : name);
3466 SvREFCNT_dec(namesv);
3468 if (PL_op->op_type == OP_REQUIRE) {
3469 const char *msgstr = name;
3470 if(errno == EMFILE) {
3472 = sv_2mortal(Perl_newSVpvf(aTHX_ "%s: %s", msgstr,
3474 msgstr = SvPV_nolen_const(msg);
3476 if (namesv) { /* did we lookup @INC? */
3477 AV * const ar = GvAVn(PL_incgv);
3479 SV * const msg = sv_2mortal(Perl_newSVpvf(aTHX_
3480 "%s in @INC%s%s (@INC contains:",
3482 (instr(msgstr, ".h ")
3483 ? " (change .h to .ph maybe?)" : ""),
3484 (instr(msgstr, ".ph ")
3485 ? " (did you run h2ph?)" : "")
3488 for (i = 0; i <= AvFILL(ar); i++) {
3489 sv_catpvs(msg, " ");
3490 sv_catsv(msg, *av_fetch(ar, i, TRUE));
3492 sv_catpvs(msg, ")");
3493 msgstr = SvPV_nolen_const(msg);
3496 DIE(aTHX_ "Can't locate %s", msgstr);
3502 SETERRNO(0, SS_NORMAL);
3504 /* Assume success here to prevent recursive requirement. */
3505 /* name is never assigned to again, so len is still strlen(name) */
3506 /* Check whether a hook in @INC has already filled %INC */
3508 (void)hv_store(GvHVn(PL_incgv),
3509 unixname, unixlen, newSVpv(CopFILE(&PL_compiling),0),0);
3511 SV** const svp = hv_fetch(GvHVn(PL_incgv), unixname, unixlen, 0);
3513 (void)hv_store(GvHVn(PL_incgv),
3514 unixname, unixlen, SvREFCNT_inc_simple(hook_sv), 0 );
3519 lex_start(NULL, tryrsfp, TRUE);
3523 SAVECOMPILEWARNINGS();
3524 if (PL_dowarn & G_WARN_ALL_ON)
3525 PL_compiling.cop_warnings = pWARN_ALL ;
3526 else if (PL_dowarn & G_WARN_ALL_OFF)
3527 PL_compiling.cop_warnings = pWARN_NONE ;
3529 PL_compiling.cop_warnings = pWARN_STD ;
3531 if (filter_sub || filter_cache) {
3532 SV * const datasv = filter_add(S_run_user_filter, NULL);
3533 IoLINES(datasv) = filter_has_file;
3534 IoTOP_GV(datasv) = (GV *)filter_state;
3535 IoBOTTOM_GV(datasv) = (GV *)filter_sub;
3536 IoFMT_GV(datasv) = (GV *)filter_cache;
3539 /* switch to eval mode */
3540 PUSHBLOCK(cx, CXt_EVAL, SP);
3541 PUSHEVAL(cx, name, NULL);
3542 cx->blk_eval.retop = PL_op->op_next;
3544 SAVECOPLINE(&PL_compiling);
3545 CopLINE_set(&PL_compiling, 0);
3549 /* Store and reset encoding. */
3550 encoding = PL_encoding;
3553 if (doeval(gimme, NULL, NULL, PL_curcop->cop_seq))
3554 op = DOCATCH(PL_eval_start);
3556 op = PL_op->op_next;
3558 /* Restore encoding. */
3559 PL_encoding = encoding;
3567 register PERL_CONTEXT *cx;
3569 const I32 gimme = GIMME_V;
3570 const I32 was = PL_sub_generation;
3571 char tbuf[TYPE_DIGITS(long) + 12];
3572 char *tmpbuf = tbuf;
3578 HV *saved_hh = NULL;
3579 const char * const fakestr = "_<(eval )";
3580 const int fakelen = 9 + 1;
3582 if (PL_op->op_private & OPpEVAL_HAS_HH) {
3583 saved_hh = (HV*) SvREFCNT_inc(POPs);
3587 TAINT_IF(SvTAINTED(sv));
3588 TAINT_PROPER("eval");
3591 lex_start(sv, NULL, FALSE);
3594 /* switch to eval mode */
3596 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
3597 SV * const temp_sv = sv_newmortal();
3598 Perl_sv_setpvf(aTHX_ temp_sv, "_<(eval %lu)[%s:%"IVdf"]",
3599 (unsigned long)++PL_evalseq,
3600 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
3601 tmpbuf = SvPVX(temp_sv);
3602 len = SvCUR(temp_sv);
3605 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(eval %lu)", (unsigned long)++PL_evalseq);
3606 SAVECOPFILE_FREE(&PL_compiling);
3607 CopFILE_set(&PL_compiling, tmpbuf+2);
3608 SAVECOPLINE(&PL_compiling);
3609 CopLINE_set(&PL_compiling, 1);
3610 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
3611 deleting the eval's FILEGV from the stash before gv_check() runs
3612 (i.e. before run-time proper). To work around the coredump that
3613 ensues, we always turn GvMULTI_on for any globals that were
3614 introduced within evals. See force_ident(). GSAR 96-10-12 */
3615 safestr = savepvn(tmpbuf, len);
3616 SAVEDELETE(PL_defstash, safestr, len);
3618 PL_hints = PL_op->op_targ;
3620 GvHV(PL_hintgv) = saved_hh;
3621 SAVECOMPILEWARNINGS();
3622 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
3623 if (PL_compiling.cop_hints_hash) {
3624 Perl_refcounted_he_free(aTHX_ PL_compiling.cop_hints_hash);
3626 PL_compiling.cop_hints_hash = PL_curcop->cop_hints_hash;
3627 if (PL_compiling.cop_hints_hash) {
3629 PL_compiling.cop_hints_hash->refcounted_he_refcnt++;
3630 HINTS_REFCNT_UNLOCK;
3632 /* special case: an eval '' executed within the DB package gets lexically
3633 * placed in the first non-DB CV rather than the current CV - this
3634 * allows the debugger to execute code, find lexicals etc, in the
3635 * scope of the code being debugged. Passing &seq gets find_runcv
3636 * to do the dirty work for us */
3637 runcv = find_runcv(&seq);
3639 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
3640 PUSHEVAL(cx, 0, NULL);
3641 cx->blk_eval.retop = PL_op->op_next;
3643 /* prepare to compile string */
3645 if (PERLDB_LINE && PL_curstash != PL_debstash)
3646 save_lines(CopFILEAV(&PL_compiling), PL_parser->linestr);
3648 ok = doeval(gimme, NULL, runcv, seq);
3649 if (PERLDB_INTER && was != (I32)PL_sub_generation /* Some subs defined here. */
3651 /* Copy in anything fake and short. */
3652 my_strlcpy(safestr, fakestr, fakelen);
3654 return ok ? DOCATCH(PL_eval_start) : PL_op->op_next;
3664 register PERL_CONTEXT *cx;
3666 const U8 save_flags = PL_op -> op_flags;
3671 retop = cx->blk_eval.retop;
3674 if (gimme == G_VOID)
3676 else if (gimme == G_SCALAR) {
3679 if (SvFLAGS(TOPs) & SVs_TEMP)
3682 *MARK = sv_mortalcopy(TOPs);
3686 *MARK = &PL_sv_undef;
3691 /* in case LEAVE wipes old return values */
3692 for (mark = newsp + 1; mark <= SP; mark++) {
3693 if (!(SvFLAGS(*mark) & SVs_TEMP)) {
3694 *mark = sv_mortalcopy(*mark);
3695 TAINT_NOT; /* Each item is independent */
3699 PL_curpm = newpm; /* Don't pop $1 et al till now */
3702 assert(CvDEPTH(PL_compcv) == 1);
3704 CvDEPTH(PL_compcv) = 0;
3707 if (optype == OP_REQUIRE &&
3708 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
3710 /* Unassume the success we assumed earlier. */
3711 SV * const nsv = cx->blk_eval.old_namesv;
3712 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
3713 retop = Perl_die(aTHX_ "%"SVf" did not return a true value", SVfARG(nsv));
3714 /* die_where() did LEAVE, or we won't be here */
3718 if (!(save_flags & OPf_SPECIAL))
3719 sv_setpvn(ERRSV,"",0);
3725 /* Common code for Perl_call_sv and Perl_fold_constants, put here to keep it
3726 close to the related Perl_create_eval_scope. */
3728 Perl_delete_eval_scope(pTHX)
3733 register PERL_CONTEXT *cx;
3740 PERL_UNUSED_VAR(newsp);
3741 PERL_UNUSED_VAR(gimme);
3742 PERL_UNUSED_VAR(optype);
3745 /* Common-ish code salvaged from Perl_call_sv and pp_entertry, because it was
3746 also needed by Perl_fold_constants. */
3748 Perl_create_eval_scope(pTHX_ U32 flags)
3751 const I32 gimme = GIMME_V;
3756 PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), PL_stack_sp);
3759 PL_in_eval = EVAL_INEVAL;
3760 if (flags & G_KEEPERR)
3761 PL_in_eval |= EVAL_KEEPERR;
3763 sv_setpvn(ERRSV,"",0);
3764 if (flags & G_FAKINGEVAL) {
3765 PL_eval_root = PL_op; /* Only needed so that goto works right. */
3773 PERL_CONTEXT * const cx = create_eval_scope(0);
3774 cx->blk_eval.retop = cLOGOP->op_other->op_next;
3775 return DOCATCH(PL_op->op_next);
3784 register PERL_CONTEXT *cx;
3789 PERL_UNUSED_VAR(optype);
3792 if (gimme == G_VOID)
3794 else if (gimme == G_SCALAR) {
3798 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
3801 *MARK = sv_mortalcopy(TOPs);
3805 *MARK = &PL_sv_undef;
3810 /* in case LEAVE wipes old return values */
3812 for (mark = newsp + 1; mark <= SP; mark++) {
3813 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
3814 *mark = sv_mortalcopy(*mark);
3815 TAINT_NOT; /* Each item is independent */
3819 PL_curpm = newpm; /* Don't pop $1 et al till now */
3822 sv_setpvn(ERRSV,"",0);
3829 register PERL_CONTEXT *cx;
3830 const I32 gimme = GIMME_V;
3835 if (PL_op->op_targ == 0) {
3836 SV ** const defsv_p = &GvSV(PL_defgv);
3837 *defsv_p = newSVsv(POPs);
3838 SAVECLEARSV(*defsv_p);
3841 sv_setsv(PAD_SV(PL_op->op_targ), POPs);
3843 PUSHBLOCK(cx, CXt_GIVEN, SP);
3852 register PERL_CONTEXT *cx;
3856 PERL_UNUSED_CONTEXT;
3859 assert(CxTYPE(cx) == CXt_GIVEN);
3864 PL_curpm = newpm; /* pop $1 et al */
3871 /* Helper routines used by pp_smartmatch */
3873 S_make_matcher(pTHX_ REGEXP *re)
3876 PMOP *matcher = (PMOP *) newPMOP(OP_MATCH, OPf_WANT_SCALAR | OPf_STACKED);
3877 PM_SETRE(matcher, ReREFCNT_inc(re));
3879 SAVEFREEOP((OP *) matcher);
3886 S_matcher_matches_sv(pTHX_ PMOP *matcher, SV *sv)
3891 PL_op = (OP *) matcher;
3896 return (SvTRUEx(POPs));
3900 S_destroy_matcher(pTHX_ PMOP *matcher)
3903 PERL_UNUSED_ARG(matcher);
3908 /* Do a smart match */
3911 return do_smartmatch(NULL, NULL);
3914 /* This version of do_smartmatch() implements the
3915 * table of smart matches that is found in perlsyn.
3918 S_do_smartmatch(pTHX_ HV *seen_this, HV *seen_other)
3923 SV *e = TOPs; /* e is for 'expression' */
3924 SV *d = TOPm1s; /* d is for 'default', as in PL_defgv */
3925 SV *This, *Other; /* 'This' (and Other to match) to play with C++ */
3926 REGEXP *this_regex, *other_regex;
3928 # define NOT_EMPTY_PROTO(cv) (!SvPOK(cv) || SvCUR(cv) == 0)
3930 # define SM_REF(type) ( \
3931 (SvROK(d) && (SvTYPE(This = SvRV(d)) == SVt_##type) && (Other = e)) \
3932 || (SvROK(e) && (SvTYPE(This = SvRV(e)) == SVt_##type) && (Other = d)))
3934 # define SM_CV_NEP /* Find a code ref without an empty prototype */ \
3935 ((SvROK(d) && (SvTYPE(This = SvRV(d)) == SVt_PVCV) \
3936 && NOT_EMPTY_PROTO(This) && (Other = e)) \
3937 || (SvROK(e) && (SvTYPE(This = SvRV(e)) == SVt_PVCV) \
3938 && NOT_EMPTY_PROTO(This) && (Other = d)))
3940 # define SM_REGEX ( \
3941 (SvROK(d) && (SvTYPE(This = SvRV(d)) == SVt_REGEXP) \
3942 && (this_regex = (REGEXP*) This) \
3945 (SvROK(e) && (SvTYPE(This = SvRV(e)) == SVt_REGEXP) \
3946 && (this_regex = (REGEXP*) This) \
3950 # define SM_OTHER_REF(type) \
3951 (SvROK(Other) && SvTYPE(SvRV(Other)) == SVt_##type)
3953 # define SM_OTHER_REGEX (SvROK(Other) \
3954 && (SvTYPE(SvRV(Other)) == SVt_REGEXP) \
3955 && (other_regex = (REGEXP*) SvRV(Other)))
3958 # define SM_SEEN_THIS(sv) hv_exists_ent(seen_this, \
3959 sv_2mortal(newSViv(PTR2IV(sv))), 0)
3961 # define SM_SEEN_OTHER(sv) hv_exists_ent(seen_other, \
3962 sv_2mortal(newSViv(PTR2IV(sv))), 0)
3964 tryAMAGICbinSET(smart, 0);
3966 SP -= 2; /* Pop the values */
3968 /* Take care only to invoke mg_get() once for each argument.
3969 * Currently we do this by copying the SV if it's magical. */
3972 d = sv_mortalcopy(d);
3979 e = sv_mortalcopy(e);
3984 if ( SM_OTHER_REF(PVCV) && NOT_EMPTY_PROTO(SvRV(Other)) )
3986 if (This == SvRV(Other))
3997 c = call_sv(This, G_SCALAR);
4001 else if (SvTEMP(TOPs))
4002 SvREFCNT_inc_void(TOPs);
4007 else if (SM_REF(PVHV)) {
4008 if (SM_OTHER_REF(PVHV)) {
4009 /* Check that the key-sets are identical */
4011 HV *other_hv = (HV *) SvRV(Other);
4013 bool other_tied = FALSE;
4014 U32 this_key_count = 0,
4015 other_key_count = 0;
4017 /* Tied hashes don't know how many keys they have. */
4018 if (SvTIED_mg(This, PERL_MAGIC_tied)) {
4021 else if (SvTIED_mg((SV *) other_hv, PERL_MAGIC_tied)) {
4022 HV * const temp = other_hv;
4023 other_hv = (HV *) This;
4027 if (SvTIED_mg((SV *) other_hv, PERL_MAGIC_tied))
4030 if (!tied && HvUSEDKEYS((HV *) This) != HvUSEDKEYS(other_hv))
4033 /* The hashes have the same number of keys, so it suffices
4034 to check that one is a subset of the other. */
4035 (void) hv_iterinit((HV *) This);
4036 while ( (he = hv_iternext((HV *) This)) ) {
4038 char * const key = hv_iterkey(he, &key_len);
4042 if(!hv_exists(other_hv, key, key_len)) {
4043 (void) hv_iterinit((HV *) This); /* reset iterator */
4049 (void) hv_iterinit(other_hv);
4050 while ( hv_iternext(other_hv) )
4054 other_key_count = HvUSEDKEYS(other_hv);
4056 if (this_key_count != other_key_count)
4061 else if (SM_OTHER_REF(PVAV)) {
4062 AV * const other_av = (AV *) SvRV(Other);
4063 const I32 other_len = av_len(other_av) + 1;
4066 for (i = 0; i < other_len; ++i) {
4067 SV ** const svp = av_fetch(other_av, i, FALSE);
4071 if (svp) { /* ??? When can this not happen? */
4072 key = SvPV(*svp, key_len);
4073 if (hv_exists((HV *) This, key, key_len))
4079 else if (SM_OTHER_REGEX) {
4080 PMOP * const matcher = make_matcher(other_regex);
4083 (void) hv_iterinit((HV *) This);
4084 while ( (he = hv_iternext((HV *) This)) ) {
4085 if (matcher_matches_sv(matcher, hv_iterkeysv(he))) {
4086 (void) hv_iterinit((HV *) This);
4087 destroy_matcher(matcher);
4091 destroy_matcher(matcher);
4095 if (hv_exists_ent((HV *) This, Other, 0))
4101 else if (SM_REF(PVAV)) {
4102 if (SM_OTHER_REF(PVAV)) {
4103 AV *other_av = (AV *) SvRV(Other);
4104 if (av_len((AV *) This) != av_len(other_av))
4108 const I32 other_len = av_len(other_av);
4110 if (NULL == seen_this) {
4111 seen_this = newHV();
4112 (void) sv_2mortal((SV *) seen_this);
4114 if (NULL == seen_other) {
4115 seen_this = newHV();
4116 (void) sv_2mortal((SV *) seen_other);
4118 for(i = 0; i <= other_len; ++i) {
4119 SV * const * const this_elem = av_fetch((AV *)This, i, FALSE);
4120 SV * const * const other_elem = av_fetch(other_av, i, FALSE);
4122 if (!this_elem || !other_elem) {
4123 if (this_elem || other_elem)
4126 else if (SM_SEEN_THIS(*this_elem)
4127 || SM_SEEN_OTHER(*other_elem))
4129 if (*this_elem != *other_elem)
4133 (void)hv_store_ent(seen_this,
4134 sv_2mortal(newSViv(PTR2IV(*this_elem))),
4136 (void)hv_store_ent(seen_other,
4137 sv_2mortal(newSViv(PTR2IV(*other_elem))),
4143 (void) do_smartmatch(seen_this, seen_other);
4153 else if (SM_OTHER_REGEX) {
4154 PMOP * const matcher = make_matcher(other_regex);
4155 const I32 this_len = av_len((AV *) This);
4158 for(i = 0; i <= this_len; ++i) {
4159 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4160 if (svp && matcher_matches_sv(matcher, *svp)) {
4161 destroy_matcher(matcher);
4165 destroy_matcher(matcher);
4168 else if (SvIOK(Other) || SvNOK(Other)) {
4171 for(i = 0; i <= AvFILL((AV *) This); ++i) {
4172 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4179 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
4189 else if (SvPOK(Other)) {
4190 const I32 this_len = av_len((AV *) This);
4193 for(i = 0; i <= this_len; ++i) {
4194 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4209 else if (!SvOK(d) || !SvOK(e)) {
4210 if (!SvOK(d) && !SvOK(e))
4215 else if (SM_REGEX) {
4216 PMOP * const matcher = make_matcher(this_regex);
4219 PUSHs(matcher_matches_sv(matcher, Other)
4222 destroy_matcher(matcher);
4225 else if (SM_REF(PVCV)) {
4227 /* This must be a null-prototyped sub, because we
4228 already checked for the other kind. */
4234 c = call_sv(This, G_SCALAR);
4237 PUSHs(&PL_sv_undef);
4238 else if (SvTEMP(TOPs))
4239 SvREFCNT_inc_void(TOPs);
4241 if (SM_OTHER_REF(PVCV)) {
4242 /* This one has to be null-proto'd too.
4243 Call both of 'em, and compare the results */
4245 c = call_sv(SvRV(Other), G_SCALAR);
4248 PUSHs(&PL_sv_undef);
4249 else if (SvTEMP(TOPs))
4250 SvREFCNT_inc_void(TOPs);
4261 else if ( ((SvIOK(d) || SvNOK(d)) && (This = d) && (Other = e))
4262 || ((SvIOK(e) || SvNOK(e)) && (This = e) && (Other = d)) )
4264 if (SvPOK(Other) && !looks_like_number(Other)) {
4265 /* String comparison */
4270 /* Otherwise, numeric comparison */
4273 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
4284 /* As a last resort, use string comparison */
4293 register PERL_CONTEXT *cx;
4294 const I32 gimme = GIMME_V;
4296 /* This is essentially an optimization: if the match
4297 fails, we don't want to push a context and then
4298 pop it again right away, so we skip straight
4299 to the op that follows the leavewhen.
4301 if ((0 == (PL_op->op_flags & OPf_SPECIAL)) && !SvTRUEx(POPs))
4302 return cLOGOP->op_other->op_next;
4307 PUSHBLOCK(cx, CXt_WHEN, SP);
4316 register PERL_CONTEXT *cx;
4322 assert(CxTYPE(cx) == CXt_WHEN);
4327 PL_curpm = newpm; /* pop $1 et al */
4337 register PERL_CONTEXT *cx;
4340 cxix = dopoptowhen(cxstack_ix);
4342 DIE(aTHX_ "Can't \"continue\" outside a when block");
4343 if (cxix < cxstack_ix)
4346 /* clear off anything above the scope we're re-entering */
4347 inner = PL_scopestack_ix;
4349 if (PL_scopestack_ix < inner)
4350 leave_scope(PL_scopestack[PL_scopestack_ix]);
4351 PL_curcop = cx->blk_oldcop;
4352 return cx->blk_givwhen.leave_op;
4359 register PERL_CONTEXT *cx;
4362 cxix = dopoptogiven(cxstack_ix);
4364 if (PL_op->op_flags & OPf_SPECIAL)
4365 DIE(aTHX_ "Can't use when() outside a topicalizer");
4367 DIE(aTHX_ "Can't \"break\" outside a given block");
4369 if (CxFOREACH(&cxstack[cxix]) && (0 == (PL_op->op_flags & OPf_SPECIAL)))
4370 DIE(aTHX_ "Can't \"break\" in a loop topicalizer");
4372 if (cxix < cxstack_ix)
4375 /* clear off anything above the scope we're re-entering */
4376 inner = PL_scopestack_ix;
4378 if (PL_scopestack_ix < inner)
4379 leave_scope(PL_scopestack[PL_scopestack_ix]);
4380 PL_curcop = cx->blk_oldcop;
4383 return CX_LOOP_NEXTOP_GET(cx);
4385 return cx->blk_givwhen.leave_op;
4389 S_doparseform(pTHX_ SV *sv)
4392 register char *s = SvPV_force(sv, len);
4393 register char * const send = s + len;
4394 register char *base = NULL;
4395 register I32 skipspaces = 0;
4396 bool noblank = FALSE;
4397 bool repeat = FALSE;
4398 bool postspace = FALSE;
4404 bool unchopnum = FALSE;
4405 int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */
4408 Perl_croak(aTHX_ "Null picture in formline");
4410 /* estimate the buffer size needed */
4411 for (base = s; s <= send; s++) {
4412 if (*s == '\n' || *s == '@' || *s == '^')
4418 Newx(fops, maxops, U32);
4423 *fpc++ = FF_LINEMARK;
4424 noblank = repeat = FALSE;
4442 case ' ': case '\t':
4449 } /* else FALL THROUGH */
4457 *fpc++ = FF_LITERAL;
4465 *fpc++ = (U16)skipspaces;
4469 *fpc++ = FF_NEWLINE;
4473 arg = fpc - linepc + 1;
4480 *fpc++ = FF_LINEMARK;
4481 noblank = repeat = FALSE;
4490 ischop = s[-1] == '^';
4496 arg = (s - base) - 1;
4498 *fpc++ = FF_LITERAL;
4506 *fpc++ = 2; /* skip the @* or ^* */
4508 *fpc++ = FF_LINESNGL;
4511 *fpc++ = FF_LINEGLOB;
4513 else if (*s == '#' || (*s == '.' && s[1] == '#')) {
4514 arg = ischop ? 512 : 0;
4519 const char * const f = ++s;
4522 arg |= 256 + (s - f);
4524 *fpc++ = s - base; /* fieldsize for FETCH */
4525 *fpc++ = FF_DECIMAL;
4527 unchopnum |= ! ischop;
4529 else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
4530 arg = ischop ? 512 : 0;
4532 s++; /* skip the '0' first */
4536 const char * const f = ++s;
4539 arg |= 256 + (s - f);
4541 *fpc++ = s - base; /* fieldsize for FETCH */
4542 *fpc++ = FF_0DECIMAL;
4544 unchopnum |= ! ischop;
4548 bool ismore = FALSE;
4551 while (*++s == '>') ;
4552 prespace = FF_SPACE;
4554 else if (*s == '|') {
4555 while (*++s == '|') ;
4556 prespace = FF_HALFSPACE;
4561 while (*++s == '<') ;
4564 if (*s == '.' && s[1] == '.' && s[2] == '.') {
4568 *fpc++ = s - base; /* fieldsize for FETCH */
4570 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
4573 *fpc++ = (U16)prespace;
4587 assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */
4589 { /* need to jump to the next word */
4591 z = WORD_ALIGN - SvCUR(sv) % WORD_ALIGN;
4592 SvGROW(sv, SvCUR(sv) + z + arg * sizeof(U32) + 4);
4593 s = SvPVX(sv) + SvCUR(sv) + z;
4595 Copy(fops, s, arg, U32);
4597 sv_magic(sv, NULL, PERL_MAGIC_fm, NULL, 0);
4600 if (unchopnum && repeat)
4601 DIE(aTHX_ "Repeated format line will never terminate (~~ and @#)");
4607 S_num_overflow(NV value, I32 fldsize, I32 frcsize)
4609 /* Can value be printed in fldsize chars, using %*.*f ? */
4613 int intsize = fldsize - (value < 0 ? 1 : 0);
4620 while (intsize--) pwr *= 10.0;
4621 while (frcsize--) eps /= 10.0;
4624 if (value + eps >= pwr)
4627 if (value - eps <= -pwr)
4634 S_run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen)
4637 SV * const datasv = FILTER_DATA(idx);
4638 const int filter_has_file = IoLINES(datasv);
4639 SV * const filter_state = (SV *)IoTOP_GV(datasv);
4640 SV * const filter_sub = (SV *)IoBOTTOM_GV(datasv);
4644 const char *got_p = NULL;
4645 const char *prune_from = NULL;
4646 bool read_from_cache = FALSE;
4649 assert(maxlen >= 0);
4652 /* I was having segfault trouble under Linux 2.2.5 after a
4653 parse error occured. (Had to hack around it with a test
4654 for PL_parser->error_count == 0.) Solaris doesn't segfault --
4655 not sure where the trouble is yet. XXX */
4657 if (IoFMT_GV(datasv)) {
4658 SV *const cache = (SV *)IoFMT_GV(datasv);
4661 const char *cache_p = SvPV(cache, cache_len);
4665 /* Running in block mode and we have some cached data already.
4667 if (cache_len >= umaxlen) {
4668 /* In fact, so much data we don't even need to call
4673 const char *const first_nl =
4674 (const char *)memchr(cache_p, '\n', cache_len);
4676 take = first_nl + 1 - cache_p;
4680 sv_catpvn(buf_sv, cache_p, take);
4681 sv_chop(cache, cache_p + take);
4682 /* Definately not EOF */
4686 sv_catsv(buf_sv, cache);
4688 umaxlen -= cache_len;
4691 read_from_cache = TRUE;
4695 /* Filter API says that the filter appends to the contents of the buffer.
4696 Usually the buffer is "", so the details don't matter. But if it's not,
4697 then clearly what it contains is already filtered by this filter, so we
4698 don't want to pass it in a second time.
4699 I'm going to use a mortal in case the upstream filter croaks. */
4700 upstream = ((SvOK(buf_sv) && sv_len(buf_sv)) || SvGMAGICAL(buf_sv))
4701 ? sv_newmortal() : buf_sv;
4702 SvUPGRADE(upstream, SVt_PV);
4704 if (filter_has_file) {
4705 status = FILTER_READ(idx+1, upstream, 0);
4708 if (filter_sub && status >= 0) {
4721 PUSHs(filter_state);
4724 count = call_sv(filter_sub, G_SCALAR);
4739 if(SvOK(upstream)) {
4740 got_p = SvPV(upstream, got_len);
4742 if (got_len > umaxlen) {
4743 prune_from = got_p + umaxlen;
4746 const char *const first_nl =
4747 (const char *)memchr(got_p, '\n', got_len);
4748 if (first_nl && first_nl + 1 < got_p + got_len) {
4749 /* There's a second line here... */
4750 prune_from = first_nl + 1;
4755 /* Oh. Too long. Stuff some in our cache. */
4756 STRLEN cached_len = got_p + got_len - prune_from;
4757 SV *cache = (SV *)IoFMT_GV(datasv);
4760 IoFMT_GV(datasv) = (GV*) (cache = newSV(got_len - umaxlen));
4761 } else if (SvOK(cache)) {
4762 /* Cache should be empty. */
4763 assert(!SvCUR(cache));
4766 sv_setpvn(cache, prune_from, cached_len);
4767 /* If you ask for block mode, you may well split UTF-8 characters.
4768 "If it breaks, you get to keep both parts"
4769 (Your code is broken if you don't put them back together again
4770 before something notices.) */
4771 if (SvUTF8(upstream)) {
4774 SvCUR_set(upstream, got_len - cached_len);
4775 /* Can't yet be EOF */
4780 /* If they are at EOF but buf_sv has something in it, then they may never
4781 have touched the SV upstream, so it may be undefined. If we naively
4782 concatenate it then we get a warning about use of uninitialised value.
4784 if (upstream != buf_sv && (SvOK(upstream) || SvGMAGICAL(upstream))) {
4785 sv_catsv(buf_sv, upstream);
4789 IoLINES(datasv) = 0;
4790 SvREFCNT_dec(IoFMT_GV(datasv));
4792 SvREFCNT_dec(filter_state);
4793 IoTOP_GV(datasv) = NULL;
4796 SvREFCNT_dec(filter_sub);
4797 IoBOTTOM_GV(datasv) = NULL;
4799 filter_del(S_run_user_filter);
4801 if (status == 0 && read_from_cache) {
4802 /* If we read some data from the cache (and by getting here it implies
4803 that we emptied the cache) then we aren't yet at EOF, and mustn't
4804 report that to our caller. */
4810 /* perhaps someone can come up with a better name for
4811 this? it is not really "absolute", per se ... */
4813 S_path_is_absolute(const char *name)
4815 if (PERL_FILE_IS_ABSOLUTE(name)
4816 #ifdef MACOS_TRADITIONAL
4819 || (*name == '.' && (name[1] == '/' ||
4820 (name[1] == '.' && name[2] == '/')))
4832 * c-indentation-style: bsd
4834 * indent-tabs-mode: t
4837 * ex: set ts=8 sts=4 sw=4 noet: