3 * Copyright (c) 1991-1994, 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 * "It's a big house this, and very peculiar. Always a bit more to discover,
12 * and no knowing what you'll find around a corner. And Elves, sir!" --Samwise
18 static void doencodes _((SV *sv, char *s, I32 len));
20 /* variations on pp_null */
25 if (GIMME != G_ARRAY) {
41 if (op->op_private & OPpLVAL_INTRO)
42 SAVECLEARSV(curpad[op->op_targ]);
44 if (op->op_flags & OPf_REF) {
48 if (GIMME == G_ARRAY) {
49 I32 maxarg = AvFILL((AV*)TARG) + 1;
51 Copy(AvARRAY((AV*)TARG), SP+1, maxarg, SV*);
55 SV* sv = sv_newmortal();
56 I32 maxarg = AvFILL((AV*)TARG) + 1;
67 if (op->op_private & OPpLVAL_INTRO)
68 SAVECLEARSV(curpad[op->op_targ]);
69 if (op->op_flags & OPf_REF)
71 if (GIMME == G_ARRAY) { /* array wanted */
72 RETURNOP(do_kv(ARGS));
75 SV* sv = sv_newmortal();
76 if (HvFILL((HV*)TARG)) {
77 sprintf(buf, "%d/%d", HvFILL((HV*)TARG), HvMAX((HV*)TARG)+1);
89 DIE("NOT IMPL LINE %d",__LINE__);
101 if (SvTYPE(sv) == SVt_PVIO) {
102 GV *gv = (GV*) sv_newmortal();
103 gv_init(gv, 0, "", 0, 0);
104 GvIOp(gv) = (IO *)sv;
107 } else if (SvTYPE(sv) != SVt_PVGV)
108 DIE("Not a GLOB reference");
111 if (SvTYPE(sv) != SVt_PVGV) {
114 if (SvGMAGICAL(sv)) {
120 if (op->op_flags & OPf_REF ||
121 op->op_private & HINT_STRICT_REFS)
122 DIE(no_usym, "a symbol");
126 if (op->op_private & HINT_STRICT_REFS)
127 DIE(no_symref, sym, "a symbol");
128 sv = (SV*)gv_fetchpv(sym, TRUE, SVt_PVGV);
131 if (op->op_private & OPpLVAL_INTRO) {
135 SSPUSHPTR(SvREFCNT_inc(sv));
139 if (op->op_flags & OPf_SPECIAL) {
140 GvGP(sv)->gp_refcnt++; /* will soon be assigned */
148 GvSV(sv) = NEWSV(72,0);
149 GvLINE(sv) = curcop->cop_line;
164 switch (SvTYPE(sv)) {
168 DIE("Not a SCALAR reference");
175 if (SvTYPE(gv) != SVt_PVGV) {
176 if (SvGMAGICAL(sv)) {
182 if (op->op_flags & OPf_REF ||
183 op->op_private & HINT_STRICT_REFS)
184 DIE(no_usym, "a SCALAR");
188 if (op->op_private & HINT_STRICT_REFS)
189 DIE(no_symref, sym, "a SCALAR");
190 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PV);
194 if (op->op_flags & OPf_MOD) {
195 if (op->op_private & OPpLVAL_INTRO)
196 sv = save_scalar((GV*)TOPs);
197 else if (op->op_private & (OPpDEREF_HV|OPpDEREF_AV))
208 SV *sv = AvARYLEN(av);
210 AvARYLEN(av) = sv = NEWSV(0,0);
211 sv_upgrade(sv, SVt_IV);
212 sv_magic(sv, (SV*)av, '#', Nullch, 0);
220 dSP; dTARGET; dPOPss;
222 if (op->op_flags & OPf_MOD) {
225 PUSHs(TARG); /* no SvSETMAGIC */
231 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
232 mg = mg_find(sv, 'g');
233 if (mg && mg->mg_len >= 0) {
234 PUSHi(mg->mg_len + curcop->cop_arybase);
248 /* We usually try to add a non-existent subroutine in case of AUTOLOAD. */
249 /* (But not in defined().) */
250 CV *cv = sv_2cv(TOPs, &stash, &gv, !(op->op_flags & OPf_SPECIAL));
267 cv = sv_2cv(TOPs, &stash, &gv, FALSE);
268 if (cv && SvPOK(cv)) {
270 ret = sv_2mortal(newSVpv(p ? p : "", SvLEN(cv)));
279 CV* cv = (CV*)cSVOP->op_sv;
283 cv = (CV*)sv_2mortal((SV*)cv_clone(cv));
294 sv_upgrade(rv, SVt_RV);
299 (void)SvREFCNT_inc(sv);
312 if (GIMME != G_ARRAY) {
319 sv_upgrade(rv, SVt_RV);
324 (void)SvREFCNT_inc(sv);
341 if (sv && SvGMAGICAL(sv))
344 if (!sv || !SvROK(sv))
348 pv = sv_reftype(sv,TRUE);
349 PUSHp(pv, strlen(pv));
359 stash = curcop->cop_stash;
361 stash = gv_stashsv(POPs, TRUE);
363 (void)sv_bless(TOPs, stash);
367 /* Pattern matching */
372 register unsigned char *s;
375 register I32 *sfirst;
380 s = (unsigned char*)(SvPV(sv, len));
382 if (sv == lastscream)
386 SvSCREAM_off(lastscream);
387 SvREFCNT_dec(lastscream);
389 lastscream = SvREFCNT_inc(sv);
395 if (pos > maxscream) {
397 maxscream = pos + 80;
398 New(301, screamfirst, 256, I32);
399 New(302, screamnext, maxscream, I32);
402 maxscream = pos + pos / 4;
403 Renew(screamnext, maxscream, I32);
407 sfirst = screamfirst;
410 if (!sfirst || !snext)
411 DIE("do_study: out of memory");
413 for (ch = 256; ch; --ch)
420 snext[pos] = sfirst[ch] - pos;
425 /* If there were any case insensitive searches, we must assume they
426 * all are. This speeds up insensitive searches much more than
427 * it slows down sensitive ones.
430 sfirst[fold[ch]] = pos;
434 sv_magic(sv, Nullsv, 'g', Nullch, 0); /* piggyback on m//g magic */
437 XPUSHs(sv_2mortal(newSViv((I32)retval)));
446 if (op->op_flags & OPf_STACKED)
452 TARG = sv_newmortal();
453 PUSHi(do_trans(sv, op));
457 /* Lvalue operators. */
479 SETi(do_chomp(TOPs));
486 register I32 count = 0;
489 count += do_chomp(POPs);
500 if (!sv || !SvANY(sv))
502 switch (SvTYPE(sv)) {
504 if (AvMAX(sv) >= 0 || SvRMAGICAL(sv))
508 if (HvARRAY(sv) || SvRMAGICAL(sv))
512 if (CvROOT(sv) || CvXSUB(sv))
536 if (SvTHINKFIRST(sv)) {
543 switch (SvTYPE(sv)) {
558 sv_setsv(sv, &sv_undef);
562 if (SvPOK(sv) && SvLEN(sv)) {
565 SvPV_set(sv, Nullch);
579 if (SvIVX(TOPs) == PERL_LONG_MIN) {
580 sv_setnv(TOPs, (double)SvIVX(TOPs) - 1.0);
584 SvFLAGS(TOPs) &= ~(SVf_NOK|SVf_POK|SVp_NOK|SVp_POK);
596 sv_setsv(TARG, TOPs);
598 if (SvIVX(TOPs) == PERL_LONG_MAX) {
599 sv_setnv(TOPs, (double)SvIVX(TOPs) + 1.0);
603 SvFLAGS(TOPs) &= ~(SVf_NOK|SVf_POK|SVp_NOK|SVp_POK);
618 sv_setsv(TARG, TOPs);
620 if (SvIVX(TOPs) == PERL_LONG_MIN) {
621 sv_setnv(TOPs, (double)SvIVX(TOPs) - 1.0);
625 SvFLAGS(TOPs) &= ~(SVf_NOK|SVf_POK|SVp_NOK|SVp_POK);
635 /* Ordinary operators. */
639 dSP; dATARGET; tryAMAGICbin(pow,opASSIGN);
642 SETn( pow( left, right) );
649 dSP; dATARGET; tryAMAGICbin(mult,opASSIGN);
652 SETn( left * right );
659 dSP; dATARGET; tryAMAGICbin(div,opASSIGN);
663 DIE("Illegal division by zero");
665 /* insure that 20./5. == 4. */
670 if ((double)I_32(x) == x &&
671 (double)I_32(value) == value &&
672 (k = I_32(x)/I_32(value))*I_32(value) == I_32(x)) {
679 value = POPn / value;
688 dSP; dATARGET; tryAMAGICbin(mod,opASSIGN);
690 register unsigned long tmpulong;
691 register long tmplong;
694 tmpulong = (unsigned long) POPn;
696 DIE("Illegal modulus zero");
699 value = (I32)(((unsigned long)value) % tmpulong);
701 tmplong = (long)value;
702 value = (I32)(tmpulong - ((-tmplong - 1) % tmpulong)) - 1;
711 dSP; dATARGET; tryAMAGICbin(repeat,opASSIGN);
713 register I32 count = POPi;
714 if (GIMME == G_ARRAY && op->op_private & OPpREPEAT_DOLIST) {
716 I32 items = SP - MARK;
728 repeatcpy((char*)(MARK + items), (char*)MARK,
729 items * sizeof(SV*), count - 1);
735 else { /* Note: mark already snarfed by pp_list */
740 if (TARG == tmpstr && SvTHINKFIRST(tmpstr)) {
741 if (SvREADONLY(tmpstr) && curcop != &compiling)
742 DIE("Can't x= to readonly value");
746 SvSetSV(TARG, tmpstr);
747 SvPV_force(TARG, len);
749 SvGROW(TARG, (count * len) + 1);
751 repeatcpy(SvPVX(TARG) + len, SvPVX(TARG), len, count - 1);
752 SvCUR(TARG) *= count;
754 (void)SvPOK_only(TARG);
757 sv_setsv(TARG, &sv_no);
766 dSP; dATARGET; tryAMAGICbin(subtr,opASSIGN);
769 SETn( left - right );
776 dSP; dATARGET; tryAMAGICbin(lshift,opASSIGN);
779 SETi( left << right );
786 dSP; dATARGET; tryAMAGICbin(rshift,opASSIGN);
789 SETi( left >> right );
796 dSP; tryAMAGICbinSET(lt,0);
799 SETs((TOPn < value) ? &sv_yes : &sv_no);
806 dSP; tryAMAGICbinSET(gt,0);
809 SETs((TOPn > value) ? &sv_yes : &sv_no);
816 dSP; tryAMAGICbinSET(le,0);
819 SETs((TOPn <= value) ? &sv_yes : &sv_no);
826 dSP; tryAMAGICbinSET(ge,0);
829 SETs((TOPn >= value) ? &sv_yes : &sv_no);
836 dSP; tryAMAGICbinSET(ne,0);
839 SETs((TOPn != value) ? &sv_yes : &sv_no);
846 dSP; dTARGET; tryAMAGICbin(ncmp,0);
853 else if (left < right)
864 dSP; tryAMAGICbinSET(slt,0);
867 SETs( sv_cmp(left, right) < 0 ? &sv_yes : &sv_no );
874 dSP; tryAMAGICbinSET(sgt,0);
877 SETs( sv_cmp(left, right) > 0 ? &sv_yes : &sv_no );
884 dSP; tryAMAGICbinSET(sle,0);
887 SETs( sv_cmp(left, right) <= 0 ? &sv_yes : &sv_no );
894 dSP; tryAMAGICbinSET(sge,0);
897 SETs( sv_cmp(left, right) >= 0 ? &sv_yes : &sv_no );
904 dSP; tryAMAGICbinSET(sne,0);
907 SETs( !sv_eq(left, right) ? &sv_yes : &sv_no );
914 dSP; dTARGET; tryAMAGICbin(scmp,0);
917 SETi( sv_cmp(left, right) );
923 dSP; dATARGET; tryAMAGICbin(band,opASSIGN);
926 if (SvNIOKp(left) || SvNIOKp(right)) {
927 unsigned long value = U_L(SvNV(left));
928 value = value & U_L(SvNV(right));
932 do_vop(op->op_type, TARG, left, right);
941 dSP; dATARGET; tryAMAGICbin(bxor,opASSIGN);
944 if (SvNIOKp(left) || SvNIOKp(right)) {
945 unsigned long value = U_L(SvNV(left));
946 value = value ^ U_L(SvNV(right));
950 do_vop(op->op_type, TARG, left, right);
959 dSP; dATARGET; tryAMAGICbin(bor,opASSIGN);
962 if (SvNIOKp(left) || SvNIOKp(right)) {
963 unsigned long value = U_L(SvNV(left));
964 value = value | U_L(SvNV(right));
968 do_vop(op->op_type, TARG, left, right);
977 dSP; dTARGET; tryAMAGICun(neg);
984 else if (SvPOKp(sv)) {
986 char *s = SvPV(sv, len);
987 if (isALPHA(*s) || *s == '_') {
988 sv_setpvn(TARG, "-", 1);
991 else if (*s == '+' || *s == '-') {
993 *SvPV_force(TARG, len) = *s == '-' ? '+' : '-';
996 sv_setnv(TARG, -SvNV(sv));
1008 dSP; tryAMAGICunSET(not);
1009 #endif /* OVERLOAD */
1010 *stack_sp = SvTRUE(*stack_sp) ? &sv_no : &sv_yes;
1016 dSP; dTARGET; tryAMAGICun(compl);
1024 SETn( (double) ~U_L(SvNV(sv)) );
1029 register char *tmps;
1030 register long *tmpl;
1034 tmps = SvPV_force(TARG, len);
1037 for ( ; anum && (unsigned long)tmps % sizeof(long); anum--, tmps++)
1040 for ( ; anum >= sizeof(long); anum -= sizeof(long), tmpl++)
1044 for ( ; anum > 0; anum--, tmps++)
1053 /* integer versions of some of the above */
1057 dSP; dATARGET; tryAMAGICbin(mult,opASSIGN);
1060 SETi( left * right );
1067 dSP; dATARGET; tryAMAGICbin(div,opASSIGN);
1071 DIE("Illegal division by zero");
1072 value = POPi / value;
1080 dSP; dATARGET; tryAMAGICbin(mod,opASSIGN);
1083 SETi( left % right );
1090 dSP; dATARGET; tryAMAGICbin(add,opASSIGN);
1093 SETi( left + right );
1100 dSP; dATARGET; tryAMAGICbin(subtr,opASSIGN);
1103 SETi( left - right );
1110 dSP; tryAMAGICbinSET(lt,0);
1113 SETs((left < right) ? &sv_yes : &sv_no);
1120 dSP; tryAMAGICbinSET(gt,0);
1123 SETs((left > right) ? &sv_yes : &sv_no);
1130 dSP; tryAMAGICbinSET(le,0);
1133 SETs((left <= right) ? &sv_yes : &sv_no);
1140 dSP; tryAMAGICbinSET(ge,0);
1143 SETs((left >= right) ? &sv_yes : &sv_no);
1150 dSP; tryAMAGICbinSET(eq,0);
1153 SETs((left == right) ? &sv_yes : &sv_no);
1160 dSP; tryAMAGICbinSET(ne,0);
1163 SETs((left != right) ? &sv_yes : &sv_no);
1170 dSP; dTARGET; tryAMAGICbin(ncmp,0);
1177 else if (left < right)
1188 dSP; dTARGET; tryAMAGICun(neg);
1193 /* High falutin' math. */
1197 dSP; dTARGET; tryAMAGICbin(atan2,0);
1200 SETn(atan2(left, right));
1207 dSP; dTARGET; tryAMAGICun(sin);
1219 dSP; dTARGET; tryAMAGICun(cos);
1240 value = rand() * value / 2147483648.0;
1243 value = rand() * value / 65536.0;
1246 value = rand() * value / 32768.0;
1248 value = rand() * value / (double)(((unsigned long)1) << RANDBITS);
1263 # include <starlet.h>
1264 unsigned int when[2];
1265 _ckvmssts(sys$gettim(when));
1266 anum = when[0] ^ when[1];
1268 # if defined(I_SYS_TIME) && !defined(PLAN9)
1269 struct timeval when;
1270 gettimeofday(&when,(struct timezone *) 0);
1271 anum = when.tv_sec ^ when.tv_usec;
1278 #if !defined(PLAN9) /* XXX Plan9 assembler chokes on this; fix coming soon */
1279 /* 17-Jul-1996 bailey@genetics.upenn.edu */
1280 /* What is a good hashing algorithm here? */
1281 anum ^= ( ( 269 * (U32)getpid())
1282 ^ (26107 * (U32)&when)
1283 ^ (73819 * (U32)stack_sp));
1295 dSP; dTARGET; tryAMAGICun(exp);
1307 dSP; dTARGET; tryAMAGICun(log);
1312 DIE("Can't take log of %g", value);
1321 dSP; dTARGET; tryAMAGICun(sqrt);
1326 DIE("Can't take sqrt of %g", value);
1327 value = sqrt(value);
1339 (void)modf(value, &value);
1341 (void)modf(-value, &value);
1350 dSP; dTARGET; tryAMAGICun(abs);
1367 unsigned long value;
1371 value = scan_hex(tmps, 99, &argtype);
1382 unsigned long value;
1387 while (*tmps && isSPACE(*tmps))
1392 value = scan_hex(++tmps, 99, &argtype);
1394 value = scan_oct(tmps, 99, &argtype);
1407 SETi( sv_len(TOPs) );
1419 I32 lvalue = op->op_flags & OPf_MOD;
1421 I32 arybase = curcop->cop_arybase;
1425 pos = POPi - arybase;
1427 tmps = SvPV(sv, curlen);
1429 pos += curlen + arybase;
1430 if (pos < 0 || pos > curlen) {
1431 if (dowarn || lvalue)
1432 warn("substr outside of string");
1439 len += curlen - pos;
1444 rem = curlen - pos; /* rem=how many bytes left*/
1447 sv_setpvn(TARG, tmps, rem);
1448 if (lvalue) { /* it's an lvalue! */
1449 if (!SvGMAGICAL(sv))
1450 (void)SvPOK_only(sv);
1451 if (SvTYPE(TARG) < SVt_PVLV) {
1452 sv_upgrade(TARG, SVt_PVLV);
1453 sv_magic(TARG, Nullsv, 'x', Nullch, 0);
1458 LvTARGOFF(TARG) = pos;
1459 LvTARGLEN(TARG) = rem;
1462 PUSHs(TARG); /* avoid SvSETMAGIC here */
1469 register I32 size = POPi;
1470 register I32 offset = POPi;
1471 register SV *src = POPs;
1472 I32 lvalue = op->op_flags & OPf_MOD;
1474 unsigned char *s = (unsigned char*)SvPV(src, srclen);
1475 unsigned long retnum;
1478 offset *= size; /* turn into bit offset */
1479 len = (offset + size + 7) / 8;
1480 if (offset < 0 || size < 1)
1483 if (lvalue) { /* it's an lvalue! */
1484 if (SvTYPE(TARG) < SVt_PVLV) {
1485 sv_upgrade(TARG, SVt_PVLV);
1486 sv_magic(TARG, Nullsv, 'v', Nullch, 0);
1491 LvTARGOFF(TARG) = offset;
1492 LvTARGLEN(TARG) = size;
1500 if (offset >= srclen)
1503 retnum = (unsigned long) s[offset] << 8;
1505 else if (size == 32) {
1506 if (offset >= srclen)
1508 else if (offset + 1 >= srclen)
1509 retnum = (unsigned long) s[offset] << 24;
1510 else if (offset + 2 >= srclen)
1511 retnum = ((unsigned long) s[offset] << 24) +
1512 ((unsigned long) s[offset + 1] << 16);
1514 retnum = ((unsigned long) s[offset] << 24) +
1515 ((unsigned long) s[offset + 1] << 16) +
1516 (s[offset + 2] << 8);
1521 retnum = (s[offset >> 3] >> (offset & 7)) & ((1 << size) - 1);
1526 else if (size == 16)
1527 retnum = ((unsigned long) s[offset] << 8) + s[offset+1];
1528 else if (size == 32)
1529 retnum = ((unsigned long) s[offset] << 24) +
1530 ((unsigned long) s[offset + 1] << 16) +
1531 (s[offset + 2] << 8) + s[offset+3];
1535 sv_setiv(TARG, (I32)retnum);
1550 I32 arybase = curcop->cop_arybase;
1555 offset = POPi - arybase;
1558 tmps = SvPV(big, biglen);
1561 else if (offset > biglen)
1563 if (!(tmps2 = fbm_instr((unsigned char*)tmps + offset,
1564 (unsigned char*)tmps + biglen, little)))
1565 retval = -1 + arybase;
1567 retval = tmps2 - tmps + arybase;
1584 I32 arybase = curcop->cop_arybase;
1590 tmps2 = SvPV(little, llen);
1591 tmps = SvPV(big, blen);
1595 offset = SvIV(offstr) - arybase + llen;
1598 else if (offset > blen)
1600 if (!(tmps2 = rninstr(tmps, tmps + offset,
1601 tmps2, tmps2 + llen)))
1602 retval = -1 + arybase;
1604 retval = tmps2 - tmps + arybase;
1611 dSP; dMARK; dORIGMARK; dTARGET;
1612 do_sprintf(TARG, SP-MARK, MARK+1);
1626 value = (I32) (*tmps & 255);
1631 value = (I32) (anum & 255);
1642 (void)SvUPGRADE(TARG,SVt_PV);
1648 (void)SvPOK_only(TARG);
1655 dSP; dTARGET; dPOPTOPssrl;
1657 char *tmps = SvPV(left, na);
1659 sv_setpv(TARG, fcrypt(tmps, SvPV(right, na)));
1661 sv_setpv(TARG, crypt(tmps, SvPV(right, na)));
1665 "The crypt() function is unimplemented due to excessive paranoia.");
1677 if (!SvPADTMP(sv)) {
1683 s = SvPV_force(sv, na);
1696 if (!SvPADTMP(sv)) {
1702 s = SvPV_force(sv, na);
1715 register char *send;
1718 if (!SvPADTMP(sv)) {
1724 s = SvPV_force(sv, len);
1739 register char *send;
1742 if (!SvPADTMP(sv)) {
1748 s = SvPV_force(sv, len);
1763 register char *s = SvPV(sv,len);
1767 (void)SvUPGRADE(TARG, SVt_PV);
1768 SvGROW(TARG, (len * 2) + 1);
1776 SvCUR_set(TARG, d - SvPVX(TARG));
1777 (void)SvPOK_only(TARG);
1780 sv_setpvn(TARG, s, len);
1789 dSP; dMARK; dORIGMARK;
1791 register AV* av = (AV*)POPs;
1792 register I32 lval = op->op_flags & OPf_MOD;
1793 I32 arybase = curcop->cop_arybase;
1796 if (SvTYPE(av) == SVt_PVAV) {
1797 if (lval && op->op_private & OPpLVAL_INTRO) {
1799 for (svp = mark + 1; svp <= sp; svp++) {
1804 if (max > AvMAX(av))
1807 while (++MARK <= SP) {
1808 elem = SvIVx(*MARK);
1812 svp = av_fetch(av, elem, lval);
1814 if (!svp || *svp == &sv_undef)
1815 DIE(no_aelem, elem);
1816 if (op->op_private & OPpLVAL_INTRO)
1819 *MARK = svp ? *svp : &sv_undef;
1822 if (GIMME != G_ARRAY) {
1830 /* Associative arrays. */
1835 HV *hash = (HV*)POPs;
1839 entry = hv_iternext(hash); /* might clobber stack_sp */
1844 PUSHs(hv_iterkeysv(entry)); /* won't clobber stack_sp */
1845 if (GIMME == G_ARRAY) {
1847 sv_setsv(TARG, hv_iterval(hash, entry)); /* might clobber stack_sp */
1852 else if (GIMME == G_SCALAR)
1875 if (SvTYPE(hv) != SVt_PVHV) {
1876 DIE("Not a HASH reference");
1878 sv = hv_delete_ent(hv, tmpsv,
1879 (op->op_private & OPpLEAVE_VOID ? G_DISCARD : 0), 0);
1892 if (SvTYPE(hv) != SVt_PVHV) {
1893 DIE("Not a HASH reference");
1895 if (hv_exists_ent(hv, tmpsv, 0))
1902 dSP; dMARK; dORIGMARK;
1904 register HV *hv = (HV*)POPs;
1905 register I32 lval = op->op_flags & OPf_MOD;
1907 if (SvTYPE(hv) == SVt_PVHV) {
1908 while (++MARK <= SP) {
1911 he = hv_fetch_ent(hv, keysv, lval, 0);
1913 if (!he || HeVAL(he) == &sv_undef)
1914 DIE(no_helem, SvPV(keysv, na));
1915 if (op->op_private & OPpLVAL_INTRO)
1916 save_svref(&HeVAL(he));
1918 *MARK = he ? HeVAL(he) : &sv_undef;
1921 if (GIMME != G_ARRAY) {
1929 /* List operators. */
1934 if (GIMME != G_ARRAY) {
1936 *MARK = *SP; /* unwanted list, return last item */
1947 SV **lastrelem = stack_sp;
1948 SV **lastlelem = stack_base + POPMARK;
1949 SV **firstlelem = stack_base + POPMARK + 1;
1950 register SV **firstrelem = lastlelem + 1;
1951 I32 arybase = curcop->cop_arybase;
1952 I32 lval = op->op_flags & OPf_MOD;
1953 I32 is_something_there = lval;
1955 register I32 max = lastrelem - lastlelem;
1956 register SV **lelem;
1959 if (GIMME != G_ARRAY) {
1960 ix = SvIVx(*lastlelem);
1965 if (ix < 0 || ix >= max)
1966 *firstlelem = &sv_undef;
1968 *firstlelem = firstrelem[ix];
1974 SP = firstlelem - 1;
1978 for (lelem = firstlelem; lelem <= lastlelem; lelem++) {
1984 else if (!(*lelem = firstrelem[ix]))
1989 if (ix >= max || !(*lelem = firstrelem[ix]))
1992 if (!is_something_there && (SvOKp(*lelem) || SvGMAGICAL(*lelem)))
1993 is_something_there = TRUE;
1995 if (is_something_there)
1998 SP = firstlelem - 1;
2005 I32 items = SP - MARK;
2007 XPUSHs((SV*)sv_2mortal((SV*)av_make(items, MARK+1)));
2013 dSP; dMARK; dORIGMARK;
2015 HV* hv = (HV*)sv_2mortal((SV*)newHV());
2019 SV *val = NEWSV(46, 0);
2021 sv_setsv(val, *++MARK);
2023 warn("Odd number of elements in hash list");
2024 (void)hv_store_ent(hv,key,val,0);
2033 dSP; dMARK; dORIGMARK;
2034 register AV *ary = (AV*)*++MARK;
2038 register I32 offset;
2039 register I32 length;
2048 offset = SvIVx(*MARK);
2050 offset += AvFILL(ary) + 1;
2052 offset -= curcop->cop_arybase;
2054 length = SvIVx(*MARK++);
2059 length = AvMAX(ary) + 1; /* close enough to infinity */
2063 length = AvMAX(ary) + 1;
2071 if (offset > AvFILL(ary) + 1)
2072 offset = AvFILL(ary) + 1;
2073 after = AvFILL(ary) + 1 - (offset + length);
2074 if (after < 0) { /* not that much array */
2075 length += after; /* offset+length now in array */
2081 /* At this point, MARK .. SP-1 is our new LIST */
2084 diff = newlen - length;
2086 if (diff < 0) { /* shrinking the area */
2088 New(451, tmparyval, newlen, SV*); /* so remember insertion */
2089 Copy(MARK, tmparyval, newlen, SV*);
2092 MARK = ORIGMARK + 1;
2093 if (GIMME == G_ARRAY) { /* copy return vals to stack */
2094 MEXTEND(MARK, length);
2095 Copy(AvARRAY(ary)+offset, MARK, length, SV*);
2097 for (i = length, dst = MARK; i; i--)
2098 sv_2mortal(*dst++); /* free them eventualy */
2103 *MARK = AvARRAY(ary)[offset+length-1];
2106 for (i = length - 1, dst = &AvARRAY(ary)[offset]; i > 0; i--)
2107 SvREFCNT_dec(*dst++); /* free them now */
2110 AvFILL(ary) += diff;
2112 /* pull up or down? */
2114 if (offset < after) { /* easier to pull up */
2115 if (offset) { /* esp. if nothing to pull */
2116 src = &AvARRAY(ary)[offset-1];
2117 dst = src - diff; /* diff is negative */
2118 for (i = offset; i > 0; i--) /* can't trust Copy */
2122 SvPVX(ary) = (char*)(AvARRAY(ary) - diff); /* diff is negative */
2126 if (after) { /* anything to pull down? */
2127 src = AvARRAY(ary) + offset + length;
2128 dst = src + diff; /* diff is negative */
2129 Move(src, dst, after, SV*);
2131 dst = &AvARRAY(ary)[AvFILL(ary)+1];
2132 /* avoid later double free */
2136 dst[--i] = &sv_undef;
2139 for (src = tmparyval, dst = AvARRAY(ary) + offset;
2141 *dst = NEWSV(46, 0);
2142 sv_setsv(*dst++, *src++);
2144 Safefree(tmparyval);
2147 else { /* no, expanding (or same) */
2149 New(452, tmparyval, length, SV*); /* so remember deletion */
2150 Copy(AvARRAY(ary)+offset, tmparyval, length, SV*);
2153 if (diff > 0) { /* expanding */
2155 /* push up or down? */
2157 if (offset < after && diff <= AvARRAY(ary) - AvALLOC(ary)) {
2161 Move(src, dst, offset, SV*);
2163 SvPVX(ary) = (char*)(AvARRAY(ary) - diff);/* diff is positive */
2165 AvFILL(ary) += diff;
2168 if (AvFILL(ary) + diff >= AvMAX(ary)) /* oh, well */
2169 av_extend(ary, AvFILL(ary) + diff);
2170 AvFILL(ary) += diff;
2173 dst = AvARRAY(ary) + AvFILL(ary);
2175 for (i = after; i; i--) {
2182 for (src = MARK, dst = AvARRAY(ary) + offset; newlen; newlen--) {
2183 *dst = NEWSV(46, 0);
2184 sv_setsv(*dst++, *src++);
2186 MARK = ORIGMARK + 1;
2187 if (GIMME == G_ARRAY) { /* copy return vals to stack */
2189 Copy(tmparyval, MARK, length, SV*);
2191 for (i = length, dst = MARK; i; i--)
2192 sv_2mortal(*dst++); /* free them eventualy */
2194 Safefree(tmparyval);
2198 else if (length--) {
2199 *MARK = tmparyval[length];
2202 while (length-- > 0)
2203 SvREFCNT_dec(tmparyval[length]);
2205 Safefree(tmparyval);
2216 dSP; dMARK; dORIGMARK; dTARGET;
2217 register AV *ary = (AV*)*++MARK;
2218 register SV *sv = &sv_undef;
2220 for (++MARK; MARK <= SP; MARK++) {
2223 sv_setsv(sv, *MARK);
2227 PUSHi( AvFILL(ary) + 1 );
2235 SV *sv = av_pop(av);
2236 if (sv != &sv_undef && AvREAL(av))
2237 (void)sv_2mortal(sv);
2246 SV *sv = av_shift(av);
2250 if (sv != &sv_undef && AvREAL(av))
2251 (void)sv_2mortal(sv);
2258 dSP; dMARK; dORIGMARK; dTARGET;
2259 register AV *ary = (AV*)*++MARK;
2263 av_unshift(ary, SP - MARK);
2266 sv_setsv(sv, *++MARK);
2267 (void)av_store(ary, i++, sv);
2271 PUSHi( AvFILL(ary) + 1 );
2281 if (GIMME == G_ARRAY) {
2292 register char *down;
2298 do_join(TARG, &sv_no, MARK, SP);
2300 sv_setsv(TARG, *SP);
2301 up = SvPV_force(TARG, len);
2303 down = SvPVX(TARG) + len - 1;
2309 (void)SvPOK_only(TARG);
2317 /* Explosives and implosives. */
2326 register char *pat = SvPV(left, llen);
2327 register char *s = SvPV(right, rlen);
2328 char *strend = s + rlen;
2330 register char *patend = pat + llen;
2335 /* These must not be in registers: */
2346 unsigned Quad_t auquad;
2352 register U32 culong;
2354 static char* bitcount = 0;
2356 if (GIMME != G_ARRAY) { /* arrange to do first one only */
2358 for (patend = pat; !isALPHA(*patend) || *patend == 'x'; patend++) ;
2359 if (strchr("aAbBhHP", *patend) || *pat == '%') {
2361 while (isDIGIT(*patend) || *patend == '*')
2367 while (pat < patend) {
2372 else if (*pat == '*') {
2373 len = strend - strbeg; /* long enough */
2376 else if (isDIGIT(*pat)) {
2378 while (isDIGIT(*pat))
2379 len = (len * 10) + (*pat++ - '0');
2382 len = (datumtype != '@');
2387 if (len == 1 && pat[-1] != '1')
2396 if (len > strend - strbeg)
2397 DIE("@ outside of string");
2401 if (len > s - strbeg)
2402 DIE("X outside of string");
2406 if (len > strend - s)
2407 DIE("x outside of string");
2412 if (len > strend - s)
2415 goto uchar_checksum;
2416 sv = NEWSV(35, len);
2417 sv_setpvn(sv, s, len);
2419 if (datumtype == 'A') {
2420 aptr = s; /* borrow register */
2421 s = SvPVX(sv) + len - 1;
2422 while (s >= SvPVX(sv) && (!*s || isSPACE(*s)))
2425 SvCUR_set(sv, s - SvPVX(sv));
2426 s = aptr; /* unborrow register */
2428 XPUSHs(sv_2mortal(sv));
2432 if (pat[-1] == '*' || len > (strend - s) * 8)
2433 len = (strend - s) * 8;
2436 Newz(601, bitcount, 256, char);
2437 for (bits = 1; bits < 256; bits++) {
2438 if (bits & 1) bitcount[bits]++;
2439 if (bits & 2) bitcount[bits]++;
2440 if (bits & 4) bitcount[bits]++;
2441 if (bits & 8) bitcount[bits]++;
2442 if (bits & 16) bitcount[bits]++;
2443 if (bits & 32) bitcount[bits]++;
2444 if (bits & 64) bitcount[bits]++;
2445 if (bits & 128) bitcount[bits]++;
2449 culong += bitcount[*(unsigned char*)s++];
2454 if (datumtype == 'b') {
2456 if (bits & 1) culong++;
2462 if (bits & 128) culong++;
2469 sv = NEWSV(35, len + 1);
2472 aptr = pat; /* borrow register */
2474 if (datumtype == 'b') {
2476 for (len = 0; len < aint; len++) {
2477 if (len & 7) /*SUPPRESS 595*/
2481 *pat++ = '0' + (bits & 1);
2486 for (len = 0; len < aint; len++) {
2491 *pat++ = '0' + ((bits & 128) != 0);
2495 pat = aptr; /* unborrow register */
2496 XPUSHs(sv_2mortal(sv));
2500 if (pat[-1] == '*' || len > (strend - s) * 2)
2501 len = (strend - s) * 2;
2502 sv = NEWSV(35, len + 1);
2505 aptr = pat; /* borrow register */
2507 if (datumtype == 'h') {
2509 for (len = 0; len < aint; len++) {
2514 *pat++ = hexdigit[bits & 15];
2519 for (len = 0; len < aint; len++) {
2524 *pat++ = hexdigit[(bits >> 4) & 15];
2528 pat = aptr; /* unborrow register */
2529 XPUSHs(sv_2mortal(sv));
2532 if (len > strend - s)
2537 if (aint >= 128) /* fake up signed chars */
2546 if (aint >= 128) /* fake up signed chars */
2549 sv_setiv(sv, (I32)aint);
2550 PUSHs(sv_2mortal(sv));
2555 if (len > strend - s)
2569 sv_setiv(sv, (I32)auint);
2570 PUSHs(sv_2mortal(sv));
2575 along = (strend - s) / sizeof(I16);
2580 Copy(s, &ashort, 1, I16);
2588 Copy(s, &ashort, 1, I16);
2591 sv_setiv(sv, (I32)ashort);
2592 PUSHs(sv_2mortal(sv));
2599 along = (strend - s) / sizeof(U16);
2604 Copy(s, &aushort, 1, U16);
2607 if (datumtype == 'n')
2608 aushort = ntohs(aushort);
2611 if (datumtype == 'v')
2612 aushort = vtohs(aushort);
2620 Copy(s, &aushort, 1, U16);
2624 if (datumtype == 'n')
2625 aushort = ntohs(aushort);
2628 if (datumtype == 'v')
2629 aushort = vtohs(aushort);
2631 sv_setiv(sv, (I32)aushort);
2632 PUSHs(sv_2mortal(sv));
2637 along = (strend - s) / sizeof(int);
2642 Copy(s, &aint, 1, int);
2645 cdouble += (double)aint;
2653 Copy(s, &aint, 1, int);
2656 sv_setiv(sv, (I32)aint);
2657 PUSHs(sv_2mortal(sv));
2662 along = (strend - s) / sizeof(unsigned int);
2667 Copy(s, &auint, 1, unsigned int);
2668 s += sizeof(unsigned int);
2670 cdouble += (double)auint;
2678 Copy(s, &auint, 1, unsigned int);
2679 s += sizeof(unsigned int);
2681 sv_setiv(sv, (I32)auint);
2682 PUSHs(sv_2mortal(sv));
2687 along = (strend - s) / sizeof(I32);
2692 Copy(s, &along, 1, I32);
2695 cdouble += (double)along;
2703 Copy(s, &along, 1, I32);
2706 sv_setiv(sv, (I32)along);
2707 PUSHs(sv_2mortal(sv));
2714 along = (strend - s) / sizeof(U32);
2719 Copy(s, &aulong, 1, U32);
2722 if (datumtype == 'N')
2723 aulong = ntohl(aulong);
2726 if (datumtype == 'V')
2727 aulong = vtohl(aulong);
2730 cdouble += (double)aulong;
2738 Copy(s, &aulong, 1, U32);
2742 if (datumtype == 'N')
2743 aulong = ntohl(aulong);
2746 if (datumtype == 'V')
2747 aulong = vtohl(aulong);
2749 sv_setnv(sv, (double)aulong);
2750 PUSHs(sv_2mortal(sv));
2755 along = (strend - s) / sizeof(char*);
2760 if (sizeof(char*) > strend - s)
2763 Copy(s, &aptr, 1, char*);
2769 PUSHs(sv_2mortal(sv));
2774 if (sizeof(char*) > strend - s)
2777 Copy(s, &aptr, 1, char*);
2782 sv_setpvn(sv, aptr, len);
2783 PUSHs(sv_2mortal(sv));
2789 if (s + sizeof(Quad_t) > strend)
2792 Copy(s, &aquad, 1, Quad_t);
2793 s += sizeof(Quad_t);
2796 sv_setiv(sv, (IV)aquad);
2797 PUSHs(sv_2mortal(sv));
2803 if (s + sizeof(unsigned Quad_t) > strend)
2806 Copy(s, &auquad, 1, unsigned Quad_t);
2807 s += sizeof(unsigned Quad_t);
2810 sv_setiv(sv, (IV)auquad);
2811 PUSHs(sv_2mortal(sv));
2815 /* float and double added gnb@melba.bby.oz.au 22/11/89 */
2818 along = (strend - s) / sizeof(float);
2823 Copy(s, &afloat, 1, float);
2831 Copy(s, &afloat, 1, float);
2834 sv_setnv(sv, (double)afloat);
2835 PUSHs(sv_2mortal(sv));
2841 along = (strend - s) / sizeof(double);
2846 Copy(s, &adouble, 1, double);
2847 s += sizeof(double);
2854 Copy(s, &adouble, 1, double);
2855 s += sizeof(double);
2857 sv_setnv(sv, (double)adouble);
2858 PUSHs(sv_2mortal(sv));
2863 along = (strend - s) * 3 / 4;
2864 sv = NEWSV(42, along);
2867 while (s < strend && *s > ' ' && *s < 'a') {
2872 len = (*s++ - ' ') & 077;
2874 if (s < strend && *s >= ' ')
2875 a = (*s++ - ' ') & 077;
2878 if (s < strend && *s >= ' ')
2879 b = (*s++ - ' ') & 077;
2882 if (s < strend && *s >= ' ')
2883 c = (*s++ - ' ') & 077;
2886 if (s < strend && *s >= ' ')
2887 d = (*s++ - ' ') & 077;
2890 hunk[0] = a << 2 | b >> 4;
2891 hunk[1] = b << 4 | c >> 2;
2892 hunk[2] = c << 6 | d;
2893 sv_catpvn(sv, hunk, len > 3 ? 3 : len);
2898 else if (s[1] == '\n') /* possible checksum byte */
2901 XPUSHs(sv_2mortal(sv));
2906 if (strchr("fFdD", datumtype) ||
2907 (checksum > 32 && strchr("iIlLN", datumtype)) ) {
2911 while (checksum >= 16) {
2915 while (checksum >= 4) {
2921 along = (1 << checksum) - 1;
2922 while (cdouble < 0.0)
2924 cdouble = modf(cdouble / adouble, &trouble) * adouble;
2925 sv_setnv(sv, cdouble);
2928 if (checksum < 32) {
2929 along = (1 << checksum) - 1;
2930 culong &= (U32)along;
2932 sv_setnv(sv, (double)culong);
2934 XPUSHs(sv_2mortal(sv));
2942 doencodes(sv, s, len)
2950 sv_catpvn(sv, hunk, 1);
2953 hunk[0] = ' ' + (077 & (*s >> 2));
2954 hunk[1] = ' ' + (077 & ((*s << 4) & 060 | (s[1] >> 4) & 017));
2955 hunk[2] = ' ' + (077 & ((s[1] << 2) & 074 | (s[2] >> 6) & 03));
2956 hunk[3] = ' ' + (077 & (s[2] & 077));
2957 sv_catpvn(sv, hunk, 4);
2961 for (s = SvPVX(sv); *s; s++) {
2965 sv_catpvn(sv, "\n", 1);
2970 dSP; dMARK; dORIGMARK; dTARGET;
2971 register SV *cat = TARG;
2974 register char *pat = SvPVx(*++MARK, fromlen);
2975 register char *patend = pat + fromlen;
2980 static char null10[] = {0,0,0,0,0,0,0,0,0,0};
2981 static char *space10 = " ";
2983 /* These must not be in registers: */
2992 unsigned Quad_t auquad;
3000 sv_setpvn(cat, "", 0);
3001 while (pat < patend) {
3002 #define NEXTFROM (items-- > 0 ? *MARK++ : &sv_no)
3005 len = strchr("@Xxu", datumtype) ? 0 : items;
3008 else if (isDIGIT(*pat)) {
3010 while (isDIGIT(*pat))
3011 len = (len * 10) + (*pat++ - '0');
3019 DIE("%% may only be used in unpack");
3030 if (SvCUR(cat) < len)
3031 DIE("X outside of string");
3038 sv_catpvn(cat, null10, 10);
3041 sv_catpvn(cat, null10, len);
3046 aptr = SvPV(fromstr, fromlen);
3050 sv_catpvn(cat, aptr, len);
3052 sv_catpvn(cat, aptr, fromlen);
3054 if (datumtype == 'A') {
3056 sv_catpvn(cat, space10, 10);
3059 sv_catpvn(cat, space10, len);
3063 sv_catpvn(cat, null10, 10);
3066 sv_catpvn(cat, null10, len);
3073 char *savepat = pat;
3078 aptr = SvPV(fromstr, fromlen);
3083 SvCUR(cat) += (len+7)/8;
3084 SvGROW(cat, SvCUR(cat) + 1);
3085 aptr = SvPVX(cat) + aint;
3090 if (datumtype == 'B') {
3091 for (len = 0; len++ < aint;) {
3092 items |= *pat++ & 1;
3096 *aptr++ = items & 0xff;
3102 for (len = 0; len++ < aint;) {
3108 *aptr++ = items & 0xff;
3114 if (datumtype == 'B')
3115 items <<= 7 - (aint & 7);
3117 items >>= 7 - (aint & 7);
3118 *aptr++ = items & 0xff;
3120 pat = SvPVX(cat) + SvCUR(cat);
3131 char *savepat = pat;
3136 aptr = SvPV(fromstr, fromlen);
3141 SvCUR(cat) += (len+1)/2;
3142 SvGROW(cat, SvCUR(cat) + 1);
3143 aptr = SvPVX(cat) + aint;
3148 if (datumtype == 'H') {
3149 for (len = 0; len++ < aint;) {
3151 items |= ((*pat++ & 15) + 9) & 15;
3153 items |= *pat++ & 15;
3157 *aptr++ = items & 0xff;
3163 for (len = 0; len++ < aint;) {
3165 items |= (((*pat++ & 15) + 9) & 15) << 4;
3167 items |= (*pat++ & 15) << 4;
3171 *aptr++ = items & 0xff;
3177 *aptr++ = items & 0xff;
3178 pat = SvPVX(cat) + SvCUR(cat);
3190 aint = SvIV(fromstr);
3192 sv_catpvn(cat, &achar, sizeof(char));
3195 /* Float and double added by gnb@melba.bby.oz.au 22/11/89 */
3200 afloat = (float)SvNV(fromstr);
3201 sv_catpvn(cat, (char *)&afloat, sizeof (float));
3208 adouble = (double)SvNV(fromstr);
3209 sv_catpvn(cat, (char *)&adouble, sizeof (double));
3215 ashort = (I16)SvIV(fromstr);
3217 ashort = htons(ashort);
3219 sv_catpvn(cat, (char*)&ashort, sizeof(I16));
3225 ashort = (I16)SvIV(fromstr);
3227 ashort = htovs(ashort);
3229 sv_catpvn(cat, (char*)&ashort, sizeof(I16));
3236 ashort = (I16)SvIV(fromstr);
3237 sv_catpvn(cat, (char*)&ashort, sizeof(I16));
3243 auint = U_I(SvNV(fromstr));
3244 sv_catpvn(cat, (char*)&auint, sizeof(unsigned int));
3250 aint = SvIV(fromstr);
3251 sv_catpvn(cat, (char*)&aint, sizeof(int));
3257 aulong = U_L(SvNV(fromstr));
3259 aulong = htonl(aulong);
3261 sv_catpvn(cat, (char*)&aulong, sizeof(U32));
3267 aulong = U_L(SvNV(fromstr));
3269 aulong = htovl(aulong);
3271 sv_catpvn(cat, (char*)&aulong, sizeof(U32));
3277 aulong = U_L(SvNV(fromstr));
3278 sv_catpvn(cat, (char*)&aulong, sizeof(U32));
3284 along = SvIV(fromstr);
3285 sv_catpvn(cat, (char*)&along, sizeof(I32));
3292 auquad = (unsigned Quad_t)SvIV(fromstr);
3293 sv_catpvn(cat, (char*)&auquad, sizeof(unsigned Quad_t));
3299 aquad = (Quad_t)SvIV(fromstr);
3300 sv_catpvn(cat, (char*)&aquad, sizeof(Quad_t));
3303 #endif /* HAS_QUAD */
3305 len = 1; /* assume SV is correct length */
3310 aptr = SvPV_force(fromstr, na); /* XXX Error if TEMP? */
3311 sv_catpvn(cat, (char*)&aptr, sizeof(char*));
3316 aptr = SvPV(fromstr, fromlen);
3317 SvGROW(cat, fromlen * 4 / 3);
3322 while (fromlen > 0) {
3329 doencodes(cat, aptr, todo);
3347 register I32 limit = POPi; /* note, negative is forever */
3350 register char *s = SvPV(sv, len);
3351 char *strend = s + len;
3352 register PMOP *pm = (PMOP*)POPs;
3356 I32 maxiters = (strend - s) + 10;
3359 I32 origlimit = limit;
3362 AV *oldstack = curstack;
3363 register REGEXP *rx = pm->op_pmregexp;
3365 I32 oldsave = savestack_ix;
3368 DIE("panic: do_split");
3369 if (pm->op_pmreplroot)
3370 ary = GvAVn((GV*)pm->op_pmreplroot);
3371 else if (gimme != G_ARRAY)
3375 if (ary && (gimme != G_ARRAY || (pm->op_pmflags & PMf_ONCE))) {
3379 for (i = AvFILL(ary); i >= 0; i--)
3380 AvARRAY(ary)[i] = &sv_undef; /* don't free mere refs */
3384 /* temporarily switch stacks */
3385 SWITCHSTACK(curstack, ary);
3387 base = SP - stack_base;
3389 if (pm->op_pmflags & PMf_SKIPWHITE) {
3393 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
3395 multiline = pm->op_pmflags & PMf_MULTILINE;
3399 limit = maxiters + 2;
3400 if (pm->op_pmflags & PMf_WHITE) {
3403 for (m = s; m < strend && !isSPACE(*m); m++) ;
3406 dstr = NEWSV(30, m-s);
3407 sv_setpvn(dstr, s, m-s);
3412 for (s = m + 1; s < strend && isSPACE(*s); s++) ;
3415 else if (strEQ("^", rx->precomp)) {
3418 for (m = s; m < strend && *m != '\n'; m++) ;
3422 dstr = NEWSV(30, m-s);
3423 sv_setpvn(dstr, s, m-s);
3430 else if (pm->op_pmshort) {
3431 i = SvCUR(pm->op_pmshort);
3433 I32 fold = (pm->op_pmflags & PMf_FOLD);
3434 i = *SvPVX(pm->op_pmshort);
3435 if (fold && isUPPER(i))
3440 m < strend && *m != i &&
3441 (!isUPPER(*m) || toLOWER(*m) != i);
3442 m++) /*SUPPRESS 530*/
3445 else /*SUPPRESS 530*/
3446 for (m = s; m < strend && *m != i; m++) ;
3449 dstr = NEWSV(30, m-s);
3450 sv_setpvn(dstr, s, m-s);
3459 while (s < strend && --limit &&
3460 (m=fbm_instr((unsigned char*)s, (unsigned char*)strend,
3464 dstr = NEWSV(31, m-s);
3465 sv_setpvn(dstr, s, m-s);
3474 maxiters += (strend - s) * rx->nparens;
3475 while (s < strend && --limit &&
3476 pregexec(rx, s, strend, orig, 1, Nullsv, TRUE) ) {
3478 && rx->subbase != orig) {
3483 strend = s + (strend - m);
3486 dstr = NEWSV(32, m-s);
3487 sv_setpvn(dstr, s, m-s);
3492 for (i = 1; i <= rx->nparens; i++) {
3496 dstr = NEWSV(33, m-s);
3497 sv_setpvn(dstr, s, m-s);
3500 dstr = NEWSV(33, 0);
3509 LEAVE_SCOPE(oldsave);
3510 iters = (SP - stack_base) - base;
3511 if (iters > maxiters)
3514 /* keep field after final delim? */
3515 if (s < strend || (iters && origlimit)) {
3516 dstr = NEWSV(34, strend-s);
3517 sv_setpvn(dstr, s, strend-s);
3523 else if (!origlimit) {
3524 while (iters > 0 && (!TOPs || !SvANY(TOPs) || SvCUR(TOPs) == 0))
3528 SWITCHSTACK(ary, oldstack);
3529 if (gimme == G_ARRAY) {
3531 Copy(AvARRAY(ary), SP + 1, iters, SV*);
3537 if (gimme == G_ARRAY)
3540 if (iters || !pm->op_pmreplroot) {