3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "It's a big house this, and very peculiar. Always a bit more to discover,
13 * and no knowing what you'll find around a corner. And Elves, sir!" --Samwise
16 /* This file contains general pp ("push/pop") functions that execute the
17 * opcodes that make up a perl program. A typical pp function expects to
18 * find its arguments on the stack, and usually pushes its results onto
19 * the stack, hence the 'pp' terminology. Each OP structure contains
20 * a pointer to the relevant pp_foo() function.
30 /* XXX I can't imagine anyone who doesn't have this actually _needs_
31 it, since pid_t is an integral type.
34 #ifdef NEED_GETPID_PROTO
35 extern Pid_t getpid (void);
39 * Some BSDs and Cygwin default to POSIX math instead of IEEE.
40 * This switches them over to IEEE.
42 #if defined(LIBM_LIB_VERSION)
43 _LIB_VERSION_TYPE _LIB_VERSION = _IEEE_;
46 /* variations on pp_null */
51 if (GIMME_V == G_SCALAR)
62 if (PL_op->op_private & OPpLVAL_INTRO)
63 SAVECLEARSV(PAD_SVl(PL_op->op_targ));
65 if (PL_op->op_flags & OPf_REF) {
69 if (GIMME == G_SCALAR)
70 Perl_croak(aTHX_ "Can't return array to lvalue scalar context");
75 if (gimme == G_ARRAY) {
76 const I32 maxarg = AvFILL((AV*)TARG) + 1;
78 if (SvMAGICAL(TARG)) {
80 for (i=0; i < (U32)maxarg; i++) {
81 SV ** const svp = av_fetch((AV*)TARG, i, FALSE);
82 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
86 Copy(AvARRAY((AV*)TARG), SP+1, maxarg, SV*);
90 else if (gimme == G_SCALAR) {
91 SV* const sv = sv_newmortal();
92 const I32 maxarg = AvFILL((AV*)TARG) + 1;
105 if (PL_op->op_private & OPpLVAL_INTRO)
106 SAVECLEARSV(PAD_SVl(PL_op->op_targ));
107 if (PL_op->op_flags & OPf_REF)
110 if (GIMME == G_SCALAR)
111 Perl_croak(aTHX_ "Can't return hash to lvalue scalar context");
115 if (gimme == G_ARRAY) {
118 else if (gimme == G_SCALAR) {
119 SV* const sv = Perl_hv_scalar(aTHX_ (HV*)TARG);
133 tryAMAGICunDEREF(to_gv);
136 if (SvTYPE(sv) == SVt_PVIO) {
137 GV * const gv = (GV*) sv_newmortal();
138 gv_init(gv, 0, "", 0, 0);
139 GvIOp(gv) = (IO *)sv;
140 (void)SvREFCNT_inc(sv);
143 else if (SvTYPE(sv) != SVt_PVGV)
144 DIE(aTHX_ "Not a GLOB reference");
147 if (SvTYPE(sv) != SVt_PVGV) {
148 if (SvGMAGICAL(sv)) {
153 if (!SvOK(sv) && sv != &PL_sv_undef) {
154 /* If this is a 'my' scalar and flag is set then vivify
158 Perl_croak(aTHX_ PL_no_modify);
159 if (PL_op->op_private & OPpDEREF) {
161 if (cUNOP->op_targ) {
163 SV *namesv = PAD_SV(cUNOP->op_targ);
164 const char *name = SvPV(namesv, len);
165 gv = (GV*)NEWSV(0,0);
166 gv_init(gv, CopSTASH(PL_curcop), name, len, 0);
169 const char *name = CopSTASHPV(PL_curcop);
172 if (SvTYPE(sv) < SVt_RV)
173 sv_upgrade(sv, SVt_RV);
174 if (SvPVX_const(sv)) {
179 SvRV_set(sv, (SV*)gv);
184 if (PL_op->op_flags & OPf_REF ||
185 PL_op->op_private & HINT_STRICT_REFS)
186 DIE(aTHX_ PL_no_usym, "a symbol");
187 if (ckWARN(WARN_UNINITIALIZED))
191 if ((PL_op->op_flags & OPf_SPECIAL) &&
192 !(PL_op->op_flags & OPf_MOD))
194 SV * const temp = (SV*)gv_fetchsv(sv, FALSE, SVt_PVGV);
196 && (!is_gv_magical_sv(sv,0)
197 || !(sv = (SV*)gv_fetchsv(sv, TRUE, SVt_PVGV)))) {
203 if (PL_op->op_private & HINT_STRICT_REFS)
204 DIE(aTHX_ PL_no_symref_sv, sv, "a symbol");
205 sv = (SV*)gv_fetchsv(sv, TRUE, SVt_PVGV);
209 if (PL_op->op_private & OPpLVAL_INTRO)
210 save_gp((GV*)sv, !(PL_op->op_flags & OPf_SPECIAL));
222 tryAMAGICunDEREF(to_sv);
225 switch (SvTYPE(sv)) {
229 DIE(aTHX_ "Not a SCALAR reference");
235 if (SvTYPE(gv) != SVt_PVGV) {
236 if (SvGMAGICAL(sv)) {
242 if (PL_op->op_flags & OPf_REF ||
243 PL_op->op_private & HINT_STRICT_REFS)
244 DIE(aTHX_ PL_no_usym, "a SCALAR");
245 if (ckWARN(WARN_UNINITIALIZED))
249 if ((PL_op->op_flags & OPf_SPECIAL) &&
250 !(PL_op->op_flags & OPf_MOD))
252 gv = (GV*)gv_fetchsv(sv, FALSE, SVt_PV);
254 && (!is_gv_magical_sv(sv, 0)
255 || !(gv = (GV*)gv_fetchsv(sv, TRUE, SVt_PV))))
261 if (PL_op->op_private & HINT_STRICT_REFS)
262 DIE(aTHX_ PL_no_symref_sv, sv, "a SCALAR");
263 gv = (GV*)gv_fetchsv(sv, TRUE, SVt_PV);
268 if (PL_op->op_flags & OPf_MOD) {
269 if (PL_op->op_private & OPpLVAL_INTRO) {
270 if (cUNOP->op_first->op_type == OP_NULL)
271 sv = save_scalar((GV*)TOPs);
273 sv = save_scalar(gv);
275 Perl_croak(aTHX_ PL_no_localize_ref);
277 else if (PL_op->op_private & OPpDEREF)
278 vivify_ref(sv, PL_op->op_private & OPpDEREF);
287 AV * const av = (AV*)TOPs;
288 SV ** const sv = Perl_av_arylen_p(aTHX_ (AV*)av);
291 sv_upgrade(*sv, SVt_PVMG);
292 sv_magic(*sv, (SV*)av, PERL_MAGIC_arylen, Nullch, 0);
300 dSP; dTARGET; dPOPss;
302 if (PL_op->op_flags & OPf_MOD || LVRET) {
303 if (SvTYPE(TARG) < SVt_PVLV) {
304 sv_upgrade(TARG, SVt_PVLV);
305 sv_magic(TARG, Nullsv, PERL_MAGIC_pos, Nullch, 0);
309 if (LvTARG(TARG) != sv) {
311 SvREFCNT_dec(LvTARG(TARG));
312 LvTARG(TARG) = SvREFCNT_inc(sv);
314 PUSHs(TARG); /* no SvSETMAGIC */
318 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
319 const MAGIC * const mg = mg_find(sv, PERL_MAGIC_regex_global);
320 if (mg && mg->mg_len >= 0) {
324 PUSHi(i + PL_curcop->cop_arybase);
338 /* We usually try to add a non-existent subroutine in case of AUTOLOAD. */
339 /* (But not in defined().) */
340 CV *cv = sv_2cv(TOPs, &stash, &gv, !(PL_op->op_flags & OPf_SPECIAL));
343 cv = (CV*)sv_2mortal((SV*)cv_clone(cv));
344 if ((PL_op->op_private & OPpLVAL_INTRO)) {
345 if (gv && GvCV(gv) == cv && (gv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv), FALSE)))
348 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
352 cv = (CV*)&PL_sv_undef;
366 if (SvPOK(TOPs) && SvCUR(TOPs) >= 7) {
367 const char *s = SvPVX_const(TOPs);
368 if (strnEQ(s, "CORE::", 6)) {
369 const int code = keyword(s + 6, SvCUR(TOPs) - 6);
370 if (code < 0) { /* Overridable. */
371 #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2)
372 int i = 0, n = 0, seen_question = 0;
374 char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */
376 if (code == -KEY_chop || code == -KEY_chomp
377 || code == -KEY_exec || code == -KEY_system)
379 while (i < MAXO) { /* The slow way. */
380 if (strEQ(s + 6, PL_op_name[i])
381 || strEQ(s + 6, PL_op_desc[i]))
387 goto nonesuch; /* Should not happen... */
389 oa = PL_opargs[i] >> OASHIFT;
391 if (oa & OA_OPTIONAL && !seen_question) {
395 if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF
396 && (oa & (OA_OPTIONAL - 1)) <= OA_SCALARREF
397 /* But globs are already references (kinda) */
398 && (oa & (OA_OPTIONAL - 1)) != OA_FILEREF
402 str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)];
406 ret = sv_2mortal(newSVpvn(str, n - 1));
408 else if (code) /* Non-Overridable */
410 else { /* None such */
412 DIE(aTHX_ "Can't find an opnumber for \"%s\"", s+6);
416 cv = sv_2cv(TOPs, &stash, &gv, FALSE);
418 ret = sv_2mortal(newSVpvn(SvPVX_const(cv), SvCUR(cv)));
427 CV* cv = (CV*)PAD_SV(PL_op->op_targ);
429 cv = (CV*)sv_2mortal((SV*)cv_clone(cv));
445 if (GIMME != G_ARRAY) {
449 *MARK = &PL_sv_undef;
450 *MARK = refto(*MARK);
454 EXTEND_MORTAL(SP - MARK);
456 *MARK = refto(*MARK);
461 S_refto(pTHX_ SV *sv)
465 if (SvTYPE(sv) == SVt_PVLV && LvTYPE(sv) == 'y') {
468 if (!(sv = LvTARG(sv)))
471 (void)SvREFCNT_inc(sv);
473 else if (SvTYPE(sv) == SVt_PVAV) {
474 if (!AvREAL((AV*)sv) && AvREIFY((AV*)sv))
477 (void)SvREFCNT_inc(sv);
479 else if (SvPADTMP(sv) && !IS_PADGV(sv))
483 (void)SvREFCNT_inc(sv);
486 sv_upgrade(rv, SVt_RV);
496 SV * const sv = POPs;
501 if (!sv || !SvROK(sv))
504 pv = sv_reftype(SvRV(sv),TRUE);
505 PUSHp(pv, strlen(pv));
515 stash = CopSTASH(PL_curcop);
517 SV * const ssv = POPs;
521 if (ssv && !SvGMAGICAL(ssv) && !SvAMAGIC(ssv) && SvROK(ssv))
522 Perl_croak(aTHX_ "Attempt to bless into a reference");
523 ptr = SvPV_const(ssv,len);
524 if (len == 0 && ckWARN(WARN_MISC))
525 Perl_warner(aTHX_ packWARN(WARN_MISC),
526 "Explicit blessing to '' (assuming package main)");
527 stash = gv_stashpvn(ptr, len, TRUE);
530 (void)sv_bless(TOPs, stash);
539 const char * const elem = SvPV_nolen_const(sv);
540 GV * const gv = (GV*)POPs;
541 SV * tmpRef = Nullsv;
545 /* elem will always be NUL terminated. */
546 const char * const second_letter = elem + 1;
549 if (strEQ(second_letter, "RRAY"))
550 tmpRef = (SV*)GvAV(gv);
553 if (strEQ(second_letter, "ODE"))
554 tmpRef = (SV*)GvCVu(gv);
557 if (strEQ(second_letter, "ILEHANDLE")) {
558 /* finally deprecated in 5.8.0 */
559 deprecate("*glob{FILEHANDLE}");
560 tmpRef = (SV*)GvIOp(gv);
563 if (strEQ(second_letter, "ORMAT"))
564 tmpRef = (SV*)GvFORM(gv);
567 if (strEQ(second_letter, "LOB"))
571 if (strEQ(second_letter, "ASH"))
572 tmpRef = (SV*)GvHV(gv);
575 if (*second_letter == 'O' && !elem[2])
576 tmpRef = (SV*)GvIOp(gv);
579 if (strEQ(second_letter, "AME"))
580 sv = newSVpvn(GvNAME(gv), GvNAMELEN(gv));
583 if (strEQ(second_letter, "ACKAGE")) {
584 const HEK *hek = HvNAME_HEK(GvSTASH(gv));
585 sv = hek ? newSVhek(hek) : newSVpvn("__ANON__", 8);
589 if (strEQ(second_letter, "CALAR"))
604 /* Pattern matching */
609 register unsigned char *s;
612 register I32 *sfirst;
616 if (sv == PL_lastscream) {
622 SvSCREAM_off(PL_lastscream);
623 SvREFCNT_dec(PL_lastscream);
625 PL_lastscream = SvREFCNT_inc(sv);
628 s = (unsigned char*)(SvPV(sv, len));
632 if (pos > PL_maxscream) {
633 if (PL_maxscream < 0) {
634 PL_maxscream = pos + 80;
635 Newx(PL_screamfirst, 256, I32);
636 Newx(PL_screamnext, PL_maxscream, I32);
639 PL_maxscream = pos + pos / 4;
640 Renew(PL_screamnext, PL_maxscream, I32);
644 sfirst = PL_screamfirst;
645 snext = PL_screamnext;
647 if (!sfirst || !snext)
648 DIE(aTHX_ "do_study: out of memory");
650 for (ch = 256; ch; --ch)
655 register const I32 ch = s[pos];
657 snext[pos] = sfirst[ch] - pos;
664 /* piggyback on m//g magic */
665 sv_magic(sv, Nullsv, PERL_MAGIC_regex_global, Nullch, 0);
674 if (PL_op->op_flags & OPf_STACKED)
676 else if (PL_op->op_private & OPpTARGET_MY)
682 TARG = sv_newmortal();
687 /* Lvalue operators. */
699 dSP; dMARK; dTARGET; dORIGMARK;
701 do_chop(TARG, *++MARK);
710 SETi(do_chomp(TOPs));
717 register I32 count = 0;
720 count += do_chomp(POPs);
730 if (!PL_op->op_private) {
739 SV_CHECK_THINKFIRST_COW_DROP(sv);
741 switch (SvTYPE(sv)) {
751 if (cv_const_sv((CV*)sv) && ckWARN(WARN_MISC))
752 Perl_warner(aTHX_ packWARN(WARN_MISC), "Constant subroutine %s undefined",
753 CvANON((CV*)sv) ? "(anonymous)" : GvENAME(CvGV((CV*)sv)));
757 /* let user-undef'd sub keep its identity */
758 GV* gv = CvGV((CV*)sv);
765 SvSetMagicSV(sv, &PL_sv_undef);
770 GvGP(sv) = gp_ref(gp);
771 GvSV(sv) = NEWSV(72,0);
772 GvLINE(sv) = CopLINE(PL_curcop);
778 if (SvTYPE(sv) >= SVt_PV && SvPVX_const(sv) && SvLEN(sv)) {
780 SvPV_set(sv, Nullch);
793 if (SvTYPE(TOPs) >= SVt_PVGV && SvTYPE(TOPs) != SVt_PVLV)
794 DIE(aTHX_ PL_no_modify);
795 if (!SvREADONLY(TOPs) && SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)
796 && SvIVX(TOPs) != IV_MIN)
798 SvIV_set(TOPs, SvIVX(TOPs) - 1);
799 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
810 if (SvTYPE(TOPs) >= SVt_PVGV && SvTYPE(TOPs) != SVt_PVLV)
811 DIE(aTHX_ PL_no_modify);
812 sv_setsv(TARG, TOPs);
813 if (!SvREADONLY(TOPs) && SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)
814 && SvIVX(TOPs) != IV_MAX)
816 SvIV_set(TOPs, SvIVX(TOPs) + 1);
817 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
822 /* special case for undef: see thread at 2003-03/msg00536.html in archive */
832 if (SvTYPE(TOPs) >= SVt_PVGV && SvTYPE(TOPs) != SVt_PVLV)
833 DIE(aTHX_ PL_no_modify);
834 sv_setsv(TARG, TOPs);
835 if (!SvREADONLY(TOPs) && SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)
836 && SvIVX(TOPs) != IV_MIN)
838 SvIV_set(TOPs, SvIVX(TOPs) - 1);
839 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
848 /* Ordinary operators. */
853 #ifdef PERL_PRESERVE_IVUV
856 tryAMAGICbin(pow,opASSIGN);
857 #ifdef PERL_PRESERVE_IVUV
858 /* For integer to integer power, we do the calculation by hand wherever
859 we're sure it is safe; otherwise we call pow() and try to convert to
860 integer afterwards. */
873 const IV iv = SvIVX(TOPs);
877 goto float_it; /* Can't do negative powers this way. */
881 baseuok = SvUOK(TOPm1s);
883 baseuv = SvUVX(TOPm1s);
885 const IV iv = SvIVX(TOPm1s);
888 baseuok = TRUE; /* effectively it's a UV now */
890 baseuv = -iv; /* abs, baseuok == false records sign */
893 /* now we have integer ** positive integer. */
896 /* foo & (foo - 1) is zero only for a power of 2. */
897 if (!(baseuv & (baseuv - 1))) {
898 /* We are raising power-of-2 to a positive integer.
899 The logic here will work for any base (even non-integer
900 bases) but it can be less accurate than
901 pow (base,power) or exp (power * log (base)) when the
902 intermediate values start to spill out of the mantissa.
903 With powers of 2 we know this can't happen.
904 And powers of 2 are the favourite thing for perl
905 programmers to notice ** not doing what they mean. */
907 NV base = baseuok ? baseuv : -(NV)baseuv;
912 while (power >>= 1) {
923 register unsigned int highbit = 8 * sizeof(UV);
924 register unsigned int diff = 8 * sizeof(UV);
927 if (baseuv >> highbit) {
931 /* we now have baseuv < 2 ** highbit */
932 if (power * highbit <= 8 * sizeof(UV)) {
933 /* result will definitely fit in UV, so use UV math
934 on same algorithm as above */
935 register UV result = 1;
936 register UV base = baseuv;
937 const bool odd_power = (bool)(power & 1);
941 while (power >>= 1) {
948 if (baseuok || !odd_power)
949 /* answer is positive */
951 else if (result <= (UV)IV_MAX)
952 /* answer negative, fits in IV */
954 else if (result == (UV)IV_MIN)
955 /* 2's complement assumption: special case IV_MIN */
958 /* answer negative, doesn't fit */
970 SETn( Perl_pow( left, right) );
971 #ifdef PERL_PRESERVE_IVUV
981 dSP; dATARGET; tryAMAGICbin(mult,opASSIGN);
982 #ifdef PERL_PRESERVE_IVUV
985 /* Unless the left argument is integer in range we are going to have to
986 use NV maths. Hence only attempt to coerce the right argument if
987 we know the left is integer. */
988 /* Left operand is defined, so is it IV? */
991 bool auvok = SvUOK(TOPm1s);
992 bool buvok = SvUOK(TOPs);
993 const UV topmask = (~ (UV)0) << (4 * sizeof (UV));
994 const UV botmask = ~((~ (UV)0) << (4 * sizeof (UV)));
1001 alow = SvUVX(TOPm1s);
1003 const IV aiv = SvIVX(TOPm1s);
1006 auvok = TRUE; /* effectively it's a UV now */
1008 alow = -aiv; /* abs, auvok == false records sign */
1014 const IV biv = SvIVX(TOPs);
1017 buvok = TRUE; /* effectively it's a UV now */
1019 blow = -biv; /* abs, buvok == false records sign */
1023 /* If this does sign extension on unsigned it's time for plan B */
1024 ahigh = alow >> (4 * sizeof (UV));
1026 bhigh = blow >> (4 * sizeof (UV));
1028 if (ahigh && bhigh) {
1029 /* eg 32 bit is at least 0x10000 * 0x10000 == 0x100000000
1030 which is overflow. Drop to NVs below. */
1031 } else if (!ahigh && !bhigh) {
1032 /* eg 32 bit is at most 0xFFFF * 0xFFFF == 0xFFFE0001
1033 so the unsigned multiply cannot overflow. */
1034 UV product = alow * blow;
1035 if (auvok == buvok) {
1036 /* -ve * -ve or +ve * +ve gives a +ve result. */
1040 } else if (product <= (UV)IV_MIN) {
1041 /* 2s complement assumption that (UV)-IV_MIN is correct. */
1042 /* -ve result, which could overflow an IV */
1044 SETi( -(IV)product );
1046 } /* else drop to NVs below. */
1048 /* One operand is large, 1 small */
1051 /* swap the operands */
1053 bhigh = blow; /* bhigh now the temp var for the swap */
1057 /* now, ((ahigh * blow) << half_UV_len) + (alow * blow)
1058 multiplies can't overflow. shift can, add can, -ve can. */
1059 product_middle = ahigh * blow;
1060 if (!(product_middle & topmask)) {
1061 /* OK, (ahigh * blow) won't lose bits when we shift it. */
1063 product_middle <<= (4 * sizeof (UV));
1064 product_low = alow * blow;
1066 /* as for pp_add, UV + something mustn't get smaller.
1067 IIRC ANSI mandates this wrapping *behaviour* for
1068 unsigned whatever the actual representation*/
1069 product_low += product_middle;
1070 if (product_low >= product_middle) {
1071 /* didn't overflow */
1072 if (auvok == buvok) {
1073 /* -ve * -ve or +ve * +ve gives a +ve result. */
1075 SETu( product_low );
1077 } else if (product_low <= (UV)IV_MIN) {
1078 /* 2s complement assumption again */
1079 /* -ve result, which could overflow an IV */
1081 SETi( -(IV)product_low );
1083 } /* else drop to NVs below. */
1085 } /* product_middle too large */
1086 } /* ahigh && bhigh */
1087 } /* SvIOK(TOPm1s) */
1092 SETn( left * right );
1099 dSP; dATARGET; tryAMAGICbin(div,opASSIGN);
1100 /* Only try to do UV divide first
1101 if ((SLOPPYDIVIDE is true) or
1102 (PERL_PRESERVE_IVUV is true and one or both SV is a UV too large
1104 The assumption is that it is better to use floating point divide
1105 whenever possible, only doing integer divide first if we can't be sure.
1106 If NV_PRESERVES_UV is true then we know at compile time that no UV
1107 can be too large to preserve, so don't need to compile the code to
1108 test the size of UVs. */
1111 # define PERL_TRY_UV_DIVIDE
1112 /* ensure that 20./5. == 4. */
1114 # ifdef PERL_PRESERVE_IVUV
1115 # ifndef NV_PRESERVES_UV
1116 # define PERL_TRY_UV_DIVIDE
1121 #ifdef PERL_TRY_UV_DIVIDE
1124 SvIV_please(TOPm1s);
1125 if (SvIOK(TOPm1s)) {
1126 bool left_non_neg = SvUOK(TOPm1s);
1127 bool right_non_neg = SvUOK(TOPs);
1131 if (right_non_neg) {
1132 right = SvUVX(TOPs);
1135 const IV biv = SvIVX(TOPs);
1138 right_non_neg = TRUE; /* effectively it's a UV now */
1144 /* historically undef()/0 gives a "Use of uninitialized value"
1145 warning before dieing, hence this test goes here.
1146 If it were immediately before the second SvIV_please, then
1147 DIE() would be invoked before left was even inspected, so
1148 no inpsection would give no warning. */
1150 DIE(aTHX_ "Illegal division by zero");
1153 left = SvUVX(TOPm1s);
1156 const IV aiv = SvIVX(TOPm1s);
1159 left_non_neg = TRUE; /* effectively it's a UV now */
1168 /* For sloppy divide we always attempt integer division. */
1170 /* Otherwise we only attempt it if either or both operands
1171 would not be preserved by an NV. If both fit in NVs
1172 we fall through to the NV divide code below. However,
1173 as left >= right to ensure integer result here, we know that
1174 we can skip the test on the right operand - right big
1175 enough not to be preserved can't get here unless left is
1178 && (left > ((UV)1 << NV_PRESERVES_UV_BITS))
1181 /* Integer division can't overflow, but it can be imprecise. */
1182 const UV result = left / right;
1183 if (result * right == left) {
1184 SP--; /* result is valid */
1185 if (left_non_neg == right_non_neg) {
1186 /* signs identical, result is positive. */
1190 /* 2s complement assumption */
1191 if (result <= (UV)IV_MIN)
1192 SETi( -(IV)result );
1194 /* It's exact but too negative for IV. */
1195 SETn( -(NV)result );
1198 } /* tried integer divide but it was not an integer result */
1199 } /* else (PERL_ABS(result) < 1.0) or (both UVs in range for NV) */
1200 } /* left wasn't SvIOK */
1201 } /* right wasn't SvIOK */
1202 #endif /* PERL_TRY_UV_DIVIDE */
1206 DIE(aTHX_ "Illegal division by zero");
1207 PUSHn( left / right );
1214 dSP; dATARGET; tryAMAGICbin(modulo,opASSIGN);
1218 bool left_neg = FALSE;
1219 bool right_neg = FALSE;
1220 bool use_double = FALSE;
1221 bool dright_valid = FALSE;
1227 right_neg = !SvUOK(TOPs);
1229 right = SvUVX(POPs);
1231 const IV biv = SvIVX(POPs);
1234 right_neg = FALSE; /* effectively it's a UV now */
1242 right_neg = dright < 0;
1245 if (dright < UV_MAX_P1) {
1246 right = U_V(dright);
1247 dright_valid = TRUE; /* In case we need to use double below. */
1253 /* At this point use_double is only true if right is out of range for
1254 a UV. In range NV has been rounded down to nearest UV and
1255 use_double false. */
1257 if (!use_double && SvIOK(TOPs)) {
1259 left_neg = !SvUOK(TOPs);
1263 IV aiv = SvIVX(POPs);
1266 left_neg = FALSE; /* effectively it's a UV now */
1275 left_neg = dleft < 0;
1279 /* This should be exactly the 5.6 behaviour - if left and right are
1280 both in range for UV then use U_V() rather than floor. */
1282 if (dleft < UV_MAX_P1) {
1283 /* right was in range, so is dleft, so use UVs not double.
1287 /* left is out of range for UV, right was in range, so promote
1288 right (back) to double. */
1290 /* The +0.5 is used in 5.6 even though it is not strictly
1291 consistent with the implicit +0 floor in the U_V()
1292 inside the #if 1. */
1293 dleft = Perl_floor(dleft + 0.5);
1296 dright = Perl_floor(dright + 0.5);
1306 DIE(aTHX_ "Illegal modulus zero");
1308 dans = Perl_fmod(dleft, dright);
1309 if ((left_neg != right_neg) && dans)
1310 dans = dright - dans;
1313 sv_setnv(TARG, dans);
1319 DIE(aTHX_ "Illegal modulus zero");
1322 if ((left_neg != right_neg) && ans)
1325 /* XXX may warn: unary minus operator applied to unsigned type */
1326 /* could change -foo to be (~foo)+1 instead */
1327 if (ans <= ~((UV)IV_MAX)+1)
1328 sv_setiv(TARG, ~ans+1);
1330 sv_setnv(TARG, -(NV)ans);
1333 sv_setuv(TARG, ans);
1342 dSP; dATARGET; tryAMAGICbin(repeat,opASSIGN);
1349 const UV uv = SvUV(sv);
1351 count = IV_MAX; /* The best we can do? */
1362 else if (SvNOKp(sv)) {
1363 const NV nv = SvNV(sv);
1371 if (GIMME == G_ARRAY && PL_op->op_private & OPpREPEAT_DOLIST) {
1373 I32 items = SP - MARK;
1375 static const char oom_list_extend[] =
1376 "Out of memory during list extend";
1378 max = items * count;
1379 MEM_WRAP_CHECK_1(max, SV*, oom_list_extend);
1380 /* Did the max computation overflow? */
1381 if (items > 0 && max > 0 && (max < items || max < count))
1382 Perl_croak(aTHX_ oom_list_extend);
1387 /* This code was intended to fix 20010809.028:
1390 for (($x =~ /./g) x 2) {
1391 print chop; # "abcdabcd" expected as output.
1394 * but that change (#11635) broke this code:
1396 $x = [("foo")x2]; # only one "foo" ended up in the anonlist.
1398 * I can't think of a better fix that doesn't introduce
1399 * an efficiency hit by copying the SVs. The stack isn't
1400 * refcounted, and mortalisation obviously doesn't
1401 * Do The Right Thing when the stack has more than
1402 * one pointer to the same mortal value.
1406 *SP = sv_2mortal(newSVsv(*SP));
1416 repeatcpy((char*)(MARK + items), (char*)MARK,
1417 items * sizeof(SV*), count - 1);
1420 else if (count <= 0)
1423 else { /* Note: mark already snarfed by pp_list */
1427 static const char oom_string_extend[] =
1428 "Out of memory during string extend";
1430 SvSetSV(TARG, tmpstr);
1431 SvPV_force(TARG, len);
1432 isutf = DO_UTF8(TARG);
1437 STRLEN max = (UV)count * len;
1438 if (len > ((MEM_SIZE)~0)/count)
1439 Perl_croak(aTHX_ oom_string_extend);
1440 MEM_WRAP_CHECK_1(max, char, oom_string_extend);
1441 SvGROW(TARG, max + 1);
1442 repeatcpy(SvPVX(TARG) + len, SvPVX(TARG), len, count - 1);
1443 SvCUR_set(TARG, SvCUR(TARG) * count);
1445 *SvEND(TARG) = '\0';
1448 (void)SvPOK_only_UTF8(TARG);
1450 (void)SvPOK_only(TARG);
1452 if (PL_op->op_private & OPpREPEAT_DOLIST) {
1453 /* The parser saw this as a list repeat, and there
1454 are probably several items on the stack. But we're
1455 in scalar context, and there's no pp_list to save us
1456 now. So drop the rest of the items -- robin@kitsite.com
1469 dSP; dATARGET; bool useleft; tryAMAGICbin(subtr,opASSIGN);
1470 useleft = USE_LEFT(TOPm1s);
1471 #ifdef PERL_PRESERVE_IVUV
1472 /* See comments in pp_add (in pp_hot.c) about Overflow, and how
1473 "bad things" happen if you rely on signed integers wrapping. */
1476 /* Unless the left argument is integer in range we are going to have to
1477 use NV maths. Hence only attempt to coerce the right argument if
1478 we know the left is integer. */
1479 register UV auv = 0;
1485 a_valid = auvok = 1;
1486 /* left operand is undef, treat as zero. */
1488 /* Left operand is defined, so is it IV? */
1489 SvIV_please(TOPm1s);
1490 if (SvIOK(TOPm1s)) {
1491 if ((auvok = SvUOK(TOPm1s)))
1492 auv = SvUVX(TOPm1s);
1494 register const IV aiv = SvIVX(TOPm1s);
1497 auvok = 1; /* Now acting as a sign flag. */
1498 } else { /* 2s complement assumption for IV_MIN */
1506 bool result_good = 0;
1509 bool buvok = SvUOK(TOPs);
1514 register const IV biv = SvIVX(TOPs);
1521 /* ?uvok if value is >= 0. basically, flagged as UV if it's +ve,
1522 else "IV" now, independent of how it came in.
1523 if a, b represents positive, A, B negative, a maps to -A etc
1528 all UV maths. negate result if A negative.
1529 subtract if signs same, add if signs differ. */
1531 if (auvok ^ buvok) {
1540 /* Must get smaller */
1545 if (result <= buv) {
1546 /* result really should be -(auv-buv). as its negation
1547 of true value, need to swap our result flag */
1559 if (result <= (UV)IV_MIN)
1560 SETi( -(IV)result );
1562 /* result valid, but out of range for IV. */
1563 SETn( -(NV)result );
1567 } /* Overflow, drop through to NVs. */
1571 useleft = USE_LEFT(TOPm1s);
1575 /* left operand is undef, treat as zero - value */
1579 SETn( TOPn - value );
1586 dSP; dATARGET; tryAMAGICbin(lshift,opASSIGN);
1588 const IV shift = POPi;
1589 if (PL_op->op_private & HINT_INTEGER) {
1603 dSP; dATARGET; tryAMAGICbin(rshift,opASSIGN);
1605 const IV shift = POPi;
1606 if (PL_op->op_private & HINT_INTEGER) {
1620 dSP; tryAMAGICbinSET(lt,0);
1621 #ifdef PERL_PRESERVE_IVUV
1624 SvIV_please(TOPm1s);
1625 if (SvIOK(TOPm1s)) {
1626 bool auvok = SvUOK(TOPm1s);
1627 bool buvok = SvUOK(TOPs);
1629 if (!auvok && !buvok) { /* ## IV < IV ## */
1630 const IV aiv = SvIVX(TOPm1s);
1631 const IV biv = SvIVX(TOPs);
1634 SETs(boolSV(aiv < biv));
1637 if (auvok && buvok) { /* ## UV < UV ## */
1638 const UV auv = SvUVX(TOPm1s);
1639 const UV buv = SvUVX(TOPs);
1642 SETs(boolSV(auv < buv));
1645 if (auvok) { /* ## UV < IV ## */
1647 const IV biv = SvIVX(TOPs);
1650 /* As (a) is a UV, it's >=0, so it cannot be < */
1655 SETs(boolSV(auv < (UV)biv));
1658 { /* ## IV < UV ## */
1659 const IV aiv = SvIVX(TOPm1s);
1663 /* As (b) is a UV, it's >=0, so it must be < */
1670 SETs(boolSV((UV)aiv < buv));
1676 #ifndef NV_PRESERVES_UV
1677 #ifdef PERL_PRESERVE_IVUV
1680 if (SvROK(TOPs) && !SvAMAGIC(TOPs) && SvROK(TOPm1s) && !SvAMAGIC(TOPm1s)) {
1682 SETs(boolSV(SvRV(TOPs) < SvRV(TOPp1s)));
1688 SETs(boolSV(TOPn < value));
1695 dSP; tryAMAGICbinSET(gt,0);
1696 #ifdef PERL_PRESERVE_IVUV
1699 SvIV_please(TOPm1s);
1700 if (SvIOK(TOPm1s)) {
1701 bool auvok = SvUOK(TOPm1s);
1702 bool buvok = SvUOK(TOPs);
1704 if (!auvok && !buvok) { /* ## IV > IV ## */
1705 const IV aiv = SvIVX(TOPm1s);
1706 const IV biv = SvIVX(TOPs);
1709 SETs(boolSV(aiv > biv));
1712 if (auvok && buvok) { /* ## UV > UV ## */
1713 const UV auv = SvUVX(TOPm1s);
1714 const UV buv = SvUVX(TOPs);
1717 SETs(boolSV(auv > buv));
1720 if (auvok) { /* ## UV > IV ## */
1722 const IV biv = SvIVX(TOPs);
1726 /* As (a) is a UV, it's >=0, so it must be > */
1731 SETs(boolSV(auv > (UV)biv));
1734 { /* ## IV > UV ## */
1735 const IV aiv = SvIVX(TOPm1s);
1739 /* As (b) is a UV, it's >=0, so it cannot be > */
1746 SETs(boolSV((UV)aiv > buv));
1752 #ifndef NV_PRESERVES_UV
1753 #ifdef PERL_PRESERVE_IVUV
1756 if (SvROK(TOPs) && !SvAMAGIC(TOPs) && SvROK(TOPm1s) && !SvAMAGIC(TOPm1s)) {
1758 SETs(boolSV(SvRV(TOPs) > SvRV(TOPp1s)));
1764 SETs(boolSV(TOPn > value));
1771 dSP; tryAMAGICbinSET(le,0);
1772 #ifdef PERL_PRESERVE_IVUV
1775 SvIV_please(TOPm1s);
1776 if (SvIOK(TOPm1s)) {
1777 bool auvok = SvUOK(TOPm1s);
1778 bool buvok = SvUOK(TOPs);
1780 if (!auvok && !buvok) { /* ## IV <= IV ## */
1781 const IV aiv = SvIVX(TOPm1s);
1782 const IV biv = SvIVX(TOPs);
1785 SETs(boolSV(aiv <= biv));
1788 if (auvok && buvok) { /* ## UV <= UV ## */
1789 UV auv = SvUVX(TOPm1s);
1790 UV buv = SvUVX(TOPs);
1793 SETs(boolSV(auv <= buv));
1796 if (auvok) { /* ## UV <= IV ## */
1798 const IV biv = SvIVX(TOPs);
1802 /* As (a) is a UV, it's >=0, so a cannot be <= */
1807 SETs(boolSV(auv <= (UV)biv));
1810 { /* ## IV <= UV ## */
1811 const IV aiv = SvIVX(TOPm1s);
1815 /* As (b) is a UV, it's >=0, so a must be <= */
1822 SETs(boolSV((UV)aiv <= buv));
1828 #ifndef NV_PRESERVES_UV
1829 #ifdef PERL_PRESERVE_IVUV
1832 if (SvROK(TOPs) && !SvAMAGIC(TOPs) && SvROK(TOPm1s) && !SvAMAGIC(TOPm1s)) {
1834 SETs(boolSV(SvRV(TOPs) <= SvRV(TOPp1s)));
1840 SETs(boolSV(TOPn <= value));
1847 dSP; tryAMAGICbinSET(ge,0);
1848 #ifdef PERL_PRESERVE_IVUV
1851 SvIV_please(TOPm1s);
1852 if (SvIOK(TOPm1s)) {
1853 bool auvok = SvUOK(TOPm1s);
1854 bool buvok = SvUOK(TOPs);
1856 if (!auvok && !buvok) { /* ## IV >= IV ## */
1857 const IV aiv = SvIVX(TOPm1s);
1858 const IV biv = SvIVX(TOPs);
1861 SETs(boolSV(aiv >= biv));
1864 if (auvok && buvok) { /* ## UV >= UV ## */
1865 const UV auv = SvUVX(TOPm1s);
1866 const UV buv = SvUVX(TOPs);
1869 SETs(boolSV(auv >= buv));
1872 if (auvok) { /* ## UV >= IV ## */
1874 const IV biv = SvIVX(TOPs);
1878 /* As (a) is a UV, it's >=0, so it must be >= */
1883 SETs(boolSV(auv >= (UV)biv));
1886 { /* ## IV >= UV ## */
1887 const IV aiv = SvIVX(TOPm1s);
1891 /* As (b) is a UV, it's >=0, so a cannot be >= */
1898 SETs(boolSV((UV)aiv >= buv));
1904 #ifndef NV_PRESERVES_UV
1905 #ifdef PERL_PRESERVE_IVUV
1908 if (SvROK(TOPs) && !SvAMAGIC(TOPs) && SvROK(TOPm1s) && !SvAMAGIC(TOPm1s)) {
1910 SETs(boolSV(SvRV(TOPs) >= SvRV(TOPp1s)));
1916 SETs(boolSV(TOPn >= value));
1923 dSP; tryAMAGICbinSET(ne,0);
1924 #ifndef NV_PRESERVES_UV
1925 if (SvROK(TOPs) && !SvAMAGIC(TOPs) && SvROK(TOPm1s) && !SvAMAGIC(TOPm1s)) {
1927 SETs(boolSV(SvRV(TOPs) != SvRV(TOPp1s)));
1931 #ifdef PERL_PRESERVE_IVUV
1934 SvIV_please(TOPm1s);
1935 if (SvIOK(TOPm1s)) {
1936 bool auvok = SvUOK(TOPm1s);
1937 bool buvok = SvUOK(TOPs);
1939 if (auvok == buvok) { /* ## IV == IV or UV == UV ## */
1940 /* Casting IV to UV before comparison isn't going to matter
1941 on 2s complement. On 1s complement or sign&magnitude
1942 (if we have any of them) it could make negative zero
1943 differ from normal zero. As I understand it. (Need to
1944 check - is negative zero implementation defined behaviour
1946 const UV buv = SvUVX(POPs);
1947 const UV auv = SvUVX(TOPs);
1949 SETs(boolSV(auv != buv));
1952 { /* ## Mixed IV,UV ## */
1956 /* != is commutative so swap if needed (save code) */
1958 /* swap. top of stack (b) is the iv */
1962 /* As (a) is a UV, it's >0, so it cannot be == */
1971 /* As (b) is a UV, it's >0, so it cannot be == */
1975 uv = SvUVX(*(SP+1)); /* Do I want TOPp1s() ? */
1977 SETs(boolSV((UV)iv != uv));
1985 SETs(boolSV(TOPn != value));
1992 dSP; dTARGET; tryAMAGICbin(ncmp,0);
1993 #ifndef NV_PRESERVES_UV
1994 if (SvROK(TOPs) && !SvAMAGIC(TOPs) && SvROK(TOPm1s) && !SvAMAGIC(TOPm1s)) {
1995 UV right = PTR2UV(SvRV(POPs));
1996 UV left = PTR2UV(SvRV(TOPs));
1997 SETi((left > right) - (left < right));
2001 #ifdef PERL_PRESERVE_IVUV
2002 /* Fortunately it seems NaN isn't IOK */
2005 SvIV_please(TOPm1s);
2006 if (SvIOK(TOPm1s)) {
2007 const bool leftuvok = SvUOK(TOPm1s);
2008 const bool rightuvok = SvUOK(TOPs);
2010 if (!leftuvok && !rightuvok) { /* ## IV <=> IV ## */
2011 const IV leftiv = SvIVX(TOPm1s);
2012 const IV rightiv = SvIVX(TOPs);
2014 if (leftiv > rightiv)
2016 else if (leftiv < rightiv)
2020 } else if (leftuvok && rightuvok) { /* ## UV <=> UV ## */
2021 const UV leftuv = SvUVX(TOPm1s);
2022 const UV rightuv = SvUVX(TOPs);
2024 if (leftuv > rightuv)
2026 else if (leftuv < rightuv)
2030 } else if (leftuvok) { /* ## UV <=> IV ## */
2031 const IV rightiv = SvIVX(TOPs);
2033 /* As (a) is a UV, it's >=0, so it cannot be < */
2036 const UV leftuv = SvUVX(TOPm1s);
2037 if (leftuv > (UV)rightiv) {
2039 } else if (leftuv < (UV)rightiv) {
2045 } else { /* ## IV <=> UV ## */
2046 const IV leftiv = SvIVX(TOPm1s);
2048 /* As (b) is a UV, it's >=0, so it must be < */
2051 const UV rightuv = SvUVX(TOPs);
2052 if ((UV)leftiv > rightuv) {
2054 } else if ((UV)leftiv < rightuv) {
2072 if (Perl_isnan(left) || Perl_isnan(right)) {
2076 value = (left > right) - (left < right);
2080 else if (left < right)
2082 else if (left > right)
2098 int amg_type = sle_amg;
2102 switch (PL_op->op_type) {
2121 tryAMAGICbinSET_var(amg_type,0);
2124 const int cmp = (IN_LOCALE_RUNTIME
2125 ? sv_cmp_locale(left, right)
2126 : sv_cmp(left, right));
2127 SETs(boolSV(cmp * multiplier < rhs));
2134 dSP; tryAMAGICbinSET(seq,0);
2137 SETs(boolSV(sv_eq(left, right)));
2144 dSP; tryAMAGICbinSET(sne,0);
2147 SETs(boolSV(!sv_eq(left, right)));
2154 dSP; dTARGET; tryAMAGICbin(scmp,0);
2157 const int cmp = (IN_LOCALE_RUNTIME
2158 ? sv_cmp_locale(left, right)
2159 : sv_cmp(left, right));
2167 dSP; dATARGET; tryAMAGICbin(band,opASSIGN);
2172 if (SvNIOKp(left) || SvNIOKp(right)) {
2173 if (PL_op->op_private & HINT_INTEGER) {
2174 const IV i = SvIV_nomg(left) & SvIV_nomg(right);
2178 const UV u = SvUV_nomg(left) & SvUV_nomg(right);
2183 do_vop(PL_op->op_type, TARG, left, right);
2192 dSP; dATARGET; tryAMAGICbin(bxor,opASSIGN);
2197 if (SvNIOKp(left) || SvNIOKp(right)) {
2198 if (PL_op->op_private & HINT_INTEGER) {
2199 const IV i = (USE_LEFT(left) ? SvIV_nomg(left) : 0) ^ SvIV_nomg(right);
2203 const UV u = (USE_LEFT(left) ? SvUV_nomg(left) : 0) ^ SvUV_nomg(right);
2208 do_vop(PL_op->op_type, TARG, left, right);
2217 dSP; dATARGET; tryAMAGICbin(bor,opASSIGN);
2222 if (SvNIOKp(left) || SvNIOKp(right)) {
2223 if (PL_op->op_private & HINT_INTEGER) {
2224 const IV i = (USE_LEFT(left) ? SvIV_nomg(left) : 0) | SvIV_nomg(right);
2228 const UV u = (USE_LEFT(left) ? SvUV_nomg(left) : 0) | SvUV_nomg(right);
2233 do_vop(PL_op->op_type, TARG, left, right);
2242 dSP; dTARGET; tryAMAGICun(neg);
2245 const int flags = SvFLAGS(sv);
2247 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
2248 /* It's publicly an integer, or privately an integer-not-float */
2251 if (SvIVX(sv) == IV_MIN) {
2252 /* 2s complement assumption. */
2253 SETi(SvIVX(sv)); /* special case: -((UV)IV_MAX+1) == IV_MIN */
2256 else if (SvUVX(sv) <= IV_MAX) {
2261 else if (SvIVX(sv) != IV_MIN) {
2265 #ifdef PERL_PRESERVE_IVUV
2274 else if (SvPOKp(sv)) {
2276 const char *s = SvPV_const(sv, len);
2277 if (isIDFIRST(*s)) {
2278 sv_setpvn(TARG, "-", 1);
2281 else if (*s == '+' || *s == '-') {
2283 *SvPV_force(TARG, len) = *s == '-' ? '+' : '-';
2285 else if (DO_UTF8(sv)) {
2288 goto oops_its_an_int;
2290 sv_setnv(TARG, -SvNV(sv));
2292 sv_setpvn(TARG, "-", 1);
2299 goto oops_its_an_int;
2300 sv_setnv(TARG, -SvNV(sv));
2312 dSP; tryAMAGICunSET(not);
2313 *PL_stack_sp = boolSV(!SvTRUE(*PL_stack_sp));
2319 dSP; dTARGET; tryAMAGICun(compl);
2324 if (PL_op->op_private & HINT_INTEGER) {
2325 const IV i = ~SvIV_nomg(sv);
2329 const UV u = ~SvUV_nomg(sv);
2338 (void)SvPV_nomg_const(sv,len); /* force check for uninit var */
2339 sv_setsv_nomg(TARG, sv);
2340 tmps = (U8*)SvPV_force(TARG, len);
2343 /* Calculate exact length, let's not estimate. */
2352 while (tmps < send) {
2353 const UV c = utf8n_to_uvchr(tmps, send-tmps, &l, UTF8_ALLOW_ANYUV);
2354 tmps += UTF8SKIP(tmps);
2355 targlen += UNISKIP(~c);
2361 /* Now rewind strings and write them. */
2365 Newxz(result, targlen + 1, U8);
2366 while (tmps < send) {
2367 const UV c = utf8n_to_uvchr(tmps, send-tmps, &l, UTF8_ALLOW_ANYUV);
2368 tmps += UTF8SKIP(tmps);
2369 result = uvchr_to_utf8_flags(result, ~c, UNICODE_ALLOW_ANY);
2373 sv_setpvn(TARG, (char*)result, targlen);
2377 Newxz(result, nchar + 1, U8);
2378 while (tmps < send) {
2379 const U8 c = (U8)utf8n_to_uvchr(tmps, 0, &l, UTF8_ALLOW_ANY);
2380 tmps += UTF8SKIP(tmps);
2385 sv_setpvn(TARG, (char*)result, nchar);
2394 register long *tmpl;
2395 for ( ; anum && (unsigned long)tmps % sizeof(long); anum--, tmps++)
2398 for ( ; anum >= sizeof(long); anum -= sizeof(long), tmpl++)
2403 for ( ; anum > 0; anum--, tmps++)
2412 /* integer versions of some of the above */
2416 dSP; dATARGET; tryAMAGICbin(mult,opASSIGN);
2419 SETi( left * right );
2426 dSP; dATARGET; tryAMAGICbin(div,opASSIGN);
2430 DIE(aTHX_ "Illegal division by zero");
2431 value = POPi / value;
2440 /* This is the vanilla old i_modulo. */
2441 dVAR; dSP; dATARGET; tryAMAGICbin(modulo,opASSIGN);
2445 DIE(aTHX_ "Illegal modulus zero");
2446 SETi( left % right );
2451 #if defined(__GLIBC__) && IVSIZE == 8
2455 /* This is the i_modulo with the workaround for the _moddi3 bug
2456 * in (at least) glibc 2.2.5 (the PERL_ABS() the workaround).
2457 * See below for pp_i_modulo. */
2458 dVAR; dSP; dATARGET; tryAMAGICbin(modulo,opASSIGN);
2462 DIE(aTHX_ "Illegal modulus zero");
2463 SETi( left % PERL_ABS(right) );
2471 dVAR; dSP; dATARGET; tryAMAGICbin(modulo,opASSIGN);
2475 DIE(aTHX_ "Illegal modulus zero");
2476 /* The assumption is to use hereafter the old vanilla version... */
2478 PL_ppaddr[OP_I_MODULO] =
2480 /* .. but if we have glibc, we might have a buggy _moddi3
2481 * (at least glicb 2.2.5 is known to have this bug), in other
2482 * words our integer modulus with negative quad as the second
2483 * argument might be broken. Test for this and re-patch the
2484 * opcode dispatch table if that is the case, remembering to
2485 * also apply the workaround so that this first round works
2486 * right, too. See [perl #9402] for more information. */
2487 #if defined(__GLIBC__) && IVSIZE == 8
2491 /* Cannot do this check with inlined IV constants since
2492 * that seems to work correctly even with the buggy glibc. */
2494 /* Yikes, we have the bug.
2495 * Patch in the workaround version. */
2497 PL_ppaddr[OP_I_MODULO] =
2498 &Perl_pp_i_modulo_1;
2499 /* Make certain we work right this time, too. */
2500 right = PERL_ABS(right);
2504 SETi( left % right );
2511 dSP; dATARGET; tryAMAGICbin(add,opASSIGN);
2514 SETi( left + right );
2521 dSP; dATARGET; tryAMAGICbin(subtr,opASSIGN);
2524 SETi( left - right );
2531 dSP; tryAMAGICbinSET(lt,0);
2534 SETs(boolSV(left < right));
2541 dSP; tryAMAGICbinSET(gt,0);
2544 SETs(boolSV(left > right));
2551 dSP; tryAMAGICbinSET(le,0);
2554 SETs(boolSV(left <= right));
2561 dSP; tryAMAGICbinSET(ge,0);
2564 SETs(boolSV(left >= right));
2571 dSP; tryAMAGICbinSET(eq,0);
2574 SETs(boolSV(left == right));
2581 dSP; tryAMAGICbinSET(ne,0);
2584 SETs(boolSV(left != right));
2591 dSP; dTARGET; tryAMAGICbin(ncmp,0);
2598 else if (left < right)
2609 dSP; dTARGET; tryAMAGICun(neg);
2614 /* High falutin' math. */
2618 dSP; dTARGET; tryAMAGICbin(atan2,0);
2621 SETn(Perl_atan2(left, right));
2628 dSP; dTARGET; tryAMAGICun(sin);
2630 const NV value = POPn;
2631 XPUSHn(Perl_sin(value));
2638 dSP; dTARGET; tryAMAGICun(cos);
2640 const NV value = POPn;
2641 XPUSHn(Perl_cos(value));
2646 /* Support Configure command-line overrides for rand() functions.
2647 After 5.005, perhaps we should replace this by Configure support
2648 for drand48(), random(), or rand(). For 5.005, though, maintain
2649 compatibility by calling rand() but allow the user to override it.
2650 See INSTALL for details. --Andy Dougherty 15 July 1998
2652 /* Now it's after 5.005, and Configure supports drand48() and random(),
2653 in addition to rand(). So the overrides should not be needed any more.
2654 --Jarkko Hietaniemi 27 September 1998
2657 #ifndef HAS_DRAND48_PROTO
2658 extern double drand48 (void);
2671 if (!PL_srand_called) {
2672 (void)seedDrand01((Rand_seed_t)seed());
2673 PL_srand_called = TRUE;
2688 (void)seedDrand01((Rand_seed_t)anum);
2689 PL_srand_called = TRUE;
2696 dSP; dTARGET; tryAMAGICun(exp);
2700 value = Perl_exp(value);
2708 dSP; dTARGET; tryAMAGICun(log);
2710 const NV value = POPn;
2712 SET_NUMERIC_STANDARD();
2713 DIE(aTHX_ "Can't take log of %"NVgf, value);
2715 XPUSHn(Perl_log(value));
2722 dSP; dTARGET; tryAMAGICun(sqrt);
2724 const NV value = POPn;
2726 SET_NUMERIC_STANDARD();
2727 DIE(aTHX_ "Can't take sqrt of %"NVgf, value);
2729 XPUSHn(Perl_sqrt(value));
2736 dSP; dTARGET; tryAMAGICun(int);
2738 const IV iv = TOPi; /* attempt to convert to IV if possible. */
2739 /* XXX it's arguable that compiler casting to IV might be subtly
2740 different from modf (for numbers inside (IV_MIN,UV_MAX)) in which
2741 else preferring IV has introduced a subtle behaviour change bug. OTOH
2742 relying on floating point to be accurate is a bug. */
2746 else if (SvIOK(TOPs)) {
2753 const NV value = TOPn;
2755 if (value < (NV)UV_MAX + 0.5) {
2758 SETn(Perl_floor(value));
2762 if (value > (NV)IV_MIN - 0.5) {
2765 SETn(Perl_ceil(value));
2775 dSP; dTARGET; tryAMAGICun(abs);
2777 /* This will cache the NV value if string isn't actually integer */
2782 else if (SvIOK(TOPs)) {
2783 /* IVX is precise */
2785 SETu(TOPu); /* force it to be numeric only */
2793 /* 2s complement assumption. Also, not really needed as
2794 IV_MIN and -IV_MIN should both be %100...00 and NV-able */
2800 const NV value = TOPn;
2815 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES;
2819 SV* const sv = POPs;
2821 tmps = (SvPV_const(sv, len));
2823 /* If Unicode, try to downgrade
2824 * If not possible, croak. */
2825 SV* const tsv = sv_2mortal(newSVsv(sv));
2828 sv_utf8_downgrade(tsv, FALSE);
2829 tmps = SvPV_const(tsv, len);
2831 result_uv = grok_hex (tmps, &len, &flags, &result_nv);
2832 if (flags & PERL_SCAN_GREATER_THAN_UV_MAX) {
2845 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES;
2849 SV* const sv = POPs;
2851 tmps = (SvPV_const(sv, len));
2853 /* If Unicode, try to downgrade
2854 * If not possible, croak. */
2855 SV* const tsv = sv_2mortal(newSVsv(sv));
2858 sv_utf8_downgrade(tsv, FALSE);
2859 tmps = SvPV_const(tsv, len);
2861 while (*tmps && len && isSPACE(*tmps))
2866 result_uv = grok_hex (tmps, &len, &flags, &result_nv);
2867 else if (*tmps == 'b')
2868 result_uv = grok_bin (tmps, &len, &flags, &result_nv);
2870 result_uv = grok_oct (tmps, &len, &flags, &result_nv);
2872 if (flags & PERL_SCAN_GREATER_THAN_UV_MAX) {
2889 SETi(sv_len_utf8(sv));
2905 const I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
2907 const I32 arybase = PL_curcop->cop_arybase;
2909 const char *repl = 0;
2911 const int num_args = PL_op->op_private & 7;
2912 bool repl_need_utf8_upgrade = FALSE;
2913 bool repl_is_utf8 = FALSE;
2915 SvTAINTED_off(TARG); /* decontaminate */
2916 SvUTF8_off(TARG); /* decontaminate */
2920 repl = SvPV_const(repl_sv, repl_len);
2921 repl_is_utf8 = DO_UTF8(repl_sv) && SvCUR(repl_sv);
2931 sv_utf8_upgrade(sv);
2933 else if (DO_UTF8(sv))
2934 repl_need_utf8_upgrade = TRUE;
2936 tmps = SvPV_const(sv, curlen);
2938 utf8_curlen = sv_len_utf8(sv);
2939 if (utf8_curlen == curlen)
2942 curlen = utf8_curlen;
2947 if (pos >= arybase) {
2965 else if (len >= 0) {
2967 if (rem > (I32)curlen)
2982 Perl_croak(aTHX_ "substr outside of string");
2983 if (ckWARN(WARN_SUBSTR))
2984 Perl_warner(aTHX_ packWARN(WARN_SUBSTR), "substr outside of string");
2988 const I32 upos = pos;
2989 const I32 urem = rem;
2991 sv_pos_u2b(sv, &pos, &rem);
2993 /* we either return a PV or an LV. If the TARG hasn't been used
2994 * before, or is of that type, reuse it; otherwise use a mortal
2995 * instead. Note that LVs can have an extended lifetime, so also
2996 * dont reuse if refcount > 1 (bug #20933) */
2997 if (SvTYPE(TARG) > SVt_NULL) {
2998 if ( (SvTYPE(TARG) == SVt_PVLV)
2999 ? (!lvalue || SvREFCNT(TARG) > 1)
3002 TARG = sv_newmortal();
3006 sv_setpvn(TARG, tmps, rem);
3007 #ifdef USE_LOCALE_COLLATE
3008 sv_unmagic(TARG, PERL_MAGIC_collxfrm);
3013 SV* repl_sv_copy = NULL;
3015 if (repl_need_utf8_upgrade) {
3016 repl_sv_copy = newSVsv(repl_sv);
3017 sv_utf8_upgrade(repl_sv_copy);
3018 repl = SvPV_const(repl_sv_copy, repl_len);
3019 repl_is_utf8 = DO_UTF8(repl_sv_copy) && SvCUR(sv);
3021 sv_insert(sv, pos, rem, repl, repl_len);
3025 SvREFCNT_dec(repl_sv_copy);
3027 else if (lvalue) { /* it's an lvalue! */
3028 if (!SvGMAGICAL(sv)) {
3030 SvPV_force_nolen(sv);
3031 if (ckWARN(WARN_SUBSTR))
3032 Perl_warner(aTHX_ packWARN(WARN_SUBSTR),
3033 "Attempt to use reference as lvalue in substr");
3035 if (SvOK(sv)) /* is it defined ? */
3036 (void)SvPOK_only_UTF8(sv);
3038 sv_setpvn(sv,"",0); /* avoid lexical reincarnation */
3041 if (SvTYPE(TARG) < SVt_PVLV) {
3042 sv_upgrade(TARG, SVt_PVLV);
3043 sv_magic(TARG, Nullsv, PERL_MAGIC_substr, Nullch, 0);
3049 if (LvTARG(TARG) != sv) {
3051 SvREFCNT_dec(LvTARG(TARG));
3052 LvTARG(TARG) = SvREFCNT_inc(sv);
3054 LvTARGOFF(TARG) = upos;
3055 LvTARGLEN(TARG) = urem;
3059 PUSHs(TARG); /* avoid SvSETMAGIC here */
3066 register const IV size = POPi;
3067 register const IV offset = POPi;
3068 register SV * const src = POPs;
3069 const I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
3071 SvTAINTED_off(TARG); /* decontaminate */
3072 if (lvalue) { /* it's an lvalue! */
3073 if (SvREFCNT(TARG) > 1) /* don't share the TARG (#20933) */
3074 TARG = sv_newmortal();
3075 if (SvTYPE(TARG) < SVt_PVLV) {
3076 sv_upgrade(TARG, SVt_PVLV);
3077 sv_magic(TARG, Nullsv, PERL_MAGIC_vec, Nullch, 0);
3080 if (LvTARG(TARG) != src) {
3082 SvREFCNT_dec(LvTARG(TARG));
3083 LvTARG(TARG) = SvREFCNT_inc(src);
3085 LvTARGOFF(TARG) = offset;
3086 LvTARGLEN(TARG) = size;
3089 sv_setuv(TARG, do_vecget(src, offset, size));
3105 const I32 arybase = PL_curcop->cop_arybase;
3112 offset = POPi - arybase;
3115 big_utf8 = DO_UTF8(big);
3116 little_utf8 = DO_UTF8(little);
3117 if (big_utf8 ^ little_utf8) {
3118 /* One needs to be upgraded. */
3119 SV * const bytes = little_utf8 ? big : little;
3121 const char * const p = SvPV_const(bytes, len);
3123 temp = newSVpvn(p, len);
3126 sv_recode_to_utf8(temp, PL_encoding);
3128 sv_utf8_upgrade(temp);
3137 if (big_utf8 && offset > 0)
3138 sv_pos_u2b(big, &offset, 0);
3139 tmps = SvPV_const(big, biglen);
3142 else if (offset > (I32)biglen)
3144 if (!(tmps2 = fbm_instr((unsigned char*)tmps + offset,
3145 (unsigned char*)tmps + biglen, little, 0)))
3148 retval = tmps2 - tmps;
3149 if (retval > 0 && big_utf8)
3150 sv_pos_b2u(big, &retval);
3153 PUSHi(retval + arybase);
3169 const I32 arybase = PL_curcop->cop_arybase;
3177 big_utf8 = DO_UTF8(big);
3178 little_utf8 = DO_UTF8(little);
3179 if (big_utf8 ^ little_utf8) {
3180 /* One needs to be upgraded. */
3181 SV * const bytes = little_utf8 ? big : little;
3183 const char *p = SvPV_const(bytes, len);
3185 temp = newSVpvn(p, len);
3188 sv_recode_to_utf8(temp, PL_encoding);
3190 sv_utf8_upgrade(temp);
3199 tmps2 = SvPV_const(little, llen);
3200 tmps = SvPV_const(big, blen);
3205 if (offset > 0 && big_utf8)
3206 sv_pos_u2b(big, &offset, 0);
3207 offset = offset - arybase + llen;
3211 else if (offset > (I32)blen)
3213 if (!(tmps2 = rninstr(tmps, tmps + offset,
3214 tmps2, tmps2 + llen)))
3217 retval = tmps2 - tmps;
3218 if (retval > 0 && big_utf8)
3219 sv_pos_b2u(big, &retval);
3222 PUSHi(retval + arybase);
3228 dSP; dMARK; dORIGMARK; dTARGET;
3229 do_sprintf(TARG, SP-MARK, MARK+1);
3230 TAINT_IF(SvTAINTED(TARG));
3241 const U8 *s = (U8*)SvPV_const(argsv, len);
3244 if (PL_encoding && SvPOK(argsv) && !DO_UTF8(argsv)) {
3245 tmpsv = sv_2mortal(newSVsv(argsv));
3246 s = (U8*)sv_recode_to_utf8(tmpsv, PL_encoding);
3250 XPUSHu(DO_UTF8(argsv) ?
3251 utf8n_to_uvchr(s, UTF8_MAXBYTES, 0, UTF8_ALLOW_ANYUV) :
3263 if (((SvIOK_notUV(TOPs) && SvIV(TOPs) < 0)
3265 (SvNOK(TOPs) && SvNV(TOPs) < 0.0))) {
3267 value = POPu; /* chr(-1) eq chr(0xff), etc. */
3269 (void) POPs; /* Ignore the argument value. */
3270 value = UNICODE_REPLACEMENT;
3276 SvUPGRADE(TARG,SVt_PV);
3278 if (value > 255 && !IN_BYTES) {
3279 SvGROW(TARG, (STRLEN)UNISKIP(value)+1);
3280 tmps = (char*)uvchr_to_utf8_flags((U8*)SvPVX(TARG), value, 0);
3281 SvCUR_set(TARG, tmps - SvPVX_const(TARG));
3283 (void)SvPOK_only(TARG);
3292 *tmps++ = (char)value;
3294 (void)SvPOK_only(TARG);
3295 if (PL_encoding && !IN_BYTES) {
3296 sv_recode_to_utf8(TARG, PL_encoding);
3298 if (SvCUR(TARG) == 0 || !is_utf8_string((U8*)tmps, SvCUR(TARG)) ||
3299 memEQ(tmps, "\xef\xbf\xbd\0", 4)) {
3303 *tmps++ = (U8)UTF8_EIGHT_BIT_HI(value);
3304 *tmps++ = (U8)UTF8_EIGHT_BIT_LO(value);
3319 const char *tmps = SvPV_const(left, len);
3321 if (DO_UTF8(left)) {
3322 /* If Unicode, try to downgrade.
3323 * If not possible, croak.
3324 * Yes, we made this up. */
3325 SV* const tsv = sv_2mortal(newSVsv(left));
3328 sv_utf8_downgrade(tsv, FALSE);
3329 tmps = SvPV_const(tsv, len);
3331 # ifdef USE_ITHREADS
3333 if (!PL_reentrant_buffer->_crypt_struct_buffer) {
3334 /* This should be threadsafe because in ithreads there is only
3335 * one thread per interpreter. If this would not be true,
3336 * we would need a mutex to protect this malloc. */
3337 PL_reentrant_buffer->_crypt_struct_buffer =
3338 (struct crypt_data *)safemalloc(sizeof(struct crypt_data));
3339 #if defined(__GLIBC__) || defined(__EMX__)
3340 if (PL_reentrant_buffer->_crypt_struct_buffer) {
3341 PL_reentrant_buffer->_crypt_struct_buffer->initialized = 0;
3342 /* work around glibc-2.2.5 bug */
3343 PL_reentrant_buffer->_crypt_struct_buffer->current_saltbits = 0;
3347 # endif /* HAS_CRYPT_R */
3348 # endif /* USE_ITHREADS */
3350 sv_setpv(TARG, fcrypt(tmps, SvPV_nolen_const(right)));
3352 sv_setpv(TARG, PerlProc_crypt(tmps, SvPV_nolen_const(right)));
3358 "The crypt() function is unimplemented due to excessive paranoia.");
3368 const int op_type = PL_op->op_type;
3372 (s = (const U8*)SvPV_nomg_const(sv, slen)) && slen &&
3373 UTF8_IS_START(*s)) {
3374 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
3378 utf8_to_uvchr(s, &ulen);
3379 if (op_type == OP_UCFIRST) {
3380 toTITLE_utf8(s, tmpbuf, &tculen);
3382 toLOWER_utf8(s, tmpbuf, &tculen);
3385 if (!SvPADTMP(sv) || SvREADONLY(sv) || ulen != tculen) {
3387 /* slen is the byte length of the whole SV.
3388 * ulen is the byte length of the original Unicode character
3389 * stored as UTF-8 at s.
3390 * tculen is the byte length of the freshly titlecased (or
3391 * lowercased) Unicode character stored as UTF-8 at tmpbuf.
3392 * We first set the result to be the titlecased (/lowercased)
3393 * character, and then append the rest of the SV data. */
3394 sv_setpvn(TARG, (char*)tmpbuf, tculen);
3396 sv_catpvn(TARG, (char*)(s + ulen), slen - ulen);
3401 s = (U8*)SvPV_force_nomg(sv, slen);
3402 Copy(tmpbuf, s, tculen, U8);
3407 if (!SvPADTMP(sv) || SvREADONLY(sv)) {
3409 SvUTF8_off(TARG); /* decontaminate */
3410 sv_setsv_nomg(TARG, sv);
3414 s1 = (U8*)SvPV_force_nomg(sv, slen);
3416 if (IN_LOCALE_RUNTIME) {
3419 *s1 = (op_type == OP_UCFIRST)
3420 ? toUPPER_LC(*s1) : toLOWER_LC(*s1);
3423 *s1 = (op_type == OP_UCFIRST) ? toUPPER(*s1) : toLOWER(*s1);
3443 U8 tmpbuf[UTF8_MAXBYTES+1];
3445 s = (const U8*)SvPV_nomg_const(sv,len);
3447 SvUTF8_off(TARG); /* decontaminate */
3448 sv_setpvn(TARG, "", 0);
3452 STRLEN min = len + 1;
3454 SvUPGRADE(TARG, SVt_PV);
3456 (void)SvPOK_only(TARG);
3457 d = (U8*)SvPVX(TARG);
3460 STRLEN u = UTF8SKIP(s);
3462 toUPPER_utf8(s, tmpbuf, &ulen);
3463 if (ulen > u && (SvLEN(TARG) < (min += ulen - u))) {
3464 /* If the eventually required minimum size outgrows
3465 * the available space, we need to grow. */
3466 UV o = d - (U8*)SvPVX_const(TARG);
3468 /* If someone uppercases one million U+03B0s we
3469 * SvGROW() one million times. Or we could try
3470 * guessing how much to allocate without allocating
3471 * too much. Such is life. */
3473 d = (U8*)SvPVX(TARG) + o;
3475 Copy(tmpbuf, d, ulen, U8);
3481 SvCUR_set(TARG, d - (U8*)SvPVX_const(TARG));
3487 if (!SvPADTMP(sv) || SvREADONLY(sv)) {
3489 SvUTF8_off(TARG); /* decontaminate */
3490 sv_setsv_nomg(TARG, sv);
3494 s = (U8*)SvPV_force_nomg(sv, len);
3496 register const U8 *send = s + len;
3498 if (IN_LOCALE_RUNTIME) {
3501 for (; s < send; s++)
3502 *s = toUPPER_LC(*s);
3505 for (; s < send; s++)
3527 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
3529 s = (const U8*)SvPV_nomg_const(sv,len);
3531 SvUTF8_off(TARG); /* decontaminate */
3532 sv_setpvn(TARG, "", 0);
3536 STRLEN min = len + 1;
3538 SvUPGRADE(TARG, SVt_PV);
3540 (void)SvPOK_only(TARG);
3541 d = (U8*)SvPVX(TARG);
3544 const STRLEN u = UTF8SKIP(s);
3545 const UV uv = toLOWER_utf8(s, tmpbuf, &ulen);
3547 #define GREEK_CAPITAL_LETTER_SIGMA 0x03A3 /* Unicode U+03A3 */
3548 if (uv == GREEK_CAPITAL_LETTER_SIGMA) {
3550 * Now if the sigma is NOT followed by
3551 * /$ignorable_sequence$cased_letter/;
3552 * and it IS preceded by
3553 * /$cased_letter$ignorable_sequence/;
3554 * where $ignorable_sequence is
3555 * [\x{2010}\x{AD}\p{Mn}]*
3556 * and $cased_letter is
3557 * [\p{Ll}\p{Lo}\p{Lt}]
3558 * then it should be mapped to 0x03C2,
3559 * (GREEK SMALL LETTER FINAL SIGMA),
3560 * instead of staying 0x03A3.
3561 * "should be": in other words,
3562 * this is not implemented yet.
3563 * See lib/unicore/SpecialCasing.txt.
3566 if (ulen > u && (SvLEN(TARG) < (min += ulen - u))) {
3567 /* If the eventually required minimum size outgrows
3568 * the available space, we need to grow. */
3569 UV o = d - (U8*)SvPVX_const(TARG);
3571 /* If someone lowercases one million U+0130s we
3572 * SvGROW() one million times. Or we could try
3573 * guessing how much to allocate without allocating.
3574 * too much. Such is life. */
3576 d = (U8*)SvPVX(TARG) + o;
3578 Copy(tmpbuf, d, ulen, U8);
3584 SvCUR_set(TARG, d - (U8*)SvPVX_const(TARG));
3590 if (!SvPADTMP(sv) || SvREADONLY(sv)) {
3592 SvUTF8_off(TARG); /* decontaminate */
3593 sv_setsv_nomg(TARG, sv);
3598 s = (U8*)SvPV_force_nomg(sv, len);
3600 register const U8 * const send = s + len;
3602 if (IN_LOCALE_RUNTIME) {
3605 for (; s < send; s++)
3606 *s = toLOWER_LC(*s);
3609 for (; s < send; s++)
3621 SV * const sv = TOPs;
3623 register const char *s = SvPV_const(sv,len);
3625 SvUTF8_off(TARG); /* decontaminate */
3628 SvUPGRADE(TARG, SVt_PV);
3629 SvGROW(TARG, (len * 2) + 1);
3633 if (UTF8_IS_CONTINUED(*s)) {
3634 STRLEN ulen = UTF8SKIP(s);
3658 SvCUR_set(TARG, d - SvPVX_const(TARG));
3659 (void)SvPOK_only_UTF8(TARG);
3662 sv_setpvn(TARG, s, len);
3664 if (SvSMAGICAL(TARG))
3673 dSP; dMARK; dORIGMARK;
3674 register AV* const av = (AV*)POPs;
3675 register const I32 lval = (PL_op->op_flags & OPf_MOD || LVRET);
3677 if (SvTYPE(av) == SVt_PVAV) {
3678 const I32 arybase = PL_curcop->cop_arybase;
3679 if (lval && PL_op->op_private & OPpLVAL_INTRO) {
3682 for (svp = MARK + 1; svp <= SP; svp++) {
3683 const I32 elem = SvIVx(*svp);
3687 if (max > AvMAX(av))
3690 while (++MARK <= SP) {
3692 I32 elem = SvIVx(*MARK);
3696 svp = av_fetch(av, elem, lval);
3698 if (!svp || *svp == &PL_sv_undef)
3699 DIE(aTHX_ PL_no_aelem, elem);
3700 if (PL_op->op_private & OPpLVAL_INTRO)
3701 save_aelem(av, elem, svp);
3703 *MARK = svp ? *svp : &PL_sv_undef;
3706 if (GIMME != G_ARRAY) {
3708 *++MARK = SP > ORIGMARK ? *SP : &PL_sv_undef;
3714 /* Associative arrays. */
3719 HV * const hash = (HV*)POPs;
3721 const I32 gimme = GIMME_V;
3724 /* might clobber stack_sp */
3725 entry = hv_iternext(hash);
3730 SV* const sv = hv_iterkeysv(entry);
3731 PUSHs(sv); /* won't clobber stack_sp */
3732 if (gimme == G_ARRAY) {
3735 /* might clobber stack_sp */
3736 val = hv_iterval(hash, entry);
3741 else if (gimme == G_SCALAR)
3750 const I32 gimme = GIMME_V;
3751 const I32 discard = (gimme == G_VOID) ? G_DISCARD : 0;
3753 if (PL_op->op_private & OPpSLICE) {
3755 HV * const hv = (HV*)POPs;
3756 const U32 hvtype = SvTYPE(hv);
3757 if (hvtype == SVt_PVHV) { /* hash element */
3758 while (++MARK <= SP) {
3759 SV * const sv = hv_delete_ent(hv, *MARK, discard, 0);
3760 *MARK = sv ? sv : &PL_sv_undef;
3763 else if (hvtype == SVt_PVAV) { /* array element */
3764 if (PL_op->op_flags & OPf_SPECIAL) {
3765 while (++MARK <= SP) {
3766 SV * const sv = av_delete((AV*)hv, SvIV(*MARK), discard);
3767 *MARK = sv ? sv : &PL_sv_undef;
3772 DIE(aTHX_ "Not a HASH reference");
3775 else if (gimme == G_SCALAR) {
3780 *++MARK = &PL_sv_undef;
3786 HV * const hv = (HV*)POPs;
3788 if (SvTYPE(hv) == SVt_PVHV)
3789 sv = hv_delete_ent(hv, keysv, discard, 0);
3790 else if (SvTYPE(hv) == SVt_PVAV) {
3791 if (PL_op->op_flags & OPf_SPECIAL)
3792 sv = av_delete((AV*)hv, SvIV(keysv), discard);
3794 DIE(aTHX_ "panic: avhv_delete no longer supported");
3797 DIE(aTHX_ "Not a HASH reference");
3812 if (PL_op->op_private & OPpEXISTS_SUB) {
3815 CV * const cv = sv_2cv(sv, &hv, &gv, FALSE);
3818 if (gv && isGV(gv) && GvCV(gv) && !GvCVGEN(gv))
3824 if (SvTYPE(hv) == SVt_PVHV) {
3825 if (hv_exists_ent(hv, tmpsv, 0))
3828 else if (SvTYPE(hv) == SVt_PVAV) {
3829 if (PL_op->op_flags & OPf_SPECIAL) { /* array element */
3830 if (av_exists((AV*)hv, SvIV(tmpsv)))
3835 DIE(aTHX_ "Not a HASH reference");
3842 dSP; dMARK; dORIGMARK;
3843 register HV * const hv = (HV*)POPs;
3844 register const I32 lval = (PL_op->op_flags & OPf_MOD || LVRET);
3845 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
3846 bool other_magic = FALSE;
3852 other_magic = mg_find((SV*)hv, PERL_MAGIC_env) ||
3853 ((mg = mg_find((SV*)hv, PERL_MAGIC_tied))
3854 /* Try to preserve the existenceness of a tied hash
3855 * element by using EXISTS and DELETE if possible.
3856 * Fallback to FETCH and STORE otherwise */
3857 && (stash = SvSTASH(SvRV(SvTIED_obj((SV*)hv, mg))))
3858 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE)
3859 && gv_fetchmethod_autoload(stash, "DELETE", TRUE));
3862 while (++MARK <= SP) {
3863 SV * const keysv = *MARK;
3866 bool preeminent = FALSE;
3869 preeminent = SvRMAGICAL(hv) && !other_magic ? 1 :
3870 hv_exists_ent(hv, keysv, 0);
3873 he = hv_fetch_ent(hv, keysv, lval, 0);
3874 svp = he ? &HeVAL(he) : 0;
3877 if (!svp || *svp == &PL_sv_undef) {
3878 DIE(aTHX_ PL_no_helem_sv, keysv);
3882 save_helem(hv, keysv, svp);
3885 const char *key = SvPV_const(keysv, keylen);
3886 SAVEDELETE(hv, savepvn(key,keylen), keylen);
3890 *MARK = svp ? *svp : &PL_sv_undef;
3892 if (GIMME != G_ARRAY) {
3894 *++MARK = SP > ORIGMARK ? *SP : &PL_sv_undef;
3900 /* List operators. */
3905 if (GIMME != G_ARRAY) {
3907 *MARK = *SP; /* unwanted list, return last item */
3909 *MARK = &PL_sv_undef;
3918 SV ** const lastrelem = PL_stack_sp;
3919 SV ** const lastlelem = PL_stack_base + POPMARK;
3920 SV ** const firstlelem = PL_stack_base + POPMARK + 1;
3921 register SV ** const firstrelem = lastlelem + 1;
3922 const I32 arybase = PL_curcop->cop_arybase;
3923 I32 is_something_there = PL_op->op_flags & OPf_MOD;
3925 register const I32 max = lastrelem - lastlelem;
3926 register SV **lelem;
3928 if (GIMME != G_ARRAY) {
3929 I32 ix = SvIVx(*lastlelem);
3934 if (ix < 0 || ix >= max)
3935 *firstlelem = &PL_sv_undef;
3937 *firstlelem = firstrelem[ix];
3943 SP = firstlelem - 1;
3947 for (lelem = firstlelem; lelem <= lastlelem; lelem++) {
3948 I32 ix = SvIVx(*lelem);
3953 if (ix < 0 || ix >= max)
3954 *lelem = &PL_sv_undef;
3956 is_something_there = TRUE;
3957 if (!(*lelem = firstrelem[ix]))
3958 *lelem = &PL_sv_undef;
3961 if (is_something_there)
3964 SP = firstlelem - 1;
3970 dSP; dMARK; dORIGMARK;
3971 const I32 items = SP - MARK;
3972 SV * const av = sv_2mortal((SV*)av_make(items, MARK+1));
3973 SP = ORIGMARK; /* av_make() might realloc stack_sp */
3980 dSP; dMARK; dORIGMARK;
3981 HV* const hv = (HV*)sv_2mortal((SV*)newHV());
3984 SV * const key = *++MARK;
3985 SV * const val = NEWSV(46, 0);
3987 sv_setsv(val, *++MARK);
3988 else if (ckWARN(WARN_MISC))
3989 Perl_warner(aTHX_ packWARN(WARN_MISC), "Odd number of elements in anonymous hash");
3990 (void)hv_store_ent(hv,key,val,0);
3999 dVAR; dSP; dMARK; dORIGMARK;
4000 register AV *ary = (AV*)*++MARK;
4004 register I32 offset;
4005 register I32 length;
4010 const MAGIC * const mg = SvTIED_mg((SV*)ary, PERL_MAGIC_tied);
4013 *MARK-- = SvTIED_obj((SV*)ary, mg);
4017 call_method("SPLICE",GIMME_V);
4026 offset = i = SvIVx(*MARK);
4028 offset += AvFILLp(ary) + 1;
4030 offset -= PL_curcop->cop_arybase;
4032 DIE(aTHX_ PL_no_aelem, i);
4034 length = SvIVx(*MARK++);
4036 length += AvFILLp(ary) - offset + 1;
4042 length = AvMAX(ary) + 1; /* close enough to infinity */
4046 length = AvMAX(ary) + 1;
4048 if (offset > AvFILLp(ary) + 1) {
4049 if (ckWARN(WARN_MISC))
4050 Perl_warner(aTHX_ packWARN(WARN_MISC), "splice() offset past end of array" );
4051 offset = AvFILLp(ary) + 1;
4053 after = AvFILLp(ary) + 1 - (offset + length);
4054 if (after < 0) { /* not that much array */
4055 length += after; /* offset+length now in array */
4061 /* At this point, MARK .. SP-1 is our new LIST */
4064 diff = newlen - length;
4065 if (newlen && !AvREAL(ary) && AvREIFY(ary))
4068 /* make new elements SVs now: avoid problems if they're from the array */
4069 for (dst = MARK, i = newlen; i; i--) {
4070 SV * const h = *dst;
4071 *dst++ = newSVsv(h);
4074 if (diff < 0) { /* shrinking the area */
4076 Newx(tmparyval, newlen, SV*); /* so remember insertion */
4077 Copy(MARK, tmparyval, newlen, SV*);
4080 MARK = ORIGMARK + 1;
4081 if (GIMME == G_ARRAY) { /* copy return vals to stack */
4082 MEXTEND(MARK, length);
4083 Copy(AvARRAY(ary)+offset, MARK, length, SV*);
4085 EXTEND_MORTAL(length);
4086 for (i = length, dst = MARK; i; i--) {
4087 sv_2mortal(*dst); /* free them eventualy */
4094 *MARK = AvARRAY(ary)[offset+length-1];
4097 for (i = length - 1, dst = &AvARRAY(ary)[offset]; i > 0; i--)
4098 SvREFCNT_dec(*dst++); /* free them now */
4101 AvFILLp(ary) += diff;
4103 /* pull up or down? */
4105 if (offset < after) { /* easier to pull up */
4106 if (offset) { /* esp. if nothing to pull */
4107 src = &AvARRAY(ary)[offset-1];
4108 dst = src - diff; /* diff is negative */
4109 for (i = offset; i > 0; i--) /* can't trust Copy */
4113 SvPV_set(ary, (char*)(AvARRAY(ary) - diff)); /* diff is negative */
4117 if (after) { /* anything to pull down? */
4118 src = AvARRAY(ary) + offset + length;
4119 dst = src + diff; /* diff is negative */
4120 Move(src, dst, after, SV*);
4122 dst = &AvARRAY(ary)[AvFILLp(ary)+1];
4123 /* avoid later double free */
4127 dst[--i] = &PL_sv_undef;
4130 Copy( tmparyval, AvARRAY(ary) + offset, newlen, SV* );
4131 Safefree(tmparyval);
4134 else { /* no, expanding (or same) */
4136 Newx(tmparyval, length, SV*); /* so remember deletion */
4137 Copy(AvARRAY(ary)+offset, tmparyval, length, SV*);
4140 if (diff > 0) { /* expanding */
4142 /* push up or down? */
4144 if (offset < after && diff <= AvARRAY(ary) - AvALLOC(ary)) {
4148 Move(src, dst, offset, SV*);
4150 SvPV_set(ary, (char*)(AvARRAY(ary) - diff));/* diff is positive */
4152 AvFILLp(ary) += diff;
4155 if (AvFILLp(ary) + diff >= AvMAX(ary)) /* oh, well */
4156 av_extend(ary, AvFILLp(ary) + diff);
4157 AvFILLp(ary) += diff;
4160 dst = AvARRAY(ary) + AvFILLp(ary);
4162 for (i = after; i; i--) {
4170 Copy( MARK, AvARRAY(ary) + offset, newlen, SV* );
4173 MARK = ORIGMARK + 1;
4174 if (GIMME == G_ARRAY) { /* copy return vals to stack */
4176 Copy(tmparyval, MARK, length, SV*);
4178 EXTEND_MORTAL(length);
4179 for (i = length, dst = MARK; i; i--) {
4180 sv_2mortal(*dst); /* free them eventualy */
4184 Safefree(tmparyval);
4188 else if (length--) {
4189 *MARK = tmparyval[length];
4192 while (length-- > 0)
4193 SvREFCNT_dec(tmparyval[length]);
4195 Safefree(tmparyval);
4198 *MARK = &PL_sv_undef;
4206 dVAR; dSP; dMARK; dORIGMARK; dTARGET;
4207 register AV *ary = (AV*)*++MARK;
4208 const MAGIC * const mg = SvTIED_mg((SV*)ary, PERL_MAGIC_tied);
4211 *MARK-- = SvTIED_obj((SV*)ary, mg);
4215 call_method("PUSH",G_SCALAR|G_DISCARD);
4219 PUSHi( AvFILL(ary) + 1 );
4222 for (++MARK; MARK <= SP; MARK++) {
4223 SV * const sv = NEWSV(51, 0);
4225 sv_setsv(sv, *MARK);
4226 av_store(ary, AvFILLp(ary)+1, sv);
4229 PUSHi( AvFILLp(ary) + 1 );
4237 AV * const av = (AV*)POPs;
4238 SV * const sv = av_pop(av);
4240 (void)sv_2mortal(sv);
4248 AV * const av = (AV*)POPs;
4249 SV * const sv = av_shift(av);
4254 (void)sv_2mortal(sv);
4261 dVAR; dSP; dMARK; dORIGMARK; dTARGET;
4262 register AV *ary = (AV*)*++MARK;
4263 const MAGIC * const mg = SvTIED_mg((SV*)ary, PERL_MAGIC_tied);
4266 *MARK-- = SvTIED_obj((SV*)ary, mg);
4270 call_method("UNSHIFT",G_SCALAR|G_DISCARD);
4276 av_unshift(ary, SP - MARK);
4278 SV * const sv = newSVsv(*++MARK);
4279 (void)av_store(ary, i++, sv);
4283 PUSHi( AvFILL(ary) + 1 );
4290 SV ** const oldsp = SP;
4292 if (GIMME == G_ARRAY) {
4295 register SV * const tmp = *MARK;
4299 /* safe as long as stack cannot get extended in the above */
4304 register char *down;
4310 SvUTF8_off(TARG); /* decontaminate */
4312 do_join(TARG, &PL_sv_no, MARK, SP);
4314 sv_setsv(TARG, (SP > MARK)
4316 : (padoff_du = find_rundefsvoffset(),
4317 (padoff_du == NOT_IN_PAD || PAD_COMPNAME_FLAGS(padoff_du) & SVpad_OUR)
4318 ? DEFSV : PAD_SVl(padoff_du)));
4319 up = SvPV_force(TARG, len);
4321 if (DO_UTF8(TARG)) { /* first reverse each character */
4322 U8* s = (U8*)SvPVX(TARG);
4323 const U8* send = (U8*)(s + len);
4325 if (UTF8_IS_INVARIANT(*s)) {
4330 if (!utf8_to_uvchr(s, 0))
4334 down = (char*)(s - 1);
4335 /* reverse this character */
4339 *down-- = (char)tmp;
4345 down = SvPVX(TARG) + len - 1;
4349 *down-- = (char)tmp;
4351 (void)SvPOK_only_UTF8(TARG);
4363 register IV limit = POPi; /* note, negative is forever */
4364 SV * const sv = POPs;
4366 register const char *s = SvPV_const(sv, len);
4367 const bool do_utf8 = DO_UTF8(sv);
4368 const char *strend = s + len;
4370 register REGEXP *rx;
4372 register const char *m;
4374 const STRLEN slen = do_utf8 ? utf8_length((U8*)s, (U8*)strend) : (strend - s);
4375 I32 maxiters = slen + 10;
4377 const I32 origlimit = limit;
4380 const I32 gimme = GIMME_V;
4381 const I32 oldsave = PL_savestack_ix;
4382 I32 make_mortal = 1;
4384 MAGIC *mg = (MAGIC *) NULL;
4387 Copy(&LvTARGOFF(POPs), &pm, 1, PMOP*);
4392 DIE(aTHX_ "panic: pp_split");
4395 TAINT_IF((pm->op_pmflags & PMf_LOCALE) &&
4396 (pm->op_pmflags & (PMf_WHITE | PMf_SKIPWHITE)));
4398 RX_MATCH_UTF8_set(rx, do_utf8);
4400 if (pm->op_pmreplroot) {
4402 ary = GvAVn((GV*)PAD_SVl(INT2PTR(PADOFFSET, pm->op_pmreplroot)));
4404 ary = GvAVn((GV*)pm->op_pmreplroot);
4407 else if (gimme != G_ARRAY)
4408 ary = GvAVn(PL_defgv);
4411 if (ary && (gimme != G_ARRAY || (pm->op_pmflags & PMf_ONCE))) {
4417 if ((mg = SvTIED_mg((SV*)ary, PERL_MAGIC_tied))) {
4419 XPUSHs(SvTIED_obj((SV*)ary, mg));
4426 for (i = AvFILLp(ary); i >= 0; i--)
4427 AvARRAY(ary)[i] = &PL_sv_undef; /* don't free mere refs */
4429 /* temporarily switch stacks */
4430 SAVESWITCHSTACK(PL_curstack, ary);
4434 base = SP - PL_stack_base;
4436 if (pm->op_pmflags & PMf_SKIPWHITE) {
4437 if (pm->op_pmflags & PMf_LOCALE) {
4438 while (isSPACE_LC(*s))
4446 if (pm->op_pmflags & PMf_MULTILINE) {
4451 limit = maxiters + 2;
4452 if (pm->op_pmflags & PMf_WHITE) {
4455 while (m < strend &&
4456 !((pm->op_pmflags & PMf_LOCALE)
4457 ? isSPACE_LC(*m) : isSPACE(*m)))
4462 dstr = newSVpvn(s, m-s);
4466 (void)SvUTF8_on(dstr);
4470 while (s < strend &&
4471 ((pm->op_pmflags & PMf_LOCALE)
4472 ? isSPACE_LC(*s) : isSPACE(*s)))
4476 else if (rx->precomp[0] == '^' && rx->precomp[1] == '\0') {
4478 for (m = s; m < strend && *m != '\n'; m++)
4483 dstr = newSVpvn(s, m-s);
4487 (void)SvUTF8_on(dstr);
4492 else if (do_utf8 == ((rx->reganch & ROPT_UTF8) != 0) &&
4493 (rx->reganch & RE_USE_INTUIT) && !rx->nparens
4494 && (rx->reganch & ROPT_CHECK_ALL)
4495 && !(rx->reganch & ROPT_ANCH)) {
4496 const int tail = (rx->reganch & RE_INTUIT_TAIL);
4497 SV * const csv = CALLREG_INTUIT_STRING(aTHX_ rx);
4500 if (len == 1 && !(rx->reganch & ROPT_UTF8) && !tail) {
4501 const char c = *SvPV_nolen_const(csv);
4503 for (m = s; m < strend && *m != c; m++)
4507 dstr = newSVpvn(s, m-s);
4511 (void)SvUTF8_on(dstr);
4513 /* The rx->minlen is in characters but we want to step
4514 * s ahead by bytes. */
4516 s = (char*)utf8_hop((U8*)m, len);
4518 s = m + len; /* Fake \n at the end */
4522 while (s < strend && --limit &&
4523 (m = fbm_instr((unsigned char*)s, (unsigned char*)strend,
4524 csv, multiline ? FBMrf_MULTILINE : 0)) )
4526 dstr = newSVpvn(s, m-s);
4530 (void)SvUTF8_on(dstr);
4532 /* The rx->minlen is in characters but we want to step
4533 * s ahead by bytes. */
4535 s = (char*)utf8_hop((U8*)m, len);
4537 s = m + len; /* Fake \n at the end */
4542 maxiters += slen * rx->nparens;
4543 while (s < strend && --limit)
4547 rex_return = CALLREGEXEC(aTHX_ rx, (char*)s, (char*)strend, (char*)orig, 1 ,
4550 if (rex_return == 0)
4552 TAINT_IF(RX_MATCH_TAINTED(rx));
4553 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
4558 strend = s + (strend - m);
4560 m = rx->startp[0] + orig;
4561 dstr = newSVpvn(s, m-s);
4565 (void)SvUTF8_on(dstr);
4569 for (i = 1; i <= (I32)rx->nparens; i++) {
4570 s = rx->startp[i] + orig;
4571 m = rx->endp[i] + orig;
4573 /* japhy (07/27/01) -- the (m && s) test doesn't catch
4574 parens that didn't match -- they should be set to
4575 undef, not the empty string */
4576 if (m >= orig && s >= orig) {
4577 dstr = newSVpvn(s, m-s);
4580 dstr = &PL_sv_undef; /* undef, not "" */
4584 (void)SvUTF8_on(dstr);
4588 s = rx->endp[0] + orig;
4592 iters = (SP - PL_stack_base) - base;
4593 if (iters > maxiters)
4594 DIE(aTHX_ "Split loop");
4596 /* keep field after final delim? */
4597 if (s < strend || (iters && origlimit)) {
4598 const STRLEN l = strend - s;
4599 dstr = newSVpvn(s, l);
4603 (void)SvUTF8_on(dstr);
4607 else if (!origlimit) {
4608 while (iters > 0 && (!TOPs || !SvANY(TOPs) || SvCUR(TOPs) == 0)) {
4609 if (TOPs && !make_mortal)
4612 *SP-- = &PL_sv_undef;
4617 LEAVE_SCOPE(oldsave); /* may undo an earlier SWITCHSTACK */
4621 if (SvSMAGICAL(ary)) {
4626 if (gimme == G_ARRAY) {
4628 Copy(AvARRAY(ary), SP + 1, iters, SV*);
4636 call_method("PUSH",G_SCALAR|G_DISCARD);
4639 if (gimme == G_ARRAY) {
4641 /* EXTEND should not be needed - we just popped them */
4643 for (i=0; i < iters; i++) {
4644 SV **svp = av_fetch(ary, i, FALSE);
4645 PUSHs((svp) ? *svp : &PL_sv_undef);
4652 if (gimme == G_ARRAY)
4667 if (SvTYPE(retsv) == SVt_PVAV || SvTYPE(retsv) == SVt_PVHV
4668 || SvTYPE(retsv) == SVt_PVCV) {
4669 retsv = refto(retsv);
4676 PP(unimplemented_op)
4678 DIE(aTHX_ "panic: unimplemented op %s (#%d) called", OP_NAME(PL_op),
4684 * c-indentation-style: bsd
4686 * indent-tabs-mode: t
4689 * ex: set ts=8 sts=4 sw=4 noet: