3 * Copyright (c) 1991-1997, 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.
23 #define WORD_ALIGN sizeof(U16)
26 #define DOCATCH(o) ((CATCH_GET == TRUE) ? docatch(o) : (o))
29 #define CALLOP this->*PL_op
32 static OP *docatch _((OP *o));
33 static OP *dofindlabel _((OP *o, char *label, OP **opstack, OP **oplimit));
34 static void doparseform _((SV *sv));
35 static I32 dopoptoeval _((I32 startingblock));
36 static I32 dopoptolabel _((char *label));
37 static I32 dopoptoloop _((I32 startingblock));
38 static I32 dopoptosub _((I32 startingblock));
39 static I32 dopoptosub_at _((PERL_CONTEXT *cxstk, I32 startingblock));
40 static void save_lines _((AV *array, SV *sv));
41 static I32 sortcv _((SV *a, SV *b));
42 static void qsortsv _((SV **array, size_t num_elts, I32 (*fun)(SV *a, SV *b)));
43 static OP *doeval _((int gimme, OP** startop));
52 cxix = dopoptosub(cxstack_ix);
56 switch (cxstack[cxix].blk_gimme) {
73 /* XXXX Should store the old value to allow for tie/overload - and
74 restore in regcomp, where marked with XXXX. */
82 register PMOP *pm = (PMOP*)cLOGOP->op_other;
86 MAGIC *mg = Null(MAGIC*);
90 SV *sv = SvRV(tmpstr);
92 mg = mg_find(sv, 'r');
95 regexp *re = (regexp *)mg->mg_obj;
96 ReREFCNT_dec(pm->op_pmregexp);
97 pm->op_pmregexp = ReREFCNT_inc(re);
100 t = SvPV(tmpstr, len);
102 /* Check against the last compiled regexp. */
103 if (!pm->op_pmregexp || !pm->op_pmregexp->precomp ||
104 pm->op_pmregexp->prelen != len ||
105 memNE(pm->op_pmregexp->precomp, t, len))
107 if (pm->op_pmregexp) {
108 ReREFCNT_dec(pm->op_pmregexp);
109 pm->op_pmregexp = Null(REGEXP*); /* crucial if regcomp aborts */
111 if (PL_op->op_flags & OPf_SPECIAL)
112 PL_reginterp_cnt = I32_MAX; /* Mark as safe. */
114 pm->op_pmflags = pm->op_pmpermflags; /* reset case sensitivity */
115 pm->op_pmregexp = CALLREGCOMP(t, t + len, pm);
116 PL_reginterp_cnt = 0; /* XXXX Be extra paranoid - needed
117 inside tie/overload accessors. */
121 #ifndef INCOMPLETE_TAINTS
124 pm->op_pmdynflags |= PMdf_TAINTED;
126 pm->op_pmdynflags &= ~PMdf_TAINTED;
130 if (!pm->op_pmregexp->prelen && PL_curpm)
132 else if (strEQ("\\s+", pm->op_pmregexp->precomp))
133 pm->op_pmflags |= PMf_WHITE;
135 if (pm->op_pmflags & PMf_KEEP) {
136 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
137 cLOGOP->op_first->op_next = PL_op->op_next;
145 register PMOP *pm = (PMOP*) cLOGOP->op_other;
146 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
147 register SV *dstr = cx->sb_dstr;
148 register char *s = cx->sb_s;
149 register char *m = cx->sb_m;
150 char *orig = cx->sb_orig;
151 register REGEXP *rx = cx->sb_rx;
153 rxres_restore(&cx->sb_rxres, rx);
155 if (cx->sb_iters++) {
156 if (cx->sb_iters > cx->sb_maxiters)
157 DIE("Substitution loop");
159 if (!(cx->sb_rxtainted & 2) && SvTAINTED(TOPs))
160 cx->sb_rxtainted |= 2;
161 sv_catsv(dstr, POPs);
164 if (cx->sb_once || !CALLREGEXEC(rx, s, cx->sb_strend, orig,
165 s == m, Nullsv, NULL,
166 cx->sb_safebase ? 0 : REXEC_COPY_STR))
168 SV *targ = cx->sb_targ;
169 sv_catpvn(dstr, s, cx->sb_strend - s);
171 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
173 (void)SvOOK_off(targ);
174 Safefree(SvPVX(targ));
175 SvPVX(targ) = SvPVX(dstr);
176 SvCUR_set(targ, SvCUR(dstr));
177 SvLEN_set(targ, SvLEN(dstr));
181 TAINT_IF(cx->sb_rxtainted & 1);
182 PUSHs(sv_2mortal(newSViv((I32)cx->sb_iters - 1)));
184 (void)SvPOK_only(targ);
185 TAINT_IF(cx->sb_rxtainted);
189 LEAVE_SCOPE(cx->sb_oldsave);
191 RETURNOP(pm->op_next);
194 if (rx->subbase && rx->subbase != orig) {
197 cx->sb_orig = orig = rx->subbase;
199 cx->sb_strend = s + (cx->sb_strend - m);
201 cx->sb_m = m = rx->startp[0];
202 sv_catpvn(dstr, s, m-s);
203 cx->sb_s = rx->endp[0];
204 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
205 rxres_save(&cx->sb_rxres, rx);
206 RETURNOP(pm->op_pmreplstart);
210 rxres_save(void **rsp, REGEXP *rx)
215 if (!p || p[1] < rx->nparens) {
216 i = 6 + rx->nparens * 2;
224 *p++ = (UV)rx->subbase;
225 rx->subbase = Nullch;
229 *p++ = (UV)rx->subbeg;
230 *p++ = (UV)rx->subend;
231 for (i = 0; i <= rx->nparens; ++i) {
232 *p++ = (UV)rx->startp[i];
233 *p++ = (UV)rx->endp[i];
238 rxres_restore(void **rsp, REGEXP *rx)
243 Safefree(rx->subbase);
244 rx->subbase = (char*)(*p);
249 rx->subbeg = (char*)(*p++);
250 rx->subend = (char*)(*p++);
251 for (i = 0; i <= rx->nparens; ++i) {
252 rx->startp[i] = (char*)(*p++);
253 rx->endp[i] = (char*)(*p++);
258 rxres_free(void **rsp)
263 Safefree((char*)(*p));
271 djSP; dMARK; dORIGMARK;
272 register SV *tmpForm = *++MARK;
284 bool chopspace = (strchr(PL_chopset, ' ') != Nullch);
290 STRLEN fudge = SvCUR(tmpForm) * (IN_UTF8 ? 3 : 1) + 1;
292 if (!SvMAGICAL(tmpForm) || !SvCOMPILED(tmpForm)) {
293 SvREADONLY_off(tmpForm);
294 doparseform(tmpForm);
297 SvPV_force(PL_formtarget, len);
298 t = SvGROW(PL_formtarget, len + fudge + 1); /* XXX SvCUR bad */
300 f = SvPV(tmpForm, len);
301 /* need to jump to the next word */
302 s = f + len + WORD_ALIGN - SvCUR(tmpForm) % WORD_ALIGN;
311 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
312 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
313 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
314 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
315 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
317 case FF_CHECKNL: name = "CHECKNL"; break;
318 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
319 case FF_SPACE: name = "SPACE"; break;
320 case FF_HALFSPACE: name = "HALFSPACE"; break;
321 case FF_ITEM: name = "ITEM"; break;
322 case FF_CHOP: name = "CHOP"; break;
323 case FF_LINEGLOB: name = "LINEGLOB"; break;
324 case FF_NEWLINE: name = "NEWLINE"; break;
325 case FF_MORE: name = "MORE"; break;
326 case FF_LINEMARK: name = "LINEMARK"; break;
327 case FF_END: name = "END"; break;
330 PerlIO_printf(PerlIO_stderr(), "%-16s%ld\n", name, (long) arg);
332 PerlIO_printf(PerlIO_stderr(), "%-16s\n", name);
360 if (ckWARN(WARN_SYNTAX))
361 warner(WARN_SYNTAX, "Not enough format arguments");
366 item = s = SvPV(sv, len);
369 itemsize = sv_len_utf8(sv);
370 if (itemsize != len) {
372 if (itemsize > fieldsize) {
373 itemsize = fieldsize;
374 itembytes = itemsize;
375 sv_pos_u2b(sv, &itembytes, 0);
379 send = chophere = s + itembytes;
388 sv_pos_b2u(sv, &itemsize);
392 if (itemsize > fieldsize)
393 itemsize = fieldsize;
394 send = chophere = s + itemsize;
406 item = s = SvPV(sv, len);
409 itemsize = sv_len_utf8(sv);
410 if (itemsize != len) {
412 if (itemsize <= fieldsize) {
413 send = chophere = s + itemsize;
424 itemsize = fieldsize;
425 itembytes = itemsize;
426 sv_pos_u2b(sv, &itembytes, 0);
427 send = chophere = s + itembytes;
428 while (s < send || (s == send && isSPACE(*s))) {
438 if (strchr(PL_chopset, *s))
443 itemsize = chophere - item;
444 sv_pos_b2u(sv, &itemsize);
449 if (itemsize <= fieldsize) {
450 send = chophere = s + itemsize;
461 itemsize = fieldsize;
462 send = chophere = s + itemsize;
463 while (s < send || (s == send && isSPACE(*s))) {
473 if (strchr(PL_chopset, *s))
478 itemsize = chophere - item;
483 arg = fieldsize - itemsize;
492 arg = fieldsize - itemsize;
507 switch (UTF8SKIP(s)) {
518 if ( !((*t++ = *s++) & ~31) )
526 int ch = *t++ = *s++;
529 if ( !((*t++ = *s++) & ~31) )
538 while (*s && isSPACE(*s))
545 item = s = SvPV(sv, len);
558 SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
559 sv_catpvn(PL_formtarget, item, itemsize);
560 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
561 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
566 /* If the field is marked with ^ and the value is undefined,
569 if ((arg & 512) && !SvOK(sv)) {
577 /* Formats aren't yet marked for locales, so assume "yes". */
580 sprintf(t, "%#*.*f", (int) fieldsize, (int) arg & 255, value);
582 sprintf(t, "%*.0f", (int) fieldsize, value);
589 while (t-- > linemark && *t == ' ') ;
597 if (arg) { /* repeat until fields exhausted? */
599 SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
600 lines += FmLINES(PL_formtarget);
603 if (strnEQ(linemark, linemark - arg, arg))
604 DIE("Runaway format");
606 FmLINES(PL_formtarget) = lines;
608 RETURNOP(cLISTOP->op_first);
619 arg = fieldsize - itemsize;
626 if (strnEQ(s," ",3)) {
627 while (s > SvPVX(PL_formtarget) && isSPACE(s[-1]))
638 SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
639 FmLINES(PL_formtarget) += lines;
651 if (PL_stack_base + *PL_markstack_ptr == SP) {
653 if (GIMME_V == G_SCALAR)
655 RETURNOP(PL_op->op_next->op_next);
657 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
658 pp_pushmark(ARGS); /* push dst */
659 pp_pushmark(ARGS); /* push src */
660 ENTER; /* enter outer scope */
664 /* SAVE_DEFSV does *not* suffice here */
665 save_sptr(&THREADSV(0));
667 SAVESPTR(GvSV(PL_defgv));
668 #endif /* USE_THREADS */
669 ENTER; /* enter inner scope */
672 src = PL_stack_base[*PL_markstack_ptr];
677 if (PL_op->op_type == OP_MAPSTART)
678 pp_pushmark(ARGS); /* push top */
679 return ((LOGOP*)PL_op->op_next)->op_other;
684 DIE("panic: mapstart"); /* uses grepstart */
690 I32 diff = (SP - PL_stack_base) - *PL_markstack_ptr;
696 ++PL_markstack_ptr[-1];
698 if (diff > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
699 shift = diff - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
700 count = (SP - PL_stack_base) - PL_markstack_ptr[-1] + 2;
705 PL_markstack_ptr[-1] += shift;
706 *PL_markstack_ptr += shift;
710 dst = PL_stack_base + (PL_markstack_ptr[-2] += diff) - 1;
713 *dst-- = SvTEMP(TOPs) ? POPs : sv_mortalcopy(POPs);
715 LEAVE; /* exit inner scope */
718 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
722 (void)POPMARK; /* pop top */
723 LEAVE; /* exit outer scope */
724 (void)POPMARK; /* pop src */
725 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
726 (void)POPMARK; /* pop dst */
727 SP = PL_stack_base + POPMARK; /* pop original mark */
728 if (gimme == G_SCALAR) {
732 else if (gimme == G_ARRAY)
739 ENTER; /* enter inner scope */
742 src = PL_stack_base[PL_markstack_ptr[-1]];
746 RETURNOP(cLOGOP->op_other);
752 djSP; dMARK; dORIGMARK;
754 SV **myorigmark = ORIGMARK;
760 OP* nextop = PL_op->op_next;
762 if (gimme != G_ARRAY) {
768 SAVEPPTR(PL_sortcop);
769 if (PL_op->op_flags & OPf_STACKED) {
770 if (PL_op->op_flags & OPf_SPECIAL) {
771 OP *kid = cLISTOP->op_first->op_sibling; /* pass pushmark */
772 kid = kUNOP->op_first; /* pass rv2gv */
773 kid = kUNOP->op_first; /* pass leave */
774 PL_sortcop = kid->op_next;
775 stash = PL_curcop->cop_stash;
778 cv = sv_2cv(*++MARK, &stash, &gv, 0);
779 if (!(cv && CvROOT(cv))) {
781 SV *tmpstr = sv_newmortal();
782 gv_efullname3(tmpstr, gv, Nullch);
783 if (cv && CvXSUB(cv))
784 DIE("Xsub \"%s\" called in sort", SvPVX(tmpstr));
785 DIE("Undefined sort subroutine \"%s\" called",
790 DIE("Xsub called in sort");
791 DIE("Undefined subroutine in sort");
793 DIE("Not a CODE reference in sort");
795 PL_sortcop = CvSTART(cv);
796 SAVESPTR(CvROOT(cv)->op_ppaddr);
797 CvROOT(cv)->op_ppaddr = ppaddr[OP_NULL];
800 PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
805 stash = PL_curcop->cop_stash;
809 while (MARK < SP) { /* This may or may not shift down one here. */
811 if (*up = *++MARK) { /* Weed out nulls. */
813 if (!PL_sortcop && !SvPOK(*up))
814 (void)sv_2pv(*up, &PL_na);
818 max = --up - myorigmark;
823 bool oldcatch = CATCH_GET;
829 PUSHSTACKi(PERLSI_SORT);
830 if (PL_sortstash != stash) {
831 PL_firstgv = gv_fetchpv("a", TRUE, SVt_PV);
832 PL_secondgv = gv_fetchpv("b", TRUE, SVt_PV);
833 PL_sortstash = stash;
836 SAVESPTR(GvSV(PL_firstgv));
837 SAVESPTR(GvSV(PL_secondgv));
839 PUSHBLOCK(cx, CXt_NULL, PL_stack_base);
840 if (!(PL_op->op_flags & OPf_SPECIAL)) {
841 bool hasargs = FALSE;
842 cx->cx_type = CXt_SUB;
843 cx->blk_gimme = G_SCALAR;
846 (void)SvREFCNT_inc(cv); /* in preparation for POPSUB */
848 PL_sortcxix = cxstack_ix;
849 qsortsv((myorigmark+1), max, FUNC_NAME_TO_PTR(sortcv));
851 POPBLOCK(cx,PL_curpm);
858 MEXTEND(SP, 20); /* Can't afford stack realloc on signal. */
859 qsortsv(ORIGMARK+1, max,
860 (PL_op->op_private & OPpLOCALE)
861 ? FUNC_NAME_TO_PTR(sv_cmp_locale)
862 : FUNC_NAME_TO_PTR(sv_cmp));
866 PL_stack_sp = ORIGMARK + max;
874 if (GIMME == G_ARRAY)
875 return cCONDOP->op_true;
876 return SvTRUEx(PAD_SV(PL_op->op_targ)) ? cCONDOP->op_false : cCONDOP->op_true;
883 if (GIMME == G_ARRAY) {
884 RETURNOP(((CONDOP*)cUNOP->op_first)->op_false);
888 SV *targ = PAD_SV(PL_op->op_targ);
890 if ((PL_op->op_private & OPpFLIP_LINENUM)
891 ? (PL_last_in_gv && SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv)))
893 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
894 if (PL_op->op_flags & OPf_SPECIAL) {
902 RETURNOP(((CONDOP*)cUNOP->op_first)->op_false);
915 if (GIMME == G_ARRAY) {
921 if (SvNIOKp(left) || !SvPOKp(left) ||
922 (looks_like_number(left) && *SvPVX(left) != '0') )
924 if (SvNV(left) < IV_MIN || SvNV(right) >= IV_MAX)
925 croak("Range iterator outside integer range");
929 EXTEND_MORTAL(max - i + 1);
930 EXTEND(SP, max - i + 1);
933 sv = sv_2mortal(newSViv(i++));
938 SV *final = sv_mortalcopy(right);
940 char *tmps = SvPV(final, len);
942 sv = sv_mortalcopy(left);
943 SvPV_force(sv,PL_na);
944 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
946 if (strEQ(SvPVX(sv),tmps))
948 sv = sv_2mortal(newSVsv(sv));
955 SV *targ = PAD_SV(cUNOP->op_first->op_targ);
957 if ((PL_op->op_private & OPpFLIP_LINENUM)
958 ? (PL_last_in_gv && SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv)))
960 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
961 sv_catpv(targ, "E0");
972 dopoptolabel(char *label)
976 register PERL_CONTEXT *cx;
978 for (i = cxstack_ix; i >= 0; i--) {
980 switch (cx->cx_type) {
982 if (ckWARN(WARN_UNSAFE))
983 warner(WARN_UNSAFE, "Exiting substitution via %s",
984 op_name[PL_op->op_type]);
987 if (ckWARN(WARN_UNSAFE))
988 warner(WARN_UNSAFE, "Exiting subroutine via %s",
989 op_name[PL_op->op_type]);
992 if (ckWARN(WARN_UNSAFE))
993 warner(WARN_UNSAFE, "Exiting eval via %s",
994 op_name[PL_op->op_type]);
997 if (ckWARN(WARN_UNSAFE))
998 warner(WARN_UNSAFE, "Exiting pseudo-block via %s",
999 op_name[PL_op->op_type]);
1002 if (!cx->blk_loop.label ||
1003 strNE(label, cx->blk_loop.label) ) {
1004 DEBUG_l(deb("(Skipping label #%ld %s)\n",
1005 (long)i, cx->blk_loop.label));
1008 DEBUG_l( deb("(Found label #%ld %s)\n", (long)i, label));
1018 I32 gimme = block_gimme();
1019 return (gimme == G_VOID) ? G_SCALAR : gimme;
1028 cxix = dopoptosub(cxstack_ix);
1032 switch (cxstack[cxix].blk_gimme) {
1040 croak("panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
1047 dopoptosub(I32 startingblock)
1050 return dopoptosub_at(cxstack, startingblock);
1054 dopoptosub_at(PERL_CONTEXT *cxstk, I32 startingblock)
1058 register PERL_CONTEXT *cx;
1059 for (i = startingblock; i >= 0; i--) {
1061 switch (cx->cx_type) {
1066 DEBUG_l( deb("(Found sub #%ld)\n", (long)i));
1074 dopoptoeval(I32 startingblock)
1078 register PERL_CONTEXT *cx;
1079 for (i = startingblock; i >= 0; i--) {
1081 switch (cx->cx_type) {
1085 DEBUG_l( deb("(Found eval #%ld)\n", (long)i));
1093 dopoptoloop(I32 startingblock)
1097 register PERL_CONTEXT *cx;
1098 for (i = startingblock; i >= 0; i--) {
1100 switch (cx->cx_type) {
1102 if (ckWARN(WARN_UNSAFE))
1103 warner(WARN_UNSAFE, "Exiting substitution via %s",
1104 op_name[PL_op->op_type]);
1107 if (ckWARN(WARN_UNSAFE))
1108 warner(WARN_UNSAFE, "Exiting subroutine via %s",
1109 op_name[PL_op->op_type]);
1112 if (ckWARN(WARN_UNSAFE))
1113 warner(WARN_UNSAFE, "Exiting eval via %s",
1114 op_name[PL_op->op_type]);
1117 if (ckWARN(WARN_UNSAFE))
1118 warner(WARN_UNSAFE, "Exiting pseudo-block via %s",
1119 op_name[PL_op->op_type]);
1122 DEBUG_l( deb("(Found loop #%ld)\n", (long)i));
1133 register PERL_CONTEXT *cx;
1137 while (cxstack_ix > cxix) {
1138 cx = &cxstack[cxstack_ix];
1139 DEBUG_l(PerlIO_printf(Perl_debug_log, "Unwinding block %ld, type %s\n",
1140 (long) cxstack_ix, block_type[cx->cx_type]));
1141 /* Note: we don't need to restore the base context info till the end. */
1142 switch (cx->cx_type) {
1145 continue; /* not break */
1163 die_where(char *message)
1168 register PERL_CONTEXT *cx;
1173 if (PL_in_eval & 4) {
1175 STRLEN klen = strlen(message);
1177 svp = hv_fetch(ERRHV, message, klen, TRUE);
1180 static char prefix[] = "\t(in cleanup) ";
1182 sv_upgrade(*svp, SVt_IV);
1183 (void)SvIOK_only(*svp);
1186 SvGROW(err, SvCUR(err)+sizeof(prefix)+klen);
1187 sv_catpvn(err, prefix, sizeof(prefix)-1);
1188 sv_catpvn(err, message, klen);
1194 sv_setpv(ERRSV, message);
1197 message = SvPVx(ERRSV, PL_na);
1199 while ((cxix = dopoptoeval(cxstack_ix)) < 0 && PL_curstackinfo->si_prev) {
1207 if (cxix < cxstack_ix)
1210 POPBLOCK(cx,PL_curpm);
1211 if (cx->cx_type != CXt_EVAL) {
1212 PerlIO_printf(PerlIO_stderr(), "panic: die %s", message);
1217 if (gimme == G_SCALAR)
1218 *++newsp = &PL_sv_undef;
1219 PL_stack_sp = newsp;
1223 if (optype == OP_REQUIRE) {
1224 char* msg = SvPVx(ERRSV, PL_na);
1225 DIE("%s", *msg ? msg : "Compilation failed in require");
1227 return pop_return();
1230 PerlIO_printf(PerlIO_stderr(), "%s",message);
1231 PerlIO_flush(PerlIO_stderr());
1240 if (SvTRUE(left) != SvTRUE(right))
1252 RETURNOP(cLOGOP->op_other);
1261 RETURNOP(cLOGOP->op_other);
1267 register I32 cxix = dopoptosub(cxstack_ix);
1268 register PERL_CONTEXT *cx;
1269 register PERL_CONTEXT *ccstack = cxstack;
1270 PERL_SI *top_si = PL_curstackinfo;
1281 /* we may be in a higher stacklevel, so dig down deeper */
1282 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1283 top_si = top_si->si_prev;
1284 ccstack = top_si->si_cxstack;
1285 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1288 if (GIMME != G_ARRAY)
1292 if (PL_DBsub && cxix >= 0 &&
1293 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1297 cxix = dopoptosub_at(ccstack, cxix - 1);
1300 cx = &ccstack[cxix];
1301 if (ccstack[cxix].cx_type == CXt_SUB) {
1302 dbcxix = dopoptosub_at(ccstack, cxix - 1);
1303 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1304 field below is defined for any cx. */
1305 if (PL_DBsub && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1306 cx = &ccstack[dbcxix];
1309 if (GIMME != G_ARRAY) {
1310 hv = cx->blk_oldcop->cop_stash;
1312 PUSHs(&PL_sv_undef);
1315 sv_setpv(TARG, HvNAME(hv));
1321 hv = cx->blk_oldcop->cop_stash;
1323 PUSHs(&PL_sv_undef);
1325 PUSHs(sv_2mortal(newSVpv(HvNAME(hv), 0)));
1326 PUSHs(sv_2mortal(newSVpv(SvPVX(GvSV(cx->blk_oldcop->cop_filegv)), 0)));
1327 PUSHs(sv_2mortal(newSViv((I32)cx->blk_oldcop->cop_line)));
1330 if (cx->cx_type == CXt_SUB) { /* So is ccstack[dbcxix]. */
1332 gv_efullname3(sv, CvGV(ccstack[cxix].blk_sub.cv), Nullch);
1333 PUSHs(sv_2mortal(sv));
1334 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1337 PUSHs(sv_2mortal(newSVpv("(eval)",0)));
1338 PUSHs(sv_2mortal(newSViv(0)));
1340 gimme = (I32)cx->blk_gimme;
1341 if (gimme == G_VOID)
1342 PUSHs(&PL_sv_undef);
1344 PUSHs(sv_2mortal(newSViv(gimme & G_ARRAY)));
1345 if (cx->cx_type == CXt_EVAL) {
1346 if (cx->blk_eval.old_op_type == OP_ENTEREVAL) {
1347 PUSHs(cx->blk_eval.cur_text);
1350 else if (cx->blk_eval.old_name) { /* Try blocks have old_name == 0. */
1351 /* Require, put the name. */
1352 PUSHs(sv_2mortal(newSVpv(cx->blk_eval.old_name, 0)));
1356 else if (cx->cx_type == CXt_SUB &&
1357 cx->blk_sub.hasargs &&
1358 PL_curcop->cop_stash == PL_debstash)
1360 AV *ary = cx->blk_sub.argarray;
1361 int off = AvARRAY(ary) - AvALLOC(ary);
1365 PL_dbargs = GvAV(gv_AVadd(tmpgv = gv_fetchpv("DB::args", TRUE,
1368 AvREAL_off(PL_dbargs); /* XXX Should be REIFY */
1371 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1372 av_extend(PL_dbargs, AvFILLp(ary) + off);
1373 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1374 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1380 sortcv(SV *a, SV *b)
1383 I32 oldsaveix = PL_savestack_ix;
1384 I32 oldscopeix = PL_scopestack_ix;
1386 GvSV(PL_firstgv) = a;
1387 GvSV(PL_secondgv) = b;
1388 PL_stack_sp = PL_stack_base;
1391 if (PL_stack_sp != PL_stack_base + 1)
1392 croak("Sort subroutine didn't return single value");
1393 if (!SvNIOKp(*PL_stack_sp))
1394 croak("Sort subroutine didn't return a numeric value");
1395 result = SvIV(*PL_stack_sp);
1396 while (PL_scopestack_ix > oldscopeix) {
1399 leave_scope(oldsaveix);
1412 sv_reset(tmps, PL_curcop->cop_stash);
1424 PL_curcop = (COP*)PL_op;
1425 TAINT_NOT; /* Each statement is presumed innocent */
1426 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
1429 if (PL_op->op_private || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
1433 register PERL_CONTEXT *cx;
1434 I32 gimme = G_ARRAY;
1441 DIE("No DB::DB routine defined");
1443 if (CvDEPTH(cv) >= 1 && !(PL_debug & (1<<30))) /* don't do recursive DB::DB call */
1455 push_return(PL_op->op_next);
1456 PUSHBLOCK(cx, CXt_SUB, SP);
1459 (void)SvREFCNT_inc(cv);
1460 SAVESPTR(PL_curpad);
1461 PL_curpad = AvARRAY((AV*)*av_fetch(CvPADLIST(cv),1,FALSE));
1462 RETURNOP(CvSTART(cv));
1476 register PERL_CONTEXT *cx;
1477 I32 gimme = GIMME_V;
1484 if (PL_op->op_flags & OPf_SPECIAL)
1485 svp = save_threadsv(PL_op->op_targ); /* per-thread variable */
1487 #endif /* USE_THREADS */
1488 if (PL_op->op_targ) {
1489 svp = &PL_curpad[PL_op->op_targ]; /* "my" variable */
1494 (void)save_scalar(gv);
1495 svp = &GvSV(gv); /* symbol table variable */
1500 PUSHBLOCK(cx, CXt_LOOP, SP);
1501 PUSHLOOP(cx, svp, MARK);
1502 if (PL_op->op_flags & OPf_STACKED) {
1503 cx->blk_loop.iterary = (AV*)SvREFCNT_inc(POPs);
1504 if (SvTYPE(cx->blk_loop.iterary) != SVt_PVAV) {
1506 if (SvNIOKp(sv) || !SvPOKp(sv) ||
1507 (looks_like_number(sv) && *SvPVX(sv) != '0')) {
1508 if (SvNV(sv) < IV_MIN ||
1509 SvNV((SV*)cx->blk_loop.iterary) >= IV_MAX)
1510 croak("Range iterator outside integer range");
1511 cx->blk_loop.iterix = SvIV(sv);
1512 cx->blk_loop.itermax = SvIV((SV*)cx->blk_loop.iterary);
1515 cx->blk_loop.iterlval = newSVsv(sv);
1519 cx->blk_loop.iterary = PL_curstack;
1520 AvFILLp(PL_curstack) = SP - PL_stack_base;
1521 cx->blk_loop.iterix = MARK - PL_stack_base;
1530 register PERL_CONTEXT *cx;
1531 I32 gimme = GIMME_V;
1537 PUSHBLOCK(cx, CXt_LOOP, SP);
1538 PUSHLOOP(cx, 0, SP);
1546 register PERL_CONTEXT *cx;
1547 struct block_loop cxloop;
1555 POPLOOP1(cx); /* Delay POPLOOP2 until stack values are safe */
1558 if (gimme == G_VOID)
1560 else if (gimme == G_SCALAR) {
1562 *++newsp = sv_mortalcopy(*SP);
1564 *++newsp = &PL_sv_undef;
1568 *++newsp = sv_mortalcopy(*++mark);
1569 TAINT_NOT; /* Each item is independent */
1575 POPLOOP2(); /* Stack values are safe: release loop vars ... */
1576 PL_curpm = newpm; /* ... and pop $1 et al */
1588 register PERL_CONTEXT *cx;
1589 struct block_sub cxsub;
1590 bool popsub2 = FALSE;
1596 if (PL_curstackinfo->si_type == PERLSI_SORT) {
1597 if (cxstack_ix == PL_sortcxix || dopoptosub(cxstack_ix) <= PL_sortcxix) {
1598 if (cxstack_ix > PL_sortcxix)
1599 dounwind(PL_sortcxix);
1600 AvARRAY(PL_curstack)[1] = *SP;
1601 PL_stack_sp = PL_stack_base + 1;
1606 cxix = dopoptosub(cxstack_ix);
1608 DIE("Can't return outside a subroutine");
1609 if (cxix < cxstack_ix)
1613 switch (cx->cx_type) {
1615 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1620 if (optype == OP_REQUIRE &&
1621 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
1623 /* Unassume the success we assumed earlier. */
1624 char *name = cx->blk_eval.old_name;
1625 (void)hv_delete(GvHVn(PL_incgv), name, strlen(name), G_DISCARD);
1626 DIE("%s did not return a true value", name);
1630 DIE("panic: return");
1634 if (gimme == G_SCALAR) {
1637 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1639 *++newsp = SvREFCNT_inc(*SP);
1644 *++newsp = sv_mortalcopy(*SP);
1647 *++newsp = (SvTEMP(*SP)) ? *SP : sv_mortalcopy(*SP);
1649 *++newsp = sv_mortalcopy(*SP);
1651 *++newsp = &PL_sv_undef;
1653 else if (gimme == G_ARRAY) {
1654 while (++MARK <= SP) {
1655 *++newsp = (popsub2 && SvTEMP(*MARK))
1656 ? *MARK : sv_mortalcopy(*MARK);
1657 TAINT_NOT; /* Each item is independent */
1660 PL_stack_sp = newsp;
1662 /* Stack values are safe: */
1664 POPSUB2(); /* release CV and @_ ... */
1666 PL_curpm = newpm; /* ... and pop $1 et al */
1669 return pop_return();
1676 register PERL_CONTEXT *cx;
1677 struct block_loop cxloop;
1678 struct block_sub cxsub;
1685 SV **mark = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
1687 if (PL_op->op_flags & OPf_SPECIAL) {
1688 cxix = dopoptoloop(cxstack_ix);
1690 DIE("Can't \"last\" outside a block");
1693 cxix = dopoptolabel(cPVOP->op_pv);
1695 DIE("Label not found for \"last %s\"", cPVOP->op_pv);
1697 if (cxix < cxstack_ix)
1701 switch (cx->cx_type) {
1703 POPLOOP1(cx); /* Delay POPLOOP2 until stack values are safe */
1705 nextop = cxloop.last_op->op_next;
1708 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1710 nextop = pop_return();
1714 nextop = pop_return();
1721 if (gimme == G_SCALAR) {
1723 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*SP))
1724 ? *SP : sv_mortalcopy(*SP);
1726 *++newsp = &PL_sv_undef;
1728 else if (gimme == G_ARRAY) {
1729 while (++MARK <= SP) {
1730 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*MARK))
1731 ? *MARK : sv_mortalcopy(*MARK);
1732 TAINT_NOT; /* Each item is independent */
1738 /* Stack values are safe: */
1741 POPLOOP2(); /* release loop vars ... */
1745 POPSUB2(); /* release CV and @_ ... */
1748 PL_curpm = newpm; /* ... and pop $1 et al */
1757 register PERL_CONTEXT *cx;
1760 if (PL_op->op_flags & OPf_SPECIAL) {
1761 cxix = dopoptoloop(cxstack_ix);
1763 DIE("Can't \"next\" outside a block");
1766 cxix = dopoptolabel(cPVOP->op_pv);
1768 DIE("Label not found for \"next %s\"", cPVOP->op_pv);
1770 if (cxix < cxstack_ix)
1774 oldsave = PL_scopestack[PL_scopestack_ix - 1];
1775 LEAVE_SCOPE(oldsave);
1776 return cx->blk_loop.next_op;
1782 register PERL_CONTEXT *cx;
1785 if (PL_op->op_flags & OPf_SPECIAL) {
1786 cxix = dopoptoloop(cxstack_ix);
1788 DIE("Can't \"redo\" outside a block");
1791 cxix = dopoptolabel(cPVOP->op_pv);
1793 DIE("Label not found for \"redo %s\"", cPVOP->op_pv);
1795 if (cxix < cxstack_ix)
1799 oldsave = PL_scopestack[PL_scopestack_ix - 1];
1800 LEAVE_SCOPE(oldsave);
1801 return cx->blk_loop.redo_op;
1805 dofindlabel(OP *o, char *label, OP **opstack, OP **oplimit)
1809 static char too_deep[] = "Target of goto is too deeply nested";
1813 if (o->op_type == OP_LEAVE ||
1814 o->op_type == OP_SCOPE ||
1815 o->op_type == OP_LEAVELOOP ||
1816 o->op_type == OP_LEAVETRY)
1818 *ops++ = cUNOPo->op_first;
1823 if (o->op_flags & OPf_KIDS) {
1825 /* First try all the kids at this level, since that's likeliest. */
1826 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1827 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
1828 kCOP->cop_label && strEQ(kCOP->cop_label, label))
1831 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1832 if (kid == PL_lastgotoprobe)
1834 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
1836 (ops[-1]->op_type != OP_NEXTSTATE &&
1837 ops[-1]->op_type != OP_DBSTATE)))
1839 if (o = dofindlabel(kid, label, ops, oplimit))
1849 return pp_goto(ARGS);
1858 register PERL_CONTEXT *cx;
1859 #define GOTO_DEPTH 64
1860 OP *enterops[GOTO_DEPTH];
1862 int do_dump = (PL_op->op_type == OP_DUMP);
1865 if (PL_op->op_flags & OPf_STACKED) {
1868 /* This egregious kludge implements goto &subroutine */
1869 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
1871 register PERL_CONTEXT *cx;
1872 CV* cv = (CV*)SvRV(sv);
1878 if (!CvROOT(cv) && !CvXSUB(cv)) {
1883 /* autoloaded stub? */
1884 if (cv != GvCV(gv) && (cv = GvCV(gv)))
1886 autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv),
1887 GvNAMELEN(gv), FALSE);
1888 if (autogv && (cv = GvCV(autogv)))
1890 tmpstr = sv_newmortal();
1891 gv_efullname3(tmpstr, gv, Nullch);
1892 DIE("Goto undefined subroutine &%s",SvPVX(tmpstr));
1894 DIE("Goto undefined subroutine");
1897 /* First do some returnish stuff. */
1898 cxix = dopoptosub(cxstack_ix);
1900 DIE("Can't goto subroutine outside a subroutine");
1901 if (cxix < cxstack_ix)
1904 if (cx->cx_type == CXt_EVAL && cx->blk_eval.old_op_type == OP_ENTEREVAL)
1905 DIE("Can't goto subroutine from an eval-string");
1907 if (cx->cx_type == CXt_SUB &&
1908 cx->blk_sub.hasargs) { /* put @_ back onto stack */
1909 AV* av = cx->blk_sub.argarray;
1911 items = AvFILLp(av) + 1;
1913 EXTEND(PL_stack_sp, items); /* @_ could have been extended. */
1914 Copy(AvARRAY(av), PL_stack_sp, items, SV*);
1915 PL_stack_sp += items;
1917 SvREFCNT_dec(GvAV(PL_defgv));
1918 GvAV(PL_defgv) = cx->blk_sub.savearray;
1919 #endif /* USE_THREADS */
1923 else if (CvXSUB(cv)) { /* put GvAV(defgv) back onto stack */
1927 av = (AV*)PL_curpad[0];
1929 av = GvAV(PL_defgv);
1931 items = AvFILLp(av) + 1;
1933 EXTEND(PL_stack_sp, items); /* @_ could have been extended. */
1934 Copy(AvARRAY(av), PL_stack_sp, items, SV*);
1935 PL_stack_sp += items;
1937 if (cx->cx_type == CXt_SUB &&
1938 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
1939 SvREFCNT_dec(cx->blk_sub.cv);
1940 oldsave = PL_scopestack[PL_scopestack_ix - 1];
1941 LEAVE_SCOPE(oldsave);
1943 /* Now do some callish stuff. */
1946 if (CvOLDSTYLE(cv)) {
1947 I32 (*fp3)_((int,int,int));
1952 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
1953 items = (*fp3)(CvXSUBANY(cv).any_i32,
1954 mark - PL_stack_base + 1,
1956 SP = PL_stack_base + items;
1962 PL_stack_sp--; /* There is no cv arg. */
1963 /* Push a mark for the start of arglist */
1965 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
1966 /* Pop the current context like a decent sub should */
1967 POPBLOCK(cx, PL_curpm);
1968 /* Do _not_ use PUTBACK, keep the XSUB's return stack! */
1971 return pop_return();
1974 AV* padlist = CvPADLIST(cv);
1975 SV** svp = AvARRAY(padlist);
1976 if (cx->cx_type == CXt_EVAL) {
1977 PL_in_eval = cx->blk_eval.old_in_eval;
1978 PL_eval_root = cx->blk_eval.old_eval_root;
1979 cx->cx_type = CXt_SUB;
1980 cx->blk_sub.hasargs = 0;
1982 cx->blk_sub.cv = cv;
1983 cx->blk_sub.olddepth = CvDEPTH(cv);
1985 if (CvDEPTH(cv) < 2)
1986 (void)SvREFCNT_inc(cv);
1987 else { /* save temporaries on recursion? */
1988 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION))
1989 sub_crush_depth(cv);
1990 if (CvDEPTH(cv) > AvFILLp(padlist)) {
1991 AV *newpad = newAV();
1992 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
1993 I32 ix = AvFILLp((AV*)svp[1]);
1994 svp = AvARRAY(svp[0]);
1995 for ( ;ix > 0; ix--) {
1996 if (svp[ix] != &PL_sv_undef) {
1997 char *name = SvPVX(svp[ix]);
1998 if ((SvFLAGS(svp[ix]) & SVf_FAKE)
2001 /* outer lexical or anon code */
2002 av_store(newpad, ix,
2003 SvREFCNT_inc(oldpad[ix]) );
2005 else { /* our own lexical */
2007 av_store(newpad, ix, sv = (SV*)newAV());
2008 else if (*name == '%')
2009 av_store(newpad, ix, sv = (SV*)newHV());
2011 av_store(newpad, ix, sv = NEWSV(0,0));
2016 av_store(newpad, ix, sv = NEWSV(0,0));
2020 if (cx->blk_sub.hasargs) {
2023 av_store(newpad, 0, (SV*)av);
2024 AvFLAGS(av) = AVf_REIFY;
2026 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2027 AvFILLp(padlist) = CvDEPTH(cv);
2028 svp = AvARRAY(padlist);
2032 if (!cx->blk_sub.hasargs) {
2033 AV* av = (AV*)PL_curpad[0];
2035 items = AvFILLp(av) + 1;
2037 /* Mark is at the end of the stack. */
2039 Copy(AvARRAY(av), SP + 1, items, SV*);
2044 #endif /* USE_THREADS */
2045 SAVESPTR(PL_curpad);
2046 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2048 if (cx->blk_sub.hasargs)
2049 #endif /* USE_THREADS */
2051 AV* av = (AV*)PL_curpad[0];
2055 cx->blk_sub.savearray = GvAV(PL_defgv);
2056 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2057 #endif /* USE_THREADS */
2058 cx->blk_sub.argarray = av;
2061 if (items >= AvMAX(av) + 1) {
2063 if (AvARRAY(av) != ary) {
2064 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2065 SvPVX(av) = (char*)ary;
2067 if (items >= AvMAX(av) + 1) {
2068 AvMAX(av) = items - 1;
2069 Renew(ary,items+1,SV*);
2071 SvPVX(av) = (char*)ary;
2074 Copy(mark,AvARRAY(av),items,SV*);
2075 AvFILLp(av) = items - 1;
2083 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
2085 * We do not care about using sv to call CV;
2086 * it's for informational purposes only.
2088 SV *sv = GvSV(PL_DBsub);
2091 if (PERLDB_SUB_NN) {
2092 SvIVX(sv) = (IV)cv; /* Already upgraded, saved */
2095 gv_efullname3(sv, CvGV(cv), Nullch);
2098 && (gotocv = perl_get_cv("DB::goto", FALSE)) ) {
2099 PUSHMARK( PL_stack_sp );
2100 perl_call_sv((SV*)gotocv, G_SCALAR | G_NODEBUG);
2104 RETURNOP(CvSTART(cv));
2108 label = SvPV(sv,PL_na);
2110 else if (PL_op->op_flags & OPf_SPECIAL) {
2112 DIE("goto must have label");
2115 label = cPVOP->op_pv;
2117 if (label && *label) {
2122 PL_lastgotoprobe = 0;
2124 for (ix = cxstack_ix; ix >= 0; ix--) {
2126 switch (cx->cx_type) {
2128 gotoprobe = PL_eval_root; /* XXX not good for nested eval */
2131 gotoprobe = cx->blk_oldcop->op_sibling;
2137 gotoprobe = cx->blk_oldcop->op_sibling;
2139 gotoprobe = PL_main_root;
2142 if (CvDEPTH(cx->blk_sub.cv)) {
2143 gotoprobe = CvROOT(cx->blk_sub.cv);
2148 DIE("Can't \"goto\" outside a block");
2152 gotoprobe = PL_main_root;
2155 retop = dofindlabel(gotoprobe, label,
2156 enterops, enterops + GOTO_DEPTH);
2159 PL_lastgotoprobe = gotoprobe;
2162 DIE("Can't find label %s", label);
2164 /* pop unwanted frames */
2166 if (ix < cxstack_ix) {
2173 oldsave = PL_scopestack[PL_scopestack_ix];
2174 LEAVE_SCOPE(oldsave);
2177 /* push wanted frames */
2179 if (*enterops && enterops[1]) {
2181 for (ix = 1; enterops[ix]; ix++) {
2182 PL_op = enterops[ix];
2183 /* Eventually we may want to stack the needed arguments
2184 * for each op. For now, we punt on the hard ones. */
2185 if (PL_op->op_type == OP_ENTERITER)
2186 DIE("Can't \"goto\" into the middle of a foreach loop",
2188 (CALLOP->op_ppaddr)(ARGS);
2196 if (!retop) retop = PL_main_start;
2198 PL_restartop = retop;
2199 PL_do_undump = TRUE;
2203 PL_restartop = 0; /* hmm, must be GNU unexec().. */
2204 PL_do_undump = FALSE;
2220 if (anum == 1 && VMSISH_EXIT)
2225 PUSHs(&PL_sv_undef);
2233 double value = SvNVx(GvSV(cCOP->cop_gv));
2234 register I32 match = I_32(value);
2237 if (((double)match) > value)
2238 --match; /* was fractional--truncate other way */
2240 match -= cCOP->uop.scop.scop_offset;
2243 else if (match > cCOP->uop.scop.scop_max)
2244 match = cCOP->uop.scop.scop_max;
2245 PL_op = cCOP->uop.scop.scop_next[match];
2255 PL_op = PL_op->op_next; /* can't assume anything */
2257 match = *(SvPVx(GvSV(cCOP->cop_gv), PL_na)) & 255;
2258 match -= cCOP->uop.scop.scop_offset;
2261 else if (match > cCOP->uop.scop.scop_max)
2262 match = cCOP->uop.scop.scop_max;
2263 PL_op = cCOP->uop.scop.scop_next[match];
2272 save_lines(AV *array, SV *sv)
2274 register char *s = SvPVX(sv);
2275 register char *send = SvPVX(sv) + SvCUR(sv);
2277 register I32 line = 1;
2279 while (s && s < send) {
2280 SV *tmpstr = NEWSV(85,0);
2282 sv_upgrade(tmpstr, SVt_PVMG);
2283 t = strchr(s, '\n');
2289 sv_setpvn(tmpstr, s, t - s);
2290 av_store(array, line++, tmpstr);
2305 assert(CATCH_GET == TRUE);
2306 DEBUG_l(deb("Setting up local jumplevel %p, was %p\n", &cur_env, PL_top_env));
2310 default: /* topmost level handles it */
2316 if (!PL_restartop) {
2317 PerlIO_printf(PerlIO_stderr(), "panic: restartop\n");
2320 PL_op = PL_restartop;
2333 sv_compile_2op(SV *sv, OP** startop, char *code, AV** avp)
2334 /* sv Text to convert to OP tree. */
2335 /* startop op_free() this to undo. */
2336 /* code Short string id of the caller. */
2338 dSP; /* Make POPBLOCK work. */
2341 I32 gimme = 0; /* SUSPECT - INITIALZE TO WHAT? NI-S */
2344 OP *oop = PL_op, *rop;
2345 char tmpbuf[TYPE_DIGITS(long) + 12 + 10];
2351 /* switch to eval mode */
2353 if (PL_curcop == &PL_compiling) {
2354 SAVESPTR(PL_compiling.cop_stash);
2355 PL_compiling.cop_stash = PL_curstash;
2357 SAVESPTR(PL_compiling.cop_filegv);
2358 SAVEI16(PL_compiling.cop_line);
2359 sprintf(tmpbuf, "_<(%.10s_eval %lu)", code, (unsigned long)++PL_evalseq);
2360 PL_compiling.cop_filegv = gv_fetchfile(tmpbuf+2);
2361 PL_compiling.cop_line = 1;
2362 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
2363 deleting the eval's FILEGV from the stash before gv_check() runs
2364 (i.e. before run-time proper). To work around the coredump that
2365 ensues, we always turn GvMULTI_on for any globals that were
2366 introduced within evals. See force_ident(). GSAR 96-10-12 */
2367 safestr = savepv(tmpbuf);
2368 SAVEDELETE(PL_defstash, safestr, strlen(safestr));
2370 #ifdef OP_IN_REGISTER
2378 PL_op->op_type = OP_ENTEREVAL;
2379 PL_op->op_flags = 0; /* Avoid uninit warning. */
2380 PUSHBLOCK(cx, CXt_EVAL, SP);
2381 PUSHEVAL(cx, 0, PL_compiling.cop_filegv);
2382 rop = doeval(G_SCALAR, startop);
2383 POPBLOCK(cx,PL_curpm);
2386 (*startop)->op_type = OP_NULL;
2387 (*startop)->op_ppaddr = ppaddr[OP_NULL];
2389 *avp = (AV*)SvREFCNT_inc(PL_comppad);
2391 if (PL_curcop == &PL_compiling)
2392 PL_compiling.op_private = PL_hints;
2393 #ifdef OP_IN_REGISTER
2399 /* With USE_THREADS, eval_owner must be held on entry to doeval */
2401 doeval(int gimme, OP** startop)
2414 /* set up a scratch pad */
2417 SAVESPTR(PL_curpad);
2418 SAVESPTR(PL_comppad);
2419 SAVESPTR(PL_comppad_name);
2420 SAVEI32(PL_comppad_name_fill);
2421 SAVEI32(PL_min_intro_pending);
2422 SAVEI32(PL_max_intro_pending);
2425 for (i = cxstack_ix; i >= 0; i--) {
2426 PERL_CONTEXT *cx = &cxstack[i];
2427 if (cx->cx_type == CXt_EVAL)
2429 else if (cx->cx_type == CXt_SUB) {
2430 caller = cx->blk_sub.cv;
2435 SAVESPTR(PL_compcv);
2436 PL_compcv = (CV*)NEWSV(1104,0);
2437 sv_upgrade((SV *)PL_compcv, SVt_PVCV);
2438 CvUNIQUE_on(PL_compcv);
2440 CvOWNER(PL_compcv) = 0;
2441 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
2442 MUTEX_INIT(CvMUTEXP(PL_compcv));
2443 #endif /* USE_THREADS */
2445 PL_comppad = newAV();
2446 av_push(PL_comppad, Nullsv);
2447 PL_curpad = AvARRAY(PL_comppad);
2448 PL_comppad_name = newAV();
2449 PL_comppad_name_fill = 0;
2450 PL_min_intro_pending = 0;
2453 av_store(PL_comppad_name, 0, newSVpv("@_", 2));
2454 PL_curpad[0] = (SV*)newAV();
2455 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
2456 #endif /* USE_THREADS */
2458 comppadlist = newAV();
2459 AvREAL_off(comppadlist);
2460 av_store(comppadlist, 0, (SV*)PL_comppad_name);
2461 av_store(comppadlist, 1, (SV*)PL_comppad);
2462 CvPADLIST(PL_compcv) = comppadlist;
2464 if (!saveop || saveop->op_type != OP_REQUIRE)
2465 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(caller);
2467 SAVEFREESV(PL_compcv);
2469 /* make sure we compile in the right package */
2471 newstash = PL_curcop->cop_stash;
2472 if (PL_curstash != newstash) {
2473 SAVESPTR(PL_curstash);
2474 PL_curstash = newstash;
2476 SAVESPTR(PL_beginav);
2477 PL_beginav = newAV();
2478 SAVEFREESV(PL_beginav);
2480 /* try to compile it */
2482 PL_eval_root = Nullop;
2484 PL_curcop = &PL_compiling;
2485 PL_curcop->cop_arybase = 0;
2486 SvREFCNT_dec(PL_rs);
2487 PL_rs = newSVpv("\n", 1);
2488 if (saveop && saveop->op_flags & OPf_SPECIAL)
2492 if (yyparse() || PL_error_count || !PL_eval_root) {
2496 I32 optype = 0; /* Might be reset by POPEVAL. */
2500 op_free(PL_eval_root);
2501 PL_eval_root = Nullop;
2503 SP = PL_stack_base + POPMARK; /* pop original mark */
2505 POPBLOCK(cx,PL_curpm);
2511 if (optype == OP_REQUIRE) {
2512 char* msg = SvPVx(ERRSV, PL_na);
2513 DIE("%s", *msg ? msg : "Compilation failed in require");
2514 } else if (startop) {
2515 char* msg = SvPVx(ERRSV, PL_na);
2517 POPBLOCK(cx,PL_curpm);
2519 croak("%sCompilation failed in regexp", (*msg ? msg : "Unknown error\n"));
2521 SvREFCNT_dec(PL_rs);
2522 PL_rs = SvREFCNT_inc(PL_nrs);
2524 MUTEX_LOCK(&PL_eval_mutex);
2526 COND_SIGNAL(&PL_eval_cond);
2527 MUTEX_UNLOCK(&PL_eval_mutex);
2528 #endif /* USE_THREADS */
2531 SvREFCNT_dec(PL_rs);
2532 PL_rs = SvREFCNT_inc(PL_nrs);
2533 PL_compiling.cop_line = 0;
2535 *startop = PL_eval_root;
2536 SvREFCNT_dec(CvOUTSIDE(PL_compcv));
2537 CvOUTSIDE(PL_compcv) = Nullcv;
2539 SAVEFREEOP(PL_eval_root);
2541 scalarvoid(PL_eval_root);
2542 else if (gimme & G_ARRAY)
2545 scalar(PL_eval_root);
2547 DEBUG_x(dump_eval());
2549 /* Register with debugger: */
2550 if (PERLDB_INTER && saveop->op_type == OP_REQUIRE) {
2551 CV *cv = perl_get_cv("DB::postponed", FALSE);
2555 XPUSHs((SV*)PL_compiling.cop_filegv);
2557 perl_call_sv((SV*)cv, G_DISCARD);
2561 /* compiled okay, so do it */
2563 CvDEPTH(PL_compcv) = 1;
2564 SP = PL_stack_base + POPMARK; /* pop original mark */
2565 PL_op = saveop; /* The caller may need it. */
2567 MUTEX_LOCK(&PL_eval_mutex);
2569 COND_SIGNAL(&PL_eval_cond);
2570 MUTEX_UNLOCK(&PL_eval_mutex);
2571 #endif /* USE_THREADS */
2573 RETURNOP(PL_eval_start);
2579 register PERL_CONTEXT *cx;
2584 SV *namesv = Nullsv;
2586 I32 gimme = G_SCALAR;
2587 PerlIO *tryrsfp = 0;
2590 if (SvNIOKp(sv) && !SvPOKp(sv)) {
2591 SET_NUMERIC_STANDARD();
2592 if (atof(PL_patchlevel) + 0.00000999 < SvNV(sv))
2593 DIE("Perl %s required--this is only version %s, stopped",
2594 SvPV(sv,PL_na),PL_patchlevel);
2597 name = SvPV(sv, len);
2598 if (!(name && len > 0 && *name))
2599 DIE("Null filename used");
2600 TAINT_PROPER("require");
2601 if (PL_op->op_type == OP_REQUIRE &&
2602 (svp = hv_fetch(GvHVn(PL_incgv), name, len, 0)) &&
2603 *svp != &PL_sv_undef)
2606 /* prepare to compile file */
2611 (name[1] == '.' && name[2] == '/')))
2613 || (name[0] && name[1] == ':')
2616 || (name[0] == '\\' && name[1] == '\\') /* UNC path */
2619 || (strchr(name,':') || ((*name == '[' || *name == '<') &&
2620 (isALNUM(name[1]) || strchr("$-_]>",name[1]))))
2625 tryrsfp = PerlIO_open(name,PERL_SCRIPT_MODE);
2628 AV *ar = GvAVn(PL_incgv);
2632 if ((unixname = tounixspec(name, Nullch)) != Nullch)
2635 namesv = NEWSV(806, 0);
2636 for (i = 0; i <= AvFILL(ar); i++) {
2637 char *dir = SvPVx(*av_fetch(ar, i, TRUE), PL_na);
2640 if ((unixdir = tounixpath(dir, Nullch)) == Nullch)
2642 sv_setpv(namesv, unixdir);
2643 sv_catpv(namesv, unixname);
2645 sv_setpvf(namesv, "%s/%s", dir, name);
2647 tryname = SvPVX(namesv);
2648 tryrsfp = PerlIO_open(tryname, PERL_SCRIPT_MODE);
2650 if (tryname[0] == '.' && tryname[1] == '/')
2657 SAVESPTR(PL_compiling.cop_filegv);
2658 PL_compiling.cop_filegv = gv_fetchfile(tryrsfp ? tryname : name);
2659 SvREFCNT_dec(namesv);
2661 if (PL_op->op_type == OP_REQUIRE) {
2662 SV *msg = sv_2mortal(newSVpvf("Can't locate %s in @INC", name));
2663 SV *dirmsgsv = NEWSV(0, 0);
2664 AV *ar = GvAVn(PL_incgv);
2666 if (instr(SvPVX(msg), ".h "))
2667 sv_catpv(msg, " (change .h to .ph maybe?)");
2668 if (instr(SvPVX(msg), ".ph "))
2669 sv_catpv(msg, " (did you run h2ph?)");
2670 sv_catpv(msg, " (@INC contains:");
2671 for (i = 0; i <= AvFILL(ar); i++) {
2672 char *dir = SvPVx(*av_fetch(ar, i, TRUE), PL_na);
2673 sv_setpvf(dirmsgsv, " %s", dir);
2674 sv_catsv(msg, dirmsgsv);
2676 sv_catpvn(msg, ")", 1);
2677 SvREFCNT_dec(dirmsgsv);
2684 SETERRNO(0, SS$_NORMAL);
2686 /* Assume success here to prevent recursive requirement. */
2687 (void)hv_store(GvHVn(PL_incgv), name, strlen(name),
2688 newSVsv(GvSV(PL_compiling.cop_filegv)), 0 );
2692 lex_start(sv_2mortal(newSVpv("",0)));
2693 if (PL_rsfp_filters){
2694 save_aptr(&PL_rsfp_filters);
2695 PL_rsfp_filters = NULL;
2699 name = savepv(name);
2703 SAVEPPTR(PL_compiling.cop_warnings);
2704 PL_compiling.cop_warnings = ((PL_dowarn & G_WARN_ALL_ON) ? WARN_ALL
2707 /* switch to eval mode */
2709 push_return(PL_op->op_next);
2710 PUSHBLOCK(cx, CXt_EVAL, SP);
2711 PUSHEVAL(cx, name, PL_compiling.cop_filegv);
2713 SAVEI16(PL_compiling.cop_line);
2714 PL_compiling.cop_line = 0;
2718 MUTEX_LOCK(&PL_eval_mutex);
2719 if (PL_eval_owner && PL_eval_owner != thr)
2720 while (PL_eval_owner)
2721 COND_WAIT(&PL_eval_cond, &PL_eval_mutex);
2722 PL_eval_owner = thr;
2723 MUTEX_UNLOCK(&PL_eval_mutex);
2724 #endif /* USE_THREADS */
2725 return DOCATCH(doeval(G_SCALAR, NULL));
2730 return pp_require(ARGS);
2736 register PERL_CONTEXT *cx;
2738 I32 gimme = GIMME_V, was = PL_sub_generation;
2739 char tmpbuf[TYPE_DIGITS(long) + 12];
2744 if (!SvPV(sv,len) || !len)
2746 TAINT_PROPER("eval");
2752 /* switch to eval mode */
2754 SAVESPTR(PL_compiling.cop_filegv);
2755 sprintf(tmpbuf, "_<(eval %lu)", (unsigned long)++PL_evalseq);
2756 PL_compiling.cop_filegv = gv_fetchfile(tmpbuf+2);
2757 PL_compiling.cop_line = 1;
2758 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
2759 deleting the eval's FILEGV from the stash before gv_check() runs
2760 (i.e. before run-time proper). To work around the coredump that
2761 ensues, we always turn GvMULTI_on for any globals that were
2762 introduced within evals. See force_ident(). GSAR 96-10-12 */
2763 safestr = savepv(tmpbuf);
2764 SAVEDELETE(PL_defstash, safestr, strlen(safestr));
2766 PL_hints = PL_op->op_targ;
2767 SAVEPPTR(PL_compiling.cop_warnings);
2768 if (PL_compiling.cop_warnings != WARN_ALL
2769 && PL_compiling.cop_warnings != WARN_NONE){
2770 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2771 SAVEFREESV(PL_compiling.cop_warnings) ;
2774 push_return(PL_op->op_next);
2775 PUSHBLOCK(cx, CXt_EVAL, SP);
2776 PUSHEVAL(cx, 0, PL_compiling.cop_filegv);
2778 /* prepare to compile string */
2780 if (PERLDB_LINE && PL_curstash != PL_debstash)
2781 save_lines(GvAV(PL_compiling.cop_filegv), PL_linestr);
2784 MUTEX_LOCK(&PL_eval_mutex);
2785 if (PL_eval_owner && PL_eval_owner != thr)
2786 while (PL_eval_owner)
2787 COND_WAIT(&PL_eval_cond, &PL_eval_mutex);
2788 PL_eval_owner = thr;
2789 MUTEX_UNLOCK(&PL_eval_mutex);
2790 #endif /* USE_THREADS */
2791 ret = doeval(gimme, NULL);
2792 if (PERLDB_INTER && was != PL_sub_generation /* Some subs defined here. */
2793 && ret != PL_op->op_next) { /* Successive compilation. */
2794 strcpy(safestr, "_<(eval )"); /* Anything fake and short. */
2796 return DOCATCH(ret);
2806 register PERL_CONTEXT *cx;
2808 U8 save_flags = PL_op -> op_flags;
2813 retop = pop_return();
2816 if (gimme == G_VOID)
2818 else if (gimme == G_SCALAR) {
2821 if (SvFLAGS(TOPs) & SVs_TEMP)
2824 *MARK = sv_mortalcopy(TOPs);
2828 *MARK = &PL_sv_undef;
2832 /* in case LEAVE wipes old return values */
2833 for (mark = newsp + 1; mark <= SP; mark++) {
2834 if (!(SvFLAGS(*mark) & SVs_TEMP)) {
2835 *mark = sv_mortalcopy(*mark);
2836 TAINT_NOT; /* Each item is independent */
2840 PL_curpm = newpm; /* Don't pop $1 et al till now */
2843 * Closures mentioned at top level of eval cannot be referenced
2844 * again, and their presence indirectly causes a memory leak.
2845 * (Note that the fact that compcv and friends are still set here
2846 * is, AFAIK, an accident.) --Chip
2848 if (AvFILLp(PL_comppad_name) >= 0) {
2849 SV **svp = AvARRAY(PL_comppad_name);
2851 for (ix = AvFILLp(PL_comppad_name); ix >= 0; ix--) {
2853 if (sv && sv != &PL_sv_undef && *SvPVX(sv) == '&') {
2855 svp[ix] = &PL_sv_undef;
2859 SvREFCNT_dec(CvOUTSIDE(sv));
2860 CvOUTSIDE(sv) = Nullcv;
2873 assert(CvDEPTH(PL_compcv) == 1);
2875 CvDEPTH(PL_compcv) = 0;
2878 if (optype == OP_REQUIRE &&
2879 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
2881 /* Unassume the success we assumed earlier. */
2882 char *name = cx->blk_eval.old_name;
2883 (void)hv_delete(GvHVn(PL_incgv), name, strlen(name), G_DISCARD);
2884 retop = die("%s did not return a true value", name);
2885 /* die_where() did LEAVE, or we won't be here */
2889 if (!(save_flags & OPf_SPECIAL))
2899 register PERL_CONTEXT *cx;
2900 I32 gimme = GIMME_V;
2905 push_return(cLOGOP->op_other->op_next);
2906 PUSHBLOCK(cx, CXt_EVAL, SP);
2908 PL_eval_root = PL_op; /* Only needed so that goto works right. */
2913 return DOCATCH(PL_op->op_next);
2923 register PERL_CONTEXT *cx;
2931 if (gimme == G_VOID)
2933 else if (gimme == G_SCALAR) {
2936 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
2939 *MARK = sv_mortalcopy(TOPs);
2943 *MARK = &PL_sv_undef;
2948 /* in case LEAVE wipes old return values */
2949 for (mark = newsp + 1; mark <= SP; mark++) {
2950 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
2951 *mark = sv_mortalcopy(*mark);
2952 TAINT_NOT; /* Each item is independent */
2956 PL_curpm = newpm; /* Don't pop $1 et al till now */
2967 register char *s = SvPV_force(sv, len);
2968 register char *send = s + len;
2969 register char *base;
2970 register I32 skipspaces = 0;
2973 bool postspace = FALSE;
2981 croak("Null picture in formline");
2983 New(804, fops, (send - s)*3+10, U16); /* Almost certainly too long... */
2988 *fpc++ = FF_LINEMARK;
2989 noblank = repeat = FALSE;
3007 case ' ': case '\t':
3018 *fpc++ = FF_LITERAL;
3026 *fpc++ = skipspaces;
3030 *fpc++ = FF_NEWLINE;
3034 arg = fpc - linepc + 1;
3041 *fpc++ = FF_LINEMARK;
3042 noblank = repeat = FALSE;
3051 ischop = s[-1] == '^';
3057 arg = (s - base) - 1;
3059 *fpc++ = FF_LITERAL;
3068 *fpc++ = FF_LINEGLOB;
3070 else if (*s == '#' || (*s == '.' && s[1] == '#')) {
3071 arg = ischop ? 512 : 0;
3081 arg |= 256 + (s - f);
3083 *fpc++ = s - base; /* fieldsize for FETCH */
3084 *fpc++ = FF_DECIMAL;
3089 bool ismore = FALSE;
3092 while (*++s == '>') ;
3093 prespace = FF_SPACE;
3095 else if (*s == '|') {
3096 while (*++s == '|') ;
3097 prespace = FF_HALFSPACE;
3102 while (*++s == '<') ;
3105 if (*s == '.' && s[1] == '.' && s[2] == '.') {
3109 *fpc++ = s - base; /* fieldsize for FETCH */
3111 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
3129 { /* need to jump to the next word */
3131 z = WORD_ALIGN - SvCUR(sv) % WORD_ALIGN;
3132 SvGROW(sv, SvCUR(sv) + z + arg * sizeof(U16) + 4);
3133 s = SvPVX(sv) + SvCUR(sv) + z;
3135 Copy(fops, s, arg, U16);
3137 sv_magic(sv, Nullsv, 'f', Nullch, 0);
3142 * The rest of this file was derived from source code contributed
3145 * NOTE: this code was derived from Tom Horsley's qsort replacement
3146 * and should not be confused with the original code.
3149 /* Copyright (C) Tom Horsley, 1997. All rights reserved.
3151 Permission granted to distribute under the same terms as perl which are
3154 This program is free software; you can redistribute it and/or modify
3155 it under the terms of either:
3157 a) the GNU General Public License as published by the Free
3158 Software Foundation; either version 1, or (at your option) any
3161 b) the "Artistic License" which comes with this Kit.
3163 Details on the perl license can be found in the perl source code which
3164 may be located via the www.perl.com web page.
3166 This is the most wonderfulest possible qsort I can come up with (and
3167 still be mostly portable) My (limited) tests indicate it consistently
3168 does about 20% fewer calls to compare than does the qsort in the Visual
3169 C++ library, other vendors may vary.
3171 Some of the ideas in here can be found in "Algorithms" by Sedgewick,
3172 others I invented myself (or more likely re-invented since they seemed
3173 pretty obvious once I watched the algorithm operate for a while).
3175 Most of this code was written while watching the Marlins sweep the Giants
3176 in the 1997 National League Playoffs - no Braves fans allowed to use this
3177 code (just kidding :-).
3179 I realize that if I wanted to be true to the perl tradition, the only
3180 comment in this file would be something like:
3182 ...they shuffled back towards the rear of the line. 'No, not at the
3183 rear!' the slave-driver shouted. 'Three files up. And stay there...
3185 However, I really needed to violate that tradition just so I could keep
3186 track of what happens myself, not to mention some poor fool trying to
3187 understand this years from now :-).
3190 /* ********************************************************** Configuration */
3192 #ifndef QSORT_ORDER_GUESS
3193 #define QSORT_ORDER_GUESS 2 /* Select doubling version of the netBSD trick */
3196 /* QSORT_MAX_STACK is the largest number of partitions that can be stacked up for
3197 future processing - a good max upper bound is log base 2 of memory size
3198 (32 on 32 bit machines, 64 on 64 bit machines, etc). In reality can
3199 safely be smaller than that since the program is taking up some space and
3200 most operating systems only let you grab some subset of contiguous
3201 memory (not to mention that you are normally sorting data larger than
3202 1 byte element size :-).
3204 #ifndef QSORT_MAX_STACK
3205 #define QSORT_MAX_STACK 32
3208 /* QSORT_BREAK_EVEN is the size of the largest partition we should insertion sort.
3209 Anything bigger and we use qsort. If you make this too small, the qsort
3210 will probably break (or become less efficient), because it doesn't expect
3211 the middle element of a partition to be the same as the right or left -
3212 you have been warned).
3214 #ifndef QSORT_BREAK_EVEN
3215 #define QSORT_BREAK_EVEN 6
3218 /* ************************************************************* Data Types */
3220 /* hold left and right index values of a partition waiting to be sorted (the
3221 partition includes both left and right - right is NOT one past the end or
3222 anything like that).
3224 struct partition_stack_entry {
3227 #ifdef QSORT_ORDER_GUESS
3228 int qsort_break_even;
3232 /* ******************************************************* Shorthand Macros */
3234 /* Note that these macros will be used from inside the qsort function where
3235 we happen to know that the variable 'elt_size' contains the size of an
3236 array element and the variable 'temp' points to enough space to hold a
3237 temp element and the variable 'array' points to the array being sorted
3238 and 'compare' is the pointer to the compare routine.
3240 Also note that there are very many highly architecture specific ways
3241 these might be sped up, but this is simply the most generally portable
3242 code I could think of.
3245 /* Return < 0 == 0 or > 0 as the value of elt1 is < elt2, == elt2, > elt2
3248 #define qsort_cmp(elt1, elt2) \
3249 ((this->*compare)(array[elt1], array[elt2]))
3251 #define qsort_cmp(elt1, elt2) \
3252 ((*compare)(array[elt1], array[elt2]))
3255 #ifdef QSORT_ORDER_GUESS
3256 #define QSORT_NOTICE_SWAP swapped++;
3258 #define QSORT_NOTICE_SWAP
3261 /* swaps contents of array elements elt1, elt2.
3263 #define qsort_swap(elt1, elt2) \
3266 temp = array[elt1]; \
3267 array[elt1] = array[elt2]; \
3268 array[elt2] = temp; \
3271 /* rotate contents of elt1, elt2, elt3 such that elt1 gets elt2, elt2 gets
3272 elt3 and elt3 gets elt1.
3274 #define qsort_rotate(elt1, elt2, elt3) \
3277 temp = array[elt1]; \
3278 array[elt1] = array[elt2]; \
3279 array[elt2] = array[elt3]; \
3280 array[elt3] = temp; \
3283 /* ************************************************************ Debug stuff */
3290 return; /* good place to set a breakpoint */
3293 #define qsort_assert(t) (void)( (t) || (break_here(), 0) )
3296 doqsort_all_asserts(
3300 int (*compare)(const void * elt1, const void * elt2),
3301 int pc_left, int pc_right, int u_left, int u_right)
3305 qsort_assert(pc_left <= pc_right);
3306 qsort_assert(u_right < pc_left);
3307 qsort_assert(pc_right < u_left);
3308 for (i = u_right + 1; i < pc_left; ++i) {
3309 qsort_assert(qsort_cmp(i, pc_left) < 0);
3311 for (i = pc_left; i < pc_right; ++i) {
3312 qsort_assert(qsort_cmp(i, pc_right) == 0);
3314 for (i = pc_right + 1; i < u_left; ++i) {
3315 qsort_assert(qsort_cmp(pc_right, i) < 0);
3319 #define qsort_all_asserts(PC_LEFT, PC_RIGHT, U_LEFT, U_RIGHT) \
3320 doqsort_all_asserts(array, num_elts, elt_size, compare, \
3321 PC_LEFT, PC_RIGHT, U_LEFT, U_RIGHT)
3325 #define qsort_assert(t) ((void)0)
3327 #define qsort_all_asserts(PC_LEFT, PC_RIGHT, U_LEFT, U_RIGHT) ((void)0)
3331 /* ****************************************************************** qsort */
3335 qsortsv(SV ** array, size_t num_elts, SVCOMPARE compare)
3340 I32 (*compare)(SV *a, SV *b))
3345 struct partition_stack_entry partition_stack[QSORT_MAX_STACK];
3346 int next_stack_entry = 0;
3350 #ifdef QSORT_ORDER_GUESS
3351 int qsort_break_even;
3355 /* Make sure we actually have work to do.
3357 if (num_elts <= 1) {
3361 /* Setup the initial partition definition and fall into the sorting loop
3364 part_right = (int)(num_elts - 1);
3365 #ifdef QSORT_ORDER_GUESS
3366 qsort_break_even = QSORT_BREAK_EVEN;
3368 #define qsort_break_even QSORT_BREAK_EVEN
3371 if ((part_right - part_left) >= qsort_break_even) {
3372 /* OK, this is gonna get hairy, so lets try to document all the
3373 concepts and abbreviations and variables and what they keep
3376 pc: pivot chunk - the set of array elements we accumulate in the
3377 middle of the partition, all equal in value to the original
3378 pivot element selected. The pc is defined by:
3380 pc_left - the leftmost array index of the pc
3381 pc_right - the rightmost array index of the pc
3383 we start with pc_left == pc_right and only one element
3384 in the pivot chunk (but it can grow during the scan).
3386 u: uncompared elements - the set of elements in the partition
3387 we have not yet compared to the pivot value. There are two
3388 uncompared sets during the scan - one to the left of the pc
3389 and one to the right.
3391 u_right - the rightmost index of the left side's uncompared set
3392 u_left - the leftmost index of the right side's uncompared set
3394 The leftmost index of the left sides's uncompared set
3395 doesn't need its own variable because it is always defined
3396 by the leftmost edge of the whole partition (part_left). The
3397 same goes for the rightmost edge of the right partition
3400 We know there are no uncompared elements on the left once we
3401 get u_right < part_left and no uncompared elements on the
3402 right once u_left > part_right. When both these conditions
3403 are met, we have completed the scan of the partition.
3405 Any elements which are between the pivot chunk and the
3406 uncompared elements should be less than the pivot value on
3407 the left side and greater than the pivot value on the right
3408 side (in fact, the goal of the whole algorithm is to arrange
3409 for that to be true and make the groups of less-than and
3410 greater-then elements into new partitions to sort again).
3412 As you marvel at the complexity of the code and wonder why it
3413 has to be so confusing. Consider some of the things this level
3414 of confusion brings:
3416 Once I do a compare, I squeeze every ounce of juice out of it. I
3417 never do compare calls I don't have to do, and I certainly never
3420 I also never swap any elements unless I can prove there is a
3421 good reason. Many sort algorithms will swap a known value with
3422 an uncompared value just to get things in the right place (or
3423 avoid complexity :-), but that uncompared value, once it gets
3424 compared, may then have to be swapped again. A lot of the
3425 complexity of this code is due to the fact that it never swaps
3426 anything except compared values, and it only swaps them when the
3427 compare shows they are out of position.
3429 int pc_left, pc_right;
3430 int u_right, u_left;
3434 pc_left = ((part_left + part_right) / 2);
3436 u_right = pc_left - 1;
3437 u_left = pc_right + 1;
3439 /* Qsort works best when the pivot value is also the median value
3440 in the partition (unfortunately you can't find the median value
3441 without first sorting :-), so to give the algorithm a helping
3442 hand, we pick 3 elements and sort them and use the median value
3443 of that tiny set as the pivot value.
3445 Some versions of qsort like to use the left middle and right as
3446 the 3 elements to sort so they can insure the ends of the
3447 partition will contain values which will stop the scan in the
3448 compare loop, but when you have to call an arbitrarily complex
3449 routine to do a compare, its really better to just keep track of
3450 array index values to know when you hit the edge of the
3451 partition and avoid the extra compare. An even better reason to
3452 avoid using a compare call is the fact that you can drop off the
3453 edge of the array if someone foolishly provides you with an
3454 unstable compare function that doesn't always provide consistent
3457 So, since it is simpler for us to compare the three adjacent
3458 elements in the middle of the partition, those are the ones we
3459 pick here (conveniently pointed at by u_right, pc_left, and
3460 u_left). The values of the left, center, and right elements
3461 are refered to as l c and r in the following comments.
3464 #ifdef QSORT_ORDER_GUESS
3467 s = qsort_cmp(u_right, pc_left);
3470 s = qsort_cmp(pc_left, u_left);
3471 /* if l < c, c < r - already in order - nothing to do */
3473 /* l < c, c == r - already in order, pc grows */
3475 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3477 /* l < c, c > r - need to know more */
3478 s = qsort_cmp(u_right, u_left);
3480 /* l < c, c > r, l < r - swap c & r to get ordered */
3481 qsort_swap(pc_left, u_left);
3482 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3483 } else if (s == 0) {
3484 /* l < c, c > r, l == r - swap c&r, grow pc */
3485 qsort_swap(pc_left, u_left);
3487 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3489 /* l < c, c > r, l > r - make lcr into rlc to get ordered */
3490 qsort_rotate(pc_left, u_right, u_left);
3491 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3494 } else if (s == 0) {
3496 s = qsort_cmp(pc_left, u_left);
3498 /* l == c, c < r - already in order, grow pc */
3500 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3501 } else if (s == 0) {
3502 /* l == c, c == r - already in order, grow pc both ways */
3505 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3507 /* l == c, c > r - swap l & r, grow pc */
3508 qsort_swap(u_right, u_left);
3510 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3514 s = qsort_cmp(pc_left, u_left);
3516 /* l > c, c < r - need to know more */
3517 s = qsort_cmp(u_right, u_left);
3519 /* l > c, c < r, l < r - swap l & c to get ordered */
3520 qsort_swap(u_right, pc_left);
3521 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3522 } else if (s == 0) {
3523 /* l > c, c < r, l == r - swap l & c, grow pc */
3524 qsort_swap(u_right, pc_left);
3526 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3528 /* l > c, c < r, l > r - rotate lcr into crl to order */
3529 qsort_rotate(u_right, pc_left, u_left);
3530 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3532 } else if (s == 0) {
3533 /* l > c, c == r - swap ends, grow pc */
3534 qsort_swap(u_right, u_left);
3536 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3538 /* l > c, c > r - swap ends to get in order */
3539 qsort_swap(u_right, u_left);
3540 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3543 /* We now know the 3 middle elements have been compared and
3544 arranged in the desired order, so we can shrink the uncompared
3549 qsort_all_asserts(pc_left, pc_right, u_left, u_right);
3551 /* The above massive nested if was the simple part :-). We now have
3552 the middle 3 elements ordered and we need to scan through the
3553 uncompared sets on either side, swapping elements that are on
3554 the wrong side or simply shuffling equal elements around to get
3555 all equal elements into the pivot chunk.
3559 int still_work_on_left;
3560 int still_work_on_right;
3562 /* Scan the uncompared values on the left. If I find a value
3563 equal to the pivot value, move it over so it is adjacent to
3564 the pivot chunk and expand the pivot chunk. If I find a value
3565 less than the pivot value, then just leave it - its already
3566 on the correct side of the partition. If I find a greater
3567 value, then stop the scan.
3569 while (still_work_on_left = (u_right >= part_left)) {
3570 s = qsort_cmp(u_right, pc_left);
3573 } else if (s == 0) {
3575 if (pc_left != u_right) {
3576 qsort_swap(u_right, pc_left);
3582 qsort_assert(u_right < pc_left);
3583 qsort_assert(pc_left <= pc_right);
3584 qsort_assert(qsort_cmp(u_right + 1, pc_left) <= 0);
3585 qsort_assert(qsort_cmp(pc_left, pc_right) == 0);
3588 /* Do a mirror image scan of uncompared values on the right
3590 while (still_work_on_right = (u_left <= part_right)) {
3591 s = qsort_cmp(pc_right, u_left);
3594 } else if (s == 0) {
3596 if (pc_right != u_left) {
3597 qsort_swap(pc_right, u_left);
3603 qsort_assert(u_left > pc_right);
3604 qsort_assert(pc_left <= pc_right);
3605 qsort_assert(qsort_cmp(pc_right, u_left - 1) <= 0);
3606 qsort_assert(qsort_cmp(pc_left, pc_right) == 0);
3609 if (still_work_on_left) {
3610 /* I know I have a value on the left side which needs to be
3611 on the right side, but I need to know more to decide
3612 exactly the best thing to do with it.
3614 if (still_work_on_right) {
3615 /* I know I have values on both side which are out of
3616 position. This is a big win because I kill two birds
3617 with one swap (so to speak). I can advance the
3618 uncompared pointers on both sides after swapping both
3619 of them into the right place.
3621 qsort_swap(u_right, u_left);
3624 qsort_all_asserts(pc_left, pc_right, u_left, u_right);
3626 /* I have an out of position value on the left, but the
3627 right is fully scanned, so I "slide" the pivot chunk
3628 and any less-than values left one to make room for the
3629 greater value over on the right. If the out of position
3630 value is immediately adjacent to the pivot chunk (there
3631 are no less-than values), I can do that with a swap,
3632 otherwise, I have to rotate one of the less than values
3633 into the former position of the out of position value
3634 and the right end of the pivot chunk into the left end
3638 if (pc_left == u_right) {
3639 qsort_swap(u_right, pc_right);
3640 qsort_all_asserts(pc_left, pc_right-1, u_left, u_right-1);
3642 qsort_rotate(u_right, pc_left, pc_right);
3643 qsort_all_asserts(pc_left, pc_right-1, u_left, u_right-1);
3648 } else if (still_work_on_right) {
3649 /* Mirror image of complex case above: I have an out of
3650 position value on the right, but the left is fully
3651 scanned, so I need to shuffle things around to make room
3652 for the right value on the left.
3655 if (pc_right == u_left) {
3656 qsort_swap(u_left, pc_left);
3657 qsort_all_asserts(pc_left+1, pc_right, u_left+1, u_right);
3659 qsort_rotate(pc_right, pc_left, u_left);
3660 qsort_all_asserts(pc_left+1, pc_right, u_left+1, u_right);
3665 /* No more scanning required on either side of partition,
3666 break out of loop and figure out next set of partitions
3672 /* The elements in the pivot chunk are now in the right place. They
3673 will never move or be compared again. All I have to do is decide
3674 what to do with the stuff to the left and right of the pivot
3677 Notes on the QSORT_ORDER_GUESS ifdef code:
3679 1. If I just built these partitions without swapping any (or
3680 very many) elements, there is a chance that the elements are
3681 already ordered properly (being properly ordered will
3682 certainly result in no swapping, but the converse can't be
3685 2. A (properly written) insertion sort will run faster on
3686 already ordered data than qsort will.
3688 3. Perhaps there is some way to make a good guess about
3689 switching to an insertion sort earlier than partition size 6
3690 (for instance - we could save the partition size on the stack
3691 and increase the size each time we find we didn't swap, thus
3692 switching to insertion sort earlier for partitions with a
3693 history of not swapping).
3695 4. Naturally, if I just switch right away, it will make
3696 artificial benchmarks with pure ascending (or descending)
3697 data look really good, but is that a good reason in general?
3701 #ifdef QSORT_ORDER_GUESS
3703 #if QSORT_ORDER_GUESS == 1
3704 qsort_break_even = (part_right - part_left) + 1;
3706 #if QSORT_ORDER_GUESS == 2
3707 qsort_break_even *= 2;
3709 #if QSORT_ORDER_GUESS == 3
3710 int prev_break = qsort_break_even;
3711 qsort_break_even *= qsort_break_even;
3712 if (qsort_break_even < prev_break) {
3713 qsort_break_even = (part_right - part_left) + 1;
3717 qsort_break_even = QSORT_BREAK_EVEN;
3721 if (part_left < pc_left) {
3722 /* There are elements on the left which need more processing.
3723 Check the right as well before deciding what to do.
3725 if (pc_right < part_right) {
3726 /* We have two partitions to be sorted. Stack the biggest one
3727 and process the smallest one on the next iteration. This
3728 minimizes the stack height by insuring that any additional
3729 stack entries must come from the smallest partition which
3730 (because it is smallest) will have the fewest
3731 opportunities to generate additional stack entries.
3733 if ((part_right - pc_right) > (pc_left - part_left)) {
3734 /* stack the right partition, process the left */
3735 partition_stack[next_stack_entry].left = pc_right + 1;
3736 partition_stack[next_stack_entry].right = part_right;
3737 #ifdef QSORT_ORDER_GUESS
3738 partition_stack[next_stack_entry].qsort_break_even = qsort_break_even;
3740 part_right = pc_left - 1;
3742 /* stack the left partition, process the right */
3743 partition_stack[next_stack_entry].left = part_left;
3744 partition_stack[next_stack_entry].right = pc_left - 1;
3745 #ifdef QSORT_ORDER_GUESS
3746 partition_stack[next_stack_entry].qsort_break_even = qsort_break_even;
3748 part_left = pc_right + 1;
3750 qsort_assert(next_stack_entry < QSORT_MAX_STACK);
3753 /* The elements on the left are the only remaining elements
3754 that need sorting, arrange for them to be processed as the
3757 part_right = pc_left - 1;
3759 } else if (pc_right < part_right) {
3760 /* There is only one chunk on the right to be sorted, make it
3761 the new partition and loop back around.
3763 part_left = pc_right + 1;
3765 /* This whole partition wound up in the pivot chunk, so
3766 we need to get a new partition off the stack.
3768 if (next_stack_entry == 0) {
3769 /* the stack is empty - we are done */
3773 part_left = partition_stack[next_stack_entry].left;
3774 part_right = partition_stack[next_stack_entry].right;
3775 #ifdef QSORT_ORDER_GUESS
3776 qsort_break_even = partition_stack[next_stack_entry].qsort_break_even;
3780 /* This partition is too small to fool with qsort complexity, just
3781 do an ordinary insertion sort to minimize overhead.
3784 /* Assume 1st element is in right place already, and start checking
3785 at 2nd element to see where it should be inserted.
3787 for (i = part_left + 1; i <= part_right; ++i) {
3789 /* Scan (backwards - just in case 'i' is already in right place)
3790 through the elements already sorted to see if the ith element
3791 belongs ahead of one of them.
3793 for (j = i - 1; j >= part_left; --j) {
3794 if (qsort_cmp(i, j) >= 0) {
3795 /* i belongs right after j
3802 /* Looks like we really need to move some things
3806 for (k = i - 1; k >= j; --k)
3807 array[k + 1] = array[k];
3812 /* That partition is now sorted, grab the next one, or get out
3813 of the loop if there aren't any more.
3816 if (next_stack_entry == 0) {
3817 /* the stack is empty - we are done */
3821 part_left = partition_stack[next_stack_entry].left;
3822 part_right = partition_stack[next_stack_entry].right;
3823 #ifdef QSORT_ORDER_GUESS
3824 qsort_break_even = partition_stack[next_stack_entry].qsort_break_even;
3829 /* Believe it or not, the array is sorted at this point! */