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))
136 PM_SETRE(pm, NULL); /* crucial if regcomp aborts */
138 if (PL_op->op_flags & OPf_SPECIAL)
139 PL_reginterp_cnt = I32_MAX; /* Mark as safe. */
141 pm->op_pmflags = pm->op_pmpermflags; /* reset case sensitivity */
143 pm->op_pmdynflags |= PMdf_DYN_UTF8;
145 pm->op_pmdynflags &= ~PMdf_DYN_UTF8;
146 if (pm->op_pmdynflags & PMdf_UTF8)
147 t = (char*)bytes_to_utf8((U8*)t, &len);
149 PM_SETRE(pm, CALLREGCOMP((char *)t, (char *)t + len, pm));
150 if (!DO_UTF8(tmpstr) && (pm->op_pmdynflags & PMdf_UTF8))
152 PL_reginterp_cnt = 0; /* XXXX Be extra paranoid - needed
153 inside tie/overload accessors. */
157 #ifndef INCOMPLETE_TAINTS
160 pm->op_pmdynflags |= PMdf_TAINTED;
162 pm->op_pmdynflags &= ~PMdf_TAINTED;
166 if (!PM_GETRE(pm)->prelen && PL_curpm)
168 else if (strEQ("\\s+", PM_GETRE(pm)->precomp))
169 pm->op_pmflags |= PMf_WHITE;
171 pm->op_pmflags &= ~PMf_WHITE;
173 /* XXX runtime compiled output needs to move to the pad */
174 if (pm->op_pmflags & PMf_KEEP) {
175 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
176 #if !defined(USE_ITHREADS)
177 /* XXX can't change the optree at runtime either */
178 cLOGOP->op_first->op_next = PL_op->op_next;
188 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
189 register PMOP * const pm = (PMOP*) cLOGOP->op_other;
190 register SV * const dstr = cx->sb_dstr;
191 register char *s = cx->sb_s;
192 register char *m = cx->sb_m;
193 char *orig = cx->sb_orig;
194 register REGEXP * const rx = cx->sb_rx;
196 REGEXP *old = PM_GETRE(pm);
200 PM_SETRE(pm,ReREFCNT_inc(rx));
203 rxres_restore(&cx->sb_rxres, rx);
204 RX_MATCH_UTF8_set(rx, DO_UTF8(cx->sb_targ));
206 if (cx->sb_iters++) {
207 const I32 saviters = cx->sb_iters;
208 if (cx->sb_iters > cx->sb_maxiters)
209 DIE(aTHX_ "Substitution loop");
211 if (!(cx->sb_rxtainted & 2) && SvTAINTED(TOPs))
212 cx->sb_rxtainted |= 2;
213 sv_catsv(dstr, POPs);
214 FREETMPS; /* Prevent excess tmp stack */
217 if (cx->sb_once || !CALLREGEXEC(rx, s, cx->sb_strend, orig,
218 s == m, cx->sb_targ, NULL,
219 ((cx->sb_rflags & REXEC_COPY_STR)
220 ? (REXEC_IGNOREPOS|REXEC_NOT_FIRST)
221 : (REXEC_COPY_STR|REXEC_IGNOREPOS|REXEC_NOT_FIRST))))
223 SV * const targ = cx->sb_targ;
225 assert(cx->sb_strend >= s);
226 if(cx->sb_strend > s) {
227 if (DO_UTF8(dstr) && !SvUTF8(targ))
228 sv_catpvn_utf8_upgrade(dstr, s, cx->sb_strend - s, nsv);
230 sv_catpvn(dstr, s, cx->sb_strend - s);
232 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
234 #ifdef PERL_OLD_COPY_ON_WRITE
236 sv_force_normal_flags(targ, SV_COW_DROP_PV);
242 SvPV_set(targ, SvPVX(dstr));
243 SvCUR_set(targ, SvCUR(dstr));
244 SvLEN_set(targ, SvLEN(dstr));
247 SvPV_set(dstr, NULL);
249 TAINT_IF(cx->sb_rxtainted & 1);
250 PUSHs(sv_2mortal(newSViv(saviters - 1)));
252 (void)SvPOK_only_UTF8(targ);
253 TAINT_IF(cx->sb_rxtainted);
257 LEAVE_SCOPE(cx->sb_oldsave);
259 RETURNOP(pm->op_next);
261 cx->sb_iters = saviters;
263 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
266 cx->sb_orig = orig = rx->subbeg;
268 cx->sb_strend = s + (cx->sb_strend - m);
270 cx->sb_m = m = rx->startp[0] + orig;
272 if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
273 sv_catpvn_utf8_upgrade(dstr, s, m - s, nsv);
275 sv_catpvn(dstr, s, m-s);
277 cx->sb_s = rx->endp[0] + orig;
278 { /* Update the pos() information. */
279 SV * const sv = cx->sb_targ;
282 if (SvTYPE(sv) < SVt_PVMG)
283 SvUPGRADE(sv, SVt_PVMG);
284 if (!(mg = mg_find(sv, PERL_MAGIC_regex_global))) {
285 #ifdef PERL_OLD_COPY_ON_WRITE
287 sv_force_normal_flags(sv, 0);
289 mg = sv_magicext(sv, NULL, PERL_MAGIC_regex_global, &PL_vtbl_mglob,
298 (void)ReREFCNT_inc(rx);
299 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
300 rxres_save(&cx->sb_rxres, rx);
301 RETURNOP(pm->op_pmreplstart);
305 Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
311 if (!p || p[1] < rx->nparens) {
312 #ifdef PERL_OLD_COPY_ON_WRITE
313 i = 7 + rx->nparens * 2;
315 i = 6 + rx->nparens * 2;
324 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? rx->subbeg : NULL);
325 RX_MATCH_COPIED_off(rx);
327 #ifdef PERL_OLD_COPY_ON_WRITE
328 *p++ = PTR2UV(rx->saved_copy);
329 rx->saved_copy = NULL;
334 *p++ = PTR2UV(rx->subbeg);
335 *p++ = (UV)rx->sublen;
336 for (i = 0; i <= rx->nparens; ++i) {
337 *p++ = (UV)rx->startp[i];
338 *p++ = (UV)rx->endp[i];
343 Perl_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
349 RX_MATCH_COPY_FREE(rx);
350 RX_MATCH_COPIED_set(rx, *p);
353 #ifdef PERL_OLD_COPY_ON_WRITE
355 SvREFCNT_dec (rx->saved_copy);
356 rx->saved_copy = INT2PTR(SV*,*p);
362 rx->subbeg = INT2PTR(char*,*p++);
363 rx->sublen = (I32)(*p++);
364 for (i = 0; i <= rx->nparens; ++i) {
365 rx->startp[i] = (I32)(*p++);
366 rx->endp[i] = (I32)(*p++);
371 Perl_rxres_free(pTHX_ void **rsp)
373 UV * const p = (UV*)*rsp;
378 void *tmp = INT2PTR(char*,*p);
381 PoisonFree(*p, 1, sizeof(*p));
383 Safefree(INT2PTR(char*,*p));
385 #ifdef PERL_OLD_COPY_ON_WRITE
387 SvREFCNT_dec (INT2PTR(SV*,p[1]));
397 dVAR; dSP; dMARK; dORIGMARK;
398 register SV * const tmpForm = *++MARK;
403 register SV *sv = NULL;
404 const char *item = NULL;
408 bool chopspace = (strchr(PL_chopset, ' ') != NULL);
409 const char *chophere = NULL;
410 char *linemark = NULL;
412 bool gotsome = FALSE;
414 const STRLEN fudge = SvPOK(tmpForm)
415 ? (SvCUR(tmpForm) * (IN_BYTES ? 1 : 3) + 1) : 0;
416 bool item_is_utf8 = FALSE;
417 bool targ_is_utf8 = FALSE;
419 OP * parseres = NULL;
423 if (!SvMAGICAL(tmpForm) || !SvCOMPILED(tmpForm)) {
424 if (SvREADONLY(tmpForm)) {
425 SvREADONLY_off(tmpForm);
426 parseres = doparseform(tmpForm);
427 SvREADONLY_on(tmpForm);
430 parseres = doparseform(tmpForm);
434 SvPV_force(PL_formtarget, len);
435 if (DO_UTF8(PL_formtarget))
437 t = SvGROW(PL_formtarget, len + fudge + 1); /* XXX SvCUR bad */
439 f = SvPV_const(tmpForm, len);
440 /* need to jump to the next word */
441 fpc = (U32*)(f + len + WORD_ALIGN - SvCUR(tmpForm) % WORD_ALIGN);
445 const char *name = "???";
448 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
449 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
450 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
451 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
452 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
454 case FF_CHECKNL: name = "CHECKNL"; break;
455 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
456 case FF_SPACE: name = "SPACE"; break;
457 case FF_HALFSPACE: name = "HALFSPACE"; break;
458 case FF_ITEM: name = "ITEM"; break;
459 case FF_CHOP: name = "CHOP"; break;
460 case FF_LINEGLOB: name = "LINEGLOB"; break;
461 case FF_NEWLINE: name = "NEWLINE"; break;
462 case FF_MORE: name = "MORE"; break;
463 case FF_LINEMARK: name = "LINEMARK"; break;
464 case FF_END: name = "END"; break;
465 case FF_0DECIMAL: name = "0DECIMAL"; break;
466 case FF_LINESNGL: name = "LINESNGL"; break;
469 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
471 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
482 if (targ_is_utf8 && !SvUTF8(tmpForm)) {
483 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
485 sv_catpvn_utf8_upgrade(PL_formtarget, f, arg, nsv);
486 t = SvEND(PL_formtarget);
489 if (!targ_is_utf8 && DO_UTF8(tmpForm)) {
490 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
492 sv_utf8_upgrade(PL_formtarget);
493 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
494 t = SvEND(PL_formtarget);
514 if (ckWARN(WARN_SYNTAX))
515 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
522 const char *s = item = SvPV_const(sv, len);
525 itemsize = sv_len_utf8(sv);
526 if (itemsize != (I32)len) {
528 if (itemsize > fieldsize) {
529 itemsize = fieldsize;
530 itembytes = itemsize;
531 sv_pos_u2b(sv, &itembytes, 0);
535 send = chophere = s + itembytes;
545 sv_pos_b2u(sv, &itemsize);
549 item_is_utf8 = FALSE;
550 if (itemsize > fieldsize)
551 itemsize = fieldsize;
552 send = chophere = s + itemsize;
566 const char *s = item = SvPV_const(sv, len);
569 itemsize = sv_len_utf8(sv);
570 if (itemsize != (I32)len) {
572 if (itemsize <= fieldsize) {
573 const char *send = chophere = s + itemsize;
586 itemsize = fieldsize;
587 itembytes = itemsize;
588 sv_pos_u2b(sv, &itembytes, 0);
589 send = chophere = s + itembytes;
590 while (s < send || (s == send && isSPACE(*s))) {
600 if (strchr(PL_chopset, *s))
605 itemsize = chophere - item;
606 sv_pos_b2u(sv, &itemsize);
612 item_is_utf8 = FALSE;
613 if (itemsize <= fieldsize) {
614 const char *const send = chophere = s + itemsize;
627 itemsize = fieldsize;
628 send = chophere = s + itemsize;
629 while (s < send || (s == send && isSPACE(*s))) {
639 if (strchr(PL_chopset, *s))
644 itemsize = chophere - item;
650 arg = fieldsize - itemsize;
659 arg = fieldsize - itemsize;
670 const char *s = item;
674 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
676 sv_utf8_upgrade(PL_formtarget);
677 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
678 t = SvEND(PL_formtarget);
682 if (UTF8_IS_CONTINUED(*s)) {
683 STRLEN skip = UTF8SKIP(s);
700 if ( !((*t++ = *s++) & ~31) )
706 if (targ_is_utf8 && !item_is_utf8) {
707 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
709 sv_catpvn_utf8_upgrade(PL_formtarget, s, arg, nsv);
710 for (; t < SvEND(PL_formtarget); t++) {
723 const int ch = *t++ = *s++;
726 if ( !((*t++ = *s++) & ~31) )
735 const char *s = chophere;
753 const char *s = item = SvPV_const(sv, len);
755 if ((item_is_utf8 = DO_UTF8(sv)))
756 itemsize = sv_len_utf8(sv);
758 bool chopped = FALSE;
759 const char *const send = s + len;
761 chophere = s + itemsize;
777 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
779 SvUTF8_on(PL_formtarget);
781 SvCUR_set(sv, chophere - item);
782 sv_catsv(PL_formtarget, sv);
783 SvCUR_set(sv, itemsize);
785 sv_catsv(PL_formtarget, sv);
787 SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) - 1);
788 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
789 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
798 #if defined(USE_LONG_DOUBLE)
801 "%#0*.*" PERL_PRIfldbl : "%0*.*" PERL_PRIfldbl);
805 "%#0*.*f" : "%0*.*f");
810 #if defined(USE_LONG_DOUBLE)
812 ((arg & 256) ? "%#*.*" PERL_PRIfldbl : "%*.*" PERL_PRIfldbl);
815 ((arg & 256) ? "%#*.*f" : "%*.*f");
818 /* If the field is marked with ^ and the value is undefined,
820 if ((arg & 512) && !SvOK(sv)) {
828 /* overflow evidence */
829 if (num_overflow(value, fieldsize, arg)) {
835 /* Formats aren't yet marked for locales, so assume "yes". */
837 STORE_NUMERIC_STANDARD_SET_LOCAL();
838 my_snprintf(t, SvLEN(PL_formtarget) - (t - SvPVX(PL_formtarget)), fmt, (int) fieldsize, (int) arg & 255, value);
839 RESTORE_NUMERIC_STANDARD();
846 while (t-- > linemark && *t == ' ') ;
854 if (arg) { /* repeat until fields exhausted? */
856 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
857 lines += FmLINES(PL_formtarget);
860 if (strnEQ(linemark, linemark - arg, arg))
861 DIE(aTHX_ "Runaway format");
864 SvUTF8_on(PL_formtarget);
865 FmLINES(PL_formtarget) = lines;
867 RETURNOP(cLISTOP->op_first);
878 const char *s = chophere;
879 const char *send = item + len;
881 while (isSPACE(*s) && (s < send))
886 arg = fieldsize - itemsize;
893 if (strnEQ(s1," ",3)) {
894 while (s1 > SvPVX_const(PL_formtarget) && isSPACE(s1[-1]))
905 SvCUR_set(PL_formtarget, t - SvPVX_const(PL_formtarget));
907 SvUTF8_on(PL_formtarget);
908 FmLINES(PL_formtarget) += lines;
920 if (PL_stack_base + *PL_markstack_ptr == SP) {
922 if (GIMME_V == G_SCALAR)
923 XPUSHs(sv_2mortal(newSViv(0)));
924 RETURNOP(PL_op->op_next->op_next);
926 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
927 pp_pushmark(); /* push dst */
928 pp_pushmark(); /* push src */
929 ENTER; /* enter outer scope */
932 if (PL_op->op_private & OPpGREP_LEX)
933 SAVESPTR(PAD_SVl(PL_op->op_targ));
936 ENTER; /* enter inner scope */
939 src = PL_stack_base[*PL_markstack_ptr];
941 if (PL_op->op_private & OPpGREP_LEX)
942 PAD_SVl(PL_op->op_targ) = src;
947 if (PL_op->op_type == OP_MAPSTART)
948 pp_pushmark(); /* push top */
949 return ((LOGOP*)PL_op->op_next)->op_other;
955 const I32 gimme = GIMME_V;
956 I32 items = (SP - PL_stack_base) - *PL_markstack_ptr; /* how many new items */
962 /* first, move source pointer to the next item in the source list */
963 ++PL_markstack_ptr[-1];
965 /* if there are new items, push them into the destination list */
966 if (items && gimme != G_VOID) {
967 /* might need to make room back there first */
968 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
969 /* XXX this implementation is very pessimal because the stack
970 * is repeatedly extended for every set of items. Is possible
971 * to do this without any stack extension or copying at all
972 * by maintaining a separate list over which the map iterates
973 * (like foreach does). --gsar */
975 /* everything in the stack after the destination list moves
976 * towards the end the stack by the amount of room needed */
977 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
979 /* items to shift up (accounting for the moved source pointer) */
980 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
982 /* This optimization is by Ben Tilly and it does
983 * things differently from what Sarathy (gsar)
984 * is describing. The downside of this optimization is
985 * that leaves "holes" (uninitialized and hopefully unused areas)
986 * to the Perl stack, but on the other hand this
987 * shouldn't be a problem. If Sarathy's idea gets
988 * implemented, this optimization should become
989 * irrelevant. --jhi */
991 shift = count; /* Avoid shifting too often --Ben Tilly */
996 PL_markstack_ptr[-1] += shift;
997 *PL_markstack_ptr += shift;
1001 /* copy the new items down to the destination list */
1002 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
1003 if (gimme == G_ARRAY) {
1005 *dst-- = SvTEMP(TOPs) ? POPs : sv_mortalcopy(POPs);
1008 /* scalar context: we don't care about which values map returns
1009 * (we use undef here). And so we certainly don't want to do mortal
1010 * copies of meaningless values. */
1011 while (items-- > 0) {
1013 *dst-- = &PL_sv_undef;
1017 LEAVE; /* exit inner scope */
1020 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
1022 (void)POPMARK; /* pop top */
1023 LEAVE; /* exit outer scope */
1024 (void)POPMARK; /* pop src */
1025 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1026 (void)POPMARK; /* pop dst */
1027 SP = PL_stack_base + POPMARK; /* pop original mark */
1028 if (gimme == G_SCALAR) {
1029 if (PL_op->op_private & OPpGREP_LEX) {
1030 SV* sv = sv_newmortal();
1031 sv_setiv(sv, items);
1039 else if (gimme == G_ARRAY)
1046 ENTER; /* enter inner scope */
1049 /* set $_ to the new source item */
1050 src = PL_stack_base[PL_markstack_ptr[-1]];
1052 if (PL_op->op_private & OPpGREP_LEX)
1053 PAD_SVl(PL_op->op_targ) = src;
1057 RETURNOP(cLOGOP->op_other);
1066 if (GIMME == G_ARRAY)
1068 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1069 return cLOGOP->op_other;
1079 if (GIMME == G_ARRAY) {
1080 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1084 SV * const targ = PAD_SV(PL_op->op_targ);
1087 if (PL_op->op_private & OPpFLIP_LINENUM) {
1088 if (GvIO(PL_last_in_gv)) {
1089 flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1092 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1094 flip = SvIV(sv) == SvIV(GvSV(gv));
1100 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
1101 if (PL_op->op_flags & OPf_SPECIAL) {
1109 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1112 sv_setpvn(TARG, "", 0);
1118 /* This code tries to decide if "$left .. $right" should use the
1119 magical string increment, or if the range is numeric (we make
1120 an exception for .."0" [#18165]). AMS 20021031. */
1122 #define RANGE_IS_NUMERIC(left,right) ( \
1123 SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1124 SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
1125 (((!SvOK(left) && SvOK(right)) || ((!SvOK(left) || \
1126 looks_like_number(left)) && SvPOKp(left) && *SvPVX_const(left) != '0')) \
1127 && (!SvOK(right) || looks_like_number(right))))
1133 if (GIMME == G_ARRAY) {
1139 if (RANGE_IS_NUMERIC(left,right)) {
1142 if ((SvOK(left) && SvNV(left) < IV_MIN) ||
1143 (SvOK(right) && SvNV(right) > IV_MAX))
1144 DIE(aTHX_ "Range iterator outside integer range");
1155 SV * const sv = sv_2mortal(newSViv(i++));
1160 SV * const final = sv_mortalcopy(right);
1162 const char * const tmps = SvPV_const(final, len);
1164 SV *sv = sv_mortalcopy(left);
1165 SvPV_force_nolen(sv);
1166 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
1168 if (strEQ(SvPVX_const(sv),tmps))
1170 sv = sv_2mortal(newSVsv(sv));
1177 SV * const targ = PAD_SV(cUNOP->op_first->op_targ);
1181 if (PL_op->op_private & OPpFLIP_LINENUM) {
1182 if (GvIO(PL_last_in_gv)) {
1183 flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1186 GV * const gv = gv_fetchpvs(".", GV_ADD|GV_NOTQUAL, SVt_PV);
1187 if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1195 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
1196 sv_catpvs(targ, "E0");
1206 static const char * const context_name[] = {
1219 S_dopoptolabel(pTHX_ const char *label)
1224 for (i = cxstack_ix; i >= 0; i--) {
1225 register const PERL_CONTEXT * const cx = &cxstack[i];
1226 switch (CxTYPE(cx)) {
1234 if (ckWARN(WARN_EXITING))
1235 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1236 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1237 if (CxTYPE(cx) == CXt_NULL)
1241 if ( !cx->blk_loop.label || strNE(label, cx->blk_loop.label) ) {
1242 DEBUG_l(Perl_deb(aTHX_ "(Skipping label #%ld %s)\n",
1243 (long)i, cx->blk_loop.label));
1246 DEBUG_l( Perl_deb(aTHX_ "(Found label #%ld %s)\n", (long)i, label));
1256 Perl_dowantarray(pTHX)
1259 const I32 gimme = block_gimme();
1260 return (gimme == G_VOID) ? G_SCALAR : gimme;
1264 Perl_block_gimme(pTHX)
1267 const I32 cxix = dopoptosub(cxstack_ix);
1271 switch (cxstack[cxix].blk_gimme) {
1279 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
1286 Perl_is_lvalue_sub(pTHX)
1289 const I32 cxix = dopoptosub(cxstack_ix);
1290 assert(cxix >= 0); /* We should only be called from inside subs */
1292 if (cxstack[cxix].blk_sub.lval && CvLVALUE(cxstack[cxix].blk_sub.cv))
1293 return cxstack[cxix].blk_sub.lval;
1299 S_dopoptosub(pTHX_ I32 startingblock)
1302 return dopoptosub_at(cxstack, startingblock);
1306 S_dopoptosub_at(pTHX_ const PERL_CONTEXT *cxstk, I32 startingblock)
1310 for (i = startingblock; i >= 0; i--) {
1311 register const PERL_CONTEXT * const cx = &cxstk[i];
1312 switch (CxTYPE(cx)) {
1318 DEBUG_l( Perl_deb(aTHX_ "(Found sub #%ld)\n", (long)i));
1326 S_dopoptoeval(pTHX_ I32 startingblock)
1330 for (i = startingblock; i >= 0; i--) {
1331 register const PERL_CONTEXT *cx = &cxstack[i];
1332 switch (CxTYPE(cx)) {
1336 DEBUG_l( Perl_deb(aTHX_ "(Found eval #%ld)\n", (long)i));
1344 S_dopoptoloop(pTHX_ I32 startingblock)
1348 for (i = startingblock; i >= 0; i--) {
1349 register const PERL_CONTEXT * const cx = &cxstack[i];
1350 switch (CxTYPE(cx)) {
1356 if (ckWARN(WARN_EXITING))
1357 Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1358 context_name[CxTYPE(cx)], OP_NAME(PL_op));
1359 if ((CxTYPE(cx)) == CXt_NULL)
1363 DEBUG_l( Perl_deb(aTHX_ "(Found loop #%ld)\n", (long)i));
1371 S_dopoptogiven(pTHX_ I32 startingblock)
1375 for (i = startingblock; i >= 0; i--) {
1376 register const PERL_CONTEXT *cx = &cxstack[i];
1377 switch (CxTYPE(cx)) {
1381 DEBUG_l( Perl_deb(aTHX_ "(Found given #%ld)\n", (long)i));
1384 if (CxFOREACHDEF(cx)) {
1385 DEBUG_l( Perl_deb(aTHX_ "(Found foreach #%ld)\n", (long)i));
1394 S_dopoptowhen(pTHX_ I32 startingblock)
1398 for (i = startingblock; i >= 0; i--) {
1399 register const PERL_CONTEXT *cx = &cxstack[i];
1400 switch (CxTYPE(cx)) {
1404 DEBUG_l( Perl_deb(aTHX_ "(Found when #%ld)\n", (long)i));
1412 Perl_dounwind(pTHX_ I32 cxix)
1417 while (cxstack_ix > cxix) {
1419 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
1420 DEBUG_l(PerlIO_printf(Perl_debug_log, "Unwinding block %ld, type %s\n",
1421 (long) cxstack_ix, PL_block_type[CxTYPE(cx)]));
1422 /* Note: we don't need to restore the base context info till the end. */
1423 switch (CxTYPE(cx)) {
1426 continue; /* not break */
1445 PERL_UNUSED_VAR(optype);
1449 Perl_qerror(pTHX_ SV *err)
1453 sv_catsv(ERRSV, err);
1455 sv_catsv(PL_errors, err);
1457 Perl_warn(aTHX_ "%"SVf, (void*)err);
1462 Perl_die_where(pTHX_ const char *message, STRLEN msglen)
1471 if (PL_in_eval & EVAL_KEEPERR) {
1472 static const char prefix[] = "\t(in cleanup) ";
1473 SV * const err = ERRSV;
1474 const char *e = NULL;
1476 sv_setpvn(err,"",0);
1477 else if (SvCUR(err) >= sizeof(prefix)+msglen-1) {
1479 e = SvPV_const(err, len);
1481 if (*e != *message || strNE(e,message))
1485 SvGROW(err, SvCUR(err)+sizeof(prefix)+msglen);
1486 sv_catpvn(err, prefix, sizeof(prefix)-1);
1487 sv_catpvn(err, message, msglen);
1488 if (ckWARN(WARN_MISC)) {
1489 const STRLEN start = SvCUR(err)-msglen-sizeof(prefix)+1;
1490 Perl_warner(aTHX_ packWARN(WARN_MISC), SvPVX_const(err)+start);
1495 sv_setpvn(ERRSV, message, msglen);
1499 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1500 && PL_curstackinfo->si_prev)
1508 register PERL_CONTEXT *cx;
1511 if (cxix < cxstack_ix)
1514 POPBLOCK(cx,PL_curpm);
1515 if (CxTYPE(cx) != CXt_EVAL) {
1517 message = SvPVx_const(ERRSV, msglen);
1518 PerlIO_write(Perl_error_log, (const char *)"panic: die ", 11);
1519 PerlIO_write(Perl_error_log, message, msglen);
1524 if (gimme == G_SCALAR)
1525 *++newsp = &PL_sv_undef;
1526 PL_stack_sp = newsp;
1530 /* LEAVE could clobber PL_curcop (see save_re_context())
1531 * XXX it might be better to find a way to avoid messing with
1532 * PL_curcop in save_re_context() instead, but this is a more
1533 * minimal fix --GSAR */
1534 PL_curcop = cx->blk_oldcop;
1536 if (optype == OP_REQUIRE) {
1537 const char* const msg = SvPVx_nolen_const(ERRSV);
1538 SV * const nsv = cx->blk_eval.old_namesv;
1539 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
1541 DIE(aTHX_ "%sCompilation failed in require",
1542 *msg ? msg : "Unknown error\n");
1544 assert(CxTYPE(cx) == CXt_EVAL);
1545 return cx->blk_eval.retop;
1549 message = SvPVx_const(ERRSV, msglen);
1551 write_to_stderr(message, msglen);
1559 dVAR; dSP; dPOPTOPssrl;
1560 if (SvTRUE(left) != SvTRUE(right))
1570 register I32 cxix = dopoptosub(cxstack_ix);
1571 register const PERL_CONTEXT *cx;
1572 register const PERL_CONTEXT *ccstack = cxstack;
1573 const PERL_SI *top_si = PL_curstackinfo;
1575 const char *stashname;
1582 /* we may be in a higher stacklevel, so dig down deeper */
1583 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1584 top_si = top_si->si_prev;
1585 ccstack = top_si->si_cxstack;
1586 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1589 if (GIMME != G_ARRAY) {
1595 /* caller() should not report the automatic calls to &DB::sub */
1596 if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 &&
1597 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1601 cxix = dopoptosub_at(ccstack, cxix - 1);
1604 cx = &ccstack[cxix];
1605 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1606 const I32 dbcxix = dopoptosub_at(ccstack, cxix - 1);
1607 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1608 field below is defined for any cx. */
1609 /* caller() should not report the automatic calls to &DB::sub */
1610 if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1611 cx = &ccstack[dbcxix];
1614 stashname = CopSTASHPV(cx->blk_oldcop);
1615 if (GIMME != G_ARRAY) {
1618 PUSHs(&PL_sv_undef);
1621 sv_setpv(TARG, stashname);
1630 PUSHs(&PL_sv_undef);
1632 PUSHs(sv_2mortal(newSVpv(stashname, 0)));
1633 PUSHs(sv_2mortal(newSVpv(OutCopFILE(cx->blk_oldcop), 0)));
1634 PUSHs(sv_2mortal(newSViv((I32)CopLINE(cx->blk_oldcop))));
1637 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1638 GV * const cvgv = CvGV(ccstack[cxix].blk_sub.cv);
1639 /* So is ccstack[dbcxix]. */
1641 SV * const sv = newSV(0);
1642 gv_efullname3(sv, cvgv, NULL);
1643 PUSHs(sv_2mortal(sv));
1644 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1647 PUSHs(sv_2mortal(newSVpvs("(unknown)")));
1648 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1652 PUSHs(sv_2mortal(newSVpvs("(eval)")));
1653 PUSHs(sv_2mortal(newSViv(0)));
1655 gimme = (I32)cx->blk_gimme;
1656 if (gimme == G_VOID)
1657 PUSHs(&PL_sv_undef);
1659 PUSHs(sv_2mortal(newSViv(gimme & G_ARRAY)));
1660 if (CxTYPE(cx) == CXt_EVAL) {
1662 if (cx->blk_eval.old_op_type == OP_ENTEREVAL) {
1663 PUSHs(cx->blk_eval.cur_text);
1667 else if (cx->blk_eval.old_namesv) {
1668 PUSHs(sv_2mortal(newSVsv(cx->blk_eval.old_namesv)));
1671 /* eval BLOCK (try blocks have old_namesv == 0) */
1673 PUSHs(&PL_sv_undef);
1674 PUSHs(&PL_sv_undef);
1678 PUSHs(&PL_sv_undef);
1679 PUSHs(&PL_sv_undef);
1681 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs
1682 && CopSTASH_eq(PL_curcop, PL_debstash))
1684 AV * const ary = cx->blk_sub.argarray;
1685 const int off = AvARRAY(ary) - AvALLOC(ary);
1688 GV* const tmpgv = gv_fetchpvs("DB::args", GV_ADD, SVt_PVAV);
1689 PL_dbargs = GvAV(gv_AVadd(tmpgv));
1691 AvREAL_off(PL_dbargs); /* XXX should be REIFY (see av.h) */
1694 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1695 av_extend(PL_dbargs, AvFILLp(ary) + off);
1696 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1697 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1699 /* XXX only hints propagated via op_private are currently
1700 * visible (others are not easily accessible, since they
1701 * use the global PL_hints) */
1702 PUSHs(sv_2mortal(newSViv(CopHINTS_get(cx->blk_oldcop))));
1705 STRLEN * const old_warnings = cx->blk_oldcop->cop_warnings ;
1707 if (old_warnings == pWARN_NONE ||
1708 (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0))
1709 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
1710 else if (old_warnings == pWARN_ALL ||
1711 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON)) {
1712 /* Get the bit mask for $warnings::Bits{all}, because
1713 * it could have been extended by warnings::register */
1715 HV * const bits = get_hv("warnings::Bits", FALSE);
1716 if (bits && (bits_all=hv_fetchs(bits, "all", FALSE))) {
1717 mask = newSVsv(*bits_all);
1720 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1724 mask = newSVpvn((char *) (old_warnings + 1), old_warnings[0]);
1725 PUSHs(sv_2mortal(mask));
1728 PUSHs(cx->blk_oldcop->cop_hints_hash ?
1729 sv_2mortal(newRV_noinc(
1730 (SV*)Perl_refcounted_he_chain_2hv(aTHX_
1731 cx->blk_oldcop->cop_hints_hash)))
1740 const char * const tmps = (MAXARG < 1) ? (const char *)"" : POPpconstx;
1741 sv_reset(tmps, CopSTASH(PL_curcop));
1746 /* like pp_nextstate, but used instead when the debugger is active */
1751 PL_curcop = (COP*)PL_op;
1752 TAINT_NOT; /* Each statement is presumed innocent */
1753 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
1756 if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
1757 || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
1760 register PERL_CONTEXT *cx;
1761 const I32 gimme = G_ARRAY;
1763 GV * const gv = PL_DBgv;
1764 register CV * const cv = GvCV(gv);
1767 DIE(aTHX_ "No DB::DB routine defined");
1769 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
1770 /* don't do recursive DB::DB call */
1785 (void)(*CvXSUB(cv))(aTHX_ cv);
1792 PUSHBLOCK(cx, CXt_SUB, SP);
1794 cx->blk_sub.retop = PL_op->op_next;
1797 PAD_SET_CUR_NOSAVE(CvPADLIST(cv), 1);
1798 RETURNOP(CvSTART(cv));
1808 register PERL_CONTEXT *cx;
1809 const I32 gimme = GIMME_V;
1811 U16 cxtype = CXt_LOOP | CXp_FOREACH;
1819 if (PL_op->op_targ) {
1820 if (PL_op->op_private & OPpLVAL_INTRO) { /* for my $x (...) */
1821 SvPADSTALE_off(PAD_SVl(PL_op->op_targ));
1822 SAVESETSVFLAGS(PAD_SVl(PL_op->op_targ),
1823 SVs_PADSTALE, SVs_PADSTALE);
1825 #ifndef USE_ITHREADS
1826 svp = &PAD_SVl(PL_op->op_targ); /* "my" variable */
1829 SAVEPADSV(PL_op->op_targ);
1830 iterdata = INT2PTR(void*, PL_op->op_targ);
1831 cxtype |= CXp_PADVAR;
1835 GV * const gv = (GV*)POPs;
1836 svp = &GvSV(gv); /* symbol table variable */
1837 SAVEGENERICSV(*svp);
1840 iterdata = (void*)gv;
1844 if (PL_op->op_private & OPpITER_DEF)
1845 cxtype |= CXp_FOR_DEF;
1849 PUSHBLOCK(cx, cxtype, SP);
1851 PUSHLOOP(cx, iterdata, MARK);
1853 PUSHLOOP(cx, svp, MARK);
1855 if (PL_op->op_flags & OPf_STACKED) {
1856 cx->blk_loop.iterary = (AV*)SvREFCNT_inc(POPs);
1857 if (SvTYPE(cx->blk_loop.iterary) != SVt_PVAV) {
1859 SV * const right = (SV*)cx->blk_loop.iterary;
1862 if (RANGE_IS_NUMERIC(sv,right)) {
1863 if ((SvOK(sv) && SvNV(sv) < IV_MIN) ||
1864 (SvOK(right) && SvNV(right) >= IV_MAX))
1865 DIE(aTHX_ "Range iterator outside integer range");
1866 cx->blk_loop.iterix = SvIV(sv);
1867 cx->blk_loop.itermax = SvIV(right);
1869 /* for correct -Dstv display */
1870 cx->blk_oldsp = sp - PL_stack_base;
1874 cx->blk_loop.iterlval = newSVsv(sv);
1875 (void) SvPV_force_nolen(cx->blk_loop.iterlval);
1876 (void) SvPV_nolen_const(right);
1879 else if (PL_op->op_private & OPpITER_REVERSED) {
1880 cx->blk_loop.itermax = 0;
1881 cx->blk_loop.iterix = AvFILL(cx->blk_loop.iterary) + 1;
1886 cx->blk_loop.iterary = PL_curstack;
1887 AvFILLp(PL_curstack) = SP - PL_stack_base;
1888 if (PL_op->op_private & OPpITER_REVERSED) {
1889 cx->blk_loop.itermax = MARK - PL_stack_base + 1;
1890 cx->blk_loop.iterix = cx->blk_oldsp + 1;
1893 cx->blk_loop.iterix = MARK - PL_stack_base;
1903 register PERL_CONTEXT *cx;
1904 const I32 gimme = GIMME_V;
1910 PUSHBLOCK(cx, CXt_LOOP, SP);
1911 PUSHLOOP(cx, 0, SP);
1919 register PERL_CONTEXT *cx;
1926 assert(CxTYPE(cx) == CXt_LOOP);
1928 newsp = PL_stack_base + cx->blk_loop.resetsp;
1931 if (gimme == G_VOID)
1933 else if (gimme == G_SCALAR) {
1935 *++newsp = sv_mortalcopy(*SP);
1937 *++newsp = &PL_sv_undef;
1941 *++newsp = sv_mortalcopy(*++mark);
1942 TAINT_NOT; /* Each item is independent */
1948 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
1949 PL_curpm = newpm; /* ... and pop $1 et al */
1960 register PERL_CONTEXT *cx;
1961 bool popsub2 = FALSE;
1962 bool clear_errsv = FALSE;
1970 const I32 cxix = dopoptosub(cxstack_ix);
1973 if (CxMULTICALL(cxstack)) { /* In this case we must be in a
1974 * sort block, which is a CXt_NULL
1977 PL_stack_base[1] = *PL_stack_sp;
1978 PL_stack_sp = PL_stack_base + 1;
1982 DIE(aTHX_ "Can't return outside a subroutine");
1984 if (cxix < cxstack_ix)
1987 if (CxMULTICALL(&cxstack[cxix])) {
1988 gimme = cxstack[cxix].blk_gimme;
1989 if (gimme == G_VOID)
1990 PL_stack_sp = PL_stack_base;
1991 else if (gimme == G_SCALAR) {
1992 PL_stack_base[1] = *PL_stack_sp;
1993 PL_stack_sp = PL_stack_base + 1;
1999 switch (CxTYPE(cx)) {
2002 retop = cx->blk_sub.retop;
2003 cxstack_ix++; /* preserve cx entry on stack for use by POPSUB */
2006 if (!(PL_in_eval & EVAL_KEEPERR))
2009 retop = cx->blk_eval.retop;
2013 if (optype == OP_REQUIRE &&
2014 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
2016 /* Unassume the success we assumed earlier. */
2017 SV * const nsv = cx->blk_eval.old_namesv;
2018 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
2019 DIE(aTHX_ "%"SVf" did not return a true value", (void*)nsv);
2024 retop = cx->blk_sub.retop;
2027 DIE(aTHX_ "panic: return");
2031 if (gimme == G_SCALAR) {
2034 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2036 *++newsp = SvREFCNT_inc(*SP);
2041 sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
2043 *++newsp = sv_mortalcopy(sv);
2048 *++newsp = (SvTEMP(*SP)) ? *SP : sv_mortalcopy(*SP);
2051 *++newsp = sv_mortalcopy(*SP);
2054 *++newsp = &PL_sv_undef;
2056 else if (gimme == G_ARRAY) {
2057 while (++MARK <= SP) {
2058 *++newsp = (popsub2 && SvTEMP(*MARK))
2059 ? *MARK : sv_mortalcopy(*MARK);
2060 TAINT_NOT; /* Each item is independent */
2063 PL_stack_sp = newsp;
2066 /* Stack values are safe: */
2069 POPSUB(cx,sv); /* release CV and @_ ... */
2073 PL_curpm = newpm; /* ... and pop $1 et al */
2077 sv_setpvn(ERRSV,"",0);
2085 register PERL_CONTEXT *cx;
2096 if (PL_op->op_flags & OPf_SPECIAL) {
2097 cxix = dopoptoloop(cxstack_ix);
2099 DIE(aTHX_ "Can't \"last\" outside a loop block");
2102 cxix = dopoptolabel(cPVOP->op_pv);
2104 DIE(aTHX_ "Label not found for \"last %s\"", cPVOP->op_pv);
2106 if (cxix < cxstack_ix)
2110 cxstack_ix++; /* temporarily protect top context */
2112 switch (CxTYPE(cx)) {
2115 newsp = PL_stack_base + cx->blk_loop.resetsp;
2116 nextop = cx->blk_loop.my_op->op_lastop->op_next;
2120 nextop = cx->blk_sub.retop;
2124 nextop = cx->blk_eval.retop;
2128 nextop = cx->blk_sub.retop;
2131 DIE(aTHX_ "panic: last");
2135 if (gimme == G_SCALAR) {
2137 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*SP))
2138 ? *SP : sv_mortalcopy(*SP);
2140 *++newsp = &PL_sv_undef;
2142 else if (gimme == G_ARRAY) {
2143 while (++MARK <= SP) {
2144 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*MARK))
2145 ? *MARK : sv_mortalcopy(*MARK);
2146 TAINT_NOT; /* Each item is independent */
2154 /* Stack values are safe: */
2157 POPLOOP(cx); /* release loop vars ... */
2161 POPSUB(cx,sv); /* release CV and @_ ... */
2164 PL_curpm = newpm; /* ... and pop $1 et al */
2167 PERL_UNUSED_VAR(optype);
2168 PERL_UNUSED_VAR(gimme);
2176 register PERL_CONTEXT *cx;
2179 if (PL_op->op_flags & OPf_SPECIAL) {
2180 cxix = dopoptoloop(cxstack_ix);
2182 DIE(aTHX_ "Can't \"next\" outside a loop block");
2185 cxix = dopoptolabel(cPVOP->op_pv);
2187 DIE(aTHX_ "Label not found for \"next %s\"", cPVOP->op_pv);
2189 if (cxix < cxstack_ix)
2192 /* clear off anything above the scope we're re-entering, but
2193 * save the rest until after a possible continue block */
2194 inner = PL_scopestack_ix;
2196 if (PL_scopestack_ix < inner)
2197 leave_scope(PL_scopestack[PL_scopestack_ix]);
2198 PL_curcop = cx->blk_oldcop;
2199 return CX_LOOP_NEXTOP_GET(cx);
2206 register PERL_CONTEXT *cx;
2210 if (PL_op->op_flags & OPf_SPECIAL) {
2211 cxix = dopoptoloop(cxstack_ix);
2213 DIE(aTHX_ "Can't \"redo\" outside a loop block");
2216 cxix = dopoptolabel(cPVOP->op_pv);
2218 DIE(aTHX_ "Label not found for \"redo %s\"", cPVOP->op_pv);
2220 if (cxix < cxstack_ix)
2223 redo_op = cxstack[cxix].blk_loop.my_op->op_redoop;
2224 if (redo_op->op_type == OP_ENTER) {
2225 /* pop one less context to avoid $x being freed in while (my $x..) */
2227 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_BLOCK);
2228 redo_op = redo_op->op_next;
2232 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2233 LEAVE_SCOPE(oldsave);
2235 PL_curcop = cx->blk_oldcop;
2240 S_dofindlabel(pTHX_ OP *o, const char *label, OP **opstack, OP **oplimit)
2244 static const char too_deep[] = "Target of goto is too deeply nested";
2247 Perl_croak(aTHX_ too_deep);
2248 if (o->op_type == OP_LEAVE ||
2249 o->op_type == OP_SCOPE ||
2250 o->op_type == OP_LEAVELOOP ||
2251 o->op_type == OP_LEAVESUB ||
2252 o->op_type == OP_LEAVETRY)
2254 *ops++ = cUNOPo->op_first;
2256 Perl_croak(aTHX_ too_deep);
2259 if (o->op_flags & OPf_KIDS) {
2261 /* First try all the kids at this level, since that's likeliest. */
2262 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2263 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
2264 kCOP->cop_label && strEQ(kCOP->cop_label, label))
2267 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2268 if (kid == PL_lastgotoprobe)
2270 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2273 else if (ops[-1]->op_type == OP_NEXTSTATE ||
2274 ops[-1]->op_type == OP_DBSTATE)
2279 if ((o = dofindlabel(kid, label, ops, oplimit)))
2292 register PERL_CONTEXT *cx;
2293 #define GOTO_DEPTH 64
2294 OP *enterops[GOTO_DEPTH];
2295 const char *label = NULL;
2296 const bool do_dump = (PL_op->op_type == OP_DUMP);
2297 static const char must_have_label[] = "goto must have label";
2299 if (PL_op->op_flags & OPf_STACKED) {
2300 SV * const sv = POPs;
2302 /* This egregious kludge implements goto &subroutine */
2303 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2305 register PERL_CONTEXT *cx;
2306 CV* cv = (CV*)SvRV(sv);
2313 if (!CvROOT(cv) && !CvXSUB(cv)) {
2314 const GV * const gv = CvGV(cv);
2318 /* autoloaded stub? */
2319 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2321 autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv),
2322 GvNAMELEN(gv), FALSE);
2323 if (autogv && (cv = GvCV(autogv)))
2325 tmpstr = sv_newmortal();
2326 gv_efullname3(tmpstr, gv, NULL);
2327 DIE(aTHX_ "Goto undefined subroutine &%"SVf"",(void*)tmpstr);
2329 DIE(aTHX_ "Goto undefined subroutine");
2332 /* First do some returnish stuff. */
2333 SvREFCNT_inc_simple_void(cv); /* avoid premature free during unwind */
2335 cxix = dopoptosub(cxstack_ix);
2337 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
2338 if (cxix < cxstack_ix)
2342 /* ban goto in eval: see <20050521150056.GC20213@iabyn.com> */
2343 if (CxTYPE(cx) == CXt_EVAL) {
2345 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2347 DIE(aTHX_ "Can't goto subroutine from an eval-block");
2349 else if (CxMULTICALL(cx))
2350 DIE(aTHX_ "Can't goto subroutine from a sort sub (or similar callback)");
2351 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs) {
2352 /* put @_ back onto stack */
2353 AV* av = cx->blk_sub.argarray;
2355 items = AvFILLp(av) + 1;
2356 EXTEND(SP, items+1); /* @_ could have been extended. */
2357 Copy(AvARRAY(av), SP + 1, items, SV*);
2358 SvREFCNT_dec(GvAV(PL_defgv));
2359 GvAV(PL_defgv) = cx->blk_sub.savearray;
2361 /* abandon @_ if it got reified */
2366 av_extend(av, items-1);
2368 PAD_SVl(0) = (SV*)(cx->blk_sub.argarray = av);
2371 else if (CvISXSUB(cv)) { /* put GvAV(defgv) back onto stack */
2372 AV* const av = GvAV(PL_defgv);
2373 items = AvFILLp(av) + 1;
2374 EXTEND(SP, items+1); /* @_ could have been extended. */
2375 Copy(AvARRAY(av), SP + 1, items, SV*);
2379 if (CxTYPE(cx) == CXt_SUB &&
2380 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
2381 SvREFCNT_dec(cx->blk_sub.cv);
2382 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2383 LEAVE_SCOPE(oldsave);
2385 /* Now do some callish stuff. */
2387 SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
2389 OP* const retop = cx->blk_sub.retop;
2394 for (index=0; index<items; index++)
2395 sv_2mortal(SP[-index]);
2398 /* XS subs don't have a CxSUB, so pop it */
2399 POPBLOCK(cx, PL_curpm);
2400 /* Push a mark for the start of arglist */
2403 (void)(*CvXSUB(cv))(aTHX_ cv);
2408 AV* const padlist = CvPADLIST(cv);
2409 if (CxTYPE(cx) == CXt_EVAL) {
2410 PL_in_eval = cx->blk_eval.old_in_eval;
2411 PL_eval_root = cx->blk_eval.old_eval_root;
2412 cx->cx_type = CXt_SUB;
2413 cx->blk_sub.hasargs = 0;
2415 cx->blk_sub.cv = cv;
2416 cx->blk_sub.olddepth = CvDEPTH(cv);
2419 if (CvDEPTH(cv) < 2)
2420 SvREFCNT_inc_simple_void_NN(cv);
2422 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION))
2423 sub_crush_depth(cv);
2424 pad_push(padlist, CvDEPTH(cv));
2427 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv));
2428 if (cx->blk_sub.hasargs)
2430 AV* const av = (AV*)PAD_SVl(0);
2432 cx->blk_sub.savearray = GvAV(PL_defgv);
2433 GvAV(PL_defgv) = (AV*)SvREFCNT_inc_simple(av);
2434 CX_CURPAD_SAVE(cx->blk_sub);
2435 cx->blk_sub.argarray = av;
2437 if (items >= AvMAX(av) + 1) {
2438 SV **ary = AvALLOC(av);
2439 if (AvARRAY(av) != ary) {
2440 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2441 SvPV_set(av, (char*)ary);
2443 if (items >= AvMAX(av) + 1) {
2444 AvMAX(av) = items - 1;
2445 Renew(ary,items+1,SV*);
2447 SvPV_set(av, (char*)ary);
2451 Copy(mark,AvARRAY(av),items,SV*);
2452 AvFILLp(av) = items - 1;
2453 assert(!AvREAL(av));
2455 /* transfer 'ownership' of refcnts to new @_ */
2465 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
2467 * We do not care about using sv to call CV;
2468 * it's for informational purposes only.
2470 SV * const sv = GvSV(PL_DBsub);
2472 if (PERLDB_SUB_NN) {
2473 const int type = SvTYPE(sv);
2474 if (type < SVt_PVIV && type != SVt_IV)
2475 sv_upgrade(sv, SVt_PVIV);
2477 SvIV_set(sv, PTR2IV(cv)); /* Do it the quickest way */
2479 gv_efullname3(sv, CvGV(cv), NULL);
2482 CV * const gotocv = get_cv("DB::goto", FALSE);
2484 PUSHMARK( PL_stack_sp );
2485 call_sv((SV*)gotocv, G_SCALAR | G_NODEBUG);
2490 RETURNOP(CvSTART(cv));
2494 label = SvPV_nolen_const(sv);
2495 if (!(do_dump || *label))
2496 DIE(aTHX_ must_have_label);
2499 else if (PL_op->op_flags & OPf_SPECIAL) {
2501 DIE(aTHX_ must_have_label);
2504 label = cPVOP->op_pv;
2506 if (label && *label) {
2507 OP *gotoprobe = NULL;
2508 bool leaving_eval = FALSE;
2509 bool in_block = FALSE;
2510 PERL_CONTEXT *last_eval_cx = NULL;
2514 PL_lastgotoprobe = NULL;
2516 for (ix = cxstack_ix; ix >= 0; ix--) {
2518 switch (CxTYPE(cx)) {
2520 leaving_eval = TRUE;
2521 if (!CxTRYBLOCK(cx)) {
2522 gotoprobe = (last_eval_cx ?
2523 last_eval_cx->blk_eval.old_eval_root :
2528 /* else fall through */
2530 gotoprobe = cx->blk_oldcop->op_sibling;
2536 gotoprobe = cx->blk_oldcop->op_sibling;
2539 gotoprobe = PL_main_root;
2542 if (CvDEPTH(cx->blk_sub.cv) && !CxMULTICALL(cx)) {
2543 gotoprobe = CvROOT(cx->blk_sub.cv);
2549 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
2552 DIE(aTHX_ "panic: goto");
2553 gotoprobe = PL_main_root;
2557 retop = dofindlabel(gotoprobe, label,
2558 enterops, enterops + GOTO_DEPTH);
2562 PL_lastgotoprobe = gotoprobe;
2565 DIE(aTHX_ "Can't find label %s", label);
2567 /* if we're leaving an eval, check before we pop any frames
2568 that we're not going to punt, otherwise the error
2571 if (leaving_eval && *enterops && enterops[1]) {
2573 for (i = 1; enterops[i]; i++)
2574 if (enterops[i]->op_type == OP_ENTERITER)
2575 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2578 /* pop unwanted frames */
2580 if (ix < cxstack_ix) {
2587 oldsave = PL_scopestack[PL_scopestack_ix];
2588 LEAVE_SCOPE(oldsave);
2591 /* push wanted frames */
2593 if (*enterops && enterops[1]) {
2594 OP * const oldop = PL_op;
2595 ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
2596 for (; enterops[ix]; ix++) {
2597 PL_op = enterops[ix];
2598 /* Eventually we may want to stack the needed arguments
2599 * for each op. For now, we punt on the hard ones. */
2600 if (PL_op->op_type == OP_ENTERITER)
2601 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2602 CALL_FPTR(PL_op->op_ppaddr)(aTHX);
2610 if (!retop) retop = PL_main_start;
2612 PL_restartop = retop;
2613 PL_do_undump = TRUE;
2617 PL_restartop = 0; /* hmm, must be GNU unexec().. */
2618 PL_do_undump = FALSE;
2635 if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
2637 VMSISH_HUSHED = VMSISH_HUSHED || (PL_op->op_private & OPpHUSH_VMSISH);
2640 PL_exit_flags |= PERL_EXIT_EXPECTED;
2642 /* KLUDGE: disable exit 0 in BEGIN blocks when we're just compiling */
2643 if (anum || !(PL_minus_c && PL_madskills))
2648 PUSHs(&PL_sv_undef);
2655 S_save_lines(pTHX_ AV *array, SV *sv)
2657 const char *s = SvPVX_const(sv);
2658 const char * const send = SvPVX_const(sv) + SvCUR(sv);
2661 while (s && s < send) {
2663 SV * const tmpstr = newSV(0);
2665 sv_upgrade(tmpstr, SVt_PVMG);
2666 t = strchr(s, '\n');
2672 sv_setpvn(tmpstr, s, t - s);
2673 av_store(array, line++, tmpstr);
2679 S_docatch_body(pTHX)
2687 S_docatch(pTHX_ OP *o)
2691 OP * const oldop = PL_op;
2695 assert(CATCH_GET == TRUE);
2702 assert(cxstack_ix >= 0);
2703 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2704 cxstack[cxstack_ix].blk_eval.cur_top_env = PL_top_env;
2709 /* die caught by an inner eval - continue inner loop */
2711 /* NB XXX we rely on the old popped CxEVAL still being at the top
2712 * of the stack; the way die_where() currently works, this
2713 * assumption is valid. In theory The cur_top_env value should be
2714 * returned in another global, the way retop (aka PL_restartop)
2716 assert(CxTYPE(&cxstack[cxstack_ix+1]) == CXt_EVAL);
2719 && cxstack[cxstack_ix+1].blk_eval.cur_top_env == PL_top_env)
2721 PL_op = PL_restartop;
2738 Perl_sv_compile_2op(pTHX_ SV *sv, OP** startop, const char *code, PAD** padp)
2739 /* sv Text to convert to OP tree. */
2740 /* startop op_free() this to undo. */
2741 /* code Short string id of the caller. */
2743 /* FIXME - how much of this code is common with pp_entereval? */
2744 dVAR; dSP; /* Make POPBLOCK work. */
2751 char tbuf[TYPE_DIGITS(long) + 12 + 10];
2752 char *tmpbuf = tbuf;
2755 CV* runcv = NULL; /* initialise to avoid compiler warnings */
2761 /* switch to eval mode */
2763 if (IN_PERL_COMPILETIME) {
2764 SAVECOPSTASH_FREE(&PL_compiling);
2765 CopSTASH_set(&PL_compiling, PL_curstash);
2767 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
2768 SV * const sv = sv_newmortal();
2769 Perl_sv_setpvf(aTHX_ sv, "_<(%.10seval %lu)[%s:%"IVdf"]",
2770 code, (unsigned long)++PL_evalseq,
2771 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
2776 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(%.10s_eval %lu)", code,
2777 (unsigned long)++PL_evalseq);
2778 SAVECOPFILE_FREE(&PL_compiling);
2779 CopFILE_set(&PL_compiling, tmpbuf+2);
2780 SAVECOPLINE(&PL_compiling);
2781 CopLINE_set(&PL_compiling, 1);
2782 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
2783 deleting the eval's FILEGV from the stash before gv_check() runs
2784 (i.e. before run-time proper). To work around the coredump that
2785 ensues, we always turn GvMULTI_on for any globals that were
2786 introduced within evals. See force_ident(). GSAR 96-10-12 */
2787 safestr = savepvn(tmpbuf, len);
2788 SAVEDELETE(PL_defstash, safestr, len);
2790 #ifdef OP_IN_REGISTER
2796 /* we get here either during compilation, or via pp_regcomp at runtime */
2797 runtime = IN_PERL_RUNTIME;
2799 runcv = find_runcv(NULL);
2802 PL_op->op_type = OP_ENTEREVAL;
2803 PL_op->op_flags = 0; /* Avoid uninit warning. */
2804 PUSHBLOCK(cx, CXt_EVAL|(IN_PERL_COMPILETIME ? 0 : CXp_REAL), SP);
2805 PUSHEVAL(cx, 0, NULL);
2808 rop = doeval(G_SCALAR, startop, runcv, PL_curcop->cop_seq);
2810 rop = doeval(G_SCALAR, startop, PL_compcv, PL_cop_seqmax);
2811 POPBLOCK(cx,PL_curpm);
2814 (*startop)->op_type = OP_NULL;
2815 (*startop)->op_ppaddr = PL_ppaddr[OP_NULL];
2817 /* XXX DAPM do this properly one year */
2818 *padp = (AV*)SvREFCNT_inc_simple(PL_comppad);
2820 if (IN_PERL_COMPILETIME)
2821 CopHINTS_set(&PL_compiling, PL_hints);
2822 #ifdef OP_IN_REGISTER
2825 PERL_UNUSED_VAR(newsp);
2826 PERL_UNUSED_VAR(optype);
2833 =for apidoc find_runcv
2835 Locate the CV corresponding to the currently executing sub or eval.
2836 If db_seqp is non_null, skip CVs that are in the DB package and populate
2837 *db_seqp with the cop sequence number at the point that the DB:: code was
2838 entered. (allows debuggers to eval in the scope of the breakpoint rather
2839 than in the scope of the debugger itself).
2845 Perl_find_runcv(pTHX_ U32 *db_seqp)
2851 *db_seqp = PL_curcop->cop_seq;
2852 for (si = PL_curstackinfo; si; si = si->si_prev) {
2854 for (ix = si->si_cxix; ix >= 0; ix--) {
2855 const PERL_CONTEXT *cx = &(si->si_cxstack[ix]);
2856 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
2857 CV * const cv = cx->blk_sub.cv;
2858 /* skip DB:: code */
2859 if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
2860 *db_seqp = cx->blk_oldcop->cop_seq;
2865 else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
2873 /* Compile a require/do, an eval '', or a /(?{...})/.
2874 * In the last case, startop is non-null, and contains the address of
2875 * a pointer that should be set to the just-compiled code.
2876 * outside is the lexically enclosing CV (if any) that invoked us.
2879 /* With USE_5005THREADS, eval_owner must be held on entry to doeval */
2881 S_doeval(pTHX_ int gimme, OP** startop, CV* outside, U32 seq)
2884 OP * const saveop = PL_op;
2886 PL_in_eval = ((saveop && saveop->op_type == OP_REQUIRE)
2887 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
2892 SAVESPTR(PL_compcv);
2893 PL_compcv = (CV*)newSV(0);
2894 sv_upgrade((SV *)PL_compcv, SVt_PVCV);
2895 CvEVAL_on(PL_compcv);
2896 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2897 cxstack[cxstack_ix].blk_eval.cv = PL_compcv;
2899 CvOUTSIDE_SEQ(PL_compcv) = seq;
2900 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc_simple(outside);
2902 /* set up a scratch pad */
2904 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE);
2905 PL_op = NULL; /* avoid PL_op and PL_curpad referring to different CVs */
2909 SAVEMORTALIZESV(PL_compcv); /* must remain until end of current statement */
2911 /* make sure we compile in the right package */
2913 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
2914 SAVESPTR(PL_curstash);
2915 PL_curstash = CopSTASH(PL_curcop);
2917 /* XXX:ajgo do we really need to alloc an AV for begin/checkunit */
2918 SAVESPTR(PL_beginav);
2919 PL_beginav = newAV();
2920 SAVEFREESV(PL_beginav);
2921 SAVESPTR(PL_unitcheckav);
2922 PL_unitcheckav = newAV();
2923 SAVEFREESV(PL_unitcheckav);
2924 SAVEI32(PL_error_count);
2927 SAVEI32(PL_madskills);
2931 /* try to compile it */
2933 PL_eval_root = NULL;
2935 PL_curcop = &PL_compiling;
2936 CopARYBASE_set(PL_curcop, 0);
2937 if (saveop && (saveop->op_type != OP_REQUIRE) && (saveop->op_flags & OPf_SPECIAL))
2938 PL_in_eval |= EVAL_KEEPERR;
2940 sv_setpvn(ERRSV,"",0);
2941 if (yyparse() || PL_error_count || !PL_eval_root) {
2942 SV **newsp; /* Used by POPBLOCK. */
2943 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
2944 I32 optype = 0; /* Might be reset by POPEVAL. */
2949 op_free(PL_eval_root);
2950 PL_eval_root = NULL;
2952 SP = PL_stack_base + POPMARK; /* pop original mark */
2954 POPBLOCK(cx,PL_curpm);
2960 msg = SvPVx_nolen_const(ERRSV);
2961 if (optype == OP_REQUIRE) {
2962 const SV * const nsv = cx->blk_eval.old_namesv;
2963 (void)hv_store(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv),
2965 DIE(aTHX_ "%sCompilation failed in require",
2966 *msg ? msg : "Unknown error\n");
2969 POPBLOCK(cx,PL_curpm);
2971 Perl_croak(aTHX_ "%sCompilation failed in regexp",
2972 (*msg ? msg : "Unknown error\n"));
2976 sv_setpv(ERRSV, "Compilation error");
2979 PERL_UNUSED_VAR(newsp);
2982 CopLINE_set(&PL_compiling, 0);
2984 *startop = PL_eval_root;
2986 SAVEFREEOP(PL_eval_root);
2988 /* Set the context for this new optree.
2989 * If the last op is an OP_REQUIRE, force scalar context.
2990 * Otherwise, propagate the context from the eval(). */
2991 if (PL_eval_root->op_type == OP_LEAVEEVAL
2992 && cUNOPx(PL_eval_root)->op_first->op_type == OP_LINESEQ
2993 && cLISTOPx(cUNOPx(PL_eval_root)->op_first)->op_last->op_type
2995 scalar(PL_eval_root);
2996 else if (gimme & G_VOID)
2997 scalarvoid(PL_eval_root);
2998 else if (gimme & G_ARRAY)
3001 scalar(PL_eval_root);
3003 DEBUG_x(dump_eval());
3005 /* Register with debugger: */
3006 if (PERLDB_INTER && saveop && saveop->op_type == OP_REQUIRE) {
3007 CV * const cv = get_cv("DB::postponed", FALSE);
3011 XPUSHs((SV*)CopFILEGV(&PL_compiling));
3013 call_sv((SV*)cv, G_DISCARD);
3018 call_list(PL_scopestack_ix, PL_unitcheckav);
3020 /* compiled okay, so do it */
3022 CvDEPTH(PL_compcv) = 1;
3023 SP = PL_stack_base + POPMARK; /* pop original mark */
3024 PL_op = saveop; /* The caller may need it. */
3025 PL_lex_state = LEX_NOTPARSING; /* $^S needs this. */
3027 RETURNOP(PL_eval_start);
3031 S_check_type_and_open(pTHX_ const char *name, const char *mode)
3034 const int st_rc = PerlLIO_stat(name, &st);
3036 if (st_rc < 0 || S_ISDIR(st.st_mode) || S_ISBLK(st.st_mode)) {
3040 return PerlIO_open(name, mode);
3044 S_doopen_pm(pTHX_ const char *name, const char *mode)
3046 #ifndef PERL_DISABLE_PMC
3047 const STRLEN namelen = strlen(name);
3050 if (namelen > 3 && strEQ(name + namelen - 3, ".pm")) {
3051 SV * const pmcsv = Perl_newSVpvf(aTHX_ "%s%c", name, 'c');
3052 const char * const pmc = SvPV_nolen_const(pmcsv);
3054 if (PerlLIO_stat(pmc, &pmcstat) < 0) {
3055 fp = check_type_and_open(name, mode);
3058 fp = check_type_and_open(pmc, mode);
3060 SvREFCNT_dec(pmcsv);
3063 fp = check_type_and_open(name, mode);
3067 return check_type_and_open(name, mode);
3068 #endif /* !PERL_DISABLE_PMC */
3074 register PERL_CONTEXT *cx;
3078 const char *tryname = NULL;
3080 const I32 gimme = GIMME_V;
3081 int filter_has_file = 0;
3082 PerlIO *tryrsfp = NULL;
3083 SV *filter_cache = NULL;
3084 SV *filter_state = NULL;
3085 SV *filter_sub = NULL;
3091 if ( (SvNIOKp(sv) || SvVOK(sv)) && PL_op->op_type != OP_DOFILE) {
3092 if ( SvVOK(sv) && ckWARN(WARN_PORTABLE) ) /* require v5.6.1 */
3093 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
3094 "v-string in use/require non-portable");
3096 sv = new_version(sv);
3097 if (!sv_derived_from(PL_patchlevel, "version"))
3098 upg_version(PL_patchlevel);
3099 if (cUNOP->op_first->op_type == OP_CONST && cUNOP->op_first->op_private & OPpCONST_NOVER) {
3100 if ( vcmp(sv,PL_patchlevel) <= 0 )
3101 DIE(aTHX_ "Perls since %"SVf" too modern--this is %"SVf", stopped",
3102 (void*)vnormal(sv), (void*)vnormal(PL_patchlevel));
3105 if ( vcmp(sv,PL_patchlevel) > 0 )
3106 DIE(aTHX_ "Perl %"SVf" required--this is only %"SVf", stopped",
3107 (void*)vnormal(sv), (void*)vnormal(PL_patchlevel));
3112 name = SvPV_const(sv, len);
3113 if (!(name && len > 0 && *name))
3114 DIE(aTHX_ "Null filename used");
3115 TAINT_PROPER("require");
3116 if (PL_op->op_type == OP_REQUIRE) {
3117 SV * const * const svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3119 if (*svp != &PL_sv_undef)
3122 DIE(aTHX_ "Compilation failed in require");
3126 /* prepare to compile file */
3128 if (path_is_absolute(name)) {
3130 tryrsfp = doopen_pm(name,PERL_SCRIPT_MODE);
3132 #ifdef MACOS_TRADITIONAL
3136 MacPerl_CanonDir(name, newname, 1);
3137 if (path_is_absolute(newname)) {
3139 tryrsfp = doopen_pm(newname,PERL_SCRIPT_MODE);
3144 AV * const ar = GvAVn(PL_incgv);
3148 if ((unixname = tounixspec(name, NULL)) != NULL)
3152 for (i = 0; i <= AvFILL(ar); i++) {
3153 SV * const dirsv = *av_fetch(ar, i, TRUE);
3159 if (SvTYPE(SvRV(loader)) == SVt_PVAV
3160 && !sv_isobject(loader))
3162 loader = *av_fetch((AV *)SvRV(loader), 0, TRUE);
3165 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
3166 PTR2UV(SvRV(dirsv)), name);
3167 tryname = SvPVX_const(namesv);
3178 if (sv_isobject(loader))
3179 count = call_method("INC", G_ARRAY);
3181 count = call_sv(loader, G_ARRAY);
3191 if (SvROK(arg) && (SvTYPE(SvRV(arg)) <= SVt_PVLV)
3192 && !isGV_with_GP(SvRV(arg))) {
3193 filter_cache = SvRV(arg);
3194 SvREFCNT_inc_simple_void_NN(filter_cache);
3201 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVGV) {
3205 if (SvTYPE(arg) == SVt_PVGV) {
3206 IO * const io = GvIO((GV *)arg);
3211 tryrsfp = IoIFP(io);
3212 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3213 PerlIO_close(IoOFP(io));
3224 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3226 SvREFCNT_inc_simple_void_NN(filter_sub);
3229 filter_state = SP[i];
3230 SvREFCNT_inc_simple_void(filter_state);
3234 if (!tryrsfp && (filter_cache || filter_sub)) {
3235 tryrsfp = PerlIO_open(BIT_BUCKET,
3250 filter_has_file = 0;
3252 SvREFCNT_dec(filter_cache);
3253 filter_cache = NULL;
3256 SvREFCNT_dec(filter_state);
3257 filter_state = NULL;
3260 SvREFCNT_dec(filter_sub);
3265 if (!path_is_absolute(name)
3266 #ifdef MACOS_TRADITIONAL
3267 /* We consider paths of the form :a:b ambiguous and interpret them first
3268 as global then as local
3270 || (*name == ':' && name[1] != ':' && strchr(name+2, ':'))
3273 const char *dir = SvPVx_nolen_const(dirsv);
3274 #ifdef MACOS_TRADITIONAL
3278 MacPerl_CanonDir(name, buf2, 1);
3279 Perl_sv_setpvf(aTHX_ namesv, "%s%s", MacPerl_CanonDir(dir, buf1, 0), buf2+(buf2[0] == ':'));
3283 if ((unixdir = tounixpath(dir, NULL)) == NULL)
3285 sv_setpv(namesv, unixdir);
3286 sv_catpv(namesv, unixname);
3288 # ifdef __SYMBIAN32__
3289 if (PL_origfilename[0] &&
3290 PL_origfilename[1] == ':' &&
3291 !(dir[0] && dir[1] == ':'))
3292 Perl_sv_setpvf(aTHX_ namesv,
3297 Perl_sv_setpvf(aTHX_ namesv,
3301 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
3305 TAINT_PROPER("require");
3306 tryname = SvPVX_const(namesv);
3307 tryrsfp = doopen_pm(tryname, PERL_SCRIPT_MODE);
3309 if (tryname[0] == '.' && tryname[1] == '/')
3313 else if (errno == EMFILE)
3314 /* no point in trying other paths if out of handles */
3321 SAVECOPFILE_FREE(&PL_compiling);
3322 CopFILE_set(&PL_compiling, tryrsfp ? tryname : name);
3323 SvREFCNT_dec(namesv);
3325 if (PL_op->op_type == OP_REQUIRE) {
3326 const char *msgstr = name;
3327 if(errno == EMFILE) {
3329 = sv_2mortal(Perl_newSVpvf(aTHX_ "%s: %s", msgstr,
3331 msgstr = SvPV_nolen_const(msg);
3333 if (namesv) { /* did we lookup @INC? */
3334 AV * const ar = GvAVn(PL_incgv);
3336 SV * const msg = sv_2mortal(Perl_newSVpvf(aTHX_
3337 "%s in @INC%s%s (@INC contains:",
3339 (instr(msgstr, ".h ")
3340 ? " (change .h to .ph maybe?)" : ""),
3341 (instr(msgstr, ".ph ")
3342 ? " (did you run h2ph?)" : "")
3345 for (i = 0; i <= AvFILL(ar); i++) {
3346 sv_catpvs(msg, " ");
3347 sv_catsv(msg, *av_fetch(ar, i, TRUE));
3349 sv_catpvs(msg, ")");
3350 msgstr = SvPV_nolen_const(msg);
3353 DIE(aTHX_ "Can't locate %s", msgstr);
3359 SETERRNO(0, SS_NORMAL);
3361 /* Assume success here to prevent recursive requirement. */
3362 /* name is never assigned to again, so len is still strlen(name) */
3363 /* Check whether a hook in @INC has already filled %INC */
3365 (void)hv_store(GvHVn(PL_incgv), name, len, newSVpv(CopFILE(&PL_compiling),0),0);
3367 SV** const svp = hv_fetch(GvHVn(PL_incgv), name, len, 0);
3369 (void)hv_store(GvHVn(PL_incgv), name, len, SvREFCNT_inc_simple(hook_sv), 0 );
3374 lex_start(sv_2mortal(newSVpvs("")));
3375 SAVEGENERICSV(PL_rsfp_filters);
3376 PL_rsfp_filters = NULL;
3381 SAVECOMPILEWARNINGS();
3382 if (PL_dowarn & G_WARN_ALL_ON)
3383 PL_compiling.cop_warnings = pWARN_ALL ;
3384 else if (PL_dowarn & G_WARN_ALL_OFF)
3385 PL_compiling.cop_warnings = pWARN_NONE ;
3386 else if (PL_taint_warn) {
3387 PL_compiling.cop_warnings
3388 = Perl_new_warnings_bitfield(aTHX_ NULL, WARN_TAINTstring, WARNsize);
3391 PL_compiling.cop_warnings = pWARN_STD ;
3393 if (filter_sub || filter_cache) {
3394 SV * const datasv = filter_add(S_run_user_filter, NULL);
3395 IoLINES(datasv) = filter_has_file;
3396 IoTOP_GV(datasv) = (GV *)filter_state;
3397 IoBOTTOM_GV(datasv) = (GV *)filter_sub;
3398 IoFMT_GV(datasv) = (GV *)filter_cache;
3401 /* switch to eval mode */
3402 PUSHBLOCK(cx, CXt_EVAL, SP);
3403 PUSHEVAL(cx, name, NULL);
3404 cx->blk_eval.retop = PL_op->op_next;
3406 SAVECOPLINE(&PL_compiling);
3407 CopLINE_set(&PL_compiling, 0);
3411 /* Store and reset encoding. */
3412 encoding = PL_encoding;
3415 op = DOCATCH(doeval(gimme, NULL, NULL, PL_curcop->cop_seq));
3417 /* Restore encoding. */
3418 PL_encoding = encoding;
3426 register PERL_CONTEXT *cx;
3428 const I32 gimme = GIMME_V;
3429 const I32 was = PL_sub_generation;
3430 char tbuf[TYPE_DIGITS(long) + 12];
3431 char *tmpbuf = tbuf;
3437 HV *saved_hh = NULL;
3438 const char * const fakestr = "_<(eval )";
3439 const int fakelen = 9 + 1;
3441 if (PL_op->op_private & OPpEVAL_HAS_HH) {
3442 saved_hh = (HV*) SvREFCNT_inc(POPs);
3446 if (!SvPV_nolen_const(sv))
3448 TAINT_PROPER("eval");
3454 /* switch to eval mode */
3456 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
3457 SV * const temp_sv = sv_newmortal();
3458 Perl_sv_setpvf(aTHX_ temp_sv, "_<(eval %lu)[%s:%"IVdf"]",
3459 (unsigned long)++PL_evalseq,
3460 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
3461 tmpbuf = SvPVX(temp_sv);
3462 len = SvCUR(temp_sv);
3465 len = my_snprintf(tmpbuf, sizeof(tbuf), "_<(eval %lu)", (unsigned long)++PL_evalseq);
3466 SAVECOPFILE_FREE(&PL_compiling);
3467 CopFILE_set(&PL_compiling, tmpbuf+2);
3468 SAVECOPLINE(&PL_compiling);
3469 CopLINE_set(&PL_compiling, 1);
3470 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
3471 deleting the eval's FILEGV from the stash before gv_check() runs
3472 (i.e. before run-time proper). To work around the coredump that
3473 ensues, we always turn GvMULTI_on for any globals that were
3474 introduced within evals. See force_ident(). GSAR 96-10-12 */
3475 safestr = savepvn(tmpbuf, len);
3476 SAVEDELETE(PL_defstash, safestr, len);
3478 PL_hints = PL_op->op_targ;
3480 GvHV(PL_hintgv) = saved_hh;
3481 SAVECOMPILEWARNINGS();
3482 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
3483 if (PL_compiling.cop_hints_hash) {
3484 Perl_refcounted_he_free(aTHX_ PL_compiling.cop_hints_hash);
3486 PL_compiling.cop_hints_hash = PL_curcop->cop_hints_hash;
3487 if (PL_compiling.cop_hints_hash) {
3489 PL_compiling.cop_hints_hash->refcounted_he_refcnt++;
3490 HINTS_REFCNT_UNLOCK;
3492 /* special case: an eval '' executed within the DB package gets lexically
3493 * placed in the first non-DB CV rather than the current CV - this
3494 * allows the debugger to execute code, find lexicals etc, in the
3495 * scope of the code being debugged. Passing &seq gets find_runcv
3496 * to do the dirty work for us */
3497 runcv = find_runcv(&seq);
3499 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
3500 PUSHEVAL(cx, 0, NULL);
3501 cx->blk_eval.retop = PL_op->op_next;
3503 /* prepare to compile string */
3505 if (PERLDB_LINE && PL_curstash != PL_debstash)
3506 save_lines(CopFILEAV(&PL_compiling), PL_linestr);
3508 ret = doeval(gimme, NULL, runcv, seq);
3509 if (PERLDB_INTER && was != (I32)PL_sub_generation /* Some subs defined here. */
3510 && ret != PL_op->op_next) { /* Successive compilation. */
3511 /* Copy in anything fake and short. */
3512 my_strlcpy(safestr, fakestr, fakelen);
3514 return DOCATCH(ret);
3524 register PERL_CONTEXT *cx;
3526 const U8 save_flags = PL_op -> op_flags;
3531 retop = cx->blk_eval.retop;
3534 if (gimme == G_VOID)
3536 else if (gimme == G_SCALAR) {
3539 if (SvFLAGS(TOPs) & SVs_TEMP)
3542 *MARK = sv_mortalcopy(TOPs);
3546 *MARK = &PL_sv_undef;
3551 /* in case LEAVE wipes old return values */
3552 for (mark = newsp + 1; mark <= SP; mark++) {
3553 if (!(SvFLAGS(*mark) & SVs_TEMP)) {
3554 *mark = sv_mortalcopy(*mark);
3555 TAINT_NOT; /* Each item is independent */
3559 PL_curpm = newpm; /* Don't pop $1 et al till now */
3562 assert(CvDEPTH(PL_compcv) == 1);
3564 CvDEPTH(PL_compcv) = 0;
3567 if (optype == OP_REQUIRE &&
3568 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
3570 /* Unassume the success we assumed earlier. */
3571 SV * const nsv = cx->blk_eval.old_namesv;
3572 (void)hv_delete(GvHVn(PL_incgv), SvPVX_const(nsv), SvCUR(nsv), G_DISCARD);
3573 retop = Perl_die(aTHX_ "%"SVf" did not return a true value", (void*)nsv);
3574 /* die_where() did LEAVE, or we won't be here */
3578 if (!(save_flags & OPf_SPECIAL))
3579 sv_setpvn(ERRSV,"",0);
3585 /* Common code for Perl_call_sv and Perl_fold_constants, put here to keep it
3586 close to the related Perl_create_eval_scope. */
3588 Perl_delete_eval_scope(pTHX)
3593 register PERL_CONTEXT *cx;
3600 PERL_UNUSED_VAR(newsp);
3601 PERL_UNUSED_VAR(gimme);
3602 PERL_UNUSED_VAR(optype);
3605 /* Common-ish code salvaged from Perl_call_sv and pp_entertry, because it was
3606 also needed by Perl_fold_constants. */
3608 Perl_create_eval_scope(pTHX_ U32 flags)
3611 const I32 gimme = GIMME_V;
3616 PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), PL_stack_sp);
3618 PL_eval_root = PL_op; /* Only needed so that goto works right. */
3620 PL_in_eval = EVAL_INEVAL;
3621 if (flags & G_KEEPERR)
3622 PL_in_eval |= EVAL_KEEPERR;
3624 sv_setpvn(ERRSV,"",0);
3625 if (flags & G_FAKINGEVAL) {
3626 PL_eval_root = PL_op; /* Only needed so that goto works right. */
3634 PERL_CONTEXT * const cx = create_eval_scope(0);
3635 cx->blk_eval.retop = cLOGOP->op_other->op_next;
3636 return DOCATCH(PL_op->op_next);
3645 register PERL_CONTEXT *cx;
3650 PERL_UNUSED_VAR(optype);
3653 if (gimme == G_VOID)
3655 else if (gimme == G_SCALAR) {
3659 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
3662 *MARK = sv_mortalcopy(TOPs);
3666 *MARK = &PL_sv_undef;
3671 /* in case LEAVE wipes old return values */
3673 for (mark = newsp + 1; mark <= SP; mark++) {
3674 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
3675 *mark = sv_mortalcopy(*mark);
3676 TAINT_NOT; /* Each item is independent */
3680 PL_curpm = newpm; /* Don't pop $1 et al till now */
3683 sv_setpvn(ERRSV,"",0);
3690 register PERL_CONTEXT *cx;
3691 const I32 gimme = GIMME_V;
3696 if (PL_op->op_targ == 0) {
3697 SV ** const defsv_p = &GvSV(PL_defgv);
3698 *defsv_p = newSVsv(POPs);
3699 SAVECLEARSV(*defsv_p);
3702 sv_setsv(PAD_SV(PL_op->op_targ), POPs);
3704 PUSHBLOCK(cx, CXt_GIVEN, SP);
3713 register PERL_CONTEXT *cx;
3717 PERL_UNUSED_CONTEXT;
3720 assert(CxTYPE(cx) == CXt_GIVEN);
3725 PL_curpm = newpm; /* pop $1 et al */
3732 /* Helper routines used by pp_smartmatch */
3735 S_make_matcher(pTHX_ regexp *re)
3738 PMOP *matcher = (PMOP *) newPMOP(OP_MATCH, OPf_WANT_SCALAR | OPf_STACKED);
3739 PM_SETRE(matcher, ReREFCNT_inc(re));
3741 SAVEFREEOP((OP *) matcher);
3749 S_matcher_matches_sv(pTHX_ PMOP *matcher, SV *sv)
3754 PL_op = (OP *) matcher;
3759 return (SvTRUEx(POPs));
3764 S_destroy_matcher(pTHX_ PMOP *matcher)
3767 PERL_UNUSED_ARG(matcher);
3772 /* Do a smart match */
3775 return do_smartmatch(NULL, NULL);
3778 /* This version of do_smartmatch() implements the
3779 * table of smart matches that is found in perlsyn.
3783 S_do_smartmatch(pTHX_ HV *seen_this, HV *seen_other)
3788 SV *e = TOPs; /* e is for 'expression' */
3789 SV *d = TOPm1s; /* d is for 'default', as in PL_defgv */
3790 SV *This, *Other; /* 'This' (and Other to match) to play with C++ */
3792 regexp *this_regex, *other_regex;
3794 # define NOT_EMPTY_PROTO(cv) (!SvPOK(cv) || SvCUR(cv) == 0)
3796 # define SM_REF(type) ( \
3797 (SvROK(d) && (SvTYPE(This = SvRV(d)) == SVt_##type) && (Other = e)) \
3798 || (SvROK(e) && (SvTYPE(This = SvRV(e)) == SVt_##type) && (Other = d)))
3800 # define SM_CV_NEP /* Find a code ref without an empty prototype */ \
3801 ((SvROK(d) && (SvTYPE(This = SvRV(d)) == SVt_PVCV) \
3802 && NOT_EMPTY_PROTO(This) && (Other = e)) \
3803 || (SvROK(e) && (SvTYPE(This = SvRV(e)) == SVt_PVCV) \
3804 && NOT_EMPTY_PROTO(This) && (Other = d)))
3806 # define SM_REGEX ( \
3807 (SvROK(d) && SvMAGICAL(This = SvRV(d)) \
3808 && (mg = mg_find(This, PERL_MAGIC_qr)) \
3809 && (this_regex = (regexp *)mg->mg_obj) \
3812 (SvROK(e) && SvMAGICAL(This = SvRV(e)) \
3813 && (mg = mg_find(This, PERL_MAGIC_qr)) \
3814 && (this_regex = (regexp *)mg->mg_obj) \
3818 # define SM_OTHER_REF(type) \
3819 (SvROK(Other) && SvTYPE(SvRV(Other)) == SVt_##type)
3821 # define SM_OTHER_REGEX (SvROK(Other) && SvMAGICAL(SvRV(Other)) \
3822 && (mg = mg_find(SvRV(Other), PERL_MAGIC_qr)) \
3823 && (other_regex = (regexp *)mg->mg_obj))
3826 # define SM_SEEN_THIS(sv) hv_exists_ent(seen_this, \
3827 sv_2mortal(newSViv(PTR2IV(sv))), 0)
3829 # define SM_SEEN_OTHER(sv) hv_exists_ent(seen_other, \
3830 sv_2mortal(newSViv(PTR2IV(sv))), 0)
3832 tryAMAGICbinSET(smart, 0);
3834 SP -= 2; /* Pop the values */
3836 /* Take care only to invoke mg_get() once for each argument.
3837 * Currently we do this by copying the SV if it's magical. */
3840 d = sv_mortalcopy(d);
3847 e = sv_mortalcopy(e);
3852 if ( SM_OTHER_REF(PVCV) && NOT_EMPTY_PROTO(SvRV(Other)) )
3854 if (This == SvRV(Other))
3865 c = call_sv(This, G_SCALAR);
3869 else if (SvTEMP(TOPs))
3870 SvREFCNT_inc_void(TOPs);
3875 else if (SM_REF(PVHV)) {
3876 if (SM_OTHER_REF(PVHV)) {
3877 /* Check that the key-sets are identical */
3879 HV *other_hv = (HV *) SvRV(Other);
3881 bool other_tied = FALSE;
3882 U32 this_key_count = 0,
3883 other_key_count = 0;
3885 /* Tied hashes don't know how many keys they have. */
3886 if (SvTIED_mg(This, PERL_MAGIC_tied)) {
3889 else if (SvTIED_mg((SV *) other_hv, PERL_MAGIC_tied)) {
3890 HV * const temp = other_hv;
3891 other_hv = (HV *) This;
3895 if (SvTIED_mg((SV *) other_hv, PERL_MAGIC_tied))
3898 if (!tied && HvUSEDKEYS((HV *) This) != HvUSEDKEYS(other_hv))
3901 /* The hashes have the same number of keys, so it suffices
3902 to check that one is a subset of the other. */
3903 (void) hv_iterinit((HV *) This);
3904 while ( (he = hv_iternext((HV *) This)) ) {
3906 char * const key = hv_iterkey(he, &key_len);
3910 if(!hv_exists(other_hv, key, key_len)) {
3911 (void) hv_iterinit((HV *) This); /* reset iterator */
3917 (void) hv_iterinit(other_hv);
3918 while ( hv_iternext(other_hv) )
3922 other_key_count = HvUSEDKEYS(other_hv);
3924 if (this_key_count != other_key_count)
3929 else if (SM_OTHER_REF(PVAV)) {
3930 AV * const other_av = (AV *) SvRV(Other);
3931 const I32 other_len = av_len(other_av) + 1;
3934 if (HvUSEDKEYS((HV *) This) != other_len)
3937 for(i = 0; i < other_len; ++i) {
3938 SV ** const svp = av_fetch(other_av, i, FALSE);
3942 if (!svp) /* ??? When can this happen? */
3945 key = SvPV(*svp, key_len);
3946 if(!hv_exists((HV *) This, key, key_len))
3951 else if (SM_OTHER_REGEX) {
3952 PMOP * const matcher = make_matcher(other_regex);
3955 (void) hv_iterinit((HV *) This);
3956 while ( (he = hv_iternext((HV *) This)) ) {
3957 if (matcher_matches_sv(matcher, hv_iterkeysv(he))) {
3958 (void) hv_iterinit((HV *) This);
3959 destroy_matcher(matcher);
3963 destroy_matcher(matcher);
3967 if (hv_exists_ent((HV *) This, Other, 0))
3973 else if (SM_REF(PVAV)) {
3974 if (SM_OTHER_REF(PVAV)) {
3975 AV *other_av = (AV *) SvRV(Other);
3976 if (av_len((AV *) This) != av_len(other_av))
3980 const I32 other_len = av_len(other_av);
3982 if (NULL == seen_this) {
3983 seen_this = newHV();
3984 (void) sv_2mortal((SV *) seen_this);
3986 if (NULL == seen_other) {
3987 seen_this = newHV();
3988 (void) sv_2mortal((SV *) seen_other);
3990 for(i = 0; i <= other_len; ++i) {
3991 SV * const * const this_elem = av_fetch((AV *)This, i, FALSE);
3992 SV * const * const other_elem = av_fetch(other_av, i, FALSE);
3994 if (!this_elem || !other_elem) {
3995 if (this_elem || other_elem)
3998 else if (SM_SEEN_THIS(*this_elem)
3999 || SM_SEEN_OTHER(*other_elem))
4001 if (*this_elem != *other_elem)
4005 hv_store_ent(seen_this,
4006 sv_2mortal(newSViv(PTR2IV(*this_elem))),
4008 hv_store_ent(seen_other,
4009 sv_2mortal(newSViv(PTR2IV(*other_elem))),
4015 (void) do_smartmatch(seen_this, seen_other);
4025 else if (SM_OTHER_REGEX) {
4026 PMOP * const matcher = make_matcher(other_regex);
4027 const I32 this_len = av_len((AV *) This);
4030 for(i = 0; i <= this_len; ++i) {
4031 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4032 if (svp && matcher_matches_sv(matcher, *svp)) {
4033 destroy_matcher(matcher);
4037 destroy_matcher(matcher);
4040 else if (SvIOK(Other) || SvNOK(Other)) {
4043 for(i = 0; i <= AvFILL((AV *) This); ++i) {
4044 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4051 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
4061 else if (SvPOK(Other)) {
4062 const I32 this_len = av_len((AV *) This);
4065 for(i = 0; i <= this_len; ++i) {
4066 SV * const * const svp = av_fetch((AV *)This, i, FALSE);
4081 else if (!SvOK(d) || !SvOK(e)) {
4082 if (!SvOK(d) && !SvOK(e))
4087 else if (SM_REGEX) {
4088 PMOP * const matcher = make_matcher(this_regex);
4091 PUSHs(matcher_matches_sv(matcher, Other)
4094 destroy_matcher(matcher);
4097 else if (SM_REF(PVCV)) {
4099 /* This must be a null-prototyped sub, because we
4100 already checked for the other kind. */
4106 c = call_sv(This, G_SCALAR);
4109 PUSHs(&PL_sv_undef);
4110 else if (SvTEMP(TOPs))
4111 SvREFCNT_inc_void(TOPs);
4113 if (SM_OTHER_REF(PVCV)) {
4114 /* This one has to be null-proto'd too.
4115 Call both of 'em, and compare the results */
4117 c = call_sv(SvRV(Other), G_SCALAR);
4120 PUSHs(&PL_sv_undef);
4121 else if (SvTEMP(TOPs))
4122 SvREFCNT_inc_void(TOPs);
4133 else if ( ((SvIOK(d) || SvNOK(d)) && (This = d) && (Other = e))
4134 || ((SvIOK(e) || SvNOK(e)) && (This = e) && (Other = d)) )
4136 if (SvPOK(Other) && !looks_like_number(Other)) {
4137 /* String comparison */
4142 /* Otherwise, numeric comparison */
4145 if (CopHINTS_get(PL_curcop) & HINT_INTEGER)
4156 /* As a last resort, use string comparison */
4165 register PERL_CONTEXT *cx;
4166 const I32 gimme = GIMME_V;
4168 /* This is essentially an optimization: if the match
4169 fails, we don't want to push a context and then
4170 pop it again right away, so we skip straight
4171 to the op that follows the leavewhen.
4173 if ((0 == (PL_op->op_flags & OPf_SPECIAL)) && !SvTRUEx(POPs))
4174 return cLOGOP->op_other->op_next;
4179 PUSHBLOCK(cx, CXt_WHEN, SP);
4188 register PERL_CONTEXT *cx;
4194 assert(CxTYPE(cx) == CXt_WHEN);
4199 PL_curpm = newpm; /* pop $1 et al */
4209 register PERL_CONTEXT *cx;
4212 cxix = dopoptowhen(cxstack_ix);
4214 DIE(aTHX_ "Can't \"continue\" outside a when block");
4215 if (cxix < cxstack_ix)
4218 /* clear off anything above the scope we're re-entering */
4219 inner = PL_scopestack_ix;
4221 if (PL_scopestack_ix < inner)
4222 leave_scope(PL_scopestack[PL_scopestack_ix]);
4223 PL_curcop = cx->blk_oldcop;
4224 return cx->blk_givwhen.leave_op;
4231 register PERL_CONTEXT *cx;
4234 cxix = dopoptogiven(cxstack_ix);
4236 if (PL_op->op_flags & OPf_SPECIAL)
4237 DIE(aTHX_ "Can't use when() outside a topicalizer");
4239 DIE(aTHX_ "Can't \"break\" outside a given block");
4241 if (CxFOREACH(&cxstack[cxix]) && (0 == (PL_op->op_flags & OPf_SPECIAL)))
4242 DIE(aTHX_ "Can't \"break\" in a loop topicalizer");
4244 if (cxix < cxstack_ix)
4247 /* clear off anything above the scope we're re-entering */
4248 inner = PL_scopestack_ix;
4250 if (PL_scopestack_ix < inner)
4251 leave_scope(PL_scopestack[PL_scopestack_ix]);
4252 PL_curcop = cx->blk_oldcop;
4255 return CX_LOOP_NEXTOP_GET(cx);
4257 return cx->blk_givwhen.leave_op;
4261 S_doparseform(pTHX_ SV *sv)
4264 register char *s = SvPV_force(sv, len);
4265 register char * const send = s + len;
4266 register char *base = NULL;
4267 register I32 skipspaces = 0;
4268 bool noblank = FALSE;
4269 bool repeat = FALSE;
4270 bool postspace = FALSE;
4276 bool unchopnum = FALSE;
4277 int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */
4280 Perl_croak(aTHX_ "Null picture in formline");
4282 /* estimate the buffer size needed */
4283 for (base = s; s <= send; s++) {
4284 if (*s == '\n' || *s == '@' || *s == '^')
4290 Newx(fops, maxops, U32);
4295 *fpc++ = FF_LINEMARK;
4296 noblank = repeat = FALSE;
4314 case ' ': case '\t':
4321 } /* else FALL THROUGH */
4329 *fpc++ = FF_LITERAL;
4337 *fpc++ = (U16)skipspaces;
4341 *fpc++ = FF_NEWLINE;
4345 arg = fpc - linepc + 1;
4352 *fpc++ = FF_LINEMARK;
4353 noblank = repeat = FALSE;
4362 ischop = s[-1] == '^';
4368 arg = (s - base) - 1;
4370 *fpc++ = FF_LITERAL;
4378 *fpc++ = 2; /* skip the @* or ^* */
4380 *fpc++ = FF_LINESNGL;
4383 *fpc++ = FF_LINEGLOB;
4385 else if (*s == '#' || (*s == '.' && s[1] == '#')) {
4386 arg = ischop ? 512 : 0;
4391 const char * const f = ++s;
4394 arg |= 256 + (s - f);
4396 *fpc++ = s - base; /* fieldsize for FETCH */
4397 *fpc++ = FF_DECIMAL;
4399 unchopnum |= ! ischop;
4401 else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
4402 arg = ischop ? 512 : 0;
4404 s++; /* skip the '0' first */
4408 const char * const f = ++s;
4411 arg |= 256 + (s - f);
4413 *fpc++ = s - base; /* fieldsize for FETCH */
4414 *fpc++ = FF_0DECIMAL;
4416 unchopnum |= ! ischop;
4420 bool ismore = FALSE;
4423 while (*++s == '>') ;
4424 prespace = FF_SPACE;
4426 else if (*s == '|') {
4427 while (*++s == '|') ;
4428 prespace = FF_HALFSPACE;
4433 while (*++s == '<') ;
4436 if (*s == '.' && s[1] == '.' && s[2] == '.') {
4440 *fpc++ = s - base; /* fieldsize for FETCH */
4442 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
4445 *fpc++ = (U16)prespace;
4459 assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */
4461 { /* need to jump to the next word */
4463 z = WORD_ALIGN - SvCUR(sv) % WORD_ALIGN;
4464 SvGROW(sv, SvCUR(sv) + z + arg * sizeof(U32) + 4);
4465 s = SvPVX(sv) + SvCUR(sv) + z;
4467 Copy(fops, s, arg, U32);
4469 sv_magic(sv, NULL, PERL_MAGIC_fm, NULL, 0);
4472 if (unchopnum && repeat)
4473 DIE(aTHX_ "Repeated format line will never terminate (~~ and @#)");
4479 S_num_overflow(NV value, I32 fldsize, I32 frcsize)
4481 /* Can value be printed in fldsize chars, using %*.*f ? */
4485 int intsize = fldsize - (value < 0 ? 1 : 0);
4492 while (intsize--) pwr *= 10.0;
4493 while (frcsize--) eps /= 10.0;
4496 if (value + eps >= pwr)
4499 if (value - eps <= -pwr)
4506 S_run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen)
4509 SV * const datasv = FILTER_DATA(idx);
4510 const int filter_has_file = IoLINES(datasv);
4511 SV * const filter_state = (SV *)IoTOP_GV(datasv);
4512 SV * const filter_sub = (SV *)IoBOTTOM_GV(datasv);
4516 const char *got_p = NULL;
4517 const char *prune_from = NULL;
4518 bool read_from_cache = FALSE;
4521 assert(maxlen >= 0);
4524 /* I was having segfault trouble under Linux 2.2.5 after a
4525 parse error occured. (Had to hack around it with a test
4526 for PL_error_count == 0.) Solaris doesn't segfault --
4527 not sure where the trouble is yet. XXX */
4529 if (IoFMT_GV(datasv)) {
4530 SV *const cache = (SV *)IoFMT_GV(datasv);
4533 const char *cache_p = SvPV(cache, cache_len);
4537 /* Running in block mode and we have some cached data already.
4539 if (cache_len >= umaxlen) {
4540 /* In fact, so much data we don't even need to call
4545 const char *const first_nl =
4546 (const char *)memchr(cache_p, '\n', cache_len);
4548 take = first_nl + 1 - cache_p;
4552 sv_catpvn(buf_sv, cache_p, take);
4553 sv_chop(cache, cache_p + take);
4554 /* Definately not EOF */
4558 sv_catsv(buf_sv, cache);
4560 umaxlen -= cache_len;
4563 read_from_cache = TRUE;
4567 /* Filter API says that the filter appends to the contents of the buffer.
4568 Usually the buffer is "", so the details don't matter. But if it's not,
4569 then clearly what it contains is already filtered by this filter, so we
4570 don't want to pass it in a second time.
4571 I'm going to use a mortal in case the upstream filter croaks. */
4572 upstream = ((SvOK(buf_sv) && sv_len(buf_sv)) || SvGMAGICAL(buf_sv))
4573 ? sv_newmortal() : buf_sv;
4574 SvUPGRADE(upstream, SVt_PV);
4576 if (filter_has_file) {
4577 status = FILTER_READ(idx+1, upstream, 0);
4580 if (filter_sub && status >= 0) {
4591 PUSHs(sv_2mortal(newSViv(0)));
4593 PUSHs(filter_state);
4596 count = call_sv(filter_sub, G_SCALAR);
4611 if(SvOK(upstream)) {
4612 got_p = SvPV(upstream, got_len);
4614 if (got_len > umaxlen) {
4615 prune_from = got_p + umaxlen;
4618 const char *const first_nl =
4619 (const char *)memchr(got_p, '\n', got_len);
4620 if (first_nl && first_nl + 1 < got_p + got_len) {
4621 /* There's a second line here... */
4622 prune_from = first_nl + 1;
4627 /* Oh. Too long. Stuff some in our cache. */
4628 STRLEN cached_len = got_p + got_len - prune_from;
4629 SV *cache = (SV *)IoFMT_GV(datasv);
4632 IoFMT_GV(datasv) = (GV*) (cache = newSV(got_len - umaxlen));
4633 } else if (SvOK(cache)) {
4634 /* Cache should be empty. */
4635 assert(!SvCUR(cache));
4638 sv_setpvn(cache, prune_from, cached_len);
4639 /* If you ask for block mode, you may well split UTF-8 characters.
4640 "If it breaks, you get to keep both parts"
4641 (Your code is broken if you don't put them back together again
4642 before something notices.) */
4643 if (SvUTF8(upstream)) {
4646 SvCUR_set(upstream, got_len - cached_len);
4647 /* Can't yet be EOF */
4652 /* If they are at EOF but buf_sv has something in it, then they may never
4653 have touched the SV upstream, so it may be undefined. If we naively
4654 concatenate it then we get a warning about use of uninitialised value.
4656 if (upstream != buf_sv && (SvOK(upstream) || SvGMAGICAL(upstream))) {
4657 sv_catsv(buf_sv, upstream);
4661 IoLINES(datasv) = 0;
4662 SvREFCNT_dec(IoFMT_GV(datasv));
4664 SvREFCNT_dec(filter_state);
4665 IoTOP_GV(datasv) = NULL;
4668 SvREFCNT_dec(filter_sub);
4669 IoBOTTOM_GV(datasv) = NULL;
4671 filter_del(S_run_user_filter);
4673 if (status == 0 && read_from_cache) {
4674 /* If we read some data from the cache (and by getting here it implies
4675 that we emptied the cache) then we aren't yet at EOF, and mustn't
4676 report that to our caller. */
4682 /* perhaps someone can come up with a better name for
4683 this? it is not really "absolute", per se ... */
4685 S_path_is_absolute(const char *name)
4687 if (PERL_FILE_IS_ABSOLUTE(name)
4688 #ifdef MACOS_TRADITIONAL
4691 || (*name == '.' && (name[1] == '/' ||
4692 (name[1] == '.' && name[2] == '/')))
4704 * c-indentation-style: bsd
4706 * indent-tabs-mode: t
4709 * ex: set ts=8 sts=4 sw=4 noet: