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 BYTEORDER > 0xFFFF && 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
77 #if BYTEORDER > 0xFFFF && defined(_CRAY) && !defined(_CRAYMPP)
78 # if BYTEORDER == 0x12345678
79 # define OFF16(p) (char*)(p)
80 # define OFF32(p) (char*)(p)
82 # if BYTEORDER == 0x87654321
83 # define OFF16(p) ((char*)(p) + (sizeof(U16) - SIZE16))
84 # define OFF32(p) ((char*)(p) + (sizeof(U32) - SIZE32))
86 }}}} bad cray byte order
89 # define COPY16(s,p) (*(p) = 0, Copy(s, OFF16(p), SIZE16, char))
90 # define COPY32(s,p) (*(p) = 0, Copy(s, OFF32(p), SIZE32, char))
91 # define CAT16(sv,p) sv_catpvn(sv, OFF16(p), SIZE16)
92 # define CAT32(sv,p) sv_catpvn(sv, OFF32(p), SIZE32)
94 # define COPY16(s,p) Copy(s, p, SIZE16, char)
95 # define COPY32(s,p) Copy(s, p, SIZE32, char)
96 # define CAT16(sv,p) sv_catpvn(sv, (char*)(p), SIZE16)
97 # define CAT32(sv,p) sv_catpvn(sv, (char*)(p), SIZE32)
100 static void doencodes _((SV* sv, char* s, I32 len));
101 static SV* refto _((SV* sv));
102 static U32 seed _((void));
104 static bool srand_called = FALSE;
106 /* variations on pp_null */
108 #ifdef DONT_DECLARE_STD
113 extern pid_t getpid (void);
119 if (GIMME_V == G_SCALAR)
134 if (op->op_private & OPpLVAL_INTRO)
135 SAVECLEARSV(curpad[op->op_targ]);
137 if (op->op_flags & OPf_REF) {
141 if (GIMME == G_ARRAY) {
142 I32 maxarg = AvFILL((AV*)TARG) + 1;
144 if (SvMAGICAL(TARG)) {
146 for (i=0; i < maxarg; i++) {
147 SV **svp = av_fetch((AV*)TARG, i, FALSE);
148 SP[i+1] = (svp) ? *svp : &sv_undef;
152 Copy(AvARRAY((AV*)TARG), SP+1, maxarg, SV*);
157 SV* sv = sv_newmortal();
158 I32 maxarg = AvFILL((AV*)TARG) + 1;
159 sv_setiv(sv, maxarg);
171 if (op->op_private & OPpLVAL_INTRO)
172 SAVECLEARSV(curpad[op->op_targ]);
173 if (op->op_flags & OPf_REF)
176 if (gimme == G_ARRAY) {
177 RETURNOP(do_kv(ARGS));
179 else if (gimme == G_SCALAR) {
180 SV* sv = sv_newmortal();
181 if (HvFILL((HV*)TARG))
182 sv_setpvf(sv, "%ld/%ld",
183 (long)HvFILL((HV*)TARG), (long)HvMAX((HV*)TARG) + 1);
193 DIE("NOT IMPL LINE %d",__LINE__);
205 if (SvTYPE(sv) == SVt_PVIO) {
206 GV *gv = (GV*) sv_newmortal();
207 gv_init(gv, 0, "", 0, 0);
208 GvIOp(gv) = (IO *)sv;
209 (void)SvREFCNT_inc(sv);
211 } else if (SvTYPE(sv) != SVt_PVGV)
212 DIE("Not a GLOB reference");
215 if (SvTYPE(sv) != SVt_PVGV) {
218 if (SvGMAGICAL(sv)) {
224 if (op->op_flags & OPf_REF ||
225 op->op_private & HINT_STRICT_REFS)
226 DIE(no_usym, "a symbol");
232 if (op->op_private & HINT_STRICT_REFS)
233 DIE(no_symref, sym, "a symbol");
234 sv = (SV*)gv_fetchpv(sym, TRUE, SVt_PVGV);
237 if (op->op_private & OPpLVAL_INTRO)
238 save_gp((GV*)sv, !(op->op_flags & OPf_SPECIAL));
250 switch (SvTYPE(sv)) {
254 DIE("Not a SCALAR reference");
261 if (SvTYPE(gv) != SVt_PVGV) {
262 if (SvGMAGICAL(sv)) {
268 if (op->op_flags & OPf_REF ||
269 op->op_private & HINT_STRICT_REFS)
270 DIE(no_usym, "a SCALAR");
276 if (op->op_private & HINT_STRICT_REFS)
277 DIE(no_symref, sym, "a SCALAR");
278 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PV);
282 if (op->op_flags & OPf_MOD) {
283 if (op->op_private & OPpLVAL_INTRO)
284 sv = save_scalar((GV*)TOPs);
285 else if (op->op_private & OPpDEREF)
286 vivify_ref(sv, op->op_private & OPpDEREF);
296 SV *sv = AvARYLEN(av);
298 AvARYLEN(av) = sv = NEWSV(0,0);
299 sv_upgrade(sv, SVt_IV);
300 sv_magic(sv, (SV*)av, '#', Nullch, 0);
308 djSP; dTARGET; dPOPss;
310 if (op->op_flags & OPf_MOD) {
311 if (SvTYPE(TARG) < SVt_PVLV) {
312 sv_upgrade(TARG, SVt_PVLV);
313 sv_magic(TARG, Nullsv, '.', Nullch, 0);
318 PUSHs(TARG); /* no SvSETMAGIC */
324 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
325 mg = mg_find(sv, 'g');
326 if (mg && mg->mg_len >= 0) {
327 PUSHi(mg->mg_len + curcop->cop_arybase);
341 /* We usually try to add a non-existent subroutine in case of AUTOLOAD. */
342 /* (But not in defined().) */
343 CV *cv = sv_2cv(TOPs, &stash, &gv, !(op->op_flags & OPf_SPECIAL));
346 cv = (CV*)sv_2mortal((SV*)cv_clone(cv));
363 if (SvPOK(TOPs) && SvCUR(TOPs) >= 7) {
364 char *s = SvPVX(TOPs);
365 if (strnEQ(s, "CORE::", 6)) {
368 code = keyword(s + 6, SvCUR(TOPs) - 6);
369 if (code < 0) { /* Overridable. */
370 #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2)
371 int i = 0, n = 0, seen_question = 0;
373 char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */
375 while (i < MAXO) { /* The slow way. */
376 if (strEQ(s + 6, op_name[i]) || strEQ(s + 6, op_desc[i]))
380 goto nonesuch; /* Should not happen... */
382 oa = opargs[i] >> OASHIFT;
384 if (oa & OA_OPTIONAL) {
387 } else if (seen_question)
388 goto set; /* XXXX system, exec */
389 if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF
390 && (oa & (OA_OPTIONAL - 1)) <= OA_HVREF) {
393 /* What to do with R ((un)tie, tied, (sys)read, recv)? */
394 str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)];
398 ret = sv_2mortal(newSVpv(str, n - 1));
399 } else if (code) /* Non-Overridable */
401 else { /* None such */
403 croak("Cannot find an opnumber for \"%s\"", s+6);
407 cv = sv_2cv(TOPs, &stash, &gv, FALSE);
409 ret = sv_2mortal(newSVpv(SvPVX(cv), SvCUR(cv)));
418 CV* cv = (CV*)curpad[op->op_targ];
420 cv = (CV*)sv_2mortal((SV*)cv_clone(cv));
436 if (GIMME != G_ARRAY) {
440 EXTEND_MORTAL(SP - MARK);
442 *MARK = refto(*MARK);
451 if (SvTYPE(sv) == SVt_PVLV && LvTYPE(sv) == 'y') {
454 if (!(sv = LvTARG(sv)))
457 else if (SvPADTMP(sv))
461 (void)SvREFCNT_inc(sv);
464 sv_upgrade(rv, SVt_RV);
478 if (sv && SvGMAGICAL(sv))
481 if (!sv || !SvROK(sv))
485 pv = sv_reftype(sv,TRUE);
486 PUSHp(pv, strlen(pv));
496 stash = curcop->cop_stash;
498 stash = gv_stashsv(POPs, TRUE);
500 (void)sv_bless(TOPs, stash);
517 switch (elem ? *elem : '\0')
520 if (strEQ(elem, "ARRAY"))
524 if (strEQ(elem, "CODE"))
525 ref = (SV*)GvCVu(gv);
528 if (strEQ(elem, "FILEHANDLE")) /* XXX deprecate in 5.005 */
529 ref = (SV*)GvIOp(gv);
532 if (strEQ(elem, "GLOB"))
536 if (strEQ(elem, "HASH"))
540 if (strEQ(elem, "IO"))
541 ref = (SV*)GvIOp(gv);
544 if (strEQ(elem, "NAME"))
545 sv = newSVpv(GvNAME(gv), GvNAMELEN(gv));
548 if (strEQ(elem, "PACKAGE"))
549 sv = newSVpv(HvNAME(GvSTASH(gv)), 0);
552 if (strEQ(elem, "SCALAR"))
566 /* Pattern matching */
571 register UNOP *unop = cUNOP;
572 register unsigned char *s;
575 register I32 *sfirst;
579 if(unop->op_first && unop->op_first->op_type == OP_PUSHRE) {
580 PMOP *pm = (PMOP *)unop->op_first;
581 SV *rv = sv_newmortal();
582 sv = newSVrv(rv, "Regexp");
583 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
587 if (sv == lastscream) {
593 SvSCREAM_off(lastscream);
594 SvREFCNT_dec(lastscream);
596 lastscream = SvREFCNT_inc(sv);
599 s = (unsigned char*)(SvPV(sv, len));
603 if (pos > maxscream) {
605 maxscream = pos + 80;
606 New(301, screamfirst, 256, I32);
607 New(302, screamnext, maxscream, I32);
610 maxscream = pos + pos / 4;
611 Renew(screamnext, maxscream, I32);
615 sfirst = screamfirst;
618 if (!sfirst || !snext)
619 DIE("do_study: out of memory");
621 for (ch = 256; ch; --ch)
628 snext[pos] = sfirst[ch] - pos;
635 sv_magic(sv, Nullsv, 'g', Nullch, 0); /* piggyback on m//g magic */
644 if (op->op_flags & OPf_STACKED)
650 TARG = sv_newmortal();
651 PUSHi(do_trans(sv, op));
655 /* Lvalue operators. */
667 djSP; dMARK; dTARGET;
677 SETi(do_chomp(TOPs));
683 djSP; dMARK; dTARGET;
684 register I32 count = 0;
687 count += do_chomp(POPs);
698 if (!sv || !SvANY(sv))
700 switch (SvTYPE(sv)) {
702 if (AvMAX(sv) >= 0 || SvGMAGICAL(sv))
706 if (HvARRAY(sv) || SvGMAGICAL(sv))
710 if (CvROOT(sv) || CvXSUB(sv))
727 if (!op->op_private) {
736 if (SvTHINKFIRST(sv)) {
743 switch (SvTYPE(sv)) {
753 if (cv_const_sv((CV*)sv))
754 warn("Constant subroutine %s undefined",
755 CvANON((CV*)sv) ? "(anonymous)" : GvENAME(CvGV((CV*)sv)));
758 { GV* gv = (GV*)SvREFCNT_inc(CvGV((CV*)sv));
760 CvGV((CV*)sv) = gv; } /* let user-undef'd sub keep its identity */
764 sv_setsv(sv, &sv_undef);
767 if (SvTYPE(sv) >= SVt_PV && SvPVX(sv) && SvLEN(sv)) {
770 SvPV_set(sv, Nullch);
783 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
785 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
786 SvIVX(TOPs) != IV_MIN)
789 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
800 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
802 sv_setsv(TARG, TOPs);
803 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
804 SvIVX(TOPs) != IV_MAX)
807 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
821 if(SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
823 sv_setsv(TARG, TOPs);
824 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
825 SvIVX(TOPs) != IV_MIN)
828 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
837 /* Ordinary operators. */
841 djSP; dATARGET; tryAMAGICbin(pow,opASSIGN);
844 SETn( pow( left, right) );
851 djSP; dATARGET; tryAMAGICbin(mult,opASSIGN);
854 SETn( left * right );
861 djSP; dATARGET; tryAMAGICbin(div,opASSIGN);
866 DIE("Illegal division by zero");
868 /* insure that 20./5. == 4. */
871 if ((double)I_V(left) == left &&
872 (double)I_V(right) == right &&
873 (k = I_V(left)/I_V(right))*I_V(right) == I_V(left)) {
876 value = left / right;
880 value = left / right;
889 djSP; dATARGET; tryAMAGICbin(mod,opASSIGN);
897 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)) {
899 right = (right_neg = (i < 0)) ? -i : i;
903 right = U_V((right_neg = (n < 0)) ? -n : n);
906 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)) {
908 left = (left_neg = (i < 0)) ? -i : i;
912 left = U_V((left_neg = (n < 0)) ? -n : n);
916 DIE("Illegal modulus zero");
919 if ((left_neg != right_neg) && ans)
922 /* XXX may warn: unary minus operator applied to unsigned type */
923 /* could change -foo to be (~foo)+1 instead */
924 if (ans <= ~((UV)IV_MAX)+1)
925 sv_setiv(TARG, ~ans+1);
927 sv_setnv(TARG, -(double)ans);
938 djSP; dATARGET; tryAMAGICbin(repeat,opASSIGN);
940 register I32 count = POPi;
941 if (GIMME == G_ARRAY && op->op_private & OPpREPEAT_DOLIST) {
943 I32 items = SP - MARK;
955 repeatcpy((char*)(MARK + items), (char*)MARK,
956 items * sizeof(SV*), count - 1);
962 else { /* Note: mark already snarfed by pp_list */
967 if (TARG == tmpstr && SvTHINKFIRST(tmpstr)) {
968 if (SvREADONLY(tmpstr) && curcop != &compiling)
969 DIE("Can't x= to readonly value");
973 SvSetSV(TARG, tmpstr);
974 SvPV_force(TARG, len);
979 SvGROW(TARG, (count * len) + 1);
980 repeatcpy(SvPVX(TARG) + len, SvPVX(TARG), len, count - 1);
981 SvCUR(TARG) *= count;
985 (void)SvPOK_only(TARG);
994 djSP; dATARGET; tryAMAGICbin(subtr,opASSIGN);
997 SETn( left - right );
1004 djSP; dATARGET; tryAMAGICbin(lshift,opASSIGN);
1007 if (op->op_private & HINT_INTEGER) {
1009 i = BWi(i) << shift;
1023 djSP; dATARGET; tryAMAGICbin(rshift,opASSIGN);
1026 if (op->op_private & HINT_INTEGER) {
1028 i = BWi(i) >> shift;
1042 djSP; tryAMAGICbinSET(lt,0);
1045 SETs(boolSV(TOPn < value));
1052 djSP; tryAMAGICbinSET(gt,0);
1055 SETs(boolSV(TOPn > value));
1062 djSP; tryAMAGICbinSET(le,0);
1065 SETs(boolSV(TOPn <= value));
1072 djSP; tryAMAGICbinSET(ge,0);
1075 SETs(boolSV(TOPn >= value));
1082 djSP; tryAMAGICbinSET(ne,0);
1085 SETs(boolSV(TOPn != value));
1092 djSP; dTARGET; tryAMAGICbin(ncmp,0);
1099 else if (left < right)
1101 else if (left > right)
1114 djSP; tryAMAGICbinSET(slt,0);
1117 int cmp = ((op->op_private & OPpLOCALE)
1118 ? sv_cmp_locale(left, right)
1119 : sv_cmp(left, right));
1120 SETs(boolSV(cmp < 0));
1127 djSP; tryAMAGICbinSET(sgt,0);
1130 int cmp = ((op->op_private & OPpLOCALE)
1131 ? sv_cmp_locale(left, right)
1132 : sv_cmp(left, right));
1133 SETs(boolSV(cmp > 0));
1140 djSP; tryAMAGICbinSET(sle,0);
1143 int cmp = ((op->op_private & OPpLOCALE)
1144 ? sv_cmp_locale(left, right)
1145 : sv_cmp(left, right));
1146 SETs(boolSV(cmp <= 0));
1153 djSP; tryAMAGICbinSET(sge,0);
1156 int cmp = ((op->op_private & OPpLOCALE)
1157 ? sv_cmp_locale(left, right)
1158 : sv_cmp(left, right));
1159 SETs(boolSV(cmp >= 0));
1166 djSP; tryAMAGICbinSET(seq,0);
1169 SETs(boolSV(sv_eq(left, right)));
1176 djSP; tryAMAGICbinSET(sne,0);
1179 SETs(boolSV(!sv_eq(left, right)));
1186 djSP; dTARGET; tryAMAGICbin(scmp,0);
1189 int cmp = ((op->op_private & OPpLOCALE)
1190 ? sv_cmp_locale(left, right)
1191 : sv_cmp(left, right));
1199 djSP; dATARGET; tryAMAGICbin(band,opASSIGN);
1202 if (SvNIOKp(left) || SvNIOKp(right)) {
1203 if (op->op_private & HINT_INTEGER) {
1204 IBW value = SvIV(left) & SvIV(right);
1208 UBW value = SvUV(left) & SvUV(right);
1213 do_vop(op->op_type, TARG, left, right);
1222 djSP; dATARGET; tryAMAGICbin(bxor,opASSIGN);
1225 if (SvNIOKp(left) || SvNIOKp(right)) {
1226 if (op->op_private & HINT_INTEGER) {
1227 IBW value = (USE_LEFT(left) ? SvIV(left) : 0) ^ SvIV(right);
1231 UBW value = (USE_LEFT(left) ? SvUV(left) : 0) ^ SvUV(right);
1236 do_vop(op->op_type, TARG, left, right);
1245 djSP; dATARGET; tryAMAGICbin(bor,opASSIGN);
1248 if (SvNIOKp(left) || SvNIOKp(right)) {
1249 if (op->op_private & HINT_INTEGER) {
1250 IBW value = (USE_LEFT(left) ? SvIV(left) : 0) | SvIV(right);
1254 UBW value = (USE_LEFT(left) ? SvUV(left) : 0) | SvUV(right);
1259 do_vop(op->op_type, TARG, left, right);
1268 djSP; dTARGET; tryAMAGICun(neg);
1273 if (SvIOKp(sv) && !SvNOKp(sv) && !SvPOKp(sv) && SvIVX(sv) != IV_MIN)
1275 else if (SvNIOKp(sv))
1277 else if (SvPOKp(sv)) {
1279 char *s = SvPV(sv, len);
1280 if (isIDFIRST(*s)) {
1281 sv_setpvn(TARG, "-", 1);
1284 else if (*s == '+' || *s == '-') {
1286 *SvPV_force(TARG, len) = *s == '-' ? '+' : '-';
1289 sv_setnv(TARG, -SvNV(sv));
1301 djSP; tryAMAGICunSET(not);
1302 #endif /* OVERLOAD */
1303 *stack_sp = boolSV(!SvTRUE(*stack_sp));
1309 djSP; dTARGET; tryAMAGICun(compl);
1313 if (op->op_private & HINT_INTEGER) {
1314 IBW value = ~SvIV(sv);
1318 UBW value = ~SvUV(sv);
1323 register char *tmps;
1324 register long *tmpl;
1329 tmps = SvPV_force(TARG, len);
1332 for ( ; anum && (unsigned long)tmps % sizeof(long); anum--, tmps++)
1335 for ( ; anum >= sizeof(long); anum -= sizeof(long), tmpl++)
1339 for ( ; anum > 0; anum--, tmps++)
1348 /* integer versions of some of the above */
1352 djSP; dATARGET; tryAMAGICbin(mult,opASSIGN);
1355 SETi( left * right );
1362 djSP; dATARGET; tryAMAGICbin(div,opASSIGN);
1366 DIE("Illegal division by zero");
1367 value = POPi / value;
1375 djSP; dATARGET; tryAMAGICbin(mod,opASSIGN);
1379 DIE("Illegal modulus zero");
1380 SETi( left % right );
1387 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
1390 SETi( left + right );
1397 djSP; dATARGET; tryAMAGICbin(subtr,opASSIGN);
1400 SETi( left - right );
1407 djSP; tryAMAGICbinSET(lt,0);
1410 SETs(boolSV(left < right));
1417 djSP; tryAMAGICbinSET(gt,0);
1420 SETs(boolSV(left > right));
1427 djSP; tryAMAGICbinSET(le,0);
1430 SETs(boolSV(left <= right));
1437 djSP; tryAMAGICbinSET(ge,0);
1440 SETs(boolSV(left >= right));
1447 djSP; tryAMAGICbinSET(eq,0);
1450 SETs(boolSV(left == right));
1457 djSP; tryAMAGICbinSET(ne,0);
1460 SETs(boolSV(left != right));
1467 djSP; dTARGET; tryAMAGICbin(ncmp,0);
1474 else if (left < right)
1485 djSP; dTARGET; tryAMAGICun(neg);
1490 /* High falutin' math. */
1494 djSP; dTARGET; tryAMAGICbin(atan2,0);
1497 SETn(atan2(left, right));
1504 djSP; dTARGET; tryAMAGICun(sin);
1516 djSP; dTARGET; tryAMAGICun(cos);
1536 if (!srand_called) {
1537 (void)srand((unsigned)seed());
1538 srand_called = TRUE;
1541 value = rand() * value / 2147483648.0;
1544 value = rand() * value / 65536.0;
1547 value = rand() * value / 32768.0;
1549 value = rand() * value / (double)(((unsigned long)1) << RANDBITS);
1565 (void)srand((unsigned)anum);
1566 srand_called = TRUE;
1575 * This is really just a quick hack which grabs various garbage
1576 * values. It really should be a real hash algorithm which
1577 * spreads the effect of every input bit onto every output bit,
1578 * if someone who knows about such tings would bother to write it.
1579 * Might be a good idea to add that function to CORE as well.
1580 * No numbers below come from careful analysis or anyting here,
1581 * except they are primes and SEED_C1 > 1E6 to get a full-width
1582 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
1583 * probably be bigger too.
1586 # define SEED_C1 1000003
1587 #define SEED_C4 73819
1589 # define SEED_C1 25747
1590 #define SEED_C4 20639
1594 #define SEED_C5 26107
1599 # include <starlet.h>
1600 /* when[] = (low 32 bits, high 32 bits) of time since epoch
1601 * in 100-ns units, typically incremented ever 10 ms. */
1602 unsigned int when[2];
1603 _ckvmssts(sys$gettim(when));
1604 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
1606 # ifdef HAS_GETTIMEOFDAY
1607 struct timeval when;
1608 gettimeofday(&when,(struct timezone *) 0);
1609 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
1613 u = (U32)SEED_C1 * when;
1616 u += SEED_C3 * (U32)getpid();
1617 u += SEED_C4 * (U32)(UV)stack_sp;
1618 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
1619 u += SEED_C5 * (U32)(UV)&when;
1626 djSP; dTARGET; tryAMAGICun(exp);
1638 djSP; dTARGET; tryAMAGICun(log);
1643 SET_NUMERIC_STANDARD();
1644 DIE("Can't take log of %g", value);
1654 djSP; dTARGET; tryAMAGICun(sqrt);
1659 SET_NUMERIC_STANDARD();
1660 DIE("Can't take sqrt of %g", value);
1662 value = sqrt(value);
1672 double value = TOPn;
1675 if (SvIOKp(TOPs) && !SvNOKp(TOPs) && !SvPOKp(TOPs)) {
1681 (void)modf(value, &value);
1683 (void)modf(-value, &value);
1698 djSP; dTARGET; tryAMAGICun(abs);
1700 double value = TOPn;
1703 if (SvIOKp(TOPs) && !SvNOKp(TOPs) && !SvPOKp(TOPs) &&
1704 (iv = SvIVX(TOPs)) != IV_MIN) {
1725 XPUSHu(scan_hex(tmps, 99, &argtype));
1737 while (*tmps && isSPACE(*tmps))
1742 value = scan_hex(++tmps, 99, &argtype);
1744 value = scan_oct(tmps, 99, &argtype);
1754 SETi( sv_len(TOPs) );
1767 I32 lvalue = op->op_flags & OPf_MOD;
1769 I32 arybase = curcop->cop_arybase;
1775 tmps = SvPV(sv, curlen);
1776 if (pos >= arybase) {
1794 else if (len >= 0) {
1796 if (rem > (I32)curlen)
1810 if (dowarn || lvalue)
1811 warn("substr outside of string");
1816 sv_setpvn(TARG, tmps, rem);
1817 if (lvalue) { /* it's an lvalue! */
1818 if (!SvGMAGICAL(sv)) {
1822 warn("Attempt to use reference as lvalue in substr");
1824 if (SvOK(sv)) /* is it defined ? */
1825 (void)SvPOK_only(sv);
1827 sv_setpvn(sv,"",0); /* avoid lexical reincarnation */
1830 if (SvTYPE(TARG) < SVt_PVLV) {
1831 sv_upgrade(TARG, SVt_PVLV);
1832 sv_magic(TARG, Nullsv, 'x', Nullch, 0);
1837 LvTARGOFF(TARG) = pos;
1838 LvTARGLEN(TARG) = rem;
1841 PUSHs(TARG); /* avoid SvSETMAGIC here */
1848 register I32 size = POPi;
1849 register I32 offset = POPi;
1850 register SV *src = POPs;
1851 I32 lvalue = op->op_flags & OPf_MOD;
1853 unsigned char *s = (unsigned char*)SvPV(src, srclen);
1854 unsigned long retnum;
1857 offset *= size; /* turn into bit offset */
1858 len = (offset + size + 7) / 8;
1859 if (offset < 0 || size < 1)
1862 if (lvalue) { /* it's an lvalue! */
1863 if (SvTYPE(TARG) < SVt_PVLV) {
1864 sv_upgrade(TARG, SVt_PVLV);
1865 sv_magic(TARG, Nullsv, 'v', Nullch, 0);
1870 LvTARGOFF(TARG) = offset;
1871 LvTARGLEN(TARG) = size;
1879 if (offset >= srclen)
1882 retnum = (unsigned long) s[offset] << 8;
1884 else if (size == 32) {
1885 if (offset >= srclen)
1887 else if (offset + 1 >= srclen)
1888 retnum = (unsigned long) s[offset] << 24;
1889 else if (offset + 2 >= srclen)
1890 retnum = ((unsigned long) s[offset] << 24) +
1891 ((unsigned long) s[offset + 1] << 16);
1893 retnum = ((unsigned long) s[offset] << 24) +
1894 ((unsigned long) s[offset + 1] << 16) +
1895 (s[offset + 2] << 8);
1900 retnum = (s[offset >> 3] >> (offset & 7)) & ((1 << size) - 1);
1905 else if (size == 16)
1906 retnum = ((unsigned long) s[offset] << 8) + s[offset+1];
1907 else if (size == 32)
1908 retnum = ((unsigned long) s[offset] << 24) +
1909 ((unsigned long) s[offset + 1] << 16) +
1910 (s[offset + 2] << 8) + s[offset+3];
1914 sv_setuv(TARG, (UV)retnum);
1929 I32 arybase = curcop->cop_arybase;
1934 offset = POPi - arybase;
1937 tmps = SvPV(big, biglen);
1940 else if (offset > biglen)
1942 if (!(tmps2 = fbm_instr((unsigned char*)tmps + offset,
1943 (unsigned char*)tmps + biglen, little)))
1944 retval = -1 + arybase;
1946 retval = tmps2 - tmps + arybase;
1963 I32 arybase = curcop->cop_arybase;
1969 tmps2 = SvPV(little, llen);
1970 tmps = SvPV(big, blen);
1974 offset = SvIV(offstr) - arybase + llen;
1977 else if (offset > blen)
1979 if (!(tmps2 = rninstr(tmps, tmps + offset,
1980 tmps2, tmps2 + llen)))
1981 retval = -1 + arybase;
1983 retval = tmps2 - tmps + arybase;
1990 djSP; dMARK; dORIGMARK; dTARGET;
1991 #ifdef USE_LOCALE_NUMERIC
1992 if (op->op_private & OPpLOCALE)
1993 SET_NUMERIC_LOCAL();
1995 SET_NUMERIC_STANDARD();
1997 do_sprintf(TARG, SP-MARK, MARK+1);
1998 TAINT_IF(SvTAINTED(TARG));
2012 value = (I32) (*tmps & 255);
2017 value = (I32) (anum & 255);
2028 (void)SvUPGRADE(TARG,SVt_PV);
2034 (void)SvPOK_only(TARG);
2041 djSP; dTARGET; dPOPTOPssrl;
2043 char *tmps = SvPV(left, na);
2045 sv_setpv(TARG, fcrypt(tmps, SvPV(right, na)));
2047 sv_setpv(TARG, crypt(tmps, SvPV(right, na)));
2051 "The crypt() function is unimplemented due to excessive paranoia.");
2063 if (!SvPADTMP(sv)) {
2069 s = SvPV_force(sv, na);
2071 if (op->op_private & OPpLOCALE) {
2074 *s = toUPPER_LC(*s);
2089 if (!SvPADTMP(sv)) {
2095 s = SvPV_force(sv, na);
2097 if (op->op_private & OPpLOCALE) {
2100 *s = toLOWER_LC(*s);
2117 if (!SvPADTMP(sv)) {
2124 s = SvPV_force(sv, len);
2126 register char *send = s + len;
2128 if (op->op_private & OPpLOCALE) {
2131 for (; s < send; s++)
2132 *s = toUPPER_LC(*s);
2135 for (; s < send; s++)
2149 if (!SvPADTMP(sv)) {
2156 s = SvPV_force(sv, len);
2158 register char *send = s + len;
2160 if (op->op_private & OPpLOCALE) {
2163 for (; s < send; s++)
2164 *s = toLOWER_LC(*s);
2167 for (; s < send; s++)
2179 register char *s = SvPV(sv,len);
2183 (void)SvUPGRADE(TARG, SVt_PV);
2184 SvGROW(TARG, (len * 2) + 1);
2192 SvCUR_set(TARG, d - SvPVX(TARG));
2193 (void)SvPOK_only(TARG);
2196 sv_setpvn(TARG, s, len);
2205 djSP; dMARK; dORIGMARK;
2207 register AV* av = (AV*)POPs;
2208 register I32 lval = op->op_flags & OPf_MOD;
2209 I32 arybase = curcop->cop_arybase;
2212 if (SvTYPE(av) == SVt_PVAV) {
2213 if (lval && op->op_private & OPpLVAL_INTRO) {
2215 for (svp = mark + 1; svp <= sp; svp++) {
2220 if (max > AvMAX(av))
2223 while (++MARK <= SP) {
2224 elem = SvIVx(*MARK);
2228 svp = av_fetch(av, elem, lval);
2230 if (!svp || *svp == &sv_undef)
2231 DIE(no_aelem, elem);
2232 if (op->op_private & OPpLVAL_INTRO)
2235 *MARK = svp ? *svp : &sv_undef;
2238 if (GIMME != G_ARRAY) {
2246 /* Associative arrays. */
2251 HV *hash = (HV*)POPs;
2253 I32 gimme = GIMME_V;
2254 I32 realhv = (SvTYPE(hash) == SVt_PVHV);
2257 /* might clobber stack_sp */
2258 entry = realhv ? hv_iternext(hash) : avhv_iternext((AV*)hash);
2263 PUSHs(hv_iterkeysv(entry)); /* won't clobber stack_sp */
2264 if (gimme == G_ARRAY) {
2266 /* might clobber stack_sp */
2267 sv_setsv(TARG, realhv ?
2268 hv_iterval(hash, entry) : avhv_iterval((AV*)hash, entry));
2273 else if (gimme == G_SCALAR)
2292 I32 gimme = GIMME_V;
2293 I32 discard = (gimme == G_VOID) ? G_DISCARD : 0;
2297 if (op->op_private & OPpSLICE) {
2301 hvtype = SvTYPE(hv);
2302 while (++MARK <= SP) {
2303 if (hvtype == SVt_PVHV)
2304 sv = hv_delete_ent(hv, *MARK, discard, 0);
2305 else if (hvtype == SVt_PVAV)
2306 sv = avhv_delete_ent((AV*)hv, *MARK, discard, 0);
2308 DIE("Not a HASH reference");
2309 *MARK = sv ? sv : &sv_undef;
2313 else if (gimme == G_SCALAR) {
2322 if (SvTYPE(hv) == SVt_PVHV)
2323 sv = hv_delete_ent(hv, keysv, discard, 0);
2324 else if (SvTYPE(hv) == SVt_PVAV)
2325 sv = avhv_delete_ent((AV*)hv, keysv, discard, 0);
2327 DIE("Not a HASH reference");
2341 if (SvTYPE(hv) == SVt_PVHV) {
2342 if (hv_exists_ent(hv, tmpsv, 0))
2344 } else if (SvTYPE(hv) == SVt_PVAV) {
2345 if (avhv_exists_ent((AV*)hv, tmpsv, 0))
2348 DIE("Not a HASH reference");
2355 djSP; dMARK; dORIGMARK;
2357 register HV *hv = (HV*)POPs;
2358 register I32 lval = op->op_flags & OPf_MOD;
2359 I32 realhv = (SvTYPE(hv) == SVt_PVHV);
2361 if (realhv || SvTYPE(hv) == SVt_PVAV) {
2362 while (++MARK <= SP) {
2366 he = hv_fetch_ent(hv, keysv, lval, 0);
2367 svp = he ? &HeVAL(he) : 0;
2369 svp = avhv_fetch_ent((AV*)hv, keysv, lval, 0);
2372 if (!he || HeVAL(he) == &sv_undef)
2373 DIE(no_helem, SvPV(keysv, na));
2374 if (op->op_private & OPpLVAL_INTRO)
2375 save_svref(&HeVAL(he));
2377 *MARK = he ? HeVAL(he) : &sv_undef;
2380 if (GIMME != G_ARRAY) {
2388 /* List operators. */
2393 if (GIMME != G_ARRAY) {
2395 *MARK = *SP; /* unwanted list, return last item */
2406 SV **lastrelem = stack_sp;
2407 SV **lastlelem = stack_base + POPMARK;
2408 SV **firstlelem = stack_base + POPMARK + 1;
2409 register SV **firstrelem = lastlelem + 1;
2410 I32 arybase = curcop->cop_arybase;
2411 I32 lval = op->op_flags & OPf_MOD;
2412 I32 is_something_there = lval;
2414 register I32 max = lastrelem - lastlelem;
2415 register SV **lelem;
2418 if (GIMME != G_ARRAY) {
2419 ix = SvIVx(*lastlelem);
2424 if (ix < 0 || ix >= max)
2425 *firstlelem = &sv_undef;
2427 *firstlelem = firstrelem[ix];
2433 SP = firstlelem - 1;
2437 for (lelem = firstlelem; lelem <= lastlelem; lelem++) {
2443 else if (!(*lelem = firstrelem[ix]))
2448 if (ix >= max || !(*lelem = firstrelem[ix]))
2451 if (!is_something_there && (SvOK(*lelem) || SvGMAGICAL(*lelem)))
2452 is_something_there = TRUE;
2454 if (is_something_there)
2457 SP = firstlelem - 1;
2463 djSP; dMARK; dORIGMARK;
2464 I32 items = SP - MARK;
2465 SV *av = sv_2mortal((SV*)av_make(items, MARK+1));
2466 SP = ORIGMARK; /* av_make() might realloc stack_sp */
2473 djSP; dMARK; dORIGMARK;
2474 HV* hv = (HV*)sv_2mortal((SV*)newHV());
2478 SV *val = NEWSV(46, 0);
2480 sv_setsv(val, *++MARK);
2482 warn("Odd number of elements in hash list");
2483 (void)hv_store_ent(hv,key,val,0);
2492 djSP; dMARK; dORIGMARK;
2493 register AV *ary = (AV*)*++MARK;
2497 register I32 offset;
2498 register I32 length;
2505 if (SvRMAGICAL(ary) && (mg = mg_find((SV*)ary,'P'))) {
2506 *MARK-- = mg->mg_obj;
2510 perl_call_method("SPLICE",GIMME_V);
2519 offset = i = SvIVx(*MARK);
2521 offset += AvFILLp(ary) + 1;
2523 offset -= curcop->cop_arybase;
2527 length = SvIVx(*MARK++);
2532 length = AvMAX(ary) + 1; /* close enough to infinity */
2536 length = AvMAX(ary) + 1;
2538 if (offset > AvFILLp(ary) + 1)
2539 offset = AvFILLp(ary) + 1;
2540 after = AvFILLp(ary) + 1 - (offset + length);
2541 if (after < 0) { /* not that much array */
2542 length += after; /* offset+length now in array */
2548 /* At this point, MARK .. SP-1 is our new LIST */
2551 diff = newlen - length;
2552 if (newlen && !AvREAL(ary)) {
2556 assert(AvREAL(ary)); /* would leak, so croak */
2559 if (diff < 0) { /* shrinking the area */
2561 New(451, tmparyval, newlen, SV*); /* so remember insertion */
2562 Copy(MARK, tmparyval, newlen, SV*);
2565 MARK = ORIGMARK + 1;
2566 if (GIMME == G_ARRAY) { /* copy return vals to stack */
2567 MEXTEND(MARK, length);
2568 Copy(AvARRAY(ary)+offset, MARK, length, SV*);
2570 EXTEND_MORTAL(length);
2571 for (i = length, dst = MARK; i; i--) {
2572 if (!SvIMMORTAL(*dst))
2573 sv_2mortal(*dst); /* free them eventualy */
2580 *MARK = AvARRAY(ary)[offset+length-1];
2582 if (!SvIMMORTAL(*MARK))
2584 for (i = length - 1, dst = &AvARRAY(ary)[offset]; i > 0; i--)
2585 SvREFCNT_dec(*dst++); /* free them now */
2588 AvFILLp(ary) += diff;
2590 /* pull up or down? */
2592 if (offset < after) { /* easier to pull up */
2593 if (offset) { /* esp. if nothing to pull */
2594 src = &AvARRAY(ary)[offset-1];
2595 dst = src - diff; /* diff is negative */
2596 for (i = offset; i > 0; i--) /* can't trust Copy */
2600 SvPVX(ary) = (char*)(AvARRAY(ary) - diff); /* diff is negative */
2604 if (after) { /* anything to pull down? */
2605 src = AvARRAY(ary) + offset + length;
2606 dst = src + diff; /* diff is negative */
2607 Move(src, dst, after, SV*);
2609 dst = &AvARRAY(ary)[AvFILLp(ary)+1];
2610 /* avoid later double free */
2614 dst[--i] = &sv_undef;
2617 for (src = tmparyval, dst = AvARRAY(ary) + offset;
2619 *dst = NEWSV(46, 0);
2620 sv_setsv(*dst++, *src++);
2622 Safefree(tmparyval);
2625 else { /* no, expanding (or same) */
2627 New(452, tmparyval, length, SV*); /* so remember deletion */
2628 Copy(AvARRAY(ary)+offset, tmparyval, length, SV*);
2631 if (diff > 0) { /* expanding */
2633 /* push up or down? */
2635 if (offset < after && diff <= AvARRAY(ary) - AvALLOC(ary)) {
2639 Move(src, dst, offset, SV*);
2641 SvPVX(ary) = (char*)(AvARRAY(ary) - diff);/* diff is positive */
2643 AvFILLp(ary) += diff;
2646 if (AvFILLp(ary) + diff >= AvMAX(ary)) /* oh, well */
2647 av_extend(ary, AvFILLp(ary) + diff);
2648 AvFILLp(ary) += diff;
2651 dst = AvARRAY(ary) + AvFILLp(ary);
2653 for (i = after; i; i--) {
2660 for (src = MARK, dst = AvARRAY(ary) + offset; newlen; newlen--) {
2661 *dst = NEWSV(46, 0);
2662 sv_setsv(*dst++, *src++);
2664 MARK = ORIGMARK + 1;
2665 if (GIMME == G_ARRAY) { /* copy return vals to stack */
2667 Copy(tmparyval, MARK, length, SV*);
2669 EXTEND_MORTAL(length);
2670 for (i = length, dst = MARK; i; i--) {
2671 if (!SvIMMORTAL(*dst))
2672 sv_2mortal(*dst); /* free them eventualy */
2676 Safefree(tmparyval);
2680 else if (length--) {
2681 *MARK = tmparyval[length];
2683 if (!SvIMMORTAL(*MARK))
2685 while (length-- > 0)
2686 SvREFCNT_dec(tmparyval[length]);
2688 Safefree(tmparyval);
2699 djSP; dMARK; dORIGMARK; dTARGET;
2700 register AV *ary = (AV*)*++MARK;
2701 register SV *sv = &sv_undef;
2704 if (SvRMAGICAL(ary) && (mg = mg_find((SV*)ary,'P'))) {
2705 *MARK-- = mg->mg_obj;
2709 perl_call_method("PUSH",G_SCALAR|G_DISCARD);
2714 /* Why no pre-extend of ary here ? */
2715 for (++MARK; MARK <= SP; MARK++) {
2718 sv_setsv(sv, *MARK);
2723 PUSHi( AvFILL(ary) + 1 );
2731 SV *sv = av_pop(av);
2732 if (!SvIMMORTAL(sv) && AvREAL(av))
2733 (void)sv_2mortal(sv);
2742 SV *sv = av_shift(av);
2746 if (!SvIMMORTAL(sv) && AvREAL(av))
2747 (void)sv_2mortal(sv);
2754 djSP; dMARK; dORIGMARK; dTARGET;
2755 register AV *ary = (AV*)*++MARK;
2760 if (SvRMAGICAL(ary) && (mg = mg_find((SV*)ary,'P'))) {
2761 *MARK-- = mg->mg_obj;
2765 perl_call_method("UNSHIFT",G_SCALAR|G_DISCARD);
2770 av_unshift(ary, SP - MARK);
2773 sv_setsv(sv, *++MARK);
2774 (void)av_store(ary, i++, sv);
2778 PUSHi( AvFILL(ary) + 1 );
2788 if (GIMME == G_ARRAY) {
2799 register char *down;
2805 do_join(TARG, &sv_no, MARK, SP);
2807 sv_setsv(TARG, (SP > MARK) ? *SP : DEFSV);
2808 up = SvPV_force(TARG, len);
2810 down = SvPVX(TARG) + len - 1;
2816 (void)SvPOK_only(TARG);
2825 mul128(SV *sv, U8 m)
2828 char *s = SvPV(sv, len);
2832 if (!strnEQ(s, "0000", 4)) { /* need to grow sv */
2833 SV *New = newSVpv("0000000000", 10);
2836 SvREFCNT_dec(sv); /* free old sv */
2841 while (!*t) /* trailing '\0'? */
2844 i = ((*t - '0') << 7) + m;
2845 *(t--) = '0' + (i % 10);
2851 /* Explosives and implosives. */
2858 I32 gimme = GIMME_V;
2862 register char *pat = SvPV(left, llen);
2863 register char *s = SvPV(right, rlen);
2864 char *strend = s + rlen;
2866 register char *patend = pat + llen;
2871 /* These must not be in registers: */
2882 unsigned Quad_t auquad;
2888 register U32 culong;
2890 static char* bitcount = 0;
2893 if (gimme != G_ARRAY) { /* arrange to do first one only */
2895 for (patend = pat; !isALPHA(*patend) || *patend == 'x'; patend++) ;
2896 if (strchr("aAbBhHP", *patend) || *pat == '%') {
2898 while (isDIGIT(*patend) || *patend == '*')
2904 while (pat < patend) {
2906 datumtype = *pat++ & 0xFF;
2907 if (isSPACE(datumtype))
2911 else if (*pat == '*') {
2912 len = strend - strbeg; /* long enough */
2915 else if (isDIGIT(*pat)) {
2917 while (isDIGIT(*pat))
2918 len = (len * 10) + (*pat++ - '0');
2921 len = (datumtype != '@');
2924 croak("Invalid type in unpack: '%c'", (int)datumtype);
2925 case ',': /* grandfather in commas but with a warning */
2926 if (commas++ == 0 && dowarn)
2927 warn("Invalid type in unpack: '%c'", (int)datumtype);
2930 if (len == 1 && pat[-1] != '1')
2939 if (len > strend - strbeg)
2940 DIE("@ outside of string");
2944 if (len > s - strbeg)
2945 DIE("X outside of string");
2949 if (len > strend - s)
2950 DIE("x outside of string");
2955 if (len > strend - s)
2958 goto uchar_checksum;
2959 sv = NEWSV(35, len);
2960 sv_setpvn(sv, s, len);
2962 if (datumtype == 'A') {
2963 aptr = s; /* borrow register */
2964 s = SvPVX(sv) + len - 1;
2965 while (s >= SvPVX(sv) && (!*s || isSPACE(*s)))
2968 SvCUR_set(sv, s - SvPVX(sv));
2969 s = aptr; /* unborrow register */
2971 XPUSHs(sv_2mortal(sv));
2975 if (pat[-1] == '*' || len > (strend - s) * 8)
2976 len = (strend - s) * 8;
2979 Newz(601, bitcount, 256, char);
2980 for (bits = 1; bits < 256; bits++) {
2981 if (bits & 1) bitcount[bits]++;
2982 if (bits & 2) bitcount[bits]++;
2983 if (bits & 4) bitcount[bits]++;
2984 if (bits & 8) bitcount[bits]++;
2985 if (bits & 16) bitcount[bits]++;
2986 if (bits & 32) bitcount[bits]++;
2987 if (bits & 64) bitcount[bits]++;
2988 if (bits & 128) bitcount[bits]++;
2992 culong += bitcount[*(unsigned char*)s++];
2997 if (datumtype == 'b') {
2999 if (bits & 1) culong++;
3005 if (bits & 128) culong++;
3012 sv = NEWSV(35, len + 1);
3015 aptr = pat; /* borrow register */
3017 if (datumtype == 'b') {
3019 for (len = 0; len < aint; len++) {
3020 if (len & 7) /*SUPPRESS 595*/
3024 *pat++ = '0' + (bits & 1);
3029 for (len = 0; len < aint; len++) {
3034 *pat++ = '0' + ((bits & 128) != 0);
3038 pat = aptr; /* unborrow register */
3039 XPUSHs(sv_2mortal(sv));
3043 if (pat[-1] == '*' || len > (strend - s) * 2)
3044 len = (strend - s) * 2;
3045 sv = NEWSV(35, len + 1);
3048 aptr = pat; /* borrow register */
3050 if (datumtype == 'h') {
3052 for (len = 0; len < aint; len++) {
3057 *pat++ = hexdigit[bits & 15];
3062 for (len = 0; len < aint; len++) {
3067 *pat++ = hexdigit[(bits >> 4) & 15];
3071 pat = aptr; /* unborrow register */
3072 XPUSHs(sv_2mortal(sv));
3075 if (len > strend - s)
3080 if (aint >= 128) /* fake up signed chars */
3090 if (aint >= 128) /* fake up signed chars */
3093 sv_setiv(sv, (IV)aint);
3094 PUSHs(sv_2mortal(sv));
3099 if (len > strend - s)
3114 sv_setiv(sv, (IV)auint);
3115 PUSHs(sv_2mortal(sv));
3120 along = (strend - s) / SIZE16;
3137 sv_setiv(sv, (IV)ashort);
3138 PUSHs(sv_2mortal(sv));
3145 along = (strend - s) / SIZE16;
3150 COPY16(s, &aushort);
3153 if (datumtype == 'n')
3154 aushort = PerlSock_ntohs(aushort);
3157 if (datumtype == 'v')
3158 aushort = vtohs(aushort);
3167 COPY16(s, &aushort);
3171 if (datumtype == 'n')
3172 aushort = PerlSock_ntohs(aushort);
3175 if (datumtype == 'v')
3176 aushort = vtohs(aushort);
3178 sv_setiv(sv, (IV)aushort);
3179 PUSHs(sv_2mortal(sv));
3184 along = (strend - s) / sizeof(int);
3189 Copy(s, &aint, 1, int);
3192 cdouble += (double)aint;
3201 Copy(s, &aint, 1, int);
3204 sv_setiv(sv, (IV)aint);
3205 PUSHs(sv_2mortal(sv));
3210 along = (strend - s) / sizeof(unsigned int);
3215 Copy(s, &auint, 1, unsigned int);
3216 s += sizeof(unsigned int);
3218 cdouble += (double)auint;
3227 Copy(s, &auint, 1, unsigned int);
3228 s += sizeof(unsigned int);
3230 sv_setuv(sv, (UV)auint);
3231 PUSHs(sv_2mortal(sv));
3236 along = (strend - s) / SIZE32;
3244 cdouble += (double)along;
3256 sv_setiv(sv, (IV)along);
3257 PUSHs(sv_2mortal(sv));
3264 along = (strend - s) / SIZE32;
3272 if (datumtype == 'N')
3273 aulong = PerlSock_ntohl(aulong);
3276 if (datumtype == 'V')
3277 aulong = vtohl(aulong);
3280 cdouble += (double)aulong;
3292 if (datumtype == 'N')
3293 aulong = PerlSock_ntohl(aulong);
3296 if (datumtype == 'V')
3297 aulong = vtohl(aulong);
3300 sv_setuv(sv, (UV)aulong);
3301 PUSHs(sv_2mortal(sv));
3306 along = (strend - s) / sizeof(char*);
3312 if (sizeof(char*) > strend - s)
3315 Copy(s, &aptr, 1, char*);
3321 PUSHs(sv_2mortal(sv));
3331 while ((len > 0) && (s < strend)) {
3332 auv = (auv << 7) | (*s & 0x7f);
3333 if (!(*s++ & 0x80)) {
3337 PUSHs(sv_2mortal(sv));
3341 else if (++bytes >= sizeof(UV)) { /* promote to string */
3344 sv = newSVpvf("%.*Vu", (int)TYPE_DIGITS(UV), auv);
3345 while (s < strend) {
3346 sv = mul128(sv, *s & 0x7f);
3347 if (!(*s++ & 0x80)) {
3356 PUSHs(sv_2mortal(sv));
3361 if ((s >= strend) && bytes)
3362 croak("Unterminated compressed integer");
3367 if (sizeof(char*) > strend - s)
3370 Copy(s, &aptr, 1, char*);
3375 sv_setpvn(sv, aptr, len);
3376 PUSHs(sv_2mortal(sv));
3383 if (s + sizeof(Quad_t) > strend)
3386 Copy(s, &aquad, 1, Quad_t);
3387 s += sizeof(Quad_t);
3390 if (aquad >= IV_MIN && aquad <= IV_MAX)
3391 sv_setiv(sv, (IV)aquad);
3393 sv_setnv(sv, (double)aquad);
3394 PUSHs(sv_2mortal(sv));
3401 if (s + sizeof(unsigned Quad_t) > strend)
3404 Copy(s, &auquad, 1, unsigned Quad_t);
3405 s += sizeof(unsigned Quad_t);
3408 if (aquad <= UV_MAX)
3409 sv_setuv(sv, (UV)auquad);
3411 sv_setnv(sv, (double)auquad);
3412 PUSHs(sv_2mortal(sv));
3416 /* float and double added gnb@melba.bby.oz.au 22/11/89 */
3419 along = (strend - s) / sizeof(float);
3424 Copy(s, &afloat, 1, float);
3433 Copy(s, &afloat, 1, float);
3436 sv_setnv(sv, (double)afloat);
3437 PUSHs(sv_2mortal(sv));
3443 along = (strend - s) / sizeof(double);
3448 Copy(s, &adouble, 1, double);
3449 s += sizeof(double);
3457 Copy(s, &adouble, 1, double);
3458 s += sizeof(double);
3460 sv_setnv(sv, (double)adouble);
3461 PUSHs(sv_2mortal(sv));
3466 along = (strend - s) * 3 / 4;
3467 sv = NEWSV(42, along);
3470 while (s < strend && *s > ' ' && *s < 'a') {
3475 len = (*s++ - ' ') & 077;
3477 if (s < strend && *s >= ' ')
3478 a = (*s++ - ' ') & 077;
3481 if (s < strend && *s >= ' ')
3482 b = (*s++ - ' ') & 077;
3485 if (s < strend && *s >= ' ')
3486 c = (*s++ - ' ') & 077;
3489 if (s < strend && *s >= ' ')
3490 d = (*s++ - ' ') & 077;
3493 hunk[0] = (a << 2) | (b >> 4);
3494 hunk[1] = (b << 4) | (c >> 2);
3495 hunk[2] = (c << 6) | d;
3496 sv_catpvn(sv, hunk, (len > 3) ? 3 : len);
3501 else if (s[1] == '\n') /* possible checksum byte */
3504 XPUSHs(sv_2mortal(sv));
3509 if (strchr("fFdD", datumtype) ||
3510 (checksum > 32 && strchr("iIlLN", datumtype)) ) {
3514 while (checksum >= 16) {
3518 while (checksum >= 4) {
3524 along = (1 << checksum) - 1;
3525 while (cdouble < 0.0)
3527 cdouble = modf(cdouble / adouble, &trouble) * adouble;
3528 sv_setnv(sv, cdouble);
3531 if (checksum < 32) {
3532 aulong = (1 << checksum) - 1;
3535 sv_setuv(sv, (UV)culong);
3537 XPUSHs(sv_2mortal(sv));
3541 if (sp == oldsp && gimme == G_SCALAR)
3547 doencodes(register SV *sv, register char *s, register I32 len)
3552 sv_catpvn(sv, hunk, 1);
3555 hunk[0] = ' ' + (077 & (*s >> 2));
3556 hunk[1] = ' ' + (077 & (((*s << 4) & 060) | ((s[1] >> 4) & 017)));
3557 hunk[2] = ' ' + (077 & (((s[1] << 2) & 074) | ((s[2] >> 6) & 03)));
3558 hunk[3] = ' ' + (077 & (s[2] & 077));
3559 sv_catpvn(sv, hunk, 4);
3563 for (s = SvPVX(sv); *s; s++) {
3567 sv_catpvn(sv, "\n", 1);
3571 is_an_int(char *s, STRLEN l)
3573 SV *result = newSVpv("", l);
3574 char *result_c = SvPV(result, na); /* convenience */
3575 char *out = result_c;
3585 SvREFCNT_dec(result);
3608 SvREFCNT_dec(result);
3614 SvCUR_set(result, out - result_c);
3619 div128(SV *pnum, bool *done)
3620 /* must be '\0' terminated */
3624 char *s = SvPV(pnum, len);
3633 i = m * 10 + (*t - '0');
3635 r = (i >> 7); /* r < 10 */
3642 SvCUR_set(pnum, (STRLEN) (t - s));
3649 djSP; dMARK; dORIGMARK; dTARGET;
3650 register SV *cat = TARG;
3653 register char *pat = SvPVx(*++MARK, fromlen);
3654 register char *patend = pat + fromlen;
3659 static char null10[] = {0,0,0,0,0,0,0,0,0,0};
3660 static char *space10 = " ";
3662 /* These must not be in registers: */
3671 unsigned Quad_t auquad;
3680 sv_setpvn(cat, "", 0);
3681 while (pat < patend) {
3682 #define NEXTFROM (items-- > 0 ? *MARK++ : &sv_no)
3683 datumtype = *pat++ & 0xFF;
3684 if (isSPACE(datumtype))
3687 len = strchr("@Xxu", datumtype) ? 0 : items;
3690 else if (isDIGIT(*pat)) {
3692 while (isDIGIT(*pat))
3693 len = (len * 10) + (*pat++ - '0');
3699 croak("Invalid type in pack: '%c'", (int)datumtype);
3700 case ',': /* grandfather in commas but with a warning */
3701 if (commas++ == 0 && dowarn)
3702 warn("Invalid type in pack: '%c'", (int)datumtype);
3705 DIE("%% may only be used in unpack");
3716 if (SvCUR(cat) < len)
3717 DIE("X outside of string");
3724 sv_catpvn(cat, null10, 10);
3727 sv_catpvn(cat, null10, len);
3732 aptr = SvPV(fromstr, fromlen);
3736 sv_catpvn(cat, aptr, len);
3738 sv_catpvn(cat, aptr, fromlen);
3740 if (datumtype == 'A') {
3742 sv_catpvn(cat, space10, 10);
3745 sv_catpvn(cat, space10, len);
3749 sv_catpvn(cat, null10, 10);
3752 sv_catpvn(cat, null10, len);
3759 char *savepat = pat;
3764 aptr = SvPV(fromstr, fromlen);
3769 SvCUR(cat) += (len+7)/8;
3770 SvGROW(cat, SvCUR(cat) + 1);
3771 aptr = SvPVX(cat) + aint;
3776 if (datumtype == 'B') {
3777 for (len = 0; len++ < aint;) {
3778 items |= *pat++ & 1;
3782 *aptr++ = items & 0xff;
3788 for (len = 0; len++ < aint;) {
3794 *aptr++ = items & 0xff;
3800 if (datumtype == 'B')
3801 items <<= 7 - (aint & 7);
3803 items >>= 7 - (aint & 7);
3804 *aptr++ = items & 0xff;
3806 pat = SvPVX(cat) + SvCUR(cat);
3817 char *savepat = pat;
3822 aptr = SvPV(fromstr, fromlen);
3827 SvCUR(cat) += (len+1)/2;
3828 SvGROW(cat, SvCUR(cat) + 1);
3829 aptr = SvPVX(cat) + aint;
3834 if (datumtype == 'H') {
3835 for (len = 0; len++ < aint;) {
3837 items |= ((*pat++ & 15) + 9) & 15;
3839 items |= *pat++ & 15;
3843 *aptr++ = items & 0xff;
3849 for (len = 0; len++ < aint;) {
3851 items |= (((*pat++ & 15) + 9) & 15) << 4;
3853 items |= (*pat++ & 15) << 4;
3857 *aptr++ = items & 0xff;
3863 *aptr++ = items & 0xff;
3864 pat = SvPVX(cat) + SvCUR(cat);
3876 aint = SvIV(fromstr);
3878 sv_catpvn(cat, &achar, sizeof(char));
3881 /* Float and double added by gnb@melba.bby.oz.au 22/11/89 */
3886 afloat = (float)SvNV(fromstr);
3887 sv_catpvn(cat, (char *)&afloat, sizeof (float));
3894 adouble = (double)SvNV(fromstr);
3895 sv_catpvn(cat, (char *)&adouble, sizeof (double));
3901 ashort = (I16)SvIV(fromstr);
3903 ashort = PerlSock_htons(ashort);
3905 CAT16(cat, &ashort);
3911 ashort = (I16)SvIV(fromstr);
3913 ashort = htovs(ashort);
3915 CAT16(cat, &ashort);
3922 ashort = (I16)SvIV(fromstr);
3923 CAT16(cat, &ashort);
3929 auint = SvUV(fromstr);
3930 sv_catpvn(cat, (char*)&auint, sizeof(unsigned int));
3936 adouble = floor(SvNV(fromstr));
3939 croak("Cannot compress negative numbers");
3945 #ifdef CXUX_BROKEN_CONSTANT_CONVERT
3946 adouble <= UV_MAX_cxux
3953 char buf[1 + sizeof(UV)];
3954 char *in = buf + sizeof(buf);
3955 UV auv = U_V(adouble);;
3958 *--in = (auv & 0x7f) | 0x80;
3961 buf[sizeof(buf) - 1] &= 0x7f; /* clear continue bit */
3962 sv_catpvn(cat, in, (buf + sizeof(buf)) - in);
3964 else if (SvPOKp(fromstr)) { /* decimal string arithmetics */
3965 char *from, *result, *in;
3970 /* Copy string and check for compliance */
3971 from = SvPV(fromstr, len);
3972 if ((norm = is_an_int(from, len)) == NULL)
3973 croak("can compress only unsigned integer");
3975 New('w', result, len, char);
3979 *--in = div128(norm, &done) | 0x80;
3980 result[len - 1] &= 0x7F; /* clear continue bit */
3981 sv_catpvn(cat, in, (result + len) - in);
3983 SvREFCNT_dec(norm); /* free norm */
3985 else if (SvNOKp(fromstr)) {
3986 char buf[sizeof(double) * 2]; /* 8/7 <= 2 */
3987 char *in = buf + sizeof(buf);
3990 double next = floor(adouble / 128);
3991 *--in = (unsigned char)(adouble - (next * 128)) | 0x80;
3992 if (--in < buf) /* this cannot happen ;-) */
3993 croak ("Cannot compress integer");
3995 } while (adouble > 0);
3996 buf[sizeof(buf) - 1] &= 0x7f; /* clear continue bit */
3997 sv_catpvn(cat, in, (buf + sizeof(buf)) - in);
4000 croak("Cannot compress non integer");
4006 aint = SvIV(fromstr);
4007 sv_catpvn(cat, (char*)&aint, sizeof(int));
4013 aulong = SvUV(fromstr);
4015 aulong = PerlSock_htonl(aulong);
4017 CAT32(cat, &aulong);
4023 aulong = SvUV(fromstr);
4025 aulong = htovl(aulong);
4027 CAT32(cat, &aulong);
4033 aulong = SvUV(fromstr);
4034 CAT32(cat, &aulong);
4040 along = SvIV(fromstr);
4048 auquad = (unsigned Quad_t)SvIV(fromstr);
4049 sv_catpvn(cat, (char*)&auquad, sizeof(unsigned Quad_t));
4055 aquad = (Quad_t)SvIV(fromstr);
4056 sv_catpvn(cat, (char*)&aquad, sizeof(Quad_t));
4059 #endif /* HAS_QUAD */
4061 len = 1; /* assume SV is correct length */
4066 if (fromstr == &sv_undef)
4069 /* XXX better yet, could spirit away the string to
4070 * a safe spot and hang on to it until the result
4071 * of pack() (and all copies of the result) are
4074 if (dowarn && (SvTEMP(fromstr) || SvPADTMP(fromstr)))
4075 warn("Attempt to pack pointer to temporary value");
4076 if (SvPOK(fromstr) || SvNIOK(fromstr))
4077 aptr = SvPV(fromstr,na);
4079 aptr = SvPV_force(fromstr,na);
4081 sv_catpvn(cat, (char*)&aptr, sizeof(char*));
4086 aptr = SvPV(fromstr, fromlen);
4087 SvGROW(cat, fromlen * 4 / 3);
4092 while (fromlen > 0) {
4099 doencodes(cat, aptr, todo);
4118 register I32 limit = POPi; /* note, negative is forever */
4121 register char *s = SvPV(sv, len);
4122 char *strend = s + len;
4124 register REGEXP *rx;
4128 I32 maxiters = (strend - s) + 10;
4131 I32 origlimit = limit;
4134 AV *oldstack = curstack;
4135 I32 gimme = GIMME_V;
4136 I32 oldsave = savestack_ix;
4137 I32 make_mortal = 1;
4138 MAGIC *mg = (MAGIC *) NULL;
4141 Copy(&LvTARGOFF(POPs), &pm, 1, PMOP*);
4146 DIE("panic: do_split");
4147 rx = pm->op_pmregexp;
4149 TAINT_IF((pm->op_pmflags & PMf_LOCALE) &&
4150 (pm->op_pmflags & (PMf_WHITE | PMf_SKIPWHITE)));
4152 if (pm->op_pmreplroot)
4153 ary = GvAVn((GV*)pm->op_pmreplroot);
4154 else if (gimme != G_ARRAY)
4156 ary = (AV*)curpad[0];
4159 #endif /* USE_THREADS */
4162 if (ary && (gimme != G_ARRAY || (pm->op_pmflags & PMf_ONCE))) {
4168 if (SvRMAGICAL(ary) && (mg = mg_find((SV *) ary, 'P'))) {
4175 for (i = AvFILLp(ary); i >= 0; i--)
4176 AvARRAY(ary)[i] = &sv_undef; /* don't free mere refs */
4178 /* temporarily switch stacks */
4179 SWITCHSTACK(curstack, ary);
4183 base = SP - stack_base;
4185 if (pm->op_pmflags & PMf_SKIPWHITE) {
4186 if (pm->op_pmflags & PMf_LOCALE) {
4187 while (isSPACE_LC(*s))
4195 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
4197 multiline = pm->op_pmflags & PMf_MULTILINE;
4201 limit = maxiters + 2;
4202 if (pm->op_pmflags & PMf_WHITE) {
4205 while (m < strend &&
4206 !((pm->op_pmflags & PMf_LOCALE)
4207 ? isSPACE_LC(*m) : isSPACE(*m)))
4212 dstr = NEWSV(30, m-s);
4213 sv_setpvn(dstr, s, m-s);
4219 while (s < strend &&
4220 ((pm->op_pmflags & PMf_LOCALE)
4221 ? isSPACE_LC(*s) : isSPACE(*s)))
4225 else if (strEQ("^", rx->precomp)) {
4228 for (m = s; m < strend && *m != '\n'; m++) ;
4232 dstr = NEWSV(30, m-s);
4233 sv_setpvn(dstr, s, m-s);
4240 else if (rx->check_substr && !rx->nparens
4241 && (rx->reganch & ROPT_CHECK_ALL)
4242 && !(rx->reganch & ROPT_ANCH)) {
4243 i = SvCUR(rx->check_substr);
4244 if (i == 1 && !SvTAIL(rx->check_substr)) {
4245 i = *SvPVX(rx->check_substr);
4248 for (m = s; m < strend && *m != i; m++) ;
4251 dstr = NEWSV(30, m-s);
4252 sv_setpvn(dstr, s, m-s);
4261 while (s < strend && --limit &&
4262 (m=fbm_instr((unsigned char*)s, (unsigned char*)strend,
4263 rx->check_substr)) )
4266 dstr = NEWSV(31, m-s);
4267 sv_setpvn(dstr, s, m-s);
4276 maxiters += (strend - s) * rx->nparens;
4277 while (s < strend && --limit &&
4278 regexec_flags(rx, s, strend, orig, 1, Nullsv, NULL, 0))
4280 TAINT_IF(RX_MATCH_TAINTED(rx));
4282 && rx->subbase != orig) {
4287 strend = s + (strend - m);
4290 dstr = NEWSV(32, m-s);
4291 sv_setpvn(dstr, s, m-s);
4296 for (i = 1; i <= rx->nparens; i++) {
4300 dstr = NEWSV(33, m-s);
4301 sv_setpvn(dstr, s, m-s);
4304 dstr = NEWSV(33, 0);
4314 LEAVE_SCOPE(oldsave);
4315 iters = (SP - stack_base) - base;
4316 if (iters > maxiters)
4319 /* keep field after final delim? */
4320 if (s < strend || (iters && origlimit)) {
4321 dstr = NEWSV(34, strend-s);
4322 sv_setpvn(dstr, s, strend-s);
4328 else if (!origlimit) {
4329 while (iters > 0 && (!TOPs || !SvANY(TOPs) || SvCUR(TOPs) == 0))
4335 SWITCHSTACK(ary, oldstack);
4336 if (SvSMAGICAL(ary)) {
4341 if (gimme == G_ARRAY) {
4343 Copy(AvARRAY(ary), SP + 1, iters, SV*);
4351 perl_call_method("PUSH",G_SCALAR|G_DISCARD);
4354 if (gimme == G_ARRAY) {
4355 /* EXTEND should not be needed - we just popped them */
4357 for (i=0; i < iters; i++) {
4358 SV **svp = av_fetch(ary, i, FALSE);
4359 PUSHs((svp) ? *svp : &sv_undef);
4366 if (gimme == G_ARRAY)
4369 if (iters || !pm->op_pmreplroot) {
4379 unlock_condpair(void *svv)
4382 MAGIC *mg = mg_find((SV*)svv, 'm');
4385 croak("panic: unlock_condpair unlocking non-mutex");
4386 MUTEX_LOCK(MgMUTEXP(mg));
4387 if (MgOWNER(mg) != thr)
4388 croak("panic: unlock_condpair unlocking mutex that we don't own");
4390 COND_SIGNAL(MgOWNERCONDP(mg));
4391 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "0x%lx: unlock 0x%lx\n",
4392 (unsigned long)thr, (unsigned long)svv);)
4393 MUTEX_UNLOCK(MgMUTEXP(mg));
4395 #endif /* USE_THREADS */
4408 mg = condpair_magic(sv);
4409 MUTEX_LOCK(MgMUTEXP(mg));
4410 if (MgOWNER(mg) == thr)
4411 MUTEX_UNLOCK(MgMUTEXP(mg));
4414 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
4416 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "0x%lx: pp_lock lock 0x%lx\n",
4417 (unsigned long)thr, (unsigned long)sv);)
4418 MUTEX_UNLOCK(MgMUTEXP(mg));
4419 SvREFCNT_inc(sv); /* keep alive until magic_mutexfree */
4420 save_destructor(unlock_condpair, sv);
4422 #endif /* USE_THREADS */
4423 if (SvTYPE(retsv) == SVt_PVAV || SvTYPE(retsv) == SVt_PVHV
4424 || SvTYPE(retsv) == SVt_PVCV) {
4425 retsv = refto(retsv);
4436 if (op->op_private & OPpLVAL_INTRO)
4437 PUSHs(*save_threadsv(op->op_targ));
4439 PUSHs(THREADSV(op->op_targ));
4442 DIE("tried to access per-thread data in non-threaded perl");
4443 #endif /* USE_THREADS */