3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "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
19 * The compiler on Concurrent CX/UX systems has a subtle bug which only
20 * seems to show up when compiling pp.c - it generates the wrong double
21 * precision constant value for (double)UV_MAX when used inline in the body
22 * of the code below, so this makes a static variable up front (which the
23 * compiler seems to get correct) and uses it in place of UV_MAX below.
25 #ifdef CXUX_BROKEN_CONSTANT_CONVERT
26 static double UV_MAX_cxux = ((double)UV_MAX);
30 * Types used in bitwise operations.
32 * Normally we'd just use IV and UV. However, some hardware and
33 * software combinations (e.g. Alpha and current OSF/1) don't have a
34 * floating-point type to use for NV that has adequate bits to fully
35 * hold an IV/UV. (In other words, sizeof(long) == sizeof(double).)
37 * It just so happens that "int" is the right size almost everywhere.
43 * Mask used after bitwise operations.
45 * There is at least one realm (Cray word machines) that doesn't
46 * have an integral type (except char) small enough to be represented
47 * in a double without loss; that is, it has no 32-bit type.
49 #if LONGSIZE > 4 && defined(_CRAY) && !defined(_CRAYMPP)
51 # define BW_MASK ((1 << BW_BITS) - 1)
52 # define BW_SIGN (1 << (BW_BITS - 1))
53 # define BWi(i) (((i) & BW_SIGN) ? ((i) | ~BW_MASK) : ((i) & BW_MASK))
54 # define BWu(u) ((u) & BW_MASK)
61 * Offset for integer pack/unpack.
63 * On architectures where I16 and I32 aren't really 16 and 32 bits,
64 * which for now are all Crays, pack and unpack have to play games.
68 * These values are required for portability of pack() output.
69 * If they're not right on your machine, then pack() and unpack()
70 * wouldn't work right anyway; you'll need to apply the Cray hack.
71 * (I'd like to check them with #if, but you can't use sizeof() in
72 * the preprocessor.) --???
75 The appropriate SHORTSIZE, INTSIZE, LONGSIZE, and LONGLONGSIZE
76 defines are now in config.h. --Andy Dougherty April 1998
81 #if BYTEORDER > 0xFFFF && defined(_CRAY) && !defined(_CRAYMPP)
82 # if BYTEORDER == 0x12345678
83 # define OFF16(p) (char*)(p)
84 # define OFF32(p) (char*)(p)
86 # if BYTEORDER == 0x87654321
87 # define OFF16(p) ((char*)(p) + (sizeof(U16) - SIZE16))
88 # define OFF32(p) ((char*)(p) + (sizeof(U32) - SIZE32))
90 }}}} bad cray byte order
93 # define COPY16(s,p) (*(p) = 0, Copy(s, OFF16(p), SIZE16, char))
94 # define COPY32(s,p) (*(p) = 0, Copy(s, OFF32(p), SIZE32, char))
95 # define CAT16(sv,p) sv_catpvn(sv, OFF16(p), SIZE16)
96 # define CAT32(sv,p) sv_catpvn(sv, OFF32(p), SIZE32)
98 # define COPY16(s,p) Copy(s, p, SIZE16, char)
99 # define COPY32(s,p) Copy(s, p, SIZE32, char)
100 # define CAT16(sv,p) sv_catpvn(sv, (char*)(p), SIZE16)
101 # define CAT32(sv,p) sv_catpvn(sv, (char*)(p), SIZE32)
104 static void doencodes _((SV* sv, char* s, I32 len));
105 static SV* refto _((SV* sv));
106 static U32 seed _((void));
108 static bool srand_called = FALSE;
110 /* variations on pp_null */
116 /* XXX I can't imagine anyone who doesn't have this actually _needs_
117 it, since pid_t is an integral type.
120 #ifdef NEED_GETPID_PROTO
121 extern Pid_t getpid (void);
127 if (GIMME_V == G_SCALAR)
142 if (op->op_private & OPpLVAL_INTRO)
143 SAVECLEARSV(curpad[op->op_targ]);
145 if (op->op_flags & OPf_REF) {
149 if (GIMME == G_ARRAY) {
150 I32 maxarg = AvFILL((AV*)TARG) + 1;
152 if (SvMAGICAL(TARG)) {
154 for (i=0; i < maxarg; i++) {
155 SV **svp = av_fetch((AV*)TARG, i, FALSE);
156 SP[i+1] = (svp) ? *svp : &sv_undef;
160 Copy(AvARRAY((AV*)TARG), SP+1, maxarg, SV*);
165 SV* sv = sv_newmortal();
166 I32 maxarg = AvFILL((AV*)TARG) + 1;
167 sv_setiv(sv, maxarg);
179 if (op->op_private & OPpLVAL_INTRO)
180 SAVECLEARSV(curpad[op->op_targ]);
181 if (op->op_flags & OPf_REF)
184 if (gimme == G_ARRAY) {
185 RETURNOP(do_kv(ARGS));
187 else if (gimme == G_SCALAR) {
188 SV* sv = sv_newmortal();
189 if (HvFILL((HV*)TARG))
190 sv_setpvf(sv, "%ld/%ld",
191 (long)HvFILL((HV*)TARG), (long)HvMAX((HV*)TARG) + 1);
201 DIE("NOT IMPL LINE %d",__LINE__);
213 if (SvTYPE(sv) == SVt_PVIO) {
214 GV *gv = (GV*) sv_newmortal();
215 gv_init(gv, 0, "", 0, 0);
216 GvIOp(gv) = (IO *)sv;
217 (void)SvREFCNT_inc(sv);
219 } else if (SvTYPE(sv) != SVt_PVGV)
220 DIE("Not a GLOB reference");
223 if (SvTYPE(sv) != SVt_PVGV) {
226 if (SvGMAGICAL(sv)) {
232 if (op->op_flags & OPf_REF ||
233 op->op_private & HINT_STRICT_REFS)
234 DIE(no_usym, "a symbol");
240 if (op->op_private & HINT_STRICT_REFS)
241 DIE(no_symref, sym, "a symbol");
242 sv = (SV*)gv_fetchpv(sym, TRUE, SVt_PVGV);
245 if (op->op_private & OPpLVAL_INTRO)
246 save_gp((GV*)sv, !(op->op_flags & OPf_SPECIAL));
258 switch (SvTYPE(sv)) {
262 DIE("Not a SCALAR reference");
269 if (SvTYPE(gv) != SVt_PVGV) {
270 if (SvGMAGICAL(sv)) {
276 if (op->op_flags & OPf_REF ||
277 op->op_private & HINT_STRICT_REFS)
278 DIE(no_usym, "a SCALAR");
284 if (op->op_private & HINT_STRICT_REFS)
285 DIE(no_symref, sym, "a SCALAR");
286 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PV);
290 if (op->op_flags & OPf_MOD) {
291 if (op->op_private & OPpLVAL_INTRO)
292 sv = save_scalar((GV*)TOPs);
293 else if (op->op_private & OPpDEREF)
294 vivify_ref(sv, op->op_private & OPpDEREF);
304 SV *sv = AvARYLEN(av);
306 AvARYLEN(av) = sv = NEWSV(0,0);
307 sv_upgrade(sv, SVt_IV);
308 sv_magic(sv, (SV*)av, '#', Nullch, 0);
316 djSP; dTARGET; dPOPss;
318 if (op->op_flags & OPf_MOD) {
319 if (SvTYPE(TARG) < SVt_PVLV) {
320 sv_upgrade(TARG, SVt_PVLV);
321 sv_magic(TARG, Nullsv, '.', Nullch, 0);
326 PUSHs(TARG); /* no SvSETMAGIC */
332 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
333 mg = mg_find(sv, 'g');
334 if (mg && mg->mg_len >= 0) {
335 PUSHi(mg->mg_len + curcop->cop_arybase);
349 /* We usually try to add a non-existent subroutine in case of AUTOLOAD. */
350 /* (But not in defined().) */
351 CV *cv = sv_2cv(TOPs, &stash, &gv, !(op->op_flags & OPf_SPECIAL));
354 cv = (CV*)sv_2mortal((SV*)cv_clone(cv));
371 if (SvPOK(TOPs) && SvCUR(TOPs) >= 7) {
372 char *s = SvPVX(TOPs);
373 if (strnEQ(s, "CORE::", 6)) {
376 code = keyword(s + 6, SvCUR(TOPs) - 6);
377 if (code < 0) { /* Overridable. */
378 #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2)
379 int i = 0, n = 0, seen_question = 0;
381 char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */
383 while (i < MAXO) { /* The slow way. */
384 if (strEQ(s + 6, op_name[i]) || strEQ(s + 6, op_desc[i]))
388 goto nonesuch; /* Should not happen... */
390 oa = opargs[i] >> OASHIFT;
392 if (oa & OA_OPTIONAL) {
395 } else if (seen_question)
396 goto set; /* XXXX system, exec */
397 if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF
398 && (oa & (OA_OPTIONAL - 1)) <= OA_HVREF) {
401 /* What to do with R ((un)tie, tied, (sys)read, recv)? */
402 str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)];
406 ret = sv_2mortal(newSVpv(str, n - 1));
407 } else if (code) /* Non-Overridable */
409 else { /* None such */
411 croak("Cannot find an opnumber for \"%s\"", s+6);
415 cv = sv_2cv(TOPs, &stash, &gv, FALSE);
417 ret = sv_2mortal(newSVpv(SvPVX(cv), SvCUR(cv)));
426 CV* cv = (CV*)curpad[op->op_targ];
428 cv = (CV*)sv_2mortal((SV*)cv_clone(cv));
444 if (GIMME != G_ARRAY) {
449 *MARK = refto(*MARK);
453 EXTEND_MORTAL(SP - MARK);
455 *MARK = refto(*MARK);
464 if (SvTYPE(sv) == SVt_PVLV && LvTYPE(sv) == 'y') {
467 if (!(sv = LvTARG(sv)))
470 else if (SvPADTMP(sv))
474 (void)SvREFCNT_inc(sv);
477 sv_upgrade(rv, SVt_RV);
491 if (sv && SvGMAGICAL(sv))
494 if (!sv || !SvROK(sv))
498 pv = sv_reftype(sv,TRUE);
499 PUSHp(pv, strlen(pv));
509 stash = curcop->cop_stash;
513 char *ptr = SvPV(ssv,len);
514 if (dowarn && len == 0)
515 warn("Explicit blessing to '' (assuming package main)");
516 stash = gv_stashpvn(ptr, len, TRUE);
519 (void)sv_bless(TOPs, stash);
536 switch (elem ? *elem : '\0')
539 if (strEQ(elem, "ARRAY"))
543 if (strEQ(elem, "CODE"))
544 ref = (SV*)GvCVu(gv);
547 if (strEQ(elem, "FILEHANDLE")) /* XXX deprecate in 5.005 */
548 ref = (SV*)GvIOp(gv);
551 if (strEQ(elem, "GLOB"))
555 if (strEQ(elem, "HASH"))
559 if (strEQ(elem, "IO"))
560 ref = (SV*)GvIOp(gv);
563 if (strEQ(elem, "NAME"))
564 sv = newSVpv(GvNAME(gv), GvNAMELEN(gv));
567 if (strEQ(elem, "PACKAGE"))
568 sv = newSVpv(HvNAME(GvSTASH(gv)), 0);
571 if (strEQ(elem, "SCALAR"))
585 /* Pattern matching */
590 register UNOP *unop = cUNOP;
591 register unsigned char *s;
594 register I32 *sfirst;
598 if(unop->op_first && unop->op_first->op_type == OP_PUSHRE) {
599 PMOP *pm = (PMOP *)unop->op_first;
600 SV *rv = sv_newmortal();
601 sv = newSVrv(rv, "Regexp");
602 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
606 if (sv == lastscream) {
612 SvSCREAM_off(lastscream);
613 SvREFCNT_dec(lastscream);
615 lastscream = SvREFCNT_inc(sv);
618 s = (unsigned char*)(SvPV(sv, len));
622 if (pos > maxscream) {
624 maxscream = pos + 80;
625 New(301, screamfirst, 256, I32);
626 New(302, screamnext, maxscream, I32);
629 maxscream = pos + pos / 4;
630 Renew(screamnext, maxscream, I32);
634 sfirst = screamfirst;
637 if (!sfirst || !snext)
638 DIE("do_study: out of memory");
640 for (ch = 256; ch; --ch)
647 snext[pos] = sfirst[ch] - pos;
654 sv_magic(sv, Nullsv, 'g', Nullch, 0); /* piggyback on m//g magic */
663 if (op->op_flags & OPf_STACKED)
669 TARG = sv_newmortal();
670 PUSHi(do_trans(sv, op));
674 /* Lvalue operators. */
686 djSP; dMARK; dTARGET;
696 SETi(do_chomp(TOPs));
702 djSP; dMARK; dTARGET;
703 register I32 count = 0;
706 count += do_chomp(POPs);
717 if (!sv || !SvANY(sv))
719 switch (SvTYPE(sv)) {
721 if (AvMAX(sv) >= 0 || SvGMAGICAL(sv))
725 if (HvARRAY(sv) || SvGMAGICAL(sv))
729 if (CvROOT(sv) || CvXSUB(sv))
746 if (!op->op_private) {
755 if (SvTHINKFIRST(sv)) {
762 switch (SvTYPE(sv)) {
772 if (cv_const_sv((CV*)sv))
773 warn("Constant subroutine %s undefined",
774 CvANON((CV*)sv) ? "(anonymous)" : GvENAME(CvGV((CV*)sv)));
777 { GV* gv = (GV*)SvREFCNT_inc(CvGV((CV*)sv));
779 CvGV((CV*)sv) = gv; } /* let user-undef'd sub keep its identity */
783 SvSetMagicSV(sv, &sv_undef);
787 Newz(602, gp, 1, GP);
788 GvGP(sv) = gp_ref(gp);
789 GvSV(sv) = NEWSV(72,0);
790 GvLINE(sv) = curcop->cop_line;
796 if (SvTYPE(sv) >= SVt_PV && SvPVX(sv) && SvLEN(sv)) {
799 SvPV_set(sv, Nullch);
812 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
814 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
815 SvIVX(TOPs) != IV_MIN)
818 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
829 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
831 sv_setsv(TARG, TOPs);
832 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
833 SvIVX(TOPs) != IV_MAX)
836 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
850 if(SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
852 sv_setsv(TARG, TOPs);
853 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
854 SvIVX(TOPs) != IV_MIN)
857 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
866 /* Ordinary operators. */
870 djSP; dATARGET; tryAMAGICbin(pow,opASSIGN);
873 SETn( pow( left, right) );
880 djSP; dATARGET; tryAMAGICbin(mult,opASSIGN);
883 SETn( left * right );
890 djSP; dATARGET; tryAMAGICbin(div,opASSIGN);
895 DIE("Illegal division by zero");
897 /* insure that 20./5. == 4. */
900 if ((double)I_V(left) == left &&
901 (double)I_V(right) == right &&
902 (k = I_V(left)/I_V(right))*I_V(right) == I_V(left)) {
905 value = left / right;
909 value = left / right;
918 djSP; dATARGET; tryAMAGICbin(mod,opASSIGN);
926 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)) {
928 right = (right_neg = (i < 0)) ? -i : i;
932 right = U_V((right_neg = (n < 0)) ? -n : n);
935 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)) {
937 left = (left_neg = (i < 0)) ? -i : i;
941 left = U_V((left_neg = (n < 0)) ? -n : n);
945 DIE("Illegal modulus zero");
948 if ((left_neg != right_neg) && ans)
951 /* XXX may warn: unary minus operator applied to unsigned type */
952 /* could change -foo to be (~foo)+1 instead */
953 if (ans <= ~((UV)IV_MAX)+1)
954 sv_setiv(TARG, ~ans+1);
956 sv_setnv(TARG, -(double)ans);
967 djSP; dATARGET; tryAMAGICbin(repeat,opASSIGN);
969 register I32 count = POPi;
970 if (GIMME == G_ARRAY && op->op_private & OPpREPEAT_DOLIST) {
972 I32 items = SP - MARK;
984 repeatcpy((char*)(MARK + items), (char*)MARK,
985 items * sizeof(SV*), count - 1);
991 else { /* Note: mark already snarfed by pp_list */
996 if (TARG == tmpstr && SvTHINKFIRST(tmpstr)) {
997 if (SvREADONLY(tmpstr) && curcop != &compiling)
998 DIE("Can't x= to readonly value");
1002 SvSetSV(TARG, tmpstr);
1003 SvPV_force(TARG, len);
1008 SvGROW(TARG, (count * len) + 1);
1009 repeatcpy(SvPVX(TARG) + len, SvPVX(TARG), len, count - 1);
1010 SvCUR(TARG) *= count;
1012 *SvEND(TARG) = '\0';
1014 (void)SvPOK_only(TARG);
1023 djSP; dATARGET; tryAMAGICbin(subtr,opASSIGN);
1026 SETn( left - right );
1033 djSP; dATARGET; tryAMAGICbin(lshift,opASSIGN);
1036 if (op->op_private & HINT_INTEGER) {
1038 i = BWi(i) << shift;
1052 djSP; dATARGET; tryAMAGICbin(rshift,opASSIGN);
1055 if (op->op_private & HINT_INTEGER) {
1057 i = BWi(i) >> shift;
1071 djSP; tryAMAGICbinSET(lt,0);
1074 SETs(boolSV(TOPn < value));
1081 djSP; tryAMAGICbinSET(gt,0);
1084 SETs(boolSV(TOPn > value));
1091 djSP; tryAMAGICbinSET(le,0);
1094 SETs(boolSV(TOPn <= value));
1101 djSP; tryAMAGICbinSET(ge,0);
1104 SETs(boolSV(TOPn >= value));
1111 djSP; tryAMAGICbinSET(ne,0);
1114 SETs(boolSV(TOPn != value));
1121 djSP; dTARGET; tryAMAGICbin(ncmp,0);
1128 else if (left < right)
1130 else if (left > right)
1143 djSP; tryAMAGICbinSET(slt,0);
1146 int cmp = ((op->op_private & OPpLOCALE)
1147 ? sv_cmp_locale(left, right)
1148 : sv_cmp(left, right));
1149 SETs(boolSV(cmp < 0));
1156 djSP; tryAMAGICbinSET(sgt,0);
1159 int cmp = ((op->op_private & OPpLOCALE)
1160 ? sv_cmp_locale(left, right)
1161 : sv_cmp(left, right));
1162 SETs(boolSV(cmp > 0));
1169 djSP; tryAMAGICbinSET(sle,0);
1172 int cmp = ((op->op_private & OPpLOCALE)
1173 ? sv_cmp_locale(left, right)
1174 : sv_cmp(left, right));
1175 SETs(boolSV(cmp <= 0));
1182 djSP; tryAMAGICbinSET(sge,0);
1185 int cmp = ((op->op_private & OPpLOCALE)
1186 ? sv_cmp_locale(left, right)
1187 : sv_cmp(left, right));
1188 SETs(boolSV(cmp >= 0));
1195 djSP; tryAMAGICbinSET(seq,0);
1198 SETs(boolSV(sv_eq(left, right)));
1205 djSP; tryAMAGICbinSET(sne,0);
1208 SETs(boolSV(!sv_eq(left, right)));
1215 djSP; dTARGET; tryAMAGICbin(scmp,0);
1218 int cmp = ((op->op_private & OPpLOCALE)
1219 ? sv_cmp_locale(left, right)
1220 : sv_cmp(left, right));
1228 djSP; dATARGET; tryAMAGICbin(band,opASSIGN);
1231 if (SvNIOKp(left) || SvNIOKp(right)) {
1232 if (op->op_private & HINT_INTEGER) {
1233 IBW value = SvIV(left) & SvIV(right);
1237 UBW value = SvUV(left) & SvUV(right);
1242 do_vop(op->op_type, TARG, left, right);
1251 djSP; dATARGET; tryAMAGICbin(bxor,opASSIGN);
1254 if (SvNIOKp(left) || SvNIOKp(right)) {
1255 if (op->op_private & HINT_INTEGER) {
1256 IBW value = (USE_LEFT(left) ? SvIV(left) : 0) ^ SvIV(right);
1260 UBW value = (USE_LEFT(left) ? SvUV(left) : 0) ^ SvUV(right);
1265 do_vop(op->op_type, TARG, left, right);
1274 djSP; dATARGET; tryAMAGICbin(bor,opASSIGN);
1277 if (SvNIOKp(left) || SvNIOKp(right)) {
1278 if (op->op_private & HINT_INTEGER) {
1279 IBW value = (USE_LEFT(left) ? SvIV(left) : 0) | SvIV(right);
1283 UBW value = (USE_LEFT(left) ? SvUV(left) : 0) | SvUV(right);
1288 do_vop(op->op_type, TARG, left, right);
1297 djSP; dTARGET; tryAMAGICun(neg);
1302 if (SvIOKp(sv) && !SvNOKp(sv) && !SvPOKp(sv) && SvIVX(sv) != IV_MIN)
1304 else if (SvNIOKp(sv))
1306 else if (SvPOKp(sv)) {
1308 char *s = SvPV(sv, len);
1309 if (isIDFIRST(*s)) {
1310 sv_setpvn(TARG, "-", 1);
1313 else if (*s == '+' || *s == '-') {
1315 *SvPV_force(TARG, len) = *s == '-' ? '+' : '-';
1318 sv_setnv(TARG, -SvNV(sv));
1330 djSP; tryAMAGICunSET(not);
1331 #endif /* OVERLOAD */
1332 *stack_sp = boolSV(!SvTRUE(*stack_sp));
1338 djSP; dTARGET; tryAMAGICun(compl);
1342 if (op->op_private & HINT_INTEGER) {
1343 IBW value = ~SvIV(sv);
1347 UBW value = ~SvUV(sv);
1352 register char *tmps;
1353 register long *tmpl;
1358 tmps = SvPV_force(TARG, len);
1361 for ( ; anum && (unsigned long)tmps % sizeof(long); anum--, tmps++)
1364 for ( ; anum >= sizeof(long); anum -= sizeof(long), tmpl++)
1368 for ( ; anum > 0; anum--, tmps++)
1377 /* integer versions of some of the above */
1381 djSP; dATARGET; tryAMAGICbin(mult,opASSIGN);
1384 SETi( left * right );
1391 djSP; dATARGET; tryAMAGICbin(div,opASSIGN);
1395 DIE("Illegal division by zero");
1396 value = POPi / value;
1404 djSP; dATARGET; tryAMAGICbin(mod,opASSIGN);
1408 DIE("Illegal modulus zero");
1409 SETi( left % right );
1416 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
1419 SETi( left + right );
1426 djSP; dATARGET; tryAMAGICbin(subtr,opASSIGN);
1429 SETi( left - right );
1436 djSP; tryAMAGICbinSET(lt,0);
1439 SETs(boolSV(left < right));
1446 djSP; tryAMAGICbinSET(gt,0);
1449 SETs(boolSV(left > right));
1456 djSP; tryAMAGICbinSET(le,0);
1459 SETs(boolSV(left <= right));
1466 djSP; tryAMAGICbinSET(ge,0);
1469 SETs(boolSV(left >= right));
1476 djSP; tryAMAGICbinSET(eq,0);
1479 SETs(boolSV(left == right));
1486 djSP; tryAMAGICbinSET(ne,0);
1489 SETs(boolSV(left != right));
1496 djSP; dTARGET; tryAMAGICbin(ncmp,0);
1503 else if (left < right)
1514 djSP; dTARGET; tryAMAGICun(neg);
1519 /* High falutin' math. */
1523 djSP; dTARGET; tryAMAGICbin(atan2,0);
1526 SETn(atan2(left, right));
1533 djSP; dTARGET; tryAMAGICun(sin);
1545 djSP; dTARGET; tryAMAGICun(cos);
1565 if (!srand_called) {
1566 (void)srand((unsigned)seed());
1567 srand_called = TRUE;
1570 value = rand() * value / 2147483648.0;
1573 value = rand() * value / 65536.0;
1576 value = rand() * value / 32768.0;
1578 value = rand() * value / (double)(((unsigned long)1) << RANDBITS);
1594 (void)srand((unsigned)anum);
1595 srand_called = TRUE;
1604 * This is really just a quick hack which grabs various garbage
1605 * values. It really should be a real hash algorithm which
1606 * spreads the effect of every input bit onto every output bit,
1607 * if someone who knows about such tings would bother to write it.
1608 * Might be a good idea to add that function to CORE as well.
1609 * No numbers below come from careful analysis or anyting here,
1610 * except they are primes and SEED_C1 > 1E6 to get a full-width
1611 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
1612 * probably be bigger too.
1615 # define SEED_C1 1000003
1616 #define SEED_C4 73819
1618 # define SEED_C1 25747
1619 #define SEED_C4 20639
1623 #define SEED_C5 26107
1628 # include <starlet.h>
1629 /* when[] = (low 32 bits, high 32 bits) of time since epoch
1630 * in 100-ns units, typically incremented ever 10 ms. */
1631 unsigned int when[2];
1632 _ckvmssts(sys$gettim(when));
1633 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
1635 # ifdef HAS_GETTIMEOFDAY
1636 struct timeval when;
1637 gettimeofday(&when,(struct timezone *) 0);
1638 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
1642 u = (U32)SEED_C1 * when;
1645 u += SEED_C3 * (U32)getpid();
1646 u += SEED_C4 * (U32)(UV)stack_sp;
1647 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
1648 u += SEED_C5 * (U32)(UV)&when;
1655 djSP; dTARGET; tryAMAGICun(exp);
1667 djSP; dTARGET; tryAMAGICun(log);
1672 SET_NUMERIC_STANDARD();
1673 DIE("Can't take log of %g", value);
1683 djSP; dTARGET; tryAMAGICun(sqrt);
1688 SET_NUMERIC_STANDARD();
1689 DIE("Can't take sqrt of %g", value);
1691 value = sqrt(value);
1701 double value = TOPn;
1704 if (SvIOKp(TOPs) && !SvNOKp(TOPs) && !SvPOKp(TOPs)) {
1710 (void)modf(value, &value);
1712 (void)modf(-value, &value);
1727 djSP; dTARGET; tryAMAGICun(abs);
1729 double value = TOPn;
1732 if (SvIOKp(TOPs) && !SvNOKp(TOPs) && !SvPOKp(TOPs) &&
1733 (iv = SvIVX(TOPs)) != IV_MIN) {
1754 XPUSHu(scan_hex(tmps, 99, &argtype));
1766 while (*tmps && isSPACE(*tmps))
1771 value = scan_hex(++tmps, 99, &argtype);
1773 value = scan_oct(tmps, 99, &argtype);
1783 SETi( sv_len(TOPs) );
1797 I32 lvalue = op->op_flags & OPf_MOD;
1799 I32 arybase = curcop->cop_arybase;
1803 SvTAINTED_off(TARG); /* decontaminate */
1805 /* pop off replacement string */
1807 repl = SvPV(sv, repl_len);
1808 /* pop off length */
1814 } else if (MAXARG == 3) {
1822 tmps = SvPV(sv, curlen);
1823 if (pos >= arybase) {
1841 else if (len >= 0) {
1843 if (rem > (I32)curlen)
1857 if (dowarn || lvalue || repl)
1858 warn("substr outside of string");
1863 sv_setpvn(TARG, tmps, rem);
1864 if (lvalue) { /* it's an lvalue! */
1865 if (!SvGMAGICAL(sv)) {
1869 warn("Attempt to use reference as lvalue in substr");
1871 if (SvOK(sv)) /* is it defined ? */
1872 (void)SvPOK_only(sv);
1874 sv_setpvn(sv,"",0); /* avoid lexical reincarnation */
1877 if (SvTYPE(TARG) < SVt_PVLV) {
1878 sv_upgrade(TARG, SVt_PVLV);
1879 sv_magic(TARG, Nullsv, 'x', Nullch, 0);
1884 LvTARGOFF(TARG) = pos;
1885 LvTARGLEN(TARG) = rem;
1888 sv_insert(sv, pos, rem, repl, repl_len);
1891 PUSHs(TARG); /* avoid SvSETMAGIC here */
1898 register I32 size = POPi;
1899 register I32 offset = POPi;
1900 register SV *src = POPs;
1901 I32 lvalue = op->op_flags & OPf_MOD;
1903 unsigned char *s = (unsigned char*)SvPV(src, srclen);
1904 unsigned long retnum;
1907 SvTAINTED_off(TARG); /* decontaminate */
1908 offset *= size; /* turn into bit offset */
1909 len = (offset + size + 7) / 8;
1910 if (offset < 0 || size < 1)
1913 if (lvalue) { /* it's an lvalue! */
1914 if (SvTYPE(TARG) < SVt_PVLV) {
1915 sv_upgrade(TARG, SVt_PVLV);
1916 sv_magic(TARG, Nullsv, 'v', Nullch, 0);
1921 LvTARGOFF(TARG) = offset;
1922 LvTARGLEN(TARG) = size;
1930 if (offset >= srclen)
1933 retnum = (unsigned long) s[offset] << 8;
1935 else if (size == 32) {
1936 if (offset >= srclen)
1938 else if (offset + 1 >= srclen)
1939 retnum = (unsigned long) s[offset] << 24;
1940 else if (offset + 2 >= srclen)
1941 retnum = ((unsigned long) s[offset] << 24) +
1942 ((unsigned long) s[offset + 1] << 16);
1944 retnum = ((unsigned long) s[offset] << 24) +
1945 ((unsigned long) s[offset + 1] << 16) +
1946 (s[offset + 2] << 8);
1951 retnum = (s[offset >> 3] >> (offset & 7)) & ((1 << size) - 1);
1956 else if (size == 16)
1957 retnum = ((unsigned long) s[offset] << 8) + s[offset+1];
1958 else if (size == 32)
1959 retnum = ((unsigned long) s[offset] << 24) +
1960 ((unsigned long) s[offset + 1] << 16) +
1961 (s[offset + 2] << 8) + s[offset+3];
1965 sv_setuv(TARG, (UV)retnum);
1980 I32 arybase = curcop->cop_arybase;
1985 offset = POPi - arybase;
1988 tmps = SvPV(big, biglen);
1991 else if (offset > biglen)
1993 if (!(tmps2 = fbm_instr((unsigned char*)tmps + offset,
1994 (unsigned char*)tmps + biglen, little)))
1995 retval = -1 + arybase;
1997 retval = tmps2 - tmps + arybase;
2014 I32 arybase = curcop->cop_arybase;
2020 tmps2 = SvPV(little, llen);
2021 tmps = SvPV(big, blen);
2025 offset = SvIV(offstr) - arybase + llen;
2028 else if (offset > blen)
2030 if (!(tmps2 = rninstr(tmps, tmps + offset,
2031 tmps2, tmps2 + llen)))
2032 retval = -1 + arybase;
2034 retval = tmps2 - tmps + arybase;
2041 djSP; dMARK; dORIGMARK; dTARGET;
2042 #ifdef USE_LOCALE_NUMERIC
2043 if (op->op_private & OPpLOCALE)
2044 SET_NUMERIC_LOCAL();
2046 SET_NUMERIC_STANDARD();
2048 do_sprintf(TARG, SP-MARK, MARK+1);
2049 TAINT_IF(SvTAINTED(TARG));
2063 value = (I32) (*tmps & 255);
2068 value = (I32) (anum & 255);
2079 (void)SvUPGRADE(TARG,SVt_PV);
2085 (void)SvPOK_only(TARG);
2092 djSP; dTARGET; dPOPTOPssrl;
2094 char *tmps = SvPV(left, na);
2096 sv_setpv(TARG, fcrypt(tmps, SvPV(right, na)));
2098 sv_setpv(TARG, crypt(tmps, SvPV(right, na)));
2102 "The crypt() function is unimplemented due to excessive paranoia.");
2114 if (!SvPADTMP(sv)) {
2120 s = SvPV_force(sv, na);
2122 if (op->op_private & OPpLOCALE) {
2125 *s = toUPPER_LC(*s);
2140 if (!SvPADTMP(sv)) {
2146 s = SvPV_force(sv, na);
2148 if (op->op_private & OPpLOCALE) {
2151 *s = toLOWER_LC(*s);
2168 if (!SvPADTMP(sv)) {
2175 s = SvPV_force(sv, len);
2177 register char *send = s + len;
2179 if (op->op_private & OPpLOCALE) {
2182 for (; s < send; s++)
2183 *s = toUPPER_LC(*s);
2186 for (; s < send; s++)
2200 if (!SvPADTMP(sv)) {
2207 s = SvPV_force(sv, len);
2209 register char *send = s + len;
2211 if (op->op_private & OPpLOCALE) {
2214 for (; s < send; s++)
2215 *s = toLOWER_LC(*s);
2218 for (; s < send; s++)
2230 register char *s = SvPV(sv,len);
2234 (void)SvUPGRADE(TARG, SVt_PV);
2235 SvGROW(TARG, (len * 2) + 1);
2243 SvCUR_set(TARG, d - SvPVX(TARG));
2244 (void)SvPOK_only(TARG);
2247 sv_setpvn(TARG, s, len);
2256 djSP; dMARK; dORIGMARK;
2258 register AV* av = (AV*)POPs;
2259 register I32 lval = op->op_flags & OPf_MOD;
2260 I32 arybase = curcop->cop_arybase;
2263 if (SvTYPE(av) == SVt_PVAV) {
2264 if (lval && op->op_private & OPpLVAL_INTRO) {
2266 for (svp = MARK + 1; svp <= SP; svp++) {
2271 if (max > AvMAX(av))
2274 while (++MARK <= SP) {
2275 elem = SvIVx(*MARK);
2279 svp = av_fetch(av, elem, lval);
2281 if (!svp || *svp == &sv_undef)
2282 DIE(no_aelem, elem);
2283 if (op->op_private & OPpLVAL_INTRO)
2284 save_aelem(av, elem, svp);
2286 *MARK = svp ? *svp : &sv_undef;
2289 if (GIMME != G_ARRAY) {
2297 /* Associative arrays. */
2302 HV *hash = (HV*)POPs;
2304 I32 gimme = GIMME_V;
2305 I32 realhv = (SvTYPE(hash) == SVt_PVHV);
2308 /* might clobber stack_sp */
2309 entry = realhv ? hv_iternext(hash) : avhv_iternext((AV*)hash);
2314 PUSHs(hv_iterkeysv(entry)); /* won't clobber stack_sp */
2315 if (gimme == G_ARRAY) {
2317 /* might clobber stack_sp */
2318 sv_setsv(TARG, realhv ?
2319 hv_iterval(hash, entry) : avhv_iterval((AV*)hash, entry));
2324 else if (gimme == G_SCALAR)
2343 I32 gimme = GIMME_V;
2344 I32 discard = (gimme == G_VOID) ? G_DISCARD : 0;
2348 if (op->op_private & OPpSLICE) {
2352 hvtype = SvTYPE(hv);
2353 while (++MARK <= SP) {
2354 if (hvtype == SVt_PVHV)
2355 sv = hv_delete_ent(hv, *MARK, discard, 0);
2356 else if (hvtype == SVt_PVAV)
2357 sv = avhv_delete_ent((AV*)hv, *MARK, discard, 0);
2359 DIE("Not a HASH reference");
2360 *MARK = sv ? sv : &sv_undef;
2364 else if (gimme == G_SCALAR) {
2373 if (SvTYPE(hv) == SVt_PVHV)
2374 sv = hv_delete_ent(hv, keysv, discard, 0);
2375 else if (SvTYPE(hv) == SVt_PVAV)
2376 sv = avhv_delete_ent((AV*)hv, keysv, discard, 0);
2378 DIE("Not a HASH reference");
2392 if (SvTYPE(hv) == SVt_PVHV) {
2393 if (hv_exists_ent(hv, tmpsv, 0))
2395 } else if (SvTYPE(hv) == SVt_PVAV) {
2396 if (avhv_exists_ent((AV*)hv, tmpsv, 0))
2399 DIE("Not a HASH reference");
2406 djSP; dMARK; dORIGMARK;
2408 register HV *hv = (HV*)POPs;
2409 register I32 lval = op->op_flags & OPf_MOD;
2410 I32 realhv = (SvTYPE(hv) == SVt_PVHV);
2412 if (realhv || SvTYPE(hv) == SVt_PVAV) {
2413 while (++MARK <= SP) {
2417 he = hv_fetch_ent(hv, keysv, lval, 0);
2418 svp = he ? &HeVAL(he) : 0;
2420 svp = avhv_fetch_ent((AV*)hv, keysv, lval, 0);
2423 if (!he || HeVAL(he) == &sv_undef)
2424 DIE(no_helem, SvPV(keysv, na));
2425 if (op->op_private & OPpLVAL_INTRO)
2426 save_helem(hv, keysv, &HeVAL(he));
2428 *MARK = he ? HeVAL(he) : &sv_undef;
2431 if (GIMME != G_ARRAY) {
2439 /* List operators. */
2444 if (GIMME != G_ARRAY) {
2446 *MARK = *SP; /* unwanted list, return last item */
2457 SV **lastrelem = stack_sp;
2458 SV **lastlelem = stack_base + POPMARK;
2459 SV **firstlelem = stack_base + POPMARK + 1;
2460 register SV **firstrelem = lastlelem + 1;
2461 I32 arybase = curcop->cop_arybase;
2462 I32 lval = op->op_flags & OPf_MOD;
2463 I32 is_something_there = lval;
2465 register I32 max = lastrelem - lastlelem;
2466 register SV **lelem;
2469 if (GIMME != G_ARRAY) {
2470 ix = SvIVx(*lastlelem);
2475 if (ix < 0 || ix >= max)
2476 *firstlelem = &sv_undef;
2478 *firstlelem = firstrelem[ix];
2484 SP = firstlelem - 1;
2488 for (lelem = firstlelem; lelem <= lastlelem; lelem++) {
2494 else if (!(*lelem = firstrelem[ix]))
2499 if (ix >= max || !(*lelem = firstrelem[ix]))
2502 if (!is_something_there && (SvOK(*lelem) || SvGMAGICAL(*lelem)))
2503 is_something_there = TRUE;
2505 if (is_something_there)
2508 SP = firstlelem - 1;
2514 djSP; dMARK; dORIGMARK;
2515 I32 items = SP - MARK;
2516 SV *av = sv_2mortal((SV*)av_make(items, MARK+1));
2517 SP = ORIGMARK; /* av_make() might realloc stack_sp */
2524 djSP; dMARK; dORIGMARK;
2525 HV* hv = (HV*)sv_2mortal((SV*)newHV());
2529 SV *val = NEWSV(46, 0);
2531 sv_setsv(val, *++MARK);
2533 warn("Odd number of elements in hash assignment");
2534 (void)hv_store_ent(hv,key,val,0);
2543 djSP; dMARK; dORIGMARK;
2544 register AV *ary = (AV*)*++MARK;
2548 register I32 offset;
2549 register I32 length;
2556 if (SvRMAGICAL(ary) && (mg = mg_find((SV*)ary,'P'))) {
2557 *MARK-- = mg->mg_obj;
2561 perl_call_method("SPLICE",GIMME_V);
2570 offset = i = SvIVx(*MARK);
2572 offset += AvFILLp(ary) + 1;
2574 offset -= curcop->cop_arybase;
2578 length = SvIVx(*MARK++);
2583 length = AvMAX(ary) + 1; /* close enough to infinity */
2587 length = AvMAX(ary) + 1;
2589 if (offset > AvFILLp(ary) + 1)
2590 offset = AvFILLp(ary) + 1;
2591 after = AvFILLp(ary) + 1 - (offset + length);
2592 if (after < 0) { /* not that much array */
2593 length += after; /* offset+length now in array */
2599 /* At this point, MARK .. SP-1 is our new LIST */
2602 diff = newlen - length;
2603 if (newlen && !AvREAL(ary)) {
2607 assert(AvREAL(ary)); /* would leak, so croak */
2610 if (diff < 0) { /* shrinking the area */
2612 New(451, tmparyval, newlen, SV*); /* so remember insertion */
2613 Copy(MARK, tmparyval, newlen, SV*);
2616 MARK = ORIGMARK + 1;
2617 if (GIMME == G_ARRAY) { /* copy return vals to stack */
2618 MEXTEND(MARK, length);
2619 Copy(AvARRAY(ary)+offset, MARK, length, SV*);
2621 EXTEND_MORTAL(length);
2622 for (i = length, dst = MARK; i; i--) {
2623 if (!SvIMMORTAL(*dst))
2624 sv_2mortal(*dst); /* free them eventualy */
2631 *MARK = AvARRAY(ary)[offset+length-1];
2633 if (!SvIMMORTAL(*MARK))
2635 for (i = length - 1, dst = &AvARRAY(ary)[offset]; i > 0; i--)
2636 SvREFCNT_dec(*dst++); /* free them now */
2639 AvFILLp(ary) += diff;
2641 /* pull up or down? */
2643 if (offset < after) { /* easier to pull up */
2644 if (offset) { /* esp. if nothing to pull */
2645 src = &AvARRAY(ary)[offset-1];
2646 dst = src - diff; /* diff is negative */
2647 for (i = offset; i > 0; i--) /* can't trust Copy */
2651 SvPVX(ary) = (char*)(AvARRAY(ary) - diff); /* diff is negative */
2655 if (after) { /* anything to pull down? */
2656 src = AvARRAY(ary) + offset + length;
2657 dst = src + diff; /* diff is negative */
2658 Move(src, dst, after, SV*);
2660 dst = &AvARRAY(ary)[AvFILLp(ary)+1];
2661 /* avoid later double free */
2665 dst[--i] = &sv_undef;
2668 for (src = tmparyval, dst = AvARRAY(ary) + offset;
2670 *dst = NEWSV(46, 0);
2671 sv_setsv(*dst++, *src++);
2673 Safefree(tmparyval);
2676 else { /* no, expanding (or same) */
2678 New(452, tmparyval, length, SV*); /* so remember deletion */
2679 Copy(AvARRAY(ary)+offset, tmparyval, length, SV*);
2682 if (diff > 0) { /* expanding */
2684 /* push up or down? */
2686 if (offset < after && diff <= AvARRAY(ary) - AvALLOC(ary)) {
2690 Move(src, dst, offset, SV*);
2692 SvPVX(ary) = (char*)(AvARRAY(ary) - diff);/* diff is positive */
2694 AvFILLp(ary) += diff;
2697 if (AvFILLp(ary) + diff >= AvMAX(ary)) /* oh, well */
2698 av_extend(ary, AvFILLp(ary) + diff);
2699 AvFILLp(ary) += diff;
2702 dst = AvARRAY(ary) + AvFILLp(ary);
2704 for (i = after; i; i--) {
2711 for (src = MARK, dst = AvARRAY(ary) + offset; newlen; newlen--) {
2712 *dst = NEWSV(46, 0);
2713 sv_setsv(*dst++, *src++);
2715 MARK = ORIGMARK + 1;
2716 if (GIMME == G_ARRAY) { /* copy return vals to stack */
2718 Copy(tmparyval, MARK, length, SV*);
2720 EXTEND_MORTAL(length);
2721 for (i = length, dst = MARK; i; i--) {
2722 if (!SvIMMORTAL(*dst))
2723 sv_2mortal(*dst); /* free them eventualy */
2727 Safefree(tmparyval);
2731 else if (length--) {
2732 *MARK = tmparyval[length];
2734 if (!SvIMMORTAL(*MARK))
2736 while (length-- > 0)
2737 SvREFCNT_dec(tmparyval[length]);
2739 Safefree(tmparyval);
2750 djSP; dMARK; dORIGMARK; dTARGET;
2751 register AV *ary = (AV*)*++MARK;
2752 register SV *sv = &sv_undef;
2755 if (SvRMAGICAL(ary) && (mg = mg_find((SV*)ary,'P'))) {
2756 *MARK-- = mg->mg_obj;
2760 perl_call_method("PUSH",G_SCALAR|G_DISCARD);
2765 /* Why no pre-extend of ary here ? */
2766 for (++MARK; MARK <= SP; MARK++) {
2769 sv_setsv(sv, *MARK);
2774 PUSHi( AvFILL(ary) + 1 );
2782 SV *sv = av_pop(av);
2783 if (!SvIMMORTAL(sv) && AvREAL(av))
2784 (void)sv_2mortal(sv);
2793 SV *sv = av_shift(av);
2797 if (!SvIMMORTAL(sv) && AvREAL(av))
2798 (void)sv_2mortal(sv);
2805 djSP; dMARK; dORIGMARK; dTARGET;
2806 register AV *ary = (AV*)*++MARK;
2811 if (SvRMAGICAL(ary) && (mg = mg_find((SV*)ary,'P'))) {
2812 *MARK-- = mg->mg_obj;
2816 perl_call_method("UNSHIFT",G_SCALAR|G_DISCARD);
2821 av_unshift(ary, SP - MARK);
2824 sv_setsv(sv, *++MARK);
2825 (void)av_store(ary, i++, sv);
2829 PUSHi( AvFILL(ary) + 1 );
2839 if (GIMME == G_ARRAY) {
2850 register char *down;
2856 do_join(TARG, &sv_no, MARK, SP);
2858 sv_setsv(TARG, (SP > MARK) ? *SP : DEFSV);
2859 up = SvPV_force(TARG, len);
2861 down = SvPVX(TARG) + len - 1;
2867 (void)SvPOK_only(TARG);
2876 mul128(SV *sv, U8 m)
2879 char *s = SvPV(sv, len);
2883 if (!strnEQ(s, "0000", 4)) { /* need to grow sv */
2884 SV *tmpNew = newSVpv("0000000000", 10);
2886 sv_catsv(tmpNew, sv);
2887 SvREFCNT_dec(sv); /* free old sv */
2892 while (!*t) /* trailing '\0'? */
2895 i = ((*t - '0') << 7) + m;
2896 *(t--) = '0' + (i % 10);
2902 /* Explosives and implosives. */
2909 I32 gimme = GIMME_V;
2913 register char *pat = SvPV(left, llen);
2914 register char *s = SvPV(right, rlen);
2915 char *strend = s + rlen;
2917 register char *patend = pat + llen;
2922 /* These must not be in registers: */
2933 unsigned Quad_t auquad;
2939 register U32 culong;
2941 static char* bitcount = 0;
2944 if (gimme != G_ARRAY) { /* arrange to do first one only */
2946 for (patend = pat; !isALPHA(*patend) || *patend == 'x'; patend++) ;
2947 if (strchr("aAbBhHP", *patend) || *pat == '%') {
2949 while (isDIGIT(*patend) || *patend == '*')
2955 while (pat < patend) {
2957 datumtype = *pat++ & 0xFF;
2958 if (isSPACE(datumtype))
2962 else if (*pat == '*') {
2963 len = strend - strbeg; /* long enough */
2966 else if (isDIGIT(*pat)) {
2968 while (isDIGIT(*pat))
2969 len = (len * 10) + (*pat++ - '0');
2972 len = (datumtype != '@');
2975 croak("Invalid type in unpack: '%c'", (int)datumtype);
2976 case ',': /* grandfather in commas but with a warning */
2977 if (commas++ == 0 && dowarn)
2978 warn("Invalid type in unpack: '%c'", (int)datumtype);
2981 if (len == 1 && pat[-1] != '1')
2990 if (len > strend - strbeg)
2991 DIE("@ outside of string");
2995 if (len > s - strbeg)
2996 DIE("X outside of string");
3000 if (len > strend - s)
3001 DIE("x outside of string");
3006 if (len > strend - s)
3009 goto uchar_checksum;
3010 sv = NEWSV(35, len);
3011 sv_setpvn(sv, s, len);
3013 if (datumtype == 'A') {
3014 aptr = s; /* borrow register */
3015 s = SvPVX(sv) + len - 1;
3016 while (s >= SvPVX(sv) && (!*s || isSPACE(*s)))
3019 SvCUR_set(sv, s - SvPVX(sv));
3020 s = aptr; /* unborrow register */
3022 XPUSHs(sv_2mortal(sv));
3026 if (pat[-1] == '*' || len > (strend - s) * 8)
3027 len = (strend - s) * 8;
3030 Newz(601, bitcount, 256, char);
3031 for (bits = 1; bits < 256; bits++) {
3032 if (bits & 1) bitcount[bits]++;
3033 if (bits & 2) bitcount[bits]++;
3034 if (bits & 4) bitcount[bits]++;
3035 if (bits & 8) bitcount[bits]++;
3036 if (bits & 16) bitcount[bits]++;
3037 if (bits & 32) bitcount[bits]++;
3038 if (bits & 64) bitcount[bits]++;
3039 if (bits & 128) bitcount[bits]++;
3043 culong += bitcount[*(unsigned char*)s++];
3048 if (datumtype == 'b') {
3050 if (bits & 1) culong++;
3056 if (bits & 128) culong++;
3063 sv = NEWSV(35, len + 1);
3066 aptr = pat; /* borrow register */
3068 if (datumtype == 'b') {
3070 for (len = 0; len < aint; len++) {
3071 if (len & 7) /*SUPPRESS 595*/
3075 *pat++ = '0' + (bits & 1);
3080 for (len = 0; len < aint; len++) {
3085 *pat++ = '0' + ((bits & 128) != 0);
3089 pat = aptr; /* unborrow register */
3090 XPUSHs(sv_2mortal(sv));
3094 if (pat[-1] == '*' || len > (strend - s) * 2)
3095 len = (strend - s) * 2;
3096 sv = NEWSV(35, len + 1);
3099 aptr = pat; /* borrow register */
3101 if (datumtype == 'h') {
3103 for (len = 0; len < aint; len++) {
3108 *pat++ = hexdigit[bits & 15];
3113 for (len = 0; len < aint; len++) {
3118 *pat++ = hexdigit[(bits >> 4) & 15];
3122 pat = aptr; /* unborrow register */
3123 XPUSHs(sv_2mortal(sv));
3126 if (len > strend - s)
3131 if (aint >= 128) /* fake up signed chars */
3141 if (aint >= 128) /* fake up signed chars */
3144 sv_setiv(sv, (IV)aint);
3145 PUSHs(sv_2mortal(sv));
3150 if (len > strend - s)
3165 sv_setiv(sv, (IV)auint);
3166 PUSHs(sv_2mortal(sv));
3171 along = (strend - s) / SIZE16;
3188 sv_setiv(sv, (IV)ashort);
3189 PUSHs(sv_2mortal(sv));
3196 along = (strend - s) / SIZE16;
3201 COPY16(s, &aushort);
3204 if (datumtype == 'n')
3205 aushort = PerlSock_ntohs(aushort);
3208 if (datumtype == 'v')
3209 aushort = vtohs(aushort);
3218 COPY16(s, &aushort);
3222 if (datumtype == 'n')
3223 aushort = PerlSock_ntohs(aushort);
3226 if (datumtype == 'v')
3227 aushort = vtohs(aushort);
3229 sv_setiv(sv, (IV)aushort);
3230 PUSHs(sv_2mortal(sv));
3235 along = (strend - s) / sizeof(int);
3240 Copy(s, &aint, 1, int);
3243 cdouble += (double)aint;
3252 Copy(s, &aint, 1, int);
3256 /* Without the dummy below unpack("i", pack("i",-1))
3257 * return 0xFFffFFff instead of -1 for Digital Unix V4.0
3258 * cc with optimization turned on */
3260 sv_setiv(sv, (IV)aint) :
3262 sv_setiv(sv, (IV)aint);
3263 PUSHs(sv_2mortal(sv));
3268 along = (strend - s) / sizeof(unsigned int);
3273 Copy(s, &auint, 1, unsigned int);
3274 s += sizeof(unsigned int);
3276 cdouble += (double)auint;
3285 Copy(s, &auint, 1, unsigned int);
3286 s += sizeof(unsigned int);
3288 sv_setuv(sv, (UV)auint);
3289 PUSHs(sv_2mortal(sv));
3294 along = (strend - s) / SIZE32;
3302 cdouble += (double)along;
3314 sv_setiv(sv, (IV)along);
3315 PUSHs(sv_2mortal(sv));
3322 along = (strend - s) / SIZE32;
3330 if (datumtype == 'N')
3331 aulong = PerlSock_ntohl(aulong);
3334 if (datumtype == 'V')
3335 aulong = vtohl(aulong);
3338 cdouble += (double)aulong;
3350 if (datumtype == 'N')
3351 aulong = PerlSock_ntohl(aulong);
3354 if (datumtype == 'V')
3355 aulong = vtohl(aulong);
3358 sv_setuv(sv, (UV)aulong);
3359 PUSHs(sv_2mortal(sv));
3364 along = (strend - s) / sizeof(char*);
3370 if (sizeof(char*) > strend - s)
3373 Copy(s, &aptr, 1, char*);
3379 PUSHs(sv_2mortal(sv));
3389 while ((len > 0) && (s < strend)) {
3390 auv = (auv << 7) | (*s & 0x7f);
3391 if (!(*s++ & 0x80)) {
3395 PUSHs(sv_2mortal(sv));
3399 else if (++bytes >= sizeof(UV)) { /* promote to string */
3402 sv = newSVpvf("%.*Vu", (int)TYPE_DIGITS(UV), auv);
3403 while (s < strend) {
3404 sv = mul128(sv, *s & 0x7f);
3405 if (!(*s++ & 0x80)) {
3414 PUSHs(sv_2mortal(sv));
3419 if ((s >= strend) && bytes)
3420 croak("Unterminated compressed integer");
3425 if (sizeof(char*) > strend - s)
3428 Copy(s, &aptr, 1, char*);
3433 sv_setpvn(sv, aptr, len);
3434 PUSHs(sv_2mortal(sv));
3441 if (s + sizeof(Quad_t) > strend)
3444 Copy(s, &aquad, 1, Quad_t);
3445 s += sizeof(Quad_t);
3448 if (aquad >= IV_MIN && aquad <= IV_MAX)
3449 sv_setiv(sv, (IV)aquad);
3451 sv_setnv(sv, (double)aquad);
3452 PUSHs(sv_2mortal(sv));
3459 if (s + sizeof(unsigned Quad_t) > strend)
3462 Copy(s, &auquad, 1, unsigned Quad_t);
3463 s += sizeof(unsigned Quad_t);
3466 if (aquad <= UV_MAX)
3467 sv_setuv(sv, (UV)auquad);
3469 sv_setnv(sv, (double)auquad);
3470 PUSHs(sv_2mortal(sv));
3474 /* float and double added gnb@melba.bby.oz.au 22/11/89 */
3477 along = (strend - s) / sizeof(float);
3482 Copy(s, &afloat, 1, float);
3491 Copy(s, &afloat, 1, float);
3494 sv_setnv(sv, (double)afloat);
3495 PUSHs(sv_2mortal(sv));
3501 along = (strend - s) / sizeof(double);
3506 Copy(s, &adouble, 1, double);
3507 s += sizeof(double);
3515 Copy(s, &adouble, 1, double);
3516 s += sizeof(double);
3518 sv_setnv(sv, (double)adouble);
3519 PUSHs(sv_2mortal(sv));
3524 along = (strend - s) * 3 / 4;
3525 sv = NEWSV(42, along);
3528 while (s < strend && *s > ' ' && *s < 'a') {
3533 len = (*s++ - ' ') & 077;
3535 if (s < strend && *s >= ' ')
3536 a = (*s++ - ' ') & 077;
3539 if (s < strend && *s >= ' ')
3540 b = (*s++ - ' ') & 077;
3543 if (s < strend && *s >= ' ')
3544 c = (*s++ - ' ') & 077;
3547 if (s < strend && *s >= ' ')
3548 d = (*s++ - ' ') & 077;
3551 hunk[0] = (a << 2) | (b >> 4);
3552 hunk[1] = (b << 4) | (c >> 2);
3553 hunk[2] = (c << 6) | d;
3554 sv_catpvn(sv, hunk, (len > 3) ? 3 : len);
3559 else if (s[1] == '\n') /* possible checksum byte */
3562 XPUSHs(sv_2mortal(sv));
3567 if (strchr("fFdD", datumtype) ||
3568 (checksum > 32 && strchr("iIlLN", datumtype)) ) {
3572 while (checksum >= 16) {
3576 while (checksum >= 4) {
3582 along = (1 << checksum) - 1;
3583 while (cdouble < 0.0)
3585 cdouble = modf(cdouble / adouble, &trouble) * adouble;
3586 sv_setnv(sv, cdouble);
3589 if (checksum < 32) {
3590 aulong = (1 << checksum) - 1;
3593 sv_setuv(sv, (UV)culong);
3595 XPUSHs(sv_2mortal(sv));
3599 if (SP == oldsp && gimme == G_SCALAR)
3605 doencodes(register SV *sv, register char *s, register I32 len)
3610 sv_catpvn(sv, hunk, 1);
3613 hunk[0] = ' ' + (077 & (*s >> 2));
3614 hunk[1] = ' ' + (077 & (((*s << 4) & 060) | ((s[1] >> 4) & 017)));
3615 hunk[2] = ' ' + (077 & (((s[1] << 2) & 074) | ((s[2] >> 6) & 03)));
3616 hunk[3] = ' ' + (077 & (s[2] & 077));
3617 sv_catpvn(sv, hunk, 4);
3621 for (s = SvPVX(sv); *s; s++) {
3625 sv_catpvn(sv, "\n", 1);
3629 is_an_int(char *s, STRLEN l)
3631 SV *result = newSVpv("", l);
3632 char *result_c = SvPV(result, na); /* convenience */
3633 char *out = result_c;
3643 SvREFCNT_dec(result);
3666 SvREFCNT_dec(result);
3672 SvCUR_set(result, out - result_c);
3677 div128(SV *pnum, bool *done)
3678 /* must be '\0' terminated */
3682 char *s = SvPV(pnum, len);
3691 i = m * 10 + (*t - '0');
3693 r = (i >> 7); /* r < 10 */
3700 SvCUR_set(pnum, (STRLEN) (t - s));
3707 djSP; dMARK; dORIGMARK; dTARGET;
3708 register SV *cat = TARG;
3711 register char *pat = SvPVx(*++MARK, fromlen);
3712 register char *patend = pat + fromlen;
3717 static char null10[] = {0,0,0,0,0,0,0,0,0,0};
3718 static char *space10 = " ";
3720 /* These must not be in registers: */
3729 unsigned Quad_t auquad;
3738 sv_setpvn(cat, "", 0);
3739 while (pat < patend) {
3740 #define NEXTFROM (items-- > 0 ? *MARK++ : &sv_no)
3741 datumtype = *pat++ & 0xFF;
3742 if (isSPACE(datumtype))
3745 len = strchr("@Xxu", datumtype) ? 0 : items;
3748 else if (isDIGIT(*pat)) {
3750 while (isDIGIT(*pat))
3751 len = (len * 10) + (*pat++ - '0');
3757 croak("Invalid type in pack: '%c'", (int)datumtype);
3758 case ',': /* grandfather in commas but with a warning */
3759 if (commas++ == 0 && dowarn)
3760 warn("Invalid type in pack: '%c'", (int)datumtype);
3763 DIE("%% may only be used in unpack");
3774 if (SvCUR(cat) < len)
3775 DIE("X outside of string");
3782 sv_catpvn(cat, null10, 10);
3785 sv_catpvn(cat, null10, len);
3790 aptr = SvPV(fromstr, fromlen);
3794 sv_catpvn(cat, aptr, len);
3796 sv_catpvn(cat, aptr, fromlen);
3798 if (datumtype == 'A') {
3800 sv_catpvn(cat, space10, 10);
3803 sv_catpvn(cat, space10, len);
3807 sv_catpvn(cat, null10, 10);
3810 sv_catpvn(cat, null10, len);
3817 char *savepat = pat;
3822 aptr = SvPV(fromstr, fromlen);
3827 SvCUR(cat) += (len+7)/8;
3828 SvGROW(cat, SvCUR(cat) + 1);
3829 aptr = SvPVX(cat) + aint;
3834 if (datumtype == 'B') {
3835 for (len = 0; len++ < aint;) {
3836 items |= *pat++ & 1;
3840 *aptr++ = items & 0xff;
3846 for (len = 0; len++ < aint;) {
3852 *aptr++ = items & 0xff;
3858 if (datumtype == 'B')
3859 items <<= 7 - (aint & 7);
3861 items >>= 7 - (aint & 7);
3862 *aptr++ = items & 0xff;
3864 pat = SvPVX(cat) + SvCUR(cat);
3875 char *savepat = pat;
3880 aptr = SvPV(fromstr, fromlen);
3885 SvCUR(cat) += (len+1)/2;
3886 SvGROW(cat, SvCUR(cat) + 1);
3887 aptr = SvPVX(cat) + aint;
3892 if (datumtype == 'H') {
3893 for (len = 0; len++ < aint;) {
3895 items |= ((*pat++ & 15) + 9) & 15;
3897 items |= *pat++ & 15;
3901 *aptr++ = items & 0xff;
3907 for (len = 0; len++ < aint;) {
3909 items |= (((*pat++ & 15) + 9) & 15) << 4;
3911 items |= (*pat++ & 15) << 4;
3915 *aptr++ = items & 0xff;
3921 *aptr++ = items & 0xff;
3922 pat = SvPVX(cat) + SvCUR(cat);
3934 aint = SvIV(fromstr);
3936 sv_catpvn(cat, &achar, sizeof(char));
3939 /* Float and double added by gnb@melba.bby.oz.au 22/11/89 */
3944 afloat = (float)SvNV(fromstr);
3945 sv_catpvn(cat, (char *)&afloat, sizeof (float));
3952 adouble = (double)SvNV(fromstr);
3953 sv_catpvn(cat, (char *)&adouble, sizeof (double));
3959 ashort = (I16)SvIV(fromstr);
3961 ashort = PerlSock_htons(ashort);
3963 CAT16(cat, &ashort);
3969 ashort = (I16)SvIV(fromstr);
3971 ashort = htovs(ashort);
3973 CAT16(cat, &ashort);
3980 ashort = (I16)SvIV(fromstr);
3981 CAT16(cat, &ashort);
3987 auint = SvUV(fromstr);
3988 sv_catpvn(cat, (char*)&auint, sizeof(unsigned int));
3994 adouble = floor(SvNV(fromstr));
3997 croak("Cannot compress negative numbers");
4003 #ifdef CXUX_BROKEN_CONSTANT_CONVERT
4004 adouble <= UV_MAX_cxux
4011 char buf[1 + sizeof(UV)];
4012 char *in = buf + sizeof(buf);
4013 UV auv = U_V(adouble);;
4016 *--in = (auv & 0x7f) | 0x80;
4019 buf[sizeof(buf) - 1] &= 0x7f; /* clear continue bit */
4020 sv_catpvn(cat, in, (buf + sizeof(buf)) - in);
4022 else if (SvPOKp(fromstr)) { /* decimal string arithmetics */
4023 char *from, *result, *in;
4028 /* Copy string and check for compliance */
4029 from = SvPV(fromstr, len);
4030 if ((norm = is_an_int(from, len)) == NULL)
4031 croak("can compress only unsigned integer");
4033 New('w', result, len, char);
4037 *--in = div128(norm, &done) | 0x80;
4038 result[len - 1] &= 0x7F; /* clear continue bit */
4039 sv_catpvn(cat, in, (result + len) - in);
4041 SvREFCNT_dec(norm); /* free norm */
4043 else if (SvNOKp(fromstr)) {
4044 char buf[sizeof(double) * 2]; /* 8/7 <= 2 */
4045 char *in = buf + sizeof(buf);
4048 double next = floor(adouble / 128);
4049 *--in = (unsigned char)(adouble - (next * 128)) | 0x80;
4050 if (--in < buf) /* this cannot happen ;-) */
4051 croak ("Cannot compress integer");
4053 } while (adouble > 0);
4054 buf[sizeof(buf) - 1] &= 0x7f; /* clear continue bit */
4055 sv_catpvn(cat, in, (buf + sizeof(buf)) - in);
4058 croak("Cannot compress non integer");
4064 aint = SvIV(fromstr);
4065 sv_catpvn(cat, (char*)&aint, sizeof(int));
4071 aulong = SvUV(fromstr);
4073 aulong = PerlSock_htonl(aulong);
4075 CAT32(cat, &aulong);
4081 aulong = SvUV(fromstr);
4083 aulong = htovl(aulong);
4085 CAT32(cat, &aulong);
4091 aulong = SvUV(fromstr);
4092 CAT32(cat, &aulong);
4098 along = SvIV(fromstr);
4106 auquad = (unsigned Quad_t)SvIV(fromstr);
4107 sv_catpvn(cat, (char*)&auquad, sizeof(unsigned Quad_t));
4113 aquad = (Quad_t)SvIV(fromstr);
4114 sv_catpvn(cat, (char*)&aquad, sizeof(Quad_t));
4117 #endif /* HAS_QUAD */
4119 len = 1; /* assume SV is correct length */
4124 if (fromstr == &sv_undef)
4127 /* XXX better yet, could spirit away the string to
4128 * a safe spot and hang on to it until the result
4129 * of pack() (and all copies of the result) are
4132 if (dowarn && (SvTEMP(fromstr) || SvPADTMP(fromstr)))
4133 warn("Attempt to pack pointer to temporary value");
4134 if (SvPOK(fromstr) || SvNIOK(fromstr))
4135 aptr = SvPV(fromstr,na);
4137 aptr = SvPV_force(fromstr,na);
4139 sv_catpvn(cat, (char*)&aptr, sizeof(char*));
4144 aptr = SvPV(fromstr, fromlen);
4145 SvGROW(cat, fromlen * 4 / 3);
4150 while (fromlen > 0) {
4157 doencodes(cat, aptr, todo);
4176 register I32 limit = POPi; /* note, negative is forever */
4179 register char *s = SvPV(sv, len);
4180 char *strend = s + len;
4182 register REGEXP *rx;
4186 I32 maxiters = (strend - s) + 10;
4189 I32 origlimit = limit;
4192 AV *oldstack = curstack;
4193 I32 gimme = GIMME_V;
4194 I32 oldsave = savestack_ix;
4195 I32 make_mortal = 1;
4196 MAGIC *mg = (MAGIC *) NULL;
4199 Copy(&LvTARGOFF(POPs), &pm, 1, PMOP*);
4204 DIE("panic: do_split");
4205 rx = pm->op_pmregexp;
4207 TAINT_IF((pm->op_pmflags & PMf_LOCALE) &&
4208 (pm->op_pmflags & (PMf_WHITE | PMf_SKIPWHITE)));
4210 if (pm->op_pmreplroot)
4211 ary = GvAVn((GV*)pm->op_pmreplroot);
4212 else if (gimme != G_ARRAY)
4214 ary = (AV*)curpad[0];
4217 #endif /* USE_THREADS */
4220 if (ary && (gimme != G_ARRAY || (pm->op_pmflags & PMf_ONCE))) {
4226 if (SvRMAGICAL(ary) && (mg = mg_find((SV *) ary, 'P'))) {
4233 for (i = AvFILLp(ary); i >= 0; i--)
4234 AvARRAY(ary)[i] = &sv_undef; /* don't free mere refs */
4236 /* temporarily switch stacks */
4237 SWITCHSTACK(curstack, ary);
4241 base = SP - stack_base;
4243 if (pm->op_pmflags & PMf_SKIPWHITE) {
4244 if (pm->op_pmflags & PMf_LOCALE) {
4245 while (isSPACE_LC(*s))
4253 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
4255 multiline = pm->op_pmflags & PMf_MULTILINE;
4259 limit = maxiters + 2;
4260 if (pm->op_pmflags & PMf_WHITE) {
4263 while (m < strend &&
4264 !((pm->op_pmflags & PMf_LOCALE)
4265 ? isSPACE_LC(*m) : isSPACE(*m)))
4270 dstr = NEWSV(30, m-s);
4271 sv_setpvn(dstr, s, m-s);
4277 while (s < strend &&
4278 ((pm->op_pmflags & PMf_LOCALE)
4279 ? isSPACE_LC(*s) : isSPACE(*s)))
4283 else if (strEQ("^", rx->precomp)) {
4286 for (m = s; m < strend && *m != '\n'; m++) ;
4290 dstr = NEWSV(30, m-s);
4291 sv_setpvn(dstr, s, m-s);
4298 else if (rx->check_substr && !rx->nparens
4299 && (rx->reganch & ROPT_CHECK_ALL)
4300 && !(rx->reganch & ROPT_ANCH)) {
4301 i = SvCUR(rx->check_substr);
4302 if (i == 1 && !SvTAIL(rx->check_substr)) {
4303 i = *SvPVX(rx->check_substr);
4306 for (m = s; m < strend && *m != i; m++) ;
4309 dstr = NEWSV(30, m-s);
4310 sv_setpvn(dstr, s, m-s);
4319 while (s < strend && --limit &&
4320 (m=fbm_instr((unsigned char*)s, (unsigned char*)strend,
4321 rx->check_substr)) )
4324 dstr = NEWSV(31, m-s);
4325 sv_setpvn(dstr, s, m-s);
4334 maxiters += (strend - s) * rx->nparens;
4335 while (s < strend && --limit &&
4336 regexec_flags(rx, s, strend, orig, 1, Nullsv, NULL, 0))
4338 TAINT_IF(RX_MATCH_TAINTED(rx));
4340 && rx->subbase != orig) {
4345 strend = s + (strend - m);
4348 dstr = NEWSV(32, m-s);
4349 sv_setpvn(dstr, s, m-s);
4354 for (i = 1; i <= rx->nparens; i++) {
4358 dstr = NEWSV(33, m-s);
4359 sv_setpvn(dstr, s, m-s);
4362 dstr = NEWSV(33, 0);
4372 LEAVE_SCOPE(oldsave);
4373 iters = (SP - stack_base) - base;
4374 if (iters > maxiters)
4377 /* keep field after final delim? */
4378 if (s < strend || (iters && origlimit)) {
4379 dstr = NEWSV(34, strend-s);
4380 sv_setpvn(dstr, s, strend-s);
4386 else if (!origlimit) {
4387 while (iters > 0 && (!TOPs || !SvANY(TOPs) || SvCUR(TOPs) == 0))
4393 SWITCHSTACK(ary, oldstack);
4394 if (SvSMAGICAL(ary)) {
4399 if (gimme == G_ARRAY) {
4401 Copy(AvARRAY(ary), SP + 1, iters, SV*);
4409 perl_call_method("PUSH",G_SCALAR|G_DISCARD);
4412 if (gimme == G_ARRAY) {
4413 /* EXTEND should not be needed - we just popped them */
4415 for (i=0; i < iters; i++) {
4416 SV **svp = av_fetch(ary, i, FALSE);
4417 PUSHs((svp) ? *svp : &sv_undef);
4424 if (gimme == G_ARRAY)
4427 if (iters || !pm->op_pmreplroot) {
4437 unlock_condpair(void *svv)
4440 MAGIC *mg = mg_find((SV*)svv, 'm');
4443 croak("panic: unlock_condpair unlocking non-mutex");
4444 MUTEX_LOCK(MgMUTEXP(mg));
4445 if (MgOWNER(mg) != thr)
4446 croak("panic: unlock_condpair unlocking mutex that we don't own");
4448 COND_SIGNAL(MgOWNERCONDP(mg));
4449 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "0x%lx: unlock 0x%lx\n",
4450 (unsigned long)thr, (unsigned long)svv);)
4451 MUTEX_UNLOCK(MgMUTEXP(mg));
4453 #endif /* USE_THREADS */
4466 mg = condpair_magic(sv);
4467 MUTEX_LOCK(MgMUTEXP(mg));
4468 if (MgOWNER(mg) == thr)
4469 MUTEX_UNLOCK(MgMUTEXP(mg));
4472 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
4474 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "0x%lx: pp_lock lock 0x%lx\n",
4475 (unsigned long)thr, (unsigned long)sv);)
4476 MUTEX_UNLOCK(MgMUTEXP(mg));
4477 SvREFCNT_inc(sv); /* keep alive until magic_mutexfree */
4478 save_destructor(unlock_condpair, sv);
4480 #endif /* USE_THREADS */
4481 if (SvTYPE(retsv) == SVt_PVAV || SvTYPE(retsv) == SVt_PVHV
4482 || SvTYPE(retsv) == SVt_PVCV) {
4483 retsv = refto(retsv);
4494 if (op->op_private & OPpLVAL_INTRO)
4495 PUSHs(*save_threadsv(op->op_targ));
4497 PUSHs(THREADSV(op->op_targ));
4500 DIE("tried to access per-thread data in non-threaded perl");
4501 #endif /* USE_THREADS */