3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * Now far ahead the Road has gone,
12 * And I must follow, if I can,
13 * Pursuing it with eager feet,
14 * Until it joins some larger way
15 * Where many paths and errands meet.
16 * And whither then? I cannot say.
20 #define PERL_IN_PP_CTL_C
24 #define WORD_ALIGN sizeof(U16)
27 #define DOCATCH(o) ((CATCH_GET == TRUE) ? docatch(o) : (o))
29 static I32 sortcv(pTHXo_ SV *a, SV *b);
30 static I32 sortcv_stacked(pTHXo_ SV *a, SV *b);
31 static I32 sortcv_xsub(pTHXo_ SV *a, SV *b);
32 static I32 sv_ncmp(pTHXo_ SV *a, SV *b);
33 static I32 sv_i_ncmp(pTHXo_ SV *a, SV *b);
34 static I32 amagic_ncmp(pTHXo_ SV *a, SV *b);
35 static I32 amagic_i_ncmp(pTHXo_ SV *a, SV *b);
36 static I32 amagic_cmp(pTHXo_ SV *a, SV *b);
37 static I32 amagic_cmp_locale(pTHXo_ SV *a, SV *b);
38 static I32 run_user_filter(pTHXo_ int idx, SV *buf_sv, int maxlen);
41 static I32 sv_cmp_static(pTHXo_ SV *a, SV *b);
42 static I32 sv_cmp_locale_static(pTHXo_ SV *a, SV *b);
44 #define sv_cmp_static Perl_sv_cmp
45 #define sv_cmp_locale_static Perl_sv_cmp_locale
54 cxix = dopoptosub(cxstack_ix);
58 switch (cxstack[cxix].blk_gimme) {
75 /* XXXX Should store the old value to allow for tie/overload - and
76 restore in regcomp, where marked with XXXX. */
84 register PMOP *pm = (PMOP*)cLOGOP->op_other;
88 MAGIC *mg = Null(MAGIC*);
92 SV *sv = SvRV(tmpstr);
94 mg = mg_find(sv, 'r');
97 regexp *re = (regexp *)mg->mg_obj;
98 ReREFCNT_dec(pm->op_pmregexp);
99 pm->op_pmregexp = ReREFCNT_inc(re);
102 t = SvPV(tmpstr, len);
104 /* Check against the last compiled regexp. */
105 if (!pm->op_pmregexp || !pm->op_pmregexp->precomp ||
106 pm->op_pmregexp->prelen != len ||
107 memNE(pm->op_pmregexp->precomp, t, len))
109 if (pm->op_pmregexp) {
110 ReREFCNT_dec(pm->op_pmregexp);
111 pm->op_pmregexp = Null(REGEXP*); /* crucial if regcomp aborts */
113 if (PL_op->op_flags & OPf_SPECIAL)
114 PL_reginterp_cnt = I32_MAX; /* Mark as safe. */
116 pm->op_pmflags = pm->op_pmpermflags; /* reset case sensitivity */
118 pm->op_pmdynflags |= PMdf_UTF8;
119 pm->op_pmregexp = CALLREGCOMP(aTHX_ t, t + len, pm);
120 PL_reginterp_cnt = 0; /* XXXX Be extra paranoid - needed
121 inside tie/overload accessors. */
125 #ifndef INCOMPLETE_TAINTS
128 pm->op_pmdynflags |= PMdf_TAINTED;
130 pm->op_pmdynflags &= ~PMdf_TAINTED;
134 if (!pm->op_pmregexp->prelen && PL_curpm)
136 else if (strEQ("\\s+", pm->op_pmregexp->precomp))
137 pm->op_pmflags |= PMf_WHITE;
139 /* XXX runtime compiled output needs to move to the pad */
140 if (pm->op_pmflags & PMf_KEEP) {
141 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
142 #if !defined(USE_ITHREADS) && !defined(USE_THREADS)
143 /* XXX can't change the optree at runtime either */
144 cLOGOP->op_first->op_next = PL_op->op_next;
153 register PMOP *pm = (PMOP*) cLOGOP->op_other;
154 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
155 register SV *dstr = cx->sb_dstr;
156 register char *s = cx->sb_s;
157 register char *m = cx->sb_m;
158 char *orig = cx->sb_orig;
159 register REGEXP *rx = cx->sb_rx;
161 rxres_restore(&cx->sb_rxres, rx);
163 if (cx->sb_iters++) {
164 if (cx->sb_iters > cx->sb_maxiters)
165 DIE(aTHX_ "Substitution loop");
167 if (!(cx->sb_rxtainted & 2) && SvTAINTED(TOPs))
168 cx->sb_rxtainted |= 2;
169 sv_catsv(dstr, POPs);
172 if (cx->sb_once || !CALLREGEXEC(aTHX_ rx, s, cx->sb_strend, orig,
173 s == m, cx->sb_targ, NULL,
174 ((cx->sb_rflags & REXEC_COPY_STR)
175 ? (REXEC_IGNOREPOS|REXEC_NOT_FIRST)
176 : (REXEC_COPY_STR|REXEC_IGNOREPOS|REXEC_NOT_FIRST))))
178 SV *targ = cx->sb_targ;
179 sv_catpvn(dstr, s, cx->sb_strend - s);
181 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
183 (void)SvOOK_off(targ);
184 Safefree(SvPVX(targ));
185 SvPVX(targ) = SvPVX(dstr);
186 SvCUR_set(targ, SvCUR(dstr));
187 SvLEN_set(targ, SvLEN(dstr));
191 TAINT_IF(cx->sb_rxtainted & 1);
192 PUSHs(sv_2mortal(newSViv((I32)cx->sb_iters - 1)));
194 (void)SvPOK_only(targ);
195 TAINT_IF(cx->sb_rxtainted);
199 LEAVE_SCOPE(cx->sb_oldsave);
201 RETURNOP(pm->op_next);
204 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
207 cx->sb_orig = orig = rx->subbeg;
209 cx->sb_strend = s + (cx->sb_strend - m);
211 cx->sb_m = m = rx->startp[0] + orig;
212 sv_catpvn(dstr, s, m-s);
213 cx->sb_s = rx->endp[0] + orig;
214 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
215 rxres_save(&cx->sb_rxres, rx);
216 RETURNOP(pm->op_pmreplstart);
220 Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
225 if (!p || p[1] < rx->nparens) {
226 i = 6 + rx->nparens * 2;
234 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? rx->subbeg : Nullch);
235 RX_MATCH_COPIED_off(rx);
239 *p++ = PTR2UV(rx->subbeg);
240 *p++ = (UV)rx->sublen;
241 for (i = 0; i <= rx->nparens; ++i) {
242 *p++ = (UV)rx->startp[i];
243 *p++ = (UV)rx->endp[i];
248 Perl_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
253 if (RX_MATCH_COPIED(rx))
254 Safefree(rx->subbeg);
255 RX_MATCH_COPIED_set(rx, *p);
260 rx->subbeg = INT2PTR(char*,*p++);
261 rx->sublen = (I32)(*p++);
262 for (i = 0; i <= rx->nparens; ++i) {
263 rx->startp[i] = (I32)(*p++);
264 rx->endp[i] = (I32)(*p++);
269 Perl_rxres_free(pTHX_ void **rsp)
274 Safefree(INT2PTR(char*,*p));
282 djSP; dMARK; dORIGMARK;
283 register SV *tmpForm = *++MARK;
295 bool chopspace = (strchr(PL_chopset, ' ') != Nullch);
301 STRLEN fudge = SvCUR(tmpForm) * (IN_BYTE ? 1 : 3) + 1;
302 bool item_is_utf = FALSE;
304 if (!SvMAGICAL(tmpForm) || !SvCOMPILED(tmpForm)) {
305 if (SvREADONLY(tmpForm)) {
306 SvREADONLY_off(tmpForm);
307 doparseform(tmpForm);
308 SvREADONLY_on(tmpForm);
311 doparseform(tmpForm);
314 SvPV_force(PL_formtarget, len);
315 t = SvGROW(PL_formtarget, len + fudge + 1); /* XXX SvCUR bad */
317 f = SvPV(tmpForm, len);
318 /* need to jump to the next word */
319 s = f + len + WORD_ALIGN - SvCUR(tmpForm) % WORD_ALIGN;
328 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
329 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
330 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
331 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
332 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
334 case FF_CHECKNL: name = "CHECKNL"; break;
335 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
336 case FF_SPACE: name = "SPACE"; break;
337 case FF_HALFSPACE: name = "HALFSPACE"; break;
338 case FF_ITEM: name = "ITEM"; break;
339 case FF_CHOP: name = "CHOP"; break;
340 case FF_LINEGLOB: name = "LINEGLOB"; break;
341 case FF_NEWLINE: name = "NEWLINE"; break;
342 case FF_MORE: name = "MORE"; break;
343 case FF_LINEMARK: name = "LINEMARK"; break;
344 case FF_END: name = "END"; break;
347 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
349 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
377 if (ckWARN(WARN_SYNTAX))
378 Perl_warner(aTHX_ WARN_SYNTAX, "Not enough format arguments");
383 item = s = SvPV(sv, len);
386 itemsize = sv_len_utf8(sv);
387 if (itemsize != len) {
389 if (itemsize > fieldsize) {
390 itemsize = fieldsize;
391 itembytes = itemsize;
392 sv_pos_u2b(sv, &itembytes, 0);
396 send = chophere = s + itembytes;
406 sv_pos_b2u(sv, &itemsize);
411 if (itemsize > fieldsize)
412 itemsize = fieldsize;
413 send = chophere = s + itemsize;
425 item = s = SvPV(sv, len);
428 itemsize = sv_len_utf8(sv);
429 if (itemsize != len) {
431 if (itemsize <= fieldsize) {
432 send = chophere = s + itemsize;
443 itemsize = fieldsize;
444 itembytes = itemsize;
445 sv_pos_u2b(sv, &itembytes, 0);
446 send = chophere = s + itembytes;
447 while (s < send || (s == send && isSPACE(*s))) {
457 if (strchr(PL_chopset, *s))
462 itemsize = chophere - item;
463 sv_pos_b2u(sv, &itemsize);
470 if (itemsize <= fieldsize) {
471 send = chophere = s + itemsize;
482 itemsize = fieldsize;
483 send = chophere = s + itemsize;
484 while (s < send || (s == send && isSPACE(*s))) {
494 if (strchr(PL_chopset, *s))
499 itemsize = chophere - item;
504 arg = fieldsize - itemsize;
513 arg = fieldsize - itemsize;
528 switch (UTF8SKIP(s)) {
539 if ( !((*t++ = *s++) & ~31) )
547 int ch = *t++ = *s++;
550 if ( !((*t++ = *s++) & ~31) )
559 while (*s && isSPACE(*s))
566 item = s = SvPV(sv, len);
568 item_is_utf = FALSE; /* XXX is this correct? */
580 SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
581 sv_catpvn(PL_formtarget, item, itemsize);
582 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
583 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
588 /* If the field is marked with ^ and the value is undefined,
591 if ((arg & 512) && !SvOK(sv)) {
599 /* Formats aren't yet marked for locales, so assume "yes". */
601 RESTORE_NUMERIC_LOCAL();
602 #if defined(USE_LONG_DOUBLE)
604 sprintf(t, "%#*.*" PERL_PRIfldbl,
605 (int) fieldsize, (int) arg & 255, value);
607 sprintf(t, "%*.0" PERL_PRIfldbl, (int) fieldsize, value);
612 (int) fieldsize, (int) arg & 255, value);
615 (int) fieldsize, value);
618 RESTORE_NUMERIC_STANDARD();
625 while (t-- > linemark && *t == ' ') ;
633 if (arg) { /* repeat until fields exhausted? */
635 SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
636 lines += FmLINES(PL_formtarget);
639 if (strnEQ(linemark, linemark - arg, arg))
640 DIE(aTHX_ "Runaway format");
642 FmLINES(PL_formtarget) = lines;
644 RETURNOP(cLISTOP->op_first);
657 while (*s && isSPACE(*s) && s < send)
661 arg = fieldsize - itemsize;
668 if (strnEQ(s," ",3)) {
669 while (s > SvPVX(PL_formtarget) && isSPACE(s[-1]))
680 SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
681 FmLINES(PL_formtarget) += lines;
693 if (PL_stack_base + *PL_markstack_ptr == SP) {
695 if (GIMME_V == G_SCALAR)
696 XPUSHs(sv_2mortal(newSViv(0)));
697 RETURNOP(PL_op->op_next->op_next);
699 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
700 pp_pushmark(); /* push dst */
701 pp_pushmark(); /* push src */
702 ENTER; /* enter outer scope */
705 /* SAVE_DEFSV does *not* suffice here for USE_THREADS */
707 ENTER; /* enter inner scope */
710 src = PL_stack_base[*PL_markstack_ptr];
715 if (PL_op->op_type == OP_MAPSTART)
716 pp_pushmark(); /* push top */
717 return ((LOGOP*)PL_op->op_next)->op_other;
722 DIE(aTHX_ "panic: mapstart"); /* uses grepstart */
728 I32 diff = (SP - PL_stack_base) - *PL_markstack_ptr;
734 ++PL_markstack_ptr[-1];
736 if (diff > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
737 shift = diff - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
738 count = (SP - PL_stack_base) - PL_markstack_ptr[-1] + 2;
743 PL_markstack_ptr[-1] += shift;
744 *PL_markstack_ptr += shift;
748 dst = PL_stack_base + (PL_markstack_ptr[-2] += diff) - 1;
751 *dst-- = SvTEMP(TOPs) ? POPs : sv_mortalcopy(POPs);
753 LEAVE; /* exit inner scope */
756 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
760 (void)POPMARK; /* pop top */
761 LEAVE; /* exit outer scope */
762 (void)POPMARK; /* pop src */
763 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
764 (void)POPMARK; /* pop dst */
765 SP = PL_stack_base + POPMARK; /* pop original mark */
766 if (gimme == G_SCALAR) {
770 else if (gimme == G_ARRAY)
777 ENTER; /* enter inner scope */
780 src = PL_stack_base[PL_markstack_ptr[-1]];
784 RETURNOP(cLOGOP->op_other);
790 djSP; dMARK; dORIGMARK;
792 SV **myorigmark = ORIGMARK;
798 OP* nextop = PL_op->op_next;
800 bool hasargs = FALSE;
803 if (gimme != G_ARRAY) {
809 SAVEVPTR(PL_sortcop);
810 if (PL_op->op_flags & OPf_STACKED) {
811 if (PL_op->op_flags & OPf_SPECIAL) {
812 OP *kid = cLISTOP->op_first->op_sibling; /* pass pushmark */
813 kid = kUNOP->op_first; /* pass rv2gv */
814 kid = kUNOP->op_first; /* pass leave */
815 PL_sortcop = kid->op_next;
816 stash = CopSTASH(PL_curcop);
819 cv = sv_2cv(*++MARK, &stash, &gv, 0);
820 if (cv && SvPOK(cv)) {
822 char *proto = SvPV((SV*)cv, n_a);
823 if (proto && strEQ(proto, "$$")) {
827 if (!(cv && CvROOT(cv))) {
828 if (cv && CvXSUB(cv)) {
832 SV *tmpstr = sv_newmortal();
833 gv_efullname3(tmpstr, gv, Nullch);
834 DIE(aTHX_ "Undefined sort subroutine \"%s\" called",
838 DIE(aTHX_ "Undefined subroutine in sort");
843 PL_sortcop = (OP*)cv;
845 PL_sortcop = CvSTART(cv);
846 SAVEVPTR(CvROOT(cv)->op_ppaddr);
847 CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
850 PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
856 stash = CopSTASH(PL_curcop);
860 while (MARK < SP) { /* This may or may not shift down one here. */
862 if (*up = *++MARK) { /* Weed out nulls. */
864 if (!PL_sortcop && !SvPOK(*up)) {
869 (void)sv_2pv(*up, &n_a);
874 max = --up - myorigmark;
879 bool oldcatch = CATCH_GET;
885 PUSHSTACKi(PERLSI_SORT);
886 if (PL_sortstash != stash) {
887 PL_firstgv = gv_fetchpv("a", TRUE, SVt_PV);
888 PL_secondgv = gv_fetchpv("b", TRUE, SVt_PV);
889 PL_sortstash = stash;
892 SAVESPTR(GvSV(PL_firstgv));
893 SAVESPTR(GvSV(PL_secondgv));
895 PUSHBLOCK(cx, CXt_NULL, PL_stack_base);
896 if (!(PL_op->op_flags & OPf_SPECIAL)) {
897 cx->cx_type = CXt_SUB;
898 cx->blk_gimme = G_SCALAR;
901 (void)SvREFCNT_inc(cv); /* in preparation for POPSUB */
903 PL_sortcxix = cxstack_ix;
905 if (hasargs && !is_xsub) {
906 /* This is mostly copied from pp_entersub */
907 AV *av = (AV*)PL_curpad[0];
910 cx->blk_sub.savearray = GvAV(PL_defgv);
911 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
912 #endif /* USE_THREADS */
913 cx->blk_sub.argarray = av;
915 qsortsv((myorigmark+1), max,
916 is_xsub ? sortcv_xsub : hasargs ? sortcv_stacked : sortcv);
918 POPBLOCK(cx,PL_curpm);
926 MEXTEND(SP, 20); /* Can't afford stack realloc on signal. */
927 qsortsv(ORIGMARK+1, max,
928 (PL_op->op_private & OPpSORT_NUMERIC)
929 ? ( (PL_op->op_private & OPpSORT_INTEGER)
930 ? ( overloading ? amagic_i_ncmp : sv_i_ncmp)
931 : ( overloading ? amagic_ncmp : sv_ncmp))
932 : ( (PL_op->op_private & OPpLOCALE)
935 : sv_cmp_locale_static)
936 : ( overloading ? amagic_cmp : sv_cmp_static)));
937 if (PL_op->op_private & OPpSORT_REVERSE) {
939 SV **q = ORIGMARK+max;
949 PL_stack_sp = ORIGMARK + max;
957 if (GIMME == G_ARRAY)
959 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
960 return cLOGOP->op_other;
969 if (GIMME == G_ARRAY) {
970 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
974 SV *targ = PAD_SV(PL_op->op_targ);
976 if ((PL_op->op_private & OPpFLIP_LINENUM)
977 ? (PL_last_in_gv && SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv)))
979 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
980 if (PL_op->op_flags & OPf_SPECIAL) {
988 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1001 if (GIMME == G_ARRAY) {
1007 if (SvGMAGICAL(left))
1009 if (SvGMAGICAL(right))
1012 if (SvNIOKp(left) || !SvPOKp(left) ||
1013 SvNIOKp(right) || !SvPOKp(right) ||
1014 (looks_like_number(left) && *SvPVX(left) != '0' &&
1015 looks_like_number(right) && *SvPVX(right) != '0'))
1017 if (SvNV(left) < IV_MIN || SvNV(right) > IV_MAX)
1018 DIE(aTHX_ "Range iterator outside integer range");
1029 sv = sv_2mortal(newSViv(i++));
1034 SV *final = sv_mortalcopy(right);
1036 char *tmps = SvPV(final, len);
1038 sv = sv_mortalcopy(left);
1040 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
1042 if (strEQ(SvPVX(sv),tmps))
1044 sv = sv_2mortal(newSVsv(sv));
1051 SV *targ = PAD_SV(cUNOP->op_first->op_targ);
1053 if ((PL_op->op_private & OPpFLIP_LINENUM)
1054 ? (PL_last_in_gv && SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv)))
1056 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
1057 sv_catpv(targ, "E0");
1068 S_dopoptolabel(pTHX_ char *label)
1072 register PERL_CONTEXT *cx;
1074 for (i = cxstack_ix; i >= 0; i--) {
1076 switch (CxTYPE(cx)) {
1078 if (ckWARN(WARN_UNSAFE))
1079 Perl_warner(aTHX_ WARN_UNSAFE, "Exiting substitution via %s",
1080 PL_op_name[PL_op->op_type]);
1083 if (ckWARN(WARN_UNSAFE))
1084 Perl_warner(aTHX_ WARN_UNSAFE, "Exiting subroutine via %s",
1085 PL_op_name[PL_op->op_type]);
1088 if (ckWARN(WARN_UNSAFE))
1089 Perl_warner(aTHX_ WARN_UNSAFE, "Exiting format via %s",
1090 PL_op_name[PL_op->op_type]);
1093 if (ckWARN(WARN_UNSAFE))
1094 Perl_warner(aTHX_ WARN_UNSAFE, "Exiting eval via %s",
1095 PL_op_name[PL_op->op_type]);
1098 if (ckWARN(WARN_UNSAFE))
1099 Perl_warner(aTHX_ WARN_UNSAFE, "Exiting pseudo-block via %s",
1100 PL_op_name[PL_op->op_type]);
1103 if (!cx->blk_loop.label ||
1104 strNE(label, cx->blk_loop.label) ) {
1105 DEBUG_l(Perl_deb(aTHX_ "(Skipping label #%ld %s)\n",
1106 (long)i, cx->blk_loop.label));
1109 DEBUG_l( Perl_deb(aTHX_ "(Found label #%ld %s)\n", (long)i, label));
1117 Perl_dowantarray(pTHX)
1119 I32 gimme = block_gimme();
1120 return (gimme == G_VOID) ? G_SCALAR : gimme;
1124 Perl_block_gimme(pTHX)
1129 cxix = dopoptosub(cxstack_ix);
1133 switch (cxstack[cxix].blk_gimme) {
1141 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
1148 S_dopoptosub(pTHX_ I32 startingblock)
1151 return dopoptosub_at(cxstack, startingblock);
1155 S_dopoptosub_at(pTHX_ PERL_CONTEXT *cxstk, I32 startingblock)
1159 register PERL_CONTEXT *cx;
1160 for (i = startingblock; i >= 0; i--) {
1162 switch (CxTYPE(cx)) {
1168 DEBUG_l( Perl_deb(aTHX_ "(Found sub #%ld)\n", (long)i));
1176 S_dopoptoeval(pTHX_ I32 startingblock)
1180 register PERL_CONTEXT *cx;
1181 for (i = startingblock; i >= 0; i--) {
1183 switch (CxTYPE(cx)) {
1187 DEBUG_l( Perl_deb(aTHX_ "(Found eval #%ld)\n", (long)i));
1195 S_dopoptoloop(pTHX_ I32 startingblock)
1199 register PERL_CONTEXT *cx;
1200 for (i = startingblock; i >= 0; i--) {
1202 switch (CxTYPE(cx)) {
1204 if (ckWARN(WARN_UNSAFE))
1205 Perl_warner(aTHX_ WARN_UNSAFE, "Exiting substitution via %s",
1206 PL_op_name[PL_op->op_type]);
1209 if (ckWARN(WARN_UNSAFE))
1210 Perl_warner(aTHX_ WARN_UNSAFE, "Exiting subroutine via %s",
1211 PL_op_name[PL_op->op_type]);
1214 if (ckWARN(WARN_UNSAFE))
1215 Perl_warner(aTHX_ WARN_UNSAFE, "Exiting format via %s",
1216 PL_op_name[PL_op->op_type]);
1219 if (ckWARN(WARN_UNSAFE))
1220 Perl_warner(aTHX_ WARN_UNSAFE, "Exiting eval via %s",
1221 PL_op_name[PL_op->op_type]);
1224 if (ckWARN(WARN_UNSAFE))
1225 Perl_warner(aTHX_ WARN_UNSAFE, "Exiting pseudo-block via %s",
1226 PL_op_name[PL_op->op_type]);
1229 DEBUG_l( Perl_deb(aTHX_ "(Found loop #%ld)\n", (long)i));
1237 Perl_dounwind(pTHX_ I32 cxix)
1240 register PERL_CONTEXT *cx;
1244 while (cxstack_ix > cxix) {
1246 cx = &cxstack[cxstack_ix];
1247 DEBUG_l(PerlIO_printf(Perl_debug_log, "Unwinding block %ld, type %s\n",
1248 (long) cxstack_ix, PL_block_type[CxTYPE(cx)]));
1249 /* Note: we don't need to restore the base context info till the end. */
1250 switch (CxTYPE(cx)) {
1253 continue; /* not break */
1275 * Closures mentioned at top level of eval cannot be referenced
1276 * again, and their presence indirectly causes a memory leak.
1277 * (Note that the fact that compcv and friends are still set here
1278 * is, AFAIK, an accident.) --Chip
1280 * XXX need to get comppad et al from eval's cv rather than
1281 * relying on the incidental global values.
1284 S_free_closures(pTHX)
1287 SV **svp = AvARRAY(PL_comppad_name);
1289 for (ix = AvFILLp(PL_comppad_name); ix >= 0; ix--) {
1291 if (sv && sv != &PL_sv_undef && *SvPVX(sv) == '&') {
1293 svp[ix] = &PL_sv_undef;
1297 SvREFCNT_dec(CvOUTSIDE(sv));
1298 CvOUTSIDE(sv) = Nullcv;
1311 Perl_qerror(pTHX_ SV *err)
1314 sv_catsv(ERRSV, err);
1316 sv_catsv(PL_errors, err);
1318 Perl_warn(aTHX_ "%"SVf, err);
1323 Perl_die_where(pTHX_ char *message, STRLEN msglen)
1329 register PERL_CONTEXT *cx;
1334 if (PL_in_eval & EVAL_KEEPERR) {
1335 static char prefix[] = "\t(in cleanup) ";
1340 else if (SvCUR(err) >= sizeof(prefix)+msglen-1) {
1343 if (*e != *message || strNE(e,message))
1347 SvGROW(err, SvCUR(err)+sizeof(prefix)+msglen);
1348 sv_catpvn(err, prefix, sizeof(prefix)-1);
1349 sv_catpvn(err, message, msglen);
1350 if (ckWARN(WARN_UNSAFE)) {
1351 STRLEN start = SvCUR(err)-msglen-sizeof(prefix)+1;
1352 Perl_warner(aTHX_ WARN_UNSAFE, SvPVX(err)+start);
1357 sv_setpvn(ERRSV, message, msglen);
1360 message = SvPVx(ERRSV, msglen);
1362 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1363 && PL_curstackinfo->si_prev)
1372 if (cxix < cxstack_ix)
1375 POPBLOCK(cx,PL_curpm);
1376 if (CxTYPE(cx) != CXt_EVAL) {
1377 PerlIO_write(Perl_error_log, "panic: die ", 11);
1378 PerlIO_write(Perl_error_log, message, msglen);
1383 if (gimme == G_SCALAR)
1384 *++newsp = &PL_sv_undef;
1385 PL_stack_sp = newsp;
1389 if (optype == OP_REQUIRE) {
1390 char* msg = SvPVx(ERRSV, n_a);
1391 DIE(aTHX_ "%sCompilation failed in require",
1392 *msg ? msg : "Unknown error\n");
1394 return pop_return();
1398 message = SvPVx(ERRSV, msglen);
1401 /* SFIO can really mess with your errno */
1404 PerlIO *serr = Perl_error_log;
1406 PerlIO_write(serr, message, msglen);
1407 (void)PerlIO_flush(serr);
1420 if (SvTRUE(left) != SvTRUE(right))
1432 RETURNOP(cLOGOP->op_other);
1441 RETURNOP(cLOGOP->op_other);
1447 register I32 cxix = dopoptosub(cxstack_ix);
1448 register PERL_CONTEXT *cx;
1449 register PERL_CONTEXT *ccstack = cxstack;
1450 PERL_SI *top_si = PL_curstackinfo;
1461 /* we may be in a higher stacklevel, so dig down deeper */
1462 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1463 top_si = top_si->si_prev;
1464 ccstack = top_si->si_cxstack;
1465 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1468 if (GIMME != G_ARRAY)
1472 if (PL_DBsub && cxix >= 0 &&
1473 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1477 cxix = dopoptosub_at(ccstack, cxix - 1);
1480 cx = &ccstack[cxix];
1481 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1482 dbcxix = dopoptosub_at(ccstack, cxix - 1);
1483 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1484 field below is defined for any cx. */
1485 if (PL_DBsub && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1486 cx = &ccstack[dbcxix];
1489 stashname = CopSTASHPV(cx->blk_oldcop);
1490 if (GIMME != G_ARRAY) {
1492 PUSHs(&PL_sv_undef);
1495 sv_setpv(TARG, stashname);
1502 PUSHs(&PL_sv_undef);
1504 PUSHs(sv_2mortal(newSVpv(stashname, 0)));
1505 PUSHs(sv_2mortal(newSVpv(CopFILE(cx->blk_oldcop), 0)));
1506 PUSHs(sv_2mortal(newSViv((I32)CopLINE(cx->blk_oldcop))));
1509 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1510 /* So is ccstack[dbcxix]. */
1512 gv_efullname3(sv, CvGV(ccstack[cxix].blk_sub.cv), Nullch);
1513 PUSHs(sv_2mortal(sv));
1514 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1517 PUSHs(sv_2mortal(newSVpvn("(eval)",6)));
1518 PUSHs(sv_2mortal(newSViv(0)));
1520 gimme = (I32)cx->blk_gimme;
1521 if (gimme == G_VOID)
1522 PUSHs(&PL_sv_undef);
1524 PUSHs(sv_2mortal(newSViv(gimme & G_ARRAY)));
1525 if (CxTYPE(cx) == CXt_EVAL) {
1526 if (cx->blk_eval.old_op_type == OP_ENTEREVAL) {
1527 PUSHs(cx->blk_eval.cur_text);
1530 else if (cx->blk_eval.old_name) { /* Try blocks have old_name == 0. */
1531 /* Require, put the name. */
1532 PUSHs(sv_2mortal(newSVpv(cx->blk_eval.old_name, 0)));
1537 PUSHs(&PL_sv_undef);
1538 PUSHs(&PL_sv_undef);
1540 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs
1541 && CopSTASH_eq(PL_curcop, PL_debstash))
1543 AV *ary = cx->blk_sub.argarray;
1544 int off = AvARRAY(ary) - AvALLOC(ary);
1548 PL_dbargs = GvAV(gv_AVadd(tmpgv = gv_fetchpv("DB::args", TRUE,
1551 AvREAL_off(PL_dbargs); /* XXX Should be REIFY */
1554 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1555 av_extend(PL_dbargs, AvFILLp(ary) + off);
1556 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1557 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1559 /* XXX only hints propagated via op_private are currently
1560 * visible (others are not easily accessible, since they
1561 * use the global PL_hints) */
1562 PUSHs(sv_2mortal(newSViv((I32)cx->blk_oldcop->op_private &
1563 HINT_PRIVATE_MASK)));
1577 sv_reset(tmps, CopSTASH(PL_curcop));
1589 PL_curcop = (COP*)PL_op;
1590 TAINT_NOT; /* Each statement is presumed innocent */
1591 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
1594 if (PL_op->op_private || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
1598 register PERL_CONTEXT *cx;
1599 I32 gimme = G_ARRAY;
1606 DIE(aTHX_ "No DB::DB routine defined");
1608 if (CvDEPTH(cv) >= 1 && !(PL_debug & (1<<30))) /* don't do recursive DB::DB call */
1620 push_return(PL_op->op_next);
1621 PUSHBLOCK(cx, CXt_SUB, SP);
1624 (void)SvREFCNT_inc(cv);
1625 SAVEVPTR(PL_curpad);
1626 PL_curpad = AvARRAY((AV*)*av_fetch(CvPADLIST(cv),1,FALSE));
1627 RETURNOP(CvSTART(cv));
1641 register PERL_CONTEXT *cx;
1642 I32 gimme = GIMME_V;
1644 U32 cxtype = CXt_LOOP;
1653 if (PL_op->op_flags & OPf_SPECIAL) {
1655 svp = &THREADSV(PL_op->op_targ); /* per-thread variable */
1656 SAVEGENERICSV(*svp);
1660 #endif /* USE_THREADS */
1661 if (PL_op->op_targ) {
1662 svp = &PL_curpad[PL_op->op_targ]; /* "my" variable */
1665 iterdata = (void*)PL_op->op_targ;
1666 cxtype |= CXp_PADVAR;
1671 svp = &GvSV(gv); /* symbol table variable */
1672 SAVEGENERICSV(*svp);
1675 iterdata = (void*)gv;
1681 PUSHBLOCK(cx, cxtype, SP);
1683 PUSHLOOP(cx, iterdata, MARK);
1685 PUSHLOOP(cx, svp, MARK);
1687 if (PL_op->op_flags & OPf_STACKED) {
1688 cx->blk_loop.iterary = (AV*)SvREFCNT_inc(POPs);
1689 if (SvTYPE(cx->blk_loop.iterary) != SVt_PVAV) {
1691 if (SvNIOKp(sv) || !SvPOKp(sv) ||
1692 SvNIOKp(cx->blk_loop.iterary) || !SvPOKp(cx->blk_loop.iterary) ||
1693 (looks_like_number(sv) && *SvPVX(sv) != '0' &&
1694 looks_like_number((SV*)cx->blk_loop.iterary) &&
1695 *SvPVX(cx->blk_loop.iterary) != '0'))
1697 if (SvNV(sv) < IV_MIN ||
1698 SvNV((SV*)cx->blk_loop.iterary) >= IV_MAX)
1699 DIE(aTHX_ "Range iterator outside integer range");
1700 cx->blk_loop.iterix = SvIV(sv);
1701 cx->blk_loop.itermax = SvIV((SV*)cx->blk_loop.iterary);
1704 cx->blk_loop.iterlval = newSVsv(sv);
1708 cx->blk_loop.iterary = PL_curstack;
1709 AvFILLp(PL_curstack) = SP - PL_stack_base;
1710 cx->blk_loop.iterix = MARK - PL_stack_base;
1719 register PERL_CONTEXT *cx;
1720 I32 gimme = GIMME_V;
1726 PUSHBLOCK(cx, CXt_LOOP, SP);
1727 PUSHLOOP(cx, 0, SP);
1735 register PERL_CONTEXT *cx;
1743 newsp = PL_stack_base + cx->blk_loop.resetsp;
1746 if (gimme == G_VOID)
1748 else if (gimme == G_SCALAR) {
1750 *++newsp = sv_mortalcopy(*SP);
1752 *++newsp = &PL_sv_undef;
1756 *++newsp = sv_mortalcopy(*++mark);
1757 TAINT_NOT; /* Each item is independent */
1763 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
1764 PL_curpm = newpm; /* ... and pop $1 et al */
1776 register PERL_CONTEXT *cx;
1777 bool popsub2 = FALSE;
1784 if (PL_curstackinfo->si_type == PERLSI_SORT) {
1785 if (cxstack_ix == PL_sortcxix
1786 || dopoptosub(cxstack_ix) <= PL_sortcxix)
1788 if (cxstack_ix > PL_sortcxix)
1789 dounwind(PL_sortcxix);
1790 AvARRAY(PL_curstack)[1] = *SP;
1791 PL_stack_sp = PL_stack_base + 1;
1796 cxix = dopoptosub(cxstack_ix);
1798 DIE(aTHX_ "Can't return outside a subroutine");
1799 if (cxix < cxstack_ix)
1803 switch (CxTYPE(cx)) {
1809 if (AvFILLp(PL_comppad_name) >= 0)
1812 if (optype == OP_REQUIRE &&
1813 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
1815 /* Unassume the success we assumed earlier. */
1816 char *name = cx->blk_eval.old_name;
1817 (void)hv_delete(GvHVn(PL_incgv), name, strlen(name), G_DISCARD);
1818 DIE(aTHX_ "%s did not return a true value", name);
1825 DIE(aTHX_ "panic: return");
1829 if (gimme == G_SCALAR) {
1832 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
1834 *++newsp = SvREFCNT_inc(*SP);
1839 *++newsp = sv_mortalcopy(*SP);
1842 *++newsp = (SvTEMP(*SP)) ? *SP : sv_mortalcopy(*SP);
1844 *++newsp = sv_mortalcopy(*SP);
1846 *++newsp = &PL_sv_undef;
1848 else if (gimme == G_ARRAY) {
1849 while (++MARK <= SP) {
1850 *++newsp = (popsub2 && SvTEMP(*MARK))
1851 ? *MARK : sv_mortalcopy(*MARK);
1852 TAINT_NOT; /* Each item is independent */
1855 PL_stack_sp = newsp;
1857 /* Stack values are safe: */
1859 POPSUB(cx,sv); /* release CV and @_ ... */
1863 PL_curpm = newpm; /* ... and pop $1 et al */
1867 return pop_return();
1874 register PERL_CONTEXT *cx;
1884 if (PL_op->op_flags & OPf_SPECIAL) {
1885 cxix = dopoptoloop(cxstack_ix);
1887 DIE(aTHX_ "Can't \"last\" outside a loop block");
1890 cxix = dopoptolabel(cPVOP->op_pv);
1892 DIE(aTHX_ "Label not found for \"last %s\"", cPVOP->op_pv);
1894 if (cxix < cxstack_ix)
1899 switch (CxTYPE(cx)) {
1902 newsp = PL_stack_base + cx->blk_loop.resetsp;
1903 nextop = cx->blk_loop.last_op->op_next;
1907 nextop = pop_return();
1911 nextop = pop_return();
1915 nextop = pop_return();
1918 DIE(aTHX_ "panic: last");
1922 if (gimme == G_SCALAR) {
1924 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*SP))
1925 ? *SP : sv_mortalcopy(*SP);
1927 *++newsp = &PL_sv_undef;
1929 else if (gimme == G_ARRAY) {
1930 while (++MARK <= SP) {
1931 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*MARK))
1932 ? *MARK : sv_mortalcopy(*MARK);
1933 TAINT_NOT; /* Each item is independent */
1939 /* Stack values are safe: */
1942 POPLOOP(cx); /* release loop vars ... */
1946 POPSUB(cx,sv); /* release CV and @_ ... */
1949 PL_curpm = newpm; /* ... and pop $1 et al */
1959 register PERL_CONTEXT *cx;
1962 if (PL_op->op_flags & OPf_SPECIAL) {
1963 cxix = dopoptoloop(cxstack_ix);
1965 DIE(aTHX_ "Can't \"next\" outside a loop block");
1968 cxix = dopoptolabel(cPVOP->op_pv);
1970 DIE(aTHX_ "Label not found for \"next %s\"", cPVOP->op_pv);
1972 if (cxix < cxstack_ix)
1975 cx = &cxstack[cxstack_ix];
1977 OP *nextop = cx->blk_loop.next_op;
1978 /* clean scope, but only if there's no continue block */
1979 if (nextop == cUNOPx(cx->blk_loop.last_op)->op_first->op_next) {
1981 oldsave = PL_scopestack[PL_scopestack_ix - 1];
1982 LEAVE_SCOPE(oldsave);
1991 register PERL_CONTEXT *cx;
1994 if (PL_op->op_flags & OPf_SPECIAL) {
1995 cxix = dopoptoloop(cxstack_ix);
1997 DIE(aTHX_ "Can't \"redo\" outside a loop block");
2000 cxix = dopoptolabel(cPVOP->op_pv);
2002 DIE(aTHX_ "Label not found for \"redo %s\"", cPVOP->op_pv);
2004 if (cxix < cxstack_ix)
2008 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2009 LEAVE_SCOPE(oldsave);
2010 return cx->blk_loop.redo_op;
2014 S_dofindlabel(pTHX_ OP *o, char *label, OP **opstack, OP **oplimit)
2018 static char too_deep[] = "Target of goto is too deeply nested";
2021 Perl_croak(aTHX_ too_deep);
2022 if (o->op_type == OP_LEAVE ||
2023 o->op_type == OP_SCOPE ||
2024 o->op_type == OP_LEAVELOOP ||
2025 o->op_type == OP_LEAVETRY)
2027 *ops++ = cUNOPo->op_first;
2029 Perl_croak(aTHX_ too_deep);
2032 if (o->op_flags & OPf_KIDS) {
2034 /* First try all the kids at this level, since that's likeliest. */
2035 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2036 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
2037 kCOP->cop_label && strEQ(kCOP->cop_label, label))
2040 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2041 if (kid == PL_lastgotoprobe)
2043 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
2045 (ops[-1]->op_type != OP_NEXTSTATE &&
2046 ops[-1]->op_type != OP_DBSTATE)))
2048 if (o = dofindlabel(kid, label, ops, oplimit))
2067 register PERL_CONTEXT *cx;
2068 #define GOTO_DEPTH 64
2069 OP *enterops[GOTO_DEPTH];
2071 int do_dump = (PL_op->op_type == OP_DUMP);
2072 static char must_have_label[] = "goto must have label";
2075 if (PL_op->op_flags & OPf_STACKED) {
2079 /* This egregious kludge implements goto &subroutine */
2080 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2082 register PERL_CONTEXT *cx;
2083 CV* cv = (CV*)SvRV(sv);
2089 if (!CvROOT(cv) && !CvXSUB(cv)) {
2094 /* autoloaded stub? */
2095 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2097 autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv),
2098 GvNAMELEN(gv), FALSE);
2099 if (autogv && (cv = GvCV(autogv)))
2101 tmpstr = sv_newmortal();
2102 gv_efullname3(tmpstr, gv, Nullch);
2103 DIE(aTHX_ "Goto undefined subroutine &%s",SvPVX(tmpstr));
2105 DIE(aTHX_ "Goto undefined subroutine");
2108 /* First do some returnish stuff. */
2109 cxix = dopoptosub(cxstack_ix);
2111 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
2112 if (cxix < cxstack_ix)
2115 if (CxTYPE(cx) == CXt_EVAL && cx->blk_eval.old_op_type == OP_ENTEREVAL)
2116 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2118 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs) {
2119 /* put @_ back onto stack */
2120 AV* av = cx->blk_sub.argarray;
2122 items = AvFILLp(av) + 1;
2124 EXTEND(PL_stack_sp, items); /* @_ could have been extended. */
2125 Copy(AvARRAY(av), PL_stack_sp, items, SV*);
2126 PL_stack_sp += items;
2128 SvREFCNT_dec(GvAV(PL_defgv));
2129 GvAV(PL_defgv) = cx->blk_sub.savearray;
2130 #endif /* USE_THREADS */
2131 /* abandon @_ if it got reified */
2133 (void)sv_2mortal((SV*)av); /* delay until return */
2135 av_extend(av, items-1);
2136 AvFLAGS(av) = AVf_REIFY;
2137 PL_curpad[0] = (SV*)(cx->blk_sub.argarray = av);
2140 else if (CvXSUB(cv)) { /* put GvAV(defgv) back onto stack */
2144 av = (AV*)PL_curpad[0];
2146 av = GvAV(PL_defgv);
2148 items = AvFILLp(av) + 1;
2150 EXTEND(PL_stack_sp, items); /* @_ could have been extended. */
2151 Copy(AvARRAY(av), PL_stack_sp, items, SV*);
2152 PL_stack_sp += items;
2154 if (CxTYPE(cx) == CXt_SUB &&
2155 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
2156 SvREFCNT_dec(cx->blk_sub.cv);
2157 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2158 LEAVE_SCOPE(oldsave);
2160 /* Now do some callish stuff. */
2163 #ifdef PERL_XSUB_OLDSTYLE
2164 if (CvOLDSTYLE(cv)) {
2165 I32 (*fp3)(int,int,int);
2170 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2171 items = (*fp3)(CvXSUBANY(cv).any_i32,
2172 mark - PL_stack_base + 1,
2174 SP = PL_stack_base + items;
2177 #endif /* PERL_XSUB_OLDSTYLE */
2182 PL_stack_sp--; /* There is no cv arg. */
2183 /* Push a mark for the start of arglist */
2185 (void)(*CvXSUB(cv))(aTHXo_ cv);
2186 /* Pop the current context like a decent sub should */
2187 POPBLOCK(cx, PL_curpm);
2188 /* Do _not_ use PUTBACK, keep the XSUB's return stack! */
2191 return pop_return();
2194 AV* padlist = CvPADLIST(cv);
2195 SV** svp = AvARRAY(padlist);
2196 if (CxTYPE(cx) == CXt_EVAL) {
2197 PL_in_eval = cx->blk_eval.old_in_eval;
2198 PL_eval_root = cx->blk_eval.old_eval_root;
2199 cx->cx_type = CXt_SUB;
2200 cx->blk_sub.hasargs = 0;
2202 cx->blk_sub.cv = cv;
2203 cx->blk_sub.olddepth = CvDEPTH(cv);
2205 if (CvDEPTH(cv) < 2)
2206 (void)SvREFCNT_inc(cv);
2207 else { /* save temporaries on recursion? */
2208 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION))
2209 sub_crush_depth(cv);
2210 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2211 AV *newpad = newAV();
2212 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2213 I32 ix = AvFILLp((AV*)svp[1]);
2214 I32 names_fill = AvFILLp((AV*)svp[0]);
2215 svp = AvARRAY(svp[0]);
2216 for ( ;ix > 0; ix--) {
2217 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2218 char *name = SvPVX(svp[ix]);
2219 if ((SvFLAGS(svp[ix]) & SVf_FAKE)
2222 /* outer lexical or anon code */
2223 av_store(newpad, ix,
2224 SvREFCNT_inc(oldpad[ix]) );
2226 else { /* our own lexical */
2228 av_store(newpad, ix, sv = (SV*)newAV());
2229 else if (*name == '%')
2230 av_store(newpad, ix, sv = (SV*)newHV());
2232 av_store(newpad, ix, sv = NEWSV(0,0));
2236 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2237 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2240 av_store(newpad, ix, sv = NEWSV(0,0));
2244 if (cx->blk_sub.hasargs) {
2247 av_store(newpad, 0, (SV*)av);
2248 AvFLAGS(av) = AVf_REIFY;
2250 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2251 AvFILLp(padlist) = CvDEPTH(cv);
2252 svp = AvARRAY(padlist);
2256 if (!cx->blk_sub.hasargs) {
2257 AV* av = (AV*)PL_curpad[0];
2259 items = AvFILLp(av) + 1;
2261 /* Mark is at the end of the stack. */
2263 Copy(AvARRAY(av), SP + 1, items, SV*);
2268 #endif /* USE_THREADS */
2269 SAVEVPTR(PL_curpad);
2270 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2272 if (cx->blk_sub.hasargs)
2273 #endif /* USE_THREADS */
2275 AV* av = (AV*)PL_curpad[0];
2279 cx->blk_sub.savearray = GvAV(PL_defgv);
2280 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2281 #endif /* USE_THREADS */
2282 cx->blk_sub.argarray = av;
2285 if (items >= AvMAX(av) + 1) {
2287 if (AvARRAY(av) != ary) {
2288 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2289 SvPVX(av) = (char*)ary;
2291 if (items >= AvMAX(av) + 1) {
2292 AvMAX(av) = items - 1;
2293 Renew(ary,items+1,SV*);
2295 SvPVX(av) = (char*)ary;
2298 Copy(mark,AvARRAY(av),items,SV*);
2299 AvFILLp(av) = items - 1;
2300 assert(!AvREAL(av));
2307 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
2309 * We do not care about using sv to call CV;
2310 * it's for informational purposes only.
2312 SV *sv = GvSV(PL_DBsub);
2315 if (PERLDB_SUB_NN) {
2316 SvIVX(sv) = PTR2IV(cv); /* Already upgraded, saved */
2319 gv_efullname3(sv, CvGV(cv), Nullch);
2322 && (gotocv = get_cv("DB::goto", FALSE)) ) {
2323 PUSHMARK( PL_stack_sp );
2324 call_sv((SV*)gotocv, G_SCALAR | G_NODEBUG);
2328 RETURNOP(CvSTART(cv));
2332 label = SvPV(sv,n_a);
2333 if (!(do_dump || *label))
2334 DIE(aTHX_ must_have_label);
2337 else if (PL_op->op_flags & OPf_SPECIAL) {
2339 DIE(aTHX_ must_have_label);
2342 label = cPVOP->op_pv;
2344 if (label && *label) {
2349 PL_lastgotoprobe = 0;
2351 for (ix = cxstack_ix; ix >= 0; ix--) {
2353 switch (CxTYPE(cx)) {
2355 gotoprobe = PL_eval_root; /* XXX not good for nested eval */
2358 gotoprobe = cx->blk_oldcop->op_sibling;
2364 gotoprobe = cx->blk_oldcop->op_sibling;
2366 gotoprobe = PL_main_root;
2369 if (CvDEPTH(cx->blk_sub.cv)) {
2370 gotoprobe = CvROOT(cx->blk_sub.cv);
2376 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
2379 DIE(aTHX_ "panic: goto");
2380 gotoprobe = PL_main_root;
2383 retop = dofindlabel(gotoprobe, label,
2384 enterops, enterops + GOTO_DEPTH);
2387 PL_lastgotoprobe = gotoprobe;
2390 DIE(aTHX_ "Can't find label %s", label);
2392 /* pop unwanted frames */
2394 if (ix < cxstack_ix) {
2401 oldsave = PL_scopestack[PL_scopestack_ix];
2402 LEAVE_SCOPE(oldsave);
2405 /* push wanted frames */
2407 if (*enterops && enterops[1]) {
2409 for (ix = 1; enterops[ix]; ix++) {
2410 PL_op = enterops[ix];
2411 /* Eventually we may want to stack the needed arguments
2412 * for each op. For now, we punt on the hard ones. */
2413 if (PL_op->op_type == OP_ENTERITER)
2414 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2415 CALL_FPTR(PL_op->op_ppaddr)(aTHX);
2423 if (!retop) retop = PL_main_start;
2425 PL_restartop = retop;
2426 PL_do_undump = TRUE;
2430 PL_restartop = 0; /* hmm, must be GNU unexec().. */
2431 PL_do_undump = FALSE;
2447 if (anum == 1 && VMSISH_EXIT)
2451 PL_exit_flags |= PERL_EXIT_EXPECTED;
2453 PUSHs(&PL_sv_undef);
2461 NV value = SvNVx(GvSV(cCOP->cop_gv));
2462 register I32 match = I_32(value);
2465 if (((NV)match) > value)
2466 --match; /* was fractional--truncate other way */
2468 match -= cCOP->uop.scop.scop_offset;
2471 else if (match > cCOP->uop.scop.scop_max)
2472 match = cCOP->uop.scop.scop_max;
2473 PL_op = cCOP->uop.scop.scop_next[match];
2483 PL_op = PL_op->op_next; /* can't assume anything */
2486 match = *(SvPVx(GvSV(cCOP->cop_gv), n_a)) & 255;
2487 match -= cCOP->uop.scop.scop_offset;
2490 else if (match > cCOP->uop.scop.scop_max)
2491 match = cCOP->uop.scop.scop_max;
2492 PL_op = cCOP->uop.scop.scop_next[match];
2501 S_save_lines(pTHX_ AV *array, SV *sv)
2503 register char *s = SvPVX(sv);
2504 register char *send = SvPVX(sv) + SvCUR(sv);
2506 register I32 line = 1;
2508 while (s && s < send) {
2509 SV *tmpstr = NEWSV(85,0);
2511 sv_upgrade(tmpstr, SVt_PVMG);
2512 t = strchr(s, '\n');
2518 sv_setpvn(tmpstr, s, t - s);
2519 av_store(array, line++, tmpstr);
2525 S_docatch_body(pTHX_ va_list args)
2532 S_docatch(pTHX_ OP *o)
2537 volatile PERL_SI *cursi = PL_curstackinfo;
2541 assert(CATCH_GET == TRUE);
2545 CALLPROTECT(aTHX_ pcur_env, &ret, MEMBER_TO_FPTR(S_docatch_body));
2550 if (PL_restartop && cursi == PL_curstackinfo) {
2551 PL_op = PL_restartop;
2566 Perl_sv_compile_2op(pTHX_ SV *sv, OP** startop, char *code, AV** avp)
2567 /* sv Text to convert to OP tree. */
2568 /* startop op_free() this to undo. */
2569 /* code Short string id of the caller. */
2571 dSP; /* Make POPBLOCK work. */
2574 I32 gimme = 0; /* SUSPECT - INITIALZE TO WHAT? NI-S */
2577 OP *oop = PL_op, *rop;
2578 char tbuf[TYPE_DIGITS(long) + 12 + 10];
2579 char *tmpbuf = tbuf;
2585 /* switch to eval mode */
2587 if (PL_curcop == &PL_compiling) {
2588 SAVECOPSTASH(&PL_compiling);
2589 CopSTASH_set(&PL_compiling, PL_curstash);
2591 SAVECOPFILE(&PL_compiling);
2592 SAVECOPLINE(&PL_compiling);
2593 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
2594 SV *sv = sv_newmortal();
2595 Perl_sv_setpvf(aTHX_ sv, "_<(%.10seval %lu)[%s:%"IVdf"]",
2596 code, (unsigned long)++PL_evalseq,
2597 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
2601 sprintf(tmpbuf, "_<(%.10s_eval %lu)", code, (unsigned long)++PL_evalseq);
2602 CopFILE_set(&PL_compiling, tmpbuf+2);
2603 CopLINE_set(&PL_compiling, 1);
2604 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
2605 deleting the eval's FILEGV from the stash before gv_check() runs
2606 (i.e. before run-time proper). To work around the coredump that
2607 ensues, we always turn GvMULTI_on for any globals that were
2608 introduced within evals. See force_ident(). GSAR 96-10-12 */
2609 safestr = savepv(tmpbuf);
2610 SAVEDELETE(PL_defstash, safestr, strlen(safestr));
2612 #ifdef OP_IN_REGISTER
2620 PL_op->op_type = OP_ENTEREVAL;
2621 PL_op->op_flags = 0; /* Avoid uninit warning. */
2622 PUSHBLOCK(cx, CXt_EVAL, SP);
2623 PUSHEVAL(cx, 0, Nullgv);
2624 rop = doeval(G_SCALAR, startop);
2625 POPBLOCK(cx,PL_curpm);
2628 (*startop)->op_type = OP_NULL;
2629 (*startop)->op_ppaddr = PL_ppaddr[OP_NULL];
2631 *avp = (AV*)SvREFCNT_inc(PL_comppad);
2633 if (PL_curcop == &PL_compiling)
2634 PL_compiling.op_private = PL_hints;
2635 #ifdef OP_IN_REGISTER
2641 /* With USE_THREADS, eval_owner must be held on entry to doeval */
2643 S_doeval(pTHX_ int gimme, OP** startop)
2651 PL_in_eval = EVAL_INEVAL;
2655 /* set up a scratch pad */
2658 SAVEVPTR(PL_curpad);
2659 SAVESPTR(PL_comppad);
2660 SAVESPTR(PL_comppad_name);
2661 SAVEI32(PL_comppad_name_fill);
2662 SAVEI32(PL_min_intro_pending);
2663 SAVEI32(PL_max_intro_pending);
2666 for (i = cxstack_ix - 1; i >= 0; i--) {
2667 PERL_CONTEXT *cx = &cxstack[i];
2668 if (CxTYPE(cx) == CXt_EVAL)
2670 else if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
2671 caller = cx->blk_sub.cv;
2676 SAVESPTR(PL_compcv);
2677 PL_compcv = (CV*)NEWSV(1104,0);
2678 sv_upgrade((SV *)PL_compcv, SVt_PVCV);
2679 CvEVAL_on(PL_compcv);
2681 CvOWNER(PL_compcv) = 0;
2682 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
2683 MUTEX_INIT(CvMUTEXP(PL_compcv));
2684 #endif /* USE_THREADS */
2686 PL_comppad = newAV();
2687 av_push(PL_comppad, Nullsv);
2688 PL_curpad = AvARRAY(PL_comppad);
2689 PL_comppad_name = newAV();
2690 PL_comppad_name_fill = 0;
2691 PL_min_intro_pending = 0;
2694 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
2695 PL_curpad[0] = (SV*)newAV();
2696 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
2697 #endif /* USE_THREADS */
2699 comppadlist = newAV();
2700 AvREAL_off(comppadlist);
2701 av_store(comppadlist, 0, (SV*)PL_comppad_name);
2702 av_store(comppadlist, 1, (SV*)PL_comppad);
2703 CvPADLIST(PL_compcv) = comppadlist;
2705 if (!saveop || saveop->op_type != OP_REQUIRE)
2706 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(caller);
2708 SAVEFREESV(PL_compcv);
2710 /* make sure we compile in the right package */
2712 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
2713 SAVESPTR(PL_curstash);
2714 PL_curstash = CopSTASH(PL_curcop);
2716 SAVESPTR(PL_beginav);
2717 PL_beginav = newAV();
2718 SAVEFREESV(PL_beginav);
2720 /* try to compile it */
2722 PL_eval_root = Nullop;
2724 PL_curcop = &PL_compiling;
2725 PL_curcop->cop_arybase = 0;
2726 SvREFCNT_dec(PL_rs);
2727 PL_rs = newSVpvn("\n", 1);
2728 if (saveop && saveop->op_flags & OPf_SPECIAL)
2729 PL_in_eval |= EVAL_KEEPERR;
2732 if (yyparse() || PL_error_count || !PL_eval_root) {
2736 I32 optype = 0; /* Might be reset by POPEVAL. */
2741 op_free(PL_eval_root);
2742 PL_eval_root = Nullop;
2744 SP = PL_stack_base + POPMARK; /* pop original mark */
2746 POPBLOCK(cx,PL_curpm);
2752 if (optype == OP_REQUIRE) {
2753 char* msg = SvPVx(ERRSV, n_a);
2754 DIE(aTHX_ "%sCompilation failed in require",
2755 *msg ? msg : "Unknown error\n");
2758 char* msg = SvPVx(ERRSV, n_a);
2760 POPBLOCK(cx,PL_curpm);
2762 Perl_croak(aTHX_ "%sCompilation failed in regexp",
2763 (*msg ? msg : "Unknown error\n"));
2765 SvREFCNT_dec(PL_rs);
2766 PL_rs = SvREFCNT_inc(PL_nrs);
2768 MUTEX_LOCK(&PL_eval_mutex);
2770 COND_SIGNAL(&PL_eval_cond);
2771 MUTEX_UNLOCK(&PL_eval_mutex);
2772 #endif /* USE_THREADS */
2775 SvREFCNT_dec(PL_rs);
2776 PL_rs = SvREFCNT_inc(PL_nrs);
2777 CopLINE_set(&PL_compiling, 0);
2779 *startop = PL_eval_root;
2780 SvREFCNT_dec(CvOUTSIDE(PL_compcv));
2781 CvOUTSIDE(PL_compcv) = Nullcv;
2783 SAVEFREEOP(PL_eval_root);
2785 scalarvoid(PL_eval_root);
2786 else if (gimme & G_ARRAY)
2789 scalar(PL_eval_root);
2791 DEBUG_x(dump_eval());
2793 /* Register with debugger: */
2794 if (PERLDB_INTER && saveop->op_type == OP_REQUIRE) {
2795 CV *cv = get_cv("DB::postponed", FALSE);
2799 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2801 call_sv((SV*)cv, G_DISCARD);
2805 /* compiled okay, so do it */
2807 CvDEPTH(PL_compcv) = 1;
2808 SP = PL_stack_base + POPMARK; /* pop original mark */
2809 PL_op = saveop; /* The caller may need it. */
2811 MUTEX_LOCK(&PL_eval_mutex);
2813 COND_SIGNAL(&PL_eval_cond);
2814 MUTEX_UNLOCK(&PL_eval_mutex);
2815 #endif /* USE_THREADS */
2817 RETURNOP(PL_eval_start);
2821 S_doopen_pmc(pTHX_ const char *name, const char *mode)
2823 STRLEN namelen = strlen(name);
2826 if (namelen > 3 && strEQ(name + namelen - 3, ".pm")) {
2827 SV *pmcsv = Perl_newSVpvf(aTHX_ "%s%c", name, 'c');
2828 char *pmc = SvPV_nolen(pmcsv);
2831 if (PerlLIO_stat(pmc, &pmcstat) < 0) {
2832 fp = PerlIO_open(name, mode);
2835 if (PerlLIO_stat(name, &pmstat) < 0 ||
2836 pmstat.st_mtime < pmcstat.st_mtime)
2838 fp = PerlIO_open(pmc, mode);
2841 fp = PerlIO_open(name, mode);
2844 SvREFCNT_dec(pmcsv);
2847 fp = PerlIO_open(name, mode);
2855 register PERL_CONTEXT *cx;
2860 SV *namesv = Nullsv;
2862 I32 gimme = G_SCALAR;
2863 PerlIO *tryrsfp = 0;
2865 int filter_has_file = 0;
2866 GV *filter_child_proc = 0;
2867 SV *filter_state = 0;
2873 if (SvPOKp(sv)) { /* require v5.6.1 */
2875 U8 *s = (U8*)SvPVX(sv);
2876 U8 *end = (U8*)SvPVX(sv) + SvCUR(sv);
2878 rev = utf8_to_uv(s, &len);
2881 ver = utf8_to_uv(s, &len);
2884 sver = utf8_to_uv(s, &len);
2893 if (PERL_REVISION < rev
2894 || (PERL_REVISION == rev
2895 && (PERL_VERSION < ver
2896 || (PERL_VERSION == ver
2897 && PERL_SUBVERSION < sver))))
2899 DIE(aTHX_ "Perl v%"UVuf".%"UVuf".%"UVuf" required--this is only version "
2900 "v%d.%d.%d, stopped", rev, ver, sver, PERL_REVISION,
2901 PERL_VERSION, PERL_SUBVERSION);
2904 else if (!SvPOKp(sv)) { /* require 5.005_03 */
2907 ver = (UV)((n-rev)*1000);
2908 sver = (UV)((((n-rev)*1000 - ver) + 0.0009) * 1000);
2910 if ((NV)PERL_REVISION + ((NV)PERL_VERSION/(NV)1000)
2911 + ((NV)PERL_SUBVERSION/(NV)1000000)
2912 + 0.00000099 < SvNV(sv))
2914 DIE(aTHX_ "Perl v%"UVuf".%"UVuf".%"UVuf" required--this is only version "
2915 "v%d.%d.%d, stopped", rev, ver, sver, PERL_REVISION,
2916 PERL_VERSION, PERL_SUBVERSION);
2921 name = SvPV(sv, len);
2922 if (!(name && len > 0 && *name))
2923 DIE(aTHX_ "Null filename used");
2924 TAINT_PROPER("require");
2925 if (PL_op->op_type == OP_REQUIRE &&
2926 (svp = hv_fetch(GvHVn(PL_incgv), name, len, 0)) &&
2927 *svp != &PL_sv_undef)
2930 /* prepare to compile file */
2932 if (PERL_FILE_IS_ABSOLUTE(name)
2933 || (*name == '.' && (name[1] == '/' ||
2934 (name[1] == '.' && name[2] == '/'))))
2937 tryrsfp = doopen_pmc(name,PERL_SCRIPT_MODE);
2940 AV *ar = GvAVn(PL_incgv);
2944 if ((unixname = tounixspec(name, Nullch)) != Nullch)
2947 namesv = NEWSV(806, 0);
2948 for (i = 0; i <= AvFILL(ar); i++) {
2949 SV *dirsv = *av_fetch(ar, i, TRUE);
2955 if (SvTYPE(SvRV(loader)) == SVt_PVAV) {
2956 loader = *av_fetch((AV *)SvRV(loader), 0, TRUE);
2959 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
2960 PTR2UV(SvANY(loader)), name);
2961 tryname = SvPVX(namesv);
2972 count = call_sv(loader, G_ARRAY);
2982 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVGV) {
2986 if (SvTYPE(arg) == SVt_PVGV) {
2987 IO *io = GvIO((GV *)arg);
2992 tryrsfp = IoIFP(io);
2993 if (IoTYPE(io) == '|') {
2994 /* reading from a child process doesn't
2995 nest -- when returning from reading
2996 the inner module, the outer one is
2997 unreadable (closed?) I've tried to
2998 save the gv to manage the lifespan of
2999 the pipe, but this didn't help. XXX */
3000 filter_child_proc = (GV *)arg;
3001 (void)SvREFCNT_inc(filter_child_proc);
3004 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3005 PerlIO_close(IoOFP(io));
3017 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3019 (void)SvREFCNT_inc(filter_sub);
3022 filter_state = SP[i];
3023 (void)SvREFCNT_inc(filter_state);
3027 tryrsfp = PerlIO_open("/dev/null",
3041 filter_has_file = 0;
3042 if (filter_child_proc) {
3043 SvREFCNT_dec(filter_child_proc);
3044 filter_child_proc = 0;
3047 SvREFCNT_dec(filter_state);
3051 SvREFCNT_dec(filter_sub);
3056 char *dir = SvPVx(dirsv, n_a);
3059 if ((unixdir = tounixpath(dir, Nullch)) == Nullch)
3061 sv_setpv(namesv, unixdir);
3062 sv_catpv(namesv, unixname);
3064 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
3066 TAINT_PROPER("require");
3067 tryname = SvPVX(namesv);
3068 tryrsfp = doopen_pmc(tryname, PERL_SCRIPT_MODE);
3070 if (tryname[0] == '.' && tryname[1] == '/')
3078 SAVECOPFILE(&PL_compiling);
3079 CopFILE_set(&PL_compiling, tryrsfp ? tryname : name);
3080 SvREFCNT_dec(namesv);
3082 if (PL_op->op_type == OP_REQUIRE) {
3083 char *msgstr = name;
3084 if (namesv) { /* did we lookup @INC? */
3085 SV *msg = sv_2mortal(newSVpv(msgstr,0));
3086 SV *dirmsgsv = NEWSV(0, 0);
3087 AV *ar = GvAVn(PL_incgv);
3089 sv_catpvn(msg, " in @INC", 8);
3090 if (instr(SvPVX(msg), ".h "))
3091 sv_catpv(msg, " (change .h to .ph maybe?)");
3092 if (instr(SvPVX(msg), ".ph "))
3093 sv_catpv(msg, " (did you run h2ph?)");
3094 sv_catpv(msg, " (@INC contains:");
3095 for (i = 0; i <= AvFILL(ar); i++) {
3096 char *dir = SvPVx(*av_fetch(ar, i, TRUE), n_a);
3097 Perl_sv_setpvf(aTHX_ dirmsgsv, " %s", dir);
3098 sv_catsv(msg, dirmsgsv);
3100 sv_catpvn(msg, ")", 1);
3101 SvREFCNT_dec(dirmsgsv);
3102 msgstr = SvPV_nolen(msg);
3104 DIE(aTHX_ "Can't locate %s", msgstr);
3110 SETERRNO(0, SS$_NORMAL);
3112 /* Assume success here to prevent recursive requirement. */
3113 (void)hv_store(GvHVn(PL_incgv), name, strlen(name),
3114 newSVpv(CopFILE(&PL_compiling), 0), 0 );
3118 lex_start(sv_2mortal(newSVpvn("",0)));
3119 SAVEGENERICSV(PL_rsfp_filters);
3120 PL_rsfp_filters = Nullav;
3125 SAVESPTR(PL_compiling.cop_warnings);
3126 if (PL_dowarn & G_WARN_ALL_ON)
3127 PL_compiling.cop_warnings = WARN_ALL ;
3128 else if (PL_dowarn & G_WARN_ALL_OFF)
3129 PL_compiling.cop_warnings = WARN_NONE ;
3131 PL_compiling.cop_warnings = WARN_STD ;
3133 if (filter_sub || filter_child_proc) {
3134 SV *datasv = filter_add(run_user_filter, Nullsv);
3135 IoLINES(datasv) = filter_has_file;
3136 IoFMT_GV(datasv) = (GV *)filter_child_proc;
3137 IoTOP_GV(datasv) = (GV *)filter_state;
3138 IoBOTTOM_GV(datasv) = (GV *)filter_sub;
3141 /* switch to eval mode */
3142 push_return(PL_op->op_next);
3143 PUSHBLOCK(cx, CXt_EVAL, SP);
3144 PUSHEVAL(cx, name, Nullgv);
3146 SAVECOPLINE(&PL_compiling);
3147 CopLINE_set(&PL_compiling, 0);
3151 MUTEX_LOCK(&PL_eval_mutex);
3152 if (PL_eval_owner && PL_eval_owner != thr)
3153 while (PL_eval_owner)
3154 COND_WAIT(&PL_eval_cond, &PL_eval_mutex);
3155 PL_eval_owner = thr;
3156 MUTEX_UNLOCK(&PL_eval_mutex);
3157 #endif /* USE_THREADS */
3158 return DOCATCH(doeval(G_SCALAR, NULL));
3163 return pp_require();
3169 register PERL_CONTEXT *cx;
3171 I32 gimme = GIMME_V, was = PL_sub_generation;
3172 char tbuf[TYPE_DIGITS(long) + 12];
3173 char *tmpbuf = tbuf;
3178 if (!SvPV(sv,len) || !len)
3180 TAINT_PROPER("eval");
3186 /* switch to eval mode */
3188 SAVECOPFILE(&PL_compiling);
3189 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
3190 SV *sv = sv_newmortal();
3191 Perl_sv_setpvf(aTHX_ sv, "_<(eval %lu)[%s:%"IVdf"]",
3192 (unsigned long)++PL_evalseq,
3193 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
3197 sprintf(tmpbuf, "_<(eval %lu)", (unsigned long)++PL_evalseq);
3198 CopFILE_set(&PL_compiling, tmpbuf+2);
3199 CopLINE_set(&PL_compiling, 1);
3200 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
3201 deleting the eval's FILEGV from the stash before gv_check() runs
3202 (i.e. before run-time proper). To work around the coredump that
3203 ensues, we always turn GvMULTI_on for any globals that were
3204 introduced within evals. See force_ident(). GSAR 96-10-12 */
3205 safestr = savepv(tmpbuf);
3206 SAVEDELETE(PL_defstash, safestr, strlen(safestr));
3208 PL_hints = PL_op->op_targ;
3209 SAVESPTR(PL_compiling.cop_warnings);
3210 if (!specialWARN(PL_compiling.cop_warnings)) {
3211 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
3212 SAVEFREESV(PL_compiling.cop_warnings) ;
3215 push_return(PL_op->op_next);
3216 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
3217 PUSHEVAL(cx, 0, Nullgv);
3219 /* prepare to compile string */
3221 if (PERLDB_LINE && PL_curstash != PL_debstash)
3222 save_lines(CopFILEAV(&PL_compiling), PL_linestr);
3225 MUTEX_LOCK(&PL_eval_mutex);
3226 if (PL_eval_owner && PL_eval_owner != thr)
3227 while (PL_eval_owner)
3228 COND_WAIT(&PL_eval_cond, &PL_eval_mutex);
3229 PL_eval_owner = thr;
3230 MUTEX_UNLOCK(&PL_eval_mutex);
3231 #endif /* USE_THREADS */
3232 ret = doeval(gimme, NULL);
3233 if (PERLDB_INTER && was != PL_sub_generation /* Some subs defined here. */
3234 && ret != PL_op->op_next) { /* Successive compilation. */
3235 strcpy(safestr, "_<(eval )"); /* Anything fake and short. */
3237 return DOCATCH(ret);
3247 register PERL_CONTEXT *cx;
3249 U8 save_flags = PL_op -> op_flags;
3254 retop = pop_return();
3257 if (gimme == G_VOID)
3259 else if (gimme == G_SCALAR) {
3262 if (SvFLAGS(TOPs) & SVs_TEMP)
3265 *MARK = sv_mortalcopy(TOPs);
3269 *MARK = &PL_sv_undef;
3274 /* in case LEAVE wipes old return values */
3275 for (mark = newsp + 1; mark <= SP; mark++) {
3276 if (!(SvFLAGS(*mark) & SVs_TEMP)) {
3277 *mark = sv_mortalcopy(*mark);
3278 TAINT_NOT; /* Each item is independent */
3282 PL_curpm = newpm; /* Don't pop $1 et al till now */
3284 if (AvFILLp(PL_comppad_name) >= 0)
3288 assert(CvDEPTH(PL_compcv) == 1);
3290 CvDEPTH(PL_compcv) = 0;
3293 if (optype == OP_REQUIRE &&
3294 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
3296 /* Unassume the success we assumed earlier. */
3297 char *name = cx->blk_eval.old_name;
3298 (void)hv_delete(GvHVn(PL_incgv), name, strlen(name), G_DISCARD);
3299 retop = Perl_die(aTHX_ "%s did not return a true value", name);
3300 /* die_where() did LEAVE, or we won't be here */
3304 if (!(save_flags & OPf_SPECIAL))
3314 register PERL_CONTEXT *cx;
3315 I32 gimme = GIMME_V;
3320 push_return(cLOGOP->op_other->op_next);
3321 PUSHBLOCK(cx, CXt_EVAL, SP);
3323 PL_eval_root = PL_op; /* Only needed so that goto works right. */
3325 PL_in_eval = EVAL_INEVAL;
3328 return DOCATCH(PL_op->op_next);
3338 register PERL_CONTEXT *cx;
3346 if (gimme == G_VOID)
3348 else if (gimme == G_SCALAR) {
3351 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
3354 *MARK = sv_mortalcopy(TOPs);
3358 *MARK = &PL_sv_undef;
3363 /* in case LEAVE wipes old return values */
3364 for (mark = newsp + 1; mark <= SP; mark++) {
3365 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
3366 *mark = sv_mortalcopy(*mark);
3367 TAINT_NOT; /* Each item is independent */
3371 PL_curpm = newpm; /* Don't pop $1 et al till now */
3379 S_doparseform(pTHX_ SV *sv)
3382 register char *s = SvPV_force(sv, len);
3383 register char *send = s + len;
3384 register char *base;
3385 register I32 skipspaces = 0;
3388 bool postspace = FALSE;
3396 Perl_croak(aTHX_ "Null picture in formline");
3398 New(804, fops, (send - s)*3+10, U16); /* Almost certainly too long... */
3403 *fpc++ = FF_LINEMARK;
3404 noblank = repeat = FALSE;
3422 case ' ': case '\t':
3433 *fpc++ = FF_LITERAL;
3441 *fpc++ = skipspaces;
3445 *fpc++ = FF_NEWLINE;
3449 arg = fpc - linepc + 1;
3456 *fpc++ = FF_LINEMARK;
3457 noblank = repeat = FALSE;
3466 ischop = s[-1] == '^';
3472 arg = (s - base) - 1;
3474 *fpc++ = FF_LITERAL;
3483 *fpc++ = FF_LINEGLOB;
3485 else if (*s == '#' || (*s == '.' && s[1] == '#')) {
3486 arg = ischop ? 512 : 0;
3496 arg |= 256 + (s - f);
3498 *fpc++ = s - base; /* fieldsize for FETCH */
3499 *fpc++ = FF_DECIMAL;
3504 bool ismore = FALSE;
3507 while (*++s == '>') ;
3508 prespace = FF_SPACE;
3510 else if (*s == '|') {
3511 while (*++s == '|') ;
3512 prespace = FF_HALFSPACE;
3517 while (*++s == '<') ;
3520 if (*s == '.' && s[1] == '.' && s[2] == '.') {
3524 *fpc++ = s - base; /* fieldsize for FETCH */
3526 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
3544 { /* need to jump to the next word */
3546 z = WORD_ALIGN - SvCUR(sv) % WORD_ALIGN;
3547 SvGROW(sv, SvCUR(sv) + z + arg * sizeof(U16) + 4);
3548 s = SvPVX(sv) + SvCUR(sv) + z;
3550 Copy(fops, s, arg, U16);
3552 sv_magic(sv, Nullsv, 'f', Nullch, 0);
3557 * The rest of this file was derived from source code contributed
3560 * NOTE: this code was derived from Tom Horsley's qsort replacement
3561 * and should not be confused with the original code.
3564 /* Copyright (C) Tom Horsley, 1997. All rights reserved.
3566 Permission granted to distribute under the same terms as perl which are
3569 This program is free software; you can redistribute it and/or modify
3570 it under the terms of either:
3572 a) the GNU General Public License as published by the Free
3573 Software Foundation; either version 1, or (at your option) any
3576 b) the "Artistic License" which comes with this Kit.
3578 Details on the perl license can be found in the perl source code which
3579 may be located via the www.perl.com web page.
3581 This is the most wonderfulest possible qsort I can come up with (and
3582 still be mostly portable) My (limited) tests indicate it consistently
3583 does about 20% fewer calls to compare than does the qsort in the Visual
3584 C++ library, other vendors may vary.
3586 Some of the ideas in here can be found in "Algorithms" by Sedgewick,
3587 others I invented myself (or more likely re-invented since they seemed
3588 pretty obvious once I watched the algorithm operate for a while).
3590 Most of this code was written while watching the Marlins sweep the Giants
3591 in the 1997 National League Playoffs - no Braves fans allowed to use this
3592 code (just kidding :-).
3594 I realize that if I wanted to be true to the perl tradition, the only
3595 comment in this file would be something like:
3597 ...they shuffled back towards the rear of the line. 'No, not at the
3598 rear!' the slave-driver shouted. 'Three files up. And stay there...
3600 However, I really needed to violate that tradition just so I could keep
3601 track of what happens myself, not to mention some poor fool trying to
3602 understand this years from now :-).
3605 /* ********************************************************** Configuration */
3607 #ifndef QSORT_ORDER_GUESS
3608 #define QSORT_ORDER_GUESS 2 /* Select doubling version of the netBSD trick */
3611 /* QSORT_MAX_STACK is the largest number of partitions that can be stacked up for
3612 future processing - a good max upper bound is log base 2 of memory size
3613 (32 on 32 bit machines, 64 on 64 bit machines, etc). In reality can
3614 safely be smaller than that since the program is taking up some space and
3615 most operating systems only let you grab some subset of contiguous
3616 memory (not to mention that you are normally sorting data larger than
3617 1 byte element size :-).
3619 #ifndef QSORT_MAX_STACK
3620 #define QSORT_MAX_STACK 32
3623 /* QSORT_BREAK_EVEN is the size of the largest partition we should insertion sort.
3624 Anything bigger and we use qsort. If you make this too small, the qsort
3625 will probably break (or become less efficient), because it doesn't expect
3626 the middle element of a partition to be the same as the right or left -
3627 you have been warned).
3629 #ifndef QSORT_BREAK_EVEN
3630 #define QSORT_BREAK_EVEN 6
3633 /* ************************************************************* Data Types */
3635 /* hold left and right index values of a partition waiting to be sorted (the
3636 partition includes both left and right - right is NOT one past the end or
3637 anything like that).
3639 struct partition_stack_entry {
3642 #ifdef QSORT_ORDER_GUESS
3643 int qsort_break_even;
3647 /* ******************************************************* Shorthand Macros */
3649 /* Note that these macros will be used from inside the qsort function where
3650 we happen to know that the variable 'elt_size' contains the size of an
3651 array element and the variable 'temp' points to enough space to hold a
3652 temp element and the variable 'array' points to the array being sorted
3653 and 'compare' is the pointer to the compare routine.
3655 Also note that there are very many highly architecture specific ways
3656 these might be sped up, but this is simply the most generally portable
3657 code I could think of.
3660 /* Return < 0 == 0 or > 0 as the value of elt1 is < elt2, == elt2, > elt2
3662 #define qsort_cmp(elt1, elt2) \
3663 ((*compare)(aTHXo_ array[elt1], array[elt2]))
3665 #ifdef QSORT_ORDER_GUESS
3666 #define QSORT_NOTICE_SWAP swapped++;
3668 #define QSORT_NOTICE_SWAP
3671 /* swaps contents of array elements elt1, elt2.
3673 #define qsort_swap(elt1, elt2) \
3676 temp = array[elt1]; \
3677 array[elt1] = array[elt2]; \
3678 array[elt2] = temp; \
3681 /* rotate contents of elt1, elt2, elt3 such that elt1 gets elt2, elt2 gets
3682 elt3 and elt3 gets elt1.
3684 #define qsort_rotate(elt1, elt2, elt3) \
3687 temp = array[elt1]; \
3688 array[elt1] = array[elt2]; \
3689 array[elt2] = array[elt3]; \
3690 array[elt3] = temp; \
3693 /* ************************************************************ Debug stuff */
3700 return; /* good place to set a breakpoint */
3703 #define qsort_assert(t) (void)( (t) || (break_here(), 0) )
3706 doqsort_all_asserts(
3710 int (*compare)(const void * elt1, const void * elt2),
3711 int pc_left, int pc_right, int u_left, int u_right)
3715 qsort_assert(pc_left <= pc_right);
3716 qsort_assert(u_right < pc_left);
3717 qsort_assert(pc_right < u_left);
3718 for (i = u_right + 1; i < pc_left; ++i) {
3719 qsort_assert(qsort_cmp(i, pc_left) < 0);
3721 for (i = pc_left; i < pc_right; ++i) {
3722 qsort_assert(qsort_cmp(i, pc_right) == 0);
3724 for (i = pc_right + 1; i < u_left; ++i) {
3725 qsort_assert(qsort_cmp(pc_right, i) < 0);
3729 #define qsort_all_asserts(PC_LEFT, PC_RIGHT, U_LEFT, U_RIGHT) \
3730 doqsort_all_asserts(array, num_elts, elt_size, compare, \
3731 PC_LEFT, PC_RIGHT, U_LEFT, U_RIGHT)
3735 #define qsort_assert(t) ((void)0)
3737 #define qsort_all_asserts(PC_LEFT, PC_RIGHT, U_LEFT, U_RIGHT) ((void)0)
3741 /* ****************************************************************** qsort */
3744 S_qsortsv(pTHX_ SV ** array, size_t num_elts, SVCOMPARE_t compare)
3748 struct partition_stack_entry partition_stack[QSORT_MAX_STACK];
3749 int next_stack_entry = 0;
3753 #ifdef QSORT_ORDER_GUESS
3754 int qsort_break_even;
3758 /* Make sure we actually have work to do.
3760 if (num_elts <= 1) {
3764 /* Setup the initial partition definition and fall into the sorting loop
3767 part_right = (int)(num_elts - 1);
3768 #ifdef QSORT_ORDER_GUESS
3769 qsort_break_even = QSORT_BREAK_EVEN;
3771 #define qsort_break_even QSORT_BREAK_EVEN
3774 if ((part_right - part_left) >= qsort_break_even) {
3775 /* OK, this is gonna get hairy, so lets try to document all the
3776 concepts and abbreviations and variables and what they keep
3779 pc: pivot chunk - the set of array elements we accumulate in the
3780 middle of the partition, all equal in value to the original
3781 pivot element selected. The pc is defined by:
3783 pc_left - the leftmost array index of the pc
3784 pc_right - the rightmost array index of the pc
3786 we start with pc_left == pc_right and only one element
3787 in the pivot chunk (but it can grow during the scan).
3789 u: uncompared elements - the set of elements in the partition
3790 we have not yet compared to the pivot value. There are two
3791 uncompared sets during the scan - one to the left of the pc
3792 and one to the right.
3794 u_right - the rightmost index of the left side's uncompared set
3795 u_left - the leftmost index of the right side's uncompared set
3797 The leftmost index of the left sides's uncompared set
3798 doesn't need its own variable because it is always defined
3799 by the leftmost edge of the whole partition (part_left). The
3800 same goes for the rightmost edge of the right partition
3803 We know there are no uncompared elements on the left once we
3804 get u_right < part_left and no uncompared elements on the
3805 right once u_left > part_right. When both these conditions
3806 are met, we have completed the scan of the partition.
3808 Any elements which are between the pivot chunk and the
3809 uncompared elements should be less than the pivot value on
3810 the left side and greater than the pivot value on the right
3811 side (in fact, the goal of the whole algorithm is to arrange
3812 for that to be true and make the groups of less-than and
3813 greater-then elements into new partitions to sort again).
3815 As you marvel at the complexity of the code and wonder why it
3816 has to be so confusing. Consider some of the things this level
3817 of confusion brings:
3819 Once I do a compare, I squeeze every ounce of juice out of it. I
3820 never do compare calls I don't have to do, and I certainly never
3823 I also never swap any elements unless I can prove there is a
3824 good reason. Many sort algorithms will swap a known value with
3825 an uncompared value just to get things in the right place (or
3826 avoid complexity :-), but that uncompared value, once it gets
3827 compared, may then have to be swapped again. A lot of the
3828 complexity of this code is due to the fact that it never swaps
3829 anything except compared values, and it only swaps them when the
3830 compare shows they are out of position.
3832 int pc_left, pc_right;
3833 int u_right, u_left;
3837 pc_left = ((part_left + part_right) / 2);
3839 u_right = pc_left - 1;
3840 u_left = pc_right + 1;
3842 /* Qsort works best when the pivot value is also the median value
3843 in the partition (unfortunately you can't find the median value
3844 without first sorting :-), so to give the algorithm a helping
3845 hand, we pick 3 elements and sort them and use the median value
3846 of that tiny set as the pivot value.
3848 Some versions of qsort like to use the left middle and right as
3849 the 3 elements to sort so they can insure the ends of the
3850 partition will contain values which will stop the scan in the
3851 compare loop, but when you have to call an arbitrarily complex
3852 routine to do a compare, its really better to just keep track of
3853 array index values to know when you hit the edge of the
3854 partition and avoid the extra compare. An even better reason to
3855 avoid using a compare call is the fact that you can drop off the
3856 edge of the array if someone foolishly provides you with an
3857 unstable compare function that doesn't always provide consistent
3860 So, since it is simpler for us to compare the three adjacent
3861 elements in the middle of the partition, those are the ones we
3862 pick here (conveniently pointed at by u_right, pc_left, and
3863 u_left). The values of the left, center, and right elements
3864 are refered to as l c and r in the following comments.
3867 #ifdef QSORT_ORDER_GUESS
3870 s = qsort_cmp(u_right, pc_left);
3873 s = qsort_cmp(pc_left, u_left);
3874 /* if l < c, c < r - already in order - nothing to do */
3876 /* l < c, c == r - already in order, pc grows */
3878 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3880 /* l < c, c > r - need to know more */
3881 s = qsort_cmp(u_right, u_left);
3883 /* l < c, c > r, l < r - swap c & r to get ordered */
3884 qsort_swap(pc_left, u_left);
3885 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3886 } else if (s == 0) {
3887 /* l < c, c > r, l == r - swap c&r, grow pc */
3888 qsort_swap(pc_left, u_left);
3890 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3892 /* l < c, c > r, l > r - make lcr into rlc to get ordered */
3893 qsort_rotate(pc_left, u_right, u_left);
3894 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3897 } else if (s == 0) {
3899 s = qsort_cmp(pc_left, u_left);
3901 /* l == c, c < r - already in order, grow pc */
3903 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3904 } else if (s == 0) {
3905 /* l == c, c == r - already in order, grow pc both ways */
3908 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3910 /* l == c, c > r - swap l & r, grow pc */
3911 qsort_swap(u_right, u_left);
3913 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3917 s = qsort_cmp(pc_left, u_left);
3919 /* l > c, c < r - need to know more */
3920 s = qsort_cmp(u_right, u_left);
3922 /* l > c, c < r, l < r - swap l & c to get ordered */
3923 qsort_swap(u_right, pc_left);
3924 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3925 } else if (s == 0) {
3926 /* l > c, c < r, l == r - swap l & c, grow pc */
3927 qsort_swap(u_right, pc_left);
3929 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3931 /* l > c, c < r, l > r - rotate lcr into crl to order */
3932 qsort_rotate(u_right, pc_left, u_left);
3933 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3935 } else if (s == 0) {
3936 /* l > c, c == r - swap ends, grow pc */
3937 qsort_swap(u_right, u_left);
3939 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3941 /* l > c, c > r - swap ends to get in order */
3942 qsort_swap(u_right, u_left);
3943 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3946 /* We now know the 3 middle elements have been compared and
3947 arranged in the desired order, so we can shrink the uncompared
3952 qsort_all_asserts(pc_left, pc_right, u_left, u_right);
3954 /* The above massive nested if was the simple part :-). We now have
3955 the middle 3 elements ordered and we need to scan through the
3956 uncompared sets on either side, swapping elements that are on
3957 the wrong side or simply shuffling equal elements around to get
3958 all equal elements into the pivot chunk.
3962 int still_work_on_left;
3963 int still_work_on_right;
3965 /* Scan the uncompared values on the left. If I find a value
3966 equal to the pivot value, move it over so it is adjacent to
3967 the pivot chunk and expand the pivot chunk. If I find a value
3968 less than the pivot value, then just leave it - its already
3969 on the correct side of the partition. If I find a greater
3970 value, then stop the scan.
3972 while (still_work_on_left = (u_right >= part_left)) {
3973 s = qsort_cmp(u_right, pc_left);
3976 } else if (s == 0) {
3978 if (pc_left != u_right) {
3979 qsort_swap(u_right, pc_left);
3985 qsort_assert(u_right < pc_left);
3986 qsort_assert(pc_left <= pc_right);
3987 qsort_assert(qsort_cmp(u_right + 1, pc_left) <= 0);
3988 qsort_assert(qsort_cmp(pc_left, pc_right) == 0);
3991 /* Do a mirror image scan of uncompared values on the right
3993 while (still_work_on_right = (u_left <= part_right)) {
3994 s = qsort_cmp(pc_right, u_left);
3997 } else if (s == 0) {
3999 if (pc_right != u_left) {
4000 qsort_swap(pc_right, u_left);
4006 qsort_assert(u_left > pc_right);
4007 qsort_assert(pc_left <= pc_right);
4008 qsort_assert(qsort_cmp(pc_right, u_left - 1) <= 0);
4009 qsort_assert(qsort_cmp(pc_left, pc_right) == 0);
4012 if (still_work_on_left) {
4013 /* I know I have a value on the left side which needs to be
4014 on the right side, but I need to know more to decide
4015 exactly the best thing to do with it.
4017 if (still_work_on_right) {
4018 /* I know I have values on both side which are out of
4019 position. This is a big win because I kill two birds
4020 with one swap (so to speak). I can advance the
4021 uncompared pointers on both sides after swapping both
4022 of them into the right place.
4024 qsort_swap(u_right, u_left);
4027 qsort_all_asserts(pc_left, pc_right, u_left, u_right);
4029 /* I have an out of position value on the left, but the
4030 right is fully scanned, so I "slide" the pivot chunk
4031 and any less-than values left one to make room for the
4032 greater value over on the right. If the out of position
4033 value is immediately adjacent to the pivot chunk (there
4034 are no less-than values), I can do that with a swap,
4035 otherwise, I have to rotate one of the less than values
4036 into the former position of the out of position value
4037 and the right end of the pivot chunk into the left end
4041 if (pc_left == u_right) {
4042 qsort_swap(u_right, pc_right);
4043 qsort_all_asserts(pc_left, pc_right-1, u_left, u_right-1);
4045 qsort_rotate(u_right, pc_left, pc_right);
4046 qsort_all_asserts(pc_left, pc_right-1, u_left, u_right-1);
4051 } else if (still_work_on_right) {
4052 /* Mirror image of complex case above: I have an out of
4053 position value on the right, but the left is fully
4054 scanned, so I need to shuffle things around to make room
4055 for the right value on the left.
4058 if (pc_right == u_left) {
4059 qsort_swap(u_left, pc_left);
4060 qsort_all_asserts(pc_left+1, pc_right, u_left+1, u_right);
4062 qsort_rotate(pc_right, pc_left, u_left);
4063 qsort_all_asserts(pc_left+1, pc_right, u_left+1, u_right);
4068 /* No more scanning required on either side of partition,
4069 break out of loop and figure out next set of partitions
4075 /* The elements in the pivot chunk are now in the right place. They
4076 will never move or be compared again. All I have to do is decide
4077 what to do with the stuff to the left and right of the pivot
4080 Notes on the QSORT_ORDER_GUESS ifdef code:
4082 1. If I just built these partitions without swapping any (or
4083 very many) elements, there is a chance that the elements are
4084 already ordered properly (being properly ordered will
4085 certainly result in no swapping, but the converse can't be
4088 2. A (properly written) insertion sort will run faster on
4089 already ordered data than qsort will.
4091 3. Perhaps there is some way to make a good guess about
4092 switching to an insertion sort earlier than partition size 6
4093 (for instance - we could save the partition size on the stack
4094 and increase the size each time we find we didn't swap, thus
4095 switching to insertion sort earlier for partitions with a
4096 history of not swapping).
4098 4. Naturally, if I just switch right away, it will make
4099 artificial benchmarks with pure ascending (or descending)
4100 data look really good, but is that a good reason in general?
4104 #ifdef QSORT_ORDER_GUESS
4106 #if QSORT_ORDER_GUESS == 1
4107 qsort_break_even = (part_right - part_left) + 1;
4109 #if QSORT_ORDER_GUESS == 2
4110 qsort_break_even *= 2;
4112 #if QSORT_ORDER_GUESS == 3
4113 int prev_break = qsort_break_even;
4114 qsort_break_even *= qsort_break_even;
4115 if (qsort_break_even < prev_break) {
4116 qsort_break_even = (part_right - part_left) + 1;
4120 qsort_break_even = QSORT_BREAK_EVEN;
4124 if (part_left < pc_left) {
4125 /* There are elements on the left which need more processing.
4126 Check the right as well before deciding what to do.
4128 if (pc_right < part_right) {
4129 /* We have two partitions to be sorted. Stack the biggest one
4130 and process the smallest one on the next iteration. This
4131 minimizes the stack height by insuring that any additional
4132 stack entries must come from the smallest partition which
4133 (because it is smallest) will have the fewest
4134 opportunities to generate additional stack entries.
4136 if ((part_right - pc_right) > (pc_left - part_left)) {
4137 /* stack the right partition, process the left */
4138 partition_stack[next_stack_entry].left = pc_right + 1;
4139 partition_stack[next_stack_entry].right = part_right;
4140 #ifdef QSORT_ORDER_GUESS
4141 partition_stack[next_stack_entry].qsort_break_even = qsort_break_even;
4143 part_right = pc_left - 1;
4145 /* stack the left partition, process the right */
4146 partition_stack[next_stack_entry].left = part_left;
4147 partition_stack[next_stack_entry].right = pc_left - 1;
4148 #ifdef QSORT_ORDER_GUESS
4149 partition_stack[next_stack_entry].qsort_break_even = qsort_break_even;
4151 part_left = pc_right + 1;
4153 qsort_assert(next_stack_entry < QSORT_MAX_STACK);
4156 /* The elements on the left are the only remaining elements
4157 that need sorting, arrange for them to be processed as the
4160 part_right = pc_left - 1;
4162 } else if (pc_right < part_right) {
4163 /* There is only one chunk on the right to be sorted, make it
4164 the new partition and loop back around.
4166 part_left = pc_right + 1;
4168 /* This whole partition wound up in the pivot chunk, so
4169 we need to get a new partition off the stack.
4171 if (next_stack_entry == 0) {
4172 /* the stack is empty - we are done */
4176 part_left = partition_stack[next_stack_entry].left;
4177 part_right = partition_stack[next_stack_entry].right;
4178 #ifdef QSORT_ORDER_GUESS
4179 qsort_break_even = partition_stack[next_stack_entry].qsort_break_even;
4183 /* This partition is too small to fool with qsort complexity, just
4184 do an ordinary insertion sort to minimize overhead.
4187 /* Assume 1st element is in right place already, and start checking
4188 at 2nd element to see where it should be inserted.
4190 for (i = part_left + 1; i <= part_right; ++i) {
4192 /* Scan (backwards - just in case 'i' is already in right place)
4193 through the elements already sorted to see if the ith element
4194 belongs ahead of one of them.
4196 for (j = i - 1; j >= part_left; --j) {
4197 if (qsort_cmp(i, j) >= 0) {
4198 /* i belongs right after j
4205 /* Looks like we really need to move some things
4209 for (k = i - 1; k >= j; --k)
4210 array[k + 1] = array[k];
4215 /* That partition is now sorted, grab the next one, or get out
4216 of the loop if there aren't any more.
4219 if (next_stack_entry == 0) {
4220 /* the stack is empty - we are done */
4224 part_left = partition_stack[next_stack_entry].left;
4225 part_right = partition_stack[next_stack_entry].right;
4226 #ifdef QSORT_ORDER_GUESS
4227 qsort_break_even = partition_stack[next_stack_entry].qsort_break_even;
4232 /* Believe it or not, the array is sorted at this point! */
4244 sortcv(pTHXo_ SV *a, SV *b)
4247 I32 oldsaveix = PL_savestack_ix;
4248 I32 oldscopeix = PL_scopestack_ix;
4250 GvSV(PL_firstgv) = a;
4251 GvSV(PL_secondgv) = b;
4252 PL_stack_sp = PL_stack_base;
4255 if (PL_stack_sp != PL_stack_base + 1)
4256 Perl_croak(aTHX_ "Sort subroutine didn't return single value");
4257 if (!SvNIOKp(*PL_stack_sp))
4258 Perl_croak(aTHX_ "Sort subroutine didn't return a numeric value");
4259 result = SvIV(*PL_stack_sp);
4260 while (PL_scopestack_ix > oldscopeix) {
4263 leave_scope(oldsaveix);
4268 sortcv_stacked(pTHXo_ SV *a, SV *b)
4271 I32 oldsaveix = PL_savestack_ix;
4272 I32 oldscopeix = PL_scopestack_ix;
4277 av = (AV*)PL_curpad[0];
4279 av = GvAV(PL_defgv);
4282 if (AvMAX(av) < 1) {
4283 SV** ary = AvALLOC(av);
4284 if (AvARRAY(av) != ary) {
4285 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
4286 SvPVX(av) = (char*)ary;
4288 if (AvMAX(av) < 1) {
4291 SvPVX(av) = (char*)ary;
4298 PL_stack_sp = PL_stack_base;
4301 if (PL_stack_sp != PL_stack_base + 1)
4302 Perl_croak(aTHX_ "Sort subroutine didn't return single value");
4303 if (!SvNIOKp(*PL_stack_sp))
4304 Perl_croak(aTHX_ "Sort subroutine didn't return a numeric value");
4305 result = SvIV(*PL_stack_sp);
4306 while (PL_scopestack_ix > oldscopeix) {
4309 leave_scope(oldsaveix);
4314 sortcv_xsub(pTHXo_ SV *a, SV *b)
4317 I32 oldsaveix = PL_savestack_ix;
4318 I32 oldscopeix = PL_scopestack_ix;
4320 CV *cv=(CV*)PL_sortcop;
4328 (void)(*CvXSUB(cv))(aTHXo_ cv);
4329 if (PL_stack_sp != PL_stack_base + 1)
4330 Perl_croak(aTHX_ "Sort subroutine didn't return single value");
4331 if (!SvNIOKp(*PL_stack_sp))
4332 Perl_croak(aTHX_ "Sort subroutine didn't return a numeric value");
4333 result = SvIV(*PL_stack_sp);
4334 while (PL_scopestack_ix > oldscopeix) {
4337 leave_scope(oldsaveix);
4343 sv_ncmp(pTHXo_ SV *a, SV *b)
4347 return nv1 < nv2 ? -1 : nv1 > nv2 ? 1 : 0;
4351 sv_i_ncmp(pTHXo_ SV *a, SV *b)
4355 return iv1 < iv2 ? -1 : iv1 > iv2 ? 1 : 0;
4357 #define tryCALL_AMAGICbin(left,right,meth,svp) STMT_START { \
4359 if (PL_amagic_generation) { \
4360 if (SvAMAGIC(left)||SvAMAGIC(right))\
4361 *svp = amagic_call(left, \
4369 amagic_ncmp(pTHXo_ register SV *a, register SV *b)
4372 tryCALL_AMAGICbin(a,b,ncmp,&tmpsv);
4377 I32 i = SvIVX(tmpsv);
4387 return sv_ncmp(aTHXo_ a, b);
4391 amagic_i_ncmp(pTHXo_ register SV *a, register SV *b)
4394 tryCALL_AMAGICbin(a,b,ncmp,&tmpsv);
4399 I32 i = SvIVX(tmpsv);
4409 return sv_i_ncmp(aTHXo_ a, b);
4413 amagic_cmp(pTHXo_ register SV *str1, register SV *str2)
4416 tryCALL_AMAGICbin(str1,str2,scmp,&tmpsv);
4421 I32 i = SvIVX(tmpsv);
4431 return sv_cmp(str1, str2);
4435 amagic_cmp_locale(pTHXo_ register SV *str1, register SV *str2)
4438 tryCALL_AMAGICbin(str1,str2,scmp,&tmpsv);
4443 I32 i = SvIVX(tmpsv);
4453 return sv_cmp_locale(str1, str2);
4457 run_user_filter(pTHXo_ int idx, SV *buf_sv, int maxlen)
4459 SV *datasv = FILTER_DATA(idx);
4460 int filter_has_file = IoLINES(datasv);
4461 GV *filter_child_proc = (GV *)IoFMT_GV(datasv);
4462 SV *filter_state = (SV *)IoTOP_GV(datasv);
4463 SV *filter_sub = (SV *)IoBOTTOM_GV(datasv);
4466 /* I was having segfault trouble under Linux 2.2.5 after a
4467 parse error occured. (Had to hack around it with a test
4468 for PL_error_count == 0.) Solaris doesn't segfault --
4469 not sure where the trouble is yet. XXX */
4471 if (filter_has_file) {
4472 len = FILTER_READ(idx+1, buf_sv, maxlen);
4475 if (filter_sub && len >= 0) {
4486 PUSHs(sv_2mortal(newSViv(maxlen)));
4488 PUSHs(filter_state);
4491 count = call_sv(filter_sub, G_SCALAR);
4507 IoLINES(datasv) = 0;
4508 if (filter_child_proc) {
4509 SvREFCNT_dec(filter_child_proc);
4510 IoFMT_GV(datasv) = Nullgv;
4513 SvREFCNT_dec(filter_state);
4514 IoTOP_GV(datasv) = Nullgv;
4517 SvREFCNT_dec(filter_sub);
4518 IoBOTTOM_GV(datasv) = Nullgv;
4520 filter_del(run_user_filter);
4529 sv_cmp_locale_static(pTHXo_ register SV *str1, register SV *str2)
4531 return sv_cmp_locale(str1, str2);
4535 sv_cmp_static(pTHXo_ register SV *str1, register SV *str2)
4537 return sv_cmp(str1, str2);
4540 #endif /* PERL_OBJECT */