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->*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 void save_lines _((AV *array, SV *sv));
40 static I32 sortcv _((SV *a, SV *b));
41 static void qsortsv _((SV **array, size_t num_elts, I32 (*fun)(SV *a, SV *b)));
42 static OP *doeval _((int gimme, OP** startop));
51 cxix = dopoptosub(cxstack_ix);
55 switch (cxstack[cxix].blk_gimme) {
72 register PMOP *pm = (PMOP*)cLOGOP->op_other;
76 MAGIC *mg = Null(MAGIC*);
80 SV *sv = SvRV(tmpstr);
82 mg = mg_find(sv, 'r');
85 regexp *re = (regexp *)mg->mg_obj;
86 ReREFCNT_dec(pm->op_pmregexp);
87 pm->op_pmregexp = ReREFCNT_inc(re);
90 t = SvPV(tmpstr, len);
92 /* Check against the last compiled regexp. */
93 if (!pm->op_pmregexp || !pm->op_pmregexp->precomp ||
94 pm->op_pmregexp->prelen != len ||
95 memNE(pm->op_pmregexp->precomp, t, len))
97 if (pm->op_pmregexp) {
98 ReREFCNT_dec(pm->op_pmregexp);
99 pm->op_pmregexp = Null(REGEXP*); /* crucial if regcomp aborts */
102 pm->op_pmflags = pm->op_pmpermflags; /* reset case sensitivity */
103 pm->op_pmregexp = pregcomp(t, t + len, pm);
107 if (!pm->op_pmregexp->prelen && curpm)
109 else if (strEQ("\\s+", pm->op_pmregexp->precomp))
110 pm->op_pmflags |= PMf_WHITE;
112 if (pm->op_pmflags & PMf_KEEP) {
113 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
114 cLOGOP->op_first->op_next = op->op_next;
122 register PMOP *pm = (PMOP*) cLOGOP->op_other;
123 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
124 register SV *dstr = cx->sb_dstr;
125 register char *s = cx->sb_s;
126 register char *m = cx->sb_m;
127 char *orig = cx->sb_orig;
128 register REGEXP *rx = cx->sb_rx;
130 rxres_restore(&cx->sb_rxres, rx);
132 if (cx->sb_iters++) {
133 if (cx->sb_iters > cx->sb_maxiters)
134 DIE("Substitution loop");
136 if (!(cx->sb_rxtainted & 2) && SvTAINTED(TOPs))
137 cx->sb_rxtainted |= 2;
138 sv_catsv(dstr, POPs);
141 if (cx->sb_once || !regexec_flags(rx, s, cx->sb_strend, orig,
142 s == m, Nullsv, NULL,
143 cx->sb_safebase ? 0 : REXEC_COPY_STR))
145 SV *targ = cx->sb_targ;
146 sv_catpvn(dstr, s, cx->sb_strend - s);
148 TAINT_IF(cx->sb_rxtainted || RX_MATCH_TAINTED(rx));
149 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
151 (void)SvOOK_off(targ);
152 Safefree(SvPVX(targ));
153 SvPVX(targ) = SvPVX(dstr);
154 SvCUR_set(targ, SvCUR(dstr));
155 SvLEN_set(targ, SvLEN(dstr));
159 TAINT_IF(cx->sb_rxtainted & 1);
160 PUSHs(sv_2mortal(newSViv((I32)cx->sb_iters - 1)));
162 (void)SvPOK_only(targ);
163 TAINT_IF(cx->sb_rxtainted);
167 LEAVE_SCOPE(cx->sb_oldsave);
169 RETURNOP(pm->op_next);
172 if (rx->subbase && rx->subbase != orig) {
175 cx->sb_orig = orig = rx->subbase;
177 cx->sb_strend = s + (cx->sb_strend - m);
179 cx->sb_m = m = rx->startp[0];
180 sv_catpvn(dstr, s, m-s);
181 cx->sb_s = rx->endp[0];
182 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
183 rxres_save(&cx->sb_rxres, rx);
184 RETURNOP(pm->op_pmreplstart);
188 rxres_save(void **rsp, REGEXP *rx)
193 if (!p || p[1] < rx->nparens) {
194 i = 6 + rx->nparens * 2;
202 *p++ = (UV)rx->subbase;
203 rx->subbase = Nullch;
207 *p++ = (UV)rx->subbeg;
208 *p++ = (UV)rx->subend;
209 for (i = 0; i <= rx->nparens; ++i) {
210 *p++ = (UV)rx->startp[i];
211 *p++ = (UV)rx->endp[i];
216 rxres_restore(void **rsp, REGEXP *rx)
221 Safefree(rx->subbase);
222 rx->subbase = (char*)(*p);
227 rx->subbeg = (char*)(*p++);
228 rx->subend = (char*)(*p++);
229 for (i = 0; i <= rx->nparens; ++i) {
230 rx->startp[i] = (char*)(*p++);
231 rx->endp[i] = (char*)(*p++);
236 rxres_free(void **rsp)
241 Safefree((char*)(*p));
249 djSP; dMARK; dORIGMARK;
250 register SV *tmpForm = *++MARK;
262 bool chopspace = (strchr(chopset, ' ') != Nullch);
269 if (!SvMAGICAL(tmpForm) || !SvCOMPILED(tmpForm)) {
270 SvREADONLY_off(tmpForm);
271 doparseform(tmpForm);
274 SvPV_force(formtarget, len);
275 t = SvGROW(formtarget, len + SvCUR(tmpForm) + 1); /* XXX SvCUR bad */
277 f = SvPV(tmpForm, len);
278 /* need to jump to the next word */
279 s = f + len + WORD_ALIGN - SvCUR(tmpForm) % WORD_ALIGN;
288 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
289 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
290 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
291 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
292 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
294 case FF_CHECKNL: name = "CHECKNL"; break;
295 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
296 case FF_SPACE: name = "SPACE"; break;
297 case FF_HALFSPACE: name = "HALFSPACE"; break;
298 case FF_ITEM: name = "ITEM"; break;
299 case FF_CHOP: name = "CHOP"; break;
300 case FF_LINEGLOB: name = "LINEGLOB"; break;
301 case FF_NEWLINE: name = "NEWLINE"; break;
302 case FF_MORE: name = "MORE"; break;
303 case FF_LINEMARK: name = "LINEMARK"; break;
304 case FF_END: name = "END"; break;
307 PerlIO_printf(PerlIO_stderr(), "%-16s%ld\n", name, (long) arg);
309 PerlIO_printf(PerlIO_stderr(), "%-16s\n", name);
338 warn("Not enough format arguments");
343 item = s = SvPV(sv, len);
345 if (itemsize > fieldsize)
346 itemsize = fieldsize;
347 send = chophere = s + itemsize;
359 item = s = SvPV(sv, len);
361 if (itemsize <= fieldsize) {
362 send = chophere = s + itemsize;
373 itemsize = fieldsize;
374 send = chophere = s + itemsize;
375 while (s < send || (s == send && isSPACE(*s))) {
385 if (strchr(chopset, *s))
390 itemsize = chophere - item;
395 arg = fieldsize - itemsize;
404 arg = fieldsize - itemsize;
418 int ch = *t++ = *s++;
422 if ( !((*t++ = *s++) & ~31) )
432 while (*s && isSPACE(*s))
439 item = s = SvPV(sv, len);
452 SvCUR_set(formtarget, t - SvPVX(formtarget));
453 sv_catpvn(formtarget, item, itemsize);
454 SvGROW(formtarget, SvCUR(formtarget) + SvCUR(tmpForm) + 1);
455 t = SvPVX(formtarget) + SvCUR(formtarget);
460 /* If the field is marked with ^ and the value is undefined,
463 if ((arg & 512) && !SvOK(sv)) {
471 /* Formats aren't yet marked for locales, so assume "yes". */
474 sprintf(t, "%#*.*f", (int) fieldsize, (int) arg & 255, value);
476 sprintf(t, "%*.0f", (int) fieldsize, value);
483 while (t-- > linemark && *t == ' ') ;
491 if (arg) { /* repeat until fields exhausted? */
493 SvCUR_set(formtarget, t - SvPVX(formtarget));
494 lines += FmLINES(formtarget);
497 if (strnEQ(linemark, linemark - arg, arg))
498 DIE("Runaway format");
500 FmLINES(formtarget) = lines;
502 RETURNOP(cLISTOP->op_first);
513 arg = fieldsize - itemsize;
520 if (strnEQ(s," ",3)) {
521 while (s > SvPVX(formtarget) && isSPACE(s[-1]))
532 SvCUR_set(formtarget, t - SvPVX(formtarget));
533 FmLINES(formtarget) += lines;
545 if (stack_base + *markstack_ptr == SP) {
547 if (GIMME_V == G_SCALAR)
549 RETURNOP(op->op_next->op_next);
551 stack_sp = stack_base + *markstack_ptr + 1;
552 pp_pushmark(ARGS); /* push dst */
553 pp_pushmark(ARGS); /* push src */
554 ENTER; /* enter outer scope */
558 /* SAVE_DEFSV does *not* suffice here */
559 save_sptr(&THREADSV(0));
561 SAVESPTR(GvSV(defgv));
562 #endif /* USE_THREADS */
563 ENTER; /* enter inner scope */
566 src = stack_base[*markstack_ptr];
571 if (op->op_type == OP_MAPSTART)
572 pp_pushmark(ARGS); /* push top */
573 return ((LOGOP*)op->op_next)->op_other;
578 DIE("panic: mapstart"); /* uses grepstart */
584 I32 diff = (SP - stack_base) - *markstack_ptr;
592 if (diff > markstack_ptr[-1] - markstack_ptr[-2]) {
593 shift = diff - (markstack_ptr[-1] - markstack_ptr[-2]);
594 count = (SP - stack_base) - markstack_ptr[-1] + 2;
599 markstack_ptr[-1] += shift;
600 *markstack_ptr += shift;
604 dst = stack_base + (markstack_ptr[-2] += diff) - 1;
607 *dst-- = SvTEMP(TOPs) ? POPs : sv_mortalcopy(POPs);
609 LEAVE; /* exit inner scope */
612 if (markstack_ptr[-1] > *markstack_ptr) {
616 (void)POPMARK; /* pop top */
617 LEAVE; /* exit outer scope */
618 (void)POPMARK; /* pop src */
619 items = --*markstack_ptr - markstack_ptr[-1];
620 (void)POPMARK; /* pop dst */
621 SP = stack_base + POPMARK; /* pop original mark */
622 if (gimme == G_SCALAR) {
626 else if (gimme == G_ARRAY)
633 ENTER; /* enter inner scope */
636 src = stack_base[markstack_ptr[-1]];
640 RETURNOP(cLOGOP->op_other);
646 djSP; dMARK; dORIGMARK;
648 SV **myorigmark = ORIGMARK;
654 OP* nextop = op->op_next;
656 if (gimme != G_ARRAY) {
663 if (op->op_flags & OPf_STACKED) {
664 if (op->op_flags & OPf_SPECIAL) {
665 OP *kid = cLISTOP->op_first->op_sibling; /* pass pushmark */
666 kid = kUNOP->op_first; /* pass rv2gv */
667 kid = kUNOP->op_first; /* pass leave */
668 sortcop = kid->op_next;
669 stash = curcop->cop_stash;
672 cv = sv_2cv(*++MARK, &stash, &gv, 0);
673 if (!(cv && CvROOT(cv))) {
675 SV *tmpstr = sv_newmortal();
676 gv_efullname3(tmpstr, gv, Nullch);
677 if (cv && CvXSUB(cv))
678 DIE("Xsub \"%s\" called in sort", SvPVX(tmpstr));
679 DIE("Undefined sort subroutine \"%s\" called",
684 DIE("Xsub called in sort");
685 DIE("Undefined subroutine in sort");
687 DIE("Not a CODE reference in sort");
689 sortcop = CvSTART(cv);
690 SAVESPTR(CvROOT(cv)->op_ppaddr);
691 CvROOT(cv)->op_ppaddr = ppaddr[OP_NULL];
694 curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
699 stash = curcop->cop_stash;
703 while (MARK < SP) { /* This may or may not shift down one here. */
705 if (*up = *++MARK) { /* Weed out nulls. */
707 if (!sortcop && !SvPOK(*up))
708 (void)sv_2pv(*up, &na);
712 max = --up - myorigmark;
717 bool oldcatch = CATCH_GET;
724 if (sortstash != stash) {
725 firstgv = gv_fetchpv("a", TRUE, SVt_PV);
726 secondgv = gv_fetchpv("b", TRUE, SVt_PV);
730 SAVESPTR(GvSV(firstgv));
731 SAVESPTR(GvSV(secondgv));
733 PUSHBLOCK(cx, CXt_NULL, stack_base);
734 if (!(op->op_flags & OPf_SPECIAL)) {
735 bool hasargs = FALSE;
736 cx->cx_type = CXt_SUB;
737 cx->blk_gimme = G_SCALAR;
740 (void)SvREFCNT_inc(cv); /* in preparation for POPSUB */
742 sortcxix = cxstack_ix;
743 qsortsv((myorigmark+1), max, FUNC_NAME_TO_PTR(sortcv));
752 MEXTEND(SP, 20); /* Can't afford stack realloc on signal. */
753 qsortsv(ORIGMARK+1, max,
754 (op->op_private & OPpLOCALE)
755 ? FUNC_NAME_TO_PTR(sv_cmp_locale)
756 : FUNC_NAME_TO_PTR(sv_cmp));
760 stack_sp = ORIGMARK + max;
768 if (GIMME == G_ARRAY)
769 return cCONDOP->op_true;
770 return SvTRUEx(PAD_SV(op->op_targ)) ? cCONDOP->op_false : cCONDOP->op_true;
777 if (GIMME == G_ARRAY) {
778 RETURNOP(((CONDOP*)cUNOP->op_first)->op_false);
782 SV *targ = PAD_SV(op->op_targ);
784 if ((op->op_private & OPpFLIP_LINENUM)
785 ? last_in_gv && SvIV(sv) == IoLINES(GvIOp(last_in_gv))
787 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
788 if (op->op_flags & OPf_SPECIAL) {
796 RETURNOP(((CONDOP*)cUNOP->op_first)->op_false);
809 if (GIMME == G_ARRAY) {
815 if (SvNIOKp(left) || !SvPOKp(left) ||
816 (looks_like_number(left) && *SvPVX(left) != '0') )
821 EXTEND_MORTAL(max - i + 1);
822 EXTEND(SP, max - i + 1);
825 sv = sv_2mortal(newSViv(i++));
830 SV *final = sv_mortalcopy(right);
832 char *tmps = SvPV(final, len);
834 sv = sv_mortalcopy(left);
835 while (!SvNIOKp(sv) && SvCUR(sv) <= len &&
836 strNE(SvPVX(sv),tmps) ) {
838 sv = sv_2mortal(newSVsv(sv));
841 if (strEQ(SvPVX(sv),tmps))
847 SV *targ = PAD_SV(cUNOP->op_first->op_targ);
849 if ((op->op_private & OPpFLIP_LINENUM)
850 ? last_in_gv && SvIV(sv) == IoLINES(GvIOp(last_in_gv))
852 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
853 sv_catpv(targ, "E0");
864 dopoptolabel(char *label)
868 register PERL_CONTEXT *cx;
870 for (i = cxstack_ix; i >= 0; i--) {
872 switch (cx->cx_type) {
875 warn("Exiting substitution via %s", op_name[op->op_type]);
879 warn("Exiting subroutine via %s", op_name[op->op_type]);
883 warn("Exiting eval via %s", op_name[op->op_type]);
887 warn("Exiting pseudo-block via %s", op_name[op->op_type]);
890 if (!cx->blk_loop.label ||
891 strNE(label, cx->blk_loop.label) ) {
892 DEBUG_l(deb("(Skipping label #%ld %s)\n",
893 (long)i, cx->blk_loop.label));
896 DEBUG_l( deb("(Found label #%ld %s)\n", (long)i, label));
906 I32 gimme = block_gimme();
907 return (gimme == G_VOID) ? G_SCALAR : gimme;
916 cxix = dopoptosub(cxstack_ix);
920 switch (cxstack[cxix].blk_gimme) {
928 croak("panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
935 dopoptosub(I32 startingblock)
939 register PERL_CONTEXT *cx;
940 for (i = startingblock; i >= 0; i--) {
942 switch (cx->cx_type) {
947 DEBUG_l( deb("(Found sub #%ld)\n", (long)i));
955 dopoptoeval(I32 startingblock)
959 register PERL_CONTEXT *cx;
960 for (i = startingblock; i >= 0; i--) {
962 switch (cx->cx_type) {
966 DEBUG_l( deb("(Found eval #%ld)\n", (long)i));
974 dopoptoloop(I32 startingblock)
978 register PERL_CONTEXT *cx;
979 for (i = startingblock; i >= 0; i--) {
981 switch (cx->cx_type) {
984 warn("Exiting substitution via %s", op_name[op->op_type]);
988 warn("Exiting subroutine via %s", op_name[op->op_type]);
992 warn("Exiting eval via %s", op_name[op->op_type]);
996 warn("Exiting pseudo-block via %s", op_name[op->op_type]);
999 DEBUG_l( deb("(Found loop #%ld)\n", (long)i));
1010 register PERL_CONTEXT *cx;
1014 while (cxstack_ix > cxix) {
1015 cx = &cxstack[cxstack_ix];
1016 DEBUG_l(PerlIO_printf(Perl_debug_log, "Unwinding block %ld, type %s\n",
1017 (long) cxstack_ix, block_type[cx->cx_type]));
1018 /* Note: we don't need to restore the base context info till the end. */
1019 switch (cx->cx_type) {
1022 continue; /* not break */
1040 die_where(char *message)
1045 register PERL_CONTEXT *cx;
1052 STRLEN klen = strlen(message);
1054 svp = hv_fetch(ERRHV, message, klen, TRUE);
1057 static char prefix[] = "\t(in cleanup) ";
1059 sv_upgrade(*svp, SVt_IV);
1060 (void)SvIOK_only(*svp);
1063 SvGROW(err, SvCUR(err)+sizeof(prefix)+klen);
1064 sv_catpvn(err, prefix, sizeof(prefix)-1);
1065 sv_catpvn(err, message, klen);
1071 sv_setpv(ERRSV, message);
1074 message = SvPVx(ERRSV, na);
1076 while ((cxix = dopoptoeval(cxstack_ix)) < 0 && curstackinfo->si_prev) {
1084 if (cxix < cxstack_ix)
1088 if (cx->cx_type != CXt_EVAL) {
1089 PerlIO_printf(PerlIO_stderr(), "panic: die %s", message);
1094 if (gimme == G_SCALAR)
1095 *++newsp = &sv_undef;
1100 if (optype == OP_REQUIRE) {
1101 char* msg = SvPVx(ERRSV, na);
1102 DIE("%s", *msg ? msg : "Compilation failed in require");
1104 return pop_return();
1107 PerlIO_printf(PerlIO_stderr(), "%s",message);
1108 PerlIO_flush(PerlIO_stderr());
1117 if (SvTRUE(left) != SvTRUE(right))
1129 RETURNOP(cLOGOP->op_other);
1138 RETURNOP(cLOGOP->op_other);
1144 register I32 cxix = dopoptosub(cxstack_ix);
1145 register PERL_CONTEXT *cx;
1157 if (GIMME != G_ARRAY)
1161 if (DBsub && cxix >= 0 &&
1162 cxstack[cxix].blk_sub.cv == GvCV(DBsub))
1166 cxix = dopoptosub(cxix - 1);
1168 cx = &cxstack[cxix];
1169 if (cxstack[cxix].cx_type == CXt_SUB) {
1170 dbcxix = dopoptosub(cxix - 1);
1171 /* We expect that cxstack[dbcxix] is CXt_SUB, anyway, the
1172 field below is defined for any cx. */
1173 if (DBsub && dbcxix >= 0 && cxstack[dbcxix].blk_sub.cv == GvCV(DBsub))
1174 cx = &cxstack[dbcxix];
1177 if (GIMME != G_ARRAY) {
1178 hv = cx->blk_oldcop->cop_stash;
1183 sv_setpv(TARG, HvNAME(hv));
1189 hv = cx->blk_oldcop->cop_stash;
1193 PUSHs(sv_2mortal(newSVpv(HvNAME(hv), 0)));
1194 PUSHs(sv_2mortal(newSVpv(SvPVX(GvSV(cx->blk_oldcop->cop_filegv)), 0)));
1195 PUSHs(sv_2mortal(newSViv((I32)cx->blk_oldcop->cop_line)));
1198 if (cx->cx_type == CXt_SUB) { /* So is cxstack[dbcxix]. */
1200 gv_efullname3(sv, CvGV(cxstack[cxix].blk_sub.cv), Nullch);
1201 PUSHs(sv_2mortal(sv));
1202 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1205 PUSHs(sv_2mortal(newSVpv("(eval)",0)));
1206 PUSHs(sv_2mortal(newSViv(0)));
1208 gimme = (I32)cx->blk_gimme;
1209 if (gimme == G_VOID)
1212 PUSHs(sv_2mortal(newSViv(gimme & G_ARRAY)));
1213 if (cx->cx_type == CXt_EVAL) {
1214 if (cx->blk_eval.old_op_type == OP_ENTEREVAL) {
1215 PUSHs(cx->blk_eval.cur_text);
1218 else if (cx->blk_eval.old_name) { /* Try blocks have old_name == 0. */
1219 /* Require, put the name. */
1220 PUSHs(sv_2mortal(newSVpv(cx->blk_eval.old_name, 0)));
1224 else if (cx->cx_type == CXt_SUB &&
1225 cx->blk_sub.hasargs &&
1226 curcop->cop_stash == debstash)
1228 AV *ary = cx->blk_sub.argarray;
1229 int off = AvARRAY(ary) - AvALLOC(ary);
1233 dbargs = GvAV(gv_AVadd(tmpgv = gv_fetchpv("DB::args", TRUE,
1236 AvREAL_off(dbargs); /* XXX Should be REIFY */
1239 if (AvMAX(dbargs) < AvFILLp(ary) + off)
1240 av_extend(dbargs, AvFILLp(ary) + off);
1241 Copy(AvALLOC(ary), AvARRAY(dbargs), AvFILLp(ary) + 1 + off, SV*);
1242 AvFILLp(dbargs) = AvFILLp(ary) + off;
1248 sortcv(SV *a, SV *b)
1251 I32 oldsaveix = savestack_ix;
1252 I32 oldscopeix = scopestack_ix;
1256 stack_sp = stack_base;
1259 if (stack_sp != stack_base + 1)
1260 croak("Sort subroutine didn't return single value");
1261 if (!SvNIOKp(*stack_sp))
1262 croak("Sort subroutine didn't return a numeric value");
1263 result = SvIV(*stack_sp);
1264 while (scopestack_ix > oldscopeix) {
1267 leave_scope(oldsaveix);
1280 sv_reset(tmps, curcop->cop_stash);
1293 TAINT_NOT; /* Each statement is presumed innocent */
1294 stack_sp = stack_base + cxstack[cxstack_ix].blk_oldsp;
1297 if (op->op_private || SvIV(DBsingle) || SvIV(DBsignal) || SvIV(DBtrace))
1301 register PERL_CONTEXT *cx;
1302 I32 gimme = G_ARRAY;
1309 DIE("No DB::DB routine defined");
1311 if (CvDEPTH(cv) >= 1 && !(debug & (1<<30))) /* don't do recursive DB::DB call */
1323 push_return(op->op_next);
1324 PUSHBLOCK(cx, CXt_SUB, SP);
1327 (void)SvREFCNT_inc(cv);
1329 curpad = AvARRAY((AV*)*av_fetch(CvPADLIST(cv),1,FALSE));
1330 RETURNOP(CvSTART(cv));
1344 register PERL_CONTEXT *cx;
1345 I32 gimme = GIMME_V;
1352 if (op->op_flags & OPf_SPECIAL)
1353 svp = save_threadsv(op->op_targ); /* per-thread variable */
1355 #endif /* USE_THREADS */
1357 svp = &curpad[op->op_targ]; /* "my" variable */
1362 (void)save_scalar(gv);
1363 svp = &GvSV(gv); /* symbol table variable */
1368 PUSHBLOCK(cx, CXt_LOOP, SP);
1369 PUSHLOOP(cx, svp, MARK);
1370 if (op->op_flags & OPf_STACKED)
1371 cx->blk_loop.iterary = (AV*)SvREFCNT_inc(POPs);
1373 cx->blk_loop.iterary = curstack;
1374 AvFILLp(curstack) = SP - stack_base;
1375 cx->blk_loop.iterix = MARK - stack_base;
1384 register PERL_CONTEXT *cx;
1385 I32 gimme = GIMME_V;
1391 PUSHBLOCK(cx, CXt_LOOP, SP);
1392 PUSHLOOP(cx, 0, SP);
1400 register PERL_CONTEXT *cx;
1401 struct block_loop cxloop;
1409 POPLOOP1(cx); /* Delay POPLOOP2 until stack values are safe */
1412 if (gimme == G_VOID)
1414 else if (gimme == G_SCALAR) {
1416 *++newsp = sv_mortalcopy(*SP);
1418 *++newsp = &sv_undef;
1422 *++newsp = sv_mortalcopy(*++mark);
1423 TAINT_NOT; /* Each item is independent */
1429 POPLOOP2(); /* Stack values are safe: release loop vars ... */
1430 curpm = newpm; /* ... and pop $1 et al */
1442 register PERL_CONTEXT *cx;
1443 struct block_sub cxsub;
1444 bool popsub2 = FALSE;
1450 if (curstackinfo->si_type == SI_SORT) {
1451 if (cxstack_ix == sortcxix || dopoptosub(cxstack_ix) <= sortcxix) {
1452 if (cxstack_ix > sortcxix)
1454 AvARRAY(curstack)[1] = *SP;
1455 stack_sp = stack_base + 1;
1460 cxix = dopoptosub(cxstack_ix);
1462 DIE("Can't return outside a subroutine");
1463 if (cxix < cxstack_ix)
1467 switch (cx->cx_type) {
1469 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1474 if (optype == OP_REQUIRE &&
1475 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
1477 /* Unassume the success we assumed earlier. */
1478 char *name = cx->blk_eval.old_name;
1479 (void)hv_delete(GvHVn(incgv), name, strlen(name), G_DISCARD);
1480 DIE("%s did not return a true value", name);
1484 DIE("panic: return");
1488 if (gimme == G_SCALAR) {
1490 *++newsp = (popsub2 && SvTEMP(*SP))
1491 ? *SP : sv_mortalcopy(*SP);
1493 *++newsp = &sv_undef;
1495 else if (gimme == G_ARRAY) {
1496 while (++MARK <= SP) {
1497 *++newsp = (popsub2 && SvTEMP(*MARK))
1498 ? *MARK : sv_mortalcopy(*MARK);
1499 TAINT_NOT; /* Each item is independent */
1504 /* Stack values are safe: */
1506 POPSUB2(); /* release CV and @_ ... */
1508 curpm = newpm; /* ... and pop $1 et al */
1511 return pop_return();
1518 register PERL_CONTEXT *cx;
1519 struct block_loop cxloop;
1520 struct block_sub cxsub;
1527 SV **mark = stack_base + cxstack[cxstack_ix].blk_oldsp;
1529 if (op->op_flags & OPf_SPECIAL) {
1530 cxix = dopoptoloop(cxstack_ix);
1532 DIE("Can't \"last\" outside a block");
1535 cxix = dopoptolabel(cPVOP->op_pv);
1537 DIE("Label not found for \"last %s\"", cPVOP->op_pv);
1539 if (cxix < cxstack_ix)
1543 switch (cx->cx_type) {
1545 POPLOOP1(cx); /* Delay POPLOOP2 until stack values are safe */
1547 nextop = cxloop.last_op->op_next;
1550 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1552 nextop = pop_return();
1556 nextop = pop_return();
1563 if (gimme == G_SCALAR) {
1565 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*SP))
1566 ? *SP : sv_mortalcopy(*SP);
1568 *++newsp = &sv_undef;
1570 else if (gimme == G_ARRAY) {
1571 while (++MARK <= SP) {
1572 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*MARK))
1573 ? *MARK : sv_mortalcopy(*MARK);
1574 TAINT_NOT; /* Each item is independent */
1580 /* Stack values are safe: */
1583 POPLOOP2(); /* release loop vars ... */
1587 POPSUB2(); /* release CV and @_ ... */
1590 curpm = newpm; /* ... and pop $1 et al */
1599 register PERL_CONTEXT *cx;
1602 if (op->op_flags & OPf_SPECIAL) {
1603 cxix = dopoptoloop(cxstack_ix);
1605 DIE("Can't \"next\" outside a block");
1608 cxix = dopoptolabel(cPVOP->op_pv);
1610 DIE("Label not found for \"next %s\"", cPVOP->op_pv);
1612 if (cxix < cxstack_ix)
1616 oldsave = scopestack[scopestack_ix - 1];
1617 LEAVE_SCOPE(oldsave);
1618 return cx->blk_loop.next_op;
1624 register PERL_CONTEXT *cx;
1627 if (op->op_flags & OPf_SPECIAL) {
1628 cxix = dopoptoloop(cxstack_ix);
1630 DIE("Can't \"redo\" outside a block");
1633 cxix = dopoptolabel(cPVOP->op_pv);
1635 DIE("Label not found for \"redo %s\"", cPVOP->op_pv);
1637 if (cxix < cxstack_ix)
1641 oldsave = scopestack[scopestack_ix - 1];
1642 LEAVE_SCOPE(oldsave);
1643 return cx->blk_loop.redo_op;
1647 dofindlabel(OP *o, char *label, OP **opstack, OP **oplimit)
1651 static char too_deep[] = "Target of goto is too deeply nested";
1655 if (o->op_type == OP_LEAVE ||
1656 o->op_type == OP_SCOPE ||
1657 o->op_type == OP_LEAVELOOP ||
1658 o->op_type == OP_LEAVETRY)
1660 *ops++ = cUNOPo->op_first;
1665 if (o->op_flags & OPf_KIDS) {
1666 /* First try all the kids at this level, since that's likeliest. */
1667 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1668 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
1669 kCOP->cop_label && strEQ(kCOP->cop_label, label))
1672 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1673 if (kid == lastgotoprobe)
1675 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
1677 (ops[-1]->op_type != OP_NEXTSTATE &&
1678 ops[-1]->op_type != OP_DBSTATE)))
1680 if (o = dofindlabel(kid, label, ops, oplimit))
1690 return pp_goto(ARGS);
1699 register PERL_CONTEXT *cx;
1700 #define GOTO_DEPTH 64
1701 OP *enterops[GOTO_DEPTH];
1703 int do_dump = (op->op_type == OP_DUMP);
1706 if (op->op_flags & OPf_STACKED) {
1709 /* This egregious kludge implements goto &subroutine */
1710 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
1712 register PERL_CONTEXT *cx;
1713 CV* cv = (CV*)SvRV(sv);
1718 if (!CvROOT(cv) && !CvXSUB(cv)) {
1720 SV *tmpstr = sv_newmortal();
1721 gv_efullname3(tmpstr, CvGV(cv), Nullch);
1722 DIE("Goto undefined subroutine &%s",SvPVX(tmpstr));
1724 DIE("Goto undefined subroutine");
1727 /* First do some returnish stuff. */
1728 cxix = dopoptosub(cxstack_ix);
1730 DIE("Can't goto subroutine outside a subroutine");
1731 if (cxix < cxstack_ix)
1734 if (cx->cx_type == CXt_EVAL && cx->blk_eval.old_op_type == OP_ENTEREVAL)
1735 DIE("Can't goto subroutine from an eval-string");
1737 if (cx->cx_type == CXt_SUB &&
1738 cx->blk_sub.hasargs) { /* put @_ back onto stack */
1739 AV* av = cx->blk_sub.argarray;
1741 items = AvFILLp(av) + 1;
1743 EXTEND(stack_sp, items); /* @_ could have been extended. */
1744 Copy(AvARRAY(av), stack_sp, items, SV*);
1747 SvREFCNT_dec(GvAV(defgv));
1748 GvAV(defgv) = cx->blk_sub.savearray;
1749 #endif /* USE_THREADS */
1753 if (cx->cx_type == CXt_SUB &&
1754 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
1755 SvREFCNT_dec(cx->blk_sub.cv);
1756 oldsave = scopestack[scopestack_ix - 1];
1757 LEAVE_SCOPE(oldsave);
1759 /* Now do some callish stuff. */
1762 if (CvOLDSTYLE(cv)) {
1763 I32 (*fp3)_((int,int,int));
1768 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
1769 items = (*fp3)(CvXSUBANY(cv).any_i32,
1770 mark - stack_base + 1,
1772 SP = stack_base + items;
1775 stack_sp--; /* There is no cv arg. */
1776 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
1779 return pop_return();
1782 AV* padlist = CvPADLIST(cv);
1783 SV** svp = AvARRAY(padlist);
1784 if (cx->cx_type == CXt_EVAL) {
1785 in_eval = cx->blk_eval.old_in_eval;
1786 eval_root = cx->blk_eval.old_eval_root;
1787 cx->cx_type = CXt_SUB;
1788 cx->blk_sub.hasargs = 0;
1790 cx->blk_sub.cv = cv;
1791 cx->blk_sub.olddepth = CvDEPTH(cv);
1793 if (CvDEPTH(cv) < 2)
1794 (void)SvREFCNT_inc(cv);
1795 else { /* save temporaries on recursion? */
1796 if (CvDEPTH(cv) == 100 && dowarn)
1797 sub_crush_depth(cv);
1798 if (CvDEPTH(cv) > AvFILLp(padlist)) {
1799 AV *newpad = newAV();
1800 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
1801 I32 ix = AvFILLp((AV*)svp[1]);
1802 svp = AvARRAY(svp[0]);
1803 for ( ;ix > 0; ix--) {
1804 if (svp[ix] != &sv_undef) {
1805 char *name = SvPVX(svp[ix]);
1806 if ((SvFLAGS(svp[ix]) & SVf_FAKE)
1809 /* outer lexical or anon code */
1810 av_store(newpad, ix,
1811 SvREFCNT_inc(oldpad[ix]) );
1813 else { /* our own lexical */
1815 av_store(newpad, ix, sv = (SV*)newAV());
1816 else if (*name == '%')
1817 av_store(newpad, ix, sv = (SV*)newHV());
1819 av_store(newpad, ix, sv = NEWSV(0,0));
1824 av_store(newpad, ix, sv = NEWSV(0,0));
1828 if (cx->blk_sub.hasargs) {
1831 av_store(newpad, 0, (SV*)av);
1832 AvFLAGS(av) = AVf_REIFY;
1834 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
1835 AvFILLp(padlist) = CvDEPTH(cv);
1836 svp = AvARRAY(padlist);
1840 if (!cx->blk_sub.hasargs) {
1841 AV* av = (AV*)curpad[0];
1843 items = AvFILLp(av) + 1;
1845 /* Mark is at the end of the stack. */
1847 Copy(AvARRAY(av), SP + 1, items, SV*);
1852 #endif /* USE_THREADS */
1854 curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
1856 if (cx->blk_sub.hasargs)
1857 #endif /* USE_THREADS */
1859 AV* av = (AV*)curpad[0];
1863 cx->blk_sub.savearray = GvAV(defgv);
1864 GvAV(defgv) = (AV*)SvREFCNT_inc(av);
1865 #endif /* USE_THREADS */
1866 cx->blk_sub.argarray = av;
1869 if (items >= AvMAX(av) + 1) {
1871 if (AvARRAY(av) != ary) {
1872 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
1873 SvPVX(av) = (char*)ary;
1875 if (items >= AvMAX(av) + 1) {
1876 AvMAX(av) = items - 1;
1877 Renew(ary,items+1,SV*);
1879 SvPVX(av) = (char*)ary;
1882 Copy(mark,AvARRAY(av),items,SV*);
1883 AvFILLp(av) = items - 1;
1891 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
1893 * We do not care about using sv to call CV;
1894 * it's for informational purposes only.
1896 SV *sv = GvSV(DBsub);
1899 if (PERLDB_SUB_NN) {
1900 SvIVX(sv) = (IV)cv; /* Already upgraded, saved */
1903 gv_efullname3(sv, CvGV(cv), Nullch);
1906 && (gotocv = perl_get_cv("DB::goto", FALSE)) ) {
1907 PUSHMARK( stack_sp );
1908 perl_call_sv((SV*)gotocv, G_SCALAR | G_NODEBUG);
1912 RETURNOP(CvSTART(cv));
1916 label = SvPV(sv,na);
1918 else if (op->op_flags & OPf_SPECIAL) {
1920 DIE("goto must have label");
1923 label = cPVOP->op_pv;
1925 if (label && *label) {
1932 for (ix = cxstack_ix; ix >= 0; ix--) {
1934 switch (cx->cx_type) {
1936 gotoprobe = eval_root; /* XXX not good for nested eval */
1939 gotoprobe = cx->blk_oldcop->op_sibling;
1945 gotoprobe = cx->blk_oldcop->op_sibling;
1947 gotoprobe = main_root;
1950 if (CvDEPTH(cx->blk_sub.cv)) {
1951 gotoprobe = CvROOT(cx->blk_sub.cv);
1956 DIE("Can't \"goto\" outside a block");
1960 gotoprobe = main_root;
1963 retop = dofindlabel(gotoprobe, label,
1964 enterops, enterops + GOTO_DEPTH);
1967 lastgotoprobe = gotoprobe;
1970 DIE("Can't find label %s", label);
1972 /* pop unwanted frames */
1974 if (ix < cxstack_ix) {
1981 oldsave = scopestack[scopestack_ix];
1982 LEAVE_SCOPE(oldsave);
1985 /* push wanted frames */
1987 if (*enterops && enterops[1]) {
1989 for (ix = 1; enterops[ix]; ix++) {
1991 /* Eventually we may want to stack the needed arguments
1992 * for each op. For now, we punt on the hard ones. */
1993 if (op->op_type == OP_ENTERITER)
1994 DIE("Can't \"goto\" into the middle of a foreach loop",
1996 (CALLOP->op_ppaddr)(ARGS);
2004 if (!retop) retop = main_start;
2011 restartop = 0; /* hmm, must be GNU unexec().. */
2015 if (top_env->je_prev) {
2033 if (anum == 1 && VMSISH_EXIT)
2046 double value = SvNVx(GvSV(cCOP->cop_gv));
2047 register I32 match = I_32(value);
2050 if (((double)match) > value)
2051 --match; /* was fractional--truncate other way */
2053 match -= cCOP->uop.scop.scop_offset;
2056 else if (match > cCOP->uop.scop.scop_max)
2057 match = cCOP->uop.scop.scop_max;
2058 op = cCOP->uop.scop.scop_next[match];
2068 op = op->op_next; /* can't assume anything */
2070 match = *(SvPVx(GvSV(cCOP->cop_gv), na)) & 255;
2071 match -= cCOP->uop.scop.scop_offset;
2074 else if (match > cCOP->uop.scop.scop_max)
2075 match = cCOP->uop.scop.scop_max;
2076 op = cCOP->uop.scop.scop_next[match];
2085 save_lines(AV *array, SV *sv)
2087 register char *s = SvPVX(sv);
2088 register char *send = SvPVX(sv) + SvCUR(sv);
2090 register I32 line = 1;
2092 while (s && s < send) {
2093 SV *tmpstr = NEWSV(85,0);
2095 sv_upgrade(tmpstr, SVt_PVMG);
2096 t = strchr(s, '\n');
2102 sv_setpvn(tmpstr, s, t - s);
2103 av_store(array, line++, tmpstr);
2118 assert(CATCH_GET == TRUE);
2119 DEBUG_l(deb("Setting up local jumplevel %p, was %p\n", &cur_env, top_env));
2123 default: /* topmost level handles it */
2130 PerlIO_printf(PerlIO_stderr(), "panic: restartop\n");
2146 sv_compile_2op(SV *sv, OP** startop, char *code, AV** avp)
2147 /* sv Text to convert to OP tree. */
2148 /* startop op_free() this to undo. */
2149 /* code Short string id of the caller. */
2151 dSP; /* Make POPBLOCK work. */
2154 I32 gimme = 0; /* SUSPECT - INITIALZE TO WHAT? NI-S */
2158 char tmpbuf[TYPE_DIGITS(long) + 12 + 10];
2164 /* switch to eval mode */
2166 SAVESPTR(compiling.cop_filegv);
2167 SAVEI16(compiling.cop_line);
2168 sprintf(tmpbuf, "_<(%.10s_eval %lu)", code, (unsigned long)++evalseq);
2169 compiling.cop_filegv = gv_fetchfile(tmpbuf+2);
2170 compiling.cop_line = 1;
2171 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
2172 deleting the eval's FILEGV from the stash before gv_check() runs
2173 (i.e. before run-time proper). To work around the coredump that
2174 ensues, we always turn GvMULTI_on for any globals that were
2175 introduced within evals. See force_ident(). GSAR 96-10-12 */
2176 safestr = savepv(tmpbuf);
2177 SAVEDELETE(defstash, safestr, strlen(safestr));
2179 #ifdef OP_IN_REGISTER
2187 op->op_type = 0; /* Avoid uninit warning. */
2188 op->op_flags = 0; /* Avoid uninit warning. */
2189 PUSHBLOCK(cx, CXt_EVAL, SP);
2190 PUSHEVAL(cx, 0, compiling.cop_filegv);
2191 rop = doeval(G_SCALAR, startop);
2195 (*startop)->op_type = OP_NULL;
2196 (*startop)->op_ppaddr = ppaddr[OP_NULL];
2198 *avp = (AV*)SvREFCNT_inc(comppad);
2200 #ifdef OP_IN_REGISTER
2206 /* With USE_THREADS, eval_owner must be held on entry to doeval */
2208 doeval(int gimme, OP** startop)
2221 /* set up a scratch pad */
2226 SAVESPTR(comppad_name);
2227 SAVEI32(comppad_name_fill);
2228 SAVEI32(min_intro_pending);
2229 SAVEI32(max_intro_pending);
2232 for (i = cxstack_ix - 1; i >= 0; i--) {
2233 PERL_CONTEXT *cx = &cxstack[i];
2234 if (cx->cx_type == CXt_EVAL)
2236 else if (cx->cx_type == CXt_SUB) {
2237 caller = cx->blk_sub.cv;
2243 compcv = (CV*)NEWSV(1104,0);
2244 sv_upgrade((SV *)compcv, SVt_PVCV);
2245 CvUNIQUE_on(compcv);
2247 CvOWNER(compcv) = 0;
2248 New(666, CvMUTEXP(compcv), 1, perl_mutex);
2249 MUTEX_INIT(CvMUTEXP(compcv));
2250 #endif /* USE_THREADS */
2253 av_push(comppad, Nullsv);
2254 curpad = AvARRAY(comppad);
2255 comppad_name = newAV();
2256 comppad_name_fill = 0;
2257 min_intro_pending = 0;
2260 av_store(comppad_name, 0, newSVpv("@_", 2));
2261 curpad[0] = (SV*)newAV();
2262 SvPADMY_on(curpad[0]); /* XXX Needed? */
2263 #endif /* USE_THREADS */
2265 comppadlist = newAV();
2266 AvREAL_off(comppadlist);
2267 av_store(comppadlist, 0, (SV*)comppad_name);
2268 av_store(comppadlist, 1, (SV*)comppad);
2269 CvPADLIST(compcv) = comppadlist;
2271 if (!saveop || saveop->op_type != OP_REQUIRE)
2272 CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc(caller);
2276 /* make sure we compile in the right package */
2278 newstash = curcop->cop_stash;
2279 if (curstash != newstash) {
2281 curstash = newstash;
2285 SAVEFREESV(beginav);
2287 /* try to compile it */
2291 curcop = &compiling;
2292 curcop->cop_arybase = 0;
2294 rs = newSVpv("\n", 1);
2295 if (saveop && saveop->op_flags & OPf_SPECIAL)
2299 if (yyparse() || error_count || !eval_root) {
2303 I32 optype = 0; /* Might be reset by POPEVAL. */
2310 SP = stack_base + POPMARK; /* pop original mark */
2318 if (optype == OP_REQUIRE) {
2319 char* msg = SvPVx(ERRSV, na);
2320 DIE("%s", *msg ? msg : "Compilation failed in require");
2321 } else if (startop) {
2322 char* msg = SvPVx(ERRSV, na);
2326 croak("%sCompilation failed in regexp", (*msg ? msg : "Unknown error\n"));
2329 rs = SvREFCNT_inc(nrs);
2331 MUTEX_LOCK(&eval_mutex);
2333 COND_SIGNAL(&eval_cond);
2334 MUTEX_UNLOCK(&eval_mutex);
2335 #endif /* USE_THREADS */
2339 rs = SvREFCNT_inc(nrs);
2340 compiling.cop_line = 0;
2342 *startop = eval_root;
2343 SvREFCNT_dec(CvOUTSIDE(compcv));
2344 CvOUTSIDE(compcv) = Nullcv;
2346 SAVEFREEOP(eval_root);
2348 scalarvoid(eval_root);
2349 else if (gimme & G_ARRAY)
2354 DEBUG_x(dump_eval());
2356 /* Register with debugger: */
2357 if (PERLDB_INTER && saveop->op_type == OP_REQUIRE) {
2358 CV *cv = perl_get_cv("DB::postponed", FALSE);
2362 XPUSHs((SV*)compiling.cop_filegv);
2364 perl_call_sv((SV*)cv, G_DISCARD);
2368 /* compiled okay, so do it */
2370 CvDEPTH(compcv) = 1;
2371 SP = stack_base + POPMARK; /* pop original mark */
2372 op = saveop; /* The caller may need it. */
2374 MUTEX_LOCK(&eval_mutex);
2376 COND_SIGNAL(&eval_cond);
2377 MUTEX_UNLOCK(&eval_mutex);
2378 #endif /* USE_THREADS */
2380 RETURNOP(eval_start);
2386 register PERL_CONTEXT *cx;
2391 SV *namesv = Nullsv;
2393 I32 gimme = G_SCALAR;
2394 PerlIO *tryrsfp = 0;
2397 if (SvNIOKp(sv) && !SvPOKp(sv)) {
2398 SET_NUMERIC_STANDARD();
2399 if (atof(patchlevel) + 0.00000999 < SvNV(sv))
2400 DIE("Perl %s required--this is only version %s, stopped",
2401 SvPV(sv,na),patchlevel);
2404 name = SvPV(sv, len);
2405 if (!(name && len > 0 && *name))
2406 DIE("Null filename used");
2407 TAINT_PROPER("require");
2408 if (op->op_type == OP_REQUIRE &&
2409 (svp = hv_fetch(GvHVn(incgv), name, len, 0)) &&
2413 /* prepare to compile file */
2418 (name[1] == '.' && name[2] == '/')))
2420 || (name[0] && name[1] == ':')
2423 || (name[0] == '\\' && name[1] == '\\') /* UNC path */
2426 || (strchr(name,':') || ((*name == '[' || *name == '<') &&
2427 (isALNUM(name[1]) || strchr("$-_]>",name[1]))))
2432 tryrsfp = PerlIO_open(name,PERL_SCRIPT_MODE);
2435 AV *ar = GvAVn(incgv);
2439 if ((unixname = tounixspec(name, Nullch)) != Nullch)
2442 namesv = NEWSV(806, 0);
2443 for (i = 0; i <= AvFILL(ar); i++) {
2444 char *dir = SvPVx(*av_fetch(ar, i, TRUE), na);
2447 if ((unixdir = tounixpath(dir, Nullch)) == Nullch)
2449 sv_setpv(namesv, unixdir);
2450 sv_catpv(namesv, unixname);
2452 sv_setpvf(namesv, "%s/%s", dir, name);
2454 tryname = SvPVX(namesv);
2455 tryrsfp = PerlIO_open(tryname, PERL_SCRIPT_MODE);
2457 if (tryname[0] == '.' && tryname[1] == '/')
2464 SAVESPTR(compiling.cop_filegv);
2465 compiling.cop_filegv = gv_fetchfile(tryrsfp ? tryname : name);
2466 SvREFCNT_dec(namesv);
2468 if (op->op_type == OP_REQUIRE) {
2469 SV *msg = sv_2mortal(newSVpvf("Can't locate %s in @INC", name));
2470 SV *dirmsgsv = NEWSV(0, 0);
2471 AV *ar = GvAVn(incgv);
2473 if (instr(SvPVX(msg), ".h "))
2474 sv_catpv(msg, " (change .h to .ph maybe?)");
2475 if (instr(SvPVX(msg), ".ph "))
2476 sv_catpv(msg, " (did you run h2ph?)");
2477 sv_catpv(msg, " (@INC contains:");
2478 for (i = 0; i <= AvFILL(ar); i++) {
2479 char *dir = SvPVx(*av_fetch(ar, i, TRUE), na);
2480 sv_setpvf(dirmsgsv, " %s", dir);
2481 sv_catsv(msg, dirmsgsv);
2483 sv_catpvn(msg, ")", 1);
2484 SvREFCNT_dec(dirmsgsv);
2491 /* Assume success here to prevent recursive requirement. */
2492 (void)hv_store(GvHVn(incgv), name, strlen(name),
2493 newSVsv(GvSV(compiling.cop_filegv)), 0 );
2497 lex_start(sv_2mortal(newSVpv("",0)));
2499 save_aptr(&rsfp_filters);
2500 rsfp_filters = NULL;
2504 name = savepv(name);
2509 /* switch to eval mode */
2511 push_return(op->op_next);
2512 PUSHBLOCK(cx, CXt_EVAL, SP);
2513 PUSHEVAL(cx, name, compiling.cop_filegv);
2515 compiling.cop_line = 0;
2519 MUTEX_LOCK(&eval_mutex);
2520 if (eval_owner && eval_owner != thr)
2522 COND_WAIT(&eval_cond, &eval_mutex);
2524 MUTEX_UNLOCK(&eval_mutex);
2525 #endif /* USE_THREADS */
2526 return DOCATCH(doeval(G_SCALAR, NULL));
2531 return pp_require(ARGS);
2537 register PERL_CONTEXT *cx;
2539 I32 gimme = GIMME_V, was = sub_generation;
2540 char tmpbuf[TYPE_DIGITS(long) + 12];
2545 if (!SvPV(sv,len) || !len)
2547 TAINT_PROPER("eval");
2553 /* switch to eval mode */
2555 SAVESPTR(compiling.cop_filegv);
2556 sprintf(tmpbuf, "_<(eval %lu)", (unsigned long)++evalseq);
2557 compiling.cop_filegv = gv_fetchfile(tmpbuf+2);
2558 compiling.cop_line = 1;
2559 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
2560 deleting the eval's FILEGV from the stash before gv_check() runs
2561 (i.e. before run-time proper). To work around the coredump that
2562 ensues, we always turn GvMULTI_on for any globals that were
2563 introduced within evals. See force_ident(). GSAR 96-10-12 */
2564 safestr = savepv(tmpbuf);
2565 SAVEDELETE(defstash, safestr, strlen(safestr));
2567 hints = op->op_targ;
2569 push_return(op->op_next);
2570 PUSHBLOCK(cx, CXt_EVAL, SP);
2571 PUSHEVAL(cx, 0, compiling.cop_filegv);
2573 /* prepare to compile string */
2575 if (PERLDB_LINE && curstash != debstash)
2576 save_lines(GvAV(compiling.cop_filegv), linestr);
2579 MUTEX_LOCK(&eval_mutex);
2580 if (eval_owner && eval_owner != thr)
2582 COND_WAIT(&eval_cond, &eval_mutex);
2584 MUTEX_UNLOCK(&eval_mutex);
2585 #endif /* USE_THREADS */
2586 ret = doeval(gimme, NULL);
2587 if (PERLDB_INTER && was != sub_generation /* Some subs defined here. */
2588 && ret != op->op_next) { /* Successive compilation. */
2589 strcpy(safestr, "_<(eval )"); /* Anything fake and short. */
2591 return DOCATCH(ret);
2601 register PERL_CONTEXT *cx;
2603 U8 save_flags = op -> op_flags;
2608 retop = pop_return();
2611 if (gimme == G_VOID)
2613 else if (gimme == G_SCALAR) {
2616 if (SvFLAGS(TOPs) & SVs_TEMP)
2619 *MARK = sv_mortalcopy(TOPs);
2627 /* in case LEAVE wipes old return values */
2628 for (mark = newsp + 1; mark <= SP; mark++) {
2629 if (!(SvFLAGS(*mark) & SVs_TEMP)) {
2630 *mark = sv_mortalcopy(*mark);
2631 TAINT_NOT; /* Each item is independent */
2635 curpm = newpm; /* Don't pop $1 et al till now */
2638 * Closures mentioned at top level of eval cannot be referenced
2639 * again, and their presence indirectly causes a memory leak.
2640 * (Note that the fact that compcv and friends are still set here
2641 * is, AFAIK, an accident.) --Chip
2643 if (AvFILLp(comppad_name) >= 0) {
2644 SV **svp = AvARRAY(comppad_name);
2646 for (ix = AvFILLp(comppad_name); ix >= 0; ix--) {
2648 if (sv && sv != &sv_undef && *SvPVX(sv) == '&') {
2650 svp[ix] = &sv_undef;
2654 SvREFCNT_dec(CvOUTSIDE(sv));
2655 CvOUTSIDE(sv) = Nullcv;
2668 assert(CvDEPTH(compcv) == 1);
2670 CvDEPTH(compcv) = 0;
2673 if (optype == OP_REQUIRE &&
2674 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
2676 /* Unassume the success we assumed earlier. */
2677 char *name = cx->blk_eval.old_name;
2678 (void)hv_delete(GvHVn(incgv), name, strlen(name), G_DISCARD);
2679 retop = die("%s did not return a true value", name);
2680 /* die_where() did LEAVE, or we won't be here */
2684 if (!(save_flags & OPf_SPECIAL))
2694 register PERL_CONTEXT *cx;
2695 I32 gimme = GIMME_V;
2700 push_return(cLOGOP->op_other->op_next);
2701 PUSHBLOCK(cx, CXt_EVAL, SP);
2703 eval_root = op; /* Only needed so that goto works right. */
2708 return DOCATCH(op->op_next);
2718 register PERL_CONTEXT *cx;
2726 if (gimme == G_VOID)
2728 else if (gimme == G_SCALAR) {
2731 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
2734 *MARK = sv_mortalcopy(TOPs);
2743 /* in case LEAVE wipes old return values */
2744 for (mark = newsp + 1; mark <= SP; mark++) {
2745 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
2746 *mark = sv_mortalcopy(*mark);
2747 TAINT_NOT; /* Each item is independent */
2751 curpm = newpm; /* Don't pop $1 et al till now */
2762 register char *s = SvPV_force(sv, len);
2763 register char *send = s + len;
2764 register char *base;
2765 register I32 skipspaces = 0;
2768 bool postspace = FALSE;
2776 croak("Null picture in formline");
2778 New(804, fops, (send - s)*3+10, U16); /* Almost certainly too long... */
2783 *fpc++ = FF_LINEMARK;
2784 noblank = repeat = FALSE;
2802 case ' ': case '\t':
2813 *fpc++ = FF_LITERAL;
2821 *fpc++ = skipspaces;
2825 *fpc++ = FF_NEWLINE;
2829 arg = fpc - linepc + 1;
2836 *fpc++ = FF_LINEMARK;
2837 noblank = repeat = FALSE;
2846 ischop = s[-1] == '^';
2852 arg = (s - base) - 1;
2854 *fpc++ = FF_LITERAL;
2863 *fpc++ = FF_LINEGLOB;
2865 else if (*s == '#' || (*s == '.' && s[1] == '#')) {
2866 arg = ischop ? 512 : 0;
2876 arg |= 256 + (s - f);
2878 *fpc++ = s - base; /* fieldsize for FETCH */
2879 *fpc++ = FF_DECIMAL;
2884 bool ismore = FALSE;
2887 while (*++s == '>') ;
2888 prespace = FF_SPACE;
2890 else if (*s == '|') {
2891 while (*++s == '|') ;
2892 prespace = FF_HALFSPACE;
2897 while (*++s == '<') ;
2900 if (*s == '.' && s[1] == '.' && s[2] == '.') {
2904 *fpc++ = s - base; /* fieldsize for FETCH */
2906 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
2924 { /* need to jump to the next word */
2926 z = WORD_ALIGN - SvCUR(sv) % WORD_ALIGN;
2927 SvGROW(sv, SvCUR(sv) + z + arg * sizeof(U16) + 4);
2928 s = SvPVX(sv) + SvCUR(sv) + z;
2930 Copy(fops, s, arg, U16);
2932 sv_magic(sv, Nullsv, 'f', Nullch, 0);
2937 * The rest of this file was derived from source code contributed
2940 * NOTE: this code was derived from Tom Horsley's qsort replacement
2941 * and should not be confused with the original code.
2944 /* Copyright (C) Tom Horsley, 1997. All rights reserved.
2946 Permission granted to distribute under the same terms as perl which are
2949 This program is free software; you can redistribute it and/or modify
2950 it under the terms of either:
2952 a) the GNU General Public License as published by the Free
2953 Software Foundation; either version 1, or (at your option) any
2956 b) the "Artistic License" which comes with this Kit.
2958 Details on the perl license can be found in the perl source code which
2959 may be located via the www.perl.com web page.
2961 This is the most wonderfulest possible qsort I can come up with (and
2962 still be mostly portable) My (limited) tests indicate it consistently
2963 does about 20% fewer calls to compare than does the qsort in the Visual
2964 C++ library, other vendors may vary.
2966 Some of the ideas in here can be found in "Algorithms" by Sedgewick,
2967 others I invented myself (or more likely re-invented since they seemed
2968 pretty obvious once I watched the algorithm operate for a while).
2970 Most of this code was written while watching the Marlins sweep the Giants
2971 in the 1997 National League Playoffs - no Braves fans allowed to use this
2972 code (just kidding :-).
2974 I realize that if I wanted to be true to the perl tradition, the only
2975 comment in this file would be something like:
2977 ...they shuffled back towards the rear of the line. 'No, not at the
2978 rear!' the slave-driver shouted. 'Three files up. And stay there...
2980 However, I really needed to violate that tradition just so I could keep
2981 track of what happens myself, not to mention some poor fool trying to
2982 understand this years from now :-).
2985 /* ********************************************************** Configuration */
2987 #ifndef QSORT_ORDER_GUESS
2988 #define QSORT_ORDER_GUESS 2 /* Select doubling version of the netBSD trick */
2991 /* QSORT_MAX_STACK is the largest number of partitions that can be stacked up for
2992 future processing - a good max upper bound is log base 2 of memory size
2993 (32 on 32 bit machines, 64 on 64 bit machines, etc). In reality can
2994 safely be smaller than that since the program is taking up some space and
2995 most operating systems only let you grab some subset of contiguous
2996 memory (not to mention that you are normally sorting data larger than
2997 1 byte element size :-).
2999 #ifndef QSORT_MAX_STACK
3000 #define QSORT_MAX_STACK 32
3003 /* QSORT_BREAK_EVEN is the size of the largest partition we should insertion sort.
3004 Anything bigger and we use qsort. If you make this too small, the qsort
3005 will probably break (or become less efficient), because it doesn't expect
3006 the middle element of a partition to be the same as the right or left -
3007 you have been warned).
3009 #ifndef QSORT_BREAK_EVEN
3010 #define QSORT_BREAK_EVEN 6
3013 /* ************************************************************* Data Types */
3015 /* hold left and right index values of a partition waiting to be sorted (the
3016 partition includes both left and right - right is NOT one past the end or
3017 anything like that).
3019 struct partition_stack_entry {
3022 #ifdef QSORT_ORDER_GUESS
3023 int qsort_break_even;
3027 /* ******************************************************* Shorthand Macros */
3029 /* Note that these macros will be used from inside the qsort function where
3030 we happen to know that the variable 'elt_size' contains the size of an
3031 array element and the variable 'temp' points to enough space to hold a
3032 temp element and the variable 'array' points to the array being sorted
3033 and 'compare' is the pointer to the compare routine.
3035 Also note that there are very many highly architecture specific ways
3036 these might be sped up, but this is simply the most generally portable
3037 code I could think of.
3040 /* Return < 0 == 0 or > 0 as the value of elt1 is < elt2, == elt2, > elt2
3043 #define qsort_cmp(elt1, elt2) \
3044 ((this->*compare)(array[elt1], array[elt2]))
3046 #define qsort_cmp(elt1, elt2) \
3047 ((*compare)(array[elt1], array[elt2]))
3050 #ifdef QSORT_ORDER_GUESS
3051 #define QSORT_NOTICE_SWAP swapped++;
3053 #define QSORT_NOTICE_SWAP
3056 /* swaps contents of array elements elt1, elt2.
3058 #define qsort_swap(elt1, elt2) \
3061 temp = array[elt1]; \
3062 array[elt1] = array[elt2]; \
3063 array[elt2] = temp; \
3066 /* rotate contents of elt1, elt2, elt3 such that elt1 gets elt2, elt2 gets
3067 elt3 and elt3 gets elt1.
3069 #define qsort_rotate(elt1, elt2, elt3) \
3072 temp = array[elt1]; \
3073 array[elt1] = array[elt2]; \
3074 array[elt2] = array[elt3]; \
3075 array[elt3] = temp; \
3078 /* ************************************************************ Debug stuff */
3085 return; /* good place to set a breakpoint */
3088 #define qsort_assert(t) (void)( (t) || (break_here(), 0) )
3091 doqsort_all_asserts(
3095 int (*compare)(const void * elt1, const void * elt2),
3096 int pc_left, int pc_right, int u_left, int u_right)
3100 qsort_assert(pc_left <= pc_right);
3101 qsort_assert(u_right < pc_left);
3102 qsort_assert(pc_right < u_left);
3103 for (i = u_right + 1; i < pc_left; ++i) {
3104 qsort_assert(qsort_cmp(i, pc_left) < 0);
3106 for (i = pc_left; i < pc_right; ++i) {
3107 qsort_assert(qsort_cmp(i, pc_right) == 0);
3109 for (i = pc_right + 1; i < u_left; ++i) {
3110 qsort_assert(qsort_cmp(pc_right, i) < 0);
3114 #define qsort_all_asserts(PC_LEFT, PC_RIGHT, U_LEFT, U_RIGHT) \
3115 doqsort_all_asserts(array, num_elts, elt_size, compare, \
3116 PC_LEFT, PC_RIGHT, U_LEFT, U_RIGHT)
3120 #define qsort_assert(t) ((void)0)
3122 #define qsort_all_asserts(PC_LEFT, PC_RIGHT, U_LEFT, U_RIGHT) ((void)0)
3126 /* ****************************************************************** qsort */
3130 qsortsv(SV ** array, size_t num_elts, SVCOMPARE compare)
3135 I32 (*compare)(SV *a, SV *b))
3140 struct partition_stack_entry partition_stack[QSORT_MAX_STACK];
3141 int next_stack_entry = 0;
3145 #ifdef QSORT_ORDER_GUESS
3146 int qsort_break_even;
3150 /* Make sure we actually have work to do.
3152 if (num_elts <= 1) {
3156 /* Setup the initial partition definition and fall into the sorting loop
3159 part_right = (int)(num_elts - 1);
3160 #ifdef QSORT_ORDER_GUESS
3161 qsort_break_even = QSORT_BREAK_EVEN;
3163 #define qsort_break_even QSORT_BREAK_EVEN
3166 if ((part_right - part_left) >= qsort_break_even) {
3167 /* OK, this is gonna get hairy, so lets try to document all the
3168 concepts and abbreviations and variables and what they keep
3171 pc: pivot chunk - the set of array elements we accumulate in the
3172 middle of the partition, all equal in value to the original
3173 pivot element selected. The pc is defined by:
3175 pc_left - the leftmost array index of the pc
3176 pc_right - the rightmost array index of the pc
3178 we start with pc_left == pc_right and only one element
3179 in the pivot chunk (but it can grow during the scan).
3181 u: uncompared elements - the set of elements in the partition
3182 we have not yet compared to the pivot value. There are two
3183 uncompared sets during the scan - one to the left of the pc
3184 and one to the right.
3186 u_right - the rightmost index of the left side's uncompared set
3187 u_left - the leftmost index of the right side's uncompared set
3189 The leftmost index of the left sides's uncompared set
3190 doesn't need its own variable because it is always defined
3191 by the leftmost edge of the whole partition (part_left). The
3192 same goes for the rightmost edge of the right partition
3195 We know there are no uncompared elements on the left once we
3196 get u_right < part_left and no uncompared elements on the
3197 right once u_left > part_right. When both these conditions
3198 are met, we have completed the scan of the partition.
3200 Any elements which are between the pivot chunk and the
3201 uncompared elements should be less than the pivot value on
3202 the left side and greater than the pivot value on the right
3203 side (in fact, the goal of the whole algorithm is to arrange
3204 for that to be true and make the groups of less-than and
3205 greater-then elements into new partitions to sort again).
3207 As you marvel at the complexity of the code and wonder why it
3208 has to be so confusing. Consider some of the things this level
3209 of confusion brings:
3211 Once I do a compare, I squeeze every ounce of juice out of it. I
3212 never do compare calls I don't have to do, and I certainly never
3215 I also never swap any elements unless I can prove there is a
3216 good reason. Many sort algorithms will swap a known value with
3217 an uncompared value just to get things in the right place (or
3218 avoid complexity :-), but that uncompared value, once it gets
3219 compared, may then have to be swapped again. A lot of the
3220 complexity of this code is due to the fact that it never swaps
3221 anything except compared values, and it only swaps them when the
3222 compare shows they are out of position.
3224 int pc_left, pc_right;
3225 int u_right, u_left;
3229 pc_left = ((part_left + part_right) / 2);
3231 u_right = pc_left - 1;
3232 u_left = pc_right + 1;
3234 /* Qsort works best when the pivot value is also the median value
3235 in the partition (unfortunately you can't find the median value
3236 without first sorting :-), so to give the algorithm a helping
3237 hand, we pick 3 elements and sort them and use the median value
3238 of that tiny set as the pivot value.
3240 Some versions of qsort like to use the left middle and right as
3241 the 3 elements to sort so they can insure the ends of the
3242 partition will contain values which will stop the scan in the
3243 compare loop, but when you have to call an arbitrarily complex
3244 routine to do a compare, its really better to just keep track of
3245 array index values to know when you hit the edge of the
3246 partition and avoid the extra compare. An even better reason to
3247 avoid using a compare call is the fact that you can drop off the
3248 edge of the array if someone foolishly provides you with an
3249 unstable compare function that doesn't always provide consistent
3252 So, since it is simpler for us to compare the three adjacent
3253 elements in the middle of the partition, those are the ones we
3254 pick here (conveniently pointed at by u_right, pc_left, and
3255 u_left). The values of the left, center, and right elements
3256 are refered to as l c and r in the following comments.
3259 #ifdef QSORT_ORDER_GUESS
3262 s = qsort_cmp(u_right, pc_left);
3265 s = qsort_cmp(pc_left, u_left);
3266 /* if l < c, c < r - already in order - nothing to do */
3268 /* l < c, c == r - already in order, pc grows */
3270 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3272 /* l < c, c > r - need to know more */
3273 s = qsort_cmp(u_right, u_left);
3275 /* l < c, c > r, l < r - swap c & r to get ordered */
3276 qsort_swap(pc_left, u_left);
3277 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3278 } else if (s == 0) {
3279 /* l < c, c > r, l == r - swap c&r, grow pc */
3280 qsort_swap(pc_left, u_left);
3282 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3284 /* l < c, c > r, l > r - make lcr into rlc to get ordered */
3285 qsort_rotate(pc_left, u_right, u_left);
3286 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3289 } else if (s == 0) {
3291 s = qsort_cmp(pc_left, u_left);
3293 /* l == c, c < r - already in order, grow pc */
3295 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3296 } else if (s == 0) {
3297 /* l == c, c == r - already in order, grow pc both ways */
3300 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3302 /* l == c, c > r - swap l & r, grow pc */
3303 qsort_swap(u_right, u_left);
3305 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3309 s = qsort_cmp(pc_left, u_left);
3311 /* l > c, c < r - need to know more */
3312 s = qsort_cmp(u_right, u_left);
3314 /* l > c, c < r, l < r - swap l & c to get ordered */
3315 qsort_swap(u_right, pc_left);
3316 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3317 } else if (s == 0) {
3318 /* l > c, c < r, l == r - swap l & c, grow pc */
3319 qsort_swap(u_right, pc_left);
3321 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3323 /* l > c, c < r, l > r - rotate lcr into crl to order */
3324 qsort_rotate(u_right, pc_left, u_left);
3325 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3327 } else if (s == 0) {
3328 /* l > c, c == r - swap ends, grow pc */
3329 qsort_swap(u_right, u_left);
3331 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3333 /* l > c, c > r - swap ends to get in order */
3334 qsort_swap(u_right, u_left);
3335 qsort_all_asserts(pc_left, pc_right, u_left + 1, u_right - 1);
3338 /* We now know the 3 middle elements have been compared and
3339 arranged in the desired order, so we can shrink the uncompared
3344 qsort_all_asserts(pc_left, pc_right, u_left, u_right);
3346 /* The above massive nested if was the simple part :-). We now have
3347 the middle 3 elements ordered and we need to scan through the
3348 uncompared sets on either side, swapping elements that are on
3349 the wrong side or simply shuffling equal elements around to get
3350 all equal elements into the pivot chunk.
3354 int still_work_on_left;
3355 int still_work_on_right;
3357 /* Scan the uncompared values on the left. If I find a value
3358 equal to the pivot value, move it over so it is adjacent to
3359 the pivot chunk and expand the pivot chunk. If I find a value
3360 less than the pivot value, then just leave it - its already
3361 on the correct side of the partition. If I find a greater
3362 value, then stop the scan.
3364 while (still_work_on_left = (u_right >= part_left)) {
3365 s = qsort_cmp(u_right, pc_left);
3368 } else if (s == 0) {
3370 if (pc_left != u_right) {
3371 qsort_swap(u_right, pc_left);
3377 qsort_assert(u_right < pc_left);
3378 qsort_assert(pc_left <= pc_right);
3379 qsort_assert(qsort_cmp(u_right + 1, pc_left) <= 0);
3380 qsort_assert(qsort_cmp(pc_left, pc_right) == 0);
3383 /* Do a mirror image scan of uncompared values on the right
3385 while (still_work_on_right = (u_left <= part_right)) {
3386 s = qsort_cmp(pc_right, u_left);
3389 } else if (s == 0) {
3391 if (pc_right != u_left) {
3392 qsort_swap(pc_right, u_left);
3398 qsort_assert(u_left > pc_right);
3399 qsort_assert(pc_left <= pc_right);
3400 qsort_assert(qsort_cmp(pc_right, u_left - 1) <= 0);
3401 qsort_assert(qsort_cmp(pc_left, pc_right) == 0);
3404 if (still_work_on_left) {
3405 /* I know I have a value on the left side which needs to be
3406 on the right side, but I need to know more to decide
3407 exactly the best thing to do with it.
3409 if (still_work_on_right) {
3410 /* I know I have values on both side which are out of
3411 position. This is a big win because I kill two birds
3412 with one swap (so to speak). I can advance the
3413 uncompared pointers on both sides after swapping both
3414 of them into the right place.
3416 qsort_swap(u_right, u_left);
3419 qsort_all_asserts(pc_left, pc_right, u_left, u_right);
3421 /* I have an out of position value on the left, but the
3422 right is fully scanned, so I "slide" the pivot chunk
3423 and any less-than values left one to make room for the
3424 greater value over on the right. If the out of position
3425 value is immediately adjacent to the pivot chunk (there
3426 are no less-than values), I can do that with a swap,
3427 otherwise, I have to rotate one of the less than values
3428 into the former position of the out of position value
3429 and the right end of the pivot chunk into the left end
3433 if (pc_left == u_right) {
3434 qsort_swap(u_right, pc_right);
3435 qsort_all_asserts(pc_left, pc_right-1, u_left, u_right-1);
3437 qsort_rotate(u_right, pc_left, pc_right);
3438 qsort_all_asserts(pc_left, pc_right-1, u_left, u_right-1);
3443 } else if (still_work_on_right) {
3444 /* Mirror image of complex case above: I have an out of
3445 position value on the right, but the left is fully
3446 scanned, so I need to shuffle things around to make room
3447 for the right value on the left.
3450 if (pc_right == u_left) {
3451 qsort_swap(u_left, pc_left);
3452 qsort_all_asserts(pc_left+1, pc_right, u_left+1, u_right);
3454 qsort_rotate(pc_right, pc_left, u_left);
3455 qsort_all_asserts(pc_left+1, pc_right, u_left+1, u_right);
3460 /* No more scanning required on either side of partition,
3461 break out of loop and figure out next set of partitions
3467 /* The elements in the pivot chunk are now in the right place. They
3468 will never move or be compared again. All I have to do is decide
3469 what to do with the stuff to the left and right of the pivot
3472 Notes on the QSORT_ORDER_GUESS ifdef code:
3474 1. If I just built these partitions without swapping any (or
3475 very many) elements, there is a chance that the elements are
3476 already ordered properly (being properly ordered will
3477 certainly result in no swapping, but the converse can't be
3480 2. A (properly written) insertion sort will run faster on
3481 already ordered data than qsort will.
3483 3. Perhaps there is some way to make a good guess about
3484 switching to an insertion sort earlier than partition size 6
3485 (for instance - we could save the partition size on the stack
3486 and increase the size each time we find we didn't swap, thus
3487 switching to insertion sort earlier for partitions with a
3488 history of not swapping).
3490 4. Naturally, if I just switch right away, it will make
3491 artificial benchmarks with pure ascending (or descending)
3492 data look really good, but is that a good reason in general?
3496 #ifdef QSORT_ORDER_GUESS
3498 #if QSORT_ORDER_GUESS == 1
3499 qsort_break_even = (part_right - part_left) + 1;
3501 #if QSORT_ORDER_GUESS == 2
3502 qsort_break_even *= 2;
3504 #if QSORT_ORDER_GUESS == 3
3505 int prev_break = qsort_break_even;
3506 qsort_break_even *= qsort_break_even;
3507 if (qsort_break_even < prev_break) {
3508 qsort_break_even = (part_right - part_left) + 1;
3512 qsort_break_even = QSORT_BREAK_EVEN;
3516 if (part_left < pc_left) {
3517 /* There are elements on the left which need more processing.
3518 Check the right as well before deciding what to do.
3520 if (pc_right < part_right) {
3521 /* We have two partitions to be sorted. Stack the biggest one
3522 and process the smallest one on the next iteration. This
3523 minimizes the stack height by insuring that any additional
3524 stack entries must come from the smallest partition which
3525 (because it is smallest) will have the fewest
3526 opportunities to generate additional stack entries.
3528 if ((part_right - pc_right) > (pc_left - part_left)) {
3529 /* stack the right partition, process the left */
3530 partition_stack[next_stack_entry].left = pc_right + 1;
3531 partition_stack[next_stack_entry].right = part_right;
3532 #ifdef QSORT_ORDER_GUESS
3533 partition_stack[next_stack_entry].qsort_break_even = qsort_break_even;
3535 part_right = pc_left - 1;
3537 /* stack the left partition, process the right */
3538 partition_stack[next_stack_entry].left = part_left;
3539 partition_stack[next_stack_entry].right = pc_left - 1;
3540 #ifdef QSORT_ORDER_GUESS
3541 partition_stack[next_stack_entry].qsort_break_even = qsort_break_even;
3543 part_left = pc_right + 1;
3545 qsort_assert(next_stack_entry < QSORT_MAX_STACK);
3548 /* The elements on the left are the only remaining elements
3549 that need sorting, arrange for them to be processed as the
3552 part_right = pc_left - 1;
3554 } else if (pc_right < part_right) {
3555 /* There is only one chunk on the right to be sorted, make it
3556 the new partition and loop back around.
3558 part_left = pc_right + 1;
3560 /* This whole partition wound up in the pivot chunk, so
3561 we need to get a new partition off the stack.
3563 if (next_stack_entry == 0) {
3564 /* the stack is empty - we are done */
3568 part_left = partition_stack[next_stack_entry].left;
3569 part_right = partition_stack[next_stack_entry].right;
3570 #ifdef QSORT_ORDER_GUESS
3571 qsort_break_even = partition_stack[next_stack_entry].qsort_break_even;
3575 /* This partition is too small to fool with qsort complexity, just
3576 do an ordinary insertion sort to minimize overhead.
3579 /* Assume 1st element is in right place already, and start checking
3580 at 2nd element to see where it should be inserted.
3582 for (i = part_left + 1; i <= part_right; ++i) {
3584 /* Scan (backwards - just in case 'i' is already in right place)
3585 through the elements already sorted to see if the ith element
3586 belongs ahead of one of them.
3588 for (j = i - 1; j >= part_left; --j) {
3589 if (qsort_cmp(i, j) >= 0) {
3590 /* i belongs right after j
3597 /* Looks like we really need to move some things
3601 for (k = i - 1; k >= j; --k)
3602 array[k + 1] = array[k];
3607 /* That partition is now sorted, grab the next one, or get out
3608 of the loop if there aren't any more.
3611 if (next_stack_entry == 0) {
3612 /* the stack is empty - we are done */
3616 part_left = partition_stack[next_stack_entry].left;
3617 part_right = partition_stack[next_stack_entry].right;
3618 #ifdef QSORT_ORDER_GUESS
3619 qsort_break_even = partition_stack[next_stack_entry].qsort_break_even;
3624 /* Believe it or not, the array is sorted at this point! */