3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, 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 */
52 if (GIMME_V == G_SCALAR)
63 if (PL_op->op_private & OPpLVAL_INTRO)
64 SAVECLEARSV(PAD_SVl(PL_op->op_targ));
66 if (PL_op->op_flags & OPf_REF) {
70 if (GIMME == G_SCALAR)
71 Perl_croak(aTHX_ "Can't return array to lvalue scalar context");
76 if (gimme == G_ARRAY) {
77 const I32 maxarg = AvFILL((AV*)TARG) + 1;
79 if (SvMAGICAL(TARG)) {
81 for (i=0; i < (U32)maxarg; i++) {
82 SV * const * const svp = av_fetch((AV*)TARG, i, FALSE);
83 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
87 Copy(AvARRAY((AV*)TARG), SP+1, maxarg, SV*);
91 else if (gimme == G_SCALAR) {
92 SV* const sv = sv_newmortal();
93 const I32 maxarg = AvFILL((AV*)TARG) + 1;
106 if (PL_op->op_private & OPpLVAL_INTRO)
107 SAVECLEARSV(PAD_SVl(PL_op->op_targ));
108 if (PL_op->op_flags & OPf_REF)
111 if (GIMME == G_SCALAR)
112 Perl_croak(aTHX_ "Can't return hash to lvalue scalar context");
116 if (gimme == G_ARRAY) {
119 else if (gimme == G_SCALAR) {
120 SV* const sv = Perl_hv_scalar(aTHX_ (HV*)TARG);
134 tryAMAGICunDEREF(to_gv);
137 if (SvTYPE(sv) == SVt_PVIO) {
138 GV * const gv = (GV*) sv_newmortal();
139 gv_init(gv, 0, "", 0, 0);
140 GvIOp(gv) = (IO *)sv;
141 (void)SvREFCNT_inc(sv);
144 else if (SvTYPE(sv) != SVt_PVGV)
145 DIE(aTHX_ "Not a GLOB reference");
148 if (SvTYPE(sv) != SVt_PVGV) {
149 if (SvGMAGICAL(sv)) {
154 if (!SvOK(sv) && sv != &PL_sv_undef) {
155 /* If this is a 'my' scalar and flag is set then vivify
159 Perl_croak(aTHX_ PL_no_modify);
160 if (PL_op->op_private & OPpDEREF) {
162 if (cUNOP->op_targ) {
164 SV * const namesv = PAD_SV(cUNOP->op_targ);
165 const char * const name = SvPV(namesv, len);
167 gv_init(gv, CopSTASH(PL_curcop), name, len, 0);
170 const char * const name = CopSTASHPV(PL_curcop);
173 if (SvTYPE(sv) < SVt_RV)
174 sv_upgrade(sv, SVt_RV);
175 if (SvPVX_const(sv)) {
180 SvRV_set(sv, (SV*)gv);
185 if (PL_op->op_flags & OPf_REF ||
186 PL_op->op_private & HINT_STRICT_REFS)
187 DIE(aTHX_ PL_no_usym, "a symbol");
188 if (ckWARN(WARN_UNINITIALIZED))
192 if ((PL_op->op_flags & OPf_SPECIAL) &&
193 !(PL_op->op_flags & OPf_MOD))
195 SV * const temp = (SV*)gv_fetchsv(sv, 0, SVt_PVGV);
197 && (!is_gv_magical_sv(sv,0)
198 || !(sv = (SV*)gv_fetchsv(sv, GV_ADD, SVt_PVGV)))) {
204 if (PL_op->op_private & HINT_STRICT_REFS)
205 DIE(aTHX_ PL_no_symref_sv, sv, "a symbol");
206 if ((PL_op->op_private & (OPpLVAL_INTRO|OPpDONT_INIT_GV))
207 == OPpDONT_INIT_GV) {
208 /* We are the target of a coderef assignment. Return
209 the scalar unchanged, and let pp_sasssign deal with
213 sv = (SV*)gv_fetchsv(sv, GV_ADD, SVt_PVGV);
217 if (PL_op->op_private & OPpLVAL_INTRO)
218 save_gp((GV*)sv, !(PL_op->op_flags & OPf_SPECIAL));
230 tryAMAGICunDEREF(to_sv);
233 switch (SvTYPE(sv)) {
237 DIE(aTHX_ "Not a SCALAR reference");
243 if (SvTYPE(gv) != SVt_PVGV) {
244 if (SvGMAGICAL(sv)) {
249 if (PL_op->op_private & HINT_STRICT_REFS) {
251 DIE(aTHX_ PL_no_symref_sv, sv, "a SCALAR");
253 DIE(aTHX_ PL_no_usym, "a SCALAR");
256 if (PL_op->op_flags & OPf_REF)
257 DIE(aTHX_ PL_no_usym, "a SCALAR");
258 if (ckWARN(WARN_UNINITIALIZED))
262 if ((PL_op->op_flags & OPf_SPECIAL) &&
263 !(PL_op->op_flags & OPf_MOD))
265 gv = (GV*)gv_fetchsv(sv, 0, SVt_PV);
267 && (!is_gv_magical_sv(sv, 0)
268 || !(gv = (GV*)gv_fetchsv(sv, GV_ADD, SVt_PV))))
274 gv = (GV*)gv_fetchsv(sv, GV_ADD, SVt_PV);
279 if (PL_op->op_flags & OPf_MOD) {
280 if (PL_op->op_private & OPpLVAL_INTRO) {
281 if (cUNOP->op_first->op_type == OP_NULL)
282 sv = save_scalar((GV*)TOPs);
284 sv = save_scalar(gv);
286 Perl_croak(aTHX_ PL_no_localize_ref);
288 else if (PL_op->op_private & OPpDEREF)
289 vivify_ref(sv, PL_op->op_private & OPpDEREF);
298 AV * const av = (AV*)TOPs;
299 SV ** const sv = Perl_av_arylen_p(aTHX_ (AV*)av);
302 sv_upgrade(*sv, SVt_PVMG);
303 sv_magic(*sv, (SV*)av, PERL_MAGIC_arylen, NULL, 0);
311 dVAR; dSP; dTARGET; dPOPss;
313 if (PL_op->op_flags & OPf_MOD || LVRET) {
314 if (SvTYPE(TARG) < SVt_PVLV) {
315 sv_upgrade(TARG, SVt_PVLV);
316 sv_magic(TARG, NULL, PERL_MAGIC_pos, NULL, 0);
320 if (LvTARG(TARG) != sv) {
322 SvREFCNT_dec(LvTARG(TARG));
323 LvTARG(TARG) = SvREFCNT_inc(sv);
325 PUSHs(TARG); /* no SvSETMAGIC */
329 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
330 const MAGIC * const mg = mg_find(sv, PERL_MAGIC_regex_global);
331 if (mg && mg->mg_len >= 0) {
335 PUSHi(i + PL_curcop->cop_arybase);
348 const I32 flags = (PL_op->op_flags & OPf_SPECIAL)
350 : ((PL_op->op_private & (OPpLVAL_INTRO|OPpMAY_RETURN_CONSTANT)) == OPpMAY_RETURN_CONSTANT)
353 /* We usually try to add a non-existent subroutine in case of AUTOLOAD. */
354 /* (But not in defined().) */
356 CV *cv = sv_2cv(TOPs, &stash, &gv, flags);
359 cv = (CV*)sv_2mortal((SV*)cv_clone(cv));
360 if ((PL_op->op_private & OPpLVAL_INTRO)) {
361 if (gv && GvCV(gv) == cv && (gv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv), FALSE)))
364 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
367 else if ((flags == (GV_ADD|GV_NOEXPAND)) && gv && SvROK(gv)) {
371 cv = (CV*)&PL_sv_undef;
382 SV *ret = &PL_sv_undef;
384 if (SvPOK(TOPs) && SvCUR(TOPs) >= 7) {
385 const char * const s = SvPVX_const(TOPs);
386 if (strnEQ(s, "CORE::", 6)) {
387 const int code = keyword(s + 6, SvCUR(TOPs) - 6);
388 if (code < 0) { /* Overridable. */
389 #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2)
390 int i = 0, n = 0, seen_question = 0;
392 char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */
394 if (code == -KEY_chop || code == -KEY_chomp
395 || code == -KEY_exec || code == -KEY_system)
397 while (i < MAXO) { /* The slow way. */
398 if (strEQ(s + 6, PL_op_name[i])
399 || strEQ(s + 6, PL_op_desc[i]))
405 goto nonesuch; /* Should not happen... */
407 oa = PL_opargs[i] >> OASHIFT;
409 if (oa & OA_OPTIONAL && !seen_question) {
413 if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF
414 && (oa & (OA_OPTIONAL - 1)) <= OA_SCALARREF
415 /* But globs are already references (kinda) */
416 && (oa & (OA_OPTIONAL - 1)) != OA_FILEREF
420 str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)];
424 ret = sv_2mortal(newSVpvn(str, n - 1));
426 else if (code) /* Non-Overridable */
428 else { /* None such */
430 DIE(aTHX_ "Can't find an opnumber for \"%s\"", s+6);
434 cv = sv_2cv(TOPs, &stash, &gv, 0);
436 ret = sv_2mortal(newSVpvn(SvPVX_const(cv), SvCUR(cv)));
445 CV* cv = (CV*)PAD_SV(PL_op->op_targ);
447 cv = (CV*)sv_2mortal((SV*)cv_clone(cv));
463 if (GIMME != G_ARRAY) {
467 *MARK = &PL_sv_undef;
468 *MARK = refto(*MARK);
472 EXTEND_MORTAL(SP - MARK);
474 *MARK = refto(*MARK);
479 S_refto(pTHX_ SV *sv)
484 if (SvTYPE(sv) == SVt_PVLV && LvTYPE(sv) == 'y') {
487 if (!(sv = LvTARG(sv)))
490 (void)SvREFCNT_inc(sv);
492 else if (SvTYPE(sv) == SVt_PVAV) {
493 if (!AvREAL((AV*)sv) && AvREIFY((AV*)sv))
496 (void)SvREFCNT_inc(sv);
498 else if (SvPADTMP(sv) && !IS_PADGV(sv))
502 (void)SvREFCNT_inc(sv);
505 sv_upgrade(rv, SVt_RV);
515 SV * const sv = POPs;
520 if (!sv || !SvROK(sv))
523 pv = sv_reftype(SvRV(sv),TRUE);
524 PUSHp(pv, strlen(pv));
534 stash = CopSTASH(PL_curcop);
536 SV * const ssv = POPs;
540 if (ssv && !SvGMAGICAL(ssv) && !SvAMAGIC(ssv) && SvROK(ssv))
541 Perl_croak(aTHX_ "Attempt to bless into a reference");
542 ptr = SvPV_const(ssv,len);
543 if (len == 0 && ckWARN(WARN_MISC))
544 Perl_warner(aTHX_ packWARN(WARN_MISC),
545 "Explicit blessing to '' (assuming package main)");
546 stash = gv_stashpvn(ptr, len, TRUE);
549 (void)sv_bless(TOPs, stash);
558 const char * const elem = SvPV_nolen_const(sv);
559 GV * const gv = (GV*)POPs;
564 /* elem will always be NUL terminated. */
565 const char * const second_letter = elem + 1;
568 if (strEQ(second_letter, "RRAY"))
569 tmpRef = (SV*)GvAV(gv);
572 if (strEQ(second_letter, "ODE"))
573 tmpRef = (SV*)GvCVu(gv);
576 if (strEQ(second_letter, "ILEHANDLE")) {
577 /* finally deprecated in 5.8.0 */
578 deprecate("*glob{FILEHANDLE}");
579 tmpRef = (SV*)GvIOp(gv);
582 if (strEQ(second_letter, "ORMAT"))
583 tmpRef = (SV*)GvFORM(gv);
586 if (strEQ(second_letter, "LOB"))
590 if (strEQ(second_letter, "ASH"))
591 tmpRef = (SV*)GvHV(gv);
594 if (*second_letter == 'O' && !elem[2])
595 tmpRef = (SV*)GvIOp(gv);
598 if (strEQ(second_letter, "AME"))
599 sv = newSVpvn(GvNAME(gv), GvNAMELEN(gv));
602 if (strEQ(second_letter, "ACKAGE")) {
603 const HV * const stash = GvSTASH(gv);
604 const HEK * const hek = stash ? HvNAME_HEK(stash) : NULL;
605 sv = hek ? newSVhek(hek) : newSVpvs("__ANON__");
609 if (strEQ(second_letter, "CALAR"))
624 /* Pattern matching */
629 register unsigned char *s;
632 register I32 *sfirst;
636 if (sv == PL_lastscream) {
642 SvSCREAM_off(PL_lastscream);
643 SvREFCNT_dec(PL_lastscream);
645 PL_lastscream = SvREFCNT_inc(sv);
648 s = (unsigned char*)(SvPV(sv, len));
652 if (pos > PL_maxscream) {
653 if (PL_maxscream < 0) {
654 PL_maxscream = pos + 80;
655 Newx(PL_screamfirst, 256, I32);
656 Newx(PL_screamnext, PL_maxscream, I32);
659 PL_maxscream = pos + pos / 4;
660 Renew(PL_screamnext, PL_maxscream, I32);
664 sfirst = PL_screamfirst;
665 snext = PL_screamnext;
667 if (!sfirst || !snext)
668 DIE(aTHX_ "do_study: out of memory");
670 for (ch = 256; ch; --ch)
675 register const I32 ch = s[pos];
677 snext[pos] = sfirst[ch] - pos;
684 /* piggyback on m//g magic */
685 sv_magic(sv, NULL, PERL_MAGIC_regex_global, NULL, 0);
694 if (PL_op->op_flags & OPf_STACKED)
696 else if (PL_op->op_private & OPpTARGET_MY)
702 TARG = sv_newmortal();
707 /* Lvalue operators. */
719 dVAR; dSP; dMARK; dTARGET; dORIGMARK;
721 do_chop(TARG, *++MARK);
730 SETi(do_chomp(TOPs));
736 dVAR; dSP; dMARK; dTARGET;
737 register I32 count = 0;
740 count += do_chomp(POPs);
750 if (!PL_op->op_private) {
759 SV_CHECK_THINKFIRST_COW_DROP(sv);
761 switch (SvTYPE(sv)) {
771 if (cv_const_sv((CV*)sv) && ckWARN(WARN_MISC))
772 Perl_warner(aTHX_ packWARN(WARN_MISC), "Constant subroutine %s undefined",
773 CvANON((CV*)sv) ? "(anonymous)" : GvENAME(CvGV((CV*)sv)));
777 /* let user-undef'd sub keep its identity */
778 GV* const gv = CvGV((CV*)sv);
785 SvSetMagicSV(sv, &PL_sv_undef);
790 GvGP(sv) = gp_ref(gp);
792 GvLINE(sv) = CopLINE(PL_curcop);
798 if (SvTYPE(sv) >= SVt_PV && SvPVX_const(sv) && SvLEN(sv)) {
813 if (SvTYPE(TOPs) >= SVt_PVGV && SvTYPE(TOPs) != SVt_PVLV)
814 DIE(aTHX_ PL_no_modify);
815 if (!SvREADONLY(TOPs) && SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)
816 && SvIVX(TOPs) != IV_MIN)
818 SvIV_set(TOPs, SvIVX(TOPs) - 1);
819 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
830 if (SvTYPE(TOPs) >= SVt_PVGV && SvTYPE(TOPs) != SVt_PVLV)
831 DIE(aTHX_ PL_no_modify);
832 sv_setsv(TARG, TOPs);
833 if (!SvREADONLY(TOPs) && SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)
834 && SvIVX(TOPs) != IV_MAX)
836 SvIV_set(TOPs, SvIVX(TOPs) + 1);
837 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
842 /* special case for undef: see thread at 2003-03/msg00536.html in archive */
852 if (SvTYPE(TOPs) >= SVt_PVGV && SvTYPE(TOPs) != SVt_PVLV)
853 DIE(aTHX_ PL_no_modify);
854 sv_setsv(TARG, TOPs);
855 if (!SvREADONLY(TOPs) && SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)
856 && SvIVX(TOPs) != IV_MIN)
858 SvIV_set(TOPs, SvIVX(TOPs) - 1);
859 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
868 /* Ordinary operators. */
873 #ifdef PERL_PRESERVE_IVUV
876 tryAMAGICbin(pow,opASSIGN);
877 #ifdef PERL_PRESERVE_IVUV
878 /* For integer to integer power, we do the calculation by hand wherever
879 we're sure it is safe; otherwise we call pow() and try to convert to
880 integer afterwards. */
893 const IV iv = SvIVX(TOPs);
897 goto float_it; /* Can't do negative powers this way. */
901 baseuok = SvUOK(TOPm1s);
903 baseuv = SvUVX(TOPm1s);
905 const IV iv = SvIVX(TOPm1s);
908 baseuok = TRUE; /* effectively it's a UV now */
910 baseuv = -iv; /* abs, baseuok == false records sign */
913 /* now we have integer ** positive integer. */
916 /* foo & (foo - 1) is zero only for a power of 2. */
917 if (!(baseuv & (baseuv - 1))) {
918 /* We are raising power-of-2 to a positive integer.
919 The logic here will work for any base (even non-integer
920 bases) but it can be less accurate than
921 pow (base,power) or exp (power * log (base)) when the
922 intermediate values start to spill out of the mantissa.
923 With powers of 2 we know this can't happen.
924 And powers of 2 are the favourite thing for perl
925 programmers to notice ** not doing what they mean. */
927 NV base = baseuok ? baseuv : -(NV)baseuv;
932 while (power >>= 1) {
943 register unsigned int highbit = 8 * sizeof(UV);
944 register unsigned int diff = 8 * sizeof(UV);
947 if (baseuv >> highbit) {
951 /* we now have baseuv < 2 ** highbit */
952 if (power * highbit <= 8 * sizeof(UV)) {
953 /* result will definitely fit in UV, so use UV math
954 on same algorithm as above */
955 register UV result = 1;
956 register UV base = baseuv;
957 const bool odd_power = (bool)(power & 1);
961 while (power >>= 1) {
968 if (baseuok || !odd_power)
969 /* answer is positive */
971 else if (result <= (UV)IV_MAX)
972 /* answer negative, fits in IV */
974 else if (result == (UV)IV_MIN)
975 /* 2's complement assumption: special case IV_MIN */
978 /* answer negative, doesn't fit */
990 SETn( Perl_pow( left, right) );
991 #ifdef PERL_PRESERVE_IVUV
1001 dVAR; dSP; dATARGET; tryAMAGICbin(mult,opASSIGN);
1002 #ifdef PERL_PRESERVE_IVUV
1005 /* Unless the left argument is integer in range we are going to have to
1006 use NV maths. Hence only attempt to coerce the right argument if
1007 we know the left is integer. */
1008 /* Left operand is defined, so is it IV? */
1009 SvIV_please(TOPm1s);
1010 if (SvIOK(TOPm1s)) {
1011 bool auvok = SvUOK(TOPm1s);
1012 bool buvok = SvUOK(TOPs);
1013 const UV topmask = (~ (UV)0) << (4 * sizeof (UV));
1014 const UV botmask = ~((~ (UV)0) << (4 * sizeof (UV)));
1021 alow = SvUVX(TOPm1s);
1023 const IV aiv = SvIVX(TOPm1s);
1026 auvok = TRUE; /* effectively it's a UV now */
1028 alow = -aiv; /* abs, auvok == false records sign */
1034 const IV biv = SvIVX(TOPs);
1037 buvok = TRUE; /* effectively it's a UV now */
1039 blow = -biv; /* abs, buvok == false records sign */
1043 /* If this does sign extension on unsigned it's time for plan B */
1044 ahigh = alow >> (4 * sizeof (UV));
1046 bhigh = blow >> (4 * sizeof (UV));
1048 if (ahigh && bhigh) {
1049 /* eg 32 bit is at least 0x10000 * 0x10000 == 0x100000000
1050 which is overflow. Drop to NVs below. */
1051 } else if (!ahigh && !bhigh) {
1052 /* eg 32 bit is at most 0xFFFF * 0xFFFF == 0xFFFE0001
1053 so the unsigned multiply cannot overflow. */
1054 const UV product = alow * blow;
1055 if (auvok == buvok) {
1056 /* -ve * -ve or +ve * +ve gives a +ve result. */
1060 } else if (product <= (UV)IV_MIN) {
1061 /* 2s complement assumption that (UV)-IV_MIN is correct. */
1062 /* -ve result, which could overflow an IV */
1064 SETi( -(IV)product );
1066 } /* else drop to NVs below. */
1068 /* One operand is large, 1 small */
1071 /* swap the operands */
1073 bhigh = blow; /* bhigh now the temp var for the swap */
1077 /* now, ((ahigh * blow) << half_UV_len) + (alow * blow)
1078 multiplies can't overflow. shift can, add can, -ve can. */
1079 product_middle = ahigh * blow;
1080 if (!(product_middle & topmask)) {
1081 /* OK, (ahigh * blow) won't lose bits when we shift it. */
1083 product_middle <<= (4 * sizeof (UV));
1084 product_low = alow * blow;
1086 /* as for pp_add, UV + something mustn't get smaller.
1087 IIRC ANSI mandates this wrapping *behaviour* for
1088 unsigned whatever the actual representation*/
1089 product_low += product_middle;
1090 if (product_low >= product_middle) {
1091 /* didn't overflow */
1092 if (auvok == buvok) {
1093 /* -ve * -ve or +ve * +ve gives a +ve result. */
1095 SETu( product_low );
1097 } else if (product_low <= (UV)IV_MIN) {
1098 /* 2s complement assumption again */
1099 /* -ve result, which could overflow an IV */
1101 SETi( -(IV)product_low );
1103 } /* else drop to NVs below. */
1105 } /* product_middle too large */
1106 } /* ahigh && bhigh */
1107 } /* SvIOK(TOPm1s) */
1112 SETn( left * right );
1119 dVAR; dSP; dATARGET; tryAMAGICbin(div,opASSIGN);
1120 /* Only try to do UV divide first
1121 if ((SLOPPYDIVIDE is true) or
1122 (PERL_PRESERVE_IVUV is true and one or both SV is a UV too large
1124 The assumption is that it is better to use floating point divide
1125 whenever possible, only doing integer divide first if we can't be sure.
1126 If NV_PRESERVES_UV is true then we know at compile time that no UV
1127 can be too large to preserve, so don't need to compile the code to
1128 test the size of UVs. */
1131 # define PERL_TRY_UV_DIVIDE
1132 /* ensure that 20./5. == 4. */
1134 # ifdef PERL_PRESERVE_IVUV
1135 # ifndef NV_PRESERVES_UV
1136 # define PERL_TRY_UV_DIVIDE
1141 #ifdef PERL_TRY_UV_DIVIDE
1144 SvIV_please(TOPm1s);
1145 if (SvIOK(TOPm1s)) {
1146 bool left_non_neg = SvUOK(TOPm1s);
1147 bool right_non_neg = SvUOK(TOPs);
1151 if (right_non_neg) {
1152 right = SvUVX(TOPs);
1155 const IV biv = SvIVX(TOPs);
1158 right_non_neg = TRUE; /* effectively it's a UV now */
1164 /* historically undef()/0 gives a "Use of uninitialized value"
1165 warning before dieing, hence this test goes here.
1166 If it were immediately before the second SvIV_please, then
1167 DIE() would be invoked before left was even inspected, so
1168 no inpsection would give no warning. */
1170 DIE(aTHX_ "Illegal division by zero");
1173 left = SvUVX(TOPm1s);
1176 const IV aiv = SvIVX(TOPm1s);
1179 left_non_neg = TRUE; /* effectively it's a UV now */
1188 /* For sloppy divide we always attempt integer division. */
1190 /* Otherwise we only attempt it if either or both operands
1191 would not be preserved by an NV. If both fit in NVs
1192 we fall through to the NV divide code below. However,
1193 as left >= right to ensure integer result here, we know that
1194 we can skip the test on the right operand - right big
1195 enough not to be preserved can't get here unless left is
1198 && (left > ((UV)1 << NV_PRESERVES_UV_BITS))
1201 /* Integer division can't overflow, but it can be imprecise. */
1202 const UV result = left / right;
1203 if (result * right == left) {
1204 SP--; /* result is valid */
1205 if (left_non_neg == right_non_neg) {
1206 /* signs identical, result is positive. */
1210 /* 2s complement assumption */
1211 if (result <= (UV)IV_MIN)
1212 SETi( -(IV)result );
1214 /* It's exact but too negative for IV. */
1215 SETn( -(NV)result );
1218 } /* tried integer divide but it was not an integer result */
1219 } /* else (PERL_ABS(result) < 1.0) or (both UVs in range for NV) */
1220 } /* left wasn't SvIOK */
1221 } /* right wasn't SvIOK */
1222 #endif /* PERL_TRY_UV_DIVIDE */
1226 DIE(aTHX_ "Illegal division by zero");
1227 PUSHn( left / right );
1234 dVAR; dSP; dATARGET; tryAMAGICbin(modulo,opASSIGN);
1238 bool left_neg = FALSE;
1239 bool right_neg = FALSE;
1240 bool use_double = FALSE;
1241 bool dright_valid = FALSE;
1247 right_neg = !SvUOK(TOPs);
1249 right = SvUVX(POPs);
1251 const IV biv = SvIVX(POPs);
1254 right_neg = FALSE; /* effectively it's a UV now */
1262 right_neg = dright < 0;
1265 if (dright < UV_MAX_P1) {
1266 right = U_V(dright);
1267 dright_valid = TRUE; /* In case we need to use double below. */
1273 /* At this point use_double is only true if right is out of range for
1274 a UV. In range NV has been rounded down to nearest UV and
1275 use_double false. */
1277 if (!use_double && SvIOK(TOPs)) {
1279 left_neg = !SvUOK(TOPs);
1283 const IV aiv = SvIVX(POPs);
1286 left_neg = FALSE; /* effectively it's a UV now */
1295 left_neg = dleft < 0;
1299 /* This should be exactly the 5.6 behaviour - if left and right are
1300 both in range for UV then use U_V() rather than floor. */
1302 if (dleft < UV_MAX_P1) {
1303 /* right was in range, so is dleft, so use UVs not double.
1307 /* left is out of range for UV, right was in range, so promote
1308 right (back) to double. */
1310 /* The +0.5 is used in 5.6 even though it is not strictly
1311 consistent with the implicit +0 floor in the U_V()
1312 inside the #if 1. */
1313 dleft = Perl_floor(dleft + 0.5);
1316 dright = Perl_floor(dright + 0.5);
1326 DIE(aTHX_ "Illegal modulus zero");
1328 dans = Perl_fmod(dleft, dright);
1329 if ((left_neg != right_neg) && dans)
1330 dans = dright - dans;
1333 sv_setnv(TARG, dans);
1339 DIE(aTHX_ "Illegal modulus zero");
1342 if ((left_neg != right_neg) && ans)
1345 /* XXX may warn: unary minus operator applied to unsigned type */
1346 /* could change -foo to be (~foo)+1 instead */
1347 if (ans <= ~((UV)IV_MAX)+1)
1348 sv_setiv(TARG, ~ans+1);
1350 sv_setnv(TARG, -(NV)ans);
1353 sv_setuv(TARG, ans);
1362 dVAR; dSP; dATARGET; tryAMAGICbin(repeat,opASSIGN);
1369 const UV uv = SvUV(sv);
1371 count = IV_MAX; /* The best we can do? */
1375 const IV iv = SvIV(sv);
1382 else if (SvNOKp(sv)) {
1383 const NV nv = SvNV(sv);
1391 if (GIMME == G_ARRAY && PL_op->op_private & OPpREPEAT_DOLIST) {
1393 static const char oom_list_extend[] = "Out of memory during list extend";
1394 const I32 items = SP - MARK;
1395 const I32 max = items * count;
1397 MEM_WRAP_CHECK_1(max, SV*, oom_list_extend);
1398 /* Did the max computation overflow? */
1399 if (items > 0 && max > 0 && (max < items || max < count))
1400 Perl_croak(aTHX_ oom_list_extend);
1405 /* This code was intended to fix 20010809.028:
1408 for (($x =~ /./g) x 2) {
1409 print chop; # "abcdabcd" expected as output.
1412 * but that change (#11635) broke this code:
1414 $x = [("foo")x2]; # only one "foo" ended up in the anonlist.
1416 * I can't think of a better fix that doesn't introduce
1417 * an efficiency hit by copying the SVs. The stack isn't
1418 * refcounted, and mortalisation obviously doesn't
1419 * Do The Right Thing when the stack has more than
1420 * one pointer to the same mortal value.
1424 *SP = sv_2mortal(newSVsv(*SP));
1434 repeatcpy((char*)(MARK + items), (char*)MARK,
1435 items * sizeof(SV*), count - 1);
1438 else if (count <= 0)
1441 else { /* Note: mark already snarfed by pp_list */
1442 SV * const tmpstr = POPs;
1445 static const char oom_string_extend[] =
1446 "Out of memory during string extend";
1448 SvSetSV(TARG, tmpstr);
1449 SvPV_force(TARG, len);
1450 isutf = DO_UTF8(TARG);
1455 const STRLEN max = (UV)count * len;
1456 if (len > ((MEM_SIZE)~0)/count)
1457 Perl_croak(aTHX_ oom_string_extend);
1458 MEM_WRAP_CHECK_1(max, char, oom_string_extend);
1459 SvGROW(TARG, max + 1);
1460 repeatcpy(SvPVX(TARG) + len, SvPVX(TARG), len, count - 1);
1461 SvCUR_set(TARG, SvCUR(TARG) * count);
1463 *SvEND(TARG) = '\0';
1466 (void)SvPOK_only_UTF8(TARG);
1468 (void)SvPOK_only(TARG);
1470 if (PL_op->op_private & OPpREPEAT_DOLIST) {
1471 /* The parser saw this as a list repeat, and there
1472 are probably several items on the stack. But we're
1473 in scalar context, and there's no pp_list to save us
1474 now. So drop the rest of the items -- robin@kitsite.com
1487 dVAR; dSP; dATARGET; bool useleft; tryAMAGICbin(subtr,opASSIGN);
1488 useleft = USE_LEFT(TOPm1s);
1489 #ifdef PERL_PRESERVE_IVUV
1490 /* See comments in pp_add (in pp_hot.c) about Overflow, and how
1491 "bad things" happen if you rely on signed integers wrapping. */
1494 /* Unless the left argument is integer in range we are going to have to
1495 use NV maths. Hence only attempt to coerce the right argument if
1496 we know the left is integer. */
1497 register UV auv = 0;
1503 a_valid = auvok = 1;
1504 /* left operand is undef, treat as zero. */
1506 /* Left operand is defined, so is it IV? */
1507 SvIV_please(TOPm1s);
1508 if (SvIOK(TOPm1s)) {
1509 if ((auvok = SvUOK(TOPm1s)))
1510 auv = SvUVX(TOPm1s);
1512 register const IV aiv = SvIVX(TOPm1s);
1515 auvok = 1; /* Now acting as a sign flag. */
1516 } else { /* 2s complement assumption for IV_MIN */
1524 bool result_good = 0;
1527 bool buvok = SvUOK(TOPs);
1532 register const IV biv = SvIVX(TOPs);
1539 /* ?uvok if value is >= 0. basically, flagged as UV if it's +ve,
1540 else "IV" now, independent of how it came in.
1541 if a, b represents positive, A, B negative, a maps to -A etc
1546 all UV maths. negate result if A negative.
1547 subtract if signs same, add if signs differ. */
1549 if (auvok ^ buvok) {
1558 /* Must get smaller */
1563 if (result <= buv) {
1564 /* result really should be -(auv-buv). as its negation
1565 of true value, need to swap our result flag */
1577 if (result <= (UV)IV_MIN)
1578 SETi( -(IV)result );
1580 /* result valid, but out of range for IV. */
1581 SETn( -(NV)result );
1585 } /* Overflow, drop through to NVs. */
1589 useleft = USE_LEFT(TOPm1s);
1593 /* left operand is undef, treat as zero - value */
1597 SETn( TOPn - value );
1604 dVAR; dSP; dATARGET; tryAMAGICbin(lshift,opASSIGN);
1606 const IV shift = POPi;
1607 if (PL_op->op_private & HINT_INTEGER) {
1621 dVAR; dSP; dATARGET; tryAMAGICbin(rshift,opASSIGN);
1623 const IV shift = POPi;
1624 if (PL_op->op_private & HINT_INTEGER) {
1638 dVAR; dSP; tryAMAGICbinSET(lt,0);
1639 #ifdef PERL_PRESERVE_IVUV
1642 SvIV_please(TOPm1s);
1643 if (SvIOK(TOPm1s)) {
1644 bool auvok = SvUOK(TOPm1s);
1645 bool buvok = SvUOK(TOPs);
1647 if (!auvok && !buvok) { /* ## IV < IV ## */
1648 const IV aiv = SvIVX(TOPm1s);
1649 const IV biv = SvIVX(TOPs);
1652 SETs(boolSV(aiv < biv));
1655 if (auvok && buvok) { /* ## UV < UV ## */
1656 const UV auv = SvUVX(TOPm1s);
1657 const UV buv = SvUVX(TOPs);
1660 SETs(boolSV(auv < buv));
1663 if (auvok) { /* ## UV < IV ## */
1665 const IV biv = SvIVX(TOPs);
1668 /* As (a) is a UV, it's >=0, so it cannot be < */
1673 SETs(boolSV(auv < (UV)biv));
1676 { /* ## IV < UV ## */
1677 const IV aiv = SvIVX(TOPm1s);
1681 /* As (b) is a UV, it's >=0, so it must be < */
1688 SETs(boolSV((UV)aiv < buv));
1694 #ifndef NV_PRESERVES_UV
1695 #ifdef PERL_PRESERVE_IVUV
1698 if (SvROK(TOPs) && !SvAMAGIC(TOPs) && SvROK(TOPm1s) && !SvAMAGIC(TOPm1s)) {
1700 SETs(boolSV(SvRV(TOPs) < SvRV(TOPp1s)));
1706 SETs(boolSV(TOPn < value));
1713 dVAR; dSP; tryAMAGICbinSET(gt,0);
1714 #ifdef PERL_PRESERVE_IVUV
1717 SvIV_please(TOPm1s);
1718 if (SvIOK(TOPm1s)) {
1719 bool auvok = SvUOK(TOPm1s);
1720 bool buvok = SvUOK(TOPs);
1722 if (!auvok && !buvok) { /* ## IV > IV ## */
1723 const IV aiv = SvIVX(TOPm1s);
1724 const IV biv = SvIVX(TOPs);
1727 SETs(boolSV(aiv > biv));
1730 if (auvok && buvok) { /* ## UV > UV ## */
1731 const UV auv = SvUVX(TOPm1s);
1732 const UV buv = SvUVX(TOPs);
1735 SETs(boolSV(auv > buv));
1738 if (auvok) { /* ## UV > IV ## */
1740 const IV biv = SvIVX(TOPs);
1744 /* As (a) is a UV, it's >=0, so it must be > */
1749 SETs(boolSV(auv > (UV)biv));
1752 { /* ## IV > UV ## */
1753 const IV aiv = SvIVX(TOPm1s);
1757 /* As (b) is a UV, it's >=0, so it cannot be > */
1764 SETs(boolSV((UV)aiv > buv));
1770 #ifndef NV_PRESERVES_UV
1771 #ifdef PERL_PRESERVE_IVUV
1774 if (SvROK(TOPs) && !SvAMAGIC(TOPs) && SvROK(TOPm1s) && !SvAMAGIC(TOPm1s)) {
1776 SETs(boolSV(SvRV(TOPs) > SvRV(TOPp1s)));
1782 SETs(boolSV(TOPn > value));
1789 dVAR; dSP; tryAMAGICbinSET(le,0);
1790 #ifdef PERL_PRESERVE_IVUV
1793 SvIV_please(TOPm1s);
1794 if (SvIOK(TOPm1s)) {
1795 bool auvok = SvUOK(TOPm1s);
1796 bool buvok = SvUOK(TOPs);
1798 if (!auvok && !buvok) { /* ## IV <= IV ## */
1799 const IV aiv = SvIVX(TOPm1s);
1800 const IV biv = SvIVX(TOPs);
1803 SETs(boolSV(aiv <= biv));
1806 if (auvok && buvok) { /* ## UV <= UV ## */
1807 UV auv = SvUVX(TOPm1s);
1808 UV buv = SvUVX(TOPs);
1811 SETs(boolSV(auv <= buv));
1814 if (auvok) { /* ## UV <= IV ## */
1816 const IV biv = SvIVX(TOPs);
1820 /* As (a) is a UV, it's >=0, so a cannot be <= */
1825 SETs(boolSV(auv <= (UV)biv));
1828 { /* ## IV <= UV ## */
1829 const IV aiv = SvIVX(TOPm1s);
1833 /* As (b) is a UV, it's >=0, so a must be <= */
1840 SETs(boolSV((UV)aiv <= buv));
1846 #ifndef NV_PRESERVES_UV
1847 #ifdef PERL_PRESERVE_IVUV
1850 if (SvROK(TOPs) && !SvAMAGIC(TOPs) && SvROK(TOPm1s) && !SvAMAGIC(TOPm1s)) {
1852 SETs(boolSV(SvRV(TOPs) <= SvRV(TOPp1s)));
1858 SETs(boolSV(TOPn <= value));
1865 dVAR; dSP; tryAMAGICbinSET(ge,0);
1866 #ifdef PERL_PRESERVE_IVUV
1869 SvIV_please(TOPm1s);
1870 if (SvIOK(TOPm1s)) {
1871 bool auvok = SvUOK(TOPm1s);
1872 bool buvok = SvUOK(TOPs);
1874 if (!auvok && !buvok) { /* ## IV >= IV ## */
1875 const IV aiv = SvIVX(TOPm1s);
1876 const IV biv = SvIVX(TOPs);
1879 SETs(boolSV(aiv >= biv));
1882 if (auvok && buvok) { /* ## UV >= UV ## */
1883 const UV auv = SvUVX(TOPm1s);
1884 const UV buv = SvUVX(TOPs);
1887 SETs(boolSV(auv >= buv));
1890 if (auvok) { /* ## UV >= IV ## */
1892 const IV biv = SvIVX(TOPs);
1896 /* As (a) is a UV, it's >=0, so it must be >= */
1901 SETs(boolSV(auv >= (UV)biv));
1904 { /* ## IV >= UV ## */
1905 const IV aiv = SvIVX(TOPm1s);
1909 /* As (b) is a UV, it's >=0, so a cannot be >= */
1916 SETs(boolSV((UV)aiv >= buv));
1922 #ifndef NV_PRESERVES_UV
1923 #ifdef PERL_PRESERVE_IVUV
1926 if (SvROK(TOPs) && !SvAMAGIC(TOPs) && SvROK(TOPm1s) && !SvAMAGIC(TOPm1s)) {
1928 SETs(boolSV(SvRV(TOPs) >= SvRV(TOPp1s)));
1934 SETs(boolSV(TOPn >= value));
1941 dVAR; dSP; tryAMAGICbinSET(ne,0);
1942 #ifndef NV_PRESERVES_UV
1943 if (SvROK(TOPs) && !SvAMAGIC(TOPs) && SvROK(TOPm1s) && !SvAMAGIC(TOPm1s)) {
1945 SETs(boolSV(SvRV(TOPs) != SvRV(TOPp1s)));
1949 #ifdef PERL_PRESERVE_IVUV
1952 SvIV_please(TOPm1s);
1953 if (SvIOK(TOPm1s)) {
1954 const bool auvok = SvUOK(TOPm1s);
1955 const bool buvok = SvUOK(TOPs);
1957 if (auvok == buvok) { /* ## IV == IV or UV == UV ## */
1958 /* Casting IV to UV before comparison isn't going to matter
1959 on 2s complement. On 1s complement or sign&magnitude
1960 (if we have any of them) it could make negative zero
1961 differ from normal zero. As I understand it. (Need to
1962 check - is negative zero implementation defined behaviour
1964 const UV buv = SvUVX(POPs);
1965 const UV auv = SvUVX(TOPs);
1967 SETs(boolSV(auv != buv));
1970 { /* ## Mixed IV,UV ## */
1974 /* != is commutative so swap if needed (save code) */
1976 /* swap. top of stack (b) is the iv */
1980 /* As (a) is a UV, it's >0, so it cannot be == */
1989 /* As (b) is a UV, it's >0, so it cannot be == */
1993 uv = SvUVX(*(SP+1)); /* Do I want TOPp1s() ? */
1995 SETs(boolSV((UV)iv != uv));
2003 SETs(boolSV(TOPn != value));
2010 dVAR; dSP; dTARGET; tryAMAGICbin(ncmp,0);
2011 #ifndef NV_PRESERVES_UV
2012 if (SvROK(TOPs) && !SvAMAGIC(TOPs) && SvROK(TOPm1s) && !SvAMAGIC(TOPm1s)) {
2013 const UV right = PTR2UV(SvRV(POPs));
2014 const UV left = PTR2UV(SvRV(TOPs));
2015 SETi((left > right) - (left < right));
2019 #ifdef PERL_PRESERVE_IVUV
2020 /* Fortunately it seems NaN isn't IOK */
2023 SvIV_please(TOPm1s);
2024 if (SvIOK(TOPm1s)) {
2025 const bool leftuvok = SvUOK(TOPm1s);
2026 const bool rightuvok = SvUOK(TOPs);
2028 if (!leftuvok && !rightuvok) { /* ## IV <=> IV ## */
2029 const IV leftiv = SvIVX(TOPm1s);
2030 const IV rightiv = SvIVX(TOPs);
2032 if (leftiv > rightiv)
2034 else if (leftiv < rightiv)
2038 } else if (leftuvok && rightuvok) { /* ## UV <=> UV ## */
2039 const UV leftuv = SvUVX(TOPm1s);
2040 const UV rightuv = SvUVX(TOPs);
2042 if (leftuv > rightuv)
2044 else if (leftuv < rightuv)
2048 } else if (leftuvok) { /* ## UV <=> IV ## */
2049 const IV rightiv = SvIVX(TOPs);
2051 /* As (a) is a UV, it's >=0, so it cannot be < */
2054 const UV leftuv = SvUVX(TOPm1s);
2055 if (leftuv > (UV)rightiv) {
2057 } else if (leftuv < (UV)rightiv) {
2063 } else { /* ## IV <=> UV ## */
2064 const IV leftiv = SvIVX(TOPm1s);
2066 /* As (b) is a UV, it's >=0, so it must be < */
2069 const UV rightuv = SvUVX(TOPs);
2070 if ((UV)leftiv > rightuv) {
2072 } else if ((UV)leftiv < rightuv) {
2090 if (Perl_isnan(left) || Perl_isnan(right)) {
2094 value = (left > right) - (left < right);
2098 else if (left < right)
2100 else if (left > right)
2116 int amg_type = sle_amg;
2120 switch (PL_op->op_type) {
2139 tryAMAGICbinSET_var(amg_type,0);
2142 const int cmp = (IN_LOCALE_RUNTIME
2143 ? sv_cmp_locale(left, right)
2144 : sv_cmp(left, right));
2145 SETs(boolSV(cmp * multiplier < rhs));
2152 dVAR; dSP; tryAMAGICbinSET(seq,0);
2155 SETs(boolSV(sv_eq(left, right)));
2162 dVAR; dSP; tryAMAGICbinSET(sne,0);
2165 SETs(boolSV(!sv_eq(left, right)));
2172 dVAR; dSP; dTARGET; tryAMAGICbin(scmp,0);
2175 const int cmp = (IN_LOCALE_RUNTIME
2176 ? sv_cmp_locale(left, right)
2177 : sv_cmp(left, right));
2185 dVAR; dSP; dATARGET; tryAMAGICbin(band,opASSIGN);
2190 if (SvNIOKp(left) || SvNIOKp(right)) {
2191 if (PL_op->op_private & HINT_INTEGER) {
2192 const IV i = SvIV_nomg(left) & SvIV_nomg(right);
2196 const UV u = SvUV_nomg(left) & SvUV_nomg(right);
2201 do_vop(PL_op->op_type, TARG, left, right);
2210 dVAR; dSP; dATARGET;
2211 const int op_type = PL_op->op_type;
2213 tryAMAGICbin_var((op_type == OP_BIT_OR ? bor_amg : bxor_amg), opASSIGN);
2218 if (SvNIOKp(left) || SvNIOKp(right)) {
2219 if (PL_op->op_private & HINT_INTEGER) {
2220 const IV l = (USE_LEFT(left) ? SvIV_nomg(left) : 0);
2221 const IV r = SvIV_nomg(right);
2222 const IV result = op_type == OP_BIT_OR ? (l | r) : (l ^ r);
2226 const UV l = (USE_LEFT(left) ? SvUV_nomg(left) : 0);
2227 const UV r = SvUV_nomg(right);
2228 const UV result = op_type == OP_BIT_OR ? (l | r) : (l ^ r);
2233 do_vop(op_type, TARG, left, right);
2242 dVAR; 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 * const 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 dVAR; dSP; tryAMAGICunSET(not);
2313 *PL_stack_sp = boolSV(!SvTRUE(*PL_stack_sp));
2319 dVAR; 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 dVAR; dSP; dATARGET; tryAMAGICbin(mult,opASSIGN);
2419 SETi( left * right );
2427 dVAR; dSP; dATARGET; tryAMAGICbin(div,opASSIGN);
2431 DIE(aTHX_ "Illegal division by zero");
2433 if (num == IV_MIN && value == -1)
2434 DIE(aTHX_ "Integer overflow in division");
2435 value = num / value;
2444 /* This is the vanilla old i_modulo. */
2445 dVAR; dSP; dATARGET; tryAMAGICbin(modulo,opASSIGN);
2449 DIE(aTHX_ "Illegal modulus zero");
2450 SETi( left % right );
2455 #if defined(__GLIBC__) && IVSIZE == 8
2459 /* This is the i_modulo with the workaround for the _moddi3 bug
2460 * in (at least) glibc 2.2.5 (the PERL_ABS() the workaround).
2461 * See below for pp_i_modulo. */
2462 dVAR; dVAR; dSP; dATARGET; tryAMAGICbin(modulo,opASSIGN);
2466 DIE(aTHX_ "Illegal modulus zero");
2467 SETi( left % PERL_ABS(right) );
2475 dVAR; dSP; dATARGET; tryAMAGICbin(modulo,opASSIGN);
2479 DIE(aTHX_ "Illegal modulus zero");
2480 /* The assumption is to use hereafter the old vanilla version... */
2482 PL_ppaddr[OP_I_MODULO] =
2484 /* .. but if we have glibc, we might have a buggy _moddi3
2485 * (at least glicb 2.2.5 is known to have this bug), in other
2486 * words our integer modulus with negative quad as the second
2487 * argument might be broken. Test for this and re-patch the
2488 * opcode dispatch table if that is the case, remembering to
2489 * also apply the workaround so that this first round works
2490 * right, too. See [perl #9402] for more information. */
2491 #if defined(__GLIBC__) && IVSIZE == 8
2495 /* Cannot do this check with inlined IV constants since
2496 * that seems to work correctly even with the buggy glibc. */
2498 /* Yikes, we have the bug.
2499 * Patch in the workaround version. */
2501 PL_ppaddr[OP_I_MODULO] =
2502 &Perl_pp_i_modulo_1;
2503 /* Make certain we work right this time, too. */
2504 right = PERL_ABS(right);
2508 SETi( left % right );
2515 dVAR; dSP; dATARGET; tryAMAGICbin(add,opASSIGN);
2518 SETi( left + right );
2525 dVAR; dSP; dATARGET; tryAMAGICbin(subtr,opASSIGN);
2528 SETi( left - right );
2535 dVAR; dSP; tryAMAGICbinSET(lt,0);
2538 SETs(boolSV(left < right));
2545 dVAR; dSP; tryAMAGICbinSET(gt,0);
2548 SETs(boolSV(left > right));
2555 dVAR; dSP; tryAMAGICbinSET(le,0);
2558 SETs(boolSV(left <= right));
2565 dVAR; dSP; tryAMAGICbinSET(ge,0);
2568 SETs(boolSV(left >= right));
2575 dVAR; dSP; tryAMAGICbinSET(eq,0);
2578 SETs(boolSV(left == right));
2585 dVAR; dSP; tryAMAGICbinSET(ne,0);
2588 SETs(boolSV(left != right));
2595 dVAR; dSP; dTARGET; tryAMAGICbin(ncmp,0);
2602 else if (left < right)
2613 dVAR; dSP; dTARGET; tryAMAGICun(neg);
2618 /* High falutin' math. */
2622 dVAR; dSP; dTARGET; tryAMAGICbin(atan2,0);
2625 SETn(Perl_atan2(left, right));
2633 int amg_type = sin_amg;
2634 const char *neg_report = NULL;
2635 NV (*func)(NV) = Perl_sin;
2636 const int op_type = PL_op->op_type;
2653 amg_type = sqrt_amg;
2655 neg_report = "sqrt";
2659 tryAMAGICun_var(amg_type);
2661 const NV value = POPn;
2663 if (op_type == OP_LOG ? (value <= 0.0) : (value < 0.0)) {
2664 SET_NUMERIC_STANDARD();
2665 DIE(aTHX_ "Can't take %s of %"NVgf, neg_report, value);
2668 XPUSHn(func(value));
2673 /* Support Configure command-line overrides for rand() functions.
2674 After 5.005, perhaps we should replace this by Configure support
2675 for drand48(), random(), or rand(). For 5.005, though, maintain
2676 compatibility by calling rand() but allow the user to override it.
2677 See INSTALL for details. --Andy Dougherty 15 July 1998
2679 /* Now it's after 5.005, and Configure supports drand48() and random(),
2680 in addition to rand(). So the overrides should not be needed any more.
2681 --Jarkko Hietaniemi 27 September 1998
2684 #ifndef HAS_DRAND48_PROTO
2685 extern double drand48 (void);
2698 if (!PL_srand_called) {
2699 (void)seedDrand01((Rand_seed_t)seed());
2700 PL_srand_called = TRUE;
2710 const UV anum = (MAXARG < 1) ? seed() : POPu;
2711 (void)seedDrand01((Rand_seed_t)anum);
2712 PL_srand_called = TRUE;
2719 dVAR; dSP; dTARGET; tryAMAGICun(int);
2721 const IV iv = TOPi; /* attempt to convert to IV if possible. */
2722 /* XXX it's arguable that compiler casting to IV might be subtly
2723 different from modf (for numbers inside (IV_MIN,UV_MAX)) in which
2724 else preferring IV has introduced a subtle behaviour change bug. OTOH
2725 relying on floating point to be accurate is a bug. */
2729 else if (SvIOK(TOPs)) {
2736 const NV value = TOPn;
2738 if (value < (NV)UV_MAX + 0.5) {
2741 SETn(Perl_floor(value));
2745 if (value > (NV)IV_MIN - 0.5) {
2748 SETn(Perl_ceil(value));
2758 dVAR; dSP; dTARGET; tryAMAGICun(abs);
2760 /* This will cache the NV value if string isn't actually integer */
2765 else if (SvIOK(TOPs)) {
2766 /* IVX is precise */
2768 SETu(TOPu); /* force it to be numeric only */
2776 /* 2s complement assumption. Also, not really needed as
2777 IV_MIN and -IV_MIN should both be %100...00 and NV-able */
2783 const NV value = TOPn;
2797 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES;
2801 SV* const sv = POPs;
2803 tmps = (SvPV_const(sv, len));
2805 /* If Unicode, try to downgrade
2806 * If not possible, croak. */
2807 SV* const tsv = sv_2mortal(newSVsv(sv));
2810 sv_utf8_downgrade(tsv, FALSE);
2811 tmps = SvPV_const(tsv, len);
2813 if (PL_op->op_type == OP_HEX)
2816 while (*tmps && len && isSPACE(*tmps))
2822 result_uv = grok_hex (tmps, &len, &flags, &result_nv);
2824 else if (*tmps == 'b')
2825 result_uv = grok_bin (tmps, &len, &flags, &result_nv);
2827 result_uv = grok_oct (tmps, &len, &flags, &result_nv);
2829 if (flags & PERL_SCAN_GREATER_THAN_UV_MAX) {
2843 SV * const sv = TOPs;
2846 SETi(sv_len_utf8(sv));
2862 const I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
2864 const I32 arybase = PL_curcop->cop_arybase;
2866 const char *repl = NULL;
2868 const int num_args = PL_op->op_private & 7;
2869 bool repl_need_utf8_upgrade = FALSE;
2870 bool repl_is_utf8 = FALSE;
2872 SvTAINTED_off(TARG); /* decontaminate */
2873 SvUTF8_off(TARG); /* decontaminate */
2877 repl = SvPV_const(repl_sv, repl_len);
2878 repl_is_utf8 = DO_UTF8(repl_sv) && SvCUR(repl_sv);
2888 sv_utf8_upgrade(sv);
2890 else if (DO_UTF8(sv))
2891 repl_need_utf8_upgrade = TRUE;
2893 tmps = SvPV_const(sv, curlen);
2895 utf8_curlen = sv_len_utf8(sv);
2896 if (utf8_curlen == curlen)
2899 curlen = utf8_curlen;
2904 if (pos >= arybase) {
2922 else if (len >= 0) {
2924 if (rem > (I32)curlen)
2939 Perl_croak(aTHX_ "substr outside of string");
2940 if (ckWARN(WARN_SUBSTR))
2941 Perl_warner(aTHX_ packWARN(WARN_SUBSTR), "substr outside of string");
2945 const I32 upos = pos;
2946 const I32 urem = rem;
2948 sv_pos_u2b(sv, &pos, &rem);
2950 /* we either return a PV or an LV. If the TARG hasn't been used
2951 * before, or is of that type, reuse it; otherwise use a mortal
2952 * instead. Note that LVs can have an extended lifetime, so also
2953 * dont reuse if refcount > 1 (bug #20933) */
2954 if (SvTYPE(TARG) > SVt_NULL) {
2955 if ( (SvTYPE(TARG) == SVt_PVLV)
2956 ? (!lvalue || SvREFCNT(TARG) > 1)
2959 TARG = sv_newmortal();
2963 sv_setpvn(TARG, tmps, rem);
2964 #ifdef USE_LOCALE_COLLATE
2965 sv_unmagic(TARG, PERL_MAGIC_collxfrm);
2970 SV* repl_sv_copy = NULL;
2972 if (repl_need_utf8_upgrade) {
2973 repl_sv_copy = newSVsv(repl_sv);
2974 sv_utf8_upgrade(repl_sv_copy);
2975 repl = SvPV_const(repl_sv_copy, repl_len);
2976 repl_is_utf8 = DO_UTF8(repl_sv_copy) && SvCUR(sv);
2978 sv_insert(sv, pos, rem, repl, repl_len);
2982 SvREFCNT_dec(repl_sv_copy);
2984 else if (lvalue) { /* it's an lvalue! */
2985 if (!SvGMAGICAL(sv)) {
2987 SvPV_force_nolen(sv);
2988 if (ckWARN(WARN_SUBSTR))
2989 Perl_warner(aTHX_ packWARN(WARN_SUBSTR),
2990 "Attempt to use reference as lvalue in substr");
2992 if (SvOK(sv)) /* is it defined ? */
2993 (void)SvPOK_only_UTF8(sv);
2995 sv_setpvn(sv,"",0); /* avoid lexical reincarnation */
2998 if (SvTYPE(TARG) < SVt_PVLV) {
2999 sv_upgrade(TARG, SVt_PVLV);
3000 sv_magic(TARG, NULL, PERL_MAGIC_substr, NULL, 0);
3006 if (LvTARG(TARG) != sv) {
3008 SvREFCNT_dec(LvTARG(TARG));
3009 LvTARG(TARG) = SvREFCNT_inc(sv);
3011 LvTARGOFF(TARG) = upos;
3012 LvTARGLEN(TARG) = urem;
3016 PUSHs(TARG); /* avoid SvSETMAGIC here */
3023 register const IV size = POPi;
3024 register const IV offset = POPi;
3025 register SV * const src = POPs;
3026 const I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
3028 SvTAINTED_off(TARG); /* decontaminate */
3029 if (lvalue) { /* it's an lvalue! */
3030 if (SvREFCNT(TARG) > 1) /* don't share the TARG (#20933) */
3031 TARG = sv_newmortal();
3032 if (SvTYPE(TARG) < SVt_PVLV) {
3033 sv_upgrade(TARG, SVt_PVLV);
3034 sv_magic(TARG, NULL, PERL_MAGIC_vec, NULL, 0);
3037 if (LvTARG(TARG) != src) {
3039 SvREFCNT_dec(LvTARG(TARG));
3040 LvTARG(TARG) = SvREFCNT_inc(src);
3042 LvTARGOFF(TARG) = offset;
3043 LvTARGLEN(TARG) = size;
3046 sv_setuv(TARG, do_vecget(src, offset, size));
3063 const I32 arybase = PL_curcop->cop_arybase;
3066 const bool is_index = PL_op->op_type == OP_INDEX;
3069 /* arybase is in characters, like offset, so combine prior to the
3070 UTF-8 to bytes calculation. */
3071 offset = POPi - arybase;
3075 big_utf8 = DO_UTF8(big);
3076 little_utf8 = DO_UTF8(little);
3077 if (big_utf8 ^ little_utf8) {
3078 /* One needs to be upgraded. */
3079 if (little_utf8 && !PL_encoding) {
3080 /* Well, maybe instead we might be able to downgrade the small
3083 const U8 * const little_pv = (U8*) SvPV_const(little, little_len);
3084 char * const pv = (char*)bytes_from_utf8(little_pv, &little_len,
3087 /* If the large string is ISO-8859-1, and it's not possible to
3088 convert the small string to ISO-8859-1, then there is no
3089 way that it could be found anywhere by index. */
3094 /* At this point, pv is a malloc()ed string. So donate it to temp
3095 to ensure it will get free()d */
3096 little = temp = newSV(0);
3097 sv_usepvn(temp, pv, little_len);
3099 SV * const bytes = little_utf8 ? big : little;
3101 const char * const p = SvPV_const(bytes, len);
3103 temp = newSVpvn(p, len);
3106 sv_recode_to_utf8(temp, PL_encoding);
3108 sv_utf8_upgrade(temp);
3118 /* Don't actually need the NULL initialisation, but it keeps gcc quiet. */
3119 tmps2 = is_index ? NULL : SvPV_const(little, llen);
3120 tmps = SvPV_const(big, biglen);
3123 offset = is_index ? 0 : biglen;
3125 if (big_utf8 && offset > 0)
3126 sv_pos_u2b(big, &offset, 0);
3131 else if (offset > (I32)biglen)
3133 if (!(tmps2 = is_index
3134 ? fbm_instr((unsigned char*)tmps + offset,
3135 (unsigned char*)tmps + biglen, little, 0)
3136 : rninstr(tmps, tmps + offset,
3137 tmps2, tmps2 + llen)))
3140 retval = tmps2 - tmps;
3141 if (retval > 0 && big_utf8)
3142 sv_pos_b2u(big, &retval);
3147 PUSHi(retval + arybase);
3153 dVAR; dSP; dMARK; dORIGMARK; dTARGET;
3154 do_sprintf(TARG, SP-MARK, MARK+1);
3155 TAINT_IF(SvTAINTED(TARG));
3166 const U8 *s = (U8*)SvPV_const(argsv, len);
3169 if (PL_encoding && SvPOK(argsv) && !DO_UTF8(argsv)) {
3170 tmpsv = sv_2mortal(newSVsv(argsv));
3171 s = (U8*)sv_recode_to_utf8(tmpsv, PL_encoding);
3175 XPUSHu(DO_UTF8(argsv) ?
3176 utf8n_to_uvchr(s, UTF8_MAXBYTES, 0, UTF8_ALLOW_ANYUV) :
3188 if (((SvIOK_notUV(TOPs) && SvIV(TOPs) < 0)
3190 (SvNOK(TOPs) && SvNV(TOPs) < 0.0))) {
3192 value = POPu; /* chr(-1) eq chr(0xff), etc. */
3194 (void) POPs; /* Ignore the argument value. */
3195 value = UNICODE_REPLACEMENT;
3201 SvUPGRADE(TARG,SVt_PV);
3203 if (value > 255 && !IN_BYTES) {
3204 SvGROW(TARG, (STRLEN)UNISKIP(value)+1);
3205 tmps = (char*)uvchr_to_utf8_flags((U8*)SvPVX(TARG), value, 0);
3206 SvCUR_set(TARG, tmps - SvPVX_const(TARG));
3208 (void)SvPOK_only(TARG);
3217 *tmps++ = (char)value;
3219 (void)SvPOK_only(TARG);
3220 if (PL_encoding && !IN_BYTES) {
3221 sv_recode_to_utf8(TARG, PL_encoding);
3223 if (SvCUR(TARG) == 0 || !is_utf8_string((U8*)tmps, SvCUR(TARG)) ||
3224 memEQ(tmps, "\xef\xbf\xbd\0", 4)) {
3228 *tmps++ = (U8)UTF8_EIGHT_BIT_HI(value);
3229 *tmps++ = (U8)UTF8_EIGHT_BIT_LO(value);
3244 const char *tmps = SvPV_const(left, len);
3246 if (DO_UTF8(left)) {
3247 /* If Unicode, try to downgrade.
3248 * If not possible, croak.
3249 * Yes, we made this up. */
3250 SV* const tsv = sv_2mortal(newSVsv(left));
3253 sv_utf8_downgrade(tsv, FALSE);
3254 tmps = SvPV_const(tsv, len);
3256 # ifdef USE_ITHREADS
3258 if (!PL_reentrant_buffer->_crypt_struct_buffer) {
3259 /* This should be threadsafe because in ithreads there is only
3260 * one thread per interpreter. If this would not be true,
3261 * we would need a mutex to protect this malloc. */
3262 PL_reentrant_buffer->_crypt_struct_buffer =
3263 (struct crypt_data *)safemalloc(sizeof(struct crypt_data));
3264 #if defined(__GLIBC__) || defined(__EMX__)
3265 if (PL_reentrant_buffer->_crypt_struct_buffer) {
3266 PL_reentrant_buffer->_crypt_struct_buffer->initialized = 0;
3267 /* work around glibc-2.2.5 bug */
3268 PL_reentrant_buffer->_crypt_struct_buffer->current_saltbits = 0;
3272 # endif /* HAS_CRYPT_R */
3273 # endif /* USE_ITHREADS */
3275 sv_setpv(TARG, fcrypt(tmps, SvPV_nolen_const(right)));
3277 sv_setpv(TARG, PerlProc_crypt(tmps, SvPV_nolen_const(right)));
3283 "The crypt() function is unimplemented due to excessive paranoia.");
3294 const int op_type = PL_op->op_type;
3298 (s = (const U8*)SvPV_nomg_const(sv, slen)) && slen &&
3299 UTF8_IS_START(*s)) {
3300 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
3304 utf8_to_uvchr(s, &ulen);
3305 if (op_type == OP_UCFIRST) {
3306 toTITLE_utf8(s, tmpbuf, &tculen);
3308 toLOWER_utf8(s, tmpbuf, &tculen);
3311 if (!SvPADTMP(sv) || SvREADONLY(sv) || ulen != tculen) {
3313 /* slen is the byte length of the whole SV.
3314 * ulen is the byte length of the original Unicode character
3315 * stored as UTF-8 at s.
3316 * tculen is the byte length of the freshly titlecased (or
3317 * lowercased) Unicode character stored as UTF-8 at tmpbuf.
3318 * We first set the result to be the titlecased (/lowercased)
3319 * character, and then append the rest of the SV data. */
3320 sv_setpvn(TARG, (char*)tmpbuf, tculen);
3322 sv_catpvn(TARG, (char*)(s + ulen), slen - ulen);
3327 s = (U8*)SvPV_force_nomg(sv, slen);
3328 Copy(tmpbuf, s, tculen, U8);
3333 if (!SvPADTMP(sv) || SvREADONLY(sv)) {
3335 SvUTF8_off(TARG); /* decontaminate */
3336 sv_setsv_nomg(TARG, sv);
3340 s1 = (U8*)SvPV_force_nomg(sv, slen);
3342 if (IN_LOCALE_RUNTIME) {
3345 *s1 = (op_type == OP_UCFIRST)
3346 ? toUPPER_LC(*s1) : toLOWER_LC(*s1);
3349 *s1 = (op_type == OP_UCFIRST) ? toUPPER(*s1) : toLOWER(*s1);
3370 U8 tmpbuf[UTF8_MAXBYTES+1];
3372 s = (const U8*)SvPV_nomg_const(sv,len);
3374 SvUTF8_off(TARG); /* decontaminate */
3375 sv_setpvn(TARG, "", 0);
3379 STRLEN min = len + 1;
3381 SvUPGRADE(TARG, SVt_PV);
3383 (void)SvPOK_only(TARG);
3384 d = (U8*)SvPVX(TARG);
3387 STRLEN u = UTF8SKIP(s);
3389 toUPPER_utf8(s, tmpbuf, &ulen);
3390 if (ulen > u && (SvLEN(TARG) < (min += ulen - u))) {
3391 /* If the eventually required minimum size outgrows
3392 * the available space, we need to grow. */
3393 const UV o = d - (U8*)SvPVX_const(TARG);
3395 /* If someone uppercases one million U+03B0s we
3396 * SvGROW() one million times. Or we could try
3397 * guessing how much to allocate without allocating
3398 * too much. Such is life. */
3400 d = (U8*)SvPVX(TARG) + o;
3402 Copy(tmpbuf, d, ulen, U8);
3408 SvCUR_set(TARG, d - (U8*)SvPVX_const(TARG));
3414 if (!SvPADTMP(sv) || SvREADONLY(sv)) {
3416 SvUTF8_off(TARG); /* decontaminate */
3417 sv_setsv_nomg(TARG, sv);
3421 s = (U8*)SvPV_force_nomg(sv, len);
3423 register const U8 *send = s + len;
3425 if (IN_LOCALE_RUNTIME) {
3428 for (; s < send; s++)
3429 *s = toUPPER_LC(*s);
3432 for (; s < send; s++)
3455 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
3457 s = (const U8*)SvPV_nomg_const(sv,len);
3459 SvUTF8_off(TARG); /* decontaminate */
3460 sv_setpvn(TARG, "", 0);
3464 STRLEN min = len + 1;
3466 SvUPGRADE(TARG, SVt_PV);
3468 (void)SvPOK_only(TARG);
3469 d = (U8*)SvPVX(TARG);
3472 const STRLEN u = UTF8SKIP(s);
3473 const UV uv = toLOWER_utf8(s, tmpbuf, &ulen);
3475 #define GREEK_CAPITAL_LETTER_SIGMA 0x03A3 /* Unicode U+03A3 */
3476 if (uv == GREEK_CAPITAL_LETTER_SIGMA) {
3478 * Now if the sigma is NOT followed by
3479 * /$ignorable_sequence$cased_letter/;
3480 * and it IS preceded by
3481 * /$cased_letter$ignorable_sequence/;
3482 * where $ignorable_sequence is
3483 * [\x{2010}\x{AD}\p{Mn}]*
3484 * and $cased_letter is
3485 * [\p{Ll}\p{Lo}\p{Lt}]
3486 * then it should be mapped to 0x03C2,
3487 * (GREEK SMALL LETTER FINAL SIGMA),
3488 * instead of staying 0x03A3.
3489 * "should be": in other words,
3490 * this is not implemented yet.
3491 * See lib/unicore/SpecialCasing.txt.
3494 if (ulen > u && (SvLEN(TARG) < (min += ulen - u))) {
3495 /* If the eventually required minimum size outgrows
3496 * the available space, we need to grow. */
3497 const UV o = d - (U8*)SvPVX_const(TARG);
3499 /* If someone lowercases one million U+0130s we
3500 * SvGROW() one million times. Or we could try
3501 * guessing how much to allocate without allocating.
3502 * too much. Such is life. */
3504 d = (U8*)SvPVX(TARG) + o;
3506 Copy(tmpbuf, d, ulen, U8);
3512 SvCUR_set(TARG, d - (U8*)SvPVX_const(TARG));
3518 if (!SvPADTMP(sv) || SvREADONLY(sv)) {
3520 SvUTF8_off(TARG); /* decontaminate */
3521 sv_setsv_nomg(TARG, sv);
3526 s = (U8*)SvPV_force_nomg(sv, len);
3528 register const U8 * const send = s + len;
3530 if (IN_LOCALE_RUNTIME) {
3533 for (; s < send; s++)
3534 *s = toLOWER_LC(*s);
3537 for (; s < send; s++)
3549 SV * const sv = TOPs;
3551 register const char *s = SvPV_const(sv,len);
3553 SvUTF8_off(TARG); /* decontaminate */
3556 SvUPGRADE(TARG, SVt_PV);
3557 SvGROW(TARG, (len * 2) + 1);
3561 if (UTF8_IS_CONTINUED(*s)) {
3562 STRLEN ulen = UTF8SKIP(s);
3586 SvCUR_set(TARG, d - SvPVX_const(TARG));
3587 (void)SvPOK_only_UTF8(TARG);
3590 sv_setpvn(TARG, s, len);
3592 if (SvSMAGICAL(TARG))
3601 dVAR; dSP; dMARK; dORIGMARK;
3602 register AV* const av = (AV*)POPs;
3603 register const I32 lval = (PL_op->op_flags & OPf_MOD || LVRET);
3605 if (SvTYPE(av) == SVt_PVAV) {
3606 const I32 arybase = PL_curcop->cop_arybase;
3607 if (lval && PL_op->op_private & OPpLVAL_INTRO) {
3610 for (svp = MARK + 1; svp <= SP; svp++) {
3611 const I32 elem = SvIVx(*svp);
3615 if (max > AvMAX(av))
3618 while (++MARK <= SP) {
3620 I32 elem = SvIVx(*MARK);
3624 svp = av_fetch(av, elem, lval);
3626 if (!svp || *svp == &PL_sv_undef)
3627 DIE(aTHX_ PL_no_aelem, elem);
3628 if (PL_op->op_private & OPpLVAL_INTRO)
3629 save_aelem(av, elem, svp);
3631 *MARK = svp ? *svp : &PL_sv_undef;
3634 if (GIMME != G_ARRAY) {
3636 *++MARK = SP > ORIGMARK ? *SP : &PL_sv_undef;
3642 /* Associative arrays. */
3648 HV * const hash = (HV*)POPs;
3650 const I32 gimme = GIMME_V;
3653 /* might clobber stack_sp */
3654 entry = hv_iternext(hash);
3659 SV* const sv = hv_iterkeysv(entry);
3660 PUSHs(sv); /* won't clobber stack_sp */
3661 if (gimme == G_ARRAY) {
3664 /* might clobber stack_sp */
3665 val = hv_iterval(hash, entry);
3670 else if (gimme == G_SCALAR)
3680 const I32 gimme = GIMME_V;
3681 const I32 discard = (gimme == G_VOID) ? G_DISCARD : 0;
3683 if (PL_op->op_private & OPpSLICE) {
3685 HV * const hv = (HV*)POPs;
3686 const U32 hvtype = SvTYPE(hv);
3687 if (hvtype == SVt_PVHV) { /* hash element */
3688 while (++MARK <= SP) {
3689 SV * const sv = hv_delete_ent(hv, *MARK, discard, 0);
3690 *MARK = sv ? sv : &PL_sv_undef;
3693 else if (hvtype == SVt_PVAV) { /* array element */
3694 if (PL_op->op_flags & OPf_SPECIAL) {
3695 while (++MARK <= SP) {
3696 SV * const sv = av_delete((AV*)hv, SvIV(*MARK), discard);
3697 *MARK = sv ? sv : &PL_sv_undef;
3702 DIE(aTHX_ "Not a HASH reference");
3705 else if (gimme == G_SCALAR) {
3710 *++MARK = &PL_sv_undef;
3716 HV * const hv = (HV*)POPs;
3718 if (SvTYPE(hv) == SVt_PVHV)
3719 sv = hv_delete_ent(hv, keysv, discard, 0);
3720 else if (SvTYPE(hv) == SVt_PVAV) {
3721 if (PL_op->op_flags & OPf_SPECIAL)
3722 sv = av_delete((AV*)hv, SvIV(keysv), discard);
3724 DIE(aTHX_ "panic: avhv_delete no longer supported");
3727 DIE(aTHX_ "Not a HASH reference");
3743 if (PL_op->op_private & OPpEXISTS_SUB) {
3745 SV * const sv = POPs;
3746 CV * const cv = sv_2cv(sv, &hv, &gv, 0);
3749 if (gv && isGV(gv) && GvCV(gv) && !GvCVGEN(gv))
3755 if (SvTYPE(hv) == SVt_PVHV) {
3756 if (hv_exists_ent(hv, tmpsv, 0))
3759 else if (SvTYPE(hv) == SVt_PVAV) {
3760 if (PL_op->op_flags & OPf_SPECIAL) { /* array element */
3761 if (av_exists((AV*)hv, SvIV(tmpsv)))
3766 DIE(aTHX_ "Not a HASH reference");
3773 dVAR; dSP; dMARK; dORIGMARK;
3774 register HV * const hv = (HV*)POPs;
3775 register const I32 lval = (PL_op->op_flags & OPf_MOD || LVRET);
3776 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
3777 bool other_magic = FALSE;
3783 other_magic = mg_find((SV*)hv, PERL_MAGIC_env) ||
3784 ((mg = mg_find((SV*)hv, PERL_MAGIC_tied))
3785 /* Try to preserve the existenceness of a tied hash
3786 * element by using EXISTS and DELETE if possible.
3787 * Fallback to FETCH and STORE otherwise */
3788 && (stash = SvSTASH(SvRV(SvTIED_obj((SV*)hv, mg))))
3789 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE)
3790 && gv_fetchmethod_autoload(stash, "DELETE", TRUE));
3793 while (++MARK <= SP) {
3794 SV * const keysv = *MARK;
3797 bool preeminent = FALSE;
3800 preeminent = SvRMAGICAL(hv) && !other_magic ? 1 :
3801 hv_exists_ent(hv, keysv, 0);
3804 he = hv_fetch_ent(hv, keysv, lval, 0);
3805 svp = he ? &HeVAL(he) : 0;
3808 if (!svp || *svp == &PL_sv_undef) {
3809 DIE(aTHX_ PL_no_helem_sv, keysv);
3813 save_helem(hv, keysv, svp);
3816 const char *key = SvPV_const(keysv, keylen);
3817 SAVEDELETE(hv, savepvn(key,keylen), keylen);
3821 *MARK = svp ? *svp : &PL_sv_undef;
3823 if (GIMME != G_ARRAY) {
3825 *++MARK = SP > ORIGMARK ? *SP : &PL_sv_undef;
3831 /* List operators. */
3836 if (GIMME != G_ARRAY) {
3838 *MARK = *SP; /* unwanted list, return last item */
3840 *MARK = &PL_sv_undef;
3850 SV ** const lastrelem = PL_stack_sp;
3851 SV ** const lastlelem = PL_stack_base + POPMARK;
3852 SV ** const firstlelem = PL_stack_base + POPMARK + 1;
3853 register SV ** const firstrelem = lastlelem + 1;
3854 const I32 arybase = PL_curcop->cop_arybase;
3855 I32 is_something_there = PL_op->op_flags & OPf_MOD;
3857 register const I32 max = lastrelem - lastlelem;
3858 register SV **lelem;
3860 if (GIMME != G_ARRAY) {
3861 I32 ix = SvIVx(*lastlelem);
3866 if (ix < 0 || ix >= max)
3867 *firstlelem = &PL_sv_undef;
3869 *firstlelem = firstrelem[ix];
3875 SP = firstlelem - 1;
3879 for (lelem = firstlelem; lelem <= lastlelem; lelem++) {
3880 I32 ix = SvIVx(*lelem);
3885 if (ix < 0 || ix >= max)
3886 *lelem = &PL_sv_undef;
3888 is_something_there = TRUE;
3889 if (!(*lelem = firstrelem[ix]))
3890 *lelem = &PL_sv_undef;
3893 if (is_something_there)
3896 SP = firstlelem - 1;
3902 dVAR; dSP; dMARK; dORIGMARK;
3903 const I32 items = SP - MARK;
3904 SV * const av = sv_2mortal((SV*)av_make(items, MARK+1));
3905 SP = ORIGMARK; /* av_make() might realloc stack_sp */
3912 dVAR; dSP; dMARK; dORIGMARK;
3913 HV* const hv = (HV*)sv_2mortal((SV*)newHV());
3916 SV * const key = *++MARK;
3917 SV * const val = newSV(0);
3919 sv_setsv(val, *++MARK);
3920 else if (ckWARN(WARN_MISC))
3921 Perl_warner(aTHX_ packWARN(WARN_MISC), "Odd number of elements in anonymous hash");
3922 (void)hv_store_ent(hv,key,val,0);
3931 dVAR; dSP; dMARK; dORIGMARK;
3932 register AV *ary = (AV*)*++MARK;
3936 register I32 offset;
3937 register I32 length;
3941 SV **tmparyval = NULL;
3942 const MAGIC * const mg = SvTIED_mg((SV*)ary, PERL_MAGIC_tied);
3945 *MARK-- = SvTIED_obj((SV*)ary, mg);
3949 call_method("SPLICE",GIMME_V);
3958 offset = i = SvIVx(*MARK);
3960 offset += AvFILLp(ary) + 1;
3962 offset -= PL_curcop->cop_arybase;
3964 DIE(aTHX_ PL_no_aelem, i);
3966 length = SvIVx(*MARK++);
3968 length += AvFILLp(ary) - offset + 1;
3974 length = AvMAX(ary) + 1; /* close enough to infinity */
3978 length = AvMAX(ary) + 1;
3980 if (offset > AvFILLp(ary) + 1) {
3981 if (ckWARN(WARN_MISC))
3982 Perl_warner(aTHX_ packWARN(WARN_MISC), "splice() offset past end of array" );
3983 offset = AvFILLp(ary) + 1;
3985 after = AvFILLp(ary) + 1 - (offset + length);
3986 if (after < 0) { /* not that much array */
3987 length += after; /* offset+length now in array */
3993 /* At this point, MARK .. SP-1 is our new LIST */
3996 diff = newlen - length;
3997 if (newlen && !AvREAL(ary) && AvREIFY(ary))
4000 /* make new elements SVs now: avoid problems if they're from the array */
4001 for (dst = MARK, i = newlen; i; i--) {
4002 SV * const h = *dst;
4003 *dst++ = newSVsv(h);
4006 if (diff < 0) { /* shrinking the area */
4008 Newx(tmparyval, newlen, SV*); /* so remember insertion */
4009 Copy(MARK, tmparyval, newlen, SV*);
4012 MARK = ORIGMARK + 1;
4013 if (GIMME == G_ARRAY) { /* copy return vals to stack */
4014 MEXTEND(MARK, length);
4015 Copy(AvARRAY(ary)+offset, MARK, length, SV*);
4017 EXTEND_MORTAL(length);
4018 for (i = length, dst = MARK; i; i--) {
4019 sv_2mortal(*dst); /* free them eventualy */
4026 *MARK = AvARRAY(ary)[offset+length-1];
4029 for (i = length - 1, dst = &AvARRAY(ary)[offset]; i > 0; i--)
4030 SvREFCNT_dec(*dst++); /* free them now */
4033 AvFILLp(ary) += diff;
4035 /* pull up or down? */
4037 if (offset < after) { /* easier to pull up */
4038 if (offset) { /* esp. if nothing to pull */
4039 src = &AvARRAY(ary)[offset-1];
4040 dst = src - diff; /* diff is negative */
4041 for (i = offset; i > 0; i--) /* can't trust Copy */
4045 SvPV_set(ary, (char*)(AvARRAY(ary) - diff)); /* diff is negative */
4049 if (after) { /* anything to pull down? */
4050 src = AvARRAY(ary) + offset + length;
4051 dst = src + diff; /* diff is negative */
4052 Move(src, dst, after, SV*);
4054 dst = &AvARRAY(ary)[AvFILLp(ary)+1];
4055 /* avoid later double free */
4059 dst[--i] = &PL_sv_undef;
4062 Copy( tmparyval, AvARRAY(ary) + offset, newlen, SV* );
4063 Safefree(tmparyval);
4066 else { /* no, expanding (or same) */
4068 Newx(tmparyval, length, SV*); /* so remember deletion */
4069 Copy(AvARRAY(ary)+offset, tmparyval, length, SV*);
4072 if (diff > 0) { /* expanding */
4074 /* push up or down? */
4076 if (offset < after && diff <= AvARRAY(ary) - AvALLOC(ary)) {
4080 Move(src, dst, offset, SV*);
4082 SvPV_set(ary, (char*)(AvARRAY(ary) - diff));/* diff is positive */
4084 AvFILLp(ary) += diff;
4087 if (AvFILLp(ary) + diff >= AvMAX(ary)) /* oh, well */
4088 av_extend(ary, AvFILLp(ary) + diff);
4089 AvFILLp(ary) += diff;
4092 dst = AvARRAY(ary) + AvFILLp(ary);
4094 for (i = after; i; i--) {
4102 Copy( MARK, AvARRAY(ary) + offset, newlen, SV* );
4105 MARK = ORIGMARK + 1;
4106 if (GIMME == G_ARRAY) { /* copy return vals to stack */
4108 Copy(tmparyval, MARK, length, SV*);
4110 EXTEND_MORTAL(length);
4111 for (i = length, dst = MARK; i; i--) {
4112 sv_2mortal(*dst); /* free them eventualy */
4116 Safefree(tmparyval);
4120 else if (length--) {
4121 *MARK = tmparyval[length];
4124 while (length-- > 0)
4125 SvREFCNT_dec(tmparyval[length]);
4127 Safefree(tmparyval);
4130 *MARK = &PL_sv_undef;
4138 dVAR; dSP; dMARK; dORIGMARK; dTARGET;
4139 register AV *ary = (AV*)*++MARK;
4140 const MAGIC * const mg = SvTIED_mg((SV*)ary, PERL_MAGIC_tied);
4143 *MARK-- = SvTIED_obj((SV*)ary, mg);
4147 call_method("PUSH",G_SCALAR|G_DISCARD);
4151 PUSHi( AvFILL(ary) + 1 );
4154 for (++MARK; MARK <= SP; MARK++) {
4155 SV * const sv = newSV(0);
4157 sv_setsv(sv, *MARK);
4158 av_store(ary, AvFILLp(ary)+1, sv);
4161 PUSHi( AvFILLp(ary) + 1 );
4170 AV * const av = (AV*)POPs;
4171 SV * const sv = PL_op->op_type == OP_SHIFT ? av_shift(av) : av_pop(av);
4175 (void)sv_2mortal(sv);
4182 dVAR; dSP; dMARK; dORIGMARK; dTARGET;
4183 register AV *ary = (AV*)*++MARK;
4184 const MAGIC * const mg = SvTIED_mg((SV*)ary, PERL_MAGIC_tied);
4187 *MARK-- = SvTIED_obj((SV*)ary, mg);
4191 call_method("UNSHIFT",G_SCALAR|G_DISCARD);
4197 av_unshift(ary, SP - MARK);
4199 SV * const sv = newSVsv(*++MARK);
4200 (void)av_store(ary, i++, sv);
4204 PUSHi( AvFILL(ary) + 1 );
4211 SV ** const oldsp = SP;
4213 if (GIMME == G_ARRAY) {
4216 register SV * const tmp = *MARK;
4220 /* safe as long as stack cannot get extended in the above */
4225 register char *down;
4231 SvUTF8_off(TARG); /* decontaminate */
4233 do_join(TARG, &PL_sv_no, MARK, SP);
4235 sv_setsv(TARG, (SP > MARK)
4237 : (padoff_du = find_rundefsvoffset(),
4238 (padoff_du == NOT_IN_PAD || PAD_COMPNAME_FLAGS(padoff_du) & SVpad_OUR)
4239 ? DEFSV : PAD_SVl(padoff_du)));
4240 up = SvPV_force(TARG, len);
4242 if (DO_UTF8(TARG)) { /* first reverse each character */
4243 U8* s = (U8*)SvPVX(TARG);
4244 const U8* send = (U8*)(s + len);
4246 if (UTF8_IS_INVARIANT(*s)) {
4251 if (!utf8_to_uvchr(s, 0))
4255 down = (char*)(s - 1);
4256 /* reverse this character */
4260 *down-- = (char)tmp;
4266 down = SvPVX(TARG) + len - 1;
4270 *down-- = (char)tmp;
4272 (void)SvPOK_only_UTF8(TARG);
4284 register IV limit = POPi; /* note, negative is forever */
4285 SV * const sv = POPs;
4287 register const char *s = SvPV_const(sv, len);
4288 const bool do_utf8 = DO_UTF8(sv);
4289 const char *strend = s + len;
4291 register REGEXP *rx;
4293 register const char *m;
4295 const STRLEN slen = do_utf8 ? utf8_length((U8*)s, (U8*)strend) : (strend - s);
4296 I32 maxiters = slen + 10;
4298 const I32 origlimit = limit;
4301 const I32 gimme = GIMME_V;
4302 const I32 oldsave = PL_savestack_ix;
4303 I32 make_mortal = 1;
4305 MAGIC *mg = (MAGIC *) NULL;
4308 Copy(&LvTARGOFF(POPs), &pm, 1, PMOP*);
4313 DIE(aTHX_ "panic: pp_split");
4316 TAINT_IF((pm->op_pmflags & PMf_LOCALE) &&
4317 (pm->op_pmflags & (PMf_WHITE | PMf_SKIPWHITE)));
4319 RX_MATCH_UTF8_set(rx, do_utf8);
4321 if (pm->op_pmreplroot) {
4323 ary = GvAVn((GV*)PAD_SVl(INT2PTR(PADOFFSET, pm->op_pmreplroot)));
4325 ary = GvAVn((GV*)pm->op_pmreplroot);
4328 else if (gimme != G_ARRAY)
4329 ary = GvAVn(PL_defgv);
4332 if (ary && (gimme != G_ARRAY || (pm->op_pmflags & PMf_ONCE))) {
4338 if ((mg = SvTIED_mg((SV*)ary, PERL_MAGIC_tied))) {
4340 XPUSHs(SvTIED_obj((SV*)ary, mg));
4347 for (i = AvFILLp(ary); i >= 0; i--)
4348 AvARRAY(ary)[i] = &PL_sv_undef; /* don't free mere refs */
4350 /* temporarily switch stacks */
4351 SAVESWITCHSTACK(PL_curstack, ary);
4355 base = SP - PL_stack_base;
4357 if (pm->op_pmflags & PMf_SKIPWHITE) {
4358 if (pm->op_pmflags & PMf_LOCALE) {
4359 while (isSPACE_LC(*s))
4367 if (pm->op_pmflags & PMf_MULTILINE) {
4372 limit = maxiters + 2;
4373 if (pm->op_pmflags & PMf_WHITE) {
4376 while (m < strend &&
4377 !((pm->op_pmflags & PMf_LOCALE)
4378 ? isSPACE_LC(*m) : isSPACE(*m)))
4383 dstr = newSVpvn(s, m-s);
4387 (void)SvUTF8_on(dstr);
4391 while (s < strend &&
4392 ((pm->op_pmflags & PMf_LOCALE)
4393 ? isSPACE_LC(*s) : isSPACE(*s)))
4397 else if (rx->precomp[0] == '^' && rx->precomp[1] == '\0') {
4399 for (m = s; m < strend && *m != '\n'; m++)
4404 dstr = newSVpvn(s, m-s);
4408 (void)SvUTF8_on(dstr);
4413 else if (do_utf8 == ((rx->reganch & ROPT_UTF8) != 0) &&
4414 (rx->reganch & RE_USE_INTUIT) && !rx->nparens
4415 && (rx->reganch & ROPT_CHECK_ALL)
4416 && !(rx->reganch & ROPT_ANCH)) {
4417 const int tail = (rx->reganch & RE_INTUIT_TAIL);
4418 SV * const csv = CALLREG_INTUIT_STRING(aTHX_ rx);
4421 if (len == 1 && !(rx->reganch & ROPT_UTF8) && !tail) {
4422 const char c = *SvPV_nolen_const(csv);
4424 for (m = s; m < strend && *m != c; m++)
4428 dstr = newSVpvn(s, m-s);
4432 (void)SvUTF8_on(dstr);
4434 /* The rx->minlen is in characters but we want to step
4435 * s ahead by bytes. */
4437 s = (char*)utf8_hop((U8*)m, len);
4439 s = m + len; /* Fake \n at the end */
4443 while (s < strend && --limit &&
4444 (m = fbm_instr((unsigned char*)s, (unsigned char*)strend,
4445 csv, multiline ? FBMrf_MULTILINE : 0)) )
4447 dstr = newSVpvn(s, m-s);
4451 (void)SvUTF8_on(dstr);
4453 /* The rx->minlen is in characters but we want to step
4454 * s ahead by bytes. */
4456 s = (char*)utf8_hop((U8*)m, len);
4458 s = m + len; /* Fake \n at the end */
4463 maxiters += slen * rx->nparens;
4464 while (s < strend && --limit)
4468 rex_return = CALLREGEXEC(aTHX_ rx, (char*)s, (char*)strend, (char*)orig, 1 ,
4471 if (rex_return == 0)
4473 TAINT_IF(RX_MATCH_TAINTED(rx));
4474 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
4479 strend = s + (strend - m);
4481 m = rx->startp[0] + orig;
4482 dstr = newSVpvn(s, m-s);
4486 (void)SvUTF8_on(dstr);
4490 for (i = 1; i <= (I32)rx->nparens; i++) {
4491 s = rx->startp[i] + orig;
4492 m = rx->endp[i] + orig;
4494 /* japhy (07/27/01) -- the (m && s) test doesn't catch
4495 parens that didn't match -- they should be set to
4496 undef, not the empty string */
4497 if (m >= orig && s >= orig) {
4498 dstr = newSVpvn(s, m-s);
4501 dstr = &PL_sv_undef; /* undef, not "" */
4505 (void)SvUTF8_on(dstr);
4509 s = rx->endp[0] + orig;
4513 iters = (SP - PL_stack_base) - base;
4514 if (iters > maxiters)
4515 DIE(aTHX_ "Split loop");
4517 /* keep field after final delim? */
4518 if (s < strend || (iters && origlimit)) {
4519 const STRLEN l = strend - s;
4520 dstr = newSVpvn(s, l);
4524 (void)SvUTF8_on(dstr);
4528 else if (!origlimit) {
4529 while (iters > 0 && (!TOPs || !SvANY(TOPs) || SvCUR(TOPs) == 0)) {
4530 if (TOPs && !make_mortal)
4533 *SP-- = &PL_sv_undef;
4538 LEAVE_SCOPE(oldsave); /* may undo an earlier SWITCHSTACK */
4542 if (SvSMAGICAL(ary)) {
4547 if (gimme == G_ARRAY) {
4549 Copy(AvARRAY(ary), SP + 1, iters, SV*);
4557 call_method("PUSH",G_SCALAR|G_DISCARD);
4560 if (gimme == G_ARRAY) {
4562 /* EXTEND should not be needed - we just popped them */
4564 for (i=0; i < iters; i++) {
4565 SV **svp = av_fetch(ary, i, FALSE);
4566 PUSHs((svp) ? *svp : &PL_sv_undef);
4573 if (gimme == G_ARRAY)
4589 if (SvTYPE(retsv) == SVt_PVAV || SvTYPE(retsv) == SVt_PVHV
4590 || SvTYPE(retsv) == SVt_PVCV) {
4591 retsv = refto(retsv);
4598 PP(unimplemented_op)
4601 DIE(aTHX_ "panic: unimplemented op %s (#%d) called", OP_NAME(PL_op),
4607 * c-indentation-style: bsd
4609 * indent-tabs-mode: t
4612 * ex: set ts=8 sts=4 sw=4 noet: