3 * Copyright (c) 1991-2001, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * Now far ahead the Road has gone,
12 * And I must follow, if I can,
13 * Pursuing it with eager feet,
14 * Until it joins some larger way
15 * Where many paths and errands meet.
16 * And whither then? I cannot say.
20 #define PERL_IN_PP_CTL_C
24 #define WORD_ALIGN sizeof(U16)
27 #define DOCATCH(o) ((CATCH_GET == TRUE) ? docatch(o) : (o))
29 static I32 sortcv(pTHXo_ SV *a, SV *b);
30 static I32 sortcv_stacked(pTHXo_ SV *a, SV *b);
31 static I32 sortcv_xsub(pTHXo_ SV *a, SV *b);
32 static I32 sv_ncmp(pTHXo_ SV *a, SV *b);
33 static I32 sv_i_ncmp(pTHXo_ SV *a, SV *b);
34 static I32 amagic_ncmp(pTHXo_ SV *a, SV *b);
35 static I32 amagic_i_ncmp(pTHXo_ SV *a, SV *b);
36 static I32 amagic_cmp(pTHXo_ SV *a, SV *b);
37 static I32 amagic_cmp_locale(pTHXo_ SV *a, SV *b);
38 static I32 run_user_filter(pTHXo_ int idx, SV *buf_sv, int maxlen);
41 static I32 sv_cmp_static(pTHXo_ SV *a, SV *b);
42 static I32 sv_cmp_locale_static(pTHXo_ SV *a, SV *b);
44 #define sv_cmp_static Perl_sv_cmp
45 #define sv_cmp_locale_static Perl_sv_cmp_locale
54 cxix = dopoptosub(cxstack_ix);
58 switch (cxstack[cxix].blk_gimme) {
75 /* XXXX Should store the old value to allow for tie/overload - and
76 restore in regcomp, where marked with XXXX. */
84 register PMOP *pm = (PMOP*)cLOGOP->op_other;
88 MAGIC *mg = Null(MAGIC*);
92 /* prevent recompiling under /o and ithreads. */
93 #if defined(USE_ITHREADS) || defined(USE_THREADS)
94 if (pm->op_pmflags & PMf_KEEP && PM_GETRE(pm))
99 SV *sv = SvRV(tmpstr);
101 mg = mg_find(sv, PERL_MAGIC_qr);
104 regexp *re = (regexp *)mg->mg_obj;
105 ReREFCNT_dec(PM_GETRE(pm));
106 PM_SETRE(pm, ReREFCNT_inc(re));
109 t = SvPV(tmpstr, len);
111 /* Check against the last compiled regexp. */
112 if (!PM_GETRE(pm) || !PM_GETRE(pm)->precomp ||
113 PM_GETRE(pm)->prelen != len ||
114 memNE(PM_GETRE(pm)->precomp, t, len))
117 ReREFCNT_dec(PM_GETRE(pm));
118 PM_SETRE(pm, Null(REGEXP*)); /* crucial if regcomp aborts */
120 if (PL_op->op_flags & OPf_SPECIAL)
121 PL_reginterp_cnt = I32_MAX; /* Mark as safe. */
123 pm->op_pmflags = pm->op_pmpermflags; /* reset case sensitivity */
125 pm->op_pmdynflags |= PMdf_DYN_UTF8;
127 pm->op_pmdynflags &= ~PMdf_DYN_UTF8;
128 if (pm->op_pmdynflags & PMdf_UTF8)
129 t = (char*)bytes_to_utf8((U8*)t, &len);
131 PM_SETRE(pm, CALLREGCOMP(aTHX_ t, t + len, pm));
132 if (!DO_UTF8(tmpstr) && (pm->op_pmdynflags & PMdf_UTF8))
134 PL_reginterp_cnt = 0; /* XXXX Be extra paranoid - needed
135 inside tie/overload accessors. */
139 #ifndef INCOMPLETE_TAINTS
142 pm->op_pmdynflags |= PMdf_TAINTED;
144 pm->op_pmdynflags &= ~PMdf_TAINTED;
148 if (!PM_GETRE(pm)->prelen && PL_curpm)
150 else if (strEQ("\\s+", PM_GETRE(pm)->precomp))
151 pm->op_pmflags |= PMf_WHITE;
153 pm->op_pmflags &= ~PMf_WHITE;
155 /* XXX runtime compiled output needs to move to the pad */
156 if (pm->op_pmflags & PMf_KEEP) {
157 pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
158 #if !defined(USE_ITHREADS) && !defined(USE_THREADS)
159 /* XXX can't change the optree at runtime either */
160 cLOGOP->op_first->op_next = PL_op->op_next;
169 register PMOP *pm = (PMOP*) cLOGOP->op_other;
170 register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
171 register SV *dstr = cx->sb_dstr;
172 register char *s = cx->sb_s;
173 register char *m = cx->sb_m;
174 char *orig = cx->sb_orig;
175 register REGEXP *rx = cx->sb_rx;
177 rxres_restore(&cx->sb_rxres, rx);
179 if (cx->sb_iters++) {
180 if (cx->sb_iters > cx->sb_maxiters)
181 DIE(aTHX_ "Substitution loop");
183 if (!(cx->sb_rxtainted & 2) && SvTAINTED(TOPs))
184 cx->sb_rxtainted |= 2;
185 sv_catsv(dstr, POPs);
188 if (cx->sb_once || !CALLREGEXEC(aTHX_ rx, s, cx->sb_strend, orig,
189 s == m, cx->sb_targ, NULL,
190 ((cx->sb_rflags & REXEC_COPY_STR)
191 ? (REXEC_IGNOREPOS|REXEC_NOT_FIRST)
192 : (REXEC_COPY_STR|REXEC_IGNOREPOS|REXEC_NOT_FIRST))))
194 SV *targ = cx->sb_targ;
196 sv_catpvn(dstr, s, cx->sb_strend - s);
197 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
199 (void)SvOOK_off(targ);
200 Safefree(SvPVX(targ));
201 SvPVX(targ) = SvPVX(dstr);
202 SvCUR_set(targ, SvCUR(dstr));
203 SvLEN_set(targ, SvLEN(dstr));
209 TAINT_IF(cx->sb_rxtainted & 1);
210 PUSHs(sv_2mortal(newSViv((I32)cx->sb_iters - 1)));
212 (void)SvPOK_only_UTF8(targ);
213 TAINT_IF(cx->sb_rxtainted);
217 LEAVE_SCOPE(cx->sb_oldsave);
219 RETURNOP(pm->op_next);
222 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
225 cx->sb_orig = orig = rx->subbeg;
227 cx->sb_strend = s + (cx->sb_strend - m);
229 cx->sb_m = m = rx->startp[0] + orig;
231 sv_catpvn(dstr, s, m-s);
232 cx->sb_s = rx->endp[0] + orig;
233 { /* Update the pos() information. */
234 SV *sv = cx->sb_targ;
237 if (SvTYPE(sv) < SVt_PVMG)
238 (void)SvUPGRADE(sv, SVt_PVMG);
239 if (!(mg = mg_find(sv, PERL_MAGIC_regex_global))) {
240 sv_magic(sv, Nullsv, PERL_MAGIC_regex_global, Nullch, 0);
241 mg = mg_find(sv, PERL_MAGIC_regex_global);
248 cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
249 rxres_save(&cx->sb_rxres, rx);
250 RETURNOP(pm->op_pmreplstart);
254 Perl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
259 if (!p || p[1] < rx->nparens) {
260 i = 6 + rx->nparens * 2;
268 *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? rx->subbeg : Nullch);
269 RX_MATCH_COPIED_off(rx);
273 *p++ = PTR2UV(rx->subbeg);
274 *p++ = (UV)rx->sublen;
275 for (i = 0; i <= rx->nparens; ++i) {
276 *p++ = (UV)rx->startp[i];
277 *p++ = (UV)rx->endp[i];
282 Perl_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
287 if (RX_MATCH_COPIED(rx))
288 Safefree(rx->subbeg);
289 RX_MATCH_COPIED_set(rx, *p);
294 rx->subbeg = INT2PTR(char*,*p++);
295 rx->sublen = (I32)(*p++);
296 for (i = 0; i <= rx->nparens; ++i) {
297 rx->startp[i] = (I32)(*p++);
298 rx->endp[i] = (I32)(*p++);
303 Perl_rxres_free(pTHX_ void **rsp)
308 Safefree(INT2PTR(char*,*p));
316 dSP; dMARK; dORIGMARK;
317 register SV *tmpForm = *++MARK;
324 register SV *sv = Nullsv;
329 bool chopspace = (strchr(PL_chopset, ' ') != Nullch);
330 char *chophere = Nullch;
331 char *linemark = Nullch;
333 bool gotsome = FALSE;
335 STRLEN fudge = SvCUR(tmpForm) * (IN_BYTES ? 1 : 3) + 1;
336 bool item_is_utf = FALSE;
338 if (!SvMAGICAL(tmpForm) || !SvCOMPILED(tmpForm)) {
339 if (SvREADONLY(tmpForm)) {
340 SvREADONLY_off(tmpForm);
341 doparseform(tmpForm);
342 SvREADONLY_on(tmpForm);
345 doparseform(tmpForm);
348 SvPV_force(PL_formtarget, len);
349 t = SvGROW(PL_formtarget, len + fudge + 1); /* XXX SvCUR bad */
351 f = SvPV(tmpForm, len);
352 /* need to jump to the next word */
353 s = f + len + WORD_ALIGN - SvCUR(tmpForm) % WORD_ALIGN;
362 case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
363 case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
364 case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
365 case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
366 case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
368 case FF_CHECKNL: name = "CHECKNL"; break;
369 case FF_CHECKCHOP: name = "CHECKCHOP"; break;
370 case FF_SPACE: name = "SPACE"; break;
371 case FF_HALFSPACE: name = "HALFSPACE"; break;
372 case FF_ITEM: name = "ITEM"; break;
373 case FF_CHOP: name = "CHOP"; break;
374 case FF_LINEGLOB: name = "LINEGLOB"; break;
375 case FF_NEWLINE: name = "NEWLINE"; break;
376 case FF_MORE: name = "MORE"; break;
377 case FF_LINEMARK: name = "LINEMARK"; break;
378 case FF_END: name = "END"; break;
379 case FF_0DECIMAL: name = "0DECIMAL"; break;
382 PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
384 PerlIO_printf(Perl_debug_log, "%-16s\n", name);
412 if (ckWARN(WARN_SYNTAX))
413 Perl_warner(aTHX_ WARN_SYNTAX, "Not enough format arguments");
418 item = s = SvPV(sv, len);
421 itemsize = sv_len_utf8(sv);
422 if (itemsize != len) {
424 if (itemsize > fieldsize) {
425 itemsize = fieldsize;
426 itembytes = itemsize;
427 sv_pos_u2b(sv, &itembytes, 0);
431 send = chophere = s + itembytes;
441 sv_pos_b2u(sv, &itemsize);
446 if (itemsize > fieldsize)
447 itemsize = fieldsize;
448 send = chophere = s + itemsize;
460 item = s = SvPV(sv, len);
463 itemsize = sv_len_utf8(sv);
464 if (itemsize != len) {
466 if (itemsize <= fieldsize) {
467 send = chophere = s + itemsize;
478 itemsize = fieldsize;
479 itembytes = itemsize;
480 sv_pos_u2b(sv, &itembytes, 0);
481 send = chophere = s + itembytes;
482 while (s < send || (s == send && isSPACE(*s))) {
492 if (strchr(PL_chopset, *s))
497 itemsize = chophere - item;
498 sv_pos_b2u(sv, &itemsize);
505 if (itemsize <= fieldsize) {
506 send = chophere = s + itemsize;
517 itemsize = fieldsize;
518 send = chophere = s + itemsize;
519 while (s < send || (s == send && isSPACE(*s))) {
529 if (strchr(PL_chopset, *s))
534 itemsize = chophere - item;
539 arg = fieldsize - itemsize;
548 arg = fieldsize - itemsize;
562 if (UTF8_IS_CONTINUED(*s)) {
563 STRLEN skip = UTF8SKIP(s);
580 if ( !((*t++ = *s++) & ~31) )
588 int ch = *t++ = *s++;
591 if ( !((*t++ = *s++) & ~31) )
600 while (*s && isSPACE(*s))
607 item = s = SvPV(sv, len);
609 item_is_utf = FALSE; /* XXX is this correct? */
621 SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
622 sv_catpvn(PL_formtarget, item, itemsize);
623 SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
624 t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
629 /* If the field is marked with ^ and the value is undefined,
632 if ((arg & 512) && !SvOK(sv)) {
640 /* Formats aren't yet marked for locales, so assume "yes". */
642 STORE_NUMERIC_STANDARD_SET_LOCAL();
643 #if defined(USE_LONG_DOUBLE)
645 sprintf(t, "%#*.*" PERL_PRIfldbl,
646 (int) fieldsize, (int) arg & 255, value);
648 sprintf(t, "%*.0" PERL_PRIfldbl, (int) fieldsize, value);
653 (int) fieldsize, (int) arg & 255, value);
656 (int) fieldsize, value);
659 RESTORE_NUMERIC_STANDARD();
665 /* If the field is marked with ^ and the value is undefined,
668 if ((arg & 512) && !SvOK(sv)) {
676 /* Formats aren't yet marked for locales, so assume "yes". */
678 STORE_NUMERIC_STANDARD_SET_LOCAL();
679 #if defined(USE_LONG_DOUBLE)
681 sprintf(t, "%#0*.*" PERL_PRIfldbl,
682 (int) fieldsize, (int) arg & 255, value);
683 /* is this legal? I don't have long doubles */
685 sprintf(t, "%0*.0" PERL_PRIfldbl, (int) fieldsize, value);
689 sprintf(t, "%#0*.*f",
690 (int) fieldsize, (int) arg & 255, value);
693 (int) fieldsize, value);
696 RESTORE_NUMERIC_STANDARD();
703 while (t-- > linemark && *t == ' ') ;
711 if (arg) { /* repeat until fields exhausted? */
713 SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
714 lines += FmLINES(PL_formtarget);
717 if (strnEQ(linemark, linemark - arg, arg))
718 DIE(aTHX_ "Runaway format");
720 FmLINES(PL_formtarget) = lines;
722 RETURNOP(cLISTOP->op_first);
735 while (*s && isSPACE(*s) && s < send)
739 arg = fieldsize - itemsize;
746 if (strnEQ(s," ",3)) {
747 while (s > SvPVX(PL_formtarget) && isSPACE(s[-1]))
758 SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
759 FmLINES(PL_formtarget) += lines;
771 if (PL_stack_base + *PL_markstack_ptr == SP) {
773 if (GIMME_V == G_SCALAR)
774 XPUSHs(sv_2mortal(newSViv(0)));
775 RETURNOP(PL_op->op_next->op_next);
777 PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
778 pp_pushmark(); /* push dst */
779 pp_pushmark(); /* push src */
780 ENTER; /* enter outer scope */
783 /* SAVE_DEFSV does *not* suffice here for USE_THREADS */
785 ENTER; /* enter inner scope */
788 src = PL_stack_base[*PL_markstack_ptr];
793 if (PL_op->op_type == OP_MAPSTART)
794 pp_pushmark(); /* push top */
795 return ((LOGOP*)PL_op->op_next)->op_other;
800 DIE(aTHX_ "panic: mapstart"); /* uses grepstart */
806 I32 items = (SP - PL_stack_base) - *PL_markstack_ptr; /* how many new items */
812 /* first, move source pointer to the next item in the source list */
813 ++PL_markstack_ptr[-1];
815 /* if there are new items, push them into the destination list */
817 /* might need to make room back there first */
818 if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
819 /* XXX this implementation is very pessimal because the stack
820 * is repeatedly extended for every set of items. Is possible
821 * to do this without any stack extension or copying at all
822 * by maintaining a separate list over which the map iterates
823 * (like foreach does). --gsar */
825 /* everything in the stack after the destination list moves
826 * towards the end the stack by the amount of room needed */
827 shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
829 /* items to shift up (accounting for the moved source pointer) */
830 count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
832 /* This optimization is by Ben Tilly and it does
833 * things differently from what Sarathy (gsar)
834 * is describing. The downside of this optimization is
835 * that leaves "holes" (uninitialized and hopefully unused areas)
836 * to the Perl stack, but on the other hand this
837 * shouldn't be a problem. If Sarathy's idea gets
838 * implemented, this optimization should become
839 * irrelevant. --jhi */
841 shift = count; /* Avoid shifting too often --Ben Tilly */
846 PL_markstack_ptr[-1] += shift;
847 *PL_markstack_ptr += shift;
851 /* copy the new items down to the destination list */
852 dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
854 *dst-- = SvTEMP(TOPs) ? POPs : sv_mortalcopy(POPs);
856 LEAVE; /* exit inner scope */
859 if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
862 (void)POPMARK; /* pop top */
863 LEAVE; /* exit outer scope */
864 (void)POPMARK; /* pop src */
865 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
866 (void)POPMARK; /* pop dst */
867 SP = PL_stack_base + POPMARK; /* pop original mark */
868 if (gimme == G_SCALAR) {
872 else if (gimme == G_ARRAY)
879 ENTER; /* enter inner scope */
882 /* set $_ to the new source item */
883 src = PL_stack_base[PL_markstack_ptr[-1]];
887 RETURNOP(cLOGOP->op_other);
893 dSP; dMARK; dORIGMARK;
895 SV **myorigmark = ORIGMARK;
901 OP* nextop = PL_op->op_next;
903 bool hasargs = FALSE;
906 if (gimme != G_ARRAY) {
912 SAVEVPTR(PL_sortcop);
913 if (PL_op->op_flags & OPf_STACKED) {
914 if (PL_op->op_flags & OPf_SPECIAL) {
915 OP *kid = cLISTOP->op_first->op_sibling; /* pass pushmark */
916 kid = kUNOP->op_first; /* pass rv2gv */
917 kid = kUNOP->op_first; /* pass leave */
918 PL_sortcop = kid->op_next;
919 stash = CopSTASH(PL_curcop);
922 cv = sv_2cv(*++MARK, &stash, &gv, 0);
923 if (cv && SvPOK(cv)) {
925 char *proto = SvPV((SV*)cv, n_a);
926 if (proto && strEQ(proto, "$$")) {
930 if (!(cv && CvROOT(cv))) {
931 if (cv && CvXSUB(cv)) {
935 SV *tmpstr = sv_newmortal();
936 gv_efullname3(tmpstr, gv, Nullch);
937 DIE(aTHX_ "Undefined sort subroutine \"%s\" called",
941 DIE(aTHX_ "Undefined subroutine in sort");
946 PL_sortcop = (OP*)cv;
948 PL_sortcop = CvSTART(cv);
949 SAVEVPTR(CvROOT(cv)->op_ppaddr);
950 CvROOT(cv)->op_ppaddr = PL_ppaddr[OP_NULL];
953 PL_curpad = AvARRAY((AV*)AvARRAY(CvPADLIST(cv))[1]);
959 stash = CopSTASH(PL_curcop);
963 while (MARK < SP) { /* This may or may not shift down one here. */
965 if ((*up = *++MARK)) { /* Weed out nulls. */
967 if (!PL_sortcop && !SvPOK(*up)) {
972 (void)sv_2pv(*up, &n_a);
977 max = --up - myorigmark;
982 bool oldcatch = CATCH_GET;
988 PUSHSTACKi(PERLSI_SORT);
989 if (!hasargs && !is_xsub) {
990 if (PL_sortstash != stash || !PL_firstgv || !PL_secondgv) {
991 SAVESPTR(PL_firstgv);
992 SAVESPTR(PL_secondgv);
993 PL_firstgv = gv_fetchpv("a", TRUE, SVt_PV);
994 PL_secondgv = gv_fetchpv("b", TRUE, SVt_PV);
995 PL_sortstash = stash;
998 sv_lock((SV *)PL_firstgv);
999 sv_lock((SV *)PL_secondgv);
1001 SAVESPTR(GvSV(PL_firstgv));
1002 SAVESPTR(GvSV(PL_secondgv));
1005 PUSHBLOCK(cx, CXt_NULL, PL_stack_base);
1006 if (!(PL_op->op_flags & OPf_SPECIAL)) {
1007 cx->cx_type = CXt_SUB;
1008 cx->blk_gimme = G_SCALAR;
1011 (void)SvREFCNT_inc(cv); /* in preparation for POPSUB */
1013 PL_sortcxix = cxstack_ix;
1015 if (hasargs && !is_xsub) {
1016 /* This is mostly copied from pp_entersub */
1017 AV *av = (AV*)PL_curpad[0];
1020 cx->blk_sub.savearray = GvAV(PL_defgv);
1021 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
1022 #endif /* USE_THREADS */
1023 cx->blk_sub.oldcurpad = PL_curpad;
1024 cx->blk_sub.argarray = av;
1026 qsortsv((myorigmark+1), max,
1027 is_xsub ? sortcv_xsub : hasargs ? sortcv_stacked : sortcv);
1029 POPBLOCK(cx,PL_curpm);
1030 PL_stack_sp = newsp;
1032 CATCH_SET(oldcatch);
1037 MEXTEND(SP, 20); /* Can't afford stack realloc on signal. */
1038 qsortsv(ORIGMARK+1, max,
1039 (PL_op->op_private & OPpSORT_NUMERIC)
1040 ? ( (PL_op->op_private & OPpSORT_INTEGER)
1041 ? ( overloading ? amagic_i_ncmp : sv_i_ncmp)
1042 : ( overloading ? amagic_ncmp : sv_ncmp))
1043 : ( IN_LOCALE_RUNTIME
1046 : sv_cmp_locale_static)
1047 : ( overloading ? amagic_cmp : sv_cmp_static)));
1048 if (PL_op->op_private & OPpSORT_REVERSE) {
1049 SV **p = ORIGMARK+1;
1050 SV **q = ORIGMARK+max;
1060 PL_stack_sp = ORIGMARK + max;
1068 if (GIMME == G_ARRAY)
1070 if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1071 return cLOGOP->op_other;
1080 if (GIMME == G_ARRAY) {
1081 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1085 SV *targ = PAD_SV(PL_op->op_targ);
1088 if (PL_op->op_private & OPpFLIP_LINENUM) {
1090 flip = PL_last_in_gv
1091 && (gp_io = GvIO(PL_last_in_gv))
1092 && SvIV(sv) == (IV)IoLINES(gp_io);
1097 sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
1098 if (PL_op->op_flags & OPf_SPECIAL) {
1106 RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1119 if (GIMME == G_ARRAY) {
1125 if (SvGMAGICAL(left))
1127 if (SvGMAGICAL(right))
1130 if (SvNIOKp(left) || !SvPOKp(left) ||
1131 SvNIOKp(right) || !SvPOKp(right) ||
1132 (looks_like_number(left) && *SvPVX(left) != '0' &&
1133 looks_like_number(right) && *SvPVX(right) != '0'))
1135 if (SvNV(left) < IV_MIN || SvNV(right) > IV_MAX)
1136 DIE(aTHX_ "Range iterator outside integer range");
1147 sv = sv_2mortal(newSViv(i++));
1152 SV *final = sv_mortalcopy(right);
1154 char *tmps = SvPV(final, len);
1156 sv = sv_mortalcopy(left);
1158 while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
1160 if (strEQ(SvPVX(sv),tmps))
1162 sv = sv_2mortal(newSVsv(sv));
1169 SV *targ = PAD_SV(cUNOP->op_first->op_targ);
1171 if ((PL_op->op_private & OPpFLIP_LINENUM)
1172 ? (GvIO(PL_last_in_gv)
1173 && SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv)))
1175 sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
1176 sv_catpv(targ, "E0");
1187 S_dopoptolabel(pTHX_ char *label)
1190 register PERL_CONTEXT *cx;
1192 for (i = cxstack_ix; i >= 0; i--) {
1194 switch (CxTYPE(cx)) {
1196 if (ckWARN(WARN_EXITING))
1197 Perl_warner(aTHX_ WARN_EXITING, "Exiting substitution via %s",
1198 PL_op_name[PL_op->op_type]);
1201 if (ckWARN(WARN_EXITING))
1202 Perl_warner(aTHX_ WARN_EXITING, "Exiting subroutine via %s",
1203 PL_op_name[PL_op->op_type]);
1206 if (ckWARN(WARN_EXITING))
1207 Perl_warner(aTHX_ WARN_EXITING, "Exiting format via %s",
1208 PL_op_name[PL_op->op_type]);
1211 if (ckWARN(WARN_EXITING))
1212 Perl_warner(aTHX_ WARN_EXITING, "Exiting eval via %s",
1213 PL_op_name[PL_op->op_type]);
1216 if (ckWARN(WARN_EXITING))
1217 Perl_warner(aTHX_ WARN_EXITING, "Exiting pseudo-block via %s",
1218 PL_op_name[PL_op->op_type]);
1221 if (!cx->blk_loop.label ||
1222 strNE(label, cx->blk_loop.label) ) {
1223 DEBUG_l(Perl_deb(aTHX_ "(Skipping label #%ld %s)\n",
1224 (long)i, cx->blk_loop.label));
1227 DEBUG_l( Perl_deb(aTHX_ "(Found label #%ld %s)\n", (long)i, label));
1235 Perl_dowantarray(pTHX)
1237 I32 gimme = block_gimme();
1238 return (gimme == G_VOID) ? G_SCALAR : gimme;
1242 Perl_block_gimme(pTHX)
1246 cxix = dopoptosub(cxstack_ix);
1250 switch (cxstack[cxix].blk_gimme) {
1258 Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
1265 Perl_is_lvalue_sub(pTHX)
1269 cxix = dopoptosub(cxstack_ix);
1270 assert(cxix >= 0); /* We should only be called from inside subs */
1272 if (cxstack[cxix].blk_sub.lval && CvLVALUE(cxstack[cxix].blk_sub.cv))
1273 return cxstack[cxix].blk_sub.lval;
1279 S_dopoptosub(pTHX_ I32 startingblock)
1281 return dopoptosub_at(cxstack, startingblock);
1285 S_dopoptosub_at(pTHX_ PERL_CONTEXT *cxstk, I32 startingblock)
1288 register PERL_CONTEXT *cx;
1289 for (i = startingblock; i >= 0; i--) {
1291 switch (CxTYPE(cx)) {
1297 DEBUG_l( Perl_deb(aTHX_ "(Found sub #%ld)\n", (long)i));
1305 S_dopoptoeval(pTHX_ I32 startingblock)
1308 register PERL_CONTEXT *cx;
1309 for (i = startingblock; i >= 0; i--) {
1311 switch (CxTYPE(cx)) {
1315 DEBUG_l( Perl_deb(aTHX_ "(Found eval #%ld)\n", (long)i));
1323 S_dopoptoloop(pTHX_ I32 startingblock)
1326 register PERL_CONTEXT *cx;
1327 for (i = startingblock; i >= 0; i--) {
1329 switch (CxTYPE(cx)) {
1331 if (ckWARN(WARN_EXITING))
1332 Perl_warner(aTHX_ WARN_EXITING, "Exiting substitution via %s",
1333 PL_op_name[PL_op->op_type]);
1336 if (ckWARN(WARN_EXITING))
1337 Perl_warner(aTHX_ WARN_EXITING, "Exiting subroutine via %s",
1338 PL_op_name[PL_op->op_type]);
1341 if (ckWARN(WARN_EXITING))
1342 Perl_warner(aTHX_ WARN_EXITING, "Exiting format via %s",
1343 PL_op_name[PL_op->op_type]);
1346 if (ckWARN(WARN_EXITING))
1347 Perl_warner(aTHX_ WARN_EXITING, "Exiting eval via %s",
1348 PL_op_name[PL_op->op_type]);
1351 if (ckWARN(WARN_EXITING))
1352 Perl_warner(aTHX_ WARN_EXITING, "Exiting pseudo-block via %s",
1353 PL_op_name[PL_op->op_type]);
1356 DEBUG_l( Perl_deb(aTHX_ "(Found loop #%ld)\n", (long)i));
1364 Perl_dounwind(pTHX_ I32 cxix)
1366 register PERL_CONTEXT *cx;
1369 while (cxstack_ix > cxix) {
1371 cx = &cxstack[cxstack_ix];
1372 DEBUG_l(PerlIO_printf(Perl_debug_log, "Unwinding block %ld, type %s\n",
1373 (long) cxstack_ix, PL_block_type[CxTYPE(cx)]));
1374 /* Note: we don't need to restore the base context info till the end. */
1375 switch (CxTYPE(cx)) {
1378 continue; /* not break */
1400 Perl_qerror(pTHX_ SV *err)
1403 sv_catsv(ERRSV, err);
1405 sv_catsv(PL_errors, err);
1407 Perl_warn(aTHX_ "%"SVf, err);
1412 Perl_die_where(pTHX_ char *message, STRLEN msglen)
1417 register PERL_CONTEXT *cx;
1422 if (PL_in_eval & EVAL_KEEPERR) {
1423 static char prefix[] = "\t(in cleanup) ";
1428 else if (SvCUR(err) >= sizeof(prefix)+msglen-1) {
1431 if (*e != *message || strNE(e,message))
1435 SvGROW(err, SvCUR(err)+sizeof(prefix)+msglen);
1436 sv_catpvn(err, prefix, sizeof(prefix)-1);
1437 sv_catpvn(err, message, msglen);
1438 if (ckWARN(WARN_MISC)) {
1439 STRLEN start = SvCUR(err)-msglen-sizeof(prefix)+1;
1440 Perl_warner(aTHX_ WARN_MISC, SvPVX(err)+start);
1445 sv_setpvn(ERRSV, message, msglen);
1449 message = SvPVx(ERRSV, msglen);
1451 while ((cxix = dopoptoeval(cxstack_ix)) < 0
1452 && PL_curstackinfo->si_prev)
1461 if (cxix < cxstack_ix)
1464 POPBLOCK(cx,PL_curpm);
1465 if (CxTYPE(cx) != CXt_EVAL) {
1466 PerlIO_write(Perl_error_log, "panic: die ", 11);
1467 PerlIO_write(Perl_error_log, message, msglen);
1472 if (gimme == G_SCALAR)
1473 *++newsp = &PL_sv_undef;
1474 PL_stack_sp = newsp;
1478 /* LEAVE could clobber PL_curcop (see save_re_context())
1479 * XXX it might be better to find a way to avoid messing with
1480 * PL_curcop in save_re_context() instead, but this is a more
1481 * minimal fix --GSAR */
1482 PL_curcop = cx->blk_oldcop;
1484 if (optype == OP_REQUIRE) {
1485 char* msg = SvPVx(ERRSV, n_a);
1486 DIE(aTHX_ "%sCompilation failed in require",
1487 *msg ? msg : "Unknown error\n");
1489 return pop_return();
1493 message = SvPVx(ERRSV, msglen);
1496 /* SFIO can really mess with your errno */
1499 PerlIO *serr = Perl_error_log;
1501 PerlIO_write(serr, message, msglen);
1502 (void)PerlIO_flush(serr);
1515 if (SvTRUE(left) != SvTRUE(right))
1527 RETURNOP(cLOGOP->op_other);
1536 RETURNOP(cLOGOP->op_other);
1542 register I32 cxix = dopoptosub(cxstack_ix);
1543 register PERL_CONTEXT *cx;
1544 register PERL_CONTEXT *ccstack = cxstack;
1545 PERL_SI *top_si = PL_curstackinfo;
1556 /* we may be in a higher stacklevel, so dig down deeper */
1557 while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1558 top_si = top_si->si_prev;
1559 ccstack = top_si->si_cxstack;
1560 cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1563 if (GIMME != G_ARRAY) {
1569 if (PL_DBsub && cxix >= 0 &&
1570 ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1574 cxix = dopoptosub_at(ccstack, cxix - 1);
1577 cx = &ccstack[cxix];
1578 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1579 dbcxix = dopoptosub_at(ccstack, cxix - 1);
1580 /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1581 field below is defined for any cx. */
1582 if (PL_DBsub && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1583 cx = &ccstack[dbcxix];
1586 stashname = CopSTASHPV(cx->blk_oldcop);
1587 if (GIMME != G_ARRAY) {
1590 PUSHs(&PL_sv_undef);
1593 sv_setpv(TARG, stashname);
1602 PUSHs(&PL_sv_undef);
1604 PUSHs(sv_2mortal(newSVpv(stashname, 0)));
1605 PUSHs(sv_2mortal(newSVpv(CopFILE(cx->blk_oldcop), 0)));
1606 PUSHs(sv_2mortal(newSViv((I32)CopLINE(cx->blk_oldcop))));
1609 if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1610 /* So is ccstack[dbcxix]. */
1612 gv_efullname3(sv, CvGV(ccstack[cxix].blk_sub.cv), Nullch);
1613 PUSHs(sv_2mortal(sv));
1614 PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1617 PUSHs(sv_2mortal(newSVpvn("(eval)",6)));
1618 PUSHs(sv_2mortal(newSViv(0)));
1620 gimme = (I32)cx->blk_gimme;
1621 if (gimme == G_VOID)
1622 PUSHs(&PL_sv_undef);
1624 PUSHs(sv_2mortal(newSViv(gimme & G_ARRAY)));
1625 if (CxTYPE(cx) == CXt_EVAL) {
1627 if (cx->blk_eval.old_op_type == OP_ENTEREVAL) {
1628 PUSHs(cx->blk_eval.cur_text);
1632 else if (cx->blk_eval.old_namesv) {
1633 PUSHs(sv_2mortal(newSVsv(cx->blk_eval.old_namesv)));
1636 /* eval BLOCK (try blocks have old_namesv == 0) */
1638 PUSHs(&PL_sv_undef);
1639 PUSHs(&PL_sv_undef);
1643 PUSHs(&PL_sv_undef);
1644 PUSHs(&PL_sv_undef);
1646 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs
1647 && CopSTASH_eq(PL_curcop, PL_debstash))
1649 AV *ary = cx->blk_sub.argarray;
1650 int off = AvARRAY(ary) - AvALLOC(ary);
1654 PL_dbargs = GvAV(gv_AVadd(tmpgv = gv_fetchpv("DB::args", TRUE,
1657 AvREAL_off(PL_dbargs); /* XXX should be REIFY (see av.h) */
1660 if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1661 av_extend(PL_dbargs, AvFILLp(ary) + off);
1662 Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1663 AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1665 /* XXX only hints propagated via op_private are currently
1666 * visible (others are not easily accessible, since they
1667 * use the global PL_hints) */
1668 PUSHs(sv_2mortal(newSViv((I32)cx->blk_oldcop->op_private &
1669 HINT_PRIVATE_MASK)));
1672 SV * old_warnings = cx->blk_oldcop->cop_warnings ;
1674 if (old_warnings == pWARN_NONE ||
1675 (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0))
1676 mask = newSVpvn(WARN_NONEstring, WARNsize) ;
1677 else if (old_warnings == pWARN_ALL ||
1678 (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON))
1679 mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1681 mask = newSVsv(old_warnings);
1682 PUSHs(sv_2mortal(mask));
1697 sv_reset(tmps, CopSTASH(PL_curcop));
1709 PL_curcop = (COP*)PL_op;
1710 TAINT_NOT; /* Each statement is presumed innocent */
1711 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
1714 if (PL_op->op_private || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
1718 register PERL_CONTEXT *cx;
1719 I32 gimme = G_ARRAY;
1726 DIE(aTHX_ "No DB::DB routine defined");
1728 if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
1729 /* don't do recursive DB::DB call */
1741 push_return(PL_op->op_next);
1742 PUSHBLOCK(cx, CXt_SUB, SP);
1745 (void)SvREFCNT_inc(cv);
1746 SAVEVPTR(PL_curpad);
1747 PL_curpad = AvARRAY((AV*)*av_fetch(CvPADLIST(cv),1,FALSE));
1748 RETURNOP(CvSTART(cv));
1762 register PERL_CONTEXT *cx;
1763 I32 gimme = GIMME_V;
1765 U32 cxtype = CXt_LOOP;
1774 if (PL_op->op_flags & OPf_SPECIAL) {
1775 svp = &THREADSV(PL_op->op_targ); /* per-thread variable */
1776 SAVEGENERICSV(*svp);
1780 #endif /* USE_THREADS */
1781 if (PL_op->op_targ) {
1782 #ifndef USE_ITHREADS
1783 svp = &PL_curpad[PL_op->op_targ]; /* "my" variable */
1786 SAVEPADSV(PL_op->op_targ);
1787 iterdata = (void*)PL_op->op_targ;
1788 cxtype |= CXp_PADVAR;
1793 svp = &GvSV(gv); /* symbol table variable */
1794 SAVEGENERICSV(*svp);
1797 iterdata = (void*)gv;
1803 PUSHBLOCK(cx, cxtype, SP);
1805 PUSHLOOP(cx, iterdata, MARK);
1807 PUSHLOOP(cx, svp, MARK);
1809 if (PL_op->op_flags & OPf_STACKED) {
1810 cx->blk_loop.iterary = (AV*)SvREFCNT_inc(POPs);
1811 if (SvTYPE(cx->blk_loop.iterary) != SVt_PVAV) {
1813 if (SvNIOKp(sv) || !SvPOKp(sv) ||
1814 SvNIOKp(cx->blk_loop.iterary) || !SvPOKp(cx->blk_loop.iterary) ||
1815 (looks_like_number(sv) && *SvPVX(sv) != '0' &&
1816 looks_like_number((SV*)cx->blk_loop.iterary) &&
1817 *SvPVX(cx->blk_loop.iterary) != '0'))
1819 if (SvNV(sv) < IV_MIN ||
1820 SvNV((SV*)cx->blk_loop.iterary) >= IV_MAX)
1821 DIE(aTHX_ "Range iterator outside integer range");
1822 cx->blk_loop.iterix = SvIV(sv);
1823 cx->blk_loop.itermax = SvIV((SV*)cx->blk_loop.iterary);
1826 cx->blk_loop.iterlval = newSVsv(sv);
1830 cx->blk_loop.iterary = PL_curstack;
1831 AvFILLp(PL_curstack) = SP - PL_stack_base;
1832 cx->blk_loop.iterix = MARK - PL_stack_base;
1841 register PERL_CONTEXT *cx;
1842 I32 gimme = GIMME_V;
1848 PUSHBLOCK(cx, CXt_LOOP, SP);
1849 PUSHLOOP(cx, 0, SP);
1857 register PERL_CONTEXT *cx;
1865 newsp = PL_stack_base + cx->blk_loop.resetsp;
1868 if (gimme == G_VOID)
1870 else if (gimme == G_SCALAR) {
1872 *++newsp = sv_mortalcopy(*SP);
1874 *++newsp = &PL_sv_undef;
1878 *++newsp = sv_mortalcopy(*++mark);
1879 TAINT_NOT; /* Each item is independent */
1885 POPLOOP(cx); /* Stack values are safe: release loop vars ... */
1886 PL_curpm = newpm; /* ... and pop $1 et al */
1898 register PERL_CONTEXT *cx;
1899 bool popsub2 = FALSE;
1900 bool clear_errsv = FALSE;
1907 if (PL_curstackinfo->si_type == PERLSI_SORT) {
1908 if (cxstack_ix == PL_sortcxix
1909 || dopoptosub(cxstack_ix) <= PL_sortcxix)
1911 if (cxstack_ix > PL_sortcxix)
1912 dounwind(PL_sortcxix);
1913 AvARRAY(PL_curstack)[1] = *SP;
1914 PL_stack_sp = PL_stack_base + 1;
1919 cxix = dopoptosub(cxstack_ix);
1921 DIE(aTHX_ "Can't return outside a subroutine");
1922 if (cxix < cxstack_ix)
1926 switch (CxTYPE(cx)) {
1931 if (!(PL_in_eval & EVAL_KEEPERR))
1937 if (optype == OP_REQUIRE &&
1938 (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
1940 /* Unassume the success we assumed earlier. */
1941 SV *nsv = cx->blk_eval.old_namesv;
1942 (void)hv_delete(GvHVn(PL_incgv), SvPVX(nsv), SvCUR(nsv), G_DISCARD);
1943 DIE(aTHX_ "%s did not return a true value", SvPVX(nsv));
1950 DIE(aTHX_ "panic: return");
1954 if (gimme == G_SCALAR) {
1957 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
1959 *++newsp = SvREFCNT_inc(*SP);
1964 sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
1966 *++newsp = sv_mortalcopy(sv);
1971 *++newsp = (SvTEMP(*SP)) ? *SP : sv_mortalcopy(*SP);
1974 *++newsp = sv_mortalcopy(*SP);
1977 *++newsp = &PL_sv_undef;
1979 else if (gimme == G_ARRAY) {
1980 while (++MARK <= SP) {
1981 *++newsp = (popsub2 && SvTEMP(*MARK))
1982 ? *MARK : sv_mortalcopy(*MARK);
1983 TAINT_NOT; /* Each item is independent */
1986 PL_stack_sp = newsp;
1988 /* Stack values are safe: */
1990 POPSUB(cx,sv); /* release CV and @_ ... */
1994 PL_curpm = newpm; /* ... and pop $1 et al */
2000 return pop_return();
2007 register PERL_CONTEXT *cx;
2017 if (PL_op->op_flags & OPf_SPECIAL) {
2018 cxix = dopoptoloop(cxstack_ix);
2020 DIE(aTHX_ "Can't \"last\" outside a loop block");
2023 cxix = dopoptolabel(cPVOP->op_pv);
2025 DIE(aTHX_ "Label not found for \"last %s\"", cPVOP->op_pv);
2027 if (cxix < cxstack_ix)
2032 switch (CxTYPE(cx)) {
2035 newsp = PL_stack_base + cx->blk_loop.resetsp;
2036 nextop = cx->blk_loop.last_op->op_next;
2040 nextop = pop_return();
2044 nextop = pop_return();
2048 nextop = pop_return();
2051 DIE(aTHX_ "panic: last");
2055 if (gimme == G_SCALAR) {
2057 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*SP))
2058 ? *SP : sv_mortalcopy(*SP);
2060 *++newsp = &PL_sv_undef;
2062 else if (gimme == G_ARRAY) {
2063 while (++MARK <= SP) {
2064 *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*MARK))
2065 ? *MARK : sv_mortalcopy(*MARK);
2066 TAINT_NOT; /* Each item is independent */
2072 /* Stack values are safe: */
2075 POPLOOP(cx); /* release loop vars ... */
2079 POPSUB(cx,sv); /* release CV and @_ ... */
2082 PL_curpm = newpm; /* ... and pop $1 et al */
2092 register PERL_CONTEXT *cx;
2095 if (PL_op->op_flags & OPf_SPECIAL) {
2096 cxix = dopoptoloop(cxstack_ix);
2098 DIE(aTHX_ "Can't \"next\" outside a loop block");
2101 cxix = dopoptolabel(cPVOP->op_pv);
2103 DIE(aTHX_ "Label not found for \"next %s\"", cPVOP->op_pv);
2105 if (cxix < cxstack_ix)
2108 /* clear off anything above the scope we're re-entering, but
2109 * save the rest until after a possible continue block */
2110 inner = PL_scopestack_ix;
2112 if (PL_scopestack_ix < inner)
2113 leave_scope(PL_scopestack[PL_scopestack_ix]);
2114 return cx->blk_loop.next_op;
2120 register PERL_CONTEXT *cx;
2123 if (PL_op->op_flags & OPf_SPECIAL) {
2124 cxix = dopoptoloop(cxstack_ix);
2126 DIE(aTHX_ "Can't \"redo\" outside a loop block");
2129 cxix = dopoptolabel(cPVOP->op_pv);
2131 DIE(aTHX_ "Label not found for \"redo %s\"", cPVOP->op_pv);
2133 if (cxix < cxstack_ix)
2137 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2138 LEAVE_SCOPE(oldsave);
2139 return cx->blk_loop.redo_op;
2143 S_dofindlabel(pTHX_ OP *o, char *label, OP **opstack, OP **oplimit)
2147 static char too_deep[] = "Target of goto is too deeply nested";
2150 Perl_croak(aTHX_ too_deep);
2151 if (o->op_type == OP_LEAVE ||
2152 o->op_type == OP_SCOPE ||
2153 o->op_type == OP_LEAVELOOP ||
2154 o->op_type == OP_LEAVETRY)
2156 *ops++ = cUNOPo->op_first;
2158 Perl_croak(aTHX_ too_deep);
2161 if (o->op_flags & OPf_KIDS) {
2162 /* First try all the kids at this level, since that's likeliest. */
2163 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2164 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
2165 kCOP->cop_label && strEQ(kCOP->cop_label, label))
2168 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
2169 if (kid == PL_lastgotoprobe)
2171 if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
2173 (ops[-1]->op_type != OP_NEXTSTATE &&
2174 ops[-1]->op_type != OP_DBSTATE)))
2176 if ((o = dofindlabel(kid, label, ops, oplimit)))
2195 register PERL_CONTEXT *cx;
2196 #define GOTO_DEPTH 64
2197 OP *enterops[GOTO_DEPTH];
2199 int do_dump = (PL_op->op_type == OP_DUMP);
2200 static char must_have_label[] = "goto must have label";
2203 if (PL_op->op_flags & OPf_STACKED) {
2207 /* This egregious kludge implements goto &subroutine */
2208 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
2210 register PERL_CONTEXT *cx;
2211 CV* cv = (CV*)SvRV(sv);
2217 if (!CvROOT(cv) && !CvXSUB(cv)) {
2222 /* autoloaded stub? */
2223 if (cv != GvCV(gv) && (cv = GvCV(gv)))
2225 autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv),
2226 GvNAMELEN(gv), FALSE);
2227 if (autogv && (cv = GvCV(autogv)))
2229 tmpstr = sv_newmortal();
2230 gv_efullname3(tmpstr, gv, Nullch);
2231 DIE(aTHX_ "Goto undefined subroutine &%s",SvPVX(tmpstr));
2233 DIE(aTHX_ "Goto undefined subroutine");
2236 /* First do some returnish stuff. */
2237 cxix = dopoptosub(cxstack_ix);
2239 DIE(aTHX_ "Can't goto subroutine outside a subroutine");
2240 if (cxix < cxstack_ix)
2244 DIE(aTHX_ "Can't goto subroutine from an eval-string");
2246 if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs) {
2247 /* put @_ back onto stack */
2248 AV* av = cx->blk_sub.argarray;
2250 items = AvFILLp(av) + 1;
2252 EXTEND(PL_stack_sp, items); /* @_ could have been extended. */
2253 Copy(AvARRAY(av), PL_stack_sp, items, SV*);
2254 PL_stack_sp += items;
2256 SvREFCNT_dec(GvAV(PL_defgv));
2257 GvAV(PL_defgv) = cx->blk_sub.savearray;
2258 #endif /* USE_THREADS */
2259 /* abandon @_ if it got reified */
2261 (void)sv_2mortal((SV*)av); /* delay until return */
2263 av_extend(av, items-1);
2264 AvFLAGS(av) = AVf_REIFY;
2265 PL_curpad[0] = (SV*)(cx->blk_sub.argarray = av);
2268 else if (CvXSUB(cv)) { /* put GvAV(defgv) back onto stack */
2271 av = (AV*)PL_curpad[0];
2273 av = GvAV(PL_defgv);
2275 items = AvFILLp(av) + 1;
2277 EXTEND(PL_stack_sp, items); /* @_ could have been extended. */
2278 Copy(AvARRAY(av), PL_stack_sp, items, SV*);
2279 PL_stack_sp += items;
2281 if (CxTYPE(cx) == CXt_SUB &&
2282 !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
2283 SvREFCNT_dec(cx->blk_sub.cv);
2284 oldsave = PL_scopestack[PL_scopestack_ix - 1];
2285 LEAVE_SCOPE(oldsave);
2287 /* Now do some callish stuff. */
2290 #ifdef PERL_XSUB_OLDSTYLE
2291 if (CvOLDSTYLE(cv)) {
2292 I32 (*fp3)(int,int,int);
2297 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2298 items = (*fp3)(CvXSUBANY(cv).any_i32,
2299 mark - PL_stack_base + 1,
2301 SP = PL_stack_base + items;
2304 #endif /* PERL_XSUB_OLDSTYLE */
2309 PL_stack_sp--; /* There is no cv arg. */
2310 /* Push a mark for the start of arglist */
2312 (void)(*CvXSUB(cv))(aTHXo_ cv);
2313 /* Pop the current context like a decent sub should */
2314 POPBLOCK(cx, PL_curpm);
2315 /* Do _not_ use PUTBACK, keep the XSUB's return stack! */
2318 return pop_return();
2321 AV* padlist = CvPADLIST(cv);
2322 SV** svp = AvARRAY(padlist);
2323 if (CxTYPE(cx) == CXt_EVAL) {
2324 PL_in_eval = cx->blk_eval.old_in_eval;
2325 PL_eval_root = cx->blk_eval.old_eval_root;
2326 cx->cx_type = CXt_SUB;
2327 cx->blk_sub.hasargs = 0;
2329 cx->blk_sub.cv = cv;
2330 cx->blk_sub.olddepth = CvDEPTH(cv);
2332 if (CvDEPTH(cv) < 2)
2333 (void)SvREFCNT_inc(cv);
2334 else { /* save temporaries on recursion? */
2335 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION))
2336 sub_crush_depth(cv);
2337 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2338 AV *newpad = newAV();
2339 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2340 I32 ix = AvFILLp((AV*)svp[1]);
2341 I32 names_fill = AvFILLp((AV*)svp[0]);
2342 svp = AvARRAY(svp[0]);
2343 for ( ;ix > 0; ix--) {
2344 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2345 char *name = SvPVX(svp[ix]);
2346 if ((SvFLAGS(svp[ix]) & SVf_FAKE)
2349 /* outer lexical or anon code */
2350 av_store(newpad, ix,
2351 SvREFCNT_inc(oldpad[ix]) );
2353 else { /* our own lexical */
2355 av_store(newpad, ix, sv = (SV*)newAV());
2356 else if (*name == '%')
2357 av_store(newpad, ix, sv = (SV*)newHV());
2359 av_store(newpad, ix, sv = NEWSV(0,0));
2363 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2364 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2367 av_store(newpad, ix, sv = NEWSV(0,0));
2371 if (cx->blk_sub.hasargs) {
2374 av_store(newpad, 0, (SV*)av);
2375 AvFLAGS(av) = AVf_REIFY;
2377 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2378 AvFILLp(padlist) = CvDEPTH(cv);
2379 svp = AvARRAY(padlist);
2383 if (!cx->blk_sub.hasargs) {
2384 AV* av = (AV*)PL_curpad[0];
2386 items = AvFILLp(av) + 1;
2388 /* Mark is at the end of the stack. */
2390 Copy(AvARRAY(av), SP + 1, items, SV*);
2395 #endif /* USE_THREADS */
2396 SAVEVPTR(PL_curpad);
2397 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2399 if (cx->blk_sub.hasargs)
2400 #endif /* USE_THREADS */
2402 AV* av = (AV*)PL_curpad[0];
2406 cx->blk_sub.savearray = GvAV(PL_defgv);
2407 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2408 #endif /* USE_THREADS */
2409 cx->blk_sub.oldcurpad = PL_curpad;
2410 cx->blk_sub.argarray = av;
2413 if (items >= AvMAX(av) + 1) {
2415 if (AvARRAY(av) != ary) {
2416 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2417 SvPVX(av) = (char*)ary;
2419 if (items >= AvMAX(av) + 1) {
2420 AvMAX(av) = items - 1;
2421 Renew(ary,items+1,SV*);
2423 SvPVX(av) = (char*)ary;
2426 Copy(mark,AvARRAY(av),items,SV*);
2427 AvFILLp(av) = items - 1;
2428 assert(!AvREAL(av));
2435 if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
2437 * We do not care about using sv to call CV;
2438 * it's for informational purposes only.
2440 SV *sv = GvSV(PL_DBsub);
2443 if (PERLDB_SUB_NN) {
2444 SvIVX(sv) = PTR2IV(cv); /* Already upgraded, saved */
2447 gv_efullname3(sv, CvGV(cv), Nullch);
2450 && (gotocv = get_cv("DB::goto", FALSE)) ) {
2451 PUSHMARK( PL_stack_sp );
2452 call_sv((SV*)gotocv, G_SCALAR | G_NODEBUG);
2456 RETURNOP(CvSTART(cv));
2460 label = SvPV(sv,n_a);
2461 if (!(do_dump || *label))
2462 DIE(aTHX_ must_have_label);
2465 else if (PL_op->op_flags & OPf_SPECIAL) {
2467 DIE(aTHX_ must_have_label);
2470 label = cPVOP->op_pv;
2472 if (label && *label) {
2474 bool leaving_eval = FALSE;
2475 PERL_CONTEXT *last_eval_cx = 0;
2479 PL_lastgotoprobe = 0;
2481 for (ix = cxstack_ix; ix >= 0; ix--) {
2483 switch (CxTYPE(cx)) {
2485 leaving_eval = TRUE;
2486 if (CxREALEVAL(cx)) {
2487 gotoprobe = (last_eval_cx ?
2488 last_eval_cx->blk_eval.old_eval_root :
2493 /* else fall through */
2495 gotoprobe = cx->blk_oldcop->op_sibling;
2501 gotoprobe = cx->blk_oldcop->op_sibling;
2503 gotoprobe = PL_main_root;
2506 if (CvDEPTH(cx->blk_sub.cv)) {
2507 gotoprobe = CvROOT(cx->blk_sub.cv);
2513 DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
2516 DIE(aTHX_ "panic: goto");
2517 gotoprobe = PL_main_root;
2521 retop = dofindlabel(gotoprobe, label,
2522 enterops, enterops + GOTO_DEPTH);
2526 PL_lastgotoprobe = gotoprobe;
2529 DIE(aTHX_ "Can't find label %s", label);
2531 /* if we're leaving an eval, check before we pop any frames
2532 that we're not going to punt, otherwise the error
2535 if (leaving_eval && *enterops && enterops[1]) {
2537 for (i = 1; enterops[i]; i++)
2538 if (enterops[i]->op_type == OP_ENTERITER)
2539 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2542 /* pop unwanted frames */
2544 if (ix < cxstack_ix) {
2551 oldsave = PL_scopestack[PL_scopestack_ix];
2552 LEAVE_SCOPE(oldsave);
2555 /* push wanted frames */
2557 if (*enterops && enterops[1]) {
2559 for (ix = 1; enterops[ix]; ix++) {
2560 PL_op = enterops[ix];
2561 /* Eventually we may want to stack the needed arguments
2562 * for each op. For now, we punt on the hard ones. */
2563 if (PL_op->op_type == OP_ENTERITER)
2564 DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
2565 CALL_FPTR(PL_op->op_ppaddr)(aTHX);
2573 if (!retop) retop = PL_main_start;
2575 PL_restartop = retop;
2576 PL_do_undump = TRUE;
2580 PL_restartop = 0; /* hmm, must be GNU unexec().. */
2581 PL_do_undump = FALSE;
2597 if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
2601 PL_exit_flags |= PERL_EXIT_EXPECTED;
2603 PUSHs(&PL_sv_undef);
2611 NV value = SvNVx(GvSV(cCOP->cop_gv));
2612 register I32 match = I_32(value);
2615 if (((NV)match) > value)
2616 --match; /* was fractional--truncate other way */
2618 match -= cCOP->uop.scop.scop_offset;
2621 else if (match > cCOP->uop.scop.scop_max)
2622 match = cCOP->uop.scop.scop_max;
2623 PL_op = cCOP->uop.scop.scop_next[match];
2633 PL_op = PL_op->op_next; /* can't assume anything */
2636 match = *(SvPVx(GvSV(cCOP->cop_gv), n_a)) & 255;
2637 match -= cCOP->uop.scop.scop_offset;
2640 else if (match > cCOP->uop.scop.scop_max)
2641 match = cCOP->uop.scop.scop_max;
2642 PL_op = cCOP->uop.scop.scop_next[match];
2651 S_save_lines(pTHX_ AV *array, SV *sv)
2653 register char *s = SvPVX(sv);
2654 register char *send = SvPVX(sv) + SvCUR(sv);
2656 register I32 line = 1;
2658 while (s && s < send) {
2659 SV *tmpstr = NEWSV(85,0);
2661 sv_upgrade(tmpstr, SVt_PVMG);
2662 t = strchr(s, '\n');
2668 sv_setpvn(tmpstr, s, t - s);
2669 av_store(array, line++, tmpstr);
2674 #ifdef PERL_FLEXIBLE_EXCEPTIONS
2676 S_docatch_body(pTHX_ va_list args)
2678 return docatch_body();
2683 S_docatch_body(pTHX)
2690 S_docatch(pTHX_ OP *o)
2694 volatile PERL_SI *cursi = PL_curstackinfo;
2698 assert(CATCH_GET == TRUE);
2701 #ifdef PERL_FLEXIBLE_EXCEPTIONS
2703 CALLPROTECT(aTHX_ pcur_env, &ret, MEMBER_TO_FPTR(S_docatch_body));
2709 #ifndef PERL_FLEXIBLE_EXCEPTIONS
2715 if (PL_restartop && cursi == PL_curstackinfo) {
2716 PL_op = PL_restartop;
2733 Perl_sv_compile_2op(pTHX_ SV *sv, OP** startop, char *code, AV** avp)
2734 /* sv Text to convert to OP tree. */
2735 /* startop op_free() this to undo. */
2736 /* code Short string id of the caller. */
2738 dSP; /* Make POPBLOCK work. */
2741 I32 gimme = 0; /* SUSPECT - INITIALZE TO WHAT? NI-S */
2745 char tbuf[TYPE_DIGITS(long) + 12 + 10];
2746 char *tmpbuf = tbuf;
2752 /* switch to eval mode */
2754 if (PL_curcop == &PL_compiling) {
2755 SAVECOPSTASH_FREE(&PL_compiling);
2756 CopSTASH_set(&PL_compiling, PL_curstash);
2758 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
2759 SV *sv = sv_newmortal();
2760 Perl_sv_setpvf(aTHX_ sv, "_<(%.10seval %lu)[%s:%"IVdf"]",
2761 code, (unsigned long)++PL_evalseq,
2762 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
2766 sprintf(tmpbuf, "_<(%.10s_eval %lu)", code, (unsigned long)++PL_evalseq);
2767 SAVECOPFILE_FREE(&PL_compiling);
2768 CopFILE_set(&PL_compiling, tmpbuf+2);
2769 SAVECOPLINE(&PL_compiling);
2770 CopLINE_set(&PL_compiling, 1);
2771 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
2772 deleting the eval's FILEGV from the stash before gv_check() runs
2773 (i.e. before run-time proper). To work around the coredump that
2774 ensues, we always turn GvMULTI_on for any globals that were
2775 introduced within evals. See force_ident(). GSAR 96-10-12 */
2776 safestr = savepv(tmpbuf);
2777 SAVEDELETE(PL_defstash, safestr, strlen(safestr));
2779 #ifdef OP_IN_REGISTER
2784 PL_hints &= HINT_UTF8;
2787 PL_op->op_type = OP_ENTEREVAL;
2788 PL_op->op_flags = 0; /* Avoid uninit warning. */
2789 PUSHBLOCK(cx, CXt_EVAL|(PL_curcop == &PL_compiling ? 0 : CXp_REAL), SP);
2790 PUSHEVAL(cx, 0, Nullgv);
2791 rop = doeval(G_SCALAR, startop);
2792 POPBLOCK(cx,PL_curpm);
2795 (*startop)->op_type = OP_NULL;
2796 (*startop)->op_ppaddr = PL_ppaddr[OP_NULL];
2798 *avp = (AV*)SvREFCNT_inc(PL_comppad);
2800 if (PL_curcop == &PL_compiling)
2801 PL_compiling.op_private = PL_hints;
2802 #ifdef OP_IN_REGISTER
2808 /* With USE_THREADS, eval_owner must be held on entry to doeval */
2810 S_doeval(pTHX_ int gimme, OP** startop)
2818 PL_in_eval = ((saveop && saveop->op_type == OP_REQUIRE)
2819 ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
2824 /* set up a scratch pad */
2827 SAVEVPTR(PL_curpad);
2828 SAVESPTR(PL_comppad);
2829 SAVESPTR(PL_comppad_name);
2830 SAVEI32(PL_comppad_name_fill);
2831 SAVEI32(PL_min_intro_pending);
2832 SAVEI32(PL_max_intro_pending);
2835 for (i = cxstack_ix - 1; i >= 0; i--) {
2836 PERL_CONTEXT *cx = &cxstack[i];
2837 if (CxTYPE(cx) == CXt_EVAL)
2839 else if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
2840 caller = cx->blk_sub.cv;
2845 SAVESPTR(PL_compcv);
2846 PL_compcv = (CV*)NEWSV(1104,0);
2847 sv_upgrade((SV *)PL_compcv, SVt_PVCV);
2848 CvEVAL_on(PL_compcv);
2849 assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
2850 cxstack[cxstack_ix].blk_eval.cv = PL_compcv;
2853 CvOWNER(PL_compcv) = 0;
2854 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
2855 MUTEX_INIT(CvMUTEXP(PL_compcv));
2856 #endif /* USE_THREADS */
2858 PL_comppad = newAV();
2859 av_push(PL_comppad, Nullsv);
2860 PL_curpad = AvARRAY(PL_comppad);
2861 PL_comppad_name = newAV();
2862 PL_comppad_name_fill = 0;
2863 PL_min_intro_pending = 0;
2866 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
2867 PL_curpad[0] = (SV*)newAV();
2868 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
2869 #endif /* USE_THREADS */
2871 comppadlist = newAV();
2872 AvREAL_off(comppadlist);
2873 av_store(comppadlist, 0, (SV*)PL_comppad_name);
2874 av_store(comppadlist, 1, (SV*)PL_comppad);
2875 CvPADLIST(PL_compcv) = comppadlist;
2878 (saveop->op_type != OP_REQUIRE && saveop->op_type != OP_DOFILE))
2880 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(caller);
2883 SAVEMORTALIZESV(PL_compcv); /* must remain until end of current statement */
2885 /* make sure we compile in the right package */
2887 if (CopSTASH_ne(PL_curcop, PL_curstash)) {
2888 SAVESPTR(PL_curstash);
2889 PL_curstash = CopSTASH(PL_curcop);
2891 SAVESPTR(PL_beginav);
2892 PL_beginav = newAV();
2893 SAVEFREESV(PL_beginav);
2894 SAVEI32(PL_error_count);
2896 /* try to compile it */
2898 PL_eval_root = Nullop;
2900 PL_curcop = &PL_compiling;
2901 PL_curcop->cop_arybase = 0;
2902 SvREFCNT_dec(PL_rs);
2903 PL_rs = newSVpvn("\n", 1);
2904 if (saveop && saveop->op_flags & OPf_SPECIAL)
2905 PL_in_eval |= EVAL_KEEPERR;
2908 if (yyparse() || PL_error_count || !PL_eval_root) {
2912 I32 optype = 0; /* Might be reset by POPEVAL. */
2917 op_free(PL_eval_root);
2918 PL_eval_root = Nullop;
2920 SP = PL_stack_base + POPMARK; /* pop original mark */
2922 POPBLOCK(cx,PL_curpm);
2928 if (optype == OP_REQUIRE) {
2929 char* msg = SvPVx(ERRSV, n_a);
2930 DIE(aTHX_ "%sCompilation failed in require",
2931 *msg ? msg : "Unknown error\n");
2934 char* msg = SvPVx(ERRSV, n_a);
2936 POPBLOCK(cx,PL_curpm);
2938 Perl_croak(aTHX_ "%sCompilation failed in regexp",
2939 (*msg ? msg : "Unknown error\n"));
2941 SvREFCNT_dec(PL_rs);
2942 PL_rs = SvREFCNT_inc(PL_nrs);
2944 MUTEX_LOCK(&PL_eval_mutex);
2946 COND_SIGNAL(&PL_eval_cond);
2947 MUTEX_UNLOCK(&PL_eval_mutex);
2948 #endif /* USE_THREADS */
2951 SvREFCNT_dec(PL_rs);
2952 PL_rs = SvREFCNT_inc(PL_nrs);
2953 CopLINE_set(&PL_compiling, 0);
2955 *startop = PL_eval_root;
2956 SvREFCNT_dec(CvOUTSIDE(PL_compcv));
2957 CvOUTSIDE(PL_compcv) = Nullcv;
2959 SAVEFREEOP(PL_eval_root);
2961 scalarvoid(PL_eval_root);
2962 else if (gimme & G_ARRAY)
2965 scalar(PL_eval_root);
2967 DEBUG_x(dump_eval());
2969 /* Register with debugger: */
2970 if (PERLDB_INTER && saveop->op_type == OP_REQUIRE) {
2971 CV *cv = get_cv("DB::postponed", FALSE);
2975 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2977 call_sv((SV*)cv, G_DISCARD);
2981 /* compiled okay, so do it */
2983 CvDEPTH(PL_compcv) = 1;
2984 SP = PL_stack_base + POPMARK; /* pop original mark */
2985 PL_op = saveop; /* The caller may need it. */
2986 PL_lex_state = LEX_NOTPARSING; /* $^S needs this. */
2988 MUTEX_LOCK(&PL_eval_mutex);
2990 COND_SIGNAL(&PL_eval_cond);
2991 MUTEX_UNLOCK(&PL_eval_mutex);
2992 #endif /* USE_THREADS */
2994 RETURNOP(PL_eval_start);
2998 S_doopen_pmc(pTHX_ const char *name, const char *mode)
3000 STRLEN namelen = strlen(name);
3003 if (namelen > 3 && strEQ(name + namelen - 3, ".pm")) {
3004 SV *pmcsv = Perl_newSVpvf(aTHX_ "%s%c", name, 'c');
3005 char *pmc = SvPV_nolen(pmcsv);
3008 if (PerlLIO_stat(pmc, &pmcstat) < 0) {
3009 fp = PerlIO_open(name, mode);
3012 if (PerlLIO_stat(name, &pmstat) < 0 ||
3013 pmstat.st_mtime < pmcstat.st_mtime)
3015 fp = PerlIO_open(pmc, mode);
3018 fp = PerlIO_open(name, mode);
3021 SvREFCNT_dec(pmcsv);
3024 fp = PerlIO_open(name, mode);
3032 register PERL_CONTEXT *cx;
3036 char *tryname = Nullch;
3037 SV *namesv = Nullsv;
3039 I32 gimme = GIMME_V;
3040 PerlIO *tryrsfp = 0;
3042 int filter_has_file = 0;
3043 GV *filter_child_proc = 0;
3044 SV *filter_state = 0;
3049 if (SvPOK(sv) && SvNOK(sv) && SvNV(sv)) { /* require v5.6.1 */
3050 UV rev = 0, ver = 0, sver = 0;
3052 U8 *s = (U8*)SvPVX(sv);
3053 U8 *end = (U8*)SvPVX(sv) + SvCUR(sv);
3055 rev = utf8n_to_uvchr(s, end - s, &len, 0);
3058 ver = utf8n_to_uvchr(s, end - s, &len, 0);
3061 sver = utf8n_to_uvchr(s, end - s, &len, 0);
3064 if (PERL_REVISION < rev
3065 || (PERL_REVISION == rev
3066 && (PERL_VERSION < ver
3067 || (PERL_VERSION == ver
3068 && PERL_SUBVERSION < sver))))
3070 DIE(aTHX_ "Perl v%"UVuf".%"UVuf".%"UVuf" required--this is only "
3071 "v%d.%d.%d, stopped", rev, ver, sver, PERL_REVISION,
3072 PERL_VERSION, PERL_SUBVERSION);
3076 else if (!SvPOKp(sv)) { /* require 5.005_03 */
3077 if ((NV)PERL_REVISION + ((NV)PERL_VERSION/(NV)1000)
3078 + ((NV)PERL_SUBVERSION/(NV)1000000)
3079 + 0.00000099 < SvNV(sv))
3083 NV nver = (nrev - rev) * 1000;
3084 UV ver = (UV)(nver + 0.0009);
3085 NV nsver = (nver - ver) * 1000;
3086 UV sver = (UV)(nsver + 0.0009);
3088 /* help out with the "use 5.6" confusion */
3089 if (sver == 0 && (rev > 5 || (rev == 5 && ver >= 100))) {
3090 DIE(aTHX_ "Perl v%"UVuf".%"UVuf".%"UVuf" required--"
3091 "this is only v%d.%d.%d, stopped"
3092 " (did you mean v%"UVuf".%"UVuf".0?)",
3093 rev, ver, sver, PERL_REVISION, PERL_VERSION,
3094 PERL_SUBVERSION, rev, ver/100);
3097 DIE(aTHX_ "Perl v%"UVuf".%"UVuf".%"UVuf" required--"
3098 "this is only v%d.%d.%d, stopped",
3099 rev, ver, sver, PERL_REVISION, PERL_VERSION,
3106 name = SvPV(sv, len);
3107 if (!(name && len > 0 && *name))
3108 DIE(aTHX_ "Null filename used");
3109 TAINT_PROPER("require");
3110 if (PL_op->op_type == OP_REQUIRE &&
3111 (svp = hv_fetch(GvHVn(PL_incgv), name, len, 0)) &&
3112 *svp != &PL_sv_undef)
3115 /* prepare to compile file */
3117 #ifdef MACOS_TRADITIONAL
3118 if (PERL_FILE_IS_ABSOLUTE(name)
3119 || (*name == ':' && name[1] != ':' && strchr(name+2, ':')))
3122 tryrsfp = doopen_pmc(name,PERL_SCRIPT_MODE);
3123 /* We consider paths of the form :a:b ambiguous and interpret them first
3124 as global then as local
3126 if (!tryrsfp && *name == ':' && name[1] != ':' && strchr(name+2, ':'))
3132 if (PERL_FILE_IS_ABSOLUTE(name)
3133 || (*name == '.' && (name[1] == '/' ||
3134 (name[1] == '.' && name[2] == '/'))))
3137 tryrsfp = doopen_pmc(name,PERL_SCRIPT_MODE);
3141 AV *ar = GvAVn(PL_incgv);
3145 if ((unixname = tounixspec(name, Nullch)) != Nullch)
3148 namesv = NEWSV(806, 0);
3149 for (i = 0; i <= AvFILL(ar); i++) {
3150 SV *dirsv = *av_fetch(ar, i, TRUE);
3156 if (SvTYPE(SvRV(loader)) == SVt_PVAV) {
3157 loader = *av_fetch((AV *)SvRV(loader), 0, TRUE);
3160 Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
3161 PTR2UV(SvANY(loader)), name);
3162 tryname = SvPVX(namesv);
3173 if (sv_isobject(loader))
3174 count = call_method("INC", G_ARRAY);
3176 count = call_sv(loader, G_ARRAY);
3186 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVGV) {
3190 if (SvTYPE(arg) == SVt_PVGV) {
3191 IO *io = GvIO((GV *)arg);
3196 tryrsfp = IoIFP(io);
3197 if (IoTYPE(io) == IoTYPE_PIPE) {
3198 /* reading from a child process doesn't
3199 nest -- when returning from reading
3200 the inner module, the outer one is
3201 unreadable (closed?) I've tried to
3202 save the gv to manage the lifespan of
3203 the pipe, but this didn't help. XXX */
3204 filter_child_proc = (GV *)arg;
3205 (void)SvREFCNT_inc(filter_child_proc);
3208 if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
3209 PerlIO_close(IoOFP(io));
3221 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
3223 (void)SvREFCNT_inc(filter_sub);
3226 filter_state = SP[i];
3227 (void)SvREFCNT_inc(filter_state);
3231 tryrsfp = PerlIO_open("/dev/null",
3245 filter_has_file = 0;
3246 if (filter_child_proc) {
3247 SvREFCNT_dec(filter_child_proc);
3248 filter_child_proc = 0;
3251 SvREFCNT_dec(filter_state);
3255 SvREFCNT_dec(filter_sub);
3260 char *dir = SvPVx(dirsv, n_a);
3261 #ifdef MACOS_TRADITIONAL
3263 Perl_sv_setpvf(aTHX_ namesv, "%s%s", MacPerl_CanonDir(dir, buf), name+(name[0] == ':'));
3267 if ((unixdir = tounixpath(dir, Nullch)) == Nullch)
3269 sv_setpv(namesv, unixdir);
3270 sv_catpv(namesv, unixname);
3272 Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
3275 TAINT_PROPER("require");
3276 tryname = SvPVX(namesv);
3277 #ifdef MACOS_TRADITIONAL
3279 /* Convert slashes in the name part, but not the directory part, to colons */
3281 for (colon = tryname+strlen(dir); colon = strchr(colon, '/'); )
3285 tryrsfp = doopen_pmc(tryname, PERL_SCRIPT_MODE);
3287 if (tryname[0] == '.' && tryname[1] == '/')
3295 SAVECOPFILE_FREE(&PL_compiling);
3296 CopFILE_set(&PL_compiling, tryrsfp ? tryname : name);
3297 SvREFCNT_dec(namesv);
3299 if (PL_op->op_type == OP_REQUIRE) {
3300 char *msgstr = name;
3301 if (namesv) { /* did we lookup @INC? */
3302 SV *msg = sv_2mortal(newSVpv(msgstr,0));
3303 SV *dirmsgsv = NEWSV(0, 0);
3304 AV *ar = GvAVn(PL_incgv);
3306 sv_catpvn(msg, " in @INC", 8);
3307 if (instr(SvPVX(msg), ".h "))
3308 sv_catpv(msg, " (change .h to .ph maybe?)");
3309 if (instr(SvPVX(msg), ".ph "))
3310 sv_catpv(msg, " (did you run h2ph?)");
3311 sv_catpv(msg, " (@INC contains:");
3312 for (i = 0; i <= AvFILL(ar); i++) {
3313 char *dir = SvPVx(*av_fetch(ar, i, TRUE), n_a);
3314 Perl_sv_setpvf(aTHX_ dirmsgsv, " %s", dir);
3315 sv_catsv(msg, dirmsgsv);
3317 sv_catpvn(msg, ")", 1);
3318 SvREFCNT_dec(dirmsgsv);
3319 msgstr = SvPV_nolen(msg);
3321 DIE(aTHX_ "Can't locate %s", msgstr);
3327 SETERRNO(0, SS$_NORMAL);
3329 /* Assume success here to prevent recursive requirement. */
3330 (void)hv_store(GvHVn(PL_incgv), name, strlen(name),
3331 newSVpv(CopFILE(&PL_compiling), 0), 0 );
3335 lex_start(sv_2mortal(newSVpvn("",0)));
3336 SAVEGENERICSV(PL_rsfp_filters);
3337 PL_rsfp_filters = Nullav;
3342 SAVESPTR(PL_compiling.cop_warnings);
3343 if (PL_dowarn & G_WARN_ALL_ON)
3344 PL_compiling.cop_warnings = pWARN_ALL ;
3345 else if (PL_dowarn & G_WARN_ALL_OFF)
3346 PL_compiling.cop_warnings = pWARN_NONE ;
3348 PL_compiling.cop_warnings = pWARN_STD ;
3349 SAVESPTR(PL_compiling.cop_io);
3350 PL_compiling.cop_io = Nullsv;
3352 if (filter_sub || filter_child_proc) {
3353 SV *datasv = filter_add(run_user_filter, Nullsv);
3354 IoLINES(datasv) = filter_has_file;
3355 IoFMT_GV(datasv) = (GV *)filter_child_proc;
3356 IoTOP_GV(datasv) = (GV *)filter_state;
3357 IoBOTTOM_GV(datasv) = (GV *)filter_sub;
3360 /* switch to eval mode */
3361 push_return(PL_op->op_next);
3362 PUSHBLOCK(cx, CXt_EVAL, SP);
3363 PUSHEVAL(cx, name, Nullgv);
3365 SAVECOPLINE(&PL_compiling);
3366 CopLINE_set(&PL_compiling, 0);
3370 MUTEX_LOCK(&PL_eval_mutex);
3371 if (PL_eval_owner && PL_eval_owner != thr)
3372 while (PL_eval_owner)
3373 COND_WAIT(&PL_eval_cond, &PL_eval_mutex);
3374 PL_eval_owner = thr;
3375 MUTEX_UNLOCK(&PL_eval_mutex);
3376 #endif /* USE_THREADS */
3377 return DOCATCH(doeval(gimme, NULL));
3382 return pp_require();
3388 register PERL_CONTEXT *cx;
3390 I32 gimme = GIMME_V, was = PL_sub_generation;
3391 char tbuf[TYPE_DIGITS(long) + 12];
3392 char *tmpbuf = tbuf;
3397 if (!SvPV(sv,len) || !len)
3399 TAINT_PROPER("eval");
3405 /* switch to eval mode */
3407 if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
3408 SV *sv = sv_newmortal();
3409 Perl_sv_setpvf(aTHX_ sv, "_<(eval %lu)[%s:%"IVdf"]",
3410 (unsigned long)++PL_evalseq,
3411 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
3415 sprintf(tmpbuf, "_<(eval %lu)", (unsigned long)++PL_evalseq);
3416 SAVECOPFILE_FREE(&PL_compiling);
3417 CopFILE_set(&PL_compiling, tmpbuf+2);
3418 SAVECOPLINE(&PL_compiling);
3419 CopLINE_set(&PL_compiling, 1);
3420 /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
3421 deleting the eval's FILEGV from the stash before gv_check() runs
3422 (i.e. before run-time proper). To work around the coredump that
3423 ensues, we always turn GvMULTI_on for any globals that were
3424 introduced within evals. See force_ident(). GSAR 96-10-12 */
3425 safestr = savepv(tmpbuf);
3426 SAVEDELETE(PL_defstash, safestr, strlen(safestr));
3428 PL_hints = PL_op->op_targ;
3429 SAVESPTR(PL_compiling.cop_warnings);
3430 if (specialWARN(PL_curcop->cop_warnings))
3431 PL_compiling.cop_warnings = PL_curcop->cop_warnings;
3433 PL_compiling.cop_warnings = newSVsv(PL_curcop->cop_warnings);
3434 SAVEFREESV(PL_compiling.cop_warnings);
3436 SAVESPTR(PL_compiling.cop_io);
3437 if (specialCopIO(PL_curcop->cop_io))
3438 PL_compiling.cop_io = PL_curcop->cop_io;
3440 PL_compiling.cop_io = newSVsv(PL_curcop->cop_io);
3441 SAVEFREESV(PL_compiling.cop_io);
3444 push_return(PL_op->op_next);
3445 PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
3446 PUSHEVAL(cx, 0, Nullgv);
3448 /* prepare to compile string */
3450 if (PERLDB_LINE && PL_curstash != PL_debstash)
3451 save_lines(CopFILEAV(&PL_compiling), PL_linestr);
3454 MUTEX_LOCK(&PL_eval_mutex);
3455 if (PL_eval_owner && PL_eval_owner != thr)
3456 while (PL_eval_owner)
3457 COND_WAIT(&PL_eval_cond, &PL_eval_mutex);
3458 PL_eval_owner = thr;
3459 MUTEX_UNLOCK(&PL_eval_mutex);
3460 #endif /* USE_THREADS */
3461 ret = doeval(gimme, NULL);
3462 if (PERLDB_INTER && was != PL_sub_generation /* Some subs defined here. */
3463 && ret != PL_op->op_next) { /* Successive compilation. */
3464 strcpy(safestr, "_<(eval )"); /* Anything fake and short. */
3466 return DOCATCH(ret);
3476 register PERL_CONTEXT *cx;
3478 U8 save_flags = PL_op -> op_flags;
3483 retop = pop_return();
3486 if (gimme == G_VOID)
3488 else if (gimme == G_SCALAR) {
3491 if (SvFLAGS(TOPs) & SVs_TEMP)
3494 *MARK = sv_mortalcopy(TOPs);
3498 *MARK = &PL_sv_undef;
3503 /* in case LEAVE wipes old return values */
3504 for (mark = newsp + 1; mark <= SP; mark++) {
3505 if (!(SvFLAGS(*mark) & SVs_TEMP)) {
3506 *mark = sv_mortalcopy(*mark);
3507 TAINT_NOT; /* Each item is independent */
3511 PL_curpm = newpm; /* Don't pop $1 et al till now */
3514 assert(CvDEPTH(PL_compcv) == 1);
3516 CvDEPTH(PL_compcv) = 0;
3519 if (optype == OP_REQUIRE &&
3520 !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
3522 /* Unassume the success we assumed earlier. */
3523 SV *nsv = cx->blk_eval.old_namesv;
3524 (void)hv_delete(GvHVn(PL_incgv), SvPVX(nsv), SvCUR(nsv), G_DISCARD);
3525 retop = Perl_die(aTHX_ "%s did not return a true value", SvPVX(nsv));
3526 /* die_where() did LEAVE, or we won't be here */
3530 if (!(save_flags & OPf_SPECIAL))
3540 register PERL_CONTEXT *cx;
3541 I32 gimme = GIMME_V;
3546 push_return(cLOGOP->op_other->op_next);
3547 PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), SP);
3550 PL_in_eval = EVAL_INEVAL;
3553 return DOCATCH(PL_op->op_next);
3563 register PERL_CONTEXT *cx;
3571 if (gimme == G_VOID)
3573 else if (gimme == G_SCALAR) {
3576 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
3579 *MARK = sv_mortalcopy(TOPs);
3583 *MARK = &PL_sv_undef;
3588 /* in case LEAVE wipes old return values */
3589 for (mark = newsp + 1; mark <= SP; mark++) {
3590 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
3591 *mark = sv_mortalcopy(*mark);
3592 TAINT_NOT; /* Each item is independent */
3596 PL_curpm = newpm; /* Don't pop $1 et al till now */
3604 S_doparseform(pTHX_ SV *sv)
3607 register char *s = SvPV_force(sv, len);
3608 register char *send = s + len;
3609 register char *base = Nullch;
3610 register I32 skipspaces = 0;
3611 bool noblank = FALSE;
3612 bool repeat = FALSE;
3613 bool postspace = FALSE;
3621 Perl_croak(aTHX_ "Null picture in formline");
3623 New(804, fops, (send - s)*3+10, U16); /* Almost certainly too long... */
3628 *fpc++ = FF_LINEMARK;
3629 noblank = repeat = FALSE;
3647 case ' ': case '\t':
3658 *fpc++ = FF_LITERAL;
3666 *fpc++ = skipspaces;
3670 *fpc++ = FF_NEWLINE;
3674 arg = fpc - linepc + 1;
3681 *fpc++ = FF_LINEMARK;
3682 noblank = repeat = FALSE;
3691 ischop = s[-1] == '^';
3697 arg = (s - base) - 1;
3699 *fpc++ = FF_LITERAL;
3708 *fpc++ = FF_LINEGLOB;
3710 else if (*s == '#' || (*s == '.' && s[1] == '#')) {
3711 arg = ischop ? 512 : 0;
3721 arg |= 256 + (s - f);
3723 *fpc++ = s - base; /* fieldsize for FETCH */
3724 *fpc++ = FF_DECIMAL;
3727 else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
3728 arg = ischop ? 512 : 0;
3730 s++; /* skip the '0' first */
3739 arg |= 256 + (s - f);
3741 *fpc++ = s - base; /* fieldsize for FETCH */
3742 *fpc++ = FF_0DECIMAL;
3747 bool ismore = FALSE;
3750 while (*++s == '>') ;
3751 prespace = FF_SPACE;
3753 else if (*s == '|') {
3754 while (*++s == '|') ;
3755 prespace = FF_HALFSPACE;
3760 while (*++s == '<') ;
3763 if (*s == '.' && s[1] == '.' && s[2] == '.') {
3767 *fpc++ = s - base; /* fieldsize for FETCH */
3769 *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
3787 { /* need to jump to the next word */
3789 z = WORD_ALIGN - SvCUR(sv) % WORD_ALIGN;
3790 SvGROW(sv, SvCUR(sv) + z + arg * sizeof(U16) + 4);
3791 s = SvPVX(sv) + SvCUR(sv) + z;
3793 Copy(fops, s, arg, U16);
3795 sv_magic(sv, Nullsv, PERL_MAGIC_fm, Nullch, 0);
3800 * The mergesort implementation is by Peter M. Mcilroy <pmcilroy@lucent.com>.
3802 * The original code was written in conjunction with BSD Computer Software
3803 * Research Group at University of California, Berkeley.
3805 * See also: "Optimistic Merge Sort" (SODA '92)
3807 * The integration to Perl is by John P. Linderman <jpl@research.att.com>.
3809 * The code can be distributed under the same terms as Perl itself.
3814 #include <sys/types.h>
3819 #define New(ID,VAR,N,TYPE) VAR=(TYPE *)malloc((N)*sizeof(TYPE))
3820 #define Safefree(VAR) free(VAR)
3821 typedef int (*SVCOMPARE_t) (pTHXo_ SV*, SV*);
3822 #endif /* TESTHARNESS */
3824 typedef char * aptr; /* pointer for arithmetic on sizes */
3825 typedef SV * gptr; /* pointers in our lists */
3827 /* Binary merge internal sort, with a few special mods
3828 ** for the special perl environment it now finds itself in.
3830 ** Things that were once options have been hotwired
3831 ** to values suitable for this use. In particular, we'll always
3832 ** initialize looking for natural runs, we'll always produce stable
3833 ** output, and we'll always do Peter McIlroy's binary merge.
3836 /* Pointer types for arithmetic and storage and convenience casts */
3838 #define APTR(P) ((aptr)(P))
3839 #define GPTP(P) ((gptr *)(P))
3840 #define GPPP(P) ((gptr **)(P))
3843 /* byte offset from pointer P to (larger) pointer Q */
3844 #define BYTEOFF(P, Q) (APTR(Q) - APTR(P))
3846 #define PSIZE sizeof(gptr)
3848 /* If PSIZE is power of 2, make PSHIFT that power, if that helps */
3851 #define PNELEM(P, Q) (BYTEOFF(P,Q) >> (PSHIFT))
3852 #define PNBYTE(N) ((N) << (PSHIFT))
3853 #define PINDEX(P, N) (GPTP(APTR(P) + PNBYTE(N)))
3855 /* Leave optimization to compiler */
3856 #define PNELEM(P, Q) (GPTP(Q) - GPTP(P))
3857 #define PNBYTE(N) ((N) * (PSIZE))
3858 #define PINDEX(P, N) (GPTP(P) + (N))
3861 /* Pointer into other corresponding to pointer into this */
3862 #define POTHER(P, THIS, OTHER) GPTP(APTR(OTHER) + BYTEOFF(THIS,P))
3864 #define FROMTOUPTO(src, dst, lim) do *dst++ = *src++; while(src<lim)
3867 /* Runs are identified by a pointer in the auxilliary list.
3868 ** The pointer is at the start of the list,
3869 ** and it points to the start of the next list.
3870 ** NEXT is used as an lvalue, too.
3873 #define NEXT(P) (*GPPP(P))
3876 /* PTHRESH is the minimum number of pairs with the same sense to justify
3877 ** checking for a run and extending it. Note that PTHRESH counts PAIRS,
3878 ** not just elements, so PTHRESH == 8 means a run of 16.
3883 /* RTHRESH is the number of elements in a run that must compare low
3884 ** to the low element from the opposing run before we justify
3885 ** doing a binary rampup instead of single stepping.
3886 ** In random input, N in a row low should only happen with
3887 ** probability 2^(1-N), so we can risk that we are dealing
3888 ** with orderly input without paying much when we aren't.
3895 ** Overview of algorithm and variables.
3896 ** The array of elements at list1 will be organized into runs of length 2,
3897 ** or runs of length >= 2 * PTHRESH. We only try to form long runs when
3898 ** PTHRESH adjacent pairs compare in the same way, suggesting overall order.
3900 ** Unless otherwise specified, pair pointers address the first of two elements.
3902 ** b and b+1 are a pair that compare with sense ``sense''.
3903 ** b is the ``bottom'' of adjacent pairs that might form a longer run.
3905 ** p2 parallels b in the list2 array, where runs are defined by
3908 ** t represents the ``top'' of the adjacent pairs that might extend
3909 ** the run beginning at b. Usually, t addresses a pair
3910 ** that compares with opposite sense from (b,b+1).
3911 ** However, it may also address a singleton element at the end of list1,
3912 ** or it may be equal to ``last'', the first element beyond list1.
3914 ** r addresses the Nth pair following b. If this would be beyond t,
3915 ** we back it off to t. Only when r is less than t do we consider the
3916 ** run long enough to consider checking.
3918 ** q addresses a pair such that the pairs at b through q already form a run.
3919 ** Often, q will equal b, indicating we only are sure of the pair itself.
3920 ** However, a search on the previous cycle may have revealed a longer run,
3921 ** so q may be greater than b.
3923 ** p is used to work back from a candidate r, trying to reach q,
3924 ** which would mean b through r would be a run. If we discover such a run,
3925 ** we start q at r and try to push it further towards t.
3926 ** If b through r is NOT a run, we detect the wrong order at (p-1,p).
3927 ** In any event, after the check (if any), we have two main cases.
3929 ** 1) Short run. b <= q < p <= r <= t.
3930 ** b through q is a run (perhaps trivial)
3931 ** q through p are uninteresting pairs
3932 ** p through r is a run
3934 ** 2) Long run. b < r <= q < t.
3935 ** b through q is a run (of length >= 2 * PTHRESH)
3937 ** Note that degenerate cases are not only possible, but likely.
3938 ** For example, if the pair following b compares with opposite sense,
3939 ** then b == q < p == r == t.
3944 dynprep(pTHX_ gptr *list1, gptr *list2, size_t nmemb, SVCOMPARE_t cmp)
3947 register gptr *b, *p, *q, *t, *p2;
3948 register gptr c, *last, *r;
3952 last = PINDEX(b, nmemb);
3953 sense = (cmp(aTHX_ *b, *(b+1)) > 0);
3954 for (p2 = list2; b < last; ) {
3955 /* We just started, or just reversed sense.
3956 ** Set t at end of pairs with the prevailing sense.
3958 for (p = b+2, t = p; ++p < last; t = ++p) {
3959 if ((cmp(aTHX_ *t, *p) > 0) != sense) break;
3962 /* Having laid out the playing field, look for long runs */
3964 p = r = b + (2 * PTHRESH);
3965 if (r >= t) p = r = t; /* too short to care about */
3967 while (((cmp(aTHX_ *(p-1), *p) > 0) == sense) &&
3970 /* b through r is a (long) run.
3971 ** Extend it as far as possible.
3974 while (((p += 2) < t) &&
3975 ((cmp(aTHX_ *(p-1), *p) > 0) == sense)) q = p;
3976 r = p = q + 2; /* no simple pairs, no after-run */
3979 if (q > b) { /* run of greater than 2 at b */
3982 /* pick up singleton, if possible */
3984 ((t + 1) == last) &&
3985 ((cmp(aTHX_ *(p-1), *p) > 0) == sense))
3986 savep = r = p = q = last;
3987 p2 = NEXT(p2) = p2 + (p - b);
3988 if (sense) while (b < --p) {
3995 while (q < p) { /* simple pairs */
3996 p2 = NEXT(p2) = p2 + 2;
4003 if (((b = p) == t) && ((t+1) == last)) {
4015 /* Overview of bmerge variables:
4017 ** list1 and list2 address the main and auxiliary arrays.
4018 ** They swap identities after each merge pass.
4019 ** Base points to the original list1, so we can tell if
4020 ** the pointers ended up where they belonged (or must be copied).
4022 ** When we are merging two lists, f1 and f2 are the next elements
4023 ** on the respective lists. l1 and l2 mark the end of the lists.
4024 ** tp2 is the current location in the merged list.
4026 ** p1 records where f1 started.
4027 ** After the merge, a new descriptor is built there.
4029 ** p2 is a ``parallel'' pointer in (what starts as) descriptor space.
4030 ** It is used to identify and delimit the runs.
4032 ** In the heat of determining where q, the greater of the f1/f2 elements,
4033 ** belongs in the other list, b, t and p, represent bottom, top and probe
4034 ** locations, respectively, in the other list.
4035 ** They make convenient temporary pointers in other places.
4039 S_qsortsv(pTHX_ gptr *list1, size_t nmemb, SVCOMPARE_t cmp)
4043 register gptr *f1, *f2, *t, *b, *p, *tp2, *l1, *l2, *q;
4044 gptr *aux, *list2, *p2, *last;
4048 if (nmemb <= 1) return; /* sorted trivially */
4049 New(799,list2,nmemb,gptr); /* allocate auxilliary array */
4051 dynprep(aTHX_ list1, list2, nmemb, cmp);
4052 last = PINDEX(list2, nmemb);
4053 while (NEXT(list2) != last) {
4054 /* More than one run remains. Do some merging to reduce runs. */
4056 for (tp2 = p2 = list2; p2 != last;) {
4057 /* The new first run begins where the old second list ended.
4058 ** Use the p2 ``parallel'' pointer to identify the end of the run.
4062 f2 = l1 = POTHER(t, list2, list1);
4063 if (t != last) t = NEXT(t);
4064 l2 = POTHER(t, list2, list1);
4066 while (f1 < l1 && f2 < l2) {
4067 /* If head 1 is larger than head 2, find ALL the elements
4068 ** in list 2 strictly less than head1, write them all,
4069 ** then head 1. Then compare the new heads, and repeat,
4070 ** until one or both lists are exhausted.
4072 ** In all comparisons (after establishing
4073 ** which head to merge) the item to merge
4074 ** (at pointer q) is the first operand of
4075 ** the comparison. When we want to know
4076 ** if ``q is strictly less than the other'',
4078 ** cmp(q, other) < 0
4079 ** because stability demands that we treat equality
4080 ** as high when q comes from l2, and as low when
4081 ** q was from l1. So we ask the question by doing
4082 ** cmp(q, other) <= sense
4083 ** and make sense == 0 when equality should look low,
4084 ** and -1 when equality should look high.
4088 if (cmp(aTHX_ *f1, *f2) <= 0) {
4089 q = f2; b = f1; t = l1;
4092 q = f1; b = f2; t = l2;
4099 ** Leave t at something strictly
4100 ** greater than q (or at the end of the list),
4101 ** and b at something strictly less than q.
4103 for (i = 1, run = 0 ;;) {
4104 if ((p = PINDEX(b, i)) >= t) {
4106 if (((p = PINDEX(t, -1)) > b) &&
4107 (cmp(aTHX_ *q, *p) <= sense))
4111 } else if (cmp(aTHX_ *q, *p) <= sense) {
4115 if (++run >= RTHRESH) i += i;
4119 /* q is known to follow b and must be inserted before t.
4120 ** Increment b, so the range of possibilities is [b,t).
4121 ** Round binary split down, to favor early appearance.
4122 ** Adjust b and t until q belongs just before t.
4127 p = PINDEX(b, (PNELEM(b, t) - 1) / 2);
4128 if (cmp(aTHX_ *q, *p) <= sense) {
4134 /* Copy all the strictly low elements */
4137 FROMTOUPTO(f2, tp2, t);
4140 FROMTOUPTO(f1, tp2, t);
4146 /* Run out remaining list */
4148 if (f2 < l2) FROMTOUPTO(f2, tp2, l2);
4149 } else FROMTOUPTO(f1, tp2, l1);
4150 p1 = NEXT(p1) = POTHER(tp2, list2, list1);
4155 last = PINDEX(list2, nmemb);
4157 if (base == list2) {
4158 last = PINDEX(list1, nmemb);
4159 FROMTOUPTO(list1, list2, last);
4174 sortcv(pTHXo_ SV *a, SV *b)
4176 I32 oldsaveix = PL_savestack_ix;
4177 I32 oldscopeix = PL_scopestack_ix;
4179 GvSV(PL_firstgv) = a;
4180 GvSV(PL_secondgv) = b;
4181 PL_stack_sp = PL_stack_base;
4184 if (PL_stack_sp != PL_stack_base + 1)
4185 Perl_croak(aTHX_ "Sort subroutine didn't return single value");
4186 if (!SvNIOKp(*PL_stack_sp))
4187 Perl_croak(aTHX_ "Sort subroutine didn't return a numeric value");
4188 result = SvIV(*PL_stack_sp);
4189 while (PL_scopestack_ix > oldscopeix) {
4192 leave_scope(oldsaveix);
4197 sortcv_stacked(pTHXo_ SV *a, SV *b)
4199 I32 oldsaveix = PL_savestack_ix;
4200 I32 oldscopeix = PL_scopestack_ix;
4205 av = (AV*)PL_curpad[0];
4207 av = GvAV(PL_defgv);
4210 if (AvMAX(av) < 1) {
4211 SV** ary = AvALLOC(av);
4212 if (AvARRAY(av) != ary) {
4213 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
4214 SvPVX(av) = (char*)ary;
4216 if (AvMAX(av) < 1) {
4219 SvPVX(av) = (char*)ary;
4226 PL_stack_sp = PL_stack_base;
4229 if (PL_stack_sp != PL_stack_base + 1)
4230 Perl_croak(aTHX_ "Sort subroutine didn't return single value");
4231 if (!SvNIOKp(*PL_stack_sp))
4232 Perl_croak(aTHX_ "Sort subroutine didn't return a numeric value");
4233 result = SvIV(*PL_stack_sp);
4234 while (PL_scopestack_ix > oldscopeix) {
4237 leave_scope(oldsaveix);
4242 sortcv_xsub(pTHXo_ SV *a, SV *b)
4245 I32 oldsaveix = PL_savestack_ix;
4246 I32 oldscopeix = PL_scopestack_ix;
4248 CV *cv=(CV*)PL_sortcop;
4256 (void)(*CvXSUB(cv))(aTHXo_ cv);
4257 if (PL_stack_sp != PL_stack_base + 1)
4258 Perl_croak(aTHX_ "Sort subroutine didn't return single value");
4259 if (!SvNIOKp(*PL_stack_sp))
4260 Perl_croak(aTHX_ "Sort subroutine didn't return a numeric value");
4261 result = SvIV(*PL_stack_sp);
4262 while (PL_scopestack_ix > oldscopeix) {
4265 leave_scope(oldsaveix);
4271 sv_ncmp(pTHXo_ SV *a, SV *b)
4275 return nv1 < nv2 ? -1 : nv1 > nv2 ? 1 : 0;
4279 sv_i_ncmp(pTHXo_ SV *a, SV *b)
4283 return iv1 < iv2 ? -1 : iv1 > iv2 ? 1 : 0;
4285 #define tryCALL_AMAGICbin(left,right,meth,svp) STMT_START { \
4287 if (PL_amagic_generation) { \
4288 if (SvAMAGIC(left)||SvAMAGIC(right))\
4289 *svp = amagic_call(left, \
4297 amagic_ncmp(pTHXo_ register SV *a, register SV *b)
4300 tryCALL_AMAGICbin(a,b,ncmp,&tmpsv);
4305 I32 i = SvIVX(tmpsv);
4315 return sv_ncmp(aTHXo_ a, b);
4319 amagic_i_ncmp(pTHXo_ register SV *a, register SV *b)
4322 tryCALL_AMAGICbin(a,b,ncmp,&tmpsv);
4327 I32 i = SvIVX(tmpsv);
4337 return sv_i_ncmp(aTHXo_ a, b);
4341 amagic_cmp(pTHXo_ register SV *str1, register SV *str2)
4344 tryCALL_AMAGICbin(str1,str2,scmp,&tmpsv);
4349 I32 i = SvIVX(tmpsv);
4359 return sv_cmp(str1, str2);
4363 amagic_cmp_locale(pTHXo_ register SV *str1, register SV *str2)
4366 tryCALL_AMAGICbin(str1,str2,scmp,&tmpsv);
4371 I32 i = SvIVX(tmpsv);
4381 return sv_cmp_locale(str1, str2);
4385 run_user_filter(pTHXo_ int idx, SV *buf_sv, int maxlen)
4387 SV *datasv = FILTER_DATA(idx);
4388 int filter_has_file = IoLINES(datasv);
4389 GV *filter_child_proc = (GV *)IoFMT_GV(datasv);
4390 SV *filter_state = (SV *)IoTOP_GV(datasv);
4391 SV *filter_sub = (SV *)IoBOTTOM_GV(datasv);
4394 /* I was having segfault trouble under Linux 2.2.5 after a
4395 parse error occured. (Had to hack around it with a test
4396 for PL_error_count == 0.) Solaris doesn't segfault --
4397 not sure where the trouble is yet. XXX */
4399 if (filter_has_file) {
4400 len = FILTER_READ(idx+1, buf_sv, maxlen);
4403 if (filter_sub && len >= 0) {
4414 PUSHs(sv_2mortal(newSViv(maxlen)));
4416 PUSHs(filter_state);
4419 count = call_sv(filter_sub, G_SCALAR);
4435 IoLINES(datasv) = 0;
4436 if (filter_child_proc) {
4437 SvREFCNT_dec(filter_child_proc);
4438 IoFMT_GV(datasv) = Nullgv;
4441 SvREFCNT_dec(filter_state);
4442 IoTOP_GV(datasv) = Nullgv;
4445 SvREFCNT_dec(filter_sub);
4446 IoBOTTOM_GV(datasv) = Nullgv;
4448 filter_del(run_user_filter);
4457 sv_cmp_locale_static(pTHXo_ register SV *str1, register SV *str2)
4459 return sv_cmp_locale(str1, str2);
4463 sv_cmp_static(pTHXo_ register SV *str1, register SV *str2)
4465 return sv_cmp(str1, str2);
4468 #endif /* PERL_OBJECT */